From b8cf34c691623e4ec329053cbbf68522a855882d Mon Sep 17 00:00:00 2001 From: DongHun Kwak Date: Thu, 5 Dec 2019 15:12:59 +0900 Subject: Imported Upstream version 1.67.0 --- doc/html/BOOST_CB_ASSER_idp14364704.html | 50 - doc/html/BOOST_CB_ASSER_idp33239264.html | 50 + doc/html/BOOST_CB_IS_CONVERTIBLE.html | 6 +- doc/html/BOOST_DLL_ALIAS.html | 2 +- doc/html/BOOST_DLL_ALIAS_SECTIONED.html | 2 +- doc/html/BOOST_DLL_AUTO_ALIAS.html | 2 +- doc/html/BOOST_DLL_FORC_idp27662112.html | 54 - doc/html/BOOST_DLL_FORC_idp27664016.html | 54 - doc/html/BOOST_DLL_FORC_idp36961376.html | 54 + doc/html/BOOST_DLL_FORC_idp36963232.html | 54 + doc/html/BOOST_DLL_SECTION.html | 2 +- doc/html/BOOST_DLL_SELECTANY.html | 8 +- doc/html/BOOST_INTRUSIV_idp55099840.html | 73 - doc/html/BOOST_INTRUSIV_idp55106064.html | 73 - doc/html/BOOST_INTRUSIV_idp55880560.html | 73 + doc/html/BOOST_INTRUSIV_idp55886784.html | 73 + doc/html/BOOST_IS_MPI_DATATYPE.html | 10 +- doc/html/BOOST_MPI_BCA_1_3_26_6_6_7.html | 56 - doc/html/BOOST_MPI_CAL_1_3_26_6_6_6.html | 56 - doc/html/BOOST_MPI_CHECK_RESULT.html | 10 +- doc/html/BOOST_MPI_DECL.html | 10 +- doc/html/BOOST_MPI_HAS_1_3_26_6_6_4.html | 56 - doc/html/BOOST_MPI_HAS_1_3_26_6_6_5.html | 56 - doc/html/BOOST_MPI_HOMOGENEOUS.html | 12 +- doc/html/BOOST_MPI__1_3_26_5_14_7_4.html | 56 + doc/html/BOOST_MPI__1_3_26_5_14_7_5.html | 56 + doc/html/BOOST_MPI__1_3_26_5_14_7_6.html | 56 + doc/html/BOOST_MPI__1_3_26_5_14_7_7.html | 56 + doc/html/BOOST_SER_1_3_12_15_5_16_1.html | 53 - doc/html/BOOST_SER_1_3_13_15_5_16_1.html | 53 + doc/html/BOOST_TYPE_ERASURE_FREE.html | 25 +- doc/html/BOOST_TYPE_ERASURE_MEMBER.html | 43 +- doc/html/MPICH_IGNORE_CXX_SEEK.html | 10 +- doc/html/accumulators.html | 2 +- doc/html/align.html | 2 +- doc/html/asio_HTML.manifest | 30 + doc/html/atomic.html | 4 +- doc/html/atomic/interface.html | 708 ++- doc/html/atomic/limitations.html | 77 +- doc/html/atomic/porting.html | 2 +- doc/html/atomic/thread_coordination.html | 2 +- doc/html/atomic/usage_examples.html | 2 +- doc/html/bbv2/overview.html | 26 +- doc/html/bbv2/reference.html | 144 +- doc/html/boost/CV/constrained_value.html | 46 +- doc/html/boost/CV/simple_exception_policy.html | 24 +- .../simple_exception_policy/exception_wrapper.html | 18 +- doc/html/boost/bad_function_call.html | 8 +- doc/html/boost/circular_buffe_idp24565232.html | 2828 ------------ doc/html/boost/circular_buffe_idp43443760.html | 2828 ++++++++++++ doc/html/boost/circular_buffer.html | 568 +-- doc/html/boost/container/adaptive_pool.html | 127 +- doc/html/boost/container/adaptive_pool/rebind.html | 11 +- doc/html/boost/container/allocator.html | 117 +- doc/html/boost/container/allocator/rebind.html | 11 +- doc/html/boost/container/allocator_arg.html | 5 +- doc/html/boost/container/allocator_arg_t.html | 5 +- doc/html/boost/container/allocator_traits.html | 61 +- .../allocator_traits/portable_rebind_alloc.html | 11 +- doc/html/boost/container/basic_string.html | 663 +-- .../container/constructible__idp60397280.html | 67 + .../container/constructible__idp60406672.html | 69 + .../container/constructible__idp67492240.html | 66 - .../container/constructible__idp67501632.html | 68 - doc/html/boost/container/default_init.html | 5 +- doc/html/boost/container/default_init_t.html | 11 +- doc/html/boost/container/deque.html | 345 +- doc/html/boost/container/erased_type.html | 5 +- doc/html/boost/container/flat_map.html | 449 +- doc/html/boost/container/flat_multimap.html | 401 +- doc/html/boost/container/flat_multiset.html | 389 +- doc/html/boost/container/flat_set.html | 389 +- doc/html/boost/container/growth_factor.html | 72 + doc/html/boost/container/growth_factor_100.html | 57 + doc/html/boost/container/growth_factor_50.html | 57 + doc/html/boost/container/growth_factor_60.html | 57 + .../boost/container/insert_return_type_base.html | 23 +- doc/html/boost/container/list.html | 368 +- doc/html/boost/container/map.html | 425 +- doc/html/boost/container/multimap.html | 373 +- doc/html/boost/container/multiset.html | 353 +- doc/html/boost/container/new_allocator.html | 67 +- doc/html/boost/container/new_allocator/rebind.html | 11 +- .../container/new_allocator__idp55809792.html | 118 + .../new_allocator__idp55809792/rebind.html | 60 + .../container/new_allocator__idp62944752.html | 117 - .../new_allocator__idp62944752/rebind.html | 59 - doc/html/boost/container/node_allocator.html | 131 +- .../boost/container/node_allocator/rebind.html | 11 +- doc/html/boost/container/node_handle.html | 93 +- .../boost/container/operator___idp59193360.html | 94 + .../boost/container/operator___idp59203376.html | 94 + .../boost/container/operator___idp59233376.html | 94 + .../boost/container/operator___idp59243360.html | 94 + .../boost/container/operator___idp66288880.html | 93 - .../boost/container/operator___idp66298896.html | 93 - .../boost/container/operator___idp66328896.html | 93 - .../boost/container/operator___idp66338880.html | 93 - doc/html/boost/container/operator_idp59213408.html | 94 + doc/html/boost/container/operator_idp59223392.html | 94 + doc/html/boost/container/operator_idp66308928.html | 93 - doc/html/boost/container/operator_idp66318912.html | 93 - doc/html/boost/container/optimize_size.html | 5 +- doc/html/boost/container/ordered_range.html | 11 +- doc/html/boost/container/ordered_range_t.html | 5 +- doc/html/boost/container/ordered_unique_range.html | 5 +- .../boost/container/ordered_unique_range_t.html | 5 +- doc/html/boost/container/pmr/basic_string_of.html | 5 +- doc/html/boost/container/pmr/deque_of.html | 5 +- doc/html/boost/container/pmr/flat_map_of.html | 8 +- doc/html/boost/container/pmr/flat_multimap_of.html | 8 +- doc/html/boost/container/pmr/flat_multiset_of.html | 8 +- doc/html/boost/container/pmr/flat_set_of.html | 8 +- .../boost/container/pmr/get_default_resource.html | 5 +- doc/html/boost/container/pmr/list_of.html | 5 +- doc/html/boost/container/pmr/map_of.html | 7 +- doc/html/boost/container/pmr/memory_resource.html | 61 +- .../container/pmr/monotonic_buffer_resource.html | 81 +- doc/html/boost/container/pmr/multimap_of.html | 13 +- doc/html/boost/container/pmr/multiset_of.html | 7 +- .../boost/container/pmr/new_delete_resource.html | 11 +- .../boost/container/pmr/null_memory_resource.html | 5 +- doc/html/boost/container/pmr/operator__.html | 5 +- .../boost/container/pmr/polymorphic_allocator.html | 57 +- doc/html/boost/container/pmr/pool_options.html | 11 +- doc/html/boost/container/pmr/resource_adaptor.html | 5 +- .../boost/container/pmr/resource_adaptor_imp.html | 67 +- .../boost/container/pmr/set_default_resource.html | 5 +- doc/html/boost/container/pmr/set_of.html | 7 +- doc/html/boost/container/pmr/slist_of.html | 11 +- doc/html/boost/container/pmr/small_vector_of.html | 5 +- doc/html/boost/container/pmr/stable_vector_of.html | 5 +- .../container/pmr/synchronized_pool_resource.html | 99 +- .../container/pmr/unsynchronized_idp56479344.html | 195 + .../container/pmr/unsynchronized_idp63576512.html | 194 - doc/html/boost/container/pmr/vector_of.html | 5 +- .../boost/container/scoped_allocator_adaptor.html | 131 +- .../container/scoped_allocator_adaptor/rebind.html | 11 +- doc/html/boost/container/set.html | 370 +- doc/html/boost/container/slist.html | 402 +- doc/html/boost/container/small_vector.html | 103 +- .../boost/container/small_vector_allocator.html | 93 +- .../container/small_vector_allocator/rebind.html | 11 +- doc/html/boost/container/small_vector_base.html | 25 +- doc/html/boost/container/stable_vector.html | 329 +- doc/html/boost/container/static_vector.html | 314 +- doc/html/boost/container/stored_size.html | 69 + doc/html/boost/container/string.html | 5 +- doc/html/boost/container/swap_idp59253344.html | 87 + doc/html/boost/container/swap_idp66348864.html | 86 - doc/html/boost/container/throw_bad_alloc.html | 5 +- doc/html/boost/container/throw_length_error.html | 5 +- doc/html/boost/container/throw_logic_error.html | 5 +- doc/html/boost/container/throw_out_of_range.html | 5 +- doc/html/boost/container/throw_runtime_error.html | 11 +- doc/html/boost/container/tree_assoc_defaults.html | 61 - doc/html/boost/container/tree_assoc_options.html | 11 +- doc/html/boost/container/tree_assoc_options_t.html | 56 + doc/html/boost/container/tree_type.html | 5 +- doc/html/boost/container/tree_type_enum.html | 17 +- doc/html/boost/container/uses_allocator.html | 13 +- doc/html/boost/container/vector.html | 360 +- doc/html/boost/container/vector_options.html | 59 + doc/html/boost/container/vector_options_t.html | 56 + doc/html/boost/container/wstring.html | 5 +- doc/html/boost/date_time/acst_dst_trait.html | 44 +- doc/html/boost/date_time/all_date_names_put.html | 76 +- doc/html/boost/date_time/bad_field_count.html | 8 +- doc/html/boost/date_time/base_time.html | 108 +- doc/html/boost/date_time/c_local_adjustor.html | 12 +- doc/html/boost/date_time/c_time.html | 24 +- doc/html/boost/date_time/convert_string_type.html | 2 +- doc/html/boost/date_time/convert_to_lower.html | 2 +- doc/html/boost/date_time/counted_time_rep.html | 68 +- doc/html/boost/date_time/counted_time_system.html | 60 +- doc/html/boost/date_time/data_not_accessible.html | 12 +- doc/html/boost/date_time/date.html | 102 +- doc/html/boost/date_time/date_duration.html | 74 +- doc/html/boost/date_time/date_facet.html | 142 +- doc/html/boost/date_time/date_formatter.html | 16 +- .../boost/date_time/date_generator_formatter.html | 56 +- .../boost/date_time/date_generator_parser.html | 60 +- doc/html/boost/date_time/date_input_facet.html | 130 +- doc/html/boost/date_time/date_itr.html | 22 +- doc/html/boost/date_time/date_itr_base.html | 66 +- doc/html/boost/date_time/date_names_put.html | 120 +- doc/html/boost/date_time/day_calc_dst_rule.html | 30 +- doc/html/boost/date_time/day_clock.html | 38 +- doc/html/boost/date_time/day_functor.html | 22 +- doc/html/boost/date_time/days_before_weekday.html | 2 +- doc/html/boost/date_time/days_until_weekday.html | 2 +- .../boost/date_time/dst_adjustment_offsets.html | 8 +- doc/html/boost/date_time/dst_calc_engine.html | 28 +- doc/html/boost/date_time/dst_calculator.html | 30 +- doc/html/boost/date_time/dst_day_calc_rule.html | 30 +- .../boost/date_time/duration_traits_adapted.html | 12 +- doc/html/boost/date_time/duration_traits_long.html | 12 +- .../date_time/dynam_1_3_12_15_3_30_2_1_2.html | 76 - .../date_time/dynam_1_3_13_15_3_30_2_1_2.html | 76 + doc/html/boost/date_time/eu_dst_trait.html | 44 +- doc/html/boost/date_time/find_match.html | 2 +- doc/html/boost/date_time/first_kday_after.html | 22 +- doc/html/boost/date_time/first_kday_before.html | 22 +- doc/html/boost/date_time/first_kday_of_month.html | 30 +- .../date_time/fixed_1_3_12_15_3_26_2_1_2.html | 57 - .../date_time/fixed_1_3_12_15_3_26_2_1_3.html | 57 - .../date_time/fixed_1_3_13_15_3_26_2_1_2.html | 57 + .../date_time/fixed_1_3_13_15_3_26_2_1_3.html | 57 + doc/html/boost/date_time/format_date_parser.html | 96 +- .../date_time/from__1_3_12_15_3_22_1_1_6.html | 55 - .../date_time/from__1_3_12_15_3_22_1_1_7.html | 55 - .../date_time/from__1_3_12_15_3_22_1_1_8.html | 55 - .../date_time/from__1_3_12_15_3_22_1_1_9.html | 55 - .../date_time/from__1_3_13_15_3_22_1_1_6.html | 55 + .../date_time/from__1_3_13_15_3_22_1_1_7.html | 55 + .../date_time/from__1_3_13_15_3_22_1_1_8.html | 55 + .../date_time/from__1_3_13_15_3_22_1_1_9.html | 55 + doc/html/boost/date_time/gather_month_strings.html | 2 +- .../boost/date_time/gather_weekday_strings.html | 2 +- .../boost/date_time/gregorian_calendar_base.html | 56 +- doc/html/boost/date_time/int_adapter.html | 192 +- doc/html/boost/date_time/iso_extended_format.html | 12 +- .../date_time/iso_f_1_3_12_15_3_29_1_1_2.html | 118 - .../date_time/iso_f_1_3_13_15_3_29_1_1_2.html | 118 + doc/html/boost/date_time/iso_format.html | 18 +- doc/html/boost/date_time/iso_format_base.html | 100 +- doc/html/boost/date_time/last_kday_of_month.html | 30 +- doc/html/boost/date_time/local_adjustor.html | 16 +- doc/html/boost/date_time/microsec_clock.html | 34 +- doc/html/boost/date_time/month_formatter.html | 22 +- doc/html/boost/date_time/month_functor.html | 22 +- doc/html/boost/date_time/months_duration.html | 86 +- doc/html/boost/date_time/next_weekday.html | 2 +- doc/html/boost/date_time/nth_kday_of_month.html | 38 +- doc/html/boost/date_time/null_dst_rules.html | 24 +- .../date_time/opera_1_3_12_15_3_28_1_1_2.html | 57 - .../date_time/opera_1_3_13_15_3_28_1_1_2.html | 57 + .../date_time/ostre_1_3_12_15_3_49_1_1_1.html | 66 - .../date_time/ostre_1_3_12_15_3_49_1_1_3.html | 67 - .../date_time/ostre_1_3_13_15_3_49_1_1_1.html | 66 + .../date_time/ostre_1_3_13_15_3_49_1_1_3.html | 67 + .../boost/date_time/ostream_date_formatter.html | 16 +- .../boost/date_time/ostream_month_formatter.html | 12 +- .../boost/date_time/ostream_time_formatter.html | 22 +- .../boost/date_time/ostream_weekday_formatter.html | 12 +- .../boost/date_time/ostream_ymd_formatter.html | 12 +- .../date_time/parse_1_3_12_15_3_51_1_1_3.html | 55 - .../date_time/parse_1_3_13_15_3_51_1_1_3.html | 55 + doc/html/boost/date_time/parse_date.html | 8 +- doc/html/boost/date_time/parse_match_result.html | 26 +- doc/html/boost/date_time/partial_date.html | 46 +- doc/html/boost/date_time/period.html | 90 +- doc/html/boost/date_time/period_formatter.html | 47 +- doc/html/boost/date_time/period_parser.html | 48 +- doc/html/boost/date_time/previous_weekday.html | 2 +- doc/html/boost/date_time/second_clock.html | 30 +- .../date_time/simpl_1_3_12_15_3_13_1_1_2.html | 97 - .../date_time/simpl_1_3_13_15_3_13_1_1_2.html | 97 + doc/html/boost/date_time/simple_format.html | 66 +- .../boost/date_time/special_values_formatter.html | 26 +- .../boost/date_time/special_values_parser.html | 128 +- .../boost/date_time/split_timedate_system.html | 66 +- .../date_time/static_local_time_adjustor.html | 22 +- .../date_time/str_f_1_3_12_15_3_51_1_1_2.html | 56 - .../date_time/str_f_1_3_13_15_3_51_1_1_2.html | 56 + doc/html/boost/date_time/string_parse_tree.html | 42 +- doc/html/boost/date_time/subsecond_duration.html | 26 +- .../date_time/time__1_3_12_15_3_52_1_1_1.html | 69 - .../date_time/time__1_3_12_15_3_52_1_1_2.html | 69 - .../date_time/time__1_3_12_15_3_52_1_1_3.html | 69 - .../date_time/time__1_3_12_15_3_52_1_1_4.html | 69 - .../date_time/time__1_3_13_15_3_52_1_1_1.html | 69 + .../date_time/time__1_3_13_15_3_52_1_1_2.html | 69 + .../date_time/time__1_3_13_15_3_52_1_1_3.html | 69 + .../date_time/time__1_3_13_15_3_52_1_1_4.html | 69 + doc/html/boost/date_time/time_duration.html | 162 +- doc/html/boost/date_time/time_facet.html | 70 +- doc/html/boost/date_time/time_from_ftime.html | 2 +- doc/html/boost/date_time/time_input_facet.html | 84 +- doc/html/boost/date_time/time_itr.html | 62 +- .../boost/date_time/time_resolution_traits.html | 55 +- doc/html/boost/date_time/time_zone_base.html | 58 +- doc/html/boost/date_time/time_zone_names_base.html | 34 +- doc/html/boost/date_time/tz_db_base.html | 56 +- doc/html/boost/date_time/uk_dst_trait.html | 20 +- doc/html/boost/date_time/us_dst_rules.html | 28 +- doc/html/boost/date_time/us_dst_trait.html | 44 +- doc/html/boost/date_time/utc_adjustment.html | 22 +- doc/html/boost/date_time/var_string_to_int.html | 8 +- doc/html/boost/date_time/week_functor.html | 22 +- doc/html/boost/date_time/weeks_duration.html | 12 +- doc/html/boost/date_time/wrapping_int.html | 50 +- doc/html/boost/date_time/wrapping_int2.html | 54 +- doc/html/boost/date_time/year_based_generator.html | 26 +- doc/html/boost/date_time/year_functor.html | 22 +- doc/html/boost/date_time/year_month_day_base.html | 8 +- doc/html/boost/date_time/ymd_formatter.html | 16 +- doc/html/boost/date_time/ymd_order_spec.html | 2 +- .../boost/dll/experimental/get_idp28753888.html | 89 - .../boost/dll/experimental/get_idp28770608.html | 89 - .../boost/dll/experimental/get_idp38057568.html | 89 + .../boost/dll/experimental/get_idp38074288.html | 89 + .../dll/experimental/import_class_idp28282208.html | 130 - .../dll/experimental/import_class_idp37573920.html | 130 + .../boost/dll/experimental/import_mangled.html | 8 +- .../boost/dll/experimental/imported_class.html | 148 +- doc/html/boost/dll/experimental/smart_library.html | 136 +- doc/html/boost/dll/import.html | 8 +- doc/html/boost/dll/import_alias.html | 2 +- doc/html/boost/dll/library_info.html | 34 +- doc/html/boost/dll/load_mode/type.html | 2 +- doc/html/boost/dll/program_location.html | 2 +- doc/html/boost/dll/shared_library.html | 148 +- doc/html/boost/dll/symbol_location.html | 2 +- doc/html/boost/dll/symbol_location_ptr.html | 2 +- doc/html/boost/dll/this_line_location.html | 2 +- doc/html/boost/function.html | 202 +- doc/html/boost/function/sig.html | 6 +- doc/html/boost/functionN.html | 178 +- doc/html/boost/functionN/sig.html | 6 +- doc/html/boost/function_base.html | 38 +- doc/html/boost/function_equal.html | 2 +- doc/html/boost/graph_t_1_3_26_5_14_12_2_1.html | 79 + doc/html/boost/graph_trai_1_3_26_6_11_2_1.html | 79 - doc/html/boost/gregorian/bad_day_of_month.html | 12 +- doc/html/boost/gregorian/bad_day_of_year.html | 8 +- doc/html/boost/gregorian/bad_month.html | 14 +- doc/html/boost/gregorian/bad_weekday.html | 14 +- doc/html/boost/gregorian/bad_year.html | 8 +- doc/html/boost/gregorian/date.html | 58 +- doc/html/boost/gregorian/date_duration.html | 76 +- doc/html/boost/gregorian/greg_day.html | 22 +- doc/html/boost/gregorian/greg_facet_config.html | 6 +- doc/html/boost/gregorian/greg_month.html | 72 +- doc/html/boost/gregorian/greg_weekday.html | 38 +- doc/html/boost/gregorian/greg_year.html | 22 +- .../gregorian/opera_1_3_12_15_4_11_1_1_3.html | 63 - .../gregorian/opera_1_3_12_15_4_11_1_1_4.html | 55 - .../gregorian/opera_1_3_12_15_4_11_1_1_5.html | 56 - .../gregorian/opera_1_3_12_15_4_11_1_1_6.html | 55 - .../gregorian/opera_1_3_13_15_4_11_1_1_3.html | 63 + .../gregorian/opera_1_3_13_15_4_11_1_1_4.html | 55 + .../gregorian/opera_1_3_13_15_4_11_1_1_5.html | 56 + .../gregorian/opera_1_3_13_15_4_11_1_1_6.html | 55 + .../boost/gregorian/special_value_from_string.html | 2 +- doc/html/boost/gregorian/weeks_duration.html | 12 +- doc/html/boost/gregorian/year_based_generator.html | 2 +- doc/html/boost/hash.html | 24 +- doc/html/boost/hash_T_1_3_11_11_2_2_24.html | 74 + doc/html/boost/hash_T_1_3_16_11_2_2_24.html | 74 - doc/html/boost/hash_bool_1_3_11_11_2_2_2.html | 77 + doc/html/boost/hash_bool_1_3_16_11_2_2_2.html | 77 - doc/html/boost/hash_char1_1_3_11_11_2_2_7.html | 77 + doc/html/boost/hash_char1_1_3_16_11_2_2_7.html | 77 - doc/html/boost/hash_char3_1_3_11_11_2_2_8.html | 77 + doc/html/boost/hash_char3_1_3_16_11_2_2_8.html | 77 - doc/html/boost/hash_char_1_3_11_11_2_2_3.html | 77 + doc/html/boost/hash_char_1_3_16_11_2_2_3.html | 77 - doc/html/boost/hash_doub_1_3_11_11_2_2_18.html | 77 + doc/html/boost/hash_doub_1_3_16_11_2_2_18.html | 77 - doc/html/boost/hash_floa_1_3_11_11_2_2_17.html | 77 + doc/html/boost/hash_floa_1_3_16_11_2_2_17.html | 77 - doc/html/boost/hash_int_1_3_11_11_2_2_11.html | 77 + doc/html/boost/hash_int_1_3_16_11_2_2_11.html | 77 - doc/html/boost/hash_long_1_3_11_11_2_2_13.html | 77 + doc/html/boost/hash_long_1_3_11_11_2_2_15.html | 77 + doc/html/boost/hash_long_1_3_11_11_2_2_19.html | 77 + doc/html/boost/hash_long_1_3_16_11_2_2_13.html | 77 - doc/html/boost/hash_long_1_3_16_11_2_2_15.html | 77 - doc/html/boost/hash_long_1_3_16_11_2_2_19.html | 77 - doc/html/boost/hash_short_1_3_11_11_2_2_9.html | 77 + doc/html/boost/hash_short_1_3_16_11_2_2_9.html | 77 - doc/html/boost/hash_signe_1_3_11_11_2_2_4.html | 77 + doc/html/boost/hash_signe_1_3_16_11_2_2_4.html | 77 - doc/html/boost/hash_std__1_3_11_11_2_2_20.html | 77 + doc/html/boost/hash_std__1_3_11_11_2_2_21.html | 77 + doc/html/boost/hash_std__1_3_11_11_2_2_22.html | 77 + doc/html/boost/hash_std__1_3_11_11_2_2_23.html | 77 + doc/html/boost/hash_std__1_3_11_11_2_2_25.html | 74 + doc/html/boost/hash_std__1_3_16_11_2_2_20.html | 77 - doc/html/boost/hash_std__1_3_16_11_2_2_21.html | 77 - doc/html/boost/hash_std__1_3_16_11_2_2_22.html | 77 - doc/html/boost/hash_std__1_3_16_11_2_2_23.html | 77 - doc/html/boost/hash_std__1_3_16_11_2_2_25.html | 74 - doc/html/boost/hash_unsi_1_3_11_11_2_2_10.html | 77 + doc/html/boost/hash_unsi_1_3_11_11_2_2_12.html | 77 + doc/html/boost/hash_unsi_1_3_11_11_2_2_14.html | 77 + doc/html/boost/hash_unsi_1_3_11_11_2_2_16.html | 77 + doc/html/boost/hash_unsi_1_3_16_11_2_2_10.html | 77 - doc/html/boost/hash_unsi_1_3_16_11_2_2_12.html | 77 - doc/html/boost/hash_unsi_1_3_16_11_2_2_14.html | 77 - doc/html/boost/hash_unsi_1_3_16_11_2_2_16.html | 77 - doc/html/boost/hash_unsig_1_3_11_11_2_2_5.html | 77 + doc/html/boost/hash_unsig_1_3_16_11_2_2_5.html | 77 - doc/html/boost/hash_wchar_1_3_11_11_2_2_6.html | 77 + doc/html/boost/hash_wchar_1_3_16_11_2_2_6.html | 77 - doc/html/boost/heap/skew_heap.html | 220 +- .../heap/skew_heap/implementation_defined.html | 20 +- doc/html/boost/heap/skew_heap/push_handle.html | 75 + doc/html/boost/heap/skew_heap/push_void.html | 74 + doc/html/boost/interprocess/adaptive_pool.html | 100 +- .../boost/interprocess/adaptive_pool/rebind.html | 6 +- doc/html/boost/interprocess/allocator.html | 98 +- doc/html/boost/interprocess/allocator/rebind.html | 6 +- .../interprocess/anonymous_shared_memory.html | 6 +- doc/html/boost/interprocess/bad_alloc.html | 12 +- doc/html/boost/interprocess/basic_bufferbuf.html | 24 +- .../boost/interprocess/basic_bufferstream.html | 28 +- .../boost/interprocess/basic_ibufferstream.html | 28 +- .../boost/interprocess/basic_ivectorstream.html | 32 +- .../interprocess/basic_managed__idp39474400.html | 103 + .../interprocess/basic_managed__idp39582912.html | 156 + .../interprocess/basic_managed__idp39640656.html | 143 + .../interprocess/basic_managed__idp39689376.html | 150 + .../interprocess/basic_managed__idp55379840.html | 103 - .../interprocess/basic_managed__idp55488352.html | 156 - .../interprocess/basic_managed__idp55546096.html | 143 - .../interprocess/basic_managed__idp55594816.html | 150 - .../interprocess/basic_managed_heap_memory.html | 32 +- .../interprocess/basic_managed_mapped_file.html | 60 +- .../boost/interprocess/basic_obufferstream.html | 28 +- .../boost/interprocess/basic_ovectorstream.html | 28 +- doc/html/boost/interprocess/basic_vectorbuf.html | 28 +- .../boost/interprocess/basic_vectorstream.html | 32 +- .../boost/interprocess/cached_adaptive_pool.html | 126 +- .../interprocess/cached_adaptive_pool/rebind.html | 6 +- .../boost/interprocess/cached_node_allocator.html | 126 +- .../interprocess/cached_node_allocator/rebind.html | 6 +- doc/html/boost/interprocess/defer_lock_type.html | 6 +- doc/html/boost/interprocess/deleter.html | 12 +- .../interprocess/enable_shared_from_this.html | 18 +- doc/html/boost/interprocess/file_lock.html | 60 +- doc/html/boost/interprocess/file_mapping.html | 48 +- .../interprocess/fixed_managed__idp39630976.html | 55 + .../interprocess/fixed_managed__idp55536416.html | 55 - doc/html/boost/interprocess/flat_map_index.html | 16 +- .../boost/interprocess/interprocess_condition.html | 36 +- .../interprocess/interprocess_condition_any.html | 36 +- .../boost/interprocess/interprocess_exception.html | 28 +- .../boost/interprocess/interprocess_mutex.html | 34 +- .../interprocess/interprocess_r_idp40896864.html | 104 + .../interprocess/interprocess_r_idp56793568.html | 104 - .../interprocess/interprocess_s_idp40942256.html | 128 + .../interprocess/interprocess_s_idp56838960.html | 128 - .../boost/interprocess/interprocess_semaphore.html | 36 +- .../interprocess/interprocess_u_idp40973072.html | 190 + .../interprocess/interprocess_u_idp56869776.html | 190 - doc/html/boost/interprocess/intrusive_ptr.html | 92 +- doc/html/boost/interprocess/iset_index.html | 28 +- .../boost/interprocess/iunordered_set_index.html | 36 +- doc/html/boost/interprocess/lock_exception.html | 12 +- .../interprocess/make_managed_s_idp40508976.html | 58 + .../interprocess/make_managed_s_idp40513488.html | 59 + .../interprocess/make_managed_s_idp56405680.html | 58 - .../interprocess/make_managed_s_idp56410192.html | 59 - .../interprocess/managed_external_buffer.html | 10 +- .../boost/interprocess/managed_shared_memory.html | 10 +- .../boost/interprocess/managed_shared_ptr.html | 6 +- .../boost/interprocess/managed_unique_ptr.html | 6 +- .../interprocess/managed_window_idp39679728.html | 55 + .../interprocess/managed_window_idp55585168.html | 55 - .../interprocess/managed_xsi_shared_memory.html | 10 +- doc/html/boost/interprocess/map_index.html | 16 +- doc/html/boost/interprocess/mapped_region.html | 60 +- doc/html/boost/interprocess/message_queue.html | 6 +- doc/html/boost/interprocess/message_queue_t.html | 66 +- doc/html/boost/interprocess/mutex_family.html | 2 +- doc/html/boost/interprocess/named_condition.html | 52 +- .../boost/interprocess/named_condition_any.html | 52 +- doc/html/boost/interprocess/named_mutex.html | 44 +- .../boost/interprocess/named_recursive_mutex.html | 44 +- doc/html/boost/interprocess/named_semaphore.html | 44 +- .../boost/interprocess/named_sharable_mutex.html | 60 +- .../boost/interprocess/named_upgradable_mutex.html | 108 +- doc/html/boost/interprocess/node_allocator.html | 114 +- .../boost/interprocess/node_allocator/rebind.html | 6 +- doc/html/boost/interprocess/null_index.html | 24 +- doc/html/boost/interprocess/null_mutex.html | 92 +- doc/html/boost/interprocess/offset_ptr.html | 158 +- .../boost/interprocess/operator___idp38496176.html | 58 + .../boost/interprocess/operator___idp38504448.html | 58 + .../boost/interprocess/operator___idp38584608.html | 57 + .../boost/interprocess/operator___idp38589584.html | 57 + .../boost/interprocess/operator___idp38691552.html | 58 + .../boost/interprocess/operator___idp38699840.html | 58 + .../boost/interprocess/operator___idp38798784.html | 57 + .../boost/interprocess/operator___idp38805344.html | 57 + .../boost/interprocess/operator___idp38898704.html | 57 + .../boost/interprocess/operator___idp38905248.html | 57 + .../boost/interprocess/operator___idp39004656.html | 58 + .../boost/interprocess/operator___idp39012944.html | 58 + .../boost/interprocess/operator___idp39109776.html | 58 + .../boost/interprocess/operator___idp39118064.html | 58 + .../boost/interprocess/operator___idp40278064.html | 57 + .../boost/interprocess/operator___idp40283280.html | 57 + .../boost/interprocess/operator___idp40288496.html | 57 + .../boost/interprocess/operator___idp40293296.html | 57 + .../boost/interprocess/operator___idp40298096.html | 57 + .../boost/interprocess/operator___idp40302896.html | 57 + .../boost/interprocess/operator___idp54401248.html | 58 - .../boost/interprocess/operator___idp54409520.html | 58 - .../boost/interprocess/operator___idp54489968.html | 57 - .../boost/interprocess/operator___idp54494944.html | 57 - .../boost/interprocess/operator___idp54596912.html | 58 - .../boost/interprocess/operator___idp54605200.html | 58 - .../boost/interprocess/operator___idp54704144.html | 57 - .../boost/interprocess/operator___idp54710704.html | 57 - .../boost/interprocess/operator___idp54804064.html | 57 - .../boost/interprocess/operator___idp54810608.html | 57 - .../boost/interprocess/operator___idp54910016.html | 58 - .../boost/interprocess/operator___idp54918304.html | 58 - .../boost/interprocess/operator___idp55015136.html | 58 - .../boost/interprocess/operator___idp55023424.html | 58 - .../boost/interprocess/operator___idp56174768.html | 57 - .../boost/interprocess/operator___idp56179984.html | 57 - .../boost/interprocess/operator___idp56185200.html | 57 - .../boost/interprocess/operator___idp56190000.html | 57 - .../boost/interprocess/operator___idp56194800.html | 57 - .../boost/interprocess/operator___idp56199600.html | 57 - .../boost/interprocess/operator_idp39971568.html | 59 + .../boost/interprocess/operator_idp39978480.html | 58 + .../boost/interprocess/operator_idp40307696.html | 57 + .../boost/interprocess/operator_idp55877088.html | 59 - .../boost/interprocess/operator_idp55884000.html | 58 - .../boost/interprocess/operator_idp56204400.html | 57 - doc/html/boost/interprocess/permissions.html | 34 +- .../boost/interprocess/private_adaptive_pool.html | 118 +- .../interprocess/private_adaptive_pool/rebind.html | 6 +- .../boost/interprocess/private_node_allocator.html | 118 +- .../private_node_allocator/rebind.html | 6 +- doc/html/boost/interprocess/rbtree_best_fit.html | 74 +- doc/html/boost/interprocess/scoped_lock.html | 92 +- doc/html/boost/interprocess/scoped_ptr.html | 64 +- doc/html/boost/interprocess/segment_manager.html | 128 +- .../boost/interprocess/segment_manager_base.html | 68 +- doc/html/boost/interprocess/sharable_lock.html | 84 +- .../boost/interprocess/shared_memory_object.html | 64 +- doc/html/boost/interprocess/shared_ptr.html | 84 +- doc/html/boost/interprocess/simple_seq_fit.html | 4 +- doc/html/boost/interprocess/swap_idp40312352.html | 56 + doc/html/boost/interprocess/swap_idp40362672.html | 56 + doc/html/boost/interprocess/swap_idp56209056.html | 56 - doc/html/boost/interprocess/swap_idp56259376.html | 56 - .../interprocess/to_raw_pointer_idp40322096.html | 57 + .../interprocess/to_raw_pointer_idp40368064.html | 56 + .../interprocess/to_raw_pointer_idp56218800.html | 57 - .../interprocess/to_raw_pointer_idp56264768.html | 56 - .../boost/interprocess/unordered_map_index.html | 16 +- doc/html/boost/interprocess/upgradable_lock.html | 84 +- doc/html/boost/interprocess/weak_ptr.html | 44 +- .../interprocess/wfixed_managed_idp39634704.html | 55 + .../interprocess/wfixed_managed_idp55540144.html | 55 - .../boost/interprocess/windows_shared_memory.html | 52 +- .../interprocess/wmanaged_external_buffer.html | 4 +- .../boost/interprocess/wmanaged_mapped_file.html | 6 +- .../boost/interprocess/wmanaged_shared_memory.html | 10 +- .../interprocess/wmanaged_windo_idp39683440.html | 55 + .../interprocess/wmanaged_windo_idp55588880.html | 55 - .../interprocess/wmanaged_xsi_shared_memory.html | 4 +- doc/html/boost/interprocess/xsi_key.html | 20 +- doc/html/boost/interprocess/xsi_shared_memory.html | 56 +- doc/html/boost/intrusive/any_base_hook.html | 24 +- doc/html/boost/intrusive/any_member_hook.html | 24 +- doc/html/boost/intrusive/avl_multiset.html | 328 +- doc/html/boost/intrusive/avl_set.html | 348 +- doc/html/boost/intrusive/avl_set_base_hook.html | 32 +- doc/html/boost/intrusive/avl_set_member_hook.html | 32 +- doc/html/boost/intrusive/avltree.html | 360 +- doc/html/boost/intrusive/avltree_algorithms.html | 152 +- doc/html/boost/intrusive/bs_multiset.html | 328 +- doc/html/boost/intrusive/bs_set.html | 348 +- doc/html/boost/intrusive/bs_set_base_hook.html | 32 +- doc/html/boost/intrusive/bs_set_member_hook.html | 32 +- doc/html/boost/intrusive/bstree.html | 384 +- doc/html/boost/intrusive/bstree_algorithms.html | 304 +- .../boost/intrusive/circular_list_algorithms.html | 84 +- .../boost/intrusive/circular_slist_algorithms.html | 80 +- .../boost/intrusive/derivation_value_traits.html | 20 +- .../intrusive/get_parent_fro_idp55114128.html | 57 - .../intrusive/get_parent_fro_idp55118400.html | 58 - .../intrusive/get_parent_fro_idp55894848.html | 57 + .../intrusive/get_parent_fro_idp55899120.html | 58 + doc/html/boost/intrusive/hashtable.html | 284 +- .../boost/intrusive/linear_slist_algorithms.html | 60 +- doc/html/boost/intrusive/list.html | 288 +- doc/html/boost/intrusive/list_base_hook.html | 32 +- doc/html/boost/intrusive/list_member_hook.html | 32 +- .../intrusive/make_unordered_idp65807072.html | 58 - .../intrusive/make_unordered_idp65862816.html | 58 - .../intrusive/make_unordered_idp66587792.html | 58 + .../intrusive/make_unordered_idp66643536.html | 58 + .../boost/intrusive/make_unordered_multiset.html | 6 +- .../intrusive/max_pointer_pl_idp55128640.html | 59 - .../intrusive/max_pointer_pl_idp55909360.html | 59 + .../boost/intrusive/max_pointer_plus_bits.html | 8 +- doc/html/boost/intrusive/member_value_traits.html | 20 +- doc/html/boost/intrusive/multiset.html | 328 +- doc/html/boost/intrusive/pack_options.html | 6 +- doc/html/boost/intrusive/pointer_has_rebind.html | 20 +- .../boost/intrusive/pointer_has_rebind/any.html | 4 +- .../boost/intrusive/pointer_has_rebind_other.html | 14 +- .../intrusive/pointer_has_rebind_other/any.html | 4 +- .../intrusive/pointer_plus_b_idp55135712.html | 77 - .../intrusive/pointer_plus_b_idp55916432.html | 77 + doc/html/boost/intrusive/pointer_plus_bits.html | 8 +- doc/html/boost/intrusive/pointer_rebind.html | 8 +- .../intrusive/pointer_rebind_idp55187168.html | 54 - .../intrusive/pointer_rebind_idp55190832.html | 54 - .../intrusive/pointer_rebind_idp55194496.html | 55 - .../intrusive/pointer_rebind_idp55200144.html | 54 - .../intrusive/pointer_rebind_idp55207392.html | 54 - .../intrusive/pointer_rebind_idp55967888.html | 54 + .../intrusive/pointer_rebind_idp55971552.html | 54 + .../intrusive/pointer_rebind_idp55975216.html | 55 + .../intrusive/pointer_rebind_idp55980864.html | 54 + .../intrusive/pointer_rebind_idp55988112.html | 54 + doc/html/boost/intrusive/pointer_rebinder.html | 6 +- doc/html/boost/intrusive/pointer_traits.html | 28 +- .../intrusive/pointer_traits_idp55252544.html | 110 - .../pointer_traits_idp55252544/rebind_pointer.html | 55 - .../intrusive/pointer_traits_idp56033264.html | 110 + .../pointer_traits_idp56033264/rebind_pointer.html | 55 + .../intrusive/priority_compa_idp55286240.html | 64 - .../intrusive/priority_compa_idp56066960.html | 64 + doc/html/boost/intrusive/priority_compare.html | 16 +- doc/html/boost/intrusive/rbtree.html | 370 +- doc/html/boost/intrusive/rbtree_algorithms.html | 152 +- doc/html/boost/intrusive/set.html | 348 +- doc/html/boost/intrusive/set_base_hook.html | 32 +- doc/html/boost/intrusive/set_member_hook.html | 32 +- doc/html/boost/intrusive/sg_multiset.html | 344 +- doc/html/boost/intrusive/sg_set.html | 364 +- doc/html/boost/intrusive/sgtree.html | 384 +- doc/html/boost/intrusive/sgtree_algorithms.html | 152 +- doc/html/boost/intrusive/slist.html | 396 +- doc/html/boost/intrusive/slist_base_hook.html | 32 +- doc/html/boost/intrusive/slist_member_hook.html | 32 +- doc/html/boost/intrusive/splay_multiset.html | 348 +- doc/html/boost/intrusive/splay_set.html | 376 +- doc/html/boost/intrusive/splaytree.html | 388 +- doc/html/boost/intrusive/splaytree_algorithms.html | 200 +- doc/html/boost/intrusive/treap.html | 408 +- doc/html/boost/intrusive/treap_algorithms.html | 152 +- doc/html/boost/intrusive/treap_multiset.html | 356 +- doc/html/boost/intrusive/treap_set.html | 376 +- doc/html/boost/intrusive/trivial_value_traits.html | 20 +- doc/html/boost/intrusive/unordered_multiset.html | 264 +- doc/html/boost/intrusive/unordered_set.html | 276 +- .../boost/intrusive/unordered_set_base_hook.html | 40 +- .../boost/intrusive/unordered_set_member_hook.html | 38 +- doc/html/boost/local_time/ambiguous_result.html | 8 +- doc/html/boost/local_time/bad_adjustment.html | 8 +- doc/html/boost/local_time/bad_offset.html | 8 +- .../boost/local_time/custom_time_zone_base.html | 66 +- doc/html/boost/local_time/dst_not_valid.html | 8 +- .../boost/local_time/local_date_time_base.html | 154 +- .../local_time/operat_1_3_12_15_6_4_2_1_1.html | 54 - .../local_time/operat_1_3_12_15_6_4_2_1_2.html | 54 - .../local_time/operat_1_3_12_15_6_4_2_1_3.html | 54 - .../local_time/operat_1_3_12_15_6_4_2_1_4.html | 54 - .../local_time/operat_1_3_12_15_6_4_2_1_5.html | 54 - .../local_time/operat_1_3_12_15_6_4_2_1_6.html | 54 - .../local_time/operat_1_3_12_15_6_4_2_1_7.html | 54 - .../local_time/operat_1_3_12_15_6_4_2_1_8.html | 54 - .../local_time/operat_1_3_13_15_6_4_2_1_1.html | 54 + .../local_time/operat_1_3_13_15_6_4_2_1_2.html | 54 + .../local_time/operat_1_3_13_15_6_4_2_1_3.html | 54 + .../local_time/operat_1_3_13_15_6_4_2_1_4.html | 54 + .../local_time/operat_1_3_13_15_6_4_2_1_5.html | 54 + .../local_time/operat_1_3_13_15_6_4_2_1_6.html | 54 + .../local_time/operat_1_3_13_15_6_4_2_1_7.html | 54 + .../local_time/operat_1_3_13_15_6_4_2_1_8.html | 54 + .../boost/local_time/partial_date_rule_spec.html | 6 +- .../boost/local_time/posix_time_zone_base.html | 94 +- doc/html/boost/local_time/time_label_invalid.html | 8 +- doc/html/boost/local_time/tz_database.html | 4 +- doc/html/boost/lockfree/spsc_queue.html | 116 +- .../spsc_queue/implementation_defined.html | 57 + doc/html/boost/lockfree/stack.html | 6 +- .../boost/logic/get_default_in_idp31765120.html | 54 + .../boost/logic/get_default_in_idp39719728.html | 54 - doc/html/boost/logic/indeterminate_name.html | 22 +- doc/html/boost/logic/operator_idp31661568.html | 114 + doc/html/boost/logic/operator_idp31770720.html | 71 + doc/html/boost/logic/operator_idp31779280.html | 68 + doc/html/boost/logic/operator_idp31785552.html | 69 + doc/html/boost/logic/operator_idp39616176.html | 114 - doc/html/boost/logic/operator_idp39725328.html | 71 - doc/html/boost/logic/operator_idp39733888.html | 68 - doc/html/boost/logic/operator_idp39740160.html | 69 - doc/html/boost/logic/tribool.html | 20 +- doc/html/boost/mpi/all_gather.html | 12 +- doc/html/boost/mpi/all_reduce.html | 10 +- doc/html/boost/mpi/all_to_all.html | 10 +- doc/html/boost/mpi/alloca_1_3_26_5_14_2_2_1_2.html | 70 + .../mpi/alloca_1_3_26_5_14_2_2_1_2/rebind.html | 57 + doc/html/boost/mpi/allocator.html | 68 +- doc/html/boost/mpi/allocator/rebind.html | 10 +- doc/html/boost/mpi/allocator_1_3_26_6_2_2_1_2.html | 70 - .../mpi/allocator_1_3_26_6_2_2_1_2/rebind.html | 57 - doc/html/boost/mpi/any_source.html | 10 +- doc/html/boost/mpi/any_tag.html | 12 +- doc/html/boost/mpi/bitwise_and.html | 26 +- doc/html/boost/mpi/bitwise_or.html | 26 +- doc/html/boost/mpi/bitwise_xor.html | 26 +- doc/html/boost/mpi/broadcast.html | 10 +- doc/html/boost/mpi/cartesian_communicator.html | 263 ++ doc/html/boost/mpi/cartesian_dimension.html | 96 + doc/html/boost/mpi/cartesian_dimensions.html | 84 + doc/html/boost/mpi/cartesian_topology.html | 182 + doc/html/boost/mpi/comm_create_kind.html | 10 +- doc/html/boost/mpi/communicator.html | 200 +- doc/html/boost/mpi/content.html | 38 +- doc/html/boost/mpi/environment.html | 84 +- doc/html/boost/mpi/exception.html | 42 +- doc/html/boost/mpi/gather.html | 10 +- doc/html/boost/mpi/gatherv.html | 10 +- doc/html/boost/mpi/get_1_3_26_5_14_12_2_2_11.html | 57 + doc/html/boost/mpi/get_1_3_26_5_14_12_2_2_12.html | 57 + doc/html/boost/mpi/get_1_3_26_6_11_2_2_11.html | 57 - doc/html/boost/mpi/get_1_3_26_6_11_2_2_12.html | 57 - doc/html/boost/mpi/get_content.html | 10 +- doc/html/boost/mpi/get_mp_1_3_26_5_14_8_2_1_8.html | 87 + doc/html/boost/mpi/get_mpi_d_1_3_26_6_7_2_1_8.html | 87 - doc/html/boost/mpi/graph_communicator.html | 26 +- doc/html/boost/mpi/group.html | 58 +- doc/html/boost/mpi/inpla_1_3_26_5_14_14_2_1_2.html | 69 + doc/html/boost/mpi/inplace.html | 12 +- doc/html/boost/mpi/inplace__1_3_26_6_13_2_1_2.html | 69 - doc/html/boost/mpi/inplace_t.html | 18 +- doc/html/boost/mpi/intercommunicator.html | 50 +- doc/html/boost/mpi/is_commutative.html | 10 +- doc/html/boost/mpi/is_mpi_1_3_26_5_14_3_2_1_2.html | 54 + doc/html/boost/mpi/is_mpi_1_3_26_5_14_8_2_1_2.html | 58 + doc/html/boost/mpi/is_mpi_builtin_datatype.html | 12 +- doc/html/boost/mpi/is_mpi_byte_datatype.html | 10 +- doc/html/boost/mpi/is_mpi_complex_datatype.html | 10 +- doc/html/boost/mpi/is_mpi_datatype.html | 12 +- doc/html/boost/mpi/is_mpi_fl_1_3_26_6_7_2_1_2.html | 58 - doc/html/boost/mpi/is_mpi_integer_datatype.html | 12 +- doc/html/boost/mpi/is_mpi_logical_datatype.html | 12 +- doc/html/boost/mpi/is_mpi_op.html | 10 +- doc/html/boost/mpi/logical_xor.html | 26 +- doc/html/boost/mpi/maximum.html | 26 +- doc/html/boost/mpi/minimum.html | 26 +- doc/html/boost/mpi/opera_1_3_26_5_14_13_2_1_2.html | 69 + doc/html/boost/mpi/opera_1_3_26_5_14_13_2_1_3.html | 69 + doc/html/boost/mpi/opera_1_3_26_5_14_13_2_1_4.html | 57 + doc/html/boost/mpi/operat_1_3_26_5_14_2_2_1_3.html | 70 + doc/html/boost/mpi/operat_1_3_26_5_14_2_2_1_4.html | 70 + doc/html/boost/mpi/operat_1_3_26_5_14_6_2_1_5.html | 70 + doc/html/boost/mpi/operat_1_3_26_5_14_6_2_1_6.html | 68 + doc/html/boost/mpi/operator-.html | 10 +- doc/html/boost/mpi/operator_.html | 12 +- doc/html/boost/mpi/operator_1_3_26_6_12_2_1_2.html | 69 - doc/html/boost/mpi/operator_1_3_26_6_12_2_1_3.html | 69 - doc/html/boost/mpi/operator_1_3_26_6_12_2_1_4.html | 57 - doc/html/boost/mpi/operator__1_3_26_6_2_2_1_3.html | 70 - doc/html/boost/mpi/operator__1_3_26_6_2_2_1_4.html | 70 - doc/html/boost/mpi/operator__1_3_26_6_5_2_1_5.html | 70 - doc/html/boost/mpi/operator__1_3_26_6_5_2_1_6.html | 68 - doc/html/boost/mpi/packed.html | 8 +- doc/html/boost/mpi/packed_iarchive.html | 58 +- doc/html/boost/mpi/packed_oarchive.html | 54 +- doc/html/boost/mpi/packed_skeleton_iarchive.html | 34 +- doc/html/boost/mpi/packed_skeleton_oarchive.html | 30 +- .../mpi/python/reg_1_3_26_5_14_20_2_1_1_2.html | 86 + .../mpi/python/regist_1_3_26_6_19_2_1_1_2.html | 86 - doc/html/boost/mpi/python/register_serialized.html | 12 +- doc/html/boost/mpi/reduce.html | 10 +- doc/html/boost/mpi/request.html | 36 +- doc/html/boost/mpi/scan.html | 10 +- doc/html/boost/mpi/scatter.html | 10 +- doc/html/boost/mpi/scatterv.html | 10 +- doc/html/boost/mpi/skeleton.html | 10 +- doc/html/boost/mpi/skeleton_proxy.html | 16 +- doc/html/boost/mpi/status.html | 54 +- doc/html/boost/mpi/test_all.html | 10 +- doc/html/boost/mpi/test_any.html | 10 +- doc/html/boost/mpi/test_some.html | 10 +- doc/html/boost/mpi/threading/level.html | 12 +- .../mpi/threading/ope_1_3_26_5_14_10_2_1_2_2.html | 57 + .../mpi/threading/ope_1_3_26_5_14_10_2_1_2_3.html | 57 + .../mpi/threading/operato_1_3_26_6_9_2_1_2_2.html | 57 - .../mpi/threading/operato_1_3_26_6_9_2_1_2_3.html | 57 - doc/html/boost/mpi/timer.html | 50 +- doc/html/boost/mpi/wait_all.html | 10 +- doc/html/boost/mpi/wait_any.html | 10 +- doc/html/boost/mpi/wait_some.html | 10 +- doc/html/boost/operator___idp24460448.html | 101 - doc/html/boost/operator___idp24487216.html | 105 - doc/html/boost/operator___idp24515552.html | 105 - doc/html/boost/operator___idp24529728.html | 105 - doc/html/boost/operator___idp43338976.html | 101 + doc/html/boost/operator___idp43365744.html | 105 + doc/html/boost/operator___idp43394080.html | 105 + doc/html/boost/operator___idp43408256.html | 105 + doc/html/boost/operator_idp24473872.html | 101 - doc/html/boost/operator_idp24501376.html | 105 - doc/html/boost/operator_idp43352400.html | 101 + doc/html/boost/operator_idp43379904.html | 105 + .../boost/posix_time/duration_from_string.html | 8 +- doc/html/boost/posix_time/from_ftime.html | 8 +- doc/html/boost/posix_time/hours.html | 21 +- .../posix_time/millis_1_3_12_15_5_5_1_1_4.html | 70 - .../posix_time/millis_1_3_13_15_5_5_1_1_4.html | 70 + doc/html/boost/posix_time/minutes.html | 15 +- .../posix_time/operat_1_3_12_15_5_3_2_1_1.html | 53 - .../posix_time/operat_1_3_12_15_5_3_2_1_2.html | 53 - .../posix_time/operat_1_3_12_15_5_3_2_1_3.html | 53 - .../posix_time/operat_1_3_12_15_5_3_2_1_4.html | 53 - .../posix_time/operat_1_3_12_15_5_3_2_1_5.html | 53 - .../posix_time/operat_1_3_12_15_5_3_2_1_6.html | 53 - .../posix_time/operat_1_3_12_15_5_3_2_1_7.html | 53 - .../posix_time/operat_1_3_12_15_5_3_2_1_8.html | 53 - .../posix_time/operat_1_3_12_15_5_8_1_1_6.html | 55 - .../posix_time/operat_1_3_13_15_5_3_2_1_1.html | 53 + .../posix_time/operat_1_3_13_15_5_3_2_1_2.html | 53 + .../posix_time/operat_1_3_13_15_5_3_2_1_3.html | 53 + .../posix_time/operat_1_3_13_15_5_3_2_1_4.html | 53 + .../posix_time/operat_1_3_13_15_5_3_2_1_5.html | 53 + .../posix_time/operat_1_3_13_15_5_3_2_1_6.html | 53 + .../posix_time/operat_1_3_13_15_5_3_2_1_7.html | 53 + .../posix_time/operat_1_3_13_15_5_3_2_1_8.html | 53 + .../posix_time/operat_1_3_13_15_5_8_1_1_6.html | 55 + .../boost/posix_time/posix_time_system_config.html | 18 +- doc/html/boost/posix_time/ptime.html | 30 +- doc/html/boost/posix_time/seconds.html | 15 +- doc/html/boost/posix_time/simple_time_rep.html | 30 +- doc/html/boost/posix_time/time_duration.html | 26 +- doc/html/boost/posix_time/wtime_facet.html | 8 +- doc/html/boost/process/async_pipe.html | 132 +- doc/html/boost/process/basic_environment.html | 126 +- .../basic_environment/const_entry_type.html | 20 +- .../process/basic_environment/entry_type.html | 48 +- doc/html/boost/process/basic_ipstream.html | 64 +- .../boost/process/basic_native_environment.html | 114 +- .../basic_native_environment/const_entry_type.html | 20 +- .../basic_native_environment/entry_type.html | 48 +- doc/html/boost/process/basic_opstream.html | 64 +- doc/html/boost/process/basic_pipe.html | 64 +- doc/html/boost/process/basic_pipebuf.html | 80 +- doc/html/boost/process/basic_pstream.html | 64 +- doc/html/boost/process/child.html | 108 +- doc/html/boost/process/extend/handler.html | 28 +- doc/html/boost/process/extend/posix_executor.html | 44 +- .../boost/process/extend/windows_executor.html | 36 +- doc/html/boost/process/group.html | 108 +- doc/html/boost/process/on_exit.html | 2 +- .../boost/process/windows/create_no_window.html | 51 + doc/html/boost/process/windows/show_normal.html | 6 +- .../boost/random/linear_congruential_engine.html | 2 +- .../stacktrace/safe_dump_1_3_38_7_6_2_1_3.html | 2 +- .../stacktrace/safe_dump_1_3_38_7_6_2_1_4.html | 2 +- .../stacktrace/safe_dump_1_3_38_7_6_2_1_5.html | 2 +- .../stacktrace/safe_dump_1_3_38_7_6_2_1_6.html | 2 +- doc/html/boost/swap_idp24543920.html | 105 - doc/html/boost/swap_idp43422448.html | 105 + doc/html/boost/type_erasure/_self.html | 6 +- doc/html/boost/type_erasure/any.html | 106 +- .../type_erasure/any_Conc_1_3_41_13_1_1_1_1.html | 560 --- .../type_erasure/any_Conc_1_3_41_13_1_1_1_2.html | 163 +- .../type_erasure/any_Conc_1_3_41_13_1_1_1_3.html | 213 +- .../type_erasure/any_Conc_1_3_41_13_1_1_1_4.html | 498 ++ doc/html/boost/type_erasure/any_cast.html | 10 +- doc/html/boost/type_erasure/as_param.html | 10 +- doc/html/boost/type_erasure/assignable.html | 12 +- doc/html/boost/type_erasure/binding.html | 54 +- doc/html/boost/type_erasure/binding_of.html | 6 +- doc/html/boost/type_erasure/call.html | 6 +- doc/html/boost/type_erasure/callable.html | 6 +- doc/html/boost/type_erasure/check_match.html | 8 +- doc/html/boost/type_erasure/dynamic_any_cast.html | 2 +- doc/html/boost/type_erasure/is_placeholder.html | 2 +- doc/html/boost/type_erasure/istreamable.html | 6 +- doc/html/boost/type_erasure/param.html | 40 +- doc/html/boost/type_erasure/placeholder_of.html | 10 +- doc/html/boost/type_erasure/rebind_any.html | 9 +- doc/html/boost/type_erasure/register_binding.html | 2 +- doc/html/boost/type_erasure/relaxed.html | 8 +- doc/html/boost/type_erasure/require_match.html | 8 +- doc/html/boost/type_erasure/static_binding.html | 2 + doc/html/boost/type_erasure/typeid_.html | 16 +- doc/html/boost/typeindex/hash_value.html | 2 +- doc/html/boost/typeindex/type_index_facade.html | 2 +- doc/html/boost/units/absolute.html | 16 +- .../boost/units/ba_1_3_44_10_10_5_10_1_1_1.html | 8 +- .../boost/units/ba_1_3_44_10_10_5_11_1_1_1.html | 8 +- .../boost/units/ba_1_3_44_10_10_5_12_1_1_1.html | 8 +- .../boost/units/ba_1_3_44_10_10_5_13_1_1_1.html | 8 +- .../boost/units/ba_1_3_44_10_10_5_16_1_1_1.html | 8 +- .../boost/units/ba_1_3_44_10_10_5_17_1_1_1.html | 8 +- .../boost/units/ba_1_3_44_10_10_5_18_1_1_1.html | 8 +- .../boost/units/ba_1_3_44_10_10_5_19_1_1_1.html | 8 +- .../boost/units/ba_1_3_44_10_10_5_20_1_1_1.html | 8 +- .../boost/units/ba_1_3_44_10_10_6_10_1_1_1.html | 8 +- .../boost/units/ba_1_3_44_10_10_6_13_1_1_1.html | 8 +- .../boost/units/ba_1_3_44_10_10_6_14_1_1_1.html | 8 +- .../boost/units/ba_1_3_44_10_10_6_16_1_1_1.html | 8 +- .../boost/units/ba_1_3_44_10_10_6_17_1_1_1.html | 8 +- .../boost/units/ba_1_3_44_10_10_6_19_1_1_1.html | 8 +- .../boost/units/ba_1_3_44_10_10_9_10_1_1_1.html | 8 +- .../boost/units/ba_1_3_44_10_10_9_11_1_1_1.html | 8 +- .../boost/units/ba_1_3_44_10_10_9_12_1_1_1.html | 8 +- .../boost/units/ba_1_3_44_10_10_9_13_1_1_1.html | 8 +- .../boost/units/ba_1_3_44_10_10_9_14_1_1_1.html | 8 +- .../boost/units/ba_1_3_44_10_10_9_15_1_1_1.html | 8 +- .../boost/units/ba_1_3_44_10_10_9_19_1_1_1.html | 8 +- .../boost/units/ba_1_3_44_10_10_9_20_1_1_1.html | 8 +- .../boost/units/ba_1_3_44_10_10_9_21_1_1_1.html | 8 +- .../boost/units/ba_1_3_44_10_10_9_22_1_1_1.html | 8 +- .../boost/units/bas_1_3_44_10_10_2_2_1_1_1.html | 8 +- .../boost/units/bas_1_3_44_10_10_2_3_1_1_1.html | 8 +- .../boost/units/bas_1_3_44_10_10_2_7_1_1_1.html | 8 +- .../boost/units/bas_1_3_44_10_10_3_3_1_1_1.html | 8 +- .../boost/units/bas_1_3_44_10_10_3_4_1_1_1.html | 8 +- .../boost/units/bas_1_3_44_10_10_3_5_1_1_1.html | 8 +- .../boost/units/bas_1_3_44_10_10_3_7_1_1_1.html | 8 +- .../boost/units/bas_1_3_44_10_10_5_2_1_1_1.html | 8 +- .../boost/units/bas_1_3_44_10_10_5_3_1_1_1.html | 8 +- .../boost/units/bas_1_3_44_10_10_5_4_1_1_1.html | 8 +- .../boost/units/bas_1_3_44_10_10_5_5_1_1_1.html | 8 +- .../boost/units/bas_1_3_44_10_10_5_6_1_1_1.html | 8 +- .../boost/units/bas_1_3_44_10_10_5_7_1_1_1.html | 8 +- .../boost/units/bas_1_3_44_10_10_5_8_1_1_1.html | 8 +- .../boost/units/bas_1_3_44_10_10_5_9_1_1_1.html | 8 +- .../boost/units/bas_1_3_44_10_10_6_2_1_1_1.html | 8 +- .../boost/units/bas_1_3_44_10_10_6_7_1_1_1.html | 8 +- .../boost/units/bas_1_3_44_10_10_6_8_1_1_1.html | 8 +- .../boost/units/bas_1_3_44_10_10_9_2_1_1_1.html | 8 +- .../boost/units/bas_1_3_44_10_10_9_3_1_1_1.html | 8 +- .../boost/units/bas_1_3_44_10_10_9_4_1_1_1.html | 8 +- .../boost/units/bas_1_3_44_10_10_9_5_1_1_1.html | 8 +- .../boost/units/bas_1_3_44_10_10_9_6_1_1_1.html | 8 +- .../boost/units/bas_1_3_44_10_10_9_7_1_1_1.html | 8 +- .../boost/units/bas_1_3_44_10_10_9_8_1_1_1.html | 8 +- .../boost/units/bas_1_3_44_10_10_9_9_1_1_1.html | 8 +- doc/html/boost/units/conversion_helper.html | 4 +- doc/html/boost/units/pow_1_3_44_10_2_5_3_1_29.html | 2 +- .../boost/units/power_1_3_44_10_2_42_1_1_3.html | 4 +- doc/html/boost/units/power_typeof_helper.html | 4 +- .../boost/units/quant_1_3_44_10_2_36_1_1_2.html | 44 +- doc/html/boost/units/quantity.html | 55 +- .../boost/units/root__1_3_44_10_2_42_1_1_4.html | 4 +- doc/html/boost/units/root_typeof_helper.html | 4 +- doc/html/boost/units/scale.html | 6 +- doc/html/boost/units/static_rational.html | 12 +- doc/html/boost/units/unit.html | 4 +- doc/html/boost_asio.html | 4 +- .../boost_asio/example/cpp03/allocation/server.cpp | 2 +- .../example/cpp03/buffers/reference_counted.cpp | 2 +- .../boost_asio/example/cpp03/chat/chat_client.cpp | 2 +- .../boost_asio/example/cpp03/chat/chat_message.hpp | 2 +- .../boost_asio/example/cpp03/chat/chat_server.cpp | 2 +- .../example/cpp03/chat/posix_chat_client.cpp | 2 +- .../example/cpp03/echo/async_tcp_echo_server.cpp | 2 +- .../example/cpp03/echo/async_udp_echo_server.cpp | 2 +- .../cpp03/echo/blocking_tcp_echo_client.cpp | 2 +- .../cpp03/echo/blocking_tcp_echo_server.cpp | 2 +- .../cpp03/echo/blocking_udp_echo_client.cpp | 2 +- .../cpp03/echo/blocking_udp_echo_server.cpp | 2 +- doc/html/boost_asio/example/cpp03/fork/daemon.cpp | 2 +- .../example/cpp03/fork/process_per_connection.cpp | 2 +- .../example/cpp03/http/client/async_client.cpp | 2 +- .../example/cpp03/http/client/sync_client.cpp | 2 +- .../example/cpp03/http/server/connection.cpp | 2 +- .../example/cpp03/http/server/connection.hpp | 2 +- .../cpp03/http/server/connection_manager.cpp | 2 +- .../cpp03/http/server/connection_manager.hpp | 2 +- .../example/cpp03/http/server/header.hpp | 2 +- .../boost_asio/example/cpp03/http/server/main.cpp | 2 +- .../example/cpp03/http/server/mime_types.cpp | 2 +- .../example/cpp03/http/server/mime_types.hpp | 2 +- .../boost_asio/example/cpp03/http/server/reply.cpp | 2 +- .../boost_asio/example/cpp03/http/server/reply.hpp | 2 +- .../example/cpp03/http/server/request.hpp | 2 +- .../example/cpp03/http/server/request_handler.cpp | 2 +- .../example/cpp03/http/server/request_handler.hpp | 2 +- .../example/cpp03/http/server/request_parser.cpp | 2 +- .../example/cpp03/http/server/request_parser.hpp | 2 +- .../example/cpp03/http/server/server.cpp | 2 +- .../example/cpp03/http/server/server.hpp | 2 +- .../example/cpp03/http/server2/connection.cpp | 2 +- .../example/cpp03/http/server2/connection.hpp | 2 +- .../example/cpp03/http/server2/header.hpp | 2 +- .../example/cpp03/http/server2/io_context_pool.cpp | 2 +- .../example/cpp03/http/server2/io_context_pool.hpp | 2 +- .../boost_asio/example/cpp03/http/server2/main.cpp | 2 +- .../example/cpp03/http/server2/mime_types.cpp | 2 +- .../example/cpp03/http/server2/mime_types.hpp | 2 +- .../example/cpp03/http/server2/reply.cpp | 2 +- .../example/cpp03/http/server2/reply.hpp | 2 +- .../example/cpp03/http/server2/request.hpp | 2 +- .../example/cpp03/http/server2/request_handler.cpp | 2 +- .../example/cpp03/http/server2/request_handler.hpp | 2 +- .../example/cpp03/http/server2/request_parser.cpp | 2 +- .../example/cpp03/http/server2/request_parser.hpp | 2 +- .../example/cpp03/http/server2/server.cpp | 2 +- .../example/cpp03/http/server2/server.hpp | 2 +- .../example/cpp03/http/server3/connection.cpp | 2 +- .../example/cpp03/http/server3/connection.hpp | 2 +- .../example/cpp03/http/server3/header.hpp | 2 +- .../boost_asio/example/cpp03/http/server3/main.cpp | 2 +- .../example/cpp03/http/server3/mime_types.cpp | 2 +- .../example/cpp03/http/server3/mime_types.hpp | 2 +- .../example/cpp03/http/server3/reply.cpp | 2 +- .../example/cpp03/http/server3/reply.hpp | 2 +- .../example/cpp03/http/server3/request.hpp | 2 +- .../example/cpp03/http/server3/request_handler.cpp | 2 +- .../example/cpp03/http/server3/request_handler.hpp | 2 +- .../example/cpp03/http/server3/request_parser.cpp | 2 +- .../example/cpp03/http/server3/request_parser.hpp | 2 +- .../example/cpp03/http/server3/server.cpp | 2 +- .../example/cpp03/http/server3/server.hpp | 2 +- .../example/cpp03/http/server4/file_handler.cpp | 2 +- .../example/cpp03/http/server4/file_handler.hpp | 2 +- .../example/cpp03/http/server4/header.hpp | 2 +- .../boost_asio/example/cpp03/http/server4/main.cpp | 2 +- .../example/cpp03/http/server4/mime_types.cpp | 2 +- .../example/cpp03/http/server4/mime_types.hpp | 2 +- .../example/cpp03/http/server4/reply.cpp | 2 +- .../example/cpp03/http/server4/reply.hpp | 2 +- .../example/cpp03/http/server4/request.hpp | 2 +- .../example/cpp03/http/server4/request_parser.cpp | 2 +- .../example/cpp03/http/server4/request_parser.hpp | 2 +- .../example/cpp03/http/server4/server.cpp | 2 +- .../example/cpp03/http/server4/server.hpp | 2 +- .../boost_asio/example/cpp03/icmp/icmp_header.hpp | 2 +- .../boost_asio/example/cpp03/icmp/ipv4_header.hpp | 2 +- doc/html/boost_asio/example/cpp03/icmp/ping.cpp | 22 +- .../cpp03/invocation/prioritised_handlers.cpp | 6 +- .../example/cpp03/iostreams/daytime_client.cpp | 2 +- .../example/cpp03/iostreams/daytime_server.cpp | 2 +- .../example/cpp03/iostreams/http_client.cpp | 4 +- .../example/cpp03/local/connect_pair.cpp | 2 +- .../example/cpp03/local/iostream_client.cpp | 2 +- .../example/cpp03/local/stream_client.cpp | 2 +- .../example/cpp03/local/stream_server.cpp | 2 +- .../example/cpp03/multicast/receiver.cpp | 2 +- .../boost_asio/example/cpp03/multicast/sender.cpp | 7 +- .../example/cpp03/nonblocking/third_party_lib.cpp | 2 +- .../boost_asio/example/cpp03/porthopper/client.cpp | 2 +- .../example/cpp03/porthopper/protocol.hpp | 2 +- .../boost_asio/example/cpp03/porthopper/server.cpp | 14 +- .../example/cpp03/serialization/client.cpp | 2 +- .../example/cpp03/serialization/connection.hpp | 2 +- .../example/cpp03/serialization/server.cpp | 2 +- .../example/cpp03/serialization/stock.hpp | 2 +- .../example/cpp03/services/basic_logger.hpp | 2 +- .../example/cpp03/services/daytime_client.cpp | 2 +- .../boost_asio/example/cpp03/services/logger.hpp | 2 +- .../example/cpp03/services/logger_service.cpp | 2 +- .../example/cpp03/services/logger_service.hpp | 2 +- .../boost_asio/example/cpp03/socks4/socks4.hpp | 2 +- .../example/cpp03/socks4/sync_client.cpp | 2 +- .../boost_asio/example/cpp03/spawn/echo_server.cpp | 10 +- .../example/cpp03/spawn/parallel_grep.cpp | 2 +- doc/html/boost_asio/example/cpp03/ssl/client.cpp | 2 +- doc/html/boost_asio/example/cpp03/ssl/server.cpp | 2 +- .../example/cpp03/timeouts/async_tcp_client.cpp | 44 +- .../example/cpp03/timeouts/blocking_tcp_client.cpp | 206 +- .../cpp03/timeouts/blocking_token_tcp_client.cpp | 198 + .../example/cpp03/timeouts/blocking_udp_client.cpp | 103 +- .../boost_asio/example/cpp03/timeouts/server.cpp | 60 +- .../example/cpp03/timers/tick_count_timer.cpp | 123 - .../example/cpp03/timers/time_t_timer.cpp | 83 +- .../example/cpp03/windows/transmit_file.cpp | 2 +- .../boost_asio/example/cpp11/allocation/server.cpp | 2 +- .../example/cpp11/buffers/reference_counted.cpp | 3 +- .../boost_asio/example/cpp11/chat/chat_client.cpp | 2 +- .../boost_asio/example/cpp11/chat/chat_message.hpp | 2 +- .../boost_asio/example/cpp11/chat/chat_server.cpp | 2 +- .../example/cpp11/echo/async_tcp_echo_server.cpp | 2 +- .../example/cpp11/echo/async_udp_echo_server.cpp | 2 +- .../cpp11/echo/blocking_tcp_echo_client.cpp | 2 +- .../cpp11/echo/blocking_tcp_echo_server.cpp | 2 +- .../cpp11/echo/blocking_udp_echo_client.cpp | 2 +- .../cpp11/echo/blocking_udp_echo_server.cpp | 2 +- .../example/cpp11/executors/fork_join.cpp | 1 + .../example/cpp11/executors/pipeline.cpp | 1 + doc/html/boost_asio/example/cpp11/fork/daemon.cpp | 2 +- .../example/cpp11/fork/process_per_connection.cpp | 2 +- .../example/cpp11/futures/daytime_client.cpp | 2 +- .../handler_tracking/async_tcp_echo_server.cpp | 2 +- .../cpp11/handler_tracking/custom_tracking.hpp | 2 +- .../example/cpp11/http/server/connection.cpp | 2 +- .../example/cpp11/http/server/connection.hpp | 2 +- .../cpp11/http/server/connection_manager.cpp | 2 +- .../cpp11/http/server/connection_manager.hpp | 2 +- .../example/cpp11/http/server/header.hpp | 2 +- .../boost_asio/example/cpp11/http/server/main.cpp | 2 +- .../example/cpp11/http/server/mime_types.cpp | 2 +- .../example/cpp11/http/server/mime_types.hpp | 2 +- .../boost_asio/example/cpp11/http/server/reply.cpp | 2 +- .../boost_asio/example/cpp11/http/server/reply.hpp | 2 +- .../example/cpp11/http/server/request.hpp | 2 +- .../example/cpp11/http/server/request_handler.cpp | 2 +- .../example/cpp11/http/server/request_handler.hpp | 2 +- .../example/cpp11/http/server/request_parser.cpp | 2 +- .../example/cpp11/http/server/request_parser.hpp | 2 +- .../example/cpp11/http/server/server.cpp | 2 +- .../example/cpp11/http/server/server.hpp | 2 +- .../cpp11/invocation/prioritised_handlers.cpp | 2 +- .../example/cpp11/local/connect_pair.cpp | 2 +- .../example/cpp11/local/iostream_client.cpp | 2 +- .../example/cpp11/local/stream_client.cpp | 2 +- .../example/cpp11/local/stream_server.cpp | 2 +- .../example/cpp11/multicast/receiver.cpp | 2 +- .../boost_asio/example/cpp11/multicast/sender.cpp | 2 +- .../boost_asio/example/cpp11/spawn/echo_server.cpp | 2 +- .../example/cpp11/spawn/parallel_grep.cpp | 2 +- .../example/cpp17/coroutines_ts/chat_server.cpp | 224 + .../coroutines_ts/double_buffered_echo_server.cpp | 97 + .../example/cpp17/coroutines_ts/echo_server.cpp | 82 + .../cpp17/coroutines_ts/range_based_for.cpp | 111 + .../cpp17/coroutines_ts/refactored_echo_server.cpp | 91 + doc/html/boost_asio/examples.html | 7 +- doc/html/boost_asio/examples/cpp03_examples.html | 17 +- doc/html/boost_asio/examples/cpp11_examples.html | 8 +- doc/html/boost_asio/examples/cpp17_examples.html | 69 + doc/html/boost_asio/history.html | 184 +- doc/html/boost_asio/index.html | 1279 +++--- doc/html/boost_asio/net_ts.html | 2 +- doc/html/boost_asio/overview.html | 6 +- doc/html/boost_asio/overview/core.html | 6 +- doc/html/boost_asio/overview/core/allocation.html | 2 +- doc/html/boost_asio/overview/core/async.html | 2 +- doc/html/boost_asio/overview/core/basics.html | 2 +- doc/html/boost_asio/overview/core/buffers.html | 2 +- .../boost_asio/overview/core/concurrency_hint.html | 2 +- doc/html/boost_asio/overview/core/coroutine.html | 2 +- .../boost_asio/overview/core/coroutines_ts.html | 155 + .../boost_asio/overview/core/handler_tracking.html | 2 +- doc/html/boost_asio/overview/core/line_based.html | 2 +- doc/html/boost_asio/overview/core/reactor.html | 2 +- doc/html/boost_asio/overview/core/spawn.html | 8 +- doc/html/boost_asio/overview/core/strands.html | 2 +- doc/html/boost_asio/overview/core/streams.html | 2 +- doc/html/boost_asio/overview/core/threads.html | 2 +- doc/html/boost_asio/overview/cpp2011.html | 2 +- doc/html/boost_asio/overview/cpp2011/array.html | 2 +- doc/html/boost_asio/overview/cpp2011/atomic.html | 2 +- doc/html/boost_asio/overview/cpp2011/chrono.html | 2 +- doc/html/boost_asio/overview/cpp2011/futures.html | 2 +- .../boost_asio/overview/cpp2011/move_handlers.html | 2 +- .../boost_asio/overview/cpp2011/move_objects.html | 2 +- .../boost_asio/overview/cpp2011/shared_ptr.html | 2 +- doc/html/boost_asio/overview/cpp2011/variadic.html | 2 +- doc/html/boost_asio/overview/implementation.html | 2 +- doc/html/boost_asio/overview/networking.html | 8 +- .../overview/networking/bsd_sockets.html | 2 +- .../boost_asio/overview/networking/iostreams.html | 2 +- .../overview/networking/other_protocols.html | 2 +- .../boost_asio/overview/networking/protocols.html | 2 +- doc/html/boost_asio/overview/posix.html | 2 +- doc/html/boost_asio/overview/posix/fork.html | 2 +- doc/html/boost_asio/overview/posix/local.html | 2 +- .../overview/posix/stream_descriptor.html | 2 +- doc/html/boost_asio/overview/rationale.html | 2 +- doc/html/boost_asio/overview/serial_ports.html | 2 +- doc/html/boost_asio/overview/signals.html | 2 +- doc/html/boost_asio/overview/ssl.html | 2 +- doc/html/boost_asio/overview/timers.html | 2 +- doc/html/boost_asio/overview/windows.html | 2 +- .../boost_asio/overview/windows/object_handle.html | 2 +- .../overview/windows/random_access_handle.html | 2 +- .../boost_asio/overview/windows/stream_handle.html | 2 +- doc/html/boost_asio/reference.html | 128 +- doc/html/boost_asio/reference/AcceptHandler.html | 2 +- .../boost_asio/reference/AcceptableProtocol.html | 2 +- .../reference/AsyncRandomAccessReadDevice.html | 2 +- .../reference/AsyncRandomAccessWriteDevice.html | 2 +- doc/html/boost_asio/reference/AsyncReadStream.html | 2 +- .../boost_asio/reference/AsyncWriteStream.html | 2 +- .../reference/BufferedHandshakeHandler.html | 2 +- .../boost_asio/reference/CompletionCondition.html | 2 +- .../boost_asio/reference/CompletionHandler.html | 2 +- .../boost_asio/reference/ConnectCondition.html | 2 +- doc/html/boost_asio/reference/ConnectHandler.html | 2 +- .../boost_asio/reference/ConstBufferSequence.html | 2 +- doc/html/boost_asio/reference/DynamicBuffer.html | 2 +- doc/html/boost_asio/reference/Endpoint.html | 2 +- .../boost_asio/reference/EndpointSequence.html | 2 +- .../boost_asio/reference/ExecutionContext.html | 2 +- doc/html/boost_asio/reference/Executor1.html | 2 +- .../reference/GettableSerialPortOption.html | 2 +- .../boost_asio/reference/GettableSocketOption.html | 2 +- doc/html/boost_asio/reference/Handler.html | 6 +- .../boost_asio/reference/HandshakeHandler.html | 2 +- .../boost_asio/reference/InternetProtocol.html | 2 +- .../boost_asio/reference/IoControlCommand.html | 2 +- doc/html/boost_asio/reference/IoObjectService.html | 2 +- .../reference/IteratorConnectHandler.html | 8 +- .../reference/LegacyCompletionHandler.html | 106 + .../boost_asio/reference/MoveAcceptHandler.html | 8 +- .../reference/MutableBufferSequence.html | 2 +- doc/html/boost_asio/reference/ProtoAllocator.html | 2 +- doc/html/boost_asio/reference/Protocol.html | 2 +- .../boost_asio/reference/RangeConnectHandler.html | 2 +- doc/html/boost_asio/reference/ReadHandler.html | 2 +- doc/html/boost_asio/reference/ResolveHandler.html | 2 +- doc/html/boost_asio/reference/Service.html | 2 +- .../reference/SettableSerialPortOption.html | 2 +- .../boost_asio/reference/SettableSocketOption.html | 2 +- doc/html/boost_asio/reference/ShutdownHandler.html | 2 +- doc/html/boost_asio/reference/SignalHandler.html | 2 +- .../reference/SyncRandomAccessReadDevice.html | 2 +- .../reference/SyncRandomAccessWriteDevice.html | 2 +- doc/html/boost_asio/reference/SyncReadStream.html | 2 +- doc/html/boost_asio/reference/SyncWriteStream.html | 2 +- doc/html/boost_asio/reference/TimeTraits.html | 2 +- doc/html/boost_asio/reference/WaitHandler.html | 2 +- doc/html/boost_asio/reference/WaitTraits.html | 2 +- doc/html/boost_asio/reference/WriteHandler.html | 2 +- doc/html/boost_asio/reference/add_service.html | 2 +- .../reference/asio_handler_allocate.html | 2 +- .../reference/asio_handler_deallocate.html | 2 +- .../boost_asio/reference/asio_handler_invoke.html | 2 +- .../reference/asio_handler_invoke/overload1.html | 2 +- .../reference/asio_handler_invoke/overload2.html | 2 +- .../reference/asio_handler_is_continuation.html | 2 +- .../boost_asio/reference/associated_allocator.html | 2 +- .../reference/associated_allocator/get.html | 2 +- .../reference/associated_allocator/type.html | 2 +- .../boost_asio/reference/associated_executor.html | 2 +- .../reference/associated_executor/get.html | 2 +- .../reference/associated_executor/type.html | 2 +- .../boost_asio/reference/async_completion.html | 2 +- .../async_completion/async_completion.html | 2 +- .../async_completion/completion_handler.html | 2 +- .../async_completion/completion_handler_type.html | 2 +- .../reference/async_completion/result.html | 2 +- doc/html/boost_asio/reference/async_connect.html | 2 +- .../reference/async_connect/overload1.html | 2 +- .../reference/async_connect/overload2.html | 2 +- .../reference/async_connect/overload3.html | 2 +- .../reference/async_connect/overload4.html | 2 +- .../reference/async_connect/overload5.html | 2 +- .../reference/async_connect/overload6.html | 2 +- doc/html/boost_asio/reference/async_read.html | 6 +- .../boost_asio/reference/async_read/overload1.html | 2 +- .../boost_asio/reference/async_read/overload2.html | 2 +- .../boost_asio/reference/async_read/overload3.html | 4 +- .../boost_asio/reference/async_read/overload4.html | 4 +- .../boost_asio/reference/async_read/overload5.html | 2 +- .../boost_asio/reference/async_read/overload6.html | 2 +- doc/html/boost_asio/reference/async_read_at.html | 2 +- .../reference/async_read_at/overload1.html | 2 +- .../reference/async_read_at/overload2.html | 2 +- .../reference/async_read_at/overload3.html | 2 +- .../reference/async_read_at/overload4.html | 2 +- .../boost_asio/reference/async_read_until.html | 2 +- .../reference/async_read_until/overload1.html | 2 +- .../reference/async_read_until/overload2.html | 2 +- .../reference/async_read_until/overload3.html | 2 +- .../reference/async_read_until/overload4.html | 2 +- .../reference/async_read_until/overload5.html | 2 +- .../reference/async_read_until/overload6.html | 2 +- .../reference/async_read_until/overload7.html | 2 +- .../reference/async_read_until/overload8.html | 2 +- doc/html/boost_asio/reference/async_result.html | 2 +- .../reference/async_result/async_result.html | 2 +- .../async_result/completion_handler_type.html | 2 +- .../boost_asio/reference/async_result/get.html | 2 +- .../reference/async_result/return_type.html | 2 +- .../reference/async_result_lt__Handler__gt_.html | 2 +- .../async_result.html | 2 +- .../async_result_lt__Handler__gt_/get.html | 2 +- .../async_result_lt__Handler__gt_/type.html | 2 +- ...gs_ellipsis__rp__gt__comma__Signature__gt_.html | 2 +- .../async_result.html | 2 +- .../completion_handler_type.html | 2 +- .../get.html | 2 +- .../return_type.html | 2 +- doc/html/boost_asio/reference/async_write.html | 6 +- .../reference/async_write/overload1.html | 2 +- .../reference/async_write/overload2.html | 2 +- .../reference/async_write/overload3.html | 4 +- .../reference/async_write/overload4.html | 4 +- .../reference/async_write/overload5.html | 2 +- .../reference/async_write/overload6.html | 2 +- doc/html/boost_asio/reference/async_write_at.html | 2 +- .../reference/async_write_at/overload1.html | 2 +- .../reference/async_write_at/overload2.html | 2 +- .../reference/async_write_at/overload3.html | 2 +- .../reference/async_write_at/overload4.html | 2 +- .../reference/asynchronous_operations.html | 2 +- .../allocation_of_intermediate_storage.html | 2 +- .../associated_executor.html | 2 +- ...duction_of_initiating_function_return_type.html | 2 +- .../completion_handler_executor.html | 2 +- .../completion_handlers_and_exceptions.html | 2 +- .../asynchronous_operations/completion_token.html | 2 +- ...er_on_completion_of_asynchronous_operation.html | 2 +- .../general_asynchronous_operation_concepts.html | 2 +- .../asynchronous_operations/i_o_executor.html | 2 +- .../lifetime_of_initiating_function_arguments.html | 2 +- ...cking_requirements_on_initiating_functions.html | 2 +- .../asynchronous_operations/outstanding_work.html | 2 +- ...uction_of_initiating_function_return_value.html | 2 +- .../reference/asynchronous_socket_operations.html | 2 +- doc/html/boost_asio/reference/bad_executor.html | 2 +- .../reference/bad_executor/bad_executor.html | 2 +- .../boost_asio/reference/bad_executor/what.html | 2 +- .../reference/basic_datagram_socket.html | 2 +- .../_basic_datagram_socket.html | 2 +- .../reference/basic_datagram_socket/assign.html | 2 +- .../basic_datagram_socket/assign/overload1.html | 2 +- .../basic_datagram_socket/assign/overload2.html | 2 +- .../basic_datagram_socket/async_connect.html | 2 +- .../basic_datagram_socket/async_receive.html | 2 +- .../async_receive/overload1.html | 2 +- .../async_receive/overload2.html | 2 +- .../basic_datagram_socket/async_receive_from.html | 2 +- .../async_receive_from/overload1.html | 2 +- .../async_receive_from/overload2.html | 2 +- .../basic_datagram_socket/async_send.html | 2 +- .../async_send/overload1.html | 2 +- .../async_send/overload2.html | 2 +- .../basic_datagram_socket/async_send_to.html | 2 +- .../async_send_to/overload1.html | 2 +- .../async_send_to/overload2.html | 2 +- .../basic_datagram_socket/async_wait.html | 2 +- .../reference/basic_datagram_socket/at_mark.html | 2 +- .../basic_datagram_socket/at_mark/overload1.html | 2 +- .../basic_datagram_socket/at_mark/overload2.html | 2 +- .../reference/basic_datagram_socket/available.html | 2 +- .../basic_datagram_socket/available/overload1.html | 2 +- .../basic_datagram_socket/available/overload2.html | 2 +- .../basic_datagram_socket.html | 2 +- .../basic_datagram_socket/overload1.html | 2 +- .../basic_datagram_socket/overload2.html | 2 +- .../basic_datagram_socket/overload3.html | 2 +- .../basic_datagram_socket/overload4.html | 2 +- .../basic_datagram_socket/overload5.html | 2 +- .../basic_datagram_socket/overload6.html | 2 +- .../reference/basic_datagram_socket/bind.html | 2 +- .../basic_datagram_socket/bind/overload1.html | 2 +- .../basic_datagram_socket/bind/overload2.html | 2 +- .../reference/basic_datagram_socket/broadcast.html | 2 +- .../basic_datagram_socket/bytes_readable.html | 2 +- .../reference/basic_datagram_socket/cancel.html | 2 +- .../basic_datagram_socket/cancel/overload1.html | 2 +- .../basic_datagram_socket/cancel/overload2.html | 2 +- .../reference/basic_datagram_socket/close.html | 2 +- .../basic_datagram_socket/close/overload1.html | 2 +- .../basic_datagram_socket/close/overload2.html | 2 +- .../reference/basic_datagram_socket/connect.html | 2 +- .../basic_datagram_socket/connect/overload1.html | 2 +- .../basic_datagram_socket/connect/overload2.html | 2 +- .../reference/basic_datagram_socket/debug.html | 2 +- .../basic_datagram_socket/do_not_route.html | 2 +- .../enable_connection_aborted.html | 2 +- .../basic_datagram_socket/endpoint_type.html | 2 +- .../basic_datagram_socket/executor_type.html | 2 +- .../basic_datagram_socket/get_executor.html | 2 +- .../basic_datagram_socket/get_io_context.html | 2 +- .../basic_datagram_socket/get_io_service.html | 2 +- .../basic_datagram_socket/get_option.html | 2 +- .../get_option/overload1.html | 2 +- .../get_option/overload2.html | 2 +- .../basic_datagram_socket/io_control.html | 2 +- .../io_control/overload1.html | 2 +- .../io_control/overload2.html | 2 +- .../reference/basic_datagram_socket/is_open.html | 2 +- .../basic_datagram_socket/keep_alive.html | 2 +- .../reference/basic_datagram_socket/linger.html | 2 +- .../basic_datagram_socket/local_endpoint.html | 2 +- .../local_endpoint/overload1.html | 2 +- .../local_endpoint/overload2.html | 2 +- .../basic_datagram_socket/lowest_layer.html | 2 +- .../lowest_layer/overload1.html | 2 +- .../lowest_layer/overload2.html | 2 +- .../basic_datagram_socket/lowest_layer_type.html | 2 +- .../basic_datagram_socket/max_connections.html | 2 +- .../max_listen_connections.html | 2 +- .../message_do_not_route.html | 2 +- .../message_end_of_record.html | 2 +- .../basic_datagram_socket/message_flags.html | 2 +- .../basic_datagram_socket/message_out_of_band.html | 2 +- .../basic_datagram_socket/message_peek.html | 2 +- .../basic_datagram_socket/native_handle.html | 2 +- .../basic_datagram_socket/native_handle_type.html | 2 +- .../basic_datagram_socket/native_non_blocking.html | 2 +- .../native_non_blocking/overload1.html | 2 +- .../native_non_blocking/overload2.html | 2 +- .../native_non_blocking/overload3.html | 2 +- .../basic_datagram_socket/non_blocking.html | 2 +- .../non_blocking/overload1.html | 2 +- .../non_blocking/overload2.html | 2 +- .../non_blocking/overload3.html | 2 +- .../reference/basic_datagram_socket/open.html | 2 +- .../basic_datagram_socket/open/overload1.html | 2 +- .../basic_datagram_socket/open/overload2.html | 2 +- .../basic_datagram_socket/operator_eq_.html | 2 +- .../operator_eq_/overload1.html | 2 +- .../operator_eq_/overload2.html | 2 +- .../basic_datagram_socket/out_of_band_inline.html | 2 +- .../basic_datagram_socket/protocol_type.html | 2 +- .../reference/basic_datagram_socket/receive.html | 2 +- .../basic_datagram_socket/receive/overload1.html | 2 +- .../basic_datagram_socket/receive/overload2.html | 2 +- .../basic_datagram_socket/receive/overload3.html | 2 +- .../basic_datagram_socket/receive_buffer_size.html | 2 +- .../basic_datagram_socket/receive_from.html | 2 +- .../receive_from/overload1.html | 2 +- .../receive_from/overload2.html | 2 +- .../receive_from/overload3.html | 2 +- .../receive_low_watermark.html | 2 +- .../reference/basic_datagram_socket/release.html | 2 +- .../basic_datagram_socket/release/overload1.html | 2 +- .../basic_datagram_socket/release/overload2.html | 2 +- .../basic_datagram_socket/remote_endpoint.html | 2 +- .../remote_endpoint/overload1.html | 2 +- .../remote_endpoint/overload2.html | 2 +- .../basic_datagram_socket/reuse_address.html | 2 +- .../reference/basic_datagram_socket/send.html | 2 +- .../basic_datagram_socket/send/overload1.html | 2 +- .../basic_datagram_socket/send/overload2.html | 2 +- .../basic_datagram_socket/send/overload3.html | 2 +- .../basic_datagram_socket/send_buffer_size.html | 2 +- .../basic_datagram_socket/send_low_watermark.html | 2 +- .../reference/basic_datagram_socket/send_to.html | 2 +- .../basic_datagram_socket/send_to/overload1.html | 2 +- .../basic_datagram_socket/send_to/overload2.html | 2 +- .../basic_datagram_socket/send_to/overload3.html | 2 +- .../basic_datagram_socket/set_option.html | 2 +- .../set_option/overload1.html | 2 +- .../set_option/overload2.html | 2 +- .../reference/basic_datagram_socket/shutdown.html | 2 +- .../basic_datagram_socket/shutdown/overload1.html | 2 +- .../basic_datagram_socket/shutdown/overload2.html | 2 +- .../basic_datagram_socket/shutdown_type.html | 2 +- .../reference/basic_datagram_socket/wait.html | 2 +- .../basic_datagram_socket/wait/overload1.html | 2 +- .../basic_datagram_socket/wait/overload2.html | 2 +- .../reference/basic_datagram_socket/wait_type.html | 2 +- .../boost_asio/reference/basic_deadline_timer.html | 2 +- .../_basic_deadline_timer.html | 2 +- .../reference/basic_deadline_timer/async_wait.html | 2 +- .../basic_deadline_timer/basic_deadline_timer.html | 2 +- .../basic_deadline_timer/overload1.html | 2 +- .../basic_deadline_timer/overload2.html | 2 +- .../basic_deadline_timer/overload3.html | 2 +- .../basic_deadline_timer/overload4.html | 2 +- .../reference/basic_deadline_timer/cancel.html | 2 +- .../basic_deadline_timer/cancel/overload1.html | 2 +- .../basic_deadline_timer/cancel/overload2.html | 2 +- .../reference/basic_deadline_timer/cancel_one.html | 2 +- .../basic_deadline_timer/cancel_one/overload1.html | 2 +- .../basic_deadline_timer/cancel_one/overload2.html | 2 +- .../basic_deadline_timer/duration_type.html | 2 +- .../basic_deadline_timer/executor_type.html | 2 +- .../reference/basic_deadline_timer/expires_at.html | 2 +- .../basic_deadline_timer/expires_at/overload1.html | 2 +- .../basic_deadline_timer/expires_at/overload2.html | 2 +- .../basic_deadline_timer/expires_at/overload3.html | 2 +- .../basic_deadline_timer/expires_from_now.html | 2 +- .../expires_from_now/overload1.html | 2 +- .../expires_from_now/overload2.html | 2 +- .../expires_from_now/overload3.html | 2 +- .../basic_deadline_timer/get_executor.html | 2 +- .../basic_deadline_timer/get_io_context.html | 2 +- .../basic_deadline_timer/get_io_service.html | 2 +- .../basic_deadline_timer/operator_eq_.html | 2 +- .../reference/basic_deadline_timer/time_type.html | 2 +- .../basic_deadline_timer/traits_type.html | 2 +- .../reference/basic_deadline_timer/wait.html | 2 +- .../basic_deadline_timer/wait/overload1.html | 2 +- .../basic_deadline_timer/wait/overload2.html | 2 +- doc/html/boost_asio/reference/basic_io_object.html | 2 +- .../basic_io_object/_basic_io_object.html | 2 +- .../reference/basic_io_object/basic_io_object.html | 2 +- .../basic_io_object/basic_io_object/overload1.html | 2 +- .../basic_io_object/basic_io_object/overload2.html | 2 +- .../basic_io_object/basic_io_object/overload3.html | 2 +- .../reference/basic_io_object/executor_type.html | 2 +- .../reference/basic_io_object/get_executor.html | 2 +- .../basic_io_object/get_implementation.html | 2 +- .../get_implementation/overload1.html | 2 +- .../get_implementation/overload2.html | 2 +- .../reference/basic_io_object/get_io_context.html | 2 +- .../reference/basic_io_object/get_io_service.html | 2 +- .../reference/basic_io_object/get_service.html | 2 +- .../basic_io_object/get_service/overload1.html | 2 +- .../basic_io_object/get_service/overload2.html | 2 +- .../basic_io_object/implementation_type.html | 2 +- .../reference/basic_io_object/operator_eq_.html | 2 +- .../reference/basic_io_object/service_type.html | 2 +- .../boost_asio/reference/basic_raw_socket.html | 2 +- .../basic_raw_socket/_basic_raw_socket.html | 2 +- .../reference/basic_raw_socket/assign.html | 2 +- .../basic_raw_socket/assign/overload1.html | 2 +- .../basic_raw_socket/assign/overload2.html | 2 +- .../reference/basic_raw_socket/async_connect.html | 2 +- .../reference/basic_raw_socket/async_receive.html | 2 +- .../basic_raw_socket/async_receive/overload1.html | 2 +- .../basic_raw_socket/async_receive/overload2.html | 2 +- .../basic_raw_socket/async_receive_from.html | 2 +- .../async_receive_from/overload1.html | 2 +- .../async_receive_from/overload2.html | 2 +- .../reference/basic_raw_socket/async_send.html | 2 +- .../basic_raw_socket/async_send/overload1.html | 2 +- .../basic_raw_socket/async_send/overload2.html | 2 +- .../reference/basic_raw_socket/async_send_to.html | 2 +- .../basic_raw_socket/async_send_to/overload1.html | 2 +- .../basic_raw_socket/async_send_to/overload2.html | 2 +- .../reference/basic_raw_socket/async_wait.html | 2 +- .../reference/basic_raw_socket/at_mark.html | 2 +- .../basic_raw_socket/at_mark/overload1.html | 2 +- .../basic_raw_socket/at_mark/overload2.html | 2 +- .../reference/basic_raw_socket/available.html | 2 +- .../basic_raw_socket/available/overload1.html | 2 +- .../basic_raw_socket/available/overload2.html | 2 +- .../basic_raw_socket/basic_raw_socket.html | 2 +- .../basic_raw_socket/overload1.html | 2 +- .../basic_raw_socket/overload2.html | 2 +- .../basic_raw_socket/overload3.html | 2 +- .../basic_raw_socket/overload4.html | 2 +- .../basic_raw_socket/overload5.html | 2 +- .../basic_raw_socket/overload6.html | 2 +- .../reference/basic_raw_socket/bind.html | 2 +- .../reference/basic_raw_socket/bind/overload1.html | 2 +- .../reference/basic_raw_socket/bind/overload2.html | 2 +- .../reference/basic_raw_socket/broadcast.html | 2 +- .../reference/basic_raw_socket/bytes_readable.html | 2 +- .../reference/basic_raw_socket/cancel.html | 2 +- .../basic_raw_socket/cancel/overload1.html | 2 +- .../basic_raw_socket/cancel/overload2.html | 2 +- .../reference/basic_raw_socket/close.html | 2 +- .../basic_raw_socket/close/overload1.html | 2 +- .../basic_raw_socket/close/overload2.html | 2 +- .../reference/basic_raw_socket/connect.html | 2 +- .../basic_raw_socket/connect/overload1.html | 2 +- .../basic_raw_socket/connect/overload2.html | 2 +- .../reference/basic_raw_socket/debug.html | 2 +- .../reference/basic_raw_socket/do_not_route.html | 2 +- .../enable_connection_aborted.html | 2 +- .../reference/basic_raw_socket/endpoint_type.html | 2 +- .../reference/basic_raw_socket/executor_type.html | 2 +- .../reference/basic_raw_socket/get_executor.html | 2 +- .../reference/basic_raw_socket/get_io_context.html | 2 +- .../reference/basic_raw_socket/get_io_service.html | 2 +- .../reference/basic_raw_socket/get_option.html | 2 +- .../basic_raw_socket/get_option/overload1.html | 2 +- .../basic_raw_socket/get_option/overload2.html | 2 +- .../reference/basic_raw_socket/io_control.html | 2 +- .../basic_raw_socket/io_control/overload1.html | 2 +- .../basic_raw_socket/io_control/overload2.html | 2 +- .../reference/basic_raw_socket/is_open.html | 2 +- .../reference/basic_raw_socket/keep_alive.html | 2 +- .../reference/basic_raw_socket/linger.html | 2 +- .../reference/basic_raw_socket/local_endpoint.html | 2 +- .../basic_raw_socket/local_endpoint/overload1.html | 2 +- .../basic_raw_socket/local_endpoint/overload2.html | 2 +- .../reference/basic_raw_socket/lowest_layer.html | 2 +- .../basic_raw_socket/lowest_layer/overload1.html | 2 +- .../basic_raw_socket/lowest_layer/overload2.html | 2 +- .../basic_raw_socket/lowest_layer_type.html | 2 +- .../basic_raw_socket/max_connections.html | 2 +- .../basic_raw_socket/max_listen_connections.html | 2 +- .../basic_raw_socket/message_do_not_route.html | 2 +- .../basic_raw_socket/message_end_of_record.html | 2 +- .../reference/basic_raw_socket/message_flags.html | 2 +- .../basic_raw_socket/message_out_of_band.html | 2 +- .../reference/basic_raw_socket/message_peek.html | 2 +- .../reference/basic_raw_socket/native_handle.html | 2 +- .../basic_raw_socket/native_handle_type.html | 2 +- .../basic_raw_socket/native_non_blocking.html | 2 +- .../native_non_blocking/overload1.html | 2 +- .../native_non_blocking/overload2.html | 2 +- .../native_non_blocking/overload3.html | 2 +- .../reference/basic_raw_socket/non_blocking.html | 2 +- .../basic_raw_socket/non_blocking/overload1.html | 2 +- .../basic_raw_socket/non_blocking/overload2.html | 2 +- .../basic_raw_socket/non_blocking/overload3.html | 2 +- .../reference/basic_raw_socket/open.html | 2 +- .../reference/basic_raw_socket/open/overload1.html | 2 +- .../reference/basic_raw_socket/open/overload2.html | 2 +- .../reference/basic_raw_socket/operator_eq_.html | 2 +- .../basic_raw_socket/operator_eq_/overload1.html | 2 +- .../basic_raw_socket/operator_eq_/overload2.html | 2 +- .../basic_raw_socket/out_of_band_inline.html | 2 +- .../reference/basic_raw_socket/protocol_type.html | 2 +- .../reference/basic_raw_socket/receive.html | 2 +- .../basic_raw_socket/receive/overload1.html | 2 +- .../basic_raw_socket/receive/overload2.html | 2 +- .../basic_raw_socket/receive/overload3.html | 2 +- .../basic_raw_socket/receive_buffer_size.html | 2 +- .../reference/basic_raw_socket/receive_from.html | 2 +- .../basic_raw_socket/receive_from/overload1.html | 2 +- .../basic_raw_socket/receive_from/overload2.html | 2 +- .../basic_raw_socket/receive_from/overload3.html | 2 +- .../basic_raw_socket/receive_low_watermark.html | 2 +- .../reference/basic_raw_socket/release.html | 2 +- .../basic_raw_socket/release/overload1.html | 2 +- .../basic_raw_socket/release/overload2.html | 2 +- .../basic_raw_socket/remote_endpoint.html | 2 +- .../remote_endpoint/overload1.html | 2 +- .../remote_endpoint/overload2.html | 2 +- .../reference/basic_raw_socket/reuse_address.html | 2 +- .../reference/basic_raw_socket/send.html | 2 +- .../reference/basic_raw_socket/send/overload1.html | 2 +- .../reference/basic_raw_socket/send/overload2.html | 2 +- .../reference/basic_raw_socket/send/overload3.html | 2 +- .../basic_raw_socket/send_buffer_size.html | 2 +- .../basic_raw_socket/send_low_watermark.html | 2 +- .../reference/basic_raw_socket/send_to.html | 2 +- .../basic_raw_socket/send_to/overload1.html | 2 +- .../basic_raw_socket/send_to/overload2.html | 2 +- .../basic_raw_socket/send_to/overload3.html | 2 +- .../reference/basic_raw_socket/set_option.html | 2 +- .../basic_raw_socket/set_option/overload1.html | 2 +- .../basic_raw_socket/set_option/overload2.html | 2 +- .../reference/basic_raw_socket/shutdown.html | 2 +- .../basic_raw_socket/shutdown/overload1.html | 2 +- .../basic_raw_socket/shutdown/overload2.html | 2 +- .../reference/basic_raw_socket/shutdown_type.html | 2 +- .../reference/basic_raw_socket/wait.html | 2 +- .../reference/basic_raw_socket/wait/overload1.html | 2 +- .../reference/basic_raw_socket/wait/overload2.html | 2 +- .../reference/basic_raw_socket/wait_type.html | 2 +- .../reference/basic_seq_packet_socket.html | 2 +- .../_basic_seq_packet_socket.html | 2 +- .../reference/basic_seq_packet_socket/assign.html | 2 +- .../basic_seq_packet_socket/assign/overload1.html | 2 +- .../basic_seq_packet_socket/assign/overload2.html | 2 +- .../basic_seq_packet_socket/async_connect.html | 2 +- .../basic_seq_packet_socket/async_receive.html | 2 +- .../async_receive/overload1.html | 2 +- .../async_receive/overload2.html | 2 +- .../basic_seq_packet_socket/async_send.html | 2 +- .../basic_seq_packet_socket/async_wait.html | 2 +- .../reference/basic_seq_packet_socket/at_mark.html | 2 +- .../basic_seq_packet_socket/at_mark/overload1.html | 2 +- .../basic_seq_packet_socket/at_mark/overload2.html | 2 +- .../basic_seq_packet_socket/available.html | 2 +- .../available/overload1.html | 2 +- .../available/overload2.html | 2 +- .../basic_seq_packet_socket.html | 2 +- .../basic_seq_packet_socket/overload1.html | 2 +- .../basic_seq_packet_socket/overload2.html | 2 +- .../basic_seq_packet_socket/overload3.html | 2 +- .../basic_seq_packet_socket/overload4.html | 2 +- .../basic_seq_packet_socket/overload5.html | 2 +- .../basic_seq_packet_socket/overload6.html | 2 +- .../reference/basic_seq_packet_socket/bind.html | 2 +- .../basic_seq_packet_socket/bind/overload1.html | 2 +- .../basic_seq_packet_socket/bind/overload2.html | 2 +- .../basic_seq_packet_socket/broadcast.html | 2 +- .../basic_seq_packet_socket/bytes_readable.html | 2 +- .../reference/basic_seq_packet_socket/cancel.html | 2 +- .../basic_seq_packet_socket/cancel/overload1.html | 2 +- .../basic_seq_packet_socket/cancel/overload2.html | 2 +- .../reference/basic_seq_packet_socket/close.html | 2 +- .../basic_seq_packet_socket/close/overload1.html | 2 +- .../basic_seq_packet_socket/close/overload2.html | 2 +- .../reference/basic_seq_packet_socket/connect.html | 2 +- .../basic_seq_packet_socket/connect/overload1.html | 2 +- .../basic_seq_packet_socket/connect/overload2.html | 2 +- .../reference/basic_seq_packet_socket/debug.html | 2 +- .../basic_seq_packet_socket/do_not_route.html | 2 +- .../enable_connection_aborted.html | 2 +- .../basic_seq_packet_socket/endpoint_type.html | 2 +- .../basic_seq_packet_socket/executor_type.html | 2 +- .../basic_seq_packet_socket/get_executor.html | 2 +- .../basic_seq_packet_socket/get_io_context.html | 2 +- .../basic_seq_packet_socket/get_io_service.html | 2 +- .../basic_seq_packet_socket/get_option.html | 2 +- .../get_option/overload1.html | 2 +- .../get_option/overload2.html | 2 +- .../basic_seq_packet_socket/io_control.html | 2 +- .../io_control/overload1.html | 2 +- .../io_control/overload2.html | 2 +- .../reference/basic_seq_packet_socket/is_open.html | 2 +- .../basic_seq_packet_socket/keep_alive.html | 2 +- .../reference/basic_seq_packet_socket/linger.html | 2 +- .../basic_seq_packet_socket/local_endpoint.html | 2 +- .../local_endpoint/overload1.html | 2 +- .../local_endpoint/overload2.html | 2 +- .../basic_seq_packet_socket/lowest_layer.html | 2 +- .../lowest_layer/overload1.html | 2 +- .../lowest_layer/overload2.html | 2 +- .../basic_seq_packet_socket/lowest_layer_type.html | 2 +- .../basic_seq_packet_socket/max_connections.html | 2 +- .../max_listen_connections.html | 2 +- .../message_do_not_route.html | 2 +- .../message_end_of_record.html | 2 +- .../basic_seq_packet_socket/message_flags.html | 2 +- .../message_out_of_band.html | 2 +- .../basic_seq_packet_socket/message_peek.html | 2 +- .../basic_seq_packet_socket/native_handle.html | 2 +- .../native_handle_type.html | 2 +- .../native_non_blocking.html | 2 +- .../native_non_blocking/overload1.html | 2 +- .../native_non_blocking/overload2.html | 2 +- .../native_non_blocking/overload3.html | 2 +- .../basic_seq_packet_socket/non_blocking.html | 2 +- .../non_blocking/overload1.html | 2 +- .../non_blocking/overload2.html | 2 +- .../non_blocking/overload3.html | 2 +- .../reference/basic_seq_packet_socket/open.html | 2 +- .../basic_seq_packet_socket/open/overload1.html | 2 +- .../basic_seq_packet_socket/open/overload2.html | 2 +- .../basic_seq_packet_socket/operator_eq_.html | 2 +- .../operator_eq_/overload1.html | 2 +- .../operator_eq_/overload2.html | 2 +- .../out_of_band_inline.html | 2 +- .../basic_seq_packet_socket/protocol_type.html | 2 +- .../reference/basic_seq_packet_socket/receive.html | 2 +- .../basic_seq_packet_socket/receive/overload1.html | 2 +- .../basic_seq_packet_socket/receive/overload2.html | 2 +- .../basic_seq_packet_socket/receive/overload3.html | 2 +- .../receive_buffer_size.html | 2 +- .../receive_low_watermark.html | 2 +- .../reference/basic_seq_packet_socket/release.html | 2 +- .../basic_seq_packet_socket/release/overload1.html | 2 +- .../basic_seq_packet_socket/release/overload2.html | 2 +- .../basic_seq_packet_socket/remote_endpoint.html | 2 +- .../remote_endpoint/overload1.html | 2 +- .../remote_endpoint/overload2.html | 2 +- .../basic_seq_packet_socket/reuse_address.html | 2 +- .../reference/basic_seq_packet_socket/send.html | 2 +- .../basic_seq_packet_socket/send/overload1.html | 2 +- .../basic_seq_packet_socket/send/overload2.html | 2 +- .../basic_seq_packet_socket/send_buffer_size.html | 2 +- .../send_low_watermark.html | 2 +- .../basic_seq_packet_socket/set_option.html | 2 +- .../set_option/overload1.html | 2 +- .../set_option/overload2.html | 2 +- .../basic_seq_packet_socket/shutdown.html | 2 +- .../shutdown/overload1.html | 2 +- .../shutdown/overload2.html | 2 +- .../basic_seq_packet_socket/shutdown_type.html | 2 +- .../reference/basic_seq_packet_socket/wait.html | 2 +- .../basic_seq_packet_socket/wait/overload1.html | 2 +- .../basic_seq_packet_socket/wait/overload2.html | 2 +- .../basic_seq_packet_socket/wait_type.html | 2 +- doc/html/boost_asio/reference/basic_socket.html | 2 +- .../reference/basic_socket/_basic_socket.html | 2 +- .../boost_asio/reference/basic_socket/assign.html | 2 +- .../reference/basic_socket/assign/overload1.html | 2 +- .../reference/basic_socket/assign/overload2.html | 2 +- .../reference/basic_socket/async_connect.html | 2 +- .../reference/basic_socket/async_wait.html | 2 +- .../boost_asio/reference/basic_socket/at_mark.html | 2 +- .../reference/basic_socket/at_mark/overload1.html | 2 +- .../reference/basic_socket/at_mark/overload2.html | 2 +- .../reference/basic_socket/available.html | 2 +- .../basic_socket/available/overload1.html | 2 +- .../basic_socket/available/overload2.html | 2 +- .../reference/basic_socket/basic_socket.html | 2 +- .../basic_socket/basic_socket/overload1.html | 2 +- .../basic_socket/basic_socket/overload2.html | 2 +- .../basic_socket/basic_socket/overload3.html | 2 +- .../basic_socket/basic_socket/overload4.html | 2 +- .../basic_socket/basic_socket/overload5.html | 2 +- .../basic_socket/basic_socket/overload6.html | 2 +- .../boost_asio/reference/basic_socket/bind.html | 2 +- .../reference/basic_socket/bind/overload1.html | 2 +- .../reference/basic_socket/bind/overload2.html | 2 +- .../reference/basic_socket/broadcast.html | 2 +- .../reference/basic_socket/bytes_readable.html | 2 +- .../boost_asio/reference/basic_socket/cancel.html | 2 +- .../reference/basic_socket/cancel/overload1.html | 2 +- .../reference/basic_socket/cancel/overload2.html | 2 +- .../boost_asio/reference/basic_socket/close.html | 2 +- .../reference/basic_socket/close/overload1.html | 2 +- .../reference/basic_socket/close/overload2.html | 2 +- .../boost_asio/reference/basic_socket/connect.html | 2 +- .../reference/basic_socket/connect/overload1.html | 2 +- .../reference/basic_socket/connect/overload2.html | 2 +- .../boost_asio/reference/basic_socket/debug.html | 2 +- .../reference/basic_socket/do_not_route.html | 2 +- .../basic_socket/enable_connection_aborted.html | 2 +- .../reference/basic_socket/endpoint_type.html | 2 +- .../reference/basic_socket/executor_type.html | 2 +- .../reference/basic_socket/get_executor.html | 2 +- .../reference/basic_socket/get_io_context.html | 2 +- .../reference/basic_socket/get_io_service.html | 2 +- .../reference/basic_socket/get_option.html | 2 +- .../basic_socket/get_option/overload1.html | 2 +- .../basic_socket/get_option/overload2.html | 2 +- .../reference/basic_socket/io_control.html | 2 +- .../basic_socket/io_control/overload1.html | 2 +- .../basic_socket/io_control/overload2.html | 2 +- .../boost_asio/reference/basic_socket/is_open.html | 2 +- .../reference/basic_socket/keep_alive.html | 2 +- .../boost_asio/reference/basic_socket/linger.html | 2 +- .../reference/basic_socket/local_endpoint.html | 2 +- .../basic_socket/local_endpoint/overload1.html | 2 +- .../basic_socket/local_endpoint/overload2.html | 2 +- .../reference/basic_socket/lowest_layer.html | 2 +- .../basic_socket/lowest_layer/overload1.html | 2 +- .../basic_socket/lowest_layer/overload2.html | 2 +- .../reference/basic_socket/lowest_layer_type.html | 2 +- .../reference/basic_socket/max_connections.html | 2 +- .../basic_socket/max_listen_connections.html | 2 +- .../basic_socket/message_do_not_route.html | 2 +- .../basic_socket/message_end_of_record.html | 2 +- .../reference/basic_socket/message_flags.html | 2 +- .../basic_socket/message_out_of_band.html | 2 +- .../reference/basic_socket/message_peek.html | 2 +- .../reference/basic_socket/native_handle.html | 2 +- .../reference/basic_socket/native_handle_type.html | 2 +- .../basic_socket/native_non_blocking.html | 2 +- .../native_non_blocking/overload1.html | 2 +- .../native_non_blocking/overload2.html | 2 +- .../native_non_blocking/overload3.html | 2 +- .../reference/basic_socket/non_blocking.html | 2 +- .../basic_socket/non_blocking/overload1.html | 2 +- .../basic_socket/non_blocking/overload2.html | 2 +- .../basic_socket/non_blocking/overload3.html | 2 +- .../boost_asio/reference/basic_socket/open.html | 2 +- .../reference/basic_socket/open/overload1.html | 2 +- .../reference/basic_socket/open/overload2.html | 2 +- .../reference/basic_socket/operator_eq_.html | 2 +- .../basic_socket/operator_eq_/overload1.html | 2 +- .../basic_socket/operator_eq_/overload2.html | 2 +- .../reference/basic_socket/out_of_band_inline.html | 2 +- .../reference/basic_socket/protocol_type.html | 2 +- .../basic_socket/receive_buffer_size.html | 2 +- .../basic_socket/receive_low_watermark.html | 2 +- .../boost_asio/reference/basic_socket/release.html | 2 +- .../reference/basic_socket/release/overload1.html | 2 +- .../reference/basic_socket/release/overload2.html | 2 +- .../reference/basic_socket/remote_endpoint.html | 2 +- .../basic_socket/remote_endpoint/overload1.html | 2 +- .../basic_socket/remote_endpoint/overload2.html | 2 +- .../reference/basic_socket/reuse_address.html | 2 +- .../reference/basic_socket/send_buffer_size.html | 2 +- .../reference/basic_socket/send_low_watermark.html | 2 +- .../reference/basic_socket/set_option.html | 2 +- .../basic_socket/set_option/overload1.html | 2 +- .../basic_socket/set_option/overload2.html | 2 +- .../reference/basic_socket/shutdown.html | 2 +- .../reference/basic_socket/shutdown/overload1.html | 2 +- .../reference/basic_socket/shutdown/overload2.html | 2 +- .../reference/basic_socket/shutdown_type.html | 2 +- .../boost_asio/reference/basic_socket/wait.html | 2 +- .../reference/basic_socket/wait/overload1.html | 2 +- .../reference/basic_socket/wait/overload2.html | 2 +- .../reference/basic_socket/wait_type.html | 2 +- .../reference/basic_socket_acceptor.html | 2 +- .../_basic_socket_acceptor.html | 2 +- .../reference/basic_socket_acceptor/accept.html | 2 +- .../basic_socket_acceptor/accept/overload1.html | 2 +- .../basic_socket_acceptor/accept/overload10.html | 2 +- .../basic_socket_acceptor/accept/overload11.html | 2 +- .../basic_socket_acceptor/accept/overload12.html | 2 +- .../basic_socket_acceptor/accept/overload2.html | 2 +- .../basic_socket_acceptor/accept/overload3.html | 2 +- .../basic_socket_acceptor/accept/overload4.html | 2 +- .../basic_socket_acceptor/accept/overload5.html | 2 +- .../basic_socket_acceptor/accept/overload6.html | 2 +- .../basic_socket_acceptor/accept/overload7.html | 2 +- .../basic_socket_acceptor/accept/overload8.html | 2 +- .../basic_socket_acceptor/accept/overload9.html | 2 +- .../reference/basic_socket_acceptor/assign.html | 2 +- .../basic_socket_acceptor/assign/overload1.html | 2 +- .../basic_socket_acceptor/assign/overload2.html | 2 +- .../basic_socket_acceptor/async_accept.html | 2 +- .../async_accept/overload1.html | 2 +- .../async_accept/overload2.html | 2 +- .../async_accept/overload3.html | 2 +- .../async_accept/overload4.html | 2 +- .../async_accept/overload5.html | 2 +- .../async_accept/overload6.html | 2 +- .../basic_socket_acceptor/async_wait.html | 2 +- .../basic_socket_acceptor.html | 2 +- .../basic_socket_acceptor/overload1.html | 2 +- .../basic_socket_acceptor/overload2.html | 2 +- .../basic_socket_acceptor/overload3.html | 2 +- .../basic_socket_acceptor/overload4.html | 2 +- .../basic_socket_acceptor/overload5.html | 2 +- .../basic_socket_acceptor/overload6.html | 2 +- .../reference/basic_socket_acceptor/bind.html | 2 +- .../basic_socket_acceptor/bind/overload1.html | 2 +- .../basic_socket_acceptor/bind/overload2.html | 2 +- .../reference/basic_socket_acceptor/broadcast.html | 2 +- .../basic_socket_acceptor/bytes_readable.html | 2 +- .../reference/basic_socket_acceptor/cancel.html | 2 +- .../basic_socket_acceptor/cancel/overload1.html | 2 +- .../basic_socket_acceptor/cancel/overload2.html | 2 +- .../reference/basic_socket_acceptor/close.html | 2 +- .../basic_socket_acceptor/close/overload1.html | 2 +- .../basic_socket_acceptor/close/overload2.html | 2 +- .../reference/basic_socket_acceptor/debug.html | 2 +- .../basic_socket_acceptor/do_not_route.html | 2 +- .../enable_connection_aborted.html | 2 +- .../basic_socket_acceptor/endpoint_type.html | 2 +- .../basic_socket_acceptor/executor_type.html | 2 +- .../basic_socket_acceptor/get_executor.html | 2 +- .../basic_socket_acceptor/get_io_context.html | 2 +- .../basic_socket_acceptor/get_io_service.html | 2 +- .../basic_socket_acceptor/get_option.html | 6 +- .../get_option/overload1.html | 4 +- .../get_option/overload2.html | 4 +- .../basic_socket_acceptor/io_control.html | 2 +- .../io_control/overload1.html | 2 +- .../io_control/overload2.html | 2 +- .../reference/basic_socket_acceptor/is_open.html | 2 +- .../basic_socket_acceptor/keep_alive.html | 2 +- .../reference/basic_socket_acceptor/linger.html | 2 +- .../reference/basic_socket_acceptor/listen.html | 2 +- .../basic_socket_acceptor/listen/overload1.html | 2 +- .../basic_socket_acceptor/listen/overload2.html | 2 +- .../basic_socket_acceptor/local_endpoint.html | 2 +- .../local_endpoint/overload1.html | 2 +- .../local_endpoint/overload2.html | 2 +- .../basic_socket_acceptor/max_connections.html | 2 +- .../max_listen_connections.html | 2 +- .../message_do_not_route.html | 2 +- .../message_end_of_record.html | 2 +- .../basic_socket_acceptor/message_flags.html | 2 +- .../basic_socket_acceptor/message_out_of_band.html | 2 +- .../basic_socket_acceptor/message_peek.html | 2 +- .../basic_socket_acceptor/native_handle.html | 2 +- .../basic_socket_acceptor/native_handle_type.html | 2 +- .../basic_socket_acceptor/native_non_blocking.html | 2 +- .../native_non_blocking/overload1.html | 2 +- .../native_non_blocking/overload2.html | 2 +- .../native_non_blocking/overload3.html | 2 +- .../basic_socket_acceptor/non_blocking.html | 2 +- .../non_blocking/overload1.html | 2 +- .../non_blocking/overload2.html | 2 +- .../non_blocking/overload3.html | 2 +- .../reference/basic_socket_acceptor/open.html | 2 +- .../basic_socket_acceptor/open/overload1.html | 2 +- .../basic_socket_acceptor/open/overload2.html | 2 +- .../basic_socket_acceptor/operator_eq_.html | 2 +- .../operator_eq_/overload1.html | 2 +- .../operator_eq_/overload2.html | 2 +- .../basic_socket_acceptor/out_of_band_inline.html | 2 +- .../basic_socket_acceptor/protocol_type.html | 2 +- .../basic_socket_acceptor/receive_buffer_size.html | 2 +- .../receive_low_watermark.html | 2 +- .../reference/basic_socket_acceptor/release.html | 2 +- .../basic_socket_acceptor/release/overload1.html | 2 +- .../basic_socket_acceptor/release/overload2.html | 2 +- .../basic_socket_acceptor/reuse_address.html | 2 +- .../basic_socket_acceptor/send_buffer_size.html | 2 +- .../basic_socket_acceptor/send_low_watermark.html | 2 +- .../basic_socket_acceptor/set_option.html | 2 +- .../set_option/overload1.html | 2 +- .../set_option/overload2.html | 2 +- .../basic_socket_acceptor/shutdown_type.html | 2 +- .../reference/basic_socket_acceptor/wait.html | 2 +- .../basic_socket_acceptor/wait/overload1.html | 2 +- .../basic_socket_acceptor/wait/overload2.html | 2 +- .../reference/basic_socket_acceptor/wait_type.html | 2 +- .../reference/basic_socket_iostream.html | 2 +- .../basic_socket_iostream.html | 2 +- .../basic_socket_iostream/overload1.html | 2 +- .../basic_socket_iostream/overload2.html | 2 +- .../basic_socket_iostream/overload3.html | 2 +- .../basic_socket_iostream/overload4.html | 2 +- .../basic_socket_iostream/clock_type.html | 2 +- .../reference/basic_socket_iostream/close.html | 2 +- .../reference/basic_socket_iostream/connect.html | 2 +- .../reference/basic_socket_iostream/duration.html | 2 +- .../basic_socket_iostream/duration_type.html | 2 +- .../basic_socket_iostream/endpoint_type.html | 2 +- .../reference/basic_socket_iostream/error.html | 2 +- .../basic_socket_iostream/expires_after.html | 2 +- .../basic_socket_iostream/expires_at.html | 2 +- .../expires_at/overload1.html | 2 +- .../expires_at/overload2.html | 2 +- .../basic_socket_iostream/expires_from_now.html | 2 +- .../expires_from_now/overload1.html | 2 +- .../expires_from_now/overload2.html | 2 +- .../reference/basic_socket_iostream/expiry.html | 2 +- .../basic_socket_iostream/operator_eq_.html | 2 +- .../basic_socket_iostream/protocol_type.html | 2 +- .../reference/basic_socket_iostream/rdbuf.html | 2 +- .../reference/basic_socket_iostream/socket.html | 2 +- .../basic_socket_iostream/time_point.html | 2 +- .../reference/basic_socket_iostream/time_type.html | 2 +- .../reference/basic_socket_streambuf.html | 2 +- .../_basic_socket_streambuf.html | 2 +- .../basic_socket_streambuf.html | 2 +- .../basic_socket_streambuf/overload1.html | 2 +- .../basic_socket_streambuf/overload2.html | 2 +- .../basic_socket_streambuf/overload3.html | 2 +- .../basic_socket_streambuf/clock_type.html | 2 +- .../reference/basic_socket_streambuf/close.html | 2 +- .../reference/basic_socket_streambuf/connect.html | 2 +- .../basic_socket_streambuf/connect/overload1.html | 2 +- .../basic_socket_streambuf/connect/overload2.html | 2 +- .../reference/basic_socket_streambuf/duration.html | 2 +- .../basic_socket_streambuf/duration_type.html | 2 +- .../basic_socket_streambuf/endpoint_type.html | 2 +- .../reference/basic_socket_streambuf/error.html | 2 +- .../basic_socket_streambuf/expires_after.html | 2 +- .../basic_socket_streambuf/expires_at.html | 2 +- .../expires_at/overload1.html | 2 +- .../expires_at/overload2.html | 2 +- .../basic_socket_streambuf/expires_from_now.html | 2 +- .../expires_from_now/overload1.html | 2 +- .../expires_from_now/overload2.html | 2 +- .../reference/basic_socket_streambuf/expiry.html | 2 +- .../basic_socket_streambuf/operator_eq_.html | 2 +- .../reference/basic_socket_streambuf/overflow.html | 2 +- .../basic_socket_streambuf/protocol_type.html | 2 +- .../reference/basic_socket_streambuf/puberror.html | 2 +- .../reference/basic_socket_streambuf/setbuf.html | 2 +- .../reference/basic_socket_streambuf/socket.html | 2 +- .../reference/basic_socket_streambuf/sync.html | 2 +- .../basic_socket_streambuf/time_point.html | 2 +- .../basic_socket_streambuf/time_type.html | 2 +- .../basic_socket_streambuf/underflow.html | 2 +- .../boost_asio/reference/basic_stream_socket.html | 2 +- .../basic_stream_socket/_basic_stream_socket.html | 2 +- .../reference/basic_stream_socket/assign.html | 2 +- .../basic_stream_socket/assign/overload1.html | 2 +- .../basic_stream_socket/assign/overload2.html | 2 +- .../basic_stream_socket/async_connect.html | 2 +- .../basic_stream_socket/async_read_some.html | 2 +- .../basic_stream_socket/async_receive.html | 2 +- .../async_receive/overload1.html | 2 +- .../async_receive/overload2.html | 2 +- .../reference/basic_stream_socket/async_send.html | 2 +- .../basic_stream_socket/async_send/overload1.html | 2 +- .../basic_stream_socket/async_send/overload2.html | 2 +- .../reference/basic_stream_socket/async_wait.html | 2 +- .../basic_stream_socket/async_write_some.html | 2 +- .../reference/basic_stream_socket/at_mark.html | 2 +- .../basic_stream_socket/at_mark/overload1.html | 2 +- .../basic_stream_socket/at_mark/overload2.html | 2 +- .../reference/basic_stream_socket/available.html | 2 +- .../basic_stream_socket/available/overload1.html | 2 +- .../basic_stream_socket/available/overload2.html | 2 +- .../basic_stream_socket/basic_stream_socket.html | 2 +- .../basic_stream_socket/overload1.html | 2 +- .../basic_stream_socket/overload2.html | 2 +- .../basic_stream_socket/overload3.html | 2 +- .../basic_stream_socket/overload4.html | 2 +- .../basic_stream_socket/overload5.html | 2 +- .../basic_stream_socket/overload6.html | 2 +- .../reference/basic_stream_socket/bind.html | 2 +- .../basic_stream_socket/bind/overload1.html | 2 +- .../basic_stream_socket/bind/overload2.html | 2 +- .../reference/basic_stream_socket/broadcast.html | 2 +- .../basic_stream_socket/bytes_readable.html | 2 +- .../reference/basic_stream_socket/cancel.html | 2 +- .../basic_stream_socket/cancel/overload1.html | 2 +- .../basic_stream_socket/cancel/overload2.html | 2 +- .../reference/basic_stream_socket/close.html | 2 +- .../basic_stream_socket/close/overload1.html | 2 +- .../basic_stream_socket/close/overload2.html | 2 +- .../reference/basic_stream_socket/connect.html | 2 +- .../basic_stream_socket/connect/overload1.html | 2 +- .../basic_stream_socket/connect/overload2.html | 2 +- .../reference/basic_stream_socket/debug.html | 2 +- .../basic_stream_socket/do_not_route.html | 2 +- .../enable_connection_aborted.html | 2 +- .../basic_stream_socket/endpoint_type.html | 2 +- .../basic_stream_socket/executor_type.html | 2 +- .../basic_stream_socket/get_executor.html | 2 +- .../basic_stream_socket/get_io_context.html | 2 +- .../basic_stream_socket/get_io_service.html | 2 +- .../reference/basic_stream_socket/get_option.html | 2 +- .../basic_stream_socket/get_option/overload1.html | 2 +- .../basic_stream_socket/get_option/overload2.html | 2 +- .../reference/basic_stream_socket/io_control.html | 2 +- .../basic_stream_socket/io_control/overload1.html | 2 +- .../basic_stream_socket/io_control/overload2.html | 2 +- .../reference/basic_stream_socket/is_open.html | 2 +- .../reference/basic_stream_socket/keep_alive.html | 2 +- .../reference/basic_stream_socket/linger.html | 2 +- .../basic_stream_socket/local_endpoint.html | 2 +- .../local_endpoint/overload1.html | 2 +- .../local_endpoint/overload2.html | 2 +- .../basic_stream_socket/lowest_layer.html | 2 +- .../lowest_layer/overload1.html | 2 +- .../lowest_layer/overload2.html | 2 +- .../basic_stream_socket/lowest_layer_type.html | 2 +- .../basic_stream_socket/max_connections.html | 2 +- .../max_listen_connections.html | 2 +- .../basic_stream_socket/message_do_not_route.html | 2 +- .../basic_stream_socket/message_end_of_record.html | 2 +- .../basic_stream_socket/message_flags.html | 2 +- .../basic_stream_socket/message_out_of_band.html | 2 +- .../basic_stream_socket/message_peek.html | 2 +- .../basic_stream_socket/native_handle.html | 2 +- .../basic_stream_socket/native_handle_type.html | 2 +- .../basic_stream_socket/native_non_blocking.html | 2 +- .../native_non_blocking/overload1.html | 2 +- .../native_non_blocking/overload2.html | 2 +- .../native_non_blocking/overload3.html | 2 +- .../basic_stream_socket/non_blocking.html | 2 +- .../non_blocking/overload1.html | 2 +- .../non_blocking/overload2.html | 2 +- .../non_blocking/overload3.html | 2 +- .../reference/basic_stream_socket/open.html | 2 +- .../basic_stream_socket/open/overload1.html | 2 +- .../basic_stream_socket/open/overload2.html | 2 +- .../basic_stream_socket/operator_eq_.html | 2 +- .../operator_eq_/overload1.html | 2 +- .../operator_eq_/overload2.html | 2 +- .../basic_stream_socket/out_of_band_inline.html | 2 +- .../basic_stream_socket/protocol_type.html | 2 +- .../reference/basic_stream_socket/read_some.html | 2 +- .../basic_stream_socket/read_some/overload1.html | 2 +- .../basic_stream_socket/read_some/overload2.html | 2 +- .../reference/basic_stream_socket/receive.html | 2 +- .../basic_stream_socket/receive/overload1.html | 2 +- .../basic_stream_socket/receive/overload2.html | 2 +- .../basic_stream_socket/receive/overload3.html | 2 +- .../basic_stream_socket/receive_buffer_size.html | 2 +- .../basic_stream_socket/receive_low_watermark.html | 2 +- .../reference/basic_stream_socket/release.html | 2 +- .../basic_stream_socket/release/overload1.html | 2 +- .../basic_stream_socket/release/overload2.html | 2 +- .../basic_stream_socket/remote_endpoint.html | 2 +- .../remote_endpoint/overload1.html | 2 +- .../remote_endpoint/overload2.html | 2 +- .../basic_stream_socket/reuse_address.html | 2 +- .../reference/basic_stream_socket/send.html | 2 +- .../basic_stream_socket/send/overload1.html | 2 +- .../basic_stream_socket/send/overload2.html | 2 +- .../basic_stream_socket/send/overload3.html | 2 +- .../basic_stream_socket/send_buffer_size.html | 2 +- .../basic_stream_socket/send_low_watermark.html | 2 +- .../reference/basic_stream_socket/set_option.html | 2 +- .../basic_stream_socket/set_option/overload1.html | 2 +- .../basic_stream_socket/set_option/overload2.html | 2 +- .../reference/basic_stream_socket/shutdown.html | 2 +- .../basic_stream_socket/shutdown/overload1.html | 2 +- .../basic_stream_socket/shutdown/overload2.html | 2 +- .../basic_stream_socket/shutdown_type.html | 2 +- .../reference/basic_stream_socket/wait.html | 2 +- .../basic_stream_socket/wait/overload1.html | 2 +- .../basic_stream_socket/wait/overload2.html | 2 +- .../reference/basic_stream_socket/wait_type.html | 2 +- .../reference/basic_stream_socket/write_some.html | 2 +- .../basic_stream_socket/write_some/overload1.html | 2 +- .../basic_stream_socket/write_some/overload2.html | 2 +- doc/html/boost_asio/reference/basic_streambuf.html | 2 +- .../reference/basic_streambuf/basic_streambuf.html | 2 +- .../reference/basic_streambuf/capacity.html | 2 +- .../reference/basic_streambuf/commit.html | 2 +- .../basic_streambuf/const_buffers_type.html | 2 +- .../reference/basic_streambuf/consume.html | 2 +- .../boost_asio/reference/basic_streambuf/data.html | 2 +- .../reference/basic_streambuf/max_size.html | 2 +- .../basic_streambuf/mutable_buffers_type.html | 2 +- .../reference/basic_streambuf/overflow.html | 2 +- .../reference/basic_streambuf/prepare.html | 2 +- .../reference/basic_streambuf/reserve.html | 2 +- .../boost_asio/reference/basic_streambuf/size.html | 2 +- .../reference/basic_streambuf/underflow.html | 2 +- .../boost_asio/reference/basic_streambuf_ref.html | 2 +- .../basic_streambuf_ref/basic_streambuf_ref.html | 2 +- .../basic_streambuf_ref/overload1.html | 2 +- .../basic_streambuf_ref/overload2.html | 2 +- .../basic_streambuf_ref/overload3.html | 2 +- .../reference/basic_streambuf_ref/capacity.html | 2 +- .../reference/basic_streambuf_ref/commit.html | 2 +- .../basic_streambuf_ref/const_buffers_type.html | 2 +- .../reference/basic_streambuf_ref/consume.html | 2 +- .../reference/basic_streambuf_ref/data.html | 2 +- .../reference/basic_streambuf_ref/max_size.html | 2 +- .../basic_streambuf_ref/mutable_buffers_type.html | 2 +- .../reference/basic_streambuf_ref/prepare.html | 2 +- .../reference/basic_streambuf_ref/size.html | 2 +- .../boost_asio/reference/basic_waitable_timer.html | 2 +- .../_basic_waitable_timer.html | 2 +- .../reference/basic_waitable_timer/async_wait.html | 2 +- .../basic_waitable_timer/basic_waitable_timer.html | 2 +- .../basic_waitable_timer/overload1.html | 2 +- .../basic_waitable_timer/overload2.html | 2 +- .../basic_waitable_timer/overload3.html | 2 +- .../basic_waitable_timer/overload4.html | 2 +- .../reference/basic_waitable_timer/cancel.html | 2 +- .../basic_waitable_timer/cancel/overload1.html | 2 +- .../basic_waitable_timer/cancel/overload2.html | 2 +- .../reference/basic_waitable_timer/cancel_one.html | 2 +- .../basic_waitable_timer/cancel_one/overload1.html | 2 +- .../basic_waitable_timer/cancel_one/overload2.html | 2 +- .../reference/basic_waitable_timer/clock_type.html | 2 +- .../reference/basic_waitable_timer/duration.html | 2 +- .../basic_waitable_timer/executor_type.html | 2 +- .../basic_waitable_timer/expires_after.html | 2 +- .../reference/basic_waitable_timer/expires_at.html | 2 +- .../basic_waitable_timer/expires_at/overload1.html | 2 +- .../basic_waitable_timer/expires_at/overload2.html | 2 +- .../basic_waitable_timer/expires_at/overload3.html | 2 +- .../basic_waitable_timer/expires_from_now.html | 2 +- .../expires_from_now/overload1.html | 2 +- .../expires_from_now/overload2.html | 2 +- .../expires_from_now/overload3.html | 2 +- .../reference/basic_waitable_timer/expiry.html | 2 +- .../basic_waitable_timer/get_executor.html | 2 +- .../basic_waitable_timer/get_io_context.html | 2 +- .../basic_waitable_timer/get_io_service.html | 2 +- .../basic_waitable_timer/operator_eq_.html | 2 +- .../reference/basic_waitable_timer/time_point.html | 2 +- .../basic_waitable_timer/traits_type.html | 2 +- .../reference/basic_waitable_timer/wait.html | 2 +- .../basic_waitable_timer/wait/overload1.html | 2 +- .../basic_waitable_timer/wait/overload2.html | 2 +- .../boost_asio/reference/basic_yield_context.html | 2 +- .../basic_yield_context/basic_yield_context.html | 2 +- .../basic_yield_context/overload1.html | 2 +- .../basic_yield_context/overload2.html | 2 +- .../reference/basic_yield_context/callee_type.html | 2 +- .../reference/basic_yield_context/caller_type.html | 2 +- .../basic_yield_context/operator_lb__rb_.html | 2 +- doc/html/boost_asio/reference/bind_executor.html | 2 +- .../reference/bind_executor/overload1.html | 2 +- .../reference/bind_executor/overload2.html | 2 +- doc/html/boost_asio/reference/buffer.html | 2 +- .../boost_asio/reference/buffer/overload1.html | 2 +- .../boost_asio/reference/buffer/overload10.html | 2 +- .../boost_asio/reference/buffer/overload11.html | 2 +- .../boost_asio/reference/buffer/overload12.html | 2 +- .../boost_asio/reference/buffer/overload13.html | 2 +- .../boost_asio/reference/buffer/overload14.html | 2 +- .../boost_asio/reference/buffer/overload15.html | 2 +- .../boost_asio/reference/buffer/overload16.html | 2 +- .../boost_asio/reference/buffer/overload17.html | 2 +- .../boost_asio/reference/buffer/overload18.html | 2 +- .../boost_asio/reference/buffer/overload19.html | 2 +- .../boost_asio/reference/buffer/overload2.html | 2 +- .../boost_asio/reference/buffer/overload20.html | 2 +- .../boost_asio/reference/buffer/overload21.html | 2 +- .../boost_asio/reference/buffer/overload22.html | 2 +- .../boost_asio/reference/buffer/overload23.html | 2 +- .../boost_asio/reference/buffer/overload24.html | 2 +- .../boost_asio/reference/buffer/overload25.html | 2 +- .../boost_asio/reference/buffer/overload26.html | 2 +- .../boost_asio/reference/buffer/overload27.html | 2 +- .../boost_asio/reference/buffer/overload28.html | 2 +- .../boost_asio/reference/buffer/overload29.html | 2 +- .../boost_asio/reference/buffer/overload3.html | 2 +- .../boost_asio/reference/buffer/overload30.html | 2 +- .../boost_asio/reference/buffer/overload31.html | 2 +- .../boost_asio/reference/buffer/overload32.html | 2 +- .../boost_asio/reference/buffer/overload4.html | 2 +- .../boost_asio/reference/buffer/overload5.html | 2 +- .../boost_asio/reference/buffer/overload6.html | 2 +- .../boost_asio/reference/buffer/overload7.html | 2 +- .../boost_asio/reference/buffer/overload8.html | 2 +- .../boost_asio/reference/buffer/overload9.html | 2 +- doc/html/boost_asio/reference/buffer_cast.html | 2 +- .../reference/buffer_cast/overload1.html | 2 +- .../reference/buffer_cast/overload2.html | 2 +- doc/html/boost_asio/reference/buffer_copy.html | 2 +- .../reference/buffer_copy/overload1.html | 2 +- .../reference/buffer_copy/overload2.html | 2 +- .../reference/buffer_sequence_begin.html | 2 +- .../reference/buffer_sequence_begin/overload1.html | 2 +- .../reference/buffer_sequence_begin/overload2.html | 2 +- .../reference/buffer_sequence_begin/overload3.html | 2 +- .../reference/buffer_sequence_begin/overload4.html | 2 +- .../boost_asio/reference/buffer_sequence_end.html | 2 +- .../reference/buffer_sequence_end/overload1.html | 2 +- .../reference/buffer_sequence_end/overload2.html | 2 +- .../reference/buffer_sequence_end/overload3.html | 2 +- .../reference/buffer_sequence_end/overload4.html | 2 +- doc/html/boost_asio/reference/buffer_size.html | 2 +- .../boost_asio/reference/buffered_read_stream.html | 2 +- .../reference/buffered_read_stream/async_fill.html | 2 +- .../buffered_read_stream/async_read_some.html | 2 +- .../buffered_read_stream/async_write_some.html | 2 +- .../buffered_read_stream/buffered_read_stream.html | 2 +- .../buffered_read_stream/overload1.html | 2 +- .../buffered_read_stream/overload2.html | 2 +- .../reference/buffered_read_stream/close.html | 2 +- .../buffered_read_stream/close/overload1.html | 2 +- .../buffered_read_stream/close/overload2.html | 2 +- .../buffered_read_stream/default_buffer_size.html | 2 +- .../buffered_read_stream/executor_type.html | 2 +- .../reference/buffered_read_stream/fill.html | 2 +- .../buffered_read_stream/fill/overload1.html | 2 +- .../buffered_read_stream/fill/overload2.html | 2 +- .../buffered_read_stream/get_executor.html | 2 +- .../buffered_read_stream/get_io_context.html | 2 +- .../buffered_read_stream/get_io_service.html | 2 +- .../reference/buffered_read_stream/in_avail.html | 2 +- .../buffered_read_stream/in_avail/overload1.html | 2 +- .../buffered_read_stream/in_avail/overload2.html | 2 +- .../buffered_read_stream/lowest_layer.html | 2 +- .../lowest_layer/overload1.html | 2 +- .../lowest_layer/overload2.html | 2 +- .../buffered_read_stream/lowest_layer_type.html | 2 +- .../reference/buffered_read_stream/next_layer.html | 2 +- .../buffered_read_stream/next_layer_type.html | 2 +- .../reference/buffered_read_stream/peek.html | 2 +- .../buffered_read_stream/peek/overload1.html | 2 +- .../buffered_read_stream/peek/overload2.html | 2 +- .../reference/buffered_read_stream/read_some.html | 2 +- .../buffered_read_stream/read_some/overload1.html | 2 +- .../buffered_read_stream/read_some/overload2.html | 2 +- .../reference/buffered_read_stream/write_some.html | 2 +- .../buffered_read_stream/write_some/overload1.html | 2 +- .../buffered_read_stream/write_some/overload2.html | 2 +- doc/html/boost_asio/reference/buffered_stream.html | 2 +- .../reference/buffered_stream/async_fill.html | 2 +- .../reference/buffered_stream/async_flush.html | 2 +- .../reference/buffered_stream/async_read_some.html | 2 +- .../buffered_stream/async_write_some.html | 2 +- .../reference/buffered_stream/buffered_stream.html | 2 +- .../buffered_stream/buffered_stream/overload1.html | 2 +- .../buffered_stream/buffered_stream/overload2.html | 2 +- .../reference/buffered_stream/close.html | 2 +- .../reference/buffered_stream/close/overload1.html | 2 +- .../reference/buffered_stream/close/overload2.html | 2 +- .../reference/buffered_stream/executor_type.html | 2 +- .../boost_asio/reference/buffered_stream/fill.html | 2 +- .../reference/buffered_stream/fill/overload1.html | 2 +- .../reference/buffered_stream/fill/overload2.html | 2 +- .../reference/buffered_stream/flush.html | 2 +- .../reference/buffered_stream/flush/overload1.html | 2 +- .../reference/buffered_stream/flush/overload2.html | 2 +- .../reference/buffered_stream/get_executor.html | 2 +- .../reference/buffered_stream/get_io_context.html | 2 +- .../reference/buffered_stream/get_io_service.html | 2 +- .../reference/buffered_stream/in_avail.html | 2 +- .../buffered_stream/in_avail/overload1.html | 2 +- .../buffered_stream/in_avail/overload2.html | 2 +- .../reference/buffered_stream/lowest_layer.html | 2 +- .../buffered_stream/lowest_layer/overload1.html | 2 +- .../buffered_stream/lowest_layer/overload2.html | 2 +- .../buffered_stream/lowest_layer_type.html | 2 +- .../reference/buffered_stream/next_layer.html | 2 +- .../reference/buffered_stream/next_layer_type.html | 2 +- .../boost_asio/reference/buffered_stream/peek.html | 2 +- .../reference/buffered_stream/peek/overload1.html | 2 +- .../reference/buffered_stream/peek/overload2.html | 2 +- .../reference/buffered_stream/read_some.html | 2 +- .../buffered_stream/read_some/overload1.html | 2 +- .../buffered_stream/read_some/overload2.html | 2 +- .../reference/buffered_stream/write_some.html | 2 +- .../buffered_stream/write_some/overload1.html | 2 +- .../buffered_stream/write_some/overload2.html | 2 +- .../reference/buffered_write_stream.html | 2 +- .../buffered_write_stream/async_flush.html | 2 +- .../buffered_write_stream/async_read_some.html | 2 +- .../buffered_write_stream/async_write_some.html | 2 +- .../buffered_write_stream.html | 2 +- .../buffered_write_stream/overload1.html | 2 +- .../buffered_write_stream/overload2.html | 2 +- .../reference/buffered_write_stream/close.html | 2 +- .../buffered_write_stream/close/overload1.html | 2 +- .../buffered_write_stream/close/overload2.html | 2 +- .../buffered_write_stream/default_buffer_size.html | 2 +- .../buffered_write_stream/executor_type.html | 2 +- .../reference/buffered_write_stream/flush.html | 2 +- .../buffered_write_stream/flush/overload1.html | 2 +- .../buffered_write_stream/flush/overload2.html | 2 +- .../buffered_write_stream/get_executor.html | 2 +- .../buffered_write_stream/get_io_context.html | 2 +- .../buffered_write_stream/get_io_service.html | 2 +- .../reference/buffered_write_stream/in_avail.html | 2 +- .../buffered_write_stream/in_avail/overload1.html | 2 +- .../buffered_write_stream/in_avail/overload2.html | 2 +- .../buffered_write_stream/lowest_layer.html | 2 +- .../lowest_layer/overload1.html | 2 +- .../lowest_layer/overload2.html | 2 +- .../buffered_write_stream/lowest_layer_type.html | 2 +- .../buffered_write_stream/next_layer.html | 2 +- .../buffered_write_stream/next_layer_type.html | 2 +- .../reference/buffered_write_stream/peek.html | 2 +- .../buffered_write_stream/peek/overload1.html | 2 +- .../buffered_write_stream/peek/overload2.html | 2 +- .../reference/buffered_write_stream/read_some.html | 2 +- .../buffered_write_stream/read_some/overload1.html | 2 +- .../buffered_write_stream/read_some/overload2.html | 2 +- .../buffered_write_stream/write_some.html | 2 +- .../write_some/overload1.html | 2 +- .../write_some/overload2.html | 2 +- doc/html/boost_asio/reference/buffers_begin.html | 2 +- doc/html/boost_asio/reference/buffers_end.html | 2 +- .../boost_asio/reference/buffers_iterator.html | 2 +- .../reference/buffers_iterator/begin.html | 2 +- .../buffers_iterator/buffers_iterator.html | 2 +- .../buffers_iterator/difference_type.html | 2 +- .../boost_asio/reference/buffers_iterator/end.html | 2 +- .../buffers_iterator/iterator_category.html | 2 +- .../buffers_iterator/operator__star_.html | 2 +- .../buffers_iterator/operator_arrow_.html | 2 +- .../buffers_iterator/operator_eq__eq_.html | 2 +- .../reference/buffers_iterator/operator_gt_.html | 2 +- .../buffers_iterator/operator_gt__eq_.html | 2 +- .../buffers_iterator/operator_lb__rb_.html | 2 +- .../reference/buffers_iterator/operator_lt_.html | 2 +- .../buffers_iterator/operator_lt__eq_.html | 2 +- .../buffers_iterator/operator_minus_.html | 2 +- .../operator_minus_/overload1.html | 2 +- .../operator_minus_/overload2.html | 2 +- .../buffers_iterator/operator_minus__eq_.html | 2 +- .../buffers_iterator/operator_minus__minus_.html | 2 +- .../operator_minus__minus_/overload1.html | 2 +- .../operator_minus__minus_/overload2.html | 2 +- .../buffers_iterator/operator_not__eq_.html | 2 +- .../reference/buffers_iterator/operator_plus_.html | 2 +- .../buffers_iterator/operator_plus_/overload1.html | 2 +- .../buffers_iterator/operator_plus_/overload2.html | 2 +- .../buffers_iterator/operator_plus__eq_.html | 2 +- .../buffers_iterator/operator_plus__plus_.html | 2 +- .../operator_plus__plus_/overload1.html | 2 +- .../operator_plus__plus_/overload2.html | 2 +- .../reference/buffers_iterator/pointer.html | 2 +- .../reference/buffers_iterator/reference.html | 2 +- .../reference/buffers_iterator/value_type.html | 2 +- doc/html/boost_asio/reference/connect.html | 2 +- .../boost_asio/reference/connect/overload1.html | 2 +- .../boost_asio/reference/connect/overload10.html | 2 +- .../boost_asio/reference/connect/overload11.html | 2 +- .../boost_asio/reference/connect/overload12.html | 2 +- .../boost_asio/reference/connect/overload2.html | 2 +- .../boost_asio/reference/connect/overload3.html | 2 +- .../boost_asio/reference/connect/overload4.html | 2 +- .../boost_asio/reference/connect/overload5.html | 2 +- .../boost_asio/reference/connect/overload6.html | 2 +- .../boost_asio/reference/connect/overload7.html | 2 +- .../boost_asio/reference/connect/overload8.html | 2 +- .../boost_asio/reference/connect/overload9.html | 2 +- doc/html/boost_asio/reference/const_buffer.html | 2 +- .../reference/const_buffer/const_buffer.html | 2 +- .../const_buffer/const_buffer/overload1.html | 2 +- .../const_buffer/const_buffer/overload2.html | 2 +- .../const_buffer/const_buffer/overload3.html | 2 +- .../boost_asio/reference/const_buffer/data.html | 2 +- .../reference/const_buffer/operator_plus_.html | 2 +- .../const_buffer/operator_plus_/overload1.html | 2 +- .../const_buffer/operator_plus_/overload2.html | 2 +- .../reference/const_buffer/operator_plus__eq_.html | 2 +- .../boost_asio/reference/const_buffer/size.html | 2 +- doc/html/boost_asio/reference/const_buffers_1.html | 2 +- .../reference/const_buffers_1/begin.html | 2 +- .../reference/const_buffers_1/const_buffers_1.html | 2 +- .../const_buffers_1/const_buffers_1/overload1.html | 2 +- .../const_buffers_1/const_buffers_1/overload2.html | 2 +- .../reference/const_buffers_1/const_iterator.html | 2 +- .../boost_asio/reference/const_buffers_1/data.html | 2 +- .../boost_asio/reference/const_buffers_1/end.html | 2 +- .../reference/const_buffers_1/operator_plus_.html | 2 +- .../const_buffers_1/operator_plus_/overload1.html | 2 +- .../const_buffers_1/operator_plus_/overload2.html | 2 +- .../const_buffers_1/operator_plus__eq_.html | 2 +- .../boost_asio/reference/const_buffers_1/size.html | 2 +- .../reference/const_buffers_1/value_type.html | 2 +- doc/html/boost_asio/reference/coroutine.html | 2 +- .../boost_asio/reference/coroutine/coroutine.html | 2 +- .../boost_asio/reference/coroutine/is_child.html | 2 +- .../reference/coroutine/is_complete.html | 2 +- .../boost_asio/reference/coroutine/is_parent.html | 2 +- doc/html/boost_asio/reference/deadline_timer.html | 2 +- doc/html/boost_asio/reference/defer.html | 2 +- doc/html/boost_asio/reference/defer/overload1.html | 2 +- doc/html/boost_asio/reference/defer/overload2.html | 2 +- doc/html/boost_asio/reference/defer/overload3.html | 2 +- doc/html/boost_asio/reference/dispatch.html | 2 +- .../boost_asio/reference/dispatch/overload1.html | 2 +- .../boost_asio/reference/dispatch/overload2.html | 2 +- .../boost_asio/reference/dispatch/overload3.html | 2 +- doc/html/boost_asio/reference/dynamic_buffer.html | 2 +- .../reference/dynamic_buffer/overload1.html | 2 +- .../reference/dynamic_buffer/overload2.html | 2 +- .../reference/dynamic_buffer/overload3.html | 2 +- .../reference/dynamic_buffer/overload4.html | 2 +- .../reference/dynamic_string_buffer.html | 2 +- .../reference/dynamic_string_buffer/capacity.html | 2 +- .../reference/dynamic_string_buffer/commit.html | 2 +- .../dynamic_string_buffer/const_buffers_type.html | 2 +- .../reference/dynamic_string_buffer/consume.html | 2 +- .../reference/dynamic_string_buffer/data.html | 2 +- .../dynamic_string_buffer.html | 2 +- .../dynamic_string_buffer/overload1.html | 2 +- .../dynamic_string_buffer/overload2.html | 2 +- .../reference/dynamic_string_buffer/max_size.html | 2 +- .../mutable_buffers_type.html | 2 +- .../reference/dynamic_string_buffer/prepare.html | 2 +- .../reference/dynamic_string_buffer/size.html | 2 +- .../reference/dynamic_vector_buffer.html | 2 +- .../reference/dynamic_vector_buffer/capacity.html | 2 +- .../reference/dynamic_vector_buffer/commit.html | 2 +- .../dynamic_vector_buffer/const_buffers_type.html | 2 +- .../reference/dynamic_vector_buffer/consume.html | 2 +- .../reference/dynamic_vector_buffer/data.html | 2 +- .../dynamic_vector_buffer.html | 2 +- .../dynamic_vector_buffer/overload1.html | 2 +- .../dynamic_vector_buffer/overload2.html | 2 +- .../reference/dynamic_vector_buffer/max_size.html | 2 +- .../mutable_buffers_type.html | 2 +- .../reference/dynamic_vector_buffer/prepare.html | 2 +- .../reference/dynamic_vector_buffer/size.html | 2 +- .../reference/error__addrinfo_category.html | 2 +- .../reference/error__addrinfo_errors.html | 2 +- .../boost_asio/reference/error__basic_errors.html | 2 +- .../reference/error__get_addrinfo_category.html | 2 +- .../reference/error__get_misc_category.html | 2 +- .../reference/error__get_netdb_category.html | 2 +- .../reference/error__get_ssl_category.html | 2 +- .../reference/error__get_system_category.html | 2 +- .../reference/error__make_error_code.html | 2 +- .../error__make_error_code/overload1.html | 2 +- .../error__make_error_code/overload2.html | 2 +- .../error__make_error_code/overload3.html | 2 +- .../error__make_error_code/overload4.html | 2 +- .../error__make_error_code/overload5.html | 2 +- .../boost_asio/reference/error__misc_category.html | 2 +- .../boost_asio/reference/error__misc_errors.html | 2 +- .../reference/error__netdb_category.html | 2 +- .../boost_asio/reference/error__netdb_errors.html | 2 +- .../boost_asio/reference/error__ssl_category.html | 2 +- .../boost_asio/reference/error__ssl_errors.html | 2 +- .../reference/error__system_category.html | 2 +- .../boost_asio/reference/execution_context.html | 2 +- .../execution_context/_execution_context.html | 2 +- .../reference/execution_context/add_service.html | 2 +- .../reference/execution_context/destroy.html | 2 +- .../execution_context/execution_context.html | 2 +- .../reference/execution_context/fork_event.html | 2 +- .../reference/execution_context/has_service.html | 2 +- .../reference/execution_context/make_service.html | 2 +- .../reference/execution_context/notify_fork.html | 2 +- .../reference/execution_context/shutdown.html | 2 +- .../reference/execution_context/use_service.html | 2 +- .../execution_context/use_service/overload1.html | 2 +- .../execution_context/use_service/overload2.html | 2 +- .../reference/execution_context__id.html | 2 +- .../reference/execution_context__id/id.html | 2 +- .../reference/execution_context__service.html | 2 +- .../execution_context__service/_service.html | 2 +- .../execution_context__service/context.html | 2 +- .../execution_context__service/notify_fork.html | 2 +- .../execution_context__service/service.html | 2 +- .../execution_context__service/shutdown.html | 2 +- doc/html/boost_asio/reference/executor.html | 2 +- .../boost_asio/reference/executor/_executor.html | 2 +- .../boost_asio/reference/executor/context.html | 2 +- doc/html/boost_asio/reference/executor/defer.html | 2 +- .../boost_asio/reference/executor/dispatch.html | 2 +- .../boost_asio/reference/executor/executor.html | 2 +- .../reference/executor/executor/overload1.html | 2 +- .../reference/executor/executor/overload2.html | 2 +- .../reference/executor/executor/overload3.html | 2 +- .../reference/executor/executor/overload4.html | 2 +- .../reference/executor/executor/overload5.html | 2 +- .../reference/executor/executor/overload6.html | 2 +- .../reference/executor/on_work_finished.html | 2 +- .../reference/executor/on_work_started.html | 2 +- .../reference/executor/operator_eq_.html | 2 +- .../reference/executor/operator_eq_/overload1.html | 2 +- .../reference/executor/operator_eq_/overload2.html | 2 +- .../reference/executor/operator_eq_/overload3.html | 2 +- .../reference/executor/operator_eq_/overload4.html | 2 +- .../reference/executor/operator_eq__eq_.html | 2 +- .../reference/executor/operator_not__eq_.html | 2 +- .../executor/operator_unspecified_bool_type.html | 2 +- doc/html/boost_asio/reference/executor/post.html | 2 +- doc/html/boost_asio/reference/executor/target.html | 2 +- .../reference/executor/target/overload1.html | 2 +- .../reference/executor/target/overload2.html | 2 +- .../boost_asio/reference/executor/target_type.html | 2 +- .../reference/executor/unspecified_bool_true.html | 2 +- .../reference/executor/unspecified_bool_type.html | 2 +- .../executor__unspecified_bool_type_t.html | 2 +- doc/html/boost_asio/reference/executor_arg.html | 2 +- doc/html/boost_asio/reference/executor_arg_t.html | 2 +- .../reference/executor_arg_t/executor_arg_t.html | 2 +- doc/html/boost_asio/reference/executor_binder.html | 2 +- .../executor_binder/_executor_binder.html | 2 +- .../reference/executor_binder/argument_type.html | 2 +- .../reference/executor_binder/executor_binder.html | 2 +- .../executor_binder/executor_binder/overload1.html | 2 +- .../executor_binder/executor_binder/overload2.html | 2 +- .../executor_binder/executor_binder/overload3.html | 2 +- .../executor_binder/executor_binder/overload4.html | 2 +- .../executor_binder/executor_binder/overload5.html | 2 +- .../executor_binder/executor_binder/overload6.html | 2 +- .../executor_binder/executor_binder/overload7.html | 2 +- .../executor_binder/executor_binder/overload8.html | 2 +- .../executor_binder/executor_binder/overload9.html | 2 +- .../reference/executor_binder/executor_type.html | 2 +- .../executor_binder/first_argument_type.html | 2 +- .../boost_asio/reference/executor_binder/get.html | 2 +- .../reference/executor_binder/get/overload1.html | 2 +- .../reference/executor_binder/get/overload2.html | 2 +- .../reference/executor_binder/get_executor.html | 2 +- .../executor_binder/operator_lp__rp_.html | 2 +- .../operator_lp__rp_/overload1.html | 2 +- .../operator_lp__rp_/overload2.html | 2 +- .../reference/executor_binder/result_type.html | 2 +- .../executor_binder/second_argument_type.html | 2 +- .../reference/executor_binder/target_type.html | 2 +- .../boost_asio/reference/executor_work_guard.html | 2 +- .../executor_work_guard/_executor_work_guard.html | 8 +- .../executor_work_guard/executor_type.html | 2 +- .../executor_work_guard/executor_work_guard.html | 2 +- .../executor_work_guard/overload1.html | 2 +- .../executor_work_guard/overload2.html | 2 +- .../executor_work_guard/overload3.html | 2 +- .../executor_work_guard/get_executor.html | 2 +- .../reference/executor_work_guard/owns_work.html | 2 +- .../reference/executor_work_guard/reset.html | 2 +- .../reference/experimental__await_token.html | 164 + .../experimental__await_token/await_token.html | 59 + .../await_token/overload1.html | 50 + .../await_token/overload2.html | 50 + .../experimental__await_token/executor_type.html | 60 + .../experimental__await_token/get_executor.html | 50 + .../reference/experimental__awaitable.html | 158 + .../experimental__awaitable/_awaitable.html | 49 + .../experimental__awaitable/awaitable.html | 51 + .../experimental__awaitable/executor_type.html | 60 + .../experimental__awaitable/value_type.html | 60 + .../reference/experimental__co_spawn.html | 90 + .../experimental__co_spawn/overload1.html | 57 + .../experimental__co_spawn/overload2.html | 57 + .../experimental__co_spawn/overload3.html | 56 + .../reference/experimental__detached.html | 64 + .../reference/experimental__detached_t.html | 104 + .../experimental__detached_t/detached_t.html | 49 + .../reference/experimental__redirect_error.html | 64 + .../reference/experimental__redirect_error_t.html | 144 + .../experimental__redirect_error_t/ec_.html | 48 + .../redirect_error_t.html | 53 + .../experimental__redirect_error_t/token_.html | 48 + .../experimental__this_coro__executor.html | 60 + .../experimental__this_coro__executor_t.html | 58 + .../reference/experimental__this_coro__token.html | 60 + .../experimental__this_coro__token_t.html | 58 + .../reference/generic__basic_endpoint.html | 8 +- .../generic__basic_endpoint/basic_endpoint.html | 2 +- .../basic_endpoint/overload1.html | 2 +- .../basic_endpoint/overload2.html | 2 +- .../basic_endpoint/overload3.html | 2 +- .../basic_endpoint/overload4.html | 2 +- .../generic__basic_endpoint/capacity.html | 2 +- .../reference/generic__basic_endpoint/data.html | 2 +- .../generic__basic_endpoint/data/overload1.html | 2 +- .../generic__basic_endpoint/data/overload2.html | 2 +- .../generic__basic_endpoint/data_type.html | 2 +- .../generic__basic_endpoint/operator_eq_.html | 2 +- .../generic__basic_endpoint/operator_eq__eq_.html | 2 +- .../generic__basic_endpoint/operator_gt_.html | 2 +- .../generic__basic_endpoint/operator_gt__eq_.html | 2 +- .../generic__basic_endpoint/operator_lt_.html | 2 +- .../generic__basic_endpoint/operator_lt__eq_.html | 2 +- .../generic__basic_endpoint/operator_not__eq_.html | 2 +- .../generic__basic_endpoint/protocol.html | 2 +- .../generic__basic_endpoint/protocol_type.html | 2 +- .../reference/generic__basic_endpoint/resize.html | 2 +- .../reference/generic__basic_endpoint/size.html | 2 +- .../reference/generic__datagram_protocol.html | 2 +- .../datagram_protocol.html | 2 +- .../datagram_protocol/overload1.html | 2 +- .../datagram_protocol/overload2.html | 2 +- .../generic__datagram_protocol/endpoint.html | 2 +- .../generic__datagram_protocol/family.html | 2 +- .../operator_eq__eq_.html | 2 +- .../operator_not__eq_.html | 2 +- .../generic__datagram_protocol/protocol.html | 2 +- .../generic__datagram_protocol/socket.html | 2 +- .../reference/generic__datagram_protocol/type.html | 2 +- .../reference/generic__raw_protocol.html | 2 +- .../reference/generic__raw_protocol/endpoint.html | 2 +- .../reference/generic__raw_protocol/family.html | 2 +- .../generic__raw_protocol/operator_eq__eq_.html | 2 +- .../generic__raw_protocol/operator_not__eq_.html | 2 +- .../reference/generic__raw_protocol/protocol.html | 2 +- .../generic__raw_protocol/raw_protocol.html | 2 +- .../raw_protocol/overload1.html | 2 +- .../raw_protocol/overload2.html | 2 +- .../reference/generic__raw_protocol/socket.html | 2 +- .../reference/generic__raw_protocol/type.html | 2 +- .../reference/generic__seq_packet_protocol.html | 2 +- .../generic__seq_packet_protocol/endpoint.html | 2 +- .../generic__seq_packet_protocol/family.html | 2 +- .../operator_eq__eq_.html | 2 +- .../operator_not__eq_.html | 2 +- .../generic__seq_packet_protocol/protocol.html | 2 +- .../seq_packet_protocol.html | 2 +- .../seq_packet_protocol/overload1.html | 2 +- .../seq_packet_protocol/overload2.html | 2 +- .../generic__seq_packet_protocol/socket.html | 2 +- .../generic__seq_packet_protocol/type.html | 2 +- .../reference/generic__stream_protocol.html | 2 +- .../generic__stream_protocol/endpoint.html | 2 +- .../reference/generic__stream_protocol/family.html | 2 +- .../generic__stream_protocol/iostream.html | 2 +- .../generic__stream_protocol/operator_eq__eq_.html | 2 +- .../operator_not__eq_.html | 2 +- .../generic__stream_protocol/protocol.html | 2 +- .../reference/generic__stream_protocol/socket.html | 2 +- .../generic__stream_protocol/stream_protocol.html | 2 +- .../stream_protocol/overload1.html | 2 +- .../stream_protocol/overload2.html | 2 +- .../reference/generic__stream_protocol/type.html | 2 +- .../reference/get_associated_allocator.html | 2 +- .../get_associated_allocator/overload1.html | 2 +- .../get_associated_allocator/overload2.html | 2 +- .../reference/get_associated_executor.html | 2 +- .../get_associated_executor/overload1.html | 2 +- .../get_associated_executor/overload2.html | 2 +- .../get_associated_executor/overload3.html | 2 +- doc/html/boost_asio/reference/handler_type.html | 2 +- .../boost_asio/reference/handler_type/type.html | 2 +- doc/html/boost_asio/reference/has_service.html | 2 +- .../reference/high_resolution_timer.html | 2 +- .../reference/invalid_service_owner.html | 2 +- .../invalid_service_owner.html | 2 +- doc/html/boost_asio/reference/io_context.html | 2 +- .../reference/io_context/_io_context.html | 2 +- .../reference/io_context/add_service.html | 2 +- .../reference/io_context/count_type.html | 2 +- .../boost_asio/reference/io_context/destroy.html | 2 +- .../boost_asio/reference/io_context/dispatch.html | 6 +- .../reference/io_context/fork_event.html | 2 +- .../reference/io_context/get_executor.html | 2 +- .../reference/io_context/has_service.html | 2 +- .../reference/io_context/io_context.html | 2 +- .../reference/io_context/io_context/overload1.html | 2 +- .../reference/io_context/io_context/overload2.html | 2 +- .../reference/io_context/make_service.html | 2 +- .../reference/io_context/notify_fork.html | 2 +- doc/html/boost_asio/reference/io_context/poll.html | 2 +- .../reference/io_context/poll/overload1.html | 2 +- .../reference/io_context/poll/overload2.html | 2 +- .../boost_asio/reference/io_context/poll_one.html | 2 +- .../reference/io_context/poll_one/overload1.html | 2 +- .../reference/io_context/poll_one/overload2.html | 2 +- doc/html/boost_asio/reference/io_context/post.html | 6 +- .../boost_asio/reference/io_context/reset.html | 2 +- .../boost_asio/reference/io_context/restart.html | 2 +- doc/html/boost_asio/reference/io_context/run.html | 2 +- .../reference/io_context/run/overload1.html | 2 +- .../reference/io_context/run/overload2.html | 2 +- .../boost_asio/reference/io_context/run_for.html | 2 +- .../boost_asio/reference/io_context/run_one.html | 2 +- .../reference/io_context/run_one/overload1.html | 2 +- .../reference/io_context/run_one/overload2.html | 2 +- .../reference/io_context/run_one_for.html | 2 +- .../reference/io_context/run_one_until.html | 2 +- .../boost_asio/reference/io_context/run_until.html | 2 +- .../boost_asio/reference/io_context/shutdown.html | 2 +- doc/html/boost_asio/reference/io_context/stop.html | 2 +- .../boost_asio/reference/io_context/stopped.html | 2 +- .../reference/io_context/use_service.html | 2 +- .../io_context/use_service/overload1.html | 2 +- .../io_context/use_service/overload2.html | 2 +- doc/html/boost_asio/reference/io_context/wrap.html | 2 +- .../reference/io_context__executor_type.html | 2 +- .../io_context__executor_type/context.html | 2 +- .../reference/io_context__executor_type/defer.html | 2 +- .../io_context__executor_type/dispatch.html | 2 +- .../on_work_finished.html | 2 +- .../io_context__executor_type/on_work_started.html | 2 +- .../operator_eq__eq_.html | 2 +- .../operator_not__eq_.html | 2 +- .../reference/io_context__executor_type/post.html | 2 +- .../running_in_this_thread.html | 2 +- .../boost_asio/reference/io_context__service.html | 2 +- .../reference/io_context__service/_service.html | 2 +- .../io_context__service/get_io_context.html | 2 +- .../io_context__service/get_io_service.html | 2 +- .../reference/io_context__service/service.html | 2 +- .../boost_asio/reference/io_context__strand.html | 2 +- .../reference/io_context__strand/_strand.html | 2 +- .../reference/io_context__strand/context.html | 2 +- .../reference/io_context__strand/defer.html | 2 +- .../reference/io_context__strand/dispatch.html | 6 +- .../io_context__strand/dispatch/overload1.html | 2 +- .../io_context__strand/dispatch/overload2.html | 6 +- .../io_context__strand/get_io_context.html | 2 +- .../io_context__strand/get_io_service.html | 2 +- .../io_context__strand/on_work_finished.html | 2 +- .../io_context__strand/on_work_started.html | 2 +- .../io_context__strand/operator_eq__eq_.html | 2 +- .../io_context__strand/operator_not__eq_.html | 2 +- .../reference/io_context__strand/post.html | 6 +- .../io_context__strand/post/overload1.html | 2 +- .../io_context__strand/post/overload2.html | 6 +- .../io_context__strand/running_in_this_thread.html | 2 +- .../reference/io_context__strand/strand.html | 2 +- .../reference/io_context__strand/wrap.html | 2 +- .../boost_asio/reference/io_context__work.html | 2 +- .../reference/io_context__work/_work.html | 2 +- .../reference/io_context__work/get_io_context.html | 2 +- .../reference/io_context__work/get_io_service.html | 2 +- .../reference/io_context__work/work.html | 2 +- .../reference/io_context__work/work/overload1.html | 2 +- .../reference/io_context__work/work/overload2.html | 2 +- doc/html/boost_asio/reference/io_service.html | 2 +- doc/html/boost_asio/reference/ip__address.html | 2 +- .../boost_asio/reference/ip__address/address.html | 2 +- .../reference/ip__address/address/overload1.html | 2 +- .../reference/ip__address/address/overload2.html | 2 +- .../reference/ip__address/address/overload3.html | 2 +- .../reference/ip__address/address/overload4.html | 2 +- .../reference/ip__address/from_string.html | 2 +- .../ip__address/from_string/overload1.html | 2 +- .../ip__address/from_string/overload2.html | 2 +- .../ip__address/from_string/overload3.html | 2 +- .../ip__address/from_string/overload4.html | 2 +- .../reference/ip__address/is_loopback.html | 2 +- .../reference/ip__address/is_multicast.html | 2 +- .../reference/ip__address/is_unspecified.html | 2 +- .../boost_asio/reference/ip__address/is_v4.html | 2 +- .../boost_asio/reference/ip__address/is_v6.html | 2 +- .../reference/ip__address/make_address.html | 2 +- .../ip__address/make_address/overload1.html | 2 +- .../ip__address/make_address/overload2.html | 2 +- .../ip__address/make_address/overload3.html | 2 +- .../ip__address/make_address/overload4.html | 2 +- .../ip__address/make_address/overload5.html | 2 +- .../ip__address/make_address/overload6.html | 2 +- .../reference/ip__address/operator_eq_.html | 2 +- .../ip__address/operator_eq_/overload1.html | 2 +- .../ip__address/operator_eq_/overload2.html | 2 +- .../ip__address/operator_eq_/overload3.html | 2 +- .../reference/ip__address/operator_eq__eq_.html | 2 +- .../reference/ip__address/operator_gt_.html | 2 +- .../reference/ip__address/operator_gt__eq_.html | 2 +- .../reference/ip__address/operator_lt_.html | 2 +- .../reference/ip__address/operator_lt__eq_.html | 2 +- .../reference/ip__address/operator_lt__lt_.html | 2 +- .../reference/ip__address/operator_not__eq_.html | 2 +- .../reference/ip__address/to_string.html | 2 +- .../reference/ip__address/to_string/overload1.html | 2 +- .../reference/ip__address/to_string/overload2.html | 2 +- .../boost_asio/reference/ip__address/to_v4.html | 2 +- .../boost_asio/reference/ip__address/to_v6.html | 2 +- doc/html/boost_asio/reference/ip__address_v4.html | 2 +- .../reference/ip__address_v4/address_v4.html | 2 +- .../ip__address_v4/address_v4/overload1.html | 2 +- .../ip__address_v4/address_v4/overload2.html | 2 +- .../ip__address_v4/address_v4/overload3.html | 2 +- .../ip__address_v4/address_v4/overload4.html | 2 +- .../boost_asio/reference/ip__address_v4/any.html | 2 +- .../reference/ip__address_v4/broadcast.html | 2 +- .../ip__address_v4/broadcast/overload1.html | 2 +- .../ip__address_v4/broadcast/overload2.html | 2 +- .../reference/ip__address_v4/bytes_type.html | 2 +- .../reference/ip__address_v4/from_string.html | 2 +- .../ip__address_v4/from_string/overload1.html | 2 +- .../ip__address_v4/from_string/overload2.html | 2 +- .../ip__address_v4/from_string/overload3.html | 2 +- .../ip__address_v4/from_string/overload4.html | 2 +- .../reference/ip__address_v4/is_class_a.html | 2 +- .../reference/ip__address_v4/is_class_b.html | 2 +- .../reference/ip__address_v4/is_class_c.html | 2 +- .../reference/ip__address_v4/is_loopback.html | 2 +- .../reference/ip__address_v4/is_multicast.html | 2 +- .../reference/ip__address_v4/is_unspecified.html | 2 +- .../reference/ip__address_v4/loopback.html | 2 +- .../reference/ip__address_v4/make_address_v4.html | 2 +- .../ip__address_v4/make_address_v4/overload1.html | 2 +- .../ip__address_v4/make_address_v4/overload2.html | 2 +- .../ip__address_v4/make_address_v4/overload3.html | 2 +- .../ip__address_v4/make_address_v4/overload4.html | 2 +- .../ip__address_v4/make_address_v4/overload5.html | 2 +- .../ip__address_v4/make_address_v4/overload6.html | 2 +- .../ip__address_v4/make_address_v4/overload7.html | 2 +- .../ip__address_v4/make_address_v4/overload8.html | 2 +- .../ip__address_v4/make_address_v4/overload9.html | 2 +- .../reference/ip__address_v4/make_network_v4.html | 2 +- .../ip__address_v4/make_network_v4/overload1.html | 2 +- .../ip__address_v4/make_network_v4/overload2.html | 2 +- .../reference/ip__address_v4/netmask.html | 2 +- .../reference/ip__address_v4/operator_eq_.html | 2 +- .../reference/ip__address_v4/operator_eq__eq_.html | 2 +- .../reference/ip__address_v4/operator_gt_.html | 2 +- .../reference/ip__address_v4/operator_gt__eq_.html | 2 +- .../reference/ip__address_v4/operator_lt_.html | 2 +- .../reference/ip__address_v4/operator_lt__eq_.html | 2 +- .../reference/ip__address_v4/operator_lt__lt_.html | 2 +- .../ip__address_v4/operator_lt__lt_/overload1.html | 2 +- .../ip__address_v4/operator_lt__lt_/overload2.html | 2 +- .../ip__address_v4/operator_not__eq_.html | 2 +- .../reference/ip__address_v4/to_bytes.html | 2 +- .../reference/ip__address_v4/to_string.html | 2 +- .../ip__address_v4/to_string/overload1.html | 2 +- .../ip__address_v4/to_string/overload2.html | 2 +- .../reference/ip__address_v4/to_uint.html | 2 +- .../reference/ip__address_v4/to_ulong.html | 2 +- .../reference/ip__address_v4/uint_type.html | 2 +- .../reference/ip__address_v4_iterator.html | 490 +- .../boost_asio/reference/ip__address_v4_range.html | 490 +- doc/html/boost_asio/reference/ip__address_v6.html | 2 +- .../reference/ip__address_v6/address_v6.html | 2 +- .../ip__address_v6/address_v6/overload1.html | 2 +- .../ip__address_v6/address_v6/overload2.html | 2 +- .../ip__address_v6/address_v6/overload3.html | 2 +- .../boost_asio/reference/ip__address_v6/any.html | 2 +- .../reference/ip__address_v6/bytes_type.html | 2 +- .../reference/ip__address_v6/from_string.html | 2 +- .../ip__address_v6/from_string/overload1.html | 2 +- .../ip__address_v6/from_string/overload2.html | 2 +- .../ip__address_v6/from_string/overload3.html | 2 +- .../ip__address_v6/from_string/overload4.html | 2 +- .../reference/ip__address_v6/is_link_local.html | 2 +- .../reference/ip__address_v6/is_loopback.html | 2 +- .../reference/ip__address_v6/is_multicast.html | 2 +- .../ip__address_v6/is_multicast_global.html | 2 +- .../ip__address_v6/is_multicast_link_local.html | 2 +- .../ip__address_v6/is_multicast_node_local.html | 2 +- .../ip__address_v6/is_multicast_org_local.html | 2 +- .../ip__address_v6/is_multicast_site_local.html | 2 +- .../reference/ip__address_v6/is_site_local.html | 2 +- .../reference/ip__address_v6/is_unspecified.html | 2 +- .../reference/ip__address_v6/is_v4_compatible.html | 2 +- .../reference/ip__address_v6/is_v4_mapped.html | 2 +- .../reference/ip__address_v6/loopback.html | 2 +- .../reference/ip__address_v6/make_address_v6.html | 2 +- .../ip__address_v6/make_address_v6/overload1.html | 2 +- .../ip__address_v6/make_address_v6/overload2.html | 2 +- .../ip__address_v6/make_address_v6/overload3.html | 2 +- .../ip__address_v6/make_address_v6/overload4.html | 2 +- .../ip__address_v6/make_address_v6/overload5.html | 2 +- .../ip__address_v6/make_address_v6/overload6.html | 2 +- .../ip__address_v6/make_address_v6/overload7.html | 2 +- .../ip__address_v6/make_address_v6/overload8.html | 2 +- .../reference/ip__address_v6/make_network_v6.html | 2 +- .../reference/ip__address_v6/operator_eq_.html | 2 +- .../reference/ip__address_v6/operator_eq__eq_.html | 2 +- .../reference/ip__address_v6/operator_gt_.html | 2 +- .../reference/ip__address_v6/operator_gt__eq_.html | 2 +- .../reference/ip__address_v6/operator_lt_.html | 2 +- .../reference/ip__address_v6/operator_lt__eq_.html | 2 +- .../reference/ip__address_v6/operator_lt__lt_.html | 2 +- .../ip__address_v6/operator_lt__lt_/overload1.html | 2 +- .../ip__address_v6/operator_lt__lt_/overload2.html | 2 +- .../ip__address_v6/operator_not__eq_.html | 2 +- .../reference/ip__address_v6/scope_id.html | 2 +- .../ip__address_v6/scope_id/overload1.html | 2 +- .../ip__address_v6/scope_id/overload2.html | 2 +- .../reference/ip__address_v6/to_bytes.html | 2 +- .../reference/ip__address_v6/to_string.html | 2 +- .../ip__address_v6/to_string/overload1.html | 2 +- .../ip__address_v6/to_string/overload2.html | 2 +- .../boost_asio/reference/ip__address_v6/to_v4.html | 2 +- .../reference/ip__address_v6/v4_compatible.html | 2 +- .../reference/ip__address_v6/v4_mapped.html | 2 +- .../reference/ip__address_v6_iterator.html | 534 +-- .../boost_asio/reference/ip__address_v6_range.html | 534 +-- .../boost_asio/reference/ip__bad_address_cast.html | 2 +- .../ip__bad_address_cast/_bad_address_cast.html | 2 +- .../ip__bad_address_cast/bad_address_cast.html | 2 +- .../reference/ip__bad_address_cast/what.html | 2 +- ...basic_address_iterator_lt__address_v4__gt_.html | 2 +- .../basic_address_iterator.html | 2 +- .../basic_address_iterator/overload1.html | 2 +- .../basic_address_iterator/overload2.html | 2 +- .../difference_type.html | 2 +- .../iterator_category.html | 2 +- .../operator__star_.html | 2 +- .../operator_arrow_.html | 2 +- .../operator_eq_.html | 2 +- .../operator_eq__eq_.html | 2 +- .../operator_minus__minus_.html | 2 +- .../operator_minus__minus_/overload1.html | 2 +- .../operator_minus__minus_/overload2.html | 2 +- .../operator_not__eq_.html | 2 +- .../operator_plus__plus_.html | 2 +- .../operator_plus__plus_/overload1.html | 2 +- .../operator_plus__plus_/overload2.html | 2 +- .../pointer.html | 2 +- .../reference.html | 2 +- .../value_type.html | 2 +- ...basic_address_iterator_lt__address_v6__gt_.html | 2 +- .../basic_address_iterator.html | 2 +- .../basic_address_iterator/overload1.html | 2 +- .../basic_address_iterator/overload2.html | 2 +- .../difference_type.html | 2 +- .../iterator_category.html | 2 +- .../operator__star_.html | 2 +- .../operator_arrow_.html | 2 +- .../operator_eq_.html | 2 +- .../operator_eq__eq_.html | 2 +- .../operator_minus__minus_.html | 2 +- .../operator_minus__minus_/overload1.html | 2 +- .../operator_minus__minus_/overload2.html | 2 +- .../operator_not__eq_.html | 2 +- .../operator_plus__plus_.html | 2 +- .../operator_plus__plus_/overload1.html | 2 +- .../operator_plus__plus_/overload2.html | 2 +- .../pointer.html | 2 +- .../reference.html | 2 +- .../value_type.html | 2 +- ...p__basic_address_range_lt__address_v4__gt_.html | 2 +- .../basic_address_range.html | 2 +- .../basic_address_range/overload1.html | 2 +- .../basic_address_range/overload2.html | 2 +- .../basic_address_range/overload3.html | 2 +- .../begin.html | 2 +- .../empty.html | 2 +- .../end.html | 2 +- .../find.html | 2 +- .../iterator.html | 491 +- .../operator_eq_.html | 2 +- .../size.html | 2 +- ...p__basic_address_range_lt__address_v6__gt_.html | 2 +- .../basic_address_range.html | 2 +- .../basic_address_range/overload1.html | 2 +- .../basic_address_range/overload2.html | 2 +- .../basic_address_range/overload3.html | 2 +- .../begin.html | 2 +- .../empty.html | 2 +- .../end.html | 2 +- .../find.html | 2 +- .../iterator.html | 535 +-- .../operator_eq_.html | 2 +- .../boost_asio/reference/ip__basic_endpoint.html | 2 +- .../reference/ip__basic_endpoint/address.html | 2 +- .../ip__basic_endpoint/address/overload1.html | 2 +- .../ip__basic_endpoint/address/overload2.html | 2 +- .../ip__basic_endpoint/basic_endpoint.html | 2 +- .../basic_endpoint/overload1.html | 2 +- .../basic_endpoint/overload2.html | 2 +- .../basic_endpoint/overload3.html | 2 +- .../basic_endpoint/overload4.html | 2 +- .../basic_endpoint/overload5.html | 2 +- .../reference/ip__basic_endpoint/capacity.html | 2 +- .../reference/ip__basic_endpoint/data.html | 2 +- .../ip__basic_endpoint/data/overload1.html | 2 +- .../ip__basic_endpoint/data/overload2.html | 2 +- .../reference/ip__basic_endpoint/data_type.html | 2 +- .../reference/ip__basic_endpoint/operator_eq_.html | 2 +- .../ip__basic_endpoint/operator_eq_/overload1.html | 2 +- .../ip__basic_endpoint/operator_eq_/overload2.html | 2 +- .../ip__basic_endpoint/operator_eq__eq_.html | 2 +- .../reference/ip__basic_endpoint/operator_gt_.html | 2 +- .../ip__basic_endpoint/operator_gt__eq_.html | 2 +- .../reference/ip__basic_endpoint/operator_lt_.html | 2 +- .../ip__basic_endpoint/operator_lt__eq_.html | 2 +- .../ip__basic_endpoint/operator_lt__lt_.html | 2 +- .../ip__basic_endpoint/operator_not__eq_.html | 2 +- .../reference/ip__basic_endpoint/port.html | 2 +- .../ip__basic_endpoint/port/overload1.html | 2 +- .../ip__basic_endpoint/port/overload2.html | 2 +- .../reference/ip__basic_endpoint/protocol.html | 2 +- .../ip__basic_endpoint/protocol_type.html | 2 +- .../reference/ip__basic_endpoint/resize.html | 2 +- .../reference/ip__basic_endpoint/size.html | 2 +- .../boost_asio/reference/ip__basic_resolver.html | 2 +- .../ip__basic_resolver/_basic_resolver.html | 2 +- .../ip__basic_resolver/address_configured.html | 2 +- .../reference/ip__basic_resolver/all_matching.html | 2 +- .../ip__basic_resolver/async_resolve.html | 2 +- .../async_resolve/overload1.html | 2 +- .../async_resolve/overload2.html | 2 +- .../async_resolve/overload3.html | 2 +- .../async_resolve/overload4.html | 2 +- .../async_resolve/overload5.html | 2 +- .../async_resolve/overload6.html | 2 +- .../ip__basic_resolver/basic_resolver.html | 2 +- .../basic_resolver/overload1.html | 2 +- .../basic_resolver/overload2.html | 2 +- .../reference/ip__basic_resolver/cancel.html | 2 +- .../ip__basic_resolver/canonical_name.html | 2 +- .../ip__basic_resolver/endpoint_type.html | 2 +- .../ip__basic_resolver/executor_type.html | 2 +- .../reference/ip__basic_resolver/flags.html | 2 +- .../reference/ip__basic_resolver/get_executor.html | 2 +- .../ip__basic_resolver/get_io_context.html | 2 +- .../ip__basic_resolver/get_io_service.html | 2 +- .../reference/ip__basic_resolver/iterator.html | 2 +- .../reference/ip__basic_resolver/numeric_host.html | 2 +- .../ip__basic_resolver/numeric_service.html | 2 +- .../reference/ip__basic_resolver/operator_eq_.html | 2 +- .../reference/ip__basic_resolver/passive.html | 2 +- .../ip__basic_resolver/protocol_type.html | 2 +- .../reference/ip__basic_resolver/query.html | 2 +- .../reference/ip__basic_resolver/resolve.html | 2 +- .../ip__basic_resolver/resolve/overload1.html | 2 +- .../ip__basic_resolver/resolve/overload10.html | 2 +- .../ip__basic_resolver/resolve/overload11.html | 2 +- .../ip__basic_resolver/resolve/overload12.html | 2 +- .../ip__basic_resolver/resolve/overload2.html | 2 +- .../ip__basic_resolver/resolve/overload3.html | 2 +- .../ip__basic_resolver/resolve/overload4.html | 2 +- .../ip__basic_resolver/resolve/overload5.html | 2 +- .../ip__basic_resolver/resolve/overload6.html | 2 +- .../ip__basic_resolver/resolve/overload7.html | 2 +- .../ip__basic_resolver/resolve/overload8.html | 2 +- .../ip__basic_resolver/resolve/overload9.html | 2 +- .../reference/ip__basic_resolver/results_type.html | 2 +- .../reference/ip__basic_resolver/v4_mapped.html | 2 +- .../reference/ip__basic_resolver_entry.html | 2 +- .../basic_resolver_entry.html | 2 +- .../basic_resolver_entry/overload1.html | 2 +- .../basic_resolver_entry/overload2.html | 2 +- .../ip__basic_resolver_entry/endpoint.html | 2 +- .../ip__basic_resolver_entry/endpoint_type.html | 2 +- .../ip__basic_resolver_entry/host_name.html | 2 +- .../host_name/overload1.html | 2 +- .../host_name/overload2.html | 2 +- .../operator_endpoint_type.html | 2 +- .../ip__basic_resolver_entry/protocol_type.html | 2 +- .../ip__basic_resolver_entry/service_name.html | 2 +- .../service_name/overload1.html | 2 +- .../service_name/overload2.html | 2 +- .../reference/ip__basic_resolver_iterator.html | 2 +- .../basic_resolver_iterator.html | 2 +- .../basic_resolver_iterator/overload1.html | 2 +- .../basic_resolver_iterator/overload2.html | 2 +- .../basic_resolver_iterator/overload3.html | 2 +- .../ip__basic_resolver_iterator/dereference.html | 2 +- .../difference_type.html | 2 +- .../ip__basic_resolver_iterator/equal.html | 2 +- .../ip__basic_resolver_iterator/increment.html | 2 +- .../ip__basic_resolver_iterator/index_.html | 2 +- .../iterator_category.html | 2 +- .../operator__star_.html | 2 +- .../operator_arrow_.html | 2 +- .../ip__basic_resolver_iterator/operator_eq_.html | 2 +- .../operator_eq_/overload1.html | 2 +- .../operator_eq_/overload2.html | 2 +- .../operator_eq__eq_.html | 2 +- .../operator_not__eq_.html | 2 +- .../operator_plus__plus_.html | 2 +- .../operator_plus__plus_/overload1.html | 2 +- .../operator_plus__plus_/overload2.html | 2 +- .../ip__basic_resolver_iterator/pointer.html | 2 +- .../ip__basic_resolver_iterator/reference.html | 2 +- .../ip__basic_resolver_iterator/value_type.html | 2 +- .../ip__basic_resolver_iterator/values_.html | 2 +- .../reference/ip__basic_resolver_query.html | 2 +- .../address_configured.html | 2 +- .../ip__basic_resolver_query/all_matching.html | 2 +- .../basic_resolver_query.html | 2 +- .../basic_resolver_query/overload1.html | 2 +- .../basic_resolver_query/overload2.html | 2 +- .../basic_resolver_query/overload3.html | 2 +- .../basic_resolver_query/overload4.html | 2 +- .../ip__basic_resolver_query/canonical_name.html | 2 +- .../reference/ip__basic_resolver_query/flags.html | 2 +- .../reference/ip__basic_resolver_query/hints.html | 2 +- .../ip__basic_resolver_query/host_name.html | 2 +- .../ip__basic_resolver_query/numeric_host.html | 2 +- .../ip__basic_resolver_query/numeric_service.html | 2 +- .../ip__basic_resolver_query/passive.html | 2 +- .../ip__basic_resolver_query/protocol_type.html | 2 +- .../ip__basic_resolver_query/service_name.html | 2 +- .../ip__basic_resolver_query/v4_mapped.html | 2 +- .../reference/ip__basic_resolver_results.html | 2 +- .../basic_resolver_results.html | 2 +- .../basic_resolver_results/overload1.html | 2 +- .../basic_resolver_results/overload2.html | 2 +- .../basic_resolver_results/overload3.html | 2 +- .../ip__basic_resolver_results/begin.html | 2 +- .../ip__basic_resolver_results/cbegin.html | 2 +- .../reference/ip__basic_resolver_results/cend.html | 2 +- .../ip__basic_resolver_results/const_iterator.html | 2 +- .../const_reference.html | 2 +- .../ip__basic_resolver_results/dereference.html | 2 +- .../difference_type.html | 2 +- .../ip__basic_resolver_results/empty.html | 2 +- .../reference/ip__basic_resolver_results/end.html | 2 +- .../ip__basic_resolver_results/endpoint_type.html | 2 +- .../ip__basic_resolver_results/equal.html | 2 +- .../ip__basic_resolver_results/increment.html | 2 +- .../ip__basic_resolver_results/index_.html | 2 +- .../ip__basic_resolver_results/iterator.html | 2 +- .../iterator_category.html | 2 +- .../ip__basic_resolver_results/max_size.html | 2 +- .../operator__star_.html | 2 +- .../operator_arrow_.html | 2 +- .../ip__basic_resolver_results/operator_eq_.html | 2 +- .../operator_eq_/overload1.html | 2 +- .../operator_eq_/overload2.html | 2 +- .../operator_eq__eq_.html | 2 +- .../operator_eq__eq_/overload1.html | 2 +- .../operator_eq__eq_/overload2.html | 2 +- .../operator_not__eq_.html | 2 +- .../operator_not__eq_/overload1.html | 2 +- .../operator_not__eq_/overload2.html | 2 +- .../operator_plus__plus_.html | 2 +- .../operator_plus__plus_/overload1.html | 2 +- .../operator_plus__plus_/overload2.html | 2 +- .../ip__basic_resolver_results/pointer.html | 2 +- .../ip__basic_resolver_results/protocol_type.html | 2 +- .../ip__basic_resolver_results/reference.html | 2 +- .../reference/ip__basic_resolver_results/size.html | 2 +- .../ip__basic_resolver_results/size_type.html | 2 +- .../reference/ip__basic_resolver_results/swap.html | 2 +- .../ip__basic_resolver_results/value_type.html | 4 +- .../ip__basic_resolver_results/values_.html | 2 +- doc/html/boost_asio/reference/ip__host_name.html | 2 +- .../reference/ip__host_name/overload1.html | 2 +- .../reference/ip__host_name/overload2.html | 2 +- doc/html/boost_asio/reference/ip__icmp.html | 2 +- .../boost_asio/reference/ip__icmp/endpoint.html | 2 +- doc/html/boost_asio/reference/ip__icmp/family.html | 2 +- .../reference/ip__icmp/operator_eq__eq_.html | 2 +- .../reference/ip__icmp/operator_not__eq_.html | 2 +- .../boost_asio/reference/ip__icmp/protocol.html | 2 +- .../boost_asio/reference/ip__icmp/resolver.html | 2 +- doc/html/boost_asio/reference/ip__icmp/socket.html | 2 +- doc/html/boost_asio/reference/ip__icmp/type.html | 2 +- doc/html/boost_asio/reference/ip__icmp/v4.html | 2 +- doc/html/boost_asio/reference/ip__icmp/v6.html | 2 +- .../reference/ip__multicast__enable_loopback.html | 2 +- .../boost_asio/reference/ip__multicast__hops.html | 2 +- .../reference/ip__multicast__join_group.html | 2 +- .../reference/ip__multicast__leave_group.html | 2 +- .../ip__multicast__outbound_interface.html | 2 +- doc/html/boost_asio/reference/ip__network_v4.html | 2 +- .../reference/ip__network_v4/address.html | 2 +- .../reference/ip__network_v4/broadcast.html | 2 +- .../reference/ip__network_v4/canonical.html | 2 +- .../boost_asio/reference/ip__network_v4/hosts.html | 2 +- .../reference/ip__network_v4/is_host.html | 2 +- .../reference/ip__network_v4/is_subnet_of.html | 2 +- .../reference/ip__network_v4/make_network_v4.html | 2 +- .../ip__network_v4/make_network_v4/overload1.html | 2 +- .../ip__network_v4/make_network_v4/overload2.html | 2 +- .../ip__network_v4/make_network_v4/overload3.html | 2 +- .../ip__network_v4/make_network_v4/overload4.html | 2 +- .../ip__network_v4/make_network_v4/overload5.html | 2 +- .../ip__network_v4/make_network_v4/overload6.html | 2 +- .../reference/ip__network_v4/netmask.html | 2 +- .../reference/ip__network_v4/network.html | 2 +- .../reference/ip__network_v4/network_v4.html | 2 +- .../ip__network_v4/network_v4/overload1.html | 2 +- .../ip__network_v4/network_v4/overload2.html | 2 +- .../ip__network_v4/network_v4/overload3.html | 2 +- .../ip__network_v4/network_v4/overload4.html | 2 +- .../reference/ip__network_v4/operator_eq_.html | 2 +- .../reference/ip__network_v4/operator_eq__eq_.html | 2 +- .../ip__network_v4/operator_not__eq_.html | 2 +- .../reference/ip__network_v4/prefix_length.html | 2 +- .../reference/ip__network_v4/to_string.html | 2 +- .../ip__network_v4/to_string/overload1.html | 2 +- .../ip__network_v4/to_string/overload2.html | 2 +- doc/html/boost_asio/reference/ip__network_v6.html | 2 +- .../reference/ip__network_v6/address.html | 2 +- .../reference/ip__network_v6/canonical.html | 2 +- .../boost_asio/reference/ip__network_v6/hosts.html | 2 +- .../reference/ip__network_v6/is_host.html | 2 +- .../reference/ip__network_v6/is_subnet_of.html | 2 +- .../reference/ip__network_v6/make_network_v6.html | 2 +- .../ip__network_v6/make_network_v6/overload1.html | 2 +- .../ip__network_v6/make_network_v6/overload2.html | 2 +- .../ip__network_v6/make_network_v6/overload3.html | 2 +- .../ip__network_v6/make_network_v6/overload4.html | 2 +- .../ip__network_v6/make_network_v6/overload5.html | 2 +- .../ip__network_v6/make_network_v6/overload6.html | 2 +- .../reference/ip__network_v6/network.html | 2 +- .../reference/ip__network_v6/network_v6.html | 2 +- .../ip__network_v6/network_v6/overload1.html | 2 +- .../ip__network_v6/network_v6/overload2.html | 2 +- .../ip__network_v6/network_v6/overload3.html | 2 +- .../reference/ip__network_v6/operator_eq_.html | 2 +- .../reference/ip__network_v6/operator_eq__eq_.html | 2 +- .../ip__network_v6/operator_not__eq_.html | 2 +- .../reference/ip__network_v6/prefix_length.html | 2 +- .../reference/ip__network_v6/to_string.html | 2 +- .../ip__network_v6/to_string/overload1.html | 2 +- .../ip__network_v6/to_string/overload2.html | 2 +- .../boost_asio/reference/ip__resolver_base.html | 2 +- .../ip__resolver_base/_resolver_base.html | 2 +- .../ip__resolver_base/address_configured.html | 2 +- .../reference/ip__resolver_base/all_matching.html | 2 +- .../ip__resolver_base/canonical_name.html | 2 +- .../reference/ip__resolver_base/flags.html | 2 +- .../reference/ip__resolver_base/numeric_host.html | 2 +- .../ip__resolver_base/numeric_service.html | 2 +- .../reference/ip__resolver_base/passive.html | 2 +- .../reference/ip__resolver_base/v4_mapped.html | 2 +- .../reference/ip__resolver_query_base.html | 2 +- .../_resolver_query_base.html | 2 +- .../address_configured.html | 2 +- .../ip__resolver_query_base/all_matching.html | 2 +- .../ip__resolver_query_base/canonical_name.html | 2 +- .../reference/ip__resolver_query_base/flags.html | 2 +- .../ip__resolver_query_base/numeric_host.html | 2 +- .../ip__resolver_query_base/numeric_service.html | 2 +- .../reference/ip__resolver_query_base/passive.html | 2 +- .../ip__resolver_query_base/v4_mapped.html | 2 +- doc/html/boost_asio/reference/ip__tcp.html | 2 +- .../boost_asio/reference/ip__tcp/acceptor.html | 2 +- .../boost_asio/reference/ip__tcp/endpoint.html | 2 +- doc/html/boost_asio/reference/ip__tcp/family.html | 2 +- .../boost_asio/reference/ip__tcp/iostream.html | 2 +- .../boost_asio/reference/ip__tcp/no_delay.html | 2 +- .../reference/ip__tcp/operator_eq__eq_.html | 2 +- .../reference/ip__tcp/operator_not__eq_.html | 2 +- .../boost_asio/reference/ip__tcp/protocol.html | 2 +- .../boost_asio/reference/ip__tcp/resolver.html | 2 +- doc/html/boost_asio/reference/ip__tcp/socket.html | 2 +- doc/html/boost_asio/reference/ip__tcp/type.html | 2 +- doc/html/boost_asio/reference/ip__tcp/v4.html | 2 +- doc/html/boost_asio/reference/ip__tcp/v6.html | 2 +- doc/html/boost_asio/reference/ip__udp.html | 2 +- .../boost_asio/reference/ip__udp/endpoint.html | 2 +- doc/html/boost_asio/reference/ip__udp/family.html | 2 +- .../reference/ip__udp/operator_eq__eq_.html | 2 +- .../reference/ip__udp/operator_not__eq_.html | 2 +- .../boost_asio/reference/ip__udp/protocol.html | 2 +- .../boost_asio/reference/ip__udp/resolver.html | 2 +- doc/html/boost_asio/reference/ip__udp/socket.html | 2 +- doc/html/boost_asio/reference/ip__udp/type.html | 2 +- doc/html/boost_asio/reference/ip__udp/v4.html | 2 +- doc/html/boost_asio/reference/ip__udp/v6.html | 2 +- .../boost_asio/reference/ip__unicast__hops.html | 2 +- doc/html/boost_asio/reference/ip__v4_mapped_t.html | 2 +- doc/html/boost_asio/reference/ip__v6_only.html | 2 +- .../reference/is_const_buffer_sequence.html | 2 +- .../boost_asio/reference/is_dynamic_buffer.html | 2 +- .../boost_asio/reference/is_endpoint_sequence.html | 2 +- .../reference/is_endpoint_sequence/value.html | 2 +- ...s_error_code_enum_lt__addrinfo_errors__gt_.html | 2 +- .../value.html | 2 +- .../is_error_code_enum_lt__basic_errors__gt_.html | 2 +- .../value.html | 2 +- ...oost__asio__ssl__error__stream_errors__gt_.html | 2 +- .../value.html | 2 +- .../is_error_code_enum_lt__misc_errors__gt_.html | 2 +- .../value.html | 2 +- .../is_error_code_enum_lt__netdb_errors__gt_.html | 2 +- .../value.html | 2 +- .../is_error_code_enum_lt__ssl_errors__gt_.html | 2 +- .../value.html | 2 +- doc/html/boost_asio/reference/is_executor.html | 2 +- .../boost_asio/reference/is_match_condition.html | 2 +- .../reference/is_match_condition/value.html | 2 +- .../reference/is_mutable_buffer_sequence.html | 2 +- .../boost_asio/reference/is_read_buffered.html | 2 +- .../reference/is_read_buffered/value.html | 2 +- .../boost_asio/reference/is_write_buffered.html | 2 +- .../reference/is_write_buffered/value.html | 2 +- .../reference/local__basic_endpoint.html | 2 +- .../local__basic_endpoint/basic_endpoint.html | 2 +- .../basic_endpoint/overload1.html | 2 +- .../basic_endpoint/overload2.html | 2 +- .../basic_endpoint/overload3.html | 2 +- .../basic_endpoint/overload4.html | 2 +- .../reference/local__basic_endpoint/capacity.html | 2 +- .../reference/local__basic_endpoint/data.html | 2 +- .../local__basic_endpoint/data/overload1.html | 2 +- .../local__basic_endpoint/data/overload2.html | 2 +- .../reference/local__basic_endpoint/data_type.html | 2 +- .../local__basic_endpoint/operator_eq_.html | 2 +- .../local__basic_endpoint/operator_eq__eq_.html | 2 +- .../local__basic_endpoint/operator_gt_.html | 2 +- .../local__basic_endpoint/operator_gt__eq_.html | 2 +- .../local__basic_endpoint/operator_lt_.html | 2 +- .../local__basic_endpoint/operator_lt__eq_.html | 2 +- .../local__basic_endpoint/operator_lt__lt_.html | 2 +- .../local__basic_endpoint/operator_not__eq_.html | 2 +- .../reference/local__basic_endpoint/path.html | 2 +- .../local__basic_endpoint/path/overload1.html | 2 +- .../local__basic_endpoint/path/overload2.html | 2 +- .../local__basic_endpoint/path/overload3.html | 2 +- .../reference/local__basic_endpoint/protocol.html | 2 +- .../local__basic_endpoint/protocol_type.html | 2 +- .../reference/local__basic_endpoint/resize.html | 2 +- .../reference/local__basic_endpoint/size.html | 2 +- .../boost_asio/reference/local__connect_pair.html | 2 +- .../reference/local__connect_pair/overload1.html | 2 +- .../reference/local__connect_pair/overload2.html | 2 +- .../reference/local__datagram_protocol.html | 2 +- .../local__datagram_protocol/endpoint.html | 2 +- .../reference/local__datagram_protocol/family.html | 2 +- .../local__datagram_protocol/protocol.html | 2 +- .../reference/local__datagram_protocol/socket.html | 2 +- .../reference/local__datagram_protocol/type.html | 2 +- .../reference/local__stream_protocol.html | 2 +- .../reference/local__stream_protocol/acceptor.html | 2 +- .../reference/local__stream_protocol/endpoint.html | 2 +- .../reference/local__stream_protocol/family.html | 2 +- .../reference/local__stream_protocol/iostream.html | 2 +- .../reference/local__stream_protocol/protocol.html | 2 +- .../reference/local__stream_protocol/socket.html | 2 +- .../reference/local__stream_protocol/type.html | 2 +- doc/html/boost_asio/reference/make_work_guard.html | 4 +- .../reference/make_work_guard/overload1.html | 2 +- .../reference/make_work_guard/overload2.html | 2 +- .../reference/make_work_guard/overload3.html | 2 +- .../reference/make_work_guard/overload4.html | 2 +- .../reference/make_work_guard/overload5.html | 4 +- doc/html/boost_asio/reference/mutable_buffer.html | 2 +- .../boost_asio/reference/mutable_buffer/data.html | 2 +- .../reference/mutable_buffer/mutable_buffer.html | 2 +- .../mutable_buffer/mutable_buffer/overload1.html | 2 +- .../mutable_buffer/mutable_buffer/overload2.html | 2 +- .../reference/mutable_buffer/operator_plus_.html | 2 +- .../mutable_buffer/operator_plus_/overload1.html | 2 +- .../mutable_buffer/operator_plus_/overload2.html | 2 +- .../mutable_buffer/operator_plus__eq_.html | 2 +- .../boost_asio/reference/mutable_buffer/size.html | 2 +- .../boost_asio/reference/mutable_buffers_1.html | 2 +- .../reference/mutable_buffers_1/begin.html | 2 +- .../mutable_buffers_1/const_iterator.html | 2 +- .../reference/mutable_buffers_1/data.html | 2 +- .../reference/mutable_buffers_1/end.html | 2 +- .../mutable_buffers_1/mutable_buffers_1.html | 2 +- .../mutable_buffers_1/overload1.html | 2 +- .../mutable_buffers_1/overload2.html | 2 +- .../mutable_buffers_1/operator_plus_.html | 2 +- .../operator_plus_/overload1.html | 2 +- .../operator_plus_/overload2.html | 2 +- .../mutable_buffers_1/operator_plus__eq_.html | 2 +- .../reference/mutable_buffers_1/size.html | 2 +- .../reference/mutable_buffers_1/value_type.html | 2 +- doc/html/boost_asio/reference/null_buffers.html | 2 +- .../boost_asio/reference/null_buffers/begin.html | 2 +- .../reference/null_buffers/const_iterator.html | 2 +- .../boost_asio/reference/null_buffers/end.html | 2 +- .../reference/null_buffers/value_type.html | 2 +- .../reference/placeholders__bytes_transferred.html | 2 +- .../reference/placeholders__endpoint.html | 2 +- .../boost_asio/reference/placeholders__error.html | 2 +- .../reference/placeholders__iterator.html | 2 +- .../reference/placeholders__results.html | 2 +- .../reference/placeholders__signal_number.html | 2 +- .../boost_asio/reference/posix__descriptor.html | 2 +- .../reference/posix__descriptor/_descriptor.html | 2 +- .../reference/posix__descriptor/assign.html | 2 +- .../posix__descriptor/assign/overload1.html | 2 +- .../posix__descriptor/assign/overload2.html | 2 +- .../reference/posix__descriptor/async_wait.html | 2 +- .../posix__descriptor/bytes_readable.html | 2 +- .../reference/posix__descriptor/cancel.html | 2 +- .../posix__descriptor/cancel/overload1.html | 2 +- .../posix__descriptor/cancel/overload2.html | 2 +- .../reference/posix__descriptor/close.html | 2 +- .../posix__descriptor/close/overload1.html | 2 +- .../posix__descriptor/close/overload2.html | 2 +- .../reference/posix__descriptor/descriptor.html | 2 +- .../posix__descriptor/descriptor/overload1.html | 2 +- .../posix__descriptor/descriptor/overload2.html | 2 +- .../posix__descriptor/descriptor/overload3.html | 2 +- .../reference/posix__descriptor/executor_type.html | 2 +- .../reference/posix__descriptor/get_executor.html | 2 +- .../posix__descriptor/get_io_context.html | 2 +- .../posix__descriptor/get_io_service.html | 2 +- .../reference/posix__descriptor/io_control.html | 2 +- .../posix__descriptor/io_control/overload1.html | 2 +- .../posix__descriptor/io_control/overload2.html | 2 +- .../reference/posix__descriptor/is_open.html | 2 +- .../reference/posix__descriptor/lowest_layer.html | 2 +- .../posix__descriptor/lowest_layer/overload1.html | 2 +- .../posix__descriptor/lowest_layer/overload2.html | 2 +- .../posix__descriptor/lowest_layer_type.html | 2 +- .../reference/posix__descriptor/native_handle.html | 2 +- .../posix__descriptor/native_handle_type.html | 2 +- .../posix__descriptor/native_non_blocking.html | 2 +- .../native_non_blocking/overload1.html | 2 +- .../native_non_blocking/overload2.html | 2 +- .../native_non_blocking/overload3.html | 2 +- .../reference/posix__descriptor/non_blocking.html | 2 +- .../posix__descriptor/non_blocking/overload1.html | 2 +- .../posix__descriptor/non_blocking/overload2.html | 2 +- .../posix__descriptor/non_blocking/overload3.html | 2 +- .../reference/posix__descriptor/operator_eq_.html | 2 +- .../reference/posix__descriptor/release.html | 2 +- .../reference/posix__descriptor/wait.html | 2 +- .../posix__descriptor/wait/overload1.html | 2 +- .../posix__descriptor/wait/overload2.html | 2 +- .../reference/posix__descriptor/wait_type.html | 2 +- .../reference/posix__descriptor_base.html | 2 +- .../posix__descriptor_base/_descriptor_base.html | 2 +- .../posix__descriptor_base/bytes_readable.html | 2 +- .../posix__descriptor_base/wait_type.html | 2 +- .../reference/posix__stream_descriptor.html | 2 +- .../reference/posix__stream_descriptor/assign.html | 2 +- .../posix__stream_descriptor/assign/overload1.html | 2 +- .../posix__stream_descriptor/assign/overload2.html | 2 +- .../posix__stream_descriptor/async_read_some.html | 2 +- .../posix__stream_descriptor/async_wait.html | 2 +- .../posix__stream_descriptor/async_write_some.html | 2 +- .../posix__stream_descriptor/bytes_readable.html | 2 +- .../reference/posix__stream_descriptor/cancel.html | 2 +- .../posix__stream_descriptor/cancel/overload1.html | 2 +- .../posix__stream_descriptor/cancel/overload2.html | 2 +- .../reference/posix__stream_descriptor/close.html | 2 +- .../posix__stream_descriptor/close/overload1.html | 2 +- .../posix__stream_descriptor/close/overload2.html | 2 +- .../posix__stream_descriptor/executor_type.html | 2 +- .../posix__stream_descriptor/get_executor.html | 2 +- .../posix__stream_descriptor/get_io_context.html | 2 +- .../posix__stream_descriptor/get_io_service.html | 2 +- .../posix__stream_descriptor/io_control.html | 2 +- .../io_control/overload1.html | 2 +- .../io_control/overload2.html | 2 +- .../posix__stream_descriptor/is_open.html | 2 +- .../posix__stream_descriptor/lowest_layer.html | 2 +- .../lowest_layer/overload1.html | 2 +- .../lowest_layer/overload2.html | 2 +- .../lowest_layer_type.html | 2 +- .../posix__stream_descriptor/native_handle.html | 2 +- .../native_handle_type.html | 2 +- .../native_non_blocking.html | 2 +- .../native_non_blocking/overload1.html | 2 +- .../native_non_blocking/overload2.html | 2 +- .../native_non_blocking/overload3.html | 2 +- .../posix__stream_descriptor/non_blocking.html | 2 +- .../non_blocking/overload1.html | 2 +- .../non_blocking/overload2.html | 2 +- .../non_blocking/overload3.html | 2 +- .../posix__stream_descriptor/operator_eq_.html | 2 +- .../posix__stream_descriptor/read_some.html | 2 +- .../read_some/overload1.html | 2 +- .../read_some/overload2.html | 2 +- .../posix__stream_descriptor/release.html | 2 +- .../stream_descriptor.html | 2 +- .../stream_descriptor/overload1.html | 2 +- .../stream_descriptor/overload2.html | 2 +- .../stream_descriptor/overload3.html | 2 +- .../reference/posix__stream_descriptor/wait.html | 2 +- .../posix__stream_descriptor/wait/overload1.html | 2 +- .../posix__stream_descriptor/wait/overload2.html | 2 +- .../posix__stream_descriptor/wait_type.html | 2 +- .../posix__stream_descriptor/write_some.html | 2 +- .../write_some/overload1.html | 2 +- .../write_some/overload2.html | 2 +- doc/html/boost_asio/reference/post.html | 2 +- doc/html/boost_asio/reference/post/overload1.html | 2 +- doc/html/boost_asio/reference/post/overload2.html | 2 +- doc/html/boost_asio/reference/post/overload3.html | 2 +- doc/html/boost_asio/reference/read.html | 10 +- doc/html/boost_asio/reference/read/overload1.html | 2 +- doc/html/boost_asio/reference/read/overload10.html | 2 +- doc/html/boost_asio/reference/read/overload11.html | 2 +- doc/html/boost_asio/reference/read/overload12.html | 2 +- doc/html/boost_asio/reference/read/overload2.html | 2 +- doc/html/boost_asio/reference/read/overload3.html | 2 +- doc/html/boost_asio/reference/read/overload4.html | 2 +- doc/html/boost_asio/reference/read/overload5.html | 4 +- doc/html/boost_asio/reference/read/overload6.html | 4 +- doc/html/boost_asio/reference/read/overload7.html | 4 +- doc/html/boost_asio/reference/read/overload8.html | 4 +- doc/html/boost_asio/reference/read/overload9.html | 2 +- doc/html/boost_asio/reference/read_at.html | 2 +- .../boost_asio/reference/read_at/overload1.html | 2 +- .../boost_asio/reference/read_at/overload2.html | 2 +- .../boost_asio/reference/read_at/overload3.html | 2 +- .../boost_asio/reference/read_at/overload4.html | 2 +- .../boost_asio/reference/read_at/overload5.html | 2 +- .../boost_asio/reference/read_at/overload6.html | 2 +- .../boost_asio/reference/read_at/overload7.html | 2 +- .../boost_asio/reference/read_at/overload8.html | 2 +- doc/html/boost_asio/reference/read_until.html | 2 +- .../boost_asio/reference/read_until/overload1.html | 2 +- .../reference/read_until/overload10.html | 2 +- .../reference/read_until/overload11.html | 2 +- .../reference/read_until/overload12.html | 2 +- .../reference/read_until/overload13.html | 2 +- .../reference/read_until/overload14.html | 2 +- .../reference/read_until/overload15.html | 2 +- .../reference/read_until/overload16.html | 2 +- .../boost_asio/reference/read_until/overload2.html | 2 +- .../boost_asio/reference/read_until/overload3.html | 2 +- .../boost_asio/reference/read_until/overload4.html | 2 +- .../boost_asio/reference/read_until/overload5.html | 2 +- .../boost_asio/reference/read_until/overload6.html | 2 +- .../boost_asio/reference/read_until/overload7.html | 2 +- .../boost_asio/reference/read_until/overload8.html | 2 +- .../boost_asio/reference/read_until/overload9.html | 2 +- .../reference/read_write_operations.html | 2 +- .../reference/resolver_errc__try_again.html | 2 +- doc/html/boost_asio/reference/serial_port.html | 2 +- .../reference/serial_port/_serial_port.html | 2 +- .../boost_asio/reference/serial_port/assign.html | 2 +- .../reference/serial_port/assign/overload1.html | 2 +- .../reference/serial_port/assign/overload2.html | 2 +- .../reference/serial_port/async_read_some.html | 2 +- .../reference/serial_port/async_write_some.html | 2 +- .../boost_asio/reference/serial_port/cancel.html | 2 +- .../reference/serial_port/cancel/overload1.html | 2 +- .../reference/serial_port/cancel/overload2.html | 2 +- .../boost_asio/reference/serial_port/close.html | 2 +- .../reference/serial_port/close/overload1.html | 2 +- .../reference/serial_port/close/overload2.html | 2 +- .../reference/serial_port/executor_type.html | 2 +- .../reference/serial_port/get_executor.html | 2 +- .../reference/serial_port/get_io_context.html | 2 +- .../reference/serial_port/get_io_service.html | 2 +- .../reference/serial_port/get_option.html | 2 +- .../serial_port/get_option/overload1.html | 2 +- .../serial_port/get_option/overload2.html | 2 +- .../boost_asio/reference/serial_port/is_open.html | 2 +- .../reference/serial_port/lowest_layer.html | 2 +- .../serial_port/lowest_layer/overload1.html | 2 +- .../serial_port/lowest_layer/overload2.html | 2 +- .../reference/serial_port/lowest_layer_type.html | 2 +- .../reference/serial_port/native_handle.html | 2 +- .../reference/serial_port/native_handle_type.html | 2 +- .../boost_asio/reference/serial_port/open.html | 2 +- .../reference/serial_port/open/overload1.html | 2 +- .../reference/serial_port/open/overload2.html | 2 +- .../reference/serial_port/operator_eq_.html | 2 +- .../reference/serial_port/read_some.html | 2 +- .../reference/serial_port/read_some/overload1.html | 2 +- .../reference/serial_port/read_some/overload2.html | 2 +- .../reference/serial_port/send_break.html | 2 +- .../serial_port/send_break/overload1.html | 2 +- .../serial_port/send_break/overload2.html | 2 +- .../reference/serial_port/serial_port.html | 2 +- .../serial_port/serial_port/overload1.html | 2 +- .../serial_port/serial_port/overload2.html | 2 +- .../serial_port/serial_port/overload3.html | 2 +- .../serial_port/serial_port/overload4.html | 2 +- .../serial_port/serial_port/overload5.html | 2 +- .../reference/serial_port/set_option.html | 2 +- .../serial_port/set_option/overload1.html | 2 +- .../serial_port/set_option/overload2.html | 2 +- .../reference/serial_port/write_some.html | 2 +- .../serial_port/write_some/overload1.html | 2 +- .../serial_port/write_some/overload2.html | 2 +- .../boost_asio/reference/serial_port_base.html | 2 +- .../serial_port_base/_serial_port_base.html | 2 +- .../reference/serial_port_base__baud_rate.html | 2 +- .../serial_port_base__baud_rate/baud_rate.html | 2 +- .../serial_port_base__baud_rate/load.html | 2 +- .../serial_port_base__baud_rate/store.html | 2 +- .../serial_port_base__baud_rate/value.html | 2 +- .../serial_port_base__character_size.html | 2 +- .../character_size.html | 2 +- .../serial_port_base__character_size/load.html | 2 +- .../serial_port_base__character_size/store.html | 2 +- .../serial_port_base__character_size/value.html | 2 +- .../reference/serial_port_base__flow_control.html | 2 +- .../flow_control.html | 2 +- .../serial_port_base__flow_control/load.html | 2 +- .../serial_port_base__flow_control/store.html | 2 +- .../serial_port_base__flow_control/type.html | 2 +- .../serial_port_base__flow_control/value.html | 2 +- .../reference/serial_port_base__parity.html | 2 +- .../reference/serial_port_base__parity/load.html | 2 +- .../reference/serial_port_base__parity/parity.html | 2 +- .../reference/serial_port_base__parity/store.html | 2 +- .../reference/serial_port_base__parity/type.html | 2 +- .../reference/serial_port_base__parity/value.html | 2 +- .../reference/serial_port_base__stop_bits.html | 2 +- .../serial_port_base__stop_bits/load.html | 2 +- .../serial_port_base__stop_bits/stop_bits.html | 2 +- .../serial_port_base__stop_bits/store.html | 2 +- .../serial_port_base__stop_bits/type.html | 2 +- .../serial_port_base__stop_bits/value.html | 2 +- .../reference/service_already_exists.html | 2 +- .../service_already_exists.html | 2 +- doc/html/boost_asio/reference/signal_set.html | 2 +- .../reference/signal_set/_signal_set.html | 2 +- doc/html/boost_asio/reference/signal_set/add.html | 2 +- .../reference/signal_set/add/overload1.html | 2 +- .../reference/signal_set/add/overload2.html | 2 +- .../reference/signal_set/async_wait.html | 2 +- .../boost_asio/reference/signal_set/cancel.html | 2 +- .../reference/signal_set/cancel/overload1.html | 2 +- .../reference/signal_set/cancel/overload2.html | 2 +- .../boost_asio/reference/signal_set/clear.html | 2 +- .../reference/signal_set/clear/overload1.html | 2 +- .../reference/signal_set/clear/overload2.html | 2 +- .../reference/signal_set/executor_type.html | 2 +- .../reference/signal_set/get_executor.html | 2 +- .../reference/signal_set/get_io_context.html | 2 +- .../reference/signal_set/get_io_service.html | 2 +- .../boost_asio/reference/signal_set/remove.html | 2 +- .../reference/signal_set/remove/overload1.html | 2 +- .../reference/signal_set/remove/overload2.html | 2 +- .../reference/signal_set/signal_set.html | 2 +- .../reference/signal_set/signal_set/overload1.html | 2 +- .../reference/signal_set/signal_set/overload2.html | 2 +- .../reference/signal_set/signal_set/overload3.html | 2 +- .../reference/signal_set/signal_set/overload4.html | 2 +- doc/html/boost_asio/reference/socket_base.html | 2 +- .../reference/socket_base/_socket_base.html | 2 +- .../reference/socket_base/broadcast.html | 2 +- .../reference/socket_base/bytes_readable.html | 2 +- .../boost_asio/reference/socket_base/debug.html | 2 +- .../reference/socket_base/do_not_route.html | 2 +- .../socket_base/enable_connection_aborted.html | 2 +- .../reference/socket_base/keep_alive.html | 2 +- .../boost_asio/reference/socket_base/linger.html | 2 +- .../reference/socket_base/max_connections.html | 2 +- .../socket_base/max_listen_connections.html | 2 +- .../socket_base/message_do_not_route.html | 2 +- .../socket_base/message_end_of_record.html | 2 +- .../reference/socket_base/message_flags.html | 2 +- .../reference/socket_base/message_out_of_band.html | 2 +- .../reference/socket_base/message_peek.html | 2 +- .../reference/socket_base/out_of_band_inline.html | 2 +- .../reference/socket_base/receive_buffer_size.html | 2 +- .../socket_base/receive_low_watermark.html | 2 +- .../reference/socket_base/reuse_address.html | 2 +- .../reference/socket_base/send_buffer_size.html | 2 +- .../reference/socket_base/send_low_watermark.html | 2 +- .../reference/socket_base/shutdown_type.html | 2 +- .../reference/socket_base/wait_type.html | 2 +- doc/html/boost_asio/reference/spawn.html | 2 +- doc/html/boost_asio/reference/spawn/overload1.html | 2 +- doc/html/boost_asio/reference/spawn/overload2.html | 2 +- doc/html/boost_asio/reference/spawn/overload3.html | 2 +- doc/html/boost_asio/reference/spawn/overload4.html | 2 +- doc/html/boost_asio/reference/spawn/overload5.html | 2 +- doc/html/boost_asio/reference/spawn/overload6.html | 2 +- doc/html/boost_asio/reference/spawn/overload7.html | 2 +- doc/html/boost_asio/reference/ssl__context.html | 2 +- .../reference/ssl__context/_context.html | 2 +- .../ssl__context/add_certificate_authority.html | 2 +- .../add_certificate_authority/overload1.html | 2 +- .../add_certificate_authority/overload2.html | 2 +- .../reference/ssl__context/add_verify_path.html | 2 +- .../ssl__context/add_verify_path/overload1.html | 2 +- .../ssl__context/add_verify_path/overload2.html | 2 +- .../reference/ssl__context/clear_options.html | 2 +- .../ssl__context/clear_options/overload1.html | 2 +- .../ssl__context/clear_options/overload2.html | 2 +- .../boost_asio/reference/ssl__context/context.html | 2 +- .../reference/ssl__context/context/overload1.html | 2 +- .../reference/ssl__context/context/overload2.html | 2 +- .../ssl__context/default_workarounds.html | 2 +- .../reference/ssl__context/file_format.html | 2 +- .../reference/ssl__context/load_verify_file.html | 2 +- .../ssl__context/load_verify_file/overload1.html | 2 +- .../ssl__context/load_verify_file/overload2.html | 2 +- .../boost_asio/reference/ssl__context/method.html | 2 +- .../reference/ssl__context/native_handle.html | 2 +- .../reference/ssl__context/native_handle_type.html | 2 +- .../reference/ssl__context/no_compression.html | 2 +- .../reference/ssl__context/no_sslv2.html | 2 +- .../reference/ssl__context/no_sslv3.html | 2 +- .../reference/ssl__context/no_tlsv1.html | 2 +- .../reference/ssl__context/no_tlsv1_1.html | 2 +- .../reference/ssl__context/no_tlsv1_2.html | 2 +- .../reference/ssl__context/operator_eq_.html | 2 +- .../boost_asio/reference/ssl__context/options.html | 2 +- .../reference/ssl__context/password_purpose.html | 2 +- .../ssl__context/set_default_verify_paths.html | 2 +- .../set_default_verify_paths/overload1.html | 2 +- .../set_default_verify_paths/overload2.html | 2 +- .../reference/ssl__context/set_options.html | 2 +- .../ssl__context/set_options/overload1.html | 2 +- .../ssl__context/set_options/overload2.html | 2 +- .../ssl__context/set_password_callback.html | 2 +- .../set_password_callback/overload1.html | 2 +- .../set_password_callback/overload2.html | 2 +- .../ssl__context/set_verify_callback.html | 2 +- .../set_verify_callback/overload1.html | 2 +- .../set_verify_callback/overload2.html | 2 +- .../reference/ssl__context/set_verify_depth.html | 2 +- .../ssl__context/set_verify_depth/overload1.html | 2 +- .../ssl__context/set_verify_depth/overload2.html | 2 +- .../reference/ssl__context/set_verify_mode.html | 2 +- .../ssl__context/set_verify_mode/overload1.html | 2 +- .../ssl__context/set_verify_mode/overload2.html | 2 +- .../reference/ssl__context/single_dh_use.html | 2 +- .../reference/ssl__context/use_certificate.html | 2 +- .../ssl__context/use_certificate/overload1.html | 2 +- .../ssl__context/use_certificate/overload2.html | 2 +- .../ssl__context/use_certificate_chain.html | 2 +- .../use_certificate_chain/overload1.html | 2 +- .../use_certificate_chain/overload2.html | 2 +- .../ssl__context/use_certificate_chain_file.html | 2 +- .../use_certificate_chain_file/overload1.html | 2 +- .../use_certificate_chain_file/overload2.html | 2 +- .../ssl__context/use_certificate_file.html | 2 +- .../use_certificate_file/overload1.html | 2 +- .../use_certificate_file/overload2.html | 2 +- .../reference/ssl__context/use_private_key.html | 2 +- .../ssl__context/use_private_key/overload1.html | 2 +- .../ssl__context/use_private_key/overload2.html | 2 +- .../ssl__context/use_private_key_file.html | 2 +- .../use_private_key_file/overload1.html | 2 +- .../use_private_key_file/overload2.html | 2 +- .../ssl__context/use_rsa_private_key.html | 2 +- .../use_rsa_private_key/overload1.html | 2 +- .../use_rsa_private_key/overload2.html | 2 +- .../ssl__context/use_rsa_private_key_file.html | 2 +- .../use_rsa_private_key_file/overload1.html | 2 +- .../use_rsa_private_key_file/overload2.html | 2 +- .../reference/ssl__context/use_tmp_dh.html | 2 +- .../ssl__context/use_tmp_dh/overload1.html | 2 +- .../ssl__context/use_tmp_dh/overload2.html | 2 +- .../reference/ssl__context/use_tmp_dh_file.html | 2 +- .../ssl__context/use_tmp_dh_file/overload1.html | 2 +- .../ssl__context/use_tmp_dh_file/overload2.html | 2 +- .../boost_asio/reference/ssl__context_base.html | 2 +- .../reference/ssl__context_base/_context_base.html | 2 +- .../ssl__context_base/default_workarounds.html | 2 +- .../reference/ssl__context_base/file_format.html | 2 +- .../reference/ssl__context_base/method.html | 2 +- .../ssl__context_base/no_compression.html | 2 +- .../reference/ssl__context_base/no_sslv2.html | 2 +- .../reference/ssl__context_base/no_sslv3.html | 2 +- .../reference/ssl__context_base/no_tlsv1.html | 2 +- .../reference/ssl__context_base/no_tlsv1_1.html | 2 +- .../reference/ssl__context_base/no_tlsv1_2.html | 2 +- .../reference/ssl__context_base/options.html | 2 +- .../ssl__context_base/password_purpose.html | 2 +- .../reference/ssl__context_base/single_dh_use.html | 2 +- .../reference/ssl__error__get_stream_category.html | 2 +- .../reference/ssl__error__make_error_code.html | 2 +- .../reference/ssl__error__stream_category.html | 2 +- .../reference/ssl__error__stream_errors.html | 2 +- .../reference/ssl__rfc2818_verification.html | 2 +- .../operator_lp__rp_.html | 2 +- .../ssl__rfc2818_verification/result_type.html | 2 +- .../rfc2818_verification.html | 2 +- doc/html/boost_asio/reference/ssl__stream.html | 2 +- .../boost_asio/reference/ssl__stream/_stream.html | 2 +- .../reference/ssl__stream/async_handshake.html | 2 +- .../ssl__stream/async_handshake/overload1.html | 2 +- .../ssl__stream/async_handshake/overload2.html | 2 +- .../reference/ssl__stream/async_read_some.html | 2 +- .../reference/ssl__stream/async_shutdown.html | 2 +- .../reference/ssl__stream/async_write_some.html | 2 +- .../reference/ssl__stream/executor_type.html | 2 +- .../reference/ssl__stream/get_executor.html | 2 +- .../reference/ssl__stream/get_io_context.html | 2 +- .../reference/ssl__stream/get_io_service.html | 2 +- .../reference/ssl__stream/handshake.html | 2 +- .../reference/ssl__stream/handshake/overload1.html | 2 +- .../reference/ssl__stream/handshake/overload2.html | 2 +- .../reference/ssl__stream/handshake/overload3.html | 2 +- .../reference/ssl__stream/handshake/overload4.html | 2 +- .../reference/ssl__stream/handshake_type.html | 2 +- .../reference/ssl__stream/lowest_layer.html | 2 +- .../ssl__stream/lowest_layer/overload1.html | 2 +- .../ssl__stream/lowest_layer/overload2.html | 2 +- .../reference/ssl__stream/lowest_layer_type.html | 2 +- .../reference/ssl__stream/native_handle.html | 2 +- .../reference/ssl__stream/native_handle_type.html | 2 +- .../reference/ssl__stream/next_layer.html | 2 +- .../ssl__stream/next_layer/overload1.html | 2 +- .../ssl__stream/next_layer/overload2.html | 2 +- .../reference/ssl__stream/next_layer_type.html | 2 +- .../reference/ssl__stream/read_some.html | 2 +- .../reference/ssl__stream/read_some/overload1.html | 2 +- .../reference/ssl__stream/read_some/overload2.html | 2 +- .../reference/ssl__stream/set_verify_callback.html | 2 +- .../ssl__stream/set_verify_callback/overload1.html | 2 +- .../ssl__stream/set_verify_callback/overload2.html | 2 +- .../reference/ssl__stream/set_verify_depth.html | 2 +- .../ssl__stream/set_verify_depth/overload1.html | 2 +- .../ssl__stream/set_verify_depth/overload2.html | 2 +- .../reference/ssl__stream/set_verify_mode.html | 2 +- .../ssl__stream/set_verify_mode/overload1.html | 2 +- .../ssl__stream/set_verify_mode/overload2.html | 2 +- .../boost_asio/reference/ssl__stream/shutdown.html | 2 +- .../reference/ssl__stream/shutdown/overload1.html | 2 +- .../reference/ssl__stream/shutdown/overload2.html | 2 +- .../boost_asio/reference/ssl__stream/stream.html | 2 +- .../reference/ssl__stream/write_some.html | 2 +- .../ssl__stream/write_some/overload1.html | 2 +- .../ssl__stream/write_some/overload2.html | 2 +- .../reference/ssl__stream__impl_struct.html | 2 +- .../reference/ssl__stream__impl_struct/ssl.html | 2 +- .../boost_asio/reference/ssl__stream_base.html | 2 +- .../reference/ssl__stream_base/_stream_base.html | 2 +- .../reference/ssl__stream_base/handshake_type.html | 2 +- .../reference/ssl__verify_client_once.html | 2 +- .../boost_asio/reference/ssl__verify_context.html | 2 +- .../ssl__verify_context/native_handle.html | 2 +- .../ssl__verify_context/native_handle_type.html | 2 +- .../ssl__verify_context/verify_context.html | 2 +- .../ssl__verify_fail_if_no_peer_cert.html | 2 +- .../boost_asio/reference/ssl__verify_mode.html | 2 +- .../boost_asio/reference/ssl__verify_none.html | 2 +- .../boost_asio/reference/ssl__verify_peer.html | 2 +- doc/html/boost_asio/reference/steady_timer.html | 2 +- doc/html/boost_asio/reference/strand.html | 2 +- doc/html/boost_asio/reference/strand/_strand.html | 2 +- doc/html/boost_asio/reference/strand/context.html | 2 +- doc/html/boost_asio/reference/strand/defer.html | 2 +- doc/html/boost_asio/reference/strand/dispatch.html | 2 +- .../reference/strand/get_inner_executor.html | 2 +- .../reference/strand/inner_executor_type.html | 2 +- .../reference/strand/on_work_finished.html | 2 +- .../reference/strand/on_work_started.html | 2 +- .../boost_asio/reference/strand/operator_eq_.html | 2 +- .../reference/strand/operator_eq_/overload1.html | 2 +- .../reference/strand/operator_eq_/overload2.html | 2 +- .../reference/strand/operator_eq_/overload3.html | 2 +- .../reference/strand/operator_eq_/overload4.html | 2 +- .../reference/strand/operator_eq__eq_.html | 2 +- .../reference/strand/operator_not__eq_.html | 2 +- doc/html/boost_asio/reference/strand/post.html | 2 +- .../reference/strand/running_in_this_thread.html | 2 +- doc/html/boost_asio/reference/strand/strand.html | 2 +- .../reference/strand/strand/overload1.html | 2 +- .../reference/strand/strand/overload2.html | 2 +- .../reference/strand/strand/overload3.html | 2 +- .../reference/strand/strand/overload4.html | 2 +- .../reference/strand/strand/overload5.html | 2 +- .../reference/strand/strand/overload6.html | 2 +- doc/html/boost_asio/reference/streambuf.html | 2 +- .../reference/synchronous_socket_operations.html | 2 +- doc/html/boost_asio/reference/system_context.html | 2 +- .../reference/system_context/_system_context.html | 2 +- .../reference/system_context/add_service.html | 2 +- .../reference/system_context/destroy.html | 2 +- .../reference/system_context/executor_type.html | 2 +- .../reference/system_context/fork_event.html | 2 +- .../reference/system_context/get_executor.html | 2 +- .../reference/system_context/has_service.html | 2 +- .../boost_asio/reference/system_context/join.html | 2 +- .../reference/system_context/make_service.html | 2 +- .../reference/system_context/notify_fork.html | 2 +- .../reference/system_context/shutdown.html | 2 +- .../boost_asio/reference/system_context/stop.html | 2 +- .../reference/system_context/stopped.html | 2 +- .../reference/system_context/use_service.html | 2 +- .../system_context/use_service/overload1.html | 2 +- .../system_context/use_service/overload2.html | 2 +- doc/html/boost_asio/reference/system_executor.html | 2 +- .../reference/system_executor/context.html | 2 +- .../reference/system_executor/defer.html | 2 +- .../reference/system_executor/dispatch.html | 2 +- .../system_executor/on_work_finished.html | 2 +- .../reference/system_executor/on_work_started.html | 2 +- .../system_executor/operator_eq__eq_.html | 2 +- .../system_executor/operator_not__eq_.html | 2 +- .../boost_asio/reference/system_executor/post.html | 2 +- doc/html/boost_asio/reference/system_timer.html | 2 +- doc/html/boost_asio/reference/thread_pool.html | 2 +- .../reference/thread_pool/_thread_pool.html | 2 +- .../reference/thread_pool/add_service.html | 2 +- .../boost_asio/reference/thread_pool/destroy.html | 2 +- .../reference/thread_pool/fork_event.html | 2 +- .../reference/thread_pool/get_executor.html | 2 +- .../reference/thread_pool/has_service.html | 2 +- .../boost_asio/reference/thread_pool/join.html | 2 +- .../reference/thread_pool/make_service.html | 2 +- .../reference/thread_pool/notify_fork.html | 2 +- .../boost_asio/reference/thread_pool/shutdown.html | 2 +- .../boost_asio/reference/thread_pool/stop.html | 2 +- .../reference/thread_pool/thread_pool.html | 2 +- .../thread_pool/thread_pool/overload1.html | 2 +- .../thread_pool/thread_pool/overload2.html | 2 +- .../reference/thread_pool/use_service.html | 2 +- .../thread_pool/use_service/overload1.html | 2 +- .../thread_pool/use_service/overload2.html | 2 +- .../reference/thread_pool__executor_type.html | 2 +- .../thread_pool__executor_type/context.html | 2 +- .../thread_pool__executor_type/defer.html | 2 +- .../thread_pool__executor_type/dispatch.html | 2 +- .../on_work_finished.html | 2 +- .../on_work_started.html | 2 +- .../operator_eq__eq_.html | 2 +- .../operator_not__eq_.html | 2 +- .../reference/thread_pool__executor_type/post.html | 2 +- .../running_in_this_thread.html | 2 +- .../reference/time_traits_lt__ptime__gt_.html | 2 +- .../reference/time_traits_lt__ptime__gt_/add.html | 2 +- .../time_traits_lt__ptime__gt_/duration_type.html | 2 +- .../time_traits_lt__ptime__gt_/less_than.html | 2 +- .../reference/time_traits_lt__ptime__gt_/now.html | 2 +- .../time_traits_lt__ptime__gt_/subtract.html | 2 +- .../time_traits_lt__ptime__gt_/time_type.html | 2 +- .../to_posix_duration.html | 2 +- doc/html/boost_asio/reference/transfer_all.html | 2 +- .../boost_asio/reference/transfer_at_least.html | 2 +- .../boost_asio/reference/transfer_exactly.html | 2 +- doc/html/boost_asio/reference/use_future.html | 2 +- doc/html/boost_asio/reference/use_future_t.html | 2 +- .../reference/use_future_t/allocator_type.html | 2 +- .../reference/use_future_t/get_allocator.html | 2 +- .../reference/use_future_t/operator_lb__rb_.html | 2 +- .../reference/use_future_t/operator_lp__rp_.html | 2 +- .../boost_asio/reference/use_future_t/rebind.html | 2 +- .../reference/use_future_t/use_future_t.html | 2 +- .../use_future_t/use_future_t/overload1.html | 2 +- .../use_future_t/use_future_t/overload2.html | 2 +- doc/html/boost_asio/reference/use_service.html | 2 +- .../reference/use_service/overload1.html | 2 +- .../reference/use_service/overload2.html | 2 +- doc/html/boost_asio/reference/uses_executor.html | 2 +- doc/html/boost_asio/reference/wait_traits.html | 2 +- .../reference/wait_traits/to_wait_duration.html | 2 +- .../wait_traits/to_wait_duration/overload1.html | 2 +- .../wait_traits/to_wait_duration/overload2.html | 2 +- .../reference/windows__object_handle.html | 2 +- .../reference/windows__object_handle/assign.html | 2 +- .../windows__object_handle/assign/overload1.html | 2 +- .../windows__object_handle/assign/overload2.html | 2 +- .../windows__object_handle/async_wait.html | 2 +- .../reference/windows__object_handle/cancel.html | 2 +- .../windows__object_handle/cancel/overload1.html | 2 +- .../windows__object_handle/cancel/overload2.html | 2 +- .../reference/windows__object_handle/close.html | 2 +- .../windows__object_handle/close/overload1.html | 2 +- .../windows__object_handle/close/overload2.html | 2 +- .../windows__object_handle/executor_type.html | 2 +- .../windows__object_handle/get_executor.html | 2 +- .../windows__object_handle/get_io_context.html | 2 +- .../windows__object_handle/get_io_service.html | 2 +- .../reference/windows__object_handle/is_open.html | 2 +- .../windows__object_handle/lowest_layer.html | 2 +- .../lowest_layer/overload1.html | 2 +- .../lowest_layer/overload2.html | 2 +- .../windows__object_handle/lowest_layer_type.html | 2 +- .../windows__object_handle/native_handle.html | 2 +- .../windows__object_handle/native_handle_type.html | 2 +- .../windows__object_handle/object_handle.html | 2 +- .../object_handle/overload1.html | 2 +- .../object_handle/overload2.html | 2 +- .../object_handle/overload3.html | 2 +- .../windows__object_handle/operator_eq_.html | 2 +- .../reference/windows__object_handle/wait.html | 2 +- .../windows__object_handle/wait/overload1.html | 2 +- .../windows__object_handle/wait/overload2.html | 2 +- .../reference/windows__overlapped_handle.html | 2 +- .../_overlapped_handle.html | 2 +- .../windows__overlapped_handle/assign.html | 2 +- .../assign/overload1.html | 2 +- .../assign/overload2.html | 2 +- .../windows__overlapped_handle/cancel.html | 2 +- .../cancel/overload1.html | 2 +- .../cancel/overload2.html | 2 +- .../windows__overlapped_handle/close.html | 2 +- .../close/overload1.html | 2 +- .../close/overload2.html | 2 +- .../windows__overlapped_handle/executor_type.html | 2 +- .../windows__overlapped_handle/get_executor.html | 2 +- .../windows__overlapped_handle/get_io_context.html | 2 +- .../windows__overlapped_handle/get_io_service.html | 2 +- .../windows__overlapped_handle/is_open.html | 2 +- .../windows__overlapped_handle/lowest_layer.html | 2 +- .../lowest_layer/overload1.html | 2 +- .../lowest_layer/overload2.html | 2 +- .../lowest_layer_type.html | 2 +- .../windows__overlapped_handle/native_handle.html | 2 +- .../native_handle_type.html | 2 +- .../windows__overlapped_handle/operator_eq_.html | 2 +- .../overlapped_handle.html | 2 +- .../overlapped_handle/overload1.html | 2 +- .../overlapped_handle/overload2.html | 2 +- .../overlapped_handle/overload3.html | 2 +- .../reference/windows__overlapped_ptr.html | 2 +- .../windows__overlapped_ptr/_overlapped_ptr.html | 2 +- .../windows__overlapped_ptr/complete.html | 2 +- .../reference/windows__overlapped_ptr/get.html | 2 +- .../windows__overlapped_ptr/get/overload1.html | 2 +- .../windows__overlapped_ptr/get/overload2.html | 2 +- .../windows__overlapped_ptr/overlapped_ptr.html | 2 +- .../overlapped_ptr/overload1.html | 2 +- .../overlapped_ptr/overload2.html | 2 +- .../reference/windows__overlapped_ptr/release.html | 2 +- .../reference/windows__overlapped_ptr/reset.html | 2 +- .../windows__overlapped_ptr/reset/overload1.html | 2 +- .../windows__overlapped_ptr/reset/overload2.html | 2 +- .../reference/windows__random_access_handle.html | 2 +- .../windows__random_access_handle/assign.html | 2 +- .../assign/overload1.html | 2 +- .../assign/overload2.html | 2 +- .../async_read_some_at.html | 2 +- .../async_write_some_at.html | 2 +- .../windows__random_access_handle/cancel.html | 2 +- .../cancel/overload1.html | 2 +- .../cancel/overload2.html | 2 +- .../windows__random_access_handle/close.html | 2 +- .../close/overload1.html | 2 +- .../close/overload2.html | 2 +- .../executor_type.html | 2 +- .../get_executor.html | 2 +- .../get_io_context.html | 2 +- .../get_io_service.html | 2 +- .../windows__random_access_handle/is_open.html | 2 +- .../lowest_layer.html | 2 +- .../lowest_layer/overload1.html | 2 +- .../lowest_layer/overload2.html | 2 +- .../lowest_layer_type.html | 2 +- .../native_handle.html | 2 +- .../native_handle_type.html | 2 +- .../operator_eq_.html | 2 +- .../random_access_handle.html | 2 +- .../random_access_handle/overload1.html | 2 +- .../random_access_handle/overload2.html | 2 +- .../random_access_handle/overload3.html | 2 +- .../read_some_at.html | 2 +- .../read_some_at/overload1.html | 2 +- .../read_some_at/overload2.html | 2 +- .../write_some_at.html | 2 +- .../write_some_at/overload1.html | 2 +- .../write_some_at/overload2.html | 2 +- .../reference/windows__stream_handle.html | 2 +- .../reference/windows__stream_handle/assign.html | 2 +- .../windows__stream_handle/assign/overload1.html | 2 +- .../windows__stream_handle/assign/overload2.html | 2 +- .../windows__stream_handle/async_read_some.html | 2 +- .../windows__stream_handle/async_write_some.html | 2 +- .../reference/windows__stream_handle/cancel.html | 2 +- .../windows__stream_handle/cancel/overload1.html | 2 +- .../windows__stream_handle/cancel/overload2.html | 2 +- .../reference/windows__stream_handle/close.html | 2 +- .../windows__stream_handle/close/overload1.html | 2 +- .../windows__stream_handle/close/overload2.html | 2 +- .../windows__stream_handle/executor_type.html | 2 +- .../windows__stream_handle/get_executor.html | 2 +- .../windows__stream_handle/get_io_context.html | 2 +- .../windows__stream_handle/get_io_service.html | 2 +- .../reference/windows__stream_handle/is_open.html | 2 +- .../windows__stream_handle/lowest_layer.html | 2 +- .../lowest_layer/overload1.html | 2 +- .../lowest_layer/overload2.html | 2 +- .../windows__stream_handle/lowest_layer_type.html | 2 +- .../windows__stream_handle/native_handle.html | 2 +- .../windows__stream_handle/native_handle_type.html | 2 +- .../windows__stream_handle/operator_eq_.html | 2 +- .../windows__stream_handle/read_some.html | 2 +- .../read_some/overload1.html | 2 +- .../read_some/overload2.html | 2 +- .../windows__stream_handle/stream_handle.html | 2 +- .../stream_handle/overload1.html | 2 +- .../stream_handle/overload2.html | 2 +- .../stream_handle/overload3.html | 2 +- .../windows__stream_handle/write_some.html | 2 +- .../write_some/overload1.html | 2 +- .../write_some/overload2.html | 2 +- doc/html/boost_asio/reference/write.html | 10 +- doc/html/boost_asio/reference/write/overload1.html | 2 +- .../boost_asio/reference/write/overload10.html | 2 +- .../boost_asio/reference/write/overload11.html | 2 +- .../boost_asio/reference/write/overload12.html | 2 +- doc/html/boost_asio/reference/write/overload2.html | 2 +- doc/html/boost_asio/reference/write/overload3.html | 2 +- doc/html/boost_asio/reference/write/overload4.html | 2 +- doc/html/boost_asio/reference/write/overload5.html | 4 +- doc/html/boost_asio/reference/write/overload6.html | 4 +- doc/html/boost_asio/reference/write/overload7.html | 4 +- doc/html/boost_asio/reference/write/overload8.html | 4 +- doc/html/boost_asio/reference/write/overload9.html | 2 +- doc/html/boost_asio/reference/write_at.html | 2 +- .../boost_asio/reference/write_at/overload1.html | 2 +- .../boost_asio/reference/write_at/overload2.html | 2 +- .../boost_asio/reference/write_at/overload3.html | 2 +- .../boost_asio/reference/write_at/overload4.html | 2 +- .../boost_asio/reference/write_at/overload5.html | 2 +- .../boost_asio/reference/write_at/overload6.html | 2 +- .../boost_asio/reference/write_at/overload7.html | 2 +- .../boost_asio/reference/write_at/overload8.html | 2 +- doc/html/boost_asio/reference/yield_context.html | 2 +- doc/html/boost_asio/tutorial.html | 2 +- doc/html/boost_asio/tutorial/tutdaytime1.html | 8 +- doc/html/boost_asio/tutorial/tutdaytime1/src.html | 4 +- doc/html/boost_asio/tutorial/tutdaytime2.html | 37 +- doc/html/boost_asio/tutorial/tutdaytime2/src.html | 4 +- doc/html/boost_asio/tutorial/tutdaytime3.html | 10 +- doc/html/boost_asio/tutorial/tutdaytime3/src.html | 4 +- doc/html/boost_asio/tutorial/tutdaytime4.html | 27 +- doc/html/boost_asio/tutorial/tutdaytime4/src.html | 4 +- doc/html/boost_asio/tutorial/tutdaytime5.html | 10 +- doc/html/boost_asio/tutorial/tutdaytime5/src.html | 10 +- doc/html/boost_asio/tutorial/tutdaytime6.html | 21 +- doc/html/boost_asio/tutorial/tutdaytime6/src.html | 6 +- doc/html/boost_asio/tutorial/tutdaytime7.html | 28 +- doc/html/boost_asio/tutorial/tutdaytime7/src.html | 6 +- doc/html/boost_asio/tutorial/tuttimer1.html | 33 +- doc/html/boost_asio/tutorial/tuttimer1/src.html | 7 +- doc/html/boost_asio/tutorial/tuttimer2.html | 25 +- doc/html/boost_asio/tutorial/tuttimer2/src.html | 7 +- doc/html/boost_asio/tutorial/tuttimer3.html | 39 +- doc/html/boost_asio/tutorial/tuttimer3/src.html | 11 +- doc/html/boost_asio/tutorial/tuttimer4.html | 13 +- doc/html/boost_asio/tutorial/tuttimer4/src.html | 11 +- doc/html/boost_asio/tutorial/tuttimer5.html | 58 +- doc/html/boost_asio/tutorial/tuttimer5/src.html | 17 +- doc/html/boost_asio/using.html | 2 +- doc/html/boost_circular_buffer_c___reference.html | 46 +- doc/html/boost_container_header_reference.html | 160 +- doc/html/boost_dll.html | 6 +- doc/html/boost_dll/acknowledgements.html | 4 +- doc/html/boost_dll/dependencies.html | 2 +- doc/html/boost_dll/design_rationale.html | 2 +- doc/html/boost_dll/f_a_q_.html | 2 +- doc/html/boost_dll/getting_started.html | 4 +- doc/html/boost_dll/limitations.html | 6 +- doc/html/boost_dll/mangled_import.html | 2 +- doc/html/boost_dll/missuses.html | 2 +- doc/html/boost_dll/reference.html | 54 +- doc/html/boost_dll/revision_history.html | 2 +- doc/html/boost_dll/tutorial.html | 2 +- doc/html/boost_lexical_cast.html | 2 +- doc/html/boost_process/acknowledgements.html | 6 +- doc/html/boost_process/extend.html | 22 +- doc/html/boost_process/tutorial.html | 48 +- doc/html/boost_random.html | 2 +- doc/html/boost_random/tutorial.html | 1 + doc/html/boost_typeerasure.html | 2 +- doc/html/boost_typeerasure/basic.html | 21 +- doc/html/boost_typeerasure/predef.html | 3 +- doc/html/boost_typeerasure/reference.html | 61 +- doc/html/boost_typeindex.html | 2 +- .../making_a_custom_type_index.html | 4 +- doc/html/boost_typeindex_header_reference.html | 1 - doc/html/boost_units.html | 2 +- doc/html/boost_units/Examples.html | 53 +- doc/html/boost_units/FAQ.html | 4 +- doc/html/boost_units/Quick_Start.html | 1 + doc/html/boost_units/Reference.html | 231 +- doc/html/boost_units/version_id.html | 2 +- doc/html/boostbook/together.html | 2 +- doc/html/chrono.html | 2 +- doc/html/circular_buffer.html | 6 +- doc/html/circular_buffer/example.html | 2 +- doc/html/circular_buffer/examples.html | 6 +- doc/html/circular_buffer/headers.html | 2 +- doc/html/circular_buffer/implementation.html | 8 +- doc/html/circular_buffer/rationale.html | 4 +- doc/html/circular_buffer/s14.html | 178 +- doc/html/circular_buffer/version_id.html | 2 +- doc/html/container.html | 68 +- doc/html/container/Cpp11_conformance.html | 15 +- doc/html/container/acknowledgements_notes.html | 3 +- doc/html/container/configurable_containers.html | 267 ++ doc/html/container/exception_handling.html | 3 +- doc/html/container/extended_allocators.html | 160 + doc/html/container/extended_functionality.html | 526 +-- doc/html/container/history_and_reasons.html | 5 +- doc/html/container/index.html | 191 +- doc/html/container/known_issues.html | 3 +- doc/html/container/main_features.html | 9 +- doc/html/container/non_standard_containers.html | 7 +- .../container/polymorphic_memory_resources.html | 300 ++ doc/html/container/release_notes.html | 56 +- doc/html/conversion.html | 10 +- ...nd__polymorphic_pointer_downcast__synopsis.html | 2 +- .../conversion/_polymorphic_downcast__example.html | 2 +- .../_polymorphic_pointer_downcast__example.html | 2 +- doc/html/conversion/history.html | 4 +- doc/html/conversion/polymorphic_casts.html | 4 +- doc/html/date_time.html | 8 +- doc/html/date_time/date_time_io.html | 131 +- doc/html/date_time/details.html | 66 +- doc/html/date_time/doxy.html | 388 +- doc/html/date_time/examples.html | 2 +- .../date_time/examples/general_usage_examples.html | 4 +- doc/html/date_time/gregorian.html | 80 +- doc/html/date_time/local_time.html | 78 +- doc/html/date_time/posix_time.html | 84 +- doc/html/date_time/serialization.html | 6 +- doc/html/doc_HTML.manifest | 443 +- doc/html/foreach.html | 6 +- doc/html/foreach/extensibility.html | 4 +- doc/html/foreach/history_and_acknowledgements.html | 4 +- doc/html/foreach/pitfalls.html | 2 +- doc/html/foreach/portability.html | 6 +- doc/html/function.html | 24 +- doc/html/function/faq.html | 24 +- doc/html/function/history.html | 10 +- doc/html/function/misc.html | 30 +- doc/html/function/reference.html | 42 +- doc/html/function/testsuite.html | 8 +- doc/html/function/tutorial.html | 26 +- doc/html/hash.html | 14 +- doc/html/hash/acknowledgements.html | 8 +- doc/html/hash/changes.html | 51 +- doc/html/hash/combine.html | 18 +- doc/html/hash/custom.html | 8 +- doc/html/hash/disable.html | 4 +- doc/html/hash/links.html | 8 +- doc/html/hash/portability.html | 4 +- doc/html/hash/rationale.html | 2 +- doc/html/hash/reference.html | 236 +- doc/html/hash/tutorial.html | 10 +- doc/html/heap.html | 8 +- doc/html/heap/acknowledgements.html | 6 +- doc/html/index.html | 12 +- doc/html/interprocess.html | 2 +- doc/html/interprocess/acknowledgements_notes.html | 23 +- doc/html/interprocess/architecture.html | 6 +- doc/html/interprocess/indexes_reference.html | 285 +- doc/html/interprocess/interprocess_smart_ptr.html | 2 +- doc/html/interprocess/managed_memory_segments.html | 16 +- .../interprocess/synchronization_mechanisms.html | 6 +- doc/html/intrusive.html | 4 +- doc/html/intrusive/function_hooks.html | 2 +- doc/html/intrusive/reference.html | 130 +- doc/html/intrusive/release_notes.html | 15 + doc/html/libraries.html | 49 +- doc/html/load_1_3_12_15_5_16_2.html | 54 - doc/html/load_1_3_12_15_5_16_4.html | 54 - doc/html/load_1_3_12_15_5_16_7.html | 54 - doc/html/load_1_3_13_15_5_16_6.html | 54 + doc/html/load_1_3_13_15_5_16_9.html | 54 + doc/html/load_td.html | 54 + doc/html/lockfree.html | 2 +- doc/html/lockfree/reference.html | 2 +- doc/html/metaparse.html | 2 +- doc/html/move.html | 4 +- doc/html/move/reference.html | 2 + doc/html/move/release_notes.html | 12 + doc/html/move/thanks_to.html | 13 + doc/html/mpi.html | 49 +- doc/html/mpi/getting_started.html | 6 +- doc/html/mpi/python.html | 477 -- doc/html/mpi/reference.html | 524 --- doc/html/mpi/tutorial.html | 4804 ++++++++++++-------- doc/html/multi_array.html | 6 +- doc/html/poly_collection.html | 6 +- doc/html/poly_collection/acknowledgments.html | 3 +- .../an_efficient_polymorphic_data_st.html | 3 +- doc/html/poly_collection/future_work.html | 3 +- doc/html/poly_collection/performance.html | 3 +- doc/html/poly_collection/reference.html | 3 +- doc/html/poly_collection/release_notes.html | 12 +- doc/html/poly_collection/tutorial.html | 5 +- doc/html/process.html | 2 +- doc/html/process/reference.html | 1 + doc/html/program_options/howto.html | 2 +- doc/html/property_tree.html | 2 +- doc/html/proto.html | 2 +- doc/html/quickbook/change_log.html | 16 + doc/html/quickbook/syntax/block.html | 4 +- doc/html/ratio.html | 2 +- doc/html/save_1_3_12_15_5_16_3.html | 54 - doc/html/save_1_3_12_15_5_16_6.html | 54 - doc/html/save_1_3_13_15_5_16_5.html | 54 + doc/html/save_1_3_13_15_5_16_8.html | 54 + .../serialization/load_1_3_12_15_4_13_1_12.html | 54 - .../serialization/load_1_3_12_15_4_13_1_27.html | 54 - .../serialization/load_1_3_12_15_4_13_1_3.html | 54 - .../serialization/load_1_3_12_15_4_13_1_30.html | 54 - .../serialization/load_1_3_12_15_4_13_1_33.html | 54 - .../serialization/load_1_3_12_15_4_13_1_36.html | 54 - .../serialization/load_1_3_13_15_4_13_1_12.html | 54 + .../serialization/load_1_3_13_15_4_13_1_27.html | 54 + .../serialization/load_1_3_13_15_4_13_1_3.html | 54 + .../serialization/load_1_3_13_15_4_13_1_30.html | 54 + .../serialization/load_1_3_13_15_4_13_1_33.html | 54 + .../serialization/load_1_3_13_15_4_13_1_36.html | 54 + .../serialization/save_1_3_12_15_4_13_1_11.html | 54 - .../serialization/save_1_3_12_15_4_13_1_2.html | 54 - .../serialization/save_1_3_12_15_4_13_1_26.html | 54 - .../serialization/save_1_3_12_15_4_13_1_29.html | 55 - .../serialization/save_1_3_12_15_4_13_1_32.html | 55 - .../serialization/save_1_3_12_15_4_13_1_35.html | 55 - .../serialization/save_1_3_13_15_4_13_1_11.html | 54 + .../serialization/save_1_3_13_15_4_13_1_2.html | 54 + .../serialization/save_1_3_13_15_4_13_1_26.html | 54 + .../serialization/save_1_3_13_15_4_13_1_29.html | 55 + .../serialization/save_1_3_13_15_4_13_1_32.html | 55 + .../serialization/save_1_3_13_15_4_13_1_35.html | 55 + doc/html/serialization/serialize.html | 8 +- doc/html/stacktrace.html | 2 +- doc/html/stacktrace/getting_started.html | 10 + doc/html/std/insert_iterato_idp58095904.html | 96 + doc/html/std/insert_iterato_idp65191984.html | 95 - doc/html/std/numeric_1_3_44_10_2_31_2_1.html | 82 +- doc/html/thread.html | 2 +- doc/html/thread/build.html | 2 +- doc/html/thread/changes.html | 54 + doc/html/thread/time.html | 2 +- doc/html/tribool/reference.html | 22 +- doc/html/tribool/tests.html | 6 +- doc/html/unordered.html | 2 +- doc/html/unordered/changes.html | 67 + doc/html/unordered/hash_equality.html | 2 +- doc/html/xpressive.html | 2 +- 4349 files changed, 48875 insertions(+), 45531 deletions(-) delete mode 100644 doc/html/BOOST_CB_ASSER_idp14364704.html create mode 100644 doc/html/BOOST_CB_ASSER_idp33239264.html delete mode 100644 doc/html/BOOST_DLL_FORC_idp27662112.html delete mode 100644 doc/html/BOOST_DLL_FORC_idp27664016.html create mode 100644 doc/html/BOOST_DLL_FORC_idp36961376.html create mode 100644 doc/html/BOOST_DLL_FORC_idp36963232.html delete mode 100644 doc/html/BOOST_INTRUSIV_idp55099840.html delete mode 100644 doc/html/BOOST_INTRUSIV_idp55106064.html create mode 100644 doc/html/BOOST_INTRUSIV_idp55880560.html create mode 100644 doc/html/BOOST_INTRUSIV_idp55886784.html delete mode 100644 doc/html/BOOST_MPI_BCA_1_3_26_6_6_7.html delete mode 100644 doc/html/BOOST_MPI_CAL_1_3_26_6_6_6.html delete mode 100644 doc/html/BOOST_MPI_HAS_1_3_26_6_6_4.html delete mode 100644 doc/html/BOOST_MPI_HAS_1_3_26_6_6_5.html create mode 100644 doc/html/BOOST_MPI__1_3_26_5_14_7_4.html create mode 100644 doc/html/BOOST_MPI__1_3_26_5_14_7_5.html create mode 100644 doc/html/BOOST_MPI__1_3_26_5_14_7_6.html create mode 100644 doc/html/BOOST_MPI__1_3_26_5_14_7_7.html delete mode 100644 doc/html/BOOST_SER_1_3_12_15_5_16_1.html create mode 100644 doc/html/BOOST_SER_1_3_13_15_5_16_1.html delete mode 100644 doc/html/boost/circular_buffe_idp24565232.html create mode 100644 doc/html/boost/circular_buffe_idp43443760.html create mode 100644 doc/html/boost/container/constructible__idp60397280.html create mode 100644 doc/html/boost/container/constructible__idp60406672.html delete mode 100644 doc/html/boost/container/constructible__idp67492240.html delete mode 100644 doc/html/boost/container/constructible__idp67501632.html create mode 100644 doc/html/boost/container/growth_factor.html create mode 100644 doc/html/boost/container/growth_factor_100.html create mode 100644 doc/html/boost/container/growth_factor_50.html create mode 100644 doc/html/boost/container/growth_factor_60.html create mode 100644 doc/html/boost/container/new_allocator__idp55809792.html create mode 100644 doc/html/boost/container/new_allocator__idp55809792/rebind.html delete mode 100644 doc/html/boost/container/new_allocator__idp62944752.html delete mode 100644 doc/html/boost/container/new_allocator__idp62944752/rebind.html create mode 100644 doc/html/boost/container/operator___idp59193360.html create mode 100644 doc/html/boost/container/operator___idp59203376.html create mode 100644 doc/html/boost/container/operator___idp59233376.html create mode 100644 doc/html/boost/container/operator___idp59243360.html delete mode 100644 doc/html/boost/container/operator___idp66288880.html delete mode 100644 doc/html/boost/container/operator___idp66298896.html delete mode 100644 doc/html/boost/container/operator___idp66328896.html delete mode 100644 doc/html/boost/container/operator___idp66338880.html create mode 100644 doc/html/boost/container/operator_idp59213408.html create mode 100644 doc/html/boost/container/operator_idp59223392.html delete mode 100644 doc/html/boost/container/operator_idp66308928.html delete mode 100644 doc/html/boost/container/operator_idp66318912.html create mode 100644 doc/html/boost/container/pmr/unsynchronized_idp56479344.html delete mode 100644 doc/html/boost/container/pmr/unsynchronized_idp63576512.html create mode 100644 doc/html/boost/container/stored_size.html create mode 100644 doc/html/boost/container/swap_idp59253344.html delete mode 100644 doc/html/boost/container/swap_idp66348864.html delete mode 100644 doc/html/boost/container/tree_assoc_defaults.html create mode 100644 doc/html/boost/container/tree_assoc_options_t.html create mode 100644 doc/html/boost/container/vector_options.html create mode 100644 doc/html/boost/container/vector_options_t.html delete mode 100644 doc/html/boost/date_time/dynam_1_3_12_15_3_30_2_1_2.html create mode 100644 doc/html/boost/date_time/dynam_1_3_13_15_3_30_2_1_2.html delete mode 100644 doc/html/boost/date_time/fixed_1_3_12_15_3_26_2_1_2.html delete mode 100644 doc/html/boost/date_time/fixed_1_3_12_15_3_26_2_1_3.html create mode 100644 doc/html/boost/date_time/fixed_1_3_13_15_3_26_2_1_2.html create mode 100644 doc/html/boost/date_time/fixed_1_3_13_15_3_26_2_1_3.html delete mode 100644 doc/html/boost/date_time/from__1_3_12_15_3_22_1_1_6.html delete mode 100644 doc/html/boost/date_time/from__1_3_12_15_3_22_1_1_7.html delete mode 100644 doc/html/boost/date_time/from__1_3_12_15_3_22_1_1_8.html delete mode 100644 doc/html/boost/date_time/from__1_3_12_15_3_22_1_1_9.html create mode 100644 doc/html/boost/date_time/from__1_3_13_15_3_22_1_1_6.html create mode 100644 doc/html/boost/date_time/from__1_3_13_15_3_22_1_1_7.html create mode 100644 doc/html/boost/date_time/from__1_3_13_15_3_22_1_1_8.html create mode 100644 doc/html/boost/date_time/from__1_3_13_15_3_22_1_1_9.html delete mode 100644 doc/html/boost/date_time/iso_f_1_3_12_15_3_29_1_1_2.html create mode 100644 doc/html/boost/date_time/iso_f_1_3_13_15_3_29_1_1_2.html delete mode 100644 doc/html/boost/date_time/opera_1_3_12_15_3_28_1_1_2.html create mode 100644 doc/html/boost/date_time/opera_1_3_13_15_3_28_1_1_2.html delete mode 100644 doc/html/boost/date_time/ostre_1_3_12_15_3_49_1_1_1.html delete mode 100644 doc/html/boost/date_time/ostre_1_3_12_15_3_49_1_1_3.html create mode 100644 doc/html/boost/date_time/ostre_1_3_13_15_3_49_1_1_1.html create mode 100644 doc/html/boost/date_time/ostre_1_3_13_15_3_49_1_1_3.html delete mode 100644 doc/html/boost/date_time/parse_1_3_12_15_3_51_1_1_3.html create mode 100644 doc/html/boost/date_time/parse_1_3_13_15_3_51_1_1_3.html delete mode 100644 doc/html/boost/date_time/simpl_1_3_12_15_3_13_1_1_2.html create mode 100644 doc/html/boost/date_time/simpl_1_3_13_15_3_13_1_1_2.html delete mode 100644 doc/html/boost/date_time/str_f_1_3_12_15_3_51_1_1_2.html create mode 100644 doc/html/boost/date_time/str_f_1_3_13_15_3_51_1_1_2.html delete mode 100644 doc/html/boost/date_time/time__1_3_12_15_3_52_1_1_1.html delete mode 100644 doc/html/boost/date_time/time__1_3_12_15_3_52_1_1_2.html delete mode 100644 doc/html/boost/date_time/time__1_3_12_15_3_52_1_1_3.html delete mode 100644 doc/html/boost/date_time/time__1_3_12_15_3_52_1_1_4.html create mode 100644 doc/html/boost/date_time/time__1_3_13_15_3_52_1_1_1.html create mode 100644 doc/html/boost/date_time/time__1_3_13_15_3_52_1_1_2.html create mode 100644 doc/html/boost/date_time/time__1_3_13_15_3_52_1_1_3.html create mode 100644 doc/html/boost/date_time/time__1_3_13_15_3_52_1_1_4.html delete mode 100644 doc/html/boost/dll/experimental/get_idp28753888.html delete mode 100644 doc/html/boost/dll/experimental/get_idp28770608.html create mode 100644 doc/html/boost/dll/experimental/get_idp38057568.html create mode 100644 doc/html/boost/dll/experimental/get_idp38074288.html delete mode 100644 doc/html/boost/dll/experimental/import_class_idp28282208.html create mode 100644 doc/html/boost/dll/experimental/import_class_idp37573920.html create mode 100644 doc/html/boost/graph_t_1_3_26_5_14_12_2_1.html delete mode 100644 doc/html/boost/graph_trai_1_3_26_6_11_2_1.html delete mode 100644 doc/html/boost/gregorian/opera_1_3_12_15_4_11_1_1_3.html delete mode 100644 doc/html/boost/gregorian/opera_1_3_12_15_4_11_1_1_4.html delete mode 100644 doc/html/boost/gregorian/opera_1_3_12_15_4_11_1_1_5.html delete mode 100644 doc/html/boost/gregorian/opera_1_3_12_15_4_11_1_1_6.html create mode 100644 doc/html/boost/gregorian/opera_1_3_13_15_4_11_1_1_3.html create mode 100644 doc/html/boost/gregorian/opera_1_3_13_15_4_11_1_1_4.html create mode 100644 doc/html/boost/gregorian/opera_1_3_13_15_4_11_1_1_5.html create mode 100644 doc/html/boost/gregorian/opera_1_3_13_15_4_11_1_1_6.html create mode 100644 doc/html/boost/hash_T_1_3_11_11_2_2_24.html delete mode 100644 doc/html/boost/hash_T_1_3_16_11_2_2_24.html create mode 100644 doc/html/boost/hash_bool_1_3_11_11_2_2_2.html delete mode 100644 doc/html/boost/hash_bool_1_3_16_11_2_2_2.html create mode 100644 doc/html/boost/hash_char1_1_3_11_11_2_2_7.html delete mode 100644 doc/html/boost/hash_char1_1_3_16_11_2_2_7.html create mode 100644 doc/html/boost/hash_char3_1_3_11_11_2_2_8.html delete mode 100644 doc/html/boost/hash_char3_1_3_16_11_2_2_8.html create mode 100644 doc/html/boost/hash_char_1_3_11_11_2_2_3.html delete mode 100644 doc/html/boost/hash_char_1_3_16_11_2_2_3.html create mode 100644 doc/html/boost/hash_doub_1_3_11_11_2_2_18.html delete mode 100644 doc/html/boost/hash_doub_1_3_16_11_2_2_18.html create mode 100644 doc/html/boost/hash_floa_1_3_11_11_2_2_17.html delete mode 100644 doc/html/boost/hash_floa_1_3_16_11_2_2_17.html create mode 100644 doc/html/boost/hash_int_1_3_11_11_2_2_11.html delete mode 100644 doc/html/boost/hash_int_1_3_16_11_2_2_11.html create mode 100644 doc/html/boost/hash_long_1_3_11_11_2_2_13.html create mode 100644 doc/html/boost/hash_long_1_3_11_11_2_2_15.html create mode 100644 doc/html/boost/hash_long_1_3_11_11_2_2_19.html delete mode 100644 doc/html/boost/hash_long_1_3_16_11_2_2_13.html delete mode 100644 doc/html/boost/hash_long_1_3_16_11_2_2_15.html delete mode 100644 doc/html/boost/hash_long_1_3_16_11_2_2_19.html create mode 100644 doc/html/boost/hash_short_1_3_11_11_2_2_9.html delete mode 100644 doc/html/boost/hash_short_1_3_16_11_2_2_9.html create mode 100644 doc/html/boost/hash_signe_1_3_11_11_2_2_4.html delete mode 100644 doc/html/boost/hash_signe_1_3_16_11_2_2_4.html create mode 100644 doc/html/boost/hash_std__1_3_11_11_2_2_20.html create mode 100644 doc/html/boost/hash_std__1_3_11_11_2_2_21.html create mode 100644 doc/html/boost/hash_std__1_3_11_11_2_2_22.html create mode 100644 doc/html/boost/hash_std__1_3_11_11_2_2_23.html create mode 100644 doc/html/boost/hash_std__1_3_11_11_2_2_25.html delete mode 100644 doc/html/boost/hash_std__1_3_16_11_2_2_20.html delete mode 100644 doc/html/boost/hash_std__1_3_16_11_2_2_21.html delete mode 100644 doc/html/boost/hash_std__1_3_16_11_2_2_22.html delete mode 100644 doc/html/boost/hash_std__1_3_16_11_2_2_23.html delete mode 100644 doc/html/boost/hash_std__1_3_16_11_2_2_25.html create mode 100644 doc/html/boost/hash_unsi_1_3_11_11_2_2_10.html create mode 100644 doc/html/boost/hash_unsi_1_3_11_11_2_2_12.html create mode 100644 doc/html/boost/hash_unsi_1_3_11_11_2_2_14.html create mode 100644 doc/html/boost/hash_unsi_1_3_11_11_2_2_16.html delete mode 100644 doc/html/boost/hash_unsi_1_3_16_11_2_2_10.html delete mode 100644 doc/html/boost/hash_unsi_1_3_16_11_2_2_12.html delete mode 100644 doc/html/boost/hash_unsi_1_3_16_11_2_2_14.html delete mode 100644 doc/html/boost/hash_unsi_1_3_16_11_2_2_16.html create mode 100644 doc/html/boost/hash_unsig_1_3_11_11_2_2_5.html delete mode 100644 doc/html/boost/hash_unsig_1_3_16_11_2_2_5.html create mode 100644 doc/html/boost/hash_wchar_1_3_11_11_2_2_6.html delete mode 100644 doc/html/boost/hash_wchar_1_3_16_11_2_2_6.html create mode 100644 doc/html/boost/heap/skew_heap/push_handle.html create mode 100644 doc/html/boost/heap/skew_heap/push_void.html create mode 100644 doc/html/boost/interprocess/basic_managed__idp39474400.html create mode 100644 doc/html/boost/interprocess/basic_managed__idp39582912.html create mode 100644 doc/html/boost/interprocess/basic_managed__idp39640656.html create mode 100644 doc/html/boost/interprocess/basic_managed__idp39689376.html delete mode 100644 doc/html/boost/interprocess/basic_managed__idp55379840.html delete mode 100644 doc/html/boost/interprocess/basic_managed__idp55488352.html delete mode 100644 doc/html/boost/interprocess/basic_managed__idp55546096.html delete mode 100644 doc/html/boost/interprocess/basic_managed__idp55594816.html create mode 100644 doc/html/boost/interprocess/fixed_managed__idp39630976.html delete mode 100644 doc/html/boost/interprocess/fixed_managed__idp55536416.html create mode 100644 doc/html/boost/interprocess/interprocess_r_idp40896864.html delete mode 100644 doc/html/boost/interprocess/interprocess_r_idp56793568.html create mode 100644 doc/html/boost/interprocess/interprocess_s_idp40942256.html delete mode 100644 doc/html/boost/interprocess/interprocess_s_idp56838960.html create mode 100644 doc/html/boost/interprocess/interprocess_u_idp40973072.html delete mode 100644 doc/html/boost/interprocess/interprocess_u_idp56869776.html create mode 100644 doc/html/boost/interprocess/make_managed_s_idp40508976.html create mode 100644 doc/html/boost/interprocess/make_managed_s_idp40513488.html delete mode 100644 doc/html/boost/interprocess/make_managed_s_idp56405680.html delete mode 100644 doc/html/boost/interprocess/make_managed_s_idp56410192.html create mode 100644 doc/html/boost/interprocess/managed_window_idp39679728.html delete mode 100644 doc/html/boost/interprocess/managed_window_idp55585168.html create mode 100644 doc/html/boost/interprocess/operator___idp38496176.html create mode 100644 doc/html/boost/interprocess/operator___idp38504448.html create mode 100644 doc/html/boost/interprocess/operator___idp38584608.html create mode 100644 doc/html/boost/interprocess/operator___idp38589584.html create mode 100644 doc/html/boost/interprocess/operator___idp38691552.html create mode 100644 doc/html/boost/interprocess/operator___idp38699840.html create mode 100644 doc/html/boost/interprocess/operator___idp38798784.html create mode 100644 doc/html/boost/interprocess/operator___idp38805344.html create mode 100644 doc/html/boost/interprocess/operator___idp38898704.html create mode 100644 doc/html/boost/interprocess/operator___idp38905248.html create mode 100644 doc/html/boost/interprocess/operator___idp39004656.html create mode 100644 doc/html/boost/interprocess/operator___idp39012944.html create mode 100644 doc/html/boost/interprocess/operator___idp39109776.html create mode 100644 doc/html/boost/interprocess/operator___idp39118064.html create mode 100644 doc/html/boost/interprocess/operator___idp40278064.html create mode 100644 doc/html/boost/interprocess/operator___idp40283280.html create mode 100644 doc/html/boost/interprocess/operator___idp40288496.html create mode 100644 doc/html/boost/interprocess/operator___idp40293296.html create mode 100644 doc/html/boost/interprocess/operator___idp40298096.html create mode 100644 doc/html/boost/interprocess/operator___idp40302896.html delete mode 100644 doc/html/boost/interprocess/operator___idp54401248.html delete mode 100644 doc/html/boost/interprocess/operator___idp54409520.html delete mode 100644 doc/html/boost/interprocess/operator___idp54489968.html delete mode 100644 doc/html/boost/interprocess/operator___idp54494944.html delete mode 100644 doc/html/boost/interprocess/operator___idp54596912.html delete mode 100644 doc/html/boost/interprocess/operator___idp54605200.html delete mode 100644 doc/html/boost/interprocess/operator___idp54704144.html delete mode 100644 doc/html/boost/interprocess/operator___idp54710704.html delete mode 100644 doc/html/boost/interprocess/operator___idp54804064.html delete mode 100644 doc/html/boost/interprocess/operator___idp54810608.html delete mode 100644 doc/html/boost/interprocess/operator___idp54910016.html delete mode 100644 doc/html/boost/interprocess/operator___idp54918304.html delete mode 100644 doc/html/boost/interprocess/operator___idp55015136.html delete mode 100644 doc/html/boost/interprocess/operator___idp55023424.html delete mode 100644 doc/html/boost/interprocess/operator___idp56174768.html delete mode 100644 doc/html/boost/interprocess/operator___idp56179984.html delete mode 100644 doc/html/boost/interprocess/operator___idp56185200.html delete mode 100644 doc/html/boost/interprocess/operator___idp56190000.html delete mode 100644 doc/html/boost/interprocess/operator___idp56194800.html delete mode 100644 doc/html/boost/interprocess/operator___idp56199600.html create mode 100644 doc/html/boost/interprocess/operator_idp39971568.html create mode 100644 doc/html/boost/interprocess/operator_idp39978480.html create mode 100644 doc/html/boost/interprocess/operator_idp40307696.html delete mode 100644 doc/html/boost/interprocess/operator_idp55877088.html delete mode 100644 doc/html/boost/interprocess/operator_idp55884000.html delete mode 100644 doc/html/boost/interprocess/operator_idp56204400.html create mode 100644 doc/html/boost/interprocess/swap_idp40312352.html create mode 100644 doc/html/boost/interprocess/swap_idp40362672.html delete mode 100644 doc/html/boost/interprocess/swap_idp56209056.html delete mode 100644 doc/html/boost/interprocess/swap_idp56259376.html create mode 100644 doc/html/boost/interprocess/to_raw_pointer_idp40322096.html create mode 100644 doc/html/boost/interprocess/to_raw_pointer_idp40368064.html delete mode 100644 doc/html/boost/interprocess/to_raw_pointer_idp56218800.html delete mode 100644 doc/html/boost/interprocess/to_raw_pointer_idp56264768.html create mode 100644 doc/html/boost/interprocess/wfixed_managed_idp39634704.html delete mode 100644 doc/html/boost/interprocess/wfixed_managed_idp55540144.html create mode 100644 doc/html/boost/interprocess/wmanaged_windo_idp39683440.html delete mode 100644 doc/html/boost/interprocess/wmanaged_windo_idp55588880.html delete mode 100644 doc/html/boost/intrusive/get_parent_fro_idp55114128.html delete mode 100644 doc/html/boost/intrusive/get_parent_fro_idp55118400.html create mode 100644 doc/html/boost/intrusive/get_parent_fro_idp55894848.html create mode 100644 doc/html/boost/intrusive/get_parent_fro_idp55899120.html delete mode 100644 doc/html/boost/intrusive/make_unordered_idp65807072.html delete mode 100644 doc/html/boost/intrusive/make_unordered_idp65862816.html create mode 100644 doc/html/boost/intrusive/make_unordered_idp66587792.html create mode 100644 doc/html/boost/intrusive/make_unordered_idp66643536.html delete mode 100644 doc/html/boost/intrusive/max_pointer_pl_idp55128640.html create mode 100644 doc/html/boost/intrusive/max_pointer_pl_idp55909360.html delete mode 100644 doc/html/boost/intrusive/pointer_plus_b_idp55135712.html create mode 100644 doc/html/boost/intrusive/pointer_plus_b_idp55916432.html delete mode 100644 doc/html/boost/intrusive/pointer_rebind_idp55187168.html delete mode 100644 doc/html/boost/intrusive/pointer_rebind_idp55190832.html delete mode 100644 doc/html/boost/intrusive/pointer_rebind_idp55194496.html delete mode 100644 doc/html/boost/intrusive/pointer_rebind_idp55200144.html delete mode 100644 doc/html/boost/intrusive/pointer_rebind_idp55207392.html create mode 100644 doc/html/boost/intrusive/pointer_rebind_idp55967888.html create mode 100644 doc/html/boost/intrusive/pointer_rebind_idp55971552.html create mode 100644 doc/html/boost/intrusive/pointer_rebind_idp55975216.html create mode 100644 doc/html/boost/intrusive/pointer_rebind_idp55980864.html create mode 100644 doc/html/boost/intrusive/pointer_rebind_idp55988112.html delete mode 100644 doc/html/boost/intrusive/pointer_traits_idp55252544.html delete mode 100644 doc/html/boost/intrusive/pointer_traits_idp55252544/rebind_pointer.html create mode 100644 doc/html/boost/intrusive/pointer_traits_idp56033264.html create mode 100644 doc/html/boost/intrusive/pointer_traits_idp56033264/rebind_pointer.html delete mode 100644 doc/html/boost/intrusive/priority_compa_idp55286240.html create mode 100644 doc/html/boost/intrusive/priority_compa_idp56066960.html delete mode 100644 doc/html/boost/local_time/operat_1_3_12_15_6_4_2_1_1.html delete mode 100644 doc/html/boost/local_time/operat_1_3_12_15_6_4_2_1_2.html delete mode 100644 doc/html/boost/local_time/operat_1_3_12_15_6_4_2_1_3.html delete mode 100644 doc/html/boost/local_time/operat_1_3_12_15_6_4_2_1_4.html delete mode 100644 doc/html/boost/local_time/operat_1_3_12_15_6_4_2_1_5.html delete mode 100644 doc/html/boost/local_time/operat_1_3_12_15_6_4_2_1_6.html delete mode 100644 doc/html/boost/local_time/operat_1_3_12_15_6_4_2_1_7.html delete mode 100644 doc/html/boost/local_time/operat_1_3_12_15_6_4_2_1_8.html create mode 100644 doc/html/boost/local_time/operat_1_3_13_15_6_4_2_1_1.html create mode 100644 doc/html/boost/local_time/operat_1_3_13_15_6_4_2_1_2.html create mode 100644 doc/html/boost/local_time/operat_1_3_13_15_6_4_2_1_3.html create mode 100644 doc/html/boost/local_time/operat_1_3_13_15_6_4_2_1_4.html create mode 100644 doc/html/boost/local_time/operat_1_3_13_15_6_4_2_1_5.html create mode 100644 doc/html/boost/local_time/operat_1_3_13_15_6_4_2_1_6.html create mode 100644 doc/html/boost/local_time/operat_1_3_13_15_6_4_2_1_7.html create mode 100644 doc/html/boost/local_time/operat_1_3_13_15_6_4_2_1_8.html create mode 100644 doc/html/boost/lockfree/spsc_queue/implementation_defined.html create mode 100644 doc/html/boost/logic/get_default_in_idp31765120.html delete mode 100644 doc/html/boost/logic/get_default_in_idp39719728.html create mode 100644 doc/html/boost/logic/operator_idp31661568.html create mode 100644 doc/html/boost/logic/operator_idp31770720.html create mode 100644 doc/html/boost/logic/operator_idp31779280.html create mode 100644 doc/html/boost/logic/operator_idp31785552.html delete mode 100644 doc/html/boost/logic/operator_idp39616176.html delete mode 100644 doc/html/boost/logic/operator_idp39725328.html delete mode 100644 doc/html/boost/logic/operator_idp39733888.html delete mode 100644 doc/html/boost/logic/operator_idp39740160.html create mode 100644 doc/html/boost/mpi/alloca_1_3_26_5_14_2_2_1_2.html create mode 100644 doc/html/boost/mpi/alloca_1_3_26_5_14_2_2_1_2/rebind.html delete mode 100644 doc/html/boost/mpi/allocator_1_3_26_6_2_2_1_2.html delete mode 100644 doc/html/boost/mpi/allocator_1_3_26_6_2_2_1_2/rebind.html create mode 100644 doc/html/boost/mpi/cartesian_communicator.html create mode 100644 doc/html/boost/mpi/cartesian_dimension.html create mode 100644 doc/html/boost/mpi/cartesian_dimensions.html create mode 100644 doc/html/boost/mpi/cartesian_topology.html create mode 100644 doc/html/boost/mpi/get_1_3_26_5_14_12_2_2_11.html create mode 100644 doc/html/boost/mpi/get_1_3_26_5_14_12_2_2_12.html delete mode 100644 doc/html/boost/mpi/get_1_3_26_6_11_2_2_11.html delete mode 100644 doc/html/boost/mpi/get_1_3_26_6_11_2_2_12.html create mode 100644 doc/html/boost/mpi/get_mp_1_3_26_5_14_8_2_1_8.html delete mode 100644 doc/html/boost/mpi/get_mpi_d_1_3_26_6_7_2_1_8.html create mode 100644 doc/html/boost/mpi/inpla_1_3_26_5_14_14_2_1_2.html delete mode 100644 doc/html/boost/mpi/inplace__1_3_26_6_13_2_1_2.html create mode 100644 doc/html/boost/mpi/is_mpi_1_3_26_5_14_3_2_1_2.html create mode 100644 doc/html/boost/mpi/is_mpi_1_3_26_5_14_8_2_1_2.html delete mode 100644 doc/html/boost/mpi/is_mpi_fl_1_3_26_6_7_2_1_2.html create mode 100644 doc/html/boost/mpi/opera_1_3_26_5_14_13_2_1_2.html create mode 100644 doc/html/boost/mpi/opera_1_3_26_5_14_13_2_1_3.html create mode 100644 doc/html/boost/mpi/opera_1_3_26_5_14_13_2_1_4.html create mode 100644 doc/html/boost/mpi/operat_1_3_26_5_14_2_2_1_3.html create mode 100644 doc/html/boost/mpi/operat_1_3_26_5_14_2_2_1_4.html create mode 100644 doc/html/boost/mpi/operat_1_3_26_5_14_6_2_1_5.html create mode 100644 doc/html/boost/mpi/operat_1_3_26_5_14_6_2_1_6.html delete mode 100644 doc/html/boost/mpi/operator_1_3_26_6_12_2_1_2.html delete mode 100644 doc/html/boost/mpi/operator_1_3_26_6_12_2_1_3.html delete mode 100644 doc/html/boost/mpi/operator_1_3_26_6_12_2_1_4.html delete mode 100644 doc/html/boost/mpi/operator__1_3_26_6_2_2_1_3.html delete mode 100644 doc/html/boost/mpi/operator__1_3_26_6_2_2_1_4.html delete mode 100644 doc/html/boost/mpi/operator__1_3_26_6_5_2_1_5.html delete mode 100644 doc/html/boost/mpi/operator__1_3_26_6_5_2_1_6.html create mode 100644 doc/html/boost/mpi/python/reg_1_3_26_5_14_20_2_1_1_2.html delete mode 100644 doc/html/boost/mpi/python/regist_1_3_26_6_19_2_1_1_2.html create mode 100644 doc/html/boost/mpi/threading/ope_1_3_26_5_14_10_2_1_2_2.html create mode 100644 doc/html/boost/mpi/threading/ope_1_3_26_5_14_10_2_1_2_3.html delete mode 100644 doc/html/boost/mpi/threading/operato_1_3_26_6_9_2_1_2_2.html delete mode 100644 doc/html/boost/mpi/threading/operato_1_3_26_6_9_2_1_2_3.html delete mode 100644 doc/html/boost/operator___idp24460448.html delete mode 100644 doc/html/boost/operator___idp24487216.html delete mode 100644 doc/html/boost/operator___idp24515552.html delete mode 100644 doc/html/boost/operator___idp24529728.html create mode 100644 doc/html/boost/operator___idp43338976.html create mode 100644 doc/html/boost/operator___idp43365744.html create mode 100644 doc/html/boost/operator___idp43394080.html create mode 100644 doc/html/boost/operator___idp43408256.html delete mode 100644 doc/html/boost/operator_idp24473872.html delete mode 100644 doc/html/boost/operator_idp24501376.html create mode 100644 doc/html/boost/operator_idp43352400.html create mode 100644 doc/html/boost/operator_idp43379904.html delete mode 100644 doc/html/boost/posix_time/millis_1_3_12_15_5_5_1_1_4.html create mode 100644 doc/html/boost/posix_time/millis_1_3_13_15_5_5_1_1_4.html delete mode 100644 doc/html/boost/posix_time/operat_1_3_12_15_5_3_2_1_1.html delete mode 100644 doc/html/boost/posix_time/operat_1_3_12_15_5_3_2_1_2.html delete mode 100644 doc/html/boost/posix_time/operat_1_3_12_15_5_3_2_1_3.html delete mode 100644 doc/html/boost/posix_time/operat_1_3_12_15_5_3_2_1_4.html delete mode 100644 doc/html/boost/posix_time/operat_1_3_12_15_5_3_2_1_5.html delete mode 100644 doc/html/boost/posix_time/operat_1_3_12_15_5_3_2_1_6.html delete mode 100644 doc/html/boost/posix_time/operat_1_3_12_15_5_3_2_1_7.html delete mode 100644 doc/html/boost/posix_time/operat_1_3_12_15_5_3_2_1_8.html delete mode 100644 doc/html/boost/posix_time/operat_1_3_12_15_5_8_1_1_6.html create mode 100644 doc/html/boost/posix_time/operat_1_3_13_15_5_3_2_1_1.html create mode 100644 doc/html/boost/posix_time/operat_1_3_13_15_5_3_2_1_2.html create mode 100644 doc/html/boost/posix_time/operat_1_3_13_15_5_3_2_1_3.html create mode 100644 doc/html/boost/posix_time/operat_1_3_13_15_5_3_2_1_4.html create mode 100644 doc/html/boost/posix_time/operat_1_3_13_15_5_3_2_1_5.html create mode 100644 doc/html/boost/posix_time/operat_1_3_13_15_5_3_2_1_6.html create mode 100644 doc/html/boost/posix_time/operat_1_3_13_15_5_3_2_1_7.html create mode 100644 doc/html/boost/posix_time/operat_1_3_13_15_5_3_2_1_8.html create mode 100644 doc/html/boost/posix_time/operat_1_3_13_15_5_8_1_1_6.html create mode 100644 doc/html/boost/process/windows/create_no_window.html delete mode 100644 doc/html/boost/swap_idp24543920.html create mode 100644 doc/html/boost/swap_idp43422448.html delete mode 100644 doc/html/boost/type_erasure/any_Conc_1_3_41_13_1_1_1_1.html create mode 100644 doc/html/boost/type_erasure/any_Conc_1_3_41_13_1_1_1_4.html create mode 100644 doc/html/boost_asio/example/cpp03/timeouts/blocking_token_tcp_client.cpp delete mode 100644 doc/html/boost_asio/example/cpp03/timers/tick_count_timer.cpp create mode 100644 doc/html/boost_asio/example/cpp17/coroutines_ts/chat_server.cpp create mode 100644 doc/html/boost_asio/example/cpp17/coroutines_ts/double_buffered_echo_server.cpp create mode 100644 doc/html/boost_asio/example/cpp17/coroutines_ts/echo_server.cpp create mode 100644 doc/html/boost_asio/example/cpp17/coroutines_ts/range_based_for.cpp create mode 100644 doc/html/boost_asio/example/cpp17/coroutines_ts/refactored_echo_server.cpp create mode 100644 doc/html/boost_asio/examples/cpp17_examples.html create mode 100644 doc/html/boost_asio/overview/core/coroutines_ts.html create mode 100644 doc/html/boost_asio/reference/LegacyCompletionHandler.html create mode 100644 doc/html/boost_asio/reference/experimental__await_token.html create mode 100644 doc/html/boost_asio/reference/experimental__await_token/await_token.html create mode 100644 doc/html/boost_asio/reference/experimental__await_token/await_token/overload1.html create mode 100644 doc/html/boost_asio/reference/experimental__await_token/await_token/overload2.html create mode 100644 doc/html/boost_asio/reference/experimental__await_token/executor_type.html create mode 100644 doc/html/boost_asio/reference/experimental__await_token/get_executor.html create mode 100644 doc/html/boost_asio/reference/experimental__awaitable.html create mode 100644 doc/html/boost_asio/reference/experimental__awaitable/_awaitable.html create mode 100644 doc/html/boost_asio/reference/experimental__awaitable/awaitable.html create mode 100644 doc/html/boost_asio/reference/experimental__awaitable/executor_type.html create mode 100644 doc/html/boost_asio/reference/experimental__awaitable/value_type.html create mode 100644 doc/html/boost_asio/reference/experimental__co_spawn.html create mode 100644 doc/html/boost_asio/reference/experimental__co_spawn/overload1.html create mode 100644 doc/html/boost_asio/reference/experimental__co_spawn/overload2.html create mode 100644 doc/html/boost_asio/reference/experimental__co_spawn/overload3.html create mode 100644 doc/html/boost_asio/reference/experimental__detached.html create mode 100644 doc/html/boost_asio/reference/experimental__detached_t.html create mode 100644 doc/html/boost_asio/reference/experimental__detached_t/detached_t.html create mode 100644 doc/html/boost_asio/reference/experimental__redirect_error.html create mode 100644 doc/html/boost_asio/reference/experimental__redirect_error_t.html create mode 100644 doc/html/boost_asio/reference/experimental__redirect_error_t/ec_.html create mode 100644 doc/html/boost_asio/reference/experimental__redirect_error_t/redirect_error_t.html create mode 100644 doc/html/boost_asio/reference/experimental__redirect_error_t/token_.html create mode 100644 doc/html/boost_asio/reference/experimental__this_coro__executor.html create mode 100644 doc/html/boost_asio/reference/experimental__this_coro__executor_t.html create mode 100644 doc/html/boost_asio/reference/experimental__this_coro__token.html create mode 100644 doc/html/boost_asio/reference/experimental__this_coro__token_t.html create mode 100644 doc/html/container/configurable_containers.html create mode 100644 doc/html/container/extended_allocators.html create mode 100644 doc/html/container/polymorphic_memory_resources.html delete mode 100644 doc/html/load_1_3_12_15_5_16_2.html delete mode 100644 doc/html/load_1_3_12_15_5_16_4.html delete mode 100644 doc/html/load_1_3_12_15_5_16_7.html create mode 100644 doc/html/load_1_3_13_15_5_16_6.html create mode 100644 doc/html/load_1_3_13_15_5_16_9.html create mode 100644 doc/html/load_td.html delete mode 100644 doc/html/mpi/python.html delete mode 100644 doc/html/mpi/reference.html delete mode 100644 doc/html/save_1_3_12_15_5_16_3.html delete mode 100644 doc/html/save_1_3_12_15_5_16_6.html create mode 100644 doc/html/save_1_3_13_15_5_16_5.html create mode 100644 doc/html/save_1_3_13_15_5_16_8.html delete mode 100644 doc/html/serialization/load_1_3_12_15_4_13_1_12.html delete mode 100644 doc/html/serialization/load_1_3_12_15_4_13_1_27.html delete mode 100644 doc/html/serialization/load_1_3_12_15_4_13_1_3.html delete mode 100644 doc/html/serialization/load_1_3_12_15_4_13_1_30.html delete mode 100644 doc/html/serialization/load_1_3_12_15_4_13_1_33.html delete mode 100644 doc/html/serialization/load_1_3_12_15_4_13_1_36.html create mode 100644 doc/html/serialization/load_1_3_13_15_4_13_1_12.html create mode 100644 doc/html/serialization/load_1_3_13_15_4_13_1_27.html create mode 100644 doc/html/serialization/load_1_3_13_15_4_13_1_3.html create mode 100644 doc/html/serialization/load_1_3_13_15_4_13_1_30.html create mode 100644 doc/html/serialization/load_1_3_13_15_4_13_1_33.html create mode 100644 doc/html/serialization/load_1_3_13_15_4_13_1_36.html delete mode 100644 doc/html/serialization/save_1_3_12_15_4_13_1_11.html delete mode 100644 doc/html/serialization/save_1_3_12_15_4_13_1_2.html delete mode 100644 doc/html/serialization/save_1_3_12_15_4_13_1_26.html delete mode 100644 doc/html/serialization/save_1_3_12_15_4_13_1_29.html delete mode 100644 doc/html/serialization/save_1_3_12_15_4_13_1_32.html delete mode 100644 doc/html/serialization/save_1_3_12_15_4_13_1_35.html create mode 100644 doc/html/serialization/save_1_3_13_15_4_13_1_11.html create mode 100644 doc/html/serialization/save_1_3_13_15_4_13_1_2.html create mode 100644 doc/html/serialization/save_1_3_13_15_4_13_1_26.html create mode 100644 doc/html/serialization/save_1_3_13_15_4_13_1_29.html create mode 100644 doc/html/serialization/save_1_3_13_15_4_13_1_32.html create mode 100644 doc/html/serialization/save_1_3_13_15_4_13_1_35.html create mode 100644 doc/html/std/insert_iterato_idp58095904.html delete mode 100644 doc/html/std/insert_iterato_idp65191984.html (limited to 'doc/html') diff --git a/doc/html/BOOST_CB_ASSER_idp14364704.html b/doc/html/BOOST_CB_ASSER_idp14364704.html deleted file mode 100644 index a4053b877e..0000000000 --- a/doc/html/BOOST_CB_ASSER_idp14364704.html +++ /dev/null @@ -1,50 +0,0 @@ - - - - -Macro BOOST_CB_ASSERT_TEMPLATED_ITERATOR_CONSTRUCTORS - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Macro BOOST_CB_ASSERT_TEMPLATED_ITERATOR_CONSTRUCTORS

-

BOOST_CB_ASSERT_TEMPLATED_ITERATOR_CONSTRUCTORS

-
-

Synopsis

-
// In header: <boost/circular_buffer.hpp>
-
-BOOST_CB_ASSERT_TEMPLATED_ITERATOR_CONSTRUCTORS
-
- - - -
Copyright © 2003-2013 Jan Gaspar

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/BOOST_CB_ASSER_idp33239264.html b/doc/html/BOOST_CB_ASSER_idp33239264.html new file mode 100644 index 0000000000..4a7b10f926 --- /dev/null +++ b/doc/html/BOOST_CB_ASSER_idp33239264.html @@ -0,0 +1,50 @@ + + + + +Macro BOOST_CB_ASSERT_TEMPLATED_ITERATOR_CONSTRUCTORS + + + + + + + + + + + + + + + +
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
+
+
+PrevUpHomeNext +
+
+
+
+

Macro BOOST_CB_ASSERT_TEMPLATED_ITERATOR_CONSTRUCTORS

+

BOOST_CB_ASSERT_TEMPLATED_ITERATOR_CONSTRUCTORS

+
+

Synopsis

+
// In header: <boost/circular_buffer.hpp>
+
+BOOST_CB_ASSERT_TEMPLATED_ITERATOR_CONSTRUCTORS
+
+ + + +
Copyright © 2003-2013 Jan Gaspar

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/doc/html/BOOST_CB_IS_CONVERTIBLE.html b/doc/html/BOOST_CB_IS_CONVERTIBLE.html index 954da4c0c1..b1947e7379 100644 --- a/doc/html/BOOST_CB_IS_CONVERTIBLE.html +++ b/doc/html/BOOST_CB_IS_CONVERTIBLE.html @@ -8,7 +8,7 @@ - + @@ -21,7 +21,7 @@
-PrevUpHomeNext +PrevUpHomeNext
@@ -44,7 +44,7 @@
-PrevUpHomeNext +PrevUpHomeNext
diff --git a/doc/html/BOOST_DLL_ALIAS.html b/doc/html/BOOST_DLL_ALIAS.html index f8249b34a1..a0f292bad2 100644 --- a/doc/html/BOOST_DLL_ALIAS.html +++ b/doc/html/BOOST_DLL_ALIAS.html @@ -34,7 +34,7 @@ BOOST_DLL_ALIAS(FunctionOrVar, AliasName)
-

Description

+

Description

This macro is useful in cases of long mangled C++ names. For example some void boost::foo(std::sting) function name will change to something like N5boostN3foosE after mangling. Importing function by N5boostN3foosE name does not looks user friendly, especially assuming the fact that different compilers have different mangling schemes. AliasName is the name that won't be mangled and can be used as a portable import name.

Can be used in any namespace, including global. FunctionOrVar must be fully qualified, so that address of it could be taken. Multiple different aliases for a single variable/function are allowed.

Make sure that AliasNames are unique per library/executable. Functions or variables in global namespace must not have names same as AliasNames.

diff --git a/doc/html/BOOST_DLL_ALIAS_SECTIONED.html b/doc/html/BOOST_DLL_ALIAS_SECTIONED.html index bc23a20ee6..3a19ec8b7d 100644 --- a/doc/html/BOOST_DLL_ALIAS_SECTIONED.html +++ b/doc/html/BOOST_DLL_ALIAS_SECTIONED.html @@ -34,7 +34,7 @@ BOOST_DLL_ALIAS_SECTIONED(FunctionOrVar, AliasName, SectionName)
-

Description

+

Description

Example: 

namespace foo {
diff --git a/doc/html/BOOST_DLL_AUTO_ALIAS.html b/doc/html/BOOST_DLL_AUTO_ALIAS.html
index ab5fbbb887..fc871eeecb 100644
--- a/doc/html/BOOST_DLL_AUTO_ALIAS.html
+++ b/doc/html/BOOST_DLL_AUTO_ALIAS.html
@@ -34,7 +34,7 @@
 
 BOOST_DLL_AUTO_ALIAS(FunctionOrVar)
-

Description

+

Description

This macro is useful in cases of long mangled C++ names. For example some void boost::foo(std::sting) function name will change to something like N5boostN3foosE after mangling. Importing function by N5boostN3foosE name does not looks user friendly, especially assuming the fact that different compilers have different mangling schemes.*

Must be used in scope where FunctionOrVar declared. FunctionOrVar must be a valid C name, which means that it must not contain ::.

Functions or variables in global namespace must not have names same as FunctionOrVar.

diff --git a/doc/html/BOOST_DLL_FORC_idp27662112.html b/doc/html/BOOST_DLL_FORC_idp27662112.html deleted file mode 100644 index c0a39955ad..0000000000 --- a/doc/html/BOOST_DLL_FORC_idp27662112.html +++ /dev/null @@ -1,54 +0,0 @@ - - - - -Macro BOOST_DLL_FORCE_ALIAS_INSTANTIATION - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Macro BOOST_DLL_FORCE_ALIAS_INSTANTIATION

-

BOOST_DLL_FORCE_ALIAS_INSTANTIATION

-
-

Synopsis

-
// In header: <boost/dll/alias.hpp>
-
-BOOST_DLL_FORCE_ALIAS_INSTANTIATION
-
-

Description

-

Define this macro to explicitly specify translation unit in which alias must be instantiated. See section 'Limitations' for more info. You may find usage examples in source codes of almost each tutorial. Must be used in code, when BOOST_DLL_FORCE_NO_WEAK_EXPORTS is defined

-
-
- - - -
Copyright © 2014 Renato Tegon Forti, Antony Polukhin
Copyright © 2015 Antony Polukhin
Copyright © 2016 Antony Polukhin, Klemens Morgenstern

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/BOOST_DLL_FORC_idp27664016.html b/doc/html/BOOST_DLL_FORC_idp27664016.html deleted file mode 100644 index c58dd12c34..0000000000 --- a/doc/html/BOOST_DLL_FORC_idp27664016.html +++ /dev/null @@ -1,54 +0,0 @@ - - - - -Macro BOOST_DLL_FORCE_NO_WEAK_EXPORTS - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Macro BOOST_DLL_FORCE_NO_WEAK_EXPORTS

-

BOOST_DLL_FORCE_NO_WEAK_EXPORTS

-
-

Synopsis

-
// In header: <boost/dll/alias.hpp>
-
-BOOST_DLL_FORCE_NO_WEAK_EXPORTS
-
-

Description

-

Define this macro to disable exporting weak symbols and start using the BOOST_DLL_FORCE_ALIAS_INSTANTIATION. This may be usefull for working around linker problems or to test your program for compatability with linkers that do not support export of weak symbols.

-
-
- - - -
Copyright © 2014 Renato Tegon Forti, Antony Polukhin
Copyright © 2015 Antony Polukhin
Copyright © 2016 Antony Polukhin, Klemens Morgenstern

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/BOOST_DLL_FORC_idp36961376.html b/doc/html/BOOST_DLL_FORC_idp36961376.html new file mode 100644 index 0000000000..39bd600c99 --- /dev/null +++ b/doc/html/BOOST_DLL_FORC_idp36961376.html @@ -0,0 +1,54 @@ + + + + +Macro BOOST_DLL_FORCE_ALIAS_INSTANTIATION + + + + + + + + + + + + + + + +
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
+
+
+PrevUpHomeNext +
+
+
+
+

Macro BOOST_DLL_FORCE_ALIAS_INSTANTIATION

+

BOOST_DLL_FORCE_ALIAS_INSTANTIATION

+
+

Synopsis

+
// In header: <boost/dll/alias.hpp>
+
+BOOST_DLL_FORCE_ALIAS_INSTANTIATION
+
+

Description

+

Define this macro to explicitly specify translation unit in which alias must be instantiated. See section 'Limitations' for more info. You may find usage examples in source codes of almost each tutorial. Must be used in code, when BOOST_DLL_FORCE_NO_WEAK_EXPORTS is defined

+
+
+ + + +
Copyright © 2014 Renato Tegon Forti, Antony Polukhin
Copyright © 2015 Antony Polukhin
Copyright © 2016 Antony Polukhin, Klemens Morgenstern

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/doc/html/BOOST_DLL_FORC_idp36963232.html b/doc/html/BOOST_DLL_FORC_idp36963232.html new file mode 100644 index 0000000000..7d2ac4f936 --- /dev/null +++ b/doc/html/BOOST_DLL_FORC_idp36963232.html @@ -0,0 +1,54 @@ + + + + +Macro BOOST_DLL_FORCE_NO_WEAK_EXPORTS + + + + + + + + + + + + + + + +
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
+
+
+PrevUpHomeNext +
+
+
+
+

Macro BOOST_DLL_FORCE_NO_WEAK_EXPORTS

+

BOOST_DLL_FORCE_NO_WEAK_EXPORTS

+
+

Synopsis

+
// In header: <boost/dll/alias.hpp>
+
+BOOST_DLL_FORCE_NO_WEAK_EXPORTS
+
+

Description

+

Define this macro to disable exporting weak symbols and start using the BOOST_DLL_FORCE_ALIAS_INSTANTIATION. This may be usefull for working around linker problems or to test your program for compatability with linkers that do not support export of weak symbols.

+
+
+ + + +
Copyright © 2014 Renato Tegon Forti, Antony Polukhin
Copyright © 2015 Antony Polukhin
Copyright © 2016 Antony Polukhin, Klemens Morgenstern

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/doc/html/BOOST_DLL_SECTION.html b/doc/html/BOOST_DLL_SECTION.html index 950c7c3781..8a8b8350a0 100644 --- a/doc/html/BOOST_DLL_SECTION.html +++ b/doc/html/BOOST_DLL_SECTION.html @@ -34,7 +34,7 @@ BOOST_DLL_SECTION(SectionName, Permissions)
-

Description

+

Description

diff --git a/doc/html/BOOST_DLL_SELECTANY.html b/doc/html/BOOST_DLL_SELECTANY.html index b7ec0b260f..0e61daf3d8 100644 --- a/doc/html/BOOST_DLL_SELECTANY.html +++ b/doc/html/BOOST_DLL_SELECTANY.html @@ -7,7 +7,7 @@ - + @@ -21,7 +21,7 @@
-PrevUpHomeNext +PrevUpHomeNext
@@ -34,7 +34,7 @@ BOOST_DLL_SELECTANY
-

Description

+

Description

This macro does not work on Android, IBM XL C/C++ and MinGW+Windows because of linker problems with exporting weak symbols (See https://code.google.com/p/android/issues/detail?id=70206, https://sourceware.org/bugzilla/show_bug.cgi?id=17480)

@@ -48,7 +48,7 @@
-PrevUpHomeNext +PrevUpHomeNext
diff --git a/doc/html/BOOST_INTRUSIV_idp55099840.html b/doc/html/BOOST_INTRUSIV_idp55099840.html deleted file mode 100644 index 3bc2295a1c..0000000000 --- a/doc/html/BOOST_INTRUSIV_idp55099840.html +++ /dev/null @@ -1,73 +0,0 @@ - - - - -Macro BOOST_INTRUSIVE_OPTION_TYPE - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Macro BOOST_INTRUSIVE_OPTION_TYPE

-

BOOST_INTRUSIVE_OPTION_TYPE

-
-

Synopsis

-
// In header: <boost/intrusive/pack_options.hpp>
-
-BOOST_INTRUSIVE_OPTION_TYPE(OPTION_NAME, TYPE, TYPEDEF_EXPR, TYPEDEF_NAME)
-
-

Description

-

Defines an option class of name OPTION_NAME that can be used to specify a type of type TYPE...

-
struct OPTION_NAME<class TYPE>
-{  unspecified_content  };
-
-

...that after being combined with boost::intrusive::pack_options, will typedef TYPE as a typedef of name TYPEDEF_NAME. Example:

-
//[includes and namespaces omitted for brevity]
-
-//This macro will create the following class:
-//    template<class VoidPointer>
-//    struct my_pointer
-//    { unspecified_content };
-BOOST_INTRUSIVE_OPTION_TYPE(my_pointer, VoidPointer, boost::remove_pointer<VoidPointer>::type, my_pointer_type)
-
-struct empty_default{};
-
-typedef pack_options< empty_default, typename my_pointer<void*> >::type::my_pointer_type type;
-
-BOOST_STATIC_ASSERT(( boost::is_same<type, void>::value ));
-
-

-
-
- - - -
Copyright © 2005 Olaf Krzikalla
Copyright © 2006-2015 Ion Gaztanaga

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/BOOST_INTRUSIV_idp55106064.html b/doc/html/BOOST_INTRUSIV_idp55106064.html deleted file mode 100644 index daf5602768..0000000000 --- a/doc/html/BOOST_INTRUSIV_idp55106064.html +++ /dev/null @@ -1,73 +0,0 @@ - - - - -Macro BOOST_INTRUSIVE_OPTION_CONSTANT - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Macro BOOST_INTRUSIVE_OPTION_CONSTANT

-

BOOST_INTRUSIVE_OPTION_CONSTANT

-
-

Synopsis

-
// In header: <boost/intrusive/pack_options.hpp>
-
-BOOST_INTRUSIVE_OPTION_CONSTANT(OPTION_NAME, TYPE, VALUE, CONSTANT_NAME)
-
-

Description

-

Defines an option class of name OPTION_NAME that can be used to specify a constant of type TYPE with value VALUE...

-
struct OPTION_NAME<TYPE VALUE>
-{  unspecified_content  };
-
-

...that after being combined with boost::intrusive::pack_options, will contain a CONSTANT_NAME static constant of value VALUE. Example:

-
//[includes and namespaces omitted for brevity]
-
-//This macro will create the following class:
-//    template<bool Enabled>
-//    struct incremental
-//    { unspecified_content };
-BOOST_INTRUSIVE_OPTION_CONSTANT(incremental, bool, Enabled, is_incremental)
-
-struct empty_default{};
-
-const bool is_incremental = pack_options< empty_default, incremental<true> >::type::is_incremental;
-
-BOOST_STATIC_ASSERT(( is_incremental == true ));
-
-

-
-
- - - -
Copyright © 2005 Olaf Krzikalla
Copyright © 2006-2015 Ion Gaztanaga

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/BOOST_INTRUSIV_idp55880560.html b/doc/html/BOOST_INTRUSIV_idp55880560.html new file mode 100644 index 0000000000..e1d53e43d7 --- /dev/null +++ b/doc/html/BOOST_INTRUSIV_idp55880560.html @@ -0,0 +1,73 @@ + + + + +Macro BOOST_INTRUSIVE_OPTION_TYPE + + + + + + + + + + + + + + + +
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
+
+
+PrevUpHomeNext +
+
+
+
+

Macro BOOST_INTRUSIVE_OPTION_TYPE

+

BOOST_INTRUSIVE_OPTION_TYPE

+
+

Synopsis

+
// In header: <boost/intrusive/pack_options.hpp>
+
+BOOST_INTRUSIVE_OPTION_TYPE(OPTION_NAME, TYPE, TYPEDEF_EXPR, TYPEDEF_NAME)
+
+

Description

+

Defines an option class of name OPTION_NAME that can be used to specify a type of type TYPE...

+
struct OPTION_NAME<class TYPE>
+{  unspecified_content  };
+
+

...that after being combined with boost::intrusive::pack_options, will typedef TYPE as a typedef of name TYPEDEF_NAME. Example:

+
//[includes and namespaces omitted for brevity]
+
+//This macro will create the following class:
+//    template<class VoidPointer>
+//    struct my_pointer
+//    { unspecified_content };
+BOOST_INTRUSIVE_OPTION_TYPE(my_pointer, VoidPointer, boost::remove_pointer<VoidPointer>::type, my_pointer_type)
+
+struct empty_default{};
+
+typedef pack_options< empty_default, typename my_pointer<void*> >::type::my_pointer_type type;
+
+BOOST_STATIC_ASSERT(( boost::is_same<type, void>::value ));
+
+

+
+
+ + + +
Copyright © 2005 Olaf Krzikalla
Copyright © 2006-2015 Ion Gaztanaga

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/doc/html/BOOST_INTRUSIV_idp55886784.html b/doc/html/BOOST_INTRUSIV_idp55886784.html new file mode 100644 index 0000000000..59247da91f --- /dev/null +++ b/doc/html/BOOST_INTRUSIV_idp55886784.html @@ -0,0 +1,73 @@ + + + + +Macro BOOST_INTRUSIVE_OPTION_CONSTANT + + + + + + + + + + + + + + + +
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
+
+
+PrevUpHomeNext +
+
+
+
+

Macro BOOST_INTRUSIVE_OPTION_CONSTANT

+

BOOST_INTRUSIVE_OPTION_CONSTANT

+
+

Synopsis

+
// In header: <boost/intrusive/pack_options.hpp>
+
+BOOST_INTRUSIVE_OPTION_CONSTANT(OPTION_NAME, TYPE, VALUE, CONSTANT_NAME)
+
+

Description

+

Defines an option class of name OPTION_NAME that can be used to specify a constant of type TYPE with value VALUE...

+
struct OPTION_NAME<TYPE VALUE>
+{  unspecified_content  };
+
+

...that after being combined with boost::intrusive::pack_options, will contain a CONSTANT_NAME static constant of value VALUE. Example:

+
//[includes and namespaces omitted for brevity]
+
+//This macro will create the following class:
+//    template<bool Enabled>
+//    struct incremental
+//    { unspecified_content };
+BOOST_INTRUSIVE_OPTION_CONSTANT(incremental, bool, Enabled, is_incremental)
+
+struct empty_default{};
+
+const bool is_incremental = pack_options< empty_default, incremental<true> >::type::is_incremental;
+
+BOOST_STATIC_ASSERT(( is_incremental == true ));
+
+

+
+
+ + + +
Copyright © 2005 Olaf Krzikalla
Copyright © 2006-2015 Ion Gaztanaga

+ Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

+
+
+
+PrevUpHomeNext +
+ + diff --git a/doc/html/BOOST_IS_MPI_DATATYPE.html b/doc/html/BOOST_IS_MPI_DATATYPE.html index e205becf30..ab9294cec3 100644 --- a/doc/html/BOOST_IS_MPI_DATATYPE.html +++ b/doc/html/BOOST_IS_MPI_DATATYPE.html @@ -6,8 +6,8 @@ - - + + @@ -21,7 +21,7 @@
-PrevUpHomeNext +PrevUpHomeNext
@@ -30,7 +30,7 @@

BOOST_IS_MPI_DATATYPE

Synopsis

-
// In header: <boost/mpi/datatype.hpp>
+
// In header: <boost/mpi/datatype.hpp>
 
 BOOST_IS_MPI_DATATYPE(T)
@@ -46,7 +46,7 @@
-PrevUpHomeNext +PrevUpHomeNext
diff --git a/doc/html/BOOST_MPI_BCA_1_3_26_6_6_7.html b/doc/html/BOOST_MPI_BCA_1_3_26_6_6_7.html deleted file mode 100644 index 4301ed91a7..0000000000 --- a/doc/html/BOOST_MPI_BCA_1_3_26_6_6_7.html +++ /dev/null @@ -1,56 +0,0 @@ - - - - -Macro BOOST_MPI_BCAST_BOTTOM_WORKS_FINE - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Macro BOOST_MPI_BCAST_BOTTOM_WORKS_FINE

-

BOOST_MPI_BCAST_BOTTOM_WORKS_FINE — Indicates that MPI_Bcast supports MPI_BOTTOM.

-
-

Synopsis

-
// In header: <boost/mpi/config.hpp>
-
-BOOST_MPI_BCAST_BOTTOM_WORKS_FINE
-
-

Description

-

Some implementations have a broken MPI_Bcast wrt to MPI_BOTTOM. BullX MPI and LAM seems to be among them, at least for some versions. The broacast_test.cpp test test_skeleton_and_content can be used to detect that.

-
-
- - - -
Copyright © 2005-2007 Douglas Gregor, - Matthias Troyer, Trustees of Indiana University

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at - http://www.boost.org/LICENSE_1_0.txt ) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/BOOST_MPI_CAL_1_3_26_6_6_6.html b/doc/html/BOOST_MPI_CAL_1_3_26_6_6_6.html deleted file mode 100644 index 622f0c4190..0000000000 --- a/doc/html/BOOST_MPI_CAL_1_3_26_6_6_6.html +++ /dev/null @@ -1,56 +0,0 @@ - - - - -Macro BOOST_MPI_CALLING_CONVENTION - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Macro BOOST_MPI_CALLING_CONVENTION

-

BOOST_MPI_CALLING_CONVENTION — Specifies the calling convention that will be used for callbacks from the underlying C MPI.

-
-

Synopsis

-
// In header: <boost/mpi/config.hpp>
-
-BOOST_MPI_CALLING_CONVENTION
-
-

Description

-

This is a Windows-specific macro, which will be used internally to state the calling convention of any function that is to be used as a callback from MPI. For example, the internally-defined functions that are used in a call to MPI_Op_create. This macro is likely only to be useful to users that wish to bypass Boost.MPI, registering their own callbacks in certain cases, e.g., through MPI_Op_create.

-
-
- - - -
Copyright © 2005-2007 Douglas Gregor, - Matthias Troyer, Trustees of Indiana University

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at - http://www.boost.org/LICENSE_1_0.txt ) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/BOOST_MPI_CHECK_RESULT.html b/doc/html/BOOST_MPI_CHECK_RESULT.html index b4cf1932d3..a2410d71d6 100644 --- a/doc/html/BOOST_MPI_CHECK_RESULT.html +++ b/doc/html/BOOST_MPI_CHECK_RESULT.html @@ -6,7 +6,7 @@ - + @@ -21,7 +21,7 @@
-PrevUpHomeNext +PrevUpHomeNext
@@ -30,11 +30,11 @@

BOOST_MPI_CHECK_RESULT

Synopsis

-
// In header: <boost/mpi/exception.hpp>
+
// In header: <boost/mpi/exception.hpp>
 
 BOOST_MPI_CHECK_RESULT(MPIFunc, Args)

 

-
Description

+
Description

 
Call the MPI routine MPIFunc with arguments Args (surrounded by parentheses). If the result is not MPI_SUCCESS, use boost::throw_exception to throw an exception or abort, depending on BOOST_NO_EXCEPTIONS.
@@ -50,7 +50,7 @@
-PrevUpHomeNext +PrevUpHomeNext
diff --git a/doc/html/BOOST_MPI_DECL.html b/doc/html/BOOST_MPI_DECL.html index 29e5bff2ec..7d9bd599cd 100644 --- a/doc/html/BOOST_MPI_DECL.html +++ b/doc/html/BOOST_MPI_DECL.html @@ -6,8 +6,8 @@ - - + + @@ -21,7 +21,7 @@
-PrevUpHomeNext +PrevUpHomeNext
@@ -30,7 +30,7 @@

BOOST_MPI_DECL

Synopsis

-
// In header: <boost/mpi/config.hpp>
+
// In header: <boost/mpi/config.hpp>
 
 BOOST_MPI_DECL
@@ -46,7 +46,7 @@
-PrevUpHomeNext +PrevUpHomeNext
diff --git a/doc/html/BOOST_MPI_HAS_1_3_26_6_6_4.html b/doc/html/BOOST_MPI_HAS_1_3_26_6_6_4.html deleted file mode 100644 index ad8aa0b7f1..0000000000 --- a/doc/html/BOOST_MPI_HAS_1_3_26_6_6_4.html +++ /dev/null @@ -1,56 +0,0 @@ - - - - -Macro BOOST_MPI_HAS_MEMORY_ALLOCATION - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Macro BOOST_MPI_HAS_MEMORY_ALLOCATION

-

BOOST_MPI_HAS_MEMORY_ALLOCATION — Determine if the MPI implementation has support for memory allocation.

-
-

Synopsis

-
// In header: <boost/mpi/config.hpp>
-
-BOOST_MPI_HAS_MEMORY_ALLOCATION
-
-

Description

-

This macro will be defined when the underlying MPI implementation has support for the MPI-2 memory allocation routines MPI_Alloc_mem and MPI_Free_mem. When defined, the allocator class template will provide Standard Library-compliant access to these memory-allocation routines.

-
-
- - - -
Copyright © 2005-2007 Douglas Gregor, - Matthias Troyer, Trustees of Indiana University

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at - http://www.boost.org/LICENSE_1_0.txt ) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/BOOST_MPI_HAS_1_3_26_6_6_5.html b/doc/html/BOOST_MPI_HAS_1_3_26_6_6_5.html deleted file mode 100644 index 8c35d78f66..0000000000 --- a/doc/html/BOOST_MPI_HAS_1_3_26_6_6_5.html +++ /dev/null @@ -1,56 +0,0 @@ - - - - -Macro BOOST_MPI_HAS_NOARG_INITIALIZATION - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Macro BOOST_MPI_HAS_NOARG_INITIALIZATION

-

BOOST_MPI_HAS_NOARG_INITIALIZATION — Determine if the MPI implementation has supports initialization without command-line arguments.

-
-

Synopsis

-
// In header: <boost/mpi/config.hpp>
-
-BOOST_MPI_HAS_NOARG_INITIALIZATION
-
-

Description

-

This macro will be defined when the underlying implementation supports initialization of MPI without passing along command-line arguments, e.g., MPI_Init(NULL, NULL). When defined, the environment class will provide a default constructor. This macro is always defined for MPI-2 implementations.

-
-
- - - -
Copyright © 2005-2007 Douglas Gregor, - Matthias Troyer, Trustees of Indiana University

- Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at - http://www.boost.org/LICENSE_1_0.txt ) -

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/BOOST_MPI_HOMOGENEOUS.html b/doc/html/BOOST_MPI_HOMOGENEOUS.html index 4ff77130bf..5a7e2dbbc3 100644 --- a/doc/html/BOOST_MPI_HOMOGENEOUS.html +++ b/doc/html/BOOST_MPI_HOMOGENEOUS.html @@ -6,9 +6,9 @@ - + - + @@ -21,7 +21,7 @@
-PrevUpHomeNext +PrevUpHomeNext
@@ -30,11 +30,11 @@

BOOST_MPI_HOMOGENEOUS — Comment this macro is you are running in an heterogeneous environment.

Synopsis

-
// In header: <boost/mpi/config.hpp>
+
// In header: <boost/mpi/config.hpp>
 
 BOOST_MPI_HOMOGENEOUS

 

-
Description

+
Description

 
When this flag is enabled, we assume some simple, POD-like, type can be transmitted without paying the cost of portable serialization.

 
Comment this if your platform is not homogeneous and that portable serialization/deserialization must be performed.

 
It you do so, check that your MPI implementation supports thats kind of environment. 

@@ -52,7 +52,7 @@
 
 

 

-PrevUpHomeNext
+PrevUpHomeNext
 

 
 
diff --git a/doc/html/BOOST_MPI__1_3_26_5_14_7_4.html b/doc/html/BOOST_MPI__1_3_26_5_14_7_4.html
new file mode 100644
index 0000000000..ac0bcf1b45
--- /dev/null
+++ b/doc/html/BOOST_MPI__1_3_26_5_14_7_4.html
@@ -0,0 +1,56 @@
+
+
+
+
+Macro BOOST_MPI_HAS_MEMORY_ALLOCATION
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
Boost C++ LibrariesHomeLibrariesPeopleFAQMore

+

+

+PrevUpHomeNext
+

+

+

+

+
Macro BOOST_MPI_HAS_MEMORY_ALLOCATION

+
BOOST_MPI_HAS_MEMORY_ALLOCATION — Determine if the MPI implementation has support for memory allocation. 

+

+
Synopsis

+
// In header: <boost/mpi/config.hpp>
+
+BOOST_MPI_HAS_MEMORY_ALLOCATION

+

+
Description

+
This macro will be defined when the underlying MPI implementation has support for the MPI-2 memory allocation routines MPI_Alloc_mem and MPI_Free_mem. When defined, the allocator class template will provide Standard Library-compliant access to these memory-allocation routines. 

+

+

+
+
+
+
Copyright © 2005-2007 Douglas Gregor,
+      Matthias Troyer, Trustees of Indiana University

+        Distributed under the Boost Software License, Version 1.0. (See accompanying
+        file LICENSE_1_0.txt or copy at 
+        http://www.boost.org/LICENSE_1_0.txt )
+      

+

+

+

+PrevUpHomeNext
+

+
+
diff --git a/doc/html/BOOST_MPI__1_3_26_5_14_7_5.html b/doc/html/BOOST_MPI__1_3_26_5_14_7_5.html
new file mode 100644
index 0000000000..4d94d7454c
--- /dev/null
+++ b/doc/html/BOOST_MPI__1_3_26_5_14_7_5.html
@@ -0,0 +1,56 @@
+
+
+
+
+Macro BOOST_MPI_HAS_NOARG_INITIALIZATION
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
Boost C++ LibrariesHomeLibrariesPeopleFAQMore

+

+

+PrevUpHomeNext
+

+

+

+

+
Macro BOOST_MPI_HAS_NOARG_INITIALIZATION

+
BOOST_MPI_HAS_NOARG_INITIALIZATION — Determine if the MPI implementation has supports initialization without command-line arguments. 

+

+
Synopsis

+
// In header: <boost/mpi/config.hpp>
+
+BOOST_MPI_HAS_NOARG_INITIALIZATION

+

+
Description

+
This macro will be defined when the underlying implementation supports initialization of MPI without passing along command-line arguments, e.g., MPI_Init(NULL, NULL). When defined, the environment class will provide a default constructor. This macro is always defined for MPI-2 implementations. 

+

+

+
+
+
+
Copyright © 2005-2007 Douglas Gregor,
+      Matthias Troyer, Trustees of Indiana University

+        Distributed under the Boost Software License, Version 1.0. (See accompanying
+        file LICENSE_1_0.txt or copy at 
+        http://www.boost.org/LICENSE_1_0.txt )
+      

+

+

+

+PrevUpHomeNext
+

+
+
diff --git a/doc/html/BOOST_MPI__1_3_26_5_14_7_6.html b/doc/html/BOOST_MPI__1_3_26_5_14_7_6.html
new file mode 100644
index 0000000000..5c4ba30dbd
--- /dev/null
+++ b/doc/html/BOOST_MPI__1_3_26_5_14_7_6.html
@@ -0,0 +1,56 @@
+
+
+
+
+Macro BOOST_MPI_CALLING_CONVENTION
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
Boost C++ LibrariesHomeLibrariesPeopleFAQMore

+

+

+PrevUpHomeNext
+

+

+

+

+
Macro BOOST_MPI_CALLING_CONVENTION

+
BOOST_MPI_CALLING_CONVENTION — Specifies the calling convention that will be used for callbacks from the underlying C MPI. 

+

+
Synopsis

+
// In header: <boost/mpi/config.hpp>
+
+BOOST_MPI_CALLING_CONVENTION

+

+
Description

+
This is a Windows-specific macro, which will be used internally to state the calling convention of any function that is to be used as a callback from MPI. For example, the internally-defined functions that are used in a call to MPI_Op_create. This macro is likely only to be useful to users that wish to bypass Boost.MPI, registering their own callbacks in certain cases, e.g., through MPI_Op_create. 

+

+

+
+
+
+
Copyright © 2005-2007 Douglas Gregor,
+      Matthias Troyer, Trustees of Indiana University

+        Distributed under the Boost Software License, Version 1.0. (See accompanying
+        file LICENSE_1_0.txt or copy at 
+        http://www.boost.org/LICENSE_1_0.txt )
+      

+

+

+

+PrevUpHomeNext
+

+
+
diff --git a/doc/html/BOOST_MPI__1_3_26_5_14_7_7.html b/doc/html/BOOST_MPI__1_3_26_5_14_7_7.html
new file mode 100644
index 0000000000..63c9499294
--- /dev/null
+++ b/doc/html/BOOST_MPI__1_3_26_5_14_7_7.html
@@ -0,0 +1,56 @@
+
+
+
+
+Macro BOOST_MPI_BCAST_BOTTOM_WORKS_FINE
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
Boost C++ LibrariesHomeLibrariesPeopleFAQMore

+

+

+PrevUpHomeNext
+

+

+

+

+
Macro BOOST_MPI_BCAST_BOTTOM_WORKS_FINE

+
BOOST_MPI_BCAST_BOTTOM_WORKS_FINE — Indicates that MPI_Bcast supports MPI_BOTTOM. 

+

+
Synopsis

+
// In header: <boost/mpi/config.hpp>
+
+BOOST_MPI_BCAST_BOTTOM_WORKS_FINE

+

+
Description

+
Some implementations have a broken MPI_Bcast wrt to MPI_BOTTOM. BullX MPI and LAM seems to be among them, at least for some versions. The broacast_test.cpp test test_skeleton_and_content can be used to detect that. 

+

+

+
+
+
+
Copyright © 2005-2007 Douglas Gregor,
+      Matthias Troyer, Trustees of Indiana University

+        Distributed under the Boost Software License, Version 1.0. (See accompanying
+        file LICENSE_1_0.txt or copy at 
+        http://www.boost.org/LICENSE_1_0.txt )
+      

+

+

+

+PrevUpHomeNext
+

+
+
diff --git a/doc/html/BOOST_SER_1_3_12_15_5_16_1.html b/doc/html/BOOST_SER_1_3_12_15_5_16_1.html
deleted file mode 100644
index 4676fa014e..0000000000
--- a/doc/html/BOOST_SER_1_3_12_15_5_16_1.html
+++ /dev/null
@@ -1,53 +0,0 @@
-
-
-
-
-Function BOOST_SERIALIZATION_SPLIT_FREE
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
Boost C++ LibrariesHomeLibrariesPeopleFAQMore

-

-

-PrevUpHomeNext
-

-

-

-

-
Function BOOST_SERIALIZATION_SPLIT_FREE

-
BOOST_SERIALIZATION_SPLIT_FREE

-

-
Synopsis

-
// In header: <boost/date_time/posix_time/time_serialize.hpp>
-
-
- BOOST_SERIALIZATION_SPLIT_FREE(boost::posix_time::ptime);

-

-
Description

-
time_duration objects are broken down into 4 parts for serialization: types are hour_type, min_type, sec_type, and fractional_seconds_type as defined in the time_duration class 

-

-

-
-
-
-
Copyright © 2001-2005 CrystalClear Software, Inc
Subject to the Boost Software License, Version 1.0. (See accompanying file
-    LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

-

-

-

-PrevUpHomeNext
-

-
-
diff --git a/doc/html/BOOST_SER_1_3_13_15_5_16_1.html b/doc/html/BOOST_SER_1_3_13_15_5_16_1.html
new file mode 100644
index 0000000000..6e9c85c227
--- /dev/null
+++ b/doc/html/BOOST_SER_1_3_13_15_5_16_1.html
@@ -0,0 +1,53 @@
+
+
+
+
+Function BOOST_SERIALIZATION_SPLIT_FREE
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
Boost C++ LibrariesHomeLibrariesPeopleFAQMore

+

+

+PrevUpHomeNext
+

+

+

+

+
Function BOOST_SERIALIZATION_SPLIT_FREE

+
BOOST_SERIALIZATION_SPLIT_FREE

+

+
Synopsis

+
// In header: <boost/date_time/posix_time/time_serialize.hpp>
+
+
+ BOOST_SERIALIZATION_SPLIT_FREE(boost::posix_time::ptime);

+

+
Description

+
time_duration objects are broken down into 4 parts for serialization: types are hour_type, min_type, sec_type, and fractional_seconds_type as defined in the time_duration class 

+

+

+
+
+
+
Copyright © 2001-2005 CrystalClear Software, Inc
Subject to the Boost Software License, Version 1.0. (See accompanying file
+    LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

+

+

+

+PrevUpHomeNext
+

+
+
diff --git a/doc/html/BOOST_TYPE_ERASURE_FREE.html b/doc/html/BOOST_TYPE_ERASURE_FREE.html
index 7e1e6869b1..7787a43bea 100644
--- a/doc/html/BOOST_TYPE_ERASURE_FREE.html
+++ b/doc/html/BOOST_TYPE_ERASURE_FREE.html
@@ -32,20 +32,27 @@
 
Synopsis

 
// In header: <boost/type_erasure/free.hpp>
 
-BOOST_TYPE_ERASURE_FREE(qualified_name, function_name, N)

+BOOST_TYPE_ERASURE_FREE(concept_name, function_name)

Description

The declaration of the concept is 

template<class Sig>
-struct ::namespace1::namespace2::...::concept_name;
+struct concept_name;

where Sig is a function type giving the signature of the function.

-

This macro can only be used in the global namespace.

+

This macro can only be used at namespace scope.

+

Example:

+
BOOST_TYPE_ERASURE_FREE(to_string)
+typedef has_to_string<std::string(_self const&)> to_string_concept;
+
+

In C++03, the macro can only be used in the global namespace and is defined as:

+
#define BOOST_TYPE_ERASURE_FREE(qualified_name, function_name, N)
+

Example:

BOOST_TYPE_ERASURE_FREE((boost)(has_to_string), to_string, 1)
-

+

For backwards compatibility, this form is always accepted.

@@ -60,16 +67,12 @@ The declaration of the concept is

- - + + - - - - - +

N

is the number of arguments of the function.

concept_name

is the name of the concept to declare. If it is omitted it defaults to has_ ## function_name

function_name

is the name of the function.

qualified_name

should be a preprocessor sequence of the form (namespace1)(namespace2)...(concept_name).

is the name of the function.
diff --git a/doc/html/BOOST_TYPE_ERASURE_MEMBER.html b/doc/html/BOOST_TYPE_ERASURE_MEMBER.html index dce1f5cc70..5483d37fb1 100644 --- a/doc/html/BOOST_TYPE_ERASURE_MEMBER.html +++ b/doc/html/BOOST_TYPE_ERASURE_MEMBER.html @@ -32,29 +32,36 @@

Synopsis

// In header: <boost/type_erasure/member.hpp>
 
-BOOST_TYPE_ERASURE_MEMBER(qualified_name, member, N)
+BOOST_TYPE_ERASURE_MEMBER(concept_name, member)

Description

The declaration of the concept is 

template<class Sig, class T = _self>
-struct ::namespace1::namespace2::...::concept_name;
+struct concept_name;
+
+

where Sig is a function type giving the signature of the member function, and T is the object type. T may be const-qualified for const member functions. concept_name<R(A...) const, T> is an alias for concept_name<R(A...), const T>.

+

This macro can only be used at namespace scope.

+

Example:

+
namespace boost {
+BOOST_TYPE_ERASURE_MEMBER(push_back)
+}
+typedef boost::has_push_back<void(int)> push_back_concept;
+
+

The concept defined by this function may be specialized to provide a concept_map. The class object will be passed by reference as the first parameter.

+
template<>
+struct has_push_back<void(int), std::list<int> > {
+  static void apply(std::list<int>& l, int i) { l.push_back(i); }
+};
+
+

In C++03, the macro can only be used in the global namespace and is defined as:

+
#define BOOST_TYPE_ERASURE_MEMBER(qualified_name, member, N)
-

where Sig is a function type giving the signature of the member function, and T is the object type. T may be const-qualified for const member functions.

-

This macro can only be used in the global namespace.

Example:

BOOST_TYPE_ERASURE_MEMBER((boost)(has_push_back), push_back, 1)
 typedef boost::has_push_back<void(int), _self> push_back_concept;
-
- - - - - -
[Note]Note

In C++11 the argument N is ignored and may be omitted. BOOST_TYPE_ERASURE_MEMBER will always define a variadic concept.

-

-

+

For backwards compatibility, this form is always accepted.

@@ -69,16 +76,12 @@ The declaration of the concept is

- - + + - - - - - +

N

is the number of arguments of the function.

concept_name

is the name of the concept to declare. If it is omitted it defaults to has_ ## member

member

is the name of the member function.

qualified_name

should be a preprocessor sequence of the form (namespace1)(namespace2)...(concept_name).

is the name of the member function.
diff --git a/doc/html/MPICH_IGNORE_CXX_SEEK.html b/doc/html/MPICH_IGNORE_CXX_SEEK.html index 36215562af..ed29bc1088 100644 --- a/doc/html/MPICH_IGNORE_CXX_SEEK.html +++ b/doc/html/MPICH_IGNORE_CXX_SEEK.html @@ -6,8 +6,8 @@ - - + + @@ -21,7 +21,7 @@
-PrevUpHomeNext +PrevUpHomeNext
@@ -30,7 +30,7 @@

MPICH_IGNORE_CXX_SEEK

Synopsis

-
// In header: <boost/mpi/config.hpp>
+
// In header: <boost/mpi/config.hpp>
 
 MPICH_IGNORE_CXX_SEEK
@@ -46,7 +46,7 @@
-PrevUpHomeNext +PrevUpHomeNext
diff --git a/doc/html/accumulators.html b/doc/html/accumulators.html index ebabfac5af..c100073b55 100644 --- a/doc/html/accumulators.html +++ b/doc/html/accumulators.html @@ -84,7 +84,7 @@
- +

Last revised: December 14, 2017 at 00:08:23 GMT

Last revised: April 11, 2018 at 14:10:22 GMT
diff --git a/doc/html/align.html b/doc/html/align.html index 4fe89a557c..ee07623481 100644 --- a/doc/html/align.html +++ b/doc/html/align.html @@ -68,7 +68,7 @@ - +

Last revised: December 14, 2017 at 00:08:23 GMT

Last revised: April 11, 2018 at 14:10:22 GMT
diff --git a/doc/html/asio_HTML.manifest b/doc/html/asio_HTML.manifest index daa9a9fe7c..88b247905b 100644 --- a/doc/html/asio_HTML.manifest +++ b/doc/html/asio_HTML.manifest @@ -15,6 +15,7 @@ boost_asio/overview/core/handler_tracking.html boost_asio/overview/core/concurrency_hint.html boost_asio/overview/core/coroutine.html boost_asio/overview/core/spawn.html +boost_asio/overview/core/coroutines_ts.html boost_asio/overview/networking.html boost_asio/overview/networking/protocols.html boost_asio/overview/networking/other_protocols.html @@ -71,6 +72,7 @@ boost_asio/tutorial/tutdaytime7/src.html boost_asio/examples.html boost_asio/examples/cpp03_examples.html boost_asio/examples/cpp11_examples.html +boost_asio/examples/cpp17_examples.html boost_asio/reference.html boost_asio/reference/asynchronous_operations.html boost_asio/reference/asynchronous_operations/general_asynchronous_operation_concepts.html @@ -114,6 +116,7 @@ boost_asio/reference/InternetProtocol.html boost_asio/reference/IoControlCommand.html boost_asio/reference/IoObjectService.html boost_asio/reference/IteratorConnectHandler.html +boost_asio/reference/LegacyCompletionHandler.html boost_asio/reference/MoveAcceptHandler.html boost_asio/reference/MutableBufferSequence.html boost_asio/reference/ProtoAllocator.html @@ -1505,6 +1508,33 @@ boost_asio/reference/executor_work_guard/get_executor.html boost_asio/reference/executor_work_guard/owns_work.html boost_asio/reference/executor_work_guard/reset.html boost_asio/reference/executor_work_guard/_executor_work_guard.html +boost_asio/reference/experimental__await_token.html +boost_asio/reference/experimental__await_token/await_token.html +boost_asio/reference/experimental__await_token/await_token/overload1.html +boost_asio/reference/experimental__await_token/await_token/overload2.html +boost_asio/reference/experimental__await_token/executor_type.html +boost_asio/reference/experimental__await_token/get_executor.html +boost_asio/reference/experimental__awaitable.html +boost_asio/reference/experimental__awaitable/awaitable.html +boost_asio/reference/experimental__awaitable/executor_type.html +boost_asio/reference/experimental__awaitable/value_type.html +boost_asio/reference/experimental__awaitable/_awaitable.html +boost_asio/reference/experimental__co_spawn.html +boost_asio/reference/experimental__co_spawn/overload1.html +boost_asio/reference/experimental__co_spawn/overload2.html +boost_asio/reference/experimental__co_spawn/overload3.html +boost_asio/reference/experimental__detached.html +boost_asio/reference/experimental__detached_t.html +boost_asio/reference/experimental__detached_t/detached_t.html +boost_asio/reference/experimental__redirect_error.html +boost_asio/reference/experimental__redirect_error_t.html +boost_asio/reference/experimental__redirect_error_t/ec_.html +boost_asio/reference/experimental__redirect_error_t/redirect_error_t.html +boost_asio/reference/experimental__redirect_error_t/token_.html +boost_asio/reference/experimental__this_coro__executor.html +boost_asio/reference/experimental__this_coro__executor_t.html +boost_asio/reference/experimental__this_coro__token.html +boost_asio/reference/experimental__this_coro__token_t.html boost_asio/reference/generic__basic_endpoint.html boost_asio/reference/generic__basic_endpoint/basic_endpoint.html boost_asio/reference/generic__basic_endpoint/basic_endpoint/overload1.html diff --git a/doc/html/atomic.html b/doc/html/atomic.html index c4441368e1..047dd53e24 100644 --- a/doc/html/atomic.html +++ b/doc/html/atomic.html @@ -35,7 +35,7 @@

Copyright © 2011 Helge Bahmann

Copyright © 2012 Tim Blechmann

-

Copyright © 2013, 2017 Andrey Semashev

+

Copyright © 2013, 2017, 2018 Andrey Semashev

Distributed under the Boost Software License, Version 1.0. (See accompanying @@ -171,7 +171,7 @@

- +

Last revised: December 14, 2017 at 00:08:23 GMT

Last revised: April 11, 2018 at 14:10:22 GMT
diff --git a/doc/html/atomic/interface.html b/doc/html/atomic/interface.html index 1069f2ac0f..a7b95c9d77 100644 --- a/doc/html/atomic/interface.html +++ b/doc/html/atomic/interface.html @@ -130,6 +130,20 @@ + +

+ BOOST_ATOMIC_NO_FLOATING_POINT +

+ + +

+ When defined, support for floating point operations is disabled. + Floating point types shall be treated similar to trivially copyable + structs and no capability macros will be defined. +

+ + +

BOOST_ATOMIC_FORCE_FALLBACK @@ -306,6 +320,102 @@ +

+ For compilers that support C++11 scoped enums, the library also defines scoped + synonyms that are preferred in modern programs: +

+
++++ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
+

+ Pre-C++11 constant +

+ 		+

+ C++11 equivalent +

+
+

+ memory_order_relaxed +

+ 		+

+ memory_order::relaxed +

+
+

+ memory_order_release +

+ 		+

+ memory_order::release +

+
+

+ memory_order_acquire +

+ 		+

+ memory_order::acquire +

+
+

+ memory_order_consume +

+ 		+

+ memory_order::consume +

+
+

+ memory_order_acq_rel +

+ 		+

+ memory_order::acq_rel +

+
+

+ memory_order_seq_cst +

+ 		+

+ memory_order::seq_cst +

+

See section happens-before for explanation of the various ordering constraints. @@ -434,6 +544,8 @@ template class

boost::atomic<integral> template class
+
boost::atomic<floating-point> + template class
boost::atomic<pointer> template class
boost::atomic<T> @@ -462,7 +574,8 @@ Note that classes with virtual functions or virtual base classes do not satisfy the requirements. Also be warned that structures with "padding" between data members may compare non-equal via memcmp - even though all members are equal. + even though all members are equal. This may also be the case with some floating + point types, which include padding bits themselves.

@@ -679,8 +792,8 @@ In addition to these explicit operations, each atomic<T> object also supports implicit store and load through the use of "assignment" and "conversion to T" - operators. Avoid using these operators, as they do not allow explicit specification - of a memory ordering constraint. + operators. Avoid using these operators, as they do not allow to specify + a memory ordering constraint which always defaults to memory_order_seq_cst.

@@ -841,28 +954,117 @@

- void opaque_negate(memory_order + I negate(memory_order order)

Change the sign of the value stored in the variable, returning - nothing + the result

- void opaque_complement(memory_order + I add(I + v, + memory_order order) +

+ + +

+ Add v to variable, + returning the result +

+ + + + +

+ I sub(I + v, + memory_order order) +

+ + +

+ Subtract v from + variable, returning the result +

+ + + + +

+ I bitwise_and(I + v, + memory_order order) +

+ + +

+ Apply bit-wise "and" with v + to variable, returning the result +

+ + + + +

+ I bitwise_or(I + v, + memory_order order) +

+ + +

+ Apply bit-wise "or" with v + to variable, returning the result +

+ + + + +

+ I bitwise_xor(I + v, + memory_order order) +

+ + +

+ Apply bit-wise "xor" with v + to variable, returning the result +

+ + + + +

+ I bitwise_complement(memory_order order)

Set the variable to the one's complement of the current value, - returning nothing + returning the result +

+ + + + +

+ void opaque_negate(memory_order + order) +

+ + +

+ Change the sign of the value stored in the variable, returning + nothing

@@ -942,6 +1144,36 @@ + +

+ void opaque_complement(memory_order + order) +

+ + +

+ Set the variable to the one's complement of the current value, + returning nothing +

+ + + + +

+ bool negate_and_test(memory_order + order) +

+ + +

+ Change the sign of the value stored in the variable, returning + true if the result + is non-zero and false + otherwise +

+ + +

bool add_and_test(I @@ -953,7 +1185,7 @@

Add v to variable, returning true if - the result is zero and false + the result is non-zero and false otherwise

@@ -970,7 +1202,7 @@

Subtract v from variable, returning true - if the result is zero and false + if the result is non-zero and false otherwise

@@ -987,7 +1219,7 @@

Apply bit-wise "and" with v to variable, returning true - if the result is zero and false + if the result is non-zero and false otherwise

@@ -1004,7 +1236,7 @@

Apply bit-wise "or" with v to variable, returning true - if the result is zero and false + if the result is non-zero and false otherwise

@@ -1021,7 +1253,23 @@

Apply bit-wise "xor" with v to variable, returning true - if the result is zero and false + if the result is non-zero and false + otherwise +

+ + + + +

+ bool complement_and_test(memory_order + order) +

+ + +

+ Set the variable to the one's complement of the current value, + returning true if + the result is non-zero and false otherwise

@@ -1079,6 +1327,25 @@
+
+ + + + + +
[Note]Note

+ In Boost.Atomic 1.66 the op_and_test + operations returned the opposite value (i.e. true + if the result is zero). This was changed to the current behavior in 1.67 + for consistency with other operations in Boost.Atomic, as well as with + conventions taken in the C++ standard library. Boost.Atomic 1.66 was + the only release shipped with the old behavior. Users upgrading from + Boost 1.66 to a later release can define BOOST_ATOMIC_HIGHLIGHT_OP_AND_TEST + macro when building their code to generate deprecation warnings on the + op_and_test function calls (the + functions are not actually deprecated though; this is just a way to highlight + their use). +

order always has memory_order_seq_cst as default parameter.

@@ -1096,20 +1363,29 @@ object also supports implicit pre-/post- increment/decrement, as well as the operators +=, -=, &=, |= and ^=. - Avoid using these operators, as they do not allow explicit specification - of a memory ordering constraint which always defaults to memory_order_seq_cst. + Avoid using these operators, as they do not allow to specify a memory ordering + constraint which always defaults to memory_order_seq_cst.

+
+ + + + + +
[Note]Note

+ The support for floating point types is optional and can be disabled + by defining BOOST_ATOMIC_NO_FLOATING_POINT. +

- In addition to the operations applicable to all atomic object, boost::atomic<P> - for pointer types P (other than - pointers to void, function or member pointers) support - the following operations, which correspond to std::atomic<P>: + In addition to the operations applicable to all atomic objects, boost::atomic<F> + for floating point types F supports + the following operations, which correspond to std::atomic<F>:

@@ -1132,7 +1408,7 @@

- T fetch_add(ptrdiff_t + F fetch_add(F v, memory_order order)

@@ -1147,7 +1423,7 @@

- T fetch_sub(ptrdiff_t + F fetch_sub(F v, memory_order order)

@@ -1162,8 +1438,8 @@

- Similarly to integers, the following Boost.Atomic - extensions are also provided: + Additionally, as a Boost.Atomic extension, + the following operations are also provided:

@@ -1186,39 +1462,326 @@ - -

- void opaque_add(ptrdiff_t - v, - memory_order order) + F fetch_negate(memory_order + order)

- Add v to variable, - returning nothing + Change the sign of the value stored in the variable, returning + previous value

- void opaque_sub(ptrdiff_t - v, - memory_order order) + F negate(memory_order + order)

- Subtract v from - variable, returning nothing + Change the sign of the value stored in the variable, returning + the result

-

- order always has memory_order_seq_cst as default parameter. -

-

+ + +

+ F add(F + v, + memory_order order) +

+ + +

+ Add v to variable, + returning the result +

+ + + + +

+ F sub(F + v, + memory_order order) +

+ + +

+ Subtract v from + variable, returning the result +

+ + + + +

+ void opaque_negate(memory_order + order) +

+ + +

+ Change the sign of the value stored in the variable, returning + nothing +

+ + + + +

+ void opaque_add(F + v, + memory_order order) +

+ + +

+ Add v to variable, + returning nothing +

+ + + + +

+ void opaque_sub(F + v, + memory_order order) +

+ + +

+ Subtract v from + variable, returning nothing +

+ + + +
+

+ order always has memory_order_seq_cst as default parameter. +

+

+ The opaque_op variants of the operations + may result in a more efficient code on some architectures because the original + value of the atomic variable is not preserved. +

+

+ In addition to these explicit operations, each boost::atomic<F> + object also supports operators += + and -=. Avoid using these + operators, as they do not allow to specify a memory ordering constraint + which always defaults to memory_order_seq_cst. +

+

+ When using atomic operations with floating point types, bear in mind that + Boost.Atomic always performs bitwise comparison + of the stored values. This means that operations like compare_exchange* may fail if the stored value and comparand + have different binary representation, even if they would normally compare + equal. This is typically the case when either of the numbers is denormalized. + This also means that the behavior with regard to special floating point + values like NaN and signed zero is also different from normal C++. +

+

+ Another source of the problem is padding bits that are added to some floating + point types for alignment. One widespread example of that is Intel x87 + extended double format, which is typically stored as 80 bits of value padded + with 16 or 48 unused bits. These padding bits are often uninitialized and + contain garbage, which makes two equal numbers have different binary representation. + The library attempts to account for the known such cases, but in general + it is possible that some platforms are not covered. Note that the C++ standard + makes no guarantees about reliability of compare_exchange* operations in the face of padding or trap + bits. +

+
+
+
+

+ In addition to the operations applicable to all atomic objects, boost::atomic<P> + for pointer types P (other than + pointers to void, function or member pointers) support + the following operations, which correspond to std::atomic<P>: +

+
++++ + + + + + + + + + + + + + + +
+

+ Syntax +

+ 		+

+ Description +

+
+

+ T fetch_add(ptrdiff_t + v, + memory_order order) +

+ 		+

+ Add v to variable, + returning previous value +

+
+

+ T fetch_sub(ptrdiff_t + v, + memory_order order) +

+ 		+

+ Subtract v from + variable, returning previous value +

+
+

+ Similarly to integers, the following Boost.Atomic + extensions are also provided: +

+
++++ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
+

+ Syntax +

+ 		+

+ Description +

+
+

+ void add(ptrdiff_t + v, + memory_order order) +

+ 		+

+ Add v to variable, + returning the result +

+
+

+ void sub(ptrdiff_t + v, + memory_order order) +

+ 		+

+ Subtract v from + variable, returning the result +

+
+

+ void opaque_add(ptrdiff_t + v, + memory_order order) +

+ 		+

+ Add v to variable, + returning nothing +

+
+

+ void opaque_sub(ptrdiff_t + v, + memory_order order) +

+ 		+

+ Subtract v from + variable, returning nothing +

+
+

+ bool add_and_test(ptrdiff_t + v, + memory_order order) +

+ 		+

+ Add v to variable, + returning true if + the result is non-null and false + otherwise +

+
+

+ bool sub_and_test(ptrdiff_t + v, + memory_order order) +

+ 		+

+ Subtract v from + variable, returning true + if the result is non-null and false + otherwise +

+
+

+ order always has memory_order_seq_cst as default parameter. +

+

In addition to these explicit operations, each boost::atomic<P> object also supports implicit pre-/post- increment/decrement, as well as the operators +=, -=. Avoid using these operators, as they @@ -1658,11 +2221,76 @@ is a type that fits storage of contiguous N bits, suitably aligned for atomic operations.

+

+ For floating-point types the following macros are similarly defined: +

+
++++ + + + + + + + + + + + + + + + + + + +
+

+ Macro +

+ 		+

+ Description +

+
+

+ BOOST_ATOMIC_FLOAT_LOCK_FREE +

+ 		+

+ Indicate whether atomic<float> is lock-free. +

+
+

+ BOOST_ATOMIC_DOUBLE_LOCK_FREE +

+ 		+

+ Indicate whether atomic<double> is lock-free. +

+
+

+ BOOST_ATOMIC_LONG_DOUBLE_LOCK_FREE +

+ 		+

+ Indicate whether atomic<long + double> + is lock-free. +

+
+

+ These macros are not defined when support for floating point types is disabled + by user. +

-
Copyright © 2011 Helge Bahmann
Copyright © 2012 Tim Blechmann
Copyright © 2013, 2017 Andrey Semashev

+

Copyright © 2011 Helge Bahmann
Copyright © 2012 Tim Blechmann
Copyright © 2013, 2017, 2018 Andrey Semashev

Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

diff --git a/doc/html/atomic/limitations.html b/doc/html/atomic/limitations.html index f127667b65..dfa9cea02c 100644 --- a/doc/html/atomic/limitations.html +++ b/doc/html/atomic/limitations.html @@ -34,15 +34,39 @@

  • - Using non-POD-classes as template parameter to atomic<T> - results in undefined behavior: This means that any class containing - a constructor, destructor, virtual methods or access control specifications - is not a valid argument in C++98. C++11 relaxes this slightly by allowing - "trivial" classes containing only empty constructors. Advise: Use only POD types. + Aggregate initialization syntax is not supported: + Since Boost.Atomic sometimes uses storage + type that is different from the value type, the atomic<> template needs an initialization + constructor that performs the necessary conversion. This makes atomic<> + a non-aggregate type and prohibits aggregate initialization syntax (atomic<int> a = {10}). + Boost.Atomic does support direct and unified + initialization syntax though. Advice: + Always use direct initialization (atomic<int> a(10)) + or unified initialization (atomic<int> a{10}) + syntax.
  • - C++98 compilers may transform computation- to control-dependency: - Crucially, memory_order_consume + Initializing constructor is not constexpr + for some types: For value types other than integral types and + bool, atomic<> initializing constructor needs + to perform runtime conversion to the storage type. This limitation may + be lifted for more categories of types in the future. +
    • +
  • + Default constructor is not trivial in C++03: + Because the initializing constructor has to be defined in atomic<>, + the default constructor must also be defined. In C++03 the constructor + cannot be defined as defaulted and therefore it is not trivial. In C++11 + the constructor is defaulted (and trivial, if the default constructor of + the value type is). In any case, the default constructor of atomic<> + performs default initialization of the atomic value, as required in C++11. + Advice: In C++03, do not use Boost.Atomic in contexts where trivial default constructor + is important (e.g. as a global variable which is required to be statically + initialized). +
    • +
  • + C++03 compilers may transform computation dependency + to control dependency: Crucially, memory_order_consume only affects computationally-dependent operations, but in general there is nothing preventing a compiler from transforming a computation dependency into a control dependency. A fully compliant C++11 compiler would be forbidden @@ -59,22 +83,47 @@ the compiler cannot speculate and transform these into control dependencies.
  • - Fence operations enforce "too strong" compiler - ordering: Semantically, memory_order_acquire/memory_order_consume and memory_order_release need to restrain - reordering of memory operations only in one direction. Since there is no - way to express this constraint to the compiler, these act as "full - compiler barriers" in this implementation. In corner cases this may - result in a less efficient code than a C++11 compiler could generate. + Fence operations may enforce "too strong" + compiler ordering: Semantically, memory_order_acquire/memory_order_consume and memory_order_release need to restrain + reordering of memory operations only in one direction. Since in C++03 there + is no way to express this constraint to the compiler, these act as "full + compiler barriers" in C++03 implementation. In corner cases this may + result in a slightly less efficient code than a C++11 compiler could generate. + Boost.Atomic will use compiler intrinsics, + if possible, to express the proper ordering constraints. +
    • +
  • + Atomic operations may enforce "too strong" + memory ordering in debug mode: On some compilers, disabling + optimizations makes it impossible to provide memory ordering constraints + as compile-time constants to the compiler intrinsics. This causes the compiler + to silently ignore the provided constraints and choose the "strongest" + memory order (memory_order_seq_cst) + to generate code. Not only this reduces performance, this may hide bugs + in the user's code (e.g. if the user used a wrong memory order constraint, + which caused a data race). Advice: Always + test your code with optimizations enabled.
  • No interprocess fallback: using atomic<T> in shared memory only works correctly, if atomic<T>::is_lock_free() == true.
    • +
  • + Signed integers must use two's + complement representation: Boost.Atomic + makes this requirement in order to implement conversions between signed + and unsigned integers internally. C++11 requires all atomic arithmetic + operations on integers to be well defined according to two's complement + arithmetics, which means that Boost.Atomic has to operate on unsigned integers + internally to avoid undefined behavior that results from signed integer + overflows. Platforms with other signed integer representations are not + supported. +
-
Copyright © 2011 Helge Bahmann
Copyright © 2012 Tim Blechmann
Copyright © 2013, 2017 Andrey Semashev

+

Copyright © 2011 Helge Bahmann
Copyright © 2012 Tim Blechmann
Copyright © 2013, 2017, 2018 Andrey Semashev

Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

diff --git a/doc/html/atomic/porting.html b/doc/html/atomic/porting.html index 282a2d5351..dc8f24af49 100644 --- a/doc/html/atomic/porting.html +++ b/doc/html/atomic/porting.html @@ -109,7 +109,7 @@
-
Copyright © 2011 Helge Bahmann
Copyright © 2012 Tim Blechmann
Copyright © 2013, 2017 Andrey Semashev

+

Copyright © 2011 Helge Bahmann
Copyright © 2012 Tim Blechmann
Copyright © 2013, 2017, 2018 Andrey Semashev

Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

diff --git a/doc/html/atomic/thread_coordination.html b/doc/html/atomic/thread_coordination.html index 8c0ca730da..0ddcd909cd 100644 --- a/doc/html/atomic/thread_coordination.html +++ b/doc/html/atomic/thread_coordination.html @@ -358,7 +358,7 @@
-
Copyright © 2011 Helge Bahmann
Copyright © 2012 Tim Blechmann
Copyright © 2013, 2017 Andrey Semashev

+

Copyright © 2011 Helge Bahmann
Copyright © 2012 Tim Blechmann
Copyright © 2013, 2017, 2018 Andrey Semashev

Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

diff --git a/doc/html/atomic/usage_examples.html b/doc/html/atomic/usage_examples.html index 4a0437bb6e..ef18f123e2 100644 --- a/doc/html/atomic/usage_examples.html +++ b/doc/html/atomic/usage_examples.html @@ -473,7 +473,7 @@
-
Copyright © 2011 Helge Bahmann
Copyright © 2012 Tim Blechmann
Copyright © 2013, 2017 Andrey Semashev

+

Copyright © 2011 Helge Bahmann
Copyright © 2012 Tim Blechmann
Copyright © 2013, 2017, 2018 Andrey Semashev

Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

diff --git a/doc/html/bbv2/overview.html b/doc/html/bbv2/overview.html index 63a406ef2d..93508f2b15 100644 --- a/doc/html/bbv2/overview.html +++ b/doc/html/bbv2/overview.html @@ -454,7 +454,8 @@ actions create-file-from-another
-
+

Any of these files may also be overridden on the command line

+
@@ -722,6 +723,24 @@ b2 toolset=gcc variant=debug optimization=space that don't depend on the failed ones.

-j N

Run up to N commands in parallel.

+
+--config=filename +
+
+

Override all configuration files

+
+
--site-config=filename
+
+

Override the default site-config.jam

+
+
--user-config=filename
+
+

Override the default user-config.jam

+
+
--project-config=filename
+
+

Override the default project-config.jam

+
--debug-configuration

Produces debug information about the loading of Boost.Build and toolset files.

@@ -884,6 +903,11 @@ b2 link=static,shared threading=single,multi b2 include=static,shared

is not treated specially.

+

Multiple features may be grouped by using a forwards slash.

+
+b2 gcc/link=shared msvc/link=static,shared
+
+

This will build 3 different variants, altogether.

diff --git a/doc/html/bbv2/reference.html b/doc/html/bbv2/reference.html index 6d08f5101e..337abe970a 100644 --- a/doc/html/bbv2/reference.html +++ b/doc/html/bbv2/reference.html @@ -626,6 +626,57 @@ path-constant DATA : data/a.txt ; under Configuration Properties → Manifest Tool → Input and Output → Additional Manifest Files.

+
+relevant +
+
+

+ Allowed values: the name of any feature. +

+

+ This feature is used to indicate which other features are relevant for + a given target. It is usually not necessary to manage it explicitly, + as Boost.Build can deduce it in most cases. Features which are not + relevant will not affect target paths, and will not cause conflicts. +

+

+ A feature will be considered relevant if any of the following are true +

+
    +
  • It is referenced by toolset.flags or toolset.uses-features +
    • +
  • It is used by the requirements of a generator
    • +
  • It is a subfeature of a relevant feature
    • +
  • It has a subfeature which is relevant
    • +
  • It is a composite feature, and any composed feature is relevant
    • +
  • It affects target alternative selection for a main target
    • +
  • It is a propagated feature and is relevant for any dependency
    • +
  • It is relevant for any dependency created by the same main target
    • +
  • It is used in the condition of a conditional property and the corresponding value is relevant
    • +
  • It is explicitly named as relevent
    • +
+

+

+

Relevant features cannot be automatically deduced in the following cases:

+
    +
  • Indirect conditionals. Solution: return properties of the form + <relevant>result-feature:<relevant>condition-feature

[Tip] Tip
+ + + + + +
[Note]Note

This isn't really a conditional, + although for most purposes it functions like one. In particular, it does not support + multiple comma-separated elements in the condition, and it does work correctly even + in contexts where conditional properties are not allowed

+ +

  • Action rules that read properties. Solution: add toolset.uses-features + to tell Boost.Build that the feature is actually used.

    • +

  • Generators and targets that manipulate property-sets directly. + Solution: set <relevant> manually.

    • + +
    @@ -1281,6 +1332,7 @@ using vacpp ;
    STLport library
    zlib
    bzip2
    +
    Python

    Boost.Build provides special support for some third-party C++ libraries, documented below.

    @@ -1413,6 +1465,95 @@ using bzip2 : 1.0.6 : <source>C:/Devel/src/bzip2-1.0.6 : <toolset>ms using bzip2 : 1.0.6 : : <toolset>gcc ; +
    +
    +Python
    +

    Provides support for the + python language + environment to be linked in as a library.

    +

    python can be initialized using the following syntax

    +
    +using python : [version] : [command-or-prefix] : [includes] : [libraries] : [conditions] : [extension-suffix] ;
+
    +

    Options for using python:

    +
    +
    version
    +

    the version of Python to use. Should be in Major.Minor + format, for example 2.3. Do not include the subminor version. +

    +
    command-or-prefix
    +

    Preferably, a command that invokes a Python interpreter. + Alternatively, the installation prefix for Python libraries + and includes. If empty, will be guessed from the version, the + platform's installation patterns, and the python executables + that can be found in PATH.

    +
    includes
    +

    the include path to Python headers. If empty, will be + guessed.

    +
    libraries
    +

    the path to Python library binaries. If empty, will + be guessed. On MacOS/Darwin, you can also pass the path of the + Python framework.

    +
    conditions
    +

    if specified, should be a set of properties that are + matched against the build configuration when Boost.Build + selects a Python configuration to use.

    +
    extension-suffix
    +

    A string to append to the name of extension modules + before the true filename extension. Ordinarily we would just + compute this based on the value of the <python-debugging> + feature. However ubuntu's python-dbg package uses the windows + convention of appending _d to debug-build extension modules. We + have no way of detecting ubuntu, or of probing python for the + "_d" requirement, and if you configure and build python using + --with-pydebug, you'll be using the standard *nix convention. + Defaults to "" (or "_d" when targeting windows and + <python-debugging> is set).

    +
    +

    Examples:

    +
    +# Find python in the default system location
+using python ;
+# 2.7
+using python : 2.7 ;
+# 3.5
+using python : 3.5 ;
+
+# On ubuntu 16.04
+using python
+: 2.7 # version
+: # Interpreter/path to dir
+: /usr/include/python2.7 # includes
+: /usr/lib/x86_64-linux-gnu # libs
+: # conditions
+;
+
+using python 
+: 3.5 # version
+: # Interpreter/path to dir
+: /usr/include/python3.5 # includes
+: /usr/lib/x86_64-linux-gnu # libs
+: # conditions
+;
+
+# On windows
+using python
+: 2.7 # version
+: C:\\Python27-32\\python.exe # Interperter/path to dir
+: C:\\Python27-32\\include # includes
+: C:\\Python27-32\\libs # libs
+: <address-model>32 <address-model> # conditions - both 32 and unspecified 
+;
+
+using python
+: 2.7 # version
+: C:\\Python27-64\\python.exe # Interperter/path to dir
+: C:\\Python27-64\\include # includes
+: C:\\Python27-64\\libs # libs
+: <address-model>64 # conditions
+;
+
    +

    @@ -2783,7 +2924,8 @@ exe a : a.cpp the directory bin unless this is overridden by the build-dir project attribute. Under bin is a path that depends on the properties used to build each target. This path is uniquely determined by - all non-free, non-incidental properties. For example, + all relevant + non-free, non-incidental properties. For example, given a property set containing: <toolset>gcc <toolset-gcc:version>4.6.1 <variant>debug <warnings>all <define>_DEBUG <include>/usr/local/include diff --git a/doc/html/boost/CV/constrained_value.html b/doc/html/boost/CV/constrained_value.html index b787c6e49e..5559de1959 100644 --- a/doc/html/boost/CV/constrained_value.html +++ b/doc/html/boost/CV/constrained_value.html @@ -39,53 +39,53 @@ typedef value_policies::value_type value_type; // construct/copy/destruct - constrained_value(value_type); - constrained_value & operator=(value_type); + constrained_value(value_type); + constrained_value & operator=(value_type); - // public member functions - operator value_type() const; + // public member functions + operator value_type() const; - // public static functions - static value_type max BOOST_PREVENT_MACRO_SUBSTITUTION(); - static value_type min BOOST_PREVENT_MACRO_SUBSTITUTION(); + // public static functions + static value_type max BOOST_PREVENT_MACRO_SUBSTITUTION(); + static value_type min BOOST_PREVENT_MACRO_SUBSTITUTION(); - // private member functions - void assign(value_type); + // private member functions + void assign(value_type); };

    -

    Description

    +

    Description

    This template provides a quick way to generate an integer type with a constrained range. The type provides for the ability to specify the min, max, and and error handling policy.

    value policies A class that provides the range limits via the min and max functions as well as a function on_error that determines how errors are handled. A common strategy would be to assert or throw and exception. The on_error is passed both the current value and the new value that is in error.

    -

    +

    constrained_value public construct/copy/destruct

      -
    1. constrained_value(value_type value);
      2. -
    2. constrained_value & operator=(value_type v);
      3. +
    3. constrained_value(value_type value);
      4. +
    4. constrained_value & operator=(value_type v);
    -

    -constrained_value public member functions

    +

    +constrained_value public member functions

    1. -
      operator value_type() const;
      Coerce into the representation type.
    +
    operator value_type() const;
    Coerce into the representation type.
    -

    -constrained_value public static functions

    +

    +constrained_value public static functions

    1. -
      static value_type max BOOST_PREVENT_MACRO_SUBSTITUTION();
      Return the max allowed value (traits method)
      2. +
      static value_type max BOOST_PREVENT_MACRO_SUBSTITUTION();
      Return the max allowed value (traits method)
    2. -
      static value_type min BOOST_PREVENT_MACRO_SUBSTITUTION();
      Return the min allowed value (traits method)
      3. +
      static value_type min BOOST_PREVENT_MACRO_SUBSTITUTION();
      Return the min allowed value (traits method)
    -

    -constrained_value private member functions

    -
    1. void assign(value_type value);
    +

    +constrained_value private member functions

    +
    1. void assign(value_type value);
    diff --git a/doc/html/boost/CV/simple_exception_policy.html b/doc/html/boost/CV/simple_exception_policy.html index 783728551b..f602cbb141 100644 --- a/doc/html/boost/CV/simple_exception_policy.html +++ b/doc/html/boost/CV/simple_exception_policy.html @@ -43,24 +43,24 @@ struct exception_wrapper : public exception_type { - // public member functions - operator std::out_of_range() const; + // public member functions + operator std::out_of_range() const; }; - // public static functions - static rep_type min BOOST_PREVENT_MACRO_SUBSTITUTION(); - static rep_type max BOOST_PREVENT_MACRO_SUBSTITUTION(); - static void on_error(rep_type, rep_type, violation_enum); + // public static functions + static rep_type min BOOST_PREVENT_MACRO_SUBSTITUTION(); + static rep_type max BOOST_PREVENT_MACRO_SUBSTITUTION(); + static void on_error(rep_type, rep_type, violation_enum); };
    -

    Description

    +

    Description

    -

    -simple_exception_policy public static functions

    +

    +simple_exception_policy public static functions

      -
    1. static rep_type min BOOST_PREVENT_MACRO_SUBSTITUTION();
      2. -
    2. static rep_type max BOOST_PREVENT_MACRO_SUBSTITUTION();
      3. -
    3. static void on_error(rep_type, rep_type, violation_enum);
      4. +
    4. static rep_type min BOOST_PREVENT_MACRO_SUBSTITUTION();
      5. +
    5. static rep_type max BOOST_PREVENT_MACRO_SUBSTITUTION();
      6. +
    6. static void on_error(rep_type, rep_type, violation_enum);
    diff --git a/doc/html/boost/CV/simple_exception_policy/exception_wrapper.html b/doc/html/boost/CV/simple_exception_policy/exception_wrapper.html index a35b37b22f..6ce0d33bfb 100644 --- a/doc/html/boost/CV/simple_exception_policy/exception_wrapper.html +++ b/doc/html/boost/CV/simple_exception_policy/exception_wrapper.html @@ -6,7 +6,7 @@ - + @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -36,15 +36,15 @@ struct exception_wrapper : public exception_type { - // public member functions - operator std::out_of_range() const; + // public member functions + operator std::out_of_range() const; };
    -

    Description

    +

    Description

    -

    -exception_wrapper public member functions

    -
    1. operator std::out_of_range() const;
    +

    +exception_wrapper public member functions

    +
    1. operator std::out_of_range() const;
    @@ -56,7 +56,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/bad_function_call.html b/doc/html/boost/bad_function_call.html index 95053b862f..a4ec5ccb83 100644 --- a/doc/html/boost/bad_function_call.html +++ b/doc/html/boost/bad_function_call.html @@ -36,17 +36,17 @@ class bad_function_call : public std::runtime_error { public: // construct/copy/destruct - bad_function_call(); + bad_function_call(); };
    -

    Description

    +

    Description

    -

    +

    bad_function_call public construct/copy/destruct

    1. -
      bad_function_call();
      +
      bad_function_call();
      diff --git a/doc/html/boost/circular_buffe_idp24565232.html b/doc/html/boost/circular_buffe_idp24565232.html deleted file mode 100644 index c9ec7ddabe..0000000000 --- a/doc/html/boost/circular_buffe_idp24565232.html +++ /dev/null @@ -1,2828 +0,0 @@ - - - - -Class template circular_buffer_space_optimized - - - - - - - - -
      - - - - - - -
      Boost C++ LibrariesHomeLibrariesPeopleFAQMore
      -
      -
      -PrevUpHomeNext -
      -
      -
      -
      -

      Class template circular_buffer_space_optimized

      -

      boost::circular_buffer_space_optimized — Space optimized circular buffer container adaptor. T must be a copyable class or must have an noexcept move constructor and move assignment operator.

      -
      -

      Synopsis

      -
      // In header: <boost/circular_buffer/space_optimized.hpp>
-
-template<typename T, typename Alloc> 
-class circular_buffer_space_optimized :
-  private boost::circular_buffer< T, Alloc >
-{
-public:
-  // types
-  typedef circular_buffer< T, Alloc >::value_type             value_type;            
-  typedef circular_buffer< T, Alloc >::pointer                pointer;               
-  typedef circular_buffer< T, Alloc >::const_pointer          const_pointer;         
-  typedef circular_buffer< T, Alloc >::reference              reference;             
-  typedef circular_buffer< T, Alloc >::const_reference        const_reference;       
-  typedef circular_buffer< T, Alloc >::size_type              size_type;             
-  typedef circular_buffer< T, Alloc >::difference_type        difference_type;       
-  typedef circular_buffer< T, Alloc >::allocator_type         allocator_type;        
-  typedef circular_buffer< T, Alloc >::const_iterator         const_iterator;        
-  typedef circular_buffer< T, Alloc >::iterator               iterator;              
-  typedef circular_buffer< T, Alloc >::const_reverse_iterator const_reverse_iterator;
-  typedef circular_buffer< T, Alloc >::reverse_iterator       reverse_iterator;      
-  typedef circular_buffer< T, Alloc >::array_range            array_range;           
-  typedef circular_buffer< T, Alloc >::const_array_range      const_array_range;     
-  typedef circular_buffer< T, Alloc >::param_value_type       param_value_type;      
-  typedef circular_buffer< T, Alloc >::rvalue_type            rvalue_type;           
-  typedef cb_details::capacity_control< size_type >           capacity_type;         
-
-  // construct/copy/destruct
-  explicit circular_buffer_space_optimized(const allocator_type & = allocator_type()) noexcept;
-  explicit circular_buffer_space_optimized(capacity_type, 
-                                           const allocator_type & = allocator_type());
-  circular_buffer_space_optimized(capacity_type, param_value_type, 
-                                  const allocator_type & = allocator_type());
-  circular_buffer_space_optimized(capacity_type, size_type, param_value_type, 
-                                  const allocator_type & = allocator_type());
-  circular_buffer_space_optimized(const circular_buffer_space_optimized< T, Alloc > &);
-  circular_buffer_space_optimized(circular_buffer_space_optimized< T, Alloc > &&) noexcept;
-  template<typename InputIterator> 
-    circular_buffer_space_optimized(InputIterator, InputIterator, 
-                                    const allocator_type & = allocator_type());
-  template<typename InputIterator> 
-    circular_buffer_space_optimized(capacity_type, InputIterator, 
-                                    InputIterator, 
-                                    const allocator_type & = allocator_type());
-  circular_buffer_space_optimized< T, Alloc > & 
-  operator=(const circular_buffer_space_optimized< T, Alloc > &);
-  circular_buffer_space_optimized< T, Alloc > & 
-  operator=(circular_buffer_space_optimized< T, Alloc > &&) noexcept;
-
-  // public member functions
-  bool full() const noexcept;
-  size_type reserve() const noexcept;
-  const capacity_type & capacity() const noexcept;
-  void set_capacity(const capacity_type &);
-  void resize(size_type, param_value_type = value_type());
-  void rset_capacity(const capacity_type &);
-  void rresize(size_type, param_value_type = value_type());
-  void assign(size_type, param_value_type);
-  void assign(capacity_type, size_type, param_value_type);
-  template<typename InputIterator> void assign(InputIterator, InputIterator);
-  template<typename InputIterator> 
-    void assign(capacity_type, InputIterator, InputIterator);
-  void swap(circular_buffer_space_optimized< T, Alloc > &) noexcept;
-  void push_back(param_value_type);
-  void push_back(rvalue_type);
-  void push_back();
-  void push_front(param_value_type);
-  void push_front(rvalue_type);
-  void push_front();
-  void pop_back();
-  void pop_front();
-  iterator insert(iterator, param_value_type);
-  iterator insert(iterator, rvalue_type);
-  iterator insert(iterator);
-  void insert(iterator, size_type, param_value_type);
-  template<typename InputIterator> 
-    void insert(iterator, InputIterator, InputIterator);
-  iterator rinsert(iterator, param_value_type);
-  iterator rinsert(iterator, rvalue_type);
-  iterator rinsert(iterator);
-  void rinsert(iterator, size_type, param_value_type);
-  template<typename InputIterator> 
-    void rinsert(iterator, InputIterator, InputIterator);
-  iterator erase(iterator);
-  iterator erase(iterator, iterator);
-  iterator rerase(iterator);
-  iterator rerase(iterator, iterator);
-  void clear();
-
-  // private member functions
-  void adjust_min_capacity();
-  size_type ensure_reserve(size_type, size_type) const;
-  void check_low_capacity(size_type = 1);
-  void check_high_capacity();
-  void reduce_capacity(const true_type &);
-  void reduce_capacity(const false_type &);
-  template<typename IntegralType> 
-    void insert(const iterator &, IntegralType, IntegralType, 
-                const true_type &);
-  template<typename Iterator> 
-    void insert(const iterator &, Iterator, Iterator, const false_type &);
-  template<typename IntegralType> 
-    void rinsert(const iterator &, IntegralType, IntegralType, 
-                 const true_type &);
-  template<typename Iterator> 
-    void rinsert(const iterator &, Iterator, Iterator, const false_type &);
-
-  // private static functions
-  static size_type init_capacity(const capacity_type &, size_type);
-  template<typename IntegralType> 
-    static size_type 
-    init_capacity(const capacity_type &, IntegralType, IntegralType, 
-                  const true_type &);
-  template<typename Iterator> 
-    static size_type 
-    init_capacity(const capacity_type &, Iterator, Iterator, 
-                  const false_type &);
-  template<typename InputIterator> 
-    static size_type 
-    init_capacity(const capacity_type &, InputIterator, InputIterator, 
-                  const std::input_iterator_tag &);
-  template<typename ForwardIterator> 
-    static size_type 
-    init_capacity(const capacity_type &, ForwardIterator, ForwardIterator, 
-                  const std::forward_iterator_tag &);
-};
      -
      -

      Description

      -
      -

      -circular_buffer_space_optimized - public - types

      -
      1. -

        -typedef cb_details::capacity_control< size_type > capacity_type;

        -

        Capacity controller of the space optimized circular buffer.

        -

        See Also:

        -

        capacity_control in details.hpp.

        -

        - class capacity_control
        - {
        - size_type m_capacity; // Available capacity.
        - size_type m_min_capacity; // Minimum capacity.
        - public:
        - capacity_control(size_type capacity, size_type min_capacity = 0)
        - : m_capacity(capacity), m_min_capacity(min_capacity)
        - {};
        - size_type capacity() const { return m_capacity; }
        - size_type min_capacity() const { return m_min_capacity; }
        - operator size_type() const { return m_capacity; }
        - };
        -

        -

        Always capacity >= min_capacity.

        -

        The capacity() represents the capacity of the circular_buffer_space_optimized and the min_capacity() determines the minimal allocated size of its internal buffer.

        -

        The converting constructor of the capacity_control allows implicit conversion from size_type-like types which ensures compatibility of creating an instance of the circular_buffer_space_optimized with other STL containers.

        -

        On the other hand the operator size_type() provides implicit conversion to the size_type which allows to treat the capacity of the circular_buffer_space_optimized the same way as in the circular_buffer.

        -
      -
      -
      -

      -circular_buffer_space_optimized - public - construct/copy/destruct

      -
        -
      1. -
        explicit circular_buffer_space_optimized(const allocator_type & alloc = allocator_type()) noexcept;
        Create an empty space optimized circular buffer with zero capacity.

        - - -

        -

        Complexity. Constant.

        -

        -

        -
        - - - - - -
        [Warning]Warning

        Since Boost version 1.36 the behaviour of this constructor has changed. Now it creates a space optimized circular buffer with zero capacity.

        -

        -

        -
        ---- - - - - - - - - - - - - - - -

        Parameters:

        ---- - - - - -

        alloc

        The allocator.

        Postconditions:

        capacity().capacity() == 0 && capacity().min_capacity() == 0 && size() == 0

        Throws:

        		Nothing.
        -
        2. -
      2. -
        explicit circular_buffer_space_optimized(capacity_type capacity_ctrl, 
-                                         const allocator_type & alloc = allocator_type());
        Create an empty space optimized circular buffer with the specified capacity.

        - - -

        -

        Complexity. Constant.

        -

        -

        -
        ---- - - - - - - - - - - - - - - -

        Parameters:

        ---- - - - - - - - - - - -

        alloc

        The allocator.

        capacity_ctrl

        The capacity controller representing the maximum number of elements which can be stored in the circular_buffer_space_optimized and the minimal allocated size of the internal buffer.

        Postconditions:

        capacity() == capacity_ctrl && size() == 0
        -
        - The amount of allocated memory in the internal buffer is capacity_ctrl.min_capacity().

        Throws:

        		An allocation error if memory is exhausted (std::bad_alloc if the standard allocator is used).
        -
        3. -
      3. -
        circular_buffer_space_optimized(capacity_type capacity_ctrl, 
-                                param_value_type item, 
-                                const allocator_type & alloc = allocator_type());
        Create a full space optimized circular buffer with the specified capacity filled with capacity_ctrl.capacity() copies of item.

        - - -

        -

        Complexity. Linear (in the capacity_ctrl.capacity()).

        -

        -

        -
        ---- - - - - - - - - - - - - - - -

        Parameters:

        ---- - - - - - - - - - - - - - - -

        alloc

        The allocator.

        capacity_ctrl

        The capacity controller representing the maximum number of elements which can be stored in the circular_buffer_space_optimized and the minimal allocated size of the internal buffer.

        item

        The element the created circular_buffer_space_optimized will be filled with.

        Postconditions:

        capacity() == capacity_ctrl && full() && (*this)[0] == item && (*this)[1] == item && ... && (*this) [capacity_ctrl.capacity() - 1] == item
        -
        - The amount of allocated memory in the internal buffer is capacity_ctrl.capacity().

        Throws:

        		An allocation error if memory is exhausted (std::bad_alloc if the standard allocator is used). T::T(const T&) throws.
        -
        4. -
      4. -
        circular_buffer_space_optimized(capacity_type capacity_ctrl, size_type n, 
-                                param_value_type item, 
-                                const allocator_type & alloc = allocator_type());
        Create a space optimized circular buffer with the specified capacity filled with n copies of item.

        - - - -

        -

        Complexity. Linear (in the n).

        -

        -

        -
        ---- - - - - - - - - - - - - - - - - - - -

        Parameters:

        ---- - - - - - - - - - - - - - - - - - - -

        alloc

        The allocator.

        capacity_ctrl

        The capacity controller representing the maximum number of elements which can be stored in the circular_buffer_space_optimized and the minimal allocated size of the internal buffer.

        item

        The element the created circular_buffer_space_optimized will be filled with.

        n

        The number of elements the created circular_buffer_space_optimized will be filled with.

        Requires:

        capacity_ctrl.capacity() >= n

        Postconditions:

        capacity() == capacity_ctrl && size() == n && (*this)[0] == item && (*this)[1] == item && ... && (*this)[n - 1] == item
        -
        - The amount of allocated memory in the internal buffer is max[n, capacity_ctrl.min_capacity()].

        Throws:

        		An allocation error if memory is exhausted (std::bad_alloc if the standard allocator is used). Whatever T::T(const T&) throws.
        -
        5. -
      5. -
        circular_buffer_space_optimized(const circular_buffer_space_optimized< T, Alloc > & cb);
        The copy constructor.

        Creates a copy of the specified circular_buffer_space_optimized. - - -

        -

        Complexity. Linear (in the size of cb).

        -

        -

        -
        ---- - - - - - - - - - - - - - - -

        Parameters:

        ---- - - - - -

        cb

        The circular_buffer_space_optimized to be copied.

        Postconditions:

        *this == cb
        -
        - The amount of allocated memory in the internal buffer is cb.size().

        Throws:

        		An allocation error if memory is exhausted (std::bad_alloc if the standard allocator is used). Whatever T::T(const T&) throws.
        -
        6. -
      6. -
        circular_buffer_space_optimized(circular_buffer_space_optimized< T, Alloc > && cb) noexcept;
        The move constructor.

        Move constructs a circular_buffer_space_optimized from cb, leaving cb empty. - - - -

        -

        Constant. 

        -

        -

        -
        ---- - - - - - - - - - - - - - - - - - - -

        Parameters:

        ---- - - - - -

        cb

        circular_buffer to 'steal' value from.

        Requires:

        C++ compiler with rvalue references support.

        Postconditions:

        cb.empty()

        Throws:

        		Nothing.
        -
        7. -
      7. -
        template<typename InputIterator> 
-  circular_buffer_space_optimized(InputIterator first, InputIterator last, 
-                                  const allocator_type & alloc = allocator_type());
        Create a full space optimized circular buffer filled with a copy of the range.

        - - - -

        -

        Complexity. Linear (in the std::distance(first, last)).

        -

        -

        -
        ---- - - - - - - - - - - - - - - - - - - -

        Parameters:

        ---- - - - - - - - - - - - - - - -

        alloc

        The allocator.

        first

        The beginning of the range to be copied.

        last

        The end of the range to be copied.

        Requires:

        Valid range [first, last).
        - first and last have to meet the requirements of InputIterator.

        Postconditions:

        capacity().capacity() == std::distance(first, last) && capacity().min_capacity() == 0 && full() && (*this)[0]== *first && (*this)[1] == *(first + 1) && ... && (*this)[std::distance(first, last) - 1] == *(last - 1)
        -
        - The amount of allocated memory in the internal buffer is std::distance(first, last).

        Throws:

        		An allocation error if memory is exhausted (std::bad_alloc if the standard allocator is used). Whatever T::T(const T&) throws or nothing if T::T(T&&) is noexcept and InputIterator is a move iterator.
        -
        8. -
      8. -
        template<typename InputIterator> 
-  circular_buffer_space_optimized(capacity_type capacity_ctrl, 
-                                  InputIterator first, InputIterator last, 
-                                  const allocator_type & alloc = allocator_type());
        Create a space optimized circular buffer with the specified capacity (and the minimal guaranteed amount of allocated memory) filled with a copy of the range.

        - - - -

        -

        Complexity. Linear (in std::distance(first, last); in min[capacity_ctrl.capacity(), std::distance(first, last)] if the InputIterator is a RandomAccessIterator).

        -

        -

        -
        ---- - - - - - - - - - - - - - - - - - - -

        Parameters:

        ---- - - - - - - - - - - - - - - - - - - -

        alloc

        The allocator.

        capacity_ctrl

        The capacity controller representing the maximum number of elements which can be stored in the circular_buffer_space_optimized and the minimal allocated size of the internal buffer.

        first

        The beginning of the range to be copied.

        last

        The end of the range to be copied.

        Requires:

        Valid range [first, last).
        - first and last have to meet the requirements of InputIterator.

        Postconditions:

        capacity() == capacity_ctrl && size() <= std::distance(first, last) && (*this)[0]== (last - capacity_ctrl.capacity()) && (*this)[1] == *(last - capacity_ctrl.capacity() + 1) && ... && (*this)[capacity_ctrl.capacity() - 1] == *(last - 1)
        -
        - If the number of items to be copied from the range [first, last) is greater than the specified capacity_ctrl.capacity() then only elements from the range [last - capacity_ctrl.capacity(), last) will be copied.
        -
        - The amount of allocated memory in the internal buffer is max[capacity_ctrl.min_capacity(), min[capacity_ctrl.capacity(), std::distance(first, last)]].

        Throws:

        		An allocation error if memory is exhausted (std::bad_alloc if the standard allocator is used). Whatever T::T(const T&) throws.
        -
        9. -
      9. -
        circular_buffer_space_optimized< T, Alloc > & 
-operator=(const circular_buffer_space_optimized< T, Alloc > & cb);
        The assign operator.

        Makes this circular_buffer_space_optimized to become a copy of the specified circular_buffer_space_optimized. - - -

        -

        Exception Safety. Strong.

        -

        -

        -

        Iterator Invalidation. Invalidates all iterators pointing to this circular_buffer_space_optimized (except iterators equal to end()).

        -

        -

        -

        Complexity. Linear (in the size of cb).

        -

        -

        -

        See Also:

        -

        assign(size_type, const_reference), assign(capacity_type, size_type, const_reference), assign(InputIterator, InputIterator), assign(capacity_type, InputIterator, InputIterator)

        -

        -

        -
        ---- - - - - - - - - - - - - - - -

        Parameters:

        ---- - - - - -

        cb

        The circular_buffer_space_optimized to be copied.

        Postconditions:

        *this == cb
        -
        - The amount of allocated memory in the internal buffer is cb.size().

        Throws:

        		An allocation error if memory is exhausted (std::bad_alloc if the standard allocator is used). T::T(const T&) throws.
        -
        10. -
      10. -
        circular_buffer_space_optimized< T, Alloc > & 
-operator=(circular_buffer_space_optimized< T, Alloc > && cb) noexcept;
        Move assigns content of cb to *this, leaving cb empty.

        - - - -

        -

        Complexity. Constant.

        -

        -

        -
        ---- - - - - - - - - - - - - - - - - - - -

        Parameters:

        ---- - - - - -

        cb

        circular_buffer to 'steal' value from.

        Requires:

        C++ compiler with rvalue references support.

        Postconditions:

        cb.empty()

        Throws:

        		Nothing.
        -
        11. -
      -
      -
      -

      -circular_buffer_space_optimized public member functions

      -
        -
      1. -
        bool full() const noexcept;
        Is the circular_buffer_space_optimized full?

        - -

        -

        Exception Safety. No-throw.

        -

        -

        -

        Iterator Invalidation. Does not invalidate any iterators.

        -

        -

        -

        Complexity. Constant (in the size of the circular_buffer_space_optimized).

        -

        -

        -

        See Also:

        -

        empty()

        -

        -

        -
        ---- - - - - - - - - - - -

        Returns:

        true if the number of elements stored in the circular_buffer_space_optimized equals the capacity of the circular_buffer_space_optimized; false otherwise.

        Throws:

        		Nothing.
        -
        2. -
      2. -
        size_type reserve() const noexcept;
        Get the maximum number of elements which can be inserted into the circular_buffer_space_optimized without overwriting any of already stored elements.

        - -

        -

        Exception Safety. No-throw.

        -

        -

        -

        Iterator Invalidation. Does not invalidate any iterators.

        -

        -

        -

        Complexity. Constant (in the size of the circular_buffer_space_optimized).

        -

        -

        -

        See Also:

        -

        capacity(), size(), max_size()

        -

        -

        -
        ---- - - - - - - - - - - -

        Returns:

        capacity().capacity() - size()

        Throws:

        		Nothing.
        -
        3. -
      3. -
        const capacity_type & capacity() const noexcept;
        Get the capacity of the circular_buffer_space_optimized.

        - -

        -

        Exception Safety. No-throw.

        -

        -

        -

        Iterator Invalidation. Does not invalidate any iterators.

        -

        -

        -

        Complexity. Constant (in the size of the circular_buffer_space_optimized).

        -

        -

        -

        See Also:

        -

        reserve(), size(), max_size(), set_capacity(const capacity_type&)

        -

        -

        -
        ---- - - - - - - - - - - -

        Returns:

        The capacity controller representing the maximum number of elements which can be stored in the circular_buffer_space_optimized and the minimal allocated size of the internal buffer.

        Throws:

        		Nothing.
        -
        4. -
      4. -
        void set_capacity(const capacity_type & capacity_ctrl);
        Change the capacity (and the minimal guaranteed amount of allocated memory) of the circular_buffer_space_optimized.

        - - -

        -

        Exception Safety. Strong.

        -

        -

        -

        Iterator Invalidation. Invalidates all iterators pointing to the circular_buffer_space_optimized (except iterators equal to end()).

        -

        -

        -

        Complexity. Linear (in min[size(), capacity_ctrl.capacity()]).

        -

        -

        -
        - - - - - -
        [Note]Note

        To explicitly clear the extra allocated memory use the shrink-to-fit technique:
        -
        - boost::circular_buffer_space_optimized<int> cb(1000);
        - ...
        - boost::circular_buffer_space_optimized<int>(cb).swap(cb);
        -
        - For more information about the shrink-to-fit technique in STL see http://www.gotw.ca/gotw/054.htm.

        -

        -

        -

        See Also:

        -

        rset_capacity(const capacity_type&), resize(size_type, const_reference)

        -

        -

        -
        ---- - - - - - - - - - - - - - - -

        Parameters:

        ---- - - - - -

        capacity_ctrl

        The new capacity controller.

        Postconditions:

        capacity() == capacity_ctrl && size() <= capacity_ctrl.capacity()
        -
        - If the current number of elements stored in the circular_buffer_space_optimized is greater than the desired new capacity then number of [size() - capacity_ctrl.capacity()] last elements will be removed and the new size will be equal to capacity_ctrl.capacity().
        -
        - If the current number of elements stored in the circular_buffer_space_optimized is lower than the new capacity then the amount of allocated memory in the internal buffer may be accommodated as necessary but it will never drop below capacity_ctrl.min_capacity().

        Throws:

        		An allocation error if memory is exhausted, (std::bad_alloc if the standard allocator is used). Whatever T::T(const T&) throws or nothing if T::T(T&&) is noexcept.
        -
        5. -
      5. -
        void resize(size_type new_size, param_value_type item = value_type());
        Change the size of the circular_buffer_space_optimized.

        - - -

        -

        Exception Safety. Basic.

        -

        -

        -

        Iterator Invalidation. Invalidates all iterators pointing to the circular_buffer_space_optimized (except iterators equal to end()).

        -

        -

        -

        Complexity. Linear (in the new size of the circular_buffer_space_optimized).

        -

        -

        -

        See Also:

        -

        rresize(size_type, const_reference), set_capacity(const capacity_type&)

        -

        -

        -
        ---- - - - - - - - - - - - - - - -

        Parameters:

        ---- - - - - - - - - - - -

        item

        The element the circular_buffer_space_optimized will be filled with in order to gain the requested size. (See the Effect.)

        new_size

        The new size.

        Postconditions:

        size() == new_size && capacity().capacity() >= new_size
        -
        - If the new size is greater than the current size, copies of item will be inserted at the back of the of the circular_buffer_space_optimized in order to achieve the desired size. In the case the resulting size exceeds the current capacity the capacity will be set to new_size.
        -
        - If the current number of elements stored in the circular_buffer_space_optimized is greater than the desired new size then number of [size() - new_size] last elements will be removed. (The capacity will remain unchanged.)
        -
        - The amount of allocated memory in the internal buffer may be accommodated as necessary.

        Throws:

        		An allocation error if memory is exhausted (std::bad_alloc if the standard allocator is used). Whatever T::T(const T&) throws.
        -
        6. -
      6. -
        void rset_capacity(const capacity_type & capacity_ctrl);
        Change the capacity (and the minimal guaranteed amount of allocated memory) of the circular_buffer_space_optimized.

        - - -

        -

        Exception Safety. Strong.

        -

        -

        -

        Iterator Invalidation. Invalidates all iterators pointing to the circular_buffer_space_optimized (except iterators equal to end()).

        -

        -

        -

        Complexity. Linear (in min[size(), capacity_ctrl.capacity()]).

        -

        -

        -

        See Also:

        -

        set_capacity(const capacity_type&), rresize(size_type, const_reference)

        -

        -

        -
        ---- - - - - - - - - - - - - - - -

        Parameters:

        ---- - - - - -

        capacity_ctrl

        The new capacity controller.

        Postconditions:

        capacity() == capacity_ctrl && size() <= capacity_ctrl
        -
        - If the current number of elements stored in the circular_buffer_space_optimized is greater than the desired new capacity then number of [size() - capacity_ctrl.capacity()] first elements will be removed and the new size will be equal to capacity_ctrl.capacity().
        -
        - If the current number of elements stored in the circular_buffer_space_optimized is lower than the new capacity then the amount of allocated memory in the internal buffer may be accommodated as necessary but it will never drop below capacity_ctrl.min_capacity().

        Throws:

        		An allocation error if memory is exhausted (std::bad_alloc if the standard allocator is used). Whatever T::T(const T&) throws or nothing if T::T(T&&) is noexcept.
        -
        7. -
      7. -
        void rresize(size_type new_size, param_value_type item = value_type());
        Change the size of the circular_buffer_space_optimized.

        - - -

        -

        Exception Safety. Basic.

        -

        -

        -

        Iterator Invalidation. Invalidates all iterators pointing to the circular_buffer_space_optimized (except iterators equal to end()).

        -

        -

        -

        Complexity. Linear (in the new size of the circular_buffer_space_optimized).

        -

        -

        -

        See Also:

        -

        resize(size_type, const_reference), rset_capacity(const capacity_type&)

        -

        -

        -
        ---- - - - - - - - - - - - - - - -

        Parameters:

        ---- - - - - - - - - - - -

        item

        The element the circular_buffer_space_optimized will be filled with in order to gain the requested size. (See the Effect.)

        new_size

        The new size.

        Postconditions:

        size() == new_size && capacity().capacity() >= new_size
        -
        - If the new size is greater than the current size, copies of item will be inserted at the front of the of the circular_buffer_space_optimized in order to achieve the desired size. In the case the resulting size exceeds the current capacity the capacity will be set to new_size.
        -
        - If the current number of elements stored in the circular_buffer_space_optimized is greater than the desired new size then number of [size() - new_size] first elements will be removed. (The capacity will remain unchanged.)
        -
        - The amount of allocated memory in the internal buffer may be accommodated as necessary.

        Throws:

        		An allocation error if memory is exhausted (std::bad_alloc if the standard allocator is used). Whatever T::T(const T&) throws.
        -
        8. -
      8. -
        void assign(size_type n, param_value_type item);
        Assign n items into the space optimized circular buffer.

        The content of the circular_buffer_space_optimized will be removed and replaced with n copies of the item. - - -

        -

        Exception Safety. Basic.

        -

        -

        -

        Iterator Invalidation. Invalidates all iterators pointing to the circular_buffer_space_optimized (except iterators equal to end()).

        -

        -

        -

        Complexity. Linear (in the n).

        -

        -

        -

        See Also:

        -

        operator=, assign(capacity_type, size_type, const_reference), assign(InputIterator, InputIterator), assign(capacity_type, InputIterator, InputIterator)

        -

        -

        -
        ---- - - - - - - - - - - - - - - -

        Parameters:

        ---- - - - - - - - - - - -

        item

        The element the circular_buffer_space_optimized will be filled with.

        n

        The number of elements the circular_buffer_space_optimized will be filled with.

        Postconditions:

        capacity().capacity() == n && capacity().min_capacity() == 0 && size() == n && (*this)[0] == item && (*this)[1] == item && ... && (*this) [n - 1] == item
        -
        - The amount of allocated memory in the internal buffer is n.

        Throws:

        		An allocation error if memory is exhausted (std::bad_alloc if the standard allocator is used). Whatever T::T(const T&) throws.
        -
        9. -
      9. -
        void assign(capacity_type capacity_ctrl, size_type n, param_value_type item);
        Assign n items into the space optimized circular buffer specifying the capacity.

        The capacity of the circular_buffer_space_optimized will be set to the specified value and the content of the circular_buffer_space_optimized will be removed and replaced with n copies of the item. - - - -

        -

        Exception Safety. Basic.

        -

        -

        -

        Iterator Invalidation. Invalidates all iterators pointing to the circular_buffer_space_optimized (except iterators equal to end()).

        -

        -

        -

        Complexity. Linear (in the n).

        -

        -

        -

        See Also:

        -

        operator=, assign(size_type, const_reference), assign(InputIterator, InputIterator), assign(capacity_type, InputIterator, InputIterator)

        -

        -

        -
        ---- - - - - - - - - - - - - - - - - - - -

        Parameters:

        ---- - - - - - - - - - - - - - - -

        capacity_ctrl

        The new capacity controller.

        item

        The element the circular_buffer_space_optimized will be filled with.

        n

        The number of elements the circular_buffer_space_optimized will be filled with.

        Requires:

        capacity_ctrl.capacity() >= n

        Postconditions:

        capacity() == capacity_ctrl && size() == n && (*this)[0] == item && (*this)[1] == item && ... && (*this) [n - 1] == item
        -
        - The amount of allocated memory will be max[n, capacity_ctrl.min_capacity()].

        Throws:

        		An allocation error if memory is exhausted (std::bad_alloc if the standard allocator is used). Whatever T::T(const T&) throws.
        -
        10. -
      10. -
        template<typename InputIterator> 
-  void assign(InputIterator first, InputIterator last);
        Assign a copy of the range into the space optimized circular buffer.

        The content of the circular_buffer_space_optimized will be removed and replaced with copies of elements from the specified range. - - - -

        -

        Exception Safety. Basic.

        -

        -

        -

        Iterator Invalidation. Invalidates all iterators pointing to the circular_buffer_space_optimized (except iterators equal to end()).

        -

        -

        -

        Complexity. Linear (in the std::distance(first, last)).

        -

        -

        -

        See Also:

        -

        operator=, assign(size_type, const_reference), assign(capacity_type, size_type, const_reference), assign(capacity_type, InputIterator, InputIterator)

        -

        -

        -
        ---- - - - - - - - - - - - - - - - - - - -

        Parameters:

        ---- - - - - - - - - - - -

        first

        The beginning of the range to be copied.

        last

        The end of the range to be copied.

        Requires:

        Valid range [first, last).
        - first and last have to meet the requirements of InputIterator.

        Postconditions:

        capacity().capacity() == std::distance(first, last) && capacity().min_capacity() == 0 && size() == std::distance(first, last) && (*this)[0]== *first && (*this)[1] == *(first + 1) && ... && (*this)[std::distance(first, last) - 1] == *(last - 1)
        -
        - The amount of allocated memory in the internal buffer is std::distance(first, last).

        Throws:

        		An allocation error if memory is exhausted (std::bad_alloc if the standard allocator is used). Whatever T::T(const T&) throws or nothing if T::T(T&&) is noexcept and InputIterator is a move iterator.
        -
        11. -
      11. -
        template<typename InputIterator> 
-  void assign(capacity_type capacity_ctrl, InputIterator first, 
-              InputIterator last);
        Assign a copy of the range into the space optimized circular buffer specifying the capacity.

        The capacity of the circular_buffer_space_optimized will be set to the specified value and the content of the circular_buffer_space_optimized will be removed and replaced with copies of elements from the specified range. - - - -

        -

        Exception Safety. Basic.

        -

        -

        -

        Iterator Invalidation. Invalidates all iterators pointing to the circular_buffer_space_optimized (except iterators equal to end()).

        -

        -

        -

        Complexity. Linear (in std::distance(first, last); in min[capacity_ctrl.capacity(), std::distance(first, last)] if the InputIterator is a RandomAccessIterator).

        -

        -

        -

        See Also:

        -

        operator=, assign(size_type, const_reference), assign(capacity_type, size_type, const_reference), assign(InputIterator, InputIterator)

        -

        -

        -
        ---- - - - - - - - - - - - - - - - - - - -

        Parameters:

        ---- - - - - - - - - - - - - - - -

        capacity_ctrl

        The new capacity controller.

        first

        The beginning of the range to be copied.

        last

        The end of the range to be copied.

        Requires:

        Valid range [first, last).
        - first and last have to meet the requirements of InputIterator.

        Postconditions:

        capacity() == capacity_ctrl && size() <= std::distance(first, last) && (*this)[0]== *(last - capacity) && (*this)[1] == *(last - capacity + 1) && ... && (*this)[capacity - 1] == *(last - 1)
        -
        - If the number of items to be copied from the range [first, last) is greater than the specified capacity then only elements from the range [last - capacity, last) will be copied.
        -
        - The amount of allocated memory in the internal buffer is max[std::distance(first, last), capacity_ctrl.min_capacity()].

        Throws:

        		An allocation error if memory is exhausted (std::bad_alloc if the standard allocator is used). Whatever T::T(const T&) throws or nothing if T::T(T&&) is noexcept and InputIterator is a move iterator.
        -
        12. -
      12. -
        void swap(circular_buffer_space_optimized< T, Alloc > & cb) noexcept;
        Swap the contents of two space-optimized circular-buffers.

        - - -

        -

        Exception Safety. No-throw.

        -

        -

        -

        Iterator Invalidation. Invalidates all iterators of both circular_buffer_space_optimized containers. (On the other hand the iterators still point to the same elements but within another container. If you want to rely on this feature you have to turn the __debug_support off, otherwise an assertion will report an error if such invalidated iterator is used.)

        -

        -

        -

        Complexity. Constant (in the size of the circular_buffer_space_optimized).

        -

        -

        -

        See Also:

        -

        swap(circular_buffer<T, Alloc>&, circular_buffer<T, Alloc>&), swap(circular_buffer_space_optimized<T, Alloc>&, circular_buffer_space_optimized<T, Alloc>&)

        -

        -

        -
        ---- - - - - - - - - - - - - - - -

        Parameters:

        ---- - - - - -

        cb

        The circular_buffer_space_optimized whose content will be swapped.

        Postconditions:

        this contains elements of cb and vice versa; the capacity and the amount of allocated memory in the internal buffer of this equal to the capacity and the amount of allocated memory of cb and vice versa.

        Throws:

        		Nothing.
        -
        13. -
      13. -
        void push_back(param_value_type item);
        Insert a new element at the end of the space optimized circular buffer.

        - - -

        -

        Exception Safety. Basic.

        -

        -

        -

        Iterator Invalidation. Invalidates all iterators pointing to the circular_buffer_space_optimized (except iterators equal to end()).

        -

        -

        -

        Complexity. Linear (in the size of the circular_buffer_space_optimized).

        -

        -

        -

        See Also:

        -

        push_front(const_reference), pop_back(), pop_front()

        -

        -

        -
        ---- - - - - - - - - - - - - - - -

        Parameters:

        ---- - - - - -

        item

        The element to be inserted.

        Postconditions:

        if capacity().capacity() > 0 then back() == item
        - If the circular_buffer_space_optimized is full, the first element will be removed. If the capacity is 0, nothing will be inserted.
        -
        - The amount of allocated memory in the internal buffer may be predictively increased.

        Throws:

        		An allocation error if memory is exhausted (std::bad_alloc if the standard allocator is used). Whatever T::T(const T&) throws.
        -
        14. -
      14. -
        void push_back(rvalue_type item);
        Insert a new element at the end of the space optimized circular buffer.

        - - -

        -

        Exception Safety. Basic.

        -

        -

        -

        Iterator Invalidation. Invalidates all iterators pointing to the circular_buffer_space_optimized (except iterators equal to end()).

        -

        -

        -

        Complexity. Linear (in the size of the circular_buffer_space_optimized).

        -

        -

        -

        See Also:

        -

        push_front(const_reference), pop_back(), pop_front()

        -

        -

        -
        ---- - - - - - - - - - - - - - - -

        Parameters:

        ---- - - - - -

        item

        The element to be inserted.

        Postconditions:

        if capacity().capacity() > 0 then back() == item
        - If the circular_buffer_space_optimized is full, the first element will be removed. If the capacity is 0, nothing will be inserted.
        -
        - The amount of allocated memory in the internal buffer may be predictively increased.

        Throws:

        		An allocation error if memory is exhausted (std::bad_alloc if the standard allocator is used).
        -
        15. -
      15. -
        void push_back();
        Insert a new element at the end of the space optimized circular buffer.

        - -

        -

        Exception Safety. Basic.

        -

        -

        -

        Iterator Invalidation. Invalidates all iterators pointing to the circular_buffer_space_optimized (except iterators equal to end()).

        -

        -

        -

        Complexity. Linear (in the size of the circular_buffer_space_optimized).

        -

        -

        -

        See Also:

        -

        push_front(const_reference), pop_back(), pop_front()

        -

        -

        -
        ---- - - - - - - - - - - -

        Postconditions:

        if capacity().capacity() > 0 then back() == item
        - If the circular_buffer_space_optimized is full, the first element will be removed. If the capacity is 0, nothing will be inserted.
        -
        - The amount of allocated memory in the internal buffer may be predictively increased.

        Throws:

        		An allocation error if memory is exhausted (std::bad_alloc if the standard allocator is used). Whatever T::T() throws. Whatever T::T(const T&) throws or nothing if T::T(T&&) is noexcept.
        -
        16. -
      16. -
        void push_front(param_value_type item);
        Insert a new element at the beginning of the space optimized circular buffer.

        - - -

        -

        Exception Safety. Basic.

        -

        -

        -

        Iterator Invalidation. Invalidates all iterators pointing to the circular_buffer_space_optimized (except iterators equal to end()).

        -

        -

        -

        Complexity. Linear (in the size of the circular_buffer_space_optimized).

        -

        -

        -

        See Also:

        -

        push_back(const_reference), pop_back(), pop_front()

        -

        -

        -
        ---- - - - - - - - - - - - - - - -

        Parameters:

        ---- - - - - -

        item

        The element to be inserted.

        Postconditions:

        if capacity().capacity() > 0 then front() == item
        - If the circular_buffer_space_optimized is full, the last element will be removed. If the capacity is 0, nothing will be inserted.
        -
        - The amount of allocated memory in the internal buffer may be predictively increased.

        Throws:

        		An allocation error if memory is exhausted (std::bad_alloc if the standard allocator is used). Whatever T::T(const T&) throws.
        -
        17. -
      17. -
        void push_front(rvalue_type item);
        Insert a new element at the beginning of the space optimized circular buffer.

        - - -

        -

        Exception Safety. Basic.

        -

        -

        -

        Iterator Invalidation. Invalidates all iterators pointing to the circular_buffer_space_optimized (except iterators equal to end()).

        -

        -

        -

        Complexity. Linear (in the size of the circular_buffer_space_optimized).

        -

        -

        -

        See Also:

        -

        push_back(const_reference), pop_back(), pop_front()

        -

        -

        -
        ---- - - - - - - - - - - - - - - -

        Parameters:

        ---- - - - - -

        item

        The element to be inserted.

        Postconditions:

        if capacity().capacity() > 0 then front() == item
        - If the circular_buffer_space_optimized is full, the last element will be removed. If the capacity is 0, nothing will be inserted.
        -
        - The amount of allocated memory in the internal buffer may be predictively increased.

        Throws:

        		An allocation error if memory is exhausted (std::bad_alloc if the standard allocator is used). Whatever T::T(const T&) throws or nothing if T::T(T&&) is noexcept.
        -
        18. -
      18. -
        void push_front();
        Insert a new element at the beginning of the space optimized circular buffer.

        - -

        -

        Exception Safety. Basic.

        -

        -

        -

        Iterator Invalidation. Invalidates all iterators pointing to the circular_buffer_space_optimized (except iterators equal to end()).

        -

        -

        -

        Complexity. Linear (in the size of the circular_buffer_space_optimized).

        -

        -

        -

        See Also:

        -

        push_back(const_reference), pop_back(), pop_front()

        -

        -

        -
        ---- - - - - - - - - - - -

        Postconditions:

        if capacity().capacity() > 0 then front() == item
        - If the circular_buffer_space_optimized is full, the last element will be removed. If the capacity is 0, nothing will be inserted.
        -
        - The amount of allocated memory in the internal buffer may be predictively increased.

        Throws:

        		An allocation error if memory is exhausted (std::bad_alloc if the standard allocator is used). Whatever T::T() throws. Whatever T::T(const T&) throws or nothing if T::T(T&&) is noexcept.
        -
        19. -
      19. -
        void pop_back();
        Remove the last element from the space optimized circular buffer.

        - - -

        -

        Exception Safety. Basic.

        -

        -

        -

        Iterator Invalidation. Invalidates all iterators pointing to the circular_buffer_space_optimized (except iterators equal to end()).

        -

        -

        -

        Complexity. Linear (in the size of the circular_buffer_space_optimized).

        -

        -

        -

        See Also:

        -

        pop_front(), push_back(const_reference), push_front(const_reference)

        -

        -

        -
        ---- - - - - - - - - - - - - - - -

        Requires:

        !empty()

        Postconditions:

        The last element is removed from the circular_buffer_space_optimized.
        -
        - The amount of allocated memory in the internal buffer may be predictively decreased.

        Throws:

        		An allocation error if memory is exhausted (std::bad_alloc if the standard allocator is used).
        -
        20. -
      20. -
        void pop_front();
        Remove the first element from the space optimized circular buffer.

        - - -

        -

        Exception Safety. Basic.

        -

        -

        -

        Iterator Invalidation. Invalidates all iterators pointing to the circular_buffer_space_optimized (except iterators equal to end()).

        -

        -

        -

        Complexity. Linear (in the size of the circular_buffer_space_optimized).

        -

        -

        -

        See Also:

        -

        pop_back(), push_back(const_reference), push_front(const_reference)

        -

        -

        -
        ---- - - - - - - - - - - - - - - -

        Requires:

        !empty()

        Postconditions:

        The first element is removed from the circular_buffer_space_optimized.
        -
        - The amount of allocated memory in the internal buffer may be predictively decreased.

        Throws:

        		An allocation error if memory is exhausted (std::bad_alloc if the standard allocator is used).
        -
        21. -
      21. -
        iterator insert(iterator pos, param_value_type item);
        Insert an element at the specified position.

        - - - - -

        -

        Exception Safety. Basic.

        -

        -

        -

        Iterator Invalidation. Invalidates all iterators pointing to the circular_buffer_space_optimized (except iterators equal to end()).

        -

        -

        -

        Complexity. Linear (in the size of the circular_buffer_space_optimized).

        -

        -

        -

        See Also:

        -

        insert(iterator, size_type, value_type), insert(iterator, InputIterator, InputIterator), rinsert(iterator, value_type), rinsert(iterator, size_type, value_type), rinsert(iterator, InputIterator, InputIterator)

        -

        -

        -
        ---- - - - - - - - - - - - - - - - - - - - - - - -

        Parameters:

        ---- - - - - - - - - - - -

        item

        The element to be inserted.

        pos

        An iterator specifying the position where the item will be inserted.

        Requires:

        pos is a valid iterator pointing to the circular_buffer_space_optimized or its end.

        Postconditions:

        The item will be inserted at the position pos.
        - If the circular_buffer_space_optimized is full, the first element will be overwritten. If the circular_buffer_space_optimized is full and the pos points to begin(), then the item will not be inserted. If the capacity is 0, nothing will be inserted.
        -
        - The amount of allocated memory in the internal buffer may be predictively increased.

        Returns:

        Iterator to the inserted element or begin() if the item is not inserted. (See the Effect.)

        Throws:

        		An allocation error if memory is exhausted (std::bad_alloc if the standard allocator is used). Whatever T::T(const T&) throws. Whatever T::operator = (const T&) throws.
        -
        22. -
      22. -
        iterator insert(iterator pos, rvalue_type item);
        Insert an element at the specified position.

        - - - - -

        -

        Exception Safety. Basic.

        -

        -

        -

        Iterator Invalidation. Invalidates all iterators pointing to the circular_buffer_space_optimized (except iterators equal to end()).

        -

        -

        -

        Complexity. Linear (in the size of the circular_buffer_space_optimized).

        -

        -

        -

        See Also:

        -

        insert(iterator, size_type, value_type), insert(iterator, InputIterator, InputIterator), rinsert(iterator, value_type), rinsert(iterator, size_type, value_type), rinsert(iterator, InputIterator, InputIterator)

        -

        -

        -
        ---- - - - - - - - - - - - - - - - - - - - - - - -

        Parameters:

        ---- - - - - - - - - - - -

        item

        The element to be inserted.

        pos

        An iterator specifying the position where the item will be inserted.

        Requires:

        pos is a valid iterator pointing to the circular_buffer_space_optimized or its end.

        Postconditions:

        The item will be inserted at the position pos.
        - If the circular_buffer_space_optimized is full, the first element will be overwritten. If the circular_buffer_space_optimized is full and the pos points to begin(), then the item will not be inserted. If the capacity is 0, nothing will be inserted.
        -
        - The amount of allocated memory in the internal buffer may be predictively increased.

        Returns:

        Iterator to the inserted element or begin() if the item is not inserted. (See the Effect.)

        Throws:

        		An allocation error if memory is exhausted (std::bad_alloc if the standard allocator is used). Whatever T::T(const T&) throws or nothing if T::T(T&&) is noexcept.
        -
        23. -
      23. -
        iterator insert(iterator pos);
        Insert an element at the specified position.

        - - - - -

        -

        Exception Safety. Basic.

        -

        -

        -

        Iterator Invalidation. Invalidates all iterators pointing to the circular_buffer_space_optimized (except iterators equal to end()).

        -

        -

        -

        Complexity. Linear (in the size of the circular_buffer_space_optimized).

        -

        -

        -

        See Also:

        -

        insert(iterator, size_type, value_type), insert(iterator, InputIterator, InputIterator), rinsert(iterator, value_type), rinsert(iterator, size_type, value_type), rinsert(iterator, InputIterator, InputIterator)

        -

        -

        -
        ---- - - - - - - - - - - - - - - - - - - - - - - -

        Parameters:

        ---- - - - - -

        pos

        An iterator specifying the position where the item will be inserted.

        Requires:

        pos is a valid iterator pointing to the circular_buffer_space_optimized or its end.

        Postconditions:

        The item will be inserted at the position pos.
        - If the circular_buffer_space_optimized is full, the first element will be overwritten. If the circular_buffer_space_optimized is full and the pos points to begin(), then the item will not be inserted. If the capacity is 0, nothing will be inserted.
        -
        - The amount of allocated memory in the internal buffer may be predictively increased.

        Returns:

        Iterator to the inserted element or begin() if the item is not inserted. (See the Effect.)

        Throws:

        		An allocation error if memory is exhausted (std::bad_alloc if the standard allocator is used). Whatever T::T() throws. Whatever T::T(const T&) throws or nothing if T::T(T&&) is noexcept.
        -
        24. -
      24. -
        void insert(iterator pos, size_type n, param_value_type item);
        Insert n copies of the item at the specified position.

        - - - -

        -

        Exception Safety. Basic.

        -

        -

        -

        Iterator Invalidation. Invalidates all iterators pointing to the circular_buffer_space_optimized (except iterators equal to end()).

        -

        -

        -

        Complexity. Linear (in min[capacity().capacity(), size() + n]).

        -

        -

        -

        Example. Consider a circular_buffer_space_optimized with the capacity of 6 and the size of 4. Its internal buffer may look like the one below.
        -
        - |1|2|3|4| | |
        - p ___^
        -
        -After inserting 5 elements at the position p:
        -
        - insert(p, (size_t)5, 0);
        -
        -actually only 4 elements get inserted and elements 1 and 2 are overwritten. This is due to the fact the insert operation preserves the capacity. After insertion the internal buffer looks like this:
        -
        -|0|0|0|0|3|4|
        -
        -For comparison if the capacity would not be preserved the internal buffer would then result in |1|2|0|0|0|0|0|3|4|.

        -

        -

        -

        See Also:

        -

        insert(iterator, value_type), insert(iterator, InputIterator, InputIterator), rinsert(iterator, value_type), rinsert(iterator, size_type, value_type), rinsert(iterator, InputIterator, InputIterator)

        -

        -

        -
        ---- - - - - - - - - - - - - - - - - - - -

        Parameters:

        ---- - - - - - - - - - - - - - - -

        item

        The element whose copies will be inserted.

        n

        The number of items the to be inserted.

        pos

        An iterator specifying the position where the items will be inserted.

        Requires:

        pos is a valid iterator pointing to the circular_buffer_space_optimized or its end.

        Postconditions:

        The number of min[n, (pos - begin()) + reserve()] elements will be inserted at the position pos.
        -The number of min[pos - begin(), max[0, n - reserve()]] elements will be overwritten at the beginning of the circular_buffer_space_optimized.
        -(See Example for the explanation.)
        -
        - The amount of allocated memory in the internal buffer may be predictively increased.

        Throws:

        		An allocation error if memory is exhausted (std::bad_alloc if the standard allocator is used). Whatever T::T(const T&) throws. Whatever T::operator = (const T&) throws.
        -
        25. -
      25. -
        template<typename InputIterator> 
-  void insert(iterator pos, InputIterator first, InputIterator last);
        Insert the range [first, last) at the specified position.

        - - - -

        -

        Exception Safety. Basic.

        -

        -

        -

        Iterator Invalidation. Invalidates all iterators pointing to the circular_buffer_space_optimized (except iterators equal to end()).

        -

        -

        -

        Complexity. Linear (in [size() + std::distance(first, last)]; in min[capacity().capacity(), size() + std::distance(first, last)] if the InputIterator is a RandomAccessIterator).

        -

        -

        -

        Example. Consider a circular_buffer_space_optimized with the capacity of 6 and the size of 4. Its internal buffer may look like the one below.
        -
        - |1|2|3|4| | |
        - p ___^
        -
        -After inserting a range of elements at the position p:
        -
        - int array[] = { 5, 6, 7, 8, 9 };
        -insert(p, array, array + 5);
        -
        - actually only elements 6, 7, 8 and 9 from the specified range get inserted and elements 1 and 2 are overwritten. This is due to the fact the insert operation preserves the capacity. After insertion the internal buffer looks like this:
        -
        -|6|7|8|9|3|4|
        -
        -For comparison if the capacity would not be preserved the internal buffer would then result in |1|2|5|6|7|8|9|3|4|.

        -

        -

        -

        See Also:

        -

        insert(iterator, value_type), insert(iterator, size_type, value_type), rinsert(iterator, value_type), rinsert(iterator, size_type, value_type), rinsert(iterator, InputIterator, InputIterator)

        -

        -

        -
        ---- - - - - - - - - - - - - - - - - - - -

        Parameters:

        ---- - - - - - - - - - - - - - - -

        first

        The beginning of the range to be inserted.

        last

        The end of the range to be inserted.

        pos

        An iterator specifying the position where the range will be inserted.

        Requires:

        pos is a valid iterator pointing to the circular_buffer_space_optimized or its end.
        -Valid range [first, last) where first and last meet the requirements of an InputIterator.

        Postconditions:

        Elements from the range [first + max[0, distance(first, last) - (pos - begin()) - reserve()], last) will be inserted at the position pos.
        -The number of min[pos - begin(), max[0, distance(first, last) - reserve()]] elements will be overwritten at the beginning of the circular_buffer_space_optimized.
        -(See Example for the explanation.)
        -
        - The amount of allocated memory in the internal buffer may be predictively increased.

        Throws:

        		An allocation error if memory is exhausted (std::bad_alloc if the standard allocator is used). Whatever T::T(const T&) throws or nothing if T::T(T&&) is noexcept.
        -
        26. -
      26. -
        iterator rinsert(iterator pos, param_value_type item);
        Insert an element before the specified position.

        - - - - -

        -

        Exception Safety. Basic.

        -

        -

        -

        Iterator Invalidation. Invalidates all iterators pointing to the circular_buffer_space_optimized (except iterators equal to end()).

        -

        -

        -

        Complexity. Linear (in the size of the circular_buffer_space_optimized).

        -

        -

        -

        See Also:

        -

        rinsert(iterator, size_type, value_type), rinsert(iterator, InputIterator, InputIterator), insert(iterator, value_type), insert(iterator, size_type, value_type), insert(iterator, InputIterator, InputIterator)

        -

        -

        -
        ---- - - - - - - - - - - - - - - - - - - - - - - -

        Parameters:

        ---- - - - - - - - - - - -

        item

        The element to be inserted.

        pos

        An iterator specifying the position before which the item will be inserted.

        Requires:

        pos is a valid iterator pointing to the circular_buffer_space_optimized or its end.

        Postconditions:

        The item will be inserted before the position pos.
        - If the circular_buffer_space_optimized is full, the last element will be overwritten. If the circular_buffer_space_optimized is full and the pos points to end(), then the item will not be inserted. If the capacity is 0, nothing will be inserted.
        -
        - The amount of allocated memory in the internal buffer may be predictively increased.

        Returns:

        Iterator to the inserted element or end() if the item is not inserted. (See the Effect.)

        Throws:

        		An allocation error if memory is exhausted (std::bad_alloc if the standard allocator is used). Whatever T::T(const T&) throws. Whatever T::operator = (const T&) throws.
        -
        27. -
      27. -
        iterator rinsert(iterator pos, rvalue_type item);
        Insert an element before the specified position.

        - - - - -

        -

        Exception Safety. Basic.

        -

        -

        -

        Iterator Invalidation. Invalidates all iterators pointing to the circular_buffer_space_optimized (except iterators equal to end()).

        -

        -

        -

        Complexity. Linear (in the size of the circular_buffer_space_optimized).

        -

        -

        -

        See Also:

        -

        rinsert(iterator, size_type, value_type), rinsert(iterator, InputIterator, InputIterator), insert(iterator, value_type), insert(iterator, size_type, value_type), insert(iterator, InputIterator, InputIterator)

        -

        -

        -
        ---- - - - - - - - - - - - - - - - - - - - - - - -

        Parameters:

        ---- - - - - - - - - - - -

        item

        The element to be inserted.

        pos

        An iterator specifying the position before which the item will be inserted.

        Requires:

        pos is a valid iterator pointing to the circular_buffer_space_optimized or its end.

        Postconditions:

        The item will be inserted before the position pos.
        - If the circular_buffer_space_optimized is full, the last element will be overwritten. If the circular_buffer_space_optimized is full and the pos points to end(), then the item will not be inserted. If the capacity is 0, nothing will be inserted.
        -
        - The amount of allocated memory in the internal buffer may be predictively increased.

        Returns:

        Iterator to the inserted element or end() if the item is not inserted. (See the Effect.)

        Throws:

        		An allocation error if memory is exhausted (std::bad_alloc if the standard allocator is used). Whatever T::T(const T&) throws or nothing if T::T(T&&) is noexcept.
        -
        28. -
      28. -
        iterator rinsert(iterator pos);
        Insert an element before the specified position.

        - - - - -

        -

        Exception Safety. Basic.

        -

        -

        -

        Iterator Invalidation. Invalidates all iterators pointing to the circular_buffer_space_optimized (except iterators equal to end()).

        -

        -

        -

        Complexity. Linear (in the size of the circular_buffer_space_optimized).

        -

        -

        -

        See Also:

        -

        rinsert(iterator, size_type, value_type), rinsert(iterator, InputIterator, InputIterator), insert(iterator, value_type), insert(iterator, size_type, value_type), insert(iterator, InputIterator, InputIterator)

        -

        -

        -
        ---- - - - - - - - - - - - - - - - - - - - - - - -

        Parameters:

        ---- - - - - -

        pos

        An iterator specifying the position before which the item will be inserted.

        Requires:

        pos is a valid iterator pointing to the circular_buffer_space_optimized or its end.

        Postconditions:

        The item will be inserted before the position pos.
        - If the circular_buffer_space_optimized is full, the last element will be overwritten. If the circular_buffer_space_optimized is full and the pos points to end(), then the item will not be inserted. If the capacity is 0, nothing will be inserted.
        -
        - The amount of allocated memory in the internal buffer may be predictively increased.

        Returns:

        Iterator to the inserted element or end() if the item is not inserted. (See the Effect.)

        Throws:

        		An allocation error if memory is exhausted (std::bad_alloc if the standard allocator is used). Whatever T::T() throws. Whatever T::T(const T&) throws or nothing if T::T(T&&) is noexcept.
        -
        29. -
      29. -
        void rinsert(iterator pos, size_type n, param_value_type item);
        Insert n copies of the item before the specified position.

        - - - -

        -

        Exception Safety. Basic.

        -

        -

        -

        Iterator Invalidation. Invalidates all iterators pointing to the circular_buffer_space_optimized (except iterators equal to end()).

        -

        -

        -

        Complexity. Linear (in min[capacity().capacity(), size() + n]).

        -

        -

        -

        Example. Consider a circular_buffer_space_optimized with the capacity of 6 and the size of 4. Its internal buffer may look like the one below.
        -
        - |1|2|3|4| | |
        - p ___^
        -
        -After inserting 5 elements before the position p:
        -
        - rinsert(p, (size_t)5, 0);
        -
        -actually only 4 elements get inserted and elements 3 and 4 are overwritten. This is due to the fact the rinsert operation preserves the capacity. After insertion the internal buffer looks like this:
        -
        -|1|2|0|0|0|0|
        -
        -For comparison if the capacity would not be preserved the internal buffer would then result in |1|2|0|0|0|0|0|3|4|.

        -

        -

        -

        See Also:

        -

        rinsert(iterator, value_type), rinsert(iterator, InputIterator, InputIterator), insert(iterator, value_type), insert(iterator, size_type, value_type), insert(iterator, InputIterator, InputIterator)

        -

        -

        -
        ---- - - - - - - - - - - - - - - - - - - -

        Parameters:

        ---- - - - - - - - - - - - - - - -

        item

        The element whose copies will be inserted.

        n

        The number of items the to be inserted.

        pos

        An iterator specifying the position where the items will be inserted.

        Requires:

        pos is a valid iterator pointing to the circular_buffer_space_optimized or its end.

        Postconditions:

        The number of min[n, (end() - pos) + reserve()] elements will be inserted before the position pos.
        -The number of min[end() - pos, max[0, n - reserve()]] elements will be overwritten at the end of the circular_buffer_space_optimized.
        -(See Example for the explanation.)
        -
        - The amount of allocated memory in the internal buffer may be predictively increased.

        Throws:

        		An allocation error if memory is exhausted (std::bad_alloc if the standard allocator is used). Whatever T::T(const T&) throws. Whatever T::operator = (const T&) throws.
        -
        30. -
      30. -
        template<typename InputIterator> 
-  void rinsert(iterator pos, InputIterator first, InputIterator last);
        Insert the range [first, last) before the specified position.

        - - - -

        -

        Exception Safety. Basic.

        -

        -

        -

        Iterator Invalidation. Invalidates all iterators pointing to the circular_buffer_space_optimized (except iterators equal to end()).

        -

        -

        -

        Complexity. Linear (in [size() + std::distance(first, last)]; in min[capacity().capacity(), size() + std::distance(first, last)] if the InputIterator is a RandomAccessIterator).

        -

        -

        -

        Example. Consider a circular_buffer_space_optimized with the capacity of 6 and the size of 4. Its internal buffer may look like the one below.
        -
        - |1|2|3|4| | |
        - p ___^
        -
        -After inserting a range of elements before the position p:
        -
        - int array[] = { 5, 6, 7, 8, 9 };
        -insert(p, array, array + 5);
        -
        - actually only elements 5, 6, 7 and 8 from the specified range get inserted and elements 3 and 4 are overwritten. This is due to the fact the rinsert operation preserves the capacity. After insertion the internal buffer looks like this:
        -
        -|1|2|5|6|7|8|
        -
        -For comparison if the capacity would not be preserved the internal buffer would then result in |1|2|5|6|7|8|9|3|4|.

        -

        -

        -

        See Also:

        -

        rinsert(iterator, value_type), rinsert(iterator, size_type, value_type), insert(iterator, value_type), insert(iterator, size_type, value_type), insert(iterator, InputIterator, InputIterator)

        -

        -

        -
        ---- - - - - - - - - - - - - - - - - - - -

        Parameters:

        ---- - - - - - - - - - - - - - - -

        first

        The beginning of the range to be inserted.

        last

        The end of the range to be inserted.

        pos

        An iterator specifying the position where the range will be inserted.

        Requires:

        pos is a valid iterator pointing to the circular_buffer_space_optimized or its end.
        - Valid range [first, last) where first and last meet the requirements of an InputIterator.

        Postconditions:

        Elements from the range [first, last - max[0, distance(first, last) - (end() - pos) - reserve()]) will be inserted before the position pos.
        -The number of min[end() - pos, max[0, distance(first, last) - reserve()]] elements will be overwritten at the end of the circular_buffer.
        -(See Example for the explanation.)
        -
        - The amount of allocated memory in the internal buffer may be predictively increased.

        Throws:

        		An allocation error if memory is exhausted (std::bad_alloc if the standard allocator is used). Whatever T::T(const T&) throws. Whatever T::operator = (const T&) throws.
        -
        31. -
      31. -
        iterator erase(iterator pos);
        Remove an element at the specified position.

        - - - - -

        -

        Exception Safety. Basic.

        -

        -

        -

        Iterator Invalidation. Invalidates all iterators pointing to the circular_buffer_space_optimized (except iterators equal to end()).

        -

        -

        -

        Complexity. Linear (in the size of the circular_buffer_space_optimized).

        -

        -

        -

        See Also:

        -

        erase(iterator, iterator), rerase(iterator), rerase(iterator, iterator), clear()

        -

        -

        -
        ---- - - - - - - - - - - - - - - - - - - - - - - -

        Parameters:

        ---- - - - - -

        pos

        An iterator pointing at the element to be removed.

        Requires:

        pos is a valid iterator pointing to the circular_buffer_space_optimized (but not an end()).

        Postconditions:

        The element at the position pos is removed.
        -
        - The amount of allocated memory in the internal buffer may be predictively decreased.

        Returns:

        Iterator to the first element remaining beyond the removed element or end() if no such element exists.

        Throws:

        		An allocation error if memory is exhausted (std::bad_alloc if the standard allocator is used). Whatever T::operator = (const T&) throws or nothing if T::operator = (T&&) is noexcept.
        -
        32. -
      32. -
        iterator erase(iterator first, iterator last);
        Erase the range [first, last).

        - - - - -

        -

        Exception Safety. Basic.

        -

        -

        -

        Iterator Invalidation. Invalidates all iterators pointing to the circular_buffer_space_optimized (except iterators equal to end()).

        -

        -

        -

        Complexity. Linear (in the size of the circular_buffer_space_optimized).

        -

        -

        -

        See Also:

        -

        erase(iterator), rerase(iterator), rerase(iterator, iterator), clear()

        -

        -

        -
        ---- - - - - - - - - - - - - - - - - - - - - - - -

        Parameters:

        ---- - - - - - - - - - - -

        first

        The beginning of the range to be removed.

        last

        The end of the range to be removed.

        Requires:

        Valid range [first, last).

        Postconditions:

        The elements from the range [first, last) are removed. (If first == last nothing is removed.)
        -
        - The amount of allocated memory in the internal buffer may be predictively decreased.

        Returns:

        Iterator to the first element remaining beyond the removed elements or end() if no such element exists.

        Throws:

        		An allocation error if memory is exhausted (std::bad_alloc if the standard allocator is used). Whatever T::operator = (const T&) throws or nothing if T::operator = (T&&) is noexcept.
        -
        33. -
      33. -
        iterator rerase(iterator pos);
        Remove an element at the specified position.

        - - - - -

        -

        Exception Safety. Basic.

        -

        -

        -

        Iterator Invalidation. Invalidates all iterators pointing to the circular_buffer_space_optimized (except iterators equal to end()).

        -

        -

        -

        Complexity. Linear (in the size of the circular_buffer_space_optimized).

        -

        -

        -
        - - - - - -
        [Note]Note

        Basically there is no difference between erase(iterator) and this method. It is implemented only for consistency with the base circular_buffer.

        -

        -

        -

        See Also:

        -

        erase(iterator), erase(iterator, iterator), rerase(iterator, iterator), clear()

        -

        -

        -
        ---- - - - - - - - - - - - - - - - - - - - - - - -

        Parameters:

        ---- - - - - -

        pos

        An iterator pointing at the element to be removed.

        Requires:

        pos is a valid iterator pointing to the circular_buffer_space_optimized (but not an end()).
        -
        - The amount of allocated memory in the internal buffer may be predictively decreased.

        Postconditions:

        The element at the position pos is removed.

        Returns:

        Iterator to the first element remaining in front of the removed element or begin() if no such element exists.

        Throws:

        		An allocation error if memory is exhausted (std::bad_alloc if the standard allocator is used). Whatever T::operator = (const T&) throws or nothing if T::operator = (T&&) is noexcept.
        -
        34. -
      34. -
        iterator rerase(iterator first, iterator last);
        Erase the range [first, last).

        - - - - -

        -

        Exception Safety. Basic.

        -

        -

        -

        Iterator Invalidation. Invalidates all iterators pointing to the circular_buffer_space_optimized (except iterators equal to end()).

        -

        -

        -

        Complexity. Linear (in the size of the circular_buffer_space_optimized).

        -

        -

        -
        - - - - - -
        [Note]Note

        Basically there is no difference between erase(iterator, iterator) and this method. It is implemented only for consistency with the base <circular_buffer.

        -

        -

        -

        See Also:

        -

        erase(iterator), erase(iterator, iterator), rerase(iterator), clear()

        -

        -

        -
        ---- - - - - - - - - - - - - - - - - - - - - - - -

        Parameters:

        ---- - - - - - - - - - - -

        first

        The beginning of the range to be removed.

        last

        The end of the range to be removed.

        Requires:

        Valid range [first, last).

        Postconditions:

        The elements from the range [first, last) are removed. (If first == last nothing is removed.)
        -
        - The amount of allocated memory in the internal buffer may be predictively decreased.

        Returns:

        Iterator to the first element remaining in front of the removed elements or begin() if no such element exists.

        Throws:

        		An allocation error if memory is exhausted (std::bad_alloc if the standard allocator is used). Whatever T::operator = (const T&) throws or nothing if T::operator = (T&&) is noexcept.
        -
        35. -
      35. -
        void clear();
        Remove all stored elements from the space optimized circular buffer.

        - -

        -

        Exception Safety. Basic.

        -

        -

        -

        Iterator Invalidation. Invalidates all iterators pointing to the circular_buffer_space_optimized (except iterators equal to end()).

        -

        -

        -

        Complexity. Linear (in the size of the circular_buffer_space_optimized).

        -

        -

        -

        See Also:

        -

        ~circular_buffer_space_optimized(), erase(iterator), erase(iterator, iterator), rerase(iterator), rerase(iterator, iterator)

        -

        -

        -
        ---- - - - - - - - - - - -

        Postconditions:

        size() == 0
        -
        - The amount of allocated memory in the internal buffer may be predictively decreased.

        Throws:

        		An allocation error if memory is exhausted (std::bad_alloc if the standard allocator is used).
        -
        36. -
      -
      -
      -

      -circular_buffer_space_optimized private member functions

      -
        -
      1. -
        void adjust_min_capacity();
        Adjust the amount of allocated memory.
        2. -
      2. -
        size_type ensure_reserve(size_type new_capacity, size_type buffer_size) const;
        Ensure the reserve for possible growth up.
        3. -
      3. -
        void check_low_capacity(size_type n = 1);
        Check for low capacity.
        4. -
      4. -
        void check_high_capacity();
        Check for high capacity.
        5. -
      5. -
        void reduce_capacity(const true_type &);
        Specialized method for reducing the capacity.
        6. -
      6. -
        void reduce_capacity(const false_type &);
        Specialized method for reducing the capacity.
        7. -
      7. -
        template<typename IntegralType> 
-  void insert(const iterator & pos, IntegralType n, IntegralType item, 
-              const true_type &);
        Specialized insert method.
        8. -
      8. -
        template<typename Iterator> 
-  void insert(const iterator & pos, Iterator first, Iterator last, 
-              const false_type &);
        Specialized insert method.
        9. -
      9. -
        template<typename IntegralType> 
-  void rinsert(const iterator & pos, IntegralType n, IntegralType item, 
-               const true_type &);
        Specialized rinsert method.
        10. -
      10. -
        template<typename Iterator> 
-  void rinsert(const iterator & pos, Iterator first, Iterator last, 
-               const false_type &);
        Specialized rinsert method.
        11. -
      -
      -
      -

      -circular_buffer_space_optimized private static functions

      -
        -
      1. -
        static size_type 
-init_capacity(const capacity_type & capacity_ctrl, size_type n);
        Determine the initial capacity.
        2. -
      2. -
        template<typename IntegralType> 
-  static size_type 
-  init_capacity(const capacity_type & capacity_ctrl, IntegralType n, 
-                IntegralType, const true_type &);
        Specialized method for determining the initial capacity.
        3. -
      3. -
        template<typename Iterator> 
-  static size_type 
-  init_capacity(const capacity_type & capacity_ctrl, Iterator first, 
-                Iterator last, const false_type &);
        Specialized method for determining the initial capacity.
        4. -
      4. -
        template<typename InputIterator> 
-  static size_type 
-  init_capacity(const capacity_type & capacity_ctrl, InputIterator, 
-                InputIterator, const std::input_iterator_tag &);
        Specialized method for determining the initial capacity.
        5. -
      5. -
        template<typename ForwardIterator> 
-  static size_type 
-  init_capacity(const capacity_type & capacity_ctrl, ForwardIterator first, 
-                ForwardIterator last, const std::forward_iterator_tag &);
        Specialized method for determining the initial capacity.
        6. -
      -
      -
      -
      - - - -
      Copyright © 2003-2013 Jan Gaspar

      - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

      -
      -
      -
      -PrevUpHomeNext -
      - - diff --git a/doc/html/boost/circular_buffe_idp43443760.html b/doc/html/boost/circular_buffe_idp43443760.html new file mode 100644 index 0000000000..1a92b2bee5 --- /dev/null +++ b/doc/html/boost/circular_buffe_idp43443760.html @@ -0,0 +1,2828 @@ + + + + +Class template circular_buffer_space_optimized + + + + + + + + + + + + + + + +
      Boost C++ LibrariesHomeLibrariesPeopleFAQMore
      +
      +
      +PrevUpHomeNext +
      +
      +
      +
      +

      Class template circular_buffer_space_optimized

      +

      boost::circular_buffer_space_optimized — Space optimized circular buffer container adaptor. T must be a copyable class or must have an noexcept move constructor and move assignment operator.

      +
      +

      Synopsis

      +
      // In header: <boost/circular_buffer/space_optimized.hpp>
+
+template<typename T, typename Alloc> 
+class circular_buffer_space_optimized :
+  private boost::circular_buffer< T, Alloc >
+{
+public:
+  // types
+  typedef circular_buffer< T, Alloc >::value_type             value_type;            
+  typedef circular_buffer< T, Alloc >::pointer                pointer;               
+  typedef circular_buffer< T, Alloc >::const_pointer          const_pointer;         
+  typedef circular_buffer< T, Alloc >::reference              reference;             
+  typedef circular_buffer< T, Alloc >::const_reference        const_reference;       
+  typedef circular_buffer< T, Alloc >::size_type              size_type;             
+  typedef circular_buffer< T, Alloc >::difference_type        difference_type;       
+  typedef circular_buffer< T, Alloc >::allocator_type         allocator_type;        
+  typedef circular_buffer< T, Alloc >::const_iterator         const_iterator;        
+  typedef circular_buffer< T, Alloc >::iterator               iterator;              
+  typedef circular_buffer< T, Alloc >::const_reverse_iterator const_reverse_iterator;
+  typedef circular_buffer< T, Alloc >::reverse_iterator       reverse_iterator;      
+  typedef circular_buffer< T, Alloc >::array_range            array_range;           
+  typedef circular_buffer< T, Alloc >::const_array_range      const_array_range;     
+  typedef circular_buffer< T, Alloc >::param_value_type       param_value_type;      
+  typedef circular_buffer< T, Alloc >::rvalue_type            rvalue_type;           
+  typedef cb_details::capacity_control< size_type >           capacity_type;         
+
+  // construct/copy/destruct
+  explicit circular_buffer_space_optimized(const allocator_type & = allocator_type()) noexcept;
+  explicit circular_buffer_space_optimized(capacity_type, 
+                                           const allocator_type & = allocator_type());
+  circular_buffer_space_optimized(capacity_type, param_value_type, 
+                                  const allocator_type & = allocator_type());
+  circular_buffer_space_optimized(capacity_type, size_type, param_value_type, 
+                                  const allocator_type & = allocator_type());
+  circular_buffer_space_optimized(const circular_buffer_space_optimized< T, Alloc > &);
+  circular_buffer_space_optimized(circular_buffer_space_optimized< T, Alloc > &&) noexcept;
+  template<typename InputIterator> 
+    circular_buffer_space_optimized(InputIterator, InputIterator, 
+                                    const allocator_type & = allocator_type());
+  template<typename InputIterator> 
+    circular_buffer_space_optimized(capacity_type, InputIterator, 
+                                    InputIterator, 
+                                    const allocator_type & = allocator_type());
+  circular_buffer_space_optimized< T, Alloc > & 
+  operator=(const circular_buffer_space_optimized< T, Alloc > &);
+  circular_buffer_space_optimized< T, Alloc > & 
+  operator=(circular_buffer_space_optimized< T, Alloc > &&) noexcept;
+
+  // public member functions
+  bool full() const noexcept;
+  size_type reserve() const noexcept;
+  const capacity_type & capacity() const noexcept;
+  void set_capacity(const capacity_type &);
+  void resize(size_type, param_value_type = value_type());
+  void rset_capacity(const capacity_type &);
+  void rresize(size_type, param_value_type = value_type());
+  void assign(size_type, param_value_type);
+  void assign(capacity_type, size_type, param_value_type);
+  template<typename InputIterator> void assign(InputIterator, InputIterator);
+  template<typename InputIterator> 
+    void assign(capacity_type, InputIterator, InputIterator);
+  void swap(circular_buffer_space_optimized< T, Alloc > &) noexcept;
+  void push_back(param_value_type);
+  void push_back(rvalue_type);
+  void push_back();
+  void push_front(param_value_type);
+  void push_front(rvalue_type);
+  void push_front();
+  void pop_back();
+  void pop_front();
+  iterator insert(iterator, param_value_type);
+  iterator insert(iterator, rvalue_type);
+  iterator insert(iterator);
+  void insert(iterator, size_type, param_value_type);
+  template<typename InputIterator> 
+    void insert(iterator, InputIterator, InputIterator);
+  iterator rinsert(iterator, param_value_type);
+  iterator rinsert(iterator, rvalue_type);
+  iterator rinsert(iterator);
+  void rinsert(iterator, size_type, param_value_type);
+  template<typename InputIterator> 
+    void rinsert(iterator, InputIterator, InputIterator);
+  iterator erase(iterator);
+  iterator erase(iterator, iterator);
+  iterator rerase(iterator);
+  iterator rerase(iterator, iterator);
+  void clear();
+
+  // private member functions
+  void adjust_min_capacity();
+  size_type ensure_reserve(size_type, size_type) const;
+  void check_low_capacity(size_type = 1);
+  void check_high_capacity();
+  void reduce_capacity(const true_type &);
+  void reduce_capacity(const false_type &);
+  template<typename IntegralType> 
+    void insert(const iterator &, IntegralType, IntegralType, 
+                const true_type &);
+  template<typename Iterator> 
+    void insert(const iterator &, Iterator, Iterator, const false_type &);
+  template<typename IntegralType> 
+    void rinsert(const iterator &, IntegralType, IntegralType, 
+                 const true_type &);
+  template<typename Iterator> 
+    void rinsert(const iterator &, Iterator, Iterator, const false_type &);
+
+  // private static functions
+  static size_type init_capacity(const capacity_type &, size_type);
+  template<typename IntegralType> 
+    static size_type 
+    init_capacity(const capacity_type &, IntegralType, IntegralType, 
+                  const true_type &);
+  template<typename Iterator> 
+    static size_type 
+    init_capacity(const capacity_type &, Iterator, Iterator, 
+                  const false_type &);
+  template<typename InputIterator> 
+    static size_type 
+    init_capacity(const capacity_type &, InputIterator, InputIterator, 
+                  const std::input_iterator_tag &);
+  template<typename ForwardIterator> 
+    static size_type 
+    init_capacity(const capacity_type &, ForwardIterator, ForwardIterator, 
+                  const std::forward_iterator_tag &);
+};
      +
      +

      Description

      +
      +

      +circular_buffer_space_optimized + public + types

      +
      1. +

        +typedef cb_details::capacity_control< size_type > capacity_type;

        +

        Capacity controller of the space optimized circular buffer.

        +

        See Also:

        +

        capacity_control in details.hpp.

        +

        + class capacity_control
        + {
        + size_type m_capacity; // Available capacity.
        + size_type m_min_capacity; // Minimum capacity.
        + public:
        + capacity_control(size_type capacity, size_type min_capacity = 0)
        + : m_capacity(capacity), m_min_capacity(min_capacity)
        + {};
        + size_type capacity() const { return m_capacity; }
        + size_type min_capacity() const { return m_min_capacity; }
        + operator size_type() const { return m_capacity; }
        + };
        +

        +

        Always capacity >= min_capacity.

        +

        The capacity() represents the capacity of the circular_buffer_space_optimized and the min_capacity() determines the minimal allocated size of its internal buffer.

        +

        The converting constructor of the capacity_control allows implicit conversion from size_type-like types which ensures compatibility of creating an instance of the circular_buffer_space_optimized with other STL containers.

        +

        On the other hand the operator size_type() provides implicit conversion to the size_type which allows to treat the capacity of the circular_buffer_space_optimized the same way as in the circular_buffer.

        +
      +
      +
      +

      +circular_buffer_space_optimized + public + construct/copy/destruct

      +
        +
      1. +
        explicit circular_buffer_space_optimized(const allocator_type & alloc = allocator_type()) noexcept;
        Create an empty space optimized circular buffer with zero capacity.

        + + +

        +

        Complexity. Constant.

        +

        +

        +
        + + + + + +
        [Warning]Warning

        Since Boost version 1.36 the behaviour of this constructor has changed. Now it creates a space optimized circular buffer with zero capacity.

        +

        +

        +
        ++++ + + + + + + + + + + + + + + +

        Parameters:

        ++++ + + + + +

        alloc

        The allocator.

        Postconditions:

        capacity().capacity() == 0 && capacity().min_capacity() == 0 && size() == 0

        Throws:

        		Nothing.
        +
        2. +
      2. +
        explicit circular_buffer_space_optimized(capacity_type capacity_ctrl, 
+                                         const allocator_type & alloc = allocator_type());
        Create an empty space optimized circular buffer with the specified capacity.

        + + +

        +

        Complexity. Constant.

        +

        +

        +
        ++++ + + + + + + + + + + + + + + +

        Parameters:

        ++++ + + + + + + + + + + +

        alloc

        The allocator.

        capacity_ctrl

        The capacity controller representing the maximum number of elements which can be stored in the circular_buffer_space_optimized and the minimal allocated size of the internal buffer.

        Postconditions:

        capacity() == capacity_ctrl && size() == 0
        +
        + The amount of allocated memory in the internal buffer is capacity_ctrl.min_capacity().

        Throws:

        		An allocation error if memory is exhausted (std::bad_alloc if the standard allocator is used).
        +
        3. +
      3. +
        circular_buffer_space_optimized(capacity_type capacity_ctrl, 
+                                param_value_type item, 
+                                const allocator_type & alloc = allocator_type());
        Create a full space optimized circular buffer with the specified capacity filled with capacity_ctrl.capacity() copies of item.

        + + +

        +

        Complexity. Linear (in the capacity_ctrl.capacity()).

        +

        +

        +
        ++++ + + + + + + + + + + + + + + +

        Parameters:

        ++++ + + + + + + + + + + + + + + +

        alloc

        The allocator.

        capacity_ctrl

        The capacity controller representing the maximum number of elements which can be stored in the circular_buffer_space_optimized and the minimal allocated size of the internal buffer.

        item

        The element the created circular_buffer_space_optimized will be filled with.

        Postconditions:

        capacity() == capacity_ctrl && full() && (*this)[0] == item && (*this)[1] == item && ... && (*this) [capacity_ctrl.capacity() - 1] == item
        +
        + The amount of allocated memory in the internal buffer is capacity_ctrl.capacity().

        Throws:

        		An allocation error if memory is exhausted (std::bad_alloc if the standard allocator is used). T::T(const T&) throws.
        +
        4. +
      4. +
        circular_buffer_space_optimized(capacity_type capacity_ctrl, size_type n, 
+                                param_value_type item, 
+                                const allocator_type & alloc = allocator_type());
        Create a space optimized circular buffer with the specified capacity filled with n copies of item.

        + + + +

        +

        Complexity. Linear (in the n).

        +

        +

        +
        ++++ + + + + + + + + + + + + + + + + + + +

        Parameters:

        ++++ + + + + + + + + + + + + + + + + + + +

        alloc

        The allocator.

        capacity_ctrl

        The capacity controller representing the maximum number of elements which can be stored in the circular_buffer_space_optimized and the minimal allocated size of the internal buffer.

        item

        The element the created circular_buffer_space_optimized will be filled with.

        n

        The number of elements the created circular_buffer_space_optimized will be filled with.

        Requires:

        capacity_ctrl.capacity() >= n

        Postconditions:

        capacity() == capacity_ctrl && size() == n && (*this)[0] == item && (*this)[1] == item && ... && (*this)[n - 1] == item
        +
        + The amount of allocated memory in the internal buffer is max[n, capacity_ctrl.min_capacity()].

        Throws:

        		An allocation error if memory is exhausted (std::bad_alloc if the standard allocator is used). Whatever T::T(const T&) throws.
        +
        5. +
      5. +
        circular_buffer_space_optimized(const circular_buffer_space_optimized< T, Alloc > & cb);
        The copy constructor.

        Creates a copy of the specified circular_buffer_space_optimized. + + +

        +

        Complexity. Linear (in the size of cb).

        +

        +

        +
        ++++ + + + + + + + + + + + + + + +

        Parameters:

        ++++ + + + + +

        cb

        The circular_buffer_space_optimized to be copied.

        Postconditions:

        *this == cb
        +
        + The amount of allocated memory in the internal buffer is cb.size().

        Throws:

        		An allocation error if memory is exhausted (std::bad_alloc if the standard allocator is used). Whatever T::T(const T&) throws.
        +
        6. +
      6. +
        circular_buffer_space_optimized(circular_buffer_space_optimized< T, Alloc > && cb) noexcept;
        The move constructor.

        Move constructs a circular_buffer_space_optimized from cb, leaving cb empty. + + + +

        +

        Constant. 

        +

        +

        +
        ++++ + + + + + + + + + + + + + + + + + + +

        Parameters:

        ++++ + + + + +

        cb

        circular_buffer to 'steal' value from.

        Requires:

        C++ compiler with rvalue references support.

        Postconditions:

        cb.empty()

        Throws:

        		Nothing.
        +
        7. +
      7. +
        template<typename InputIterator> 
+  circular_buffer_space_optimized(InputIterator first, InputIterator last, 
+                                  const allocator_type & alloc = allocator_type());
        Create a full space optimized circular buffer filled with a copy of the range.

        + + + +

        +

        Complexity. Linear (in the std::distance(first, last)).

        +

        +

        +
        ++++ + + + + + + + + + + + + + + + + + + +

        Parameters:

        ++++ + + + + + + + + + + + + + + +

        alloc

        The allocator.

        first

        The beginning of the range to be copied.

        last

        The end of the range to be copied.

        Requires:

        Valid range [first, last).
        + first and last have to meet the requirements of InputIterator.

        Postconditions:

        capacity().capacity() == std::distance(first, last) && capacity().min_capacity() == 0 && full() && (*this)[0]== *first && (*this)[1] == *(first + 1) && ... && (*this)[std::distance(first, last) - 1] == *(last - 1)
        +
        + The amount of allocated memory in the internal buffer is std::distance(first, last).

        Throws:

        		An allocation error if memory is exhausted (std::bad_alloc if the standard allocator is used). Whatever T::T(const T&) throws or nothing if T::T(T&&) is noexcept and InputIterator is a move iterator.
        +
        8. +
      8. +
        template<typename InputIterator> 
+  circular_buffer_space_optimized(capacity_type capacity_ctrl, 
+                                  InputIterator first, InputIterator last, 
+                                  const allocator_type & alloc = allocator_type());
        Create a space optimized circular buffer with the specified capacity (and the minimal guaranteed amount of allocated memory) filled with a copy of the range.

        + + + +

        +

        Complexity. Linear (in std::distance(first, last); in min[capacity_ctrl.capacity(), std::distance(first, last)] if the InputIterator is a RandomAccessIterator).

        +

        +

        +
        ++++ + + + + + + + + + + + + + + + + + + +

        Parameters:

        ++++ + + + + + + + + + + + + + + + + + + +

        alloc

        The allocator.

        capacity_ctrl

        The capacity controller representing the maximum number of elements which can be stored in the circular_buffer_space_optimized and the minimal allocated size of the internal buffer.

        first

        The beginning of the range to be copied.

        last

        The end of the range to be copied.

        Requires:

        Valid range [first, last).
        + first and last have to meet the requirements of InputIterator.

        Postconditions:

        capacity() == capacity_ctrl && size() <= std::distance(first, last) && (*this)[0]== (last - capacity_ctrl.capacity()) && (*this)[1] == *(last - capacity_ctrl.capacity() + 1) && ... && (*this)[capacity_ctrl.capacity() - 1] == *(last - 1)
        +
        + If the number of items to be copied from the range [first, last) is greater than the specified capacity_ctrl.capacity() then only elements from the range [last - capacity_ctrl.capacity(), last) will be copied.
        +
        + The amount of allocated memory in the internal buffer is max[capacity_ctrl.min_capacity(), min[capacity_ctrl.capacity(), std::distance(first, last)]].

        Throws:

        		An allocation error if memory is exhausted (std::bad_alloc if the standard allocator is used). Whatever T::T(const T&) throws.
        +
        9. +
      9. +
        circular_buffer_space_optimized< T, Alloc > & 
+operator=(const circular_buffer_space_optimized< T, Alloc > & cb);
        The assign operator.

        Makes this circular_buffer_space_optimized to become a copy of the specified circular_buffer_space_optimized. + + +

        +

        Exception Safety. Strong.

        +

        +

        +

        Iterator Invalidation. Invalidates all iterators pointing to this circular_buffer_space_optimized (except iterators equal to end()).

        +

        +

        +

        Complexity. Linear (in the size of cb).

        +

        +

        +

        See Also:

        +

        assign(size_type, const_reference), assign(capacity_type, size_type, const_reference), assign(InputIterator, InputIterator), assign(capacity_type, InputIterator, InputIterator)

        +

        +

        +
        ++++ + + + + + + + + + + + + + + +

        Parameters:

        ++++ + + + + +

        cb

        The circular_buffer_space_optimized to be copied.

        Postconditions:

        *this == cb
        +
        + The amount of allocated memory in the internal buffer is cb.size().

        Throws:

        		An allocation error if memory is exhausted (std::bad_alloc if the standard allocator is used). T::T(const T&) throws.
        +
        10. +
      10. +
        circular_buffer_space_optimized< T, Alloc > & 
+operator=(circular_buffer_space_optimized< T, Alloc > && cb) noexcept;
        Move assigns content of cb to *this, leaving cb empty.

        + + + +

        +

        Complexity. Constant.

        +

        +

        +
        ++++ + + + + + + + + + + + + + + + + + + +

        Parameters:

        ++++ + + + + +

        cb

        circular_buffer to 'steal' value from.

        Requires:

        C++ compiler with rvalue references support.

        Postconditions:

        cb.empty()

        Throws:

        		Nothing.
        +
        11. +
      +
      +
      +

      +circular_buffer_space_optimized public member functions

      +
        +
      1. +
        bool full() const noexcept;
        Is the circular_buffer_space_optimized full?

        + +

        +

        Exception Safety. No-throw.

        +

        +

        +

        Iterator Invalidation. Does not invalidate any iterators.

        +

        +

        +

        Complexity. Constant (in the size of the circular_buffer_space_optimized).

        +

        +

        +

        See Also:

        +

        empty()

        +

        +

        +
        ++++ + + + + + + + + + + +

        Returns:

        true if the number of elements stored in the circular_buffer_space_optimized equals the capacity of the circular_buffer_space_optimized; false otherwise.

        Throws:

        		Nothing.
        +
        2. +
      2. +
        size_type reserve() const noexcept;
        Get the maximum number of elements which can be inserted into the circular_buffer_space_optimized without overwriting any of already stored elements.

        + +

        +

        Exception Safety. No-throw.

        +

        +

        +

        Iterator Invalidation. Does not invalidate any iterators.

        +

        +

        +

        Complexity. Constant (in the size of the circular_buffer_space_optimized).

        +

        +

        +

        See Also:

        +

        capacity(), size(), max_size()

        +

        +

        +
        ++++ + + + + + + + + + + +

        Returns:

        capacity().capacity() - size()

        Throws:

        		Nothing.
        +
        3. +
      3. +
        const capacity_type & capacity() const noexcept;
        Get the capacity of the circular_buffer_space_optimized.

        + +

        +

        Exception Safety. No-throw.

        +

        +

        +

        Iterator Invalidation. Does not invalidate any iterators.

        +

        +

        +

        Complexity. Constant (in the size of the circular_buffer_space_optimized).

        +

        +

        +

        See Also:

        +

        reserve(), size(), max_size(), set_capacity(const capacity_type&)

        +

        +

        +
        ++++ + + + + + + + + + + +

        Returns:

        The capacity controller representing the maximum number of elements which can be stored in the circular_buffer_space_optimized and the minimal allocated size of the internal buffer.

        Throws:

        		Nothing.
        +
        4. +
      4. +
        void set_capacity(const capacity_type & capacity_ctrl);
        Change the capacity (and the minimal guaranteed amount of allocated memory) of the circular_buffer_space_optimized.

        + + +

        +

        Exception Safety. Strong.

        +

        +

        +

        Iterator Invalidation. Invalidates all iterators pointing to the circular_buffer_space_optimized (except iterators equal to end()).

        +

        +

        +

        Complexity. Linear (in min[size(), capacity_ctrl.capacity()]).

        +

        +

        +
        + + + + + +
        [Note]Note

        To explicitly clear the extra allocated memory use the shrink-to-fit technique:
        +
        + boost::circular_buffer_space_optimized<int> cb(1000);
        + ...
        + boost::circular_buffer_space_optimized<int>(cb).swap(cb);
        +
        + For more information about the shrink-to-fit technique in STL see http://www.gotw.ca/gotw/054.htm.

        +

        +

        +

        See Also:

        +

        rset_capacity(const capacity_type&), resize(size_type, const_reference)

        +

        +

        +
        ++++ + + + + + + + + + + + + + + +

        Parameters:

        ++++ + + + + +

        capacity_ctrl

        The new capacity controller.

        Postconditions:

        capacity() == capacity_ctrl && size() <= capacity_ctrl.capacity()
        +
        + If the current number of elements stored in the circular_buffer_space_optimized is greater than the desired new capacity then number of [size() - capacity_ctrl.capacity()] last elements will be removed and the new size will be equal to capacity_ctrl.capacity().
        +
        + If the current number of elements stored in the circular_buffer_space_optimized is lower than the new capacity then the amount of allocated memory in the internal buffer may be accommodated as necessary but it will never drop below capacity_ctrl.min_capacity().

        Throws:

        		An allocation error if memory is exhausted, (std::bad_alloc if the standard allocator is used). Whatever T::T(const T&) throws or nothing if T::T(T&&) is noexcept.
        +
        5. +
      5. +
        void resize(size_type new_size, param_value_type item = value_type());
        Change the size of the circular_buffer_space_optimized.

        + + +

        +

        Exception Safety. Basic.

        +

        +

        +

        Iterator Invalidation. Invalidates all iterators pointing to the circular_buffer_space_optimized (except iterators equal to end()).

        +

        +

        +

        Complexity. Linear (in the new size of the circular_buffer_space_optimized).

        +

        +

        +

        See Also:

        +

        rresize(size_type, const_reference), set_capacity(const capacity_type&)

        +

        +

        +
        ++++ + + + + + + + + + + + + + + +

        Parameters:

        ++++ + + + + + + + + + + +

        item

        The element the circular_buffer_space_optimized will be filled with in order to gain the requested size. (See the Effect.)

        new_size

        The new size.

        Postconditions:

        size() == new_size && capacity().capacity() >= new_size
        +
        + If the new size is greater than the current size, copies of item will be inserted at the back of the of the circular_buffer_space_optimized in order to achieve the desired size. In the case the resulting size exceeds the current capacity the capacity will be set to new_size.
        +
        + If the current number of elements stored in the circular_buffer_space_optimized is greater than the desired new size then number of [size() - new_size] last elements will be removed. (The capacity will remain unchanged.)
        +
        + The amount of allocated memory in the internal buffer may be accommodated as necessary.

        Throws:

        		An allocation error if memory is exhausted (std::bad_alloc if the standard allocator is used). Whatever T::T(const T&) throws.
        +
        6. +
      6. +
        void rset_capacity(const capacity_type & capacity_ctrl);
        Change the capacity (and the minimal guaranteed amount of allocated memory) of the circular_buffer_space_optimized.

        + + +

        +

        Exception Safety. Strong.

        +

        +

        +

        Iterator Invalidation. Invalidates all iterators pointing to the circular_buffer_space_optimized (except iterators equal to end()).

        +

        +

        +

        Complexity. Linear (in min[size(), capacity_ctrl.capacity()]).

        +

        +

        +

        See Also:

        +

        set_capacity(const capacity_type&), rresize(size_type, const_reference)

        +

        +

        +
        ++++ + + + + + + + + + + + + + + +

        Parameters:

        ++++ + + + + +

        capacity_ctrl

        The new capacity controller.

        Postconditions:

        capacity() == capacity_ctrl && size() <= capacity_ctrl
        +
        + If the current number of elements stored in the circular_buffer_space_optimized is greater than the desired new capacity then number of [size() - capacity_ctrl.capacity()] first elements will be removed and the new size will be equal to capacity_ctrl.capacity().
        +
        + If the current number of elements stored in the circular_buffer_space_optimized is lower than the new capacity then the amount of allocated memory in the internal buffer may be accommodated as necessary but it will never drop below capacity_ctrl.min_capacity().

        Throws:

        		An allocation error if memory is exhausted (std::bad_alloc if the standard allocator is used). Whatever T::T(const T&) throws or nothing if T::T(T&&) is noexcept.
        +
        7. +
      7. +
        void rresize(size_type new_size, param_value_type item = value_type());
        Change the size of the circular_buffer_space_optimized.

        + + +

        +

        Exception Safety. Basic.

        +

        +

        +

        Iterator Invalidation. Invalidates all iterators pointing to the circular_buffer_space_optimized (except iterators equal to end()).

        +

        +

        +

        Complexity. Linear (in the new size of the circular_buffer_space_optimized).

        +

        +

        +

        See Also:

        +

        resize(size_type, const_reference), rset_capacity(const capacity_type&)

        +

        +

        +
        ++++ + + + + + + + + + + + + + + +

        Parameters:

        ++++ + + + + + + + + + + +

        item

        The element the circular_buffer_space_optimized will be filled with in order to gain the requested size. (See the Effect.)

        new_size

        The new size.

        Postconditions:

        size() == new_size && capacity().capacity() >= new_size
        +
        + If the new size is greater than the current size, copies of item will be inserted at the front of the of the circular_buffer_space_optimized in order to achieve the desired size. In the case the resulting size exceeds the current capacity the capacity will be set to new_size.
        +
        + If the current number of elements stored in the circular_buffer_space_optimized is greater than the desired new size then number of [size() - new_size] first elements will be removed. (The capacity will remain unchanged.)
        +
        + The amount of allocated memory in the internal buffer may be accommodated as necessary.

        Throws:

        		An allocation error if memory is exhausted (std::bad_alloc if the standard allocator is used). Whatever T::T(const T&) throws.
        +
        8. +
      8. +
        void assign(size_type n, param_value_type item);
        Assign n items into the space optimized circular buffer.

        The content of the circular_buffer_space_optimized will be removed and replaced with n copies of the item. + + +

        +

        Exception Safety. Basic.

        +

        +

        +

        Iterator Invalidation. Invalidates all iterators pointing to the circular_buffer_space_optimized (except iterators equal to end()).

        +

        +

        +

        Complexity. Linear (in the n).

        +

        +

        +

        See Also:

        +

        operator=, assign(capacity_type, size_type, const_reference), assign(InputIterator, InputIterator), assign(capacity_type, InputIterator, InputIterator)

        +

        +

        +
        ++++ + + + + + + + + + + + + + + +

        Parameters:

        ++++ + + + + + + + + + + +

        item

        The element the circular_buffer_space_optimized will be filled with.

        n

        The number of elements the circular_buffer_space_optimized will be filled with.

        Postconditions:

        capacity().capacity() == n && capacity().min_capacity() == 0 && size() == n && (*this)[0] == item && (*this)[1] == item && ... && (*this) [n - 1] == item
        +
        + The amount of allocated memory in the internal buffer is n.

        Throws:

        		An allocation error if memory is exhausted (std::bad_alloc if the standard allocator is used). Whatever T::T(const T&) throws.
        +
        9. +
      9. +
        void assign(capacity_type capacity_ctrl, size_type n, param_value_type item);
        Assign n items into the space optimized circular buffer specifying the capacity.

        The capacity of the circular_buffer_space_optimized will be set to the specified value and the content of the circular_buffer_space_optimized will be removed and replaced with n copies of the item. + + + +

        +

        Exception Safety. Basic.

        +

        +

        +

        Iterator Invalidation. Invalidates all iterators pointing to the circular_buffer_space_optimized (except iterators equal to end()).

        +

        +

        +

        Complexity. Linear (in the n).

        +

        +

        +

        See Also:

        +

        operator=, assign(size_type, const_reference), assign(InputIterator, InputIterator), assign(capacity_type, InputIterator, InputIterator)

        +

        +

        +
        ++++ + + + + + + + + + + + + + + + + + + +

        Parameters:

        ++++ + + + + + + + + + + + + + + +

        capacity_ctrl

        The new capacity controller.

        item

        The element the circular_buffer_space_optimized will be filled with.

        n

        The number of elements the circular_buffer_space_optimized will be filled with.

        Requires:

        capacity_ctrl.capacity() >= n

        Postconditions:

        capacity() == capacity_ctrl && size() == n && (*this)[0] == item && (*this)[1] == item && ... && (*this) [n - 1] == item
        +
        + The amount of allocated memory will be max[n, capacity_ctrl.min_capacity()].

        Throws:

        		An allocation error if memory is exhausted (std::bad_alloc if the standard allocator is used). Whatever T::T(const T&) throws.
        +
        10. +
      10. +
        template<typename InputIterator> 
+  void assign(InputIterator first, InputIterator last);
        Assign a copy of the range into the space optimized circular buffer.

        The content of the circular_buffer_space_optimized will be removed and replaced with copies of elements from the specified range. + + + +

        +

        Exception Safety. Basic.

        +

        +

        +

        Iterator Invalidation. Invalidates all iterators pointing to the circular_buffer_space_optimized (except iterators equal to end()).

        +

        +

        +

        Complexity. Linear (in the std::distance(first, last)).

        +

        +

        +

        See Also:

        +

        operator=, assign(size_type, const_reference), assign(capacity_type, size_type, const_reference), assign(capacity_type, InputIterator, InputIterator)

        +

        +

        +
        ++++ + + + + + + + + + + + + + + + + + + +

        Parameters:

        ++++ + + + + + + + + + + +

        first

        The beginning of the range to be copied.

        last

        The end of the range to be copied.

        Requires:

        Valid range [first, last).
        + first and last have to meet the requirements of InputIterator.

        Postconditions:

        capacity().capacity() == std::distance(first, last) && capacity().min_capacity() == 0 && size() == std::distance(first, last) && (*this)[0]== *first && (*this)[1] == *(first + 1) && ... && (*this)[std::distance(first, last) - 1] == *(last - 1)
        +
        + The amount of allocated memory in the internal buffer is std::distance(first, last).

        Throws:

        		An allocation error if memory is exhausted (std::bad_alloc if the standard allocator is used). Whatever T::T(const T&) throws or nothing if T::T(T&&) is noexcept and InputIterator is a move iterator.
        +
        11. +
      11. +
        template<typename InputIterator> 
+  void assign(capacity_type capacity_ctrl, InputIterator first, 
+              InputIterator last);
        Assign a copy of the range into the space optimized circular buffer specifying the capacity.

        The capacity of the circular_buffer_space_optimized will be set to the specified value and the content of the circular_buffer_space_optimized will be removed and replaced with copies of elements from the specified range. + + + +

        +

        Exception Safety. Basic.

        +

        +

        +

        Iterator Invalidation. Invalidates all iterators pointing to the circular_buffer_space_optimized (except iterators equal to end()).

        +

        +

        +

        Complexity. Linear (in std::distance(first, last); in min[capacity_ctrl.capacity(), std::distance(first, last)] if the InputIterator is a RandomAccessIterator).

        +

        +

        +

        See Also:

        +

        operator=, assign(size_type, const_reference), assign(capacity_type, size_type, const_reference), assign(InputIterator, InputIterator)

        +

        +

        +
        ++++ + + + + + + + + + + + + + + + + + + +

        Parameters:

        ++++ + + + + + + + + + + + + + + +

        capacity_ctrl

        The new capacity controller.

        first

        The beginning of the range to be copied.

        last

        The end of the range to be copied.

        Requires:

        Valid range [first, last).
        + first and last have to meet the requirements of InputIterator.

        Postconditions:

        capacity() == capacity_ctrl && size() <= std::distance(first, last) && (*this)[0]== *(last - capacity) && (*this)[1] == *(last - capacity + 1) && ... && (*this)[capacity - 1] == *(last - 1)
        +
        + If the number of items to be copied from the range [first, last) is greater than the specified capacity then only elements from the range [last - capacity, last) will be copied.
        +
        + The amount of allocated memory in the internal buffer is max[std::distance(first, last), capacity_ctrl.min_capacity()].

        Throws:

        		An allocation error if memory is exhausted (std::bad_alloc if the standard allocator is used). Whatever T::T(const T&) throws or nothing if T::T(T&&) is noexcept and InputIterator is a move iterator.
        +
        12. +
      12. +
        void swap(circular_buffer_space_optimized< T, Alloc > & cb) noexcept;
        Swap the contents of two space-optimized circular-buffers.

        + + +

        +

        Exception Safety. No-throw.

        +

        +

        +

        Iterator Invalidation. Invalidates all iterators of both circular_buffer_space_optimized containers. (On the other hand the iterators still point to the same elements but within another container. If you want to rely on this feature you have to turn the __debug_support off, otherwise an assertion will report an error if such invalidated iterator is used.)

        +

        +

        +

        Complexity. Constant (in the size of the circular_buffer_space_optimized).

        +

        +

        +

        See Also:

        +

        swap(circular_buffer<T, Alloc>&, circular_buffer<T, Alloc>&), swap(circular_buffer_space_optimized<T, Alloc>&, circular_buffer_space_optimized<T, Alloc>&)

        +

        +

        +
        ++++ + + + + + + + + + + + + + + +

        Parameters:

        ++++ + + + + +

        cb

        The circular_buffer_space_optimized whose content will be swapped.

        Postconditions:

        this contains elements of cb and vice versa; the capacity and the amount of allocated memory in the internal buffer of this equal to the capacity and the amount of allocated memory of cb and vice versa.

        Throws:

        		Nothing.
        +
        13. +
      13. +
        void push_back(param_value_type item);
        Insert a new element at the end of the space optimized circular buffer.

        + + +

        +

        Exception Safety. Basic.

        +

        +

        +

        Iterator Invalidation. Invalidates all iterators pointing to the circular_buffer_space_optimized (except iterators equal to end()).

        +

        +

        +

        Complexity. Linear (in the size of the circular_buffer_space_optimized).

        +

        +

        +

        See Also:

        +

        push_front(const_reference), pop_back(), pop_front()

        +

        +

        +
        ++++ + + + + + + + + + + + + + + +

        Parameters:

        ++++ + + + + +

        item

        The element to be inserted.

        Postconditions:

        if capacity().capacity() > 0 then back() == item
        + If the circular_buffer_space_optimized is full, the first element will be removed. If the capacity is 0, nothing will be inserted.
        +
        + The amount of allocated memory in the internal buffer may be predictively increased.

        Throws:

        		An allocation error if memory is exhausted (std::bad_alloc if the standard allocator is used). Whatever T::T(const T&) throws.
        +
        14. +
      14. +
        void push_back(rvalue_type item);
        Insert a new element at the end of the space optimized circular buffer.

        + + +

        +

        Exception Safety. Basic.

        +

        +

        +

        Iterator Invalidation. Invalidates all iterators pointing to the circular_buffer_space_optimized (except iterators equal to end()).

        +

        +

        +

        Complexity. Linear (in the size of the circular_buffer_space_optimized).

        +

        +

        +

        See Also:

        +

        push_front(const_reference), pop_back(), pop_front()

        +

        +

        +
        ++++ + + + + + + + + + + + + + + +

        Parameters:

        ++++ + + + + +

        item

        The element to be inserted.

        Postconditions:

        if capacity().capacity() > 0 then back() == item
        + If the circular_buffer_space_optimized is full, the first element will be removed. If the capacity is 0, nothing will be inserted.
        +
        + The amount of allocated memory in the internal buffer may be predictively increased.

        Throws:

        		An allocation error if memory is exhausted (std::bad_alloc if the standard allocator is used).
        +
        15. +
      15. +
        void push_back();
        Insert a new element at the end of the space optimized circular buffer.

        + +

        +

        Exception Safety. Basic.

        +

        +

        +

        Iterator Invalidation. Invalidates all iterators pointing to the circular_buffer_space_optimized (except iterators equal to end()).

        +

        +

        +

        Complexity. Linear (in the size of the circular_buffer_space_optimized).

        +

        +

        +

        See Also:

        +

        push_front(const_reference), pop_back(), pop_front()

        +

        +

        +
        ++++ + + + + + + + + + + +

        Postconditions:

        if capacity().capacity() > 0 then back() == item
        + If the circular_buffer_space_optimized is full, the first element will be removed. If the capacity is 0, nothing will be inserted.
        +
        + The amount of allocated memory in the internal buffer may be predictively increased.

        Throws:

        		An allocation error if memory is exhausted (std::bad_alloc if the standard allocator is used). Whatever T::T() throws. Whatever T::T(const T&) throws or nothing if T::T(T&&) is noexcept.
        +
        16. +
      16. +
        void push_front(param_value_type item);
        Insert a new element at the beginning of the space optimized circular buffer.

        + + +

        +

        Exception Safety. Basic.

        +

        +

        +

        Iterator Invalidation. Invalidates all iterators pointing to the circular_buffer_space_optimized (except iterators equal to end()).

        +

        +

        +

        Complexity. Linear (in the size of the circular_buffer_space_optimized).

        +

        +

        +

        See Also:

        +

        push_back(const_reference), pop_back(), pop_front()

        +

        +

        +
        ++++ + + + + + + + + + + + + + + +

        Parameters:

        ++++ + + + + +

        item

        The element to be inserted.

        Postconditions:

        if capacity().capacity() > 0 then front() == item
        + If the circular_buffer_space_optimized is full, the last element will be removed. If the capacity is 0, nothing will be inserted.
        +
        + The amount of allocated memory in the internal buffer may be predictively increased.

        Throws:

        		An allocation error if memory is exhausted (std::bad_alloc if the standard allocator is used). Whatever T::T(const T&) throws.
        +
        17. +
      17. +
        void push_front(rvalue_type item);
        Insert a new element at the beginning of the space optimized circular buffer.

        + + +

        +

        Exception Safety. Basic.

        +

        +

        +

        Iterator Invalidation. Invalidates all iterators pointing to the circular_buffer_space_optimized (except iterators equal to end()).

        +

        +

        +

        Complexity. Linear (in the size of the circular_buffer_space_optimized).

        +

        +

        +

        See Also:

        +

        push_back(const_reference), pop_back(), pop_front()

        +

        +

        +
        ++++ + + + + + + + + + + + + + + +

        Parameters:

        ++++ + + + + +

        item

        The element to be inserted.

        Postconditions:

        if capacity().capacity() > 0 then front() == item
        + If the circular_buffer_space_optimized is full, the last element will be removed. If the capacity is 0, nothing will be inserted.
        +
        + The amount of allocated memory in the internal buffer may be predictively increased.

        Throws:

        		An allocation error if memory is exhausted (std::bad_alloc if the standard allocator is used). Whatever T::T(const T&) throws or nothing if T::T(T&&) is noexcept.
        +
        18. +
      18. +
        void push_front();
        Insert a new element at the beginning of the space optimized circular buffer.

        + +

        +

        Exception Safety. Basic.

        +

        +

        +

        Iterator Invalidation. Invalidates all iterators pointing to the circular_buffer_space_optimized (except iterators equal to end()).

        +

        +

        +

        Complexity. Linear (in the size of the circular_buffer_space_optimized).

        +

        +

        +

        See Also:

        +

        push_back(const_reference), pop_back(), pop_front()

        +

        +

        +
        ++++ + + + + + + + + + + +

        Postconditions:

        if capacity().capacity() > 0 then front() == item
        + If the circular_buffer_space_optimized is full, the last element will be removed. If the capacity is 0, nothing will be inserted.
        +
        + The amount of allocated memory in the internal buffer may be predictively increased.

        Throws:

        		An allocation error if memory is exhausted (std::bad_alloc if the standard allocator is used). Whatever T::T() throws. Whatever T::T(const T&) throws or nothing if T::T(T&&) is noexcept.
        +
        19. +
      19. +
        void pop_back();
        Remove the last element from the space optimized circular buffer.

        + + +

        +

        Exception Safety. Basic.

        +

        +

        +

        Iterator Invalidation. Invalidates all iterators pointing to the circular_buffer_space_optimized (except iterators equal to end()).

        +

        +

        +

        Complexity. Linear (in the size of the circular_buffer_space_optimized).

        +

        +

        +

        See Also:

        +

        pop_front(), push_back(const_reference), push_front(const_reference)

        +

        +

        +
        ++++ + + + + + + + + + + + + + + +

        Requires:

        !empty()

        Postconditions:

        The last element is removed from the circular_buffer_space_optimized.
        +
        + The amount of allocated memory in the internal buffer may be predictively decreased.

        Throws:

        		An allocation error if memory is exhausted (std::bad_alloc if the standard allocator is used).
        +
        20. +
      20. +
        void pop_front();
        Remove the first element from the space optimized circular buffer.

        + + +

        +

        Exception Safety. Basic.

        +

        +

        +

        Iterator Invalidation. Invalidates all iterators pointing to the circular_buffer_space_optimized (except iterators equal to end()).

        +

        +

        +

        Complexity. Linear (in the size of the circular_buffer_space_optimized).

        +

        +

        +

        See Also:

        +

        pop_back(), push_back(const_reference), push_front(const_reference)

        +

        +

        +
        ++++ + + + + + + + + + + + + + + +

        Requires:

        !empty()

        Postconditions:

        The first element is removed from the circular_buffer_space_optimized.
        +
        + The amount of allocated memory in the internal buffer may be predictively decreased.

        Throws:

        		An allocation error if memory is exhausted (std::bad_alloc if the standard allocator is used).
        +
        21. +
      21. +
        iterator insert(iterator pos, param_value_type item);
        Insert an element at the specified position.

        + + + + +

        +

        Exception Safety. Basic.

        +

        +

        +

        Iterator Invalidation. Invalidates all iterators pointing to the circular_buffer_space_optimized (except iterators equal to end()).

        +

        +

        +

        Complexity. Linear (in the size of the circular_buffer_space_optimized).

        +

        +

        +

        See Also:

        +

        insert(iterator, size_type, value_type), insert(iterator, InputIterator, InputIterator), rinsert(iterator, value_type), rinsert(iterator, size_type, value_type), rinsert(iterator, InputIterator, InputIterator)

        +

        +

        +
        ++++ + + + + + + + + + + + + + + + + + + + + + + +

        Parameters:

        ++++ + + + + + + + + + + +

        item

        The element to be inserted.

        pos

        An iterator specifying the position where the item will be inserted.

        Requires:

        pos is a valid iterator pointing to the circular_buffer_space_optimized or its end.

        Postconditions:

        The item will be inserted at the position pos.
        + If the circular_buffer_space_optimized is full, the first element will be overwritten. If the circular_buffer_space_optimized is full and the pos points to begin(), then the item will not be inserted. If the capacity is 0, nothing will be inserted.
        +
        + The amount of allocated memory in the internal buffer may be predictively increased.

        Returns:

        Iterator to the inserted element or begin() if the item is not inserted. (See the Effect.)

        Throws:

        		An allocation error if memory is exhausted (std::bad_alloc if the standard allocator is used). Whatever T::T(const T&) throws. Whatever T::operator = (const T&) throws.
        +
        22. +
      22. +
        iterator insert(iterator pos, rvalue_type item);
        Insert an element at the specified position.

        + + + + +

        +

        Exception Safety. Basic.

        +

        +

        +

        Iterator Invalidation. Invalidates all iterators pointing to the circular_buffer_space_optimized (except iterators equal to end()).

        +

        +

        +

        Complexity. Linear (in the size of the circular_buffer_space_optimized).

        +

        +

        +

        See Also:

        +

        insert(iterator, size_type, value_type), insert(iterator, InputIterator, InputIterator), rinsert(iterator, value_type), rinsert(iterator, size_type, value_type), rinsert(iterator, InputIterator, InputIterator)

        +

        +

        +
        ++++ + + + + + + + + + + + + + + + + + + + + + + +

        Parameters:

        ++++ + + + + + + + + + + +

        item

        The element to be inserted.

        pos

        An iterator specifying the position where the item will be inserted.

        Requires:

        pos is a valid iterator pointing to the circular_buffer_space_optimized or its end.

        Postconditions:

        The item will be inserted at the position pos.
        + If the circular_buffer_space_optimized is full, the first element will be overwritten. If the circular_buffer_space_optimized is full and the pos points to begin(), then the item will not be inserted. If the capacity is 0, nothing will be inserted.
        +
        + The amount of allocated memory in the internal buffer may be predictively increased.

        Returns:

        Iterator to the inserted element or begin() if the item is not inserted. (See the Effect.)

        Throws:

        		An allocation error if memory is exhausted (std::bad_alloc if the standard allocator is used). Whatever T::T(const T&) throws or nothing if T::T(T&&) is noexcept.
        +
        23. +
      23. +
        iterator insert(iterator pos);
        Insert an element at the specified position.

        + + + + +

        +

        Exception Safety. Basic.

        +

        +

        +

        Iterator Invalidation. Invalidates all iterators pointing to the circular_buffer_space_optimized (except iterators equal to end()).

        +

        +

        +

        Complexity. Linear (in the size of the circular_buffer_space_optimized).

        +

        +

        +

        See Also:

        +

        insert(iterator, size_type, value_type), insert(iterator, InputIterator, InputIterator), rinsert(iterator, value_type), rinsert(iterator, size_type, value_type), rinsert(iterator, InputIterator, InputIterator)

        +

        +

        +
        ++++ + + + + + + + + + + + + + + + + + + + + + + +

        Parameters:

        ++++ + + + + +

        pos

        An iterator specifying the position where the item will be inserted.

        Requires:

        pos is a valid iterator pointing to the circular_buffer_space_optimized or its end.

        Postconditions:

        The item will be inserted at the position pos.
        + If the circular_buffer_space_optimized is full, the first element will be overwritten. If the circular_buffer_space_optimized is full and the pos points to begin(), then the item will not be inserted. If the capacity is 0, nothing will be inserted.
        +
        + The amount of allocated memory in the internal buffer may be predictively increased.

        Returns:

        Iterator to the inserted element or begin() if the item is not inserted. (See the Effect.)

        Throws:

        		An allocation error if memory is exhausted (std::bad_alloc if the standard allocator is used). Whatever T::T() throws. Whatever T::T(const T&) throws or nothing if T::T(T&&) is noexcept.
        +
        24. +
      24. +
        void insert(iterator pos, size_type n, param_value_type item);
        Insert n copies of the item at the specified position.

        + + + +

        +

        Exception Safety. Basic.

        +

        +

        +

        Iterator Invalidation. Invalidates all iterators pointing to the circular_buffer_space_optimized (except iterators equal to end()).

        +

        +

        +

        Complexity. Linear (in min[capacity().capacity(), size() + n]).

        +

        +

        +

        Example. Consider a circular_buffer_space_optimized with the capacity of 6 and the size of 4. Its internal buffer may look like the one below.
        +
        + |1|2|3|4| | |
        + p ___^
        +
        +After inserting 5 elements at the position p:
        +
        + insert(p, (size_t)5, 0);
        +
        +actually only 4 elements get inserted and elements 1 and 2 are overwritten. This is due to the fact the insert operation preserves the capacity. After insertion the internal buffer looks like this:
        +
        +|0|0|0|0|3|4|
        +
        +For comparison if the capacity would not be preserved the internal buffer would then result in |1|2|0|0|0|0|0|3|4|.

        +

        +

        +

        See Also:

        +

        insert(iterator, value_type), insert(iterator, InputIterator, InputIterator), rinsert(iterator, value_type), rinsert(iterator, size_type, value_type), rinsert(iterator, InputIterator, InputIterator)

        +

        +

        +
        ++++ + + + + + + + + + + + + + + + + + + +

        Parameters:

        ++++ + + + + + + + + + + + + + + +

        item

        The element whose copies will be inserted.

        n

        The number of items the to be inserted.

        pos

        An iterator specifying the position where the items will be inserted.

        Requires:

        pos is a valid iterator pointing to the circular_buffer_space_optimized or its end.

        Postconditions:

        The number of min[n, (pos - begin()) + reserve()] elements will be inserted at the position pos.
        +The number of min[pos - begin(), max[0, n - reserve()]] elements will be overwritten at the beginning of the circular_buffer_space_optimized.
        +(See Example for the explanation.)
        +
        + The amount of allocated memory in the internal buffer may be predictively increased.

        Throws:

        		An allocation error if memory is exhausted (std::bad_alloc if the standard allocator is used). Whatever T::T(const T&) throws. Whatever T::operator = (const T&) throws.
        +
        25. +
      25. +
        template<typename InputIterator> 
+  void insert(iterator pos, InputIterator first, InputIterator last);
        Insert the range [first, last) at the specified position.

        + + + +

        +

        Exception Safety. Basic.

        +

        +

        +

        Iterator Invalidation. Invalidates all iterators pointing to the circular_buffer_space_optimized (except iterators equal to end()).

        +

        +

        +

        Complexity. Linear (in [size() + std::distance(first, last)]; in min[capacity().capacity(), size() + std::distance(first, last)] if the InputIterator is a RandomAccessIterator).

        +

        +

        +

        Example. Consider a circular_buffer_space_optimized with the capacity of 6 and the size of 4. Its internal buffer may look like the one below.
        +
        + |1|2|3|4| | |
        + p ___^
        +
        +After inserting a range of elements at the position p:
        +
        + int array[] = { 5, 6, 7, 8, 9 };
        +insert(p, array, array + 5);
        +
        + actually only elements 6, 7, 8 and 9 from the specified range get inserted and elements 1 and 2 are overwritten. This is due to the fact the insert operation preserves the capacity. After insertion the internal buffer looks like this:
        +
        +|6|7|8|9|3|4|
        +
        +For comparison if the capacity would not be preserved the internal buffer would then result in |1|2|5|6|7|8|9|3|4|.

        +

        +

        +

        See Also:

        +

        insert(iterator, value_type), insert(iterator, size_type, value_type), rinsert(iterator, value_type), rinsert(iterator, size_type, value_type), rinsert(iterator, InputIterator, InputIterator)

        +

        +

        +
        ++++ + + + + + + + + + + + + + + + + + + +

        Parameters:

        ++++ + + + + + + + + + + + + + + +

        first

        The beginning of the range to be inserted.

        last

        The end of the range to be inserted.

        pos

        An iterator specifying the position where the range will be inserted.

        Requires:

        pos is a valid iterator pointing to the circular_buffer_space_optimized or its end.
        +Valid range [first, last) where first and last meet the requirements of an InputIterator.

        Postconditions:

        Elements from the range [first + max[0, distance(first, last) - (pos - begin()) - reserve()], last) will be inserted at the position pos.
        +The number of min[pos - begin(), max[0, distance(first, last) - reserve()]] elements will be overwritten at the beginning of the circular_buffer_space_optimized.
        +(See Example for the explanation.)
        +
        + The amount of allocated memory in the internal buffer may be predictively increased.

        Throws:

        		An allocation error if memory is exhausted (std::bad_alloc if the standard allocator is used). Whatever T::T(const T&) throws or nothing if T::T(T&&) is noexcept.
        +
        26. +
      26. +
        iterator rinsert(iterator pos, param_value_type item);
        Insert an element before the specified position.

        + + + + +

        +

        Exception Safety. Basic.

        +

        +

        +

        Iterator Invalidation. Invalidates all iterators pointing to the circular_buffer_space_optimized (except iterators equal to end()).

        +

        +

        +

        Complexity. Linear (in the size of the circular_buffer_space_optimized).

        +

        +

        +

        See Also:

        +

        rinsert(iterator, size_type, value_type), rinsert(iterator, InputIterator, InputIterator), insert(iterator, value_type), insert(iterator, size_type, value_type), insert(iterator, InputIterator, InputIterator)

        +

        +

        +
        ++++ + + + + + + + + + + + + + + + + + + + + + + +

        Parameters:

        ++++ + + + + + + + + + + +

        item

        The element to be inserted.

        pos

        An iterator specifying the position before which the item will be inserted.

        Requires:

        pos is a valid iterator pointing to the circular_buffer_space_optimized or its end.

        Postconditions:

        The item will be inserted before the position pos.
        + If the circular_buffer_space_optimized is full, the last element will be overwritten. If the circular_buffer_space_optimized is full and the pos points to end(), then the item will not be inserted. If the capacity is 0, nothing will be inserted.
        +
        + The amount of allocated memory in the internal buffer may be predictively increased.

        Returns:

        Iterator to the inserted element or end() if the item is not inserted. (See the Effect.)

        Throws:

        		An allocation error if memory is exhausted (std::bad_alloc if the standard allocator is used). Whatever T::T(const T&) throws. Whatever T::operator = (const T&) throws.
        +
        27. +
      27. +
        iterator rinsert(iterator pos, rvalue_type item);
        Insert an element before the specified position.

        + + + + +

        +

        Exception Safety. Basic.

        +

        +

        +

        Iterator Invalidation. Invalidates all iterators pointing to the circular_buffer_space_optimized (except iterators equal to end()).

        +

        +

        +

        Complexity. Linear (in the size of the circular_buffer_space_optimized).

        +

        +

        +

        See Also:

        +

        rinsert(iterator, size_type, value_type), rinsert(iterator, InputIterator, InputIterator), insert(iterator, value_type), insert(iterator, size_type, value_type), insert(iterator, InputIterator, InputIterator)

        +

        +

        +
        ++++ + + + + + + + + + + + + + + + + + + + + + + +

        Parameters:

        ++++ + + + + + + + + + + +

        item

        The element to be inserted.

        pos

        An iterator specifying the position before which the item will be inserted.

        Requires:

        pos is a valid iterator pointing to the circular_buffer_space_optimized or its end.

        Postconditions:

        The item will be inserted before the position pos.
        + If the circular_buffer_space_optimized is full, the last element will be overwritten. If the circular_buffer_space_optimized is full and the pos points to end(), then the item will not be inserted. If the capacity is 0, nothing will be inserted.
        +
        + The amount of allocated memory in the internal buffer may be predictively increased.

        Returns:

        Iterator to the inserted element or end() if the item is not inserted. (See the Effect.)

        Throws:

        		An allocation error if memory is exhausted (std::bad_alloc if the standard allocator is used). Whatever T::T(const T&) throws or nothing if T::T(T&&) is noexcept.
        +
        28. +
      28. +
        iterator rinsert(iterator pos);
        Insert an element before the specified position.

        + + + + +

        +

        Exception Safety. Basic.

        +

        +

        +

        Iterator Invalidation. Invalidates all iterators pointing to the circular_buffer_space_optimized (except iterators equal to end()).

        +

        +

        +

        Complexity. Linear (in the size of the circular_buffer_space_optimized).

        +

        +

        +

        See Also:

        +

        rinsert(iterator, size_type, value_type), rinsert(iterator, InputIterator, InputIterator), insert(iterator, value_type), insert(iterator, size_type, value_type), insert(iterator, InputIterator, InputIterator)

        +

        +

        +
        ++++ + + + + + + + + + + + + + + + + + + + + + + +

        Parameters:

        ++++ + + + + +

        pos

        An iterator specifying the position before which the item will be inserted.

        Requires:

        pos is a valid iterator pointing to the circular_buffer_space_optimized or its end.

        Postconditions:

        The item will be inserted before the position pos.
        + If the circular_buffer_space_optimized is full, the last element will be overwritten. If the circular_buffer_space_optimized is full and the pos points to end(), then the item will not be inserted. If the capacity is 0, nothing will be inserted.
        +
        + The amount of allocated memory in the internal buffer may be predictively increased.

        Returns:

        Iterator to the inserted element or end() if the item is not inserted. (See the Effect.)

        Throws:

        		An allocation error if memory is exhausted (std::bad_alloc if the standard allocator is used). Whatever T::T() throws. Whatever T::T(const T&) throws or nothing if T::T(T&&) is noexcept.
        +
        29. +
      29. +
        void rinsert(iterator pos, size_type n, param_value_type item);
        Insert n copies of the item before the specified position.

        + + + +

        +

        Exception Safety. Basic.

        +

        +

        +

        Iterator Invalidation. Invalidates all iterators pointing to the circular_buffer_space_optimized (except iterators equal to end()).

        +

        +

        +

        Complexity. Linear (in min[capacity().capacity(), size() + n]).

        +

        +

        +

        Example. Consider a circular_buffer_space_optimized with the capacity of 6 and the size of 4. Its internal buffer may look like the one below.
        +
        + |1|2|3|4| | |
        + p ___^
        +
        +After inserting 5 elements before the position p:
        +
        + rinsert(p, (size_t)5, 0);
        +
        +actually only 4 elements get inserted and elements 3 and 4 are overwritten. This is due to the fact the rinsert operation preserves the capacity. After insertion the internal buffer looks like this:
        +
        +|1|2|0|0|0|0|
        +
        +For comparison if the capacity would not be preserved the internal buffer would then result in |1|2|0|0|0|0|0|3|4|.

        +

        +

        +

        See Also:

        +

        rinsert(iterator, value_type), rinsert(iterator, InputIterator, InputIterator), insert(iterator, value_type), insert(iterator, size_type, value_type), insert(iterator, InputIterator, InputIterator)

        +

        +

        +
        ++++ + + + + + + + + + + + + + + + + + + +

        Parameters:

        ++++ + + + + + + + + + + + + + + +

        item

        The element whose copies will be inserted.

        n

        The number of items the to be inserted.

        pos

        An iterator specifying the position where the items will be inserted.

        Requires:

        pos is a valid iterator pointing to the circular_buffer_space_optimized or its end.

        Postconditions:

        The number of min[n, (end() - pos) + reserve()] elements will be inserted before the position pos.
        +The number of min[end() - pos, max[0, n - reserve()]] elements will be overwritten at the end of the circular_buffer_space_optimized.
        +(See Example for the explanation.)
        +
        + The amount of allocated memory in the internal buffer may be predictively increased.

        Throws:

        		An allocation error if memory is exhausted (std::bad_alloc if the standard allocator is used). Whatever T::T(const T&) throws. Whatever T::operator = (const T&) throws.
        +
        30. +
      30. +
        template<typename InputIterator> 
+  void rinsert(iterator pos, InputIterator first, InputIterator last);
        Insert the range [first, last) before the specified position.

        + + + +

        +

        Exception Safety. Basic.

        +

        +

        +

        Iterator Invalidation. Invalidates all iterators pointing to the circular_buffer_space_optimized (except iterators equal to end()).

        +

        +

        +

        Complexity. Linear (in [size() + std::distance(first, last)]; in min[capacity().capacity(), size() + std::distance(first, last)] if the InputIterator is a RandomAccessIterator).

        +

        +

        +

        Example. Consider a circular_buffer_space_optimized with the capacity of 6 and the size of 4. Its internal buffer may look like the one below.
        +
        + |1|2|3|4| | |
        + p ___^
        +
        +After inserting a range of elements before the position p:
        +
        + int array[] = { 5, 6, 7, 8, 9 };
        +insert(p, array, array + 5);
        +
        + actually only elements 5, 6, 7 and 8 from the specified range get inserted and elements 3 and 4 are overwritten. This is due to the fact the rinsert operation preserves the capacity. After insertion the internal buffer looks like this:
        +
        +|1|2|5|6|7|8|
        +
        +For comparison if the capacity would not be preserved the internal buffer would then result in |1|2|5|6|7|8|9|3|4|.

        +

        +

        +

        See Also:

        +

        rinsert(iterator, value_type), rinsert(iterator, size_type, value_type), insert(iterator, value_type), insert(iterator, size_type, value_type), insert(iterator, InputIterator, InputIterator)

        +

        +

        +
        ++++ + + + + + + + + + + + + + + + + + + +

        Parameters:

        ++++ + + + + + + + + + + + + + + +

        first

        The beginning of the range to be inserted.

        last

        The end of the range to be inserted.

        pos

        An iterator specifying the position where the range will be inserted.

        Requires:

        pos is a valid iterator pointing to the circular_buffer_space_optimized or its end.
        + Valid range [first, last) where first and last meet the requirements of an InputIterator.

        Postconditions:

        Elements from the range [first, last - max[0, distance(first, last) - (end() - pos) - reserve()]) will be inserted before the position pos.
        +The number of min[end() - pos, max[0, distance(first, last) - reserve()]] elements will be overwritten at the end of the circular_buffer.
        +(See Example for the explanation.)
        +
        + The amount of allocated memory in the internal buffer may be predictively increased.

        Throws:

        		An allocation error if memory is exhausted (std::bad_alloc if the standard allocator is used). Whatever T::T(const T&) throws. Whatever T::operator = (const T&) throws.
        +
        31. +
      31. +
        iterator erase(iterator pos);
        Remove an element at the specified position.

        + + + + +

        +

        Exception Safety. Basic.

        +

        +

        +

        Iterator Invalidation. Invalidates all iterators pointing to the circular_buffer_space_optimized (except iterators equal to end()).

        +

        +

        +

        Complexity. Linear (in the size of the circular_buffer_space_optimized).

        +

        +

        +

        See Also:

        +

        erase(iterator, iterator), rerase(iterator), rerase(iterator, iterator), clear()

        +

        +

        +
        ++++ + + + + + + + + + + + + + + + + + + + + + + +

        Parameters:

        ++++ + + + + +

        pos

        An iterator pointing at the element to be removed.

        Requires:

        pos is a valid iterator pointing to the circular_buffer_space_optimized (but not an end()).

        Postconditions:

        The element at the position pos is removed.
        +
        + The amount of allocated memory in the internal buffer may be predictively decreased.

        Returns:

        Iterator to the first element remaining beyond the removed element or end() if no such element exists.

        Throws:

        		An allocation error if memory is exhausted (std::bad_alloc if the standard allocator is used). Whatever T::operator = (const T&) throws or nothing if T::operator = (T&&) is noexcept.
        +
        32. +
      32. +
        iterator erase(iterator first, iterator last);
        Erase the range [first, last).

        + + + + +

        +

        Exception Safety. Basic.

        +

        +

        +

        Iterator Invalidation. Invalidates all iterators pointing to the circular_buffer_space_optimized (except iterators equal to end()).

        +

        +

        +

        Complexity. Linear (in the size of the circular_buffer_space_optimized).

        +

        +

        +

        See Also:

        +

        erase(iterator), rerase(iterator), rerase(iterator, iterator), clear()

        +

        +

        +
        ++++ + + + + + + + + + + + + + + + + + + + + + + +

        Parameters:

        ++++ + + + + + + + + + + +

        first

        The beginning of the range to be removed.

        last

        The end of the range to be removed.

        Requires:

        Valid range [first, last).

        Postconditions:

        The elements from the range [first, last) are removed. (If first == last nothing is removed.)
        +
        + The amount of allocated memory in the internal buffer may be predictively decreased.

        Returns:

        Iterator to the first element remaining beyond the removed elements or end() if no such element exists.

        Throws:

        		An allocation error if memory is exhausted (std::bad_alloc if the standard allocator is used). Whatever T::operator = (const T&) throws or nothing if T::operator = (T&&) is noexcept.
        +
        33. +
      33. +
        iterator rerase(iterator pos);
        Remove an element at the specified position.

        + + + + +

        +

        Exception Safety. Basic.

        +

        +

        +

        Iterator Invalidation. Invalidates all iterators pointing to the circular_buffer_space_optimized (except iterators equal to end()).

        +

        +

        +

        Complexity. Linear (in the size of the circular_buffer_space_optimized).

        +

        +

        +
        + + + + + +
        [Note]Note

        Basically there is no difference between erase(iterator) and this method. It is implemented only for consistency with the base circular_buffer.

        +

        +

        +

        See Also:

        +

        erase(iterator), erase(iterator, iterator), rerase(iterator, iterator), clear()

        +

        +

        +
        ++++ + + + + + + + + + + + + + + + + + + + + + + +

        Parameters:

        ++++ + + + + +

        pos

        An iterator pointing at the element to be removed.

        Requires:

        pos is a valid iterator pointing to the circular_buffer_space_optimized (but not an end()).
        +
        + The amount of allocated memory in the internal buffer may be predictively decreased.

        Postconditions:

        The element at the position pos is removed.

        Returns:

        Iterator to the first element remaining in front of the removed element or begin() if no such element exists.

        Throws:

        		An allocation error if memory is exhausted (std::bad_alloc if the standard allocator is used). Whatever T::operator = (const T&) throws or nothing if T::operator = (T&&) is noexcept.
        +
        34. +
      34. +
        iterator rerase(iterator first, iterator last);
        Erase the range [first, last).

        + + + + +

        +

        Exception Safety. Basic.

        +

        +

        +

        Iterator Invalidation. Invalidates all iterators pointing to the circular_buffer_space_optimized (except iterators equal to end()).

        +

        +

        +

        Complexity. Linear (in the size of the circular_buffer_space_optimized).

        +

        +

        +
        + + + + + +
        [Note]Note

        Basically there is no difference between erase(iterator, iterator) and this method. It is implemented only for consistency with the base <circular_buffer.

        +

        +

        +

        See Also:

        +

        erase(iterator), erase(iterator, iterator), rerase(iterator), clear()

        +

        +

        +
        ++++ + + + + + + + + + + + + + + + + + + + + + + +

        Parameters:

        ++++ + + + + + + + + + + +

        first

        The beginning of the range to be removed.

        last

        The end of the range to be removed.

        Requires:

        Valid range [first, last).

        Postconditions:

        The elements from the range [first, last) are removed. (If first == last nothing is removed.)
        +
        + The amount of allocated memory in the internal buffer may be predictively decreased.

        Returns:

        Iterator to the first element remaining in front of the removed elements or begin() if no such element exists.

        Throws:

        		An allocation error if memory is exhausted (std::bad_alloc if the standard allocator is used). Whatever T::operator = (const T&) throws or nothing if T::operator = (T&&) is noexcept.
        +
        35. +
      35. +
        void clear();
        Remove all stored elements from the space optimized circular buffer.

        + +

        +

        Exception Safety. Basic.

        +

        +

        +

        Iterator Invalidation. Invalidates all iterators pointing to the circular_buffer_space_optimized (except iterators equal to end()).

        +

        +

        +

        Complexity. Linear (in the size of the circular_buffer_space_optimized).

        +

        +

        +

        See Also:

        +

        ~circular_buffer_space_optimized(), erase(iterator), erase(iterator, iterator), rerase(iterator), rerase(iterator, iterator)

        +

        +

        +
        ++++ + + + + + + + + + + +

        Postconditions:

        size() == 0
        +
        + The amount of allocated memory in the internal buffer may be predictively decreased.

        Throws:

        		An allocation error if memory is exhausted (std::bad_alloc if the standard allocator is used).
        +
        36. +
      +
      +
      +

      +circular_buffer_space_optimized private member functions

      +
        +
      1. +
        void adjust_min_capacity();
        Adjust the amount of allocated memory.
        2. +
      2. +
        size_type ensure_reserve(size_type new_capacity, size_type buffer_size) const;
        Ensure the reserve for possible growth up.
        3. +
      3. +
        void check_low_capacity(size_type n = 1);
        Check for low capacity.
        4. +
      4. +
        void check_high_capacity();
        Check for high capacity.
        5. +
      5. +
        void reduce_capacity(const true_type &);
        Specialized method for reducing the capacity.
        6. +
      6. +
        void reduce_capacity(const false_type &);
        Specialized method for reducing the capacity.
        7. +
      7. +
        template<typename IntegralType> 
+  void insert(const iterator & pos, IntegralType n, IntegralType item, 
+              const true_type &);
        Specialized insert method.
        8. +
      8. +
        template<typename Iterator> 
+  void insert(const iterator & pos, Iterator first, Iterator last, 
+              const false_type &);
        Specialized insert method.
        9. +
      9. +
        template<typename IntegralType> 
+  void rinsert(const iterator & pos, IntegralType n, IntegralType item, 
+               const true_type &);
        Specialized rinsert method.
        10. +
      10. +
        template<typename Iterator> 
+  void rinsert(const iterator & pos, Iterator first, Iterator last, 
+               const false_type &);
        Specialized rinsert method.
        11. +
      +
      +
      +

      +circular_buffer_space_optimized private static functions

      +
        +
      1. +
        static size_type 
+init_capacity(const capacity_type & capacity_ctrl, size_type n);
        Determine the initial capacity.
        2. +
      2. +
        template<typename IntegralType> 
+  static size_type 
+  init_capacity(const capacity_type & capacity_ctrl, IntegralType n, 
+                IntegralType, const true_type &);
        Specialized method for determining the initial capacity.
        3. +
      3. +
        template<typename Iterator> 
+  static size_type 
+  init_capacity(const capacity_type & capacity_ctrl, Iterator first, 
+                Iterator last, const false_type &);
        Specialized method for determining the initial capacity.
        4. +
      4. +
        template<typename InputIterator> 
+  static size_type 
+  init_capacity(const capacity_type & capacity_ctrl, InputIterator, 
+                InputIterator, const std::input_iterator_tag &);
        Specialized method for determining the initial capacity.
        5. +
      5. +
        template<typename ForwardIterator> 
+  static size_type 
+  init_capacity(const capacity_type & capacity_ctrl, ForwardIterator first, 
+                ForwardIterator last, const std::forward_iterator_tag &);
        Specialized method for determining the initial capacity.
        6. +
      +
      +
      +
      + + + +
      Copyright © 2003-2013 Jan Gaspar

      + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

      +
      +
      +
      +PrevUpHomeNext +
      + + diff --git a/doc/html/boost/circular_buffer.html b/doc/html/boost/circular_buffer.html index 32d2bbd081..a6a0dedbb7 100644 --- a/doc/html/boost/circular_buffer.html +++ b/doc/html/boost/circular_buffer.html @@ -7,8 +7,8 @@ - - + + @@ -21,7 +21,7 @@
      -PrevUpHomeNext +PrevUpHomeNext
      @@ -56,201 +56,201 @@ typedef value_type && rvalue_type; // construct/copy/destruct - explicit circular_buffer(const allocator_type & = allocator_type()) noexcept; - explicit circular_buffer(capacity_type, + explicit circular_buffer(const allocator_type & = allocator_type()) noexcept; + explicit circular_buffer(capacity_type, const allocator_type & = allocator_type()); - circular_buffer(size_type, param_value_type, + circular_buffer(size_type, param_value_type, const allocator_type & = allocator_type()); - circular_buffer(capacity_type, size_type, param_value_type, + circular_buffer(capacity_type, size_type, param_value_type, const allocator_type & = allocator_type()); - circular_buffer(const circular_buffer< T, Alloc > &); - circular_buffer(circular_buffer< T, Alloc > &&) noexcept; + circular_buffer(const circular_buffer< T, Alloc > &); + circular_buffer(circular_buffer< T, Alloc > &&) noexcept; template<typename InputIterator> - circular_buffer(InputIterator, InputIterator, + circular_buffer(InputIterator, InputIterator, const allocator_type & = allocator_type()); template<typename InputIterator> - circular_buffer(capacity_type, InputIterator, InputIterator, + circular_buffer(capacity_type, InputIterator, InputIterator, const allocator_type & = allocator_type()); - circular_buffer< T, Alloc > & operator=(const circular_buffer< T, Alloc > &); + circular_buffer< T, Alloc > & operator=(const circular_buffer< T, Alloc > &); circular_buffer< T, Alloc > & - operator=(circular_buffer< T, Alloc > &&) noexcept; - ~circular_buffer(); - - // public member functions - allocator_type get_allocator() const noexcept; - allocator_type & get_allocator() noexcept; - iterator begin() noexcept; - iterator end() noexcept; - const_iterator begin() const noexcept; - const_iterator end() const noexcept; - reverse_iterator rbegin() noexcept; - reverse_iterator rend() noexcept; - const_reverse_iterator rbegin() const noexcept; - const_reverse_iterator rend() const noexcept; - reference operator[](size_type); - const_reference operator[](size_type) const; - reference at(size_type); - const_reference at(size_type) const; - reference front(); - reference back(); - const_reference front() const; - const_reference back() const; - array_range array_one(); - array_range array_two(); - const_array_range array_one() const; - const_array_range array_two() const; - pointer linearize(); - bool is_linearized() const noexcept; - void rotate(const_iterator); - size_type size() const noexcept; - size_type max_size() const noexcept; - bool empty() const noexcept; - bool full() const noexcept; - size_type reserve() const noexcept; - capacity_type capacity() const noexcept; - void set_capacity(capacity_type); - void resize(size_type, param_value_type = value_type()); - void rset_capacity(capacity_type); - void rresize(size_type, param_value_type = value_type()); - void assign(size_type, param_value_type); - void assign(capacity_type, size_type, param_value_type); - template<typename InputIterator> void assign(InputIterator, InputIterator); + operator=(circular_buffer< T, Alloc > &&) noexcept; + ~circular_buffer(); + + // public member functions + allocator_type get_allocator() const noexcept; + allocator_type & get_allocator() noexcept; + iterator begin() noexcept; + iterator end() noexcept; + const_iterator begin() const noexcept; + const_iterator end() const noexcept; + reverse_iterator rbegin() noexcept; + reverse_iterator rend() noexcept; + const_reverse_iterator rbegin() const noexcept; + const_reverse_iterator rend() const noexcept; + reference operator[](size_type); + const_reference operator[](size_type) const; + reference at(size_type); + const_reference at(size_type) const; + reference front(); + reference back(); + const_reference front() const; + const_reference back() const; + array_range array_one(); + array_range array_two(); + const_array_range array_one() const; + const_array_range array_two() const; + pointer linearize(); + bool is_linearized() const noexcept; + void rotate(const_iterator); + size_type size() const noexcept; + size_type max_size() const noexcept; + bool empty() const noexcept; + bool full() const noexcept; + size_type reserve() const noexcept; + capacity_type capacity() const noexcept; + void set_capacity(capacity_type); + void resize(size_type, param_value_type = value_type()); + void rset_capacity(capacity_type); + void rresize(size_type, param_value_type = value_type()); + void assign(size_type, param_value_type); + void assign(capacity_type, size_type, param_value_type); + template<typename InputIterator> void assign(InputIterator, InputIterator); template<typename InputIterator> - void assign(capacity_type, InputIterator, InputIterator); - void swap(circular_buffer< T, Alloc > &) noexcept; - void push_back(param_value_type); - void push_back(rvalue_type); - void push_back(); - void push_front(param_value_type); - void push_front(rvalue_type); - void push_front(); - void pop_back(); - void pop_front(); - iterator insert(iterator, param_value_type); - iterator insert(iterator, rvalue_type); - iterator insert(iterator); - void insert(iterator, size_type, param_value_type); + void assign(capacity_type, InputIterator, InputIterator); + void swap(circular_buffer< T, Alloc > &) noexcept; + void push_back(param_value_type); + void push_back(rvalue_type); + void push_back(); + void push_front(param_value_type); + void push_front(rvalue_type); + void push_front(); + void pop_back(); + void pop_front(); + iterator insert(iterator, param_value_type); + iterator insert(iterator, rvalue_type); + iterator insert(iterator); + void insert(iterator, size_type, param_value_type); template<typename InputIterator> - void insert(iterator, InputIterator, InputIterator); - iterator rinsert(iterator, param_value_type); - iterator rinsert(iterator, rvalue_type); - iterator rinsert(iterator); - void rinsert(iterator, size_type, param_value_type); + void insert(iterator, InputIterator, InputIterator); + iterator rinsert(iterator, param_value_type); + iterator rinsert(iterator, rvalue_type); + iterator rinsert(iterator); + void rinsert(iterator, size_type, param_value_type); template<typename InputIterator> - void rinsert(iterator, InputIterator, InputIterator); - iterator erase(iterator); - iterator erase(iterator, iterator); - iterator rerase(iterator); - iterator rerase(iterator, iterator); - void erase_begin(size_type); - void erase_end(size_type); - void clear() noexcept; - - // private member functions - template<typename ValT> void push_back_impl(ValT); - template<typename ValT> void push_front_impl(ValT); - template<typename ValT> iterator insert_impl(iterator, ValT); - template<typename ValT> iterator rinsert_impl(iterator, ValT); - void check_position(size_type) const; - template<typename Pointer> void increment(Pointer &) const; - template<typename Pointer> void decrement(Pointer &) const; - template<typename Pointer> Pointer add(Pointer, difference_type) const; - template<typename Pointer> Pointer sub(Pointer, difference_type) const; - pointer map_pointer(pointer) const; - pointer allocate(size_type); - void deallocate(pointer, size_type); - bool is_uninitialized(const_pointer) const noexcept; - void replace(pointer, param_value_type); - void replace(pointer, rvalue_type); - void construct_or_replace(bool, pointer, param_value_type); - void construct_or_replace(bool, pointer, rvalue_type); - void destroy_item(pointer); - void destroy_if_constructed(pointer); - void destroy_content(); - void destroy_content(const true_type &); - void destroy_content(const false_type &); - void destroy() noexcept; - void initialize_buffer(capacity_type); - void initialize_buffer(capacity_type, param_value_type); + void rinsert(iterator, InputIterator, InputIterator); + iterator erase(iterator); + iterator erase(iterator, iterator); + iterator rerase(iterator); + iterator rerase(iterator, iterator); + void erase_begin(size_type); + void erase_end(size_type); + void clear() noexcept; + + // private member functions + template<typename ValT> void push_back_impl(ValT); + template<typename ValT> void push_front_impl(ValT); + template<typename ValT> iterator insert_impl(iterator, ValT); + template<typename ValT> iterator rinsert_impl(iterator, ValT); + void check_position(size_type) const; + template<typename Pointer> void increment(Pointer &) const; + template<typename Pointer> void decrement(Pointer &) const; + template<typename Pointer> Pointer add(Pointer, difference_type) const; + template<typename Pointer> Pointer sub(Pointer, difference_type) const; + pointer map_pointer(pointer) const; + pointer allocate(size_type); + void deallocate(pointer, size_type); + bool is_uninitialized(const_pointer) const noexcept; + void replace(pointer, param_value_type); + void replace(pointer, rvalue_type); + void construct_or_replace(bool, pointer, param_value_type); + void construct_or_replace(bool, pointer, rvalue_type); + void destroy_item(pointer); + void destroy_if_constructed(pointer); + void destroy_content(); + void destroy_content(const true_type &); + void destroy_content(const false_type &); + void destroy() noexcept; + void initialize_buffer(capacity_type); + void initialize_buffer(capacity_type, param_value_type); template<typename IntegralType> - void initialize(IntegralType, IntegralType, const true_type &); + void initialize(IntegralType, IntegralType, const true_type &); template<typename Iterator> - void initialize(Iterator, Iterator, const false_type &); + void initialize(Iterator, Iterator, const false_type &); template<typename InputIterator> - void initialize(InputIterator, InputIterator, + void initialize(InputIterator, InputIterator, const std::input_iterator_tag &); template<typename ForwardIterator> - void initialize(ForwardIterator, ForwardIterator, + void initialize(ForwardIterator, ForwardIterator, const std::forward_iterator_tag &); template<typename IntegralType> - void initialize(capacity_type, IntegralType, IntegralType, + void initialize(capacity_type, IntegralType, IntegralType, const true_type &); template<typename Iterator> - void initialize(capacity_type, Iterator, Iterator, const false_type &); + void initialize(capacity_type, Iterator, Iterator, const false_type &); template<typename InputIterator> - void initialize(capacity_type, InputIterator, InputIterator, + void initialize(capacity_type, InputIterator, InputIterator, const std::input_iterator_tag &); template<typename ForwardIterator> - void initialize(capacity_type, ForwardIterator, ForwardIterator, + void initialize(capacity_type, ForwardIterator, ForwardIterator, const std::forward_iterator_tag &); template<typename ForwardIterator> - void initialize(capacity_type, ForwardIterator, ForwardIterator, + void initialize(capacity_type, ForwardIterator, ForwardIterator, size_type); - void reset(pointer, pointer, capacity_type); - void swap_allocator(circular_buffer< T, Alloc > &, const true_type &); - void swap_allocator(circular_buffer< T, Alloc > &, const false_type &); + void reset(pointer, pointer, capacity_type); + void swap_allocator(circular_buffer< T, Alloc > &, const true_type &); + void swap_allocator(circular_buffer< T, Alloc > &, const false_type &); template<typename IntegralType> - void assign(IntegralType, IntegralType, const true_type &); + void assign(IntegralType, IntegralType, const true_type &); template<typename Iterator> - void assign(Iterator, Iterator, const false_type &); + void assign(Iterator, Iterator, const false_type &); template<typename InputIterator> - void assign(InputIterator, InputIterator, const std::input_iterator_tag &); + void assign(InputIterator, InputIterator, const std::input_iterator_tag &); template<typename ForwardIterator> - void assign(ForwardIterator, ForwardIterator, + void assign(ForwardIterator, ForwardIterator, const std::forward_iterator_tag &); template<typename IntegralType> - void assign(capacity_type, IntegralType, IntegralType, const true_type &); + void assign(capacity_type, IntegralType, IntegralType, const true_type &); template<typename Iterator> - void assign(capacity_type, Iterator, Iterator, const false_type &); + void assign(capacity_type, Iterator, Iterator, const false_type &); template<typename InputIterator> - void assign(capacity_type, InputIterator, InputIterator, + void assign(capacity_type, InputIterator, InputIterator, const std::input_iterator_tag &); template<typename ForwardIterator> - void assign(capacity_type, ForwardIterator, ForwardIterator, + void assign(capacity_type, ForwardIterator, ForwardIterator, const std::forward_iterator_tag &); template<typename Functor> - void assign_n(capacity_type, size_type, const Functor &); - template<typename ValT> iterator insert_item(const iterator &, ValT); + void assign_n(capacity_type, size_type, const Functor &); + template<typename ValT> iterator insert_item(const iterator &, ValT); template<typename IntegralType> - void insert(const iterator &, IntegralType, IntegralType, + void insert(const iterator &, IntegralType, IntegralType, const true_type &); template<typename Iterator> - void insert(const iterator &, Iterator, Iterator, const false_type &); + void insert(const iterator &, Iterator, Iterator, const false_type &); template<typename InputIterator> - void insert(iterator, InputIterator, InputIterator, + void insert(iterator, InputIterator, InputIterator, const std::input_iterator_tag &); template<typename ForwardIterator> - void insert(const iterator &, ForwardIterator, ForwardIterator, + void insert(const iterator &, ForwardIterator, ForwardIterator, const std::forward_iterator_tag &); template<typename Wrapper> - void insert_n(const iterator &, size_type, const Wrapper &); + void insert_n(const iterator &, size_type, const Wrapper &); template<typename IntegralType> - void rinsert(const iterator &, IntegralType, IntegralType, + void rinsert(const iterator &, IntegralType, IntegralType, const true_type &); template<typename Iterator> - void rinsert(const iterator &, Iterator, Iterator, const false_type &); + void rinsert(const iterator &, Iterator, Iterator, const false_type &); template<typename InputIterator> - void rinsert(iterator, InputIterator, InputIterator, + void rinsert(iterator, InputIterator, InputIterator, const std::input_iterator_tag &); template<typename ForwardIterator> - void rinsert(const iterator &, ForwardIterator, ForwardIterator, + void rinsert(const iterator &, ForwardIterator, ForwardIterator, const std::forward_iterator_tag &); template<typename Wrapper> - void rinsert_n(const iterator &, size_type, const Wrapper &); - void erase_begin(size_type, const true_type &); - void erase_begin(size_type, const false_type &); - void erase_end(size_type, const true_type &); - void erase_end(size_type, const false_type &); + void rinsert_n(const iterator &, size_type, const Wrapper &); + void erase_begin(size_type, const true_type &); + void erase_begin(size_type, const false_type &); + void erase_end(size_type, const true_type &); + void erase_end(size_type, const false_type &); };

      Description

      @@ -324,7 +324,7 @@ For detailed documentation of the
      1. -
        explicit circular_buffer(const allocator_type & alloc = allocator_type()) noexcept;
        Create an empty circular_buffer with zero capacity.

        +

        explicit circular_buffer(const allocator_type & alloc = allocator_type()) noexcept;
        Create an empty circular_buffer with zero capacity.

        @@ -384,7 +384,7 @@ For detailed documentation of the
    2. -
      explicit circular_buffer(capacity_type buffer_capacity, 
+
      explicit circular_buffer(capacity_type buffer_capacity, 
                          const allocator_type & alloc = allocator_type());
      Create an empty circular_buffer with the specified capacity. 
      
 
 
@@ -429,7 +429,7 @@ For detailed documentation of the
  • -
    circular_buffer(size_type n, param_value_type item, 
+
    circular_buffer(size_type n, param_value_type item, 
                 const allocator_type & alloc = allocator_type());
    Create a full circular_buffer with the specified capacity and filled with n copies of item. 
    
 
 
@@ -478,7 +478,7 @@ For detailed documentation of the
  • -
    circular_buffer(capacity_type buffer_capacity, size_type n, 
+
    circular_buffer(capacity_type buffer_capacity, size_type n, 
                 param_value_type item, 
                 const allocator_type & alloc = allocator_type());
    Create a circular_buffer with the specified capacity and filled with n copies of item. 
    
 
@@ -537,7 +537,7 @@ For detailed documentation of the
  • -
    circular_buffer(const circular_buffer< T, Alloc > & cb);
    The copy constructor.

    Creates a copy of the specified circular_buffer. +

    circular_buffer(const circular_buffer< T, Alloc > & cb);
    The copy constructor.

    Creates a copy of the specified circular_buffer.

    @@ -575,7 +575,7 @@ For detailed documentation of the
  • -
    circular_buffer(circular_buffer< T, Alloc > && cb) noexcept;
    The move constructor.

    Move constructs a circular_buffer from cb, leaving cb empty. +

    circular_buffer(circular_buffer< T, Alloc > && cb) noexcept;
    The move constructor.

    Move constructs a circular_buffer from cb, leaving cb empty. @@ -619,7 +619,7 @@ For detailed documentation of the 

  • template<typename InputIterator> 
-  circular_buffer(InputIterator first, InputIterator last, 
+  circular_buffer(InputIterator first, InputIterator last, 
                   const allocator_type & alloc = allocator_type());
    Create a full circular_buffer filled with a copy of the range.

    @@ -675,7 +675,7 @@ For detailed documentation of the 

  • template<typename InputIterator> 
-  circular_buffer(capacity_type buffer_capacity, InputIterator first, 
+  circular_buffer(capacity_type buffer_capacity, InputIterator first, 
                   InputIterator last, 
                   const allocator_type & alloc = allocator_type());
    Create a circular_buffer with the specified capacity and filled with a copy of the range.

    @@ -738,7 +738,7 @@ For detailed documentation of the 

  • circular_buffer< T, Alloc > & 
-operator=(const circular_buffer< T, Alloc > & cb);
    The assign operator.

    Makes this circular_buffer to become a copy of the specified circular_buffer. +operator=(const circular_buffer< T, Alloc > & cb);The assign operator.

    Makes this circular_buffer to become a copy of the specified circular_buffer.

    @@ -787,7 +787,7 @@ For detailed documentation of the 
  • circular_buffer< T, Alloc > & 
-operator=(circular_buffer< T, Alloc > && cb) noexcept;
    Move assigns content of cb to *this, leaving cb empty.

    +operator=(circular_buffer< T, Alloc > && cb) noexcept;Move assigns content of cb to *this, leaving cb empty.

    @@ -830,7 +830,7 @@ For detailed documentation of the

  • -
    ~circular_buffer();
    The destructor.

    Destroys the circular_buffer. +

    ~circular_buffer();
    The destructor.

    Destroys the circular_buffer.

    Iterator Invalidation. Invalidates all iterators pointing to the circular_buffer (including iterators equal to end()).

    @@ -857,10 +857,10 @@ For detailed documentation of the

    -circular_buffer public member functions

    +circular_buffer public member functions
    1. -
      allocator_type get_allocator() const noexcept;
      Get the allocator.

      +

      allocator_type get_allocator() const noexcept;
      Get the allocator.

      Exception Safety. No-throw.

      @@ -894,7 +894,7 @@ For detailed documentation of the
  • -
    allocator_type & get_allocator() noexcept;
    Get the allocator reference.

    +

    allocator_type & get_allocator() noexcept;
    Get the allocator reference.

    Exception Safety. No-throw.

    @@ -937,7 +937,7 @@ For detailed documentation of the
  • -
    iterator begin() noexcept;
    Get the iterator pointing to the beginning of the circular_buffer.

    +

    iterator begin() noexcept;
    Get the iterator pointing to the beginning of the circular_buffer.

    Exception Safety. No-throw.

    @@ -971,7 +971,7 @@ For detailed documentation of the
  • -
    iterator end() noexcept;
    Get the iterator pointing to the end of the circular_buffer.

    +

    iterator end() noexcept;
    Get the iterator pointing to the end of the circular_buffer.

    Exception Safety. No-throw.

    @@ -1005,7 +1005,7 @@ For detailed documentation of the
  • -
    const_iterator begin() const noexcept;
    Get the const iterator pointing to the beginning of the circular_buffer.

    +

    const_iterator begin() const noexcept;
    Get the const iterator pointing to the beginning of the circular_buffer.

    Exception Safety. No-throw.

    @@ -1039,7 +1039,7 @@ For detailed documentation of the
  • -
    const_iterator end() const noexcept;
    Get the const iterator pointing to the end of the circular_buffer.

    +

    const_iterator end() const noexcept;
    Get the const iterator pointing to the end of the circular_buffer.

    Exception Safety. No-throw.

    @@ -1073,7 +1073,7 @@ For detailed documentation of the
  • -
    reverse_iterator rbegin() noexcept;
    Get the iterator pointing to the beginning of the "reversed" circular_buffer.

    +

    reverse_iterator rbegin() noexcept;
    Get the iterator pointing to the beginning of the "reversed" circular_buffer.

    Exception Safety. No-throw.

    @@ -1107,7 +1107,7 @@ For detailed documentation of the
  • -
    reverse_iterator rend() noexcept;
    Get the iterator pointing to the end of the "reversed" circular_buffer.

    +

    reverse_iterator rend() noexcept;
    Get the iterator pointing to the end of the "reversed" circular_buffer.

    Exception Safety. No-throw.

    @@ -1141,7 +1141,7 @@ For detailed documentation of the
  • -
    const_reverse_iterator rbegin() const noexcept;
    Get the const iterator pointing to the beginning of the "reversed" circular_buffer.

    +

    const_reverse_iterator rbegin() const noexcept;
    Get the const iterator pointing to the beginning of the "reversed" circular_buffer.

    Exception Safety. No-throw.

    @@ -1175,7 +1175,7 @@ For detailed documentation of the
  • -
    const_reverse_iterator rend() const noexcept;
    Get the const iterator pointing to the end of the "reversed" circular_buffer.

    +

    const_reverse_iterator rend() const noexcept;
    Get the const iterator pointing to the end of the "reversed" circular_buffer.

    Exception Safety. No-throw.

    @@ -1209,7 +1209,7 @@ For detailed documentation of the
  • -
    reference operator[](size_type index);
    Get the element at the index position.

    +

    reference operator[](size_type index);
    Get the element at the index position.

    @@ -1262,7 +1262,7 @@ For detailed documentation of the

  • -
    const_reference operator[](size_type index) const;
    Get the element at the index position.

    +

    const_reference operator[](size_type index) const;
    Get the element at the index position.

    @@ -1315,7 +1315,7 @@ For detailed documentation of the

  • -
    reference at(size_type index);
    Get the element at the index position.

    +

    reference at(size_type index);
    Get the element at the index position.

    @@ -1363,7 +1363,7 @@ For detailed documentation of the
  • -
    const_reference at(size_type index) const;
    Get the element at the index position.

    +

    const_reference at(size_type index) const;
    Get the element at the index position.

    @@ -1411,7 +1411,7 @@ For detailed documentation of the
  • -
    reference front();
    Get the first element.

    +

    reference front();
    Get the first element.

    @@ -1450,7 +1450,7 @@ For detailed documentation of the
  • -
    reference back();
    Get the last element.

    +

    reference back();
    Get the last element.

    @@ -1489,7 +1489,7 @@ For detailed documentation of the
  • -
    const_reference front() const;
    Get the first element.

    +

    const_reference front() const;
    Get the first element.

    @@ -1528,7 +1528,7 @@ For detailed documentation of the
  • -
    const_reference back() const;
    Get the last element.

    +

    const_reference back() const;
    Get the last element.

    @@ -1567,7 +1567,7 @@ For detailed documentation of the
  • -
    array_range array_one();
    Get the first continuous array of the internal buffer.

    This method in combination with array_two() can be useful when passing the stored data into a legacy C API as an array. Suppose there is a circular_buffer of capacity 10, containing 7 characters 'a', 'b', ..., 'g' where buff[0] == 'a', buff[1] == 'b', ... and buff[6] == 'g':
    +

    array_range array_one();
    Get the first continuous array of the internal buffer.

    This method in combination with array_two() can be useful when passing the stored data into a legacy C API as an array. Suppose there is a circular_buffer of capacity 10, containing 7 characters 'a', 'b', ..., 'g' where buff[0] == 'a', buff[1] == 'b', ... and buff[6] == 'g':

    circular_buffer<char> buff(10);

    @@ -1646,7 +1646,7 @@ For detailed documentation of the

  • -
    array_range array_two();
    Get the second continuous array of the internal buffer.

    This method in combination with array_one() can be useful when passing the stored data into a legacy C API as an array. +

    array_range array_two();
    Get the second continuous array of the internal buffer.

    This method in combination with array_one() can be useful when passing the stored data into a legacy C API as an array.

    Exception Safety. No-throw.

    @@ -1680,7 +1680,7 @@ For detailed documentation of the
  • -
    const_array_range array_one() const;
    Get the first continuous array of the internal buffer.

    This method in combination with array_two() const can be useful when passing the stored data into a legacy C API as an array. +

    const_array_range array_one() const;
    Get the first continuous array of the internal buffer.

    This method in combination with array_two() const can be useful when passing the stored data into a legacy C API as an array.

    Exception Safety. No-throw.

    @@ -1714,7 +1714,7 @@ For detailed documentation of the
  • -
    const_array_range array_two() const;
    Get the second continuous array of the internal buffer.

    This method in combination with array_one() const can be useful when passing the stored data into a legacy C API as an array. +

    const_array_range array_two() const;
    Get the second continuous array of the internal buffer.

    This method in combination with array_one() const can be useful when passing the stored data into a legacy C API as an array.

    Exception Safety. No-throw.

    @@ -1748,7 +1748,7 @@ For detailed documentation of the
  • -
    pointer linearize();
    Linearize the internal buffer into a continuous array.

    This method can be useful when passing the stored data into a legacy C API as an array. +

    pointer linearize();
    Linearize the internal buffer into a continuous array.

    This method can be useful when passing the stored data into a legacy C API as an array.

    @@ -1796,7 +1796,7 @@ For detailed documentation of the
  • -
    bool is_linearized() const noexcept;
    Is the circular_buffer linearized?

    +

    bool is_linearized() const noexcept;
    Is the circular_buffer linearized?

    Exception Safety. No-throw.

    @@ -1830,7 +1830,7 @@ For detailed documentation of the
  • -
    void rotate(const_iterator new_begin);
    Rotate elements in the circular_buffer.

    A more effective implementation of std::rotate. +

    void rotate(const_iterator new_begin);
    Rotate elements in the circular_buffer.

    A more effective implementation of std::rotate. @@ -1892,7 +1892,7 @@ then after call to the method:

  • -
    size_type size() const noexcept;
    Get the number of elements currently stored in the circular_buffer.

    +

    size_type size() const noexcept;
    Get the number of elements currently stored in the circular_buffer.

    Exception Safety. No-throw.

    @@ -1926,7 +1926,7 @@ then after call to the method:
  • -
    size_type max_size() const noexcept;
    Get the largest possible size or capacity of the circular_buffer. (It depends on allocator's max_size()).

    +

    size_type max_size() const noexcept;
    Get the largest possible size or capacity of the circular_buffer. (It depends on allocator's max_size()).

    Exception Safety. No-throw.

    @@ -1960,7 +1960,7 @@ then after call to the method:
  • -
    bool empty() const noexcept;
    Is the circular_buffer empty?

    +

    bool empty() const noexcept;
    Is the circular_buffer empty?

    Exception Safety. No-throw.

    @@ -1994,7 +1994,7 @@ then after call to the method:
  • -
    bool full() const noexcept;
    Is the circular_buffer full?

    +

    bool full() const noexcept;
    Is the circular_buffer full?

    Exception Safety. No-throw.

    @@ -2028,7 +2028,7 @@ then after call to the method:
  • -
    size_type reserve() const noexcept;
    Get the maximum number of elements which can be inserted into the circular_buffer without overwriting any of already stored elements.

    +

    size_type reserve() const noexcept;
    Get the maximum number of elements which can be inserted into the circular_buffer without overwriting any of already stored elements.

    Exception Safety. No-throw.

    @@ -2062,7 +2062,7 @@ then after call to the method:
  • -
    capacity_type capacity() const noexcept;
    Get the capacity of the circular_buffer.

    +

    capacity_type capacity() const noexcept;
    Get the capacity of the circular_buffer.

    Exception Safety. No-throw.

    @@ -2096,7 +2096,7 @@ then after call to the method:
  • -
    void set_capacity(capacity_type new_capacity);
    Change the capacity of the circular_buffer.

    +

    void set_capacity(capacity_type new_capacity);
    Change the capacity of the circular_buffer.

    @@ -2151,7 +2151,7 @@ then after call to the method:

  • -
    void resize(size_type new_size, param_value_type item = value_type());
    Change the size of the circular_buffer.

    +

    void resize(size_type new_size, param_value_type item = value_type());
    Change the size of the circular_buffer.

    @@ -2208,7 +2208,7 @@ then after call to the method:
  • -
    void rset_capacity(capacity_type new_capacity);
    Change the capacity of the circular_buffer.

    +

    void rset_capacity(capacity_type new_capacity);
    Change the capacity of the circular_buffer.

    @@ -2263,7 +2263,7 @@ then after call to the method:

  • -
    void rresize(size_type new_size, param_value_type item = value_type());
    Change the size of the circular_buffer.

    +

    void rresize(size_type new_size, param_value_type item = value_type());
    Change the size of the circular_buffer.

    @@ -2320,7 +2320,7 @@ then after call to the method:
  • -
    void assign(size_type n, param_value_type item);
    Assign n items into the circular_buffer.

    The content of the circular_buffer will be removed and replaced with n copies of the item. +

    void assign(size_type n, param_value_type item);
    Assign n items into the circular_buffer.

    The content of the circular_buffer will be removed and replaced with n copies of the item.

    @@ -2374,7 +2374,7 @@ then after call to the method:
  • -
    void assign(capacity_type buffer_capacity, size_type n, param_value_type item);
    Assign n items into the circular_buffer specifying the capacity.

    The capacity of the circular_buffer will be set to the specified value and the content of the circular_buffer will be removed and replaced with n copies of the item. +

    void assign(capacity_type buffer_capacity, size_type n, param_value_type item);
    Assign n items into the circular_buffer specifying the capacity.

    The capacity of the circular_buffer will be set to the specified value and the content of the circular_buffer will be removed and replaced with n copies of the item. @@ -2438,7 +2438,7 @@ then after call to the method:

  • template<typename InputIterator> 
-  void assign(InputIterator first, InputIterator last);
    Assign a copy of the range into the circular_buffer.

    The content of the circular_buffer will be removed and replaced with copies of elements from the specified range. + void assign(InputIterator first, InputIterator last);Assign a copy of the range into the circular_buffer.

    The content of the circular_buffer will be removed and replaced with copies of elements from the specified range. @@ -2499,7 +2499,7 @@ then after call to the method:

  • template<typename InputIterator> 
-  void assign(capacity_type buffer_capacity, InputIterator first, 
+  void assign(capacity_type buffer_capacity, InputIterator first, 
               InputIterator last);
    Assign a copy of the range into the circular_buffer specifying the capacity.

    The capacity of the circular_buffer will be set to the specified value and the content of the circular_buffer will be removed and replaced with copies of elements from the specified range. @@ -2566,7 +2566,7 @@ then after call to the method:

  • -
    void swap(circular_buffer< T, Alloc > & cb) noexcept;
    Swap the contents of two circular_buffers.

    +

    void swap(circular_buffer< T, Alloc > & cb) noexcept;
    Swap the contents of two circular_buffers.

    @@ -2614,7 +2614,7 @@ then after call to the method:
  • -
    void push_back(param_value_type item);
    Insert a new element at the end of the circular_buffer.

    +

    void push_back(param_value_type item);
    Insert a new element at the end of the circular_buffer.

    @@ -2663,7 +2663,7 @@ then after call to the method:
  • -
    void push_back(rvalue_type item);
    Insert a new element at the end of the circular_buffer using rvalue references or rvalues references emulation.

    +

    void push_back(rvalue_type item);
    Insert a new element at the end of the circular_buffer using rvalue references or rvalues references emulation.

    @@ -2712,7 +2712,7 @@ then after call to the method:
  • -
    void push_back();
    Insert a new default-constructed element at the end of the circular_buffer.

    +

    void push_back();
    Insert a new default-constructed element at the end of the circular_buffer.

    Exception Safety. Basic; no-throw if the operation in the Throws section does not throw anything.

    @@ -2747,7 +2747,7 @@ then after call to the method:
  • -
    void push_front(param_value_type item);
    Insert a new element at the beginning of the circular_buffer.

    +

    void push_front(param_value_type item);
    Insert a new element at the beginning of the circular_buffer.

    @@ -2796,7 +2796,7 @@ then after call to the method:
  • -
    void push_front(rvalue_type item);
    Insert a new element at the beginning of the circular_buffer using rvalue references or rvalues references emulation.

    +

    void push_front(rvalue_type item);
    Insert a new element at the beginning of the circular_buffer using rvalue references or rvalues references emulation.

    @@ -2845,7 +2845,7 @@ then after call to the method:
  • -
    void push_front();
    Insert a new default-constructed element at the beginning of the circular_buffer.

    +

    void push_front();
    Insert a new default-constructed element at the beginning of the circular_buffer.

    Exception Safety. Basic; no-throw if the operation in the Throws section does not throw anything.

    @@ -2880,7 +2880,7 @@ then after call to the method:
  • -
    void pop_back();
    Remove the last element from the circular_buffer.

    +

    void pop_back();
    Remove the last element from the circular_buffer.

    @@ -2919,7 +2919,7 @@ then after call to the method:
  • -
    void pop_front();
    Remove the first element from the circular_buffer.

    +

    void pop_front();
    Remove the first element from the circular_buffer.

    @@ -2958,7 +2958,7 @@ then after call to the method:
  • -
    iterator insert(iterator pos, param_value_type item);
    Insert an element at the specified position.

    +

    iterator insert(iterator pos, param_value_type item);
    Insert an element at the specified position.

    @@ -3023,7 +3023,7 @@ then after call to the method:

  • -
    iterator insert(iterator pos, rvalue_type item);
    Insert an element at the specified position.

    +

    iterator insert(iterator pos, rvalue_type item);
    Insert an element at the specified position.

    @@ -3088,7 +3088,7 @@ then after call to the method:

  • -
    iterator insert(iterator pos);
    Insert a default-constructed element at the specified position.

    +

    iterator insert(iterator pos);
    Insert a default-constructed element at the specified position.

    @@ -3147,7 +3147,7 @@ then after call to the method:

  • -
    void insert(iterator pos, size_type n, param_value_type item);
    Insert n copies of the item at the specified position.

    +

    void insert(iterator pos, size_type n, param_value_type item);
    Insert n copies of the item at the specified position.

    @@ -3229,7 +3229,7 @@ The number of min[pos - begin(), max[0, n - reserve 

  • template<typename InputIterator> 
-  void insert(iterator pos, InputIterator first, InputIterator last);
    Insert the range [first, last) at the specified position.

    + void insert(iterator pos, InputIterator first, InputIterator last);Insert the range [first, last) at the specified position.

    @@ -3312,7 +3312,7 @@ The number of min[pos - begin(), max[0, distance(fi

  • -
    iterator rinsert(iterator pos, param_value_type item);
    Insert an element before the specified position.

    +

    iterator rinsert(iterator pos, param_value_type item);
    Insert an element before the specified position.

    @@ -3377,7 +3377,7 @@ The number of min[pos - begin(), max[0, distance(fi

  • -
    iterator rinsert(iterator pos, rvalue_type item);
    Insert an element before the specified position.

    +

    iterator rinsert(iterator pos, rvalue_type item);
    Insert an element before the specified position.

    @@ -3442,7 +3442,7 @@ The number of min[pos - begin(), max[0, distance(fi

  • -
    iterator rinsert(iterator pos);
    Insert an element before the specified position.

    +

    iterator rinsert(iterator pos);
    Insert an element before the specified position.

    @@ -3501,7 +3501,7 @@ The number of min[pos - begin(), max[0, distance(fi

  • -
    void rinsert(iterator pos, size_type n, param_value_type item);
    Insert n copies of the item before the specified position.

    +

    void rinsert(iterator pos, size_type n, param_value_type item);
    Insert n copies of the item before the specified position.

    @@ -3583,7 +3583,7 @@ The number of min[end() - pos, max[0, n - reserve() 

  • template<typename InputIterator> 
-  void rinsert(iterator pos, InputIterator first, InputIterator last);
    Insert the range [first, last) before the specified position.

    + void rinsert(iterator pos, InputIterator first, InputIterator last);Insert the range [first, last) before the specified position.

    @@ -3666,7 +3666,7 @@ The number of min[end() - pos, max[0, distance(firs

  • -
    iterator erase(iterator pos);
    Remove an element at the specified position.

    +

    iterator erase(iterator pos);
    Remove an element at the specified position.

    @@ -3724,7 +3724,7 @@ The number of min[end() - pos, max[0, distance(firs

  • -
    iterator erase(iterator first, iterator last);
    Erase the range [first, last).

    +

    iterator erase(iterator first, iterator last);
    Erase the range [first, last).

    @@ -3788,7 +3788,7 @@ The number of min[end() - pos, max[0, distance(firs

  • -
    iterator rerase(iterator pos);
    Remove an element at the specified position.

    +

    iterator rerase(iterator pos);
    Remove an element at the specified position.

    @@ -3855,7 +3855,7 @@ The number of min[end() - pos, max[0, distance(firs

  • -
    iterator rerase(iterator first, iterator last);
    Erase the range [first, last).

    +

    iterator rerase(iterator first, iterator last);
    Erase the range [first, last).

    @@ -3928,7 +3928,7 @@ The number of min[end() - pos, max[0, distance(firs

  • -
    void erase_begin(size_type n);
    Remove first n elements (with constant complexity for scalar types).

    +

    void erase_begin(size_type n);
    Remove first n elements (with constant complexity for scalar types).

    @@ -3990,7 +3990,7 @@ The number of min[end() - pos, max[0, distance(firs

  • -
    void erase_end(size_type n);
    Remove last n elements (with constant complexity for scalar types).

    +

    void erase_end(size_type n);
    Remove last n elements (with constant complexity for scalar types).

    @@ -4052,7 +4052,7 @@ The number of min[end() - pos, max[0, distance(firs

  • -
    void clear() noexcept;
    Remove all stored elements from the circular_buffer.

    +

    void clear() noexcept;
    Remove all stored elements from the circular_buffer.

    Exception Safety. No-throw.

    @@ -4089,177 +4089,177 @@ The number of min[end() - pos, max[0, distance(firs

    -circular_buffer private member functions

    +circular_buffer private member functions
      -
    1. template<typename ValT> void push_back_impl(ValT item);
      2. -
    2. template<typename ValT> void push_front_impl(ValT item);
      3. -
    3. template<typename ValT> iterator insert_impl(iterator pos, ValT item);
      4. -
    4. template<typename ValT> iterator rinsert_impl(iterator pos, ValT item);
      5. +
    5. template<typename ValT> void push_back_impl(ValT item);
      6. +
    6. template<typename ValT> void push_front_impl(ValT item);
      7. +
    7. template<typename ValT> iterator insert_impl(iterator pos, ValT item);
      8. +
    8. template<typename ValT> iterator rinsert_impl(iterator pos, ValT item);
    9. -
      void check_position(size_type index) const;
      Check if the index is valid.
      10. +
      void check_position(size_type index) const;
      Check if the index is valid.
    10. -
      template<typename Pointer> void increment(Pointer & p) const;
      Increment the pointer.
      11. +
      template<typename Pointer> void increment(Pointer & p) const;
      Increment the pointer.
    11. -
      template<typename Pointer> void decrement(Pointer & p) const;
      Decrement the pointer.
      12. +
      template<typename Pointer> void decrement(Pointer & p) const;
      Decrement the pointer.
    12. -
      template<typename Pointer> Pointer add(Pointer p, difference_type n) const;
      Add n to the pointer.
      13. +
      template<typename Pointer> Pointer add(Pointer p, difference_type n) const;
      Add n to the pointer.
    13. -
      template<typename Pointer> Pointer sub(Pointer p, difference_type n) const;
      Subtract n from the pointer.
      14. +
      template<typename Pointer> Pointer sub(Pointer p, difference_type n) const;
      Subtract n from the pointer.
    14. -
      pointer map_pointer(pointer p) const;
      Map the null pointer to virtual end of circular buffer.
      15. +
      pointer map_pointer(pointer p) const;
      Map the null pointer to virtual end of circular buffer.
    15. -
      pointer allocate(size_type n);
      Allocate memory.
      16. +
      pointer allocate(size_type n);
      Allocate memory.
    16. -
      void deallocate(pointer p, size_type n);
      Deallocate memory.
      17. +
      void deallocate(pointer p, size_type n);
      Deallocate memory.
    17. -
      bool is_uninitialized(const_pointer p) const noexcept;
      Does the pointer point to the uninitialized memory?
      18. +
      bool is_uninitialized(const_pointer p) const noexcept;
      Does the pointer point to the uninitialized memory?
    18. -
      void replace(pointer pos, param_value_type item);
      Replace an element.
      19. +
      void replace(pointer pos, param_value_type item);
      Replace an element.
    19. -
      void replace(pointer pos, rvalue_type item);
      Replace an element.
      20. +
      void replace(pointer pos, rvalue_type item);
      Replace an element.
    20. -
      void construct_or_replace(bool construct, pointer pos, param_value_type item);
      Construct or replace an element.

      construct has to be set to true if and only if pos points to an uninitialized memory.

      +
      void construct_or_replace(bool construct, pointer pos, param_value_type item);
      Construct or replace an element.

      construct has to be set to true if and only if pos points to an uninitialized memory.

    21. -
      void construct_or_replace(bool construct, pointer pos, rvalue_type item);
      Construct or replace an element.

      construct has to be set to true if and only if pos points to an uninitialized memory.

      +
      void construct_or_replace(bool construct, pointer pos, rvalue_type item);
      Construct or replace an element.

      construct has to be set to true if and only if pos points to an uninitialized memory.

    22. -
      void destroy_item(pointer p);
      Destroy an item.
      23. +
      void destroy_item(pointer p);
      Destroy an item.
    23. -
      void destroy_if_constructed(pointer pos);
      Destroy an item only if it has been constructed.
      24. +
      void destroy_if_constructed(pointer pos);
      Destroy an item only if it has been constructed.
    24. -
      void destroy_content();
      Destroy the whole content of the circular buffer.
      25. +
      void destroy_content();
      Destroy the whole content of the circular buffer.
    25. -
      void destroy_content(const true_type &);
      Specialized destroy_content method.
      26. +
      void destroy_content(const true_type &);
      Specialized destroy_content method.
    26. -
      void destroy_content(const false_type &);
      Specialized destroy_content method.
      27. +
      void destroy_content(const false_type &);
      Specialized destroy_content method.
    27. -
      void destroy() noexcept;
      Destroy content and free allocated memory.
      28. +
      void destroy() noexcept;
      Destroy content and free allocated memory.
    28. -
      void initialize_buffer(capacity_type buffer_capacity);
      Initialize the internal buffer.
      29. +
      void initialize_buffer(capacity_type buffer_capacity);
      Initialize the internal buffer.
    29. -
      void initialize_buffer(capacity_type buffer_capacity, param_value_type item);
      Initialize the internal buffer.
      30. +
      void initialize_buffer(capacity_type buffer_capacity, param_value_type item);
      Initialize the internal buffer. 
    30. template<typename IntegralType> 
-  void initialize(IntegralType n, IntegralType item, const true_type &);
      Specialized initialize method.
      31. + void initialize(IntegralType n, IntegralType item, const true_type &);Specialized initialize method. 
    31. template<typename Iterator> 
-  void initialize(Iterator first, Iterator last, const false_type &);
      Specialized initialize method.
      32. + void initialize(Iterator first, Iterator last, const false_type &);Specialized initialize method. 
    32. template<typename InputIterator> 
-  void initialize(InputIterator first, InputIterator last, 
+  void initialize(InputIterator first, InputIterator last, 
                   const std::input_iterator_tag &);
      Specialized initialize method. 
    33. template<typename ForwardIterator> 
-  void initialize(ForwardIterator first, ForwardIterator last, 
+  void initialize(ForwardIterator first, ForwardIterator last, 
                   const std::forward_iterator_tag &);
      Specialized initialize method. 
    34. template<typename IntegralType> 
-  void initialize(capacity_type buffer_capacity, IntegralType n, 
+  void initialize(capacity_type buffer_capacity, IntegralType n, 
                   IntegralType item, const true_type &);
      Specialized initialize method. 
    35. template<typename Iterator> 
-  void initialize(capacity_type buffer_capacity, Iterator first, 
+  void initialize(capacity_type buffer_capacity, Iterator first, 
                   Iterator last, const false_type &);
      Specialized initialize method. 
    36. template<typename InputIterator> 
-  void initialize(capacity_type buffer_capacity, InputIterator first, 
+  void initialize(capacity_type buffer_capacity, InputIterator first, 
                   InputIterator last, const std::input_iterator_tag &);
      Specialized initialize method. 
    37. template<typename ForwardIterator> 
-  void initialize(capacity_type buffer_capacity, ForwardIterator first, 
+  void initialize(capacity_type buffer_capacity, ForwardIterator first, 
                   ForwardIterator last, const std::forward_iterator_tag &);
      Specialized initialize method. 
    38. template<typename ForwardIterator> 
-  void initialize(capacity_type buffer_capacity, ForwardIterator first, 
+  void initialize(capacity_type buffer_capacity, ForwardIterator first, 
                   ForwardIterator last, size_type distance);
      Initialize the circular buffer.
    39. -
      void reset(pointer buff, pointer last, capacity_type new_capacity);
      Reset the circular buffer.
      40. +
      void reset(pointer buff, pointer last, capacity_type new_capacity);
      Reset the circular buffer.
    40. -
      void swap_allocator(circular_buffer< T, Alloc > &, const true_type &);
      Specialized method for swapping the allocator.
      41. +
      void swap_allocator(circular_buffer< T, Alloc > &, const true_type &);
      Specialized method for swapping the allocator.
    41. -
      void swap_allocator(circular_buffer< T, Alloc > & cb, const false_type &);
      Specialized method for swapping the allocator.
      42. +
      void swap_allocator(circular_buffer< T, Alloc > & cb, const false_type &);
      Specialized method for swapping the allocator. 
    42. template<typename IntegralType> 
-  void assign(IntegralType n, IntegralType item, const true_type &);
      Specialized assign method.
      43. + void assign(IntegralType n, IntegralType item, const true_type &);Specialized assign method. 
    43. template<typename Iterator> 
-  void assign(Iterator first, Iterator last, const false_type &);
      Specialized assign method.
      44. + void assign(Iterator first, Iterator last, const false_type &);Specialized assign method. 
    44. template<typename InputIterator> 
-  void assign(InputIterator first, InputIterator last, 
+  void assign(InputIterator first, InputIterator last, 
               const std::input_iterator_tag &);
      Specialized assign method. 
    45. template<typename ForwardIterator> 
-  void assign(ForwardIterator first, ForwardIterator last, 
+  void assign(ForwardIterator first, ForwardIterator last, 
               const std::forward_iterator_tag &);
      Specialized assign method. 
    46. template<typename IntegralType> 
-  void assign(capacity_type new_capacity, IntegralType n, IntegralType item, 
+  void assign(capacity_type new_capacity, IntegralType n, IntegralType item, 
               const true_type &);
      Specialized assign method. 
    47. template<typename Iterator> 
-  void assign(capacity_type new_capacity, Iterator first, Iterator last, 
+  void assign(capacity_type new_capacity, Iterator first, Iterator last, 
               const false_type &);
      Specialized assign method. 
    48. template<typename InputIterator> 
-  void assign(capacity_type new_capacity, InputIterator first, 
+  void assign(capacity_type new_capacity, InputIterator first, 
               InputIterator last, const std::input_iterator_tag &);
      Specialized assign method. 
    49. template<typename ForwardIterator> 
-  void assign(capacity_type new_capacity, ForwardIterator first, 
+  void assign(capacity_type new_capacity, ForwardIterator first, 
               ForwardIterator last, const std::forward_iterator_tag &);
      Specialized assign method. 
    50. template<typename Functor> 
-  void assign_n(capacity_type new_capacity, size_type n, const Functor & fnc);
      Helper assign method.
      51. + void assign_n(capacity_type new_capacity, size_type n, const Functor & fnc);Helper assign method.
    51. -
      template<typename ValT> iterator insert_item(const iterator & pos, ValT item);
      Helper insert method.
      52. +
      template<typename ValT> iterator insert_item(const iterator & pos, ValT item);
      Helper insert method. 
    52. template<typename IntegralType> 
-  void insert(const iterator & pos, IntegralType n, IntegralType item, 
+  void insert(const iterator & pos, IntegralType n, IntegralType item, 
               const true_type &);
      Specialized insert method. 
    53. template<typename Iterator> 
-  void insert(const iterator & pos, Iterator first, Iterator last, 
+  void insert(const iterator & pos, Iterator first, Iterator last, 
               const false_type &);
      Specialized insert method. 
    54. template<typename InputIterator> 
-  void insert(iterator pos, InputIterator first, InputIterator last, 
+  void insert(iterator pos, InputIterator first, InputIterator last, 
               const std::input_iterator_tag &);
      Specialized insert method. 
    55. template<typename ForwardIterator> 
-  void insert(const iterator & pos, ForwardIterator first, 
+  void insert(const iterator & pos, ForwardIterator first, 
               ForwardIterator last, const std::forward_iterator_tag &);
      Specialized insert method. 
    56. template<typename Wrapper> 
-  void insert_n(const iterator & pos, size_type n, const Wrapper & wrapper);
      Helper insert method.
      57. + void insert_n(const iterator & pos, size_type n, const Wrapper & wrapper);Helper insert method. 
    57. template<typename IntegralType> 
-  void rinsert(const iterator & pos, IntegralType n, IntegralType item, 
+  void rinsert(const iterator & pos, IntegralType n, IntegralType item, 
                const true_type &);
      Specialized rinsert method. 
    58. template<typename Iterator> 
-  void rinsert(const iterator & pos, Iterator first, Iterator last, 
+  void rinsert(const iterator & pos, Iterator first, Iterator last, 
                const false_type &);
      Specialized rinsert method. 
    59. template<typename InputIterator> 
-  void rinsert(iterator pos, InputIterator first, InputIterator last, 
+  void rinsert(iterator pos, InputIterator first, InputIterator last, 
                const std::input_iterator_tag &);
      Specialized insert method. 
    60. template<typename ForwardIterator> 
-  void rinsert(const iterator & pos, ForwardIterator first, 
+  void rinsert(const iterator & pos, ForwardIterator first, 
                ForwardIterator last, const std::forward_iterator_tag &);
      Specialized rinsert method. 
    61. template<typename Wrapper> 
-  void rinsert_n(const iterator & pos, size_type n, const Wrapper & wrapper);
      Helper rinsert method.
      62. + void rinsert_n(const iterator & pos, size_type n, const Wrapper & wrapper);Helper rinsert method.
    62. -
      void erase_begin(size_type n, const true_type &);
      Specialized erase_begin method.
      63. +
      void erase_begin(size_type n, const true_type &);
      Specialized erase_begin method.
    63. -
      void erase_begin(size_type n, const false_type &);
      Specialized erase_begin method.
      64. +
      void erase_begin(size_type n, const false_type &);
      Specialized erase_begin method.
    64. -
      void erase_end(size_type n, const true_type &);
      Specialized erase_end method.
      65. +
      void erase_end(size_type n, const true_type &);
      Specialized erase_end method.
    65. -
      void erase_end(size_type n, const false_type &);
      Specialized erase_end method.
      66. +
      void erase_end(size_type n, const false_type &);
      Specialized erase_end method.
    @@ -4274,7 +4274,7 @@ The number of min[end() - pos, max[0, distance(firs
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/container/adaptive_pool.html b/doc/html/boost/container/adaptive_pool.html index 2cc1de3aff..b041af950f 100644 --- a/doc/html/boost/container/adaptive_pool.html +++ b/doc/html/boost/container/adaptive_pool.html @@ -43,11 +43,11 @@ typedef T value_type; typedef T * pointer; typedef const T * const_pointer; - typedef unspecified reference; - typedef unspecified const_reference; + typedef ::boost::container::dtl::unvoid_ref< T >::type reference; + typedef ::boost::container::dtl::unvoid_ref< const T >::type const_reference; typedef std::size_t size_type; typedef std::ptrdiff_t difference_type; - typedef unspecified version; + typedef boost::container::dtl::version_type< self_t, Version > version; // member classes/structs/unions template<typename T2> @@ -57,38 +57,38 @@ }; // construct/copy/destruct - adaptive_pool() noexcept; - adaptive_pool(const adaptive_pool &) noexcept; + adaptive_pool() noexcept; + adaptive_pool(const adaptive_pool &) noexcept; template<typename T2> - adaptive_pool(const adaptive_pool< T2, NodesPerBlock, MaxFreeBlocks, OverheadPercent BOOST_CONTAINER_DOCIGN(BOOST_MOVE_I Version)> &) noexcept; - ~adaptive_pool(); + adaptive_pool(const adaptive_pool< T2, NodesPerBlock, MaxFreeBlocks, OverheadPercent BOOST_CONTAINER_DOCIGN(BOOST_MOVE_I Version)> &) noexcept; + ~adaptive_pool(); - // public member functions - BOOST_CONTAINER_DOCIGN(BOOST_STATIC_ASSERT((Version<=2))); - size_type max_size() const noexcept; - pointer allocate(size_type, const void * = 0); - void deallocate(const pointer &, size_type) noexcept; - pointer allocation_command(allocation_type, size_type, size_type &, + // public member functions + BOOST_CONTAINER_DOCIGN(BOOST_STATIC_ASSERT((Version<=2))); + size_type max_size() const noexcept; + pointer allocate(size_type, const void * = 0); + void deallocate(const pointer &, size_type) noexcept; + pointer allocation_command(allocation_type, size_type, size_type &, pointer &); - size_type size(pointer) const noexcept; - pointer allocate_one(); - void allocate_individual(std::size_t, multiallocation_chain &); - void deallocate_one(pointer) noexcept; - void deallocate_individual(multiallocation_chain &) noexcept; - void allocate_many(size_type, std::size_t, multiallocation_chain &); - void allocate_many(const size_type *, size_type, multiallocation_chain &); - void deallocate_many(multiallocation_chain &) noexcept; + size_type size(pointer) const noexcept; + pointer allocate_one(); + void allocate_individual(std::size_t, multiallocation_chain &); + void deallocate_one(pointer) noexcept; + void deallocate_individual(multiallocation_chain &) noexcept; + void allocate_many(size_type, std::size_t, multiallocation_chain &); + void allocate_many(const size_type *, size_type, multiallocation_chain &); + void deallocate_many(multiallocation_chain &) noexcept; - // public static functions - static void deallocate_free_blocks() noexcept; + // public static functions + static void deallocate_free_blocks() noexcept; - // friend functions - friend void swap(adaptive_pool &, adaptive_pool &) noexcept; - friend bool operator==(const adaptive_pool &, const adaptive_pool &) noexcept; - friend bool operator!=(const adaptive_pool &, const adaptive_pool &) noexcept; + // friend functions + friend void swap(adaptive_pool &, adaptive_pool &) noexcept; + friend bool operator==(const adaptive_pool &, const adaptive_pool &) noexcept; + friend bool operator!=(const adaptive_pool &, const adaptive_pool &) noexcept; - // private member functions - pointer priv_allocation_command(allocation_type, std::size_t, size_type &, + // private member functions + pointer priv_allocation_command(allocation_type, std::size_t, size_type &, pointer &); // public data members @@ -98,13 +98,13 @@ static const std::size_t real_nodes_per_block; };
    -

    Description

    +

    Description

    An STL node allocator that uses a modified DLMalloc as memory source.

    This node allocator shares a segregated storage between all instances of adaptive_pool with equal sizeof(T).

    NodesPerBlock is the number of nodes allocated at once when the allocator needs runs out of nodes. MaxFreeBlocks is the maximum number of totally free blocks that the adaptive node pool will hold. The rest of the totally free blocks will be deallocated to the memory manager.

    OverheadPercent is the (approximated) maximum size overhead (1-20%) of the allocator: (memory usable for nodes / total memory allocated from the memory allocator)

    -

    +

    adaptive_pool public types

    @@ -115,101 +115,101 @@
    • -

    +

    adaptive_pool public construct/copy/destruct

    1. -
      adaptive_pool() noexcept;
      Default constructor.
      2. +
      adaptive_pool() noexcept;
      Default constructor.
    2. -
      adaptive_pool(const adaptive_pool &) noexcept;
      Copy constructor from other adaptive_pool.
      3. +
      adaptive_pool(const adaptive_pool &) noexcept;
      Copy constructor from other adaptive_pool. 
    3. template<typename T2> 
-  adaptive_pool(const adaptive_pool< T2, NodesPerBlock, MaxFreeBlocks, OverheadPercent BOOST_CONTAINER_DOCIGN(BOOST_MOVE_I Version)> &) noexcept;
      Copy constructor from related adaptive_pool.
      4. + adaptive_pool(const adaptive_pool< T2, NodesPerBlock, MaxFreeBlocks, OverheadPercent BOOST_CONTAINER_DOCIGN(BOOST_MOVE_I Version)> &) noexcept;Copy constructor from related adaptive_pool.
    4. -
      ~adaptive_pool();
      Destructor.
      5. +
      ~adaptive_pool();
      Destructor.
    -

    -adaptive_pool public member functions

    +

    +adaptive_pool public member functions

      -
    1.  BOOST_CONTAINER_DOCIGN(BOOST_STATIC_ASSERT((Version<=2)));
      2. +
    2.  BOOST_CONTAINER_DOCIGN(BOOST_STATIC_ASSERT((Version<=2)));
    3. -
      size_type max_size() const noexcept;
      +
      size_type max_size() const noexcept;

      Returns the number of elements that could be allocated. Never throws

    4. -
      pointer allocate(size_type count, const void * = 0);
      +
      pointer allocate(size_type count, const void * = 0);

      Allocate memory for an array of count elements. Throws std::bad_alloc if there is no enough memory

    5. -
      void deallocate(const pointer & ptr, size_type count) noexcept;
      +
      void deallocate(const pointer & ptr, size_type count) noexcept;

      Deallocate allocated memory. Never throws

      6. -
    6. pointer allocation_command(allocation_type command, size_type limit_size, 
+
    7. pointer allocation_command(allocation_type command, size_type limit_size, 
                            size_type & prefer_in_recvd_out_size, 
                            pointer & reuse);
      8. 
 
    8. 
-
      size_type size(pointer p) const noexcept;
      
+
      size_type size(pointer p) const noexcept;
      
 
      Returns maximum the number of objects the previously allocated memory pointed by p can hold. 
      
 
      9. 
 
    9. 
-
      pointer allocate_one();
      
+
      pointer allocate_one();
      
 
      Allocates just one object. Memory allocated with this function must be deallocated only with deallocate_one(). Throws bad_alloc if there is no enough memory 
      
 
      10. 
 
    10. 
-
      void allocate_individual(std::size_t num_elements, 
+
      void allocate_individual(std::size_t num_elements, 
                          multiallocation_chain & chain);
      
 
      Allocates many elements of size == 1. Elements must be individually deallocated with deallocate_one() 
      
 
      11. 
 
    11. 
-
      void deallocate_one(pointer p) noexcept;
      
+
      void deallocate_one(pointer p) noexcept;
      
 
      Deallocates memory previously allocated with allocate_one(). You should never use deallocate_one to deallocate memory allocated with other functions different from allocate_one(). Never throws 
      
 
      12. 
-
    12. void deallocate_individual(multiallocation_chain & chain) noexcept;
      13. 
+
    13. void deallocate_individual(multiallocation_chain & chain) noexcept;
      14. 
 
    14. 
-
      void allocate_many(size_type elem_size, std::size_t n_elements, 
+
      void allocate_many(size_type elem_size, std::size_t n_elements, 
                    multiallocation_chain & chain);
      
 
      Allocates many elements of size elem_size. Elements must be individually deallocated with deallocate() 
      
 
      15. 
 
    15. 
-
      void allocate_many(const size_type * elem_sizes, size_type n_elements, 
+
      void allocate_many(const size_type * elem_sizes, size_type n_elements, 
                    multiallocation_chain & chain);
      
 
      Allocates n_elements elements, each one of size elem_sizes[i] Elements must be individually deallocated with deallocate() 
      
 
      16. 
-
    16. void deallocate_many(multiallocation_chain & chain) noexcept;
      17. 
+
    17. void deallocate_many(multiallocation_chain & chain) noexcept;
      18.
    -

    -adaptive_pool public static functions

    +

    +adaptive_pool public static functions

    1. -
      static void deallocate_free_blocks() noexcept;
      Deallocates all free blocks of the pool.
    +
    static void deallocate_free_blocks() noexcept;
    Deallocates all free blocks of the pool.
    -

    -adaptive_pool friend functions

    +

    +adaptive_pool friend functions

    1. -
      friend void swap(adaptive_pool &, adaptive_pool &) noexcept;
      +
      friend void swap(adaptive_pool &, adaptive_pool &) noexcept;

      Swaps allocators. Does not throw. If each allocator is placed in a different memory segment, the result is undefined.

    2. -
      friend bool operator==(const adaptive_pool &, const adaptive_pool &) noexcept;
      +
      friend bool operator==(const adaptive_pool &, const adaptive_pool &) noexcept;

      An allocator always compares to true, as memory allocated with one instance can be deallocated by another instance

    3. -
      friend bool operator!=(const adaptive_pool &, const adaptive_pool &) noexcept;
      +
      friend bool operator!=(const adaptive_pool &, const adaptive_pool &) noexcept;

      An allocator always compares to false, as memory allocated with one instance can be deallocated by another instance

    -

    -adaptive_pool private member functions

    -
    1. pointer priv_allocation_command(allocation_type command, 
+
      
+adaptive_pool private member functions
      
+
      1. pointer priv_allocation_command(allocation_type command, 
                                 std::size_t limit_size, 
                                 size_type & prefer_in_recvd_out_size, 
                                 pointer & reuse_ptr);
      
@@ -218,7 +218,8 @@
    -
    Copyright © 2009-2015 Ion Gaztanaga

    +

    Copyright © 2009-2017 Ion + Gaztanaga

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost/container/adaptive_pool/rebind.html b/doc/html/boost/container/adaptive_pool/rebind.html index f3473a4bd5..9175789359 100644 --- a/doc/html/boost/container/adaptive_pool/rebind.html +++ b/doc/html/boost/container/adaptive_pool/rebind.html @@ -6,7 +6,7 @@ - + @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -39,13 +39,14 @@ typedef adaptive_pool< T2, NodesPerBlock, MaxFreeBlocks, OverheadPercent > other; };
    -

    Description

    +

    Description

    Obtains adaptive_pool from adaptive_pool

    -
    Copyright © 2009-2015 Ion Gaztanaga

    +

    Copyright © 2009-2017 Ion + Gaztanaga

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    @@ -53,7 +54,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/container/allocator.html b/doc/html/boost/container/allocator.html index 3039f9ca86..b336ffcf0c 100644 --- a/doc/html/boost/container/allocator.html +++ b/doc/html/boost/container/allocator.html @@ -37,14 +37,14 @@ class allocator { public: // types - typedef T value_type; - typedef T * pointer; - typedef const T * const_pointer; - typedef T & reference; - typedef const T & const_reference; - typedef std::size_t size_type; - typedef std::ptrdiff_t difference_type; - typedef unspecified version; + typedef T value_type; + typedef T * pointer; + typedef const T * const_pointer; + typedef T & reference; + typedef const T & const_reference; + typedef std::size_t size_type; + typedef std::ptrdiff_t difference_type; + typedef boost::container::dtl::version_type< self_t, Version > version; // member classes/structs/unions template<typename T2> @@ -54,140 +54,140 @@ }; // construct/copy/destruct - allocator() noexcept; - allocator(const allocator &) noexcept; - template<typename T2> allocator(const allocator< T2 > &) noexcept; + allocator() noexcept; + allocator(const allocator &) noexcept; + template<typename T2> allocator(const allocator< T2 > &) noexcept; - // public member functions - pointer allocate(size_type, const void * = 0); - void deallocate(pointer, size_type) noexcept; - size_type max_size() const noexcept; - pointer allocation_command(allocation_type, size_type, size_type &, + // public member functions + pointer allocate(size_type, const void * = 0); + void deallocate(pointer, size_type) noexcept; + size_type max_size() const noexcept; + pointer allocation_command(allocation_type, size_type, size_type &, pointer &); - size_type size(pointer) const noexcept; - pointer allocate_one(); - void allocate_individual(std::size_t, multiallocation_chain &); - void deallocate_one(pointer) noexcept; - void deallocate_individual(multiallocation_chain &) noexcept; - void allocate_many(size_type, std::size_t, multiallocation_chain &); - void allocate_many(const size_type *, size_type, multiallocation_chain &); - void deallocate_many(multiallocation_chain &) noexcept; + size_type size(pointer) const noexcept; + pointer allocate_one(); + void allocate_individual(std::size_t, multiallocation_chain &); + void deallocate_one(pointer) noexcept; + void deallocate_individual(multiallocation_chain &) noexcept; + void allocate_many(size_type, std::size_t, multiallocation_chain &); + void allocate_many(const size_type *, size_type, multiallocation_chain &); + void deallocate_many(multiallocation_chain &) noexcept; - // friend functions - friend void swap(self_t &, self_t &) noexcept; - friend bool operator==(const allocator &, const allocator &) noexcept; - friend bool operator!=(const allocator &, const allocator &) noexcept; + // friend functions + friend void swap(self_t &, self_t &) noexcept; + friend bool operator==(const allocator &, const allocator &) noexcept; + friend bool operator!=(const allocator &, const allocator &) noexcept; - // private member functions - pointer priv_allocation_command(allocation_type, std::size_t, size_type &, + // private member functions + pointer priv_allocation_command(allocation_type, std::size_t, size_type &, pointer &); };
    -

    Description

    +

    Description

    This class is an extended STL-compatible that offers advanced allocation mechanism (in-place expansion, shrinking, burst-allocation...)

    This allocator is a wrapper around a modified DLmalloc. If Version is 1, the allocator is a STL conforming allocator. If Version is 2, the allocator offers advanced expand in place and burst allocation capabilities.

    AllocationDisableMask works only if Version is 2 and it can be an inclusive OR of allocation types the user wants to disable.

    -

    +

    allocator public construct/copy/destruct

    1. -
      allocator() noexcept;
      +
      allocator() noexcept;

      Default constructor Never throws

    2. -
      allocator(const allocator &) noexcept;
      +
      allocator(const allocator &) noexcept;

      Constructor from other allocator. Never throws

    3. -
      template<typename T2> allocator(const allocator< T2 > &) noexcept;
      +
      template<typename T2> allocator(const allocator< T2 > &) noexcept;

      Constructor from related allocator. Never throws

    -

    -allocator public member functions

    +

    +allocator public member functions

    1. -
      pointer allocate(size_type count, const void * hint = 0);
      +
      pointer allocate(size_type count, const void * hint = 0);

      Allocates memory for an array of count elements. Throws std::bad_alloc if there is no enough memory If Version is 2, this allocated memory can only be deallocated with deallocate() or (for Version == 2) deallocate_many()

    2. -
      void deallocate(pointer ptr, size_type) noexcept;
      +
      void deallocate(pointer ptr, size_type) noexcept;

      Deallocates previously allocated memory. Never throws

    3. -
      size_type max_size() const noexcept;
      +
      size_type max_size() const noexcept;

      Returns the maximum number of elements that could be allocated. Never throws

    4. -
      pointer allocation_command(allocation_type command, size_type limit_size, 
+
      pointer allocation_command(allocation_type command, size_type limit_size, 
                            size_type & prefer_in_recvd_out_size, 
                            pointer & reuse);
      
 
      An advanced function that offers in-place expansion shrink to fit and new allocation capabilities. Memory allocated with this function can only be deallocated with deallocate() or deallocate_many(). This function is available only with Version == 2
    5. -
      size_type size(pointer p) const noexcept;
      +
      size_type size(pointer p) const noexcept;

      Returns maximum the number of objects the previously allocated memory pointed by p can hold. Memory must not have been allocated with allocate_one or allocate_individual. This function is available only with Version == 2

    6. -
      pointer allocate_one();
      +
      pointer allocate_one();

      Allocates just one object. Memory allocated with this function must be deallocated only with deallocate_one(). Throws bad_alloc if there is no enough memory This function is available only with Version == 2

    7. -
      void allocate_individual(std::size_t num_elements, 
+
      void allocate_individual(std::size_t num_elements, 
                          multiallocation_chain & chain);
      
 
      Allocates many elements of size == 1. Elements must be individually deallocated with deallocate_one() This function is available only with Version == 2
    8. -
      void deallocate_one(pointer p) noexcept;
      +
      void deallocate_one(pointer p) noexcept;

      Deallocates memory previously allocated with allocate_one(). You should never use deallocate_one to deallocate memory allocated with other functions different from allocate_one() or allocate_individual.

    9. -
      void deallocate_individual(multiallocation_chain & chain) noexcept;
      +
      void deallocate_individual(multiallocation_chain & chain) noexcept;

      Deallocates memory allocated with allocate_one() or allocate_individual(). This function is available only with Version == 2

    10. -
      void allocate_many(size_type elem_size, std::size_t n_elements, 
+
      void allocate_many(size_type elem_size, std::size_t n_elements, 
                    multiallocation_chain & chain);
      
 
      Allocates many elements of size elem_size. Elements must be individually deallocated with deallocate() This function is available only with Version == 2
    11. -
      void allocate_many(const size_type * elem_sizes, size_type n_elements, 
+
      void allocate_many(const size_type * elem_sizes, size_type n_elements, 
                    multiallocation_chain & chain);
      
 
      Allocates n_elements elements, each one of size elem_sizes[i] Elements must be individually deallocated with deallocate() This function is available only with Version == 2
    12. -
      void deallocate_many(multiallocation_chain & chain) noexcept;
      +
      void deallocate_many(multiallocation_chain & chain) noexcept;

      Deallocates several elements allocated by allocate_many(), allocate(), or allocation_command(). This function is available only with Version == 2

    -

    -allocator friend functions

    +

    +allocator friend functions

    1. -
      friend void swap(self_t &, self_t &) noexcept;
      +
      friend void swap(self_t &, self_t &) noexcept;

      Swaps two allocators, does nothing because this allocator is stateless

    2. -
      friend bool operator==(const allocator &, const allocator &) noexcept;
      +
      friend bool operator==(const allocator &, const allocator &) noexcept;

      An allocator always compares to true, as memory allocated with one instance can be deallocated by another instance

    3. -
      friend bool operator!=(const allocator &, const allocator &) noexcept;
      +
      friend bool operator!=(const allocator &, const allocator &) noexcept;

      An allocator always compares to false, as memory allocated with one instance can be deallocated by another instance

    -

    -allocator private member functions

    -
    1. pointer priv_allocation_command(allocation_type command, 
+
      
+allocator private member functions
      
+
      1. pointer priv_allocation_command(allocation_type command, 
                                 std::size_t limit_size, 
                                 size_type & prefer_in_recvd_out_size, 
                                 pointer & reuse_ptr);
      
@@ -196,7 +196,8 @@
    -
    Copyright © 2009-2015 Ion Gaztanaga

    +

    Copyright © 2009-2017 Ion + Gaztanaga

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost/container/allocator/rebind.html b/doc/html/boost/container/allocator/rebind.html index 062eec0f4a..5cce918ae5 100644 --- a/doc/html/boost/container/allocator/rebind.html +++ b/doc/html/boost/container/allocator/rebind.html @@ -6,7 +6,7 @@ - + @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -39,13 +39,14 @@ typedef allocator< T2, Version, AllocationDisableMask > other; };
    -

    Description

    +

    Description

    Obtains an allocator that allocates objects of type T2

    -
    Copyright © 2009-2015 Ion Gaztanaga

    +

    Copyright © 2009-2017 Ion + Gaztanaga

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    @@ -53,7 +54,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/container/allocator_arg.html b/doc/html/boost/container/allocator_arg.html index f4543a92fc..f79769e46f 100644 --- a/doc/html/boost/container/allocator_arg.html +++ b/doc/html/boost/container/allocator_arg.html @@ -34,13 +34,14 @@ static allocator_arg_t allocator_arg;
    -

    Description

    +

    Description

    A instance of type allocator_arg_t

    -
    Copyright © 2009-2015 Ion Gaztanaga

    +

    Copyright © 2009-2017 Ion + Gaztanaga

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost/container/allocator_arg_t.html b/doc/html/boost/container/allocator_arg_t.html index d79dcd0fcd..e38b5f8c64 100644 --- a/doc/html/boost/container/allocator_arg_t.html +++ b/doc/html/boost/container/allocator_arg_t.html @@ -35,13 +35,14 @@ typedef unspecified allocator_arg_t;
    -

    Description

    +

    Description

    The allocator_arg_t struct is an empty structure type used as a unique type to disambiguate constructor and function overloading. Specifically, several types have constructors with allocator_arg_t as the first argument, immediately followed by an argument of a type that satisfies Allocator requirements

    -
    Copyright © 2009-2015 Ion Gaztanaga

    +

    Copyright © 2009-2017 Ion + Gaztanaga

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost/container/allocator_traits.html b/doc/html/boost/container/allocator_traits.html index 776c973c09..eaeacaef0b 100644 --- a/doc/html/boost/container/allocator_traits.html +++ b/doc/html/boost/container/allocator_traits.html @@ -45,9 +45,9 @@ typedef see_documentation const_void_pointer; typedef see_documentation difference_type; typedef see_documentation size_type; - typedef see_documentation propagate_on_container_copy_assignment; - typedef see_documentation propagate_on_container_move_assignment; - typedef see_documentation propagate_on_container_swap; + typedef see_documentation propagate_on_container_copy_assignment; + typedef see_documentation propagate_on_container_move_assignment; + typedef see_documentation propagate_on_container_swap; typedef see_documentation is_always_equal; typedef see_documentation is_partially_propagable; typedef see_documentation rebind_alloc; @@ -60,23 +60,23 @@ typedef see_documentation type; }; - // public static functions - static pointer allocate(Allocator &, size_type); - static void deallocate(Allocator &, pointer, size_type); - static pointer allocate(Allocator &, size_type, const_void_pointer); - template<typename T> static void destroy(Allocator &, T *) noexcept; - static size_type max_size(const Allocator &) noexcept; - static Allocator select_on_container_copy_construction(const Allocator &); + // public static functions + static pointer allocate(Allocator &, size_type); + static void deallocate(Allocator &, pointer, size_type); + static pointer allocate(Allocator &, size_type, const_void_pointer); + template<typename T> static void destroy(Allocator &, T *) noexcept; + static size_type max_size(const Allocator &) noexcept; + static Allocator select_on_container_copy_construction(const Allocator &); template<typename T, class... Args> - static void construct(Allocator &, T *, Args &&...); - static bool storage_is_unpropagable(const Allocator &, pointer) noexcept; - static bool equal(const Allocator &, const Allocator &) noexcept; + static void construct(Allocator &, T *, Args &&...); + static bool storage_is_unpropagable(const Allocator &, pointer) noexcept; + static bool equal(const Allocator &, const Allocator &) noexcept; };
    -

    Description

    +

    Description

    The class template allocator_traits supplies a uniform interface to all allocator types. This class is a C++03-compatible implementation of std::allocator_traits

    -

    +

    allocator_traits public types

    @@ -123,17 +123,17 @@

  • -typedef see_documentation propagate_on_container_copy_assignment;

    +typedef see_documentation propagate_on_container_copy_assignment;

    Allocator::propagate_on_container_copy_assignment if such a type exists, otherwise a type with an internal constant static boolean member value == false.

  • -typedef see_documentation propagate_on_container_move_assignment;

    +typedef see_documentation propagate_on_container_move_assignment;

    Allocator::propagate_on_container_move_assignment if such a type exists, otherwise a type with an internal constant static boolean member value == false.

  • -typedef see_documentation propagate_on_container_swap;

    +typedef see_documentation propagate_on_container_swap;

    Allocator::propagate_on_container_swap if such a type exists, otherwise a type with an internal constant static boolean member value == false.

  • @@ -160,45 +160,45 @@
    • -

    -allocator_traits public static functions

    +

    +allocator_traits public static functions

    1. -
      static pointer allocate(Allocator & a, size_type n);
      +
      static pointer allocate(Allocator & a, size_type n);

      Returns: a.allocate(n)

    2. -
      static void deallocate(Allocator & a, pointer p, size_type n);
      +
      static void deallocate(Allocator & a, pointer p, size_type n);

      Returns: a.deallocate(p, n)

      Throws: Nothing

    3. -
      static pointer allocate(Allocator & a, size_type n, const_void_pointer p);
      +
      static pointer allocate(Allocator & a, size_type n, const_void_pointer p);

      Effects: calls a.allocate(n, p) if that call is well-formed; otherwise, invokes a.allocate(n)

    4. -
      template<typename T> static void destroy(Allocator & a, T * p) noexcept;
      +
      template<typename T> static void destroy(Allocator & a, T * p) noexcept;

      Effects: calls a.destroy(p) if that call is well-formed; otherwise, invokes p->~T().

    5. -
      static size_type max_size(const Allocator & a) noexcept;
      +
      static size_type max_size(const Allocator & a) noexcept;

      Returns: a.max_size() if that expression is well-formed; otherwise, numeric_limits<size_type>::max().

    6. -
      static Allocator select_on_container_copy_construction(const Allocator & a);
      +
      static Allocator select_on_container_copy_construction(const Allocator & a);

      Returns: a.select_on_container_copy_construction() if that expression is well-formed; otherwise, a. 

    7. template<typename T, class... Args> 
-  static void construct(Allocator & a, T * p, Args &&... args);
      + static void construct(Allocator & a, T * p, Args &&... args);

      Effects: calls a.construct(p, std::forward<Args>(args)...) if that call is well-formed; otherwise, invokes placement new (static_cast<void*>(p)) T(std::forward<Args>(args)...)

    8. -
      static bool storage_is_unpropagable(const Allocator & a, pointer p) noexcept;
      +
      static bool storage_is_unpropagable(const Allocator & a, pointer p) noexcept;

      Returns: a.storage_is_unpropagable(p) if is_partially_propagable::value is true; otherwise, false.

    9. -
      static bool equal(const Allocator & a, const Allocator & b) noexcept;
      +
      static bool equal(const Allocator & a, const Allocator & b) noexcept;

      Returns: true if is_always_equal::value == true, otherwise, a == b.

    @@ -207,7 +207,8 @@
    -
    Copyright © 2009-2015 Ion Gaztanaga

    +

    Copyright © 2009-2017 Ion + Gaztanaga

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost/container/allocator_traits/portable_rebind_alloc.html b/doc/html/boost/container/allocator_traits/portable_rebind_alloc.html index 395fec00a6..e0f2dfe425 100644 --- a/doc/html/boost/container/allocator_traits/portable_rebind_alloc.html +++ b/doc/html/boost/container/allocator_traits/portable_rebind_alloc.html @@ -6,7 +6,7 @@ - + @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -39,13 +39,14 @@ typedef see_documentation type; };
    -

    Description

    +

    Description

    Non-standard extension: Portable allocator rebind for C++03 and C++11 compilers. type is an allocator related to Allocator deduced deduced by rules explained in rebind_alloc.

    -
    Copyright © 2009-2015 Ion Gaztanaga

    +

    Copyright © 2009-2017 Ion + Gaztanaga

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    @@ -53,7 +54,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/container/basic_string.html b/doc/html/boost/container/basic_string.html index d43ed7600d..0a8a57f20d 100644 --- a/doc/html/boost/container/basic_string.html +++ b/doc/html/boost/container/basic_string.html @@ -7,7 +7,7 @@ - + @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -34,7 +34,7 @@ template<typename CharT, typename Traits = std::char_traits<CharT>, typename Allocator = new_allocator<CharT> > -class basic_string { +class basic_string : private dtl::basic_string_base< Allocator > { public: // types typedef Traits traits_type; @@ -53,214 +53,214 @@ typedef implementation_defined const_reverse_iterator; // construct/copy/destruct - basic_string() noexcept(container_detail::is_nothrow_default_constructible< Allocator >::value)); - explicit basic_string(const allocator_type &) noexcept; - basic_string(const basic_string &); + basic_string() noexcept(dtl::is_nothrow_default_constructible< Allocator >::value)); + explicit basic_string(const allocator_type &) noexcept; + basic_string(const basic_string &); template<template< class, class > class BasicStringView> - explicit basic_string(BasicStringView< CharT, Traits >, + explicit basic_string(BasicStringView< CharT, Traits >, const Allocator & = Allocator()); - basic_string(basic_string &&) noexcept; - basic_string(const basic_string &, const allocator_type &); - basic_string(basic_string &&, const allocator_type &); - basic_string(const basic_string &, size_type, size_type = npos); - basic_string(const basic_string &, size_type, size_type, + basic_string(basic_string &&) noexcept; + basic_string(const basic_string &, const allocator_type &); + basic_string(basic_string &&, const allocator_type &); + basic_string(const basic_string &, size_type, size_type = npos); + basic_string(const basic_string &, size_type, size_type, const allocator_type &); - basic_string(const CharT *, size_type); - basic_string(const CharT *, size_type, const allocator_type &); - basic_string(const CharT *); - basic_string(const CharT *, const allocator_type &); - basic_string(size_type, CharT); - basic_string(size_type, CharT, const allocator_type &); - basic_string(size_type, default_init_t); - basic_string(size_type, default_init_t, const allocator_type &); - template<typename InputIterator> basic_string(InputIterator, InputIterator); + basic_string(const CharT *, size_type); + basic_string(const CharT *, size_type, const allocator_type &); + basic_string(const CharT *); + basic_string(const CharT *, const allocator_type &); + basic_string(size_type, CharT); + basic_string(size_type, CharT, const allocator_type &); + basic_string(size_type, default_init_t); + basic_string(size_type, default_init_t, const allocator_type &); + template<typename InputIterator> basic_string(InputIterator, InputIterator); template<typename InputIterator> - basic_string(InputIterator, InputIterator, const allocator_type &); - basic_string(std::initializer_list< value_type >, + basic_string(InputIterator, InputIterator, const allocator_type &); + basic_string(std::initializer_list< value_type >, const allocator_type & = allocator_type()); - basic_string & operator=(const basic_string &); + basic_string & operator=(const basic_string &); basic_string & - operator=(basic_string &&) noexcept(allocator_traits_type::propagate_on_container_move_assignment::value||allocator_traits_type::is_always_equal::value)); - basic_string & operator=(const CharT *); - basic_string & operator=(CharT); + operator=(basic_string &&) noexcept(allocator_traits_type::propagate_on_container_move_assignment::value||allocator_traits_type::is_always_equal::value)); + basic_string & operator=(const CharT *); + basic_string & operator=(CharT); template<template< class, class > class BasicStringView> - basic_string & operator=(BasicStringView< CharT, Traits >); - basic_string & operator=(std::initializer_list< CharT >); - ~basic_string(); + basic_string & operator=(BasicStringView< CharT, Traits >); + basic_string & operator=(std::initializer_list< CharT >); + ~basic_string(); - // public member functions - allocator_type get_allocator() const noexcept; - stored_allocator_type & get_stored_allocator() noexcept; - const stored_allocator_type & get_stored_allocator() const noexcept; - iterator begin() noexcept; - const_iterator begin() const noexcept; - iterator end() noexcept; - const_iterator end() const noexcept; - reverse_iterator rbegin() noexcept; - const_reverse_iterator rbegin() const noexcept; - reverse_iterator rend() noexcept; - const_reverse_iterator rend() const noexcept; - const_iterator cbegin() const noexcept; - const_iterator cend() const noexcept; - const_reverse_iterator crbegin() const noexcept; - const_reverse_iterator crend() const noexcept; - bool empty() const noexcept; - size_type size() const noexcept; - size_type length() const noexcept; - size_type max_size() const noexcept; - void resize(size_type, CharT); - void resize(size_type); - void resize(size_type, default_init_t); - size_type capacity() const noexcept; - void reserve(size_type); - void shrink_to_fit(); - reference front() noexcept; - const_reference front() const noexcept; - reference back() noexcept; - const_reference back() const noexcept; - reference operator[](size_type) noexcept; - const_reference operator[](size_type) const noexcept; - reference at(size_type); - const_reference at(size_type) const; - basic_string & operator+=(const basic_string &); + // public member functions + allocator_type get_allocator() const noexcept; + stored_allocator_type & get_stored_allocator() noexcept; + const stored_allocator_type & get_stored_allocator() const noexcept; + iterator begin() noexcept; + const_iterator begin() const noexcept; + iterator end() noexcept; + const_iterator end() const noexcept; + reverse_iterator rbegin() noexcept; + const_reverse_iterator rbegin() const noexcept; + reverse_iterator rend() noexcept; + const_reverse_iterator rend() const noexcept; + const_iterator cbegin() const noexcept; + const_iterator cend() const noexcept; + const_reverse_iterator crbegin() const noexcept; + const_reverse_iterator crend() const noexcept; + bool empty() const noexcept; + size_type size() const noexcept; + size_type length() const noexcept; + size_type max_size() const noexcept; + void resize(size_type, CharT); + void resize(size_type); + void resize(size_type, default_init_t); + size_type capacity() const noexcept; + void reserve(size_type); + void shrink_to_fit(); + reference front() noexcept; + const_reference front() const noexcept; + reference back() noexcept; + const_reference back() const noexcept; + reference operator[](size_type) noexcept; + const_reference operator[](size_type) const noexcept; + reference at(size_type); + const_reference at(size_type) const; + basic_string & operator+=(const basic_string &); template<template< class, class > class BasicStringView> - basic_string & operator+=(BasicStringView< CharT, Traits >); - basic_string & operator+=(const CharT *); - basic_string & operator+=(CharT); - basic_string & operator+=(std::initializer_list< CharT >); - basic_string & append(const basic_string &); + basic_string & operator+=(BasicStringView< CharT, Traits >); + basic_string & operator+=(const CharT *); + basic_string & operator+=(CharT); + basic_string & operator+=(std::initializer_list< CharT >); + basic_string & append(const basic_string &); template<template< class, class > class BasicStringView> - basic_string & append(BasicStringView< CharT, Traits >); - basic_string & append(const basic_string &, size_type, size_type = npos); - basic_string & append(const CharT *, size_type); - basic_string & append(const CharT *); - basic_string & append(size_type, CharT); - template<typename InputIter> basic_string & append(InputIter, InputIter); - basic_string & append(std::initializer_list< CharT >); - void push_back(CharT); - basic_string & assign(const basic_string &); + basic_string & append(BasicStringView< CharT, Traits >); + basic_string & append(const basic_string &, size_type, size_type = npos); + basic_string & append(const CharT *, size_type); + basic_string & append(const CharT *); + basic_string & append(size_type, CharT); + template<typename InputIter> basic_string & append(InputIter, InputIter); + basic_string & append(std::initializer_list< CharT >); + void push_back(CharT); + basic_string & assign(const basic_string &); template<template< class, class > class BasicStringView> - basic_string & assign(BasicStringView< CharT, Traits >); - basic_string & assign(basic_string &&) noexcept; - basic_string & assign(const basic_string &, size_type, size_type); - basic_string & assign(const CharT *, size_type); - basic_string & assign(const CharT *); - basic_string & assign(size_type, CharT); - basic_string & assign(const CharT *, const CharT *); - template<typename InputIter> basic_string & assign(InputIter, InputIter); - basic_string & assign(std::initializer_list< CharT >); - basic_string & insert(size_type, const basic_string &); + basic_string & assign(BasicStringView< CharT, Traits >); + basic_string & assign(basic_string &&) noexcept; + basic_string & assign(const basic_string &, size_type, size_type); + basic_string & assign(const CharT *, size_type); + basic_string & assign(const CharT *); + basic_string & assign(size_type, CharT); + basic_string & assign(const CharT *, const CharT *); + template<typename InputIter> basic_string & assign(InputIter, InputIter); + basic_string & assign(std::initializer_list< CharT >); + basic_string & insert(size_type, const basic_string &); basic_string & - insert(size_type, const basic_string &, size_type, size_type = npos); - basic_string & insert(size_type, const CharT *, size_type); - basic_string & insert(size_type, const CharT *); - basic_string & insert(size_type, size_type, CharT); + insert(size_type, const basic_string &, size_type, size_type = npos); + basic_string & insert(size_type, const CharT *, size_type); + basic_string & insert(size_type, const CharT *); + basic_string & insert(size_type, size_type, CharT); template<template< class, class > class BasicStringView> - basic_string & insert(size_type, BasicStringView< CharT, Traits >); - iterator insert(const_iterator, CharT); - iterator insert(const_iterator, size_type, CharT); + basic_string & insert(size_type, BasicStringView< CharT, Traits >); + iterator insert(const_iterator, CharT); + iterator insert(const_iterator, size_type, CharT); template<typename InputIter> - iterator insert(const_iterator, InputIter, InputIter); - iterator insert(const_iterator, std::initializer_list< CharT >); - void pop_back() noexcept; - basic_string & erase(size_type = 0, size_type = npos); - iterator erase(const_iterator) noexcept; - iterator erase(const_iterator, const_iterator) noexcept; - void clear() noexcept; - basic_string & replace(size_type, size_type, const basic_string &); + iterator insert(const_iterator, InputIter, InputIter); + iterator insert(const_iterator, std::initializer_list< CharT >); + void pop_back() noexcept; + basic_string & erase(size_type = 0, size_type = npos); + iterator erase(const_iterator) noexcept; + iterator erase(const_iterator, const_iterator) noexcept; + void clear() noexcept; + basic_string & replace(size_type, size_type, const basic_string &); template<template< class, class > class BasicStringView> basic_string & - replace(size_type, size_type, BasicStringView< CharT, Traits >); + replace(size_type, size_type, BasicStringView< CharT, Traits >); basic_string & - replace(size_type, size_type, const basic_string &, size_type, + replace(size_type, size_type, const basic_string &, size_type, size_type = npos); template<template< class, class > class BasicStringView> basic_string & - replace(size_type, size_type, BasicStringView< CharT, Traits >, size_type, + replace(size_type, size_type, BasicStringView< CharT, Traits >, size_type, size_type = npos); - basic_string & replace(size_type, size_type, const CharT *, size_type); - basic_string & replace(size_type, size_type, const CharT *); - basic_string & replace(size_type, size_type, size_type, CharT); - basic_string & replace(const_iterator, const_iterator, const basic_string &); + basic_string & replace(size_type, size_type, const CharT *, size_type); + basic_string & replace(size_type, size_type, const CharT *); + basic_string & replace(size_type, size_type, size_type, CharT); + basic_string & replace(const_iterator, const_iterator, const basic_string &); basic_string & - replace(const_iterator, const_iterator, const CharT *, size_type); - basic_string & replace(const_iterator, const_iterator, const CharT *); - basic_string & replace(const_iterator, const_iterator, size_type, CharT); + replace(const_iterator, const_iterator, const CharT *, size_type); + basic_string & replace(const_iterator, const_iterator, const CharT *); + basic_string & replace(const_iterator, const_iterator, size_type, CharT); template<typename InputIter> basic_string & - replace(const_iterator, const_iterator, InputIter, InputIter); + replace(const_iterator, const_iterator, InputIter, InputIter); template<template< class, class > class BasicStringView> basic_string & - replace(const_iterator, const_iterator, BasicStringView< CharT, Traits >); + replace(const_iterator, const_iterator, BasicStringView< CharT, Traits >); basic_string & - replace(const_iterator, const_iterator, std::initializer_list< CharT >); - size_type copy(CharT *, size_type, size_type = 0) const; - void swap(basic_string &) noexcept(allocator_traits_type::propagate_on_container_swap::value||allocator_traits_type::is_always_equal::value)); - const CharT * c_str() const noexcept; - const CharT * data() const noexcept; - CharT * data() noexcept; + replace(const_iterator, const_iterator, std::initializer_list< CharT >); + size_type copy(CharT *, size_type, size_type = 0) const; + void swap(basic_string &) noexcept(allocator_traits_type::propagate_on_container_swap::value||allocator_traits_type::is_always_equal::value)); + const CharT * c_str() const noexcept; + const CharT * data() const noexcept; + CharT * data() noexcept; template<template< class, class > class BasicStringView> - operator BasicStringView< CharT, Traits >() const noexcept; - template<typename BasicStringView> BasicStringView to_view() const noexcept; - size_type find(const basic_string &, size_type = 0) const; + operator BasicStringView< CharT, Traits >() const noexcept; + template<typename BasicStringView> BasicStringView to_view() const noexcept; + size_type find(const basic_string &, size_type = 0) const; template<template< class, class > class BasicStringView> - size_type find(BasicStringView< CharT, Traits >, size_type = 0) const; - size_type find(const CharT *, size_type, size_type) const; - size_type find(const CharT *, size_type = 0) const; - size_type find(CharT, size_type = 0) const; - size_type rfind(const basic_string &, size_type = npos) const; + size_type find(BasicStringView< CharT, Traits >, size_type = 0) const; + size_type find(const CharT *, size_type, size_type) const; + size_type find(const CharT *, size_type = 0) const; + size_type find(CharT, size_type = 0) const; + size_type rfind(const basic_string &, size_type = npos) const; template<template< class, class > class BasicStringView> - size_type rfind(BasicStringView< CharT, Traits >, size_type = npos) const; - size_type rfind(const CharT *, size_type, size_type) const; - size_type rfind(const CharT *, size_type = npos) const; - size_type rfind(CharT, size_type = npos) const; - size_type find_first_of(const basic_string &, size_type = 0) const; + size_type rfind(BasicStringView< CharT, Traits >, size_type = npos) const; + size_type rfind(const CharT *, size_type, size_type) const; + size_type rfind(const CharT *, size_type = npos) const; + size_type rfind(CharT, size_type = npos) const; + size_type find_first_of(const basic_string &, size_type = 0) const; template<template< class, class > class BasicStringView> - size_type find_first_of(BasicStringView< CharT, Traits >, size_type = 0) const; - size_type find_first_of(const CharT *, size_type, size_type) const; - size_type find_first_of(const CharT *, size_type = 0) const; - size_type find_first_of(CharT, size_type = 0) const; - size_type find_last_of(const basic_string &, size_type = npos) const; + size_type find_first_of(BasicStringView< CharT, Traits >, size_type = 0) const; + size_type find_first_of(const CharT *, size_type, size_type) const; + size_type find_first_of(const CharT *, size_type = 0) const; + size_type find_first_of(CharT, size_type = 0) const; + size_type find_last_of(const basic_string &, size_type = npos) const; template<template< class, class > class BasicStringView> - size_type find_last_of(BasicStringView< CharT, Traits >, size_type = npos) const; - size_type find_last_of(const CharT *, size_type, size_type) const; - size_type find_last_of(const CharT *, size_type = npos) const; - size_type find_last_of(CharT, size_type = npos) const; - size_type find_first_not_of(const basic_string &, size_type = 0) const; + size_type find_last_of(BasicStringView< CharT, Traits >, size_type = npos) const; + size_type find_last_of(const CharT *, size_type, size_type) const; + size_type find_last_of(const CharT *, size_type = npos) const; + size_type find_last_of(CharT, size_type = npos) const; + size_type find_first_not_of(const basic_string &, size_type = 0) const; template<template< class, class > class BasicStringView> - size_type find_first_not_of(BasicStringView< CharT, Traits >, + size_type find_first_not_of(BasicStringView< CharT, Traits >, size_type = 0) const; - size_type find_first_not_of(const CharT *, size_type, size_type) const; - size_type find_first_not_of(const CharT *, size_type = 0) const; - size_type find_first_not_of(CharT, size_type = 0) const; - size_type find_last_not_of(const basic_string &, size_type = npos) const; + size_type find_first_not_of(const CharT *, size_type, size_type) const; + size_type find_first_not_of(const CharT *, size_type = 0) const; + size_type find_first_not_of(CharT, size_type = 0) const; + size_type find_last_not_of(const basic_string &, size_type = npos) const; template<template< class, class > class BasicStringView> - size_type find_last_not_of(BasicStringView< CharT, Traits >, + size_type find_last_not_of(BasicStringView< CharT, Traits >, size_type = npos) const; - size_type find_last_not_of(const CharT *, size_type, size_type) const; - size_type find_last_not_of(const CharT *, size_type = npos) const; - size_type find_last_not_of(CharT, size_type = npos) const; - basic_string substr(size_type = 0, size_type = npos) const; - int compare(const basic_string &) const; + size_type find_last_not_of(const CharT *, size_type, size_type) const; + size_type find_last_not_of(const CharT *, size_type = npos) const; + size_type find_last_not_of(CharT, size_type = npos) const; + basic_string substr(size_type = 0, size_type = npos) const; + int compare(const basic_string &) const; template<template< class, class > class BasicStringView> - int compare(BasicStringView< CharT, Traits >) const; - int compare(size_type, size_type, const basic_string &) const; + int compare(BasicStringView< CharT, Traits >) const; + int compare(size_type, size_type, const basic_string &) const; template<template< class, class > class BasicStringView> - int compare(size_type, size_type, BasicStringView< CharT, Traits >) const; - int compare(size_type, size_type, const basic_string &, size_type, + int compare(size_type, size_type, BasicStringView< CharT, Traits >) const; + int compare(size_type, size_type, const basic_string &, size_type, size_type = npos) const; template<template< class, class > class BasicStringView> - int compare(size_type, size_type, BasicStringView< CharT, Traits >, + int compare(size_type, size_type, BasicStringView< CharT, Traits >, size_type, size_type) const; - int compare(const CharT *) const; - int compare(size_type, size_type, const CharT *, size_type) const; - int compare(size_type, size_type, const CharT *) const; + int compare(const CharT *) const; + int compare(size_type, size_type, const CharT *, size_type) const; + int compare(size_type, size_type, const CharT *) const; // public data members static const size_type npos; };
    -

    Description

    +

    Description

    The basic_string class represents a Sequence of characters. It contains all the usual operations of a Sequence, and, additionally, it contains standard string operations such as search and concatenation.

    The basic_string class is parameterized by character type, and by that type's Character Traits.

    This class has performance characteristics very much like vector<>, meaning, for example, that it does not perform reference-count or copy-on-write, and that concatenation of two strings is an O(N) operation.

    @@ -270,7 +270,7 @@

    -

    Template Parameters

    +

    Template Parameters

    1. typename CharT
      @@ -287,140 +287,140 @@
    -

    +

    basic_string public construct/copy/destruct

    1. -
      basic_string() noexcept(container_detail::is_nothrow_default_constructible< Allocator >::value));
      +
      basic_string() noexcept(dtl::is_nothrow_default_constructible< Allocator >::value));

      Effects: Default constructs a basic_string.

      Throws: If allocator_type's default constructor throws.

    2. -
      explicit basic_string(const allocator_type & a) noexcept;
      +
      explicit basic_string(const allocator_type & a) noexcept;

      Effects: Constructs a basic_string taking the allocator as parameter.

      Throws: Nothing

    3. -
      basic_string(const basic_string & s);
      +
      basic_string(const basic_string & s);

      Effects: Copy constructs a basic_string.

      Postcondition: x == *this.

      Throws: If allocator_type's default constructor or allocation throws. 

    4. template<template< class, class > class BasicStringView> 
-  explicit basic_string(BasicStringView< CharT, Traits > sv, 
+  explicit basic_string(BasicStringView< CharT, Traits > sv, 
                         const Allocator & a = Allocator());

      Effects: Same as basic_string(sv.data(), sv.size(), a).

      Throws: If allocator_type's default constructor or allocation throws.

    5. -
      basic_string(basic_string && s) noexcept;
      +
      basic_string(basic_string && s) noexcept;

      Effects: Move constructor. Moves s's resources to *this.

      Throws: Nothing.

      Complexity: Constant.

    6. -
      basic_string(const basic_string & s, const allocator_type & a);
      +
      basic_string(const basic_string & s, const allocator_type & a);

      Effects: Copy constructs a basic_string using the specified allocator.

      Postcondition: x == *this.

      Throws: If allocation throws.

    7. -
      basic_string(basic_string && s, const allocator_type & a);
      +
      basic_string(basic_string && s, const allocator_type & a);

      Effects: Move constructor using the specified allocator. Moves s's resources to *this.

      Throws: If allocation throws.

      Complexity: Constant if a == s.get_allocator(), linear otherwise.

    8. -
      basic_string(const basic_string & s, size_type pos, size_type n = npos);
      +
      basic_string(const basic_string & s, size_type pos, size_type n = npos);

      Effects: Constructs a basic_string with a default-constructed allocator, and is initialized by a specific number of characters of the s string.

    9. -
      basic_string(const basic_string & s, size_type pos, size_type n, 
+
      basic_string(const basic_string & s, size_type pos, size_type n, 
              const allocator_type & a);
      
 
      Effects: Constructs a basic_string taking the allocator as parameter, and is initialized by a specific number of characters of the s string.
    10. -
      basic_string(const CharT * s, size_type n);
      +
      basic_string(const CharT * s, size_type n);

      Effects: Constructs a basic_string taking a default-constructed allocator, and is initialized by a specific number of characters of the s c-string.

    11. -
      basic_string(const CharT * s, size_type n, const allocator_type & a);
      +
      basic_string(const CharT * s, size_type n, const allocator_type & a);

      Effects: Constructs a basic_string taking the allocator as parameter, and is initialized by a specific number of characters of the s c-string.

    12. -
      basic_string(const CharT * s);
      +
      basic_string(const CharT * s);

      Effects: Constructs a basic_string with a default-constructed allocator, and is initialized by the null-terminated s c-string.

    13. -
      basic_string(const CharT * s, const allocator_type & a);
      +
      basic_string(const CharT * s, const allocator_type & a);

      Effects: Constructs a basic_string taking the allocator as parameter, and is initialized by the null-terminated s c-string.

    14. -
      basic_string(size_type n, CharT c);
      +
      basic_string(size_type n, CharT c);

      Effects: Constructs a basic_string with a default-constructed allocator, and is initialized by n copies of c.

    15. -
      basic_string(size_type n, CharT c, const allocator_type & a);
      +
      basic_string(size_type n, CharT c, const allocator_type & a);

      Effects: Constructs a basic_string taking the allocator as parameter, and is initialized by n copies of c.

    16. -
      basic_string(size_type n, default_init_t);
      +
      basic_string(size_type n, default_init_t);

      Effects: Constructs a basic_string with a default-constructed allocator, and is initialized by n default-initialized characters.

    17. -
      basic_string(size_type n, default_init_t, const allocator_type & a);
      +
      basic_string(size_type n, default_init_t, const allocator_type & a);

      Effects: Constructs a basic_string taking the allocator as parameter, and is initialized by n default-initialized characters. 

    18. template<typename InputIterator> 
-  basic_string(InputIterator f, InputIterator l);
      + basic_string(InputIterator f, InputIterator l);

      Effects: Constructs a basic_string with a default-constructed allocator, and a range of iterators. 

    19. template<typename InputIterator> 
-  basic_string(InputIterator f, InputIterator l, const allocator_type & a);
      + basic_string(InputIterator f, InputIterator l, const allocator_type & a);

      Effects: Constructs a basic_string taking the allocator as parameter, and a range of iterators.

    20. -
      basic_string(std::initializer_list< value_type > il, 
+
      basic_string(std::initializer_list< value_type > il, 
              const allocator_type & a = allocator_type());
      
 
      Effects: Same as basic_string(il.begin(), il.end(), a).
    21. -
      basic_string & operator=(const basic_string & x);
      +
      basic_string & operator=(const basic_string & x);

      Effects: Copy constructs a string.

      Postcondition: x == *this.

      Complexity: Linear to the elements x contains. 

    22. basic_string & 
-operator=(basic_string && x) noexcept(allocator_traits_type::propagate_on_container_move_assignment::value||allocator_traits_type::is_always_equal::value));
      +operator=(basic_string && x) noexcept(allocator_traits_type::propagate_on_container_move_assignment::value||allocator_traits_type::is_always_equal::value));

      Effects: Move constructor. Moves x's resources to *this.

      Throws: If allocator_traits_type::propagate_on_container_move_assignment is false and allocation throws

      Complexity: Constant if allocator_traits_type:: propagate_on_container_move_assignment is true or this->get>allocator() == x.get_allocator(). Linear otherwise.

    23. -
      basic_string & operator=(const CharT * s);
      +
      basic_string & operator=(const CharT * s);

      Effects: Assignment from a null-terminated c-string.

    24. -
      basic_string & operator=(CharT c);
      +
      basic_string & operator=(CharT c);

      Effects: Returns *this = basic_string(1, c). 

    25. template<template< class, class > class BasicStringView> 
-  basic_string & operator=(BasicStringView< CharT, Traits > sv);
      + basic_string & operator=(BasicStringView< CharT, Traits > sv);

      Effects: Equivalent to return assign(sv).

    26. -
      basic_string & operator=(std::initializer_list< CharT > il);
      +
      basic_string & operator=(std::initializer_list< CharT > il);

      Effects: Returns *this = basic_string(il);

    27. -
      ~basic_string();
      +
      ~basic_string();

      Effects: Destroys the basic_string. All used memory is deallocated.

      Throws: Nothing.

      Complexity: Constant.

      @@ -428,350 +428,350 @@
    -

    -basic_string public member functions

    +

    +basic_string public member functions

    1. -
      allocator_type get_allocator() const noexcept;
      +
      allocator_type get_allocator() const noexcept;

      Effects: Returns a copy of the internal allocator.

      Throws: If allocator's copy constructor throws.

      Complexity: Constant.

    2. -
      stored_allocator_type & get_stored_allocator() noexcept;
      +
      stored_allocator_type & get_stored_allocator() noexcept;

      Effects: Returns a reference to the internal allocator.

      Throws: Nothing

      Complexity: Constant.

      Note: Non-standard extension.

    3. -
      const stored_allocator_type & get_stored_allocator() const noexcept;
      +
      const stored_allocator_type & get_stored_allocator() const noexcept;

      Effects: Returns a reference to the internal allocator.

      Throws: Nothing

      Complexity: Constant.

      Note: Non-standard extension.

    4. -
      iterator begin() noexcept;
      +
      iterator begin() noexcept;

      Effects: Returns an iterator to the first element contained in the vector.

      Throws: Nothing.

      Complexity: Constant.

    5. -
      const_iterator begin() const noexcept;
      +
      const_iterator begin() const noexcept;

      Effects: Returns a const_iterator to the first element contained in the vector.

      Throws: Nothing.

      Complexity: Constant.

    6. -
      iterator end() noexcept;
      +
      iterator end() noexcept;

      Effects: Returns an iterator to the end of the vector.

      Throws: Nothing.

      Complexity: Constant.

    7. -
      const_iterator end() const noexcept;
      +
      const_iterator end() const noexcept;

      Effects: Returns a const_iterator to the end of the vector.

      Throws: Nothing.

      Complexity: Constant.

    8. -
      reverse_iterator rbegin() noexcept;
      +
      reverse_iterator rbegin() noexcept;

      Effects: Returns a reverse_iterator pointing to the beginning of the reversed vector.

      Throws: Nothing.

      Complexity: Constant.

    9. -
      const_reverse_iterator rbegin() const noexcept;
      +
      const_reverse_iterator rbegin() const noexcept;

      Effects: Returns a const_reverse_iterator pointing to the beginning of the reversed vector.

      Throws: Nothing.

      Complexity: Constant.

    10. -
      reverse_iterator rend() noexcept;
      +
      reverse_iterator rend() noexcept;

      Effects: Returns a reverse_iterator pointing to the end of the reversed vector.

      Throws: Nothing.

      Complexity: Constant.

    11. -
      const_reverse_iterator rend() const noexcept;
      +
      const_reverse_iterator rend() const noexcept;

      Effects: Returns a const_reverse_iterator pointing to the end of the reversed vector.

      Throws: Nothing.

      Complexity: Constant.

    12. -
      const_iterator cbegin() const noexcept;
      +
      const_iterator cbegin() const noexcept;

      Effects: Returns a const_iterator to the first element contained in the vector.

      Throws: Nothing.

      Complexity: Constant.

    13. -
      const_iterator cend() const noexcept;
      +
      const_iterator cend() const noexcept;

      Effects: Returns a const_iterator to the end of the vector.

      Throws: Nothing.

      Complexity: Constant.

    14. -
      const_reverse_iterator crbegin() const noexcept;
      +
      const_reverse_iterator crbegin() const noexcept;

      Effects: Returns a const_reverse_iterator pointing to the beginning of the reversed vector.

      Throws: Nothing.

      Complexity: Constant.

    15. -
      const_reverse_iterator crend() const noexcept;
      +
      const_reverse_iterator crend() const noexcept;

      Effects: Returns a const_reverse_iterator pointing to the end of the reversed vector.

      Throws: Nothing.

      Complexity: Constant.

    16. -
      bool empty() const noexcept;
      +
      bool empty() const noexcept;

      Effects: Returns true if the vector contains no elements.

      Throws: Nothing.

      Complexity: Constant.

    17. -
      size_type size() const noexcept;
      +
      size_type size() const noexcept;

      Effects: Returns the number of the elements contained in the vector.

      Throws: Nothing.

      Complexity: Constant.

    18. -
      size_type length() const noexcept;
      +
      size_type length() const noexcept;

      Effects: Returns the number of the elements contained in the vector.

      Throws: Nothing.

      Complexity: Constant.

    19. -
      size_type max_size() const noexcept;
      +
      size_type max_size() const noexcept;

      Effects: Returns the largest possible size of the vector.

      Throws: Nothing.

      Complexity: Constant.

    20. -
      void resize(size_type n, CharT c);
      +
      void resize(size_type n, CharT c);

      Effects: Inserts or erases elements at the end such that the size becomes n. New elements are copy constructed from x.

      Throws: If memory allocation throws

      Complexity: Linear to the difference between size() and new_size.

    21. -
      void resize(size_type n);
      +
      void resize(size_type n);

      Effects: Inserts or erases elements at the end such that the size becomes n. New elements are value initialized.

      Throws: If memory allocation throws

      Complexity: Linear to the difference between size() and new_size.

    22. -
      void resize(size_type n, default_init_t);
      +
      void resize(size_type n, default_init_t);

      Effects: Inserts or erases elements at the end such that the size becomes n. New elements are uninitialized.

      Throws: If memory allocation throws

      Complexity: Linear to the difference between size() and new_size.

      Note: Non-standard extension

    23. -
      size_type capacity() const noexcept;
      +
      size_type capacity() const noexcept;

      Effects: Number of elements for which memory has been allocated. capacity() is always greater than or equal to size().

      Throws: Nothing.

      Complexity: Constant.

    24. -
      void reserve(size_type res_arg);
      +
      void reserve(size_type res_arg);

      Effects: If n is less than or equal to capacity(), this call has no effect. Otherwise, it is a request for allocation of additional memory. If the request is successful, then capacity() is greater than or equal to n; otherwise, capacity() is unchanged. In either case, size() is unchanged.

      Throws: If memory allocation allocation throws

    25. -
      void shrink_to_fit();
      +
      void shrink_to_fit();

      Effects: Tries to deallocate the excess of memory created with previous allocations. The size of the string is unchanged

      Throws: Nothing

      Complexity: Linear to size().

    26. -
      reference front() noexcept;
      +
      reference front() noexcept;

      Requires: !empty()

      Effects: Returns a reference to the first element of the container.

      Throws: Nothing.

      Complexity: Constant.

    27. -
      const_reference front() const noexcept;
      +
      const_reference front() const noexcept;

      Requires: !empty()

      Effects: Returns a const reference to the first element of the container.

      Throws: Nothing.

      Complexity: Constant.

    28. -
      reference back() noexcept;
      +
      reference back() noexcept;

      Requires: !empty()

      Effects: Returns a reference to the last element of the container.

      Throws: Nothing.

      Complexity: Constant.

    29. -
      const_reference back() const noexcept;
      +
      const_reference back() const noexcept;

      Requires: !empty()

      Effects: Returns a const reference to the last element of the container.

      Throws: Nothing.

      Complexity: Constant.

    30. -
      reference operator[](size_type n) noexcept;
      +
      reference operator[](size_type n) noexcept;

      Requires: size() > n.

      Effects: Returns a reference to the nth element from the beginning of the container.

      Throws: Nothing.

      Complexity: Constant.

    31. -
      const_reference operator[](size_type n) const noexcept;
      +
      const_reference operator[](size_type n) const noexcept;

      Requires: size() > n.

      Effects: Returns a const reference to the nth element from the beginning of the container.

      Throws: Nothing.

      Complexity: Constant.

    32. -
      reference at(size_type n);
      +
      reference at(size_type n);

      Requires: size() > n.

      Effects: Returns a reference to the nth element from the beginning of the container.

      Throws: std::range_error if n >= size()

      Complexity: Constant.

    33. -
      const_reference at(size_type n) const;
      +
      const_reference at(size_type n) const;

      Requires: size() > n.

      Effects: Returns a const reference to the nth element from the beginning of the container.

      Throws: std::range_error if n >= size()

      Complexity: Constant.

    34. -
      basic_string & operator+=(const basic_string & s);
      +
      basic_string & operator+=(const basic_string & s);

      Effects: Calls append(str.data, str.size()).

      Returns: *this 

    35. template<template< class, class > class BasicStringView> 
-  basic_string & operator+=(BasicStringView< CharT, Traits > sv);
      + basic_string & operator+=(BasicStringView< CharT, Traits > sv);

      Effects: Same as return append(sv).

    36. -
      basic_string & operator+=(const CharT * s);
      +
      basic_string & operator+=(const CharT * s);

      Effects: Calls append(s).

      Returns: *this

    37. -
      basic_string & operator+=(CharT c);
      +
      basic_string & operator+=(CharT c);

      Effects: Calls append(1, c).

      Returns: *this

    38. -
      basic_string & operator+=(std::initializer_list< CharT > il);
      +
      basic_string & operator+=(std::initializer_list< CharT > il);

      Effects: Returns append(il)

    39. -
      basic_string & append(const basic_string & s);
      +
      basic_string & append(const basic_string & s);

      Effects: Calls append(str.data(), str.size()).

      Returns: *this 

    40. template<template< class, class > class BasicStringView> 
-  basic_string & append(BasicStringView< CharT, Traits > sv);
      + basic_string & append(BasicStringView< CharT, Traits > sv);

      Effects: Same as return append(sv.data(), sv.size()). 

    41. basic_string & 
-append(const basic_string & s, size_type pos, size_type n = npos);
      +append(const basic_string & s, size_type pos, size_type n = npos);

      Requires: pos <= str.size()

      Effects: Determines the effective length rlen of the string to append as the smaller of n and str.size() - pos and calls append(str.data() + pos, rlen).

      Throws: If memory allocation throws and out_of_range if pos > str.size()

      Returns: *this

    42. -
      basic_string & append(const CharT * s, size_type n);
      +
      basic_string & append(const CharT * s, size_type n);

      Requires: s points to an array of at least n elements of CharT.

      Effects: The function replaces the string controlled by *this with a string of length size() + n whose irst size() elements are a copy of the original string controlled by *this and whose remaining elements are a copy of the initial n elements of s.

      Throws: If memory allocation throws length_error if size() + n > max_size().

      Returns: *this

    43. -
      basic_string & append(const CharT * s);
      +
      basic_string & append(const CharT * s);

      Requires: s points to an array of at least traits::length(s) + 1 elements of CharT.

      Effects: Calls append(s, traits::length(s)).

      Returns: *this

    44. -
      basic_string & append(size_type n, CharT c);
      +
      basic_string & append(size_type n, CharT c);

      Effects: Equivalent to append(basic_string(n, c)).

      Returns: *this 

    45. template<typename InputIter> 
-  basic_string & append(InputIter first, InputIter last);
      + basic_string & append(InputIter first, InputIter last);

      Requires: [first,last) is a valid range.

      Effects: Equivalent to append(basic_string(first, last)).

      Returns: *this

    46. -
      basic_string & append(std::initializer_list< CharT > il);
      +
      basic_string & append(std::initializer_list< CharT > il);

      Effects: Returns append(il.begin(), il.size()).

    47. -
      void push_back(CharT c);
      +
      void push_back(CharT c);

      Effects: Equivalent to append(static_cast<size_type>(1), c).

    48. -
      basic_string & assign(const basic_string & s);
      +
      basic_string & assign(const basic_string & s);

      Effects: Equivalent to assign(str, 0, npos).

      Returns: *this 

    49. template<template< class, class > class BasicStringView> 
-  basic_string & assign(BasicStringView< CharT, Traits > sv);
      + basic_string & assign(BasicStringView< CharT, Traits > sv);

      Effects: Equivalent to return assign(sv.data(), sv.size()).

      Returns: *this

    50. -
      basic_string & assign(basic_string && ms) noexcept;
      +
      basic_string & assign(basic_string && ms) noexcept;

      Effects: The function replaces the string controlled by *this with a string of length str.size() whose elements are a copy of the string controlled by str. Leaves str in a valid but unspecified state.

      Throws: Nothing

      Returns: *this

    51. -
      basic_string & assign(const basic_string & s, size_type pos, size_type n);
      +
      basic_string & assign(const basic_string & s, size_type pos, size_type n);

      Requires: pos <= str.size()

      Effects: Determines the effective length rlen of the string to assign as the smaller of n and str.size() - pos and calls assign(str.data() + pos rlen).

      Throws: If memory allocation throws or out_of_range if pos > str.size().

      Returns: *this

    52. -
      basic_string & assign(const CharT * s, size_type n);
      +
      basic_string & assign(const CharT * s, size_type n);

      Requires: s points to an array of at least n elements of CharT.

      Effects: Replaces the string controlled by *this with a string of length n whose elements are a copy of those pointed to by s.

      Throws: If memory allocation throws or length_error if n > max_size().

      Returns: *this

    53. -
      basic_string & assign(const CharT * s);
      +
      basic_string & assign(const CharT * s);

      Requires: s points to an array of at least traits::length(s) + 1 elements of CharT.

      Effects: Calls assign(s, traits::length(s)).

      Returns: *this

    54. -
      basic_string & assign(size_type n, CharT c);
      +
      basic_string & assign(size_type n, CharT c);

      Effects: Equivalent to assign(basic_string(n, c)).

      Returns: *this

    55. -
      basic_string & assign(const CharT * first, const CharT * last);
      +
      basic_string & assign(const CharT * first, const CharT * last);

      Effects: Equivalent to assign(basic_string(first, last)). Returns: *this 

    56. template<typename InputIter> 
-  basic_string & assign(InputIter first, InputIter last);
      + basic_string & assign(InputIter first, InputIter last);

      Effects: Equivalent to assign(basic_string(first, last)).

      Returns: *this

    57. -
      basic_string & assign(std::initializer_list< CharT > il);
      +
      basic_string & assign(std::initializer_list< CharT > il);

      Effects: Returns assign(il.begin(), il.size()).

    58. -
      basic_string & insert(size_type pos, const basic_string & s);
      +
      basic_string & insert(size_type pos, const basic_string & s);

      Requires: pos <= size().

      Effects: Calls insert(pos, str.data(), str.size()).

      Throws: If memory allocation throws or out_of_range if pos > size().

      @@ -779,7 +779,7 @@ 
    59. basic_string & 
-insert(size_type pos1, const basic_string & s, size_type pos2, 
+insert(size_type pos1, const basic_string & s, size_type pos2, 
        size_type n = npos);

      Requires: pos1 <= size() and pos2 <= str.size()

      Effects: Determines the effective length rlen of the string to insert as the smaller of n and str.size() - pos2 and calls insert(pos1, str.data() + pos2, rlen).

      @@ -787,88 +787,88 @@

      Returns: *this

    60. -
      basic_string & insert(size_type pos, const CharT * s, size_type n);
      +
      basic_string & insert(size_type pos, const CharT * s, size_type n);

      Requires: s points to an array of at least n elements of CharT and pos <= size().

      Effects: Replaces the string controlled by *this with a string of length size() + n whose first pos elements are a copy of the initial elements of the original string controlled by *this and whose next n elements are a copy of the elements in s and whose remaining elements are a copy of the remaining elements of the original string controlled by *this.

      Throws: If memory allocation throws, out_of_range if pos > size() or length_error if size() + n > max_size().

      Returns: *this

    61. -
      basic_string & insert(size_type pos, const CharT * s);
      +
      basic_string & insert(size_type pos, const CharT * s);

      Requires: pos <= size() and s points to an array of at least traits::length(s) + 1 elements of CharT

      Effects: Calls insert(pos, s, traits::length(s)).

      Throws: If memory allocation throws, out_of_range if pos > size() length_error if size() > max_size() - Traits::length(s)

      Returns: *this

    62. -
      basic_string & insert(size_type pos, size_type n, CharT c);
      +
      basic_string & insert(size_type pos, size_type n, CharT c);

      Effects: Equivalent to insert(pos, basic_string(n, c)).

      Throws: If memory allocation throws, out_of_range if pos > size() length_error if size() > max_size() - n

      Returns: *this 

    63. template<template< class, class > class BasicStringView> 
-  basic_string & insert(size_type pos, BasicStringView< CharT, Traits > sv);
      + basic_string & insert(size_type pos, BasicStringView< CharT, Traits > sv);

      Effects: Same as return insert(pos, sv.data(), sv.size()).

    64. -
      iterator insert(const_iterator p, CharT c);
      +
      iterator insert(const_iterator p, CharT c);

      Requires: p is a valid iterator on *this.

      Effects: inserts a copy of c before the character referred to by p.

      Returns: An iterator which refers to the copy of the inserted character.

    65. -
      iterator insert(const_iterator p, size_type n, CharT c);
      +
      iterator insert(const_iterator p, size_type n, CharT c);

      Requires: p is a valid iterator on *this.

      Effects: Inserts n copies of c before the character referred to by p.

      Returns: an iterator to the first inserted element or p if n is 0. 

    66. template<typename InputIter> 
-  iterator insert(const_iterator p, InputIter first, InputIter last);
      + iterator insert(const_iterator p, InputIter first, InputIter last);

      Requires: p is a valid iterator on *this. [first,last) is a valid range.

      Effects: Equivalent to insert(p - begin(), basic_string(first, last)).

      Returns: an iterator to the first inserted element or p if first == last.

    67. -
      iterator insert(const_iterator p, std::initializer_list< CharT > il);
      +
      iterator insert(const_iterator p, std::initializer_list< CharT > il);

      Effects: As if by insert(p, il.begin(), il.end()).

      Returns: An iterator which refers to the copy of the first inserted character, or p if i1 is empty.

    68. -
      void pop_back() noexcept;
      +
      void pop_back() noexcept;

      Effects: Removes the last element from the container.

      Throws: Nothing.

      Complexity: Constant time.

    69. -
      basic_string & erase(size_type pos = 0, size_type n = npos);
      +
      basic_string & erase(size_type pos = 0, size_type n = npos);

      Requires: pos <= size()

      Effects: Determines the effective length xlen of the string to be removed as the smaller of n and size() - pos. The function then replaces the string controlled by *this with a string of length size() - xlen whose first pos elements are a copy of the initial elements of the original string controlled by *this, and whose remaining elements are a copy of the elements of the original string controlled by *this beginning at position pos + xlen.

      Throws: out_of_range if pos > size().

      Returns: *this

    70. -
      iterator erase(const_iterator p) noexcept;
      +
      iterator erase(const_iterator p) noexcept;

      Effects: Removes the character referred to by p.

      Throws: Nothing

      Returns: An iterator which points to the element immediately following p prior to the element being erased. If no such element exists, end() is returned.

    71. -
      iterator erase(const_iterator first, const_iterator last) noexcept;
      +
      iterator erase(const_iterator first, const_iterator last) noexcept;

      Requires: first and last are valid iterators on *this, defining a range [first,last).

      Effects: Removes the characters in the range [first,last).

      Throws: Nothing

      Returns: An iterator which points to the element pointed to by last prior to the other elements being erased. If no such element exists, end() is returned.

    72. -
      void clear() noexcept;
      +
      void clear() noexcept;

      Effects: Erases all the elements of the vector.

      Throws: Nothing.

      Complexity: Linear to the number of elements in the vector.

    73. -
      basic_string & replace(size_type pos1, size_type n1, const basic_string & str);
      +
      basic_string & replace(size_type pos1, size_type n1, const basic_string & str);

      Requires: pos1 <= size().

      Effects: Calls replace(pos1, n1, str.data(), str.size()).

      Throws: if memory allocation throws or out_of_range if pos1 > size().

      @@ -877,12 +877,12 @@ 
    74. template<template< class, class > class BasicStringView> 
   basic_string & 
-  replace(size_type pos1, size_type n1, BasicStringView< CharT, Traits > sv);
      + replace(size_type pos1, size_type n1, BasicStringView< CharT, Traits > sv);

      Effects: Calls return replace(pos1, n1, sv.data(), sv.size());. 

    75. basic_string & 
-replace(size_type pos1, size_type n1, const basic_string & str, 
+replace(size_type pos1, size_type n1, const basic_string & str, 
         size_type pos2, size_type n2 = npos);

      Requires: pos1 <= size() and pos2 <= str.size().

      Effects: Determines the effective length rlen of the string to be inserted as the smaller of n2 and str.size() - pos2 and calls replace(pos1, n1, str.data() + pos2, rlen).

      @@ -892,7 +892,7 @@ 
    76. template<template< class, class > class BasicStringView> 
   basic_string & 
-  replace(size_type pos1, size_type n1, BasicStringView< CharT, Traits > sv, 
+  replace(size_type pos1, size_type n1, BasicStringView< CharT, Traits > sv, 
           size_type pos2, size_type n2 = npos);

      Throws: out_of_range if pos1 > size() or pos2 > sv.size().

      Effects: Determines the effective length rlen of the string to be inserted as the smaller of n2 and sv.size() - pos2 and calls replace(pos1, n1, sv.data() + pos2, rlen).

      @@ -900,21 +900,21 @@ 
    77. basic_string & 
-replace(size_type pos1, size_type n1, const CharT * s, size_type n2);
      +replace(size_type pos1, size_type n1, const CharT * s, size_type n2);

      Requires: pos1 <= size() and s points to an array of at least n2 elements of CharT.

      Effects: Determines the effective length xlen of the string to be removed as the smaller of n1 and size() - pos1. If size() - xlen >= max_size() - n2 throws length_error. Otherwise, the function replaces the string controlled by *this with a string of length size() - xlen + n2 whose first pos1 elements are a copy of the initial elements of the original string controlled by *this, whose next n2 elements are a copy of the initial n2 elements of s, and whose remaining elements are a copy of the elements of the original string controlled by *this beginning at position pos + xlen.

      Throws: if memory allocation throws, out_of_range if pos1 > size() or length_error if the length of the resulting string would exceed max_size()

      Returns: *this

    78. -
      basic_string & replace(size_type pos, size_type n1, const CharT * s);
      +
      basic_string & replace(size_type pos, size_type n1, const CharT * s);

      Requires: pos1 <= size() and s points to an array of at least n2 elements of CharT.

      Effects: Determines the effective length xlen of the string to be removed as the smaller of n1 and size() - pos1. If size() - xlen >= max_size() - n2 throws length_error. Otherwise, the function replaces the string controlled by *this with a string of length size() - xlen + n2 whose first pos1 elements are a copy of the initial elements of the original string controlled by *this, whose next n2 elements are a copy of the initial n2 elements of s, and whose remaining elements are a copy of the elements of the original string controlled by *this beginning at position pos + xlen.

      Throws: if memory allocation throws, out_of_range if pos1 > size() or length_error if the length of the resulting string would exceed max_size()

      Returns: *this

    79. -
      basic_string & replace(size_type pos1, size_type n1, size_type n2, CharT c);
      +
      basic_string & replace(size_type pos1, size_type n1, size_type n2, CharT c);

      Requires: pos1 <= size().

      Effects: Equivalent to replace(pos1, n1, basic_string(n2, c)).

      Throws: if memory allocation throws, out_of_range if pos1 > size() or length_error if the length of the resulting string would exceed max_size()

      @@ -922,7 +922,7 @@ 
    80. basic_string & 
-replace(const_iterator i1, const_iterator i2, const basic_string & str);
      +replace(const_iterator i1, const_iterator i2, const basic_string & str);

      Requires: [begin(),i1) and [i1,i2) are valid ranges.

      Effects: Calls replace(i1 - begin(), i2 - i1, str).

      Throws: if memory allocation throws

      @@ -930,14 +930,14 @@ 
    81. basic_string & 
-replace(const_iterator i1, const_iterator i2, const CharT * s, size_type n);
      +replace(const_iterator i1, const_iterator i2, const CharT * s, size_type n);

      Requires: [begin(),i1) and [i1,i2) are valid ranges and s points to an array of at least n elements

      Effects: Calls replace(i1 - begin(), i2 - i1, s, n).

      Throws: if memory allocation throws

      Returns: *this

    82. -
      basic_string & replace(const_iterator i1, const_iterator i2, const CharT * s);
      +
      basic_string & replace(const_iterator i1, const_iterator i2, const CharT * s);

      Requires: [begin(),i1) and [i1,i2) are valid ranges and s points to an array of at least traits::length(s) + 1 elements of CharT.

      Effects: Calls replace(i1 - begin(), i2 - i1, s, traits::length(s)).

      Throws: if memory allocation throws

      @@ -945,7 +945,7 @@ 
    83. basic_string & 
-replace(const_iterator i1, const_iterator i2, size_type n, CharT c);
      +replace(const_iterator i1, const_iterator i2, size_type n, CharT c);

      Requires: [begin(),i1) and [i1,i2) are valid ranges.

      Effects: Calls replace(i1 - begin(), i2 - i1, basic_string(n, c)).

      Throws: if memory allocation throws

      @@ -954,7 +954,7 @@ 
    84. template<typename InputIter> 
   basic_string & 
-  replace(const_iterator i1, const_iterator i2, InputIter j1, InputIter j2);
      + replace(const_iterator i1, const_iterator i2, InputIter j1, InputIter j2);

      Requires: [begin(),i1), [i1,i2) and [j1,j2) are valid ranges.

      Effects: Calls replace(i1 - begin(), i2 - i1, basic_string(j1, j2)).

      Throws: if memory allocation throws

      @@ -963,7 +963,7 @@ 
    85. template<template< class, class > class BasicStringView> 
   basic_string & 
-  replace(const_iterator i1, const_iterator i2, 
+  replace(const_iterator i1, const_iterator i2, 
           BasicStringView< CharT, Traits > sv);

      Requires: [begin(), i1) and [i1, i2) are valid ranges.

      Effects: Calls replace(i1 - begin(), i2 - i1, sv)..

      @@ -971,259 +971,259 @@ 
    86. basic_string & 
-replace(const_iterator i1, const_iterator i2, 
+replace(const_iterator i1, const_iterator i2, 
         std::initializer_list< CharT > il);

      Requires: [begin(), i1) and [i1, i2) are valid ranges.

      Effects: Calls replace(i1 - begin(), i2 - i1, il.begin(), il.size()).

      Returns: *this.

    87. -
      size_type copy(CharT * s, size_type n, size_type pos = 0) const;
      +
      size_type copy(CharT * s, size_type n, size_type pos = 0) const;

      Requires: pos <= size()

      Effects: Determines the effective length rlen of the string to copy as the smaller of n and size() - pos. s shall designate an array of at least rlen elements. The function then replaces the string designated by s with a string of length rlen whose elements are a copy of the string controlled by *this beginning at position pos. The function does not append a null object to the string designated by s.

      Throws: if memory allocation throws, out_of_range if pos > size().

      Returns: rlen

    88. -
      void swap(basic_string & x) noexcept(allocator_traits_type::propagate_on_container_swap::value||allocator_traits_type::is_always_equal::value));
      +
      void swap(basic_string & x) noexcept(allocator_traits_type::propagate_on_container_swap::value||allocator_traits_type::is_always_equal::value));

      Effects: *this contains the same sequence of characters that was in s, s contains the same sequence of characters that was in *this.

      Throws: Nothing

    89. -
      const CharT * c_str() const noexcept;
      +
      const CharT * c_str() const noexcept;

      Requires: The program shall not alter any of the values stored in the character array.

      Returns: A pointer p such that p + i == &operator[](i) for each i in [0,size()].

      Complexity: constant time.

    90. -
      const CharT * data() const noexcept;
      +
      const CharT * data() const noexcept;

      Requires: The program shall not alter any of the values stored in the character array.

      Returns: A pointer p such that p + i == &operator[](i) for each i in [0,size()].

      Complexity: constant time.

    91. -
      CharT * data() noexcept;
      +
      CharT * data() noexcept;

      Returns: A pointer p such that p + i == &operator[](i) for each i in [0,size()].

      Complexity: constant time. 

    92. template<template< class, class > class BasicStringView> 
-  operator BasicStringView< CharT, Traits >() const noexcept;
      + operator BasicStringView< CharT, Traits >() const noexcept;

      Returns: a string_view to the characters in the string.

      Complexity: constant time.

    93. -
      template<typename BasicStringView> BasicStringView to_view() const noexcept;
      +
      template<typename BasicStringView> BasicStringView to_view() const noexcept;

      Returns: a string_view to the characters in the string.

      Complexity: constant time.

      Note: This function is available to write portable code for compilers that don't support templated conversion operators.

    94. -
      size_type find(const basic_string & s, size_type pos = 0) const;
      +
      size_type find(const basic_string & s, size_type pos = 0) const;

      Effects: Determines the lowest position xpos, if possible, such that both of the following conditions hold: 1) pos <= xpos and xpos + str.size() <= size(); 2) traits::eq(at(xpos+I), str.at(I)) for all elements I of the string controlled by str.

      Throws: Nothing

      Returns: xpos if the function can determine such a value for xpos. Otherwise, returns npos. 

    95. template<template< class, class > class BasicStringView> 
-  size_type find(BasicStringView< CharT, Traits > sv, size_type pos = 0) const;
      + size_type find(BasicStringView< CharT, Traits > sv, size_type pos = 0) const;

      Effects: Determines the lowest position xpos, if possible, such that both of the following conditions hold: 1) pos <= xpos and xpos + sv.size() <= size(); 2) traits::eq(at(xpos+I), sv.at(I)) for all elements I of the string controlled by sv.

      Throws: Nothing

      Returns: xpos if the function can determine such a value for xpos. Otherwise, returns npos.

    96. -
      size_type find(const CharT * s, size_type pos, size_type n) const;
      +
      size_type find(const CharT * s, size_type pos, size_type n) const;

      Requires: s points to an array of at least n elements of CharT.

      Throws: Nothing

      Returns: find(basic_string<CharT,traits,Allocator>(s,n),pos).

    97. -
      size_type find(const CharT * s, size_type pos = 0) const;
      +
      size_type find(const CharT * s, size_type pos = 0) const;

      Requires: s points to an array of at least traits::length(s) + 1 elements of CharT.

      Throws: Nothing

      Returns: find(basic_string(s), pos).

    98. -
      size_type find(CharT c, size_type pos = 0) const;
      +
      size_type find(CharT c, size_type pos = 0) const;

      Throws: Nothing

      Returns: find(basic_string<CharT,traits,Allocator>(1,c), pos).

    99. -
      size_type rfind(const basic_string & str, size_type pos = npos) const;
      +
      size_type rfind(const basic_string & str, size_type pos = npos) const;

      Effects: Determines the highest position xpos, if possible, such that both of the following conditions obtain: a) xpos <= pos and xpos + str.size() <= size(); b) traits::eq(at(xpos+I), str.at(I)) for all elements I of the string controlled by str.

      Throws: Nothing

      Returns: xpos if the function can determine such a value for xpos. Otherwise, returns npos. 

    100. template<template< class, class > class BasicStringView> 
-  size_type rfind(BasicStringView< CharT, Traits > sv, size_type pos = npos) const;
      + size_type rfind(BasicStringView< CharT, Traits > sv, size_type pos = npos) const;

      Effects: Determines the highest position xpos, if possible, such that both of the following conditions obtain: a) xpos <= pos and xpos + sv.size() <= size(); b) traits::eq(at(xpos+I), sv.at(I)) for all elements I of the string controlled by sv.

      Throws: Nothing

      Returns: xpos if the function can determine such a value for xpos. Otherwise, returns npos.

    101. -
      size_type rfind(const CharT * s, size_type pos, size_type n) const;
      +
      size_type rfind(const CharT * s, size_type pos, size_type n) const;

      Requires: s points to an array of at least n elements of CharT.

      Throws: Nothing

      Returns: rfind(basic_string(s, n), pos).

    102. -
      size_type rfind(const CharT * s, size_type pos = npos) const;
      +
      size_type rfind(const CharT * s, size_type pos = npos) const;

      Requires: pos <= size() and s points to an array of at least traits::length(s) + 1 elements of CharT.

      Throws: Nothing

      Returns: rfind(basic_string(s), pos).

    103. -
      size_type rfind(CharT c, size_type pos = npos) const;
      +
      size_type rfind(CharT c, size_type pos = npos) const;

      Throws: Nothing

      Returns: rfind(basic_string<CharT,traits,Allocator>(1,c),pos).

    104. -
      size_type find_first_of(const basic_string & str, size_type pos = 0) const;
      +
      size_type find_first_of(const basic_string & str, size_type pos = 0) const;

      Effects: Determines the lowest position xpos, if possible, such that both of the following conditions obtain: a) pos <= xpos and xpos < size(); b) traits::eq(at(xpos), str.at(I)) for some element I of the string controlled by str.

      Throws: Nothing

      Returns: xpos if the function can determine such a value for xpos. Otherwise, returns npos. 

    105. template<template< class, class > class BasicStringView> 
-  size_type find_first_of(BasicStringView< CharT, Traits > sv, 
+  size_type find_first_of(BasicStringView< CharT, Traits > sv, 
                           size_type pos = 0) const;

      Effects: Determines the lowest position xpos, if possible, such that both of the following conditions obtain: a) pos <= xpos and xpos < size(); b) traits::eq(at(xpos), sv.at(I)) for some element I of the string controlled by sv.

      Throws: Nothing

      Returns: xpos if the function can determine such a value for xpos. Otherwise, returns npos.

    106. -
      size_type find_first_of(const CharT * s, size_type pos, size_type n) const;
      +
      size_type find_first_of(const CharT * s, size_type pos, size_type n) const;

      Requires: s points to an array of at least n elements of CharT.

      Throws: Nothing

      Returns: find_first_of(basic_string(s, n), pos).

    107. -
      size_type find_first_of(const CharT * s, size_type pos = 0) const;
      +
      size_type find_first_of(const CharT * s, size_type pos = 0) const;

      Requires: s points to an array of at least traits::length(s) + 1 elements of CharT.

      Throws: Nothing

      Returns: find_first_of(basic_string(s), pos).

    108. -
      size_type find_first_of(CharT c, size_type pos = 0) const;
      +
      size_type find_first_of(CharT c, size_type pos = 0) const;

      Requires: s points to an array of at least traits::length(s) + 1 elements of CharT.

      Throws: Nothing

      Returns: find_first_of(basic_string<CharT,traits,Allocator>(1,c), pos).

    109. -
      size_type find_last_of(const basic_string & str, size_type pos = npos) const;
      +
      size_type find_last_of(const basic_string & str, size_type pos = npos) const;

      Effects: Determines the highest position xpos, if possible, such that both of the following conditions obtain: a) xpos <= pos and xpos < size(); b) traits::eq(at(xpos), str.at(I)) for some element I of the string controlled by str.

      Throws: Nothing

      Returns: xpos if the function can determine such a value for xpos. Otherwise, returns npos. 

    110. template<template< class, class > class BasicStringView> 
-  size_type find_last_of(BasicStringView< CharT, Traits > sv, 
+  size_type find_last_of(BasicStringView< CharT, Traits > sv, 
                          size_type pos = npos) const;

      Effects: Determines the highest position xpos, if possible, such that both of the following conditions obtain: a) xpos <= pos and xpos < size(); b) traits::eq(at(xpos), str.at(I)) for some element I of the string controlled by str.

      Throws: Nothing

      Returns: xpos if the function can determine such a value for xpos. Otherwise, returns npos.

    111. -
      size_type find_last_of(const CharT * s, size_type pos, size_type n) const;
      +
      size_type find_last_of(const CharT * s, size_type pos, size_type n) const;

      Requires: s points to an array of at least n elements of CharT.

      Throws: Nothing

      Returns: find_last_of(basic_string(s, n), pos).

    112. -
      size_type find_last_of(const CharT * s, size_type pos = npos) const;
      +
      size_type find_last_of(const CharT * s, size_type pos = npos) const;

      Requires: s points to an array of at least traits::length(s) + 1 elements of CharT.

      Throws: Nothing

      Returns: find_last_of(basic_string<CharT,traits,Allocator>(1,c),pos).

    113. -
      size_type find_last_of(CharT c, size_type pos = npos) const;
      +
      size_type find_last_of(CharT c, size_type pos = npos) const;

      Throws: Nothing

      Returns: find_last_of(basic_string(s), pos).

    114. -
      size_type find_first_not_of(const basic_string & str, size_type pos = 0) const;
      +
      size_type find_first_not_of(const basic_string & str, size_type pos = 0) const;

      Effects: Determines the lowest position xpos, if possible, such that both of the following conditions obtain: a) pos <= xpos and xpos < size(); b) traits::eq(at(xpos), str.at(I)) for no element I of the string controlled by str.

      Throws: Nothing

      Returns: xpos if the function can determine such a value for xpos. Otherwise, returns npos. 

    115. template<template< class, class > class BasicStringView> 
-  size_type find_first_not_of(BasicStringView< CharT, Traits > sv, 
+  size_type find_first_not_of(BasicStringView< CharT, Traits > sv, 
                               size_type pos = 0) const;

      Effects: Determines the lowest position xpos, if possible, such that both of the following conditions obtain: a) pos <= xpos and xpos < size(); b) traits::eq(at(xpos), sv.at(I)) for no element I of the string controlled by sv.

      Throws: Nothing

      Returns: xpos if the function can determine such a value for xpos. Otherwise, returns npos.

    116. -
      size_type find_first_not_of(const CharT * s, size_type pos, size_type n) const;
      +
      size_type find_first_not_of(const CharT * s, size_type pos, size_type n) const;

      Requires: s points to an array of at least traits::length(s) + 1 elements of CharT.

      Throws: Nothing

      Returns: find_first_not_of(basic_string(s, n), pos).

    117. -
      size_type find_first_not_of(const CharT * s, size_type pos = 0) const;
      +
      size_type find_first_not_of(const CharT * s, size_type pos = 0) const;

      Requires: s points to an array of at least traits::length(s) + 1 elements of CharT.

      Throws: Nothing

      Returns: find_first_not_of(basic_string(s), pos).

    118. -
      size_type find_first_not_of(CharT c, size_type pos = 0) const;
      +
      size_type find_first_not_of(CharT c, size_type pos = 0) const;

      Throws: Nothing

      Returns: find_first_not_of(basic_string(1, c), pos).

    119. -
      size_type find_last_not_of(const basic_string & str, size_type pos = npos) const;
      +
      size_type find_last_not_of(const basic_string & str, size_type pos = npos) const;

      Effects: Determines the highest position xpos, if possible, such that both of the following conditions obtain: a) xpos <= pos and xpos < size(); b) traits::eq(at(xpos), str.at(I)) for no element I of the string controlled by str.

      Throws: Nothing

      Returns: xpos if the function can determine such a value for xpos. Otherwise, returns npos. 

    120. template<template< class, class > class BasicStringView> 
-  size_type find_last_not_of(BasicStringView< CharT, Traits > sv, 
+  size_type find_last_not_of(BasicStringView< CharT, Traits > sv, 
                              size_type pos = npos) const;

      Effects: Determines the highest position xpos, if possible, such that both of the following conditions obtain: a) xpos <= pos and xpos < size(); b) traits::eq(at(xpos), sv.at(I)) for no element I of the string controlled by sv.

      Throws: Nothing

      Returns: xpos if the function can determine such a value for xpos. Otherwise, returns npos.

    121. -
      size_type find_last_not_of(const CharT * s, size_type pos, size_type n) const;
      +
      size_type find_last_not_of(const CharT * s, size_type pos, size_type n) const;

      Requires: s points to an array of at least n elements of CharT.

      Throws: Nothing

      Returns: find_last_not_of(basic_string(s, n), pos).

    122. -
      size_type find_last_not_of(const CharT * s, size_type pos = npos) const;
      +
      size_type find_last_not_of(const CharT * s, size_type pos = npos) const;

      Requires: s points to an array of at least traits::length(s) + 1 elements of CharT.

      Throws: Nothing

      Returns: find_last_not_of(basic_string(s), pos).

    123. -
      size_type find_last_not_of(CharT c, size_type pos = npos) const;
      +
      size_type find_last_not_of(CharT c, size_type pos = npos) const;

      Throws: Nothing

      Returns: find_last_not_of(basic_string(1, c), pos).

    124. -
      basic_string substr(size_type pos = 0, size_type n = npos) const;
      +
      basic_string substr(size_type pos = 0, size_type n = npos) const;

      Requires: Requires: pos <= size()

      Effects: Determines the effective length rlen of the string to copy as the smaller of n and size() - pos.

      Throws: If memory allocation throws or out_of_range if pos > size().

      Returns: basic_string<CharT,traits,Allocator>(data()+pos,rlen).

    125. -
      int compare(const basic_string & str) const;
      +
      int compare(const basic_string & str) const;

      Effects: Determines the effective length rlen of the string to compare as the smaller of size() and str.size(). The function then compares the two strings by calling traits::compare(data(), str.data(), rlen).

      Throws: Nothing

      Returns: The nonzero result if the result of the comparison is nonzero. Otherwise, returns a value < 0 if size() < str.size(), a 0 value if size() == str.size(), and value > 0 if size() > str.size() 

    126. template<template< class, class > class BasicStringView> 
-  int compare(BasicStringView< CharT, Traits > sv) const;
      + int compare(BasicStringView< CharT, Traits > sv) const;

      Throws: Nothing

      Returns: compare(basic_string(sv)).

    127. -
      int compare(size_type pos1, size_type n1, const basic_string & str) const;
      +
      int compare(size_type pos1, size_type n1, const basic_string & str) const;

      Requires: pos1 <= size()

      Effects: Determines the effective length rlen of the string to compare as the smaller of (this->size() - pos1), n1 and str.size(). The function then compares the two strings by calling traits::compare(data()+pos1, str.data(), rlen).

      Throws: out_of_range if pos1 > size()

      @@ -1231,14 +1231,14 @@ 
    128. template<template< class, class > class BasicStringView> 
-  int compare(size_type pos1, size_type n1, 
+  int compare(size_type pos1, size_type n1, 
               BasicStringView< CharT, Traits > sv) const;

      Requires: pos1 <= size()

      Throws: out_of_range if pos1 > size()

      Returns:basic_string(*this,pos1,n1).compare(sv).

    129. -
      int compare(size_type pos1, size_type n1, const basic_string & str, 
+
      int compare(size_type pos1, size_type n1, const basic_string & str, 
             size_type pos2, size_type n2 = npos) const;
      
 
      Requires: pos1 <= size() and pos2 <= str.size()
      
 
      Effects: Determines the effective length rlen of the string to copy as the smaller of
      
@@ -1247,7 +1247,7 @@
 
    130. template<template< class, class > class BasicStringView> 
-  int compare(size_type pos1, size_type n1, 
+  int compare(size_type pos1, size_type n1, 
               BasicStringView< CharT, Traits > sv, size_type pos2, 
               size_type n2) const;

      Requires: pos1 <= size() and pos2 <= str.size()

      @@ -1256,18 +1256,18 @@

      Returns: basic_string(*this, pos1, n1).compare(BasicStringView<CharT, Traits>(sv, pos2, n2)).

    131. -
      int compare(const CharT * s) const;
      +
      int compare(const CharT * s) const;

      Throws: Nothing

      Returns: compare(basic_string(s)).

    132. -
      int compare(size_type pos1, size_type n1, const CharT * s, size_type n2) const;
      +
      int compare(size_type pos1, size_type n1, const CharT * s, size_type n2) const;

      Requires: pos1 > size() and s points to an array of at least n2 elements of CharT.

      Throws: out_of_range if pos1 > size()

      Returns: basic_string(*this, pos, n1).compare(basic_string(s, n2)).

    133. -
      int compare(size_type pos1, size_type n1, const CharT * s) const;
      +
      int compare(size_type pos1, size_type n1, const CharT * s) const;

      Requires: pos1 > size() and s points to an array of at least traits::length(s) + 1 elements of CharT.

      Throws: out_of_range if pos1 > size()

      Returns: basic_string(*this, pos, n1).compare(basic_string(s, n2)).

      @@ -1278,7 +1278,8 @@
    -
    Copyright © 2009-2015 Ion Gaztanaga

    +

    Copyright © 2009-2017 Ion + Gaztanaga

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    @@ -1286,7 +1287,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/container/constructible__idp60397280.html b/doc/html/boost/container/constructible__idp60397280.html new file mode 100644 index 0000000000..0d5ea68adf --- /dev/null +++ b/doc/html/boost/container/constructible__idp60397280.html @@ -0,0 +1,67 @@ + + + + +Struct template constructible_with_allocator_suffix + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Struct template constructible_with_allocator_suffix

    +

    boost::container::constructible_with_allocator_suffix

    +
    +

    Synopsis

    +
    // In header: <boost/container/uses_allocator.hpp>
+
+template<typename T> 
+struct constructible_with_allocator_suffix {
+
+  // public data members
+  static const bool value;
+};
    +
    +

    Description

    +

    Remark: if a specialization constructible_with_allocator_suffix<X>::value is true, indicates that T may be constructed with an allocator as its last constructor argument. Ideally, all constructors of T (including the copy and move constructors) should have a variant that accepts a final argument of allocator_type.

    +

    Requires: if a specialization constructible_with_allocator_suffix<X>::value is true, T must have a nested type, allocator_type and at least one constructor for which allocator_type is the last parameter. If not all constructors of T can be called with a final allocator_type argument, and if T is used in a context where a container must call such a constructor, then the program is ill-formed.

    +

    template <class T, class Allocator = allocator<T> > class Z { public: typedef Allocator allocator_type;

    +

    // Default constructor with optional allocator suffix Z(const allocator_type& a = allocator_type());

    +

    // Copy constructor and allocator-extended copy constructor Z(const Z& zz); Z(const Z& zz, const allocator_type& a); };

    +

    // Specialize trait for class template Z template <class T, class Allocator = allocator<T> > struct constructible_with_allocator_suffix<Z<T,Allocator> > { static const bool value = true; };

    +

    Note: This trait is a workaround inspired by "N2554: The Scoped A Model (Rev 2)" (Pablo Halpern, 2008-02-29) to backport the scoped allocator model to C++03, as in C++03 there is no mechanism to detect if a type can be constructed from arbitrary arguments. Applications aiming portability with several compilers should always define this trait.

    +

    In conforming C++11 compilers or compilers supporting SFINAE expressions (when BOOST_NO_SFINAE_EXPR is NOT defined), this trait is ignored and C++11 rules will be used to detect if a type should be constructed with suffix or prefix allocator arguments.

    +
    +
    + + + +
    Copyright © 2009-2017 Ion + Gaztanaga

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/container/constructible__idp60406672.html b/doc/html/boost/container/constructible__idp60406672.html new file mode 100644 index 0000000000..5399588ca6 --- /dev/null +++ b/doc/html/boost/container/constructible__idp60406672.html @@ -0,0 +1,69 @@ + + + + +Struct template constructible_with_allocator_prefix + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Struct template constructible_with_allocator_prefix

    +

    boost::container::constructible_with_allocator_prefix

    +
    +

    Synopsis

    +
    // In header: <boost/container/uses_allocator.hpp>
+
+template<typename T> 
+struct constructible_with_allocator_prefix {
+
+  // public data members
+  static const bool value;
+};
    +
    +

    Description

    +

    Remark: if a specialization constructible_with_allocator_prefix<X>::value is true, indicates that T may be constructed with allocator_arg and T::allocator_type as its first two constructor arguments. Ideally, all constructors of T (including the copy and move constructors) should have a variant that accepts these two initial arguments.

    +

    Requires: specialization constructible_with_allocator_prefix<X>::value is true, T must have a nested type, allocator_type and at least one constructor for which allocator_arg_t is the first parameter and allocator_type is the second parameter. If not all constructors of T can be called with these initial arguments, and if T is used in a context where a container must call such a constructor, then the program is ill-formed.

    +

    template <class T, class Allocator = allocator<T> > class Y { public: typedef Allocator allocator_type;

    +

    // Default constructor with and allocator-extended default constructor Y(); Y(allocator_arg_t, const allocator_type& a);

    +

    // Copy constructor and allocator-extended copy constructor Y(const Y& yy); Y(allocator_arg_t, const allocator_type& a, const Y& yy);

    +

    // Variadic constructor and allocator-extended variadic constructor template<class ...Args> Y(Args&& args...); template<class ...Args> Y(allocator_arg_t, const allocator_type& a, BOOST_FWD_REF(Args)... args); };

    +

    // Specialize trait for class template Y template <class T, class Allocator = allocator<T> > struct constructible_with_allocator_prefix<Y<T,Allocator> > { static const bool value = true; };

    +

    +

    Note: This trait is a workaround inspired by "N2554: The Scoped Allocator Model (Rev 2)" (Pablo Halpern, 2008-02-29) to backport the scoped allocator model to C++03, as in C++03 there is no mechanism to detect if a type can be constructed from arbitrary arguments. Applications aiming portability with several compilers should always define this trait.

    +

    In conforming C++11 compilers or compilers supporting SFINAE expressions (when BOOST_NO_SFINAE_EXPR is NOT defined), this trait is ignored and C++11 rules will be used to detect if a type should be constructed with suffix or prefix allocator arguments.

    +
    +
    + + + +
    Copyright © 2009-2017 Ion + Gaztanaga

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/container/constructible__idp67492240.html b/doc/html/boost/container/constructible__idp67492240.html deleted file mode 100644 index 9d55b5baf4..0000000000 --- a/doc/html/boost/container/constructible__idp67492240.html +++ /dev/null @@ -1,66 +0,0 @@ - - - - -Struct template constructible_with_allocator_suffix - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Struct template constructible_with_allocator_suffix

    -

    boost::container::constructible_with_allocator_suffix

    -
    -

    Synopsis

    -
    // In header: <boost/container/uses_allocator.hpp>
-
-template<typename T> 
-struct constructible_with_allocator_suffix {
-
-  // public data members
-  static const bool value;
-};
    -
    -

    Description

    -

    Remark: if a specialization constructible_with_allocator_suffix<X>::value is true, indicates that T may be constructed with an allocator as its last constructor argument. Ideally, all constructors of T (including the copy and move constructors) should have a variant that accepts a final argument of allocator_type.

    -

    Requires: if a specialization constructible_with_allocator_suffix<X>::value is true, T must have a nested type, allocator_type and at least one constructor for which allocator_type is the last parameter. If not all constructors of T can be called with a final allocator_type argument, and if T is used in a context where a container must call such a constructor, then the program is ill-formed.

    -

    template <class T, class Allocator = allocator<T> > class Z { public: typedef Allocator allocator_type;

    -

    // Default constructor with optional allocator suffix Z(const allocator_type& a = allocator_type());

    -

    // Copy constructor and allocator-extended copy constructor Z(const Z& zz); Z(const Z& zz, const allocator_type& a); };

    -

    // Specialize trait for class template Z template <class T, class Allocator = allocator<T> > struct constructible_with_allocator_suffix<Z<T,Allocator> > { static const bool value = true; };

    -

    Note: This trait is a workaround inspired by "N2554: The Scoped A Model (Rev 2)" (Pablo Halpern, 2008-02-29) to backport the scoped allocator model to C++03, as in C++03 there is no mechanism to detect if a type can be constructed from arbitrary arguments. Applications aiming portability with several compilers should always define this trait.

    -

    In conforming C++11 compilers or compilers supporting SFINAE expressions (when BOOST_NO_SFINAE_EXPR is NOT defined), this trait is ignored and C++11 rules will be used to detect if a type should be constructed with suffix or prefix allocator arguments.

    -
    -
    - - - -
    Copyright © 2009-2015 Ion Gaztanaga

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/container/constructible__idp67501632.html b/doc/html/boost/container/constructible__idp67501632.html deleted file mode 100644 index 3ffa4b3079..0000000000 --- a/doc/html/boost/container/constructible__idp67501632.html +++ /dev/null @@ -1,68 +0,0 @@ - - - - -Struct template constructible_with_allocator_prefix - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Struct template constructible_with_allocator_prefix

    -

    boost::container::constructible_with_allocator_prefix

    -
    -

    Synopsis

    -
    // In header: <boost/container/uses_allocator.hpp>
-
-template<typename T> 
-struct constructible_with_allocator_prefix {
-
-  // public data members
-  static const bool value;
-};
    -
    -

    Description

    -

    Remark: if a specialization constructible_with_allocator_prefix<X>::value is true, indicates that T may be constructed with allocator_arg and T::allocator_type as its first two constructor arguments. Ideally, all constructors of T (including the copy and move constructors) should have a variant that accepts these two initial arguments.

    -

    Requires: specialization constructible_with_allocator_prefix<X>::value is true, T must have a nested type, allocator_type and at least one constructor for which allocator_arg_t is the first parameter and allocator_type is the second parameter. If not all constructors of T can be called with these initial arguments, and if T is used in a context where a container must call such a constructor, then the program is ill-formed.

    -

    template <class T, class Allocator = allocator<T> > class Y { public: typedef Allocator allocator_type;

    -

    // Default constructor with and allocator-extended default constructor Y(); Y(allocator_arg_t, const allocator_type& a);

    -

    // Copy constructor and allocator-extended copy constructor Y(const Y& yy); Y(allocator_arg_t, const allocator_type& a, const Y& yy);

    -

    // Variadic constructor and allocator-extended variadic constructor template<class ...Args> Y(Args&& args...); template<class ...Args> Y(allocator_arg_t, const allocator_type& a, BOOST_FWD_REF(Args)... args); };

    -

    // Specialize trait for class template Y template <class T, class Allocator = allocator<T> > struct constructible_with_allocator_prefix<Y<T,Allocator> > { static const bool value = true; };

    -

    -

    Note: This trait is a workaround inspired by "N2554: The Scoped Allocator Model (Rev 2)" (Pablo Halpern, 2008-02-29) to backport the scoped allocator model to C++03, as in C++03 there is no mechanism to detect if a type can be constructed from arbitrary arguments. Applications aiming portability with several compilers should always define this trait.

    -

    In conforming C++11 compilers or compilers supporting SFINAE expressions (when BOOST_NO_SFINAE_EXPR is NOT defined), this trait is ignored and C++11 rules will be used to detect if a type should be constructed with suffix or prefix allocator arguments.

    -
    -
    - - - -
    Copyright © 2009-2015 Ion Gaztanaga

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/container/default_init.html b/doc/html/boost/container/default_init.html index 7f3f48332a..c246f97e71 100644 --- a/doc/html/boost/container/default_init.html +++ b/doc/html/boost/container/default_init.html @@ -34,13 +34,14 @@ static const default_init_t default_init;
    -

    Description

    +

    Description

    Value used to tag that the inserted values should be default initialized

    -
    Copyright © 2009-2015 Ion Gaztanaga

    +

    Copyright © 2009-2017 Ion + Gaztanaga

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost/container/default_init_t.html b/doc/html/boost/container/default_init_t.html index 7965f891b6..714fa87c9b 100644 --- a/doc/html/boost/container/default_init_t.html +++ b/doc/html/boost/container/default_init_t.html @@ -8,7 +8,7 @@ - + @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -36,13 +36,14 @@ struct default_init_t { };
    -

    Description

    +

    Description

    Type used to tag that the inserted values should be default initialized

    -
    Copyright © 2009-2015 Ion Gaztanaga

    +

    Copyright © 2009-2017 Ion + Gaztanaga

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    @@ -50,7 +51,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/container/deque.html b/doc/html/boost/container/deque.html index 2100f66766..237e1da1d7 100644 --- a/doc/html/boost/container/deque.html +++ b/doc/html/boost/container/deque.html @@ -51,100 +51,100 @@ typedef implementation_defined const_reverse_iterator; // construct/copy/destruct - deque() noexcept(container_detail::is_nothrow_default_constructible< Allocator >::value)); - explicit deque(const allocator_type &) noexcept; - explicit deque(size_type); - deque(size_type, default_init_t); - explicit deque(size_type, const allocator_type &); - deque(size_type, default_init_t, const allocator_type &); - deque(size_type, const value_type &); - deque(size_type, const value_type &, const allocator_type &); - template<typename InIt> deque(InIt, InIt); - template<typename InIt> deque(InIt, InIt, const allocator_type &); - deque(std::initializer_list< value_type >, + deque() noexcept(dtl::is_nothrow_default_constructible< Allocator >::value)); + explicit deque(const allocator_type &) noexcept; + explicit deque(size_type); + deque(size_type, default_init_t); + explicit deque(size_type, const allocator_type &); + deque(size_type, default_init_t, const allocator_type &); + deque(size_type, const value_type &); + deque(size_type, const value_type &, const allocator_type &); + template<typename InIt> deque(InIt, InIt); + template<typename InIt> deque(InIt, InIt, const allocator_type &); + deque(std::initializer_list< value_type >, const allocator_type & = allocator_type()); - deque(const deque &); - deque(deque &&) noexcept; - deque(const deque &, const allocator_type &); - deque(deque &&, const allocator_type &); - deque & operator=(const deque &); - deque & operator=(deque &&) noexcept(allocator_traits_type::propagate_on_container_move_assignment::value||allocator_traits_type::is_always_equal::value)); - deque & operator=(std::initializer_list< value_type >); - ~deque(); + deque(const deque &); + deque(deque &&) noexcept; + deque(const deque &, const allocator_type &); + deque(deque &&, const allocator_type &); + deque & operator=(const deque &); + deque & operator=(deque &&) noexcept(allocator_traits_type::propagate_on_container_move_assignment::value||allocator_traits_type::is_always_equal::value)); + deque & operator=(std::initializer_list< value_type >); + ~deque(); - // public member functions - void assign(size_type, const T &); - template<typename InIt> void assign(InIt, InIt); - void assign(std::initializer_list< value_type >); - allocator_type get_allocator() const noexcept; - const stored_allocator_type & get_stored_allocator() const noexcept; - stored_allocator_type & get_stored_allocator() noexcept; - iterator begin() noexcept; - const_iterator begin() const noexcept; - iterator end() noexcept; - const_iterator end() const noexcept; - reverse_iterator rbegin() noexcept; - const_reverse_iterator rbegin() const noexcept; - reverse_iterator rend() noexcept; - const_reverse_iterator rend() const noexcept; - const_iterator cbegin() const noexcept; - const_iterator cend() const noexcept; - const_reverse_iterator crbegin() const noexcept; - const_reverse_iterator crend() const noexcept; - bool empty() const noexcept; - size_type size() const noexcept; - size_type max_size() const noexcept; - void resize(size_type); - void resize(size_type, default_init_t); - void resize(size_type, const value_type &); - void shrink_to_fit(); - reference front() noexcept; - const_reference front() const noexcept; - reference back() noexcept; - const_reference back() const noexcept; - reference operator[](size_type) noexcept; - const_reference operator[](size_type) const noexcept; - iterator nth(size_type) noexcept; - const_iterator nth(size_type) const noexcept; - size_type index_of(iterator) noexcept; - size_type index_of(const_iterator) const noexcept; - reference at(size_type); - const_reference at(size_type) const; - template<class... Args> reference emplace_front(Args &&...); - template<class... Args> reference emplace_back(Args &&...); - template<class... Args> iterator emplace(const_iterator, Args &&...); - void push_front(const T &); - void push_front(T &&); - void push_back(const T &); - void push_back(T &&); - iterator insert(const_iterator, const T &); - iterator insert(const_iterator, T &&); - iterator insert(const_iterator, size_type, const value_type &); - template<typename InIt> iterator insert(const_iterator, InIt, InIt); - iterator insert(const_iterator, std::initializer_list< value_type >); - void pop_front() noexcept; - void pop_back() noexcept; - iterator erase(const_iterator) noexcept; - iterator erase(const_iterator, const_iterator) noexcept; - void swap(deque &) noexcept(allocator_traits_type::propagate_on_container_swap::value||allocator_traits_type::is_always_equal::value)); - void clear() noexcept; + // public member functions + void assign(size_type, const T &); + template<typename InIt> void assign(InIt, InIt); + void assign(std::initializer_list< value_type >); + allocator_type get_allocator() const noexcept; + const stored_allocator_type & get_stored_allocator() const noexcept; + stored_allocator_type & get_stored_allocator() noexcept; + iterator begin() noexcept; + const_iterator begin() const noexcept; + iterator end() noexcept; + const_iterator end() const noexcept; + reverse_iterator rbegin() noexcept; + const_reverse_iterator rbegin() const noexcept; + reverse_iterator rend() noexcept; + const_reverse_iterator rend() const noexcept; + const_iterator cbegin() const noexcept; + const_iterator cend() const noexcept; + const_reverse_iterator crbegin() const noexcept; + const_reverse_iterator crend() const noexcept; + bool empty() const noexcept; + size_type size() const noexcept; + size_type max_size() const noexcept; + void resize(size_type); + void resize(size_type, default_init_t); + void resize(size_type, const value_type &); + void shrink_to_fit(); + reference front() noexcept; + const_reference front() const noexcept; + reference back() noexcept; + const_reference back() const noexcept; + reference operator[](size_type) noexcept; + const_reference operator[](size_type) const noexcept; + iterator nth(size_type) noexcept; + const_iterator nth(size_type) const noexcept; + size_type index_of(iterator) noexcept; + size_type index_of(const_iterator) const noexcept; + reference at(size_type); + const_reference at(size_type) const; + template<class... Args> reference emplace_front(Args &&...); + template<class... Args> reference emplace_back(Args &&...); + template<class... Args> iterator emplace(const_iterator, Args &&...); + void push_front(const T &); + void push_front(T &&); + void push_back(const T &); + void push_back(T &&); + iterator insert(const_iterator, const T &); + iterator insert(const_iterator, T &&); + iterator insert(const_iterator, size_type, const value_type &); + template<typename InIt> iterator insert(const_iterator, InIt, InIt); + iterator insert(const_iterator, std::initializer_list< value_type >); + void pop_front() noexcept; + void pop_back() noexcept; + iterator erase(const_iterator) noexcept; + iterator erase(const_iterator, const_iterator) noexcept; + void swap(deque &) noexcept(allocator_traits_type::propagate_on_container_swap::value||allocator_traits_type::is_always_equal::value)); + void clear() noexcept; - // friend functions - friend bool operator==(const deque &, const deque &); - friend bool operator!=(const deque &, const deque &); - friend bool operator<(const deque &, const deque &); - friend bool operator>(const deque &, const deque &); - friend bool operator<=(const deque &, const deque &); - friend bool operator>=(const deque &, const deque &); - friend void swap(deque &, deque &); + // friend functions + friend bool operator==(const deque &, const deque &); + friend bool operator!=(const deque &, const deque &); + friend bool operator<(const deque &, const deque &); + friend bool operator>(const deque &, const deque &); + friend bool operator<=(const deque &, const deque &); + friend bool operator>=(const deque &, const deque &); + friend void swap(deque &, deque &); };
    -

    Description

    +

    Description

    A double-ended queue is a sequence that supports random access to elements, constant time insertion and removal of elements at the end of the sequence, and linear time insertion and removal of elements in the middle.

    -

    Template Parameters

    +

    Template Parameters

    1. typename T
      @@ -157,127 +157,127 @@
    -

    +

    deque public construct/copy/destruct

    1. -
      deque() noexcept(container_detail::is_nothrow_default_constructible< Allocator >::value));
      +
      deque() noexcept(dtl::is_nothrow_default_constructible< Allocator >::value));

      Effects: Default constructors a deque.

      Throws: If allocator_type's default constructor throws.

      Complexity: Constant.

    2. -
      explicit deque(const allocator_type & a) noexcept;
      +
      explicit deque(const allocator_type & a) noexcept;

      Effects: Constructs a deque taking the allocator as parameter.

      Throws: Nothing

      Complexity: Constant.

    3. -
      explicit deque(size_type n);
      +
      explicit deque(size_type n);

      Effects: Constructs a deque and inserts n value initialized values.

      Throws: If allocator_type's default constructor throws or T's value initialization throws.

      Complexity: Linear to n.

    4. -
      deque(size_type n, default_init_t);
      +
      deque(size_type n, default_init_t);

      Effects: Constructs a deque and inserts n default initialized values.

      Throws: If allocator_type's default constructor throws or T's default initialization or copy constructor throws.

      Complexity: Linear to n.

      Note: Non-standard extension

    5. -
      explicit deque(size_type n, const allocator_type & a);
      +
      explicit deque(size_type n, const allocator_type & a);

      Effects: Constructs a deque that will use a copy of allocator a and inserts n value initialized values.

      Throws: If allocator_type's default constructor throws or T's value initialization throws.

      Complexity: Linear to n.

    6. -
      deque(size_type n, default_init_t, const allocator_type & a);
      +
      deque(size_type n, default_init_t, const allocator_type & a);

      Effects: Constructs a deque that will use a copy of allocator a and inserts n default initialized values.

      Throws: If allocator_type's default constructor throws or T's default initialization or copy constructor throws.

      Complexity: Linear to n.

      Note: Non-standard extension

    7. -
      deque(size_type n, const value_type & value);
      +
      deque(size_type n, const value_type & value);

      Effects: Constructs a deque that will use a copy of allocator a and inserts n copies of value.

      Throws: If allocator_type's default constructor throws or T's copy constructor throws.

      Complexity: Linear to n.

    8. -
      deque(size_type n, const value_type & value, const allocator_type & a);
      +
      deque(size_type n, const value_type & value, const allocator_type & a);

      Effects: Constructs a deque that will use a copy of allocator a and inserts n copies of value.

      Throws: If allocator_type's default constructor throws or T's copy constructor throws.

      Complexity: Linear to n.

    9. -
      template<typename InIt> deque(InIt first, InIt last);
      +
      template<typename InIt> deque(InIt first, InIt last);

      Effects: Constructs a deque that will use a copy of allocator a and inserts a copy of the range [first, last) in the deque.

      Throws: If allocator_type's default constructor throws or T's constructor taking a dereferenced InIt throws.

      Complexity: Linear to the range [first, last).

    10. -
      template<typename InIt> deque(InIt first, InIt last, const allocator_type & a);
      +
      template<typename InIt> deque(InIt first, InIt last, const allocator_type & a);

      Effects: Constructs a deque that will use a copy of allocator a and inserts a copy of the range [first, last) in the deque.

      Throws: If allocator_type's default constructor throws or T's constructor taking a dereferenced InIt throws.

      Complexity: Linear to the range [first, last).

    11. -
      deque(std::initializer_list< value_type > il, 
+
      deque(std::initializer_list< value_type > il, 
       const allocator_type & a = allocator_type());
      
 
      Effects: Constructs a deque that will use a copy of allocator a and inserts a copy of the range [il.begin(), il.end()) in the deque.
      
 
      Throws: If allocator_type's default constructor throws or T's constructor taking a dereferenced std::initializer_list iterator throws.
      
 
      Complexity: Linear to the range [il.begin(), il.end()).
    12. -
      deque(const deque & x);
      +
      deque(const deque & x);

      Effects: Copy constructs a deque.

      Postcondition: x == *this.

      Complexity: Linear to the elements x contains.

    13. -
      deque(deque && x) noexcept;
      +
      deque(deque && x) noexcept;

      Effects: Move constructor. Moves x's resources to *this.

      Throws: If allocator_type's copy constructor throws.

      Complexity: Constant.

    14. -
      deque(const deque & x, const allocator_type & a);
      +
      deque(const deque & x, const allocator_type & a);

      Effects: Copy constructs a vector using the specified allocator.

      Postcondition: x == *this.

      Throws: If allocation throws or T's copy constructor throws.

      Complexity: Linear to the elements x contains.

    15. -
      deque(deque && x, const allocator_type & a);
      +
      deque(deque && x, const allocator_type & a);

      Effects: Move constructor using the specified allocator. Moves x's resources to *this if a == allocator_type(). Otherwise copies values from x to *this.

      Throws: If allocation or T's copy constructor throws.

      Complexity: Constant if a == x.get_allocator(), linear otherwise.

    16. -
      deque & operator=(const deque & x);
      +
      deque & operator=(const deque & x);

      Effects: Makes *this contain the same elements as x.

      Postcondition: this->size() == x.size(). *this contains a copy of each of x's elements.

      Throws: If memory allocation throws or T's copy constructor throws.

      Complexity: Linear to the number of elements in x.

    17. -
      deque & operator=(deque && x) noexcept(allocator_traits_type::propagate_on_container_move_assignment::value||allocator_traits_type::is_always_equal::value));
      +
      deque & operator=(deque && x) noexcept(allocator_traits_type::propagate_on_container_move_assignment::value||allocator_traits_type::is_always_equal::value));

      Effects: Move assignment. All x's values are transferred to *this.

      Throws: If allocator_traits_type::propagate_on_container_move_assignment is false and (allocation throws or value_type's move constructor throws)

      Complexity: Constant if allocator_traits_type:: propagate_on_container_move_assignment is true or this->get>allocator() == x.get_allocator(). Linear otherwise.

    18. -
      deque & operator=(std::initializer_list< value_type > il);
      +
      deque & operator=(std::initializer_list< value_type > il);

      Effects: Makes *this contain the same elements as il.

      Postcondition: this->size() == il.size(). *this contains a copy of each of x's elements.

      Throws: If memory allocation throws or T's copy constructor throws.

      Complexity: Linear to the number of elements in il.

    19. -
      ~deque();
      +
      ~deque();

      Effects: Destroys the deque. All stored values are destroyed and used memory is deallocated.

      Throws: Nothing.

      Complexity: Linear to the number of elements.

      @@ -285,206 +285,206 @@
    -

    -deque public member functions

    +

    +deque public member functions

    1. -
      void assign(size_type n, const T & val);
      +
      void assign(size_type n, const T & val);

      Effects: Assigns the n copies of val to *this.

      Throws: If memory allocation throws or T's copy constructor throws.

      Complexity: Linear to n.

    2. -
      template<typename InIt> void assign(InIt first, InIt last);
      +
      template<typename InIt> void assign(InIt first, InIt last);

      Effects: Assigns the the range [first, last) to *this.

      Throws: If memory allocation throws or T's constructor from dereferencing InIt throws.

      Complexity: Linear to n.

    3. -
      void assign(std::initializer_list< value_type > il);
      +
      void assign(std::initializer_list< value_type > il);

      Effects: Assigns the the range [il.begin(), il.end()) to *this.

      Throws: If memory allocation throws or T's constructor from dereferencing std::initializer_list iterator throws.

      Complexity: Linear to il.size().

    4. -
      allocator_type get_allocator() const noexcept;
      +
      allocator_type get_allocator() const noexcept;

      Effects: Returns a copy of the internal allocator.

      Throws: If allocator's copy constructor throws.

      Complexity: Constant.

    5. -
      const stored_allocator_type & get_stored_allocator() const noexcept;
      +
      const stored_allocator_type & get_stored_allocator() const noexcept;

      Effects: Returns a reference to the internal allocator.

      Throws: Nothing

      Complexity: Constant.

      Note: Non-standard extension.

    6. -
      stored_allocator_type & get_stored_allocator() noexcept;
      +
      stored_allocator_type & get_stored_allocator() noexcept;

      Effects: Returns a reference to the internal allocator.

      Throws: Nothing

      Complexity: Constant.

      Note: Non-standard extension.

    7. -
      iterator begin() noexcept;
      +
      iterator begin() noexcept;

      Effects: Returns an iterator to the first element contained in the deque.

      Throws: Nothing.

      Complexity: Constant.

    8. -
      const_iterator begin() const noexcept;
      +
      const_iterator begin() const noexcept;

      Effects: Returns a const_iterator to the first element contained in the deque.

      Throws: Nothing.

      Complexity: Constant.

    9. -
      iterator end() noexcept;
      +
      iterator end() noexcept;

      Effects: Returns an iterator to the end of the deque.

      Throws: Nothing.

      Complexity: Constant.

    10. -
      const_iterator end() const noexcept;
      +
      const_iterator end() const noexcept;

      Effects: Returns a const_iterator to the end of the deque.

      Throws: Nothing.

      Complexity: Constant.

    11. -
      reverse_iterator rbegin() noexcept;
      +
      reverse_iterator rbegin() noexcept;

      Effects: Returns a reverse_iterator pointing to the beginning of the reversed deque.

      Throws: Nothing.

      Complexity: Constant.

    12. -
      const_reverse_iterator rbegin() const noexcept;
      +
      const_reverse_iterator rbegin() const noexcept;

      Effects: Returns a const_reverse_iterator pointing to the beginning of the reversed deque.

      Throws: Nothing.

      Complexity: Constant.

    13. -
      reverse_iterator rend() noexcept;
      +
      reverse_iterator rend() noexcept;

      Effects: Returns a reverse_iterator pointing to the end of the reversed deque.

      Throws: Nothing.

      Complexity: Constant.

    14. -
      const_reverse_iterator rend() const noexcept;
      +
      const_reverse_iterator rend() const noexcept;

      Effects: Returns a const_reverse_iterator pointing to the end of the reversed deque.

      Throws: Nothing.

      Complexity: Constant.

    15. -
      const_iterator cbegin() const noexcept;
      +
      const_iterator cbegin() const noexcept;

      Effects: Returns a const_iterator to the first element contained in the deque.

      Throws: Nothing.

      Complexity: Constant.

    16. -
      const_iterator cend() const noexcept;
      +
      const_iterator cend() const noexcept;

      Effects: Returns a const_iterator to the end of the deque.

      Throws: Nothing.

      Complexity: Constant.

    17. -
      const_reverse_iterator crbegin() const noexcept;
      +
      const_reverse_iterator crbegin() const noexcept;

      Effects: Returns a const_reverse_iterator pointing to the beginning of the reversed deque.

      Throws: Nothing.

      Complexity: Constant.

    18. -
      const_reverse_iterator crend() const noexcept;
      +
      const_reverse_iterator crend() const noexcept;

      Effects: Returns a const_reverse_iterator pointing to the end of the reversed deque.

      Throws: Nothing.

      Complexity: Constant.

    19. -
      bool empty() const noexcept;
      +
      bool empty() const noexcept;

      Effects: Returns true if the deque contains no elements.

      Throws: Nothing.

      Complexity: Constant.

    20. -
      size_type size() const noexcept;
      +
      size_type size() const noexcept;

      Effects: Returns the number of the elements contained in the deque.

      Throws: Nothing.

      Complexity: Constant.

    21. -
      size_type max_size() const noexcept;
      +
      size_type max_size() const noexcept;

      Effects: Returns the largest possible size of the deque.

      Throws: Nothing.

      Complexity: Constant.

    22. -
      void resize(size_type new_size);
      +
      void resize(size_type new_size);

      Effects: Inserts or erases elements at the end such that the size becomes n. New elements are value initialized.

      Throws: If memory allocation throws, or T's constructor throws.

      Complexity: Linear to the difference between size() and new_size.

    23. -
      void resize(size_type new_size, default_init_t);
      +
      void resize(size_type new_size, default_init_t);

      Effects: Inserts or erases elements at the end such that the size becomes n. New elements are default initialized.

      Throws: If memory allocation throws, or T's constructor throws.

      Complexity: Linear to the difference between size() and new_size.

      Note: Non-standard extension

    24. -
      void resize(size_type new_size, const value_type & x);
      +
      void resize(size_type new_size, const value_type & x);

      Effects: Inserts or erases elements at the end such that the size becomes n. New elements are copy constructed from x.

      Throws: If memory allocation throws, or T's copy constructor throws.

      Complexity: Linear to the difference between size() and new_size.

    25. -
      void shrink_to_fit();
      +
      void shrink_to_fit();

      Effects: Tries to deallocate the excess of memory created with previous allocations. The size of the deque is unchanged

      Throws: If memory allocation throws.

      Complexity: Constant.

    26. -
      reference front() noexcept;
      +
      reference front() noexcept;

      Requires: !empty()

      Effects: Returns a reference to the first element of the container.

      Throws: Nothing.

      Complexity: Constant.

    27. -
      const_reference front() const noexcept;
      +
      const_reference front() const noexcept;

      Requires: !empty()

      Effects: Returns a const reference to the first element from the beginning of the container.

      Throws: Nothing.

      Complexity: Constant.

    28. -
      reference back() noexcept;
      +
      reference back() noexcept;

      Requires: !empty()

      Effects: Returns a reference to the last element of the container.

      Throws: Nothing.

      Complexity: Constant.

    29. -
      const_reference back() const noexcept;
      +
      const_reference back() const noexcept;

      Requires: !empty()

      Effects: Returns a const reference to the last element of the container.

      Throws: Nothing.

      Complexity: Constant.

    30. -
      reference operator[](size_type n) noexcept;
      +
      reference operator[](size_type n) noexcept;

      Requires: size() > n.

      Effects: Returns a reference to the nth element from the beginning of the container.

      Throws: Nothing.

      Complexity: Constant.

    31. -
      const_reference operator[](size_type n) const noexcept;
      +
      const_reference operator[](size_type n) const noexcept;

      Requires: size() > n.

      Effects: Returns a const reference to the nth element from the beginning of the container.

      Throws: Nothing.

      Complexity: Constant.

    32. -
      iterator nth(size_type n) noexcept;
      +
      iterator nth(size_type n) noexcept;

      Requires: size() >= n.

      Effects: Returns an iterator to the nth element from the beginning of the container. Returns end() if n == size().

      Throws: Nothing.

      @@ -492,7 +492,7 @@

      Note: Non-standard extension

    33. -
      const_iterator nth(size_type n) const noexcept;
      +
      const_iterator nth(size_type n) const noexcept;

      Requires: size() >= n.

      Effects: Returns a const_iterator to the nth element from the beginning of the container. Returns end() if n == size().

      Throws: Nothing.

      @@ -500,7 +500,7 @@

      Note: Non-standard extension

    34. -
      size_type index_of(iterator p) noexcept;
      +
      size_type index_of(iterator p) noexcept;

      Requires: begin() <= p <= end().

      Effects: Returns the index of the element pointed by p and size() if p == end().

      Throws: Nothing.

      @@ -508,7 +508,7 @@

      Note: Non-standard extension

    35. -
      size_type index_of(const_iterator p) const noexcept;
      +
      size_type index_of(const_iterator p) const noexcept;

      Requires: begin() <= p <= end().

      Effects: Returns the index of the element pointed by p and size() if p == end().

      Throws: Nothing.

      @@ -516,66 +516,66 @@

      Note: Non-standard extension

    36. -
      reference at(size_type n);
      +
      reference at(size_type n);

      Requires: size() > n.

      Effects: Returns a reference to the nth element from the beginning of the container.

      Throws: std::range_error if n >= size()

      Complexity: Constant.

    37. -
      const_reference at(size_type n) const;
      +
      const_reference at(size_type n) const;

      Requires: size() > n.

      Effects: Returns a const reference to the nth element from the beginning of the container.

      Throws: std::range_error if n >= size()

      Complexity: Constant.

    38. -
      template<class... Args> reference emplace_front(Args &&... args);
      +
      template<class... Args> reference emplace_front(Args &&... args);

      Effects: Inserts an object of type T constructed with std::forward<Args>(args)... in the beginning of the deque.

      Returns: A reference to the created object.

      Throws: If memory allocation throws or the in-place constructor throws.

      Complexity: Amortized constant time

    39. -
      template<class... Args> reference emplace_back(Args &&... args);
      +
      template<class... Args> reference emplace_back(Args &&... args);

      Effects: Inserts an object of type T constructed with std::forward<Args>(args)... in the end of the deque.

      Returns: A reference to the created object.

      Throws: If memory allocation throws or the in-place constructor throws.

      Complexity: Amortized constant time

    40. -
      template<class... Args> iterator emplace(const_iterator p, Args &&... args);
      +
      template<class... Args> iterator emplace(const_iterator p, Args &&... args);

      Requires: p must be a valid iterator of *this.

      Effects: Inserts an object of type T constructed with std::forward<Args>(args)... before p

      Throws: If memory allocation throws or the in-place constructor throws.

      Complexity: If p is end(), amortized constant time Linear time otherwise.

    41. -
      void push_front(const T & x);
      +
      void push_front(const T & x);

      Effects: Inserts a copy of x at the front of the deque.

      Throws: If memory allocation throws or T's copy constructor throws.

      Complexity: Amortized constant time.

    42. -
      void push_front(T && x);
      +
      void push_front(T && x);

      Effects: Constructs a new element in the front of the deque and moves the resources of x to this new element.

      Throws: If memory allocation throws.

      Complexity: Amortized constant time.

    43. -
      void push_back(const T & x);
      +
      void push_back(const T & x);

      Effects: Inserts a copy of x at the end of the deque.

      Throws: If memory allocation throws or T's copy constructor throws.

      Complexity: Amortized constant time.

    44. -
      void push_back(T && x);
      +
      void push_back(T && x);

      Effects: Constructs a new element in the end of the deque and moves the resources of x to this new element.

      Throws: If memory allocation throws.

      Complexity: Amortized constant time.

    45. -
      iterator insert(const_iterator p, const T & x);
      +
      iterator insert(const_iterator p, const T & x);

      Requires: p must be a valid iterator of *this.

      Effects: Insert a copy of x before p.

      Returns: an iterator to the inserted element.

      @@ -583,7 +583,7 @@

      Complexity: If p is end(), amortized constant time Linear time otherwise.

    46. -
      iterator insert(const_iterator p, T && x);
      +
      iterator insert(const_iterator p, T && x);

      Requires: p must be a valid iterator of *this.

      Effects: Insert a new element before p with x's resources.

      Returns: an iterator to the inserted element.

      @@ -591,7 +591,7 @@

      Complexity: If p is end(), amortized constant time Linear time otherwise.

    47. -
      iterator insert(const_iterator pos, size_type n, const value_type & x);
      +
      iterator insert(const_iterator pos, size_type n, const value_type & x);

      Requires: pos must be a valid iterator of *this.

      Effects: Insert n copies of x before pos.

      Returns: an iterator to the first inserted element or pos if n is 0.

      @@ -600,7 +600,7 @@ 
    48. template<typename InIt> 
-  iterator insert(const_iterator pos, InIt first, InIt last);
      + iterator insert(const_iterator pos, InIt first, InIt last);

      Requires: pos must be a valid iterator of *this.

      Effects: Insert a copy of the [first, last) range before pos.

      Returns: an iterator to the first inserted element or pos if first == last.

      @@ -608,7 +608,7 @@

      Complexity: Linear to distance [first, last).

    49. -
      iterator insert(const_iterator pos, std::initializer_list< value_type > il);
      +
      iterator insert(const_iterator pos, std::initializer_list< value_type > il);

      Requires: pos must be a valid iterator of *this.

      Effects: Insert a copy of the [il.begin(), il.end()) range before pos.

      Returns: an iterator to the first inserted element or pos if il.begin() == il.end().

      @@ -616,37 +616,37 @@

      Complexity: Linear to distance [il.begin(), il.end()).

    50. -
      void pop_front() noexcept;
      +
      void pop_front() noexcept;

      Effects: Removes the first element from the deque.

      Throws: Nothing.

      Complexity: Constant time.

    51. -
      void pop_back() noexcept;
      +
      void pop_back() noexcept;

      Effects: Removes the last element from the deque.

      Throws: Nothing.

      Complexity: Constant time.

    52. -
      iterator erase(const_iterator pos) noexcept;
      +
      iterator erase(const_iterator pos) noexcept;

      Effects: Erases the element at p.

      Throws: Nothing.

      Complexity: Linear to the elements between pos and the last element (if pos is near the end) or the first element if(pos is near the beginning). Constant if pos is the first or the last element.

    53. -
      iterator erase(const_iterator first, const_iterator last) noexcept;
      +
      iterator erase(const_iterator first, const_iterator last) noexcept;

      Effects: Erases the elements pointed by [first, last).

      Throws: Nothing.

      Complexity: Linear to the distance between first and last plus the elements between pos and the last element (if pos is near the end) or the first element if(pos is near the beginning).

    54. -
      void swap(deque & x) noexcept(allocator_traits_type::propagate_on_container_swap::value||allocator_traits_type::is_always_equal::value));
      +
      void swap(deque & x) noexcept(allocator_traits_type::propagate_on_container_swap::value||allocator_traits_type::is_always_equal::value));

      Effects: Swaps the contents of *this and x.

      Throws: Nothing.

      Complexity: Constant.

    55. -
      void clear() noexcept;
      +
      void clear() noexcept;

      Effects: Erases all the elements of the deque.

      Throws: Nothing.

      Complexity: Linear to the number of elements in the deque.

      @@ -654,41 +654,41 @@
    -

    -deque friend functions

    +

    +deque friend functions

    1. -
      friend bool operator==(const deque & x, const deque & y);
      +
      friend bool operator==(const deque & x, const deque & y);

      Effects: Returns true if x and y are equal

      Complexity: Linear to the number of elements in the container.

    2. -
      friend bool operator!=(const deque & x, const deque & y);
      +
      friend bool operator!=(const deque & x, const deque & y);

      Effects: Returns true if x and y are unequal

      Complexity: Linear to the number of elements in the container.

    3. -
      friend bool operator<(const deque & x, const deque & y);
      +
      friend bool operator<(const deque & x, const deque & y);

      Effects: Returns true if x is less than y

      Complexity: Linear to the number of elements in the container.

    4. -
      friend bool operator>(const deque & x, const deque & y);
      +
      friend bool operator>(const deque & x, const deque & y);

      Effects: Returns true if x is greater than y

      Complexity: Linear to the number of elements in the container.

    5. -
      friend bool operator<=(const deque & x, const deque & y);
      +
      friend bool operator<=(const deque & x, const deque & y);

      Effects: Returns true if x is equal or less than y

      Complexity: Linear to the number of elements in the container.

    6. -
      friend bool operator>=(const deque & x, const deque & y);
      +
      friend bool operator>=(const deque & x, const deque & y);

      Effects: Returns true if x is equal or greater than y

      Complexity: Linear to the number of elements in the container.

    7. -
      friend void swap(deque & x, deque & y);
      +
      friend void swap(deque & x, deque & y);

      Effects: x.swap(y)

      Complexity: Constant.

      8. @@ -698,7 +698,8 @@
    -
    Copyright © 2009-2015 Ion Gaztanaga

    +

    Copyright © 2009-2017 Ion + Gaztanaga

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost/container/erased_type.html b/doc/html/boost/container/erased_type.html index 4eb4d50fc1..3f7a93cd32 100644 --- a/doc/html/boost/container/erased_type.html +++ b/doc/html/boost/container/erased_type.html @@ -36,13 +36,14 @@ struct erased_type { };
    -

    Description

    +

    Description

    The erased_type struct is an empty struct that serves as a placeholder for a type T in situations where the actual type T is determined at runtime. For example, the nested type, allocator_type, is an alias for erased_type in classes that use type-erased allocators.

    -
    Copyright © 2009-2015 Ion Gaztanaga

    +

    Copyright © 2009-2017 Ion + Gaztanaga

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost/container/flat_map.html b/doc/html/boost/container/flat_map.html index 4bc8d7327e..8948512a66 100644 --- a/doc/html/boost/container/flat_map.html +++ b/doc/html/boost/container/flat_map.html @@ -59,144 +59,144 @@ typedef implementation_defined movable_value_type; // construct/copy/destruct - flat_map() noexcept(container_detail::is_nothrow_default_constructible< AllocatorOrContainer >::value &&container_detail::is_nothrow_default_constructible< Compare >::value)); - explicit flat_map(const allocator_type &); - explicit flat_map(const Compare &); - flat_map(const Compare &, const allocator_type &); - template<typename InputIterator> flat_map(InputIterator, InputIterator); + flat_map() noexcept(dtl::is_nothrow_default_constructible< AllocatorOrContainer >::value &&dtl::is_nothrow_default_constructible< Compare >::value)); + explicit flat_map(const allocator_type &); + explicit flat_map(const Compare &); + flat_map(const Compare &, const allocator_type &); + template<typename InputIterator> flat_map(InputIterator, InputIterator); template<typename InputIterator> - flat_map(InputIterator, InputIterator, const allocator_type &); + flat_map(InputIterator, InputIterator, const allocator_type &); template<typename InputIterator> - flat_map(InputIterator, InputIterator, const Compare &); + flat_map(InputIterator, InputIterator, const Compare &); template<typename InputIterator> - flat_map(InputIterator, InputIterator, const Compare &, + flat_map(InputIterator, InputIterator, const Compare &, const allocator_type &); template<typename InputIterator> - flat_map(ordered_unique_range_t, InputIterator, InputIterator); + flat_map(ordered_unique_range_t, InputIterator, InputIterator); template<typename InputIterator> - flat_map(ordered_unique_range_t, InputIterator, InputIterator, + flat_map(ordered_unique_range_t, InputIterator, InputIterator, const Compare &); template<typename InputIterator> - flat_map(ordered_unique_range_t, InputIterator, InputIterator, + flat_map(ordered_unique_range_t, InputIterator, InputIterator, const Compare &, const allocator_type &); - flat_map(std::initializer_list< value_type >); - flat_map(std::initializer_list< value_type >, const allocator_type &); - flat_map(std::initializer_list< value_type >, const Compare &); - flat_map(std::initializer_list< value_type >, const Compare &, + flat_map(std::initializer_list< value_type >); + flat_map(std::initializer_list< value_type >, const allocator_type &); + flat_map(std::initializer_list< value_type >, const Compare &); + flat_map(std::initializer_list< value_type >, const Compare &, const allocator_type &); - flat_map(ordered_unique_range_t, std::initializer_list< value_type >); - flat_map(ordered_unique_range_t, std::initializer_list< value_type >, + flat_map(ordered_unique_range_t, std::initializer_list< value_type >); + flat_map(ordered_unique_range_t, std::initializer_list< value_type >, const Compare &); - flat_map(ordered_unique_range_t, std::initializer_list< value_type >, + flat_map(ordered_unique_range_t, std::initializer_list< value_type >, const Compare &, const allocator_type &); - flat_map(const flat_map &); - flat_map(flat_map &&) noexcept(boost::container::container_detail::is_nothrow_move_constructible< Compare >::value)); - flat_map(const flat_map &, const allocator_type &); - flat_map(flat_map &&, const allocator_type &); - flat_map & operator=(const flat_map &); - flat_map & operator=(flat_map &&) noexcept((allocator_traits_type::propagate_on_container_move_assignment::value||allocator_traits_type::is_always_equal::value)&&boost::container::container_detail::is_nothrow_move_assignable< Compare >::value)); - flat_map & operator=(std::initializer_list< value_type >); + flat_map(const flat_map &); + flat_map(flat_map &&) noexcept(boost::container::dtl::is_nothrow_move_constructible< Compare >::value)); + flat_map(const flat_map &, const allocator_type &); + flat_map(flat_map &&, const allocator_type &); + flat_map & operator=(const flat_map &); + flat_map & operator=(flat_map &&) noexcept((allocator_traits_type::propagate_on_container_move_assignment::value||allocator_traits_type::is_always_equal::value)&&boost::container::dtl::is_nothrow_move_assignable< Compare >::value)); + flat_map & operator=(std::initializer_list< value_type >); - // public member functions - BOOST_STATIC_ASSERT(unspecified); - allocator_type get_allocator() const noexcept; - get_stored_allocator_noconst_return_t get_stored_allocator() noexcept; - get_stored_allocator_const_return_t get_stored_allocator() const noexcept; - iterator begin() noexcept; - const_iterator begin() const noexcept; - iterator end() noexcept; - const_iterator end() const noexcept; - reverse_iterator rbegin() noexcept; - const_reverse_iterator rbegin() const noexcept; - reverse_iterator rend() noexcept; - const_reverse_iterator rend() const noexcept; - const_iterator cbegin() const noexcept; - const_iterator cend() const noexcept; - const_reverse_iterator crbegin() const noexcept; - const_reverse_iterator crend() const noexcept; - bool empty() const noexcept; - size_type size() const noexcept; - size_type max_size() const noexcept; - size_type capacity() const noexcept; - void reserve(size_type); - void shrink_to_fit(); - mapped_type & operator[](const key_type &); - mapped_type & operator[](key_type &&); + // public member functions + BOOST_STATIC_ASSERT((dtl::is_same< std::pair< Key, T >, typename allocator_type::value_type >::value)); + allocator_type get_allocator() const noexcept; + get_stored_allocator_noconst_return_t get_stored_allocator() noexcept; + get_stored_allocator_const_return_t get_stored_allocator() const noexcept; + iterator begin() noexcept; + const_iterator begin() const noexcept; + iterator end() noexcept; + const_iterator end() const noexcept; + reverse_iterator rbegin() noexcept; + const_reverse_iterator rbegin() const noexcept; + reverse_iterator rend() noexcept; + const_reverse_iterator rend() const noexcept; + const_iterator cbegin() const noexcept; + const_iterator cend() const noexcept; + const_reverse_iterator crbegin() const noexcept; + const_reverse_iterator crend() const noexcept; + bool empty() const noexcept; + size_type size() const noexcept; + size_type max_size() const noexcept; + size_type capacity() const noexcept; + void reserve(size_type); + void shrink_to_fit(); + mapped_type & operator[](const key_type &); + mapped_type & operator[](key_type &&); template<typename M> - std::pair< iterator, bool > insert_or_assign(const key_type &, M &&); + std::pair< iterator, bool > insert_or_assign(const key_type &, M &&); template<typename M> - std::pair< iterator, bool > insert_or_assign(key_type &&, M &&); + std::pair< iterator, bool > insert_or_assign(key_type &&, M &&); template<typename M> - iterator insert_or_assign(const_iterator, const key_type &, M &&); + iterator insert_or_assign(const_iterator, const key_type &, M &&); template<typename M> - iterator insert_or_assign(const_iterator, key_type &&, M &&); - iterator nth(size_type) noexcept; - const_iterator nth(size_type) const noexcept; - size_type index_of(iterator) noexcept; - size_type index_of(const_iterator) const noexcept; - T & at(const key_type &); - const T & at(const key_type &) const; - template<class... Args> std::pair< iterator, bool > emplace(Args &&...); - template<class... Args> iterator emplace_hint(const_iterator, Args &&...); + iterator insert_or_assign(const_iterator, key_type &&, M &&); + iterator nth(size_type) noexcept; + const_iterator nth(size_type) const noexcept; + size_type index_of(iterator) noexcept; + size_type index_of(const_iterator) const noexcept; + T & at(const key_type &); + const T & at(const key_type &) const; + template<class... Args> std::pair< iterator, bool > emplace(Args &&...); + template<class... Args> iterator emplace_hint(const_iterator, Args &&...); template<class... Args> - std::pair< iterator, bool > try_emplace(const key_type &, Args &&...); + std::pair< iterator, bool > try_emplace(const key_type &, Args &&...); template<class... Args> - iterator try_emplace(const_iterator, const key_type &, Args &&...); + iterator try_emplace(const_iterator, const key_type &, Args &&...); template<class... Args> - std::pair< iterator, bool > try_emplace(key_type &&, Args &&...); + std::pair< iterator, bool > try_emplace(key_type &&, Args &&...); template<class... Args> - iterator try_emplace(const_iterator, key_type &&, Args &&...); - std::pair< iterator, bool > insert(const value_type &); - std::pair< iterator, bool > insert(value_type &&); - std::pair< iterator, bool > insert(movable_value_type &&); - iterator insert(const_iterator, const value_type &); - iterator insert(const_iterator, value_type &&); - iterator insert(const_iterator, movable_value_type &&); - template<typename InputIterator> void insert(InputIterator, InputIterator); + iterator try_emplace(const_iterator, key_type &&, Args &&...); + std::pair< iterator, bool > insert(const value_type &); + std::pair< iterator, bool > insert(value_type &&); + std::pair< iterator, bool > insert(movable_value_type &&); + iterator insert(const_iterator, const value_type &); + iterator insert(const_iterator, value_type &&); + iterator insert(const_iterator, movable_value_type &&); + template<typename InputIterator> void insert(InputIterator, InputIterator); template<typename InputIterator> - void insert(ordered_unique_range_t, InputIterator, InputIterator); - void insert(std::initializer_list< value_type >); - void insert(ordered_unique_range_t, std::initializer_list< value_type >); + void insert(ordered_unique_range_t, InputIterator, InputIterator); + void insert(std::initializer_list< value_type >); + void insert(ordered_unique_range_t, std::initializer_list< value_type >); template<typename C2> - void merge(flat_map< Key, T, C2, AllocatorOrContainer > &); + void merge(flat_map< Key, T, C2, AllocatorOrContainer > &); template<typename C2> - void merge(flat_map< Key, T, C2, AllocatorOrContainer > &&); + void merge(flat_map< Key, T, C2, AllocatorOrContainer > &&); template<typename C2> - void merge(flat_multimap< Key, T, C2, AllocatorOrContainer > &); + void merge(flat_multimap< Key, T, C2, AllocatorOrContainer > &); template<typename C2> - void merge(flat_multimap< Key, T, C2, AllocatorOrContainer > &&); - iterator erase(const_iterator); - size_type erase(const key_type &); - iterator erase(const_iterator, const_iterator); - void swap(flat_map &) noexcept(allocator_traits_type::is_always_equal::value &&boost::container::container_detail::is_nothrow_swappable< Compare >::value)); - void clear() noexcept; - key_compare key_comp() const; - value_compare value_comp() const; - iterator find(const key_type &); - const_iterator find(const key_type &) const; - size_type count(const key_type &) const; - iterator lower_bound(const key_type &); - const_iterator lower_bound(const key_type &) const; - iterator upper_bound(const key_type &); - const_iterator upper_bound(const key_type &) const; - std::pair< iterator, iterator > equal_range(const key_type &); + void merge(flat_multimap< Key, T, C2, AllocatorOrContainer > &&); + iterator erase(const_iterator); + size_type erase(const key_type &); + iterator erase(const_iterator, const_iterator); + void swap(flat_map &) noexcept(allocator_traits_type::is_always_equal::value &&boost::container::dtl::is_nothrow_swappable< Compare >::value)); + void clear() noexcept; + key_compare key_comp() const; + value_compare value_comp() const; + iterator find(const key_type &); + const_iterator find(const key_type &) const; + size_type count(const key_type &) const; + iterator lower_bound(const key_type &); + const_iterator lower_bound(const key_type &) const; + iterator upper_bound(const key_type &); + const_iterator upper_bound(const key_type &) const; + std::pair< iterator, iterator > equal_range(const key_type &); std::pair< const_iterator, const_iterator > - equal_range(const key_type &) const; - sequence_type extract_sequence(); - void adopt_sequence(sequence_type &&); - void adopt_sequence(ordered_unique_range_t, sequence_type &&); + equal_range(const key_type &) const; + sequence_type extract_sequence(); + void adopt_sequence(sequence_type &&); + void adopt_sequence(ordered_unique_range_t, sequence_type &&); - // friend functions - friend bool operator==(const flat_map &, const flat_map &); - friend bool operator!=(const flat_map &, const flat_map &); - friend bool operator<(const flat_map &, const flat_map &); - friend bool operator>(const flat_map &, const flat_map &); - friend bool operator<=(const flat_map &, const flat_map &); - friend bool operator>=(const flat_map &, const flat_map &); - friend void swap(flat_map &, flat_map &); + // friend functions + friend bool operator==(const flat_map &, const flat_map &); + friend bool operator!=(const flat_map &, const flat_map &); + friend bool operator<(const flat_map &, const flat_map &); + friend bool operator>(const flat_map &, const flat_map &); + friend bool operator<=(const flat_map &, const flat_map &); + friend bool operator>=(const flat_map &, const flat_map &); + friend void swap(flat_map &, flat_map &); };
    -

    Description

    +

    Description

    A flat_map is a kind of associative container that supports unique keys (contains at most one of each key value) and provides for fast retrieval of values of another type T based on the keys.

    A flat_map satisfies all of the requirements of a container, a reversible container and an associative container. A flat_map also provides most operations described for unique keys. For a flat_map<Key,T> the key_type is Key and the value_type is std::pair<Key,T> (unlike std::map<Key, T> which value_type is std::pair<const Key, T>).

    flat_map is similar to std::map but it's implemented by as an ordered sequence container. The underlying sequence container is by default vector but it can also work user-provided vector-like SequenceContainers (like static_vector or small_vector).

    @@ -205,7 +205,7 @@

    -

    Template Parameters

    +

    Template Parameters

    1. typename Key
      @@ -229,59 +229,59 @@
    -

    +

    flat_map public construct/copy/destruct

    1. -
      flat_map() noexcept(container_detail::is_nothrow_default_constructible< AllocatorOrContainer >::value &&container_detail::is_nothrow_default_constructible< Compare >::value));
      +
      flat_map() noexcept(dtl::is_nothrow_default_constructible< AllocatorOrContainer >::value &&dtl::is_nothrow_default_constructible< Compare >::value));

      Effects: Default constructs an empty flat_map.

      Complexity: Constant.

    2. -
      explicit flat_map(const allocator_type & a);
      +
      explicit flat_map(const allocator_type & a);

      Effects: Constructs an empty flat_map using the specified allocator.

      Complexity: Constant.

    3. -
      explicit flat_map(const Compare & comp);
      +
      explicit flat_map(const Compare & comp);

      Effects: Constructs an empty flat_map using the specified comparison object.

      Complexity: Constant.

    4. -
      flat_map(const Compare & comp, const allocator_type & a);
      +
      flat_map(const Compare & comp, const allocator_type & a);

      Effects: Constructs an empty flat_map using the specified comparison object and allocator.

      Complexity: Constant. 

    5. template<typename InputIterator> 
-  flat_map(InputIterator first, InputIterator last);
      + flat_map(InputIterator first, InputIterator last);

      Effects: Constructs an empty flat_map and and inserts elements from the range [first ,last ).

      Complexity: Linear in N if the range [first ,last ) is already sorted using the predicate and otherwise N logN, where N is last - first. 

    6. template<typename InputIterator> 
-  flat_map(InputIterator first, InputIterator last, const allocator_type & a);
      + flat_map(InputIterator first, InputIterator last, const allocator_type & a);

      Effects: Constructs an empty flat_map using the specified allocator, and inserts elements from the range [first ,last ).

      Complexity: Linear in N if the range [first ,last ) is already sorted using the predicate and otherwise N logN, where N is last - first. 

    7. template<typename InputIterator> 
-  flat_map(InputIterator first, InputIterator last, const Compare & comp);
      + flat_map(InputIterator first, InputIterator last, const Compare & comp);

      Effects: Constructs an empty flat_map using the specified comparison object and and inserts elements from the range [first ,last ).

      Complexity: Linear in N if the range [first ,last ) is already sorted using the predicate and otherwise N logN, where N is last - first. 

    8. template<typename InputIterator> 
-  flat_map(InputIterator first, InputIterator last, const Compare & comp, 
+  flat_map(InputIterator first, InputIterator last, const Compare & comp, 
            const allocator_type & a);

      Effects: Constructs an empty flat_map using the specified comparison object and allocator, and inserts elements from the range [first ,last ).

      Complexity: Linear in N if the range [first ,last ) is already sorted using the predicate and otherwise N logN, where N is last - first. 

    9. template<typename InputIterator> 
-  flat_map(ordered_unique_range_t, InputIterator first, InputIterator last);
      + flat_map(ordered_unique_range_t, InputIterator first, InputIterator last);

      Effects: Constructs an empty flat_map and inserts elements from the ordered range [first ,last). This function is more efficient than the normal range creation for ordered ranges.

      Requires: [first ,last) must be ordered according to the predicate.

      Complexity: Linear in N.

      @@ -289,7 +289,7 @@ 
    10. template<typename InputIterator> 
-  flat_map(ordered_unique_range_t, InputIterator first, InputIterator last, 
+  flat_map(ordered_unique_range_t, InputIterator first, InputIterator last, 
            const Compare & comp);

      Effects: Constructs an empty flat_map using the specified comparison object and inserts elements from the ordered range [first ,last). This function is more efficient than the normal range creation for ordered ranges.

      Requires: [first ,last) must be ordered according to the predicate.

      @@ -298,7 +298,7 @@ 
    11. template<typename InputIterator> 
-  flat_map(ordered_unique_range_t, InputIterator first, InputIterator last, 
+  flat_map(ordered_unique_range_t, InputIterator first, InputIterator last, 
            const Compare & comp, const allocator_type & a);

      Effects: Constructs an empty flat_map using the specified comparison object and allocator, and inserts elements from the ordered range [first ,last). This function is more efficient than the normal range creation for ordered ranges.

      Requires: [first ,last) must be ordered according to the predicate.

      @@ -306,35 +306,35 @@

      Note: Non-standard extension.

    12. -
      flat_map(std::initializer_list< value_type > il);
      +
      flat_map(std::initializer_list< value_type > il);

      Effects: Constructs an empty flat_map and inserts elements from the range [il.begin() ,il.end()).

      Complexity: Linear in N if the range [il.begin(), il.end()) is already sorted using the predicate and otherwise N logN, where N is last - first.

    13. -
      flat_map(std::initializer_list< value_type > il, const allocator_type & a);
      +
      flat_map(std::initializer_list< value_type > il, const allocator_type & a);

      Effects: Constructs an empty flat_map using the specified allocator, and inserts elements from the range [il.begin() ,il.end()).

      Complexity: Linear in N if the range [il.begin(), il.end()) is already sorted using the predicate and otherwise N logN, where N is last - first.

    14. -
      flat_map(std::initializer_list< value_type > il, const Compare & comp);
      +
      flat_map(std::initializer_list< value_type > il, const Compare & comp);

      Effects: Constructs an empty flat_map using the specified comparison object and inserts elements from the range [il.begin() ,il.end()).

      Complexity: Linear in N if the range [il.begin(), il.end()) is already sorted using the predicate and otherwise N logN, where N is last - first.

    15. -
      flat_map(std::initializer_list< value_type > il, const Compare & comp, 
+
      flat_map(std::initializer_list< value_type > il, const Compare & comp, 
          const allocator_type & a);
      
 
      Effects: Constructs an empty flat_map using the specified comparison object and allocator, and inserts elements from the range [il.begin() ,il.end()).
      
 
      Complexity: Linear in N if the range [il.begin(), il.end()) is already sorted using the predicate and otherwise N logN, where N is last - first.
    16. -
      flat_map(ordered_unique_range_t, std::initializer_list< value_type > il);
      +
      flat_map(ordered_unique_range_t, std::initializer_list< value_type > il);

      Effects: Constructs an empty flat_map using and inserts elements from the ordered unique range [il.begin(), il.end()). This function is more efficient than the normal range creation for ordered ranges.

      Requires: [il.begin(), il.end()) must be ordered according to the predicate and must be unique values.

      Complexity: Linear in N.

      Note: Non-standard extension.

    17. -
      flat_map(ordered_unique_range_t, std::initializer_list< value_type > il, 
+
      flat_map(ordered_unique_range_t, std::initializer_list< value_type > il, 
          const Compare & comp);
      
 
      Effects: Constructs an empty flat_map using the specified comparison object and inserts elements from the ordered unique range [il.begin(), il.end()). This function is more efficient than the normal range creation for ordered ranges.
      
 
      Requires: [il.begin(), il.end()) must be ordered according to the predicate and must be unique values.
      
@@ -342,7 +342,7 @@
 
      Note: Non-standard extension.
    18. -
      flat_map(ordered_unique_range_t, std::initializer_list< value_type > il, 
+
      flat_map(ordered_unique_range_t, std::initializer_list< value_type > il, 
          const Compare & comp, const allocator_type & a);
      
 
      Effects: Constructs an empty flat_map using the specified comparison object and allocator, and inserts elements from the ordered unique range [il.begin(), il.end()). This function is more efficient than the normal range creation for ordered ranges.
      
 
      Requires: [il.begin(), il.end()) must be ordered according to the predicate and must be unique values.
      
@@ -350,188 +350,188 @@
 
      Note: Non-standard extension.
    19. -
      flat_map(const flat_map & x);
      +
      flat_map(const flat_map & x);

      Effects: Copy constructs a flat_map.

      Complexity: Linear in x.size().

    20. -
      flat_map(flat_map && x) noexcept(boost::container::container_detail::is_nothrow_move_constructible< Compare >::value));
      +
      flat_map(flat_map && x) noexcept(boost::container::dtl::is_nothrow_move_constructible< Compare >::value));

      Effects: Move constructs a flat_map. Constructs *this using x's resources.

      Complexity: Constant.

      Postcondition: x is emptied.

    21. -
      flat_map(const flat_map & x, const allocator_type & a);
      +
      flat_map(const flat_map & x, const allocator_type & a);

      Effects: Copy constructs a flat_map using the specified allocator.

      Complexity: Linear in x.size().

    22. -
      flat_map(flat_map && x, const allocator_type & a);
      +
      flat_map(flat_map && x, const allocator_type & a);

      Effects: Move constructs a flat_map using the specified allocator. Constructs *this using x's resources.

      Complexity: Constant if x.get_allocator() == a, linear otherwise.

    23. -
      flat_map & operator=(const flat_map & x);
      +
      flat_map & operator=(const flat_map & x);

      Effects: Makes *this a copy of x.

      Complexity: Linear in x.size().

    24. -
      flat_map & operator=(flat_map && x) noexcept((allocator_traits_type::propagate_on_container_move_assignment::value||allocator_traits_type::is_always_equal::value)&&boost::container::container_detail::is_nothrow_move_assignable< Compare >::value));
      +
      flat_map & operator=(flat_map && x) noexcept((allocator_traits_type::propagate_on_container_move_assignment::value||allocator_traits_type::is_always_equal::value)&&boost::container::dtl::is_nothrow_move_assignable< Compare >::value));

      Effects: Move constructs a flat_map. Constructs *this using x's resources.

      Throws: If allocator_traits_type::propagate_on_container_move_assignment is false and (allocation throws or value_type's move constructor throws)

      Complexity: Constant if allocator_traits_type:: propagate_on_container_move_assignment is true or this->get>allocator() == x.get_allocator(). Linear otherwise.

    25. -
      flat_map & operator=(std::initializer_list< value_type > il);
      +
      flat_map & operator=(std::initializer_list< value_type > il);
      Effects: Assign elements from il to *this
    -

    -flat_map public member functions

    +

    +flat_map public member functions

      -
    1.  BOOST_STATIC_ASSERT(unspecified);
      2. +
    2.  BOOST_STATIC_ASSERT((dtl::is_same< std::pair< Key, T >, typename allocator_type::value_type >::value));
    3. -
      allocator_type get_allocator() const noexcept;
      +
      allocator_type get_allocator() const noexcept;

      Effects: Returns a copy of the allocator that was passed to the object's constructor.

      Complexity: Constant.

    4. -
      get_stored_allocator_noconst_return_t get_stored_allocator() noexcept;
      +
      get_stored_allocator_noconst_return_t get_stored_allocator() noexcept;

      Effects: Returns a reference to the internal allocator.

      Throws: Nothing

      Complexity: Constant.

      Note: Non-standard extension.

    5. -
      get_stored_allocator_const_return_t get_stored_allocator() const noexcept;
      +
      get_stored_allocator_const_return_t get_stored_allocator() const noexcept;

      Effects: Returns a reference to the internal allocator.

      Throws: Nothing

      Complexity: Constant.

      Note: Non-standard extension.

    6. -
      iterator begin() noexcept;
      +
      iterator begin() noexcept;

      Effects: Returns an iterator to the first element contained in the container.

      Throws: Nothing.

      Complexity: Constant.

    7. -
      const_iterator begin() const noexcept;
      +
      const_iterator begin() const noexcept;

      Effects: Returns a const_iterator to the first element contained in the container.

      Throws: Nothing.

      Complexity: Constant.

    8. -
      iterator end() noexcept;
      +
      iterator end() noexcept;

      Effects: Returns an iterator to the end of the container.

      Throws: Nothing.

      Complexity: Constant.

    9. -
      const_iterator end() const noexcept;
      +
      const_iterator end() const noexcept;

      Effects: Returns a const_iterator to the end of the container.

      Throws: Nothing.

      Complexity: Constant.

    10. -
      reverse_iterator rbegin() noexcept;
      +
      reverse_iterator rbegin() noexcept;

      Effects: Returns a reverse_iterator pointing to the beginning of the reversed container.

      Throws: Nothing.

      Complexity: Constant.

    11. -
      const_reverse_iterator rbegin() const noexcept;
      +
      const_reverse_iterator rbegin() const noexcept;

      Effects: Returns a const_reverse_iterator pointing to the beginning of the reversed container.

      Throws: Nothing.

      Complexity: Constant.

    12. -
      reverse_iterator rend() noexcept;
      +
      reverse_iterator rend() noexcept;

      Effects: Returns a reverse_iterator pointing to the end of the reversed container.

      Throws: Nothing.

      Complexity: Constant.

    13. -
      const_reverse_iterator rend() const noexcept;
      +
      const_reverse_iterator rend() const noexcept;

      Effects: Returns a const_reverse_iterator pointing to the end of the reversed container.

      Throws: Nothing.

      Complexity: Constant.

    14. -
      const_iterator cbegin() const noexcept;
      +
      const_iterator cbegin() const noexcept;

      Effects: Returns a const_iterator to the first element contained in the container.

      Throws: Nothing.

      Complexity: Constant.

    15. -
      const_iterator cend() const noexcept;
      +
      const_iterator cend() const noexcept;

      Effects: Returns a const_iterator to the end of the container.

      Throws: Nothing.

      Complexity: Constant.

    16. -
      const_reverse_iterator crbegin() const noexcept;
      +
      const_reverse_iterator crbegin() const noexcept;

      Effects: Returns a const_reverse_iterator pointing to the beginning of the reversed container.

      Throws: Nothing.

      Complexity: Constant.

    17. -
      const_reverse_iterator crend() const noexcept;
      +
      const_reverse_iterator crend() const noexcept;

      Effects: Returns a const_reverse_iterator pointing to the end of the reversed container.

      Throws: Nothing.

      Complexity: Constant.

    18. -
      bool empty() const noexcept;
      +
      bool empty() const noexcept;

      Effects: Returns true if the container contains no elements.

      Throws: Nothing.

      Complexity: Constant.

    19. -
      size_type size() const noexcept;
      +
      size_type size() const noexcept;

      Effects: Returns the number of the elements contained in the container.

      Throws: Nothing.

      Complexity: Constant.

    20. -
      size_type max_size() const noexcept;
      +
      size_type max_size() const noexcept;

      Effects: Returns the largest possible size of the container.

      Throws: Nothing.

      Complexity: Constant.

    21. -
      size_type capacity() const noexcept;
      +
      size_type capacity() const noexcept;

      Effects: Number of elements for which memory has been allocated. capacity() is always greater than or equal to size().

      Throws: Nothing.

      Complexity: Constant.

    22. -
      void reserve(size_type cnt);
      +
      void reserve(size_type cnt);

      Effects: If n is less than or equal to capacity(), or the underlying container has no reserve member, this call has no effect. Otherwise, it is a request for allocation of additional memory. If the request is successful, then capacity() is greater than or equal to n; otherwise, capacity() is unchanged. In either case, size() is unchanged.

      Throws: If memory allocation allocation throws or T's copy constructor throws.

      Note: If capacity() is less than "cnt", iterators and references to to values might be invalidated.

    23. -
      void shrink_to_fit();
      +
      void shrink_to_fit();
      Effects: Tries to deallocate the excess of memory created

      Throws: If memory allocation throws, or T's copy constructor throws.

      Complexity: Linear to size().

    24. -
      mapped_type & operator[](const key_type & k);
      +
      mapped_type & operator[](const key_type & k);

      Effects: If there is no key equivalent to x in the flat_map, inserts value_type(x, T()) into the flat_map.

      Returns: A reference to the mapped_type corresponding to x in *this.

      Complexity: Logarithmic.

    25. -
      mapped_type & operator[](key_type && k);
      +
      mapped_type & operator[](key_type && k);

      Effects: If there is no key equivalent to x in the flat_map, inserts value_type(move(x), T()) into the flat_map (the key is move-constructed)

      Returns: A reference to the mapped_type corresponding to x in *this.

      Complexity: Logarithmic. 

    26. template<typename M> 
-  std::pair< iterator, bool > insert_or_assign(const key_type & k, M && obj);
      + std::pair< iterator, bool > insert_or_assign(const key_type & k, M && obj);

      Effects: If a key equivalent to k already exists in the container, assigns forward<M>(obj) to the mapped_type corresponding to the key k. If the key does not exist, inserts the new value as if by insert, constructing it from value_type(k, forward<M>(obj)).

      No iterators or references are invalidated. If the insertion is successful, pointers and references to the element obtained while it is held in the node handle are invalidated, and pointers and references obtained to that element before it was extracted become valid.

      Returns: The bool component is true if the insertion took place and false if the assignment took place. The iterator component is pointing at the element that was inserted or updated.

      @@ -539,7 +539,7 @@ 
    27. template<typename M> 
-  std::pair< iterator, bool > insert_or_assign(key_type && k, M && obj);
      + std::pair< iterator, bool > insert_or_assign(key_type && k, M && obj);

      Effects: If a key equivalent to k already exists in the container, assigns forward<M>(obj) to the mapped_type corresponding to the key k. If the key does not exist, inserts the new value as if by insert, constructing it from value_type(k, move(obj)).

      No iterators or references are invalidated. If the insertion is successful, pointers and references to the element obtained while it is held in the node handle are invalidated, and pointers and references obtained to that element before it was extracted become valid.

      Returns: The bool component is true if the insertion took place and false if the assignment took place. The iterator component is pointing at the element that was inserted or updated.

      @@ -547,7 +547,7 @@ 
    28. template<typename M> 
-  iterator insert_or_assign(const_iterator hint, const key_type & k, M && obj);
      + iterator insert_or_assign(const_iterator hint, const key_type & k, M && obj);

      Effects: If a key equivalent to k already exists in the container, assigns forward<M>(obj) to the mapped_type corresponding to the key k. If the key does not exist, inserts the new value as if by insert, constructing it from value_type(k, forward<M>(obj)) and the new element to the container as close as possible to the position just before hint.

      No iterators or references are invalidated. If the insertion is successful, pointers and references to the element obtained while it is held in the node handle are invalidated, and pointers and references obtained to that element before it was extracted become valid.

      Returns: The bool component is true if the insertion took place and false if the assignment took place. The iterator component is pointing at the element that was inserted or updated.

      @@ -555,14 +555,14 @@ 
    29. template<typename M> 
-  iterator insert_or_assign(const_iterator hint, key_type && k, M && obj);
      + iterator insert_or_assign(const_iterator hint, key_type && k, M && obj);

      Effects: If a key equivalent to k already exists in the container, assigns forward<M>(obj) to the mapped_type corresponding to the key k. If the key does not exist, inserts the new value as if by insert, constructing it from value_type(k, move(obj)) and the new element to the container as close as possible to the position just before hint.

      No iterators or references are invalidated. If the insertion is successful, pointers and references to the element obtained while it is held in the node handle are invalidated, and pointers and references obtained to that element before it was extracted become valid.

      Returns: The bool component is true if the insertion took place and false if the assignment took place. The iterator component is pointing at the element that was inserted or updated.

      Complexity: Logarithmic in the size of the container in general, but amortized constant if the new element is inserted just before hint.

    30. -
      iterator nth(size_type n) noexcept;
      +
      iterator nth(size_type n) noexcept;

      Requires: size() >= n.

      Effects: Returns an iterator to the nth element from the beginning of the container. Returns end() if n == size().

      Throws: Nothing.

      @@ -570,7 +570,7 @@

      Note: Non-standard extension

    31. -
      const_iterator nth(size_type n) const noexcept;
      +
      const_iterator nth(size_type n) const noexcept;

      Requires: size() >= n.

      Effects: Returns a const_iterator to the nth element from the beginning of the container. Returns end() if n == size().

      Throws: Nothing.

      @@ -578,7 +578,7 @@

      Note: Non-standard extension

    32. -
      size_type index_of(iterator p) noexcept;
      +
      size_type index_of(iterator p) noexcept;

      Requires: begin() <= p <= end().

      Effects: Returns the index of the element pointed by p and size() if p == end().

      Throws: Nothing.

      @@ -586,7 +586,7 @@

      Note: Non-standard extension

    33. -
      size_type index_of(const_iterator p) const noexcept;
      +
      size_type index_of(const_iterator p) const noexcept;

      Requires: begin() <= p <= end().

      Effects: Returns the index of the element pointed by p and size() if p == end().

      Throws: Nothing.

      @@ -594,19 +594,19 @@

      Note: Non-standard extension

    34. -
      T & at(const key_type & k);
      +
      T & at(const key_type & k);

      Returns: A reference to the element whose key is equivalent to x.

      Throws: An exception object of type out_of_range if no such element is present.

      Complexity: logarithmic.

    35. -
      const T & at(const key_type & k) const;
      +
      const T & at(const key_type & k) const;

      Returns: A reference to the element whose key is equivalent to x.

      Throws: An exception object of type out_of_range if no such element is present.

      Complexity: logarithmic.

    36. -
      template<class... Args> std::pair< iterator, bool > emplace(Args &&... args);
      +
      template<class... Args> std::pair< iterator, bool > emplace(Args &&... args);

      Effects: Inserts an object x of type T constructed with std::forward<Args>(args)... if and only if there is no element in the container with key equivalent to the key of x.

      Returns: The bool component of the returned pair is true if and only if the insertion takes place, and the iterator component of the pair points to the element with key equivalent to the key of x.

      Complexity: Logarithmic search time plus linear insertion to the elements with bigger keys than x.

      @@ -614,7 +614,7 @@ 
    37. template<class... Args> 
-  iterator emplace_hint(const_iterator hint, Args &&... args);
      + iterator emplace_hint(const_iterator hint, Args &&... args);

      Effects: Inserts an object of type T constructed with std::forward<Args>(args)... in the container if and only if there is no element in the container with key equivalent to the key of x. p is a hint pointing to where the insert should start to search.

      Returns: An iterator pointing to the element with key equivalent to the key of x.

      Complexity: Logarithmic search time (constant if x is inserted right before p) plus insertion linear to the elements with bigger keys than x.

      @@ -622,7 +622,7 @@ 
    38. template<class... Args> 
-  std::pair< iterator, bool > try_emplace(const key_type & k, Args &&... args);
      + std::pair< iterator, bool > try_emplace(const key_type & k, Args &&... args);

      Requires: value_type shall be EmplaceConstructible into map from piecewise_construct, forward_as_tuple(k), forward_as_tuple(forward<Args>(args)...).

      Effects: If the map already contains an element whose key is equivalent to k, there is no effect. Otherwise inserts an object of type value_type constructed with piecewise_construct, forward_as_tuple(k), forward_as_tuple(forward<Args>(args)...).

      Returns: The bool component of the returned pair is true if and only if the insertion took place. The returned iterator points to the map element whose key is equivalent to k.

      @@ -630,7 +630,7 @@ 
    39. template<class... Args> 
-  iterator try_emplace(const_iterator hint, const key_type & k, 
+  iterator try_emplace(const_iterator hint, const key_type & k, 
                        Args &&... args);

      Requires: value_type shall be EmplaceConstructible into map from piecewise_construct, forward_as_tuple(k), forward_as_tuple(forward<Args>(args)...).

      Effects: If the map already contains an element whose key is equivalent to k, there is no effect. Otherwise inserts an object of type value_type constructed with piecewise_construct, forward_as_tuple(k), forward_as_tuple(forward<Args>(args)...).

      @@ -639,7 +639,7 @@ 
    40. template<class... Args> 
-  std::pair< iterator, bool > try_emplace(key_type && k, Args &&... args);
      + std::pair< iterator, bool > try_emplace(key_type && k, Args &&... args);

      Requires: value_type shall be EmplaceConstructible into map from piecewise_construct, forward_as_tuple(move(k)), forward_as_tuple(forward<Args>(args)...).

      Effects: If the map already contains an element whose key is equivalent to k, there is no effect. Otherwise inserts an object of type value_type constructed with piecewise_construct, forward_as_tuple(move(k)), forward_as_tuple(forward<Args>(args)...).

      Returns: The bool component of the returned pair is true if and only if the insertion took place. The returned iterator points to the map element whose key is equivalent to k.

      @@ -647,49 +647,49 @@ 
    41. template<class... Args> 
-  iterator try_emplace(const_iterator hint, key_type && k, Args &&... args);
      + iterator try_emplace(const_iterator hint, key_type && k, Args &&... args);

      Requires: value_type shall be EmplaceConstructible into map from piecewise_construct, forward_as_tuple(move(k)), forward_as_tuple(forward<Args>(args)...).

      Effects: If the map already contains an element whose key is equivalent to k, there is no effect. Otherwise inserts an object of type value_type constructed with piecewise_construct, forward_as_tuple(move(k)), forward_as_tuple(forward<Args>(args)...).

      Returns: The returned iterator points to the map element whose key is equivalent to k.

      Complexity: Logarithmic in general, but amortized constant if value is inserted right before p.

    42. -
      std::pair< iterator, bool > insert(const value_type & x);
      +
      std::pair< iterator, bool > insert(const value_type & x);

      Effects: Inserts x if and only if there is no element in the container with key equivalent to the key of x.

      Returns: The bool component of the returned pair is true if and only if the insertion takes place, and the iterator component of the pair points to the element with key equivalent to the key of x.

      Complexity: Logarithmic search time plus linear insertion to the elements with bigger keys than x.

      Note: If an element is inserted it might invalidate elements.

    43. -
      std::pair< iterator, bool > insert(value_type && x);
      +
      std::pair< iterator, bool > insert(value_type && x);

      Effects: Inserts a new value_type move constructed from the pair if and only if there is no element in the container with key equivalent to the key of x.

      Returns: The bool component of the returned pair is true if and only if the insertion takes place, and the iterator component of the pair points to the element with key equivalent to the key of x.

      Complexity: Logarithmic search time plus linear insertion to the elements with bigger keys than x.

      Note: If an element is inserted it might invalidate elements.

    44. -
      std::pair< iterator, bool > insert(movable_value_type && x);
      +
      std::pair< iterator, bool > insert(movable_value_type && x);

      Effects: Inserts a new value_type move constructed from the pair if and only if there is no element in the container with key equivalent to the key of x.

      Returns: The bool component of the returned pair is true if and only if the insertion takes place, and the iterator component of the pair points to the element with key equivalent to the key of x.

      Complexity: Logarithmic search time plus linear insertion to the elements with bigger keys than x.

      Note: If an element is inserted it might invalidate elements.

    45. -
      iterator insert(const_iterator p, const value_type & x);
      +
      iterator insert(const_iterator p, const value_type & x);

      Effects: Inserts a copy of x in the container if and only if there is no element in the container with key equivalent to the key of x. p is a hint pointing to where the insert should start to search.

      Returns: An iterator pointing to the element with key equivalent to the key of x.

      Complexity: Logarithmic search time (constant if x is inserted right before p) plus insertion linear to the elements with bigger keys than x.

      Note: If an element is inserted it might invalidate elements.

    46. -
      iterator insert(const_iterator p, value_type && x);
      +
      iterator insert(const_iterator p, value_type && x);

      Effects: Inserts an element move constructed from x in the container. p is a hint pointing to where the insert should start to search.

      Returns: An iterator pointing to the element with key equivalent to the key of x.

      Complexity: Logarithmic search time (constant if x is inserted right before p) plus insertion linear to the elements with bigger keys than x.

      Note: If an element is inserted it might invalidate elements.

    47. -
      iterator insert(const_iterator p, movable_value_type && x);
      +
      iterator insert(const_iterator p, movable_value_type && x);

      Effects: Inserts an element move constructed from x in the container. p is a hint pointing to where the insert should start to search.

      Returns: An iterator pointing to the element with key equivalent to the key of x.

      Complexity: Logarithmic search time (constant if x is inserted right before p) plus insertion linear to the elements with bigger keys than x.

      @@ -697,39 +697,39 @@ 
    48. template<typename InputIterator> 
-  void insert(InputIterator first, InputIterator last);
      + void insert(InputIterator first, InputIterator last);

      Requires: first, last are not iterators into *this.

      Effects: inserts each element from the range [first,last) if and only if there is no element with key equivalent to the key of that element.

      -

      Complexity: At most N log(size()+N) (N is the distance from first to last) search time plus N*size() insertion time.

      +

      Complexity: N log(size()+N).

      Note: If an element is inserted it might invalidate elements. 

    49. template<typename InputIterator> 
-  void insert(ordered_unique_range_t, InputIterator first, InputIterator last);
      + void insert(ordered_unique_range_t, InputIterator first, InputIterator last);

      Requires: first, last are not iterators into *this.

      Requires: [first ,last) must be ordered according to the predicate and must be unique values.

      Effects: inserts each element from the range [first,last) if and only if there is no element with key equivalent to the key of that element. This function is more efficient than the normal range creation for ordered ranges.

      -

      Complexity: At most N log(size()+N) (N is the distance from first to last) search time plus N*size() insertion time.

      +

      Complexity: Linear.

      Note: If an element is inserted it might invalidate elements.

      Note: Non-standard extension.

    50. -
      void insert(std::initializer_list< value_type > il);
      +
      void insert(std::initializer_list< value_type > il);

      Effects: inserts each element from the range [il.begin(), il.end()) if and only if there is no element with key equivalent to the key of that element.

      -

      Complexity: At most N log(size()+N) (N is the distance from il.first() to il.end()) search time plus N*size() insertion time.

      +

      Complexity: N log(N).

      Note: If an element is inserted it might invalidate elements.

    51. -
      void insert(ordered_unique_range_t, std::initializer_list< value_type > il);
      +
      void insert(ordered_unique_range_t, std::initializer_list< value_type > il);

      Requires: [il.begin(), il.end()) must be ordered according to the predicate and must be unique values.

      Effects: inserts each element from the range [il.begin(), il.end()) if and only if there is no element with key equivalent to the key of that element. This function is more efficient than the normal range creation for ordered ranges.

      -

      Complexity: At most N log(size()+N) (N is the distance from first to last) search time plus N*size() insertion time.

      +

      Complexity: Linear.

      Note: If an element is inserted it might invalidate elements.

      Note: Non-standard extension. 

    52. template<typename C2> 
-  void merge(flat_map< Key, T, C2, AllocatorOrContainer > & source);
      + void merge(flat_map< Key, T, C2, AllocatorOrContainer > & source);

      Requires: this->get_allocator() == source.get_allocator().

      Effects: Attempts to extract each element in source and insert it into a using the comparison object of *this. If there is an element in a with key equivalent to the key of an element from source, then that element is not extracted from source.

      Postcondition: Pointers and references to the transferred elements of source refer to those same elements but as members of *this. Iterators referring to the transferred elements will continue to refer to their elements, but they now behave as iterators into *this, not into source.

      @@ -738,7 +738,7 @@ 
    53. template<typename C2> 
-  void merge(flat_map< Key, T, C2, AllocatorOrContainer > && source);
      + void merge(flat_map< Key, T, C2, AllocatorOrContainer > && source);

      Requires: this->get_allocator() == source.get_allocator().

      Effects: Attempts to extract each element in source and insert it into a using the comparison object of *this. If there is an element in a with key equivalent to the key of an element from source, then that element is not extracted from source.

      Postcondition: Pointers and references to the transferred elements of source refer to those same elements but as members of *this. Iterators referring to the transferred elements will continue to refer to their elements, but they now behave as iterators into *this, not into source.

      @@ -747,7 +747,7 @@ 
    54. template<typename C2> 
-  void merge(flat_multimap< Key, T, C2, AllocatorOrContainer > & source);
      + void merge(flat_multimap< Key, T, C2, AllocatorOrContainer > & source);

      Requires: this->get_allocator() == source.get_allocator().

      Effects: Attempts to extract each element in source and insert it into a using the comparison object of *this. If there is an element in a with key equivalent to the key of an element from source, then that element is not extracted from source.

      Postcondition: Pointers and references to the transferred elements of source refer to those same elements but as members of *this. Iterators referring to the transferred elements will continue to refer to their elements, but they now behave as iterators into *this, not into source.

      @@ -756,7 +756,7 @@ 
    55. template<typename C2> 
-  void merge(flat_multimap< Key, T, C2, AllocatorOrContainer > && source);
      + void merge(flat_multimap< Key, T, C2, AllocatorOrContainer > && source);

      Requires: this->get_allocator() == source.get_allocator().

      Effects: Attempts to extract each element in source and insert it into a using the comparison object of *this. If there is an element in a with key equivalent to the key of an element from source, then that element is not extracted from source.

      Postcondition: Pointers and references to the transferred elements of source refer to those same elements but as members of *this. Iterators referring to the transferred elements will continue to refer to their elements, but they now behave as iterators into *this, not into source.

      @@ -764,108 +764,108 @@

      Complexity: N log(a.size() + N) (N has the value source.size())

    56. -
      iterator erase(const_iterator p);
      +
      iterator erase(const_iterator p);

      Effects: Erases the element pointed to by p.

      Returns: Returns an iterator pointing to the element immediately following q prior to the element being erased. If no such element exists, returns end().

      Complexity: Linear to the elements with keys bigger than p

      Note: Invalidates elements with keys not less than the erased element.

    57. -
      size_type erase(const key_type & x);
      +
      size_type erase(const key_type & x);

      Effects: Erases all elements in the container with key equivalent to x.

      Returns: Returns the number of erased elements.

      Complexity: Logarithmic search time plus erasure time linear to the elements with bigger keys.

    58. -
      iterator erase(const_iterator first, const_iterator last);
      +
      iterator erase(const_iterator first, const_iterator last);

      Effects: Erases all the elements in the range [first, last).

      Returns: Returns last.

      Complexity: size()*N where N is the distance from first to last.

      Complexity: Logarithmic search time plus erasure time linear to the elements with bigger keys.

    59. -
      void swap(flat_map & x) noexcept(allocator_traits_type::is_always_equal::value &&boost::container::container_detail::is_nothrow_swappable< Compare >::value));
      +
      void swap(flat_map & x) noexcept(allocator_traits_type::is_always_equal::value &&boost::container::dtl::is_nothrow_swappable< Compare >::value));

      Effects: Swaps the contents of *this and x.

      Throws: Nothing.

      Complexity: Constant.

    60. -
      void clear() noexcept;
      +
      void clear() noexcept;

      Effects: erase(a.begin(),a.end()).

      Postcondition: size() == 0.

      Complexity: linear in size().

    61. -
      key_compare key_comp() const;
      +
      key_compare key_comp() const;

      Effects: Returns the comparison object out of which a was constructed.

      Complexity: Constant.

    62. -
      value_compare value_comp() const;
      +
      value_compare value_comp() const;

      Effects: Returns an object of value_compare constructed out of the comparison object.

      Complexity: Constant.

    63. -
      iterator find(const key_type & x);
      +
      iterator find(const key_type & x);

      Returns: An iterator pointing to an element with the key equivalent to x, or end() if such an element is not found.

      Complexity: Logarithmic.

    64. -
      const_iterator find(const key_type & x) const;
      +
      const_iterator find(const key_type & x) const;

      Returns: A const_iterator pointing to an element with the key equivalent to x, or end() if such an element is not found.

      Complexity: Logarithmic.

    65. -
      size_type count(const key_type & x) const;
      +
      size_type count(const key_type & x) const;

      Returns: The number of elements with key equivalent to x.

      Complexity: log(size())+count(k)

    66. -
      iterator lower_bound(const key_type & x);
      +
      iterator lower_bound(const key_type & x);

      Returns: An iterator pointing to the first element with key not less than k, or a.end() if such an element is not found.

      Complexity: Logarithmic.

    67. -
      const_iterator lower_bound(const key_type & x) const;
      +
      const_iterator lower_bound(const key_type & x) const;

      Returns: A const iterator pointing to the first element with key not less than k, or a.end() if such an element is not found.

      Complexity: Logarithmic.

    68. -
      iterator upper_bound(const key_type & x);
      +
      iterator upper_bound(const key_type & x);

      Returns: An iterator pointing to the first element with key not less than x, or end() if such an element is not found.

      Complexity: Logarithmic.

    69. -
      const_iterator upper_bound(const key_type & x) const;
      +
      const_iterator upper_bound(const key_type & x) const;

      Returns: A const iterator pointing to the first element with key not less than x, or end() if such an element is not found.

      Complexity: Logarithmic.

    70. -
      std::pair< iterator, iterator > equal_range(const key_type & x);
      +
      std::pair< iterator, iterator > equal_range(const key_type & x);

      Effects: Equivalent to std::make_pair(this->lower_bound(k), this->upper_bound(k)).

      Complexity: Logarithmic. 

    71. std::pair< const_iterator, const_iterator > 
-equal_range(const key_type & x) const;
      +equal_range(const key_type & x) const;

      Effects: Equivalent to std::make_pair(this->lower_bound(k), this->upper_bound(k)).

      Complexity: Logarithmic.

    72. -
      sequence_type extract_sequence();
      +
      sequence_type extract_sequence();

      Effects: Extracts the internal sequence container.

      Complexity: Same as the move constructor of sequence_type, usually constant.

      Postcondition: this->empty()

      Throws: If secuence_type's move constructor throws

    73. -
      void adopt_sequence(sequence_type && seq);
      +
      void adopt_sequence(sequence_type && seq);

      Effects: Discards the internally hold sequence container and adopts the one passed externally using the move assignment. Erases non-unique elements.

      Complexity: Assuming O(1) move assignment, O(NlogN) with N = seq.size()

      Throws: If the comparison or the move constructor throws

    74. -
      void adopt_sequence(ordered_unique_range_t, sequence_type && seq);
      +
      void adopt_sequence(ordered_unique_range_t, sequence_type && seq);

      Requires: seq shall be ordered according to this->compare() and shall contain unique elements.

      Effects: Discards the internally hold sequence container and adopts the one passed externally using the move assignment.

      Complexity: Assuming O(1) move assignment, O(1)

      @@ -874,41 +874,41 @@
    -

    -flat_map friend functions

    +

    +flat_map friend functions

    1. -
      friend bool operator==(const flat_map & x, const flat_map & y);
      +
      friend bool operator==(const flat_map & x, const flat_map & y);

      Effects: Returns true if x and y are equal

      Complexity: Linear to the number of elements in the container.

    2. -
      friend bool operator!=(const flat_map & x, const flat_map & y);
      +
      friend bool operator!=(const flat_map & x, const flat_map & y);

      Effects: Returns true if x and y are unequal

      Complexity: Linear to the number of elements in the container.

    3. -
      friend bool operator<(const flat_map & x, const flat_map & y);
      +
      friend bool operator<(const flat_map & x, const flat_map & y);

      Effects: Returns true if x is less than y

      Complexity: Linear to the number of elements in the container.

    4. -
      friend bool operator>(const flat_map & x, const flat_map & y);
      +
      friend bool operator>(const flat_map & x, const flat_map & y);

      Effects: Returns true if x is greater than y

      Complexity: Linear to the number of elements in the container.

    5. -
      friend bool operator<=(const flat_map & x, const flat_map & y);
      +
      friend bool operator<=(const flat_map & x, const flat_map & y);

      Effects: Returns true if x is equal or less than y

      Complexity: Linear to the number of elements in the container.

    6. -
      friend bool operator>=(const flat_map & x, const flat_map & y);
      +
      friend bool operator>=(const flat_map & x, const flat_map & y);

      Effects: Returns true if x is equal or greater than y

      Complexity: Linear to the number of elements in the container.

    7. -
      friend void swap(flat_map & x, flat_map & y);
      +
      friend void swap(flat_map & x, flat_map & y);

      Effects: x.swap(y)

      Complexity: Constant.

      8. @@ -918,7 +918,8 @@
    -
    Copyright © 2009-2015 Ion Gaztanaga

    +

    Copyright © 2009-2017 Ion + Gaztanaga

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost/container/flat_multimap.html b/doc/html/boost/container/flat_multimap.html index d04e988ea8..a101119a0d 100644 --- a/doc/html/boost/container/flat_multimap.html +++ b/doc/html/boost/container/flat_multimap.html @@ -59,125 +59,125 @@ typedef implementation_defined movable_value_type; // construct/copy/destruct - flat_multimap() noexcept(container_detail::is_nothrow_default_constructible< AllocatorOrContainer >::value &&container_detail::is_nothrow_default_constructible< Compare >::value)); - explicit flat_multimap(const allocator_type &); - explicit flat_multimap(const Compare &); - flat_multimap(const Compare &, const allocator_type &); - template<typename InputIterator> flat_multimap(InputIterator, InputIterator); + flat_multimap() noexcept(dtl::is_nothrow_default_constructible< AllocatorOrContainer >::value &&dtl::is_nothrow_default_constructible< Compare >::value)); + explicit flat_multimap(const allocator_type &); + explicit flat_multimap(const Compare &); + flat_multimap(const Compare &, const allocator_type &); + template<typename InputIterator> flat_multimap(InputIterator, InputIterator); template<typename InputIterator> - flat_multimap(InputIterator, InputIterator, const allocator_type &); + flat_multimap(InputIterator, InputIterator, const allocator_type &); template<typename InputIterator> - flat_multimap(InputIterator, InputIterator, const Compare &); + flat_multimap(InputIterator, InputIterator, const Compare &); template<typename InputIterator> - flat_multimap(InputIterator, InputIterator, const Compare &, + flat_multimap(InputIterator, InputIterator, const Compare &, const allocator_type &); template<typename InputIterator> - flat_multimap(ordered_range_t, InputIterator, InputIterator); + flat_multimap(ordered_range_t, InputIterator, InputIterator); template<typename InputIterator> - flat_multimap(ordered_range_t, InputIterator, InputIterator, + flat_multimap(ordered_range_t, InputIterator, InputIterator, const Compare &); template<typename InputIterator> - flat_multimap(ordered_range_t, InputIterator, InputIterator, + flat_multimap(ordered_range_t, InputIterator, InputIterator, const Compare &, const allocator_type &); - flat_multimap(std::initializer_list< value_type >); - flat_multimap(std::initializer_list< value_type >, const allocator_type &); - flat_multimap(std::initializer_list< value_type >, const Compare &); - flat_multimap(std::initializer_list< value_type >, const Compare &, + flat_multimap(std::initializer_list< value_type >); + flat_multimap(std::initializer_list< value_type >, const allocator_type &); + flat_multimap(std::initializer_list< value_type >, const Compare &); + flat_multimap(std::initializer_list< value_type >, const Compare &, const allocator_type &); - flat_multimap(ordered_range_t, std::initializer_list< value_type >); - flat_multimap(ordered_range_t, std::initializer_list< value_type >, + flat_multimap(ordered_range_t, std::initializer_list< value_type >); + flat_multimap(ordered_range_t, std::initializer_list< value_type >, const Compare &); - flat_multimap(ordered_range_t, std::initializer_list< value_type >, + flat_multimap(ordered_range_t, std::initializer_list< value_type >, const Compare &, const allocator_type &); - flat_multimap(const flat_multimap &); - flat_multimap(flat_multimap &&) noexcept(boost::container::container_detail::is_nothrow_move_constructible< Compare >::value)); - flat_multimap(const flat_multimap &, const allocator_type &); - flat_multimap(flat_multimap &&, const allocator_type &); - flat_multimap & operator=(const flat_multimap &); + flat_multimap(const flat_multimap &); + flat_multimap(flat_multimap &&) noexcept(boost::container::dtl::is_nothrow_move_constructible< Compare >::value)); + flat_multimap(const flat_multimap &, const allocator_type &); + flat_multimap(flat_multimap &&, const allocator_type &); + flat_multimap & operator=(const flat_multimap &); flat_multimap & - operator=(flat_multimap &&) noexcept((allocator_traits_type::propagate_on_container_move_assignment::value||allocator_traits_type::is_always_equal::value)&&boost::container::container_detail::is_nothrow_move_assignable< Compare >::value)); - flat_multimap & operator=(std::initializer_list< value_type >); + operator=(flat_multimap &&) noexcept((allocator_traits_type::propagate_on_container_move_assignment::value||allocator_traits_type::is_always_equal::value)&&boost::container::dtl::is_nothrow_move_assignable< Compare >::value)); + flat_multimap & operator=(std::initializer_list< value_type >); - // public member functions - BOOST_STATIC_ASSERT(unspecified); - allocator_type get_allocator() const noexcept; - stored_allocator_type & get_stored_allocator() noexcept; - const stored_allocator_type & get_stored_allocator() const noexcept; - iterator begin() noexcept; - const_iterator begin() const noexcept; - iterator end() noexcept; - const_iterator end() const noexcept; - reverse_iterator rbegin() noexcept; - const_reverse_iterator rbegin() const noexcept; - reverse_iterator rend() noexcept; - const_reverse_iterator rend() const noexcept; - const_iterator cbegin() const noexcept; - const_iterator cend() const noexcept; - const_reverse_iterator crbegin() const noexcept; - const_reverse_iterator crend() const noexcept; - bool empty() const noexcept; - size_type size() const noexcept; - size_type max_size() const noexcept; - size_type capacity() const noexcept; - void reserve(size_type); - void shrink_to_fit(); - iterator nth(size_type) noexcept; - const_iterator nth(size_type) const noexcept; - size_type index_of(iterator) noexcept; - size_type index_of(const_iterator) const noexcept; - template<class... Args> iterator emplace(Args &&...); - template<class... Args> iterator emplace_hint(const_iterator, Args &&...); - iterator insert(const value_type &); - iterator insert(value_type &&); - iterator insert(impl_value_type &&); - iterator insert(const_iterator, const value_type &); - iterator insert(const_iterator, value_type &&); - iterator insert(const_iterator, impl_value_type &&); - template<typename InputIterator> void insert(InputIterator, InputIterator); + // public member functions + BOOST_STATIC_ASSERT((dtl::is_same< std::pair< Key, T >, typename AllocatorOrContainer::value_type >::value)); + allocator_type get_allocator() const noexcept; + stored_allocator_type & get_stored_allocator() noexcept; + const stored_allocator_type & get_stored_allocator() const noexcept; + iterator begin() noexcept; + const_iterator begin() const noexcept; + iterator end() noexcept; + const_iterator end() const noexcept; + reverse_iterator rbegin() noexcept; + const_reverse_iterator rbegin() const noexcept; + reverse_iterator rend() noexcept; + const_reverse_iterator rend() const noexcept; + const_iterator cbegin() const noexcept; + const_iterator cend() const noexcept; + const_reverse_iterator crbegin() const noexcept; + const_reverse_iterator crend() const noexcept; + bool empty() const noexcept; + size_type size() const noexcept; + size_type max_size() const noexcept; + size_type capacity() const noexcept; + void reserve(size_type); + void shrink_to_fit(); + iterator nth(size_type) noexcept; + const_iterator nth(size_type) const noexcept; + size_type index_of(iterator) noexcept; + size_type index_of(const_iterator) const noexcept; + template<class... Args> iterator emplace(Args &&...); + template<class... Args> iterator emplace_hint(const_iterator, Args &&...); + iterator insert(const value_type &); + iterator insert(value_type &&); + iterator insert(impl_value_type &&); + iterator insert(const_iterator, const value_type &); + iterator insert(const_iterator, value_type &&); + iterator insert(const_iterator, impl_value_type &&); + template<typename InputIterator> void insert(InputIterator, InputIterator); template<typename InputIterator> - void insert(ordered_range_t, InputIterator, InputIterator); - void insert(std::initializer_list< value_type >); - void insert(ordered_range_t, std::initializer_list< value_type >); + void insert(ordered_range_t, InputIterator, InputIterator); + void insert(std::initializer_list< value_type >); + void insert(ordered_range_t, std::initializer_list< value_type >); template<typename C2> - void merge(flat_multimap< Key, T, C2, AllocatorOrContainer > &); + void merge(flat_multimap< Key, T, C2, AllocatorOrContainer > &); template<typename C2> - void merge(flat_multimap< Key, T, C2, AllocatorOrContainer > &&); + void merge(flat_multimap< Key, T, C2, AllocatorOrContainer > &&); template<typename C2> - void merge(flat_map< Key, T, C2, AllocatorOrContainer > &); + void merge(flat_map< Key, T, C2, AllocatorOrContainer > &); template<typename C2> - void merge(flat_map< Key, T, C2, AllocatorOrContainer > &&); - iterator erase(const_iterator); - size_type erase(const key_type &); - iterator erase(const_iterator, const_iterator); - void swap(flat_multimap &) noexcept(allocator_traits_type::is_always_equal::value &&boost::container::container_detail::is_nothrow_swappable< Compare >::value)); - void clear() noexcept; - key_compare key_comp() const; - value_compare value_comp() const; - iterator find(const key_type &); - const_iterator find(const key_type &) const; - size_type count(const key_type &) const; - iterator lower_bound(const key_type &); - const_iterator lower_bound(const key_type &) const; - iterator upper_bound(const key_type &); - const_iterator upper_bound(const key_type &) const; - std::pair< iterator, iterator > equal_range(const key_type &); + void merge(flat_map< Key, T, C2, AllocatorOrContainer > &&); + iterator erase(const_iterator); + size_type erase(const key_type &); + iterator erase(const_iterator, const_iterator); + void swap(flat_multimap &) noexcept(allocator_traits_type::is_always_equal::value &&boost::container::dtl::is_nothrow_swappable< Compare >::value)); + void clear() noexcept; + key_compare key_comp() const; + value_compare value_comp() const; + iterator find(const key_type &); + const_iterator find(const key_type &) const; + size_type count(const key_type &) const; + iterator lower_bound(const key_type &); + const_iterator lower_bound(const key_type &) const; + iterator upper_bound(const key_type &); + const_iterator upper_bound(const key_type &) const; + std::pair< iterator, iterator > equal_range(const key_type &); std::pair< const_iterator, const_iterator > - equal_range(const key_type &) const; - sequence_type extract_sequence(); - void adopt_sequence(sequence_type &&); - void adopt_sequence(ordered_range_t, sequence_type &&); + equal_range(const key_type &) const; + sequence_type extract_sequence(); + void adopt_sequence(sequence_type &&); + void adopt_sequence(ordered_range_t, sequence_type &&); - // friend functions - friend bool operator==(const flat_multimap &, const flat_multimap &); - friend bool operator!=(const flat_multimap &, const flat_multimap &); - friend bool operator<(const flat_multimap &, const flat_multimap &); - friend bool operator>(const flat_multimap &, const flat_multimap &); - friend bool operator<=(const flat_multimap &, const flat_multimap &); - friend bool operator>=(const flat_multimap &, const flat_multimap &); - friend void swap(flat_multimap &, flat_multimap &); + // friend functions + friend bool operator==(const flat_multimap &, const flat_multimap &); + friend bool operator!=(const flat_multimap &, const flat_multimap &); + friend bool operator<(const flat_multimap &, const flat_multimap &); + friend bool operator>(const flat_multimap &, const flat_multimap &); + friend bool operator<=(const flat_multimap &, const flat_multimap &); + friend bool operator>=(const flat_multimap &, const flat_multimap &); + friend void swap(flat_multimap &, flat_multimap &); };
    -

    Description

    +

    Description

    A flat_multimap is a kind of associative container that supports equivalent keys (possibly containing multiple copies of the same key value) and provides for fast retrieval of values of another type T based on the keys.

    A flat_multimap satisfies all of the requirements of a container and of a reversible container and of an associative container. For a flat_multimap<Key,T> the key_type is Key and the value_type is std::pair<Key,T> (unlike std::multimap<Key, T> which value_type is std::pair<const Key, T>).

    flat_multimap is similar to std::multimap but it's implemented by as an ordered sequence container. The underlying sequence container is by default vector but it can also work user-provided vector-like SequenceContainers (like static_vector or small_vector).

    @@ -186,7 +186,7 @@

    -

    Template Parameters

    +

    Template Parameters

    1. typename Key
      @@ -210,60 +210,60 @@
    -

    +

    flat_multimap public construct/copy/destruct

    1. -
      flat_multimap() noexcept(container_detail::is_nothrow_default_constructible< AllocatorOrContainer >::value &&container_detail::is_nothrow_default_constructible< Compare >::value));
      +
      flat_multimap() noexcept(dtl::is_nothrow_default_constructible< AllocatorOrContainer >::value &&dtl::is_nothrow_default_constructible< Compare >::value));

      Effects: Default constructs an empty flat_map.

      Complexity: Constant.

    2. -
      explicit flat_multimap(const allocator_type & a);
      +
      explicit flat_multimap(const allocator_type & a);

      Effects: Constructs an empty flat_multimap using the specified allocator.

      Complexity: Constant.

    3. -
      explicit flat_multimap(const Compare & comp);
      +
      explicit flat_multimap(const Compare & comp);

      Effects: Constructs an empty flat_multimap using the specified comparison object .

      Complexity: Constant.

    4. -
      flat_multimap(const Compare & comp, const allocator_type & a);
      +
      flat_multimap(const Compare & comp, const allocator_type & a);

      Effects: Constructs an empty flat_multimap using the specified comparison object and allocator.

      Complexity: Constant. 

    5. template<typename InputIterator> 
-  flat_multimap(InputIterator first, InputIterator last);
      + flat_multimap(InputIterator first, InputIterator last);

      Effects: Constructs an empty flat_multimap and inserts elements from the range [first ,last ).

      Complexity: Linear in N if the range [first ,last ) is already sorted using the predicate and otherwise N logN, where N is last - first. 

    6. template<typename InputIterator> 
-  flat_multimap(InputIterator first, InputIterator last, 
+  flat_multimap(InputIterator first, InputIterator last, 
                 const allocator_type & a);

      Effects: Constructs an empty flat_multimap using the specified allocator, and inserts elements from the range [first ,last ).

      Complexity: Linear in N if the range [first ,last ) is already sorted using the predicate and otherwise N logN, where N is last - first. 

    7. template<typename InputIterator> 
-  flat_multimap(InputIterator first, InputIterator last, const Compare & comp);
      + flat_multimap(InputIterator first, InputIterator last, const Compare & comp);

      Effects: Constructs an empty flat_multimap using the specified comparison object and inserts elements from the range [first ,last ).

      Complexity: Linear in N if the range [first ,last ) is already sorted using the predicate and otherwise N logN, where N is last - first. 

    8. template<typename InputIterator> 
-  flat_multimap(InputIterator first, InputIterator last, const Compare & comp, 
+  flat_multimap(InputIterator first, InputIterator last, const Compare & comp, 
                 const allocator_type & a);

      Effects: Constructs an empty flat_multimap using the specified comparison object and allocator, and inserts elements from the range [first ,last ).

      Complexity: Linear in N if the range [first ,last ) is already sorted using the predicate and otherwise N logN, where N is last - first. 

    9. template<typename InputIterator> 
-  flat_multimap(ordered_range_t, InputIterator first, InputIterator last);
      + flat_multimap(ordered_range_t, InputIterator first, InputIterator last);

      Effects: Constructs an empty flat_multimap and inserts elements from the ordered range [first ,last). This function is more efficient than the normal range creation for ordered ranges.

      Requires: [first ,last) must be ordered according to the predicate.

      Complexity: Linear in N.

      @@ -271,7 +271,7 @@ 
    10. template<typename InputIterator> 
-  flat_multimap(ordered_range_t, InputIterator first, InputIterator last, 
+  flat_multimap(ordered_range_t, InputIterator first, InputIterator last, 
                 const Compare & comp);

      Effects: Constructs an empty flat_multimap using the specified comparison object and inserts elements from the ordered range [first ,last). This function is more efficient than the normal range creation for ordered ranges.

      Requires: [first ,last) must be ordered according to the predicate.

      @@ -280,7 +280,7 @@ 
    11. template<typename InputIterator> 
-  flat_multimap(ordered_range_t, InputIterator first, InputIterator last, 
+  flat_multimap(ordered_range_t, InputIterator first, InputIterator last, 
                 const Compare & comp, const allocator_type & a);

      Effects: Constructs an empty flat_multimap using the specified comparison object and allocator, and inserts elements from the ordered range [first ,last). This function is more efficient than the normal range creation for ordered ranges.

      Requires: [first ,last) must be ordered according to the predicate.

      @@ -288,36 +288,36 @@

      Note: Non-standard extension.

    12. -
      flat_multimap(std::initializer_list< value_type > il);
      +
      flat_multimap(std::initializer_list< value_type > il);

      Effects: Constructs an empty flat_map and inserts elements from the range [il.begin(), il.end()).

      Complexity: Linear in N if the range [il.begin(), il.end()) is already sorted using the predicate and otherwise N logN, where N is last - first.

    13. -
      flat_multimap(std::initializer_list< value_type > il, 
+
      flat_multimap(std::initializer_list< value_type > il, 
               const allocator_type & a);
      
 
      Effects: Constructs an empty flat_map using the specified allocator, and inserts elements from the range [il.begin(), il.end()).
      
 
      Complexity: Linear in N if the range [il.begin(), il.end()) is already sorted using the predicate and otherwise N logN, where N is last - first.
    14. -
      flat_multimap(std::initializer_list< value_type > il, const Compare & comp);
      +
      flat_multimap(std::initializer_list< value_type > il, const Compare & comp);

      Effects: Constructs an empty flat_map using the specified comparison object and inserts elements from the range [il.begin(), il.end()).

      Complexity: Linear in N if the range [il.begin(), il.end()) is already sorted using the predicate and otherwise N logN, where N is last - first.

    15. -
      flat_multimap(std::initializer_list< value_type > il, const Compare & comp, 
+
      flat_multimap(std::initializer_list< value_type > il, const Compare & comp, 
               const allocator_type & a);
      
 
      Effects: Constructs an empty flat_map using the specified comparison object and allocator, and inserts elements from the range [il.begin(), il.end()).
      
 
      Complexity: Linear in N if the range [il.begin(), il.end()) is already sorted using the predicate and otherwise N logN, where N is last - first.
    16. -
      flat_multimap(ordered_range_t, std::initializer_list< value_type > il);
      +
      flat_multimap(ordered_range_t, std::initializer_list< value_type > il);

      Effects: Constructs an empty flat_multimap and inserts elements from the ordered range [il.begin(), il.end()). This function is more efficient than the normal range creation for ordered ranges.

      Requires: [il.begin(), il.end()) must be ordered according to the predicate.

      Complexity: Linear in N.

      Note: Non-standard extension.

    17. -
      flat_multimap(ordered_range_t, std::initializer_list< value_type > il, 
+
      flat_multimap(ordered_range_t, std::initializer_list< value_type > il, 
               const Compare & comp);
      
 
      Effects: Constructs an empty flat_multimap using the specified comparison object and inserts elements from the ordered range [il.begin(), il.end()). This function is more efficient than the normal range creation for ordered ranges.
      
 
      Requires: [il.begin(), il.end()) must be ordered according to the predicate.
      
@@ -325,7 +325,7 @@
 
      Note: Non-standard extension.
    18. -
      flat_multimap(ordered_range_t, std::initializer_list< value_type > il, 
+
      flat_multimap(ordered_range_t, std::initializer_list< value_type > il, 
               const Compare & comp, const allocator_type & a);
      
 
      Effects: Constructs an empty flat_multimap using the specified comparison object and allocator, and inserts elements from the ordered range [il.begin(), il.end()). This function is more efficient than the normal range creation for ordered ranges.
      
 
      Requires: [il.begin(), il.end()) must be ordered according to the predicate.
      
@@ -333,177 +333,177 @@
 
      Note: Non-standard extension.
    19. -
      flat_multimap(const flat_multimap & x);
      +
      flat_multimap(const flat_multimap & x);

      Effects: Copy constructs a flat_multimap.

      Complexity: Linear in x.size().

    20. -
      flat_multimap(flat_multimap && x) noexcept(boost::container::container_detail::is_nothrow_move_constructible< Compare >::value));
      +
      flat_multimap(flat_multimap && x) noexcept(boost::container::dtl::is_nothrow_move_constructible< Compare >::value));

      Effects: Move constructs a flat_multimap. Constructs *this using x's resources.

      Complexity: Constant.

      Postcondition: x is emptied.

    21. -
      flat_multimap(const flat_multimap & x, const allocator_type & a);
      +
      flat_multimap(const flat_multimap & x, const allocator_type & a);

      Effects: Copy constructs a flat_multimap using the specified allocator.

      Complexity: Linear in x.size().

    22. -
      flat_multimap(flat_multimap && x, const allocator_type & a);
      +
      flat_multimap(flat_multimap && x, const allocator_type & a);

      Effects: Move constructs a flat_multimap using the specified allocator. Constructs *this using x's resources.

      Complexity: Constant if a == x.get_allocator(), linear otherwise.

    23. -
      flat_multimap & operator=(const flat_multimap & x);
      +
      flat_multimap & operator=(const flat_multimap & x);

      Effects: Makes *this a copy of x.

      Complexity: Linear in x.size(). 

    24. flat_multimap & 
-operator=(flat_multimap && x) noexcept((allocator_traits_type::propagate_on_container_move_assignment::value||allocator_traits_type::is_always_equal::value)&&boost::container::container_detail::is_nothrow_move_assignable< Compare >::value));
      +operator=(flat_multimap && x) noexcept((allocator_traits_type::propagate_on_container_move_assignment::value||allocator_traits_type::is_always_equal::value)&&boost::container::dtl::is_nothrow_move_assignable< Compare >::value));

      Effects: this->swap(x.get()).

      Complexity: Constant.

    25. -
      flat_multimap & operator=(std::initializer_list< value_type > il);
      +
      flat_multimap & operator=(std::initializer_list< value_type > il);

      Effects: Assign content of il to *this

      Complexity: Linear in il.size().

    -

    -flat_multimap public member functions

    +

    +flat_multimap public member functions

      -
    1.  BOOST_STATIC_ASSERT(unspecified);
      2. +
    2.  BOOST_STATIC_ASSERT((dtl::is_same< std::pair< Key, T >, typename AllocatorOrContainer::value_type >::value));
    3. -
      allocator_type get_allocator() const noexcept;
      +
      allocator_type get_allocator() const noexcept;

      Effects: Returns a copy of the allocator that was passed to the object's constructor.

      Complexity: Constant.

    4. -
      stored_allocator_type & get_stored_allocator() noexcept;
      +
      stored_allocator_type & get_stored_allocator() noexcept;

      Effects: Returns a reference to the internal allocator.

      Throws: Nothing

      Complexity: Constant.

      Note: Non-standard extension.

    5. -
      const stored_allocator_type & get_stored_allocator() const noexcept;
      +
      const stored_allocator_type & get_stored_allocator() const noexcept;

      Effects: Returns a reference to the internal allocator.

      Throws: Nothing

      Complexity: Constant.

      Note: Non-standard extension.

    6. -
      iterator begin() noexcept;
      +
      iterator begin() noexcept;

      Effects: Returns an iterator to the first element contained in the container.

      Throws: Nothing.

      Complexity: Constant.

    7. -
      const_iterator begin() const noexcept;
      +
      const_iterator begin() const noexcept;

      Effects: Returns a const_iterator to the first element contained in the container.

      Throws: Nothing.

      Complexity: Constant.

    8. -
      iterator end() noexcept;
      +
      iterator end() noexcept;

      Effects: Returns an iterator to the end of the container.

      Throws: Nothing.

      Complexity: Constant.

    9. -
      const_iterator end() const noexcept;
      +
      const_iterator end() const noexcept;

      Effects: Returns a const_iterator to the end of the container.

      Throws: Nothing.

      Complexity: Constant.

    10. -
      reverse_iterator rbegin() noexcept;
      +
      reverse_iterator rbegin() noexcept;

      Effects: Returns a reverse_iterator pointing to the beginning of the reversed container.

      Throws: Nothing.

      Complexity: Constant.

    11. -
      const_reverse_iterator rbegin() const noexcept;
      +
      const_reverse_iterator rbegin() const noexcept;

      Effects: Returns a const_reverse_iterator pointing to the beginning of the reversed container.

      Throws: Nothing.

      Complexity: Constant.

    12. -
      reverse_iterator rend() noexcept;
      +
      reverse_iterator rend() noexcept;

      Effects: Returns a reverse_iterator pointing to the end of the reversed container.

      Throws: Nothing.

      Complexity: Constant.

    13. -
      const_reverse_iterator rend() const noexcept;
      +
      const_reverse_iterator rend() const noexcept;

      Effects: Returns a const_reverse_iterator pointing to the end of the reversed container.

      Throws: Nothing.

      Complexity: Constant.

    14. -
      const_iterator cbegin() const noexcept;
      +
      const_iterator cbegin() const noexcept;

      Effects: Returns a const_iterator to the first element contained in the container.

      Throws: Nothing.

      Complexity: Constant.

    15. -
      const_iterator cend() const noexcept;
      +
      const_iterator cend() const noexcept;

      Effects: Returns a const_iterator to the end of the container.

      Throws: Nothing.

      Complexity: Constant.

    16. -
      const_reverse_iterator crbegin() const noexcept;
      +
      const_reverse_iterator crbegin() const noexcept;

      Effects: Returns a const_reverse_iterator pointing to the beginning of the reversed container.

      Throws: Nothing.

      Complexity: Constant.

    17. -
      const_reverse_iterator crend() const noexcept;
      +
      const_reverse_iterator crend() const noexcept;

      Effects: Returns a const_reverse_iterator pointing to the end of the reversed container.

      Throws: Nothing.

      Complexity: Constant.

    18. -
      bool empty() const noexcept;
      +
      bool empty() const noexcept;

      Effects: Returns true if the container contains no elements.

      Throws: Nothing.

      Complexity: Constant.

    19. -
      size_type size() const noexcept;
      +
      size_type size() const noexcept;

      Effects: Returns the number of the elements contained in the container.

      Throws: Nothing.

      Complexity: Constant.

    20. -
      size_type max_size() const noexcept;
      +
      size_type max_size() const noexcept;

      Effects: Returns the largest possible size of the container.

      Throws: Nothing.

      Complexity: Constant.

    21. -
      size_type capacity() const noexcept;
      +
      size_type capacity() const noexcept;

      Effects: Number of elements for which memory has been allocated. capacity() is always greater than or equal to size().

      Throws: Nothing.

      Complexity: Constant.

    22. -
      void reserve(size_type cnt);
      +
      void reserve(size_type cnt);

      Effects: If n is less than or equal to capacity(), or the underlying container has no reserve member, this call has no effect. Otherwise, it is a request for allocation of additional memory. If the request is successful, then capacity() is greater than or equal to n; otherwise, capacity() is unchanged. In either case, size() is unchanged.

      Throws: If memory allocation allocation throws or T's copy constructor throws.

      Note: If capacity() is less than "cnt", iterators and references to to values might be invalidated.

    23. -
      void shrink_to_fit();
      +
      void shrink_to_fit();
      Effects: Tries to deallocate the excess of memory created

      Throws: If memory allocation throws, or T's copy constructor throws.

      Complexity: Linear to size().

    24. -
      iterator nth(size_type n) noexcept;
      +
      iterator nth(size_type n) noexcept;

      Requires: size() >= n.

      Effects: Returns an iterator to the nth element from the beginning of the container. Returns end() if n == size().

      Throws: Nothing.

      @@ -511,7 +511,7 @@

      Note: Non-standard extension

    25. -
      const_iterator nth(size_type n) const noexcept;
      +
      const_iterator nth(size_type n) const noexcept;

      Requires: size() >= n.

      Effects: Returns a const_iterator to the nth element from the beginning of the container. Returns end() if n == size().

      Throws: Nothing.

      @@ -519,7 +519,7 @@

      Note: Non-standard extension

    26. -
      size_type index_of(iterator p) noexcept;
      +
      size_type index_of(iterator p) noexcept;

      Requires: begin() <= p <= end().

      Effects: Returns the index of the element pointed by p and size() if p == end().

      Throws: Nothing.

      @@ -527,7 +527,7 @@

      Note: Non-standard extension

    27. -
      size_type index_of(const_iterator p) const noexcept;
      +
      size_type index_of(const_iterator p) const noexcept;

      Requires: begin() <= p <= end().

      Effects: Returns the index of the element pointed by p and size() if p == end().

      Throws: Nothing.

      @@ -535,53 +535,53 @@

      Note: Non-standard extension

    28. -
      template<class... Args> iterator emplace(Args &&... args);
      +
      template<class... Args> iterator emplace(Args &&... args);

      Effects: Inserts an object of type T constructed with std::forward<Args>(args)... and returns the iterator pointing to the newly inserted element.

      Complexity: Logarithmic search time plus linear insertion to the elements with bigger keys than x.

      Note: If an element is inserted it might invalidate elements. 

    29. template<class... Args> 
-  iterator emplace_hint(const_iterator hint, Args &&... args);
      + iterator emplace_hint(const_iterator hint, Args &&... args);

      Effects: Inserts an object of type T constructed with std::forward<Args>(args)... in the container. p is a hint pointing to where the insert should start to search.

      Returns: An iterator pointing to the element with key equivalent to the key of x.

      Complexity: Logarithmic search time (constant time if the value is to be inserted before p) plus linear insertion to the elements with bigger keys than x.

      Note: If an element is inserted it might invalidate elements.

    30. -
      iterator insert(const value_type & x);
      +
      iterator insert(const value_type & x);

      Effects: Inserts x and returns the iterator pointing to the newly inserted element.

      Complexity: Logarithmic search time plus linear insertion to the elements with bigger keys than x.

      Note: If an element is inserted it might invalidate elements.

    31. -
      iterator insert(value_type && x);
      +
      iterator insert(value_type && x);

      Effects: Inserts a new value move-constructed from x and returns the iterator pointing to the newly inserted element.

      Complexity: Logarithmic search time plus linear insertion to the elements with bigger keys than x.

      Note: If an element is inserted it might invalidate elements.

    32. -
      iterator insert(impl_value_type && x);
      +
      iterator insert(impl_value_type && x);

      Effects: Inserts a new value move-constructed from x and returns the iterator pointing to the newly inserted element.

      Complexity: Logarithmic search time plus linear insertion to the elements with bigger keys than x.

      Note: If an element is inserted it might invalidate elements.

    33. -
      iterator insert(const_iterator p, const value_type & x);
      +
      iterator insert(const_iterator p, const value_type & x);

      Effects: Inserts a copy of x in the container. p is a hint pointing to where the insert should start to search.

      Returns: An iterator pointing to the element with key equivalent to the key of x.

      Complexity: Logarithmic search time (constant time if the value is to be inserted before p) plus linear insertion to the elements with bigger keys than x.

      Note: If an element is inserted it might invalidate elements.

    34. -
      iterator insert(const_iterator p, value_type && x);
      +
      iterator insert(const_iterator p, value_type && x);

      Effects: Inserts a value move constructed from x in the container. p is a hint pointing to where the insert should start to search.

      Returns: An iterator pointing to the element with key equivalent to the key of x.

      Complexity: Logarithmic search time (constant time if the value is to be inserted before p) plus linear insertion to the elements with bigger keys than x.

      Note: If an element is inserted it might invalidate elements.

    35. -
      iterator insert(const_iterator p, impl_value_type && x);
      +
      iterator insert(const_iterator p, impl_value_type && x);

      Effects: Inserts a value move constructed from x in the container. p is a hint pointing to where the insert should start to search.

      Returns: An iterator pointing to the element with key equivalent to the key of x.

      Complexity: Logarithmic search time (constant time if the value is to be inserted before p) plus linear insertion to the elements with bigger keys than x.

      @@ -589,39 +589,39 @@ 
    36. template<typename InputIterator> 
-  void insert(InputIterator first, InputIterator last);
      + void insert(InputIterator first, InputIterator last);

      Requires: first, last are not iterators into *this.

      Effects: inserts each element from the range [first,last) .

      -

      Complexity: At most N log(size()+N) (N is the distance from first to last) search time plus N*size() insertion time.

      +

      Complexity: N log(N).

      Note: If an element is inserted it might invalidate elements. 

    37. template<typename InputIterator> 
-  void insert(ordered_range_t, InputIterator first, InputIterator last);
      + void insert(ordered_range_t, InputIterator first, InputIterator last);

      Requires: first, last are not iterators into *this.

      Requires: [first ,last) must be ordered according to the predicate.

      Effects: inserts each element from the range [first,last) if and only if there is no element with key equivalent to the key of that element. This function is more efficient than the normal range creation for ordered ranges.

      -

      Complexity: At most N log(size()+N) (N is the distance from first to last) search time plus N*size() insertion time.

      +

      Complexity: Linear.

      Note: If an element is inserted it might invalidate elements.

      Note: Non-standard extension.

    38. -
      void insert(std::initializer_list< value_type > il);
      +
      void insert(std::initializer_list< value_type > il);

      Effects: inserts each element from the range [il.begin(), il.end()) .

      -

      Complexity: At most N log(size()+N) (N is the distance from first to last) search time plus N*size() insertion time.

      +

      Complexity: N log(N).

      Note: If an element is inserted it might invalidate elements.

    39. -
      void insert(ordered_range_t, std::initializer_list< value_type > il);
      +
      void insert(ordered_range_t, std::initializer_list< value_type > il);

      Requires: [il.begin(), il.end()) must be ordered according to the predicate.

      Effects: inserts each element from the range [il.begin(), il.end()) if and only if there is no element with key equivalent to the key of that element. This function is more efficient than the normal range creation for ordered ranges.

      -

      Complexity: At most N log(size()+N) (N is the distance from first to last) search time plus N*size() insertion time.

      +

      Complexity: Linear.

      Note: If an element is inserted it might invalidate elements.

      Note: Non-standard extension. 

    40. template<typename C2> 
-  void merge(flat_multimap< Key, T, C2, AllocatorOrContainer > & source);
      + void merge(flat_multimap< Key, T, C2, AllocatorOrContainer > & source);

      Requires: this->get_allocator() == source.get_allocator().

      Effects: Extracts each element in source and insert it into a using the comparison object of *this.

      Postcondition: Pointers and references to the transferred elements of source refer to those same elements but as members of *this. Iterators referring to the transferred elements will continue to refer to their elements, but they now behave as iterators into *this, not into source.

      @@ -630,7 +630,7 @@ 
    41. template<typename C2> 
-  void merge(flat_multimap< Key, T, C2, AllocatorOrContainer > && source);
      + void merge(flat_multimap< Key, T, C2, AllocatorOrContainer > && source);

      Requires: this->get_allocator() == source.get_allocator().

      Effects: Extracts each element in source and insert it into a using the comparison object of *this.

      Postcondition: Pointers and references to the transferred elements of source refer to those same elements but as members of *this. Iterators referring to the transferred elements will continue to refer to their elements, but they now behave as iterators into *this, not into source.

      @@ -639,7 +639,7 @@ 
    42. template<typename C2> 
-  void merge(flat_map< Key, T, C2, AllocatorOrContainer > & source);
      + void merge(flat_map< Key, T, C2, AllocatorOrContainer > & source);

      Requires: this->get_allocator() == source.get_allocator().

      Effects: Extracts each element in source and insert it into a using the comparison object of *this.

      Postcondition: Pointers and references to the transferred elements of source refer to those same elements but as members of *this. Iterators referring to the transferred elements will continue to refer to their elements, but they now behave as iterators into *this, not into source.

      @@ -648,7 +648,7 @@ 
    43. template<typename C2> 
-  void merge(flat_map< Key, T, C2, AllocatorOrContainer > && source);
      + void merge(flat_map< Key, T, C2, AllocatorOrContainer > && source);

      Requires: this->get_allocator() == source.get_allocator().

      Effects: Extracts each element in source and insert it into a using the comparison object of *this.

      Postcondition: Pointers and references to the transferred elements of source refer to those same elements but as members of *this. Iterators referring to the transferred elements will continue to refer to their elements, but they now behave as iterators into *this, not into source.

      @@ -656,108 +656,108 @@

      Complexity: N log(a.size() + N) (N has the value source.size())

    44. -
      iterator erase(const_iterator p);
      +
      iterator erase(const_iterator p);

      Effects: Erases the element pointed to by p.

      Returns: Returns an iterator pointing to the element immediately following q prior to the element being erased. If no such element exists, returns end().

      Complexity: Linear to the elements with keys bigger than p

      Note: Invalidates elements with keys not less than the erased element.

    45. -
      size_type erase(const key_type & x);
      +
      size_type erase(const key_type & x);

      Effects: Erases all elements in the container with key equivalent to x.

      Returns: Returns the number of erased elements.

      Complexity: Logarithmic search time plus erasure time linear to the elements with bigger keys.

    46. -
      iterator erase(const_iterator first, const_iterator last);
      +
      iterator erase(const_iterator first, const_iterator last);

      Effects: Erases all the elements in the range [first, last).

      Returns: Returns last.

      Complexity: size()*N where N is the distance from first to last.

      Complexity: Logarithmic search time plus erasure time linear to the elements with bigger keys.

    47. -
      void swap(flat_multimap & x) noexcept(allocator_traits_type::is_always_equal::value &&boost::container::container_detail::is_nothrow_swappable< Compare >::value));
      +
      void swap(flat_multimap & x) noexcept(allocator_traits_type::is_always_equal::value &&boost::container::dtl::is_nothrow_swappable< Compare >::value));

      Effects: Swaps the contents of *this and x.

      Throws: Nothing.

      Complexity: Constant.

    48. -
      void clear() noexcept;
      +
      void clear() noexcept;

      Effects: erase(a.begin(),a.end()).

      Postcondition: size() == 0.

      Complexity: linear in size().

    49. -
      key_compare key_comp() const;
      +
      key_compare key_comp() const;

      Effects: Returns the comparison object out of which a was constructed.

      Complexity: Constant.

    50. -
      value_compare value_comp() const;
      +
      value_compare value_comp() const;

      Effects: Returns an object of value_compare constructed out of the comparison object.

      Complexity: Constant.

    51. -
      iterator find(const key_type & x);
      +
      iterator find(const key_type & x);

      Returns: An iterator pointing to an element with the key equivalent to x, or end() if such an element is not found.

      Complexity: Logarithmic.

    52. -
      const_iterator find(const key_type & x) const;
      +
      const_iterator find(const key_type & x) const;

      Returns: An const_iterator pointing to an element with the key equivalent to x, or end() if such an element is not found.

      Complexity: Logarithmic.

    53. -
      size_type count(const key_type & x) const;
      +
      size_type count(const key_type & x) const;

      Returns: The number of elements with key equivalent to x.

      Complexity: log(size())+count(k)

    54. -
      iterator lower_bound(const key_type & x);
      +
      iterator lower_bound(const key_type & x);

      Returns: An iterator pointing to the first element with key not less than k, or a.end() if such an element is not found.

      Complexity: Logarithmic

    55. -
      const_iterator lower_bound(const key_type & x) const;
      +
      const_iterator lower_bound(const key_type & x) const;

      Returns: A const iterator pointing to the first element with key not less than k, or a.end() if such an element is not found.

      Complexity: Logarithmic

    56. -
      iterator upper_bound(const key_type & x);
      +
      iterator upper_bound(const key_type & x);

      Returns: An iterator pointing to the first element with key not less than x, or end() if such an element is not found.

      Complexity: Logarithmic

    57. -
      const_iterator upper_bound(const key_type & x) const;
      +
      const_iterator upper_bound(const key_type & x) const;

      Returns: A const iterator pointing to the first element with key not less than x, or end() if such an element is not found.

      Complexity: Logarithmic

    58. -
      std::pair< iterator, iterator > equal_range(const key_type & x);
      +
      std::pair< iterator, iterator > equal_range(const key_type & x);

      Effects: Equivalent to std::make_pair(this->lower_bound(k), this->upper_bound(k)).

      Complexity: Logarithmic 

    59. std::pair< const_iterator, const_iterator > 
-equal_range(const key_type & x) const;
      +equal_range(const key_type & x) const;

      Effects: Equivalent to std::make_pair(this->lower_bound(k), this->upper_bound(k)).

      Complexity: Logarithmic

    60. -
      sequence_type extract_sequence();
      +
      sequence_type extract_sequence();

      Effects: Extracts the internal sequence container.

      Complexity: Same as the move constructor of sequence_type, usually constant.

      Postcondition: this->empty()

      Throws: If secuence_type's move constructor throws

    61. -
      void adopt_sequence(sequence_type && seq);
      +
      void adopt_sequence(sequence_type && seq);

      Effects: Discards the internally hold sequence container and adopts the one passed externally using the move assignment.

      Complexity: Assuming O(1) move assignment, O(NlogN) with N = seq.size()

      Throws: If the comparison or the move constructor throws

    62. -
      void adopt_sequence(ordered_range_t, sequence_type && seq);
      +
      void adopt_sequence(ordered_range_t, sequence_type && seq);

      Requires: seq shall be ordered according to this->compare().

      Effects: Discards the internally hold sequence container and adopts the one passed externally using the move assignment.

      Complexity: Assuming O(1) move assignment, O(1)

      @@ -766,41 +766,41 @@
    -

    -flat_multimap friend functions

    +

    +flat_multimap friend functions

    1. -
      friend bool operator==(const flat_multimap & x, const flat_multimap & y);
      +
      friend bool operator==(const flat_multimap & x, const flat_multimap & y);

      Effects: Returns true if x and y are equal

      Complexity: Linear to the number of elements in the container.

    2. -
      friend bool operator!=(const flat_multimap & x, const flat_multimap & y);
      +
      friend bool operator!=(const flat_multimap & x, const flat_multimap & y);

      Effects: Returns true if x and y are unequal

      Complexity: Linear to the number of elements in the container.

    3. -
      friend bool operator<(const flat_multimap & x, const flat_multimap & y);
      +
      friend bool operator<(const flat_multimap & x, const flat_multimap & y);

      Effects: Returns true if x is less than y

      Complexity: Linear to the number of elements in the container.

    4. -
      friend bool operator>(const flat_multimap & x, const flat_multimap & y);
      +
      friend bool operator>(const flat_multimap & x, const flat_multimap & y);

      Effects: Returns true if x is greater than y

      Complexity: Linear to the number of elements in the container.

    5. -
      friend bool operator<=(const flat_multimap & x, const flat_multimap & y);
      +
      friend bool operator<=(const flat_multimap & x, const flat_multimap & y);

      Effects: Returns true if x is equal or less than y

      Complexity: Linear to the number of elements in the container.

    6. -
      friend bool operator>=(const flat_multimap & x, const flat_multimap & y);
      +
      friend bool operator>=(const flat_multimap & x, const flat_multimap & y);

      Effects: Returns true if x is equal or greater than y

      Complexity: Linear to the number of elements in the container.

    7. -
      friend void swap(flat_multimap & x, flat_multimap & y);
      +
      friend void swap(flat_multimap & x, flat_multimap & y);

      Effects: x.swap(y)

      Complexity: Constant.

      8. @@ -810,7 +810,8 @@
    -
    Copyright © 2009-2015 Ion Gaztanaga

    +

    Copyright © 2009-2017 Ion + Gaztanaga

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost/container/flat_multiset.html b/doc/html/boost/container/flat_multiset.html index 267741fa95..1c0fe9fadc 100644 --- a/doc/html/boost/container/flat_multiset.html +++ b/doc/html/boost/container/flat_multiset.html @@ -57,122 +57,122 @@ typedef sequence_type::const_reverse_iterator const_reverse_iterator; // construct/copy/destruct - flat_multiset() noexcept(container_detail::is_nothrow_default_constructible< AllocatorOrContainer >::value &&container_detail::is_nothrow_default_constructible< Compare >::value)); - explicit flat_multiset(const Compare &); - explicit flat_multiset(const allocator_type &); - flat_multiset(const Compare &, const allocator_type &); - template<typename InputIterator> flat_multiset(InputIterator, InputIterator); + flat_multiset() noexcept(dtl::is_nothrow_default_constructible< AllocatorOrContainer >::value &&dtl::is_nothrow_default_constructible< Compare >::value)); + explicit flat_multiset(const Compare &); + explicit flat_multiset(const allocator_type &); + flat_multiset(const Compare &, const allocator_type &); + template<typename InputIterator> flat_multiset(InputIterator, InputIterator); template<typename InputIterator> - flat_multiset(InputIterator, InputIterator, const allocator_type &); + flat_multiset(InputIterator, InputIterator, const allocator_type &); template<typename InputIterator> - flat_multiset(InputIterator, InputIterator, const Compare &); + flat_multiset(InputIterator, InputIterator, const Compare &); template<typename InputIterator> - flat_multiset(InputIterator, InputIterator, const Compare &, + flat_multiset(InputIterator, InputIterator, const Compare &, const allocator_type &); template<typename InputIterator> - flat_multiset(ordered_range_t, InputIterator, InputIterator); + flat_multiset(ordered_range_t, InputIterator, InputIterator); template<typename InputIterator> - flat_multiset(ordered_range_t, InputIterator, InputIterator, + flat_multiset(ordered_range_t, InputIterator, InputIterator, const Compare &); template<typename InputIterator> - flat_multiset(ordered_range_t, InputIterator, InputIterator, + flat_multiset(ordered_range_t, InputIterator, InputIterator, const Compare &, const allocator_type &); - flat_multiset(std::initializer_list< value_type >); - flat_multiset(std::initializer_list< value_type >, const allocator_type &); - flat_multiset(std::initializer_list< value_type >, const Compare &); - flat_multiset(std::initializer_list< value_type >, const Compare &, + flat_multiset(std::initializer_list< value_type >); + flat_multiset(std::initializer_list< value_type >, const allocator_type &); + flat_multiset(std::initializer_list< value_type >, const Compare &); + flat_multiset(std::initializer_list< value_type >, const Compare &, const allocator_type &); - flat_multiset(ordered_range_t, std::initializer_list< value_type >); - flat_multiset(ordered_range_t, std::initializer_list< value_type >, + flat_multiset(ordered_range_t, std::initializer_list< value_type >); + flat_multiset(ordered_range_t, std::initializer_list< value_type >, const Compare &); - flat_multiset(ordered_range_t, std::initializer_list< value_type >, + flat_multiset(ordered_range_t, std::initializer_list< value_type >, const Compare &, const allocator_type &); - flat_multiset(const flat_multiset &); - flat_multiset(flat_multiset &&) noexcept(boost::container::container_detail::is_nothrow_move_constructible< Compare >::value)); - flat_multiset(const flat_multiset &, const allocator_type &); - flat_multiset(flat_multiset &&, const allocator_type &); - flat_multiset & operator=(const flat_multiset &); + flat_multiset(const flat_multiset &); + flat_multiset(flat_multiset &&) noexcept(boost::container::dtl::is_nothrow_move_constructible< Compare >::value)); + flat_multiset(const flat_multiset &, const allocator_type &); + flat_multiset(flat_multiset &&, const allocator_type &); + flat_multiset & operator=(const flat_multiset &); flat_multiset & - operator=(flat_multiset &&) noexcept((allocator_traits_type::propagate_on_container_move_assignment::value||allocator_traits_type::is_always_equal::value)&&boost::container::container_detail::is_nothrow_move_assignable< Compare >::value)); - flat_multiset & operator=(std::initializer_list< value_type >); + operator=(flat_multiset &&) noexcept((allocator_traits_type::propagate_on_container_move_assignment::value||allocator_traits_type::is_always_equal::value)&&boost::container::dtl::is_nothrow_move_assignable< Compare >::value)); + flat_multiset & operator=(std::initializer_list< value_type >); - // public member functions - allocator_type get_allocator() const noexcept; - stored_allocator_type & get_stored_allocator() noexcept; - const stored_allocator_type & get_stored_allocator() const noexcept; - iterator begin() noexcept; - const_iterator begin() const; - const_iterator cbegin() const noexcept; - iterator end() noexcept; - const_iterator end() const noexcept; - const_iterator cend() const noexcept; - reverse_iterator rbegin() noexcept; - const_reverse_iterator rbegin() const noexcept; - const_reverse_iterator crbegin() const noexcept; - reverse_iterator rend() noexcept; - const_reverse_iterator rend() const noexcept; - const_reverse_iterator crend() const noexcept; - bool empty() const noexcept; - size_type size() const noexcept; - size_type max_size() const noexcept; - size_type capacity() const noexcept; - void reserve(size_type); - void shrink_to_fit(); - template<class... Args> iterator emplace(Args &&...); - template<class... Args> iterator emplace_hint(const_iterator, Args &&...); - iterator insert(const value_type &); - iterator insert(value_type &&); - iterator insert(const_iterator, const value_type &); - iterator insert(const_iterator, value_type &&); - template<typename InputIterator> void insert(InputIterator, InputIterator); + // public member functions + allocator_type get_allocator() const noexcept; + stored_allocator_type & get_stored_allocator() noexcept; + const stored_allocator_type & get_stored_allocator() const noexcept; + iterator begin() noexcept; + const_iterator begin() const; + const_iterator cbegin() const noexcept; + iterator end() noexcept; + const_iterator end() const noexcept; + const_iterator cend() const noexcept; + reverse_iterator rbegin() noexcept; + const_reverse_iterator rbegin() const noexcept; + const_reverse_iterator crbegin() const noexcept; + reverse_iterator rend() noexcept; + const_reverse_iterator rend() const noexcept; + const_reverse_iterator crend() const noexcept; + bool empty() const noexcept; + size_type size() const noexcept; + size_type max_size() const noexcept; + size_type capacity() const noexcept; + void reserve(size_type); + void shrink_to_fit(); + template<class... Args> iterator emplace(Args &&...); + template<class... Args> iterator emplace_hint(const_iterator, Args &&...); + iterator insert(const value_type &); + iterator insert(value_type &&); + iterator insert(const_iterator, const value_type &); + iterator insert(const_iterator, value_type &&); + template<typename InputIterator> void insert(InputIterator, InputIterator); template<typename InputIterator> - void insert(ordered_range_t, InputIterator, InputIterator); - void insert(std::initializer_list< value_type >); - void insert(ordered_range_t, std::initializer_list< value_type >); + void insert(ordered_range_t, InputIterator, InputIterator); + void insert(std::initializer_list< value_type >); + void insert(ordered_range_t, std::initializer_list< value_type >); template<typename C2> - void merge(flat_multiset< Key, C2, AllocatorOrContainer > &); + void merge(flat_multiset< Key, C2, AllocatorOrContainer > &); template<typename C2> - void merge(flat_multiset< Key, C2, AllocatorOrContainer > &&); + void merge(flat_multiset< Key, C2, AllocatorOrContainer > &&); template<typename C2> - void merge(flat_set< Key, C2, AllocatorOrContainer > &); + void merge(flat_set< Key, C2, AllocatorOrContainer > &); template<typename C2> - void merge(flat_set< Key, C2, AllocatorOrContainer > &&); - iterator erase(const_iterator); - size_type erase(const key_type &); - iterator erase(const_iterator, const_iterator); - void swap(flat_multiset &) noexcept(allocator_traits_type::is_always_equal::value &&boost::container::container_detail::is_nothrow_swappable< Compare >::value)); - void clear() noexcept; - key_compare key_comp() const; - value_compare value_comp() const; - iterator find(const key_type &); - const_iterator find(const key_type &) const; - iterator nth(size_type) noexcept; - const_iterator nth(size_type) const noexcept; - size_type index_of(iterator) noexcept; - size_type index_of(const_iterator) const noexcept; - size_type count(const key_type &) const; - iterator lower_bound(const key_type &); - const_iterator lower_bound(const key_type &) const; - iterator upper_bound(const key_type &); - const_iterator upper_bound(const key_type &) const; + void merge(flat_set< Key, C2, AllocatorOrContainer > &&); + iterator erase(const_iterator); + size_type erase(const key_type &); + iterator erase(const_iterator, const_iterator); + void swap(flat_multiset &) noexcept(allocator_traits_type::is_always_equal::value &&boost::container::dtl::is_nothrow_swappable< Compare >::value)); + void clear() noexcept; + key_compare key_comp() const; + value_compare value_comp() const; + iterator find(const key_type &); + const_iterator find(const key_type &) const; + iterator nth(size_type) noexcept; + const_iterator nth(size_type) const noexcept; + size_type index_of(iterator) noexcept; + size_type index_of(const_iterator) const noexcept; + size_type count(const key_type &) const; + iterator lower_bound(const key_type &); + const_iterator lower_bound(const key_type &) const; + iterator upper_bound(const key_type &); + const_iterator upper_bound(const key_type &) const; std::pair< const_iterator, const_iterator > - equal_range(const key_type &) const; - std::pair< iterator, iterator > equal_range(const key_type &); - sequence_type extract_sequence(); - void adopt_sequence(sequence_type &&); - void adopt_sequence(ordered_range_t, sequence_type &&); + equal_range(const key_type &) const; + std::pair< iterator, iterator > equal_range(const key_type &); + sequence_type extract_sequence(); + void adopt_sequence(sequence_type &&); + void adopt_sequence(ordered_range_t, sequence_type &&); - // friend functions - friend bool operator==(const flat_multiset &, const flat_multiset &); - friend bool operator!=(const flat_multiset &, const flat_multiset &); - friend bool operator<(const flat_multiset &, const flat_multiset &); - friend bool operator>(const flat_multiset &, const flat_multiset &); - friend bool operator<=(const flat_multiset &, const flat_multiset &); - friend bool operator>=(const flat_multiset &, const flat_multiset &); - friend void swap(flat_multiset &, flat_multiset &); + // friend functions + friend bool operator==(const flat_multiset &, const flat_multiset &); + friend bool operator!=(const flat_multiset &, const flat_multiset &); + friend bool operator<(const flat_multiset &, const flat_multiset &); + friend bool operator>(const flat_multiset &, const flat_multiset &); + friend bool operator<=(const flat_multiset &, const flat_multiset &); + friend bool operator>=(const flat_multiset &, const flat_multiset &); + friend void swap(flat_multiset &, flat_multiset &); };
    -

    Description

    +

    Description

    flat_multiset is a Sorted Associative Container that stores objects of type Key and can store multiple copies of the same key value.

    flat_multiset is similar to std::multiset but it's implemented by as an ordered sequence container. The underlying sequence container is by default vector but it can also work user-provided vector-like SequenceContainers (like static_vector or small_vector).

    Using vector-like sequence containers means that inserting a new element into a flat_multiset might invalidate previous iterators and references (unless that sequence container is stable_vector or a similar container that offers stable pointers and references). Similarly, erasing an element might invalidate iterators and references pointing to elements that come after (their keys are bigger) the erased element.

    @@ -180,7 +180,7 @@

    -

    Template Parameters

    +

    Template Parameters

    1. typename Key
      @@ -203,60 +203,60 @@
    -

    +

    flat_multiset public construct/copy/destruct

    1. -
      flat_multiset() noexcept(container_detail::is_nothrow_default_constructible< AllocatorOrContainer >::value &&container_detail::is_nothrow_default_constructible< Compare >::value));
      +
      flat_multiset() noexcept(dtl::is_nothrow_default_constructible< AllocatorOrContainer >::value &&dtl::is_nothrow_default_constructible< Compare >::value));

      Effects: Default constructs an empty container.

      Complexity: Constant.

    2. -
      explicit flat_multiset(const Compare & comp);
      +
      explicit flat_multiset(const Compare & comp);

      Effects: Constructs an empty container using the specified comparison object.

      Complexity: Constant.

    3. -
      explicit flat_multiset(const allocator_type & a);
      +
      explicit flat_multiset(const allocator_type & a);

      Effects: Constructs an empty container using the specified allocator.

      Complexity: Constant.

    4. -
      flat_multiset(const Compare & comp, const allocator_type & a);
      +
      flat_multiset(const Compare & comp, const allocator_type & a);

      Effects: Constructs an empty container using the specified comparison object and allocator.

      Complexity: Constant. 

    5. template<typename InputIterator> 
-  flat_multiset(InputIterator first, InputIterator last);
      + flat_multiset(InputIterator first, InputIterator last);

      Effects: Constructs an empty container and inserts elements from the range [first ,last ).

      Complexity: Linear in N if the range [first ,last ) is already sorted using comp and otherwise N logN, where N is last - first. 

    6. template<typename InputIterator> 
-  flat_multiset(InputIterator first, InputIterator last, 
+  flat_multiset(InputIterator first, InputIterator last, 
                 const allocator_type & a);

      Effects: Constructs an empty container using the specified allocator, and inserts elements from the range [first ,last ).

      Complexity: Linear in N if the range [first ,last ) is already sorted using comp and otherwise N logN, where N is last - first. 

    7. template<typename InputIterator> 
-  flat_multiset(InputIterator first, InputIterator last, const Compare & comp);
      + flat_multiset(InputIterator first, InputIterator last, const Compare & comp);

      Effects: Constructs an empty container using the specified comparison object and inserts elements from the range [first ,last ).

      Complexity: Linear in N if the range [first ,last ) is already sorted using comp and otherwise N logN, where N is last - first. 

    8. template<typename InputIterator> 
-  flat_multiset(InputIterator first, InputIterator last, const Compare & comp, 
+  flat_multiset(InputIterator first, InputIterator last, const Compare & comp, 
                 const allocator_type & a);

      Effects: Constructs an empty container using the specified comparison object and allocator, and inserts elements from the range [first ,last ).

      Complexity: Linear in N if the range [first ,last ) is already sorted using comp and otherwise N logN, where N is last - first. 

    9. template<typename InputIterator> 
-  flat_multiset(ordered_range_t, InputIterator first, InputIterator last);
      + flat_multiset(ordered_range_t, InputIterator first, InputIterator last);

      Effects: Constructs an empty flat_multiset and inserts elements from the ordered range [first ,last ). This function is more efficient than the normal range creation for ordered ranges.

      Requires: [first ,last) must be ordered according to the predicate.

      Complexity: Linear in N.

      @@ -264,7 +264,7 @@ 
    10. template<typename InputIterator> 
-  flat_multiset(ordered_range_t, InputIterator first, InputIterator last, 
+  flat_multiset(ordered_range_t, InputIterator first, InputIterator last, 
                 const Compare & comp);

      Effects: Constructs an empty flat_multiset using the specified comparison object and inserts elements from the ordered range [first ,last ). This function is more efficient than the normal range creation for ordered ranges.

      Requires: [first ,last) must be ordered according to the predicate.

      @@ -273,7 +273,7 @@ 
    11. template<typename InputIterator> 
-  flat_multiset(ordered_range_t, InputIterator first, InputIterator last, 
+  flat_multiset(ordered_range_t, InputIterator first, InputIterator last, 
                 const Compare & comp, const allocator_type & a);

      Effects: Constructs an empty flat_multiset using the specified comparison object and allocator, and inserts elements from the ordered range [first, last ). This function is more efficient than the normal range creation for ordered ranges.

      Requires: [first ,last) must be ordered according to the predicate.

      @@ -281,36 +281,36 @@

      Note: Non-standard extension.

    12. -
      flat_multiset(std::initializer_list< value_type > il);
      +
      flat_multiset(std::initializer_list< value_type > il);

      Effects: Default constructs an empty container.

      Complexity: Constant.

    13. -
      flat_multiset(std::initializer_list< value_type > il, 
+
      flat_multiset(std::initializer_list< value_type > il, 
               const allocator_type & a);
      
 
      Effects: Constructs an empty container using the specified allocator, and inserts elements from the range [il.begin(), il.end()).
      
 
      Complexity: Linear in N if the range [il.begin(), il.end()) is already sorted using comp and otherwise N logN, where N is il.begin() - il.end().
    14. -
      flat_multiset(std::initializer_list< value_type > il, const Compare & comp);
      +
      flat_multiset(std::initializer_list< value_type > il, const Compare & comp);

      Effects: Constructs an empty container using the specified comparison object and inserts elements from the range [il.begin(), il.end()).

      Complexity: Linear in N if the range [il.begin(), il.end()) is already sorted using comp and otherwise N logN, where N is il.begin() - il.end().

    15. -
      flat_multiset(std::initializer_list< value_type > il, const Compare & comp, 
+
      flat_multiset(std::initializer_list< value_type > il, const Compare & comp, 
               const allocator_type & a);
      
 
      Effects: Constructs an empty container using the specified comparison object and allocator, and inserts elements from the range [il.begin(), il.end()).
      
 
      Complexity: Linear in N if the range [il.begin(), il.end()) is already sorted using comp and otherwise N logN, where N is il.begin() - il.end().
    16. -
      flat_multiset(ordered_range_t, std::initializer_list< value_type > il);
      +
      flat_multiset(ordered_range_t, std::initializer_list< value_type > il);

      Effects: Constructs an empty containerand inserts elements from the ordered unique range [il.begin(), il.end()). This function is more efficient than the normal range creation for ordered ranges.

      Requires: [il.begin(), il.end()) must be ordered according to the predicate.

      Complexity: Linear in N.

      Note: Non-standard extension.

    17. -
      flat_multiset(ordered_range_t, std::initializer_list< value_type > il, 
+
      flat_multiset(ordered_range_t, std::initializer_list< value_type > il, 
               const Compare & comp);
      
 
      Effects: Constructs an empty container using the specified comparison object and inserts elements from the ordered unique range [il.begin(), il.end()). This function is more efficient than the normal range creation for ordered ranges.
      
 
      Requires: [il.begin(), il.end()) must be ordered according to the predicate.
      
@@ -318,7 +318,7 @@
 
      Note: Non-standard extension.
    18. -
      flat_multiset(ordered_range_t, std::initializer_list< value_type > il, 
+
      flat_multiset(ordered_range_t, std::initializer_list< value_type > il, 
               const Compare & comp, const allocator_type & a);
      
 
      Effects: Constructs an empty container using the specified comparison object and allocator, and inserts elements from the ordered unique range [il.begin(), il.end()). This function is more efficient than the normal range creation for ordered ranges.
      
 
      Requires: [il.begin(), il.end()) must be ordered according to the predicate.
      
@@ -326,209 +326,209 @@
 
      Note: Non-standard extension.
    19. -
      flat_multiset(const flat_multiset & x);
      +
      flat_multiset(const flat_multiset & x);

      Effects: Copy constructs the container.

      Complexity: Linear in x.size().

    20. -
      flat_multiset(flat_multiset && x) noexcept(boost::container::container_detail::is_nothrow_move_constructible< Compare >::value));
      +
      flat_multiset(flat_multiset && x) noexcept(boost::container::dtl::is_nothrow_move_constructible< Compare >::value));

      Effects: Move constructs thecontainer. Constructs *this using x's resources.

      Complexity: Constant.

      Postcondition: x is emptied.

    21. -
      flat_multiset(const flat_multiset & x, const allocator_type & a);
      +
      flat_multiset(const flat_multiset & x, const allocator_type & a);

      Effects: Copy constructs a container using the specified allocator.

      Complexity: Linear in x.size().

    22. -
      flat_multiset(flat_multiset && x, const allocator_type & a);
      +
      flat_multiset(flat_multiset && x, const allocator_type & a);

      Effects: Move constructs a container using the specified allocator. Constructs *this using x's resources.

      Complexity: Constant if a == x.get_allocator(), linear otherwise

    23. -
      flat_multiset & operator=(const flat_multiset & x);
      +
      flat_multiset & operator=(const flat_multiset & x);

      Effects: Makes *this a copy of x.

      Complexity: Linear in x.size(). 

    24. flat_multiset & 
-operator=(flat_multiset && x) noexcept((allocator_traits_type::propagate_on_container_move_assignment::value||allocator_traits_type::is_always_equal::value)&&boost::container::container_detail::is_nothrow_move_assignable< Compare >::value));
      +operator=(flat_multiset && x) noexcept((allocator_traits_type::propagate_on_container_move_assignment::value||allocator_traits_type::is_always_equal::value)&&boost::container::dtl::is_nothrow_move_assignable< Compare >::value));

      Throws: If allocator_traits_type::propagate_on_container_move_assignment is false and (allocation throws or value_type's move constructor throws)

      Complexity: Constant if allocator_traits_type:: propagate_on_container_move_assignment is true or this->get>allocator() == x.get_allocator(). Linear otherwise.

    25. -
      flat_multiset & operator=(std::initializer_list< value_type > il);
      +
      flat_multiset & operator=(std::initializer_list< value_type > il);

      Effects: Copy all elements from il to *this.

      Complexity: Linear in il.size().

    -

    -flat_multiset public member functions

    +

    +flat_multiset public member functions

    1. -
      allocator_type get_allocator() const noexcept;
      +
      allocator_type get_allocator() const noexcept;

      Effects: Returns a copy of the allocator that was passed to the object's constructor.

      Complexity: Constant.

    2. -
      stored_allocator_type & get_stored_allocator() noexcept;
      +
      stored_allocator_type & get_stored_allocator() noexcept;

      Effects: Returns a reference to the internal allocator.

      Throws: Nothing

      Complexity: Constant.

      Note: Non-standard extension.

    3. -
      const stored_allocator_type & get_stored_allocator() const noexcept;
      +
      const stored_allocator_type & get_stored_allocator() const noexcept;

      Effects: Returns a reference to the internal allocator.

      Throws: Nothing

      Complexity: Constant.

      Note: Non-standard extension.

    4. -
      iterator begin() noexcept;
      +
      iterator begin() noexcept;

      Effects: Returns an iterator to the first element contained in the container.

      Throws: Nothing.

      Complexity: Constant.

    5. -
      const_iterator begin() const;
      +
      const_iterator begin() const;

      Effects: Returns a const_iterator to the first element contained in the container.

      Throws: Nothing.

      Complexity: Constant.

    6. -
      const_iterator cbegin() const noexcept;
      +
      const_iterator cbegin() const noexcept;

      Effects: Returns a const_iterator to the first element contained in the container.

      Throws: Nothing.

      Complexity: Constant.

    7. -
      iterator end() noexcept;
      +
      iterator end() noexcept;

      Effects: Returns an iterator to the end of the container.

      Throws: Nothing.

      Complexity: Constant.

    8. -
      const_iterator end() const noexcept;
      +
      const_iterator end() const noexcept;

      Effects: Returns a const_iterator to the end of the container.

      Throws: Nothing.

      Complexity: Constant.

    9. -
      const_iterator cend() const noexcept;
      +
      const_iterator cend() const noexcept;

      Effects: Returns a const_iterator to the end of the container.

      Throws: Nothing.

      Complexity: Constant.

    10. -
      reverse_iterator rbegin() noexcept;
      +
      reverse_iterator rbegin() noexcept;

      Effects: Returns a reverse_iterator pointing to the beginning of the reversed container.

      Throws: Nothing.

      Complexity: Constant.

    11. -
      const_reverse_iterator rbegin() const noexcept;
      +
      const_reverse_iterator rbegin() const noexcept;

      Effects: Returns a const_reverse_iterator pointing to the beginning of the reversed container.

      Throws: Nothing.

      Complexity: Constant.

    12. -
      const_reverse_iterator crbegin() const noexcept;
      +
      const_reverse_iterator crbegin() const noexcept;

      Effects: Returns a const_reverse_iterator pointing to the beginning of the reversed container.

      Throws: Nothing.

      Complexity: Constant.

    13. -
      reverse_iterator rend() noexcept;
      +
      reverse_iterator rend() noexcept;

      Effects: Returns a reverse_iterator pointing to the end of the reversed container.

      Throws: Nothing.

      Complexity: Constant.

    14. -
      const_reverse_iterator rend() const noexcept;
      +
      const_reverse_iterator rend() const noexcept;

      Effects: Returns a const_reverse_iterator pointing to the end of the reversed container.

      Throws: Nothing.

      Complexity: Constant.

    15. -
      const_reverse_iterator crend() const noexcept;
      +
      const_reverse_iterator crend() const noexcept;

      Effects: Returns a const_reverse_iterator pointing to the end of the reversed container.

      Throws: Nothing.

      Complexity: Constant.

    16. -
      bool empty() const noexcept;
      +
      bool empty() const noexcept;

      Effects: Returns true if the container contains no elements.

      Throws: Nothing.

      Complexity: Constant.

    17. -
      size_type size() const noexcept;
      +
      size_type size() const noexcept;

      Effects: Returns the number of the elements contained in the container.

      Throws: Nothing.

      Complexity: Constant.

    18. -
      size_type max_size() const noexcept;
      +
      size_type max_size() const noexcept;

      Effects: Returns the largest possible size of the container.

      Throws: Nothing.

      Complexity: Constant.

    19. -
      size_type capacity() const noexcept;
      +
      size_type capacity() const noexcept;

      Effects: Number of elements for which memory has been allocated. capacity() is always greater than or equal to size().

      Throws: Nothing.

      Complexity: Constant.

    20. -
      void reserve(size_type cnt);
      +
      void reserve(size_type cnt);

      Effects: If n is less than or equal to capacity(), or the underlying container has no reserve member, this call has no effect. Otherwise, it is a request for allocation of additional memory. If the request is successful, then capacity() is greater than or equal to n; otherwise, capacity() is unchanged. In either case, size() is unchanged.

      Throws: If memory allocation allocation throws or T's copy constructor throws.

      Note: If capacity() is less than "cnt", iterators and references to to values might be invalidated.

    21. -
      void shrink_to_fit();
      +
      void shrink_to_fit();
      Effects: Tries to deallocate the excess of memory created

      Throws: If memory allocation throws, or Key's copy constructor throws.

      Complexity: Linear to size().

    22. -
      template<class... Args> iterator emplace(Args &&... args);
      +
      template<class... Args> iterator emplace(Args &&... args);

      Effects: Inserts an object of type Key constructed with std::forward<Args>(args)... and returns the iterator pointing to the newly inserted element.

      Complexity: Logarithmic search time plus linear insertion to the elements with bigger keys than x.

      Note: If an element is inserted it might invalidate elements. 

    23. template<class... Args> 
-  iterator emplace_hint(const_iterator p, Args &&... args);
      + iterator emplace_hint(const_iterator p, Args &&... args);

      Effects: Inserts an object of type Key constructed with std::forward<Args>(args)... in the container. p is a hint pointing to where the insert should start to search.

      Returns: An iterator pointing to the element with key equivalent to the key of x.

      Complexity: Logarithmic search time (constant if x is inserted right before p) plus insertion linear to the elements with bigger keys than x.

      Note: If an element is inserted it might invalidate elements.

    24. -
      iterator insert(const value_type & x);
      +
      iterator insert(const value_type & x);

      Effects: Inserts x and returns the iterator pointing to the newly inserted element.

      Complexity: Logarithmic search time plus linear insertion to the elements with bigger keys than x.

      Note: If an element is inserted it might invalidate elements.

    25. -
      iterator insert(value_type && x);
      +
      iterator insert(value_type && x);

      Effects: Inserts a new value_type move constructed from x and returns the iterator pointing to the newly inserted element.

      Complexity: Logarithmic search time plus linear insertion to the elements with bigger keys than x.

      Note: If an element is inserted it might invalidate elements.

    26. -
      iterator insert(const_iterator p, const value_type & x);
      +
      iterator insert(const_iterator p, const value_type & x);

      Effects: Inserts a copy of x in the container. p is a hint pointing to where the insert should start to search.

      Returns: An iterator pointing to the element with key equivalent to the key of x.

      Complexity: Logarithmic search time (constant if x is inserted right before p) plus insertion linear to the elements with bigger keys than x.

      Note: If an element is inserted it might invalidate elements.

    27. -
      iterator insert(const_iterator p, value_type && x);
      +
      iterator insert(const_iterator p, value_type && x);

      Effects: Inserts a new value move constructed from x in the container. p is a hint pointing to where the insert should start to search.

      Returns: An iterator pointing to the element with key equivalent to the key of x.

      Complexity: Logarithmic search time (constant if x is inserted right before p) plus insertion linear to the elements with bigger keys than x.

      @@ -536,36 +536,36 @@ 
    28. template<typename InputIterator> 
-  void insert(InputIterator first, InputIterator last);
      + void insert(InputIterator first, InputIterator last);

      Requires: first, last are not iterators into *this.

      Effects: inserts each element from the range [first,last) .

      -

      Complexity: At most N log(size()+N) (N is the distance from first to last) search time plus N*size() insertion time.

      +

      Complexity: N log(N).

      Note: If an element is inserted it might invalidate elements. 

    29. template<typename InputIterator> 
-  void insert(ordered_range_t, InputIterator first, InputIterator last);
      + void insert(ordered_range_t, InputIterator first, InputIterator last);

      Requires: first, last are not iterators into *this and must be ordered according to the predicate.

      Effects: inserts each element from the range [first,last) .This function is more efficient than the normal range creation for ordered ranges.

      -

      Complexity: At most N log(size()+N) (N is the distance from first to last) search time plus N*size() insertion time.

      +

      Complexity: Linear.

      Note: Non-standard extension. If an element is inserted it might invalidate elements.

    30. -
      void insert(std::initializer_list< value_type > il);
      +
      void insert(std::initializer_list< value_type > il);

      Effects: inserts each element from the range [il.begin(), il.end()).

      -

      Complexity: At most N log(size()+N) (N is the distance from first to last) search time plus N*size() insertion time.

      +

      Complexity: N log(N).

      Note: If an element is inserted it might invalidate elements.

    31. -
      void insert(ordered_range_t, std::initializer_list< value_type > il);
      +
      void insert(ordered_range_t, std::initializer_list< value_type > il);

      Requires: Range [il.begin(), il.end()) must be ordered according to the predicate.

      Effects: inserts each element from the range [il.begin(), il.end()). This function is more efficient than the normal range creation for ordered ranges.

      -

      Complexity: At most N log(size()+N) (N is the distance from il.begin() to il.end()) search time plus N*size() insertion time.

      +

      Complexity: Linear.

      Note: Non-standard extension. If an element is inserted it might invalidate elements. 

    32. template<typename C2> 
-  void merge(flat_multiset< Key, C2, AllocatorOrContainer > & source);
      + void merge(flat_multiset< Key, C2, AllocatorOrContainer > & source);

      Requires: this->get_allocator() == source.get_allocator().

      Effects: Extracts each element in source and insert it into a using the comparison object of *this.

      Postcondition: Pointers and references to the transferred elements of source refer to those same elements but as members of *this. Iterators referring to the transferred elements will continue to refer to their elements, but they now behave as iterators into *this, not into source.

      @@ -574,7 +574,7 @@ 
    33. template<typename C2> 
-  void merge(flat_multiset< Key, C2, AllocatorOrContainer > && source);
      + void merge(flat_multiset< Key, C2, AllocatorOrContainer > && source);

      Requires: this->get_allocator() == source.get_allocator().

      Effects: Extracts each element in source and insert it into a using the comparison object of *this.

      Postcondition: Pointers and references to the transferred elements of source refer to those same elements but as members of *this. Iterators referring to the transferred elements will continue to refer to their elements, but they now behave as iterators into *this, not into source.

      @@ -583,7 +583,7 @@ 
    34. template<typename C2> 
-  void merge(flat_set< Key, C2, AllocatorOrContainer > & source);
      + void merge(flat_set< Key, C2, AllocatorOrContainer > & source);

      Requires: this->get_allocator() == source.get_allocator().

      Effects: Extracts each element in source and insert it into a using the comparison object of *this.

      Postcondition: Pointers and references to the transferred elements of source refer to those same elements but as members of *this. Iterators referring to the transferred elements will continue to refer to their elements, but they now behave as iterators into *this, not into source.

      @@ -592,7 +592,7 @@ 
    35. template<typename C2> 
-  void merge(flat_set< Key, C2, AllocatorOrContainer > && source);
      + void merge(flat_set< Key, C2, AllocatorOrContainer > && source);

      Requires: this->get_allocator() == source.get_allocator().

      Effects: Extracts each element in source and insert it into a using the comparison object of *this.

      Postcondition: Pointers and references to the transferred elements of source refer to those same elements but as members of *this. Iterators referring to the transferred elements will continue to refer to their elements, but they now behave as iterators into *this, not into source.

      @@ -600,59 +600,59 @@

      Complexity: N log(a.size() + N) (N has the value source.size())

    36. -
      iterator erase(const_iterator p);
      +
      iterator erase(const_iterator p);

      Effects: Erases the element pointed to by p.

      Returns: Returns an iterator pointing to the element immediately following q prior to the element being erased. If no such element exists, returns end().

      Complexity: Linear to the elements with keys bigger than p

      Note: Invalidates elements with keys not less than the erased element.

    37. -
      size_type erase(const key_type & x);
      +
      size_type erase(const key_type & x);

      Effects: Erases all elements in the container with key equivalent to x.

      Returns: Returns the number of erased elements.

      Complexity: Logarithmic search time plus erasure time linear to the elements with bigger keys.

    38. -
      iterator erase(const_iterator first, const_iterator last);
      +
      iterator erase(const_iterator first, const_iterator last);

      Effects: Erases all the elements in the range [first, last).

      Returns: Returns last.

      Complexity: size()*N where N is the distance from first to last.

      Complexity: Logarithmic search time plus erasure time linear to the elements with bigger keys.

    39. -
      void swap(flat_multiset & x) noexcept(allocator_traits_type::is_always_equal::value &&boost::container::container_detail::is_nothrow_swappable< Compare >::value));
      +
      void swap(flat_multiset & x) noexcept(allocator_traits_type::is_always_equal::value &&boost::container::dtl::is_nothrow_swappable< Compare >::value));

      Effects: Swaps the contents of *this and x.

      Throws: Nothing.

      Complexity: Constant.

    40. -
      void clear() noexcept;
      +
      void clear() noexcept;

      Effects: erase(a.begin(),a.end()).

      Postcondition: size() == 0.

      Complexity: linear in size().

    41. -
      key_compare key_comp() const;
      +
      key_compare key_comp() const;

      Effects: Returns the comparison object out of which a was constructed.

      Complexity: Constant.

    42. -
      value_compare value_comp() const;
      +
      value_compare value_comp() const;

      Effects: Returns an object of value_compare constructed out of the comparison object.

      Complexity: Constant.

    43. -
      iterator find(const key_type & x);
      +
      iterator find(const key_type & x);

      Returns: An iterator pointing to an element with the key equivalent to x, or end() if such an element is not found.

      Complexity: Logarithmic.

    44. -
      const_iterator find(const key_type & x) const;
      +
      const_iterator find(const key_type & x) const;

      Returns: A const_iterator pointing to an element with the key equivalent to x, or end() if such an element is not found.

      Complexity: Logarithmic.

    45. -
      iterator nth(size_type n) noexcept;
      +
      iterator nth(size_type n) noexcept;

      Requires: size() >= n.

      Effects: Returns an iterator to the nth element from the beginning of the container. Returns end() if n == size().

      Throws: Nothing.

      @@ -660,7 +660,7 @@

      Note: Non-standard extension

    46. -
      const_iterator nth(size_type n) const noexcept;
      +
      const_iterator nth(size_type n) const noexcept;

      Requires: size() >= n.

      Effects: Returns a const_iterator to the nth element from the beginning of the container. Returns end() if n == size().

      Throws: Nothing.

      @@ -668,7 +668,7 @@

      Note: Non-standard extension

    47. -
      size_type index_of(iterator p) noexcept;
      +
      size_type index_of(iterator p) noexcept;

      Requires: begin() <= p <= end().

      Effects: Returns the index of the element pointed by p and size() if p == end().

      Throws: Nothing.

      @@ -676,7 +676,7 @@

      Note: Non-standard extension

    48. -
      size_type index_of(const_iterator p) const noexcept;
      +
      size_type index_of(const_iterator p) const noexcept;

      Requires: begin() <= p <= end().

      Effects: Returns the index of the element pointed by p and size() if p == end().

      Throws: Nothing.

      @@ -684,56 +684,56 @@

      Note: Non-standard extension

    49. -
      size_type count(const key_type & x) const;
      +
      size_type count(const key_type & x) const;

      Returns: The number of elements with key equivalent to x.

      Complexity: log(size())+count(k)

    50. -
      iterator lower_bound(const key_type & x);
      +
      iterator lower_bound(const key_type & x);

      Returns: An iterator pointing to the first element with key not less than k, or a.end() if such an element is not found.

      Complexity: Logarithmic

    51. -
      const_iterator lower_bound(const key_type & x) const;
      +
      const_iterator lower_bound(const key_type & x) const;

      Returns: A const iterator pointing to the first element with key not less than k, or a.end() if such an element is not found.

      Complexity: Logarithmic

    52. -
      iterator upper_bound(const key_type & x);
      +
      iterator upper_bound(const key_type & x);

      Returns: An iterator pointing to the first element with key not less than x, or end() if such an element is not found.

      Complexity: Logarithmic

    53. -
      const_iterator upper_bound(const key_type & x) const;
      +
      const_iterator upper_bound(const key_type & x) const;

      Returns: A const iterator pointing to the first element with key not less than x, or end() if such an element is not found.

      Complexity: Logarithmic 

    54. std::pair< const_iterator, const_iterator > 
-equal_range(const key_type & x) const;
      +equal_range(const key_type & x) const;

      Effects: Equivalent to std::make_pair(this->lower_bound(k), this->upper_bound(k)).

      Complexity: Logarithmic

    55. -
      std::pair< iterator, iterator > equal_range(const key_type & x);
      +
      std::pair< iterator, iterator > equal_range(const key_type & x);

      Effects: Equivalent to std::make_pair(this->lower_bound(k), this->upper_bound(k)).

      Complexity: Logarithmic

    56. -
      sequence_type extract_sequence();
      +
      sequence_type extract_sequence();

      Effects: Extracts the internal sequence container.

      Complexity: Same as the move constructor of sequence_type, usually constant.

      Postcondition: this->empty()

      Throws: If secuence_type's move constructor throws

    57. -
      void adopt_sequence(sequence_type && seq);
      +
      void adopt_sequence(sequence_type && seq);

      Effects: Discards the internally hold sequence container and adopts the one passed externally using the move assignment.

      Complexity: Assuming O(1) move assignment, O(NlogN) with N = seq.size()

      Throws: If the comparison or the move constructor throws

    58. -
      void adopt_sequence(ordered_range_t, sequence_type && seq);
      +
      void adopt_sequence(ordered_range_t, sequence_type && seq);

      Requires: seq shall be ordered according to this->compare()

      Effects: Discards the internally hold sequence container and adopts the one passed externally using the move assignment.

      Complexity: Assuming O(1) move assignment, O(1)

      @@ -742,41 +742,41 @@
    -

    -flat_multiset friend functions

    +

    +flat_multiset friend functions

    1. -
      friend bool operator==(const flat_multiset & x, const flat_multiset & y);
      +
      friend bool operator==(const flat_multiset & x, const flat_multiset & y);

      Effects: Returns true if x and y are equal

      Complexity: Linear to the number of elements in the container.

    2. -
      friend bool operator!=(const flat_multiset & x, const flat_multiset & y);
      +
      friend bool operator!=(const flat_multiset & x, const flat_multiset & y);

      Effects: Returns true if x and y are unequal

      Complexity: Linear to the number of elements in the container.

    3. -
      friend bool operator<(const flat_multiset & x, const flat_multiset & y);
      +
      friend bool operator<(const flat_multiset & x, const flat_multiset & y);

      Effects: Returns true if x is less than y

      Complexity: Linear to the number of elements in the container.

    4. -
      friend bool operator>(const flat_multiset & x, const flat_multiset & y);
      +
      friend bool operator>(const flat_multiset & x, const flat_multiset & y);

      Effects: Returns true if x is greater than y

      Complexity: Linear to the number of elements in the container.

    5. -
      friend bool operator<=(const flat_multiset & x, const flat_multiset & y);
      +
      friend bool operator<=(const flat_multiset & x, const flat_multiset & y);

      Effects: Returns true if x is equal or less than y

      Complexity: Linear to the number of elements in the container.

    6. -
      friend bool operator>=(const flat_multiset & x, const flat_multiset & y);
      +
      friend bool operator>=(const flat_multiset & x, const flat_multiset & y);

      Effects: Returns true if x is equal or greater than y

      Complexity: Linear to the number of elements in the container.

    7. -
      friend void swap(flat_multiset & x, flat_multiset & y);
      +
      friend void swap(flat_multiset & x, flat_multiset & y);

      Effects: x.swap(y)

      Complexity: Constant.

      8. @@ -786,7 +786,8 @@
    -
    Copyright © 2009-2015 Ion Gaztanaga

    +

    Copyright © 2009-2017 Ion + Gaztanaga

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost/container/flat_set.html b/doc/html/boost/container/flat_set.html index 13979ba303..7f9622a4e1 100644 --- a/doc/html/boost/container/flat_set.html +++ b/doc/html/boost/container/flat_set.html @@ -57,121 +57,121 @@ typedef sequence_type::const_reverse_iterator const_reverse_iterator; // construct/copy/destruct - flat_set() noexcept(container_detail::is_nothrow_default_constructible< AllocatorOrContainer >::value &&container_detail::is_nothrow_default_constructible< Compare >::value)); - explicit flat_set(const Compare &); - explicit flat_set(const allocator_type &); - flat_set(const Compare &, const allocator_type &); - template<typename InputIterator> flat_set(InputIterator, InputIterator); + flat_set() noexcept(dtl::is_nothrow_default_constructible< AllocatorOrContainer >::value &&dtl::is_nothrow_default_constructible< Compare >::value)); + explicit flat_set(const Compare &); + explicit flat_set(const allocator_type &); + flat_set(const Compare &, const allocator_type &); + template<typename InputIterator> flat_set(InputIterator, InputIterator); template<typename InputIterator> - flat_set(InputIterator, InputIterator, const allocator_type &); + flat_set(InputIterator, InputIterator, const allocator_type &); template<typename InputIterator> - flat_set(InputIterator, InputIterator, const Compare &); + flat_set(InputIterator, InputIterator, const Compare &); template<typename InputIterator> - flat_set(InputIterator, InputIterator, const Compare &, + flat_set(InputIterator, InputIterator, const Compare &, const allocator_type &); template<typename InputIterator> - flat_set(ordered_unique_range_t, InputIterator, InputIterator); + flat_set(ordered_unique_range_t, InputIterator, InputIterator); template<typename InputIterator> - flat_set(ordered_unique_range_t, InputIterator, InputIterator, + flat_set(ordered_unique_range_t, InputIterator, InputIterator, const Compare &); template<typename InputIterator> - flat_set(ordered_unique_range_t, InputIterator, InputIterator, + flat_set(ordered_unique_range_t, InputIterator, InputIterator, const Compare &, const allocator_type &); - flat_set(std::initializer_list< value_type >); - flat_set(std::initializer_list< value_type >, const allocator_type &); - flat_set(std::initializer_list< value_type >, const Compare &); - flat_set(std::initializer_list< value_type >, const Compare &, + flat_set(std::initializer_list< value_type >); + flat_set(std::initializer_list< value_type >, const allocator_type &); + flat_set(std::initializer_list< value_type >, const Compare &); + flat_set(std::initializer_list< value_type >, const Compare &, const allocator_type &); - flat_set(ordered_unique_range_t, std::initializer_list< value_type >); - flat_set(ordered_unique_range_t, std::initializer_list< value_type >, + flat_set(ordered_unique_range_t, std::initializer_list< value_type >); + flat_set(ordered_unique_range_t, std::initializer_list< value_type >, const Compare &); - flat_set(ordered_unique_range_t, std::initializer_list< value_type >, + flat_set(ordered_unique_range_t, std::initializer_list< value_type >, const Compare &, const allocator_type &); - flat_set(const flat_set &); - flat_set(flat_set &&) noexcept(boost::container::container_detail::is_nothrow_move_constructible< Compare >::value)); - flat_set(const flat_set &, const allocator_type &); - flat_set(flat_set &&, const allocator_type &); - flat_set & operator=(const flat_set &); - flat_set & operator=(flat_set &&) noexcept((allocator_traits_type::propagate_on_container_move_assignment::value||allocator_traits_type::is_always_equal::value)&&boost::container::container_detail::is_nothrow_move_assignable< Compare >::value)); - flat_set & operator=(std::initializer_list< value_type >); + flat_set(const flat_set &); + flat_set(flat_set &&) noexcept(boost::container::dtl::is_nothrow_move_constructible< Compare >::value)); + flat_set(const flat_set &, const allocator_type &); + flat_set(flat_set &&, const allocator_type &); + flat_set & operator=(const flat_set &); + flat_set & operator=(flat_set &&) noexcept((allocator_traits_type::propagate_on_container_move_assignment::value||allocator_traits_type::is_always_equal::value)&&boost::container::dtl::is_nothrow_move_assignable< Compare >::value)); + flat_set & operator=(std::initializer_list< value_type >); - // public member functions - allocator_type get_allocator() const noexcept; - stored_allocator_type & get_stored_allocator() noexcept; - const stored_allocator_type & get_stored_allocator() const noexcept; - iterator begin() noexcept; - const_iterator begin() const noexcept; - iterator end() noexcept; - const_iterator end() const noexcept; - reverse_iterator rbegin() noexcept; - const_reverse_iterator rbegin() const noexcept; - reverse_iterator rend() noexcept; - const_reverse_iterator rend() const noexcept; - const_iterator cbegin() const noexcept; - const_iterator cend() const noexcept; - const_reverse_iterator crbegin() const noexcept; - const_reverse_iterator crend() const noexcept; - bool empty() const noexcept; - size_type size() const noexcept; - size_type max_size() const noexcept; - size_type capacity() const noexcept; - void reserve(size_type); - void shrink_to_fit(); - template<class... Args> std::pair< iterator, bool > emplace(Args &&...); - template<class... Args> iterator emplace_hint(const_iterator, Args &&...); - std::pair< iterator, bool > insert(const value_type &); - std::pair< iterator, bool > insert(value_type &&); - iterator insert(const_iterator, const value_type &); - iterator insert(const_iterator, value_type &&); - template<typename InputIterator> void insert(InputIterator, InputIterator); + // public member functions + allocator_type get_allocator() const noexcept; + stored_allocator_type & get_stored_allocator() noexcept; + const stored_allocator_type & get_stored_allocator() const noexcept; + iterator begin() noexcept; + const_iterator begin() const noexcept; + iterator end() noexcept; + const_iterator end() const noexcept; + reverse_iterator rbegin() noexcept; + const_reverse_iterator rbegin() const noexcept; + reverse_iterator rend() noexcept; + const_reverse_iterator rend() const noexcept; + const_iterator cbegin() const noexcept; + const_iterator cend() const noexcept; + const_reverse_iterator crbegin() const noexcept; + const_reverse_iterator crend() const noexcept; + bool empty() const noexcept; + size_type size() const noexcept; + size_type max_size() const noexcept; + size_type capacity() const noexcept; + void reserve(size_type); + void shrink_to_fit(); + template<class... Args> std::pair< iterator, bool > emplace(Args &&...); + template<class... Args> iterator emplace_hint(const_iterator, Args &&...); + std::pair< iterator, bool > insert(const value_type &); + std::pair< iterator, bool > insert(value_type &&); + iterator insert(const_iterator, const value_type &); + iterator insert(const_iterator, value_type &&); + template<typename InputIterator> void insert(InputIterator, InputIterator); template<typename InputIterator> - void insert(ordered_unique_range_t, InputIterator, InputIterator); - void insert(std::initializer_list< value_type >); - void insert(ordered_unique_range_t, std::initializer_list< value_type >); + void insert(ordered_unique_range_t, InputIterator, InputIterator); + void insert(std::initializer_list< value_type >); + void insert(ordered_unique_range_t, std::initializer_list< value_type >); template<typename C2> - void merge(flat_set< Key, C2, AllocatorOrContainer > &); + void merge(flat_set< Key, C2, AllocatorOrContainer > &); template<typename C2> - void merge(flat_set< Key, C2, AllocatorOrContainer > &&); + void merge(flat_set< Key, C2, AllocatorOrContainer > &&); template<typename C2> - void merge(flat_multiset< Key, C2, AllocatorOrContainer > &); + void merge(flat_multiset< Key, C2, AllocatorOrContainer > &); template<typename C2> - void merge(flat_multiset< Key, C2, AllocatorOrContainer > &&); - iterator erase(const_iterator); - size_type erase(const key_type &); - iterator erase(const_iterator, const_iterator); - void swap(flat_set &) noexcept(allocator_traits_type::is_always_equal::value &&boost::container::container_detail::is_nothrow_swappable< Compare >::value)); - void clear() noexcept; - key_compare key_comp() const; - value_compare value_comp() const; - iterator find(const key_type &); - const_iterator find(const key_type &) const; - iterator nth(size_type) noexcept; - const_iterator nth(size_type) const noexcept; - size_type index_of(iterator) noexcept; - size_type index_of(const_iterator) const noexcept; - size_type count(const key_type &) const; - iterator lower_bound(const key_type &); - const_iterator lower_bound(const key_type &) const; - iterator upper_bound(const key_type &); - const_iterator upper_bound(const key_type &) const; + void merge(flat_multiset< Key, C2, AllocatorOrContainer > &&); + iterator erase(const_iterator); + size_type erase(const key_type &); + iterator erase(const_iterator, const_iterator); + void swap(flat_set &) noexcept(allocator_traits_type::is_always_equal::value &&boost::container::dtl::is_nothrow_swappable< Compare >::value)); + void clear() noexcept; + key_compare key_comp() const; + value_compare value_comp() const; + iterator find(const key_type &); + const_iterator find(const key_type &) const; + iterator nth(size_type) noexcept; + const_iterator nth(size_type) const noexcept; + size_type index_of(iterator) noexcept; + size_type index_of(const_iterator) const noexcept; + size_type count(const key_type &) const; + iterator lower_bound(const key_type &); + const_iterator lower_bound(const key_type &) const; + iterator upper_bound(const key_type &); + const_iterator upper_bound(const key_type &) const; std::pair< const_iterator, const_iterator > - equal_range(const key_type &) const; - std::pair< iterator, iterator > equal_range(const key_type &); - sequence_type extract_sequence(); - void adopt_sequence(sequence_type &&); - void adopt_sequence(ordered_unique_range_t, sequence_type &&); + equal_range(const key_type &) const; + std::pair< iterator, iterator > equal_range(const key_type &); + sequence_type extract_sequence(); + void adopt_sequence(sequence_type &&); + void adopt_sequence(ordered_unique_range_t, sequence_type &&); - // friend functions - friend bool operator==(const flat_set &, const flat_set &); - friend bool operator!=(const flat_set &, const flat_set &); - friend bool operator<(const flat_set &, const flat_set &); - friend bool operator>(const flat_set &, const flat_set &); - friend bool operator<=(const flat_set &, const flat_set &); - friend bool operator>=(const flat_set &, const flat_set &); - friend void swap(flat_set &, flat_set &); + // friend functions + friend bool operator==(const flat_set &, const flat_set &); + friend bool operator!=(const flat_set &, const flat_set &); + friend bool operator<(const flat_set &, const flat_set &); + friend bool operator>(const flat_set &, const flat_set &); + friend bool operator<=(const flat_set &, const flat_set &); + friend bool operator>=(const flat_set &, const flat_set &); + friend void swap(flat_set &, flat_set &); };
    -

    Description

    +

    Description

    flat_set is a Sorted Associative Container that stores objects of type Key. It is also a Unique Associative Container, meaning that no two elements are the same.

    flat_set is similar to std::set but it's implemented by as an ordered sequence container. The underlying sequence container is by default vector but it can also work user-provided vector-like SequenceContainers (like static_vector or small_vector).

    Using vector-like sequence containers means that inserting a new element into a flat_set might invalidate previous iterators and references (unless that sequence container is stable_vector or a similar container that offers stable pointers and references). Similarly, erasing an element might invalidate iterators and references pointing to elements that come after (their keys are bigger) the erased element.

    @@ -179,7 +179,7 @@

    -

    Template Parameters

    +

    Template Parameters

    1. typename Key
      @@ -202,59 +202,59 @@
    -

    +

    flat_set public construct/copy/destruct

    1. -
      flat_set() noexcept(container_detail::is_nothrow_default_constructible< AllocatorOrContainer >::value &&container_detail::is_nothrow_default_constructible< Compare >::value));
      +
      flat_set() noexcept(dtl::is_nothrow_default_constructible< AllocatorOrContainer >::value &&dtl::is_nothrow_default_constructible< Compare >::value));

      Effects: Default constructs an empty container.

      Complexity: Constant.

    2. -
      explicit flat_set(const Compare & comp);
      +
      explicit flat_set(const Compare & comp);

      Effects: Constructs an empty container using the specified comparison object.

      Complexity: Constant.

    3. -
      explicit flat_set(const allocator_type & a);
      +
      explicit flat_set(const allocator_type & a);

      Effects: Constructs an empty container using the specified allocator.

      Complexity: Constant.

    4. -
      flat_set(const Compare & comp, const allocator_type & a);
      +
      flat_set(const Compare & comp, const allocator_type & a);

      Effects: Constructs an empty container using the specified comparison object and allocator.

      Complexity: Constant. 

    5. template<typename InputIterator> 
-  flat_set(InputIterator first, InputIterator last);
      + flat_set(InputIterator first, InputIterator last);

      Effects: Constructs an empty container and inserts elements from the range [first ,last ).

      Complexity: Linear in N if the range [first ,last ) is already sorted using comp and otherwise N logN, where N is last - first. 

    6. template<typename InputIterator> 
-  flat_set(InputIterator first, InputIterator last, const allocator_type & a);
      + flat_set(InputIterator first, InputIterator last, const allocator_type & a);

      Effects: Constructs an empty container using the specified allocator, and inserts elements from the range [first ,last ).

      Complexity: Linear in N if the range [first ,last ) is already sorted using comp and otherwise N logN, where N is last - first. 

    7. template<typename InputIterator> 
-  flat_set(InputIterator first, InputIterator last, const Compare & comp);
      + flat_set(InputIterator first, InputIterator last, const Compare & comp);

      Effects: Constructs an empty container using the specified comparison object and inserts elements from the range [first ,last ).

      Complexity: Linear in N if the range [first ,last ) is already sorted using comp and otherwise N logN, where N is last - first. 

    8. template<typename InputIterator> 
-  flat_set(InputIterator first, InputIterator last, const Compare & comp, 
+  flat_set(InputIterator first, InputIterator last, const Compare & comp, 
            const allocator_type & a);

      Effects: Constructs an empty container using the specified comparison object and allocator, and inserts elements from the range [first ,last ).

      Complexity: Linear in N if the range [first ,last ) is already sorted using comp and otherwise N logN, where N is last - first. 

    9. template<typename InputIterator> 
-  flat_set(ordered_unique_range_t, InputIterator first, InputIterator last);
      + flat_set(ordered_unique_range_t, InputIterator first, InputIterator last);

      Effects: Constructs an empty container and inserts elements from the ordered unique range [first ,last). This function is more efficient than the normal range creation for ordered ranges.

      Requires: [first ,last) must be ordered according to the predicate and must be unique values.

      Complexity: Linear in N.

      @@ -262,7 +262,7 @@ 
    10. template<typename InputIterator> 
-  flat_set(ordered_unique_range_t, InputIterator first, InputIterator last, 
+  flat_set(ordered_unique_range_t, InputIterator first, InputIterator last, 
            const Compare & comp);

      Effects: Constructs an empty container using the specified comparison object and inserts elements from the ordered unique range [first ,last). This function is more efficient than the normal range creation for ordered ranges.

      Requires: [first ,last) must be ordered according to the predicate and must be unique values.

      @@ -271,7 +271,7 @@ 
    11. template<typename InputIterator> 
-  flat_set(ordered_unique_range_t, InputIterator first, InputIterator last, 
+  flat_set(ordered_unique_range_t, InputIterator first, InputIterator last, 
            const Compare & comp, const allocator_type & a);

      Effects: Constructs an empty container using the specified comparison object and allocator, and inserts elements from the ordered unique range [first ,last). This function is more efficient than the normal range creation for ordered ranges.

      Requires: [first ,last) must be ordered according to the predicate and must be unique values.

      @@ -279,35 +279,35 @@

      Note: Non-standard extension.

    12. -
      flat_set(std::initializer_list< value_type > il);
      +
      flat_set(std::initializer_list< value_type > il);

      Effects: Constructs an empty container and inserts elements from the range [il.begin(), il.end()).

      Complexity: Linear in N if the range [il.begin(), il.end()) is already sorted using comp and otherwise N logN, where N is il.begin() - il.end().

    13. -
      flat_set(std::initializer_list< value_type > il, const allocator_type & a);
      +
      flat_set(std::initializer_list< value_type > il, const allocator_type & a);

      Effects: Constructs an empty container using the specified allocator, and inserts elements from the range [il.begin(), il.end()).

      Complexity: Linear in N if the range [il.begin(), il.end()) is already sorted using comp and otherwise N logN, where N is il.begin() - il.end().

    14. -
      flat_set(std::initializer_list< value_type > il, const Compare & comp);
      +
      flat_set(std::initializer_list< value_type > il, const Compare & comp);

      Effects: Constructs an empty container using the specified comparison object and inserts elements from the range [il.begin(), il.end()).

      Complexity: Linear in N if the range [il.begin(), il.end()) is already sorted using comp and otherwise N logN, where N is il.begin() - il.end().

    15. -
      flat_set(std::initializer_list< value_type > il, const Compare & comp, 
+
      flat_set(std::initializer_list< value_type > il, const Compare & comp, 
          const allocator_type & a);
      
 
      Effects: Constructs an empty container using the specified comparison object and allocator, and inserts elements from the range [il.begin(), il.end()).
      
 
      Complexity: Linear in N if the range [il.begin(), il.end()) is already sorted using comp and otherwise N logN, where N is il.begin() - il.end().
    16. -
      flat_set(ordered_unique_range_t, std::initializer_list< value_type > il);
      +
      flat_set(ordered_unique_range_t, std::initializer_list< value_type > il);

      Effects: Constructs an empty container using the specified comparison object and inserts elements from the ordered unique range [il.begin(), il.end()). This function is more efficient than the normal range creation for ordered ranges.

      Requires: [il.begin(), il.end()) must be ordered according to the predicate and must be unique values.

      Complexity: Linear in N.

      Note: Non-standard extension.

    17. -
      flat_set(ordered_unique_range_t, std::initializer_list< value_type > il, 
+
      flat_set(ordered_unique_range_t, std::initializer_list< value_type > il, 
          const Compare & comp);
      
 
      Effects: Constructs an empty container using the specified comparison object and inserts elements from the ordered unique range [il.begin(), il.end()). This function is more efficient than the normal range creation for ordered ranges.
      
 
      Requires: [il.begin(), il.end()) must be ordered according to the predicate and must be unique values.
      
@@ -315,7 +315,7 @@
 
      Note: Non-standard extension.
    18. -
      flat_set(ordered_unique_range_t, std::initializer_list< value_type > il, 
+
      flat_set(ordered_unique_range_t, std::initializer_list< value_type > il, 
          const Compare & comp, const allocator_type & a);
      
 
      Effects: Constructs an empty container using the specified comparison object and allocator, and inserts elements from the ordered unique range [il.begin(), il.end()). This function is more efficient than the normal range creation for ordered ranges.
      
 
      Requires: [il.begin(), il.end()) must be ordered according to the predicate and must be unique values.
      
@@ -323,175 +323,175 @@
 
      Note: Non-standard extension.
    19. -
      flat_set(const flat_set & x);
      +
      flat_set(const flat_set & x);

      Effects: Copy constructs the container.

      Complexity: Linear in x.size().

    20. -
      flat_set(flat_set && x) noexcept(boost::container::container_detail::is_nothrow_move_constructible< Compare >::value));
      +
      flat_set(flat_set && x) noexcept(boost::container::dtl::is_nothrow_move_constructible< Compare >::value));

      Effects: Move constructs thecontainer. Constructs *this using x's resources.

      Complexity: Constant.

      Postcondition: x is emptied.

    21. -
      flat_set(const flat_set & x, const allocator_type & a);
      +
      flat_set(const flat_set & x, const allocator_type & a);

      Effects: Copy constructs a container using the specified allocator.

      Complexity: Linear in x.size().

    22. -
      flat_set(flat_set && x, const allocator_type & a);
      +
      flat_set(flat_set && x, const allocator_type & a);

      Effects: Move constructs a container using the specified allocator. Constructs *this using x's resources.

      Complexity: Constant if a == x.get_allocator(), linear otherwise

    23. -
      flat_set & operator=(const flat_set & x);
      +
      flat_set & operator=(const flat_set & x);

      Effects: Makes *this a copy of x.

      Complexity: Linear in x.size().

    24. -
      flat_set & operator=(flat_set && x) noexcept((allocator_traits_type::propagate_on_container_move_assignment::value||allocator_traits_type::is_always_equal::value)&&boost::container::container_detail::is_nothrow_move_assignable< Compare >::value));
      +
      flat_set & operator=(flat_set && x) noexcept((allocator_traits_type::propagate_on_container_move_assignment::value||allocator_traits_type::is_always_equal::value)&&boost::container::dtl::is_nothrow_move_assignable< Compare >::value));

      Throws: If allocator_traits_type::propagate_on_container_move_assignment is false and (allocation throws or value_type's move constructor throws)

      Complexity: Constant if allocator_traits_type:: propagate_on_container_move_assignment is true or this->get>allocator() == x.get_allocator(). Linear otherwise.

    25. -
      flat_set & operator=(std::initializer_list< value_type > il);
      +
      flat_set & operator=(std::initializer_list< value_type > il);

      Effects: Copy all elements from il to *this.

      Complexity: Linear in il.size().

    -

    -flat_set public member functions

    +

    +flat_set public member functions

    1. -
      allocator_type get_allocator() const noexcept;
      +
      allocator_type get_allocator() const noexcept;

      Effects: Returns a copy of the allocator that was passed to the object's constructor.

      Complexity: Constant.

    2. -
      stored_allocator_type & get_stored_allocator() noexcept;
      +
      stored_allocator_type & get_stored_allocator() noexcept;

      Effects: Returns a reference to the internal allocator.

      Throws: Nothing

      Complexity: Constant.

      Note: Non-standard extension.

    3. -
      const stored_allocator_type & get_stored_allocator() const noexcept;
      +
      const stored_allocator_type & get_stored_allocator() const noexcept;

      Effects: Returns a reference to the internal allocator.

      Throws: Nothing

      Complexity: Constant.

      Note: Non-standard extension.

    4. -
      iterator begin() noexcept;
      +
      iterator begin() noexcept;

      Effects: Returns an iterator to the first element contained in the container.

      Throws: Nothing.

      Complexity: Constant.

    5. -
      const_iterator begin() const noexcept;
      +
      const_iterator begin() const noexcept;

      Effects: Returns a const_iterator to the first element contained in the container.

      Throws: Nothing.

      Complexity: Constant.

    6. -
      iterator end() noexcept;
      +
      iterator end() noexcept;

      Effects: Returns an iterator to the end of the container.

      Throws: Nothing.

      Complexity: Constant.

    7. -
      const_iterator end() const noexcept;
      +
      const_iterator end() const noexcept;

      Effects: Returns a const_iterator to the end of the container.

      Throws: Nothing.

      Complexity: Constant.

    8. -
      reverse_iterator rbegin() noexcept;
      +
      reverse_iterator rbegin() noexcept;

      Effects: Returns a reverse_iterator pointing to the beginning of the reversed container.

      Throws: Nothing.

      Complexity: Constant.

    9. -
      const_reverse_iterator rbegin() const noexcept;
      +
      const_reverse_iterator rbegin() const noexcept;

      Effects: Returns a const_reverse_iterator pointing to the beginning of the reversed container.

      Throws: Nothing.

      Complexity: Constant.

    10. -
      reverse_iterator rend() noexcept;
      +
      reverse_iterator rend() noexcept;

      Effects: Returns a reverse_iterator pointing to the end of the reversed container.

      Throws: Nothing.

      Complexity: Constant.

    11. -
      const_reverse_iterator rend() const noexcept;
      +
      const_reverse_iterator rend() const noexcept;

      Effects: Returns a const_reverse_iterator pointing to the end of the reversed container.

      Throws: Nothing.

      Complexity: Constant.

    12. -
      const_iterator cbegin() const noexcept;
      +
      const_iterator cbegin() const noexcept;

      Effects: Returns a const_iterator to the first element contained in the container.

      Throws: Nothing.

      Complexity: Constant.

    13. -
      const_iterator cend() const noexcept;
      +
      const_iterator cend() const noexcept;

      Effects: Returns a const_iterator to the end of the container.

      Throws: Nothing.

      Complexity: Constant.

    14. -
      const_reverse_iterator crbegin() const noexcept;
      +
      const_reverse_iterator crbegin() const noexcept;

      Effects: Returns a const_reverse_iterator pointing to the beginning of the reversed container.

      Throws: Nothing.

      Complexity: Constant.

    15. -
      const_reverse_iterator crend() const noexcept;
      +
      const_reverse_iterator crend() const noexcept;

      Effects: Returns a const_reverse_iterator pointing to the end of the reversed container.

      Throws: Nothing.

      Complexity: Constant.

    16. -
      bool empty() const noexcept;
      +
      bool empty() const noexcept;

      Effects: Returns true if the container contains no elements.

      Throws: Nothing.

      Complexity: Constant.

    17. -
      size_type size() const noexcept;
      +
      size_type size() const noexcept;

      Effects: Returns the number of the elements contained in the container.

      Throws: Nothing.

      Complexity: Constant.

    18. -
      size_type max_size() const noexcept;
      +
      size_type max_size() const noexcept;

      Effects: Returns the largest possible size of the container.

      Throws: Nothing.

      Complexity: Constant.

    19. -
      size_type capacity() const noexcept;
      +
      size_type capacity() const noexcept;

      Effects: Number of elements for which memory has been allocated. capacity() is always greater than or equal to size().

      Throws: Nothing.

      Complexity: Constant.

    20. -
      void reserve(size_type cnt);
      +
      void reserve(size_type cnt);

      Effects: If n is less than or equal to capacity(), or the underlying container has no reserve member, this call has no effect. Otherwise, it is a request for allocation of additional memory. If the request is successful, then capacity() is greater than or equal to n; otherwise, capacity() is unchanged. In either case, size() is unchanged.

      Throws: If memory allocation allocation throws or T's copy constructor throws.

      Note: If capacity() is less than "cnt", iterators and references to to values might be invalidated.

    21. -
      void shrink_to_fit();
      +
      void shrink_to_fit();
      Effects: Tries to deallocate the excess of memory created

      Throws: If memory allocation throws, or Key's copy constructor throws.

      Complexity: Linear to size().

    22. -
      template<class... Args> std::pair< iterator, bool > emplace(Args &&... args);
      +
      template<class... Args> std::pair< iterator, bool > emplace(Args &&... args);

      Effects: Inserts an object x of type Key constructed with std::forward<Args>(args)... if and only if there is no element in the container with key equivalent to the key of x.

      Returns: The bool component of the returned pair is true if and only if the insertion takes place, and the iterator component of the pair points to the element with key equivalent to the key of x.

      Complexity: Logarithmic search time plus linear insertion to the elements with bigger keys than x.

      @@ -499,35 +499,35 @@ 
    23. template<class... Args> 
-  iterator emplace_hint(const_iterator p, Args &&... args);
      + iterator emplace_hint(const_iterator p, Args &&... args);

      Effects: Inserts an object of type Key constructed with std::forward<Args>(args)... in the container if and only if there is no element in the container with key equivalent to the key of x. p is a hint pointing to where the insert should start to search.

      Returns: An iterator pointing to the element with key equivalent to the key of x.

      Complexity: Logarithmic search time (constant if x is inserted right before p) plus insertion linear to the elements with bigger keys than x.

      Note: If an element is inserted it might invalidate elements.

    24. -
      std::pair< iterator, bool > insert(const value_type & x);
      +
      std::pair< iterator, bool > insert(const value_type & x);

      Effects: Inserts x if and only if there is no element in the container with key equivalent to the key of x.

      Returns: The bool component of the returned pair is true if and only if the insertion takes place, and the iterator component of the pair points to the element with key equivalent to the key of x.

      Complexity: Logarithmic search time plus linear insertion to the elements with bigger keys than x.

      Note: If an element is inserted it might invalidate elements.

    25. -
      std::pair< iterator, bool > insert(value_type && x);
      +
      std::pair< iterator, bool > insert(value_type && x);

      Effects: Inserts a new value_type move constructed from the pair if and only if there is no element in the container with key equivalent to the key of x.

      Returns: The bool component of the returned pair is true if and only if the insertion takes place, and the iterator component of the pair points to the element with key equivalent to the key of x.

      Complexity: Logarithmic search time plus linear insertion to the elements with bigger keys than x.

      Note: If an element is inserted it might invalidate elements.

    26. -
      iterator insert(const_iterator p, const value_type & x);
      +
      iterator insert(const_iterator p, const value_type & x);

      Effects: Inserts a copy of x in the container if and only if there is no element in the container with key equivalent to the key of x. p is a hint pointing to where the insert should start to search.

      Returns: An iterator pointing to the element with key equivalent to the key of x.

      Complexity: Logarithmic search time (constant if x is inserted right before p) plus insertion linear to the elements with bigger keys than x.

      Note: If an element is inserted it might invalidate elements.

    27. -
      iterator insert(const_iterator p, value_type && x);
      +
      iterator insert(const_iterator p, value_type && x);

      Effects: Inserts an element move constructed from x in the container. p is a hint pointing to where the insert should start to search.

      Returns: An iterator pointing to the element with key equivalent to the key of x.

      Complexity: Logarithmic search time (constant if x is inserted right before p) plus insertion linear to the elements with bigger keys than x.

      @@ -535,36 +535,36 @@ 
    28. template<typename InputIterator> 
-  void insert(InputIterator first, InputIterator last);
      + void insert(InputIterator first, InputIterator last);

      Requires: first, last are not iterators into *this.

      Effects: inserts each element from the range [first,last) if and only if there is no element with key equivalent to the key of that element.

      -

      Complexity: At most N log(size()+N) (N is the distance from first to last) search time plus N*size() insertion time.

      +

      Complexity: N log(N).

      Note: If an element is inserted it might invalidate elements. 

    29. template<typename InputIterator> 
-  void insert(ordered_unique_range_t, InputIterator first, InputIterator last);
      + void insert(ordered_unique_range_t, InputIterator first, InputIterator last);

      Requires: first, last are not iterators into *this and must be ordered according to the predicate and must be unique values.

      Effects: inserts each element from the range [first,last) .This function is more efficient than the normal range creation for ordered ranges.

      -

      Complexity: At most N log(size()+N) (N is the distance from first to last) search time plus N*size() insertion time.

      +

      Complexity: Linear.

      Note: Non-standard extension. If an element is inserted it might invalidate elements.

    30. -
      void insert(std::initializer_list< value_type > il);
      +
      void insert(std::initializer_list< value_type > il);

      Effects: inserts each element from the range [il.begin(), il.end()) if and only if there is no element with key equivalent to the key of that element.

      -

      Complexity: At most N log(size()+N) (N is the distance from il.begin() to il.end()) search time plus N*size() insertion time.

      +

      Complexity: N log(N).

      Note: If an element is inserted it might invalidate elements.

    31. -
      void insert(ordered_unique_range_t, std::initializer_list< value_type > il);
      +
      void insert(ordered_unique_range_t, std::initializer_list< value_type > il);

      Requires: Range [il.begin(), il.end()) must be ordered according to the predicate and must be unique values.

      Effects: inserts each element from the range [il.begin(), il.end()) .This function is more efficient than the normal range creation for ordered ranges.

      -

      Complexity: At most N log(size()+N) (N is the distance from il.begin() to il.end()) search time plus N*size() insertion time.

      +

      Complexity: Linear.

      Note: Non-standard extension. If an element is inserted it might invalidate elements. 

    32. template<typename C2> 
-  void merge(flat_set< Key, C2, AllocatorOrContainer > & source);
      + void merge(flat_set< Key, C2, AllocatorOrContainer > & source);

      Requires: this->get_allocator() == source.get_allocator().

      Effects: Attempts to extract each element in source and insert it into a using the comparison object of *this. If there is an element in a with key equivalent to the key of an element from source, then that element is not extracted from source.

      Postcondition: Pointers and references to the transferred elements of source refer to those same elements but as members of *this. Iterators referring to the transferred elements will continue to refer to their elements, but they now behave as iterators into *this, not into source.

      @@ -573,7 +573,7 @@ 
    33. template<typename C2> 
-  void merge(flat_set< Key, C2, AllocatorOrContainer > && source);
      + void merge(flat_set< Key, C2, AllocatorOrContainer > && source);

      Requires: this->get_allocator() == source.get_allocator().

      Effects: Attempts to extract each element in source and insert it into a using the comparison object of *this. If there is an element in a with key equivalent to the key of an element from source, then that element is not extracted from source.

      Postcondition: Pointers and references to the transferred elements of source refer to those same elements but as members of *this. Iterators referring to the transferred elements will continue to refer to their elements, but they now behave as iterators into *this, not into source.

      @@ -582,7 +582,7 @@ 
    34. template<typename C2> 
-  void merge(flat_multiset< Key, C2, AllocatorOrContainer > & source);
      + void merge(flat_multiset< Key, C2, AllocatorOrContainer > & source);

      Requires: this->get_allocator() == source.get_allocator().

      Effects: Attempts to extract each element in source and insert it into a using the comparison object of *this. If there is an element in a with key equivalent to the key of an element from source, then that element is not extracted from source.

      Postcondition: Pointers and references to the transferred elements of source refer to those same elements but as members of *this. Iterators referring to the transferred elements will continue to refer to their elements, but they now behave as iterators into *this, not into source.

      @@ -591,7 +591,7 @@ 
    35. template<typename C2> 
-  void merge(flat_multiset< Key, C2, AllocatorOrContainer > && source);
      + void merge(flat_multiset< Key, C2, AllocatorOrContainer > && source);

      Requires: this->get_allocator() == source.get_allocator().

      Effects: Attempts to extract each element in source and insert it into a using the comparison object of *this. If there is an element in a with key equivalent to the key of an element from source, then that element is not extracted from source.

      Postcondition: Pointers and references to the transferred elements of source refer to those same elements but as members of *this. Iterators referring to the transferred elements will continue to refer to their elements, but they now behave as iterators into *this, not into source.

      @@ -599,59 +599,59 @@

      Complexity: N log(a.size() + N) (N has the value source.size())

    36. -
      iterator erase(const_iterator p);
      +
      iterator erase(const_iterator p);

      Effects: Erases the element pointed to by p.

      Returns: Returns an iterator pointing to the element immediately following q prior to the element being erased. If no such element exists, returns end().

      Complexity: Linear to the elements with keys bigger than p

      Note: Invalidates elements with keys not less than the erased element.

    37. -
      size_type erase(const key_type & x);
      +
      size_type erase(const key_type & x);

      Effects: Erases all elements in the container with key equivalent to x.

      Returns: Returns the number of erased elements.

      Complexity: Logarithmic search time plus erasure time linear to the elements with bigger keys.

    38. -
      iterator erase(const_iterator first, const_iterator last);
      +
      iterator erase(const_iterator first, const_iterator last);

      Effects: Erases all the elements in the range [first, last).

      Returns: Returns last.

      Complexity: size()*N where N is the distance from first to last.

      Complexity: Logarithmic search time plus erasure time linear to the elements with bigger keys.

    39. -
      void swap(flat_set & x) noexcept(allocator_traits_type::is_always_equal::value &&boost::container::container_detail::is_nothrow_swappable< Compare >::value));
      +
      void swap(flat_set & x) noexcept(allocator_traits_type::is_always_equal::value &&boost::container::dtl::is_nothrow_swappable< Compare >::value));

      Effects: Swaps the contents of *this and x.

      Throws: Nothing.

      Complexity: Constant.

    40. -
      void clear() noexcept;
      +
      void clear() noexcept;

      Effects: erase(a.begin(),a.end()).

      Postcondition: size() == 0.

      Complexity: linear in size().

    41. -
      key_compare key_comp() const;
      +
      key_compare key_comp() const;

      Effects: Returns the comparison object out of which a was constructed.

      Complexity: Constant.

    42. -
      value_compare value_comp() const;
      +
      value_compare value_comp() const;

      Effects: Returns an object of value_compare constructed out of the comparison object.

      Complexity: Constant.

    43. -
      iterator find(const key_type & x);
      +
      iterator find(const key_type & x);

      Returns: An iterator pointing to an element with the key equivalent to x, or end() if such an element is not found.

      Complexity: Logarithmic.

    44. -
      const_iterator find(const key_type & x) const;
      +
      const_iterator find(const key_type & x) const;

      Returns: A const_iterator pointing to an element with the key equivalent to x, or end() if such an element is not found.

      Complexity: Logarithmic.

    45. -
      iterator nth(size_type n) noexcept;
      +
      iterator nth(size_type n) noexcept;

      Requires: size() >= n.

      Effects: Returns an iterator to the nth element from the beginning of the container. Returns end() if n == size().

      Throws: Nothing.

      @@ -659,7 +659,7 @@

      Note: Non-standard extension

    46. -
      const_iterator nth(size_type n) const noexcept;
      +
      const_iterator nth(size_type n) const noexcept;

      Requires: size() >= n.

      Effects: Returns a const_iterator to the nth element from the beginning of the container. Returns end() if n == size().

      Throws: Nothing.

      @@ -667,7 +667,7 @@

      Note: Non-standard extension

    47. -
      size_type index_of(iterator p) noexcept;
      +
      size_type index_of(iterator p) noexcept;

      Requires: begin() <= p <= end().

      Effects: Returns the index of the element pointed by p and size() if p == end().

      Throws: Nothing.

      @@ -675,7 +675,7 @@

      Note: Non-standard extension

    48. -
      size_type index_of(const_iterator p) const noexcept;
      +
      size_type index_of(const_iterator p) const noexcept;

      Requires: begin() <= p <= end().

      Effects: Returns the index of the element pointed by p and size() if p == end().

      Throws: Nothing.

      @@ -683,56 +683,56 @@

      Note: Non-standard extension

    49. -
      size_type count(const key_type & x) const;
      +
      size_type count(const key_type & x) const;

      Returns: The number of elements with key equivalent to x.

      Complexity: log(size())+count(k)

    50. -
      iterator lower_bound(const key_type & x);
      +
      iterator lower_bound(const key_type & x);

      Returns: An iterator pointing to the first element with key not less than k, or a.end() if such an element is not found.

      Complexity: Logarithmic

    51. -
      const_iterator lower_bound(const key_type & x) const;
      +
      const_iterator lower_bound(const key_type & x) const;

      Returns: A const iterator pointing to the first element with key not less than k, or a.end() if such an element is not found.

      Complexity: Logarithmic

    52. -
      iterator upper_bound(const key_type & x);
      +
      iterator upper_bound(const key_type & x);

      Returns: An iterator pointing to the first element with key not less than x, or end() if such an element is not found.

      Complexity: Logarithmic

    53. -
      const_iterator upper_bound(const key_type & x) const;
      +
      const_iterator upper_bound(const key_type & x) const;

      Returns: A const iterator pointing to the first element with key not less than x, or end() if such an element is not found.

      Complexity: Logarithmic 

    54. std::pair< const_iterator, const_iterator > 
-equal_range(const key_type & x) const;
      +equal_range(const key_type & x) const;

      Effects: Equivalent to std::make_pair(this->lower_bound(k), this->upper_bound(k)).

      Complexity: Logarithmic

    55. -
      std::pair< iterator, iterator > equal_range(const key_type & x);
      +
      std::pair< iterator, iterator > equal_range(const key_type & x);

      Effects: Equivalent to std::make_pair(this->lower_bound(k), this->upper_bound(k)).

      Complexity: Logarithmic

    56. -
      sequence_type extract_sequence();
      +
      sequence_type extract_sequence();

      Effects: Extracts the internal sequence container.

      Complexity: Same as the move constructor of sequence_type, usually constant.

      Postcondition: this->empty()

      Throws: If secuence_type's move constructor throws

    57. -
      void adopt_sequence(sequence_type && seq);
      +
      void adopt_sequence(sequence_type && seq);

      Effects: Discards the internally hold sequence container and adopts the one passed externally using the move assignment. Erases non-unique elements.

      Complexity: Assuming O(1) move assignment, O(NlogN) with N = seq.size()

      Throws: If the comparison or the move constructor throws

    58. -
      void adopt_sequence(ordered_unique_range_t, sequence_type && seq);
      +
      void adopt_sequence(ordered_unique_range_t, sequence_type && seq);

      Requires: seq shall be ordered according to this->compare() and shall contain unique elements.

      Effects: Discards the internally hold sequence container and adopts the one passed externally using the move assignment.

      Complexity: Assuming O(1) move assignment, O(1)

      @@ -741,41 +741,41 @@
    -

    -flat_set friend functions

    +

    +flat_set friend functions

    1. -
      friend bool operator==(const flat_set & x, const flat_set & y);
      +
      friend bool operator==(const flat_set & x, const flat_set & y);

      Effects: Returns true if x and y are equal

      Complexity: Linear to the number of elements in the container.

    2. -
      friend bool operator!=(const flat_set & x, const flat_set & y);
      +
      friend bool operator!=(const flat_set & x, const flat_set & y);

      Effects: Returns true if x and y are unequal

      Complexity: Linear to the number of elements in the container.

    3. -
      friend bool operator<(const flat_set & x, const flat_set & y);
      +
      friend bool operator<(const flat_set & x, const flat_set & y);

      Effects: Returns true if x is less than y

      Complexity: Linear to the number of elements in the container.

    4. -
      friend bool operator>(const flat_set & x, const flat_set & y);
      +
      friend bool operator>(const flat_set & x, const flat_set & y);

      Effects: Returns true if x is greater than y

      Complexity: Linear to the number of elements in the container.

    5. -
      friend bool operator<=(const flat_set & x, const flat_set & y);
      +
      friend bool operator<=(const flat_set & x, const flat_set & y);

      Effects: Returns true if x is equal or less than y

      Complexity: Linear to the number of elements in the container.

    6. -
      friend bool operator>=(const flat_set & x, const flat_set & y);
      +
      friend bool operator>=(const flat_set & x, const flat_set & y);

      Effects: Returns true if x is equal or greater than y

      Complexity: Linear to the number of elements in the container.

    7. -
      friend void swap(flat_set & x, flat_set & y);
      +
      friend void swap(flat_set & x, flat_set & y);

      Effects: x.swap(y)

      Complexity: Constant.

      8. @@ -785,7 +785,8 @@
    -
    Copyright © 2009-2015 Ion Gaztanaga

    +

    Copyright © 2009-2017 Ion + Gaztanaga

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost/container/growth_factor.html b/doc/html/boost/container/growth_factor.html new file mode 100644 index 0000000000..b80b884302 --- /dev/null +++ b/doc/html/boost/container/growth_factor.html @@ -0,0 +1,72 @@ + + + + +Struct template growth_factor + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Struct template growth_factor

    +

    boost::container::growth_factor — defined(BOOST_CONTAINER_DOXYGEN_INVOKED)

    +
    +

    Synopsis

    +
    // In header: <boost/container/options.hpp>
+
+template<typename GrowthFactor> 
+struct growth_factor {
+};
    +
    +

    Description

    +

    This option setter specifies the growth factor strategy of the underlying vector.

    +

    +Predefined growth factors that can be passed as arguments to this option are: boost::container::growth_factor_50 boost::container::growth_factor_60 boost::container::growth_factor_100

    +

    If this option is not specified, a default will be used by the container.

    +
    +

    Template Parameters

    +
    1. +
      typename GrowthFactor
      +

      A function object that has the following signature:
      +
      + template<class SizeType>
      + SizeType operator()(SizeType cur_cap, SizeType add_min_cap, SizeType max_cap) const;.
      +
      + cur_cap is the current capacity, add_min_cap is the minimum additional capacity we want to achieve and max_cap is the maximum capacity that the allocator or other factors allow. The implementation should return a value between cur_cap + add_min_cap and max_cap. cur_cap + add_min_cap is guaranteed not to overflow/wraparound, but the implementation should handle wraparound produced by the growth factor.

      +
    +
    +
    +
    + + + +
    Copyright © 2009-2017 Ion + Gaztanaga

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/container/growth_factor_100.html b/doc/html/boost/container/growth_factor_100.html new file mode 100644 index 0000000000..cd2aeb7bda --- /dev/null +++ b/doc/html/boost/container/growth_factor_100.html @@ -0,0 +1,57 @@ + + + + +Struct growth_factor_100 + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Struct growth_factor_100

    +

    boost::container::growth_factor_100

    +
    +

    Synopsis

    +
    // In header: <boost/container/options.hpp>
+
+
+struct growth_factor_100 {
+};
    +
    +

    Description

    +

    This growth factor argument specifies that the container should increase it's capacity a 100% (doubling its capacity) when existing capacity is exhausted.

    +
    +
    + + + +
    Copyright © 2009-2017 Ion + Gaztanaga

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/container/growth_factor_50.html b/doc/html/boost/container/growth_factor_50.html new file mode 100644 index 0000000000..747cb60bd4 --- /dev/null +++ b/doc/html/boost/container/growth_factor_50.html @@ -0,0 +1,57 @@ + + + + +Struct growth_factor_50 + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Struct growth_factor_50

    +

    boost::container::growth_factor_50 — defined(BOOST_CONTAINER_DOXYGEN_INVOKED)

    +
    +

    Synopsis

    +
    // In header: <boost/container/options.hpp>
+
+
+struct growth_factor_50 {
+};
    +
    +

    Description

    +

    This growth factor argument specifies that the container should increase it's capacity a 50% when existing capacity is exhausted.

    +
    +
    + + + +
    Copyright © 2009-2017 Ion + Gaztanaga

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/container/growth_factor_60.html b/doc/html/boost/container/growth_factor_60.html new file mode 100644 index 0000000000..b44fde2887 --- /dev/null +++ b/doc/html/boost/container/growth_factor_60.html @@ -0,0 +1,57 @@ + + + + +Struct growth_factor_60 + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Struct growth_factor_60

    +

    boost::container::growth_factor_60

    +
    +

    Synopsis

    +
    // In header: <boost/container/options.hpp>
+
+
+struct growth_factor_60 {
+};
    +
    +

    Description

    +

    This growth factor argument specifies that the container should increase it's capacity a 60% when existing capacity is exhausted.

    +
    +
    + + + +
    Copyright © 2009-2017 Ion + Gaztanaga

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/container/insert_return_type_base.html b/doc/html/boost/container/insert_return_type_base.html index ecc32087ef..e67f343d03 100644 --- a/doc/html/boost/container/insert_return_type_base.html +++ b/doc/html/boost/container/insert_return_type_base.html @@ -35,11 +35,11 @@ template<typename Iterator, typename NodeType> struct insert_return_type_base { // construct/copy/destruct - insert_return_type_base(); - insert_return_type_base(insert_return_type_base &&); + insert_return_type_base(); + insert_return_type_base(insert_return_type_base &&); template<typename RelatedIt, typename RelatedNode> - insert_return_type_base(bool, RelatedIt, RelatedNode &&); - insert_return_type_base & operator=(insert_return_type_base &&); + insert_return_type_base(bool, RelatedIt, RelatedNode &&); + insert_return_type_base & operator=(insert_return_type_base &&); // public data members bool inserted; @@ -47,7 +47,7 @@ NodeType node; };
    -

    Description

    +

    Description

    A class template used to describe the results of inserting a Container::node_type in a Container with unique keys. Includes at least the following non-static public data members:

    • bool inserted;

      • @@ -58,23 +58,24 @@

      This type is MoveConstructible, MoveAssignable, DefaultConstructible, Destructible, and lvalues of that type are swappable

      -

      +

      insert_return_type_base public construct/copy/destruct

        -
      1. insert_return_type_base();
        2. -
      2. insert_return_type_base(insert_return_type_base && other);
        3. +
      3. insert_return_type_base();
        4. +
      4. insert_return_type_base(insert_return_type_base && other);
      5. template<typename RelatedIt, typename RelatedNode> 
-  insert_return_type_base(bool insert, RelatedIt it, RelatedNode && node);
        6. -
      6. insert_return_type_base & operator=(insert_return_type_base && other);
        7. + insert_return_type_base(bool insert, RelatedIt it, RelatedNode && node); +
      7. insert_return_type_base & operator=(insert_return_type_base && other);
    -
    Copyright © 2009-2015 Ion Gaztanaga

    +

    Copyright © 2009-2017 Ion + Gaztanaga

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost/container/list.html b/doc/html/boost/container/list.html index f26b96915f..e2ed75fab9 100644 --- a/doc/html/boost/container/list.html +++ b/doc/html/boost/container/list.html @@ -33,7 +33,8 @@ 
    // In header: <boost/container/list.hpp>
 
 template<typename T, typename Allocator = new_allocator<T> > 
-class list {
+class list : protected dtl::node_alloc_holder< Allocator, dtl::intrusive_list_type< Allocator >::type >
+{
 public:
   // types
   typedef T                                                                  value_type;            
@@ -51,108 +52,108 @@
   typedef implementation_defined                                             const_reverse_iterator;
 
   // construct/copy/destruct
-  list() noexcept(container_detail::is_nothrow_default_constructible< Allocator >::value));
-  explicit list(const allocator_type &) noexcept;
-  explicit list(size_type);
-  list(size_type, const allocator_type &);
-  list(size_type, const T &, const Allocator & = Allocator());
-  list(const list &);
-  list(list &&) noexcept;
-  list(const list &, const allocator_type &);
-  list(list &&, const allocator_type &);
-  template<typename InpIt> list(InpIt, InpIt, const Allocator & = Allocator());
-  list(std::initializer_list< value_type >, const Allocator & = Allocator());
-  list & operator=(const list &);
-  list & operator=(list &&) noexcept(allocator_traits_type::propagate_on_container_move_assignment::value||allocator_traits_type::is_always_equal::value));
-  list & operator=(std::initializer_list< value_type >);
-  ~list();
+  list() noexcept(dtl::is_nothrow_default_constructible< Allocator >::value));
+  explicit list(const allocator_type &) noexcept;
+  explicit list(size_type);
+  list(size_type, const allocator_type &);
+  list(size_type, const T &, const Allocator & = Allocator());
+  list(const list &);
+  list(list &&) noexcept;
+  list(const list &, const allocator_type &);
+  list(list &&, const allocator_type &);
+  template<typename InpIt> list(InpIt, InpIt, const Allocator & = Allocator());
+  list(std::initializer_list< value_type >, const Allocator & = Allocator());
+  list & operator=(const list &);
+  list & operator=(list &&) noexcept(allocator_traits_type::propagate_on_container_move_assignment::value||allocator_traits_type::is_always_equal::value));
+  list & operator=(std::initializer_list< value_type >);
+  ~list();
 
-  // public member functions
-  void assign(size_type, const T &);
-  template<typename InpIt> void assign(InpIt, InpIt);
-  void assign(std::initializer_list< value_type >);
-  allocator_type get_allocator() const noexcept;
-  stored_allocator_type & get_stored_allocator() noexcept;
-  const stored_allocator_type & get_stored_allocator() const noexcept;
-  iterator begin() noexcept;
-  const_iterator begin() const noexcept;
-  iterator end() noexcept;
-  const_iterator end() const noexcept;
-  reverse_iterator rbegin() noexcept;
-  const_reverse_iterator rbegin() const noexcept;
-  reverse_iterator rend() noexcept;
-  const_reverse_iterator rend() const noexcept;
-  const_iterator cbegin() const noexcept;
-  const_iterator cend() const noexcept;
-  const_reverse_iterator crbegin() const noexcept;
-  const_reverse_iterator crend() const noexcept;
-  bool empty() const noexcept;
-  size_type size() const noexcept;
-  size_type max_size() const noexcept;
-  void resize(size_type);
-  void resize(size_type, const T &);
-  reference front() noexcept;
-  const_reference front() const noexcept;
-  reference back() noexcept;
-  const_reference back() const noexcept;
-  template<class... Args> reference emplace_back(Args &&...);
-  template<class... Args> reference emplace_front(Args &&...);
-  template<class... Args> iterator emplace(const_iterator, Args &&...);
-  void push_front(const T &);
-  void push_front(T &&);
-  void push_back(const T &);
-  void push_back(T &&);
-  iterator insert(const_iterator, const T &);
-  iterator insert(const_iterator, T &&);
-  iterator insert(const_iterator, size_type, const T &);
-  template<typename InpIt> iterator insert(const_iterator, InpIt, InpIt);
-  iterator insert(const_iterator, std::initializer_list< value_type >);
-  void pop_front() noexcept;
-  void pop_back() noexcept;
-  iterator erase(const_iterator) noexcept;
-  iterator erase(const_iterator, const_iterator) noexcept;
-  void swap(list &) noexcept(allocator_traits_type::propagate_on_container_swap::value||allocator_traits_type::is_always_equal::value));
-  void clear() noexcept;
-  void splice(const_iterator, list &) noexcept;
-  void splice(const_iterator, list &&) noexcept;
-  void splice(const_iterator, list &, const_iterator) noexcept;
-  void splice(const_iterator, list &&, const_iterator) noexcept;
-  void splice(const_iterator, list &, const_iterator, const_iterator) noexcept;
-  void splice(const_iterator, list &&, const_iterator, const_iterator) noexcept;
-  void splice(const_iterator, list &, const_iterator, const_iterator, 
+  // public member functions
+  void assign(size_type, const T &);
+  template<typename InpIt> void assign(InpIt, InpIt);
+  void assign(std::initializer_list< value_type >);
+  allocator_type get_allocator() const noexcept;
+  stored_allocator_type & get_stored_allocator() noexcept;
+  const stored_allocator_type & get_stored_allocator() const noexcept;
+  iterator begin() noexcept;
+  const_iterator begin() const noexcept;
+  iterator end() noexcept;
+  const_iterator end() const noexcept;
+  reverse_iterator rbegin() noexcept;
+  const_reverse_iterator rbegin() const noexcept;
+  reverse_iterator rend() noexcept;
+  const_reverse_iterator rend() const noexcept;
+  const_iterator cbegin() const noexcept;
+  const_iterator cend() const noexcept;
+  const_reverse_iterator crbegin() const noexcept;
+  const_reverse_iterator crend() const noexcept;
+  bool empty() const noexcept;
+  size_type size() const noexcept;
+  size_type max_size() const noexcept;
+  void resize(size_type);
+  void resize(size_type, const T &);
+  reference front() noexcept;
+  const_reference front() const noexcept;
+  reference back() noexcept;
+  const_reference back() const noexcept;
+  template<class... Args> reference emplace_back(Args &&...);
+  template<class... Args> reference emplace_front(Args &&...);
+  template<class... Args> iterator emplace(const_iterator, Args &&...);
+  void push_front(const T &);
+  void push_front(T &&);
+  void push_back(const T &);
+  void push_back(T &&);
+  iterator insert(const_iterator, const T &);
+  iterator insert(const_iterator, T &&);
+  iterator insert(const_iterator, size_type, const T &);
+  template<typename InpIt> iterator insert(const_iterator, InpIt, InpIt);
+  iterator insert(const_iterator, std::initializer_list< value_type >);
+  void pop_front() noexcept;
+  void pop_back() noexcept;
+  iterator erase(const_iterator) noexcept;
+  iterator erase(const_iterator, const_iterator) noexcept;
+  void swap(list &) noexcept(allocator_traits_type::propagate_on_container_swap::value||allocator_traits_type::is_always_equal::value));
+  void clear() noexcept;
+  void splice(const_iterator, list &) noexcept;
+  void splice(const_iterator, list &&) noexcept;
+  void splice(const_iterator, list &, const_iterator) noexcept;
+  void splice(const_iterator, list &&, const_iterator) noexcept;
+  void splice(const_iterator, list &, const_iterator, const_iterator) noexcept;
+  void splice(const_iterator, list &&, const_iterator, const_iterator) noexcept;
+  void splice(const_iterator, list &, const_iterator, const_iterator, 
               size_type) noexcept;
-  void splice(const_iterator, list &&, const_iterator, const_iterator, 
+  void splice(const_iterator, list &&, const_iterator, const_iterator, 
               size_type) noexcept;
-  void remove(const T &);
-  template<typename Pred> void remove_if(Pred);
-  void unique();
-  template<typename BinaryPredicate> void unique(BinaryPredicate);
-  void merge(list &);
-  void merge(list &&);
+  void remove(const T &);
+  template<typename Pred> void remove_if(Pred);
+  void unique();
+  template<typename BinaryPredicate> void unique(BinaryPredicate);
+  void merge(list &);
+  void merge(list &&);
   template<typename StrictWeakOrdering> 
-    void merge(list &, const StrictWeakOrdering &);
+    void merge(list &, const StrictWeakOrdering &);
   template<typename StrictWeakOrdering> 
-    void merge(list &&, StrictWeakOrdering);
-  void sort();
-  template<typename StrictWeakOrdering> void sort(StrictWeakOrdering);
-  void reverse() noexcept;
+    void merge(list &&, StrictWeakOrdering);
+  void sort();
+  template<typename StrictWeakOrdering> void sort(StrictWeakOrdering);
+  void reverse() noexcept;
 
-  // friend functions
-  friend bool operator==(const list &, const list &);
-  friend bool operator!=(const list &, const list &);
-  friend bool operator<(const list &, const list &);
-  friend bool operator>(const list &, const list &);
-  friend bool operator<=(const list &, const list &);
-  friend bool operator>=(const list &, const list &);
-  friend void swap(list &, list &);
+  // friend functions
+  friend bool operator==(const list &, const list &);
+  friend bool operator!=(const list &, const list &);
+  friend bool operator<(const list &, const list &);
+  friend bool operator>(const list &, const list &);
+  friend bool operator<=(const list &, const list &);
+  friend bool operator>=(const list &, const list &);
+  friend void swap(list &, list &);
 };
    -

    Description

    +

    Description

    A list is a doubly linked list. That is, it is a Sequence that supports both forward and backward traversal, and (amortized) constant time insertion and removal of elements at the beginning or the end, or in the middle. Lists have the important property that insertion and splicing do not invalidate iterators to list elements, and that even removal invalidates only the iterators that point to the elements that are removed. The ordering of iterators may be changed (that is, list<T>::iterator might have a different predecessor or successor after a list operation than it did before), but the iterators themselves will not be invalidated or made to point to different elements unless that invalidation or mutation is explicit.

    -

    Template Parameters

    +

    Template Parameters

    1. typename T
      @@ -165,104 +166,104 @@
    -

    +

    list public construct/copy/destruct

    1. -
      list() noexcept(container_detail::is_nothrow_default_constructible< Allocator >::value));
      +
      list() noexcept(dtl::is_nothrow_default_constructible< Allocator >::value));

      Effects: Default constructs a list.

      Throws: If allocator_type's default constructor throws.

      Complexity: Constant.

    2. -
      explicit list(const allocator_type & a) noexcept;
      +
      explicit list(const allocator_type & a) noexcept;

      Effects: Constructs a list taking the allocator as parameter.

      Throws: Nothing

      Complexity: Constant.

    3. -
      explicit list(size_type n);
      +
      explicit list(size_type n);

      Effects: Constructs a list and inserts n value-initialized value_types.

      Throws: If allocator_type's default constructor throws or T's default or copy constructor throws.

      Complexity: Linear to n.

    4. -
      list(size_type n, const allocator_type & a);
      +
      list(size_type n, const allocator_type & a);

      Effects: Constructs a list that will use a copy of allocator a and inserts n copies of value.

      Throws: If allocator_type's default constructor throws or T's default or copy constructor throws.

      Complexity: Linear to n.

    5. -
      list(size_type n, const T & value, const Allocator & a = Allocator());
      +
      list(size_type n, const T & value, const Allocator & a = Allocator());

      Effects: Constructs a list that will use a copy of allocator a and inserts n copies of value.

      Throws: If allocator_type's default constructor throws or T's default or copy constructor throws.

      Complexity: Linear to n.

    6. -
      list(const list & x);
      +
      list(const list & x);

      Effects: Copy constructs a list.

      Postcondition: x == *this.

      Throws: If allocator_type's default constructor throws.

      Complexity: Linear to the elements x contains.

    7. -
      list(list && x) noexcept;
      +
      list(list && x) noexcept;

      Effects: Move constructor. Moves x's resources to *this.

      Throws: If allocator_type's copy constructor throws.

      Complexity: Constant.

    8. -
      list(const list & x, const allocator_type & a);
      +
      list(const list & x, const allocator_type & a);

      Effects: Copy constructs a list using the specified allocator.

      Postcondition: x == *this.

      Throws: If allocator_type's default constructor or copy constructor throws.

      Complexity: Linear to the elements x contains.

    9. -
      list(list && x, const allocator_type & a);
      +
      list(list && x, const allocator_type & a);

      Effects: Move constructor sing the specified allocator. Moves x's resources to *this.

      Throws: If allocation or value_type's copy constructor throws.

      Complexity: Constant if a == x.get_allocator(), linear otherwise. 

    10. template<typename InpIt> 
-  list(InpIt first, InpIt last, const Allocator & a = Allocator());
      + list(InpIt first, InpIt last, const Allocator & a = Allocator());

      Effects: Constructs a list that will use a copy of allocator a and inserts a copy of the range [first, last) in the list.

      Throws: If allocator_type's default constructor throws or T's constructor taking a dereferenced InIt throws.

      Complexity: Linear to the range [first, last).

    11. -
      list(std::initializer_list< value_type > il, 
+
      list(std::initializer_list< value_type > il, 
      const Allocator & a = Allocator());
      
 
      Effects: Constructs a list that will use a copy of allocator a and inserts a copy of the range [il.begin(), il.end()) in the list.
      
 
      Throws: If allocator_type's default constructor throws or T's constructor taking a dereferenced std::initializer_list iterator throws.
      
 
      Complexity: Linear to the range [il.begin(), il.end()).
    12. -
      list & operator=(const list & x);
      +
      list & operator=(const list & x);

      Effects: Makes *this contain the same elements as x.

      Postcondition: this->size() == x.size(). *this contains a copy of each of x's elements.

      Throws: If memory allocation throws or T's copy constructor throws.

      Complexity: Linear to the number of elements in x.

    13. -
      list & operator=(list && x) noexcept(allocator_traits_type::propagate_on_container_move_assignment::value||allocator_traits_type::is_always_equal::value));
      +
      list & operator=(list && x) noexcept(allocator_traits_type::propagate_on_container_move_assignment::value||allocator_traits_type::is_always_equal::value));

      Effects: Move assignment. All x's values are transferred to *this.

      Postcondition: x.empty(). *this contains a the elements x had before the function.

      Throws: If allocator_traits_type::propagate_on_container_move_assignment is false and (allocation throws or value_type's move constructor throws)

      Complexity: Constant if allocator_traits_type:: propagate_on_container_move_assignment is true or this->get>allocator() == x.get_allocator(). Linear otherwise.

    14. -
      list & operator=(std::initializer_list< value_type > il);
      +
      list & operator=(std::initializer_list< value_type > il);

      Effects: Makes *this contain the same elements as il.

      Postcondition: this->size() == il.size(). *this contains a copy of each of x's elements.

      Throws: If memory allocation throws or T's copy constructor throws.

      Complexity: Linear to the number of elements in x.

    15. -
      ~list();
      +
      ~list();

      Effects: Destroys the list. All stored values are destroyed and used memory is deallocated.

      Throws: Nothing.

      Complexity: Linear to the number of elements.

      @@ -270,186 +271,186 @@
    -

    -list public member functions

    +

    +list public member functions

    1. -
      void assign(size_type n, const T & val);
      +
      void assign(size_type n, const T & val);

      Effects: Assigns the n copies of val to *this.

      Throws: If memory allocation throws or T's copy constructor throws.

      Complexity: Linear to n.

    2. -
      template<typename InpIt> void assign(InpIt first, InpIt last);
      +
      template<typename InpIt> void assign(InpIt first, InpIt last);

      Effects: Assigns the range [first, last) to *this.

      Throws: If memory allocation throws or T's constructor from dereferencing InpIt throws.

      Complexity: Linear to n.

    3. -
      void assign(std::initializer_list< value_type > il);
      +
      void assign(std::initializer_list< value_type > il);

      Effects: Assigns the range [il.begin(), il.end()) to *this.

      Throws: If memory allocation throws or T's constructor from dereferencing std::initializer_list iterator throws.

      Complexity: Linear to n.

    4. -
      allocator_type get_allocator() const noexcept;
      +
      allocator_type get_allocator() const noexcept;

      Effects: Returns a copy of the internal allocator.

      Throws: If allocator's copy constructor throws.

      Complexity: Constant.

    5. -
      stored_allocator_type & get_stored_allocator() noexcept;
      +
      stored_allocator_type & get_stored_allocator() noexcept;

      Effects: Returns a reference to the internal allocator.

      Throws: Nothing

      Complexity: Constant.

      Note: Non-standard extension.

    6. -
      const stored_allocator_type & get_stored_allocator() const noexcept;
      +
      const stored_allocator_type & get_stored_allocator() const noexcept;

      Effects: Returns a reference to the internal allocator.

      Throws: Nothing

      Complexity: Constant.

      Note: Non-standard extension.

    7. -
      iterator begin() noexcept;
      +
      iterator begin() noexcept;

      Effects: Returns an iterator to the first element contained in the list.

      Throws: Nothing.

      Complexity: Constant.

    8. -
      const_iterator begin() const noexcept;
      +
      const_iterator begin() const noexcept;

      Effects: Returns a const_iterator to the first element contained in the list.

      Throws: Nothing.

      Complexity: Constant.

    9. -
      iterator end() noexcept;
      +
      iterator end() noexcept;

      Effects: Returns an iterator to the end of the list.

      Throws: Nothing.

      Complexity: Constant.

    10. -
      const_iterator end() const noexcept;
      +
      const_iterator end() const noexcept;

      Effects: Returns a const_iterator to the end of the list.

      Throws: Nothing.

      Complexity: Constant.

    11. -
      reverse_iterator rbegin() noexcept;
      +
      reverse_iterator rbegin() noexcept;

      Effects: Returns a reverse_iterator pointing to the beginning of the reversed list.

      Throws: Nothing.

      Complexity: Constant.

    12. -
      const_reverse_iterator rbegin() const noexcept;
      +
      const_reverse_iterator rbegin() const noexcept;

      Effects: Returns a const_reverse_iterator pointing to the beginning of the reversed list.

      Throws: Nothing.

      Complexity: Constant.

    13. -
      reverse_iterator rend() noexcept;
      +
      reverse_iterator rend() noexcept;

      Effects: Returns a reverse_iterator pointing to the end of the reversed list.

      Throws: Nothing.

      Complexity: Constant.

    14. -
      const_reverse_iterator rend() const noexcept;
      +
      const_reverse_iterator rend() const noexcept;

      Effects: Returns a const_reverse_iterator pointing to the end of the reversed list.

      Throws: Nothing.

      Complexity: Constant.

    15. -
      const_iterator cbegin() const noexcept;
      +
      const_iterator cbegin() const noexcept;

      Effects: Returns a const_iterator to the first element contained in the list.

      Throws: Nothing.

      Complexity: Constant.

    16. -
      const_iterator cend() const noexcept;
      +
      const_iterator cend() const noexcept;

      Effects: Returns a const_iterator to the end of the list.

      Throws: Nothing.

      Complexity: Constant.

    17. -
      const_reverse_iterator crbegin() const noexcept;
      +
      const_reverse_iterator crbegin() const noexcept;

      Effects: Returns a const_reverse_iterator pointing to the beginning of the reversed list.

      Throws: Nothing.

      Complexity: Constant.

    18. -
      const_reverse_iterator crend() const noexcept;
      +
      const_reverse_iterator crend() const noexcept;

      Effects: Returns a const_reverse_iterator pointing to the end of the reversed list.

      Throws: Nothing.

      Complexity: Constant.

    19. -
      bool empty() const noexcept;
      +
      bool empty() const noexcept;

      Effects: Returns true if the list contains no elements.

      Throws: Nothing.

      Complexity: Constant.

    20. -
      size_type size() const noexcept;
      +
      size_type size() const noexcept;

      Effects: Returns the number of the elements contained in the list.

      Throws: Nothing.

      Complexity: Constant.

    21. -
      size_type max_size() const noexcept;
      +
      size_type max_size() const noexcept;

      Effects: Returns the largest possible size of the list.

      Throws: Nothing.

      Complexity: Constant.

    22. -
      void resize(size_type new_size);
      +
      void resize(size_type new_size);

      Effects: Inserts or erases elements at the end such that the size becomes n. New elements are value initialized.

      Throws: If memory allocation throws, or T's copy constructor throws.

      Complexity: Linear to the difference between size() and new_size.

    23. -
      void resize(size_type new_size, const T & x);
      +
      void resize(size_type new_size, const T & x);

      Effects: Inserts or erases elements at the end such that the size becomes n. New elements are copy constructed from x.

      Throws: If memory allocation throws, or T's copy constructor throws.

      Complexity: Linear to the difference between size() and new_size.

    24. -
      reference front() noexcept;
      +
      reference front() noexcept;

      Requires: !empty()

      Effects: Returns a reference to the first element from the beginning of the container.

      Throws: Nothing.

      Complexity: Constant.

    25. -
      const_reference front() const noexcept;
      +
      const_reference front() const noexcept;

      Requires: !empty()

      Effects: Returns a const reference to the first element from the beginning of the container.

      Throws: Nothing.

      Complexity: Constant.

    26. -
      reference back() noexcept;
      +
      reference back() noexcept;

      Requires: !empty()

      Effects: Returns a reference to the first element from the beginning of the container.

      Throws: Nothing.

      Complexity: Constant.

    27. -
      const_reference back() const noexcept;
      +
      const_reference back() const noexcept;

      Requires: !empty()

      Effects: Returns a const reference to the first element from the beginning of the container.

      Throws: Nothing.

      Complexity: Constant.

    28. -
      template<class... Args> reference emplace_back(Args &&... args);
      +
      template<class... Args> reference emplace_back(Args &&... args);

      Effects: Inserts an object of type T constructed with std::forward<Args>(args)... in the end of the list.

      Returns: A reference to the created object.

      Throws: If memory allocation throws or T's in-place constructor throws.

      Complexity: Constant

    29. -
      template<class... Args> reference emplace_front(Args &&... args);
      +
      template<class... Args> reference emplace_front(Args &&... args);

      Effects: Inserts an object of type T constructed with std::forward<Args>(args)... in the beginning of the list.

      Returns: A reference to the created object.

      Throws: If memory allocation throws or T's in-place constructor throws.

      @@ -457,37 +458,37 @@ 
    30. template<class... Args> 
-  iterator emplace(const_iterator position, Args &&... args);
      + iterator emplace(const_iterator position, Args &&... args);

      Effects: Inserts an object of type T constructed with std::forward<Args>(args)... before p.

      Throws: If memory allocation throws or T's in-place constructor throws.

      Complexity: Constant

    31. -
      void push_front(const T & x);
      +
      void push_front(const T & x);

      Effects: Inserts a copy of x at the beginning of the list.

      Throws: If memory allocation throws or T's copy constructor throws.

      Complexity: Amortized constant time.

    32. -
      void push_front(T && x);
      +
      void push_front(T && x);

      Effects: Constructs a new element in the beginning of the list and moves the resources of x to this new element.

      Throws: If memory allocation throws.

      Complexity: Amortized constant time.

    33. -
      void push_back(const T & x);
      +
      void push_back(const T & x);

      Effects: Inserts a copy of x at the end of the list.

      Throws: If memory allocation throws or T's copy constructor throws.

      Complexity: Amortized constant time.

    34. -
      void push_back(T && x);
      +
      void push_back(T && x);

      Effects: Constructs a new element in the end of the list and moves the resources of x to this new element.

      Throws: If memory allocation throws.

      Complexity: Amortized constant time.

    35. -
      iterator insert(const_iterator p, const T & x);
      +
      iterator insert(const_iterator p, const T & x);

      Requires: p must be a valid iterator of *this.

      Effects: Insert a copy of x before p.

      Returns: an iterator to the inserted element.

      @@ -495,7 +496,7 @@

      Complexity: Amortized constant time.

    36. -
      iterator insert(const_iterator p, T && x);
      +
      iterator insert(const_iterator p, T && x);

      Requires: p must be a valid iterator of *this.

      Effects: Insert a new element before p with x's resources.

      Returns: an iterator to the inserted element.

      @@ -503,7 +504,7 @@

      Complexity: Amortized constant time.

    37. -
      iterator insert(const_iterator position, size_type n, const T & x);
      +
      iterator insert(const_iterator position, size_type n, const T & x);

      Requires: p must be a valid iterator of *this.

      Effects: Inserts n copies of x before p.

      Returns: an iterator to the first inserted element or p if n is 0.

      @@ -512,7 +513,7 @@ 
    38. template<typename InpIt> 
-  iterator insert(const_iterator p, InpIt first, InpIt last);
      + iterator insert(const_iterator p, InpIt first, InpIt last);

      Requires: p must be a valid iterator of *this.

      Effects: Insert a copy of the [first, last) range before p.

      Returns: an iterator to the first inserted element or p if first == last.

      @@ -520,7 +521,7 @@

      Complexity: Linear to distance [first, last).

    39. -
      iterator insert(const_iterator p, std::initializer_list< value_type > il);
      +
      iterator insert(const_iterator p, std::initializer_list< value_type > il);

      Requires: p must be a valid iterator of *this.

      Effects: Insert a copy of the [il.begin(), il.end()) range before p.

      Returns: an iterator to the first inserted element or p if if.begin() == il.end().

      @@ -528,45 +529,45 @@

      Complexity: Linear to distance [il.begin(), il.end()).

    40. -
      void pop_front() noexcept;
      +
      void pop_front() noexcept;

      Effects: Removes the first element from the list.

      Throws: Nothing.

      Complexity: Amortized constant time.

    41. -
      void pop_back() noexcept;
      +
      void pop_back() noexcept;

      Effects: Removes the last element from the list.

      Throws: Nothing.

      Complexity: Amortized constant time.

    42. -
      iterator erase(const_iterator p) noexcept;
      +
      iterator erase(const_iterator p) noexcept;

      Requires: p must be a valid iterator of *this.

      Effects: Erases the element at p.

      Throws: Nothing.

      Complexity: Amortized constant time.

    43. -
      iterator erase(const_iterator first, const_iterator last) noexcept;
      +
      iterator erase(const_iterator first, const_iterator last) noexcept;

      Requires: first and last must be valid iterator to elements in *this.

      Effects: Erases the elements pointed by [first, last).

      Throws: Nothing.

      Complexity: Linear to the distance between first and last.

    44. -
      void swap(list & x) noexcept(allocator_traits_type::propagate_on_container_swap::value||allocator_traits_type::is_always_equal::value));
      +
      void swap(list & x) noexcept(allocator_traits_type::propagate_on_container_swap::value||allocator_traits_type::is_always_equal::value));

      Effects: Swaps the contents of *this and x.

      Throws: Nothing.

      Complexity: Constant.

    45. -
      void clear() noexcept;
      +
      void clear() noexcept;

      Effects: Erases all the elements of the list.

      Throws: Nothing.

      Complexity: Linear to the number of elements in the list.

    46. -
      void splice(const_iterator p, list & x) noexcept;
      +
      void splice(const_iterator p, list & x) noexcept;

      Requires: p must point to an element contained by the list. x != *this. this' allocator and x's allocator shall compare equal

      Effects: Transfers all the elements of list x to this list, before the the element pointed by p. No destructors or copy constructors are called.

      Throws: Nothing

      @@ -574,7 +575,7 @@

      Note: Iterators of values obtained from list x now point to elements of this list. Iterators of this list and all the references are not invalidated.

    47. -
      void splice(const_iterator p, list && x) noexcept;
      +
      void splice(const_iterator p, list && x) noexcept;

      Requires: p must point to an element contained by the list. x != *this. this' allocator and x's allocator shall compare equal

      Effects: Transfers all the elements of list x to this list, before the the element pointed by p. No destructors or copy constructors are called.

      Throws: Nothing

      @@ -582,7 +583,7 @@

      Note: Iterators of values obtained from list x now point to elements of this list. Iterators of this list and all the references are not invalidated.

    48. -
      void splice(const_iterator p, list & x, const_iterator i) noexcept;
      +
      void splice(const_iterator p, list & x, const_iterator i) noexcept;

      Requires: p must point to an element contained by this list. i must point to an element contained in list x. this' allocator and x's allocator shall compare equal

      Effects: Transfers the value pointed by i, from list x to this list, before the element pointed by p. No destructors or copy constructors are called. If p == i or p == ++i, this function is a null operation.

      Throws: Nothing

      @@ -590,7 +591,7 @@

      Note: Iterators of values obtained from list x now point to elements of this list. Iterators of this list and all the references are not invalidated.

    49. -
      void splice(const_iterator p, list && x, const_iterator i) noexcept;
      +
      void splice(const_iterator p, list && x, const_iterator i) noexcept;

      Requires: p must point to an element contained by this list. i must point to an element contained in list x. this' allocator and x's allocator shall compare equal.

      Effects: Transfers the value pointed by i, from list x to this list, before the element pointed by p. No destructors or copy constructors are called. If p == i or p == ++i, this function is a null operation.

      Throws: Nothing

      @@ -598,7 +599,7 @@

      Note: Iterators of values obtained from list x now point to elements of this list. Iterators of this list and all the references are not invalidated.

    50. -
      void splice(const_iterator p, list & x, const_iterator first, 
+
      void splice(const_iterator p, list & x, const_iterator first, 
             const_iterator last) noexcept;
      
 
      Requires: p must point to an element contained by this list. first and last must point to elements contained in list x. this' allocator and x's allocator shall compare equal
      
 
      Effects: Transfers the range pointed by first and last from list x to this list, before the element pointed by p. No destructors or copy constructors are called.
      
@@ -607,7 +608,7 @@
 
      Note: Iterators of values obtained from list x now point to elements of this list. Iterators of this list and all the references are not invalidated.
    51. -
      void splice(const_iterator p, list && x, const_iterator first, 
+
      void splice(const_iterator p, list && x, const_iterator first, 
             const_iterator last) noexcept;
      
 
      Requires: p must point to an element contained by this list. first and last must point to elements contained in list x. this' allocator and x's allocator shall compare equal.
      
 
      Effects: Transfers the range pointed by first and last from list x to this list, before the element pointed by p. No destructors or copy constructors are called.
      
@@ -616,7 +617,7 @@
 
      Note: Iterators of values obtained from list x now point to elements of this list. Iterators of this list and all the references are not invalidated.
    52. -
      void splice(const_iterator p, list & x, const_iterator first, 
+
      void splice(const_iterator p, list & x, const_iterator first, 
             const_iterator last, size_type n) noexcept;
      
 
      Requires: p must point to an element contained by this list. first and last must point to elements contained in list x. n == distance(first, last). this' allocator and x's allocator shall compare equal
      
 
      Effects: Transfers the range pointed by first and last from list x to this list, before the element pointed by p. No destructors or copy constructors are called.
      
@@ -626,7 +627,7 @@
 
      Note: Non-standard extension
    53. -
      void splice(const_iterator p, list && x, const_iterator first, 
+
      void splice(const_iterator p, list && x, const_iterator first, 
             const_iterator last, size_type n) noexcept;
      
 
      Requires: p must point to an element contained by this list. first and last must point to elements contained in list x. n == distance(first, last). this' allocator and x's allocator shall compare equal
      
 
      Effects: Transfers the range pointed by first and last from list x to this list, before the element pointed by p. No destructors or copy constructors are called.
      
@@ -636,42 +637,42 @@
 
      Note: Non-standard extension
    54. -
      void remove(const T & value);
      +
      void remove(const T & value);

      Effects: Removes all the elements that compare equal to value.

      Throws: If comparison throws.

      Complexity: Linear time. It performs exactly size() comparisons for equality.

      Note: The relative order of elements that are not removed is unchanged, and iterators to elements that are not removed remain valid.

    55. -
      template<typename Pred> void remove_if(Pred pred);
      +
      template<typename Pred> void remove_if(Pred pred);

      Effects: Removes all the elements for which a specified predicate is satisfied.

      Throws: If pred throws.

      Complexity: Linear time. It performs exactly size() calls to the predicate.

      Note: The relative order of elements that are not removed is unchanged, and iterators to elements that are not removed remain valid.

    56. -
      void unique();
      +
      void unique();

      Effects: Removes adjacent duplicate elements or adjacent elements that are equal from the list.

      Throws: If comparison throws.

      Complexity: Linear time (size()-1 comparisons equality comparisons).

      Note: The relative order of elements that are not removed is unchanged, and iterators to elements that are not removed remain valid.

    57. -
      template<typename BinaryPredicate> void unique(BinaryPredicate binary_pred);
      +
      template<typename BinaryPredicate> void unique(BinaryPredicate binary_pred);

      Effects: Removes adjacent duplicate elements or adjacent elements that satisfy some binary predicate from the list.

      Throws: If pred throws.

      Complexity: Linear time (size()-1 comparisons calls to pred()).

      Note: The relative order of elements that are not removed is unchanged, and iterators to elements that are not removed remain valid.

    58. -
      void merge(list & x);
      +
      void merge(list & x);

      Requires: The lists x and *this must be distinct.

      Effects: This function removes all of x's elements and inserts them in order into *this according to std::less<value_type>. The merge is stable; that is, if an element from *this is equivalent to one from x, then the element from *this will precede the one from x.

      Throws: If comparison throws.

      Complexity: This function is linear time: it performs at most size() + x.size() - 1 comparisons.

    59. -
      void merge(list && x);
      +
      void merge(list && x);

      Requires: The lists x and *this must be distinct.

      Effects: This function removes all of x's elements and inserts them in order into *this according to std::less<value_type>. The merge is stable; that is, if an element from *this is equivalent to one from x, then the element from *this will precede the one from x.

      Throws: If comparison throws.

      @@ -679,7 +680,7 @@ 
    60. template<typename StrictWeakOrdering> 
-  void merge(list & x, const StrictWeakOrdering & comp);
      + void merge(list & x, const StrictWeakOrdering & comp);

      Requires: p must be a comparison function that induces a strict weak ordering and both *this and x must be sorted according to that ordering The lists x and *this must be distinct.

      Effects: This function removes all of x's elements and inserts them in order into *this. The merge is stable; that is, if an element from *this is equivalent to one from x, then the element from *this will precede the one from x.

      Throws: If comp throws.

      @@ -688,7 +689,7 @@ 
    61. template<typename StrictWeakOrdering> 
-  void merge(list && x, StrictWeakOrdering comp);
      + void merge(list && x, StrictWeakOrdering comp);

      Requires: p must be a comparison function that induces a strict weak ordering and both *this and x must be sorted according to that ordering The lists x and *this must be distinct.

      Effects: This function removes all of x's elements and inserts them in order into *this. The merge is stable; that is, if an element from *this is equivalent to one from x, then the element from *this will precede the one from x.

      Throws: If comp throws.

      @@ -696,21 +697,21 @@

      Note: Iterators and references to *this are not invalidated.

    62. -
      void sort();
      +
      void sort();

      Effects: This function sorts the list *this according to std::less<value_type>. The sort is stable, that is, the relative order of equivalent elements is preserved.

      Throws: If comparison throws.

      Notes: Iterators and references are not invalidated.

      Complexity: The number of comparisons is approximately N log N, where N is the list's size.

    63. -
      template<typename StrictWeakOrdering> void sort(StrictWeakOrdering comp);
      +
      template<typename StrictWeakOrdering> void sort(StrictWeakOrdering comp);

      Effects: This function sorts the list *this according to std::less<value_type>. The sort is stable, that is, the relative order of equivalent elements is preserved.

      Throws: If comp throws.

      Notes: Iterators and references are not invalidated.

      Complexity: The number of comparisons is approximately N log N, where N is the list's size.

    64. -
      void reverse() noexcept;
      +
      void reverse() noexcept;

      Effects: Reverses the order of elements in the list.

      Throws: Nothing.

      Complexity: This function is linear time.

      @@ -719,41 +720,41 @@
    -

    -list friend functions

    +

    +list friend functions

    1. -
      friend bool operator==(const list & x, const list & y);
      +
      friend bool operator==(const list & x, const list & y);

      Effects: Returns true if x and y are equal

      Complexity: Linear to the number of elements in the container.

    2. -
      friend bool operator!=(const list & x, const list & y);
      +
      friend bool operator!=(const list & x, const list & y);

      Effects: Returns true if x and y are unequal

      Complexity: Linear to the number of elements in the container.

    3. -
      friend bool operator<(const list & x, const list & y);
      +
      friend bool operator<(const list & x, const list & y);

      Effects: Returns true if x is less than y

      Complexity: Linear to the number of elements in the container.

    4. -
      friend bool operator>(const list & x, const list & y);
      +
      friend bool operator>(const list & x, const list & y);

      Effects: Returns true if x is greater than y

      Complexity: Linear to the number of elements in the container.

    5. -
      friend bool operator<=(const list & x, const list & y);
      +
      friend bool operator<=(const list & x, const list & y);

      Effects: Returns true if x is equal or less than y

      Complexity: Linear to the number of elements in the container.

    6. -
      friend bool operator>=(const list & x, const list & y);
      +
      friend bool operator>=(const list & x, const list & y);

      Effects: Returns true if x is equal or greater than y

      Complexity: Linear to the number of elements in the container.

    7. -
      friend void swap(list & x, list & y);
      +
      friend void swap(list & x, list & y);

      Effects: x.swap(y)

      Complexity: Constant.

      8. @@ -763,7 +764,8 @@
    -
    Copyright © 2009-2015 Ion Gaztanaga

    +

    Copyright © 2009-2017 Ion + Gaztanaga

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost/container/map.html b/doc/html/boost/container/map.html index 9b1d1b6b4e..8537bc016f 100644 --- a/doc/html/boost/container/map.html +++ b/doc/html/boost/container/map.html @@ -62,141 +62,141 @@ typedef implementation_defined insert_return_type; // construct/copy/destruct - map() noexcept(container_detail::is_nothrow_default_constructible< Allocator >::value &&container_detail::is_nothrow_default_constructible< Compare >::value)); - map(const Compare &, const allocator_type &); - explicit map(const Compare &); - explicit map(const allocator_type &); - template<typename InputIterator> map(InputIterator, InputIterator); + map() noexcept(dtl::is_nothrow_default_constructible< Allocator >::value &&dtl::is_nothrow_default_constructible< Compare >::value)); + map(const Compare &, const allocator_type &); + explicit map(const Compare &); + explicit map(const allocator_type &); + template<typename InputIterator> map(InputIterator, InputIterator); template<typename InputIterator> - map(InputIterator, InputIterator, const allocator_type &); + map(InputIterator, InputIterator, const allocator_type &); template<typename InputIterator> - map(InputIterator, InputIterator, const Compare &); + map(InputIterator, InputIterator, const Compare &); template<typename InputIterator> - map(InputIterator, InputIterator, const Compare &, const allocator_type &); + map(InputIterator, InputIterator, const Compare &, const allocator_type &); template<typename InputIterator> - map(ordered_unique_range_t, InputIterator, InputIterator); + map(ordered_unique_range_t, InputIterator, InputIterator); template<typename InputIterator> - map(ordered_unique_range_t, InputIterator, InputIterator, const Compare &); + map(ordered_unique_range_t, InputIterator, InputIterator, const Compare &); template<typename InputIterator> - map(ordered_unique_range_t, InputIterator, InputIterator, const Compare &, + map(ordered_unique_range_t, InputIterator, InputIterator, const Compare &, const allocator_type &); - map(std::initializer_list< value_type >); - map(std::initializer_list< value_type >, const Compare &); - map(std::initializer_list< value_type >, const allocator_type &); - map(std::initializer_list< value_type >, const Compare &, + map(std::initializer_list< value_type >); + map(std::initializer_list< value_type >, const Compare &); + map(std::initializer_list< value_type >, const allocator_type &); + map(std::initializer_list< value_type >, const Compare &, const allocator_type &); - map(ordered_unique_range_t, std::initializer_list< value_type >); - map(ordered_unique_range_t, std::initializer_list< value_type >, + map(ordered_unique_range_t, std::initializer_list< value_type >); + map(ordered_unique_range_t, std::initializer_list< value_type >, const Compare &); - map(ordered_unique_range_t, std::initializer_list< value_type >, + map(ordered_unique_range_t, std::initializer_list< value_type >, const Compare &, const allocator_type &); - map(const map &); - map(map &&) noexcept(boost::container::container_detail::is_nothrow_move_constructible< Compare >::value)); - map(const map &, const allocator_type &); - map(map &&, const allocator_type &); - map & operator=(const map &); - map & operator=(map &&) noexcept((allocator_traits_type::propagate_on_container_move_assignment::value||allocator_traits_type::is_always_equal::value)&&boost::container::container_detail::is_nothrow_move_assignable< Compare >::value)); - map & operator=(std::initializer_list< value_type >); + map(const map &); + map(map &&) noexcept(boost::container::dtl::is_nothrow_move_constructible< Compare >::value)); + map(const map &, const allocator_type &); + map(map &&, const allocator_type &); + map & operator=(const map &); + map & operator=(map &&) noexcept((allocator_traits_type::propagate_on_container_move_assignment::value||allocator_traits_type::is_always_equal::value)&&boost::container::dtl::is_nothrow_move_assignable< Compare >::value)); + map & operator=(std::initializer_list< value_type >); - // public member functions - BOOST_STATIC_ASSERT(unspecified); - allocator_type get_allocator() const; - stored_allocator_type & get_stored_allocator() noexcept; - const stored_allocator_type & get_stored_allocator() const noexcept; - iterator begin() noexcept; - const_iterator begin() const noexcept; - const_iterator cbegin() const noexcept; - iterator end() noexcept; - const_iterator end() const noexcept; - const_iterator cend() const noexcept; - reverse_iterator rbegin() noexcept; - const_reverse_iterator rbegin() const noexcept; - const_reverse_iterator crbegin() const noexcept; - reverse_iterator rend() noexcept; - const_reverse_iterator rend() const noexcept; - const_reverse_iterator crend() const noexcept; - bool empty() const noexcept; - size_type size() const noexcept; - size_type max_size() const noexcept; - mapped_type & operator[](const key_type &); - mapped_type & operator[](key_type &&); + // public member functions + BOOST_STATIC_ASSERT((dtl::is_same< typename allocator_type::value_type, std::pair< const Key, T > >::value)); + allocator_type get_allocator() const; + stored_allocator_type & get_stored_allocator() noexcept; + const stored_allocator_type & get_stored_allocator() const noexcept; + iterator begin() noexcept; + const_iterator begin() const noexcept; + const_iterator cbegin() const noexcept; + iterator end() noexcept; + const_iterator end() const noexcept; + const_iterator cend() const noexcept; + reverse_iterator rbegin() noexcept; + const_reverse_iterator rbegin() const noexcept; + const_reverse_iterator crbegin() const noexcept; + reverse_iterator rend() noexcept; + const_reverse_iterator rend() const noexcept; + const_reverse_iterator crend() const noexcept; + bool empty() const noexcept; + size_type size() const noexcept; + size_type max_size() const noexcept; + mapped_type & operator[](const key_type &); + mapped_type & operator[](key_type &&); template<typename M> - std::pair< iterator, bool > insert_or_assign(const key_type &, M &&); + std::pair< iterator, bool > insert_or_assign(const key_type &, M &&); template<typename M> - std::pair< iterator, bool > insert_or_assign(key_type &&, M &&); + std::pair< iterator, bool > insert_or_assign(key_type &&, M &&); template<typename M> - iterator insert_or_assign(const_iterator, const key_type &, M &&); + iterator insert_or_assign(const_iterator, const key_type &, M &&); template<typename M> - iterator insert_or_assign(const_iterator, key_type &&, M &&); - T & at(const key_type &); - const T & at(const key_type &) const; - std::pair< iterator, bool > insert(const value_type &); - std::pair< iterator, bool > insert(const nonconst_value_type &); - std::pair< iterator, bool > insert(nonconst_value_type &&); - std::pair< iterator, bool > insert(movable_value_type &&); - std::pair< iterator, bool > insert(value_type &&); - iterator insert(const_iterator, const value_type &); - iterator insert(const_iterator, nonconst_value_type &&); - iterator insert(const_iterator, movable_value_type &&); - iterator insert(const_iterator, const nonconst_value_type &); - iterator insert(const_iterator, value_type &&); - template<typename InputIterator> void insert(InputIterator, InputIterator); - void insert(std::initializer_list< value_type >); - insert_return_type insert(node_type &&); - insert_return_type insert(const_iterator, node_type &&); - template<class... Args> std::pair< iterator, bool > emplace(Args &&...); - template<class... Args> iterator emplace_hint(const_iterator, Args &&...); + iterator insert_or_assign(const_iterator, key_type &&, M &&); + T & at(const key_type &); + const T & at(const key_type &) const; + std::pair< iterator, bool > insert(const value_type &); + std::pair< iterator, bool > insert(const nonconst_value_type &); + std::pair< iterator, bool > insert(nonconst_value_type &&); + std::pair< iterator, bool > insert(movable_value_type &&); + std::pair< iterator, bool > insert(value_type &&); + iterator insert(const_iterator, const value_type &); + iterator insert(const_iterator, nonconst_value_type &&); + iterator insert(const_iterator, movable_value_type &&); + iterator insert(const_iterator, const nonconst_value_type &); + iterator insert(const_iterator, value_type &&); + template<typename InputIterator> void insert(InputIterator, InputIterator); + void insert(std::initializer_list< value_type >); + insert_return_type insert(node_type &&); + insert_return_type insert(const_iterator, node_type &&); + template<class... Args> std::pair< iterator, bool > emplace(Args &&...); + template<class... Args> iterator emplace_hint(const_iterator, Args &&...); template<class... Args> - std::pair< iterator, bool > try_emplace(const key_type &, Args &&...); + std::pair< iterator, bool > try_emplace(const key_type &, Args &&...); template<class... Args> - iterator try_emplace(const_iterator, const key_type &, Args &&...); + iterator try_emplace(const_iterator, const key_type &, Args &&...); template<class... Args> - std::pair< iterator, bool > try_emplace(key_type &&, Args &&...); + std::pair< iterator, bool > try_emplace(key_type &&, Args &&...); template<class... Args> - iterator try_emplace(const_iterator, key_type &&, Args &&...); - iterator erase(const_iterator) noexcept; - size_type erase(const key_type &) noexcept; - iterator erase(const_iterator, const_iterator) noexcept; - node_type extract(const key_type &); - node_type extract(const_iterator); - template<typename C2> void merge(map< Key, T, C2, Allocator, Options > &); - template<typename C2> void merge(map< Key, T, C2, Allocator, Options > &&); + iterator try_emplace(const_iterator, key_type &&, Args &&...); + iterator erase(const_iterator) noexcept; + size_type erase(const key_type &) noexcept; + iterator erase(const_iterator, const_iterator) noexcept; + node_type extract(const key_type &); + node_type extract(const_iterator); + template<typename C2> void merge(map< Key, T, C2, Allocator, Options > &); + template<typename C2> void merge(map< Key, T, C2, Allocator, Options > &&); template<typename C2> - void merge(multimap< Key, T, C2, Allocator, Options > &); + void merge(multimap< Key, T, C2, Allocator, Options > &); template<typename C2> - void merge(multimap< Key, T, C2, Allocator, Options > &&); - void swap(map &) noexcept(allocator_traits_type::is_always_equal::value &&boost::container::container_detail::is_nothrow_swappable< Compare >::value)); - key_compare key_comp() const; - value_compare value_comp() const; - iterator find(const key_type &); - const_iterator find(const key_type &) const; - size_type count(const key_type &) const; - iterator lower_bound(const key_type &); - const_iterator lower_bound(const key_type &) const; - iterator upper_bound(const key_type &); - const_iterator upper_bound(const key_type &) const; - std::pair< iterator, iterator > equal_range(const key_type &); + void merge(multimap< Key, T, C2, Allocator, Options > &&); + void swap(map &) noexcept(allocator_traits_type::is_always_equal::value &&boost::container::dtl::is_nothrow_swappable< Compare >::value)); + key_compare key_comp() const; + value_compare value_comp() const; + iterator find(const key_type &); + const_iterator find(const key_type &) const; + size_type count(const key_type &) const; + iterator lower_bound(const key_type &); + const_iterator lower_bound(const key_type &) const; + iterator upper_bound(const key_type &); + const_iterator upper_bound(const key_type &) const; + std::pair< iterator, iterator > equal_range(const key_type &); std::pair< const_iterator, const_iterator > - equal_range(const key_type &) const; - void rebalance(); + equal_range(const key_type &) const; + void rebalance(); - // friend functions - friend bool operator==(const map &, const map &); - friend bool operator!=(const map &, const map &); - friend bool operator<(const map &, const map &); - friend bool operator>(const map &, const map &); - friend bool operator<=(const map &, const map &); - friend bool operator>=(const map &, const map &); - friend void swap(map &, map &); + // friend functions + friend bool operator==(const map &, const map &); + friend bool operator!=(const map &, const map &); + friend bool operator<(const map &, const map &); + friend bool operator>(const map &, const map &); + friend bool operator<=(const map &, const map &); + friend bool operator>=(const map &, const map &); + friend void swap(map &, map &); };
    -

    Description

    +

    Description

    A map is a kind of associative container that supports unique keys (contains at most one of each key value) and provides for fast retrieval of values of another type T based on the keys. The map class supports bidirectional iterators.

    A map satisfies all of the requirements of a container and of a reversible container and of an associative container. The value_type stored by this container is the value_type is std::pair<const Key, T>.

    -

    Template Parameters

    +

    Template Parameters

    1. typename Key
      @@ -221,58 +221,58 @@
    -

    +

    map public construct/copy/destruct

    1. -
      map() noexcept(container_detail::is_nothrow_default_constructible< Allocator >::value &&container_detail::is_nothrow_default_constructible< Compare >::value));
      +
      map() noexcept(dtl::is_nothrow_default_constructible< Allocator >::value &&dtl::is_nothrow_default_constructible< Compare >::value));

      Effects: Default constructs an empty map.

      Complexity: Constant.

    2. -
      map(const Compare & comp, const allocator_type & a);
      +
      map(const Compare & comp, const allocator_type & a);

      Effects: Constructs an empty map using the specified comparison object and allocator.

      Complexity: Constant.

    3. -
      explicit map(const Compare & comp);
      +
      explicit map(const Compare & comp);

      Effects: Constructs an empty map using the specified comparison object.

      Complexity: Constant.

    4. -
      explicit map(const allocator_type & a);
      +
      explicit map(const allocator_type & a);

      Effects: Constructs an empty map using the specified allocator.

      Complexity: Constant.

    5. -
      template<typename InputIterator> map(InputIterator first, InputIterator last);
      +
      template<typename InputIterator> map(InputIterator first, InputIterator last);

      Effects: Constructs an empty map and inserts elements from the range [first ,last ).

      Complexity: Linear in N if the range [first ,last ) is already sorted using the predicate and otherwise N logN, where N is last - first. 

    6. template<typename InputIterator> 
-  map(InputIterator first, InputIterator last, const allocator_type & a);
      + map(InputIterator first, InputIterator last, const allocator_type & a);

      Effects: Constructs an empty map using the specified allocator, and inserts elements from the range [first ,last ).

      Complexity: Linear in N if the range [first ,last ) is already sorted using the predicate and otherwise N logN, where N is last - first. 

    7. template<typename InputIterator> 
-  map(InputIterator first, InputIterator last, const Compare & comp);
      + map(InputIterator first, InputIterator last, const Compare & comp);

      Effects: Constructs an empty map using the specified comparison object and inserts elements from the range [first ,last ).

      Complexity: Linear in N if the range [first ,last ) is already sorted using the predicate and otherwise N logN, where N is last - first. 

    8. template<typename InputIterator> 
-  map(InputIterator first, InputIterator last, const Compare & comp, 
+  map(InputIterator first, InputIterator last, const Compare & comp, 
       const allocator_type & a);

      Effects: Constructs an empty map using the specified comparison object and allocator, and inserts elements from the range [first ,last ).

      Complexity: Linear in N if the range [first ,last ) is already sorted using the predicate and otherwise N logN, where N is last - first. 

    9. template<typename InputIterator> 
-  map(ordered_unique_range_t, InputIterator first, InputIterator last);
      + map(ordered_unique_range_t, InputIterator first, InputIterator last);

      Effects: Constructs an empty map and inserts elements from the ordered unique range [first ,last). This function is more efficient than the normal range creation for ordered ranges.

      Requires: [first ,last) must be ordered according to the predicate and must be unique values.

      Complexity: Linear in N.

      @@ -280,7 +280,7 @@ 
    10. template<typename InputIterator> 
-  map(ordered_unique_range_t, InputIterator first, InputIterator last, 
+  map(ordered_unique_range_t, InputIterator first, InputIterator last, 
       const Compare & comp);

      Effects: Constructs an empty map using the specified comparison object and inserts elements from the ordered unique range [first ,last). This function is more efficient than the normal range creation for ordered ranges.

      Requires: [first ,last) must be ordered according to the predicate and must be unique values.

      @@ -289,7 +289,7 @@ 
    11. template<typename InputIterator> 
-  map(ordered_unique_range_t, InputIterator first, InputIterator last, 
+  map(ordered_unique_range_t, InputIterator first, InputIterator last, 
       const Compare & comp, const allocator_type & a);

      Effects: Constructs an empty map using the specified comparison object and allocator, and inserts elements from the ordered unique range [first ,last). This function is more efficient than the normal range creation for ordered ranges.

      Requires: [first ,last) must be ordered according to the predicate and must be unique values.

      @@ -297,35 +297,35 @@

      Note: Non-standard extension.

    12. -
      map(std::initializer_list< value_type > il);
      +
      map(std::initializer_list< value_type > il);

      Effects: Constructs an empty map and inserts elements from the range [il.begin(), il.end()).

      Complexity: Linear in N if the range [first ,last ) is already sorted according to the predicate and otherwise N logN, where N is il.first() - il.end().

    13. -
      map(std::initializer_list< value_type > il, const Compare & comp);
      +
      map(std::initializer_list< value_type > il, const Compare & comp);

      Effects: Constructs an empty map using the specified comparison object and inserts elements from the range [il.begin(), il.end()).

      Complexity: Linear in N if the range [first ,last ) is already sorted using the predicate and otherwise N logN, where N is il.first() - il.end().

    14. -
      map(std::initializer_list< value_type > il, const allocator_type & a);
      +
      map(std::initializer_list< value_type > il, const allocator_type & a);

      Effects: Constructs an empty map using the specified allocator, and inserts elements from the range [il.begin(), il.end()).

      Complexity: Linear in N if the range [first ,last ) is already sorted using the predicate and otherwise N logN, where N is il.first() - il.end().

    15. -
      map(std::initializer_list< value_type > il, const Compare & comp, 
+
      map(std::initializer_list< value_type > il, const Compare & comp, 
     const allocator_type & a);
      
 
      Effects: Constructs an empty map using the specified comparison object and allocator, and inserts elements from the range [il.begin(), il.end()).
      
 
      Complexity: Linear in N if the range [first ,last ) is already sorted using the predicate and otherwise N logN, where N is il.first() - il.end().
    16. -
      map(ordered_unique_range_t, std::initializer_list< value_type > il);
      +
      map(ordered_unique_range_t, std::initializer_list< value_type > il);

      Effects: Constructs an empty map and inserts elements from the ordered unique range [il.begin(), il.end()). This function is more efficient than the normal range creation for ordered ranges.

      Requires: [il.begin(), il.end()) must be ordered according to the predicate and must be unique values.

      Complexity: Linear in N.

      Note: Non-standard extension.

    17. -
      map(ordered_unique_range_t, std::initializer_list< value_type > il, 
+
      map(ordered_unique_range_t, std::initializer_list< value_type > il, 
     const Compare & comp);
      
 
      Effects: Constructs an empty map using the specified comparison object, and inserts elements from the ordered unique range [il.begin(), il.end()). This function is more efficient than the normal range creation for ordered ranges.
      
 
      Requires: [il.begin(), il.end()) must be ordered according to the predicate and must be unique values.
      
@@ -333,7 +333,7 @@
 
      Note: Non-standard extension.
    18. -
      map(ordered_unique_range_t, std::initializer_list< value_type > il, 
+
      map(ordered_unique_range_t, std::initializer_list< value_type > il, 
     const Compare & comp, const allocator_type & a);
      
 
      Effects: Constructs an empty map using the specified comparison object and allocator, and inserts elements from the ordered unique range [il.begin(), il.end()). This function is more efficient than the normal range creation for ordered ranges.
      
 
      Requires: [il.begin(), il.end()) must be ordered according to the predicate and must be unique values.
      
@@ -341,173 +341,173 @@
 
      Note: Non-standard extension.
    19. -
      map(const map & x);
      +
      map(const map & x);

      Effects: Copy constructs a map.

      Complexity: Linear in x.size().

    20. -
      map(map && x) noexcept(boost::container::container_detail::is_nothrow_move_constructible< Compare >::value));
      +
      map(map && x) noexcept(boost::container::dtl::is_nothrow_move_constructible< Compare >::value));

      Effects: Move constructs a map. Constructs *this using x's resources.

      Complexity: Constant.

      Postcondition: x is emptied.

    21. -
      map(const map & x, const allocator_type & a);
      +
      map(const map & x, const allocator_type & a);

      Effects: Copy constructs a map using the specified allocator.

      Complexity: Linear in x.size().

    22. -
      map(map && x, const allocator_type & a);
      +
      map(map && x, const allocator_type & a);

      Effects: Move constructs a map using the specified allocator. Constructs *this using x's resources.

      Complexity: Constant if x == x.get_allocator(), linear otherwise.

      Postcondition: x is emptied.

    23. -
      map & operator=(const map & x);
      +
      map & operator=(const map & x);

      Effects: Makes *this a copy of x.

      Complexity: Linear in x.size().

    24. -
      map & operator=(map && x) noexcept((allocator_traits_type::propagate_on_container_move_assignment::value||allocator_traits_type::is_always_equal::value)&&boost::container::container_detail::is_nothrow_move_assignable< Compare >::value));
      +
      map & operator=(map && x) noexcept((allocator_traits_type::propagate_on_container_move_assignment::value||allocator_traits_type::is_always_equal::value)&&boost::container::dtl::is_nothrow_move_assignable< Compare >::value));

      Effects: this->swap(x.get()).

      Throws: If allocator_traits_type::propagate_on_container_move_assignment is false and (allocation throws or value_type's move constructor throws)

      Complexity: Constant if allocator_traits_type:: propagate_on_container_move_assignment is true or this->get>allocator() == x.get_allocator(). Linear otherwise.

    25. -
      map & operator=(std::initializer_list< value_type > il);
      +
      map & operator=(std::initializer_list< value_type > il);

      Effects: Assign content of il to *this.

    -

    -map public member functions

    +

    +map public member functions

      -
    1.  BOOST_STATIC_ASSERT(unspecified);
      2. +
    2.  BOOST_STATIC_ASSERT((dtl::is_same< typename allocator_type::value_type, std::pair< const Key, T > >::value));
    3. -
      allocator_type get_allocator() const;
      +
      allocator_type get_allocator() const;

      Effects: Returns a copy of the allocator that was passed to the object's constructor.

      Complexity: Constant.

    4. -
      stored_allocator_type & get_stored_allocator() noexcept;
      +
      stored_allocator_type & get_stored_allocator() noexcept;

      Effects: Returns a reference to the internal allocator.

      Throws: Nothing

      Complexity: Constant.

      Note: Non-standard extension.

    5. -
      const stored_allocator_type & get_stored_allocator() const noexcept;
      +
      const stored_allocator_type & get_stored_allocator() const noexcept;

      Effects: Returns a reference to the internal allocator.

      Throws: Nothing

      Complexity: Constant.

      Note: Non-standard extension.

    6. -
      iterator begin() noexcept;
      +
      iterator begin() noexcept;

      Effects: Returns an iterator to the first element contained in the container.

      Throws: Nothing.

      Complexity: Constant.

    7. -
      const_iterator begin() const noexcept;
      +
      const_iterator begin() const noexcept;

      Effects: Returns a const_iterator to the first element contained in the container.

      Throws: Nothing.

      Complexity: Constant.

    8. -
      const_iterator cbegin() const noexcept;
      +
      const_iterator cbegin() const noexcept;

      Effects: Returns a const_iterator to the first element contained in the container.

      Throws: Nothing.

      Complexity: Constant.

    9. -
      iterator end() noexcept;
      +
      iterator end() noexcept;

      Effects: Returns an iterator to the end of the container.

      Throws: Nothing.

      Complexity: Constant.

    10. -
      const_iterator end() const noexcept;
      +
      const_iterator end() const noexcept;

      Effects: Returns a const_iterator to the end of the container.

      Throws: Nothing.

      Complexity: Constant.

    11. -
      const_iterator cend() const noexcept;
      +
      const_iterator cend() const noexcept;

      Effects: Returns a const_iterator to the end of the container.

      Throws: Nothing.

      Complexity: Constant.

    12. -
      reverse_iterator rbegin() noexcept;
      +
      reverse_iterator rbegin() noexcept;

      Effects: Returns a reverse_iterator pointing to the beginning of the reversed container.

      Throws: Nothing.

      Complexity: Constant.

    13. -
      const_reverse_iterator rbegin() const noexcept;
      +
      const_reverse_iterator rbegin() const noexcept;

      Effects: Returns a const_reverse_iterator pointing to the beginning of the reversed container.

      Throws: Nothing.

      Complexity: Constant.

    14. -
      const_reverse_iterator crbegin() const noexcept;
      +
      const_reverse_iterator crbegin() const noexcept;

      Effects: Returns a const_reverse_iterator pointing to the beginning of the reversed container.

      Throws: Nothing.

      Complexity: Constant.

    15. -
      reverse_iterator rend() noexcept;
      +
      reverse_iterator rend() noexcept;

      Effects: Returns a reverse_iterator pointing to the end of the reversed container.

      Throws: Nothing.

      Complexity: Constant.

    16. -
      const_reverse_iterator rend() const noexcept;
      +
      const_reverse_iterator rend() const noexcept;

      Effects: Returns a const_reverse_iterator pointing to the end of the reversed container.

      Throws: Nothing.

      Complexity: Constant.

    17. -
      const_reverse_iterator crend() const noexcept;
      +
      const_reverse_iterator crend() const noexcept;

      Effects: Returns a const_reverse_iterator pointing to the end of the reversed container.

      Throws: Nothing.

      Complexity: Constant.

    18. -
      bool empty() const noexcept;
      +
      bool empty() const noexcept;

      Effects: Returns true if the container contains no elements.

      Throws: Nothing.

      Complexity: Constant.

    19. -
      size_type size() const noexcept;
      +
      size_type size() const noexcept;

      Effects: Returns the number of the elements contained in the container.

      Throws: Nothing.

      Complexity: Constant.

    20. -
      size_type max_size() const noexcept;
      +
      size_type max_size() const noexcept;

      Effects: Returns the largest possible size of the container.

      Throws: Nothing.

      Complexity: Constant.

    21. -
      mapped_type & operator[](const key_type & k);
      +
      mapped_type & operator[](const key_type & k);

      Effects: If there is no key equivalent to x in the map, inserts value_type(x, T()) into the map.

      Returns: A reference to the mapped_type corresponding to x in *this.

      Complexity: Logarithmic.

    22. -
      mapped_type & operator[](key_type && k);
      +
      mapped_type & operator[](key_type && k);

      Effects: If there is no key equivalent to x in the map, inserts value_type(boost::move(x), T()) into the map (the key is move-constructed)

      Returns: A reference to the mapped_type corresponding to x in *this.

      Complexity: Logarithmic. 

    23. template<typename M> 
-  std::pair< iterator, bool > insert_or_assign(const key_type & k, M && obj);
      + std::pair< iterator, bool > insert_or_assign(const key_type & k, M && obj);

      Effects: If a key equivalent to k already exists in the container, assigns forward<M>(obj) to the mapped_type corresponding to the key k. If the key does not exist, inserts the new value as if by insert, constructing it from value_type(k, forward<M>(obj)).

      No iterators or references are invalidated. If the insertion is successful, pointers and references to the element obtained while it is held in the node handle are invalidated, and pointers and references obtained to that element before it was extracted become valid.

      Returns: The bool component is true if the insertion took place and false if the assignment took place. The iterator component is pointing at the element that was inserted or updated.

      @@ -515,7 +515,7 @@ 
    24. template<typename M> 
-  std::pair< iterator, bool > insert_or_assign(key_type && k, M && obj);
      + std::pair< iterator, bool > insert_or_assign(key_type && k, M && obj);

      Effects: If a key equivalent to k already exists in the container, assigns forward<M>(obj) to the mapped_type corresponding to the key k. If the key does not exist, inserts the new value as if by insert, constructing it from value_type(k, move(obj)).

      No iterators or references are invalidated. If the insertion is successful, pointers and references to the element obtained while it is held in the node handle are invalidated, and pointers and references obtained to that element before it was extracted become valid.

      Returns: The bool component is true if the insertion took place and false if the assignment took place. The iterator component is pointing at the element that was inserted or updated.

      @@ -523,7 +523,7 @@ 
    25. template<typename M> 
-  iterator insert_or_assign(const_iterator hint, const key_type & k, M && obj);
      + iterator insert_or_assign(const_iterator hint, const key_type & k, M && obj);

      Effects: If a key equivalent to k already exists in the container, assigns forward<M>(obj) to the mapped_type corresponding to the key k. If the key does not exist, inserts the new value as if by insert, constructing it from value_type(k, forward<M>(obj)) and the new element to the container as close as possible to the position just before hint.

      No iterators or references are invalidated. If the insertion is successful, pointers and references to the element obtained while it is held in the node handle are invalidated, and pointers and references obtained to that element before it was extracted become valid.

      Returns: The bool component is true if the insertion took place and false if the assignment took place. The iterator component is pointing at the element that was inserted or updated.

      @@ -531,120 +531,120 @@ 
    26. template<typename M> 
-  iterator insert_or_assign(const_iterator hint, key_type && k, M && obj);
      + iterator insert_or_assign(const_iterator hint, key_type && k, M && obj);

      Effects: If a key equivalent to k already exists in the container, assigns forward<M>(obj) to the mapped_type corresponding to the key k. If the key does not exist, inserts the new value as if by insert, constructing it from value_type(k, move(obj)) and the new element to the container as close as possible to the position just before hint.

      No iterators or references are invalidated. If the insertion is successful, pointers and references to the element obtained while it is held in the node handle are invalidated, and pointers and references obtained to that element before it was extracted become valid.

      Returns: The bool component is true if the insertion took place and false if the assignment took place. The iterator component is pointing at the element that was inserted or updated.

      Complexity: Logarithmic in the size of the container in general, but amortized constant if the new element is inserted just before hint.

    27. -
      T & at(const key_type & k);
      +
      T & at(const key_type & k);

      Returns: A reference to the element whose key is equivalent to x. Throws: An exception object of type out_of_range if no such element is present. Complexity: logarithmic.

    28. -
      const T & at(const key_type & k) const;
      +
      const T & at(const key_type & k) const;

      Returns: A reference to the element whose key is equivalent to x. Throws: An exception object of type out_of_range if no such element is present. Complexity: logarithmic.

    29. -
      std::pair< iterator, bool > insert(const value_type & x);
      +
      std::pair< iterator, bool > insert(const value_type & x);

      Effects: Inserts x if and only if there is no element in the container with key equivalent to the key of x.

      Returns: The bool component of the returned pair is true if and only if the insertion takes place, and the iterator component of the pair points to the element with key equivalent to the key of x.

      Complexity: Logarithmic.

    30. -
      std::pair< iterator, bool > insert(const nonconst_value_type & x);
      +
      std::pair< iterator, bool > insert(const nonconst_value_type & x);

      Effects: Inserts a new value_type created from the pair if and only if there is no element in the container with key equivalent to the key of x.

      Returns: The bool component of the returned pair is true if and only if the insertion takes place, and the iterator component of the pair points to the element with key equivalent to the key of x.

      Complexity: Logarithmic.

    31. -
      std::pair< iterator, bool > insert(nonconst_value_type && x);
      +
      std::pair< iterator, bool > insert(nonconst_value_type && x);

      Effects: Inserts a new value_type move constructed from the pair if and only if there is no element in the container with key equivalent to the key of x.

      Returns: The bool component of the returned pair is true if and only if the insertion takes place, and the iterator component of the pair points to the element with key equivalent to the key of x.

      Complexity: Logarithmic.

    32. -
      std::pair< iterator, bool > insert(movable_value_type && x);
      +
      std::pair< iterator, bool > insert(movable_value_type && x);

      Effects: Inserts a new value_type move constructed from the pair if and only if there is no element in the container with key equivalent to the key of x.

      Returns: The bool component of the returned pair is true if and only if the insertion takes place, and the iterator component of the pair points to the element with key equivalent to the key of x.

      Complexity: Logarithmic.

    33. -
      std::pair< iterator, bool > insert(value_type && x);
      +
      std::pair< iterator, bool > insert(value_type && x);

      Effects: Move constructs a new value from x if and only if there is no element in the container with key equivalent to the key of x.

      Returns: The bool component of the returned pair is true if and only if the insertion takes place, and the iterator component of the pair points to the element with key equivalent to the key of x.

      Complexity: Logarithmic.

    34. -
      iterator insert(const_iterator p, const value_type & x);
      +
      iterator insert(const_iterator p, const value_type & x);

      Effects: Inserts a copy of x in the container if and only if there is no element in the container with key equivalent to the key of x. p is a hint pointing to where the insert should start to search.

      Returns: An iterator pointing to the element with key equivalent to the key of x.

      Complexity: Logarithmic in general, but amortized constant if t is inserted right before p.

    35. -
      iterator insert(const_iterator p, nonconst_value_type && x);
      +
      iterator insert(const_iterator p, nonconst_value_type && x);

      Effects: Move constructs a new value from x if and only if there is no element in the container with key equivalent to the key of x. p is a hint pointing to where the insert should start to search.

      Returns: An iterator pointing to the element with key equivalent to the key of x.

      Complexity: Logarithmic in general, but amortized constant if t is inserted right before p.

    36. -
      iterator insert(const_iterator p, movable_value_type && x);
      +
      iterator insert(const_iterator p, movable_value_type && x);

      Effects: Move constructs a new value from x if and only if there is no element in the container with key equivalent to the key of x. p is a hint pointing to where the insert should start to search.

      Returns: An iterator pointing to the element with key equivalent to the key of x.

      Complexity: Logarithmic in general, but amortized constant if t is inserted right before p.

    37. -
      iterator insert(const_iterator p, const nonconst_value_type & x);
      +
      iterator insert(const_iterator p, const nonconst_value_type & x);

      Effects: Inserts a copy of x in the container. p is a hint pointing to where the insert should start to search.

      Returns: An iterator pointing to the element with key equivalent to the key of x.

      Complexity: Logarithmic.

    38. -
      iterator insert(const_iterator p, value_type && x);
      +
      iterator insert(const_iterator p, value_type && x);

      Effects: Inserts an element move constructed from x in the container. p is a hint pointing to where the insert should start to search.

      Returns: An iterator pointing to the element with key equivalent to the key of x.

      Complexity: Logarithmic. 

    39. template<typename InputIterator> 
-  void insert(InputIterator first, InputIterator last);
      + void insert(InputIterator first, InputIterator last);

      Requires: first, last are not iterators into *this.

      Effects: inserts each element from the range [first,last) if and only if there is no element with key equivalent to the key of that element.

      Complexity: At most N log(size()+N) (N is the distance from first to last)

    40. -
      void insert(std::initializer_list< value_type > il);
      +
      void insert(std::initializer_list< value_type > il);

      Effects: inserts each element from the range [il.begin(), il.end()) if and only if there is no element with key equivalent to the key of that element.

      Complexity: At most N log(size()+N) (N is the distance from il.begin() to il.end())

    41. -
      insert_return_type insert(node_type && nh);
      +
      insert_return_type insert(node_type && nh);

      Requires: nh is empty or this->get_allocator() == nh.get_allocator().

      Effects: If nh is empty, has no effect. Otherwise, inserts the element owned by nh if and only if there is no element in the container with a key equivalent to nh.key().

      Returns: If nh is empty, insert_return_type.inserted is false, insert_return_type.position is end(), and insert_return_type.node is empty. Otherwise if the insertion took place, insert_return_type.inserted is true, insert_return_type.position points to the inserted element, and insert_return_type.node is empty; if the insertion failed, insert_return_type.inserted is false, insert_return_type.node has the previous value of nh, and insert_return_type.position points to an element with a key equivalent to nh.key().

      Complexity: Logarithmic

    42. -
      insert_return_type insert(const_iterator hint, node_type && nh);
      +
      insert_return_type insert(const_iterator hint, node_type && nh);

      Effects: Same as insert(node_type && nh) but the element is inserted as close as possible to the position just prior to "hint".

      Complexity: logarithmic in general, but amortized constant if the element is inserted right before "hint".

    43. -
      template<class... Args> std::pair< iterator, bool > emplace(Args &&... args);
      +
      template<class... Args> std::pair< iterator, bool > emplace(Args &&... args);

      Effects: Inserts an object x of type T constructed with std::forward<Args>(args)... in the container if and only if there is no element in the container with an equivalent key. p is a hint pointing to where the insert should start to search.

      Returns: The bool component of the returned pair is true if and only if the insertion takes place, and the iterator component of the pair points to the element with key equivalent to the key of x.

      Complexity: Logarithmic in general, but amortized constant if t is inserted right before p. 

    44. template<class... Args> 
-  iterator emplace_hint(const_iterator p, Args &&... args);
      + iterator emplace_hint(const_iterator p, Args &&... args);

      Effects: Inserts an object of type T constructed with std::forward<Args>(args)... in the container if and only if there is no element in the container with an equivalent key. p is a hint pointing to where the insert should start to search.

      Returns: An iterator pointing to the element with key equivalent to the key of x.

      Complexity: Logarithmic in general, but amortized constant if t is inserted right before p. 

    45. template<class... Args> 
-  std::pair< iterator, bool > try_emplace(const key_type & k, Args &&... args);
      + std::pair< iterator, bool > try_emplace(const key_type & k, Args &&... args);

      Requires: value_type shall be EmplaceConstructible into map from piecewise_construct, forward_as_tuple(k), forward_as_tuple(forward<Args>(args)...).

      Effects: If the map already contains an element whose key is equivalent to k, there is no effect. Otherwise inserts an object of type value_type constructed with piecewise_construct, forward_as_tuple(k), forward_as_tuple(forward<Args>(args)...).

      Returns: The bool component of the returned pair is true if and only if the insertion took place. The returned iterator points to the map element whose key is equivalent to k.

      @@ -652,7 +652,7 @@ 
    46. template<class... Args> 
-  iterator try_emplace(const_iterator hint, const key_type & k, 
+  iterator try_emplace(const_iterator hint, const key_type & k, 
                        Args &&... args);

      Requires: value_type shall be EmplaceConstructible into map from piecewise_construct, forward_as_tuple(k), forward_as_tuple(forward<Args>(args)...).

      Effects: If the map already contains an element whose key is equivalent to k, there is no effect. Otherwise inserts an object of type value_type constructed with piecewise_construct, forward_as_tuple(k), forward_as_tuple(forward<Args>(args)...).

      @@ -661,7 +661,7 @@ 
    47. template<class... Args> 
-  std::pair< iterator, bool > try_emplace(key_type && k, Args &&... args);
      + std::pair< iterator, bool > try_emplace(key_type && k, Args &&... args);

      Requires: value_type shall be EmplaceConstructible into map from piecewise_construct, forward_as_tuple(move(k)), forward_as_tuple(forward<Args>(args)...).

      Effects: If the map already contains an element whose key is equivalent to k, there is no effect. Otherwise inserts an object of type value_type constructed with piecewise_construct, forward_as_tuple(move(k)), forward_as_tuple(forward<Args>(args)...).

      Returns: The bool component of the returned pair is true if and only if the insertion took place. The returned iterator points to the map element whose key is equivalent to k.

      @@ -669,45 +669,45 @@ 
    48. template<class... Args> 
-  iterator try_emplace(const_iterator hint, key_type && k, Args &&... args);
      + iterator try_emplace(const_iterator hint, key_type && k, Args &&... args);

      Requires: value_type shall be EmplaceConstructible into map from piecewise_construct, forward_as_tuple(move(k)), forward_as_tuple(forward<Args>(args)...).

      Effects: If the map already contains an element whose key is equivalent to k, there is no effect. Otherwise inserts an object of type value_type constructed with piecewise_construct, forward_as_tuple(move(k)), forward_as_tuple(forward<Args>(args)...).

      Returns: The returned iterator points to the map element whose key is equivalent to k.

      Complexity: Logarithmic in general, but amortized constant if value is inserted right before p.

    49. -
      iterator erase(const_iterator p) noexcept;
      +
      iterator erase(const_iterator p) noexcept;

      Effects: Erases the element pointed to by p.

      Returns: Returns an iterator pointing to the element immediately following q prior to the element being erased. If no such element exists, returns end().

      Complexity: Amortized constant time

    50. -
      size_type erase(const key_type & x) noexcept;
      +
      size_type erase(const key_type & x) noexcept;

      Effects: Erases all elements in the container with key equivalent to x.

      Returns: Returns the number of erased elements.

      Complexity: log(size()) + count(k)

    51. -
      iterator erase(const_iterator first, const_iterator last) noexcept;
      +
      iterator erase(const_iterator first, const_iterator last) noexcept;

      Effects: Erases all the elements in the range [first, last).

      Returns: Returns last.

      Complexity: log(size())+N where N is the distance from first to last.

    52. -
      node_type extract(const key_type & k);
      +
      node_type extract(const key_type & k);

      Effects: Removes the first element in the container with key equivalent to k.

      Returns: A node_type owning the element if found, otherwise an empty node_type.

      Complexity: log(a.size()).

    53. -
      node_type extract(const_iterator position);
      +
      node_type extract(const_iterator position);

      Effects: Removes the element pointed to by "position".

      Returns: A node_type owning the element, otherwise an empty node_type.

      Complexity: Amortized constant. 

    54. template<typename C2> 
-  void merge(map< Key, T, C2, Allocator, Options > & source);
      + void merge(map< Key, T, C2, Allocator, Options > & source);

      Requires: this->get_allocator() == source.get_allocator().

      Effects: Attempts to extract each element in source and insert it into a using the comparison object of *this. If there is an element in a with key equivalent to the key of an element from source, then that element is not extracted from source.

      Postcondition: Pointers and references to the transferred elements of source refer to those same elements but as members of *this. Iterators referring to the transferred elements will continue to refer to their elements, but they now behave as iterators into *this, not into source.

      @@ -716,7 +716,7 @@ 
    55. template<typename C2> 
-  void merge(map< Key, T, C2, Allocator, Options > && source);
      + void merge(map< Key, T, C2, Allocator, Options > && source);

      Requires: this->get_allocator() == source.get_allocator().

      Effects: Attempts to extract each element in source and insert it into a using the comparison object of *this. If there is an element in a with key equivalent to the key of an element from source, then that element is not extracted from source.

      Postcondition: Pointers and references to the transferred elements of source refer to those same elements but as members of *this. Iterators referring to the transferred elements will continue to refer to their elements, but they now behave as iterators into *this, not into source.

      @@ -725,7 +725,7 @@ 
    56. template<typename C2> 
-  void merge(multimap< Key, T, C2, Allocator, Options > & source);
      + void merge(multimap< Key, T, C2, Allocator, Options > & source);

      Requires: this->get_allocator() == source.get_allocator().

      Effects: Attempts to extract each element in source and insert it into a using the comparison object of *this. If there is an element in a with key equivalent to the key of an element from source, then that element is not extracted from source.

      Postcondition: Pointers and references to the transferred elements of source refer to those same elements but as members of *this. Iterators referring to the transferred elements will continue to refer to their elements, but they now behave as iterators into *this, not into source.

      @@ -734,7 +734,7 @@ 
    57. template<typename C2> 
-  void merge(multimap< Key, T, C2, Allocator, Options > && source);
      + void merge(multimap< Key, T, C2, Allocator, Options > && source);

      Requires: this->get_allocator() == source.get_allocator().

      Effects: Attempts to extract each element in source and insert it into a using the comparison object of *this. If there is an element in a with key equivalent to the key of an element from source, then that element is not extracted from source.

      Postcondition: Pointers and references to the transferred elements of source refer to those same elements but as members of *this. Iterators referring to the transferred elements will continue to refer to their elements, but they now behave as iterators into *this, not into source.

      @@ -742,7 +742,7 @@

      Complexity: N log(a.size() + N) (N has the value source.size())

    58. -
      void swap(map & x) noexcept(allocator_traits_type::is_always_equal::value &&boost::container::container_detail::is_nothrow_swappable< Compare >::value));
      +
      void swap(map & x) noexcept(allocator_traits_type::is_always_equal::value &&boost::container::dtl::is_nothrow_swappable< Compare >::value));

      Effects: Swaps the contents of *this and x.

      Throws: Nothing.

      Complexity: Constant. Effects: erase(a.begin(),a.end()).

      @@ -750,104 +750,104 @@

      Complexity: linear in size().

    59. -
      key_compare key_comp() const;
      +
      key_compare key_comp() const;

      Effects: Returns the comparison object out of which a was constructed.

      Complexity: Constant.

    60. -
      value_compare value_comp() const;
      +
      value_compare value_comp() const;

      Effects: Returns an object of value_compare constructed out of the comparison object.

      Complexity: Constant.

    61. -
      iterator find(const key_type & x);
      +
      iterator find(const key_type & x);

      Returns: An iterator pointing to an element with the key equivalent to x, or end() if such an element is not found.

      Complexity: Logarithmic.

    62. -
      const_iterator find(const key_type & x) const;
      +
      const_iterator find(const key_type & x) const;

      Returns: A const_iterator pointing to an element with the key equivalent to x, or end() if such an element is not found.

      Complexity: Logarithmic.

    63. -
      size_type count(const key_type & x) const;
      +
      size_type count(const key_type & x) const;

      Returns: The number of elements with key equivalent to x.

      Complexity: log(size())+count(k)

    64. -
      iterator lower_bound(const key_type & x);
      +
      iterator lower_bound(const key_type & x);

      Returns: An iterator pointing to the first element with key not less than k, or a.end() if such an element is not found.

      Complexity: Logarithmic

    65. -
      const_iterator lower_bound(const key_type & x) const;
      +
      const_iterator lower_bound(const key_type & x) const;

      Returns: A const iterator pointing to the first element with key not less than k, or a.end() if such an element is not found.

      Complexity: Logarithmic

    66. -
      iterator upper_bound(const key_type & x);
      +
      iterator upper_bound(const key_type & x);

      Returns: An iterator pointing to the first element with key not less than x, or end() if such an element is not found.

      Complexity: Logarithmic

    67. -
      const_iterator upper_bound(const key_type & x) const;
      +
      const_iterator upper_bound(const key_type & x) const;

      Returns: A const iterator pointing to the first element with key not less than x, or end() if such an element is not found.

      Complexity: Logarithmic

    68. -
      std::pair< iterator, iterator > equal_range(const key_type & x);
      +
      std::pair< iterator, iterator > equal_range(const key_type & x);

      Effects: Equivalent to std::make_pair(this->lower_bound(k), this->upper_bound(k)).

      Complexity: Logarithmic 

    69. std::pair< const_iterator, const_iterator > 
-equal_range(const key_type & x) const;
      +equal_range(const key_type & x) const;

      Effects: Equivalent to std::make_pair(this->lower_bound(k), this->upper_bound(k)).

      Complexity: Logarithmic

    70. -
      void rebalance();
      +
      void rebalance();

      Effects: Rebalances the tree. It's a no-op for Red-Black and AVL trees.

      Complexity: Linear

    -

    -map friend functions

    +

    +map friend functions

    1. -
      friend bool operator==(const map & x, const map & y);
      +
      friend bool operator==(const map & x, const map & y);

      Effects: Returns true if x and y are equal

      Complexity: Linear to the number of elements in the container.

    2. -
      friend bool operator!=(const map & x, const map & y);
      +
      friend bool operator!=(const map & x, const map & y);

      Effects: Returns true if x and y are unequal

      Complexity: Linear to the number of elements in the container.

    3. -
      friend bool operator<(const map & x, const map & y);
      +
      friend bool operator<(const map & x, const map & y);

      Effects: Returns true if x is less than y

      Complexity: Linear to the number of elements in the container.

    4. -
      friend bool operator>(const map & x, const map & y);
      +
      friend bool operator>(const map & x, const map & y);

      Effects: Returns true if x is greater than y

      Complexity: Linear to the number of elements in the container.

    5. -
      friend bool operator<=(const map & x, const map & y);
      +
      friend bool operator<=(const map & x, const map & y);

      Effects: Returns true if x is equal or less than y

      Complexity: Linear to the number of elements in the container.

    6. -
      friend bool operator>=(const map & x, const map & y);
      +
      friend bool operator>=(const map & x, const map & y);

      Effects: Returns true if x is equal or greater than y

      Complexity: Linear to the number of elements in the container.

    7. -
      friend void swap(map & x, map & y);
      +
      friend void swap(map & x, map & y);

      Effects: x.swap(y)

      Complexity: Constant.

      8. @@ -857,7 +857,8 @@
    -
    Copyright © 2009-2015 Ion Gaztanaga

    +

    Copyright © 2009-2017 Ion + Gaztanaga

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost/container/multimap.html b/doc/html/boost/container/multimap.html index c47300e98f..4213426882 100644 --- a/doc/html/boost/container/multimap.html +++ b/doc/html/boost/container/multimap.html @@ -60,121 +60,121 @@ typedef implementation_defined node_type; // construct/copy/destruct - multimap() noexcept(container_detail::is_nothrow_default_constructible< Allocator >::value &&container_detail::is_nothrow_default_constructible< Compare >::value)); - explicit multimap(const allocator_type &); - explicit multimap(const Compare &); - multimap(const Compare &, const allocator_type &); - template<typename InputIterator> multimap(InputIterator, InputIterator); + multimap() noexcept(dtl::is_nothrow_default_constructible< Allocator >::value &&dtl::is_nothrow_default_constructible< Compare >::value)); + explicit multimap(const allocator_type &); + explicit multimap(const Compare &); + multimap(const Compare &, const allocator_type &); + template<typename InputIterator> multimap(InputIterator, InputIterator); template<typename InputIterator> - multimap(InputIterator, InputIterator, const allocator_type &); + multimap(InputIterator, InputIterator, const allocator_type &); template<typename InputIterator> - multimap(InputIterator, InputIterator, const Compare &); + multimap(InputIterator, InputIterator, const Compare &); template<typename InputIterator> - multimap(InputIterator, InputIterator, const Compare &, + multimap(InputIterator, InputIterator, const Compare &, const allocator_type &); template<typename InputIterator> - multimap(ordered_range_t, InputIterator, InputIterator); + multimap(ordered_range_t, InputIterator, InputIterator); template<typename InputIterator> - multimap(ordered_range_t, InputIterator, InputIterator, const Compare &); + multimap(ordered_range_t, InputIterator, InputIterator, const Compare &); template<typename InputIterator> - multimap(ordered_range_t, InputIterator, InputIterator, const Compare &, + multimap(ordered_range_t, InputIterator, InputIterator, const Compare &, const allocator_type &); - multimap(std::initializer_list< value_type >); - multimap(std::initializer_list< value_type >, const allocator_type &); - multimap(std::initializer_list< value_type >, const Compare &); - multimap(std::initializer_list< value_type >, const Compare &, + multimap(std::initializer_list< value_type >); + multimap(std::initializer_list< value_type >, const allocator_type &); + multimap(std::initializer_list< value_type >, const Compare &); + multimap(std::initializer_list< value_type >, const Compare &, const allocator_type &); - multimap(ordered_range_t, std::initializer_list< value_type >); - multimap(ordered_range_t, std::initializer_list< value_type >, + multimap(ordered_range_t, std::initializer_list< value_type >); + multimap(ordered_range_t, std::initializer_list< value_type >, const Compare &); - multimap(ordered_range_t, std::initializer_list< value_type >, + multimap(ordered_range_t, std::initializer_list< value_type >, const Compare &, const allocator_type &); - multimap(const multimap &); - multimap(multimap &&) noexcept(boost::container::container_detail::is_nothrow_move_constructible< Compare >::value)); - multimap(const multimap &, const allocator_type &); - multimap(multimap &&, const allocator_type &); - multimap & operator=(const multimap &); - multimap & operator=(multimap &&) noexcept((allocator_traits_type::propagate_on_container_move_assignment::value||allocator_traits_type::is_always_equal::value)&&boost::container::container_detail::is_nothrow_move_assignable< Compare >::value)); - multimap & operator=(std::initializer_list< value_type >); + multimap(const multimap &); + multimap(multimap &&) noexcept(boost::container::dtl::is_nothrow_move_constructible< Compare >::value)); + multimap(const multimap &, const allocator_type &); + multimap(multimap &&, const allocator_type &); + multimap & operator=(const multimap &); + multimap & operator=(multimap &&) noexcept((allocator_traits_type::propagate_on_container_move_assignment::value||allocator_traits_type::is_always_equal::value)&&boost::container::dtl::is_nothrow_move_assignable< Compare >::value)); + multimap & operator=(std::initializer_list< value_type >); - // public member functions - BOOST_STATIC_ASSERT(unspecified); - allocator_type get_allocator() const; - stored_allocator_type & get_stored_allocator(); - const stored_allocator_type & get_stored_allocator() const; - iterator begin(); - const_iterator begin() const; - const_iterator cbegin() const; - iterator end() noexcept; - const_iterator end() const noexcept; - const_iterator cend() const noexcept; - reverse_iterator rbegin() noexcept; - const_reverse_iterator rbegin() const noexcept; - const_reverse_iterator crbegin() const noexcept; - reverse_iterator rend() noexcept; - const_reverse_iterator rend() const noexcept; - const_reverse_iterator crend() const noexcept; - bool empty() const; - size_type size() const; - size_type max_size() const; - template<class... Args> iterator emplace(Args &&...); - template<class... Args> iterator emplace_hint(const_iterator, Args &&...); - iterator insert(const value_type &); - iterator insert(const nonconst_value_type &); - iterator insert(nonconst_value_type &&); - iterator insert(movable_value_type &&); - iterator insert(const_iterator, const value_type &); - iterator insert(const_iterator, const nonconst_value_type &); - iterator insert(const_iterator, nonconst_value_type &&); - iterator insert(const_iterator, movable_value_type &&); - template<typename InputIterator> void insert(InputIterator, InputIterator); - void insert(std::initializer_list< value_type >); - iterator insert(node_type &&); - iterator insert(const_iterator, node_type &&); - iterator erase(const_iterator); - size_type erase(const key_type &); - iterator erase(const_iterator, const_iterator); - node_type extract(const key_type &); - node_type extract(const_iterator); + // public member functions + BOOST_STATIC_ASSERT((dtl::is_same< typename allocator_type::value_type, std::pair< const Key, T > >::value)); + allocator_type get_allocator() const; + stored_allocator_type & get_stored_allocator(); + const stored_allocator_type & get_stored_allocator() const; + iterator begin(); + const_iterator begin() const; + const_iterator cbegin() const; + iterator end() noexcept; + const_iterator end() const noexcept; + const_iterator cend() const noexcept; + reverse_iterator rbegin() noexcept; + const_reverse_iterator rbegin() const noexcept; + const_reverse_iterator crbegin() const noexcept; + reverse_iterator rend() noexcept; + const_reverse_iterator rend() const noexcept; + const_reverse_iterator crend() const noexcept; + bool empty() const; + size_type size() const; + size_type max_size() const; + template<class... Args> iterator emplace(Args &&...); + template<class... Args> iterator emplace_hint(const_iterator, Args &&...); + iterator insert(const value_type &); + iterator insert(const nonconst_value_type &); + iterator insert(nonconst_value_type &&); + iterator insert(movable_value_type &&); + iterator insert(const_iterator, const value_type &); + iterator insert(const_iterator, const nonconst_value_type &); + iterator insert(const_iterator, nonconst_value_type &&); + iterator insert(const_iterator, movable_value_type &&); + template<typename InputIterator> void insert(InputIterator, InputIterator); + void insert(std::initializer_list< value_type >); + iterator insert(node_type &&); + iterator insert(const_iterator, node_type &&); + iterator erase(const_iterator); + size_type erase(const key_type &); + iterator erase(const_iterator, const_iterator); + node_type extract(const key_type &); + node_type extract(const_iterator); template<typename C2> - void merge(multimap< Key, T, C2, Allocator, Options > &); + void merge(multimap< Key, T, C2, Allocator, Options > &); template<typename C2> - void merge(multimap< Key, T, C2, Allocator, Options > &&); - template<typename C2> void merge(map< Key, T, C2, Allocator, Options > &); - template<typename C2> void merge(map< Key, T, C2, Allocator, Options > &&); - void swap(multiset &) noexcept(allocator_traits_type::is_always_equal::value &&boost::container::container_detail::is_nothrow_swappable< Compare >::value)); - void clear() noexcept; - key_compare key_comp() const; - value_compare value_comp() const; - iterator find(const key_type &); - const_iterator find(const key_type &) const; - size_type count(const key_type &) const; - iterator lower_bound(const key_type &); - const_iterator lower_bound(const key_type &) const; - iterator upper_bound(const key_type &); - const_iterator upper_bound(const key_type &) const; - std::pair< iterator, iterator > equal_range(const key_type &); + void merge(multimap< Key, T, C2, Allocator, Options > &&); + template<typename C2> void merge(map< Key, T, C2, Allocator, Options > &); + template<typename C2> void merge(map< Key, T, C2, Allocator, Options > &&); + void swap(multiset &) noexcept(allocator_traits_type::is_always_equal::value &&boost::container::dtl::is_nothrow_swappable< Compare >::value)); + void clear() noexcept; + key_compare key_comp() const; + value_compare value_comp() const; + iterator find(const key_type &); + const_iterator find(const key_type &) const; + size_type count(const key_type &) const; + iterator lower_bound(const key_type &); + const_iterator lower_bound(const key_type &) const; + iterator upper_bound(const key_type &); + const_iterator upper_bound(const key_type &) const; + std::pair< iterator, iterator > equal_range(const key_type &); std::pair< const_iterator, const_iterator > - equal_range(const key_type &) const; - void rebalance(); + equal_range(const key_type &) const; + void rebalance(); - // friend functions - friend bool operator==(const multimap &, const multimap &); - friend bool operator!=(const multimap &, const multimap &); - friend bool operator<(const multimap &, const multimap &); - friend bool operator>(const multimap &, const multimap &); - friend bool operator<=(const multimap &, const multimap &); - friend bool operator>=(const multimap &, const multimap &); - friend void swap(multimap &, multimap &); + // friend functions + friend bool operator==(const multimap &, const multimap &); + friend bool operator!=(const multimap &, const multimap &); + friend bool operator<(const multimap &, const multimap &); + friend bool operator>(const multimap &, const multimap &); + friend bool operator<=(const multimap &, const multimap &); + friend bool operator>=(const multimap &, const multimap &); + friend void swap(multimap &, multimap &); };
    -

    Description

    +

    Description

    A multimap is a kind of associative container that supports equivalent keys (possibly containing multiple copies of the same key value) and provides for fast retrieval of values of another type T based on the keys. The multimap class supports bidirectional iterators.

    A multimap satisfies all of the requirements of a container and of a reversible container and of an associative container. The value_type stored by this container is the value_type is std::pair<const Key, T>.

    -

    Template Parameters

    +

    Template Parameters

    1. typename Key
      @@ -196,59 +196,59 @@
    -

    +

    multimap public construct/copy/destruct

    1. -
      multimap() noexcept(container_detail::is_nothrow_default_constructible< Allocator >::value &&container_detail::is_nothrow_default_constructible< Compare >::value));
      +
      multimap() noexcept(dtl::is_nothrow_default_constructible< Allocator >::value &&dtl::is_nothrow_default_constructible< Compare >::value));

      Effects: Default constructs an empty multimap.

      Complexity: Constant.

    2. -
      explicit multimap(const allocator_type & a);
      +
      explicit multimap(const allocator_type & a);

      Effects: Constructs an empty multimap using the specified allocator object and allocator.

      Complexity: Constant.

    3. -
      explicit multimap(const Compare & comp);
      +
      explicit multimap(const Compare & comp);

      Effects: Constructs an empty multimap using the specified comparison.

      Complexity: Constant.

    4. -
      multimap(const Compare & comp, const allocator_type & a);
      +
      multimap(const Compare & comp, const allocator_type & a);

      Effects: Constructs an empty multimap using the specified comparison and allocator.

      Complexity: Constant. 

    5. template<typename InputIterator> 
-  multimap(InputIterator first, InputIterator last);
      + multimap(InputIterator first, InputIterator last);

      Effects: Constructs an empty multimap and inserts elements from the range [first ,last ).

      Complexity: Linear in N if the range [first ,last ) is already sorted using the predicate and otherwise N logN, where N is last - first. 

    6. template<typename InputIterator> 
-  multimap(InputIterator first, InputIterator last, const allocator_type & a);
      + multimap(InputIterator first, InputIterator last, const allocator_type & a);

      Effects: Constructs an empty multimap using the specified allocator, and inserts elements from the range [first ,last ).

      Complexity: Linear in N if the range [first ,last ) is already sorted using the predicate and otherwise N logN, where N is last - first. 

    7. template<typename InputIterator> 
-  multimap(InputIterator first, InputIterator last, const Compare & comp);
      + multimap(InputIterator first, InputIterator last, const Compare & comp);

      Effects: Constructs an empty multimap using the specified comparison object and inserts elements from the range [first ,last ).

      Complexity: Linear in N if the range [first ,last ) is already sorted using the predicate and otherwise N logN, where N is last - first. 

    8. template<typename InputIterator> 
-  multimap(InputIterator first, InputIterator last, const Compare & comp, 
+  multimap(InputIterator first, InputIterator last, const Compare & comp, 
            const allocator_type & a);

      Effects: Constructs an empty multimap using the specified comparison object and allocator, and inserts elements from the range [first ,last ).

      Complexity: Linear in N if the range [first ,last ) is already sorted using the predicate and otherwise N logN, where N is last - first. 

    9. template<typename InputIterator> 
-  multimap(ordered_range_t, InputIterator first, InputIterator last);
      + multimap(ordered_range_t, InputIterator first, InputIterator last);

      Effects: Constructs an empty multimap and inserts elements from the ordered range [first ,last). This function is more efficient than the normal range creation for ordered ranges.

      Requires: [first ,last) must be ordered according to the predicate.

      Complexity: Linear in N.

      @@ -256,7 +256,7 @@ 
    10. template<typename InputIterator> 
-  multimap(ordered_range_t, InputIterator first, InputIterator last, 
+  multimap(ordered_range_t, InputIterator first, InputIterator last, 
            const Compare & comp);

      Effects: Constructs an empty multimap using the specified comparison object and inserts elements from the ordered range [first ,last). This function is more efficient than the normal range creation for ordered ranges.

      Requires: [first ,last) must be ordered according to the predicate.

      @@ -265,7 +265,7 @@ 
    11. template<typename InputIterator> 
-  multimap(ordered_range_t, InputIterator first, InputIterator last, 
+  multimap(ordered_range_t, InputIterator first, InputIterator last, 
            const Compare & comp, const allocator_type & a);

      Effects: Constructs an empty multimap using the specified comparison object and allocator, and inserts elements from the ordered range [first ,last). This function is more efficient than the normal range creation for ordered ranges.

      Requires: [first ,last) must be ordered according to the predicate.

      @@ -273,35 +273,35 @@

      Note: Non-standard extension.

    12. -
      multimap(std::initializer_list< value_type > il);
      +
      multimap(std::initializer_list< value_type > il);

      Effects: Constructs an empty multimap and and inserts elements from the range [il.begin(), il.end()).

      Complexity: Linear in N if the range [first ,last ) is already sorted using the predicate and otherwise N logN, where N is il.first() - il.end().

    13. -
      multimap(std::initializer_list< value_type > il, const allocator_type & a);
      +
      multimap(std::initializer_list< value_type > il, const allocator_type & a);

      Effects: Constructs an empty multimap using the specified allocator, and inserts elements from the range [il.begin(), il.end()).

      Complexity: Linear in N if the range [first ,last ) is already sorted using the predicate and otherwise N logN, where N is il.first() - il.end().

    14. -
      multimap(std::initializer_list< value_type > il, const Compare & comp);
      +
      multimap(std::initializer_list< value_type > il, const Compare & comp);

      Effects: Constructs an empty multimap using the specified comparison object and inserts elements from the range [il.begin(), il.end()).

      Complexity: Linear in N if the range [first ,last ) is already sorted using the predicate and otherwise N logN, where N is il.first() - il.end().

    15. -
      multimap(std::initializer_list< value_type > il, const Compare & comp, 
+
      multimap(std::initializer_list< value_type > il, const Compare & comp, 
          const allocator_type & a);
      
 
      Effects: Constructs an empty multimap using the specified comparison object and allocator, and inserts elements from the range [il.begin(), il.end()).
      
 
      Complexity: Linear in N if the range [first ,last ) is already sorted using the predicate and otherwise N logN, where N is il.first() - il.end().
    16. -
      multimap(ordered_range_t, std::initializer_list< value_type > il);
      +
      multimap(ordered_range_t, std::initializer_list< value_type > il);

      Effects: Constructs an empty map and inserts elements from the ordered range [il.begin(), il.end()). This function is more efficient than the normal range creation for ordered ranges.

      Requires: [il.begin(), il.end()) must be ordered according to the predicate.

      Complexity: Linear in N.

      Note: Non-standard extension.

    17. -
      multimap(ordered_range_t, std::initializer_list< value_type > il, 
+
      multimap(ordered_range_t, std::initializer_list< value_type > il, 
          const Compare & comp);
      
 
      Effects: Constructs an empty map using the specified comparison object and inserts elements from the ordered range [il.begin(), il.end()). This function is more efficient than the normal range creation for ordered ranges.
      
 
      Requires: [il.begin(), il.end()) must be ordered according to the predicate.
      
@@ -309,7 +309,7 @@
 
      Note: Non-standard extension.
    18. -
      multimap(ordered_range_t, std::initializer_list< value_type > il, 
+
      multimap(ordered_range_t, std::initializer_list< value_type > il, 
          const Compare & comp, const allocator_type & a);
      
 
      Effects: Constructs an empty map and inserts elements from the ordered range [il.begin(), il.end()). This function is more efficient than the normal range creation for ordered ranges.
      
 
      Requires: [il.begin(), il.end()) must be ordered according to the predicate.
      
@@ -317,269 +317,269 @@
 
      Note: Non-standard extension.
    19. -
      multimap(const multimap & x);
      +
      multimap(const multimap & x);

      Effects: Copy constructs a multimap.

      Complexity: Linear in x.size().

    20. -
      multimap(multimap && x) noexcept(boost::container::container_detail::is_nothrow_move_constructible< Compare >::value));
      +
      multimap(multimap && x) noexcept(boost::container::dtl::is_nothrow_move_constructible< Compare >::value));

      Effects: Move constructs a multimap. Constructs *this using x's resources.

      Complexity: Constant.

      Postcondition: x is emptied.

    21. -
      multimap(const multimap & x, const allocator_type & a);
      +
      multimap(const multimap & x, const allocator_type & a);

      Effects: Copy constructs a multimap.

      Complexity: Linear in x.size().

    22. -
      multimap(multimap && x, const allocator_type & a);
      +
      multimap(multimap && x, const allocator_type & a);

      Effects: Move constructs a multimap using the specified allocator. Constructs *this using x's resources. Complexity: Constant if a == x.get_allocator(), linear otherwise.

      Postcondition: x is emptied.

    23. -
      multimap & operator=(const multimap & x);
      +
      multimap & operator=(const multimap & x);

      Effects: Makes *this a copy of x.

      Complexity: Linear in x.size().

    24. -
      multimap & operator=(multimap && x) noexcept((allocator_traits_type::propagate_on_container_move_assignment::value||allocator_traits_type::is_always_equal::value)&&boost::container::container_detail::is_nothrow_move_assignable< Compare >::value));
      +
      multimap & operator=(multimap && x) noexcept((allocator_traits_type::propagate_on_container_move_assignment::value||allocator_traits_type::is_always_equal::value)&&boost::container::dtl::is_nothrow_move_assignable< Compare >::value));

      Effects: this->swap(x.get()).

      Complexity: Constant.

    25. -
      multimap & operator=(std::initializer_list< value_type > il);
      +
      multimap & operator=(std::initializer_list< value_type > il);

      Effects: Assign content of il to *this.

    -

    -multimap public member functions

    +

    +multimap public member functions

      -
    1.  BOOST_STATIC_ASSERT(unspecified);
      2. +
    2.  BOOST_STATIC_ASSERT((dtl::is_same< typename allocator_type::value_type, std::pair< const Key, T > >::value));
    3. -
      allocator_type get_allocator() const;
      +
      allocator_type get_allocator() const;

      Effects: Returns a copy of the allocator that was passed to the object's constructor.

      Complexity: Constant.

    4. -
      stored_allocator_type & get_stored_allocator();
      +
      stored_allocator_type & get_stored_allocator();

      Effects: Returns a reference to the internal allocator.

      Throws: Nothing

      Complexity: Constant.

      Note: Non-standard extension.

    5. -
      const stored_allocator_type & get_stored_allocator() const;
      +
      const stored_allocator_type & get_stored_allocator() const;

      Effects: Returns a reference to the internal allocator.

      Throws: Nothing

      Complexity: Constant.

      Note: Non-standard extension.

    6. -
      iterator begin();
      +
      iterator begin();

      Effects: Returns an iterator to the first element contained in the container.

      Throws: Nothing.

      Complexity: Constant

    7. -
      const_iterator begin() const;
      +
      const_iterator begin() const;

      Effects: Returns a const_iterator to the first element contained in the container.

      Throws: Nothing.

      Complexity: Constant.

    8. -
      const_iterator cbegin() const;
      +
      const_iterator cbegin() const;

      Effects: Returns a const_iterator to the first element contained in the container.

      Throws: Nothing.

      Complexity: Constant.

    9. -
      iterator end() noexcept;
      +
      iterator end() noexcept;

      Effects: Returns an iterator to the end of the container.

      Throws: Nothing.

      Complexity: Constant.

    10. -
      const_iterator end() const noexcept;
      +
      const_iterator end() const noexcept;

      Effects: Returns a const_iterator to the end of the container.

      Throws: Nothing.

      Complexity: Constant.

    11. -
      const_iterator cend() const noexcept;
      +
      const_iterator cend() const noexcept;

      Effects: Returns a const_iterator to the end of the container.

      Throws: Nothing.

      Complexity: Constant.

    12. -
      reverse_iterator rbegin() noexcept;
      +
      reverse_iterator rbegin() noexcept;

      Effects: Returns a reverse_iterator pointing to the beginning of the reversed container.

      Throws: Nothing.

      Complexity: Constant.

    13. -
      const_reverse_iterator rbegin() const noexcept;
      +
      const_reverse_iterator rbegin() const noexcept;

      Effects: Returns a const_reverse_iterator pointing to the beginning of the reversed container.

      Throws: Nothing.

      Complexity: Constant.

    14. -
      const_reverse_iterator crbegin() const noexcept;
      +
      const_reverse_iterator crbegin() const noexcept;

      Effects: Returns a const_reverse_iterator pointing to the beginning of the reversed container.

      Throws: Nothing.

      Complexity: Constant.

    15. -
      reverse_iterator rend() noexcept;
      +
      reverse_iterator rend() noexcept;

      Effects: Returns a reverse_iterator pointing to the end of the reversed container.

      Throws: Nothing.

      Complexity: Constant.

    16. -
      const_reverse_iterator rend() const noexcept;
      +
      const_reverse_iterator rend() const noexcept;

      Effects: Returns a const_reverse_iterator pointing to the end of the reversed container.

      Throws: Nothing.

      Complexity: Constant.

    17. -
      const_reverse_iterator crend() const noexcept;
      +
      const_reverse_iterator crend() const noexcept;

      Effects: Returns a const_reverse_iterator pointing to the end of the reversed container.

      Throws: Nothing.

      Complexity: Constant.

    18. -
      bool empty() const;
      +
      bool empty() const;

      Effects: Returns true if the container contains no elements.

      Throws: Nothing.

      Complexity: Constant.

    19. -
      size_type size() const;
      +
      size_type size() const;

      Effects: Returns the number of the elements contained in the container.

      Throws: Nothing.

      Complexity: Constant.

    20. -
      size_type max_size() const;
      +
      size_type max_size() const;

      Effects: Returns the largest possible size of the container.

      Throws: Nothing.

      Complexity: Constant.

    21. -
      template<class... Args> iterator emplace(Args &&... args);
      +
      template<class... Args> iterator emplace(Args &&... args);

      Effects: Inserts an object of type T constructed with std::forward<Args>(args)... in the container. p is a hint pointing to where the insert should start to search.

      Returns: An iterator pointing to the element with key equivalent to the key of x.

      Complexity: Logarithmic in general, but amortized constant if t is inserted right before p. 

    22. template<class... Args> 
-  iterator emplace_hint(const_iterator p, Args &&... args);
      + iterator emplace_hint(const_iterator p, Args &&... args);

      Effects: Inserts an object of type T constructed with std::forward<Args>(args)... in the container. p is a hint pointing to where the insert should start to search.

      Returns: An iterator pointing to the element with key equivalent to the key of x.

      Complexity: Logarithmic in general, but amortized constant if t is inserted right before p.

    23. -
      iterator insert(const value_type & x);
      +
      iterator insert(const value_type & x);

      Effects: Inserts x and returns the iterator pointing to the newly inserted element.

      Complexity: Logarithmic.

    24. -
      iterator insert(const nonconst_value_type & x);
      +
      iterator insert(const nonconst_value_type & x);

      Effects: Inserts a new value constructed from x and returns the iterator pointing to the newly inserted element.

      Complexity: Logarithmic.

    25. -
      iterator insert(nonconst_value_type && x);
      +
      iterator insert(nonconst_value_type && x);

      Effects: Inserts a new value move-constructed from x and returns the iterator pointing to the newly inserted element.

      Complexity: Logarithmic.

    26. -
      iterator insert(movable_value_type && x);
      +
      iterator insert(movable_value_type && x);

      Effects: Inserts a new value move-constructed from x and returns the iterator pointing to the newly inserted element.

      Complexity: Logarithmic.

    27. -
      iterator insert(const_iterator p, const value_type & x);
      +
      iterator insert(const_iterator p, const value_type & x);

      Effects: Inserts a copy of x in the container. p is a hint pointing to where the insert should start to search.

      Returns: An iterator pointing to the element with key equivalent to the key of x.

      Complexity: Logarithmic in general, but amortized constant if t is inserted right before p.

    28. -
      iterator insert(const_iterator p, const nonconst_value_type & x);
      +
      iterator insert(const_iterator p, const nonconst_value_type & x);

      Effects: Inserts a new value constructed from x in the container. p is a hint pointing to where the insert should start to search.

      Returns: An iterator pointing to the element with key equivalent to the key of x.

      Complexity: Logarithmic in general, but amortized constant if t is inserted right before p.

    29. -
      iterator insert(const_iterator p, nonconst_value_type && x);
      +
      iterator insert(const_iterator p, nonconst_value_type && x);

      Effects: Inserts a new value move constructed from x in the container. p is a hint pointing to where the insert should start to search.

      Returns: An iterator pointing to the element with key equivalent to the key of x.

      Complexity: Logarithmic in general, but amortized constant if t is inserted right before p.

    30. -
      iterator insert(const_iterator p, movable_value_type && x);
      +
      iterator insert(const_iterator p, movable_value_type && x);

      Effects: Inserts a new value move constructed from x in the container. p is a hint pointing to where the insert should start to search.

      Returns: An iterator pointing to the element with key equivalent to the key of x.

      Complexity: Logarithmic in general, but amortized constant if t is inserted right before p. 

    31. template<typename InputIterator> 
-  void insert(InputIterator first, InputIterator last);
      + void insert(InputIterator first, InputIterator last);

      Requires: first, last are not iterators into *this.

      Effects: inserts each element from the range [first,last) .

      Complexity: At most N log(size()+N) (N is the distance from first to last)

    32. -
      void insert(std::initializer_list< value_type > il);
      +
      void insert(std::initializer_list< value_type > il);

      Effects: inserts each element from the range [il.begin(), il.end().

      Complexity: At most N log(size()+N) (N is the distance from il.begin() to il.end())

    33. -
      iterator insert(node_type && nh);
      +
      iterator insert(node_type && nh);

      Requires: nh is empty or this->get_allocator() == nh.get_allocator().

      Effects/Returns: If nh is empty, has no effect and returns end(). Otherwise, inserts the element owned by nh and returns an iterator pointing to the newly inserted element. If a range containing elements with keys equivalent to nh.key() exists, the element is inserted at the end of that range. nh is always emptied.

      Complexity: Logarithmic

    34. -
      iterator insert(const_iterator hint, node_type && nh);
      +
      iterator insert(const_iterator hint, node_type && nh);

      Effects: Same as insert(node_type && nh) but the element is inserted as close as possible to the position just prior to "hint".

      Complexity: logarithmic in general, but amortized constant if the element is inserted right before "hint".

    35. -
      iterator erase(const_iterator p);
      +
      iterator erase(const_iterator p);

      Effects: Erases the element pointed to by p.

      Returns: Returns an iterator pointing to the element immediately following q prior to the element being erased. If no such element exists, returns end().

      Complexity: Amortized constant time

    36. -
      size_type erase(const key_type & x);
      +
      size_type erase(const key_type & x);

      Effects: Erases all elements in the container with key equivalent to x.

      Returns: Returns the number of erased elements.

      Complexity: log(size()) + count(k)

    37. -
      iterator erase(const_iterator first, const_iterator last);
      +
      iterator erase(const_iterator first, const_iterator last);

      Effects: Erases all the elements in the range [first, last).

      Returns: Returns last.

      Complexity: log(size())+N where N is the distance from first to last.

    38. -
      node_type extract(const key_type & k);
      +
      node_type extract(const key_type & k);

      Effects: Removes the first element in the container with key equivalent to k.

      Returns: A node_type owning the element if found, otherwise an empty node_type.

      Complexity: log(a.size()).

    39. -
      node_type extract(const_iterator position);
      +
      node_type extract(const_iterator position);

      Effects: Removes the element pointed to by "position".

      Returns: A node_type owning the element, otherwise an empty node_type.

      Complexity: Amortized constant. 

    40. template<typename C2> 
-  void merge(multimap< Key, T, C2, Allocator, Options > & source);
      + void merge(multimap< Key, T, C2, Allocator, Options > & source);

      Requires: this->get_allocator() == source.get_allocator().

      Effects: Extracts each element in source and insert it into a using the comparison object of *this.

      Postcondition: Pointers and references to the transferred elements of source refer to those same elements but as members of *this. Iterators referring to the transferred elements will continue to refer to their elements, but they now behave as iterators into *this, not into source.

      @@ -588,7 +588,7 @@ 
    41. template<typename C2> 
-  void merge(multimap< Key, T, C2, Allocator, Options > && source);
      + void merge(multimap< Key, T, C2, Allocator, Options > && source);

      Requires: this->get_allocator() == source.get_allocator().

      Effects: Extracts each element in source and insert it into a using the comparison object of *this.

      Postcondition: Pointers and references to the transferred elements of source refer to those same elements but as members of *this. Iterators referring to the transferred elements will continue to refer to their elements, but they now behave as iterators into *this, not into source.

      @@ -597,7 +597,7 @@ 
    42. template<typename C2> 
-  void merge(map< Key, T, C2, Allocator, Options > & source);
      + void merge(map< Key, T, C2, Allocator, Options > & source);

      Requires: this->get_allocator() == source.get_allocator().

      Effects: Extracts each element in source and insert it into a using the comparison object of *this.

      Postcondition: Pointers and references to the transferred elements of source refer to those same elements but as members of *this. Iterators referring to the transferred elements will continue to refer to their elements, but they now behave as iterators into *this, not into source.

      @@ -606,7 +606,7 @@ 
    43. template<typename C2> 
-  void merge(map< Key, T, C2, Allocator, Options > && source);
      + void merge(map< Key, T, C2, Allocator, Options > && source);

      Requires: this->get_allocator() == source.get_allocator().

      Effects: Extracts each element in source and insert it into a using the comparison object of *this.

      Postcondition: Pointers and references to the transferred elements of source refer to those same elements but as members of *this. Iterators referring to the transferred elements will continue to refer to their elements, but they now behave as iterators into *this, not into source.

      @@ -614,116 +614,116 @@

      Complexity: N log(a.size() + N) (N has the value source.size())

    44. -
      void swap(multiset & x) noexcept(allocator_traits_type::is_always_equal::value &&boost::container::container_detail::is_nothrow_swappable< Compare >::value));
      +
      void swap(multiset & x) noexcept(allocator_traits_type::is_always_equal::value &&boost::container::dtl::is_nothrow_swappable< Compare >::value));

      Effects: Swaps the contents of *this and x.

      Throws: Nothing.

      Complexity: Constant.

    45. -
      void clear() noexcept;
      +
      void clear() noexcept;

      Effects: erase(a.begin(),a.end()).

      Postcondition: size() == 0.

      Complexity: linear in size().

    46. -
      key_compare key_comp() const;
      +
      key_compare key_comp() const;

      Effects: Returns the comparison object out of which a was constructed.

      Complexity: Constant.

    47. -
      value_compare value_comp() const;
      +
      value_compare value_comp() const;

      Effects: Returns an object of value_compare constructed out of the comparison object.

      Complexity: Constant.

    48. -
      iterator find(const key_type & x);
      +
      iterator find(const key_type & x);

      Returns: An iterator pointing to an element with the key equivalent to x, or end() if such an element is not found.

      Complexity: Logarithmic.

    49. -
      const_iterator find(const key_type & x) const;
      +
      const_iterator find(const key_type & x) const;

      Returns: A const iterator pointing to an element with the key equivalent to x, or end() if such an element is not found.

      Complexity: Logarithmic.

    50. -
      size_type count(const key_type & x) const;
      +
      size_type count(const key_type & x) const;

      Returns: The number of elements with key equivalent to x.

      Complexity: log(size())+count(k)

    51. -
      iterator lower_bound(const key_type & x);
      +
      iterator lower_bound(const key_type & x);

      Returns: An iterator pointing to the first element with key not less than k, or a.end() if such an element is not found.

      Complexity: Logarithmic

    52. -
      const_iterator lower_bound(const key_type & x) const;
      +
      const_iterator lower_bound(const key_type & x) const;

      Returns: A const iterator pointing to the first element with key not less than k, or a.end() if such an element is not found.

      Complexity: Logarithmic

    53. -
      iterator upper_bound(const key_type & x);
      +
      iterator upper_bound(const key_type & x);

      Returns: An iterator pointing to the first element with key not less than x, or end() if such an element is not found.

      Complexity: Logarithmic

    54. -
      const_iterator upper_bound(const key_type & x) const;
      +
      const_iterator upper_bound(const key_type & x) const;

      Returns: A const iterator pointing to the first element with key not less than x, or end() if such an element is not found.

      Complexity: Logarithmic

    55. -
      std::pair< iterator, iterator > equal_range(const key_type & x);
      +
      std::pair< iterator, iterator > equal_range(const key_type & x);

      Effects: Equivalent to std::make_pair(this->lower_bound(k), this->upper_bound(k)).

      Complexity: Logarithmic 

    56. std::pair< const_iterator, const_iterator > 
-equal_range(const key_type & x) const;
      +equal_range(const key_type & x) const;

      Effects: Equivalent to std::make_pair(this->lower_bound(k), this->upper_bound(k)).

      Complexity: Logarithmic

    57. -
      void rebalance();
      +
      void rebalance();

      Effects: Rebalances the tree. It's a no-op for Red-Black and AVL trees.

      Complexity: Linear

    -

    -multimap friend functions

    +

    +multimap friend functions

    1. -
      friend bool operator==(const multimap & x, const multimap & y);
      +
      friend bool operator==(const multimap & x, const multimap & y);

      Effects: Returns true if x and y are equal

      Complexity: Linear to the number of elements in the container.

    2. -
      friend bool operator!=(const multimap & x, const multimap & y);
      +
      friend bool operator!=(const multimap & x, const multimap & y);

      Effects: Returns true if x and y are unequal

      Complexity: Linear to the number of elements in the container.

    3. -
      friend bool operator<(const multimap & x, const multimap & y);
      +
      friend bool operator<(const multimap & x, const multimap & y);

      Effects: Returns true if x is less than y

      Complexity: Linear to the number of elements in the container.

    4. -
      friend bool operator>(const multimap & x, const multimap & y);
      +
      friend bool operator>(const multimap & x, const multimap & y);

      Effects: Returns true if x is greater than y

      Complexity: Linear to the number of elements in the container.

    5. -
      friend bool operator<=(const multimap & x, const multimap & y);
      +
      friend bool operator<=(const multimap & x, const multimap & y);

      Effects: Returns true if x is equal or less than y

      Complexity: Linear to the number of elements in the container.

    6. -
      friend bool operator>=(const multimap & x, const multimap & y);
      +
      friend bool operator>=(const multimap & x, const multimap & y);

      Effects: Returns true if x is equal or greater than y

      Complexity: Linear to the number of elements in the container.

    7. -
      friend void swap(multimap & x, multimap & y);
      +
      friend void swap(multimap & x, multimap & y);

      Effects: x.swap(y)

      Complexity: Constant.

      8. @@ -733,7 +733,8 @@
    -
    Copyright © 2009-2015 Ion Gaztanaga

    +

    Copyright © 2009-2017 Ion + Gaztanaga

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost/container/multiset.html b/doc/html/boost/container/multiset.html index d3e7a68f86..037fedb247 100644 --- a/doc/html/boost/container/multiset.html +++ b/doc/html/boost/container/multiset.html @@ -58,114 +58,114 @@ typedef implementation_defined node_type; // construct/copy/destruct - multiset() noexcept(container_detail::is_nothrow_default_constructible< Allocator >::value &&container_detail::is_nothrow_default_constructible< Compare >::value)); - explicit multiset(const allocator_type &); - explicit multiset(const Compare &); - multiset(const Compare &, const allocator_type &); - template<typename InputIterator> multiset(InputIterator, InputIterator); + multiset() noexcept(dtl::is_nothrow_default_constructible< Allocator >::value &&dtl::is_nothrow_default_constructible< Compare >::value)); + explicit multiset(const allocator_type &); + explicit multiset(const Compare &); + multiset(const Compare &, const allocator_type &); + template<typename InputIterator> multiset(InputIterator, InputIterator); template<typename InputIterator> - multiset(InputIterator, InputIterator, const allocator_type &); + multiset(InputIterator, InputIterator, const allocator_type &); template<typename InputIterator> - multiset(InputIterator, InputIterator, const Compare &); + multiset(InputIterator, InputIterator, const Compare &); template<typename InputIterator> - multiset(InputIterator, InputIterator, const Compare &, + multiset(InputIterator, InputIterator, const Compare &, const allocator_type &); template<typename InputIterator> - multiset(ordered_range_t, InputIterator, InputIterator); + multiset(ordered_range_t, InputIterator, InputIterator); template<typename InputIterator> - multiset(ordered_range_t, InputIterator, InputIterator, const Compare &); + multiset(ordered_range_t, InputIterator, InputIterator, const Compare &); template<typename InputIterator> - multiset(ordered_range_t, InputIterator, InputIterator, const Compare &, + multiset(ordered_range_t, InputIterator, InputIterator, const Compare &, const allocator_type &); - multiset(std::initializer_list< value_type >); - multiset(std::initializer_list< value_type >, const allocator_type &); - multiset(std::initializer_list< value_type >, const Compare &); - multiset(std::initializer_list< value_type >, const Compare &, + multiset(std::initializer_list< value_type >); + multiset(std::initializer_list< value_type >, const allocator_type &); + multiset(std::initializer_list< value_type >, const Compare &); + multiset(std::initializer_list< value_type >, const Compare &, const allocator_type &); - multiset(ordered_range_t, std::initializer_list< value_type >); - multiset(ordered_range_t, std::initializer_list< value_type >, + multiset(ordered_range_t, std::initializer_list< value_type >); + multiset(ordered_range_t, std::initializer_list< value_type >, const Compare &); - multiset(ordered_range_t, std::initializer_list< value_type >, + multiset(ordered_range_t, std::initializer_list< value_type >, const Compare &, const allocator_type &); - multiset(const multiset &); - multiset(multiset &&) noexcept(boost::container::container_detail::is_nothrow_move_constructible< Compare >::value)); - multiset(const multiset &, const allocator_type &); - multiset(multiset &&, const allocator_type &); - multiset & operator=(const multiset &); - multiset & operator=(multiset &&) noexcept((allocator_traits_type::propagate_on_container_move_assignment::value||allocator_traits_type::is_always_equal::value)&&boost::container::container_detail::is_nothrow_move_assignable< Compare >::value)); - multiset & operator=(std::initializer_list< value_type >); + multiset(const multiset &); + multiset(multiset &&) noexcept(boost::container::dtl::is_nothrow_move_constructible< Compare >::value)); + multiset(const multiset &, const allocator_type &); + multiset(multiset &&, const allocator_type &); + multiset & operator=(const multiset &); + multiset & operator=(multiset &&) noexcept((allocator_traits_type::propagate_on_container_move_assignment::value||allocator_traits_type::is_always_equal::value)&&boost::container::dtl::is_nothrow_move_assignable< Compare >::value)); + multiset & operator=(std::initializer_list< value_type >); - // public member functions - allocator_type get_allocator() const; - stored_allocator_type & get_stored_allocator(); - const stored_allocator_type & get_stored_allocator() const; - iterator begin(); - const_iterator begin() const; - const_iterator cbegin() const; - iterator end() noexcept; - const_iterator end() const noexcept; - const_iterator cend() const noexcept; - reverse_iterator rbegin() noexcept; - const_reverse_iterator rbegin() const noexcept; - const_reverse_iterator crbegin() const noexcept; - reverse_iterator rend() noexcept; - const_reverse_iterator rend() const noexcept; - const_reverse_iterator crend() const noexcept; - bool empty() const; - size_type size() const; - size_type max_size() const; - template<class... Args> iterator emplace(Args &&...); - template<class... Args> iterator emplace_hint(const_iterator, Args &&...); - iterator insert(const value_type &); - iterator insert(value_type &&); - iterator insert(const_iterator, const value_type &); - iterator insert(const_iterator, value_type &&); - template<typename InputIterator> void insert(InputIterator, InputIterator); - void insert(std::initializer_list< value_type >); - iterator insert(node_type &&); - iterator insert(const_iterator, node_type &&); - template<typename C2> void merge(multiset< Key, C2, Allocator, Options > &); - template<typename C2> void merge(multiset< Key, C2, Allocator, Options > &&); - template<typename C2> void merge(set< Key, C2, Allocator, Options > &); - template<typename C2> void merge(set< Key, C2, Allocator, Options > &&); - iterator erase(const_iterator); - size_type erase(const key_type &); - iterator erase(const_iterator, const_iterator); - node_type extract(const_iterator); - node_type extract(const key_type &); - void swap(multiset &) noexcept(allocator_traits_type::is_always_equal::value &&boost::container::container_detail::is_nothrow_swappable< Compare >::value)); - void clear() noexcept; - key_compare key_comp() const; - value_compare value_comp() const; - iterator find(const key_type &); - const_iterator find(const key_type &) const; - size_type count(const key_type &) const; - iterator lower_bound(const key_type &); - const_iterator lower_bound(const key_type &) const; - iterator upper_bound(const key_type &); - const_iterator upper_bound(const key_type &) const; + // public member functions + allocator_type get_allocator() const; + stored_allocator_type & get_stored_allocator(); + const stored_allocator_type & get_stored_allocator() const; + iterator begin(); + const_iterator begin() const; + const_iterator cbegin() const; + iterator end() noexcept; + const_iterator end() const noexcept; + const_iterator cend() const noexcept; + reverse_iterator rbegin() noexcept; + const_reverse_iterator rbegin() const noexcept; + const_reverse_iterator crbegin() const noexcept; + reverse_iterator rend() noexcept; + const_reverse_iterator rend() const noexcept; + const_reverse_iterator crend() const noexcept; + bool empty() const; + size_type size() const; + size_type max_size() const; + template<class... Args> iterator emplace(Args &&...); + template<class... Args> iterator emplace_hint(const_iterator, Args &&...); + iterator insert(const value_type &); + iterator insert(value_type &&); + iterator insert(const_iterator, const value_type &); + iterator insert(const_iterator, value_type &&); + template<typename InputIterator> void insert(InputIterator, InputIterator); + void insert(std::initializer_list< value_type >); + iterator insert(node_type &&); + iterator insert(const_iterator, node_type &&); + template<typename C2> void merge(multiset< Key, C2, Allocator, Options > &); + template<typename C2> void merge(multiset< Key, C2, Allocator, Options > &&); + template<typename C2> void merge(set< Key, C2, Allocator, Options > &); + template<typename C2> void merge(set< Key, C2, Allocator, Options > &&); + iterator erase(const_iterator); + size_type erase(const key_type &); + iterator erase(const_iterator, const_iterator); + node_type extract(const_iterator); + node_type extract(const key_type &); + void swap(multiset &) noexcept(allocator_traits_type::is_always_equal::value &&boost::container::dtl::is_nothrow_swappable< Compare >::value)); + void clear() noexcept; + key_compare key_comp() const; + value_compare value_comp() const; + iterator find(const key_type &); + const_iterator find(const key_type &) const; + size_type count(const key_type &) const; + iterator lower_bound(const key_type &); + const_iterator lower_bound(const key_type &) const; + iterator upper_bound(const key_type &); + const_iterator upper_bound(const key_type &) const; std::pair< const_iterator, const_iterator > - equal_range(const key_type &) const; - std::pair< iterator, iterator > equal_range(const key_type &); - void rebalance(); + equal_range(const key_type &) const; + std::pair< iterator, iterator > equal_range(const key_type &); + void rebalance(); - // friend functions - friend bool operator==(const multiset &, const multiset &); - friend bool operator!=(const multiset &, const multiset &); - friend bool operator<(const multiset &, const multiset &); - friend bool operator>(const multiset &, const multiset &); - friend bool operator<=(const multiset &, const multiset &); - friend bool operator>=(const multiset &, const multiset &); - friend void swap(multiset &, multiset &); + // friend functions + friend bool operator==(const multiset &, const multiset &); + friend bool operator!=(const multiset &, const multiset &); + friend bool operator<(const multiset &, const multiset &); + friend bool operator>(const multiset &, const multiset &); + friend bool operator<=(const multiset &, const multiset &); + friend bool operator>=(const multiset &, const multiset &); + friend void swap(multiset &, multiset &); };
    -

    Description

    +

    Description

    A multiset is a kind of associative container that supports equivalent keys (possibly contains multiple copies of the same key value) and provides for fast retrieval of the keys themselves. Class multiset supports bidirectional iterators.

    A multiset satisfies all of the requirements of a container and of a reversible container, and of an associative container). multiset also provides most operations described for duplicate keys.

    -

    Template Parameters

    +

    Template Parameters

    1. typename Key
      @@ -186,59 +186,59 @@
    -

    +

    multiset public construct/copy/destruct

    1. -
      multiset() noexcept(container_detail::is_nothrow_default_constructible< Allocator >::value &&container_detail::is_nothrow_default_constructible< Compare >::value));
      +
      multiset() noexcept(dtl::is_nothrow_default_constructible< Allocator >::value &&dtl::is_nothrow_default_constructible< Compare >::value));

      Effects: Default constructs an empty set.

      Complexity: Constant.

    2. -
      explicit multiset(const allocator_type & a);
      +
      explicit multiset(const allocator_type & a);

      Effects: Constructs an empty set using the specified allocator object.

      Complexity: Constant.

    3. -
      explicit multiset(const Compare & comp);
      +
      explicit multiset(const Compare & comp);

      Effects: Constructs an empty set using the specified comparison object.

      Complexity: Constant.

    4. -
      multiset(const Compare & comp, const allocator_type & a);
      +
      multiset(const Compare & comp, const allocator_type & a);

      Effects: Constructs an empty set using the specified comparison object and allocator.

      Complexity: Constant. 

    5. template<typename InputIterator> 
-  multiset(InputIterator first, InputIterator last);
      + multiset(InputIterator first, InputIterator last);

      Effects: Constructs an empty set using and inserts elements from the range [first ,last ).

      Complexity: Linear in N if the range [first ,last ) is already sorted using the predicate and otherwise N logN, where N is last - first. 

    6. template<typename InputIterator> 
-  multiset(InputIterator first, InputIterator last, const allocator_type & a);
      + multiset(InputIterator first, InputIterator last, const allocator_type & a);

      Effects: Constructs an empty set using the specified allocator, and inserts elements from the range [first ,last ).

      Complexity: Linear in N if the range [first ,last ) is already sorted using the predicate and otherwise N logN, where N is last - first. 

    7. template<typename InputIterator> 
-  multiset(InputIterator first, InputIterator last, const Compare & comp);
      + multiset(InputIterator first, InputIterator last, const Compare & comp);

      Effects: Constructs an empty set using the specified comparison object and inserts elements from the range [first ,last ).

      Complexity: Linear in N if the range [first ,last ) is already sorted using the predicate and otherwise N logN, where N is last - first. 

    8. template<typename InputIterator> 
-  multiset(InputIterator first, InputIterator last, const Compare & comp, 
+  multiset(InputIterator first, InputIterator last, const Compare & comp, 
            const allocator_type & a);

      Effects: Constructs an empty set using the specified comparison object and allocator, and inserts elements from the range [first ,last ).

      Complexity: Linear in N if the range [first ,last ) is already sorted using the predicate and otherwise N logN, where N is last - first. 

    9. template<typename InputIterator> 
-  multiset(ordered_range_t, InputIterator first, InputIterator last);
      + multiset(ordered_range_t, InputIterator first, InputIterator last);

      Effects: Constructs an empty multiset and and inserts elements from the ordered range [first ,last ). This function is more efficient than the normal range creation for ordered ranges.

      Requires: [first ,last) must be ordered according to the predicate.

      Complexity: Linear in N.

      @@ -246,7 +246,7 @@ 
    10. template<typename InputIterator> 
-  multiset(ordered_range_t, InputIterator first, InputIterator last, 
+  multiset(ordered_range_t, InputIterator first, InputIterator last, 
            const Compare & comp);

      Effects: Constructs an empty multiset using the specified comparison object and inserts elements from the ordered range [first ,last ). This function is more efficient than the normal range creation for ordered ranges.

      Requires: [first ,last) must be ordered according to the predicate.

      @@ -255,7 +255,7 @@ 
    11. template<typename InputIterator> 
-  multiset(ordered_range_t, InputIterator first, InputIterator last, 
+  multiset(ordered_range_t, InputIterator first, InputIterator last, 
            const Compare & comp, const allocator_type & a);

      Effects: Constructs an empty multiset using the specified comparison object and allocator, and inserts elements from the ordered range [first ,last ). This function is more efficient than the normal range creation for ordered ranges.

      Requires: [first ,last) must be ordered according to the predicate.

      @@ -263,35 +263,35 @@

      Note: Non-standard extension.

    12. -
      multiset(std::initializer_list< value_type > il);
      +
      multiset(std::initializer_list< value_type > il);

      Effects: Constructs an empty set and inserts elements from the range [il.begin(), il.end()).

      Complexity: Linear in N if the range [il.begin(), il.end()) is already sorted using the predicate and otherwise N logN, where N is il.begin() - il.end().

    13. -
      multiset(std::initializer_list< value_type > il, const allocator_type & a);
      +
      multiset(std::initializer_list< value_type > il, const allocator_type & a);

      Effects: Constructs an empty set using the specified allocator, and inserts elements from the range [il.begin(), il.end()).

      Complexity: Linear in N if the range [il.begin(), il.end()) is already sorted using the predicate and otherwise N logN, where N is il.begin() - il.end().

    14. -
      multiset(std::initializer_list< value_type > il, const Compare & comp);
      +
      multiset(std::initializer_list< value_type > il, const Compare & comp);

      Effects: Constructs an empty set using the specified comparison object and inserts elements from the range [il.begin(), il.end()).

      Complexity: Linear in N if the range [il.begin(), il.end()) is already sorted using the predicate and otherwise N logN, where N is il.begin() - il.end().

    15. -
      multiset(std::initializer_list< value_type > il, const Compare & comp, 
+
      multiset(std::initializer_list< value_type > il, const Compare & comp, 
          const allocator_type & a);
      
 
      Effects: Constructs an empty set using the specified comparison object and allocator, and inserts elements from the range [il.begin(), il.end()).
      
 
      Complexity: Linear in N if the range [il.begin(), il.end()) is already sorted using the predicate and otherwise N logN, where N is il.begin() - il.end().
    16. -
      multiset(ordered_range_t, std::initializer_list< value_type > il);
      +
      multiset(ordered_range_t, std::initializer_list< value_type > il);

      Effects: Constructs an empty set and inserts elements from the ordered unique range [il.begin(), il.end()). This function is more efficient than the normal range creation for ordered ranges.

      Requires: [il.begin(), il.end()) must be ordered according to the predicate and must be unique values.

      Complexity: Linear in N.

      Note: Non-standard extension.

    17. -
      multiset(ordered_range_t, std::initializer_list< value_type > il, 
+
      multiset(ordered_range_t, std::initializer_list< value_type > il, 
          const Compare & comp);
      
 
      Effects: Constructs an empty set using the specified comparison object and inserts elements from the ordered unique range [il.begin(), il.end()). This function is more efficient than the normal range creation for ordered ranges.
      
 
      Requires: [il.begin(), il.end()) must be ordered according to the predicate and must be unique values.
      
@@ -299,7 +299,7 @@
 
      Note: Non-standard extension.
    18. -
      multiset(ordered_range_t, std::initializer_list< value_type > il, 
+
      multiset(ordered_range_t, std::initializer_list< value_type > il, 
          const Compare & comp, const allocator_type & a);
      
 
      Effects: Constructs an empty set using the specified comparison object and allocator, and inserts elements from the ordered unique range [il.begin(), il.end()). This function is more efficient than the normal range creation for ordered ranges.
      
 
      Requires: [il.begin(), il.end()) must be ordered according to the predicate and must be unique values.
      
@@ -307,218 +307,218 @@
 
      Note: Non-standard extension.
    19. -
      multiset(const multiset & x);
      +
      multiset(const multiset & x);

      Effects: Copy constructs a set.

      Complexity: Linear in x.size().

    20. -
      multiset(multiset && x) noexcept(boost::container::container_detail::is_nothrow_move_constructible< Compare >::value));
      +
      multiset(multiset && x) noexcept(boost::container::dtl::is_nothrow_move_constructible< Compare >::value));

      Effects: Move constructs a set. Constructs *this using x's resources.

      Complexity: Constant.

      Postcondition: x is emptied.

    21. -
      multiset(const multiset & x, const allocator_type & a);
      +
      multiset(const multiset & x, const allocator_type & a);

      Effects: Copy constructs a set using the specified allocator.

      Complexity: Linear in x.size().

    22. -
      multiset(multiset && x, const allocator_type & a);
      +
      multiset(multiset && x, const allocator_type & a);

      Effects: Move constructs a set using the specified allocator. Constructs *this using x's resources.

      Complexity: Constant if a == x.get_allocator(), linear otherwise.

    23. -
      multiset & operator=(const multiset & x);
      +
      multiset & operator=(const multiset & x);

      Effects: Makes *this a copy of x.

      Complexity: Linear in x.size().

    24. -
      multiset & operator=(multiset && x) noexcept((allocator_traits_type::propagate_on_container_move_assignment::value||allocator_traits_type::is_always_equal::value)&&boost::container::container_detail::is_nothrow_move_assignable< Compare >::value));
      +
      multiset & operator=(multiset && x) noexcept((allocator_traits_type::propagate_on_container_move_assignment::value||allocator_traits_type::is_always_equal::value)&&boost::container::dtl::is_nothrow_move_assignable< Compare >::value));

      Effects: this->swap(x.get()).

      Throws: If allocator_traits_type::propagate_on_container_move_assignment is false and (allocation throws or value_type's move constructor throws)

      Complexity: Constant if allocator_traits_type:: propagate_on_container_move_assignment is true or this->get>allocator() == x.get_allocator(). Linear otherwise.

    25. -
      multiset & operator=(std::initializer_list< value_type > il);
      +
      multiset & operator=(std::initializer_list< value_type > il);

      Effects: Copy all elements from il to *this.

      Complexity: Linear in il.size().

    -

    -multiset public member functions

    +

    +multiset public member functions

    1. -
      allocator_type get_allocator() const;
      +
      allocator_type get_allocator() const;

      Effects: Returns a copy of the allocator that was passed to the object's constructor.

      Complexity: Constant.

    2. -
      stored_allocator_type & get_stored_allocator();
      +
      stored_allocator_type & get_stored_allocator();

      Effects: Returns a reference to the internal allocator.

      Throws: Nothing

      Complexity: Constant.

      Note: Non-standard extension.

    3. -
      const stored_allocator_type & get_stored_allocator() const;
      +
      const stored_allocator_type & get_stored_allocator() const;

      Effects: Returns a reference to the internal allocator.

      Throws: Nothing

      Complexity: Constant.

      Note: Non-standard extension.

    4. -
      iterator begin();
      +
      iterator begin();

      Effects: Returns an iterator to the first element contained in the container.

      Throws: Nothing.

      Complexity: Constant

    5. -
      const_iterator begin() const;
      +
      const_iterator begin() const;

      Effects: Returns a const_iterator to the first element contained in the container.

      Throws: Nothing.

      Complexity: Constant.

    6. -
      const_iterator cbegin() const;
      +
      const_iterator cbegin() const;

      Effects: Returns a const_iterator to the first element contained in the container.

      Throws: Nothing.

      Complexity: Constant.

    7. -
      iterator end() noexcept;
      +
      iterator end() noexcept;

      Effects: Returns an iterator to the end of the container.

      Throws: Nothing.

      Complexity: Constant.

    8. -
      const_iterator end() const noexcept;
      +
      const_iterator end() const noexcept;

      Effects: Returns a const_iterator to the end of the container.

      Throws: Nothing.

      Complexity: Constant.

    9. -
      const_iterator cend() const noexcept;
      +
      const_iterator cend() const noexcept;

      Effects: Returns a const_iterator to the end of the container.

      Throws: Nothing.

      Complexity: Constant.

    10. -
      reverse_iterator rbegin() noexcept;
      +
      reverse_iterator rbegin() noexcept;

      Effects: Returns a reverse_iterator pointing to the beginning of the reversed container.

      Throws: Nothing.

      Complexity: Constant.

    11. -
      const_reverse_iterator rbegin() const noexcept;
      +
      const_reverse_iterator rbegin() const noexcept;

      Effects: Returns a const_reverse_iterator pointing to the beginning of the reversed container.

      Throws: Nothing.

      Complexity: Constant.

    12. -
      const_reverse_iterator crbegin() const noexcept;
      +
      const_reverse_iterator crbegin() const noexcept;

      Effects: Returns a const_reverse_iterator pointing to the beginning of the reversed container.

      Throws: Nothing.

      Complexity: Constant.

    13. -
      reverse_iterator rend() noexcept;
      +
      reverse_iterator rend() noexcept;

      Effects: Returns a reverse_iterator pointing to the end of the reversed container.

      Throws: Nothing.

      Complexity: Constant.

    14. -
      const_reverse_iterator rend() const noexcept;
      +
      const_reverse_iterator rend() const noexcept;

      Effects: Returns a const_reverse_iterator pointing to the end of the reversed container.

      Throws: Nothing.

      Complexity: Constant.

    15. -
      const_reverse_iterator crend() const noexcept;
      +
      const_reverse_iterator crend() const noexcept;

      Effects: Returns a const_reverse_iterator pointing to the end of the reversed container.

      Throws: Nothing.

      Complexity: Constant.

    16. -
      bool empty() const;
      +
      bool empty() const;

      Effects: Returns true if the container contains no elements.

      Throws: Nothing.

      Complexity: Constant.

    17. -
      size_type size() const;
      +
      size_type size() const;

      Effects: Returns the number of the elements contained in the container.

      Throws: Nothing.

      Complexity: Constant.

    18. -
      size_type max_size() const;
      +
      size_type max_size() const;

      Effects: Returns the largest possible size of the container.

      Throws: Nothing.

      Complexity: Constant.

    19. -
      template<class... Args> iterator emplace(Args &&... args);
      +
      template<class... Args> iterator emplace(Args &&... args);

      Effects: Inserts an object of type Key constructed with std::forward<Args>(args)... and returns the iterator pointing to the newly inserted element.

      Complexity: Logarithmic. 

    20. template<class... Args> 
-  iterator emplace_hint(const_iterator p, Args &&... args);
      + iterator emplace_hint(const_iterator p, Args &&... args);

      Effects: Inserts an object of type Key constructed with std::forward<Args>(args)...

      Returns: An iterator pointing to the element with key equivalent to the key of x.

      Complexity: Logarithmic in general, but amortized constant if t is inserted right before p.

    21. -
      iterator insert(const value_type & x);
      +
      iterator insert(const value_type & x);

      Effects: Inserts x and returns the iterator pointing to the newly inserted element.

      Complexity: Logarithmic.

    22. -
      iterator insert(value_type && x);
      +
      iterator insert(value_type && x);

      Effects: Inserts a copy of x in the container.

      Returns: An iterator pointing to the element with key equivalent to the key of x.

      Complexity: Logarithmic in general, but amortized constant if t is inserted right before p.

    23. -
      iterator insert(const_iterator p, const value_type & x);
      +
      iterator insert(const_iterator p, const value_type & x);

      Effects: Inserts a copy of x in the container. p is a hint pointing to where the insert should start to search.

      Returns: An iterator pointing to the element with key equivalent to the key of x.

      Complexity: Logarithmic in general, but amortized constant if t is inserted right before p.

    24. -
      iterator insert(const_iterator p, value_type && x);
      +
      iterator insert(const_iterator p, value_type && x);

      Effects: Inserts a value move constructed from x in the container. p is a hint pointing to where the insert should start to search.

      Returns: An iterator pointing to the element with key equivalent to the key of x.

      Complexity: Logarithmic in general, but amortized constant if t is inserted right before p. 

    25. template<typename InputIterator> 
-  void insert(InputIterator first, InputIterator last);
      + void insert(InputIterator first, InputIterator last);

      Requires: first, last are not iterators into *this.

      Effects: inserts each element from the range [first,last) .

      Complexity: At most N log(size()+N) (N is the distance from first to last)

    26. -
      void insert(std::initializer_list< value_type > il);
      +
      void insert(std::initializer_list< value_type > il);

      Effects: inserts each element from the range [il.begin(),il.end()) if and only if there is no element with key equivalent to the key of that element.

      Complexity: At most N log(size()+N) (N is the distance from il.begin() to il.end())

    27. -
      iterator insert(node_type && nh);
      +
      iterator insert(node_type && nh);

      Effects: Inserts a new value move-constructed from x and returns the iterator pointing to the newly inserted element.

      Complexity: Logarithmic.

    28. -
      iterator insert(const_iterator hint, node_type && nh);
      +
      iterator insert(const_iterator hint, node_type && nh);

      Effects: Inserts a new value move constructed from x in the container. p is a hint pointing to where the insert should start to search.

      Returns: An iterator pointing to the element with key equivalent to the key of x.

      Complexity: Logarithmic in general, but amortized constant if t is inserted right before p. 

    29. template<typename C2> 
-  void merge(multiset< Key, C2, Allocator, Options > & source);
      + void merge(multiset< Key, C2, Allocator, Options > & source);

      Requires: this->get_allocator() == source.get_allocator().

      Effects: Extracts each element in source and insert it into a using the comparison object of *this.

      Postcondition: Pointers and references to the transferred elements of source refer to those same elements but as members of *this. Iterators referring to the transferred elements will continue to refer to their elements, but they now behave as iterators into *this, not into source.

      @@ -527,7 +527,7 @@ 
    30. template<typename C2> 
-  void merge(multiset< Key, C2, Allocator, Options > && source);
      + void merge(multiset< Key, C2, Allocator, Options > && source);

      Requires: this->get_allocator() == source.get_allocator().

      Effects: Extracts each element in source and insert it into a using the comparison object of *this.

      Postcondition: Pointers and references to the transferred elements of source refer to those same elements but as members of *this. Iterators referring to the transferred elements will continue to refer to their elements, but they now behave as iterators into *this, not into source.

      @@ -535,7 +535,7 @@

      Complexity: N log(a.size() + N) (N has the value source.size())

    31. -
      template<typename C2> void merge(set< Key, C2, Allocator, Options > & source);
      +
      template<typename C2> void merge(set< Key, C2, Allocator, Options > & source);

      Requires: this->get_allocator() == source.get_allocator().

      Effects: Extracts each element in source and insert it into a using the comparison object of *this.

      Postcondition: Pointers and references to the transferred elements of source refer to those same elements but as members of *this. Iterators referring to the transferred elements will continue to refer to their elements, but they now behave as iterators into *this, not into source.

      @@ -543,7 +543,7 @@

      Complexity: N log(a.size() + N) (N has the value source.size())

    32. -
      template<typename C2> void merge(set< Key, C2, Allocator, Options > && source);
      +
      template<typename C2> void merge(set< Key, C2, Allocator, Options > && source);

      Requires: this->get_allocator() == source.get_allocator().

      Effects: Extracts each element in source and insert it into a using the comparison object of *this.

      Postcondition: Pointers and references to the transferred elements of source refer to those same elements but as members of *this. Iterators referring to the transferred elements will continue to refer to their elements, but they now behave as iterators into *this, not into source.

      @@ -551,146 +551,146 @@

      Complexity: N log(a.size() + N) (N has the value source.size())

    33. -
      iterator erase(const_iterator p);
      +
      iterator erase(const_iterator p);

      Effects: Erases the element pointed to by p.

      Returns: Returns an iterator pointing to the element immediately following q prior to the element being erased. If no such element exists, returns end().

      Complexity: Amortized constant time

    34. -
      size_type erase(const key_type & x);
      +
      size_type erase(const key_type & x);

      Effects: Erases all elements in the container with key equivalent to x.

      Returns: Returns the number of erased elements.

      Complexity: log(size()) + count(k)

    35. -
      iterator erase(const_iterator first, const_iterator last);
      +
      iterator erase(const_iterator first, const_iterator last);

      Effects: Erases all the elements in the range [first, last).

      Returns: Returns last.

      Complexity: log(size())+N where N is the distance from first to last.

    36. -
      node_type extract(const_iterator p);
      +
      node_type extract(const_iterator p);

      Effects: Removes the element pointed to by "position".

      Returns: A node_type owning the element, otherwise an empty node_type.

      Complexity: Amortized constant.

    37. -
      node_type extract(const key_type & x);
      +
      node_type extract(const key_type & x);

      Effects: Removes the first element in the container with key equivalent to k.

      Returns: A node_type owning the element if found, otherwise an empty node_type.

      Complexity: log(a.size()).

    38. -
      void swap(multiset & x) noexcept(allocator_traits_type::is_always_equal::value &&boost::container::container_detail::is_nothrow_swappable< Compare >::value));
      +
      void swap(multiset & x) noexcept(allocator_traits_type::is_always_equal::value &&boost::container::dtl::is_nothrow_swappable< Compare >::value));

      Effects: Swaps the contents of *this and x.

      Throws: Nothing.

      Complexity: Constant.

    39. -
      void clear() noexcept;
      +
      void clear() noexcept;

      Effects: erase(a.begin(),a.end()).

      Postcondition: size() == 0.

      Complexity: linear in size().

    40. -
      key_compare key_comp() const;
      +
      key_compare key_comp() const;

      Effects: Returns the comparison object out of which a was constructed.

      Complexity: Constant.

    41. -
      value_compare value_comp() const;
      +
      value_compare value_comp() const;

      Effects: Returns an object of value_compare constructed out of the comparison object.

      Complexity: Constant.

    42. -
      iterator find(const key_type & x);
      +
      iterator find(const key_type & x);

      Returns: An iterator pointing to an element with the key equivalent to x, or end() if such an element is not found.

      Complexity: Logarithmic.

    43. -
      const_iterator find(const key_type & x) const;
      +
      const_iterator find(const key_type & x) const;

      Returns: A const_iterator pointing to an element with the key equivalent to x, or end() if such an element is not found.

      Complexity: Logarithmic.

    44. -
      size_type count(const key_type & x) const;
      +
      size_type count(const key_type & x) const;

      Returns: The number of elements with key equivalent to x.

      Complexity: log(size())+count(k)

    45. -
      iterator lower_bound(const key_type & x);
      +
      iterator lower_bound(const key_type & x);

      Returns: An iterator pointing to the first element with key not less than k, or a.end() if such an element is not found.

      Complexity: Logarithmic

    46. -
      const_iterator lower_bound(const key_type & x) const;
      +
      const_iterator lower_bound(const key_type & x) const;

      Returns: A const iterator pointing to the first element with key not less than k, or a.end() if such an element is not found.

      Complexity: Logarithmic

    47. -
      iterator upper_bound(const key_type & x);
      +
      iterator upper_bound(const key_type & x);

      Returns: An iterator pointing to the first element with key not less than x, or end() if such an element is not found.

      Complexity: Logarithmic

    48. -
      const_iterator upper_bound(const key_type & x) const;
      +
      const_iterator upper_bound(const key_type & x) const;

      Returns: A const iterator pointing to the first element with key not less than x, or end() if such an element is not found.

      Complexity: Logarithmic 

    49. std::pair< const_iterator, const_iterator > 
-equal_range(const key_type & x) const;
      +equal_range(const key_type & x) const;

      Effects: Equivalent to std::make_pair(this->lower_bound(k), this->upper_bound(k)).

      Complexity: Logarithmic

    50. -
      std::pair< iterator, iterator > equal_range(const key_type & x);
      +
      std::pair< iterator, iterator > equal_range(const key_type & x);

      Effects: Equivalent to std::make_pair(this->lower_bound(k), this->upper_bound(k)).

      Complexity: Logarithmic

    51. -
      void rebalance();
      +
      void rebalance();

      Effects: Rebalances the tree. It's a no-op for Red-Black and AVL trees.

      Complexity: Linear

    -

    -multiset friend functions

    +

    +multiset friend functions

    1. -
      friend bool operator==(const multiset & x, const multiset & y);
      +
      friend bool operator==(const multiset & x, const multiset & y);

      Effects: Returns true if x and y are equal

      Complexity: Linear to the number of elements in the container.

    2. -
      friend bool operator!=(const multiset & x, const multiset & y);
      +
      friend bool operator!=(const multiset & x, const multiset & y);

      Effects: Returns true if x and y are unequal

      Complexity: Linear to the number of elements in the container.

    3. -
      friend bool operator<(const multiset & x, const multiset & y);
      +
      friend bool operator<(const multiset & x, const multiset & y);

      Effects: Returns true if x is less than y

      Complexity: Linear to the number of elements in the container.

    4. -
      friend bool operator>(const multiset & x, const multiset & y);
      +
      friend bool operator>(const multiset & x, const multiset & y);

      Effects: Returns true if x is greater than y

      Complexity: Linear to the number of elements in the container.

    5. -
      friend bool operator<=(const multiset & x, const multiset & y);
      +
      friend bool operator<=(const multiset & x, const multiset & y);

      Effects: Returns true if x is equal or less than y

      Complexity: Linear to the number of elements in the container.

    6. -
      friend bool operator>=(const multiset & x, const multiset & y);
      +
      friend bool operator>=(const multiset & x, const multiset & y);

      Effects: Returns true if x is equal or greater than y

      Complexity: Linear to the number of elements in the container.

    7. -
      friend void swap(multiset & x, multiset & y);
      +
      friend void swap(multiset & x, multiset & y);

      Effects: x.swap(y)

      Complexity: Constant.

      8. @@ -700,7 +700,8 @@
    -
    Copyright © 2009-2015 Ion Gaztanaga

    +

    Copyright © 2009-2017 Ion + Gaztanaga

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost/container/new_allocator.html b/doc/html/boost/container/new_allocator.html index d4fd00f2ad..326e3fcafc 100644 --- a/doc/html/boost/container/new_allocator.html +++ b/doc/html/boost/container/new_allocator.html @@ -7,7 +7,7 @@ - + @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -43,7 +43,7 @@ typedef const T & const_reference; typedef std::size_t size_type; typedef std::ptrdiff_t difference_type; - typedef implementation_defined propagate_on_container_move_assignment; // A integral constant of type bool with value true. + typedef implementation_defined propagate_on_container_move_assignment; // A integral constant of type bool with value true. typedef implementation_defined is_always_equal; // A integral constant of type bool with value true. // member classes/structs/unions @@ -54,87 +54,88 @@ }; // construct/copy/destruct - new_allocator() noexcept; - new_allocator(const new_allocator &) noexcept; - template<typename T2> new_allocator(const new_allocator< T2 > &) noexcept; + new_allocator() noexcept; + new_allocator(const new_allocator &) noexcept; + template<typename T2> new_allocator(const new_allocator< T2 > &) noexcept; - // public member functions - pointer allocate(size_type); - void deallocate(pointer, size_type) noexcept; - size_type max_size() const noexcept; + // public member functions + pointer allocate(size_type); + void deallocate(pointer, size_type) noexcept; + size_type max_size() const noexcept; - // friend functions - friend void swap(new_allocator &, new_allocator &) noexcept; - friend bool operator==(const new_allocator &, const new_allocator &) noexcept; - friend bool operator!=(const new_allocator &, const new_allocator &) noexcept; + // friend functions + friend void swap(new_allocator &, new_allocator &) noexcept; + friend bool operator==(const new_allocator &, const new_allocator &) noexcept; + friend bool operator!=(const new_allocator &, const new_allocator &) noexcept; };
    -

    Description

    +

    Description

    -

    +

    new_allocator public construct/copy/destruct

    1. -
      new_allocator() noexcept;
      +
      new_allocator() noexcept;

      Default constructor Never throws

    2. -
      new_allocator(const new_allocator &) noexcept;
      +
      new_allocator(const new_allocator &) noexcept;

      Constructor from other new_allocator. Never throws

    3. -
      template<typename T2> new_allocator(const new_allocator< T2 > &) noexcept;
      +
      template<typename T2> new_allocator(const new_allocator< T2 > &) noexcept;

      Constructor from related new_allocator. Never throws

    -

    -new_allocator public member functions

    +

    +new_allocator public member functions

    1. -
      pointer allocate(size_type count);
      +
      pointer allocate(size_type count);

      Allocates memory for an array of count elements. Throws std::bad_alloc if there is no enough memory

    2. -
      void deallocate(pointer ptr, size_type) noexcept;
      +
      void deallocate(pointer ptr, size_type) noexcept;

      Deallocates previously allocated memory. Never throws

    3. -
      size_type max_size() const noexcept;
      +
      size_type max_size() const noexcept;

      Returns the maximum number of elements that could be allocated. Never throws

    -

    -new_allocator friend functions

    +

    +new_allocator friend functions

    1. -
      friend void swap(new_allocator &, new_allocator &) noexcept;
      +
      friend void swap(new_allocator &, new_allocator &) noexcept;

      Swaps two allocators, does nothing because this new_allocator is stateless

    2. -
      friend bool operator==(const new_allocator &, const new_allocator &) noexcept;
      +
      friend bool operator==(const new_allocator &, const new_allocator &) noexcept;

      An new_allocator always compares to true, as memory allocated with one instance can be deallocated by another instance

    3. -
      friend bool operator!=(const new_allocator &, const new_allocator &) noexcept;
      +
      friend bool operator!=(const new_allocator &, const new_allocator &) noexcept;

      An new_allocator always compares to false, as memory allocated with one instance can be deallocated by another instance

    -

    Specializations

    -
    +

    Specializations

    +
    -
    Copyright © 2009-2015 Ion Gaztanaga

    +

    Copyright © 2009-2017 Ion + Gaztanaga

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    @@ -142,7 +143,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/container/new_allocator/rebind.html b/doc/html/boost/container/new_allocator/rebind.html index a99ab22abe..41c1b05520 100644 --- a/doc/html/boost/container/new_allocator/rebind.html +++ b/doc/html/boost/container/new_allocator/rebind.html @@ -6,7 +6,7 @@ - + @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -39,13 +39,14 @@ typedef new_allocator< T2 > other; };
    -

    Description

    +

    Description

    Obtains an new_allocator that allocates objects of type T2

    -
    Copyright © 2009-2015 Ion Gaztanaga

    +

    Copyright © 2009-2017 Ion + Gaztanaga

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    @@ -53,7 +54,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/container/new_allocator__idp55809792.html b/doc/html/boost/container/new_allocator__idp55809792.html new file mode 100644 index 0000000000..a7f936cfb8 --- /dev/null +++ b/doc/html/boost/container/new_allocator__idp55809792.html @@ -0,0 +1,118 @@ + + + + +Class new_allocator<void> + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Class new_allocator<void>

    +

    boost::container::new_allocator<void> — Specialization of new_allocator for void types.

    +
    +

    Synopsis

    +
    // In header: <boost/container/new_allocator.hpp>
+
+
+class new_allocator<void> {
+public:
+  // types
+  typedef void                   value_type;                            
+  typedef void *                 pointer;                               
+  typedef const void *           const_pointer;                         
+  typedef implementation_defined propagate_on_container_move_assignment;  // A integral constant of type bool with value true. 
+  typedef implementation_defined is_always_equal;                         // A integral constant of type bool with value true. 
+
+  // member classes/structs/unions
+  template<typename T2> 
+  struct rebind {
+    // types
+    typedef new_allocator< T2 > other;
+  };
+
+  // construct/copy/destruct
+  new_allocator() noexcept;
+  new_allocator(const new_allocator &) noexcept;
+  template<typename T2> new_allocator(const new_allocator< T2 > &) noexcept;
+
+  // friend functions
+  friend void swap(new_allocator &, new_allocator &) noexcept;
+  friend bool operator==(const new_allocator &, const new_allocator &) noexcept;
+  friend bool operator!=(const new_allocator &, const new_allocator &) noexcept;
+};
    +
    +

    Description

    +
    +

    +new_allocator + public + construct/copy/destruct

    +
      +
    1. +
      new_allocator() noexcept;
      +

      Default constructor Never throws

      +
      2. +
    2. +
      new_allocator(const new_allocator &) noexcept;
      +

      Constructor from other new_allocator. Never throws

      +
      3. +
    3. +
      template<typename T2> new_allocator(const new_allocator< T2 > &) noexcept;
      +

      Constructor from related new_allocator. Never throws

      +
      4. +
    +
    +
    +

    +new_allocator friend functions

    +
      +
    1. +
      friend void swap(new_allocator &, new_allocator &) noexcept;
      +

      Swaps two allocators, does nothing because this new_allocator is stateless

      +
      2. +
    2. +
      friend bool operator==(const new_allocator &, const new_allocator &) noexcept;
      +

      An new_allocator always compares to true, as memory allocated with one instance can be deallocated by another instance

      +
      3. +
    3. +
      friend bool operator!=(const new_allocator &, const new_allocator &) noexcept;
      +

      An new_allocator always compares to false, as memory allocated with one instance can be deallocated by another instance

      +
      4. +
    +
    +
    +
    + + + +
    Copyright © 2009-2017 Ion + Gaztanaga

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/container/new_allocator__idp55809792/rebind.html b/doc/html/boost/container/new_allocator__idp55809792/rebind.html new file mode 100644 index 0000000000..9112a1838c --- /dev/null +++ b/doc/html/boost/container/new_allocator__idp55809792/rebind.html @@ -0,0 +1,60 @@ + + + + +Struct template rebind + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Struct template rebind

    +

    boost::container::new_allocator<void>::rebind

    +
    +

    Synopsis

    +
    // In header: <boost/container/new_allocator.hpp>
+
+
+template<typename T2> 
+struct rebind {
+  // types
+  typedef new_allocator< T2 > other;
+};
    +
    +

    Description

    +

    Obtains an new_allocator that allocates objects of type T2

    +
    +
    + + + +
    Copyright © 2009-2017 Ion + Gaztanaga

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/container/new_allocator__idp62944752.html b/doc/html/boost/container/new_allocator__idp62944752.html deleted file mode 100644 index cfd828dac2..0000000000 --- a/doc/html/boost/container/new_allocator__idp62944752.html +++ /dev/null @@ -1,117 +0,0 @@ - - - - -Class new_allocator<void> - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Class new_allocator<void>

    -

    boost::container::new_allocator<void> — Specialization of new_allocator for void types.

    -
    -

    Synopsis

    -
    // In header: <boost/container/new_allocator.hpp>
-
-
-class new_allocator<void> {
-public:
-  // types
-  typedef void                   value_type;                            
-  typedef void *                 pointer;                               
-  typedef const void *           const_pointer;                         
-  typedef implementation_defined propagate_on_container_move_assignment;  // A integral constant of type bool with value true. 
-  typedef implementation_defined is_always_equal;                         // A integral constant of type bool with value true. 
-
-  // member classes/structs/unions
-  template<typename T2> 
-  struct rebind {
-    // types
-    typedef new_allocator< T2 > other;
-  };
-
-  // construct/copy/destruct
-  new_allocator() noexcept;
-  new_allocator(const new_allocator &) noexcept;
-  template<typename T2> new_allocator(const new_allocator< T2 > &) noexcept;
-
-  // friend functions
-  friend void swap(new_allocator &, new_allocator &) noexcept;
-  friend bool operator==(const new_allocator &, const new_allocator &) noexcept;
-  friend bool operator!=(const new_allocator &, const new_allocator &) noexcept;
-};
    -
    -

    Description

    -
    -

    -new_allocator - public - construct/copy/destruct

    -
      -
    1. -
      new_allocator() noexcept;
      -

      Default constructor Never throws

      -
      2. -
    2. -
      new_allocator(const new_allocator &) noexcept;
      -

      Constructor from other new_allocator. Never throws

      -
      3. -
    3. -
      template<typename T2> new_allocator(const new_allocator< T2 > &) noexcept;
      -

      Constructor from related new_allocator. Never throws

      -
      4. -
    -
    -
    -

    -new_allocator friend functions

    -
      -
    1. -
      friend void swap(new_allocator &, new_allocator &) noexcept;
      -

      Swaps two allocators, does nothing because this new_allocator is stateless

      -
      2. -
    2. -
      friend bool operator==(const new_allocator &, const new_allocator &) noexcept;
      -

      An new_allocator always compares to true, as memory allocated with one instance can be deallocated by another instance

      -
      3. -
    3. -
      friend bool operator!=(const new_allocator &, const new_allocator &) noexcept;
      -

      An new_allocator always compares to false, as memory allocated with one instance can be deallocated by another instance

      -
      4. -
    -
    -
    -
    - - - -
    Copyright © 2009-2015 Ion Gaztanaga

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/container/new_allocator__idp62944752/rebind.html b/doc/html/boost/container/new_allocator__idp62944752/rebind.html deleted file mode 100644 index e91e426668..0000000000 --- a/doc/html/boost/container/new_allocator__idp62944752/rebind.html +++ /dev/null @@ -1,59 +0,0 @@ - - - - -Struct template rebind - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Struct template rebind

    -

    boost::container::new_allocator<void>::rebind

    -
    -

    Synopsis

    -
    // In header: <boost/container/new_allocator.hpp>
-
-
-template<typename T2> 
-struct rebind {
-  // types
-  typedef new_allocator< T2 > other;
-};
    -
    -

    Description

    -

    Obtains an new_allocator that allocates objects of type T2

    -
    -
    - - - -
    Copyright © 2009-2015 Ion Gaztanaga

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/container/node_allocator.html b/doc/html/boost/container/node_allocator.html index 3c27b87802..0916924f85 100644 --- a/doc/html/boost/container/node_allocator.html +++ b/doc/html/boost/container/node_allocator.html @@ -36,14 +36,14 @@ class node_allocator { public: // types - typedef T value_type; - typedef T * pointer; - typedef const T * const_pointer; - typedef unspecified reference; - typedef unspecified const_reference; - typedef std::size_t size_type; - typedef std::ptrdiff_t difference_type; - typedef unspecified version; + typedef T value_type; + typedef T * pointer; + typedef const T * const_pointer; + typedef ::boost::container::dtl::unvoid_ref< T >::type reference; + typedef ::boost::container::dtl::unvoid_ref< const T >::type const_reference; + typedef std::size_t size_type; + typedef std::ptrdiff_t difference_type; + typedef boost::container::dtl::version_type< self_t, Version > version; // member classes/structs/unions template<typename T2> @@ -53,139 +53,139 @@ }; // construct/copy/destruct - node_allocator() noexcept; - node_allocator(const node_allocator &) noexcept; + node_allocator() noexcept; + node_allocator(const node_allocator &) noexcept; template<typename T2> - node_allocator(const node_allocator< T2, NodesPerBlock > &) noexcept; - ~node_allocator(); + node_allocator(const node_allocator< T2, NodesPerBlock > &) noexcept; + ~node_allocator(); - // public member functions - size_type max_size() const; - pointer allocate(size_type, const void * = 0); - void deallocate(const pointer &, size_type) noexcept; - pointer allocation_command(allocation_type, size_type, size_type &, + // public member functions + size_type max_size() const; + pointer allocate(size_type, const void * = 0); + void deallocate(const pointer &, size_type) noexcept; + pointer allocation_command(allocation_type, size_type, size_type &, pointer &); - size_type size(pointer) const noexcept; - pointer allocate_one(); - void allocate_individual(std::size_t, multiallocation_chain &); - void deallocate_one(pointer) noexcept; - void deallocate_individual(multiallocation_chain &) noexcept; - void allocate_many(size_type, std::size_t, multiallocation_chain &); - void allocate_many(const size_type *, size_type, multiallocation_chain &); - void deallocate_many(multiallocation_chain &) noexcept; + size_type size(pointer) const noexcept; + pointer allocate_one(); + void allocate_individual(std::size_t, multiallocation_chain &); + void deallocate_one(pointer) noexcept; + void deallocate_individual(multiallocation_chain &) noexcept; + void allocate_many(size_type, std::size_t, multiallocation_chain &); + void allocate_many(const size_type *, size_type, multiallocation_chain &); + void deallocate_many(multiallocation_chain &) noexcept; - // public static functions - static void deallocate_free_blocks() noexcept; + // public static functions + static void deallocate_free_blocks() noexcept; - // friend functions - friend void swap(self_t &, self_t &) noexcept; - friend bool operator==(const node_allocator &, const node_allocator &) noexcept; - friend bool operator!=(const node_allocator &, const node_allocator &) noexcept; + // friend functions + friend void swap(self_t &, self_t &) noexcept; + friend bool operator==(const node_allocator &, const node_allocator &) noexcept; + friend bool operator!=(const node_allocator &, const node_allocator &) noexcept; - // private member functions - pointer priv_allocation_command(allocation_type, std::size_t, size_type &, + // private member functions + pointer priv_allocation_command(allocation_type, std::size_t, size_type &, pointer &); };
    -

    Description

    +

    Description

    An STL node allocator that uses a modified DlMalloc as memory source.

    This node allocator shares a segregated storage between all instances of node_allocator with equal sizeof(T).

    NodesPerBlock is the number of nodes allocated at once when the allocator runs out of nodes

    -

    +

    node_allocator public construct/copy/destruct

    1. -
      node_allocator() noexcept;
      Default constructor.
      2. +
      node_allocator() noexcept;
      Default constructor.
    2. -
      node_allocator(const node_allocator &) noexcept;
      Copy constructor from other node_allocator.
      3. +
      node_allocator(const node_allocator &) noexcept;
      Copy constructor from other node_allocator. 
    3. template<typename T2> 
-  node_allocator(const node_allocator< T2, NodesPerBlock > &) noexcept;
      Copy constructor from related node_allocator.
      4. + node_allocator(const node_allocator< T2, NodesPerBlock > &) noexcept;Copy constructor from related node_allocator.
    4. -
      ~node_allocator();
      Destructor.
      5. +
      ~node_allocator();
      Destructor.
    -

    -node_allocator public member functions

    +

    +node_allocator public member functions

    1. -
      size_type max_size() const;
      +
      size_type max_size() const;

      Returns the number of elements that could be allocated. Never throws

    2. -
      pointer allocate(size_type count, const void * = 0);
      +
      pointer allocate(size_type count, const void * = 0);

      Allocate memory for an array of count elements. Throws std::bad_alloc if there is no enough memory

    3. -
      void deallocate(const pointer & ptr, size_type count) noexcept;
      +
      void deallocate(const pointer & ptr, size_type count) noexcept;

      Deallocate allocated memory. Never throws

      4. -
    4. pointer allocation_command(allocation_type command, size_type limit_size, 
+
    5. pointer allocation_command(allocation_type command, size_type limit_size, 
                            size_type & prefer_in_recvd_out_size, 
                            pointer & reuse);
      6. 
 
    6. 
-
      size_type size(pointer p) const noexcept;
      
+
      size_type size(pointer p) const noexcept;
      
 
      Returns maximum the number of objects the previously allocated memory pointed by p can hold. 
      
 
      7. 
 
    7. 
-
      pointer allocate_one();
      
+
      pointer allocate_one();
      
 
      Allocates just one object. Memory allocated with this function must be deallocated only with deallocate_one(). Throws bad_alloc if there is no enough memory 
      
 
      8. 
 
    8. 
-
      void allocate_individual(std::size_t num_elements, 
+
      void allocate_individual(std::size_t num_elements, 
                          multiallocation_chain & chain);
      
 
      Allocates many elements of size == 1. Elements must be individually deallocated with deallocate_one() 
      
 
      9. 
 
    9. 
-
      void deallocate_one(pointer p) noexcept;
      
+
      void deallocate_one(pointer p) noexcept;
      
 
      Deallocates memory previously allocated with allocate_one(). You should never use deallocate_one to deallocate memory allocated with other functions different from allocate_one(). Never throws 
      
 
      10. 
-
    10. void deallocate_individual(multiallocation_chain & chain) noexcept;
      11. 
+
    11. void deallocate_individual(multiallocation_chain & chain) noexcept;
      12. 
 
    12. 
-
      void allocate_many(size_type elem_size, std::size_t n_elements, 
+
      void allocate_many(size_type elem_size, std::size_t n_elements, 
                    multiallocation_chain & chain);
      
 
      Allocates many elements of size elem_size. Elements must be individually deallocated with deallocate() 
      
 
      13. 
 
    13. 
-
      void allocate_many(const size_type * elem_sizes, size_type n_elements, 
+
      void allocate_many(const size_type * elem_sizes, size_type n_elements, 
                    multiallocation_chain & chain);
      
 
      Allocates n_elements elements, each one of size elem_sizes[i] Elements must be individually deallocated with deallocate() 
      
 
      14. 
-
    14. void deallocate_many(multiallocation_chain & chain) noexcept;
      15. 
+
    15. void deallocate_many(multiallocation_chain & chain) noexcept;
      16.
    -

    -node_allocator public static functions

    +

    +node_allocator public static functions

    1. -
      static void deallocate_free_blocks() noexcept;
      Deallocates all free blocks of the pool.
    +
    static void deallocate_free_blocks() noexcept;
    Deallocates all free blocks of the pool.
    -

    -node_allocator friend functions

    +

    +node_allocator friend functions

    1. -
      friend void swap(self_t &, self_t &) noexcept;
      +
      friend void swap(self_t &, self_t &) noexcept;

      Swaps allocators. Does not throw. If each allocator is placed in a different memory segment, the result is undefined.

    2. -
      friend bool operator==(const node_allocator &, const node_allocator &) noexcept;
      +
      friend bool operator==(const node_allocator &, const node_allocator &) noexcept;

      An allocator always compares to true, as memory allocated with one instance can be deallocated by another instance

    3. -
      friend bool operator!=(const node_allocator &, const node_allocator &) noexcept;
      +
      friend bool operator!=(const node_allocator &, const node_allocator &) noexcept;

      An allocator always compares to false, as memory allocated with one instance can be deallocated by another instance

    -

    -node_allocator private member functions

    -
    1. pointer priv_allocation_command(allocation_type command, 
+
      
+node_allocator private member functions
      
+
      1. pointer priv_allocation_command(allocation_type command, 
                                 std::size_t limit_size, 
                                 size_type & prefer_in_recvd_out_size, 
                                 pointer & reuse);
      
@@ -194,7 +194,8 @@
    -
    Copyright © 2009-2015 Ion Gaztanaga

    +

    Copyright © 2009-2017 Ion + Gaztanaga

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost/container/node_allocator/rebind.html b/doc/html/boost/container/node_allocator/rebind.html index 1186dee315..8d1c491221 100644 --- a/doc/html/boost/container/node_allocator/rebind.html +++ b/doc/html/boost/container/node_allocator/rebind.html @@ -6,7 +6,7 @@ - + @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -39,13 +39,14 @@ typedef node_allocator< T2, NodesPerBlock > other; };
    -

    Description

    +

    Description

    Obtains node_allocator from node_allocator

    -
    Copyright © 2009-2015 Ion Gaztanaga

    +

    Copyright © 2009-2017 Ion + Gaztanaga

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    @@ -53,7 +54,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/container/node_handle.html b/doc/html/boost/container/node_handle.html index 2da113e923..5f17ebaf9f 100644 --- a/doc/html/boost/container/node_handle.html +++ b/doc/html/boost/container/node_handle.html @@ -43,32 +43,33 @@ typedef priv_node_t container_node_type; // construct/copy/destruct - node_handle() noexcept; - node_handle(node_pointer, const nallocator_type &) noexcept; + node_handle() noexcept; + node_handle(node_pointer, const nallocator_type &) noexcept; template<typename KeyMapped2> - node_handle(node_handle< NodeAllocator, KeyMapped2 > &&, unspecified = 0) noexcept; - node_handle(node_handle &&) noexcept; - node_handle & operator=(node_handle &&) noexcept; - ~node_handle(); + node_handle(node_handle< NodeAllocator, KeyMapped2 > &&, + typename dtl::enable_if_c< ((unsigned) dtl::is_same< KeyMapped, void >::value+(unsigned) dtl::is_same< KeyMapped2, void >::value)==1u >::type * = 0) noexcept; + node_handle(node_handle &&) noexcept; + node_handle & operator=(node_handle &&) noexcept; + ~node_handle(); - // friend functions - friend void swap(node_handle &, node_handle &) noexcept(BOOST_NOEXCEPT(x.swap(y)))); + // friend functions + friend void swap(node_handle &, node_handle &) noexcept(BOOST_NOEXCEPT(x.swap(y)))); - // public member functions - value_type & value() const noexcept; - key_type & key() const noexcept; - mapped_type & mapped() const noexcept; - allocator_type get_allocator() const; - explicit operator bool() const noexcept; - bool empty() const noexcept; - void swap(node_handle &) noexcept(nator_traits::propagate_on_container_swap::value||nator_traits::is_always_equal::value)); - node_pointer release() noexcept; - node_pointer get() const noexcept; - nallocator_type & node_alloc() noexcept; - const nallocator_type & node_alloc() const noexcept; + // public member functions + value_type & value() const noexcept; + key_type & key() const noexcept; + mapped_type & mapped() const noexcept; + allocator_type get_allocator() const; + explicit operator bool() const noexcept; + bool empty() const noexcept; + void swap(node_handle &) noexcept(nator_traits::propagate_on_container_swap::value||nator_traits::is_always_equal::value)); + node_pointer release() noexcept; + node_pointer get() const noexcept; + nallocator_type & node_alloc() noexcept; + const nallocator_type & node_alloc() const noexcept; };
    -

    Description

    +

    Description

    A node_handle is an object that accepts ownership of a single element from an associative container. It may be used to transfer that ownership to another container with compatible nodes. Containers with compatible nodes have the same node handle type. Elements may be transferred in either direction between container types in the same row:.

    Container types with compatible nodes

    map<K, T, C1, A> <-> map<K, T, C2, A>

    @@ -77,113 +78,114 @@

    set<K, C1, A> <-> multiset<K, C2, A>

    If a node handle is not empty, then it contains an allocator that is equal to the allocator of the container when the element was extracted. If a node handle is empty, it contains no allocator.

    -

    +

    node_handle public construct/copy/destruct

    1. -
      node_handle() noexcept;
      +
      node_handle() noexcept;

      Effects: Initializes m_ptr to nullptr.

      Postcondition: this->empty()

    2. -
      node_handle(node_pointer p, const nallocator_type & al) noexcept;
      +
      node_handle(node_pointer p, const nallocator_type & al) noexcept;

      Effects: Constructs a node_handle object initializing internal pointer with p. If p != nullptr copy constructs internal allocator from al. 

    3. template<typename KeyMapped2> 
-  node_handle(node_handle< NodeAllocator, KeyMapped2 > && nh, unspecified = 0) noexcept;
      + node_handle(node_handle< NodeAllocator, KeyMapped2 > && nh, + typename dtl::enable_if_c< ((unsigned) dtl::is_same< KeyMapped, void >::value+(unsigned) dtl::is_same< KeyMapped2, void >::value)==1u >::type * = 0) noexcept;

      Effects: Constructs a node_handle object initializing internal pointer with a related nh's internal pointer and assigns nullptr to the later. If nh's internal pointer was not nullptr, move constructs internal allocator with nh's internal allocator and destroy nh's internal allocator.

      Postcondition: nh.empty()

      Note: Two node_handle's are related if only one of KeyMapped template parameter of a node handle is void.

    4. -
      node_handle(node_handle && nh) noexcept;
      +
      node_handle(node_handle && nh) noexcept;

      Effects: Constructs a node_handle object initializing internal pointer with nh's internal pointer and assigns nullptr to the later. If nh's internal pointer was not nullptr, move constructs internal allocator with nh's internal allocator and destroy nh's internal allocator.

      Postcondition: nh.empty()

    5. -
      node_handle & operator=(node_handle && nh) noexcept;
      +
      node_handle & operator=(node_handle && nh) noexcept;

      Requires: Either this->empty(), or nator_traits::propagate_on_container_move_assignment is true, or node_alloc() == nh.node_alloc().

      Effects: If m_ptr != nullptr, destroys the value_type subobject in the container_node_type object pointed to by m_ptr by calling nator_traits::destroy, then deallocates m_ptr by calling nator_traits::deallocate. Assigns nh.m_ptr to m_ptr. If this->empty() or nator_traits::propagate_on_container_move_assignment is true, move assigns nh.node_alloc() to node_alloc(). Assigns nullptr to nh.m_ptr and assigns nullopt to nh.node_alloc().

      Returns: *this.

      Throws: Nothing.

    6. -
      ~node_handle();
      +
      ~node_handle();

      Effects: If !this->empty(), destroys the value_type subobject in the container_node_type object pointed to by c by calling allocator_traits<impl_defined>::destroy, then deallocates m_ptr by calling nator_traits::rebind_traits<container_node_type>::deallocate.

    -

    -node_handle friend functions

    +

    +node_handle friend functions

    1. -
      friend void swap(node_handle & x, node_handle & y) noexcept(BOOST_NOEXCEPT(x.swap(y))));
      +
      friend void swap(node_handle & x, node_handle & y) noexcept(BOOST_NOEXCEPT(x.swap(y))));

      Effects: x.swap(y).

    -

    -node_handle public member functions

    +

    +node_handle public member functions

    1. -
      value_type & value() const noexcept;
      +
      value_type & value() const noexcept;

      Requires: empty() == false.

      Returns: A reference to the value_type subobject in the container_node_type object pointed to by m_ptr

      Throws: Nothing.

    2. -
      key_type & key() const noexcept;
      +
      key_type & key() const noexcept;

      Requires: empty() == false.

      Returns: A non-const reference to the key_type member of the value_type subobject in the container_node_type object pointed to by m_ptr.

      Throws: Nothing.

      Requires: Modifying the key through the returned reference is permitted.

    3. -
      mapped_type & mapped() const noexcept;
      +
      mapped_type & mapped() const noexcept;

      Requires: empty() == false.

      Returns: A reference to the mapped_type member of the value_type subobject in the container_node_type object pointed to by m_ptr

      Throws: Nothing.

    4. -
      allocator_type get_allocator() const;
      +
      allocator_type get_allocator() const;

      Requires: empty() == false.

      Returns: A copy of the internally hold allocator.

      Throws: Nothing.

    5. -
      explicit operator bool() const noexcept;
      +
      explicit operator bool() const noexcept;

      Returns: m_ptr != nullptr.

    6. -
      bool empty() const noexcept;
      +
      bool empty() const noexcept;

      Returns: m_ptr == nullptr.

    7. -
      void swap(node_handle & nh) noexcept(nator_traits::propagate_on_container_swap::value||nator_traits::is_always_equal::value));
      +
      void swap(node_handle & nh) noexcept(nator_traits::propagate_on_container_swap::value||nator_traits::is_always_equal::value));

      Requires: this->empty(), or nh.empty(), or nator_traits::propagate_on_container_swap is true, or node_alloc() == nh.node_alloc().

      Effects: Calls swap(m_ptr, nh.m_ptr). If this->empty(), or nh.empty(), or nator_traits::propagate_on_- container_swap is true calls swap(node_alloc(), nh.node_alloc()).

    8. -
      node_pointer release() noexcept;
      +
      node_pointer release() noexcept;

      Effects: If this->empty() returns nullptr, otherwise returns m_ptr resets m_ptr to nullptr and destroys the internal allocator.

      Postcondition: this->empty()

      Note: Non-standard extensions

    9. -
      node_pointer get() const noexcept;
      +
      node_pointer get() const noexcept;

      Effects: Returns m_ptr.

      Note: Non-standard extensions

    10. -
      nallocator_type & node_alloc() noexcept;
      +
      nallocator_type & node_alloc() noexcept;

      Effects: Returns a reference to the internal node allocator.

      Note: Non-standard extensions

    11. -
      const nallocator_type & node_alloc() const noexcept;
      +
      const nallocator_type & node_alloc() const noexcept;

      Effects: Returns a reference to the internal node allocator.

      Note: Non-standard extensions

      12. @@ -193,7 +195,8 @@
    -
    Copyright © 2009-2015 Ion Gaztanaga

    +

    Copyright © 2009-2017 Ion + Gaztanaga

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost/container/operator___idp59193360.html b/doc/html/boost/container/operator___idp59193360.html new file mode 100644 index 0000000000..cc2f91457f --- /dev/null +++ b/doc/html/boost/container/operator___idp59193360.html @@ -0,0 +1,94 @@ + + + + +Function template operator== + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Function template operator==

    +

    boost::container::operator== — Checks if contents of two static_vectors are equal.

    +
    +

    Synopsis

    +
    // In header: <boost/container/static_vector.hpp>
+
+
+template<typename V, std::size_t C1, std::size_t C2> 
+  bool operator==(static_vector< V, C1 > const & x, 
+                  static_vector< V, C2 > const & y);
    +
    +

    Description

    +

    + +

    +

    Complexity. Linear O(N).

    +

    +

    +
    ++++ + + + + + + + + + + +

    Parameters:

    ++++ + + + + + + + + + + +

    x

    The first static_vector.

    y

    The second static_vector.

    Returns:

    true if containers have the same size and elements in both containers are equal.

    +
    +
    + + + +
    Copyright © 2009-2017 Ion + Gaztanaga

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/container/operator___idp59203376.html b/doc/html/boost/container/operator___idp59203376.html new file mode 100644 index 0000000000..45c11885e9 --- /dev/null +++ b/doc/html/boost/container/operator___idp59203376.html @@ -0,0 +1,94 @@ + + + + +Function template operator!= + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Function template operator!=

    +

    boost::container::operator!= — Checks if contents of two static_vectors are not equal.

    +
    +

    Synopsis

    +
    // In header: <boost/container/static_vector.hpp>
+
+
+template<typename V, std::size_t C1, std::size_t C2> 
+  bool operator!=(static_vector< V, C1 > const & x, 
+                  static_vector< V, C2 > const & y);
    +
    +

    Description

    +

    + +

    +

    Complexity. Linear O(N).

    +

    +

    +
    ++++ + + + + + + + + + + +

    Parameters:

    ++++ + + + + + + + + + + +

    x

    The first static_vector.

    y

    The second static_vector.

    Returns:

    true if containers have different size or elements in both containers are not equal.

    +
    +
    + + + +
    Copyright © 2009-2017 Ion + Gaztanaga

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/container/operator___idp59233376.html b/doc/html/boost/container/operator___idp59233376.html new file mode 100644 index 0000000000..0d4e4bc25d --- /dev/null +++ b/doc/html/boost/container/operator___idp59233376.html @@ -0,0 +1,94 @@ + + + + +Function template operator<= + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Function template operator<=

    +

    boost::container::operator<= — Lexicographically compares static_vectors.

    +
    +

    Synopsis

    +
    // In header: <boost/container/static_vector.hpp>
+
+
+template<typename V, std::size_t C1, std::size_t C2> 
+  bool operator<=(static_vector< V, C1 > const & x, 
+                  static_vector< V, C2 > const & y);
    +
    +

    Description

    +

    + +

    +

    Complexity. Linear O(N).

    +

    +

    +
    ++++ + + + + + + + + + + +

    Parameters:

    ++++ + + + + + + + + + + +

    x

    The first static_vector.

    y

    The second static_vector.

    Returns:

    true if y don't compare lexicographically less than x.

    +
    +
    + + + +
    Copyright © 2009-2017 Ion + Gaztanaga

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/container/operator___idp59243360.html b/doc/html/boost/container/operator___idp59243360.html new file mode 100644 index 0000000000..3e22ea690d --- /dev/null +++ b/doc/html/boost/container/operator___idp59243360.html @@ -0,0 +1,94 @@ + + + + +Function template operator>= + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Function template operator>=

    +

    boost::container::operator>= — Lexicographically compares static_vectors.

    +
    +

    Synopsis

    +
    // In header: <boost/container/static_vector.hpp>
+
+
+template<typename V, std::size_t C1, std::size_t C2> 
+  bool operator>=(static_vector< V, C1 > const & x, 
+                  static_vector< V, C2 > const & y);
    +
    +

    Description

    +

    + +

    +

    Complexity. Linear O(N).

    +

    +

    +
    ++++ + + + + + + + + + + +

    Parameters:

    ++++ + + + + + + + + + + +

    x

    The first static_vector.

    y

    The second static_vector.

    Returns:

    true if x don't compare lexicographically less than y.

    +
    +
    + + + +
    Copyright © 2009-2017 Ion + Gaztanaga

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/container/operator___idp66288880.html b/doc/html/boost/container/operator___idp66288880.html deleted file mode 100644 index a98fe62e6d..0000000000 --- a/doc/html/boost/container/operator___idp66288880.html +++ /dev/null @@ -1,93 +0,0 @@ - - - - -Function template operator== - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Function template operator==

    -

    boost::container::operator== — Checks if contents of two static_vectors are equal.

    -
    -

    Synopsis

    -
    // In header: <boost/container/static_vector.hpp>
-
-
-template<typename V, std::size_t C1, std::size_t C2> 
-  bool operator==(static_vector< V, C1 > const & x, 
-                  static_vector< V, C2 > const & y);
    -
    -

    Description

    -

    - -

    -

    Complexity. Linear O(N).

    -

    -

    -
    ---- - - - - - - - - - - -

    Parameters:

    ---- - - - - - - - - - - -

    x

    The first static_vector.

    y

    The second static_vector.

    Returns:

    true if containers have the same size and elements in both containers are equal.

    -
    -
    - - - -
    Copyright © 2009-2015 Ion Gaztanaga

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/container/operator___idp66298896.html b/doc/html/boost/container/operator___idp66298896.html deleted file mode 100644 index f63222f36c..0000000000 --- a/doc/html/boost/container/operator___idp66298896.html +++ /dev/null @@ -1,93 +0,0 @@ - - - - -Function template operator!= - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Function template operator!=

    -

    boost::container::operator!= — Checks if contents of two static_vectors are not equal.

    -
    -

    Synopsis

    -
    // In header: <boost/container/static_vector.hpp>
-
-
-template<typename V, std::size_t C1, std::size_t C2> 
-  bool operator!=(static_vector< V, C1 > const & x, 
-                  static_vector< V, C2 > const & y);
    -
    -

    Description

    -

    - -

    -

    Complexity. Linear O(N).

    -

    -

    -
    ---- - - - - - - - - - - -

    Parameters:

    ---- - - - - - - - - - - -

    x

    The first static_vector.

    y

    The second static_vector.

    Returns:

    true if containers have different size or elements in both containers are not equal.

    -
    -
    - - - -
    Copyright © 2009-2015 Ion Gaztanaga

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/container/operator___idp66328896.html b/doc/html/boost/container/operator___idp66328896.html deleted file mode 100644 index 0f65976f6a..0000000000 --- a/doc/html/boost/container/operator___idp66328896.html +++ /dev/null @@ -1,93 +0,0 @@ - - - - -Function template operator<= - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Function template operator<=

    -

    boost::container::operator<= — Lexicographically compares static_vectors.

    -
    -

    Synopsis

    -
    // In header: <boost/container/static_vector.hpp>
-
-
-template<typename V, std::size_t C1, std::size_t C2> 
-  bool operator<=(static_vector< V, C1 > const & x, 
-                  static_vector< V, C2 > const & y);
    -
    -

    Description

    -

    - -

    -

    Complexity. Linear O(N).

    -

    -

    -
    ---- - - - - - - - - - - -

    Parameters:

    ---- - - - - - - - - - - -

    x

    The first static_vector.

    y

    The second static_vector.

    Returns:

    true if y don't compare lexicographically less than x.

    -
    -
    - - - -
    Copyright © 2009-2015 Ion Gaztanaga

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/container/operator___idp66338880.html b/doc/html/boost/container/operator___idp66338880.html deleted file mode 100644 index a312b2af7f..0000000000 --- a/doc/html/boost/container/operator___idp66338880.html +++ /dev/null @@ -1,93 +0,0 @@ - - - - -Function template operator>= - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Function template operator>=

    -

    boost::container::operator>= — Lexicographically compares static_vectors.

    -
    -

    Synopsis

    -
    // In header: <boost/container/static_vector.hpp>
-
-
-template<typename V, std::size_t C1, std::size_t C2> 
-  bool operator>=(static_vector< V, C1 > const & x, 
-                  static_vector< V, C2 > const & y);
    -
    -

    Description

    -

    - -

    -

    Complexity. Linear O(N).

    -

    -

    -
    ---- - - - - - - - - - - -

    Parameters:

    ---- - - - - - - - - - - -

    x

    The first static_vector.

    y

    The second static_vector.

    Returns:

    true if x don't compare lexicographically less than y.

    -
    -
    - - - -
    Copyright © 2009-2015 Ion Gaztanaga

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/container/operator_idp59213408.html b/doc/html/boost/container/operator_idp59213408.html new file mode 100644 index 0000000000..2827cc7006 --- /dev/null +++ b/doc/html/boost/container/operator_idp59213408.html @@ -0,0 +1,94 @@ + + + + +Function template operator< + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Function template operator<

    +

    boost::container::operator< — Lexicographically compares static_vectors.

    +
    +

    Synopsis

    +
    // In header: <boost/container/static_vector.hpp>
+
+
+template<typename V, std::size_t C1, std::size_t C2> 
+  bool operator<(static_vector< V, C1 > const & x, 
+                 static_vector< V, C2 > const & y);
    +
    +

    Description

    +

    + +

    +

    Complexity. Linear O(N).

    +

    +

    +
    ++++ + + + + + + + + + + +

    Parameters:

    ++++ + + + + + + + + + + +

    x

    The first static_vector.

    y

    The second static_vector.

    Returns:

    true if x compares lexicographically less than y.

    +
    +
    + + + +
    Copyright © 2009-2017 Ion + Gaztanaga

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/container/operator_idp59223392.html b/doc/html/boost/container/operator_idp59223392.html new file mode 100644 index 0000000000..13a30d9a77 --- /dev/null +++ b/doc/html/boost/container/operator_idp59223392.html @@ -0,0 +1,94 @@ + + + + +Function template operator> + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Function template operator>

    +

    boost::container::operator> — Lexicographically compares static_vectors.

    +
    +

    Synopsis

    +
    // In header: <boost/container/static_vector.hpp>
+
+
+template<typename V, std::size_t C1, std::size_t C2> 
+  bool operator>(static_vector< V, C1 > const & x, 
+                 static_vector< V, C2 > const & y);
    +
    +

    Description

    +

    + +

    +

    Complexity. Linear O(N).

    +

    +

    +
    ++++ + + + + + + + + + + +

    Parameters:

    ++++ + + + + + + + + + + +

    x

    The first static_vector.

    y

    The second static_vector.

    Returns:

    true if y compares lexicographically less than x.

    +
    +
    + + + +
    Copyright © 2009-2017 Ion + Gaztanaga

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/container/operator_idp66308928.html b/doc/html/boost/container/operator_idp66308928.html deleted file mode 100644 index 07cfdc4488..0000000000 --- a/doc/html/boost/container/operator_idp66308928.html +++ /dev/null @@ -1,93 +0,0 @@ - - - - -Function template operator< - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Function template operator<

    -

    boost::container::operator< — Lexicographically compares static_vectors.

    -
    -

    Synopsis

    -
    // In header: <boost/container/static_vector.hpp>
-
-
-template<typename V, std::size_t C1, std::size_t C2> 
-  bool operator<(static_vector< V, C1 > const & x, 
-                 static_vector< V, C2 > const & y);
    -
    -

    Description

    -

    - -

    -

    Complexity. Linear O(N).

    -

    -

    -
    ---- - - - - - - - - - - -

    Parameters:

    ---- - - - - - - - - - - -

    x

    The first static_vector.

    y

    The second static_vector.

    Returns:

    true if x compares lexicographically less than y.

    -
    -
    - - - -
    Copyright © 2009-2015 Ion Gaztanaga

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/container/operator_idp66318912.html b/doc/html/boost/container/operator_idp66318912.html deleted file mode 100644 index 07047c698a..0000000000 --- a/doc/html/boost/container/operator_idp66318912.html +++ /dev/null @@ -1,93 +0,0 @@ - - - - -Function template operator> - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Function template operator>

    -

    boost::container::operator> — Lexicographically compares static_vectors.

    -
    -

    Synopsis

    -
    // In header: <boost/container/static_vector.hpp>
-
-
-template<typename V, std::size_t C1, std::size_t C2> 
-  bool operator>(static_vector< V, C1 > const & x, 
-                 static_vector< V, C2 > const & y);
    -
    -

    Description

    -

    - -

    -

    Complexity. Linear O(N).

    -

    -

    -
    ---- - - - - - - - - - - -

    Parameters:

    ---- - - - - - - - - - - -

    x

    The first static_vector.

    y

    The second static_vector.

    Returns:

    true if y compares lexicographically less than x.

    -
    -
    - - - -
    Copyright © 2009-2015 Ion Gaztanaga

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/container/optimize_size.html b/doc/html/boost/container/optimize_size.html index 3c0293f20c..b5b0ceeea7 100644 --- a/doc/html/boost/container/optimize_size.html +++ b/doc/html/boost/container/optimize_size.html @@ -36,13 +36,14 @@ struct optimize_size { };
    -

    Description

    +

    Description

    This option setter specifies if node size is optimized storing rebalancing data masked into pointers for ordered associative containers

    -
    Copyright © 2009-2015 Ion Gaztanaga

    +

    Copyright © 2009-2017 Ion + Gaztanaga

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost/container/ordered_range.html b/doc/html/boost/container/ordered_range.html index a377a4d2f2..5829f6eb44 100644 --- a/doc/html/boost/container/ordered_range.html +++ b/doc/html/boost/container/ordered_range.html @@ -7,7 +7,7 @@ - + @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -34,13 +34,14 @@ static const ordered_range_t ordered_range;
    -

    Description

    +

    Description

    Value used to tag that the input range is guaranteed to be ordered

    -
    Copyright © 2009-2015 Ion Gaztanaga

    +

    Copyright © 2009-2017 Ion + Gaztanaga

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    @@ -48,7 +49,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/container/ordered_range_t.html b/doc/html/boost/container/ordered_range_t.html index 9abab1f16c..677bf5bafa 100644 --- a/doc/html/boost/container/ordered_range_t.html +++ b/doc/html/boost/container/ordered_range_t.html @@ -36,13 +36,14 @@ struct ordered_range_t { };
    -

    Description

    +

    Description

    Type used to tag that the input range is guaranteed to be ordered

    -
    Copyright © 2009-2015 Ion Gaztanaga

    +

    Copyright © 2009-2017 Ion + Gaztanaga

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost/container/ordered_unique_range.html b/doc/html/boost/container/ordered_unique_range.html index a872341200..408371a9da 100644 --- a/doc/html/boost/container/ordered_unique_range.html +++ b/doc/html/boost/container/ordered_unique_range.html @@ -34,13 +34,14 @@ static const ordered_unique_range_t ordered_unique_range;
    -

    Description

    +

    Description

    Value used to tag that the input range is guaranteed to be ordered and unique

    -
    Copyright © 2009-2015 Ion Gaztanaga

    +

    Copyright © 2009-2017 Ion + Gaztanaga

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost/container/ordered_unique_range_t.html b/doc/html/boost/container/ordered_unique_range_t.html index 678cca9c83..71fc1405ca 100644 --- a/doc/html/boost/container/ordered_unique_range_t.html +++ b/doc/html/boost/container/ordered_unique_range_t.html @@ -36,13 +36,14 @@ struct ordered_unique_range_t : public boost::container::ordered_range_t { };
    -

    Description

    +

    Description

    Type used to tag that the input range is guaranteed to be ordered and unique

    -
    Copyright © 2009-2015 Ion Gaztanaga

    +

    Copyright © 2009-2017 Ion + Gaztanaga

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost/container/pmr/basic_string_of.html b/doc/html/boost/container/pmr/basic_string_of.html index 7b8ff67594..6f0cf77752 100644 --- a/doc/html/boost/container/pmr/basic_string_of.html +++ b/doc/html/boost/container/pmr/basic_string_of.html @@ -38,13 +38,14 @@ typedef boost::container::basic_string< CharT, Traits, polymorphic_allocator< CharT > > type; };
    -

    Description

    +

    Description

    A portable metafunction to obtain a basic_string that uses a polymorphic allocator

    -
    Copyright © 2009-2015 Ion Gaztanaga

    +

    Copyright © 2009-2017 Ion + Gaztanaga

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost/container/pmr/deque_of.html b/doc/html/boost/container/pmr/deque_of.html index c3291ff021..2281451948 100644 --- a/doc/html/boost/container/pmr/deque_of.html +++ b/doc/html/boost/container/pmr/deque_of.html @@ -38,13 +38,14 @@ typedef boost::container::deque< T, polymorphic_allocator< T > > type; };
    -

    Description

    +

    Description

    A portable metafunction to obtain a deque that uses a polymorphic allocator

    -
    Copyright © 2009-2015 Ion Gaztanaga

    +

    Copyright © 2009-2017 Ion + Gaztanaga

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost/container/pmr/flat_map_of.html b/doc/html/boost/container/pmr/flat_map_of.html index bc4698ad17..72d923ea91 100644 --- a/doc/html/boost/container/pmr/flat_map_of.html +++ b/doc/html/boost/container/pmr/flat_map_of.html @@ -32,20 +32,20 @@

    Synopsis

    // In header: <boost/container/pmr/flat_map.hpp>
 
-template<typename Key, typename T, typename Compare = std::less<Key>, 
-         typename Options = tree_assoc_defaults> 
+template<typename Key, typename T, typename Compare = std::less<Key> > 
 struct flat_map_of {
   // types
   typedef boost::container::flat_map< Key, T, Compare, polymorphic_allocator< std::pair< Key, T > > > type;
 };
    -

    Description

    +

    Description

    A portable metafunction to obtain a flat_map that uses a polymorphic allocator

    -
    Copyright © 2009-2015 Ion Gaztanaga

    +

    Copyright © 2009-2017 Ion + Gaztanaga

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost/container/pmr/flat_multimap_of.html b/doc/html/boost/container/pmr/flat_multimap_of.html index b1b0428fd5..3681ac2255 100644 --- a/doc/html/boost/container/pmr/flat_multimap_of.html +++ b/doc/html/boost/container/pmr/flat_multimap_of.html @@ -32,20 +32,20 @@

    Synopsis

    // In header: <boost/container/pmr/flat_map.hpp>
 
-template<typename Key, typename T, typename Compare = std::less<Key>, 
-         typename Options = tree_assoc_defaults> 
+template<typename Key, typename T, typename Compare = std::less<Key> > 
 struct flat_multimap_of {
   // types
   typedef boost::container::flat_multimap< Key, T, Compare, polymorphic_allocator< std::pair< Key, T > > > type;
 };
    -

    Description

    +

    Description

    A portable metafunction to obtain a flat_multimap that uses a polymorphic allocator

    -
    Copyright © 2009-2015 Ion Gaztanaga

    +

    Copyright © 2009-2017 Ion + Gaztanaga

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost/container/pmr/flat_multiset_of.html b/doc/html/boost/container/pmr/flat_multiset_of.html index 554730335b..6c3905556c 100644 --- a/doc/html/boost/container/pmr/flat_multiset_of.html +++ b/doc/html/boost/container/pmr/flat_multiset_of.html @@ -32,20 +32,20 @@

    Synopsis

    // In header: <boost/container/pmr/flat_set.hpp>
 
-template<typename Key, typename Compare = std::less<Key>, 
-         typename Options = tree_assoc_defaults> 
+template<typename Key, typename Compare = std::less<Key> > 
 struct flat_multiset_of {
   // types
   typedef boost::container::flat_multiset< Key, Compare, polymorphic_allocator< Key > > type;
 };
    -

    Description

    +

    Description

    A portable metafunction to obtain a flat_multiset that uses a polymorphic allocator

    -
    Copyright © 2009-2015 Ion Gaztanaga

    +

    Copyright © 2009-2017 Ion + Gaztanaga

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost/container/pmr/flat_set_of.html b/doc/html/boost/container/pmr/flat_set_of.html index 5b08a37692..32163c0f26 100644 --- a/doc/html/boost/container/pmr/flat_set_of.html +++ b/doc/html/boost/container/pmr/flat_set_of.html @@ -32,20 +32,20 @@

    Synopsis

    // In header: <boost/container/pmr/flat_set.hpp>
 
-template<typename Key, typename Compare = std::less<Key>, 
-         typename Options = tree_assoc_defaults> 
+template<typename Key, typename Compare = std::less<Key> > 
 struct flat_set_of {
   // types
   typedef boost::container::flat_set< Key, Compare, polymorphic_allocator< Key > > type;
 };
    -

    Description

    +

    Description

    A portable metafunction to obtain a flat_set that uses a polymorphic allocator

    -
    Copyright © 2009-2015 Ion Gaztanaga

    +

    Copyright © 2009-2017 Ion + Gaztanaga

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost/container/pmr/get_default_resource.html b/doc/html/boost/container/pmr/get_default_resource.html index c0af62b223..c6cd0b9891 100644 --- a/doc/html/boost/container/pmr/get_default_resource.html +++ b/doc/html/boost/container/pmr/get_default_resource.html @@ -35,13 +35,14 @@ memory_resource * get_default_resource();
    -

    Description

    +

    Description

    Returns: The current value of the default memory resource pointer.

    -
    Copyright © 2009-2015 Ion Gaztanaga

    +

    Copyright © 2009-2017 Ion + Gaztanaga

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost/container/pmr/list_of.html b/doc/html/boost/container/pmr/list_of.html index 5fab6a4540..226dbf3e33 100644 --- a/doc/html/boost/container/pmr/list_of.html +++ b/doc/html/boost/container/pmr/list_of.html @@ -38,13 +38,14 @@ typedef boost::container::list< T, polymorphic_allocator< T > > type; };
    -

    Description

    +

    Description

    A portable metafunction to obtain a list that uses a polymorphic allocator

    -
    Copyright © 2009-2015 Ion Gaztanaga

    +

    Copyright © 2009-2017 Ion + Gaztanaga

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost/container/pmr/map_of.html b/doc/html/boost/container/pmr/map_of.html index f1499d09bc..b563fb94a4 100644 --- a/doc/html/boost/container/pmr/map_of.html +++ b/doc/html/boost/container/pmr/map_of.html @@ -33,19 +33,20 @@ 
    // In header: <boost/container/pmr/map.hpp>
 
 template<typename Key, typename T, typename Compare = std::less<Key>, 
-         typename Options = tree_assoc_defaults> 
+         typename Options = void> 
 struct map_of {
   // types
   typedef boost::container::map< Key, T, Compare, polymorphic_allocator< std::pair< const Key, T > >, Options > type;
 };
    -

    Description

    +

    Description

    A portable metafunction to obtain a map that uses a polymorphic allocator

    -
    Copyright © 2009-2015 Ion Gaztanaga

    +

    Copyright © 2009-2017 Ion + Gaztanaga

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost/container/pmr/memory_resource.html b/doc/html/boost/container/pmr/memory_resource.html index 430768531d..9029b05c31 100644 --- a/doc/html/boost/container/pmr/memory_resource.html +++ b/doc/html/boost/container/pmr/memory_resource.html @@ -36,90 +36,90 @@ class memory_resource { public: // construct/copy/destruct - ~memory_resource(); + ~memory_resource(); - // public member functions - void * allocate(std::size_t, std::size_t = max_align); - void deallocate(void *, std::size_t, std::size_t = max_align); - bool is_equal(const memory_resource &) const noexcept; + // public member functions + void * allocate(std::size_t, std::size_t = max_align); + void deallocate(void *, std::size_t, std::size_t = max_align); + bool is_equal(const memory_resource &) const noexcept; - // friend functions - friend bool operator==(const memory_resource &, const memory_resource &) noexcept; - friend bool operator!=(const memory_resource &, const memory_resource &) noexcept; + // friend functions + friend bool operator==(const memory_resource &, const memory_resource &) noexcept; + friend bool operator!=(const memory_resource &, const memory_resource &) noexcept; - // protected member functions - virtual void * do_allocate(std::size_t, std::size_t) = 0; - virtual void do_deallocate(void *, std::size_t, std::size_t) = 0; - virtual bool do_is_equal(const memory_resource &) const = 0; + // protected member functions + virtual void * do_allocate(std::size_t, std::size_t) = 0; + virtual void do_deallocate(void *, std::size_t, std::size_t) = 0; + virtual bool do_is_equal(const memory_resource &) const = 0; // public data members static constexpr std::size_t max_align; };
    -

    Description

    +

    Description

    The memory_resource class is an abstract interface to an unbounded set of classes encapsulating memory resources.

    -

    +

    memory_resource public construct/copy/destruct

    1. -
      ~memory_resource();
      +
      ~memory_resource();

      Effects: Destroys this memory_resource.

    -

    -memory_resource public member functions

    +

    +memory_resource public member functions

    1. -
      void * allocate(std::size_t bytes, std::size_t alignment = max_align);
      +
      void * allocate(std::size_t bytes, std::size_t alignment = max_align);

      Effects: Equivalent to return do_allocate(bytes, alignment);

    2. -
      void deallocate(void * p, std::size_t bytes, 
+
      void deallocate(void * p, std::size_t bytes, 
                 std::size_t alignment = max_align);
      
 
      Effects: Equivalent to return do_deallocate(bytes, alignment);
    3. -
      bool is_equal(const memory_resource & other) const noexcept;
      +
      bool is_equal(const memory_resource & other) const noexcept;

      Effects: Equivalent to return return do_is_equal(other);

    -

    -memory_resource friend functions

    +

    +memory_resource friend functions

    1. -
      friend bool operator==(const memory_resource & a, const memory_resource & b) noexcept;
      +
      friend bool operator==(const memory_resource & a, const memory_resource & b) noexcept;

      Returns: &a == &b || a.is_equal(b).

    2. -
      friend bool operator!=(const memory_resource & a, const memory_resource & b) noexcept;
      +
      friend bool operator!=(const memory_resource & a, const memory_resource & b) noexcept;

      Returns: !(a == b).

    -

    -memory_resource protected member functions

    +

    +memory_resource protected member functions

    1. -
      virtual void * do_allocate(std::size_t bytes, std::size_t alignment) = 0;
      +
      virtual void * do_allocate(std::size_t bytes, std::size_t alignment) = 0;

      Requires: Alignment shall be a power of two.

      Returns: A derived class shall implement this function to return a pointer to allocated storage with a size of at least bytes. The returned storage is aligned to the specified alignment, if such alignment is supported; otherwise it is aligned to max_align.

      Throws: A derived class implementation shall throw an appropriate exception if it is unable to allocate memory with the requested size and alignment. 

    2. virtual void 
-do_deallocate(void * p, std::size_t bytes, std::size_t alignment) = 0;
      +do_deallocate(void * p, std::size_t bytes, std::size_t alignment) = 0;

      Requires: p shall have been returned from a prior call to allocate(bytes, alignment) on a memory resource equal to *this, and the storage at p shall not yet have been deallocated.

      Effects: A derived class shall implement this function to dispose of allocated storage.

      Throws: Nothing.

    3. -
      virtual bool do_is_equal(const memory_resource & other) const = 0;
      +
      virtual bool do_is_equal(const memory_resource & other) const = 0;

      Returns: A derived class shall implement this function to return true if memory allocated from this can be deallocated from other and vice-versa; otherwise it shall return false. [Note: The most-derived type of other might not match the type of this. For a derived class, D, a typical implementation of this function will compute dynamic_cast<const D*>(&other) and go no further (i.e., return false) if it returns nullptr. - end note].

    @@ -128,7 +128,8 @@
    -
    Copyright © 2009-2015 Ion Gaztanaga

    +

    Copyright © 2009-2017 Ion + Gaztanaga

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost/container/pmr/monotonic_buffer_resource.html b/doc/html/boost/container/pmr/monotonic_buffer_resource.html index 55fc765682..d0645e893d 100644 --- a/doc/html/boost/container/pmr/monotonic_buffer_resource.html +++ b/doc/html/boost/container/pmr/monotonic_buffer_resource.html @@ -38,32 +38,32 @@ { public: // construct/copy/destruct - explicit monotonic_buffer_resource(memory_resource * = 0) noexcept; - explicit monotonic_buffer_resource(std::size_t, memory_resource * = 0) noexcept; - monotonic_buffer_resource(void *, std::size_t, memory_resource * = 0) noexcept; - monotonic_buffer_resource(const monotonic_buffer_resource &) = delete; + explicit monotonic_buffer_resource(memory_resource * = 0) noexcept; + explicit monotonic_buffer_resource(std::size_t, memory_resource * = 0) noexcept; + monotonic_buffer_resource(void *, std::size_t, memory_resource * = 0) noexcept; + monotonic_buffer_resource(const monotonic_buffer_resource &) = delete; monotonic_buffer_resource - operator=(const monotonic_buffer_resource &) = delete; - ~monotonic_buffer_resource(); + operator=(const monotonic_buffer_resource &) = delete; + ~monotonic_buffer_resource(); - // public member functions - void release() noexcept; - memory_resource * upstream_resource() const noexcept; - std::size_t remaining_storage(std::size_t, std::size_t &) const noexcept; - std::size_t remaining_storage(std::size_t = 1u) const noexcept; - const void * current_buffer() const noexcept; - std::size_t next_buffer_size() const noexcept; + // public member functions + void release() noexcept; + memory_resource * upstream_resource() const noexcept; + std::size_t remaining_storage(std::size_t, std::size_t &) const noexcept; + std::size_t remaining_storage(std::size_t = 1u) const noexcept; + const void * current_buffer() const noexcept; + std::size_t next_buffer_size() const noexcept; - // protected member functions - virtual void * do_allocate(std::size_t, std::size_t); - virtual void do_deallocate(void *, std::size_t, std::size_t) noexcept; - virtual bool do_is_equal(const memory_resource &) const noexcept; + // protected member functions + virtual void * do_allocate(std::size_t, std::size_t); + virtual void do_deallocate(void *, std::size_t, std::size_t) noexcept; + virtual bool do_is_equal(const memory_resource &) const noexcept; // public data members static const std::size_t initial_next_buffer_size; };
    -

    Description

    +

    Description

    A monotonic_buffer_resource is a special-purpose memory resource intended for very fast memory allocations in situations where memory is used to build up a few objects and then is released all at once when the memory resource object is destroyed. It has the following qualities:

    • A call to deallocate has no effect, thus the amount of memory consumed increases monotonically until the resource is destroyed.

      • @@ -75,97 +75,97 @@

      -

      +

      monotonic_buffer_resource public construct/copy/destruct

      1. -
        explicit monotonic_buffer_resource(memory_resource * upstream = 0) noexcept;
        +
        explicit monotonic_buffer_resource(memory_resource * upstream = 0) noexcept;

        Requires: upstream shall be the address of a valid memory resource or nullptr

        Effects: If upstream is not nullptr, sets the internal resource to upstream, to get_default_resource() otherwise. Sets the internal current_buffer to nullptr and the internal next_buffer_size to an implementation-defined size.

      2. -
        explicit monotonic_buffer_resource(std::size_t initial_size, 
+
        explicit monotonic_buffer_resource(std::size_t initial_size, 
                                    memory_resource * upstream = 0) noexcept;
        
 
        Requires: upstream shall be the address of a valid memory resource or nullptr and initial_size shall be greater than zero.
        
 
        Effects: If upstream is not nullptr, sets the internal resource to upstream, to get_default_resource() otherwise. Sets the internal current_buffer to nullptr and next_buffer_size to at least initial_size.
      3. -
        monotonic_buffer_resource(void * buffer, std::size_t buffer_size, 
+
        monotonic_buffer_resource(void * buffer, std::size_t buffer_size, 
                           memory_resource * upstream = 0) noexcept;
        
 
        Requires: upstream shall be the address of a valid memory resource or nullptr, buffer_size shall be no larger than the number of bytes in buffer.
        
 
        Effects: If upstream is not nullptr, sets the internal resource to upstream, to get_default_resource() otherwise. Sets the internal current_buffer to buffer, and next_buffer_size to buffer_size (but not less than an implementation-defined size), then increases next_buffer_size by an implementation-defined growth factor (which need not be integral).
        4. -
      4. monotonic_buffer_resource(const monotonic_buffer_resource &) = delete;
        5. +
      5. monotonic_buffer_resource(const monotonic_buffer_resource &) = delete;
      6. monotonic_buffer_resource 
-operator=(const monotonic_buffer_resource &) = delete;
        7. +operator=(const monotonic_buffer_resource &) = delete;
      7. -
        ~monotonic_buffer_resource();
        +
        ~monotonic_buffer_resource();

        Effects: Calls this->release().

      -

      -monotonic_buffer_resource public member functions

      +

      +monotonic_buffer_resource public member functions

      1. -
        void release() noexcept;
        +
        void release() noexcept;

        Effects: upstream_resource()->deallocate() as necessary to release all allocated memory. [Note: memory is released back to upstream_resource() even if some blocks that were allocated from this have not been deallocated from this. - end note]

      2. -
        memory_resource * upstream_resource() const noexcept;
        +
        memory_resource * upstream_resource() const noexcept;

        Returns: The value of the internal resource.

      3. -
        std::size_t remaining_storage(std::size_t alignment, 
+
        std::size_t remaining_storage(std::size_t alignment, 
                               std::size_t & wasted_due_to_alignment) const noexcept;
        
 
        Returns: The number of bytes of storage available for the specified alignment and the number of bytes wasted due to the requested alignment.
        
 
        Note: Non-standard extension.
      4. -
        std::size_t remaining_storage(std::size_t alignment = 1u) const noexcept;
        +
        std::size_t remaining_storage(std::size_t alignment = 1u) const noexcept;

        Returns: The number of bytes of storage available for the specified alignment.

        Note: Non-standard extension.

      5. -
        const void * current_buffer() const noexcept;
        +
        const void * current_buffer() const noexcept;

        Returns: The number of bytes of storage available for the specified alignment.

        Note: Non-standard extension.

      6. -
        std::size_t next_buffer_size() const noexcept;
        +
        std::size_t next_buffer_size() const noexcept;

        Returns: The number of bytes that will be requested for the next buffer once the current one is exhausted.

        Note: Non-standard extension.

      -

      -monotonic_buffer_resource protected member functions

      +

      +monotonic_buffer_resource protected member functions

      1. -
        virtual void * do_allocate(std::size_t bytes, std::size_t alignment);
        +
        virtual void * do_allocate(std::size_t bytes, std::size_t alignment);

        Returns: A pointer to allocated storage with a size of at least bytes. The size and alignment of the allocated memory shall meet the requirements for a class derived from memory_resource.

        Effects: If the unused space in the internal current_buffer can fit a block with the specified bytes and alignment, then allocate the return block from the internal current_buffer; otherwise sets the internal current_buffer to upstream_resource()->allocate(n, m), where n is not less than max(bytes, next_buffer_size) and m is not less than alignment, and increase next_buffer_size by an implementation-defined growth factor (which need not be integral), then allocate the return block from the newly-allocated internal current_buffer.

        Throws: Nothing unless upstream_resource()->allocate() throws. 

      2. virtual void 
-do_deallocate(void * p, std::size_t bytes, std::size_t alignment) noexcept;
        +do_deallocate(void * p, std::size_t bytes, std::size_t alignment) noexcept;

        Effects: None

        Throws: Nothing

        Remarks: Memory used by this resource increases monotonically until its destruction.

      3. -
        virtual bool do_is_equal(const memory_resource & other) const noexcept;
        +
        virtual bool do_is_equal(const memory_resource & other) const noexcept;

        Returns: this == dynamic_cast<const monotonic_buffer_resource*>(&other).

      -

      +

      monotonic_buffer_resource public public data members

      @@ -179,7 +179,8 @@
      -
      Copyright © 2009-2015 Ion Gaztanaga

      +

      Copyright © 2009-2017 Ion + Gaztanaga

      Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

      diff --git a/doc/html/boost/container/pmr/multimap_of.html b/doc/html/boost/container/pmr/multimap_of.html index a33f66111d..2e602d6279 100644 --- a/doc/html/boost/container/pmr/multimap_of.html +++ b/doc/html/boost/container/pmr/multimap_of.html @@ -8,7 +8,7 @@ - + @@ -21,7 +21,7 @@
      -PrevUpHomeNext +PrevUpHomeNext
      @@ -33,19 +33,20 @@ 
      // In header: <boost/container/pmr/map.hpp>
 
 template<typename Key, typename T, typename Compare = std::less<Key>, 
-         typename Options = tree_assoc_defaults> 
+         typename Options = void> 
 struct multimap_of {
   // types
   typedef boost::container::multimap< Key, T, Compare, polymorphic_allocator< std::pair< const Key, T > >, Options > type;
 };
      -

      Description

      +

      Description

      A portable metafunction to obtain a multimap that uses a polymorphic allocator

      -
      Copyright © 2009-2015 Ion Gaztanaga

      +

      Copyright © 2009-2017 Ion + Gaztanaga

      Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

      @@ -53,7 +54,7 @@
      -PrevUpHomeNext +PrevUpHomeNext
      diff --git a/doc/html/boost/container/pmr/multiset_of.html b/doc/html/boost/container/pmr/multiset_of.html index e6b6de5935..591bf91ba9 100644 --- a/doc/html/boost/container/pmr/multiset_of.html +++ b/doc/html/boost/container/pmr/multiset_of.html @@ -33,19 +33,20 @@ 
      // In header: <boost/container/pmr/set.hpp>
 
 template<typename Key, typename Compare = std::less<Key>, 
-         typename Options = tree_assoc_defaults> 
+         typename Options = void> 
 struct multiset_of {
   // types
   typedef boost::container::multiset< Key, Compare, polymorphic_allocator< Key >, Options > type;
 };
      -

      Description

      +

      Description

      A portable metafunction to obtain a multiset that uses a polymorphic allocator

      -
      Copyright © 2009-2015 Ion Gaztanaga

      +

      Copyright © 2009-2017 Ion + Gaztanaga

      Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

      diff --git a/doc/html/boost/container/pmr/new_delete_resource.html b/doc/html/boost/container/pmr/new_delete_resource.html index 11dd59ef08..d86d87d225 100644 --- a/doc/html/boost/container/pmr/new_delete_resource.html +++ b/doc/html/boost/container/pmr/new_delete_resource.html @@ -7,7 +7,7 @@ - + @@ -21,7 +21,7 @@
      -PrevUpHomeNext +PrevUpHomeNext
      @@ -35,13 +35,14 @@ memory_resource * new_delete_resource();
      -

      Description

      +

      Description

      Returns: A pointer to a static-duration object of a type derived from memory_resource that can serve as a resource for allocating memory using global operator new and global operator delete. The same value is returned every time this function is called. For return value p and memory resource r, p->is_equal(r) returns &r == p.

      -
      Copyright © 2009-2015 Ion Gaztanaga

      +

      Copyright © 2009-2017 Ion + Gaztanaga

      Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

      @@ -49,7 +50,7 @@
      -PrevUpHomeNext +PrevUpHomeNext
      diff --git a/doc/html/boost/container/pmr/null_memory_resource.html b/doc/html/boost/container/pmr/null_memory_resource.html index 55ba914418..3f64c83fa8 100644 --- a/doc/html/boost/container/pmr/null_memory_resource.html +++ b/doc/html/boost/container/pmr/null_memory_resource.html @@ -35,13 +35,14 @@ memory_resource * null_memory_resource();
      -

      Description

      +

      Description

      Returns: A pointer to a static-duration object of a type derived from memory_resource for which allocate() always throws bad_alloc and for which deallocate() has no effect. The same value is returned every time this function is called. For return value p and memory resource r, p->is_equal(r) returns &r == p.

      -
      Copyright © 2009-2015 Ion Gaztanaga

      +

      Copyright © 2009-2017 Ion + Gaztanaga

      Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

      diff --git a/doc/html/boost/container/pmr/operator__.html b/doc/html/boost/container/pmr/operator__.html index 7c1bdc446e..2c00fb7562 100644 --- a/doc/html/boost/container/pmr/operator__.html +++ b/doc/html/boost/container/pmr/operator__.html @@ -37,13 +37,14 @@ bool operator!=(const polymorphic_allocator< T1 > & a, const polymorphic_allocator< T2 > & b);
      -

      Description

      +

      Description

      Returns: ! (a == b).

      -
      Copyright © 2009-2015 Ion Gaztanaga

      +

      Copyright © 2009-2017 Ion + Gaztanaga

      Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

      diff --git a/doc/html/boost/container/pmr/polymorphic_allocator.html b/doc/html/boost/container/pmr/polymorphic_allocator.html index b7de3a747c..0576e00cc8 100644 --- a/doc/html/boost/container/pmr/polymorphic_allocator.html +++ b/doc/html/boost/container/pmr/polymorphic_allocator.html @@ -39,86 +39,86 @@ typedef T value_type; // construct/copy/destruct - polymorphic_allocator() noexcept; - polymorphic_allocator(memory_resource *); - polymorphic_allocator(const polymorphic_allocator &); + polymorphic_allocator() noexcept; + polymorphic_allocator(memory_resource *); + polymorphic_allocator(const polymorphic_allocator &); template<typename U> - polymorphic_allocator(const polymorphic_allocator< U > &) noexcept; - polymorphic_allocator & operator=(const polymorphic_allocator &); + polymorphic_allocator(const polymorphic_allocator< U > &) noexcept; + polymorphic_allocator & operator=(const polymorphic_allocator &); - // public member functions - T * allocate(size_t); - void deallocate(T *, size_t); - template<typename U, class... Args> void construct(U *, Args &&...); - template<typename U> void destroy(U *); - polymorphic_allocator select_on_container_copy_construction() const; - memory_resource * resource() const; + // public member functions + T * allocate(size_t); + void deallocate(T *, size_t); + template<typename U, class... Args> void construct(U *, Args &&...); + template<typename U> void destroy(U *); + polymorphic_allocator select_on_container_copy_construction() const; + memory_resource * resource() const; };
      -

      Description

      +

      Description

      A specialization of class template polymorphic_allocator conforms to the Allocator requirements. Constructed with different memory resources, different instances of the same specialization of polymorphic_allocator can exhibit entirely different allocation behavior. This runtime polymorphism allows objects that use polymorphic_allocator to behave as if they used different allocator types at run time even though they use the same static allocator type.

      -

      +

      polymorphic_allocator public construct/copy/destruct

      1. -
        polymorphic_allocator() noexcept;
        +
        polymorphic_allocator() noexcept;

        Effects: Sets m_resource to get_default_resource().

      2. -
        polymorphic_allocator(memory_resource * r);
        +
        polymorphic_allocator(memory_resource * r);

        Requires: r is non-null.

        Effects: Sets m_resource to r.

        Throws: Nothing

        Notes: This constructor provides an implicit conversion from memory_resource*. Non-standard extension: if r is null m_resource is set to get_default_resource().

      3. -
        polymorphic_allocator(const polymorphic_allocator & other);
        +
        polymorphic_allocator(const polymorphic_allocator & other);

        Effects: Sets m_resource to other.resource(). 

      4. template<typename U> 
-  polymorphic_allocator(const polymorphic_allocator< U > & other) noexcept;
        + polymorphic_allocator(const polymorphic_allocator< U > & other) noexcept;

        Effects: Sets m_resource to other.resource().

      5. -
        polymorphic_allocator & operator=(const polymorphic_allocator & other);
        +
        polymorphic_allocator & operator=(const polymorphic_allocator & other);

        Effects: Sets m_resource to other.resource().

      -

      -polymorphic_allocator public member functions

      +

      +polymorphic_allocator public member functions

      1. -
        T * allocate(size_t n);
        +
        T * allocate(size_t n);

        Returns: Equivalent to static_cast<T*>(m_resource->allocate(n * sizeof(T), alignof(T))).

      2. -
        void deallocate(T * p, size_t n);
        +
        void deallocate(T * p, size_t n);

        Requires: p was allocated from a memory resource, x, equal to *m_resource, using x.allocate(n * sizeof(T), alignof(T)).

        Effects: Equivalent to m_resource->deallocate(p, n * sizeof(T), alignof(T)).

        Throws: Nothing.

      3. -
        template<typename U, class... Args> void construct(U * p, Args &&... args);
        +
        template<typename U, class... Args> void construct(U * p, Args &&... args);

        Requires: Uses-allocator construction of T with allocator *this and constructor arguments std::forward<Args>(args)... is well-formed. [Note: uses-allocator construction is always well formed for types that do not use allocators. - end note]

        Effects: Construct a T object at p by uses-allocator construction with allocator *this and constructor arguments std::forward<Args>(args)....

        Throws: Nothing unless the constructor for T throws.

      4. -
        template<typename U> void destroy(U * p);
        +
        template<typename U> void destroy(U * p);

        Effects: p->~U().

      5. -
        polymorphic_allocator select_on_container_copy_construction() const;
        +
        polymorphic_allocator select_on_container_copy_construction() const;

        Returns: Equivalent to polymorphic_allocator().

      6. -
        memory_resource * resource() const;
        +
        memory_resource * resource() const;

        Returns: m_resource.

      @@ -127,7 +127,8 @@
      -
      Copyright © 2009-2015 Ion Gaztanaga

      +

      Copyright © 2009-2017 Ion + Gaztanaga

      Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

      diff --git a/doc/html/boost/container/pmr/pool_options.html b/doc/html/boost/container/pmr/pool_options.html index 892b56a383..e36986283c 100644 --- a/doc/html/boost/container/pmr/pool_options.html +++ b/doc/html/boost/container/pmr/pool_options.html @@ -35,14 +35,14 @@ struct pool_options { // construct/copy/destruct - pool_options(); + pool_options(); // public data members std::size_t max_blocks_per_chunk; std::size_t largest_required_pool_block; };
      -

      Description

      +

      Description

      The members of pool_options comprise a set of constructor options for pool resources. The effect of each option on the pool resource behavior is described below:

      • std::size_t max_blocks_per_chunk: The maximum number of blocks that will be allocated at once from the upstream memory resource to replenish a pool. If the value of max_blocks_per_chunk is zero or is greater than an implementation-defined limit, that limit is used instead. The implementation may choose to use a smaller value than is specified in this field and may use different values for different pools.

        • @@ -51,17 +51,18 @@

        -

        +

        pool_options public construct/copy/destruct

        -
        1. pool_options();
        +
        1. pool_options();
      -
      Copyright © 2009-2015 Ion Gaztanaga

      +

      Copyright © 2009-2017 Ion + Gaztanaga

      Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

      diff --git a/doc/html/boost/container/pmr/resource_adaptor.html b/doc/html/boost/container/pmr/resource_adaptor.html index 80e955ec24..7d4ad35c80 100644 --- a/doc/html/boost/container/pmr/resource_adaptor.html +++ b/doc/html/boost/container/pmr/resource_adaptor.html @@ -35,13 +35,14 @@ typedef resource_adaptor_imp< typename allocator_traits< Allocator >::template rebind_alloc< char > > resource_adaptor;
      -

      Description

      +

      Description

      resource_adaptor<Allocator> is rendered as an alias to resource_adaptor_imp class template such that Allocator is rebound to a char value type.

      -
      Copyright © 2009-2015 Ion Gaztanaga

      +

      Copyright © 2009-2017 Ion + Gaztanaga

      Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

      diff --git a/doc/html/boost/container/pmr/resource_adaptor_imp.html b/doc/html/boost/container/pmr/resource_adaptor_imp.html index 344c98f579..55b361690c 100644 --- a/doc/html/boost/container/pmr/resource_adaptor_imp.html +++ b/doc/html/boost/container/pmr/resource_adaptor_imp.html @@ -39,25 +39,25 @@ typedef Allocator allocator_type; // construct/copy/destruct - resource_adaptor_imp(); - resource_adaptor_imp(const resource_adaptor_imp &); - resource_adaptor_imp(resource_adaptor_imp &&); - explicit resource_adaptor_imp(const Allocator &); - explicit resource_adaptor_imp(Allocator &&); - resource_adaptor_imp & operator=(const resource_adaptor_imp &); - resource_adaptor_imp & operator=(resource_adaptor_imp &&); + resource_adaptor_imp(); + resource_adaptor_imp(const resource_adaptor_imp &); + resource_adaptor_imp(resource_adaptor_imp &&); + explicit resource_adaptor_imp(const Allocator &); + explicit resource_adaptor_imp(Allocator &&); + resource_adaptor_imp & operator=(const resource_adaptor_imp &); + resource_adaptor_imp & operator=(resource_adaptor_imp &&); - // public member functions - allocator_type & get_allocator(); - const allocator_type & get_allocator() const; + // public member functions + allocator_type & get_allocator(); + const allocator_type & get_allocator() const; - // protected member functions - virtual void * do_allocate(size_t, size_t); - virtual void do_deallocate(void *, size_t, size_t); - virtual bool do_is_equal(const memory_resource &) const noexcept; + // protected member functions + virtual void * do_allocate(size_t, size_t); + virtual void do_deallocate(void *, size_t, size_t); + virtual bool do_is_equal(const memory_resource &) const noexcept; };
      -

      Description

      +

      Description

      An instance of resource_adaptor<Allocator> is an adaptor that wraps a memory_resource interface around Allocator. In order that resource_adaptor<X<T>> and resource_adaptor<X<U>> are the same type for any allocator template X and types T and U, resource_adaptor<Allocator> is rendered as an alias to this class template such that Allocator is rebound to a char value type in every specialization of the class template. The requirements on this class template are defined below. In addition to the Allocator requirements, the parameter to resource_adaptor shall meet the following additional requirements:

      • typename allocator_traits<Allocator>:: pointer shall be identical to typename allocator_traits<Allocator>:: value_type*.

        • @@ -68,68 +68,68 @@

        -

        +

        resource_adaptor_imp public construct/copy/destruct

        1. -
          resource_adaptor_imp();
          +
          resource_adaptor_imp();

          Effects: Default constructs m_alloc.

        2. -
          resource_adaptor_imp(const resource_adaptor_imp & other);
          +
          resource_adaptor_imp(const resource_adaptor_imp & other);

          Effects: Copy constructs m_alloc.

        3. -
          resource_adaptor_imp(resource_adaptor_imp && other);
          +
          resource_adaptor_imp(resource_adaptor_imp && other);

          Effects: Move constructs m_alloc.

        4. -
          explicit resource_adaptor_imp(const Allocator & a2);
          +
          explicit resource_adaptor_imp(const Allocator & a2);

          Effects: Initializes m_alloc with a2.

        5. -
          explicit resource_adaptor_imp(Allocator && a2);
          +
          explicit resource_adaptor_imp(Allocator && a2);

          Effects: Initializes m_alloc with a2.

        6. -
          resource_adaptor_imp & operator=(const resource_adaptor_imp & other);
          +
          resource_adaptor_imp & operator=(const resource_adaptor_imp & other);

          Effects: Copy assigns m_alloc.

        7. -
          resource_adaptor_imp & operator=(resource_adaptor_imp && other);
          +
          resource_adaptor_imp & operator=(resource_adaptor_imp && other);

          Effects: Move assigns m_alloc.

        -

        -resource_adaptor_imp public member functions

        +

        +resource_adaptor_imp public member functions

        1. -
          allocator_type & get_allocator();
          +
          allocator_type & get_allocator();
          Effects: Returns m_alloc.
        2. -
          const allocator_type & get_allocator() const;
          +
          const allocator_type & get_allocator() const;
          Effects: Returns m_alloc.
        -

        -resource_adaptor_imp protected member functions

        +

        +resource_adaptor_imp protected member functions

        1. -
          virtual void * do_allocate(size_t bytes, size_t alignment);
          +
          virtual void * do_allocate(size_t bytes, size_t alignment);

          Returns: Allocated memory obtained by calling m_alloc.allocate. The size and alignment of the allocated memory shall meet the requirements for a class derived from memory_resource.

        2. -
          virtual void do_deallocate(void * p, size_t bytes, size_t alignment);
          +
          virtual void do_deallocate(void * p, size_t bytes, size_t alignment);

          Requires: p was previously allocated using A.allocate, where A == m_alloc, and not subsequently deallocated.

          Effects: Returns memory to the allocator using m_alloc.deallocate().

        3. -
          virtual bool do_is_equal(const memory_resource & other) const noexcept;
          +
          virtual bool do_is_equal(const memory_resource & other) const noexcept;

          Let p be dynamic_cast<const resource_adaptor_imp*>(&other).

          Returns: false if p is null, otherwise the value of m_alloc == p->m_alloc.

          4. @@ -139,7 +139,8 @@
        -
        Copyright © 2009-2015 Ion Gaztanaga

        +

        Copyright © 2009-2017 Ion + Gaztanaga

        Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

        diff --git a/doc/html/boost/container/pmr/set_default_resource.html b/doc/html/boost/container/pmr/set_default_resource.html index 5d28450e4f..a8a8c20c9c 100644 --- a/doc/html/boost/container/pmr/set_default_resource.html +++ b/doc/html/boost/container/pmr/set_default_resource.html @@ -35,7 +35,7 @@ memory_resource * set_default_resource(memory_resource * r);
        -

        Description

        +

        Description

        Effects: If r is non-null, sets the value of the default memory resource pointer to r, otherwise sets the default memory resource pointer to new_delete_resource().

        Postconditions: get_default_resource() == r.

        Returns: The previous value of the default memory resource pointer.

        @@ -44,7 +44,8 @@
        -
        Copyright © 2009-2015 Ion Gaztanaga

        +

        Copyright © 2009-2017 Ion + Gaztanaga

        Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

        diff --git a/doc/html/boost/container/pmr/set_of.html b/doc/html/boost/container/pmr/set_of.html index ed24b978f4..0cbc1ef79d 100644 --- a/doc/html/boost/container/pmr/set_of.html +++ b/doc/html/boost/container/pmr/set_of.html @@ -33,19 +33,20 @@ 
        // In header: <boost/container/pmr/set.hpp>
 
 template<typename Key, typename Compare = std::less<Key>, 
-         typename Options = tree_assoc_defaults> 
+         typename Options = void> 
 struct set_of {
   // types
   typedef boost::container::set< Key, Compare, polymorphic_allocator< Key >, Options > type;
 };
        -

        Description

        +

        Description

        A portable metafunction to obtain a set that uses a polymorphic allocator

        -
        Copyright © 2009-2015 Ion Gaztanaga

        +

        Copyright © 2009-2017 Ion + Gaztanaga

        Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

        diff --git a/doc/html/boost/container/pmr/slist_of.html b/doc/html/boost/container/pmr/slist_of.html index 5e7decbb58..128812b5e8 100644 --- a/doc/html/boost/container/pmr/slist_of.html +++ b/doc/html/boost/container/pmr/slist_of.html @@ -7,7 +7,7 @@ - + @@ -21,7 +21,7 @@
        -PrevUpHomeNext +PrevUpHomeNext
        @@ -38,13 +38,14 @@ typedef boost::container::slist< T, polymorphic_allocator< T > > type; };
        -

        Description

        +

        Description

        A portable metafunction to obtain a slist that uses a polymorphic allocator

        -
        Copyright © 2009-2015 Ion Gaztanaga

        +

        Copyright © 2009-2017 Ion + Gaztanaga

        Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

        @@ -52,7 +53,7 @@
        -PrevUpHomeNext +PrevUpHomeNext
        diff --git a/doc/html/boost/container/pmr/small_vector_of.html b/doc/html/boost/container/pmr/small_vector_of.html index 5ee9af3ae8..ea9d48b15f 100644 --- a/doc/html/boost/container/pmr/small_vector_of.html +++ b/doc/html/boost/container/pmr/small_vector_of.html @@ -38,13 +38,14 @@ typedef boost::container::small_vector< T, N, polymorphic_allocator< T > > type; };
        -

        Description

        +

        Description

        A portable metafunction to obtain a small_vector that uses a polymorphic allocator

        -
        Copyright © 2009-2015 Ion Gaztanaga

        +

        Copyright © 2009-2017 Ion + Gaztanaga

        Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

        diff --git a/doc/html/boost/container/pmr/stable_vector_of.html b/doc/html/boost/container/pmr/stable_vector_of.html index d2de967bd4..8dd68ff227 100644 --- a/doc/html/boost/container/pmr/stable_vector_of.html +++ b/doc/html/boost/container/pmr/stable_vector_of.html @@ -38,13 +38,14 @@ typedef boost::container::stable_vector< T, polymorphic_allocator< T > > type; };
        -

        Description

        +

        Description

        A portable metafunction to obtain a stable_vector that uses a polymorphic allocator

        -
        Copyright © 2009-2015 Ion Gaztanaga

        +

        Copyright © 2009-2017 Ion + Gaztanaga

        Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

        diff --git a/doc/html/boost/container/pmr/synchronized_pool_resource.html b/doc/html/boost/container/pmr/synchronized_pool_resource.html index 16617dc2d0..49098802cb 100644 --- a/doc/html/boost/container/pmr/synchronized_pool_resource.html +++ b/doc/html/boost/container/pmr/synchronized_pool_resource.html @@ -8,7 +8,7 @@ - + @@ -21,7 +21,7 @@
        -PrevUpHomeNext +PrevUpHomeNext
        @@ -38,32 +38,32 @@ { public: // construct/copy/destruct - synchronized_pool_resource(const pool_options &, memory_resource *) noexcept; - synchronized_pool_resource() noexcept; - explicit synchronized_pool_resource(memory_resource *) noexcept; - explicit synchronized_pool_resource(const pool_options &) noexcept; - synchronized_pool_resource(const synchronized_pool_resource &) = delete; + synchronized_pool_resource(const pool_options &, memory_resource *) noexcept; + synchronized_pool_resource() noexcept; + explicit synchronized_pool_resource(memory_resource *) noexcept; + explicit synchronized_pool_resource(const pool_options &) noexcept; + synchronized_pool_resource(const synchronized_pool_resource &) = delete; synchronized_pool_resource - operator=(const synchronized_pool_resource &) = delete; - ~synchronized_pool_resource(); + operator=(const synchronized_pool_resource &) = delete; + ~synchronized_pool_resource(); - // public member functions - void release(); - memory_resource * upstream_resource() const; - pool_options options() const; - std::size_t pool_count() const; - std::size_t pool_index(std::size_t) const; - std::size_t pool_next_blocks_per_chunk(std::size_t) const; - std::size_t pool_block(std::size_t) const; - std::size_t pool_cached_blocks(std::size_t) const; + // public member functions + void release(); + memory_resource * upstream_resource() const; + pool_options options() const; + std::size_t pool_count() const; + std::size_t pool_index(std::size_t) const; + std::size_t pool_next_blocks_per_chunk(std::size_t) const; + std::size_t pool_block(std::size_t) const; + std::size_t pool_cached_blocks(std::size_t) const; - // protected member functions - virtual void * do_allocate(std::size_t, std::size_t); - virtual void do_deallocate(void *, std::size_t, std::size_t); - virtual bool do_is_equal(const memory_resource &) const noexcept; + // protected member functions + virtual void * do_allocate(std::size_t, std::size_t); + virtual void do_deallocate(void *, std::size_t, std::size_t); + virtual bool do_is_equal(const memory_resource &) const noexcept; };
        -

        Description

        +

        Description

        A synchronized_pool_resource is a general-purpose memory resources having the following qualities:

        • Each resource owns the allocated memory, and frees it on destruction, even if deallocate has not been called for some of the allocated blocks.

          • @@ -76,79 +76,79 @@

          A synchronized_pool_resource may be accessed from multiple threads without external synchronization and may have thread-specific pools to reduce synchronization costs.

          -

          +

          synchronized_pool_resource public construct/copy/destruct

          1. -
            synchronized_pool_resource(const pool_options & opts, 
+
            synchronized_pool_resource(const pool_options & opts, 
                            memory_resource * upstream) noexcept;
            
 
            Requires: upstream is the address of a valid memory resource.
            
 
            Effects: Constructs a pool resource object that will obtain memory from upstream whenever the pool resource is unable to satisfy a memory request from its own internal data structures. The resulting object will hold a copy of upstream, but will not own the resource to which upstream points. [ Note: The intention is that calls to upstream->allocate() will be substantially fewer than calls to this->allocate() in most cases. - end note The behavior of the pooling mechanism is tuned according to the value of the opts argument.
            
 
            Throws: Nothing unless upstream->allocate() throws. It is unspecified if or under what conditions this constructor calls upstream->allocate().
          2. -
            synchronized_pool_resource() noexcept;
            -

            Effects: Same as unsynchronized_pool_resource(pool_options(), get_default_resource()).

            +
            synchronized_pool_resource() noexcept;
            +

            Effects: Same as unsynchronized_pool_resource(pool_options(), get_default_resource()).

          3. -
            explicit synchronized_pool_resource(memory_resource * upstream) noexcept;
            +
            explicit synchronized_pool_resource(memory_resource * upstream) noexcept;

            Effects: Same as unsynchronized_pool_resource(pool_options(), upstream).

          4. -
            explicit synchronized_pool_resource(const pool_options & opts) noexcept;
            +
            explicit synchronized_pool_resource(const pool_options & opts) noexcept;

            Effects: Same as unsynchronized_pool_resource(opts, get_default_resource()).

            5. -
          5. synchronized_pool_resource(const synchronized_pool_resource &) = delete;
            6. +
          6. synchronized_pool_resource(const synchronized_pool_resource &) = delete;
          7. synchronized_pool_resource 
-operator=(const synchronized_pool_resource &) = delete;
            8. +operator=(const synchronized_pool_resource &) = delete;
          8. -
            ~synchronized_pool_resource();
            +
            ~synchronized_pool_resource();

            Effects: Calls this->release().

          -

          -synchronized_pool_resource public member functions

          +

          +synchronized_pool_resource public member functions

          1. -
            void release();
            +
            void release();

            Effects: Calls Calls upstream_resource()->deallocate() as necessary to release all allocated memory. [ Note: memory is released back to upstream_resource() even if deallocate has not been called for some of the allocated blocks. - end note ]

          2. -
            memory_resource * upstream_resource() const;
            +
            memory_resource * upstream_resource() const;

            Returns: The value of the upstream argument provided to the constructor of this object.

          3. -
            pool_options options() const;
            +
            pool_options options() const;

            Returns: The options that control the pooling behavior of this resource. The values in the returned struct may differ from those supplied to the pool resource constructor in that values of zero will be replaced with implementation-defined defaults and sizes may be rounded to unspecified granularity.

          4. -
            std::size_t pool_count() const;
            +
            std::size_t pool_count() const;

            Returns: The number of pools that will be used in the pool resource.

            Note: Non-standard extension.

          5. -
            std::size_t pool_index(std::size_t bytes) const;
            +
            std::size_t pool_index(std::size_t bytes) const;

            Returns: The index of the pool that will be used to serve the allocation of bytes. Returns pool_count() if bytes is bigger than options().largest_required_pool_block (no pool will be used to serve this).

            Note: Non-standard extension.

          6. -
            std::size_t pool_next_blocks_per_chunk(std::size_t pool_idx) const;
            +
            std::size_t pool_next_blocks_per_chunk(std::size_t pool_idx) const;

            Requires: pool_idx < pool_index()

            Returns: The number blocks that will be allocated in the next chunk from the pool specified by pool_idx.

            Note: Non-standard extension.

          7. -
            std::size_t pool_block(std::size_t pool_idx) const;
            +
            std::size_t pool_block(std::size_t pool_idx) const;

            Requires: pool_idx < pool_index()

            Returns: The number of bytes of the block that the specified pool_idx pool manages.

            Note: Non-standard extension.

          8. -
            std::size_t pool_cached_blocks(std::size_t pool_idx) const;
            +
            std::size_t pool_cached_blocks(std::size_t pool_idx) const;

            Requires: pool_idx < pool_index()

            Returns: The number of blocks that the specified pool_idx pool has cached and will be served without calling the upstream_allocator.

            Note: Non-standard extension.

            @@ -156,22 +156,22 @@
          -

          -synchronized_pool_resource protected member functions

          +

          +synchronized_pool_resource protected member functions

          1. -
            virtual void * do_allocate(std::size_t bytes, std::size_t alignment);
            +
            virtual void * do_allocate(std::size_t bytes, std::size_t alignment);

            Returns: A pointer to allocated storage with a size of at least bytes. The size and alignment of the allocated memory shall meet the requirements for a class derived from memory_resource.

            Effects: If the pool selected for a block of size bytes is unable to satisfy the memory request from its own internal data structures, it will call upstream_resource()->allocate() to obtain more memory. If bytes is larger than that which the largest pool can handle, then memory will be allocated using upstream_resource()->allocate().

            Throws: Nothing unless upstream_resource()->allocate() throws.

          2. -
            virtual void do_deallocate(void * p, std::size_t bytes, std::size_t alignment);
            +
            virtual void do_deallocate(void * p, std::size_t bytes, std::size_t alignment);

            Effects: Return the memory at p to the pool. It is unspecified if or under what circumstances this operation will result in a call to upstream_resource()->deallocate().

            Throws: Nothing.

          3. -
            virtual bool do_is_equal(const memory_resource & other) const noexcept;
            +
            virtual bool do_is_equal(const memory_resource & other) const noexcept;

            Returns: this == dynamic_cast<const unsynchronized_pool_resource*>(&other).

          @@ -180,7 +180,8 @@
          -
          Copyright © 2009-2015 Ion Gaztanaga

          +

          Copyright © 2009-2017 Ion + Gaztanaga

          Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

          @@ -188,7 +189,7 @@
          -PrevUpHomeNext +PrevUpHomeNext
          diff --git a/doc/html/boost/container/pmr/unsynchronized_idp56479344.html b/doc/html/boost/container/pmr/unsynchronized_idp56479344.html new file mode 100644 index 0000000000..4ecd131e2c --- /dev/null +++ b/doc/html/boost/container/pmr/unsynchronized_idp56479344.html @@ -0,0 +1,195 @@ + + + + +Class unsynchronized_pool_resource + + + + + + + + + + + + + + + +
          Boost C++ LibrariesHomeLibrariesPeopleFAQMore
          +
          +
          +PrevUpHomeNext +
          +
          +
          +
          +

          Class unsynchronized_pool_resource

          +

          boost::container::pmr::unsynchronized_pool_resource

          +
          +

          Synopsis

          +
          // In header: <boost/container/pmr/unsynchronized_pool_resource.hpp>
+
+
+class unsynchronized_pool_resource :
+  public boost::container::pmr::memory_resource
+{
+public:
+  // construct/copy/destruct
+  unsynchronized_pool_resource(const pool_options &, memory_resource *) noexcept;
+  unsynchronized_pool_resource() noexcept;
+  explicit unsynchronized_pool_resource(memory_resource *) noexcept;
+  explicit unsynchronized_pool_resource(const pool_options &) noexcept;
+  unsynchronized_pool_resource(const unsynchronized_pool_resource &) = delete;
+  unsynchronized_pool_resource 
+  operator=(const unsynchronized_pool_resource &) = delete;
+  ~unsynchronized_pool_resource();
+
+  // public member functions
+  void release();
+  memory_resource * upstream_resource() const;
+  pool_options options() const;
+  std::size_t pool_count() const;
+  std::size_t pool_index(std::size_t) const;
+  std::size_t pool_next_blocks_per_chunk(std::size_t) const;
+  std::size_t pool_block(std::size_t) const;
+  std::size_t pool_cached_blocks(std::size_t) const;
+
+  // protected member functions
+  virtual void * do_allocate(std::size_t, std::size_t);
+  virtual void do_deallocate(void *, std::size_t, std::size_t);
+  virtual bool do_is_equal(const memory_resource &) const noexcept;
+};
          +
          +

          Description

          +

          A unsynchronized_pool_resource is a general-purpose memory resources having the following qualities:

          +
            +

          • Each resource owns the allocated memory, and frees it on destruction, even if deallocate has not been called for some of the allocated blocks.

            • +

          • A pool resource consists of a collection of pools, serving requests for different block sizes. Each individual pool manages a collection of chunks that are in turn divided into blocks of uniform size, returned via calls to do_allocate. Each call to do_allocate(size, alignment) is dispatched to the pool serving the smallest blocks accommodating at least size bytes.

            • +

          • When a particular pool is exhausted, allocating a block from that pool results in the allocation of an additional chunk of memory from the upstream allocator (supplied at construction), thus replenishing the pool. With each successive replenishment, the chunk size obtained increases geometrically. [ Note: By allocating memory in chunks, the pooling strategy increases the chance that consecutive allocations will be close together in memory. - end note ]

            • +

          • Allocation requests that exceed the largest block size of any pool are fulfilled directly from the upstream allocator.

            • +

          • A pool_options struct may be passed to the pool resource constructors to tune the largest block size and the maximum chunk size.

            • +
          +

          +

          +

          An unsynchronized_pool_resource class may not be accessed from multiple threads simultaneously and thus avoids the cost of synchronization entirely in single-threaded applications.

          +
          +

          +unsynchronized_pool_resource + public + construct/copy/destruct

          +
            +
          1. +
            unsynchronized_pool_resource(const pool_options & opts, 
+                             memory_resource * upstream) noexcept;
            +

            Requires: upstream is the address of a valid memory resource.

            +

            Effects: Constructs a pool resource object that will obtain memory from upstream whenever the pool resource is unable to satisfy a memory request from its own internal data structures. The resulting object will hold a copy of upstream, but will not own the resource to which upstream points. [ Note: The intention is that calls to upstream->allocate() will be substantially fewer than calls to this->allocate() in most cases. - end note The behavior of the pooling mechanism is tuned according to the value of the opts argument.

            +

            Throws: Nothing unless upstream->allocate() throws. It is unspecified if or under what conditions this constructor calls upstream->allocate().

            +
            2. +
          2. +
            unsynchronized_pool_resource() noexcept;
            +

            Effects: Same as unsynchronized_pool_resource(pool_options(), get_default_resource()).

            +
            3. +
          3. +
            explicit unsynchronized_pool_resource(memory_resource * upstream) noexcept;
            +

            Effects: Same as unsynchronized_pool_resource(pool_options(), upstream).

            +
            4. +
          4. +
            explicit unsynchronized_pool_resource(const pool_options & opts) noexcept;
            +

            Effects: Same as unsynchronized_pool_resource(opts, get_default_resource()).

            +
            5. +
          5. unsynchronized_pool_resource(const unsynchronized_pool_resource &) = delete;
            6. +
          6. unsynchronized_pool_resource 
+operator=(const unsynchronized_pool_resource &) = delete;
            7. +
          7. +
            ~unsynchronized_pool_resource();
            +

            Effects: Calls this->release().

            +
            8. +
          +
          +
          +

          +unsynchronized_pool_resource public member functions

          +
            +
          1. +
            void release();
            +

            Effects: Calls Calls upstream_resource()->deallocate() as necessary to release all allocated memory. [ Note: memory is released back to upstream_resource() even if deallocate has not been called for some of the allocated blocks. - end note ]

            +
            2. +
          2. +
            memory_resource * upstream_resource() const;
            +

            Returns: The value of the upstream argument provided to the constructor of this object.

            +
            3. +
          3. +
            pool_options options() const;
            +

            Returns: The options that control the pooling behavior of this resource. The values in the returned struct may differ from those supplied to the pool resource constructor in that values of zero will be replaced with implementation-defined defaults and sizes may be rounded to unspecified granularity.

            +
            4. +
          4. +
            std::size_t pool_count() const;
            +

            Returns: The number of pools that will be used in the pool resource.

            +

            Note: Non-standard extension.

            +
            5. +
          5. +
            std::size_t pool_index(std::size_t bytes) const;
            +

            Returns: The index of the pool that will be used to serve the allocation of bytes. Returns pool_count() if bytes is bigger than options().largest_required_pool_block (no pool will be used to serve this).

            +

            Note: Non-standard extension.

            +
            6. +
          6. +
            std::size_t pool_next_blocks_per_chunk(std::size_t pool_idx) const;
            +

            Requires: pool_idx < pool_index()

            +

            Returns: The number blocks that will be allocated in the next chunk from the pool specified by pool_idx.

            +

            Note: Non-standard extension.

            +
            7. +
          7. +
            std::size_t pool_block(std::size_t pool_idx) const;
            +

            Requires: pool_idx < pool_index()

            +

            Returns: The number of bytes of the block that the specified pool_idx pool manages.

            +

            Note: Non-standard extension.

            +
            8. +
          8. +
            std::size_t pool_cached_blocks(std::size_t pool_idx) const;
            +

            Requires: pool_idx < pool_index()

            +

            Returns: The number of blocks that the specified pool_idx pool has cached and will be served without calling the upstream_allocator.

            +

            Note: Non-standard extension.

            +
            9. +
          +
          +
          +

          +unsynchronized_pool_resource protected member functions

          +
            +
          1. +
            virtual void * do_allocate(std::size_t bytes, std::size_t alignment);
            +

            Returns: A pointer to allocated storage with a size of at least bytes. The size and alignment of the allocated memory shall meet the requirements for a class derived from memory_resource.

            +

            Effects: If the pool selected for a block of size bytes is unable to satisfy the memory request from its own internal data structures, it will call upstream_resource()->allocate() to obtain more memory. If bytes is larger than that which the largest pool can handle, then memory will be allocated using upstream_resource()->allocate().

            +

            Throws: Nothing unless upstream_resource()->allocate() throws.

            +
            2. +
          2. +
            virtual void do_deallocate(void * p, std::size_t bytes, std::size_t alignment);
            +

            Effects: Return the memory at p to the pool. It is unspecified if or under what circumstances this operation will result in a call to upstream_resource()->deallocate().

            +

            Throws: Nothing.

            +
            3. +
          3. +
            virtual bool do_is_equal(const memory_resource & other) const noexcept;
            +

            Returns: this == dynamic_cast<const unsynchronized_pool_resource*>(&other).

            +
            4. +
          +
          +
          +
          + + + +
          Copyright © 2009-2017 Ion + Gaztanaga

          + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

          +
          +
          +
          +PrevUpHomeNext +
          + + diff --git a/doc/html/boost/container/pmr/unsynchronized_idp63576512.html b/doc/html/boost/container/pmr/unsynchronized_idp63576512.html deleted file mode 100644 index 839b263a4a..0000000000 --- a/doc/html/boost/container/pmr/unsynchronized_idp63576512.html +++ /dev/null @@ -1,194 +0,0 @@ - - - - -Class unsynchronized_pool_resource - - - - - - - - - - - - - - - -
          Boost C++ LibrariesHomeLibrariesPeopleFAQMore
          -
          -
          -PrevUpHomeNext -
          -
          -
          -
          -

          Class unsynchronized_pool_resource

          -

          boost::container::pmr::unsynchronized_pool_resource

          -
          -

          Synopsis

          -
          // In header: <boost/container/pmr/unsynchronized_pool_resource.hpp>
-
-
-class unsynchronized_pool_resource :
-  public boost::container::pmr::memory_resource
-{
-public:
-  // construct/copy/destruct
-  unsynchronized_pool_resource(const pool_options &, memory_resource *) noexcept;
-  unsynchronized_pool_resource() noexcept;
-  explicit unsynchronized_pool_resource(memory_resource *) noexcept;
-  explicit unsynchronized_pool_resource(const pool_options &) noexcept;
-  unsynchronized_pool_resource(const unsynchronized_pool_resource &) = delete;
-  unsynchronized_pool_resource 
-  operator=(const unsynchronized_pool_resource &) = delete;
-  ~unsynchronized_pool_resource();
-
-  // public member functions
-  void release();
-  memory_resource * upstream_resource() const;
-  pool_options options() const;
-  std::size_t pool_count() const;
-  std::size_t pool_index(std::size_t) const;
-  std::size_t pool_next_blocks_per_chunk(std::size_t) const;
-  std::size_t pool_block(std::size_t) const;
-  std::size_t pool_cached_blocks(std::size_t) const;
-
-  // protected member functions
-  virtual void * do_allocate(std::size_t, std::size_t);
-  virtual void do_deallocate(void *, std::size_t, std::size_t);
-  virtual bool do_is_equal(const memory_resource &) const noexcept;
-};
          -
          -

          Description

          -

          A unsynchronized_pool_resource is a general-purpose memory resources having the following qualities:

          -
            -

          • Each resource owns the allocated memory, and frees it on destruction, even if deallocate has not been called for some of the allocated blocks.

            • -

          • A pool resource consists of a collection of pools, serving requests for different block sizes. Each individual pool manages a collection of chunks that are in turn divided into blocks of uniform size, returned via calls to do_allocate. Each call to do_allocate(size, alignment) is dispatched to the pool serving the smallest blocks accommodating at least size bytes.

            • -

          • When a particular pool is exhausted, allocating a block from that pool results in the allocation of an additional chunk of memory from the upstream allocator (supplied at construction), thus replenishing the pool. With each successive replenishment, the chunk size obtained increases geometrically. [ Note: By allocating memory in chunks, the pooling strategy increases the chance that consecutive allocations will be close together in memory. - end note ]

            • -

          • Allocation requests that exceed the largest block size of any pool are fulfilled directly from the upstream allocator.

            • -

          • A pool_options struct may be passed to the pool resource constructors to tune the largest block size and the maximum chunk size.

            • -
          -

          -

          -

          An unsynchronized_pool_resource class may not be accessed from multiple threads simultaneously and thus avoids the cost of synchronization entirely in single-threaded applications.

          -
          -

          -unsynchronized_pool_resource - public - construct/copy/destruct

          -
            -
          1. -
            unsynchronized_pool_resource(const pool_options & opts, 
-                             memory_resource * upstream) noexcept;
            -

            Requires: upstream is the address of a valid memory resource.

            -

            Effects: Constructs a pool resource object that will obtain memory from upstream whenever the pool resource is unable to satisfy a memory request from its own internal data structures. The resulting object will hold a copy of upstream, but will not own the resource to which upstream points. [ Note: The intention is that calls to upstream->allocate() will be substantially fewer than calls to this->allocate() in most cases. - end note The behavior of the pooling mechanism is tuned according to the value of the opts argument.

            -

            Throws: Nothing unless upstream->allocate() throws. It is unspecified if or under what conditions this constructor calls upstream->allocate().

            -
            2. -
          2. -
            unsynchronized_pool_resource() noexcept;
            -

            Effects: Same as unsynchronized_pool_resource(pool_options(), get_default_resource()).

            -
            3. -
          3. -
            explicit unsynchronized_pool_resource(memory_resource * upstream) noexcept;
            -

            Effects: Same as unsynchronized_pool_resource(pool_options(), upstream).

            -
            4. -
          4. -
            explicit unsynchronized_pool_resource(const pool_options & opts) noexcept;
            -

            Effects: Same as unsynchronized_pool_resource(opts, get_default_resource()).

            -
            5. -
          5. unsynchronized_pool_resource(const unsynchronized_pool_resource &) = delete;
            6. -
          6. unsynchronized_pool_resource 
-operator=(const unsynchronized_pool_resource &) = delete;
            7. -
          7. -
            ~unsynchronized_pool_resource();
            -

            Effects: Calls this->release().

            -
            8. -
          -
          -
          -

          -unsynchronized_pool_resource public member functions

          -
            -
          1. -
            void release();
            -

            Effects: Calls Calls upstream_resource()->deallocate() as necessary to release all allocated memory. [ Note: memory is released back to upstream_resource() even if deallocate has not been called for some of the allocated blocks. - end note ]

            -
            2. -
          2. -
            memory_resource * upstream_resource() const;
            -

            Returns: The value of the upstream argument provided to the constructor of this object.

            -
            3. -
          3. -
            pool_options options() const;
            -

            Returns: The options that control the pooling behavior of this resource. The values in the returned struct may differ from those supplied to the pool resource constructor in that values of zero will be replaced with implementation-defined defaults and sizes may be rounded to unspecified granularity.

            -
            4. -
          4. -
            std::size_t pool_count() const;
            -

            Returns: The number of pools that will be used in the pool resource.

            -

            Note: Non-standard extension.

            -
            5. -
          5. -
            std::size_t pool_index(std::size_t bytes) const;
            -

            Returns: The index of the pool that will be used to serve the allocation of bytes. Returns pool_count() if bytes is bigger than options().largest_required_pool_block (no pool will be used to serve this).

            -

            Note: Non-standard extension.

            -
            6. -
          6. -
            std::size_t pool_next_blocks_per_chunk(std::size_t pool_idx) const;
            -

            Requires: pool_idx < pool_index()

            -

            Returns: The number blocks that will be allocated in the next chunk from the pool specified by pool_idx.

            -

            Note: Non-standard extension.

            -
            7. -
          7. -
            std::size_t pool_block(std::size_t pool_idx) const;
            -

            Requires: pool_idx < pool_index()

            -

            Returns: The number of bytes of the block that the specified pool_idx pool manages.

            -

            Note: Non-standard extension.

            -
            8. -
          8. -
            std::size_t pool_cached_blocks(std::size_t pool_idx) const;
            -

            Requires: pool_idx < pool_index()

            -

            Returns: The number of blocks that the specified pool_idx pool has cached and will be served without calling the upstream_allocator.

            -

            Note: Non-standard extension.

            -
            9. -
          -
          -
          -

          -unsynchronized_pool_resource protected member functions

          -
            -
          1. -
            virtual void * do_allocate(std::size_t bytes, std::size_t alignment);
            -

            Returns: A pointer to allocated storage with a size of at least bytes. The size and alignment of the allocated memory shall meet the requirements for a class derived from memory_resource.

            -

            Effects: If the pool selected for a block of size bytes is unable to satisfy the memory request from its own internal data structures, it will call upstream_resource()->allocate() to obtain more memory. If bytes is larger than that which the largest pool can handle, then memory will be allocated using upstream_resource()->allocate().

            -

            Throws: Nothing unless upstream_resource()->allocate() throws.

            -
            2. -
          2. -
            virtual void do_deallocate(void * p, std::size_t bytes, std::size_t alignment);
            -

            Effects: Return the memory at p to the pool. It is unspecified if or under what circumstances this operation will result in a call to upstream_resource()->deallocate().

            -

            Throws: Nothing.

            -
            3. -
          3. -
            virtual bool do_is_equal(const memory_resource & other) const noexcept;
            -

            Returns: this == dynamic_cast<const unsynchronized_pool_resource*>(&other).

            -
            4. -
          -
          -
          -
          - - - -
          Copyright © 2009-2015 Ion Gaztanaga

          - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

          -
          -
          -
          -PrevUpHomeNext -
          - - diff --git a/doc/html/boost/container/pmr/vector_of.html b/doc/html/boost/container/pmr/vector_of.html index 6400b9c935..ed3c4ed592 100644 --- a/doc/html/boost/container/pmr/vector_of.html +++ b/doc/html/boost/container/pmr/vector_of.html @@ -38,13 +38,14 @@ typedef boost::container::vector< T, polymorphic_allocator< T > > type; };
        -

        Description

        +

        Description

        A portable metafunction to obtain a vector that uses a polymorphic allocator

        -
        Copyright © 2009-2015 Ion Gaztanaga

        +

        Copyright © 2009-2017 Ion + Gaztanaga

        Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

        diff --git a/doc/html/boost/container/scoped_allocator_adaptor.html b/doc/html/boost/container/scoped_allocator_adaptor.html index 2cee9ded22..323c8dec19 100644 --- a/doc/html/boost/container/scoped_allocator_adaptor.html +++ b/doc/html/boost/container/scoped_allocator_adaptor.html @@ -7,7 +7,7 @@ - + @@ -21,7 +21,7 @@
        -PrevUpHomeNext +PrevUpHomeNext
        @@ -33,7 +33,9 @@ 
        // In header: <boost/container/scoped_allocator.hpp>
 
 template<typename OuterAlloc, typename... InnerAllocs> 
-class scoped_allocator_adaptor {
+class scoped_allocator_adaptor :
+  public dtl::scoped_allocator_adaptor_base< OuterAlloc, InnerAllocs...>
+{
 public:
   // types
   typedef OuterAlloc                                        outer_allocator_type;                  
@@ -47,9 +49,9 @@
   typedef outer_traits_type::const_pointer                  const_pointer;                         
   typedef outer_traits_type::void_pointer                   void_pointer;                          
   typedef outer_traits_type::const_void_pointer             const_void_pointer;                    
-  typedef base_type::propagate_on_container_copy_assignment propagate_on_container_copy_assignment;
-  typedef base_type::propagate_on_container_move_assignment propagate_on_container_move_assignment;
-  typedef base_type::propagate_on_container_swap            propagate_on_container_swap;           
+  typedef base_type::propagate_on_container_copy_assignment propagate_on_container_copy_assignment;
+  typedef base_type::propagate_on_container_move_assignment propagate_on_container_move_assignment;
+  typedef base_type::propagate_on_container_swap            propagate_on_container_swap;           
   typedef base_type::is_always_equal                        is_always_equal;                       
 
   // member classes/structs/unions
@@ -60,45 +62,45 @@
   };
 
   // construct/copy/destruct
-  scoped_allocator_adaptor();
-  scoped_allocator_adaptor(const scoped_allocator_adaptor &);
-  scoped_allocator_adaptor(scoped_allocator_adaptor &&);
+  scoped_allocator_adaptor();
+  scoped_allocator_adaptor(const scoped_allocator_adaptor &);
+  scoped_allocator_adaptor(scoped_allocator_adaptor &&);
   template<typename OuterA2> 
-    scoped_allocator_adaptor(OuterA2 &&, const InnerAllocs &...);
+    scoped_allocator_adaptor(OuterA2 &&, const InnerAllocs &...);
   template<typename OuterA2> 
-    scoped_allocator_adaptor(const scoped_allocator_adaptor< OuterA2, InnerAllocs...> &);
+    scoped_allocator_adaptor(const scoped_allocator_adaptor< OuterA2, InnerAllocs...> &);
   template<typename OuterA2> 
-    scoped_allocator_adaptor(scoped_allocator_adaptor< OuterA2, InnerAllocs...> &&);
-  scoped_allocator_adaptor & operator=(const scoped_allocator_adaptor &);
-  scoped_allocator_adaptor & operator=(scoped_allocator_adaptor &&);
-  ~scoped_allocator_adaptor();
+    scoped_allocator_adaptor(scoped_allocator_adaptor< OuterA2, InnerAllocs...> &&);
+  scoped_allocator_adaptor & operator=(const scoped_allocator_adaptor &);
+  scoped_allocator_adaptor & operator=(scoped_allocator_adaptor &&);
+  ~scoped_allocator_adaptor();
 
-  // public member functions
-  void swap(scoped_allocator_adaptor &);
-  outer_allocator_type & outer_allocator() noexcept;
-  const outer_allocator_type & outer_allocator() const noexcept;
-  inner_allocator_type & inner_allocator() noexcept;
-  inner_allocator_type const & inner_allocator() const noexcept;
-  size_type max_size() const noexcept;
-  template<typename T> void destroy(T *) noexcept;
-  pointer allocate(size_type);
-  pointer allocate(size_type, const_void_pointer);
-  void deallocate(pointer, size_type);
-  scoped_allocator_adaptor select_on_container_copy_construction() const;
-  template<typename T, class... Args> void construct(T *, Args &&...);
+  // public member functions
+  void swap(scoped_allocator_adaptor &);
+  outer_allocator_type & outer_allocator() noexcept;
+  const outer_allocator_type & outer_allocator() const noexcept;
+  inner_allocator_type & inner_allocator() noexcept;
+  inner_allocator_type const & inner_allocator() const noexcept;
+  size_type max_size() const noexcept;
+  template<typename T> void destroy(T *) noexcept;
+  pointer allocate(size_type);
+  pointer allocate(size_type, const_void_pointer);
+  void deallocate(pointer, size_type);
+  scoped_allocator_adaptor select_on_container_copy_construction() const;
+  template<typename T, class... Args> void construct(T *, Args &&...);
 
-  // friend functions
-  friend void swap(scoped_allocator_adaptor &, scoped_allocator_adaptor &);
+  // friend functions
+  friend void swap(scoped_allocator_adaptor &, scoped_allocator_adaptor &);
 };
        -

        Description

        +

        Description

        This class is a C++03-compatible implementation of std::scoped_allocator_adaptor. The class template scoped_allocator_adaptor is an allocator template that specifies the memory resource (the outer allocator) to be used by a container (as any other allocator does) and also specifies an inner allocator resource to be passed to the constructor of every element within the container.

        This adaptor is instantiated with one outer and zero or more inner allocator types. If instantiated with only one allocator type, the inner allocator becomes the scoped_allocator_adaptor itself, thus using the same allocator resource for the container and every element within the container and, if the elements themselves are containers, each of their elements recursively. If instantiated with more than one allocator, the first allocator is the outer allocator for use by the container, the second allocator is passed to the constructors of the container's elements, and, if the elements themselves are containers, the third allocator is passed to the elements' elements, and so on. If containers are nested to a depth greater than the number of allocators, the last allocator is used repeatedly, as in the single-allocator case, for any remaining recursions.

        [Note: The scoped_allocator_adaptor is derived from the outer allocator type so it can be substituted for the outer allocator type in most expressions. -end note]

        In the construct member functions, OUTERMOST(x) is x if x does not have an outer_allocator() member function and OUTERMOST(x.outer_allocator()) otherwise; OUTERMOST_ALLOC_TRAITS(x) is allocator_traits<decltype(OUTERMOST(x))>.

        [Note: OUTERMOST(x) and OUTERMOST_ALLOC_TRAITS(x) are recursive operations. It is incumbent upon the definition of outer_allocator() to ensure that the recursion terminates. It will terminate for all instantiations of scoped_allocator_adaptor. -end note]

        -

        +

        scoped_allocator_adaptor public types

        @@ -115,17 +117,17 @@

      • -typedef base_type::propagate_on_container_copy_assignment propagate_on_container_copy_assignment;

        +typedef base_type::propagate_on_container_copy_assignment propagate_on_container_copy_assignment;

        Type: A type with a constant boolean value == true if allocator_traits<Allocator>:: propagate_on_container_copy_assignment::value is true for any Allocator in the set of OuterAlloc and InnerAllocs..., false otherwise.

      • -typedef base_type::propagate_on_container_move_assignment propagate_on_container_move_assignment;

        +typedef base_type::propagate_on_container_move_assignment propagate_on_container_move_assignment;

        Type: A type with a constant boolean value == true if allocator_traits<Allocator>:: propagate_on_container_move_assignment::value is true for any Allocator in the set of OuterAlloc and InnerAllocs..., false otherwise.

      • -typedef base_type::propagate_on_container_swap propagate_on_container_swap;

        +typedef base_type::propagate_on_container_swap propagate_on_container_swap;

        Type: A type with a constant boolean value == true if allocator_traits<Allocator>:: propagate_on_container_swap::value is true for any Allocator in the set of OuterAlloc and InnerAllocs..., false otherwise.

      • @@ -136,97 +138,97 @@
        • -

        +

        scoped_allocator_adaptor public construct/copy/destruct

        1. -
          scoped_allocator_adaptor();
          +
          scoped_allocator_adaptor();

          Effects: value-initializes the OuterAlloc base class and the inner allocator object.

        2. -
          scoped_allocator_adaptor(const scoped_allocator_adaptor & other);
          +
          scoped_allocator_adaptor(const scoped_allocator_adaptor & other);

          Effects: initializes each allocator within the adaptor with the corresponding allocator from other.

        3. -
          scoped_allocator_adaptor(scoped_allocator_adaptor && other);
          +
          scoped_allocator_adaptor(scoped_allocator_adaptor && other);

          Effects: move constructs each allocator within the adaptor with the corresponding allocator from other. 

        4. template<typename OuterA2> 
-  scoped_allocator_adaptor(OuterA2 && outerAlloc, 
+  scoped_allocator_adaptor(OuterA2 && outerAlloc, 
                            const InnerAllocs &... innerAllocs);

          Requires: OuterAlloc shall be constructible from OuterA2.

          Effects: initializes the OuterAlloc base class with boost::forward<OuterA2>(outerAlloc) and inner with innerAllocs...(hence recursively initializing each allocator within the adaptor with the corresponding allocator from the argument list). 

        5. template<typename OuterA2> 
-  scoped_allocator_adaptor(const scoped_allocator_adaptor< OuterA2, InnerAllocs...> & other);
          + scoped_allocator_adaptor(const scoped_allocator_adaptor< OuterA2, InnerAllocs...> & other);

          Requires: OuterAlloc shall be constructible from OuterA2.

          Effects: initializes each allocator within the adaptor with the corresponding allocator from other. 

        6. template<typename OuterA2> 
-  scoped_allocator_adaptor(scoped_allocator_adaptor< OuterA2, InnerAllocs...> && other);
          + scoped_allocator_adaptor(scoped_allocator_adaptor< OuterA2, InnerAllocs...> && other);

          Requires: OuterAlloc shall be constructible from OuterA2.

          Effects: initializes each allocator within the adaptor with the corresponding allocator rvalue from other.

          7. -
        7. scoped_allocator_adaptor & operator=(const scoped_allocator_adaptor & other);
          8. -
        8. scoped_allocator_adaptor & operator=(scoped_allocator_adaptor && other);
          9. -
        9. ~scoped_allocator_adaptor();
          10. +
        10. scoped_allocator_adaptor & operator=(const scoped_allocator_adaptor & other);
          11. +
        11. scoped_allocator_adaptor & operator=(scoped_allocator_adaptor && other);
          12. +
        12. ~scoped_allocator_adaptor();
        -

        -scoped_allocator_adaptor public member functions

        +

        +scoped_allocator_adaptor public member functions

        1. -
          void swap(scoped_allocator_adaptor & r);
          +
          void swap(scoped_allocator_adaptor & r);

          Effects: swaps *this with r.

        2. -
          outer_allocator_type & outer_allocator() noexcept;
          +
          outer_allocator_type & outer_allocator() noexcept;

          Returns: static_cast<OuterAlloc&>(*this).

        3. -
          const outer_allocator_type & outer_allocator() const noexcept;
          +
          const outer_allocator_type & outer_allocator() const noexcept;

          Returns: static_cast<const OuterAlloc&>(*this).

        4. -
          inner_allocator_type & inner_allocator() noexcept;
          +
          inner_allocator_type & inner_allocator() noexcept;

          Returns: *this if sizeof...(InnerAllocs) is zero; otherwise, inner.

        5. -
          inner_allocator_type const & inner_allocator() const noexcept;
          +
          inner_allocator_type const & inner_allocator() const noexcept;

          Returns: *this if sizeof...(InnerAllocs) is zero; otherwise, inner.

        6. -
          size_type max_size() const noexcept;
          +
          size_type max_size() const noexcept;

          Returns: allocator_traits<OuterAlloc>:: max_size(outer_allocator()).

        7. -
          template<typename T> void destroy(T * p) noexcept;
          +
          template<typename T> void destroy(T * p) noexcept;

          Effects: calls OUTERMOST_ALLOC_TRAITS(*this):: destroy(OUTERMOST(*this), p).

        8. -
          pointer allocate(size_type n);
          +
          pointer allocate(size_type n);

          Returns: allocator_traits<OuterAlloc>::allocate(outer_allocator(), n).

        9. -
          pointer allocate(size_type n, const_void_pointer hint);
          +
          pointer allocate(size_type n, const_void_pointer hint);

          Returns: allocator_traits<OuterAlloc>::allocate(outer_allocator(), n, hint).

        10. -
          void deallocate(pointer p, size_type n);
          +
          void deallocate(pointer p, size_type n);

          Effects: allocator_traits<OuterAlloc>::deallocate(outer_allocator(), p, n).

        11. -
          scoped_allocator_adaptor select_on_container_copy_construction() const;
          +
          scoped_allocator_adaptor select_on_container_copy_construction() const;

          Returns: A new scoped_allocator_adaptor object where each allocator Allocator in the adaptor is initialized from the result of calling allocator_traits<Allocator>::select_on_container_copy_construction() on the corresponding allocator in *this.

        12. -
          template<typename T, class... Args> void construct(T * p, Args &&... args);
          +
          template<typename T, class... Args> void construct(T * p, Args &&... args);

          Effects: 1) If uses_allocator<T, inner_allocator_type>::value is false calls OUTERMOST_ALLOC_TRAITS(*this):: construct(OUTERMOST(*this), p, std::forward<Args>(args)...).

          2) Otherwise, if uses_allocator<T, inner_allocator_type>::value is true and is_constructible<T, allocator_arg_t, inner_allocator_type, Args...>:: value is true, calls OUTERMOST_ALLOC_TRAITS(*this):: construct(OUTERMOST(*this), p, allocator_arg, inner_allocator(), std::forward<Args>(args)...).

          [Note: In compilers without advanced decltype SFINAE support, is_constructible can't be implemented so that condition will be replaced by constructible_with_allocator_prefix<T>::value. -end note]

          @@ -238,10 +240,10 @@
        -

        -scoped_allocator_adaptor friend functions

        +

        +scoped_allocator_adaptor friend functions

        1. -
          friend void swap(scoped_allocator_adaptor & l, scoped_allocator_adaptor & r);
          +
          friend void swap(scoped_allocator_adaptor & l, scoped_allocator_adaptor & r);

          Effects: swaps *this with r.

        @@ -249,7 +251,8 @@
        -
        Copyright © 2009-2015 Ion Gaztanaga

        +

        Copyright © 2009-2017 Ion + Gaztanaga

        Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

        @@ -257,7 +260,7 @@
        -PrevUpHomeNext +PrevUpHomeNext
        diff --git a/doc/html/boost/container/scoped_allocator_adaptor/rebind.html b/doc/html/boost/container/scoped_allocator_adaptor/rebind.html index d7eb2edea1..4949b52e48 100644 --- a/doc/html/boost/container/scoped_allocator_adaptor/rebind.html +++ b/doc/html/boost/container/scoped_allocator_adaptor/rebind.html @@ -6,7 +6,7 @@ - + @@ -21,7 +21,7 @@
        -PrevUpHomeNext +PrevUpHomeNext
        @@ -39,13 +39,14 @@ typedef scoped_allocator_adaptor< typename outer_traits_type::template portable_rebind_alloc< U >::type, InnerAllocs...> other; };
        -

        Description

        +

        Description

        Type: Rebinds scoped allocator to typedef scoped_allocator_adaptor < typename outer_traits_type::template portable_rebind_alloc<U>::type , InnerAllocs... >

        -
        Copyright © 2009-2015 Ion Gaztanaga

        +

        Copyright © 2009-2017 Ion + Gaztanaga

        Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

        @@ -53,7 +54,7 @@
        -PrevUpHomeNext +PrevUpHomeNext
        diff --git a/doc/html/boost/container/set.html b/doc/html/boost/container/set.html index 5333d5a8e4..14df162beb 100644 --- a/doc/html/boost/container/set.html +++ b/doc/html/boost/container/set.html @@ -33,8 +33,7 @@ 
        // In header: <boost/container/set.hpp>
 
 template<typename Key, typename Compare = std::less<Key>, 
-         typename Allocator = new_allocator<Key>, 
-         typename Options = tree_assoc_defaults> 
+         typename Allocator = new_allocator<Key>, typename Options = void> 
 class set {
 public:
   // types
@@ -59,117 +58,117 @@
   typedef implementation_defined                                             insert_return_type;    
 
   // construct/copy/destruct
-  set() noexcept(container_detail::is_nothrow_default_constructible< Allocator >::value &&container_detail::is_nothrow_default_constructible< Compare >::value));
-  explicit set(const allocator_type &);
-  explicit set(const Compare &);
-  set(const Compare &, const allocator_type &);
-  template<typename InputIterator> set(InputIterator, InputIterator);
+  set() noexcept(dtl::is_nothrow_default_constructible< Allocator >::value &&dtl::is_nothrow_default_constructible< Compare >::value));
+  explicit set(const allocator_type &);
+  explicit set(const Compare &);
+  set(const Compare &, const allocator_type &);
+  template<typename InputIterator> set(InputIterator, InputIterator);
   template<typename InputIterator> 
-    set(InputIterator, InputIterator, const allocator_type &);
+    set(InputIterator, InputIterator, const allocator_type &);
   template<typename InputIterator> 
-    set(InputIterator, InputIterator, const Compare &);
+    set(InputIterator, InputIterator, const Compare &);
   template<typename InputIterator> 
-    set(InputIterator, InputIterator, const Compare &, const allocator_type &);
+    set(InputIterator, InputIterator, const Compare &, const allocator_type &);
   template<typename InputIterator> 
-    set(ordered_unique_range_t, InputIterator, InputIterator);
+    set(ordered_unique_range_t, InputIterator, InputIterator);
   template<typename InputIterator> 
-    set(ordered_unique_range_t, InputIterator, InputIterator, const Compare &);
+    set(ordered_unique_range_t, InputIterator, InputIterator, const Compare &);
   template<typename InputIterator> 
-    set(ordered_unique_range_t, InputIterator, InputIterator, const Compare &, 
+    set(ordered_unique_range_t, InputIterator, InputIterator, const Compare &, 
         const allocator_type &);
-  set(std::initializer_list< value_type >);
-  set(std::initializer_list< value_type >, const allocator_type &);
-  set(std::initializer_list< value_type >, const Compare &);
-  set(std::initializer_list< value_type >, const Compare &, 
+  set(std::initializer_list< value_type >);
+  set(std::initializer_list< value_type >, const allocator_type &);
+  set(std::initializer_list< value_type >, const Compare &);
+  set(std::initializer_list< value_type >, const Compare &, 
       const allocator_type &);
-  set(ordered_unique_range_t, std::initializer_list< value_type >);
-  set(ordered_unique_range_t, std::initializer_list< value_type >, 
+  set(ordered_unique_range_t, std::initializer_list< value_type >);
+  set(ordered_unique_range_t, std::initializer_list< value_type >, 
       const Compare &);
-  set(ordered_unique_range_t, std::initializer_list< value_type >, 
+  set(ordered_unique_range_t, std::initializer_list< value_type >, 
       const Compare &, const allocator_type &);
-  set(const set &);
-  set(set &&) noexcept(boost::container::container_detail::is_nothrow_move_constructible< Compare >::value));
-  set(const set &, const allocator_type &);
-  set(set &&, const allocator_type &);
-  set & operator=(const set &);
-  set & operator=(set &&) noexcept((allocator_traits_type::propagate_on_container_move_assignment::value||allocator_traits_type::is_always_equal::value)&&boost::container::container_detail::is_nothrow_move_assignable< Compare >::value));
-  set & operator=(std::initializer_list< value_type >);
+  set(const set &);
+  set(set &&) noexcept(boost::container::dtl::is_nothrow_move_constructible< Compare >::value));
+  set(const set &, const allocator_type &);
+  set(set &&, const allocator_type &);
+  set & operator=(const set &);
+  set & operator=(set &&) noexcept((allocator_traits_type::propagate_on_container_move_assignment::value||allocator_traits_type::is_always_equal::value)&&boost::container::dtl::is_nothrow_move_assignable< Compare >::value));
+  set & operator=(std::initializer_list< value_type >);
 
-  // public member functions
-  allocator_type get_allocator() const;
-  stored_allocator_type & get_stored_allocator();
-  const stored_allocator_type & get_stored_allocator() const;
-  iterator begin();
-  const_iterator begin() const;
-  const_iterator cbegin() const;
-  iterator end();
-  const_iterator end() const;
-  const_iterator cend() const;
-  reverse_iterator rbegin();
-  const_reverse_iterator rbegin() const;
-  const_reverse_iterator crbegin() const;
-  reverse_iterator rend();
-  const_reverse_iterator rend() const;
-  const_reverse_iterator crend() const;
-  bool empty() const;
-  size_type size() const;
-  size_type max_size() const;
-  template<class... Args> std::pair< iterator, bool > emplace(Args &&...);
-  template<class... Args> iterator emplace_hint(const_iterator, Args &&...);
-  std::pair< iterator, bool > insert(const value_type &);
-  std::pair< iterator, bool > insert(value_type &&);
-  iterator insert(const_iterator, const value_type &);
-  iterator insert(const_iterator, value_type &&);
-  template<typename InputIterator> void insert(InputIterator, InputIterator);
-  void insert(std::initializer_list< value_type >);
-  insert_return_type insert(node_type &&);
-  insert_return_type insert(const_iterator, node_type &&);
-  template<typename C2> void merge(set< Key, C2, Allocator, Options > &);
-  template<typename C2> void merge(set< Key, C2, Allocator, Options > &&);
-  template<typename C2> void merge(multiset< Key, C2, Allocator, Options > &);
-  template<typename C2> void merge(multiset< Key, C2, Allocator, Options > &&);
-  iterator erase(const_iterator);
-  size_type erase(const key_type &);
-  iterator erase(const_iterator, const_iterator);
-  node_type extract(const_iterator);
-  node_type extract(const key_type &);
-  void swap(set &) noexcept(allocator_traits_type::is_always_equal::value &&boost::container::container_detail::is_nothrow_swappable< Compare >::value));
-  void clear();
-  key_compare key_comp() const;
-  value_compare value_comp() const;
-  iterator find(const key_type &);
-  const_iterator find(const key_type &) const;
-  size_type count(const key_type &) const;
-  size_type count(const key_type &);
-  iterator lower_bound(const key_type &);
-  const_iterator lower_bound(const key_type &) const;
-  iterator upper_bound(const key_type &);
-  const_iterator upper_bound(const key_type &) const;
-  std::pair< iterator, iterator > equal_range(const key_type &);
+  // public member functions
+  allocator_type get_allocator() const;
+  stored_allocator_type & get_stored_allocator();
+  const stored_allocator_type & get_stored_allocator() const;
+  iterator begin();
+  const_iterator begin() const;
+  const_iterator cbegin() const;
+  iterator end();
+  const_iterator end() const;
+  const_iterator cend() const;
+  reverse_iterator rbegin();
+  const_reverse_iterator rbegin() const;
+  const_reverse_iterator crbegin() const;
+  reverse_iterator rend();
+  const_reverse_iterator rend() const;
+  const_reverse_iterator crend() const;
+  bool empty() const;
+  size_type size() const;
+  size_type max_size() const;
+  template<class... Args> std::pair< iterator, bool > emplace(Args &&...);
+  template<class... Args> iterator emplace_hint(const_iterator, Args &&...);
+  std::pair< iterator, bool > insert(const value_type &);
+  std::pair< iterator, bool > insert(value_type &&);
+  iterator insert(const_iterator, const value_type &);
+  iterator insert(const_iterator, value_type &&);
+  template<typename InputIterator> void insert(InputIterator, InputIterator);
+  void insert(std::initializer_list< value_type >);
+  insert_return_type insert(node_type &&);
+  insert_return_type insert(const_iterator, node_type &&);
+  template<typename C2> void merge(set< Key, C2, Allocator, Options > &);
+  template<typename C2> void merge(set< Key, C2, Allocator, Options > &&);
+  template<typename C2> void merge(multiset< Key, C2, Allocator, Options > &);
+  template<typename C2> void merge(multiset< Key, C2, Allocator, Options > &&);
+  iterator erase(const_iterator);
+  size_type erase(const key_type &);
+  iterator erase(const_iterator, const_iterator);
+  node_type extract(const_iterator);
+  node_type extract(const key_type &);
+  void swap(set &) noexcept(allocator_traits_type::is_always_equal::value &&boost::container::dtl::is_nothrow_swappable< Compare >::value));
+  void clear();
+  key_compare key_comp() const;
+  value_compare value_comp() const;
+  iterator find(const key_type &);
+  const_iterator find(const key_type &) const;
+  size_type count(const key_type &) const;
+  size_type count(const key_type &);
+  iterator lower_bound(const key_type &);
+  const_iterator lower_bound(const key_type &) const;
+  iterator upper_bound(const key_type &);
+  const_iterator upper_bound(const key_type &) const;
+  std::pair< iterator, iterator > equal_range(const key_type &);
   std::pair< const_iterator, const_iterator > 
-  equal_range(const key_type &) const;
-  std::pair< iterator, iterator > equal_range(const key_type &);
+  equal_range(const key_type &) const;
+  std::pair< iterator, iterator > equal_range(const key_type &);
   std::pair< const_iterator, const_iterator > 
-  equal_range(const key_type &) const;
-  void rebalance();
+  equal_range(const key_type &) const;
+  void rebalance();
 
-  // friend functions
-  friend bool operator==(const set &, const set &);
-  friend bool operator!=(const set &, const set &);
-  friend bool operator<(const set &, const set &);
-  friend bool operator>(const set &, const set &);
-  friend bool operator<=(const set &, const set &);
-  friend bool operator>=(const set &, const set &);
-  friend void swap(set &, set &);
+  // friend functions
+  friend bool operator==(const set &, const set &);
+  friend bool operator!=(const set &, const set &);
+  friend bool operator<(const set &, const set &);
+  friend bool operator>(const set &, const set &);
+  friend bool operator<=(const set &, const set &);
+  friend bool operator>=(const set &, const set &);
+  friend void swap(set &, set &);
 };
        -

        Description

        +

        Description

        A set is a kind of associative container that supports unique keys (contains at most one of each key value) and provides for fast retrieval of the keys themselves. Class set supports bidirectional iterators.

        A set satisfies all of the requirements of a container and of a reversible container , and of an associative container. A set also provides most operations described in for unique keys.

        -

        Template Parameters

        +

        Template Parameters

        1. typename Key
          @@ -184,64 +183,64 @@

          is the allocator to be used to allocate memory for this container

        2. -
          typename Options = tree_assoc_defaults
          +
          typename Options = void

          is an packed option type generated using using boost::container::tree_assoc_options.

        -

        +

        set public construct/copy/destruct

        1. -
          set() noexcept(container_detail::is_nothrow_default_constructible< Allocator >::value &&container_detail::is_nothrow_default_constructible< Compare >::value));
          +
          set() noexcept(dtl::is_nothrow_default_constructible< Allocator >::value &&dtl::is_nothrow_default_constructible< Compare >::value));

          Effects: Default constructs an empty set.

          Complexity: Constant.

        2. -
          explicit set(const allocator_type & a);
          +
          explicit set(const allocator_type & a);

          Effects: Constructs an empty set using the specified allocator object.

          Complexity: Constant.

        3. -
          explicit set(const Compare & comp);
          +
          explicit set(const Compare & comp);

          Effects: Constructs an empty set using the specified comparison object.

          Complexity: Constant.

        4. -
          set(const Compare & comp, const allocator_type & a);
          +
          set(const Compare & comp, const allocator_type & a);

          Effects: Constructs an empty set using the specified comparison object and allocator.

          Complexity: Constant.

        5. -
          template<typename InputIterator> set(InputIterator first, InputIterator last);
          +
          template<typename InputIterator> set(InputIterator first, InputIterator last);

          Effects: Constructs an empty set using and inserts elements from the range [first ,last ).

          Complexity: Linear in N if the range [first ,last ) is already sorted using the predicate and otherwise N logN, where N is last - first. 

        6. template<typename InputIterator> 
-  set(InputIterator first, InputIterator last, const allocator_type & a);
          + set(InputIterator first, InputIterator last, const allocator_type & a);

          Effects: Constructs an empty set using the specified allocator, and inserts elements from the range [first ,last ).

          Complexity: Linear in N if the range [first ,last ) is already sorted using the predicate and otherwise N logN, where N is last - first. 

        7. template<typename InputIterator> 
-  set(InputIterator first, InputIterator last, const Compare & comp);
          + set(InputIterator first, InputIterator last, const Compare & comp);

          Effects: Constructs an empty set using the specified comparison object and inserts elements from the range [first ,last ).

          Complexity: Linear in N if the range [first ,last ) is already sorted using the predicate and otherwise N logN, where N is last - first. 

        8. template<typename InputIterator> 
-  set(InputIterator first, InputIterator last, const Compare & comp, 
+  set(InputIterator first, InputIterator last, const Compare & comp, 
       const allocator_type & a);

          Effects: Constructs an empty set using the specified comparison object and allocator, and inserts elements from the range [first ,last ).

          Complexity: Linear in N if the range [first ,last ) is already sorted using the predicate and otherwise N logN, where N is last - first. 

        9. template<typename InputIterator> 
-  set(ordered_unique_range_t, InputIterator first, InputIterator last);
          + set(ordered_unique_range_t, InputIterator first, InputIterator last);

          Effects: Constructs an empty set and inserts elements from the ordered unique range [first ,last). This function is more efficient than the normal range creation for ordered ranges.

          Requires: [first ,last) must be ordered according to the predicate and must be unique values.

          Complexity: Linear in N.

          @@ -249,7 +248,7 @@ 
        10. template<typename InputIterator> 
-  set(ordered_unique_range_t, InputIterator first, InputIterator last, 
+  set(ordered_unique_range_t, InputIterator first, InputIterator last, 
       const Compare & comp);

          Effects: Constructs an empty set using the specified comparison object and inserts elements from the ordered unique range [first ,last). This function is more efficient than the normal range creation for ordered ranges.

          Requires: [first ,last) must be ordered according to the predicate and must be unique values.

          @@ -258,7 +257,7 @@ 
        11. template<typename InputIterator> 
-  set(ordered_unique_range_t, InputIterator first, InputIterator last, 
+  set(ordered_unique_range_t, InputIterator first, InputIterator last, 
       const Compare & comp, const allocator_type & a);

          Effects: Constructs an empty set using the specified comparison object and allocator, and inserts elements from the ordered unique range [first ,last). This function is more efficient than the normal range creation for ordered ranges.

          Requires: [first ,last) must be ordered according to the predicate and must be unique values.

          @@ -266,35 +265,35 @@

          Note: Non-standard extension.

        12. -
          set(std::initializer_list< value_type > il);
          +
          set(std::initializer_list< value_type > il);

          Effects: Constructs an empty set and inserts elements from the range [il.begin(), il.end()).

          Complexity: Linear in N if the range [il.begin(), il.end()) is already sorted using the predicate and otherwise N logN, where N is il.begin() - il.end().

        13. -
          set(std::initializer_list< value_type > il, const allocator_type & a);
          +
          set(std::initializer_list< value_type > il, const allocator_type & a);

          Effects: Constructs an empty set using the specified allocator, and inserts elements from the range [il.begin(), il.end()).

          Complexity: Linear in N if the range [il.begin(), il.end()) is already sorted using the predicate and otherwise N logN, where N is il.begin() - il.end().

        14. -
          set(std::initializer_list< value_type > il, const Compare & comp);
          +
          set(std::initializer_list< value_type > il, const Compare & comp);

          Effects: Constructs an empty set using the specified comparison object and inserts elements from the range [il.begin(), il.end()).

          Complexity: Linear in N if the range [il.begin(), il.end()) is already sorted using the predicate and otherwise N logN, where N is il.begin() - il.end().

        15. -
          set(std::initializer_list< value_type > il, const Compare & comp, 
+
          set(std::initializer_list< value_type > il, const Compare & comp, 
     const allocator_type & a);
          
 
          Effects: Constructs an empty set using the specified comparison object and allocator, and inserts elements from the range [il.begin(), il.end()).
          
 
          Complexity: Linear in N if the range [il.begin(), il.end()) is already sorted using the predicate and otherwise N logN, where N is il.begin() - il.end().
        16. -
          set(ordered_unique_range_t, std::initializer_list< value_type > il);
          +
          set(ordered_unique_range_t, std::initializer_list< value_type > il);

          Effects: Constructs an empty set and inserts elements from the ordered unique range [il.begin(), il.end()). This function is more efficient than the normal range creation for ordered ranges.

          Requires: [il.begin(), il.end()) must be ordered according to the predicate and must be unique values.

          Complexity: Linear in N.

          Note: Non-standard extension.

        17. -
          set(ordered_unique_range_t, std::initializer_list< value_type > il, 
+
          set(ordered_unique_range_t, std::initializer_list< value_type > il, 
     const Compare & comp);
          
 
          Effects: Constructs an empty set using the specified comparison object and inserts elements from the ordered unique range [il.begin(), il.end()). This function is more efficient than the normal range creation for ordered ranges.
          
 
          Requires: [il.begin(), il.end()) must be ordered according to the predicate and must be unique values.
          
@@ -302,7 +301,7 @@
 
          Note: Non-standard extension.
        18. -
          set(ordered_unique_range_t, std::initializer_list< value_type > il, 
+
          set(ordered_unique_range_t, std::initializer_list< value_type > il, 
     const Compare & comp, const allocator_type & a);
          
 
          Effects: Constructs an empty set using the specified comparison object and allocator, and inserts elements from the ordered unique range [il.begin(), il.end()). This function is more efficient than the normal range creation for ordered ranges.
          
 
          Requires: [il.begin(), il.end()) must be ordered according to the predicate and must be unique values.
          
@@ -310,159 +309,159 @@
 
          Note: Non-standard extension.
        19. -
          set(const set & x);
          +
          set(const set & x);

          Effects: Copy constructs a set.

          Complexity: Linear in x.size().

        20. -
          set(set && x) noexcept(boost::container::container_detail::is_nothrow_move_constructible< Compare >::value));
          +
          set(set && x) noexcept(boost::container::dtl::is_nothrow_move_constructible< Compare >::value));

          Effects: Move constructs a set. Constructs *this using x's resources.

          Complexity: Constant.

          Postcondition: x is emptied.

        21. -
          set(const set & x, const allocator_type & a);
          +
          set(const set & x, const allocator_type & a);

          Effects: Copy constructs a set using the specified allocator.

          Complexity: Linear in x.size().

        22. -
          set(set && x, const allocator_type & a);
          +
          set(set && x, const allocator_type & a);

          Effects: Move constructs a set using the specified allocator. Constructs *this using x's resources.

          Complexity: Constant if a == x.get_allocator(), linear otherwise.

        23. -
          set & operator=(const set & x);
          +
          set & operator=(const set & x);

          Effects: Makes *this a copy of x.

          Complexity: Linear in x.size().

        24. -
          set & operator=(set && x) noexcept((allocator_traits_type::propagate_on_container_move_assignment::value||allocator_traits_type::is_always_equal::value)&&boost::container::container_detail::is_nothrow_move_assignable< Compare >::value));
          +
          set & operator=(set && x) noexcept((allocator_traits_type::propagate_on_container_move_assignment::value||allocator_traits_type::is_always_equal::value)&&boost::container::dtl::is_nothrow_move_assignable< Compare >::value));

          Effects: this->swap(x.get()).

          Throws: If allocator_traits_type::propagate_on_container_move_assignment is false and (allocation throws or value_type's move constructor throws)

          Complexity: Constant if allocator_traits_type:: propagate_on_container_move_assignment is true or this->get>allocator() == x.get_allocator(). Linear otherwise.

        25. -
          set & operator=(std::initializer_list< value_type > il);
          +
          set & operator=(std::initializer_list< value_type > il);

          Effects: Copy all elements from il to *this.

          Complexity: Linear in il.size().

        -

        -set public member functions

        +

        +set public member functions

        1. -
          allocator_type get_allocator() const;
          +
          allocator_type get_allocator() const;

          Effects: Returns a copy of the allocator that was passed to the object's constructor.

          Complexity: Constant.

        2. -
          stored_allocator_type & get_stored_allocator();
          +
          stored_allocator_type & get_stored_allocator();

          Effects: Returns a reference to the internal allocator.

          Throws: Nothing

          Complexity: Constant.

          Note: Non-standard extension.

        3. -
          const stored_allocator_type & get_stored_allocator() const;
          +
          const stored_allocator_type & get_stored_allocator() const;

          Effects: Returns a reference to the internal allocator.

          Throws: Nothing

          Complexity: Constant.

          Note: Non-standard extension.

        4. -
          iterator begin();
          +
          iterator begin();

          Effects: Returns an iterator to the first element contained in the container.

          Throws: Nothing.

          Complexity: Constant

        5. -
          const_iterator begin() const;
          +
          const_iterator begin() const;

          Effects: Returns a const_iterator to the first element contained in the container.

          Throws: Nothing.

          Complexity: Constant.

        6. -
          const_iterator cbegin() const;
          +
          const_iterator cbegin() const;

          Effects: Returns a const_iterator to the first element contained in the container.

          Throws: Nothing.

          Complexity: Constant.

        7. -
          iterator end();
          +
          iterator end();

          Effects: Returns an iterator to the end of the container.

          Throws: Nothing.

          Complexity: Constant.

        8. -
          const_iterator end() const;
          +
          const_iterator end() const;

          Effects: Returns a const_iterator to the end of the container.

          Throws: Nothing.

          Complexity: Constant.

        9. -
          const_iterator cend() const;
          +
          const_iterator cend() const;

          Effects: Returns a const_iterator to the end of the container.

          Throws: Nothing.

          Complexity: Constant.

        10. -
          reverse_iterator rbegin();
          +
          reverse_iterator rbegin();

          Effects: Returns a reverse_iterator pointing to the beginning of the reversed container.

          Throws: Nothing.

          Complexity: Constant.

        11. -
          const_reverse_iterator rbegin() const;
          +
          const_reverse_iterator rbegin() const;

          Effects: Returns a const_reverse_iterator pointing to the beginning of the reversed container.

          Throws: Nothing.

          Complexity: Constant.

        12. -
          const_reverse_iterator crbegin() const;
          +
          const_reverse_iterator crbegin() const;

          Effects: Returns a const_reverse_iterator pointing to the beginning of the reversed container.

          Throws: Nothing.

          Complexity: Constant.

        13. -
          reverse_iterator rend();
          +
          reverse_iterator rend();

          Effects: Returns a reverse_iterator pointing to the end of the reversed container.

          Throws: Nothing.

          Complexity: Constant.

        14. -
          const_reverse_iterator rend() const;
          +
          const_reverse_iterator rend() const;

          Effects: Returns a const_reverse_iterator pointing to the end of the reversed container.

          Throws: Nothing.

          Complexity: Constant.

        15. -
          const_reverse_iterator crend() const;
          +
          const_reverse_iterator crend() const;

          Effects: Returns a const_reverse_iterator pointing to the end of the reversed container.

          Throws: Nothing.

          Complexity: Constant.

        16. -
          bool empty() const;
          +
          bool empty() const;

          Effects: Returns true if the container contains no elements.

          Throws: Nothing.

          Complexity: Constant.

        17. -
          size_type size() const;
          +
          size_type size() const;

          Effects: Returns the number of the elements contained in the container.

          Throws: Nothing.

          Complexity: Constant.

        18. -
          size_type max_size() const;
          +
          size_type max_size() const;

          Effects: Returns the largest possible size of the container.

          Throws: Nothing.

          Complexity: Constant.

        19. -
          template<class... Args> std::pair< iterator, bool > emplace(Args &&... args);
          +
          template<class... Args> std::pair< iterator, bool > emplace(Args &&... args);

          Effects: Inserts an object x of type Key constructed with std::forward<Args>(args)... if and only if there is no element in the container with equivalent value. and returns the iterator pointing to the newly inserted element.

          Returns: The bool component of the returned pair is true if and only if the insertion takes place, and the iterator component of the pair points to the element with key equivalent to the key of x.

          Throws: If memory allocation throws or Key's in-place constructor throws.

          @@ -470,61 +469,61 @@ 
        20. template<class... Args> 
-  iterator emplace_hint(const_iterator p, Args &&... args);
          + iterator emplace_hint(const_iterator p, Args &&... args);

          Effects: Inserts an object of type Key constructed with std::forward<Args>(args)... if and only if there is no element in the container with equivalent value. p is a hint pointing to where the insert should start to search.

          Returns: An iterator pointing to the element with key equivalent to the key of x.

          Complexity: Logarithmic.

        21. -
          std::pair< iterator, bool > insert(const value_type & x);
          +
          std::pair< iterator, bool > insert(const value_type & x);

          Effects: Inserts x if and only if there is no element in the container with key equivalent to the key of x.

          Returns: The bool component of the returned pair is true if and only if the insertion takes place, and the iterator component of the pair points to the element with key equivalent to the key of x.

          Complexity: Logarithmic.

        22. -
          std::pair< iterator, bool > insert(value_type && x);
          +
          std::pair< iterator, bool > insert(value_type && x);

          Effects: Move constructs a new value from x if and only if there is no element in the container with key equivalent to the key of x.

          Returns: The bool component of the returned pair is true if and only if the insertion takes place, and the iterator component of the pair points to the element with key equivalent to the key of x.

          Complexity: Logarithmic.

        23. -
          iterator insert(const_iterator p, const value_type & x);
          +
          iterator insert(const_iterator p, const value_type & x);

          Effects: Inserts a copy of x in the container if and only if there is no element in the container with key equivalent to the key of x. p is a hint pointing to where the insert should start to search.

          Returns: An iterator pointing to the element with key equivalent to the key of x.

          Complexity: Logarithmic in general, but amortized constant if t is inserted right before p.

        24. -
          iterator insert(const_iterator p, value_type && x);
          +
          iterator insert(const_iterator p, value_type && x);

          Effects: Inserts an element move constructed from x in the container. p is a hint pointing to where the insert should start to search.

          Returns: An iterator pointing to the element with key equivalent to the key of x.

          Complexity: Logarithmic. 

        25. template<typename InputIterator> 
-  void insert(InputIterator first, InputIterator last);
          + void insert(InputIterator first, InputIterator last);

          Requires: first, last are not iterators into *this.

          Effects: inserts each element from the range [first,last) if and only if there is no element with key equivalent to the key of that element.

          Complexity: At most N log(size()+N) (N is the distance from first to last)

        26. -
          void insert(std::initializer_list< value_type > il);
          +
          void insert(std::initializer_list< value_type > il);

          Effects: inserts each element from the range [il.begin(),il.end()) if and only if there is no element with key equivalent to the key of that element.

          Complexity: At most N log(size()+N) (N is the distance from il.begin() to il.end())

        27. -
          insert_return_type insert(node_type && nh);
          +
          insert_return_type insert(node_type && nh);

          Effects: Inserts a new value_type move constructed from the pair if and only if there is no element in the container with key equivalent to the key of x.

          Returns: The bool component of the returned pair is true if and only if the insertion takes place, and the iterator component of the pair points to the element with key equivalent to the key of x.

          Complexity: Logarithmic.

        28. -
          insert_return_type insert(const_iterator hint, node_type && nh);
          +
          insert_return_type insert(const_iterator hint, node_type && nh);

          Effects: Move constructs a new value from x if and only if there is no element in the container with key equivalent to the key of x. p is a hint pointing to where the insert should start to search.

          Returns: An iterator pointing to the element with key equivalent to the key of x.

          Complexity: Logarithmic in general, but amortized constant if t is inserted right before p.

        29. -
          template<typename C2> void merge(set< Key, C2, Allocator, Options > & source);
          +
          template<typename C2> void merge(set< Key, C2, Allocator, Options > & source);

          Requires: this->get_allocator() == source.get_allocator().

          Effects: Attempts to extract each element in source and insert it into a using the comparison object of *this. If there is an element in a with key equivalent to the key of an element from source, then that element is not extracted from source.

          Postcondition: Pointers and references to the transferred elements of source refer to those same elements but as members of *this. Iterators referring to the transferred elements will continue to refer to their elements, but they now behave as iterators into *this, not into source.

          @@ -532,7 +531,7 @@

          Complexity: N log(a.size() + N) (N has the value source.size())

        30. -
          template<typename C2> void merge(set< Key, C2, Allocator, Options > && source);
          +
          template<typename C2> void merge(set< Key, C2, Allocator, Options > && source);

          Requires: this->get_allocator() == source.get_allocator().

          Effects: Attempts to extract each element in source and insert it into a using the comparison object of *this. If there is an element in a with key equivalent to the key of an element from source, then that element is not extracted from source.

          Postcondition: Pointers and references to the transferred elements of source refer to those same elements but as members of *this. Iterators referring to the transferred elements will continue to refer to their elements, but they now behave as iterators into *this, not into source.

          @@ -541,7 +540,7 @@ 
        31. template<typename C2> 
-  void merge(multiset< Key, C2, Allocator, Options > & source);
          + void merge(multiset< Key, C2, Allocator, Options > & source);

          Requires: this->get_allocator() == source.get_allocator().

          Effects: Attempts to extract each element in source and insert it into a using the comparison object of *this. If there is an element in a with key equivalent to the key of an element from source, then that element is not extracted from source.

          Postcondition: Pointers and references to the transferred elements of source refer to those same elements but as members of *this. Iterators referring to the transferred elements will continue to refer to their elements, but they now behave as iterators into *this, not into source.

          @@ -550,7 +549,7 @@ 
        32. template<typename C2> 
-  void merge(multiset< Key, C2, Allocator, Options > && source);
          + void merge(multiset< Key, C2, Allocator, Options > && source);

          Requires: this->get_allocator() == source.get_allocator().

          Effects: Attempts to extract each element in source and insert it into a using the comparison object of *this. If there is an element in a with key equivalent to the key of an element from source, then that element is not extracted from source.

          Postcondition: Pointers and references to the transferred elements of source refer to those same elements but as members of *this. Iterators referring to the transferred elements will continue to refer to their elements, but they now behave as iterators into *this, not into source.

          @@ -558,162 +557,162 @@

          Complexity: N log(a.size() + N) (N has the value source.size())

        33. -
          iterator erase(const_iterator p);
          +
          iterator erase(const_iterator p);

          Effects: Erases the element pointed to by p.

          Returns: Returns an iterator pointing to the element immediately following q prior to the element being erased. If no such element exists, returns end().

          Complexity: Amortized constant time

        34. -
          size_type erase(const key_type & x);
          +
          size_type erase(const key_type & x);

          Effects: Erases all elements in the container with key equivalent to x.

          Returns: Returns the number of erased elements.

          Complexity: log(size()) + count(k)

        35. -
          iterator erase(const_iterator first, const_iterator last);
          +
          iterator erase(const_iterator first, const_iterator last);

          Effects: Erases all the elements in the range [first, last).

          Returns: Returns last.

          Complexity: log(size())+N where N is the distance from first to last.

        36. -
          node_type extract(const_iterator p);
          +
          node_type extract(const_iterator p);

          Effects: Removes the element pointed to by "position".

          Returns: A node_type owning the element, otherwise an empty node_type.

          Complexity: Amortized constant.

        37. -
          node_type extract(const key_type & x);
          +
          node_type extract(const key_type & x);

          Effects: Removes the first element in the container with key equivalent to k.

          Returns: A node_type owning the element if found, otherwise an empty node_type.

          Complexity: log(a.size()).

        38. -
          void swap(set & x) noexcept(allocator_traits_type::is_always_equal::value &&boost::container::container_detail::is_nothrow_swappable< Compare >::value));
          +
          void swap(set & x) noexcept(allocator_traits_type::is_always_equal::value &&boost::container::dtl::is_nothrow_swappable< Compare >::value));

          Effects: Swaps the contents of *this and x.

          Throws: Nothing.

          Complexity: Constant.

        39. -
          void clear();
          +
          void clear();

          Effects: erase(a.begin(),a.end()).

          Postcondition: size() == 0.

          Complexity: linear in size().

        40. -
          key_compare key_comp() const;
          +
          key_compare key_comp() const;

          Effects: Returns the comparison object out of which a was constructed.

          Complexity: Constant.

        41. -
          value_compare value_comp() const;
          +
          value_compare value_comp() const;

          Effects: Returns an object of value_compare constructed out of the comparison object.

          Complexity: Constant.

        42. -
          iterator find(const key_type & x);
          +
          iterator find(const key_type & x);

          Returns: An iterator pointing to an element with the key equivalent to x, or end() if such an element is not found.

          Complexity: Logarithmic.

        43. -
          const_iterator find(const key_type & x) const;
          +
          const_iterator find(const key_type & x) const;

          Returns: A const_iterator pointing to an element with the key equivalent to x, or end() if such an element is not found.

          Complexity: Logarithmic.

        44. -
          size_type count(const key_type & x) const;
          +
          size_type count(const key_type & x) const;

          Returns: The number of elements with key equivalent to x.

          Complexity: log(size())+count(k)

        45. -
          size_type count(const key_type & x);
          +
          size_type count(const key_type & x);

          Returns: The number of elements with key equivalent to x.

          Complexity: log(size())+count(k)

        46. -
          iterator lower_bound(const key_type & x);
          +
          iterator lower_bound(const key_type & x);

          Returns: An iterator pointing to the first element with key not less than k, or a.end() if such an element is not found.

          Complexity: Logarithmic

        47. -
          const_iterator lower_bound(const key_type & x) const;
          +
          const_iterator lower_bound(const key_type & x) const;

          Returns: A const iterator pointing to the first element with key not less than k, or a.end() if such an element is not found.

          Complexity: Logarithmic

        48. -
          iterator upper_bound(const key_type & x);
          +
          iterator upper_bound(const key_type & x);

          Returns: An iterator pointing to the first element with key not less than x, or end() if such an element is not found.

          Complexity: Logarithmic

        49. -
          const_iterator upper_bound(const key_type & x) const;
          +
          const_iterator upper_bound(const key_type & x) const;

          Returns: A const iterator pointing to the first element with key not less than x, or end() if such an element is not found.

          Complexity: Logarithmic

        50. -
          std::pair< iterator, iterator > equal_range(const key_type & x);
          +
          std::pair< iterator, iterator > equal_range(const key_type & x);

          Effects: Equivalent to std::make_pair(this->lower_bound(k), this->upper_bound(k)).

          Complexity: Logarithmic 

        51. std::pair< const_iterator, const_iterator > 
-equal_range(const key_type & x) const;
          +equal_range(const key_type & x) const;

          Effects: Equivalent to std::make_pair(this->lower_bound(k), this->upper_bound(k)).

          Complexity: Logarithmic

        52. -
          std::pair< iterator, iterator > equal_range(const key_type & x);
          +
          std::pair< iterator, iterator > equal_range(const key_type & x);

          Effects: Equivalent to std::make_pair(this->lower_bound(k), this->upper_bound(k)).

          Complexity: Logarithmic 

        53. std::pair< const_iterator, const_iterator > 
-equal_range(const key_type & x) const;
          +equal_range(const key_type & x) const;

          Effects: Equivalent to std::make_pair(this->lower_bound(k), this->upper_bound(k)).

          Complexity: Logarithmic

        54. -
          void rebalance();
          +
          void rebalance();

          Effects: Rebalances the tree. It's a no-op for Red-Black and AVL trees.

          Complexity: Linear

        -

        -set friend functions

        +

        +set friend functions

        1. -
          friend bool operator==(const set & x, const set & y);
          +
          friend bool operator==(const set & x, const set & y);

          Effects: Returns true if x and y are equal

          Complexity: Linear to the number of elements in the container.

        2. -
          friend bool operator!=(const set & x, const set & y);
          +
          friend bool operator!=(const set & x, const set & y);

          Effects: Returns true if x and y are unequal

          Complexity: Linear to the number of elements in the container.

        3. -
          friend bool operator<(const set & x, const set & y);
          +
          friend bool operator<(const set & x, const set & y);

          Effects: Returns true if x is less than y

          Complexity: Linear to the number of elements in the container.

        4. -
          friend bool operator>(const set & x, const set & y);
          +
          friend bool operator>(const set & x, const set & y);

          Effects: Returns true if x is greater than y

          Complexity: Linear to the number of elements in the container.

        5. -
          friend bool operator<=(const set & x, const set & y);
          +
          friend bool operator<=(const set & x, const set & y);

          Effects: Returns true if x is equal or less than y

          Complexity: Linear to the number of elements in the container.

        6. -
          friend bool operator>=(const set & x, const set & y);
          +
          friend bool operator>=(const set & x, const set & y);

          Effects: Returns true if x is equal or greater than y

          Complexity: Linear to the number of elements in the container.

        7. -
          friend void swap(set & x, set & y);
          +
          friend void swap(set & x, set & y);

          Effects: x.swap(y)

          Complexity: Constant.

          8. @@ -723,7 +722,8 @@
        -
        Copyright © 2009-2015 Ion Gaztanaga

        +

        Copyright © 2009-2017 Ion + Gaztanaga

        Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

        diff --git a/doc/html/boost/container/slist.html b/doc/html/boost/container/slist.html index ed85a27fd6..e166f990bf 100644 --- a/doc/html/boost/container/slist.html +++ b/doc/html/boost/container/slist.html @@ -8,7 +8,7 @@ - + @@ -21,7 +21,7 @@
        -PrevUpHomeNext +PrevUpHomeNext
        @@ -33,7 +33,8 @@ 
        // In header: <boost/container/slist.hpp>
 
 template<typename T, typename Allocator = new_allocator<T> > 
-class slist {
+class slist : protected dtl::node_alloc_holder< Allocator, dtl::intrusive_slist_type< Allocator >::type >
+{
 public:
   // types
   typedef T                                                                  value_type;           
@@ -49,113 +50,113 @@
   typedef implementation_defined                                             const_iterator;       
 
   // construct/copy/destruct
-  slist() noexcept(container_detail::is_nothrow_default_constructible< Allocator >::value));
-  explicit slist(const allocator_type &) noexcept;
-  explicit slist(size_type);
-  slist(size_type, const allocator_type &);
-  explicit slist(size_type, const value_type &, 
+  slist() noexcept(dtl::is_nothrow_default_constructible< Allocator >::value));
+  explicit slist(const allocator_type &) noexcept;
+  explicit slist(size_type);
+  slist(size_type, const allocator_type &);
+  explicit slist(size_type, const value_type &, 
                  const allocator_type & = allocator_type());
   template<typename InpIt> 
-    slist(InpIt, InpIt, const allocator_type & = allocator_type());
-  slist(std::initializer_list< value_type >, 
+    slist(InpIt, InpIt, const allocator_type & = allocator_type());
+  slist(std::initializer_list< value_type >, 
         const allocator_type & = allocator_type());
-  slist(const slist &);
-  slist(slist &&) noexcept;
-  slist(const slist &, const allocator_type &);
-  slist(slist &&, const allocator_type &);
-  slist & operator=(const slist &);
-  slist & operator=(slist &&) noexcept(allocator_traits_type::propagate_on_container_move_assignment::value||allocator_traits_type::is_always_equal::value));
-  slist & operator=(std::initializer_list< value_type >);
-  ~slist();
+  slist(const slist &);
+  slist(slist &&) noexcept;
+  slist(const slist &, const allocator_type &);
+  slist(slist &&, const allocator_type &);
+  slist & operator=(const slist &);
+  slist & operator=(slist &&) noexcept(allocator_traits_type::propagate_on_container_move_assignment::value||allocator_traits_type::is_always_equal::value));
+  slist & operator=(std::initializer_list< value_type >);
+  ~slist();
 
-  // public member functions
-  void assign(size_type, const T &);
-  template<typename InpIt> void assign(InpIt, InpIt);
-  void assign(std::initializer_list< value_type >);
-  allocator_type get_allocator() const noexcept;
-  stored_allocator_type & get_stored_allocator() noexcept;
-  const stored_allocator_type & get_stored_allocator() const noexcept;
-  iterator before_begin() noexcept;
-  const_iterator before_begin() const noexcept;
-  iterator begin() noexcept;
-  const_iterator begin() const noexcept;
-  iterator end() noexcept;
-  const_iterator end() const noexcept;
-  const_iterator cbefore_begin() const noexcept;
-  const_iterator cbegin() const noexcept;
-  const_iterator cend() const noexcept;
-  iterator previous(iterator) noexcept;
-  const_iterator previous(const_iterator);
-  bool empty() const;
-  size_type size() const;
-  size_type max_size() const;
-  void resize(size_type);
-  void resize(size_type, const T &);
-  reference front();
-  const_reference front() const;
-  template<class... Args> reference emplace_front(Args &&...);
-  template<class... Args> iterator emplace_after(const_iterator, Args &&...);
-  void push_front(const T &);
-  void push_front(T &&);
-  iterator insert_after(const_iterator, const T &);
-  iterator insert_after(const_iterator, T &&);
-  iterator insert_after(const_iterator, size_type, const value_type &);
-  template<typename InpIt> iterator insert_after(const_iterator, InpIt, InpIt);
-  iterator insert_after(const_iterator, std::initializer_list< value_type >);
-  void pop_front();
-  iterator erase_after(const_iterator);
-  iterator erase_after(const_iterator, const_iterator);
-  void swap(slist &) noexcept(allocator_traits_type::propagate_on_container_swap::value||allocator_traits_type::is_always_equal::value));
-  void clear();
-  void splice_after(const_iterator, slist &) noexcept;
-  void splice_after(const_iterator, slist &&) noexcept;
-  void splice_after(const_iterator, slist &, const_iterator) noexcept;
-  void splice_after(const_iterator, slist &&, const_iterator) noexcept;
-  void splice_after(const_iterator, slist &, const_iterator, const_iterator) noexcept;
-  void splice_after(const_iterator, slist &&, const_iterator, const_iterator) noexcept;
-  void splice_after(const_iterator, slist &, const_iterator, const_iterator, 
+  // public member functions
+  void assign(size_type, const T &);
+  template<typename InpIt> void assign(InpIt, InpIt);
+  void assign(std::initializer_list< value_type >);
+  allocator_type get_allocator() const noexcept;
+  stored_allocator_type & get_stored_allocator() noexcept;
+  const stored_allocator_type & get_stored_allocator() const noexcept;
+  iterator before_begin() noexcept;
+  const_iterator before_begin() const noexcept;
+  iterator begin() noexcept;
+  const_iterator begin() const noexcept;
+  iterator end() noexcept;
+  const_iterator end() const noexcept;
+  const_iterator cbefore_begin() const noexcept;
+  const_iterator cbegin() const noexcept;
+  const_iterator cend() const noexcept;
+  iterator previous(iterator) noexcept;
+  const_iterator previous(const_iterator);
+  bool empty() const;
+  size_type size() const;
+  size_type max_size() const;
+  void resize(size_type);
+  void resize(size_type, const T &);
+  reference front();
+  const_reference front() const;
+  template<class... Args> reference emplace_front(Args &&...);
+  template<class... Args> iterator emplace_after(const_iterator, Args &&...);
+  void push_front(const T &);
+  void push_front(T &&);
+  iterator insert_after(const_iterator, const T &);
+  iterator insert_after(const_iterator, T &&);
+  iterator insert_after(const_iterator, size_type, const value_type &);
+  template<typename InpIt> iterator insert_after(const_iterator, InpIt, InpIt);
+  iterator insert_after(const_iterator, std::initializer_list< value_type >);
+  void pop_front();
+  iterator erase_after(const_iterator);
+  iterator erase_after(const_iterator, const_iterator);
+  void swap(slist &) noexcept(allocator_traits_type::propagate_on_container_swap::value||allocator_traits_type::is_always_equal::value));
+  void clear();
+  void splice_after(const_iterator, slist &) noexcept;
+  void splice_after(const_iterator, slist &&) noexcept;
+  void splice_after(const_iterator, slist &, const_iterator) noexcept;
+  void splice_after(const_iterator, slist &&, const_iterator) noexcept;
+  void splice_after(const_iterator, slist &, const_iterator, const_iterator) noexcept;
+  void splice_after(const_iterator, slist &&, const_iterator, const_iterator) noexcept;
+  void splice_after(const_iterator, slist &, const_iterator, const_iterator, 
                     size_type) noexcept;
-  void splice_after(const_iterator, slist &&, const_iterator, const_iterator, 
+  void splice_after(const_iterator, slist &&, const_iterator, const_iterator, 
                     size_type) noexcept;
-  void remove(const T &);
-  template<typename Pred> void remove_if(Pred);
-  void unique();
-  template<typename Pred> void unique(Pred);
-  void merge(slist &);
-  void merge(slist &&);
+  void remove(const T &);
+  template<typename Pred> void remove_if(Pred);
+  void unique();
+  template<typename Pred> void unique(Pred);
+  void merge(slist &);
+  void merge(slist &&);
   template<typename StrictWeakOrdering> 
-    void merge(slist &, StrictWeakOrdering);
+    void merge(slist &, StrictWeakOrdering);
   template<typename StrictWeakOrdering> 
-    void merge(slist &&, StrictWeakOrdering);
-  void sort();
-  template<typename StrictWeakOrdering> void sort(StrictWeakOrdering);
-  void reverse() noexcept;
-  template<class... Args> iterator emplace(const_iterator, Args &&...);
-  iterator insert(const_iterator, const T &);
-  iterator insert(const_iterator, T &&);
-  iterator insert(const_iterator, size_type, const value_type &);
-  template<typename InIter> iterator insert(const_iterator, InIter, InIter);
-  iterator insert(const_iterator, std::initializer_list< value_type >);
-  iterator erase(const_iterator) noexcept;
-  iterator erase(const_iterator, const_iterator) noexcept;
-  void splice(const_iterator, slist &) noexcept;
-  void splice(const_iterator, slist &&) noexcept;
-  void splice(const_iterator, slist &, const_iterator) noexcept;
-  void splice(const_iterator, slist &&, const_iterator) noexcept;
-  void splice(const_iterator, slist &, const_iterator, const_iterator) noexcept;
-  void splice(const_iterator, slist &&, const_iterator, const_iterator) noexcept;
+    void merge(slist &&, StrictWeakOrdering);
+  void sort();
+  template<typename StrictWeakOrdering> void sort(StrictWeakOrdering);
+  void reverse() noexcept;
+  template<class... Args> iterator emplace(const_iterator, Args &&...);
+  iterator insert(const_iterator, const T &);
+  iterator insert(const_iterator, T &&);
+  iterator insert(const_iterator, size_type, const value_type &);
+  template<typename InIter> iterator insert(const_iterator, InIter, InIter);
+  iterator insert(const_iterator, std::initializer_list< value_type >);
+  iterator erase(const_iterator) noexcept;
+  iterator erase(const_iterator, const_iterator) noexcept;
+  void splice(const_iterator, slist &) noexcept;
+  void splice(const_iterator, slist &&) noexcept;
+  void splice(const_iterator, slist &, const_iterator) noexcept;
+  void splice(const_iterator, slist &&, const_iterator) noexcept;
+  void splice(const_iterator, slist &, const_iterator, const_iterator) noexcept;
+  void splice(const_iterator, slist &&, const_iterator, const_iterator) noexcept;
 
-  // friend functions
-  friend bool operator==(const slist &, const slist &);
-  friend bool operator!=(const slist &, const slist &);
-  friend bool operator<(const slist &, const slist &);
-  friend bool operator>(const slist &, const slist &);
-  friend bool operator<=(const slist &, const slist &);
-  friend bool operator>=(const slist &, const slist &);
-  friend void swap(slist &, slist &);
+  // friend functions
+  friend bool operator==(const slist &, const slist &);
+  friend bool operator!=(const slist &, const slist &);
+  friend bool operator<(const slist &, const slist &);
+  friend bool operator>(const slist &, const slist &);
+  friend bool operator<=(const slist &, const slist &);
+  friend bool operator>=(const slist &, const slist &);
+  friend void swap(slist &, slist &);
 };
        -

        Description

        +

        Description

        An slist is a singly linked list: a list where each element is linked to the next element, but not to the previous element. That is, it is a Sequence that supports forward but not backward traversal, and (amortized) constant time insertion and removal of elements. Slists, like lists, have the important property that insertion and splicing do not invalidate iterators to list elements, and that even removal invalidates only the iterators that point to the elements that are removed. The ordering of iterators may be changed (that is, slist<T>::iterator might have a different predecessor or successor after a list operation than it did before), but the iterators themselves will not be invalidated or made to point to different elements unless that invalidation or mutation is explicit.

        The main difference between slist and list is that list's iterators are bidirectional iterators, while slist's iterators are forward iterators. This means that slist is less versatile than list; frequently, however, bidirectional iterators are unnecessary. You should usually use slist unless you actually need the extra functionality of list, because singly linked lists are smaller and faster than double linked lists.

        Important performance note: like every other Sequence, slist defines the member functions insert and erase. Using these member functions carelessly, however, can result in disastrously slow programs. The problem is that insert's first argument is an iterator p, and that it inserts the new element(s) before p. This means that insert must find the iterator just before p; this is a constant-time operation for list, since list has bidirectional iterators, but for slist it must find that iterator by traversing the list from the beginning up to p. In other words: insert and erase are slow operations anywhere but near the beginning of the slist.

        @@ -163,7 +164,7 @@

        -

        Template Parameters

        +

        Template Parameters

        1. typename T
          @@ -176,37 +177,37 @@
        -

        +

        slist public construct/copy/destruct

        1. -
          slist() noexcept(container_detail::is_nothrow_default_constructible< Allocator >::value));
          +
          slist() noexcept(dtl::is_nothrow_default_constructible< Allocator >::value));

          Effects: Constructs a list taking the allocator as parameter.

          Throws: If allocator_type's copy constructor throws.

          Complexity: Constant.

        2. -
          explicit slist(const allocator_type & a) noexcept;
          +
          explicit slist(const allocator_type & a) noexcept;

          Effects: Constructs a list taking the allocator as parameter.

          Throws: Nothing

          Complexity: Constant.

        3. -
          explicit slist(size_type n);
          +
          explicit slist(size_type n);

          Effects: Constructs a list and inserts n value-initialized value_types.

          Throws: If allocator_type's default constructor throws or T's default or copy constructor throws.

          Complexity: Linear to n.

        4. -
          slist(size_type n, const allocator_type & a);
          +
          slist(size_type n, const allocator_type & a);

          Effects: Constructs a list that will use a copy of allocator a and inserts n copies of value.

          Throws: If allocator_type's default constructor throws or T's default or copy constructor throws.

          Complexity: Linear to n.

        5. -
          explicit slist(size_type n, const value_type & x, 
+
          explicit slist(size_type n, const value_type & x, 
                const allocator_type & a = allocator_type());
          
 
          Effects: Constructs a list that will use a copy of allocator a and inserts n copies of value.
          
 
          Throws: If allocator_type's default constructor throws or T's default or copy constructor throws.
          
@@ -214,65 +215,65 @@
 
        6. template<typename InpIt> 
-  slist(InpIt first, InpIt last, const allocator_type & a = allocator_type());
          + slist(InpIt first, InpIt last, const allocator_type & a = allocator_type());

          Effects: Constructs a list that will use a copy of allocator a and inserts a copy of the range [first, last) in the list.

          Throws: If allocator_type's default constructor throws or T's constructor taking a dereferenced InIt throws.

          Complexity: Linear to the range [first, last).

        7. -
          slist(std::initializer_list< value_type > il, 
+
          slist(std::initializer_list< value_type > il, 
       const allocator_type & a = allocator_type());
          
 
          Effects: Constructs a list that will use a copy of allocator a and inserts a copy of the range [il.begin(), il.end()) in the list.
          
 
          Throws: If allocator_type's default constructor throws or T's constructor taking a dereferenced std::initializer_list iterator throws.
          
 
          Complexity: Linear to the range [il.begin(), il.end()).
        8. -
          slist(const slist & x);
          +
          slist(const slist & x);

          Effects: Copy constructs a list. Postcondition: x == *this.

          Throws: If allocator_type's default constructor

          Complexity: Linear to the elements x contains.

        9. -
          slist(slist && x) noexcept;
          +
          slist(slist && x) noexcept;

          Effects: Move constructor. Moves x's resources to *this.

          Throws: If allocator_type's copy constructor throws.

          Complexity: Constant.

        10. -
          slist(const slist & x, const allocator_type & a);
          +
          slist(const slist & x, const allocator_type & a);

          Effects: Copy constructs a list using the specified allocator.

          Postcondition: x == *this.

          Throws: If allocator_type's default constructor

          Complexity: Linear to the elements x contains.

        11. -
          slist(slist && x, const allocator_type & a);
          +
          slist(slist && x, const allocator_type & a);

          Effects: Move constructor using the specified allocator. Moves x's resources to *this.

          Throws: If allocation or value_type's copy constructor throws.

          Complexity: Constant if a == x.get_allocator(), linear otherwise.

        12. -
          slist & operator=(const slist & x);
          +
          slist & operator=(const slist & x);

          Effects: Makes *this contain the same elements as x.

          Postcondition: this->size() == x.size(). *this contains a copy of each of x's elements.

          Throws: If memory allocation throws or T's copy constructor throws.

          Complexity: Linear to the number of elements in x.

        13. -
          slist & operator=(slist && x) noexcept(allocator_traits_type::propagate_on_container_move_assignment::value||allocator_traits_type::is_always_equal::value));
          +
          slist & operator=(slist && x) noexcept(allocator_traits_type::propagate_on_container_move_assignment::value||allocator_traits_type::is_always_equal::value));

          Effects: Makes *this contain the same elements as x.

          Postcondition: this->size() == x.size(). *this contains a copy of each of x's elements.

          Throws: If allocator_traits_type::propagate_on_container_move_assignment is false and (allocation throws or value_type's move constructor throws)

          Complexity: Constant if allocator_traits_type:: propagate_on_container_move_assignment is true or this->get>allocator() == x.get_allocator(). Linear otherwise.

        14. -
          slist & operator=(std::initializer_list< value_type > il);
          +
          slist & operator=(std::initializer_list< value_type > il);

          Effects: Makes *this contain the same elements as in il.

          Postcondition: this->size() == il.size(). *this contains a copy of each of il's elements.

          Throws: If allocator_traits_type::propagate_on_container_move_assignment is false and (allocation throws or value_type's move constructor throws)

        15. -
          ~slist();
          +
          ~slist();

          Effects: Destroys the list. All stored values are destroyed and used memory is deallocated.

          Throws: Nothing.

          Complexity: Linear to the number of elements.

          @@ -280,161 +281,161 @@
        -

        -slist public member functions

        +

        +slist public member functions

        1. -
          void assign(size_type n, const T & val);
          +
          void assign(size_type n, const T & val);

          Effects: Assigns the n copies of val to *this.

          Throws: If memory allocation throws or T's copy constructor throws.

          Complexity: Linear to n.

        2. -
          template<typename InpIt> void assign(InpIt first, InpIt last);
          +
          template<typename InpIt> void assign(InpIt first, InpIt last);

          Effects: Assigns the range [first, last) to *this.

          Throws: If memory allocation throws or T's constructor from dereferencing InpIt throws.

          Complexity: Linear to n.

        3. -
          void assign(std::initializer_list< value_type > il);
          +
          void assign(std::initializer_list< value_type > il);

          Effects: Assigns the range [il.begin(), il.end()) to *this.

          Throws: If memory allocation throws or T's constructor from dereferencing std::initializer_list iterator throws.

          Complexity: Linear to range [il.begin(), il.end()).

        4. -
          allocator_type get_allocator() const noexcept;
          +
          allocator_type get_allocator() const noexcept;

          Effects: Returns a copy of the internal allocator.

          Throws: If allocator's copy constructor throws.

          Complexity: Constant.

        5. -
          stored_allocator_type & get_stored_allocator() noexcept;
          +
          stored_allocator_type & get_stored_allocator() noexcept;

          Effects: Returns a reference to the internal allocator.

          Throws: Nothing

          Complexity: Constant.

          Note: Non-standard extension.

        6. -
          const stored_allocator_type & get_stored_allocator() const noexcept;
          +
          const stored_allocator_type & get_stored_allocator() const noexcept;

          Effects: Returns a reference to the internal allocator.

          Throws: Nothing

          Complexity: Constant.

          Note: Non-standard extension.

        7. -
          iterator before_begin() noexcept;
          +
          iterator before_begin() noexcept;

          Effects: Returns a non-dereferenceable iterator that, when incremented, yields begin(). This iterator may be used as the argument to insert_after, erase_after, etc.

          Throws: Nothing.

          Complexity: Constant.

        8. -
          const_iterator before_begin() const noexcept;
          +
          const_iterator before_begin() const noexcept;

          Effects: Returns a non-dereferenceable const_iterator that, when incremented, yields begin(). This iterator may be used as the argument to insert_after, erase_after, etc.

          Throws: Nothing.

          Complexity: Constant.

        9. -
          iterator begin() noexcept;
          +
          iterator begin() noexcept;

          Effects: Returns an iterator to the first element contained in the list.

          Throws: Nothing.

          Complexity: Constant.

        10. -
          const_iterator begin() const noexcept;
          +
          const_iterator begin() const noexcept;

          Effects: Returns a const_iterator to the first element contained in the list.

          Throws: Nothing.

          Complexity: Constant.

        11. -
          iterator end() noexcept;
          +
          iterator end() noexcept;

          Effects: Returns an iterator to the end of the list.

          Throws: Nothing.

          Complexity: Constant.

        12. -
          const_iterator end() const noexcept;
          +
          const_iterator end() const noexcept;

          Effects: Returns a const_iterator to the end of the list.

          Throws: Nothing.

          Complexity: Constant.

        13. -
          const_iterator cbefore_begin() const noexcept;
          +
          const_iterator cbefore_begin() const noexcept;

          Effects: Returns a non-dereferenceable const_iterator that, when incremented, yields begin(). This iterator may be used as the argument to insert_after, erase_after, etc.

          Throws: Nothing.

          Complexity: Constant.

        14. -
          const_iterator cbegin() const noexcept;
          +
          const_iterator cbegin() const noexcept;

          Effects: Returns a const_iterator to the first element contained in the list.

          Throws: Nothing.

          Complexity: Constant.

        15. -
          const_iterator cend() const noexcept;
          +
          const_iterator cend() const noexcept;

          Effects: Returns a const_iterator to the end of the list.

          Throws: Nothing.

          Complexity: Constant.

        16. -
          iterator previous(iterator p) noexcept;
          +
          iterator previous(iterator p) noexcept;

          Returns: The iterator to the element before i in the sequence. Returns the end-iterator, if either i is the begin-iterator or the sequence is empty.

          Throws: Nothing.

          Complexity: Linear to the number of elements before i.

          Note: Non-standard extension.

        17. -
          const_iterator previous(const_iterator p);
          +
          const_iterator previous(const_iterator p);

          Returns: The const_iterator to the element before i in the sequence. Returns the end-const_iterator, if either i is the begin-const_iterator or the sequence is empty.

          Throws: Nothing.

          Complexity: Linear to the number of elements before i.

          Note: Non-standard extension.

        18. -
          bool empty() const;
          +
          bool empty() const;

          Effects: Returns true if the list contains no elements.

          Throws: Nothing.

          Complexity: Constant.

        19. -
          size_type size() const;
          +
          size_type size() const;

          Effects: Returns the number of the elements contained in the list.

          Throws: Nothing.

          Complexity: Constant.

        20. -
          size_type max_size() const;
          +
          size_type max_size() const;

          Effects: Returns the largest possible size of the list.

          Throws: Nothing.

          Complexity: Constant.

        21. -
          void resize(size_type new_size);
          +
          void resize(size_type new_size);

          Effects: Inserts or erases elements at the end such that the size becomes n. New elements are value initialized.

          Throws: If memory allocation throws, or T's copy constructor throws.

          Complexity: Linear to the difference between size() and new_size.

        22. -
          void resize(size_type new_size, const T & x);
          +
          void resize(size_type new_size, const T & x);

          Effects: Inserts or erases elements at the end such that the size becomes n. New elements are copy constructed from x.

          Throws: If memory allocation throws, or T's copy constructor throws.

          Complexity: Linear to the difference between size() and new_size.

        23. -
          reference front();
          +
          reference front();

          Requires: !empty()

          Effects: Returns a reference to the first element from the beginning of the container.

          Throws: Nothing.

          Complexity: Constant.

        24. -
          const_reference front() const;
          +
          const_reference front() const;

          Requires: !empty()

          Effects: Returns a const reference to the first element from the beginning of the container.

          Throws: Nothing.

          Complexity: Constant.

        25. -
          template<class... Args> reference emplace_front(Args &&... args);
          +
          template<class... Args> reference emplace_front(Args &&... args);

          Effects: Inserts an object of type T constructed with std::forward<Args>(args)... in the front of the list

          Returns: A reference to the created object.

          Throws: If memory allocation throws or T's copy constructor throws.

          @@ -442,25 +443,25 @@ 
        26. template<class... Args> 
-  iterator emplace_after(const_iterator prev, Args &&... args);
          + iterator emplace_after(const_iterator prev, Args &&... args);

          Effects: Inserts an object of type T constructed with std::forward<Args>(args)... after prev

          Throws: If memory allocation throws or T's in-place constructor throws.

          Complexity: Constant

        27. -
          void push_front(const T & x);
          +
          void push_front(const T & x);

          Effects: Inserts a copy of x at the beginning of the list.

          Throws: If memory allocation throws or T's copy constructor throws.

          Complexity: Amortized constant time.

        28. -
          void push_front(T && x);
          +
          void push_front(T && x);

          Effects: Constructs a new element in the beginning of the list and moves the resources of x to this new element.

          Throws: If memory allocation throws.

          Complexity: Amortized constant time.

        29. -
          iterator insert_after(const_iterator prev_p, const T & x);
          +
          iterator insert_after(const_iterator prev_p, const T & x);

          Requires: p must be a valid iterator of *this.

          Effects: Inserts a copy of the value after prev_p.

          Returns: An iterator to the inserted element.

          @@ -469,7 +470,7 @@

          Note: Does not affect the validity of iterators and references of previous values.

        30. -
          iterator insert_after(const_iterator prev_p, T && x);
          +
          iterator insert_after(const_iterator prev_p, T && x);

          Requires: prev_p must be a valid iterator of *this.

          Effects: Inserts a move constructed copy object from the value after the element pointed by prev_p.

          Returns: An iterator to the inserted element.

          @@ -478,7 +479,7 @@

          Note: Does not affect the validity of iterators and references of previous values.

        31. -
          iterator insert_after(const_iterator prev_p, size_type n, 
+
          iterator insert_after(const_iterator prev_p, size_type n, 
                       const value_type & x);
          
 
          Requires: prev_p must be a valid iterator of *this.
          
 
          Effects: Inserts n copies of x after prev_p.
          
@@ -489,7 +490,7 @@
 
        32. template<typename InpIt> 
-  iterator insert_after(const_iterator prev_p, InpIt first, InpIt last);
          + iterator insert_after(const_iterator prev_p, InpIt first, InpIt last);

          Requires: prev_p must be a valid iterator of *this.

          Effects: Inserts the range pointed by [first, last) after prev_p.

          Returns: an iterator to the last inserted element or prev_p if first == last.

          @@ -498,7 +499,7 @@

          Note: Does not affect the validity of iterators and references of previous values.

        33. -
          iterator insert_after(const_iterator prev_p, 
+
          iterator insert_after(const_iterator prev_p, 
                       std::initializer_list< value_type > il);
          
 
          Requires: prev_p must be a valid iterator of *this.
          
 
          Effects: Inserts the range pointed by [il.begin(), il.end()) after prev_p.
          
@@ -508,13 +509,13 @@
 
          Note: Does not affect the validity of iterators and references of previous values.
        34. -
          void pop_front();
          +
          void pop_front();

          Effects: Removes the first element from the list.

          Throws: Nothing.

          Complexity: Amortized constant time.

        35. -
          iterator erase_after(const_iterator prev_p);
          +
          iterator erase_after(const_iterator prev_p);

          Effects: Erases the element after the element pointed by prev_p of the list.

          Returns: the first element remaining beyond the removed elements, or end() if no such element exists.

          Throws: Nothing.

          @@ -522,7 +523,7 @@

          Note: Does not invalidate iterators or references to non erased elements.

        36. -
          iterator erase_after(const_iterator before_first, const_iterator last);
          +
          iterator erase_after(const_iterator before_first, const_iterator last);

          Effects: Erases the range (before_first, last) from the list.

          Returns: the first element remaining beyond the removed elements, or end() if no such element exists.

          Throws: Nothing.

          @@ -530,19 +531,19 @@

          Note: Does not invalidate iterators or references to non erased elements.

        37. -
          void swap(slist & x) noexcept(allocator_traits_type::propagate_on_container_swap::value||allocator_traits_type::is_always_equal::value));
          +
          void swap(slist & x) noexcept(allocator_traits_type::propagate_on_container_swap::value||allocator_traits_type::is_always_equal::value));

          Effects: Swaps the contents of *this and x.

          Throws: Nothing.

          Complexity: Linear to the number of elements on *this and x.

        38. -
          void clear();
          +
          void clear();

          Effects: Erases all the elements of the list.

          Throws: Nothing.

          Complexity: Linear to the number of elements in the list.

        39. -
          void splice_after(const_iterator prev_p, slist & x) noexcept;
          +
          void splice_after(const_iterator prev_p, slist & x) noexcept;

          Requires: p must point to an element contained by the list. x != *this

          Effects: Transfers all the elements of list x to this list, after the the element pointed by p. No destructors or copy constructors are called.

          Throws: std::runtime_error if this' allocator and x's allocator are not equal.

          @@ -550,7 +551,7 @@

          Note: Iterators of values obtained from list x now point to elements of this list. Iterators of this list and all the references are not invalidated.

        40. -
          void splice_after(const_iterator prev_p, slist && x) noexcept;
          +
          void splice_after(const_iterator prev_p, slist && x) noexcept;

          Requires: p must point to an element contained by the list. x != *this

          Effects: Transfers all the elements of list x to this list, after the the element pointed by p. No destructors or copy constructors are called.

          Throws: std::runtime_error if this' allocator and x's allocator are not equal.

          @@ -558,7 +559,7 @@

          Note: Iterators of values obtained from list x now point to elements of this list. Iterators of this list and all the references are not invalidated.

        41. -
          void splice_after(const_iterator prev_p, slist & x, const_iterator prev) noexcept;
          +
          void splice_after(const_iterator prev_p, slist & x, const_iterator prev) noexcept;

          Requires: prev_p must be a valid iterator of this. i must point to an element contained in list x. this' allocator and x's allocator shall compare equal.

          Effects: Transfers the value pointed by i, from list x to this list, after the element pointed by prev_p. If prev_p == prev or prev_p == ++prev, this function is a null operation.

          Throws: Nothing

          @@ -566,7 +567,7 @@

          Note: Iterators of values obtained from list x now point to elements of this list. Iterators of this list and all the references are not invalidated.

        42. -
          void splice_after(const_iterator prev_p, slist && x, const_iterator prev) noexcept;
          +
          void splice_after(const_iterator prev_p, slist && x, const_iterator prev) noexcept;

          Requires: prev_p must be a valid iterator of this. i must point to an element contained in list x. this' allocator and x's allocator shall compare equal.

          Effects: Transfers the value pointed by i, from list x to this list, after the element pointed by prev_p. If prev_p == prev or prev_p == ++prev, this function is a null operation.

          Throws: Nothing

          @@ -574,7 +575,7 @@

          Note: Iterators of values obtained from list x now point to elements of this list. Iterators of this list and all the references are not invalidated.

        43. -
          void splice_after(const_iterator prev_p, slist & x, 
+
          void splice_after(const_iterator prev_p, slist & x, 
                   const_iterator before_first, const_iterator before_last) noexcept;
          
 
          Requires: prev_p must be a valid iterator of this. before_first and before_last must be valid iterators of x. prev_p must not be contained in [before_first, before_last) range. this' allocator and x's allocator shall compare equal.
          
 
          Effects: Transfers the range [before_first + 1, before_last + 1) from list x to this list, after the element pointed by prev_p.
          
@@ -583,7 +584,7 @@
 
          Note: Iterators of values obtained from list x now point to elements of this list. Iterators of this list and all the references are not invalidated.
        44. -
          void splice_after(const_iterator prev_p, slist && x, 
+
          void splice_after(const_iterator prev_p, slist && x, 
                   const_iterator before_first, const_iterator before_last) noexcept;
          
 
          Requires: prev_p must be a valid iterator of this. before_first and before_last must be valid iterators of x. prev_p must not be contained in [before_first, before_last) range. this' allocator and x's allocator shall compare equal.
          
 
          Effects: Transfers the range [before_first + 1, before_last + 1) from list x to this list, after the element pointed by prev_p.
          
@@ -592,7 +593,7 @@
 
          Note: Iterators of values obtained from list x now point to elements of this list. Iterators of this list and all the references are not invalidated.
        45. -
          void splice_after(const_iterator prev_p, slist & x, 
+
          void splice_after(const_iterator prev_p, slist & x, 
                   const_iterator before_first, const_iterator before_last, 
                   size_type n) noexcept;
          
 
          Requires: prev_p must be a valid iterator of this. before_first and before_last must be valid iterators of x. prev_p must not be contained in [before_first, before_last) range. n == distance(before_first, before_last). this' allocator and x's allocator shall compare equal.
          
@@ -602,7 +603,7 @@
 
          Note: Iterators of values obtained from list x now point to elements of this list. Iterators of this list and all the references are not invalidated.
        46. -
          void splice_after(const_iterator prev_p, slist && x, 
+
          void splice_after(const_iterator prev_p, slist && x, 
                   const_iterator before_first, const_iterator before_last, 
                   size_type n) noexcept;
          
 
          Requires: prev_p must be a valid iterator of this. before_first and before_last must be valid iterators of x. prev_p must not be contained in [before_first, before_last) range. n == distance(before_first, before_last). this' allocator and x's allocator shall compare equal.
          
@@ -612,42 +613,42 @@
 
          Note: Iterators of values obtained from list x now point to elements of this list. Iterators of this list and all the references are not invalidated.
        47. -
          void remove(const T & value);
          +
          void remove(const T & value);

          Effects: Removes all the elements that compare equal to value.

          Throws: Nothing.

          Complexity: Linear time. It performs exactly size() comparisons for equality.

          Note: The relative order of elements that are not removed is unchanged, and iterators to elements that are not removed remain valid.

        48. -
          template<typename Pred> void remove_if(Pred pred);
          +
          template<typename Pred> void remove_if(Pred pred);

          Effects: Removes all the elements for which a specified predicate is satisfied.

          Throws: If pred throws.

          Complexity: Linear time. It performs exactly size() calls to the predicate.

          Note: The relative order of elements that are not removed is unchanged, and iterators to elements that are not removed remain valid.

        49. -
          void unique();
          +
          void unique();

          Effects: Removes adjacent duplicate elements or adjacent elements that are equal from the list.

          Throws: If comparison throws.

          Complexity: Linear time (size()-1 comparisons equality comparisons).

          Note: The relative order of elements that are not removed is unchanged, and iterators to elements that are not removed remain valid.

        50. -
          template<typename Pred> void unique(Pred pred);
          +
          template<typename Pred> void unique(Pred pred);

          Effects: Removes adjacent duplicate elements or adjacent elements that satisfy some binary predicate from the list.

          Throws: If pred throws.

          Complexity: Linear time (size()-1 comparisons calls to pred()).

          Note: The relative order of elements that are not removed is unchanged, and iterators to elements that are not removed remain valid.

        51. -
          void merge(slist & x);
          +
          void merge(slist & x);

          Requires: The lists x and *this must be distinct.

          Effects: This function removes all of x's elements and inserts them in order into *this according to std::less<value_type>. The merge is stable; that is, if an element from *this is equivalent to one from x, then the element from *this will precede the one from x.

          Throws: If comparison throws.

          Complexity: This function is linear time: it performs at most size() + x.size() - 1 comparisons.

        52. -
          void merge(slist && x);
          +
          void merge(slist && x);

          Requires: The lists x and *this must be distinct.

          Effects: This function removes all of x's elements and inserts them in order into *this according to std::less<value_type>. The merge is stable; that is, if an element from *this is equivalent to one from x, then the element from *this will precede the one from x.

          Throws: If comparison throws.

          @@ -655,7 +656,7 @@ 
        53. template<typename StrictWeakOrdering> 
-  void merge(slist & x, StrictWeakOrdering comp);
          + void merge(slist & x, StrictWeakOrdering comp);

          Requires: p must be a comparison function that induces a strict weak ordering and both *this and x must be sorted according to that ordering The lists x and *this must be distinct.

          Effects: This function removes all of x's elements and inserts them in order into *this. The merge is stable; that is, if an element from *this is equivalent to one from x, then the element from *this will precede the one from x.

          Throws: If comp throws.

          @@ -664,7 +665,7 @@ 
        54. template<typename StrictWeakOrdering> 
-  void merge(slist && x, StrictWeakOrdering comp);
          + void merge(slist && x, StrictWeakOrdering comp);

          Requires: p must be a comparison function that induces a strict weak ordering and both *this and x must be sorted according to that ordering The lists x and *this must be distinct.

          Effects: This function removes all of x's elements and inserts them in order into *this. The merge is stable; that is, if an element from *this is equivalent to one from x, then the element from *this will precede the one from x.

          Throws: If comp throws.

          @@ -672,34 +673,34 @@

          Note: Iterators and references to *this are not invalidated.

        55. -
          void sort();
          +
          void sort();

          Effects: This function sorts the list *this according to std::less<value_type>. The sort is stable, that is, the relative order of equivalent elements is preserved.

          Throws: If comparison throws.

          Notes: Iterators and references are not invalidated.

          Complexity: The number of comparisons is approximately N log N, where N is the list's size.

        56. -
          template<typename StrictWeakOrdering> void sort(StrictWeakOrdering comp);
          +
          template<typename StrictWeakOrdering> void sort(StrictWeakOrdering comp);

          Effects: This function sorts the list *this according to std::less<value_type>. The sort is stable, that is, the relative order of equivalent elements is preserved.

          Throws: If comp throws.

          Notes: Iterators and references are not invalidated.

          Complexity: The number of comparisons is approximately N log N, where N is the list's size.

        57. -
          void reverse() noexcept;
          +
          void reverse() noexcept;

          Effects: Reverses the order of elements in the list.

          Throws: Nothing.

          Complexity: This function is linear time.

          Note: Iterators and references are not invalidated

        58. -
          template<class... Args> iterator emplace(const_iterator p, Args &&... args);
          +
          template<class... Args> iterator emplace(const_iterator p, Args &&... args);

          Effects: Inserts an object of type T constructed with std::forward<Args>(args)... before p

          Throws: If memory allocation throws or T's in-place constructor throws.

          Complexity: Linear to the elements before p

        59. -
          iterator insert(const_iterator p, const T & x);
          +
          iterator insert(const_iterator p, const T & x);

          Requires: p must be a valid iterator of *this.

          Effects: Insert a copy of x before p.

          Returns: an iterator to the inserted element.

          @@ -707,7 +708,7 @@

          Complexity: Linear to the elements before p.

        60. -
          iterator insert(const_iterator prev_p, T && x);
          +
          iterator insert(const_iterator prev_p, T && x);

          Requires: p must be a valid iterator of *this.

          Effects: Insert a new element before p with x's resources.

          Returns: an iterator to the inserted element.

          @@ -715,7 +716,7 @@

          Complexity: Linear to the elements before p.

        61. -
          iterator insert(const_iterator p, size_type n, const value_type & x);
          +
          iterator insert(const_iterator p, size_type n, const value_type & x);

          Requires: p must be a valid iterator of *this.

          Effects: Inserts n copies of x before p.

          Returns: an iterator to the first inserted element or p if n == 0.

          @@ -724,7 +725,7 @@ 
        62. template<typename InIter> 
-  iterator insert(const_iterator p, InIter first, InIter last);
          + iterator insert(const_iterator p, InIter first, InIter last);

          Requires: p must be a valid iterator of *this.

          Effects: Insert a copy of the [first, last) range before p.

          Returns: an iterator to the first inserted element or p if first == last.

          @@ -732,7 +733,7 @@

          Complexity: Linear to distance [first, last) plus linear to the elements before p.

        63. -
          iterator insert(const_iterator p, std::initializer_list< value_type > il);
          +
          iterator insert(const_iterator p, std::initializer_list< value_type > il);

          Requires: p must be a valid iterator of *this.

          Effects: Insert a copy of the [il.begin(), il.end()) range before p.

          Returns: an iterator to the first inserted element or p if il.begin() == il.end().

          @@ -740,21 +741,21 @@

          Complexity: Linear to the range [il.begin(), il.end()) plus linear to the elements before p.

        64. -
          iterator erase(const_iterator p) noexcept;
          +
          iterator erase(const_iterator p) noexcept;

          Requires: p must be a valid iterator of *this.

          Effects: Erases the element at p.

          Throws: Nothing.

          Complexity: Linear to the number of elements before p.

        65. -
          iterator erase(const_iterator first, const_iterator last) noexcept;
          +
          iterator erase(const_iterator first, const_iterator last) noexcept;

          Requires: first and last must be valid iterator to elements in *this.

          Effects: Erases the elements pointed by [first, last).

          Throws: Nothing.

          Complexity: Linear to the distance between first and last plus linear to the elements before first.

        66. -
          void splice(const_iterator p, slist & x) noexcept;
          +
          void splice(const_iterator p, slist & x) noexcept;

          Requires: p must point to an element contained by the list. x != *this. this' allocator and x's allocator shall compare equal

          Effects: Transfers all the elements of list x to this list, before the the element pointed by p. No destructors or copy constructors are called.

          Throws: Nothing

          @@ -762,7 +763,7 @@

          Note: Iterators of values obtained from list x now point to elements of this list. Iterators of this list and all the references are not invalidated.

        67. -
          void splice(const_iterator p, slist && x) noexcept;
          +
          void splice(const_iterator p, slist && x) noexcept;

          Requires: p must point to an element contained by the list. x != *this. this' allocator and x's allocator shall compare equal

          Effects: Transfers all the elements of list x to this list, before the the element pointed by p. No destructors or copy constructors are called.

          Throws: Nothing

          @@ -770,7 +771,7 @@

          Note: Iterators of values obtained from list x now point to elements of this list. Iterators of this list and all the references are not invalidated.

        68. -
          void splice(const_iterator p, slist & x, const_iterator i) noexcept;
          +
          void splice(const_iterator p, slist & x, const_iterator i) noexcept;

          Requires: p must point to an element contained by this list. i must point to an element contained in list x. this' allocator and x's allocator shall compare equal

          Effects: Transfers the value pointed by i, from list x to this list, before the element pointed by p. No destructors or copy constructors are called. If p == i or p == ++i, this function is a null operation.

          Throws: Nothing

          @@ -778,7 +779,7 @@

          Note: Iterators of values obtained from list x now point to elements of this list. Iterators of this list and all the references are not invalidated.

        69. -
          void splice(const_iterator p, slist && x, const_iterator i) noexcept;
          +
          void splice(const_iterator p, slist && x, const_iterator i) noexcept;

          Requires: p must point to an element contained by this list. i must point to an element contained in list x. this' allocator and x's allocator shall compare equal.

          Effects: Transfers the value pointed by i, from list x to this list, before the element pointed by p. No destructors or copy constructors are called. If p == i or p == ++i, this function is a null operation.

          Throws: Nothing

          @@ -786,7 +787,7 @@

          Note: Iterators of values obtained from list x now point to elements of this list. Iterators of this list and all the references are not invalidated.

        70. -
          void splice(const_iterator p, slist & x, const_iterator first, 
+
          void splice(const_iterator p, slist & x, const_iterator first, 
             const_iterator last) noexcept;
          
 
          Requires: p must point to an element contained by this list. first and last must point to elements contained in list x.
          
 
          Effects: Transfers the range pointed by first and last from list x to this list, before the element pointed by p. No destructors or copy constructors are called. this' allocator and x's allocator shall compare equal.
          
@@ -795,7 +796,7 @@
 
          Note: Iterators of values obtained from list x now point to elements of this list. Iterators of this list and all the references are not invalidated.
        71. -
          void splice(const_iterator p, slist && x, const_iterator first, 
+
          void splice(const_iterator p, slist && x, const_iterator first, 
             const_iterator last) noexcept;
          
 
          Requires: p must point to an element contained by this list. first and last must point to elements contained in list x. this' allocator and x's allocator shall compare equal
          
 
          Effects: Transfers the range pointed by first and last from list x to this list, before the element pointed by p. No destructors or copy constructors are called.
          
@@ -806,41 +807,41 @@
        -

        -slist friend functions

        +

        +slist friend functions

        1. -
          friend bool operator==(const slist & x, const slist & y);
          +
          friend bool operator==(const slist & x, const slist & y);

          Effects: Returns true if x and y are equal

          Complexity: Linear to the number of elements in the container.

        2. -
          friend bool operator!=(const slist & x, const slist & y);
          +
          friend bool operator!=(const slist & x, const slist & y);

          Effects: Returns true if x and y are unequal

          Complexity: Linear to the number of elements in the container.

        3. -
          friend bool operator<(const slist & x, const slist & y);
          +
          friend bool operator<(const slist & x, const slist & y);

          Effects: Returns true if x is less than y

          Complexity: Linear to the number of elements in the container.

        4. -
          friend bool operator>(const slist & x, const slist & y);
          +
          friend bool operator>(const slist & x, const slist & y);

          Effects: Returns true if x is greater than y

          Complexity: Linear to the number of elements in the container.

        5. -
          friend bool operator<=(const slist & x, const slist & y);
          +
          friend bool operator<=(const slist & x, const slist & y);

          Effects: Returns true if x is equal or less than y

          Complexity: Linear to the number of elements in the container.

        6. -
          friend bool operator>=(const slist & x, const slist & y);
          +
          friend bool operator>=(const slist & x, const slist & y);

          Effects: Returns true if x is equal or greater than y

          Complexity: Linear to the number of elements in the container.

        7. -
          friend void swap(slist & x, slist & y);
          +
          friend void swap(slist & x, slist & y);

          Effects: x.swap(y)

          Complexity: Constant.

          8. @@ -850,7 +851,8 @@
        -
        Copyright © 2009-2015 Ion Gaztanaga

        +

        Copyright © 2009-2017 Ion + Gaztanaga

        Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

        @@ -858,7 +860,7 @@
        -PrevUpHomeNext +PrevUpHomeNext
        diff --git a/doc/html/boost/container/small_vector.html b/doc/html/boost/container/small_vector.html index eebfbd29b2..2a405ecc47 100644 --- a/doc/html/boost/container/small_vector.html +++ b/doc/html/boost/container/small_vector.html @@ -38,41 +38,41 @@ { public: // construct/copy/destruct - small_vector() noexcept(container_detail::is_nothrow_default_constructible< Allocator >::value)); - explicit small_vector(const allocator_type &); - explicit small_vector(size_type); - small_vector(size_type, const allocator_type &); - small_vector(size_type, default_init_t); - small_vector(size_type, default_init_t, const allocator_type &); - small_vector(size_type, const value_type &); - small_vector(size_type, const value_type &, const allocator_type &); - template<typename InIt> small_vector(InIt, InIt last ); - template<typename InIt> small_vector(InIt, InIt, const allocator_type &a ); - small_vector(const small_vector &); - small_vector(const small_vector &, const allocator_type &); - explicit small_vector(const base_type &); - explicit small_vector(base_type &&); - small_vector(small_vector &&); - small_vector(small_vector &&, const allocator_type &); - small_vector(std::initializer_list< value_type >, + small_vector() noexcept(dtl::is_nothrow_default_constructible< Allocator >::value)); + explicit small_vector(const allocator_type &); + explicit small_vector(size_type); + small_vector(size_type, const allocator_type &); + small_vector(size_type, default_init_t); + small_vector(size_type, default_init_t, const allocator_type &); + small_vector(size_type, const value_type &); + small_vector(size_type, const value_type &, const allocator_type &); + template<typename InIt> small_vector(InIt, InIt last ); + template<typename InIt> small_vector(InIt, InIt, const allocator_type &a ); + small_vector(const small_vector &); + small_vector(const small_vector &, const allocator_type &); + explicit small_vector(const base_type &); + explicit small_vector(base_type &&); + small_vector(small_vector &&); + small_vector(small_vector &&, const allocator_type &); + small_vector(std::initializer_list< value_type >, const allocator_type & = allocator_type()); - small_vector & operator=(const small_vector &); - small_vector & operator=(small_vector &&); - small_vector & operator=(const base_type &); - small_vector & operator=(base_type &&); + small_vector & operator=(const small_vector &); + small_vector & operator=(small_vector &&); + small_vector & operator=(const base_type &); + small_vector & operator=(base_type &&); - // public member functions - void swap(small_vector &); + // public member functions + void swap(small_vector &); };
        -

        Description

        +

        Description

        small_vector is a vector-like container optimized for the case when it contains few elements. It contains some preallocated elements in-place, which can avoid the use of dynamic storage allocation when the actual number of elements is below that preallocated threshold.

        small_vector<T, N, Allocator> is convertible to small_vector_base<T, Allocator> that is independent from the preallocated element capacity, so client code does not need to be templated on that N argument.

        All boost::container::vector member functions are inherited. See vector documentation for details.

        -

        Template Parameters

        +

        Template Parameters

        1. typename T
          @@ -89,48 +89,49 @@
        -

        +

        small_vector public construct/copy/destruct

          -
        1. small_vector() noexcept(container_detail::is_nothrow_default_constructible< Allocator >::value));
          2. -
        2. explicit small_vector(const allocator_type & a);
          3. -
        3. explicit small_vector(size_type n);
          4. -
        4. small_vector(size_type n, const allocator_type & a);
          5. -
        5. small_vector(size_type n, default_init_t);
          6. -
        6. small_vector(size_type n, default_init_t, const allocator_type & a);
          7. -
        7. small_vector(size_type n, const value_type & v);
          8. -
        8. small_vector(size_type n, const value_type & v, const allocator_type & a);
          9. +
        9. small_vector() noexcept(dtl::is_nothrow_default_constructible< Allocator >::value));
          10. +
        10. explicit small_vector(const allocator_type & a);
          11. +
        11. explicit small_vector(size_type n);
          12. +
        12. small_vector(size_type n, const allocator_type & a);
          13. +
        13. small_vector(size_type n, default_init_t);
          14. +
        14. small_vector(size_type n, default_init_t, const allocator_type & a);
          15. +
        15. small_vector(size_type n, const value_type & v);
          16. +
        16. small_vector(size_type n, const value_type & v, const allocator_type & a);
        17. template<typename InIt> 
-  small_vector(InIt first, InIt last  BOOST_CONTAINER_DOCIGN);
          18. + small_vector(InIt first, InIt last BOOST_CONTAINER_DOCIGN); 
        18. template<typename InIt> 
-  small_vector(InIt first, InIt last, 
+  small_vector(InIt first, InIt last, 
                const allocator_type &a  BOOST_CONTAINER_DOCIGN);
          19. -
        19. small_vector(const small_vector & other);
          20. -
        20. small_vector(const small_vector & other, const allocator_type & a);
          21. -
        21. explicit small_vector(const base_type & other);
          22. -
        22. explicit small_vector(base_type && other);
          23. -
        23. small_vector(small_vector && other);
          24. -
        24. small_vector(small_vector && other, const allocator_type & a);
          25. -
        25. small_vector(std::initializer_list< value_type > il, 
+
        26. small_vector(const small_vector & other);
          27. 
+
        27. small_vector(const small_vector & other, const allocator_type & a);
          28. 
+
        28. explicit small_vector(const base_type & other);
          29. 
+
        29. explicit small_vector(base_type && other);
          30. 
+
        30. small_vector(small_vector && other);
          31. 
+
        31. small_vector(small_vector && other, const allocator_type & a);
          32. 
+
        32. small_vector(std::initializer_list< value_type > il, 
              const allocator_type & a = allocator_type());
          33. 
-
        33. small_vector & operator=(const small_vector & other);
          34. 
-
        34. small_vector & operator=(small_vector && other);
          35. 
-
        35. small_vector & operator=(const base_type & other);
          36. 
-
        36. small_vector & operator=(base_type && other);
          37. 
+
        37. small_vector & operator=(const small_vector & other);
          38. 
+
        38. small_vector & operator=(small_vector && other);
          39. 
+
        39. small_vector & operator=(const base_type & other);
          40. 
+
        40. small_vector & operator=(base_type && other);
          41.
        -

        -small_vector public member functions

        -
        1. void swap(small_vector & other);
        +

        +small_vector public member functions

        +
        1. void swap(small_vector & other);
        -
        Copyright © 2009-2015 Ion Gaztanaga

        +

        Copyright © 2009-2017 Ion + Gaztanaga

        Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

        diff --git a/doc/html/boost/container/small_vector_allocator.html b/doc/html/boost/container/small_vector_allocator.html index 2fc6fb5afb..11764b33bb 100644 --- a/doc/html/boost/container/small_vector_allocator.html +++ b/doc/html/boost/container/small_vector_allocator.html @@ -45,9 +45,9 @@ typedef allocator_traits< Allocator >::difference_type difference_type; typedef allocator_traits< Allocator >::void_pointer void_pointer; typedef allocator_traits< Allocator >::const_void_pointer const_void_pointer; - typedef allocator_traits< Allocator >::propagate_on_container_copy_assignment propagate_on_container_copy_assignment; - typedef allocator_traits< Allocator >::propagate_on_container_move_assignment propagate_on_container_move_assignment; - typedef allocator_traits< Allocator >::propagate_on_container_swap propagate_on_container_swap; + typedef allocator_traits< Allocator >::propagate_on_container_copy_assignment propagate_on_container_copy_assignment; + typedef allocator_traits< Allocator >::propagate_on_container_move_assignment propagate_on_container_move_assignment; + typedef allocator_traits< Allocator >::propagate_on_container_swap propagate_on_container_swap; typedef implementation_defined is_always_equal; // An integral constant with member value == false typedef implementation_defined is_partially_propagable; // An integral constant with member value == true @@ -59,38 +59,38 @@ }; // construct/copy/destruct - template<class... Args> explicit small_vector_allocator(Args &&...); - small_vector_allocator(const small_vector_allocator &) noexcept; - small_vector_allocator(small_vector_allocator &&) noexcept; + template<class... Args> explicit small_vector_allocator(Args &&...); + small_vector_allocator(const small_vector_allocator &) noexcept; + small_vector_allocator(small_vector_allocator &&) noexcept; template<typename OtherAllocator> - small_vector_allocator(const small_vector_allocator< OtherAllocator > &) noexcept; + small_vector_allocator(const small_vector_allocator< OtherAllocator > &) noexcept; template<typename OtherAllocator> - small_vector_allocator(small_vector_allocator< OtherAllocator > &&) noexcept; - small_vector_allocator & operator=(const small_vector_allocator &) noexcept; - small_vector_allocator & operator=(small_vector_allocator &&) noexcept; + small_vector_allocator(small_vector_allocator< OtherAllocator > &&) noexcept; + small_vector_allocator & operator=(const small_vector_allocator &) noexcept; + small_vector_allocator & operator=(small_vector_allocator &&) noexcept; template<typename OtherAllocator> small_vector_allocator & - operator=(const small_vector_allocator< OtherAllocator > &) noexcept; + operator=(const small_vector_allocator< OtherAllocator > &) noexcept; template<typename OtherAllocator> small_vector_allocator & - operator=(small_vector_allocator< OtherAllocator > &&) noexcept; + operator=(small_vector_allocator< OtherAllocator > &&) noexcept; - // public member functions - pointer allocate(size_type, const_void_pointer = const_void_pointer()); - void deallocate(pointer, size_type) noexcept; - size_type max_size() const noexcept; - small_vector_allocator select_on_container_copy_construction() const; - bool storage_is_unpropagable(pointer) const; + // public member functions + pointer allocate(size_type, const_void_pointer = const_void_pointer()); + void deallocate(pointer, size_type) noexcept; + size_type max_size() const noexcept; + small_vector_allocator select_on_container_copy_construction() const; + bool storage_is_unpropagable(pointer) const; - // friend functions - friend void swap(small_vector_allocator &, small_vector_allocator &) noexcept; - friend bool operator==(const small_vector_allocator &, + // friend functions + friend void swap(small_vector_allocator &, small_vector_allocator &) noexcept; + friend bool operator==(const small_vector_allocator &, const small_vector_allocator &) noexcept; - friend bool operator!=(const small_vector_allocator &, + friend bool operator!=(const small_vector_allocator &, const small_vector_allocator &) noexcept; };
        -

        Description

        +

        Description

        A non-standard allocator used to implement small_vector. Users should never use it directly. It is described here for documentation purposes.

        This allocator inherits from a standard-conforming allocator and forwards member functions to the standard allocator except when internal storage is being used as memory source.

        This allocator is a "partially_propagable" allocator and defines is_partially_propagable as true_type.

        @@ -98,88 +98,88 @@

        boost::container::vector supports partially propagable allocators fallbacking to deep copy/swap/move operations when internal storage is being used to store vector elements.

        small_vector_allocator assumes that will be instantiated as boost::container::vector< T, small_vector_allocator<Allocator> > and internal storage can be obtained downcasting that vector to small_vector_base<T>.

        -

        +

        small_vector_allocator public construct/copy/destruct

        1. -
          template<class... Args> explicit small_vector_allocator(Args &&... args);
          Constructor from arbitrary arguments.
          2. +
          template<class... Args> explicit small_vector_allocator(Args &&... args);
          Constructor from arbitrary arguments.
        2. -
          small_vector_allocator(const small_vector_allocator & other) noexcept;
          +
          small_vector_allocator(const small_vector_allocator & other) noexcept;

          Constructor from other small_vector_allocator. Never throws

        3. -
          small_vector_allocator(small_vector_allocator && other) noexcept;
          +
          small_vector_allocator(small_vector_allocator && other) noexcept;

          Move constructor from small_vector_allocator. Never throws 

        4. template<typename OtherAllocator> 
-  small_vector_allocator(const small_vector_allocator< OtherAllocator > & other) noexcept;
          + small_vector_allocator(const small_vector_allocator< OtherAllocator > & other) noexcept;

          Constructor from related small_vector_allocator. Never throws 

        5. template<typename OtherAllocator> 
-  small_vector_allocator(small_vector_allocator< OtherAllocator > && other) noexcept;
          + small_vector_allocator(small_vector_allocator< OtherAllocator > && other) noexcept;

          Move constructor from related small_vector_allocator. Never throws 

        6. small_vector_allocator & 
-operator=(const small_vector_allocator & other) noexcept;
          +operator=(const small_vector_allocator & other) noexcept;

          Assignment from other small_vector_allocator. Never throws

        7. -
          small_vector_allocator & operator=(small_vector_allocator && other) noexcept;
          +
          small_vector_allocator & operator=(small_vector_allocator && other) noexcept;

          Move constructor from other small_vector_allocator. Never throws 

        8. template<typename OtherAllocator> 
   small_vector_allocator & 
-  operator=(const small_vector_allocator< OtherAllocator > & other) noexcept;
          + operator=(const small_vector_allocator< OtherAllocator > & other) noexcept;

          Assignment from related small_vector_allocator. Never throws 

        9. template<typename OtherAllocator> 
   small_vector_allocator & 
-  operator=(small_vector_allocator< OtherAllocator > && other) noexcept;
          + operator=(small_vector_allocator< OtherAllocator > && other) noexcept;

          Move assignment from related small_vector_allocator. Never throws

        -

        -small_vector_allocator public member functions

        +

        +small_vector_allocator public member functions

        1. -
          pointer allocate(size_type count, 
+
          pointer allocate(size_type count, 
                  const_void_pointer hint = const_void_pointer());
          Allocates storage from the standard-conforming allocator.
        2. -
          void deallocate(pointer ptr, size_type n) noexcept;
          +
          void deallocate(pointer ptr, size_type n) noexcept;

          Deallocates previously allocated memory. Never throws

        3. -
          size_type max_size() const noexcept;
          +
          size_type max_size() const noexcept;

          Returns the maximum number of elements that could be allocated. Never throws

          4. -
        4. small_vector_allocator select_on_container_copy_construction() const;
          5. -
        5. bool storage_is_unpropagable(pointer p) const;
          6. +
        6. small_vector_allocator select_on_container_copy_construction() const;
          7. +
        7. bool storage_is_unpropagable(pointer p) const;
        -

        -small_vector_allocator friend functions

        +

        +small_vector_allocator friend functions

        1. -
          friend void swap(small_vector_allocator & l, small_vector_allocator & r) noexcept;
          +
          friend void swap(small_vector_allocator & l, small_vector_allocator & r) noexcept;

          Swaps two allocators, does nothing because this small_vector_allocator is stateless

        2. -
          friend bool operator==(const small_vector_allocator & l, 
+
          friend bool operator==(const small_vector_allocator & l, 
                        const small_vector_allocator & r) noexcept;
          
 
          An small_vector_allocator always compares to true, as memory allocated with one instance can be deallocated by another instance (except for unpropagable storage)
        3. -
          friend bool operator!=(const small_vector_allocator & l, 
+
          friend bool operator!=(const small_vector_allocator & l, 
                        const small_vector_allocator & r) noexcept;
          
 
          An small_vector_allocator always compares to false, as memory allocated with one instance can be deallocated by another instance
          4. @@ -189,7 +189,8 @@
        -
        Copyright © 2009-2015 Ion Gaztanaga

        +

        Copyright © 2009-2017 Ion + Gaztanaga

        Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

        diff --git a/doc/html/boost/container/small_vector_allocator/rebind.html b/doc/html/boost/container/small_vector_allocator/rebind.html index e375f4a609..9c1590ccce 100644 --- a/doc/html/boost/container/small_vector_allocator/rebind.html +++ b/doc/html/boost/container/small_vector_allocator/rebind.html @@ -6,7 +6,7 @@ - + @@ -21,7 +21,7 @@
        -PrevUpHomeNext +PrevUpHomeNext
        @@ -39,13 +39,14 @@ typedef allocator_traits< Allocator >::template rebind_alloc< T2 >::type other; };
        -

        Description

        +

        Description

        Obtains an small_vector_allocator that allocates objects of type T2

        -
        Copyright © 2009-2015 Ion Gaztanaga

        +

        Copyright © 2009-2017 Ion + Gaztanaga

        Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

        @@ -53,7 +54,7 @@
        -PrevUpHomeNext +PrevUpHomeNext
        diff --git a/doc/html/boost/container/small_vector_base.html b/doc/html/boost/container/small_vector_base.html index 76b4e60436..8a32780e10 100644 --- a/doc/html/boost/container/small_vector_base.html +++ b/doc/html/boost/container/small_vector_base.html @@ -37,14 +37,14 @@ { public: // construct/copy/destruct - small_vector_base & operator=(const small_vector_base &); - small_vector_base & operator=(small_vector_base &&); + small_vector_base & operator=(const small_vector_base &); + small_vector_base & operator=(small_vector_base &&); - // public member functions - void swap(small_vector_base &); + // public member functions + void swap(small_vector_base &); };
        -

        Description

        +

        Description

        This class consists of common code from all small_vector<T, N> types that don't depend on the "N" template parameter. This class is non-copyable and non-destructible, so this class typically used as reference argument to functions that read or write small vectors. Since small_vector<T, N> derives from small_vector_base<T>, the conversion to small_vector_base is implicit 

        //Clients can pass any small_vector<Foo, N>.
 void read_any_small_vector_of_foo(const small_vector_base<Foo> &in_parameter);
@@ -64,25 +64,26 @@

        All boost::container:vector member functions are inherited. See vector documentation for details.

        -

        +

        small_vector_base public construct/copy/destruct

          -
        1. small_vector_base & operator=(const small_vector_base & other);
          2. -
        2. small_vector_base & operator=(small_vector_base && other);
          3. +
        3. small_vector_base & operator=(const small_vector_base & other);
          4. +
        4. small_vector_base & operator=(small_vector_base && other);
        -

        -small_vector_base public member functions

        -
        1. void swap(small_vector_base & other);
        +

        +small_vector_base public member functions

        +
        1. void swap(small_vector_base & other);
        -
        Copyright © 2009-2015 Ion Gaztanaga

        +

        Copyright © 2009-2017 Ion + Gaztanaga

        Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

        diff --git a/doc/html/boost/container/stable_vector.html b/doc/html/boost/container/stable_vector.html index 17ee07c4d3..d370c5b4b8 100644 --- a/doc/html/boost/container/stable_vector.html +++ b/doc/html/boost/container/stable_vector.html @@ -51,96 +51,96 @@ typedef implementation_defined const_reverse_iterator; // construct/copy/destruct - stable_vector() noexcept(container_detail::is_nothrow_default_constructible< Allocator >::value)); - explicit stable_vector(const allocator_type &) noexcept; - explicit stable_vector(size_type); - stable_vector(size_type, default_init_t); - explicit stable_vector(size_type, const allocator_type &); - stable_vector(size_type, default_init_t, const allocator_type &); - stable_vector(size_type, const T &, + stable_vector() noexcept(dtl::is_nothrow_default_constructible< Allocator >::value)); + explicit stable_vector(const allocator_type &) noexcept; + explicit stable_vector(size_type); + stable_vector(size_type, default_init_t); + explicit stable_vector(size_type, const allocator_type &); + stable_vector(size_type, default_init_t, const allocator_type &); + stable_vector(size_type, const T &, const allocator_type & = allocator_type()); template<typename InputIterator> - stable_vector(InputIterator, InputIterator, + stable_vector(InputIterator, InputIterator, const allocator_type & = allocator_type()); - stable_vector(const stable_vector &); - stable_vector(std::initializer_list< value_type >, + stable_vector(const stable_vector &); + stable_vector(std::initializer_list< value_type >, const allocator_type & = allocator_type()); - stable_vector(stable_vector &&) noexcept; - stable_vector(const stable_vector &, const allocator_type &); - stable_vector(stable_vector &&, const allocator_type &); - stable_vector & operator=(const stable_vector &); + stable_vector(stable_vector &&) noexcept; + stable_vector(const stable_vector &, const allocator_type &); + stable_vector(stable_vector &&, const allocator_type &); + stable_vector & operator=(const stable_vector &); stable_vector & - operator=(stable_vector &&) noexcept(allocator_traits_type::propagate_on_container_move_assignment::value||allocator_traits_type::is_always_equal::value)); - stable_vector & operator=(std::initializer_list< value_type >); - ~stable_vector(); + operator=(stable_vector &&) noexcept(allocator_traits_type::propagate_on_container_move_assignment::value||allocator_traits_type::is_always_equal::value)); + stable_vector & operator=(std::initializer_list< value_type >); + ~stable_vector(); - // public member functions - void assign(size_type, const T &); - template<typename InputIterator> void assign(InputIterator, InputIterator); - void assign(std::initializer_list< value_type >); - allocator_type get_allocator() const; - const stored_allocator_type & get_stored_allocator() const noexcept; - stored_allocator_type & get_stored_allocator() noexcept; - iterator begin() noexcept; - const_iterator begin() const noexcept; - iterator end() noexcept; - const_iterator end() const noexcept; - reverse_iterator rbegin() noexcept; - const_reverse_iterator rbegin() const noexcept; - reverse_iterator rend() noexcept; - const_reverse_iterator rend() const noexcept; - const_iterator cbegin() const noexcept; - const_iterator cend() const noexcept; - const_reverse_iterator crbegin() const noexcept; - const_reverse_iterator crend() const noexcept; - bool empty() const noexcept; - size_type size() const noexcept; - size_type max_size() const noexcept; - void resize(size_type); - void resize(size_type, default_init_t); - void resize(size_type, const T &); - size_type capacity() const noexcept; - void reserve(size_type); - void shrink_to_fit(); - reference front() noexcept; - const_reference front() const noexcept; - reference back() noexcept; - const_reference back() const noexcept; - reference operator[](size_type) noexcept; - const_reference operator[](size_type) const noexcept; - iterator nth(size_type) noexcept; - const_iterator nth(size_type) const noexcept; - size_type index_of(iterator) noexcept; - size_type index_of(const_iterator) const noexcept; - reference at(size_type); - const_reference at(size_type) const; - template<class... Args> reference emplace_back(Args &&...); - template<class... Args> iterator emplace(const_iterator, Args &&...); - void push_back(const T &); - void push_back(T &&); - iterator insert(const_iterator, const T &); - iterator insert(const_iterator, T &&); - iterator insert(const_iterator, size_type, const T &); - iterator insert(const_iterator, std::initializer_list< value_type >); + // public member functions + void assign(size_type, const T &); + template<typename InputIterator> void assign(InputIterator, InputIterator); + void assign(std::initializer_list< value_type >); + allocator_type get_allocator() const; + const stored_allocator_type & get_stored_allocator() const noexcept; + stored_allocator_type & get_stored_allocator() noexcept; + iterator begin() noexcept; + const_iterator begin() const noexcept; + iterator end() noexcept; + const_iterator end() const noexcept; + reverse_iterator rbegin() noexcept; + const_reverse_iterator rbegin() const noexcept; + reverse_iterator rend() noexcept; + const_reverse_iterator rend() const noexcept; + const_iterator cbegin() const noexcept; + const_iterator cend() const noexcept; + const_reverse_iterator crbegin() const noexcept; + const_reverse_iterator crend() const noexcept; + bool empty() const noexcept; + size_type size() const noexcept; + size_type max_size() const noexcept; + void resize(size_type); + void resize(size_type, default_init_t); + void resize(size_type, const T &); + size_type capacity() const noexcept; + void reserve(size_type); + void shrink_to_fit(); + reference front() noexcept; + const_reference front() const noexcept; + reference back() noexcept; + const_reference back() const noexcept; + reference operator[](size_type) noexcept; + const_reference operator[](size_type) const noexcept; + iterator nth(size_type) noexcept; + const_iterator nth(size_type) const noexcept; + size_type index_of(iterator) noexcept; + size_type index_of(const_iterator) const noexcept; + reference at(size_type); + const_reference at(size_type) const; + template<class... Args> reference emplace_back(Args &&...); + template<class... Args> iterator emplace(const_iterator, Args &&...); + void push_back(const T &); + void push_back(T &&); + iterator insert(const_iterator, const T &); + iterator insert(const_iterator, T &&); + iterator insert(const_iterator, size_type, const T &); + iterator insert(const_iterator, std::initializer_list< value_type >); template<typename InputIterator> - iterator insert(const_iterator, InputIterator, InputIterator); - void pop_back() noexcept; - iterator erase(const_iterator) noexcept; - iterator erase(const_iterator, const_iterator) noexcept; - void swap(stable_vector &) noexcept(allocator_traits_type::propagate_on_container_swap::value||allocator_traits_type::is_always_equal::value)); - void clear() noexcept; + iterator insert(const_iterator, InputIterator, InputIterator); + void pop_back() noexcept; + iterator erase(const_iterator) noexcept; + iterator erase(const_iterator, const_iterator) noexcept; + void swap(stable_vector &) noexcept(allocator_traits_type::propagate_on_container_swap::value||allocator_traits_type::is_always_equal::value)); + void clear() noexcept; - // friend functions - friend bool operator==(const stable_vector &, const stable_vector &); - friend bool operator!=(const stable_vector &, const stable_vector &); - friend bool operator<(const stable_vector &, const stable_vector &); - friend bool operator>(const stable_vector &, const stable_vector &); - friend bool operator<=(const stable_vector &, const stable_vector &); - friend bool operator>=(const stable_vector &, const stable_vector &); - friend void swap(stable_vector &, stable_vector &); + // friend functions + friend bool operator==(const stable_vector &, const stable_vector &); + friend bool operator!=(const stable_vector &, const stable_vector &); + friend bool operator<(const stable_vector &, const stable_vector &); + friend bool operator>(const stable_vector &, const stable_vector &); + friend bool operator<=(const stable_vector &, const stable_vector &); + friend bool operator>=(const stable_vector &, const stable_vector &); + friend void swap(stable_vector &, stable_vector &); };
        -

        Description

        +

        Description

        Originally developed by Joaquin M. Lopez Munoz, stable_vector is a std::vector drop-in replacement implemented as a node container, offering iterator and reference stability.

        Here are the details taken from the author's blog (Introducing stable_vector):

        We present stable_vector, a fully STL-compliant stable container that provides most of the features of std::vector except element contiguity.

        @@ -150,7 +150,7 @@

        -

        Template Parameters

        +

        Template Parameters

        1. typename T
          @@ -163,51 +163,51 @@
        -

        +

        stable_vector public construct/copy/destruct

        1. -
          stable_vector() noexcept(container_detail::is_nothrow_default_constructible< Allocator >::value));
          +
          stable_vector() noexcept(dtl::is_nothrow_default_constructible< Allocator >::value));

          Effects: Default constructs a stable_vector.

          Throws: If allocator_type's default constructor throws.

          Complexity: Constant.

        2. -
          explicit stable_vector(const allocator_type & al) noexcept;
          +
          explicit stable_vector(const allocator_type & al) noexcept;

          Effects: Constructs a stable_vector taking the allocator as parameter.

          Throws: Nothing

          Complexity: Constant.

        3. -
          explicit stable_vector(size_type n);
          +
          explicit stable_vector(size_type n);

          Effects: Constructs a stable_vector and inserts n value initialized values.

          Throws: If allocator_type's default constructor throws or T's default or copy constructor throws.

          Complexity: Linear to n.

        4. -
          stable_vector(size_type n, default_init_t);
          +
          stable_vector(size_type n, default_init_t);

          Effects: Constructs a stable_vector and inserts n default initialized values.

          Throws: If allocator_type's default constructor throws or T's default or copy constructor throws.

          Complexity: Linear to n.

          Note: Non-standard extension

        5. -
          explicit stable_vector(size_type n, const allocator_type & a);
          +
          explicit stable_vector(size_type n, const allocator_type & a);

          Effects: Constructs a stable_vector that will use a copy of allocator a and inserts n value initialized values.

          Throws: If allocator_type's default constructor throws or T's default or copy constructor throws.

          Complexity: Linear to n.

        6. -
          stable_vector(size_type n, default_init_t, const allocator_type & a);
          +
          stable_vector(size_type n, default_init_t, const allocator_type & a);

          Effects: Constructs a stable_vector that will use a copy of allocator a and inserts n default initialized values.

          Throws: If allocator_type's default constructor throws or T's default or copy constructor throws.

          Complexity: Linear to n.

          Note: Non-standard extension

        7. -
          stable_vector(size_type n, const T & t, 
+
          stable_vector(size_type n, const T & t, 
               const allocator_type & al = allocator_type());
          
 
          Effects: Constructs a stable_vector that will use a copy of allocator a and inserts n copies of value.
          
 
          Throws: If allocator_type's default constructor throws or T's default or copy constructor throws.
          
@@ -215,45 +215,45 @@
 
        8. template<typename InputIterator> 
-  stable_vector(InputIterator first, InputIterator last, 
+  stable_vector(InputIterator first, InputIterator last, 
                 const allocator_type & al = allocator_type());

          Effects: Constructs a stable_vector that will use a copy of allocator a and inserts a copy of the range [first, last) in the stable_vector.

          Throws: If allocator_type's default constructor throws or T's constructor taking a dereferenced InIt throws.

          Complexity: Linear to the range [first, last).

        9. -
          stable_vector(const stable_vector & x);
          +
          stable_vector(const stable_vector & x);

          Effects: Copy constructs a stable_vector.

          Postcondition: x == *this.

          Complexity: Linear to the elements x contains.

        10. -
          stable_vector(std::initializer_list< value_type > il, 
+
          stable_vector(std::initializer_list< value_type > il, 
               const allocator_type & l = allocator_type());
          
 
          Effects: Constructs a stable_vector that will use a copy of allocator a and inserts a copy of the range [il.begin(), il.last()) in the stable_vector
          
 
          Throws: If allocator_type's default constructor throws or T's constructor taking a dereferenced initializer_list iterator throws.
          
 
          Complexity: Linear to the range [il.begin(), il.end()).
        11. -
          stable_vector(stable_vector && x) noexcept;
          +
          stable_vector(stable_vector && x) noexcept;

          Effects: Move constructor. Moves x's resources to *this.

          Throws: If allocator_type's copy constructor throws.

          Complexity: Constant.

        12. -
          stable_vector(const stable_vector & x, const allocator_type & a);
          +
          stable_vector(const stable_vector & x, const allocator_type & a);

          Effects: Copy constructs a stable_vector using the specified allocator.

          Postcondition: x == *this.

          Complexity: Linear to the elements x contains.

        13. -
          stable_vector(stable_vector && x, const allocator_type & a);
          +
          stable_vector(stable_vector && x, const allocator_type & a);

          Effects: Move constructor using the specified allocator. Moves x's resources to *this.

          Throws: If allocator_type's copy constructor throws.

          Complexity: Constant if a == x.get_allocator(), linear otherwise

        14. -
          stable_vector & operator=(const stable_vector & x);
          +
          stable_vector & operator=(const stable_vector & x);

          Effects: Makes *this contain the same elements as x.

          Postcondition: this->size() == x.size(). *this contains a copy of each of x's elements.

          Throws: If memory allocation throws or T's copy constructor throws.

          @@ -261,19 +261,19 @@ 
        15. stable_vector & 
-operator=(stable_vector && x) noexcept(allocator_traits_type::propagate_on_container_move_assignment::value||allocator_traits_type::is_always_equal::value));
          +operator=(stable_vector && x) noexcept(allocator_traits_type::propagate_on_container_move_assignment::value||allocator_traits_type::is_always_equal::value));

          Effects: Move assignment. All x's values are transferred to *this.

          Postcondition: x.empty(). *this contains a the elements x had before the function.

          Throws: If allocator_traits_type::propagate_on_container_move_assignment is false and (allocation throws or T's move constructor throws)

          Complexity: Constant if allocator_traits_type:: propagate_on_container_move_assignment is true or this->get>allocator() == x.get_allocator(). Linear otherwise.

        16. -
          stable_vector & operator=(std::initializer_list< value_type > il);
          +
          stable_vector & operator=(std::initializer_list< value_type > il);

          Effects: Make *this container contains elements from il.

          Complexity: Linear to the range [il.begin(), il.end()).

        17. -
          ~stable_vector();
          +
          ~stable_vector();

          Effects: Destroys the stable_vector. All stored values are destroyed and used memory is deallocated.

          Throws: Nothing.

          Complexity: Linear to the number of elements.

          @@ -281,217 +281,217 @@
        -

        -stable_vector public member functions

        +

        +stable_vector public member functions

        1. -
          void assign(size_type n, const T & t);
          +
          void assign(size_type n, const T & t);

          Effects: Assigns the n copies of val to *this.

          Throws: If memory allocation throws or T's copy constructor throws.

          Complexity: Linear to n. 

        2. template<typename InputIterator> 
-  void assign(InputIterator first, InputIterator last);
          + void assign(InputIterator first, InputIterator last);

          Effects: Assigns the the range [first, last) to *this.

          Throws: If memory allocation throws or T's constructor from dereferencing InpIt throws.

          Complexity: Linear to n.

        3. -
          void assign(std::initializer_list< value_type > il);
          +
          void assign(std::initializer_list< value_type > il);

          Effects: Assigns the the range [il.begin(), il.end()) to *this.

          Throws: If memory allocation throws or T's constructor from dereferencing initializer_list iterator throws.

        4. -
          allocator_type get_allocator() const;
          +
          allocator_type get_allocator() const;

          Effects: Returns a copy of the internal allocator.

          Throws: If allocator's copy constructor throws.

          Complexity: Constant.

        5. -
          const stored_allocator_type & get_stored_allocator() const noexcept;
          +
          const stored_allocator_type & get_stored_allocator() const noexcept;

          Effects: Returns a reference to the internal allocator.

          Throws: Nothing

          Complexity: Constant.

          Note: Non-standard extension.

        6. -
          stored_allocator_type & get_stored_allocator() noexcept;
          +
          stored_allocator_type & get_stored_allocator() noexcept;

          Effects: Returns a reference to the internal allocator.

          Throws: Nothing

          Complexity: Constant.

          Note: Non-standard extension.

        7. -
          iterator begin() noexcept;
          +
          iterator begin() noexcept;

          Effects: Returns an iterator to the first element contained in the stable_vector.

          Throws: Nothing.

          Complexity: Constant.

        8. -
          const_iterator begin() const noexcept;
          +
          const_iterator begin() const noexcept;

          Effects: Returns a const_iterator to the first element contained in the stable_vector.

          Throws: Nothing.

          Complexity: Constant.

        9. -
          iterator end() noexcept;
          +
          iterator end() noexcept;

          Effects: Returns an iterator to the end of the stable_vector.

          Throws: Nothing.

          Complexity: Constant.

        10. -
          const_iterator end() const noexcept;
          +
          const_iterator end() const noexcept;

          Effects: Returns a const_iterator to the end of the stable_vector.

          Throws: Nothing.

          Complexity: Constant.

        11. -
          reverse_iterator rbegin() noexcept;
          +
          reverse_iterator rbegin() noexcept;

          Effects: Returns a reverse_iterator pointing to the beginning of the reversed stable_vector.

          Throws: Nothing.

          Complexity: Constant.

        12. -
          const_reverse_iterator rbegin() const noexcept;
          +
          const_reverse_iterator rbegin() const noexcept;

          Effects: Returns a const_reverse_iterator pointing to the beginning of the reversed stable_vector.

          Throws: Nothing.

          Complexity: Constant.

        13. -
          reverse_iterator rend() noexcept;
          +
          reverse_iterator rend() noexcept;

          Effects: Returns a reverse_iterator pointing to the end of the reversed stable_vector.

          Throws: Nothing.

          Complexity: Constant.

        14. -
          const_reverse_iterator rend() const noexcept;
          +
          const_reverse_iterator rend() const noexcept;

          Effects: Returns a const_reverse_iterator pointing to the end of the reversed stable_vector.

          Throws: Nothing.

          Complexity: Constant.

        15. -
          const_iterator cbegin() const noexcept;
          +
          const_iterator cbegin() const noexcept;

          Effects: Returns a const_iterator to the first element contained in the stable_vector.

          Throws: Nothing.

          Complexity: Constant.

        16. -
          const_iterator cend() const noexcept;
          +
          const_iterator cend() const noexcept;

          Effects: Returns a const_iterator to the end of the stable_vector.

          Throws: Nothing.

          Complexity: Constant.

        17. -
          const_reverse_iterator crbegin() const noexcept;
          +
          const_reverse_iterator crbegin() const noexcept;

          Effects: Returns a const_reverse_iterator pointing to the beginning of the reversed stable_vector.

          Throws: Nothing.

          Complexity: Constant.

        18. -
          const_reverse_iterator crend() const noexcept;
          +
          const_reverse_iterator crend() const noexcept;

          Effects: Returns a const_reverse_iterator pointing to the end of the reversed stable_vector.

          Throws: Nothing.

          Complexity: Constant.

        19. -
          bool empty() const noexcept;
          +
          bool empty() const noexcept;

          Effects: Returns true if the stable_vector contains no elements.

          Throws: Nothing.

          Complexity: Constant.

        20. -
          size_type size() const noexcept;
          +
          size_type size() const noexcept;

          Effects: Returns the number of the elements contained in the stable_vector.

          Throws: Nothing.

          Complexity: Constant.

        21. -
          size_type max_size() const noexcept;
          +
          size_type max_size() const noexcept;

          Effects: Returns the largest possible size of the stable_vector.

          Throws: Nothing.

          Complexity: Constant.

        22. -
          void resize(size_type n);
          +
          void resize(size_type n);

          Effects: Inserts or erases elements at the end such that the size becomes n. New elements are value initialized.

          Throws: If memory allocation throws, or T's value initialization throws.

          Complexity: Linear to the difference between size() and new_size.

        23. -
          void resize(size_type n, default_init_t);
          +
          void resize(size_type n, default_init_t);

          Effects: Inserts or erases elements at the end such that the size becomes n. New elements are default initialized.

          Throws: If memory allocation throws, or T's default initialization throws.

          Complexity: Linear to the difference between size() and new_size.

          Note: Non-standard extension

        24. -
          void resize(size_type n, const T & t);
          +
          void resize(size_type n, const T & t);

          Effects: Inserts or erases elements at the end such that the size becomes n. New elements are copy constructed from x.

          Throws: If memory allocation throws, or T's copy constructor throws.

          Complexity: Linear to the difference between size() and new_size.

        25. -
          size_type capacity() const noexcept;
          +
          size_type capacity() const noexcept;

          Effects: Number of elements for which memory has been allocated. capacity() is always greater than or equal to size().

          Throws: Nothing.

          Complexity: Constant.

        26. -
          void reserve(size_type n);
          +
          void reserve(size_type n);

          Effects: If n is less than or equal to capacity(), this call has no effect. Otherwise, it is a request for allocation of additional memory. If the request is successful, then capacity() is greater than or equal to n; otherwise, capacity() is unchanged. In either case, size() is unchanged.

          Throws: If memory allocation allocation throws.

        27. -
          void shrink_to_fit();
          +
          void shrink_to_fit();

          Effects: Tries to deallocate the excess of memory created with previous allocations. The size of the stable_vector is unchanged

          Throws: If memory allocation throws.

          Complexity: Linear to size().

        28. -
          reference front() noexcept;
          +
          reference front() noexcept;

          Requires: !empty()

          Effects: Returns a reference to the first element of the container.

          Throws: Nothing.

          Complexity: Constant.

        29. -
          const_reference front() const noexcept;
          +
          const_reference front() const noexcept;

          Requires: !empty()

          Effects: Returns a const reference to the first element of the container.

          Throws: Nothing.

          Complexity: Constant.

        30. -
          reference back() noexcept;
          +
          reference back() noexcept;

          Requires: !empty()

          Effects: Returns a reference to the last element of the container.

          Throws: Nothing.

          Complexity: Constant.

        31. -
          const_reference back() const noexcept;
          +
          const_reference back() const noexcept;

          Requires: !empty()

          Effects: Returns a const reference to the last element of the container.

          Throws: Nothing.

          Complexity: Constant.

        32. -
          reference operator[](size_type n) noexcept;
          +
          reference operator[](size_type n) noexcept;

          Requires: size() > n.

          Effects: Returns a reference to the nth element from the beginning of the container.

          Throws: Nothing.

          Complexity: Constant.

        33. -
          const_reference operator[](size_type n) const noexcept;
          +
          const_reference operator[](size_type n) const noexcept;

          Requires: size() > n.

          Effects: Returns a const reference to the nth element from the beginning of the container.

          Throws: Nothing.

          Complexity: Constant.

        34. -
          iterator nth(size_type n) noexcept;
          +
          iterator nth(size_type n) noexcept;

          Requires: size() >= n.

          Effects: Returns an iterator to the nth element from the beginning of the container. Returns end() if n == size().

          Throws: Nothing.

          @@ -499,7 +499,7 @@

          Note: Non-standard extension

        35. -
          const_iterator nth(size_type n) const noexcept;
          +
          const_iterator nth(size_type n) const noexcept;

          Requires: size() >= n.

          Effects: Returns a const_iterator to the nth element from the beginning of the container. Returns end() if n == size().

          Throws: Nothing.

          @@ -507,7 +507,7 @@

          Note: Non-standard extension

        36. -
          size_type index_of(iterator p) noexcept;
          +
          size_type index_of(iterator p) noexcept;

          Requires: begin() <= p <= end().

          Effects: Returns the index of the element pointed by p and size() if p == end().

          Throws: Nothing.

          @@ -515,7 +515,7 @@

          Note: Non-standard extension

        37. -
          size_type index_of(const_iterator p) const noexcept;
          +
          size_type index_of(const_iterator p) const noexcept;

          Requires: begin() <= p <= end().

          Effects: Returns the index of the element pointed by p and size() if p == end().

          Throws: Nothing.

          @@ -523,47 +523,47 @@

          Note: Non-standard extension

        38. -
          reference at(size_type n);
          +
          reference at(size_type n);

          Requires: size() > n.

          Effects: Returns a reference to the nth element from the beginning of the container.

          Throws: std::range_error if n >= size()

          Complexity: Constant.

        39. -
          const_reference at(size_type n) const;
          +
          const_reference at(size_type n) const;

          Requires: size() > n.

          Effects: Returns a const reference to the nth element from the beginning of the container.

          Throws: std::range_error if n >= size()

          Complexity: Constant.

        40. -
          template<class... Args> reference emplace_back(Args &&... args);
          +
          template<class... Args> reference emplace_back(Args &&... args);

          Effects: Inserts an object of type T constructed with std::forward<Args>(args)... in the end of the stable_vector.

          Returns: A reference to the created object.

          Throws: If memory allocation throws or the in-place constructor throws.

          Complexity: Amortized constant time.

        41. -
          template<class... Args> iterator emplace(const_iterator p, Args &&... args);
          +
          template<class... Args> iterator emplace(const_iterator p, Args &&... args);

          Requires: p must be a valid iterator of *this.

          Effects: Inserts an object of type T constructed with std::forward<Args>(args)... before p

          Throws: If memory allocation throws or the in-place constructor throws.

          Complexity: If p is end(), amortized constant time Linear time otherwise.

        42. -
          void push_back(const T & x);
          +
          void push_back(const T & x);

          Effects: Inserts a copy of x at the end of the stable_vector.

          Throws: If memory allocation throws or T's copy constructor throws.

          Complexity: Amortized constant time.

        43. -
          void push_back(T && x);
          +
          void push_back(T && x);

          Effects: Constructs a new element in the end of the stable_vector and moves the resources of x to this new element.

          Throws: If memory allocation throws.

          Complexity: Amortized constant time.

        44. -
          iterator insert(const_iterator p, const T & x);
          +
          iterator insert(const_iterator p, const T & x);

          Requires: p must be a valid iterator of *this.

          Effects: Insert a copy of x before p.

          Returns: An iterator to the inserted element.

          @@ -571,7 +571,7 @@

          Complexity: If p is end(), amortized constant time Linear time otherwise.

        45. -
          iterator insert(const_iterator p, T && x);
          +
          iterator insert(const_iterator p, T && x);

          Requires: p must be a valid iterator of *this.

          Effects: Insert a new element before p with x's resources.

          Returns: an iterator to the inserted element.

          @@ -579,7 +579,7 @@

          Complexity: If p is end(), amortized constant time Linear time otherwise.

        46. -
          iterator insert(const_iterator p, size_type n, const T & t);
          +
          iterator insert(const_iterator p, size_type n, const T & t);

          Requires: p must be a valid iterator of *this.

          Effects: Insert n copies of x before p.

          Returns: an iterator to the first inserted element or p if n is 0.

          @@ -587,7 +587,7 @@

          Complexity: Linear to n.

        47. -
          iterator insert(const_iterator p, std::initializer_list< value_type > il);
          +
          iterator insert(const_iterator p, std::initializer_list< value_type > il);
          Requires: p must be a valid iterator of *this.

          Requires: p must be a valid iterator of *this.

          Effects: Insert a copy of the [il.begin(), il.end()) range before p.

          Returns: an iterator to the first inserted element or p if first == last.

          @@ -595,7 +595,7 @@ 
        48. template<typename InputIterator> 
-  iterator insert(const_iterator p, InputIterator first, InputIterator last);
          + iterator insert(const_iterator p, InputIterator first, InputIterator last);

          Requires: pos must be a valid iterator of *this.

          Effects: Insert a copy of the [first, last) range before p.

          Returns: an iterator to the first inserted element or p if first == last.

          @@ -603,31 +603,31 @@

          Complexity: Linear to distance [first, last).

        49. -
          void pop_back() noexcept;
          +
          void pop_back() noexcept;

          Effects: Removes the last element from the stable_vector.

          Throws: Nothing.

          Complexity: Constant time.

        50. -
          iterator erase(const_iterator p) noexcept;
          +
          iterator erase(const_iterator p) noexcept;

          Effects: Erases the element at p.

          Throws: Nothing.

          Complexity: Linear to the elements between p and the last element. Constant if p is the last element.

        51. -
          iterator erase(const_iterator first, const_iterator last) noexcept;
          +
          iterator erase(const_iterator first, const_iterator last) noexcept;

          Effects: Erases the elements pointed by [first, last).

          Throws: Nothing.

          Complexity: Linear to the distance between first and last plus linear to the elements between p and the last element.

        52. -
          void swap(stable_vector & x) noexcept(allocator_traits_type::propagate_on_container_swap::value||allocator_traits_type::is_always_equal::value));
          +
          void swap(stable_vector & x) noexcept(allocator_traits_type::propagate_on_container_swap::value||allocator_traits_type::is_always_equal::value));

          Effects: Swaps the contents of *this and x.

          Throws: Nothing.

          Complexity: Constant.

        53. -
          void clear() noexcept;
          +
          void clear() noexcept;

          Effects: Erases all the elements of the stable_vector.

          Throws: Nothing.

          Complexity: Linear to the number of elements in the stable_vector.

          @@ -635,41 +635,41 @@
        -

        -stable_vector friend functions

        +

        +stable_vector friend functions

        1. -
          friend bool operator==(const stable_vector & x, const stable_vector & y);
          +
          friend bool operator==(const stable_vector & x, const stable_vector & y);

          Effects: Returns true if x and y are equal

          Complexity: Linear to the number of elements in the container.

        2. -
          friend bool operator!=(const stable_vector & x, const stable_vector & y);
          +
          friend bool operator!=(const stable_vector & x, const stable_vector & y);

          Effects: Returns true if x and y are unequal

          Complexity: Linear to the number of elements in the container.

        3. -
          friend bool operator<(const stable_vector & x, const stable_vector & y);
          +
          friend bool operator<(const stable_vector & x, const stable_vector & y);

          Effects: Returns true if x is less than y

          Complexity: Linear to the number of elements in the container.

        4. -
          friend bool operator>(const stable_vector & x, const stable_vector & y);
          +
          friend bool operator>(const stable_vector & x, const stable_vector & y);

          Effects: Returns true if x is greater than y

          Complexity: Linear to the number of elements in the container.

        5. -
          friend bool operator<=(const stable_vector & x, const stable_vector & y);
          +
          friend bool operator<=(const stable_vector & x, const stable_vector & y);

          Effects: Returns true if x is equal or less than y

          Complexity: Linear to the number of elements in the container.

        6. -
          friend bool operator>=(const stable_vector & x, const stable_vector & y);
          +
          friend bool operator>=(const stable_vector & x, const stable_vector & y);

          Effects: Returns true if x is equal or greater than y

          Complexity: Linear to the number of elements in the container.

        7. -
          friend void swap(stable_vector & x, stable_vector & y);
          +
          friend void swap(stable_vector & x, stable_vector & y);

          Effects: x.swap(y)

          Complexity: Constant.

          8. @@ -679,7 +679,8 @@
        - -
        Copyright © 2009-2015 Ion Gaztanaga

        +

        Copyright © 2009-2017 Ion + Gaztanaga

        Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

        diff --git a/doc/html/boost/container/static_vector.html b/doc/html/boost/container/static_vector.html index dfb334d5fb..0288fe77ff 100644 --- a/doc/html/boost/container/static_vector.html +++ b/doc/html/boost/container/static_vector.html @@ -8,7 +8,7 @@ - + @@ -21,7 +21,7 @@
        -PrevUpHomeNext +PrevUpHomeNext
        @@ -33,7 +33,8 @@ 
        // In header: <boost/container/static_vector.hpp>
 
 template<typename Value, std::size_t Capacity> 
-class static_vector {
+class static_vector : public boost::container::vector< Value, dtl::static_storage_allocator< Value, Capacity > >
+{
 public:
   // types
   typedef base_t::value_type             value_type;              // The type of elements stored in the container. 
@@ -49,91 +50,91 @@
   typedef base_t::const_reverse_iterator const_reverse_iterator;  // The const reverse iterator. 
 
   // construct/copy/destruct
-  static_vector() noexcept;
-  explicit static_vector(size_type);
-  static_vector(size_type, default_init_t);
-  static_vector(size_type, value_type const &);
-  template<typename Iterator> static_vector(Iterator, Iterator);
-  static_vector(std::initializer_list< value_type >);
-  static_vector(static_vector const &);
-  static_vector(static_vector const &, const allocator_type &);
-  static_vector(static_vector &&, const allocator_type &) noexcept(boost::container::container_detail::is_nothrow_move_constructible< value_type >::value));
-  explicit static_vector(const allocator_type &);
+  static_vector() noexcept;
+  explicit static_vector(size_type);
+  static_vector(size_type, default_init_t);
+  static_vector(size_type, value_type const &);
+  template<typename Iterator> static_vector(Iterator, Iterator);
+  static_vector(std::initializer_list< value_type >);
+  static_vector(static_vector const &);
+  static_vector(static_vector const &, const allocator_type &);
+  static_vector(static_vector &&, const allocator_type &) noexcept(boost::container::dtl::is_nothrow_move_constructible< value_type >::value));
+  explicit static_vector(const allocator_type &);
   template<std::size_t C> 
-    static_vector(static_vector< value_type, C > const &);
-  static_vector(static_vector &&) noexcept(boost::container::container_detail::is_nothrow_move_constructible< value_type >::value));
-  template<std::size_t C> static_vector(static_vector< value_type, C > &&);
-  static_vector & operator=(const static_vector &);
-  static_vector & operator=(std::initializer_list< value_type >);
+    static_vector(static_vector< value_type, C > const &);
+  static_vector(static_vector &&) noexcept(boost::container::dtl::is_nothrow_move_constructible< value_type >::value));
+  template<std::size_t C> static_vector(static_vector< value_type, C > &&);
+  static_vector & operator=(const static_vector &);
+  static_vector & operator=(std::initializer_list< value_type >);
   template<std::size_t C> 
-    static_vector & operator=(static_vector< value_type, C > const &);
-  static_vector & operator=(static_vector &&);
+    static_vector & operator=(static_vector< value_type, C > const &);
+  static_vector & operator=(static_vector &&);
   template<std::size_t C> 
-    static_vector & operator=(static_vector< value_type, C > &&);
-  ~static_vector();
+    static_vector & operator=(static_vector< value_type, C > &&);
+  ~static_vector();
 
-  // public member functions
-  void swap(static_vector &);
-  template<std::size_t C> void swap(static_vector< value_type, C > &);
-  void resize(size_type);
-  void resize(size_type, default_init_t);
-  void resize(size_type, value_type const &);
-  void reserve(size_type) noexcept;
-  void push_back(value_type const &);
-  void push_back(value_type &&);
-  void pop_back();
-  iterator insert(const_iterator, value_type const &);
-  iterator insert(const_iterator, value_type &&);
-  iterator insert(const_iterator, size_type, value_type const &);
+  // public member functions
+  void swap(static_vector &);
+  template<std::size_t C> void swap(static_vector< value_type, C > &);
+  void resize(size_type);
+  void resize(size_type, default_init_t);
+  void resize(size_type, value_type const &);
+  void reserve(size_type) noexcept;
+  void push_back(value_type const &);
+  void push_back(value_type &&);
+  void pop_back();
+  iterator insert(const_iterator, value_type const &);
+  iterator insert(const_iterator, value_type &&);
+  iterator insert(const_iterator, size_type, value_type const &);
   template<typename Iterator> 
-    iterator insert(const_iterator, Iterator, Iterator);
-  iterator insert(const_iterator, std::initializer_list< value_type >);
-  iterator erase(const_iterator);
-  iterator erase(const_iterator, const_iterator);
-  template<typename Iterator> void assign(Iterator, Iterator);
-  void assign(std::initializer_list< value_type >);
-  void assign(size_type, value_type const &);
-  template<class... Args> reference emplace_back(Args &&...);
-  template<class... Args> iterator emplace(const_iterator, Args &&...);
-  void clear() noexcept;
-  reference at(size_type);
-  const_reference at(size_type) const;
-  reference operator[](size_type);
-  const_reference operator[](size_type) const;
-  iterator nth(size_type);
-  const_iterator nth(size_type) const;
-  size_type index_of(iterator);
-  size_type index_of(const_iterator) const;
-  reference front();
-  const_reference front() const;
-  reference back();
-  const_reference back() const;
-  Value * data() noexcept;
-  const Value * data() const noexcept;
-  iterator begin() noexcept;
-  const_iterator begin() const noexcept;
-  const_iterator cbegin() const noexcept;
-  iterator end() noexcept;
-  const_iterator end() const noexcept;
-  const_iterator cend() const noexcept;
-  reverse_iterator rbegin() noexcept;
-  const_reverse_iterator rbegin() const noexcept;
-  const_reverse_iterator crbegin() const noexcept;
-  reverse_iterator rend() noexcept;
-  const_reverse_iterator rend() const noexcept;
-  const_reverse_iterator crend() const noexcept;
-  size_type size() const noexcept;
-  bool empty() const noexcept;
+    iterator insert(const_iterator, Iterator, Iterator);
+  iterator insert(const_iterator, std::initializer_list< value_type >);
+  iterator erase(const_iterator);
+  iterator erase(const_iterator, const_iterator);
+  template<typename Iterator> void assign(Iterator, Iterator);
+  void assign(std::initializer_list< value_type >);
+  void assign(size_type, value_type const &);
+  template<class... Args> reference emplace_back(Args &&...);
+  template<class... Args> iterator emplace(const_iterator, Args &&...);
+  void clear() noexcept;
+  reference at(size_type);
+  const_reference at(size_type) const;
+  reference operator[](size_type);
+  const_reference operator[](size_type) const;
+  iterator nth(size_type);
+  const_iterator nth(size_type) const;
+  size_type index_of(iterator);
+  size_type index_of(const_iterator) const;
+  reference front();
+  const_reference front() const;
+  reference back();
+  const_reference back() const;
+  Value * data() noexcept;
+  const Value * data() const noexcept;
+  iterator begin() noexcept;
+  const_iterator begin() const noexcept;
+  const_iterator cbegin() const noexcept;
+  iterator end() noexcept;
+  const_iterator end() const noexcept;
+  const_iterator cend() const noexcept;
+  reverse_iterator rbegin() noexcept;
+  const_reverse_iterator rbegin() const noexcept;
+  const_reverse_iterator crbegin() const noexcept;
+  reverse_iterator rend() noexcept;
+  const_reverse_iterator rend() const noexcept;
+  const_reverse_iterator crend() const noexcept;
+  size_type size() const noexcept;
+  bool empty() const noexcept;
 
-  // public static functions
-  static size_type capacity() noexcept;
-  static size_type max_size() noexcept;
+  // public static functions
+  static size_type capacity() noexcept;
+  static size_type max_size() noexcept;
 
   // public data members
   static const size_type static_capacity;  // The capacity/max size of the container. 
 };
        -

        Description

        +

        Description

        static_vector is a sequence container like boost::container::vector with contiguous storage that can change in size, along with the static allocation, low overhead, and fixed capacity of boost::array.

        A static_vector is a sequence that supports random access to elements, constant time insertion and removal of elements at the end, and linear time insertion and removal of elements at the beginning or in the middle. The number of elements in a static_vector may vary dynamically up to a fixed capacity because elements are stored within the object itself similarly to an array. However, objects are initialized as they are inserted into static_vector unlike C arrays or std::array which must construct all elements on instantiation. The behavior of static_vector enables the use of statically allocated elements in cases with complex object lifetime requirements that would otherwise not be trivially possible.

        Error Handling. Insertion beyond the capacity result in throwing std::bad_alloc() if exceptions are enabled or calling throw_bad_alloc() if not enabled.

        @@ -142,7 +143,7 @@ std::out_of_range is thrown if out of bound access is performed in -

        Template Parameters

        +

        Template Parameters

        1. typename Value
          @@ -155,13 +156,13 @@ std::out_of_range is thrown if out of bound access is performed in -

          +

          static_vector public construct/copy/destruct

          1. -
            static_vector() noexcept;
            Constructs an empty static_vector.

            Throws. Nothing.

            +
            static_vector() noexcept;
            Constructs an empty static_vector.

            Throws. Nothing.

            Complexity. Constant O(1).

            @@ -169,7 +170,7 @@ std::out_of_range is thrown if out of bound access is performed in -
            explicit static_vector(size_type count);
            Constructs a static_vector containing count value initialized values.

            +

            explicit static_vector(size_type count);
            Constructs a static_vector containing count value initialized values.

            Throws. If Value's value initialization throws.

            @@ -205,7 +206,7 @@ std::out_of_range is thrown if out of bound access is performed in -
            static_vector(size_type count, default_init_t);
            Constructs a static_vector containing count default initialized values.

            +

            static_vector(size_type count, default_init_t);
            Constructs a static_vector containing count default initialized values.

            Throws. If Value's default initialization throws.

            @@ -244,7 +245,7 @@ std::out_of_range is thrown if out of bound access is performed in -
            static_vector(size_type count, value_type const & value);
            Constructs a static_vector containing count copies of value.

            +

            static_vector(size_type count, value_type const & value);
            Constructs a static_vector containing count copies of value.

            Throws. If Value's copy constructor throws.

            @@ -286,7 +287,7 @@ std::out_of_range is thrown if out of bound access is performed in -
            template<typename Iterator> static_vector(Iterator first, Iterator last);
            Constructs a static_vector containing copy of a range [first, last).

            +

            template<typename Iterator> static_vector(Iterator first, Iterator last);
            Constructs a static_vector containing copy of a range [first, last).

            Throws. If Value's constructor taking a dereferenced Iterator throws.

            @@ -335,7 +336,7 @@ std::out_of_range is thrown if out of bound access is performed in -
            static_vector(std::initializer_list< value_type > il);
            Constructs a static_vector containing copy of a range [il.begin(), il.end()).

            +

            static_vector(std::initializer_list< value_type > il);
            Constructs a static_vector containing copy of a range [il.begin(), il.end()).

            Throws. If Value's constructor taking a dereferenced std::initializer_list throws.

            @@ -375,7 +376,7 @@ std::out_of_range is thrown if out of bound access is performed in -
            static_vector(static_vector const & other);
            Constructs a copy of other static_vector.

            +

            static_vector(static_vector const & other);
            Constructs a copy of other static_vector.

            Throws. If Value's copy constructor throws.

            @@ -403,12 +404,12 @@ std::out_of_range is thrown if out of bound access is performed in 

            static_vector(static_vector const & other, const allocator_type &);
            2. -
          2. static_vector(static_vector && other, const allocator_type &) noexcept(boost::container::container_detail::is_nothrow_move_constructible< value_type >::value));
            3. -
          3. explicit static_vector(const allocator_type &);
            4. +
          4. static_vector(static_vector const & other, const allocator_type &);
            5. +
          5. static_vector(static_vector && other, const allocator_type &) noexcept(boost::container::dtl::is_nothrow_move_constructible< value_type >::value));
            6. +
          6. explicit static_vector(const allocator_type &);
          7. template<std::size_t C> 
-  static_vector(static_vector< value_type, C > const & other);
            Constructs a copy of other static_vector.

            + static_vector(static_vector< value_type, C > const & other);Constructs a copy of other static_vector.

            Throws. If Value's copy constructor throws.

            @@ -444,7 +445,7 @@ std::out_of_range is thrown if out of bound access is performed in -
            static_vector(static_vector && other) noexcept(boost::container::container_detail::is_nothrow_move_constructible< value_type >::value));
            Move constructor. Moves Values stored in the other static_vector to this one.

            +

            static_vector(static_vector && other) noexcept(boost::container::dtl::is_nothrow_move_constructible< value_type >::value));
            Move constructor. Moves Values stored in the other static_vector to this one.

            Throws. 

              @@ -479,7 +480,7 @@ std::out_of_range is thrown if out of bound access is performed in -
              template<std::size_t C> static_vector(static_vector< value_type, C > && other);
              Move constructor. Moves Values stored in the other static_vector to this one.

              +

              template<std::size_t C> static_vector(static_vector< value_type, C > && other);
              Move constructor. Moves Values stored in the other static_vector to this one.

              Throws. 

              @@ -521,7 +522,7 @@ std::out_of_range is thrown if out of bound access is performed in -
              static_vector & operator=(const static_vector & other);
              Copy assigns Values stored in the other static_vector to this one.

              +

              static_vector & operator=(const static_vector & other);
              Copy assigns Values stored in the other static_vector to this one.

              Throws. If Value's copy constructor or copy assignment throws.

              @@ -550,7 +551,7 @@ std::out_of_range is thrown if out of bound access is performed in -

              static_vector & operator=(std::initializer_list< value_type > il);
              Copy assigns Values stored in std::initializer_list to *this.

              +

              static_vector & operator=(std::initializer_list< value_type > il);
              Copy assigns Values stored in std::initializer_list to *this.

              Throws. If Value's copy constructor or copy assignment throws.

              @@ -580,7 +581,7 @@ std::out_of_range is thrown if out of bound access is performed in 

              template<std::size_t C> 
-  static_vector & operator=(static_vector< value_type, C > const & other);
              Copy assigns Values stored in the other static_vector to this one.

              + static_vector & operator=(static_vector< value_type, C > const & other);Copy assigns Values stored in the other static_vector to this one.

              Throws. If Value's copy constructor or copy assignment throws.

              @@ -616,7 +617,7 @@ std::out_of_range is thrown if out of bound access is performed in -
              static_vector & operator=(static_vector && other);
              Move assignment. Moves Values stored in the other static_vector to this one.

              +

              static_vector & operator=(static_vector && other);
              Move assignment. Moves Values stored in the other static_vector to this one.

              Throws. 

                @@ -652,7 +653,7 @@ std::out_of_range is thrown if out of bound access is performed in 
                template<std::size_t C> 
-  static_vector & operator=(static_vector< value_type, C > && other);
                Move assignment. Moves Values stored in the other static_vector to this one.

                + static_vector & operator=(static_vector< value_type, C > && other);Move assignment. Moves Values stored in the other static_vector to this one.

                Throws. 

                @@ -694,7 +695,7 @@ std::out_of_range is thrown if out of bound access is performed in -
                ~static_vector();
                Destructor. Destroys Values stored in this container.

                Throws. Nothing

                +
                ~static_vector();
                Destructor. Destroys Values stored in this container.

                Throws. Nothing

                Complexity. Linear O(N).

                @@ -704,11 +705,11 @@ std::out_of_range is thrown if out of bound access is performed in -

                -static_vector public member functions

                +

                +static_vector public member functions

                1. -
                  void swap(static_vector & other);
                  Swaps contents of the other static_vector and this one.

                  +

                  void swap(static_vector & other);
                  Swaps contents of the other static_vector and this one.

                  Throws. 

                    @@ -743,7 +744,7 @@ std::out_of_range is thrown if out of bound access is performed in -
                    template<std::size_t C> void swap(static_vector< value_type, C > & other);
                    Swaps contents of the other static_vector and this one.

                    +

                    template<std::size_t C> void swap(static_vector< value_type, C > & other);
                    Swaps contents of the other static_vector and this one.

                    Throws. 

                    @@ -785,7 +786,7 @@ std::out_of_range is thrown if out of bound access is performed in -
                    void resize(size_type count);
                    Inserts or erases elements at the end such that the size becomes count. New elements are value initialized.

                    +

                    void resize(size_type count);
                    Inserts or erases elements at the end such that the size becomes count. New elements are value initialized.

                    Throws. If Value's value initialization throws.

                    @@ -821,7 +822,7 @@ std::out_of_range is thrown if out of bound access is performed in -
                    void resize(size_type count, default_init_t);
                    Inserts or erases elements at the end such that the size becomes count. New elements are default initialized.

                    +

                    void resize(size_type count, default_init_t);
                    Inserts or erases elements at the end such that the size becomes count. New elements are default initialized.

                    Throws. If Value's default initialization throws.

                    @@ -860,7 +861,7 @@ std::out_of_range is thrown if out of bound access is performed in -
                    void resize(size_type count, value_type const & value);
                    Inserts or erases elements at the end such that the size becomes count. New elements are copy constructed from value.

                    +

                    void resize(size_type count, value_type const & value);
                    Inserts or erases elements at the end such that the size becomes count. New elements are copy constructed from value.

                    Throws. If Value's copy constructor throws.

                    @@ -902,7 +903,7 @@ std::out_of_range is thrown if out of bound access is performed in -
                    void reserve(size_type count) noexcept;
                    This call has no effect because the Capacity of this container is constant.

                    +

                    void reserve(size_type count) noexcept;
                    This call has no effect because the Capacity of this container is constant.

                    Throws. Nothing.

                    @@ -938,7 +939,7 @@ std::out_of_range is thrown if out of bound access is performed in -
                    void push_back(value_type const & value);
                    Adds a copy of value at the end.

                    +

                    void push_back(value_type const & value);
                    Adds a copy of value at the end.

                    Throws. If Value's copy constructor throws.

                    @@ -974,7 +975,7 @@ std::out_of_range is thrown if out of bound access is performed in -
                    void push_back(value_type && value);
                    Moves value to the end.

                    +

                    void push_back(value_type && value);
                    Moves value to the end.

                    Throws. If Value's move constructor throws.

                    @@ -1010,7 +1011,7 @@ std::out_of_range is thrown if out of bound access is performed in -
                    void pop_back();
                    Destroys last value and decreases the size.

                    +

                    void pop_back();
                    Destroys last value and decreases the size.

                    Throws. Nothing by default.

                    @@ -1030,7 +1031,7 @@ std::out_of_range is thrown if out of bound access is performed in -

                    iterator insert(const_iterator p, value_type const & value);
                    Inserts a copy of element at p.

                    +

                    iterator insert(const_iterator p, value_type const & value);
                    Inserts a copy of element at p.

                    Throws. 

                    @@ -1085,7 +1086,7 @@ std::out_of_range is thrown if out of bound access is performed in -
                    iterator insert(const_iterator p, value_type && value);
                    Inserts a move-constructed element at p.

                    +

                    iterator insert(const_iterator p, value_type && value);
                    Inserts a move-constructed element at p.

                    Throws. If Value's move constructor or move assignment throws.

                    @@ -1134,7 +1135,7 @@ std::out_of_range is thrown if out of bound access is performed in -
                    iterator insert(const_iterator p, size_type count, value_type const & value);
                    Inserts a count copies of value at p.

                    +

                    iterator insert(const_iterator p, size_type count, value_type const & value);
                    Inserts a count copies of value at p.

                    Throws. 

                    @@ -1194,7 +1195,7 @@ std::out_of_range is thrown if out of bound access is performed in 
                    template<typename Iterator> 
-  iterator insert(const_iterator p, Iterator first, Iterator last);
                    Inserts a copy of a range [first, last) at p.

                    + iterator insert(const_iterator p, Iterator first, Iterator last);Inserts a copy of a range [first, last) at p.

                    Throws. 

                    @@ -1254,7 +1255,7 @@ std::out_of_range is thrown if out of bound access is performed in -
                    iterator insert(const_iterator p, std::initializer_list< value_type > il);
                    Inserts a copy of a range [il.begin(), il.end()) at p.

                    +

                    iterator insert(const_iterator p, std::initializer_list< value_type > il);
                    Inserts a copy of a range [il.begin(), il.end()) at p.

                    Throws. 

                    @@ -1306,7 +1307,7 @@ std::out_of_range is thrown if out of bound access is performed in -
                    iterator erase(const_iterator p);
                    Erases Value from p.

                    +

                    iterator erase(const_iterator p);
                    Erases Value from p.

                    Throws. If Value's move assignment throws.

                    @@ -1342,7 +1343,7 @@ std::out_of_range is thrown if out of bound access is performed in -
                    iterator erase(const_iterator first, const_iterator last);
                    Erases Values from a range [first, last).

                    +

                    iterator erase(const_iterator first, const_iterator last);
                    Erases Values from a range [first, last).

                    Throws. If Value's move assignment throws.

                    @@ -1391,7 +1392,7 @@ std::out_of_range is thrown if out of bound access is performed in -
                    template<typename Iterator> void assign(Iterator first, Iterator last);
                    Assigns a range [first, last) of Values to this container.

                    +

                    template<typename Iterator> void assign(Iterator first, Iterator last);
                    Assigns a range [first, last) of Values to this container.

                    Throws. If Value's copy constructor or copy assignment throws,

                    @@ -1433,7 +1434,7 @@ std::out_of_range is thrown if out of bound access is performed in -
                    void assign(std::initializer_list< value_type > il);
                    Assigns a range [il.begin(), il.end()) of Values to this container.

                    +

                    void assign(std::initializer_list< value_type > il);
                    Assigns a range [il.begin(), il.end()) of Values to this container.

                    Throws. If Value's copy constructor or copy assignment throws,

                    @@ -1469,7 +1470,7 @@ std::out_of_range is thrown if out of bound access is performed in -
                    void assign(size_type count, value_type const & value);
                    Assigns a count copies of value to this container.

                    +

                    void assign(size_type count, value_type const & value);
                    Assigns a count copies of value to this container.

                    Throws. If Value's copy constructor or copy assignment throws.

                    @@ -1511,7 +1512,7 @@ std::out_of_range is thrown if out of bound access is performed in -
                    template<class... Args> reference emplace_back(Args &&... args);
                    Inserts a Value constructed with std::forward<Args>(args)... in the end of the container.

                    +

                    template<class... Args> reference emplace_back(Args &&... args);
                    Inserts a Value constructed with std::forward<Args>(args)... in the end of the container.

                    @@ -1552,7 +1553,7 @@ std::out_of_range is thrown if out of bound access is performed in -
                    template<class... Args> iterator emplace(const_iterator p, Args &&... args);
                    Inserts a Value constructed with std::forward<Args>(args)... before p.

                    +

                    template<class... Args> iterator emplace(const_iterator p, Args &&... args);
                    Inserts a Value constructed with std::forward<Args>(args)... before p.

                    Throws. If in-place constructor throws or if Value's move constructor or move assignment throws.

                    @@ -1601,7 +1602,7 @@ std::out_of_range is thrown if out of bound access is performed in -
                    void clear() noexcept;
                    Removes all elements from the container.

                    Throws. Nothing.

                    +
                    void clear() noexcept;
                    Removes all elements from the container.

                    Throws. Nothing.

                    Complexity. Constant O(1).

                    @@ -1609,7 +1610,7 @@ std::out_of_range is thrown if out of bound access is performed in -
                    reference at(size_type i);
                    Returns reference to the i-th element.

                    +

                    reference at(size_type i);
                    Returns reference to the i-th element.

                    @@ -1650,7 +1651,7 @@ std::out_of_range is thrown if out of bound access is performed in -
                    const_reference at(size_type i) const;
                    Returns const reference to the i-th element.

                    +

                    const_reference at(size_type i) const;
                    Returns const reference to the i-th element.

                    @@ -1691,7 +1692,7 @@ std::out_of_range is thrown if out of bound access is performed in -
                    reference operator[](size_type i);
                    Returns reference to the i-th element.

                    +

                    reference operator[](size_type i);
                    Returns reference to the i-th element.

                    @@ -1732,7 +1733,7 @@ std::out_of_range is thrown if out of bound access is performed in -
                    const_reference operator[](size_type i) const;
                    Returns const reference to the i-th element.

                    +

                    const_reference operator[](size_type i) const;
                    Returns const reference to the i-th element.

                    @@ -1773,7 +1774,7 @@ std::out_of_range is thrown if out of bound access is performed in -
                    iterator nth(size_type i);
                    Returns a iterator to the i-th element.

                    +

                    iterator nth(size_type i);
                    Returns a iterator to the i-th element.

                    @@ -1814,7 +1815,7 @@ std::out_of_range is thrown if out of bound access is performed in -
                    const_iterator nth(size_type i) const;
                    Returns a const_iterator to the i-th element.

                    +

                    const_iterator nth(size_type i) const;
                    Returns a const_iterator to the i-th element.

                    @@ -1855,7 +1856,7 @@ std::out_of_range is thrown if out of bound access is performed in -
                    size_type index_of(iterator p);
                    Returns the index of the element pointed by p.

                    +

                    size_type index_of(iterator p);
                    Returns the index of the element pointed by p.

                    @@ -1896,7 +1897,7 @@ std::out_of_range is thrown if out of bound access is performed in -
                    size_type index_of(const_iterator p) const;
                    Returns the index of the element pointed by p.

                    +

                    size_type index_of(const_iterator p) const;
                    Returns the index of the element pointed by p.

                    @@ -1937,7 +1938,7 @@ std::out_of_range is thrown if out of bound access is performed in -
                    reference front();
                    Returns reference to the first element.

                    +

                    reference front();
                    Returns reference to the first element.

                    Throws. Nothing by default.

                    @@ -1964,7 +1965,7 @@ std::out_of_range is thrown if out of bound access is performed in -
                    const_reference front() const;
                    Returns const reference to the first element.

                    +

                    const_reference front() const;
                    Returns const reference to the first element.

                    Throws. Nothing by default.

                    @@ -1991,7 +1992,7 @@ std::out_of_range is thrown if out of bound access is performed in -
                    reference back();
                    Returns reference to the last element.

                    +

                    reference back();
                    Returns reference to the last element.

                    Throws. Nothing by default.

                    @@ -2018,7 +2019,7 @@ std::out_of_range is thrown if out of bound access is performed in -
                    const_reference back() const;
                    Returns const reference to the first element.

                    +

                    const_reference back() const;
                    Returns const reference to the first element.

                    Throws. Nothing by default.

                    @@ -2045,7 +2046,7 @@ std::out_of_range is thrown if out of bound access is performed in -
                    Value * data() noexcept;
                    Pointer such that [data(), data() + size()) is a valid range. For a non-empty vector data() == &front().

                    Throws. Nothing.

                    +
                    Value * data() noexcept;
                    Pointer such that [data(), data() + size()) is a valid range. For a non-empty vector data() == &front().

                    Throws. Nothing.

                    Complexity. Constant O(1).

                    @@ -2053,7 +2054,7 @@ std::out_of_range is thrown if out of bound access is performed in -
                    const Value * data() const noexcept;
                    Const pointer such that [data(), data() + size()) is a valid range. For a non-empty vector data() == &front().

                    Throws. Nothing.

                    +
                    const Value * data() const noexcept;
                    Const pointer such that [data(), data() + size()) is a valid range. For a non-empty vector data() == &front().

                    Throws. Nothing.

                    Complexity. Constant O(1).

                    @@ -2061,7 +2062,7 @@ std::out_of_range is thrown if out of bound access is performed in -
                    iterator begin() noexcept;
                    Returns iterator to the first element.

                    +

                    iterator begin() noexcept;
                    Returns iterator to the first element.

                    Throws. Nothing.

                    @@ -2081,7 +2082,7 @@ std::out_of_range is thrown if out of bound access is performed in -

                    const_iterator begin() const noexcept;
                    Returns const iterator to the first element.

                    +

                    const_iterator begin() const noexcept;
                    Returns const iterator to the first element.

                    Throws. Nothing.

                    @@ -2101,7 +2102,7 @@ std::out_of_range is thrown if out of bound access is performed in -

                    const_iterator cbegin() const noexcept;
                    Returns const iterator to the first element.

                    +

                    const_iterator cbegin() const noexcept;
                    Returns const iterator to the first element.

                    Throws. Nothing.

                    @@ -2121,7 +2122,7 @@ std::out_of_range is thrown if out of bound access is performed in -

                    iterator end() noexcept;
                    Returns iterator to the one after the last element.

                    +

                    iterator end() noexcept;
                    Returns iterator to the one after the last element.

                    Throws. Nothing.

                    @@ -2141,7 +2142,7 @@ std::out_of_range is thrown if out of bound access is performed in -

                    const_iterator end() const noexcept;
                    Returns const iterator to the one after the last element.

                    +

                    const_iterator end() const noexcept;
                    Returns const iterator to the one after the last element.

                    Throws. Nothing.

                    @@ -2161,7 +2162,7 @@ std::out_of_range is thrown if out of bound access is performed in -

                    const_iterator cend() const noexcept;
                    Returns const iterator to the one after the last element.

                    +

                    const_iterator cend() const noexcept;
                    Returns const iterator to the one after the last element.

                    Throws. Nothing.

                    @@ -2181,7 +2182,7 @@ std::out_of_range is thrown if out of bound access is performed in -

                    reverse_iterator rbegin() noexcept;
                    Returns reverse iterator to the first element of the reversed container.

                    +

                    reverse_iterator rbegin() noexcept;
                    Returns reverse iterator to the first element of the reversed container.

                    Throws. Nothing.

                    @@ -2201,7 +2202,7 @@ std::out_of_range is thrown if out of bound access is performed in -

                    const_reverse_iterator rbegin() const noexcept;
                    Returns const reverse iterator to the first element of the reversed container.

                    +

                    const_reverse_iterator rbegin() const noexcept;
                    Returns const reverse iterator to the first element of the reversed container.

                    Throws. Nothing.

                    @@ -2221,7 +2222,7 @@ std::out_of_range is thrown if out of bound access is performed in -

                    const_reverse_iterator crbegin() const noexcept;
                    Returns const reverse iterator to the first element of the reversed container.

                    +

                    const_reverse_iterator crbegin() const noexcept;
                    Returns const reverse iterator to the first element of the reversed container.

                    Throws. Nothing.

                    @@ -2241,7 +2242,7 @@ std::out_of_range is thrown if out of bound access is performed in -

                    reverse_iterator rend() noexcept;
                    Returns reverse iterator to the one after the last element of the reversed container.

                    +

                    reverse_iterator rend() noexcept;
                    Returns reverse iterator to the one after the last element of the reversed container.

                    Throws. Nothing.

                    @@ -2261,7 +2262,7 @@ std::out_of_range is thrown if out of bound access is performed in -

                    const_reverse_iterator rend() const noexcept;
                    Returns const reverse iterator to the one after the last element of the reversed container.

                    +

                    const_reverse_iterator rend() const noexcept;
                    Returns const reverse iterator to the one after the last element of the reversed container.

                    Throws. Nothing.

                    @@ -2281,7 +2282,7 @@ std::out_of_range is thrown if out of bound access is performed in -

                    const_reverse_iterator crend() const noexcept;
                    Returns const reverse iterator to the one after the last element of the reversed container.

                    +

                    const_reverse_iterator crend() const noexcept;
                    Returns const reverse iterator to the one after the last element of the reversed container.

                    Throws. Nothing.

                    @@ -2301,7 +2302,7 @@ std::out_of_range is thrown if out of bound access is performed in -

                    size_type size() const noexcept;
                    Returns the number of stored elements.

                    +

                    size_type size() const noexcept;
                    Returns the number of stored elements.

                    Throws. Nothing.

                    @@ -2321,7 +2322,7 @@ std::out_of_range is thrown if out of bound access is performed in -

                    bool empty() const noexcept;
                    Queries if the container contains elements.

                    +

                    bool empty() const noexcept;
                    Queries if the container contains elements.

                    Throws. Nothing.

                    @@ -2343,11 +2344,11 @@ std::out_of_range is thrown if out of bound access is performed in -

                    -static_vector public static functions

                    +

                    +static_vector public static functions

                    1. -
                      static size_type capacity() noexcept;
                      Returns container's capacity.

                      +

                      static size_type capacity() noexcept;
                      Returns container's capacity.

                      Throws. Nothing.

                      @@ -2367,7 +2368,7 @@ std::out_of_range is thrown if out of bound access is performed in -

                      static size_type max_size() noexcept;
                      Returns container's capacity.

                      +

                      static size_type max_size() noexcept;
                      Returns container's capacity.

                      Throws. Nothing.

                      @@ -2392,7 +2393,8 @@ std::out_of_range is thrown if out of bound access is performed in

        Copyright © 2009-2015 Ion Gaztanaga

        +

        Copyright © 2009-2017 Ion + Gaztanaga

        Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

        @@ -2400,7 +2402,7 @@ std::out_of_range is thrown if out of bound access is performed in -PrevUpHomeNext +PrevUpHomeNext
        diff --git a/doc/html/boost/container/stored_size.html b/doc/html/boost/container/stored_size.html new file mode 100644 index 0000000000..12f9570779 --- /dev/null +++ b/doc/html/boost/container/stored_size.html @@ -0,0 +1,69 @@ + + + + +Struct template stored_size + + + + + + + + + + + + + + + +
        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
        +
        +
        +PrevUpHomeNext +
        +
        +
        +
        +

        Struct template stored_size

        +

        boost::container::stored_size

        +
        +

        Synopsis

        +
        // In header: <boost/container/options.hpp>
+
+template<typename StoredSizeType> 
+struct stored_size {
+};
        +
        +

        Description

        +

        This option specifies the unsigned integer type that a user wants the container to use to hold size-related information inside a container (e.g. current size, current capacity).

        +

        +If the maximum capacity() to be used is limited, a user can try to use 8-bit, 16-bit (e.g. in 32-bit machines), or 32-bit size types (e.g. in a 64 bit machine) to see if some memory can be saved for empty vectors. This could potentially performance benefits due to better cache usage.

        +

        Note that alignment requirements can disallow theoritical space savings. Example: vector holds a pointer and two size types (for size and capacity), in a 32 bit machine a 8 bit size type (total size: 4 byte pointer + 2 x 1 byte sizes = 6 bytes) will not save space when comparing two 16-bit size types because usually a 32 bit alignment is required for vector and the size will be rounded to 8 bytes. In a 64-bit machine a 16 bit size type does not usually save memory when comparing to a 32-bit size type. Measure the size of the resulting container and do not assume a smaller stored_size will always lead to a smaller sizeof(container).

        +

        If a user tries to insert more elements than representable by stored_size, vector will throw a length_error.

        +

        If this option is not specified, allocator_traits<A>::size_type (usually std::size_t) will be used to store size-related information inside the container.

        +
        +

        Template Parameters

        +
        1. +
          typename StoredSizeType
          +

          A unsigned integer type. It shall be smaller than than the size of the size_type deduced from allocator_traits<A>::size_type or the same type.

          +
        +
        +
        +
        + + + +
        Copyright © 2009-2017 Ion + Gaztanaga

        + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

        +
        +
        +
        +PrevUpHomeNext +
        + + diff --git a/doc/html/boost/container/string.html b/doc/html/boost/container/string.html index 8de77f06a0..9102ce3294 100644 --- a/doc/html/boost/container/string.html +++ b/doc/html/boost/container/string.html @@ -35,13 +35,14 @@ typedef basic_string< char,std::char_traits< char >,new_allocator< char > > string;
        -

        Description

        +

        Description

        Typedef for a basic_string of narrow characters

        -
        Copyright © 2009-2015 Ion Gaztanaga

        +

        Copyright © 2009-2017 Ion + Gaztanaga

        Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

        diff --git a/doc/html/boost/container/swap_idp59253344.html b/doc/html/boost/container/swap_idp59253344.html new file mode 100644 index 0000000000..3f1027fd6f --- /dev/null +++ b/doc/html/boost/container/swap_idp59253344.html @@ -0,0 +1,87 @@ + + + + +Function template swap + + + + + + + + + + + + + + + +
        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
        +
        +
        +PrevUpHomeNext +
        +
        +
        +
        +

        Function template swap

        +

        boost::container::swap — Swaps contents of two static_vectors.

        +
        +

        Synopsis

        +
        // In header: <boost/container/static_vector.hpp>
+
+
+template<typename V, std::size_t C1, std::size_t C2> 
+  void swap(static_vector< V, C1 > & x, static_vector< V, C2 > & y);
        +
        +

        Description

        +

        This function calls static_vector::swap().

        +

        +

        +

        Complexity. Linear O(N).

        +

        +

        +
        ++++ + + + + +

        Parameters:

        ++++ + + + + + + + + + + +

        x

        The first static_vector.

        y

        The second static_vector.

        +
        +
        + + + +
        Copyright © 2009-2017 Ion + Gaztanaga

        + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

        +
        +
        +
        +PrevUpHomeNext +
        + + diff --git a/doc/html/boost/container/swap_idp66348864.html b/doc/html/boost/container/swap_idp66348864.html deleted file mode 100644 index c9ef051806..0000000000 --- a/doc/html/boost/container/swap_idp66348864.html +++ /dev/null @@ -1,86 +0,0 @@ - - - - -Function template swap - - - - - - - - - - - - - - - -
        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
        -
        -
        -PrevUpHomeNext -
        -
        -
        -
        -

        Function template swap

        -

        boost::container::swap — Swaps contents of two static_vectors.

        -
        -

        Synopsis

        -
        // In header: <boost/container/static_vector.hpp>
-
-
-template<typename V, std::size_t C1, std::size_t C2> 
-  void swap(static_vector< V, C1 > & x, static_vector< V, C2 > & y);
        -
        -

        Description

        -

        This function calls static_vector::swap().

        -

        -

        -

        Complexity. Linear O(N).

        -

        -

        -
        ---- - - - - -

        Parameters:

        ---- - - - - - - - - - - -

        x

        The first static_vector.

        y

        The second static_vector.

        -
        -
        - - - -
        Copyright © 2009-2015 Ion Gaztanaga

        - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

        -
        -
        -
        -PrevUpHomeNext -
        - - diff --git a/doc/html/boost/container/throw_bad_alloc.html b/doc/html/boost/container/throw_bad_alloc.html index 7c46ee352d..88c4042e52 100644 --- a/doc/html/boost/container/throw_bad_alloc.html +++ b/doc/html/boost/container/throw_bad_alloc.html @@ -35,7 +35,7 @@ void throw_bad_alloc();
        -

        Description

        +

        Description

        Exception callback called by Boost.Container when fails to allocate the requested storage space.

        • @@ -54,7 +54,8 @@
        -
        Copyright © 2009-2015 Ion Gaztanaga

        +

        Copyright © 2009-2017 Ion + Gaztanaga

        Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

        diff --git a/doc/html/boost/container/throw_length_error.html b/doc/html/boost/container/throw_length_error.html index 20e2ce7b26..cf675f4a98 100644 --- a/doc/html/boost/container/throw_length_error.html +++ b/doc/html/boost/container/throw_length_error.html @@ -35,7 +35,7 @@ void throw_length_error(const char * str);
        -

        Description

        +

        Description

        Exception callback called by Boost.Container to signal errors resizing.

        • @@ -54,7 +54,8 @@
        -
        Copyright © 2009-2015 Ion Gaztanaga

        +

        Copyright © 2009-2017 Ion + Gaztanaga

        Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

        diff --git a/doc/html/boost/container/throw_logic_error.html b/doc/html/boost/container/throw_logic_error.html index eff9f33154..dc1f004dc9 100644 --- a/doc/html/boost/container/throw_logic_error.html +++ b/doc/html/boost/container/throw_logic_error.html @@ -35,7 +35,7 @@ void throw_logic_error(const char * str);
        -

        Description

        +

        Description

        Exception callback called by Boost.Container to report errors in the internal logical of the program, such as violation of logical preconditions or class invariants.

        • @@ -54,7 +54,8 @@
        -
        Copyright © 2009-2015 Ion Gaztanaga

        +

        Copyright © 2009-2017 Ion + Gaztanaga

        Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

        diff --git a/doc/html/boost/container/throw_out_of_range.html b/doc/html/boost/container/throw_out_of_range.html index 3434da327a..b5bdbb02c0 100644 --- a/doc/html/boost/container/throw_out_of_range.html +++ b/doc/html/boost/container/throw_out_of_range.html @@ -35,7 +35,7 @@ void throw_out_of_range(const char * str);
        -

        Description

        +

        Description

        Exception callback called by Boost.Container to signal arguments out of range.

        • @@ -54,7 +54,8 @@
        -
        Copyright © 2009-2015 Ion Gaztanaga

        +

        Copyright © 2009-2017 Ion + Gaztanaga

        Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

        diff --git a/doc/html/boost/container/throw_runtime_error.html b/doc/html/boost/container/throw_runtime_error.html index 6197eea5db..dece14d222 100644 --- a/doc/html/boost/container/throw_runtime_error.html +++ b/doc/html/boost/container/throw_runtime_error.html @@ -8,7 +8,7 @@ - + @@ -21,7 +21,7 @@
        -PrevUpHomeNext +PrevUpHomeNext
        @@ -35,7 +35,7 @@ void throw_runtime_error(const char * str);
        -

        Description

        +

        Description

        Exception callback called by Boost.Container to report errors that can only be detected during runtime.

        • @@ -54,7 +54,8 @@
        -
        Copyright © 2009-2015 Ion Gaztanaga

        +

        Copyright © 2009-2017 Ion + Gaztanaga

        Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

        @@ -62,7 +63,7 @@
        -PrevUpHomeNext +PrevUpHomeNext
        diff --git a/doc/html/boost/container/tree_assoc_defaults.html b/doc/html/boost/container/tree_assoc_defaults.html deleted file mode 100644 index 1830d471f7..0000000000 --- a/doc/html/boost/container/tree_assoc_defaults.html +++ /dev/null @@ -1,61 +0,0 @@ - - - - -Type definition tree_assoc_defaults - - - - - - - - - - - - - - - -
        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
        -
        -
        -PrevUpHomeNext -
        -
        -
        -
        -

        Type definition tree_assoc_defaults

        -

        tree_assoc_defaults

        -
        -

        Synopsis

        -
        // In header: <boost/container/container_fwd.hpp>
-
-
-typedef implementation_defined tree_assoc_defaults;
        -
        -

        Description

        -

        Default options for tree-based associative containers

        -
          -

        • tree_type<red_black_tree>

          • -

        • optimize_size<true>

          • -
        -

        -

        -
        -
        - - - -
        Copyright © 2009-2015 Ion Gaztanaga

        - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

        -
        -
        -
        -PrevUpHomeNext -
        - - diff --git a/doc/html/boost/container/tree_assoc_options.html b/doc/html/boost/container/tree_assoc_options.html index 2c76223980..4bc3bb0d38 100644 --- a/doc/html/boost/container/tree_assoc_options.html +++ b/doc/html/boost/container/tree_assoc_options.html @@ -8,7 +8,7 @@ - + @@ -21,7 +21,7 @@
        -PrevUpHomeNext +PrevUpHomeNext
        @@ -38,13 +38,14 @@ typedef implementation_defined type; };
        -

        Description

        +

        Description

        Helper metafunction to combine options into a single type to be used by boost::container::set, boost::container::multiset boost::container::map and boost::container::multimap. Supported options are: boost::container::optimize_size and boost::container::tree_type

        -
        Copyright © 2009-2015 Ion Gaztanaga

        +

        Copyright © 2009-2017 Ion + Gaztanaga

        Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

        @@ -52,7 +53,7 @@
        -PrevUpHomeNext +PrevUpHomeNext
        diff --git a/doc/html/boost/container/tree_assoc_options_t.html b/doc/html/boost/container/tree_assoc_options_t.html new file mode 100644 index 0000000000..6a0f04b3e9 --- /dev/null +++ b/doc/html/boost/container/tree_assoc_options_t.html @@ -0,0 +1,56 @@ + + + + +Type definition tree_assoc_options_t + + + + + + + + + + + + + + + +
        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
        +
        +
        +PrevUpHomeNext +
        +
        +
        +
        +

        Type definition tree_assoc_options_t

        +

        tree_assoc_options_t

        +
        +

        Synopsis

        +
        // In header: <boost/container/options.hpp>
+
+
+typedef typename boost::container::tree_assoc_options< Options...>::type tree_assoc_options_t;
        +
        +

        Description

        +

        Helper alias metafunction to combine options into a single type to be used by tree-based associative containers

        +
        +
        + + + +
        Copyright © 2009-2017 Ion + Gaztanaga

        + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

        +
        +
        +
        +PrevUpHomeNext +
        + + diff --git a/doc/html/boost/container/tree_type.html b/doc/html/boost/container/tree_type.html index 371c2aa7f9..98d4ecef23 100644 --- a/doc/html/boost/container/tree_type.html +++ b/doc/html/boost/container/tree_type.html @@ -36,13 +36,14 @@ struct tree_type { };
        -

        Description

        +

        Description

        This option setter specifies the underlying tree type (red-black, AVL, Scapegoat or Splay) for ordered associative containers

        -
        Copyright © 2009-2015 Ion Gaztanaga

        +

        Copyright © 2009-2017 Ion + Gaztanaga

        Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

        diff --git a/doc/html/boost/container/tree_type_enum.html b/doc/html/boost/container/tree_type_enum.html index e96ec4b76c..ebc577ce76 100644 --- a/doc/html/boost/container/tree_type_enum.html +++ b/doc/html/boost/container/tree_type_enum.html @@ -6,9 +6,9 @@ - - - + + + @@ -21,7 +21,7 @@
        -PrevUpHomeNext +PrevUpHomeNext
        @@ -30,19 +30,20 @@

        boost::container::tree_type_enum

        Synopsis

        -
        // In header: <boost/container/container_fwd.hpp>
+
        // In header: <boost/container/options.hpp>
 
 
 
 enum tree_type_enum { red_black_tree, avl_tree, scapegoat_tree, splay_tree };
        
 
        
-
        Description
        
+
        Description
        
 
        Enumeration used to configure ordered associative containers with a concrete tree implementation.
        -
        Copyright © 2009-2015 Ion Gaztanaga

        +

        Copyright © 2009-2017 Ion + Gaztanaga

        Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

        @@ -50,7 +51,7 @@
        -PrevUpHomeNext +PrevUpHomeNext
        diff --git a/doc/html/boost/container/uses_allocator.html b/doc/html/boost/container/uses_allocator.html index 94ba5e7f10..2fbb7224d1 100644 --- a/doc/html/boost/container/uses_allocator.html +++ b/doc/html/boost/container/uses_allocator.html @@ -7,7 +7,7 @@ - + @@ -21,7 +21,7 @@
        -PrevUpHomeNext +PrevUpHomeNext
        @@ -33,17 +33,18 @@ 
        // In header: <boost/container/uses_allocator.hpp>
 
 template<typename T, typename Allocator> 
-struct uses_allocator {
+struct uses_allocator : public dtl::uses_allocator_imp< T, Allocator > {
 };
        -

        Description

        +

        Description

        Remark: Automatically detects whether T has a nested allocator_type that is convertible from Allocator. Meets the BinaryTypeTrait requirements ([meta.rqmts] 20.4.1). A program may specialize this type to define uses_allocator<X>::value as true for a T of user-defined type if T does not have a nested allocator_type but is nonetheless constructible using the specified Allocator where either: the first argument of a constructor has type allocator_arg_t and the second argument has type Alloc or the last argument of a constructor has type Alloc.

        Result: uses_allocator<T, Allocator>::value== true if a type T::allocator_type exists and either is_convertible<Alloc, T::allocator_type>::value != false or T::allocator_type is an alias erased_type. False otherwise.

        -
        Copyright © 2009-2015 Ion Gaztanaga

        +

        Copyright © 2009-2017 Ion + Gaztanaga

        Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

        @@ -51,7 +52,7 @@
        -PrevUpHomeNext +PrevUpHomeNext
        diff --git a/doc/html/boost/container/vector.html b/doc/html/boost/container/vector.html index 332dc7b71b..ebdcbe2b8b 100644 --- a/doc/html/boost/container/vector.html +++ b/doc/html/boost/container/vector.html @@ -32,7 +32,8 @@

        Synopsis

        // In header: <boost/container/vector.hpp>
 
-template<typename T, typename Allocator = new_allocator<T> > 
+template<typename T, typename Allocator = new_allocator<T>, 
+         typename Options = void> 
 class vector {
 public:
   // types
@@ -51,102 +52,102 @@
   typedef implementation_defined                                             const_reverse_iterator;
 
   // construct/copy/destruct
-  vector() noexcept(container_detail::is_nothrow_default_constructible< Allocator >::value));
-  explicit vector(const allocator_type &) noexcept;
-  explicit vector(size_type);
-  explicit vector(size_type, const allocator_type &);
-  vector(size_type, default_init_t);
-  vector(size_type, default_init_t, const allocator_type &);
-  vector(size_type, const T &);
-  vector(size_type, const T &, const allocator_type &);
-  template<typename InIt> vector(InIt, InIt last );
-  template<typename InIt> vector(InIt, InIt, const allocator_type &a );
-  vector(const vector &);
-  vector(vector &&) noexcept;
-  vector(std::initializer_list< value_type >, 
+  vector() noexcept(dtl::is_nothrow_default_constructible< Allocator >::value));
+  explicit vector(const allocator_type &) noexcept;
+  explicit vector(size_type);
+  explicit vector(size_type, const allocator_type &);
+  vector(size_type, default_init_t);
+  vector(size_type, default_init_t, const allocator_type &);
+  vector(size_type, const T &);
+  vector(size_type, const T &, const allocator_type &);
+  template<typename InIt> vector(InIt, InIt last );
+  template<typename InIt> vector(InIt, InIt, const allocator_type &a );
+  vector(const vector &);
+  vector(vector &&) noexcept;
+  vector(std::initializer_list< value_type >, 
          const allocator_type & = allocator_type());
-  vector(const vector &, const allocator_type &);
-  vector(vector &&, const allocator_type &);
-  vector & operator=(const vector &);
-  vector & operator=(std::initializer_list< value_type >);
-  vector & operator=(vector &&) noexcept(allocator_traits_type::propagate_on_container_move_assignment::value||allocator_traits_type::is_always_equal::value));
-  ~vector();
+  vector(const vector &, const allocator_type &);
+  vector(vector &&, const allocator_type &);
+  vector & operator=(const vector &);
+  vector & operator=(std::initializer_list< value_type >);
+  vector & operator=(vector &&) noexcept(allocator_traits_type::propagate_on_container_move_assignment::value||allocator_traits_type::is_always_equal::value));
+  ~vector();
 
-  // public member functions
-  template<typename InIt> void assign(InIt, InIt last );
-  void assign(std::initializer_list< T >);
-  template<typename FwdIt> void assign(FwdIt, FwdIt last );
-  void assign(size_type, const value_type &);
-  allocator_type get_allocator() const noexcept;
-  stored_allocator_type & get_stored_allocator() noexcept;
-  const stored_allocator_type & get_stored_allocator() const noexcept;
-  iterator begin() noexcept;
-  const_iterator begin() const noexcept;
-  iterator end() noexcept;
-  const_iterator end() const noexcept;
-  reverse_iterator rbegin() noexcept;
-  const_reverse_iterator rbegin() const noexcept;
-  reverse_iterator rend() noexcept;
-  const_reverse_iterator rend() const noexcept;
-  const_iterator cbegin() const noexcept;
-  const_iterator cend() const noexcept;
-  const_reverse_iterator crbegin() const noexcept;
-  const_reverse_iterator crend() const noexcept;
-  bool empty() const noexcept;
-  size_type size() const noexcept;
-  size_type max_size() const noexcept;
-  void resize(size_type);
-  void resize(size_type, default_init_t);
-  void resize(size_type, const T &);
-  size_type capacity() const noexcept;
-  void reserve(size_type);
-  void shrink_to_fit();
-  reference front() noexcept;
-  const_reference front() const noexcept;
-  reference back() noexcept;
-  const_reference back() const noexcept;
-  reference operator[](size_type) noexcept;
-  const_reference operator[](size_type) const noexcept;
-  iterator nth(size_type) noexcept;
-  const_iterator nth(size_type) const noexcept;
-  size_type index_of(iterator) noexcept;
-  size_type index_of(const_iterator) const noexcept;
-  reference at(size_type);
-  const_reference at(size_type) const;
-  T * data() noexcept;
-  const T * data() const noexcept;
-  template<class... Args> reference emplace_back(Args &&...);
-  template<class... Args> bool stable_emplace_back(Args &&...);
-  template<class... Args> iterator emplace(const_iterator, Args &&...);
-  void push_back(const T &);
-  void push_back(T &&);
-  iterator insert(const_iterator, const T &);
-  iterator insert(const_iterator, T &&);
-  iterator insert(const_iterator, size_type, const T &);
-  template<typename InIt> iterator insert(const_iterator, InIt, InIt);
-  iterator insert(const_iterator, std::initializer_list< value_type >);
-  void pop_back() noexcept;
-  iterator erase(const_iterator);
-  iterator erase(const_iterator, const_iterator);
-  void swap(vector &) noexcept(((allocator_traits_type::propagate_on_container_swap::value||allocator_traits_type::is_always_equal::value)&&!container_detail::is_version< Allocator, 0 >::value)));
-  void clear() noexcept;
+  // public member functions
+  template<typename InIt> void assign(InIt, InIt last );
+  void assign(std::initializer_list< T >);
+  template<typename FwdIt> void assign(FwdIt, FwdIt last );
+  void assign(size_type, const value_type &);
+  allocator_type get_allocator() const noexcept;
+  stored_allocator_type & get_stored_allocator() noexcept;
+  const stored_allocator_type & get_stored_allocator() const noexcept;
+  iterator begin() noexcept;
+  const_iterator begin() const noexcept;
+  iterator end() noexcept;
+  const_iterator end() const noexcept;
+  reverse_iterator rbegin() noexcept;
+  const_reverse_iterator rbegin() const noexcept;
+  reverse_iterator rend() noexcept;
+  const_reverse_iterator rend() const noexcept;
+  const_iterator cbegin() const noexcept;
+  const_iterator cend() const noexcept;
+  const_reverse_iterator crbegin() const noexcept;
+  const_reverse_iterator crend() const noexcept;
+  bool empty() const noexcept;
+  size_type size() const noexcept;
+  size_type max_size() const noexcept;
+  void resize(size_type);
+  void resize(size_type, default_init_t);
+  void resize(size_type, const T &);
+  size_type capacity() const noexcept;
+  void reserve(size_type);
+  void shrink_to_fit();
+  reference front() noexcept;
+  const_reference front() const noexcept;
+  reference back() noexcept;
+  const_reference back() const noexcept;
+  reference operator[](size_type) noexcept;
+  const_reference operator[](size_type) const noexcept;
+  iterator nth(size_type) noexcept;
+  const_iterator nth(size_type) const noexcept;
+  size_type index_of(iterator) noexcept;
+  size_type index_of(const_iterator) const noexcept;
+  reference at(size_type);
+  const_reference at(size_type) const;
+  T * data() noexcept;
+  const T * data() const noexcept;
+  template<class... Args> reference emplace_back(Args &&...);
+  template<class... Args> bool stable_emplace_back(Args &&...);
+  template<class... Args> iterator emplace(const_iterator, Args &&...);
+  void push_back(const T &);
+  void push_back(T &&);
+  iterator insert(const_iterator, const T &);
+  iterator insert(const_iterator, T &&);
+  iterator insert(const_iterator, size_type, const T &);
+  template<typename InIt> iterator insert(const_iterator, InIt, InIt);
+  iterator insert(const_iterator, std::initializer_list< value_type >);
+  void pop_back() noexcept;
+  iterator erase(const_iterator);
+  iterator erase(const_iterator, const_iterator);
+  void swap(vector &) noexcept(((allocator_traits_type::propagate_on_container_swap::value||allocator_traits_type::is_always_equal::value)&&!dtl::is_version< Allocator, 0 >::value)));
+  void clear() noexcept;
 
-  // friend functions
-  friend bool operator==(const vector &, const vector &);
-  friend bool operator!=(const vector &, const vector &);
-  friend bool operator<(const vector &, const vector &);
-  friend bool operator>(const vector &, const vector &);
-  friend bool operator<=(const vector &, const vector &);
-  friend bool operator>=(const vector &, const vector &);
-  friend void swap(vector &, vector &);
+  // friend functions
+  friend bool operator==(const vector &, const vector &);
+  friend bool operator!=(const vector &, const vector &);
+  friend bool operator<(const vector &, const vector &);
+  friend bool operator>(const vector &, const vector &);
+  friend bool operator<=(const vector &, const vector &);
+  friend bool operator>=(const vector &, const vector &);
+  friend void swap(vector &, vector &);
 };
        -

        Description

        +

        Description

        A vector is a sequence that supports random access to elements, constant time insertion and removal of elements at the end, and linear time insertion and removal of elements at the beginning or in the middle. The number of elements in a vector may vary dynamically; memory management is automatic.

        -

        Template Parameters

        +

        Template Parameters

        1. typename T
          @@ -156,131 +157,135 @@ 
          typename Allocator = new_allocator<T>

          The allocator used for all internal memory management

          2. +
        2. +
          typename Options = void
          +

          A type produced from boost::container::vector_options.

          +
        -

        +

        vector public construct/copy/destruct

        1. -
          vector() noexcept(container_detail::is_nothrow_default_constructible< Allocator >::value));
          +
          vector() noexcept(dtl::is_nothrow_default_constructible< Allocator >::value));

          Effects: Constructs a vector taking the allocator as parameter.

          Throws: Nothing.

          Complexity: Constant.

        2. -
          explicit vector(const allocator_type & a) noexcept;
          +
          explicit vector(const allocator_type & a) noexcept;

          Effects: Constructs a vector taking the allocator as parameter.

          Throws: Nothing

          Complexity: Constant.

        3. -
          explicit vector(size_type n);
          +
          explicit vector(size_type n);

          Effects: Constructs a vector and inserts n value initialized values.

          Throws: If allocator_type's allocation throws or T's value initialization throws.

          Complexity: Linear to n.

        4. -
          explicit vector(size_type n, const allocator_type & a);
          +
          explicit vector(size_type n, const allocator_type & a);

          Effects: Constructs a vector that will use a copy of allocator a and inserts n value initialized values.

          Throws: If allocator_type's allocation throws or T's value initialization throws.

          Complexity: Linear to n.

        5. -
          vector(size_type n, default_init_t);
          +
          vector(size_type n, default_init_t);

          Effects: Constructs a vector that will use a copy of allocator a and inserts n default initialized values.

          Throws: If allocator_type's allocation throws or T's default initialization throws.

          Complexity: Linear to n.

          Note: Non-standard extension

        6. -
          vector(size_type n, default_init_t, const allocator_type & a);
          +
          vector(size_type n, default_init_t, const allocator_type & a);

          Effects: Constructs a vector that will use a copy of allocator a and inserts n default initialized values.

          Throws: If allocator_type's allocation throws or T's default initialization throws.

          Complexity: Linear to n.

          Note: Non-standard extension

        7. -
          vector(size_type n, const T & value);
          +
          vector(size_type n, const T & value);

          Effects: Constructs a vector and inserts n copies of value.

          Throws: If allocator_type's allocation throws or T's copy constructor throws.

          Complexity: Linear to n.

        8. -
          vector(size_type n, const T & value, const allocator_type & a);
          +
          vector(size_type n, const T & value, const allocator_type & a);

          Effects: Constructs a vector that will use a copy of allocator a and inserts n copies of value.

          Throws: If allocation throws or T's copy constructor throws.

          Complexity: Linear to n.

        9. -
          template<typename InIt> vector(InIt first, InIt last  BOOST_CONTAINER_DOCIGN);
          +
          template<typename InIt> vector(InIt first, InIt last  BOOST_CONTAINER_DOCIGN);

          Effects: Constructs a vector and inserts a copy of the range [first, last) in the vector.

          Throws: If allocator_type's allocation throws or T's constructor taking a dereferenced InIt throws.

          Complexity: Linear to the range [first, last). 

        10. template<typename InIt> 
-  vector(InIt first, InIt last, 
+  vector(InIt first, InIt last, 
          const allocator_type &a  BOOST_CONTAINER_DOCIGN);

          Effects: Constructs a vector that will use a copy of allocator a and inserts a copy of the range [first, last) in the vector.

          Throws: If allocator_type's allocation throws or T's constructor taking a dereferenced InIt throws.

          Complexity: Linear to the range [first, last).

        11. -
          vector(const vector & x);
          +
          vector(const vector & x);

          Effects: Copy constructs a vector.

          Postcondition: x == *this.

          Throws: If allocator_type's allocation throws or T's copy constructor throws.

          Complexity: Linear to the elements x contains.

        12. -
          vector(vector && x) noexcept;
          +
          vector(vector && x) noexcept;

          Effects: Move constructor. Moves x's resources to *this.

          Throws: Nothing

          Complexity: Constant.

        13. -
          vector(std::initializer_list< value_type > il, 
+
          vector(std::initializer_list< value_type > il, 
        const allocator_type & a = allocator_type());
          
 
          Effects: Constructs a vector that will use a copy of allocator a and inserts a copy of the range [il.begin(), il.last()) in the vector
          
 
          Throws: If T's constructor taking a dereferenced initializer_list iterator throws.
          
 
          Complexity: Linear to the range [il.begin(), il.end()).
        14. -
          vector(const vector & x, const allocator_type & a);
          defined(BOOST_CONTAINER_DOXYGEN_INVOKED)

          Effects: Copy constructs a vector using the specified allocator.

          +
          vector(const vector & x, const allocator_type & a);
          defined(BOOST_CONTAINER_DOXYGEN_INVOKED)

          Effects: Copy constructs a vector using the specified allocator.

          Postcondition: x == *this.

          Throws: If allocation throws or T's copy constructor throws.

          Complexity: Linear to the elements x contains.

        15. -
          vector(vector && x, const allocator_type & a);
          +
          vector(vector && x, const allocator_type & a);

          Effects: Move constructor using the specified allocator. Moves x's resources to *this if a == allocator_type(). Otherwise copies values from x to *this.

          Throws: If allocation or T's copy constructor throws.

          Complexity: Constant if a == x.get_allocator(), linear otherwise.

        16. -
          vector & operator=(const vector & x);
          +
          vector & operator=(const vector & x);

          Effects: Makes *this contain the same elements as x.

          Postcondition: this->size() == x.size(). *this contains a copy of each of x's elements.

          Throws: If memory allocation throws or T's copy/move constructor/assignment throws.

          Complexity: Linear to the number of elements in x.

        17. -
          vector & operator=(std::initializer_list< value_type > il);
          +
          vector & operator=(std::initializer_list< value_type > il);

          Effects: Make *this container contains elements from il.

          Complexity: Linear to the range [il.begin(), il.end()).

        18. -
          vector & operator=(vector && x) noexcept(allocator_traits_type::propagate_on_container_move_assignment::value||allocator_traits_type::is_always_equal::value));
          +
          vector & operator=(vector && x) noexcept(allocator_traits_type::propagate_on_container_move_assignment::value||allocator_traits_type::is_always_equal::value));

          Effects: Move assignment. All x's values are transferred to *this.

          Postcondition: x.empty(). *this contains a the elements x had before the function.

          Throws: If allocator_traits_type::propagate_on_container_move_assignment is false and (allocation throws or value_type's move constructor throws)

          Complexity: Constant if allocator_traits_type:: propagate_on_container_move_assignment is true or this->get>allocator() == x.get_allocator(). Linear otherwise.

        19. -
          ~vector();
          +
          ~vector();

          Effects: Destroys the vector. All stored values are destroyed and used memory is deallocated.

          Throws: Nothing.

          Complexity: Linear to the number of elements.

          @@ -288,224 +293,224 @@
        -

        -vector public member functions

        +

        +vector public member functions

        1. template<typename InIt> 
-  void assign(InIt first, InIt last  BOOST_CONTAINER_DOCIGN);
          + void assign(InIt first, InIt last BOOST_CONTAINER_DOCIGN);

          Effects: Assigns the the range [first, last) to *this.

          Throws: If memory allocation throws or T's copy/move constructor/assignment or T's constructor/assignment from dereferencing InpIt throws.

          Complexity: Linear to n.

        2. -
          void assign(std::initializer_list< T > il);
          +
          void assign(std::initializer_list< T > il);

          Effects: Assigns the the range [il.begin(), il.end()) to *this.

          Throws: If memory allocation throws or T's constructor from dereferencing iniializer_list iterator throws. 

        3. template<typename FwdIt> 
-  void assign(FwdIt first, FwdIt last  BOOST_CONTAINER_DOCIGN);
          + void assign(FwdIt first, FwdIt last BOOST_CONTAINER_DOCIGN);

          Effects: Assigns the the range [first, last) to *this.

          Throws: If memory allocation throws or T's copy/move constructor/assignment or T's constructor/assignment from dereferencing InpIt throws.

          Complexity: Linear to n.

        4. -
          void assign(size_type n, const value_type & val);
          +
          void assign(size_type n, const value_type & val);

          Effects: Assigns the n copies of val to *this.

          Throws: If memory allocation throws or T's copy/move constructor/assignment throws.

          Complexity: Linear to n.

        5. -
          allocator_type get_allocator() const noexcept;
          +
          allocator_type get_allocator() const noexcept;

          Effects: Returns a copy of the internal allocator.

          Throws: If allocator's copy constructor throws.

          Complexity: Constant.

        6. -
          stored_allocator_type & get_stored_allocator() noexcept;
          +
          stored_allocator_type & get_stored_allocator() noexcept;

          Effects: Returns a reference to the internal allocator.

          Throws: Nothing

          Complexity: Constant.

          Note: Non-standard extension.

        7. -
          const stored_allocator_type & get_stored_allocator() const noexcept;
          +
          const stored_allocator_type & get_stored_allocator() const noexcept;

          Effects: Returns a reference to the internal allocator.

          Throws: Nothing

          Complexity: Constant.

          Note: Non-standard extension.

        8. -
          iterator begin() noexcept;
          +
          iterator begin() noexcept;

          Effects: Returns an iterator to the first element contained in the vector.

          Throws: Nothing.

          Complexity: Constant.

        9. -
          const_iterator begin() const noexcept;
          +
          const_iterator begin() const noexcept;

          Effects: Returns a const_iterator to the first element contained in the vector.

          Throws: Nothing.

          Complexity: Constant.

        10. -
          iterator end() noexcept;
          +
          iterator end() noexcept;

          Effects: Returns an iterator to the end of the vector.

          Throws: Nothing.

          Complexity: Constant.

        11. -
          const_iterator end() const noexcept;
          +
          const_iterator end() const noexcept;

          Effects: Returns a const_iterator to the end of the vector.

          Throws: Nothing.

          Complexity: Constant.

        12. -
          reverse_iterator rbegin() noexcept;
          +
          reverse_iterator rbegin() noexcept;

          Effects: Returns a reverse_iterator pointing to the beginning of the reversed vector.

          Throws: Nothing.

          Complexity: Constant.

        13. -
          const_reverse_iterator rbegin() const noexcept;
          +
          const_reverse_iterator rbegin() const noexcept;

          Effects: Returns a const_reverse_iterator pointing to the beginning of the reversed vector.

          Throws: Nothing.

          Complexity: Constant.

        14. -
          reverse_iterator rend() noexcept;
          +
          reverse_iterator rend() noexcept;

          Effects: Returns a reverse_iterator pointing to the end of the reversed vector.

          Throws: Nothing.

          Complexity: Constant.

        15. -
          const_reverse_iterator rend() const noexcept;
          +
          const_reverse_iterator rend() const noexcept;

          Effects: Returns a const_reverse_iterator pointing to the end of the reversed vector.

          Throws: Nothing.

          Complexity: Constant.

        16. -
          const_iterator cbegin() const noexcept;
          +
          const_iterator cbegin() const noexcept;

          Effects: Returns a const_iterator to the first element contained in the vector.

          Throws: Nothing.

          Complexity: Constant.

        17. -
          const_iterator cend() const noexcept;
          +
          const_iterator cend() const noexcept;

          Effects: Returns a const_iterator to the end of the vector.

          Throws: Nothing.

          Complexity: Constant.

        18. -
          const_reverse_iterator crbegin() const noexcept;
          +
          const_reverse_iterator crbegin() const noexcept;

          Effects: Returns a const_reverse_iterator pointing to the beginning of the reversed vector.

          Throws: Nothing.

          Complexity: Constant.

        19. -
          const_reverse_iterator crend() const noexcept;
          +
          const_reverse_iterator crend() const noexcept;

          Effects: Returns a const_reverse_iterator pointing to the end of the reversed vector.

          Throws: Nothing.

          Complexity: Constant.

        20. -
          bool empty() const noexcept;
          +
          bool empty() const noexcept;

          Effects: Returns true if the vector contains no elements.

          Throws: Nothing.

          Complexity: Constant.

        21. -
          size_type size() const noexcept;
          +
          size_type size() const noexcept;

          Effects: Returns the number of the elements contained in the vector.

          Throws: Nothing.

          Complexity: Constant.

        22. -
          size_type max_size() const noexcept;
          +
          size_type max_size() const noexcept;

          Effects: Returns the largest possible size of the vector.

          Throws: Nothing.

          Complexity: Constant.

        23. -
          void resize(size_type new_size);
          +
          void resize(size_type new_size);

          Effects: Inserts or erases elements at the end such that the size becomes n. New elements are value initialized.

          Throws: If memory allocation throws, or T's copy/move or value initialization throws.

          Complexity: Linear to the difference between size() and new_size.

        24. -
          void resize(size_type new_size, default_init_t);
          +
          void resize(size_type new_size, default_init_t);

          Effects: Inserts or erases elements at the end such that the size becomes n. New elements are default initialized.

          Throws: If memory allocation throws, or T's copy/move or default initialization throws.

          Complexity: Linear to the difference between size() and new_size.

          Note: Non-standard extension

        25. -
          void resize(size_type new_size, const T & x);
          +
          void resize(size_type new_size, const T & x);

          Effects: Inserts or erases elements at the end such that the size becomes n. New elements are copy constructed from x.

          Throws: If memory allocation throws, or T's copy/move constructor throws.

          Complexity: Linear to the difference between size() and new_size.

        26. -
          size_type capacity() const noexcept;
          +
          size_type capacity() const noexcept;

          Effects: Number of elements for which memory has been allocated. capacity() is always greater than or equal to size().

          Throws: Nothing.

          Complexity: Constant.

        27. -
          void reserve(size_type new_cap);
          +
          void reserve(size_type new_cap);

          Effects: If n is less than or equal to capacity(), this call has no effect. Otherwise, it is a request for allocation of additional memory. If the request is successful, then capacity() is greater than or equal to n; otherwise, capacity() is unchanged. In either case, size() is unchanged.

          Throws: If memory allocation allocation throws or T's copy/move constructor throws.

        28. -
          void shrink_to_fit();
          +
          void shrink_to_fit();

          Effects: Tries to deallocate the excess of memory created with previous allocations. The size of the vector is unchanged

          Throws: If memory allocation throws, or T's copy/move constructor throws.

          Complexity: Linear to size().

        29. -
          reference front() noexcept;
          +
          reference front() noexcept;

          Requires: !empty()

          Effects: Returns a reference to the first element of the container.

          Throws: Nothing.

          Complexity: Constant.

        30. -
          const_reference front() const noexcept;
          +
          const_reference front() const noexcept;

          Requires: !empty()

          Effects: Returns a const reference to the first element of the container.

          Throws: Nothing.

          Complexity: Constant.

        31. -
          reference back() noexcept;
          +
          reference back() noexcept;

          Requires: !empty()

          Effects: Returns a reference to the last element of the container.

          Throws: Nothing.

          Complexity: Constant.

        32. -
          const_reference back() const noexcept;
          +
          const_reference back() const noexcept;

          Requires: !empty()

          Effects: Returns a const reference to the last element of the container.

          Throws: Nothing.

          Complexity: Constant.

        33. -
          reference operator[](size_type n) noexcept;
          +
          reference operator[](size_type n) noexcept;

          Requires: size() > n.

          Effects: Returns a reference to the nth element from the beginning of the container.

          Throws: Nothing.

          Complexity: Constant.

        34. -
          const_reference operator[](size_type n) const noexcept;
          +
          const_reference operator[](size_type n) const noexcept;

          Requires: size() > n.

          Effects: Returns a const reference to the nth element from the beginning of the container.

          Throws: Nothing.

          Complexity: Constant.

        35. -
          iterator nth(size_type n) noexcept;
          +
          iterator nth(size_type n) noexcept;

          Requires: size() >= n.

          Effects: Returns an iterator to the nth element from the beginning of the container. Returns end() if n == size().

          Throws: Nothing.

          @@ -513,7 +518,7 @@

          Note: Non-standard extension

        36. -
          const_iterator nth(size_type n) const noexcept;
          +
          const_iterator nth(size_type n) const noexcept;

          Requires: size() >= n.

          Effects: Returns a const_iterator to the nth element from the beginning of the container. Returns end() if n == size().

          Throws: Nothing.

          @@ -521,7 +526,7 @@

          Note: Non-standard extension

        37. -
          size_type index_of(iterator p) noexcept;
          +
          size_type index_of(iterator p) noexcept;

          Requires: begin() <= p <= end().

          Effects: Returns the index of the element pointed by p and size() if p == end().

          Throws: Nothing.

          @@ -529,7 +534,7 @@

          Note: Non-standard extension

        38. -
          size_type index_of(const_iterator p) const noexcept;
          +
          size_type index_of(const_iterator p) const noexcept;

          Requires: begin() <= p <= end().

          Effects: Returns the index of the element pointed by p and size() if p == end().

          Throws: Nothing.

          @@ -537,40 +542,40 @@

          Note: Non-standard extension

        39. -
          reference at(size_type n);
          +
          reference at(size_type n);

          Requires: size() > n.

          Effects: Returns a reference to the nth element from the beginning of the container.

          Throws: std::range_error if n >= size()

          Complexity: Constant.

        40. -
          const_reference at(size_type n) const;
          +
          const_reference at(size_type n) const;

          Requires: size() > n.

          Effects: Returns a const reference to the nth element from the beginning of the container.

          Throws: std::range_error if n >= size()

          Complexity: Constant.

        41. -
          T * data() noexcept;
          +
          T * data() noexcept;

          Returns: A pointer such that [data(),data() + size()) is a valid range. For a non-empty vector, data() == &front().

          Throws: Nothing.

          Complexity: Constant.

        42. -
          const T * data() const noexcept;
          +
          const T * data() const noexcept;

          Returns: A pointer such that [data(),data() + size()) is a valid range. For a non-empty vector, data() == &front().

          Throws: Nothing.

          Complexity: Constant.

        43. -
          template<class... Args> reference emplace_back(Args &&... args);
          +
          template<class... Args> reference emplace_back(Args &&... args);

          Effects: Inserts an object of type T constructed with std::forward<Args>(args)... in the end of the vector.

          Returns: A reference to the created object.

          Throws: If memory allocation throws or the in-place constructor throws or T's copy/move constructor throws.

          Complexity: Amortized constant time.

        44. -
          template<class... Args> bool stable_emplace_back(Args &&... args);
          +
          template<class... Args> bool stable_emplace_back(Args &&... args);

          Effects: Inserts an object of type T constructed with std::forward<Args>(args)... in the end of the vector.

          Throws: If the in-place constructor throws.

          Complexity: Constant time.

          @@ -578,40 +583,40 @@ 
        45. template<class... Args> 
-  iterator emplace(const_iterator position, Args &&... args);
          + iterator emplace(const_iterator position, Args &&... args);

          Requires: position must be a valid iterator of *this.

          Effects: Inserts an object of type T constructed with std::forward<Args>(args)... before position

          Throws: If memory allocation throws or the in-place constructor throws or T's copy/move constructor/assignment throws.

          Complexity: If position is end(), amortized constant time Linear time otherwise.

        46. -
          void push_back(const T & x);
          +
          void push_back(const T & x);

          Effects: Inserts a copy of x at the end of the vector.

          Throws: If memory allocation throws or T's copy/move constructor throws.

          Complexity: Amortized constant time.

        47. -
          void push_back(T && x);
          +
          void push_back(T && x);

          Effects: Constructs a new element in the end of the vector and moves the resources of x to this new element.

          Throws: If memory allocation throws or T's copy/move constructor throws.

          Complexity: Amortized constant time.

        48. -
          iterator insert(const_iterator position, const T & x);
          +
          iterator insert(const_iterator position, const T & x);

          Requires: position must be a valid iterator of *this.

          Effects: Insert a copy of x before position.

          Throws: If memory allocation throws or T's copy/move constructor/assignment throws.

          Complexity: If position is end(), amortized constant time Linear time otherwise.

        49. -
          iterator insert(const_iterator position, T && x);
          +
          iterator insert(const_iterator position, T && x);

          Requires: position must be a valid iterator of *this.

          Effects: Insert a new element before position with x's resources.

          Throws: If memory allocation throws.

          Complexity: If position is end(), amortized constant time Linear time otherwise.

        50. -
          iterator insert(const_iterator p, size_type n, const T & x);
          +
          iterator insert(const_iterator p, size_type n, const T & x);

          Requires: p must be a valid iterator of *this.

          Effects: Insert n copies of x before pos.

          Returns: an iterator to the first inserted element or p if n is 0.

          @@ -620,7 +625,7 @@ 
        51. template<typename InIt> 
-  iterator insert(const_iterator pos, InIt first, InIt last);
          + iterator insert(const_iterator pos, InIt first, InIt last);

          Requires: p must be a valid iterator of *this.

          Effects: Insert a copy of the [first, last) range before pos.

          Returns: an iterator to the first inserted element or pos if first == last.

          @@ -628,7 +633,7 @@

          Complexity: Linear to boost::container::iterator_distance [first, last).

        52. -
          iterator insert(const_iterator position, 
+
          iterator insert(const_iterator position, 
                 std::initializer_list< value_type > il);
          
 
          Requires: p must be a valid iterator of *this. num, must be equal to boost::container::iterator_distance(first, last)
          
 
          Effects: Insert a copy of the [first, last) range before pos.
          
@@ -641,31 +646,31 @@
 
          Complexity: Linear to the range [il.begin(), il.end()).
        53. -
          void pop_back() noexcept;
          +
          void pop_back() noexcept;

          Effects: Removes the last element from the container.

          Throws: Nothing.

          Complexity: Constant time.

        54. -
          iterator erase(const_iterator position);
          +
          iterator erase(const_iterator position);

          Effects: Erases the element at position pos.

          Throws: Nothing.

          Complexity: Linear to the elements between pos and the last element. Constant if pos is the last element.

        55. -
          iterator erase(const_iterator first, const_iterator last);
          +
          iterator erase(const_iterator first, const_iterator last);

          Effects: Erases the elements pointed by [first, last).

          Throws: Nothing.

          Complexity: Linear to the distance between first and last plus linear to the elements between pos and the last element.

        56. -
          void swap(vector & x) noexcept(((allocator_traits_type::propagate_on_container_swap::value||allocator_traits_type::is_always_equal::value)&&!container_detail::is_version< Allocator, 0 >::value)));
          +
          void swap(vector & x) noexcept(((allocator_traits_type::propagate_on_container_swap::value||allocator_traits_type::is_always_equal::value)&&!dtl::is_version< Allocator, 0 >::value)));

          Effects: Swaps the contents of *this and x.

          Throws: Nothing.

          Complexity: Constant.

        57. -
          void clear() noexcept;
          +
          void clear() noexcept;

          Effects: Erases all the elements of the vector.

          Throws: Nothing.

          Complexity: Linear to the number of elements in the container.

          @@ -673,41 +678,41 @@
        -

        -vector friend functions

        +

        +vector friend functions

        1. -
          friend bool operator==(const vector & x, const vector & y);
          +
          friend bool operator==(const vector & x, const vector & y);

          Effects: Returns true if x and y are equal

          Complexity: Linear to the number of elements in the container.

        2. -
          friend bool operator!=(const vector & x, const vector & y);
          +
          friend bool operator!=(const vector & x, const vector & y);

          Effects: Returns true if x and y are unequal

          Complexity: Linear to the number of elements in the container.

        3. -
          friend bool operator<(const vector & x, const vector & y);
          +
          friend bool operator<(const vector & x, const vector & y);

          Effects: Returns true if x is less than y

          Complexity: Linear to the number of elements in the container.

        4. -
          friend bool operator>(const vector & x, const vector & y);
          +
          friend bool operator>(const vector & x, const vector & y);

          Effects: Returns true if x is greater than y

          Complexity: Linear to the number of elements in the container.

        5. -
          friend bool operator<=(const vector & x, const vector & y);
          +
          friend bool operator<=(const vector & x, const vector & y);

          Effects: Returns true if x is equal or less than y

          Complexity: Linear to the number of elements in the container.

        6. -
          friend bool operator>=(const vector & x, const vector & y);
          +
          friend bool operator>=(const vector & x, const vector & y);

          Effects: Returns true if x is equal or greater than y

          Complexity: Linear to the number of elements in the container.

        7. -
          friend void swap(vector & x, vector & y);
          +
          friend void swap(vector & x, vector & y);

          Effects: x.swap(y)

          Complexity: Constant.

          8. @@ -717,7 +722,8 @@
        -
        Copyright © 2009-2015 Ion Gaztanaga

        +

        Copyright © 2009-2017 Ion + Gaztanaga

        Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

        diff --git a/doc/html/boost/container/vector_options.html b/doc/html/boost/container/vector_options.html new file mode 100644 index 0000000000..18eab93536 --- /dev/null +++ b/doc/html/boost/container/vector_options.html @@ -0,0 +1,59 @@ + + + + +Struct template vector_options + + + + + + + + + + + + + + + +
        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
        +
        +
        +PrevUpHomeNext +
        +
        +
        +
        +

        Struct template vector_options

        +

        boost::container::vector_options

        +
        +

        Synopsis

        +
        // In header: <boost/container/options.hpp>
+
+template<class... Options> 
+struct vector_options {
+  // types
+  typedef implementation_defined type;
+};
        +
        +

        Description

        +

        Helper metafunction to combine options into a single type to be used by boost::container::vector. Supported options are: boost::container::growth_factor and boost::container::stored_size

        +
        +
        + + + +
        Copyright © 2009-2017 Ion + Gaztanaga

        + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

        +
        +
        +
        +PrevUpHomeNext +
        + + diff --git a/doc/html/boost/container/vector_options_t.html b/doc/html/boost/container/vector_options_t.html new file mode 100644 index 0000000000..a1a266bce3 --- /dev/null +++ b/doc/html/boost/container/vector_options_t.html @@ -0,0 +1,56 @@ + + + + +Type definition vector_options_t + + + + + + + + + + + + + + + +
        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
        +
        +
        +PrevUpHomeNext +
        +
        +
        +
        +

        Type definition vector_options_t

        +

        vector_options_t

        +
        +

        Synopsis

        +
        // In header: <boost/container/options.hpp>
+
+
+typedef typename boost::container::vector_options< Options...>::type vector_options_t;
        +
        +

        Description

        +

        Helper alias metafunction to combine options into a single type to be used by boost::container::vector. Supported options are: boost::container::growth_factor and boost::container::stored_size

        +
        +
        + + + +
        Copyright © 2009-2017 Ion + Gaztanaga

        + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

        +
        +
        +
        +PrevUpHomeNext +
        + + diff --git a/doc/html/boost/container/wstring.html b/doc/html/boost/container/wstring.html index 06d8f4e687..772957260c 100644 --- a/doc/html/boost/container/wstring.html +++ b/doc/html/boost/container/wstring.html @@ -35,13 +35,14 @@ typedef basic_string< wchar_t,std::char_traits< wchar_t >,new_allocator< wchar_t > > wstring;
        -

        Description

        +

        Description

        Typedef for a basic_string of narrow characters

        -
        Copyright © 2009-2015 Ion Gaztanaga

        +

        Copyright © 2009-2017 Ion + Gaztanaga

        Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

        diff --git a/doc/html/boost/date_time/acst_dst_trait.html b/doc/html/boost/date_time/acst_dst_trait.html index cd6104e79f..87144015e3 100644 --- a/doc/html/boost/date_time/acst_dst_trait.html +++ b/doc/html/boost/date_time/acst_dst_trait.html @@ -41,32 +41,32 @@ typedef date_time::last_kday_of_month< date_type > start_rule_functor; typedef date_time::last_kday_of_month< date_type > end_rule_functor; - // public static functions - static day_of_week_type start_day(year_type); - static month_type start_month(year_type); - static day_of_week_type end_day(year_type); - static month_type end_month(year_type); - static int dst_start_offset_minutes(); - static int dst_end_offset_minutes(); - static int dst_shift_length_minutes(); - static date_type local_dst_start_day(year_type); - static date_type local_dst_end_day(year_type); + // public static functions + static day_of_week_type start_day(year_type); + static month_type start_month(year_type); + static day_of_week_type end_day(year_type); + static month_type end_month(year_type); + static int dst_start_offset_minutes(); + static int dst_end_offset_minutes(); + static int dst_shift_length_minutes(); + static date_type local_dst_start_day(year_type); + static date_type local_dst_end_day(year_type); };
        -

        Description

        +

        Description

        -

        -acst_dst_trait public static functions

        +

        +acst_dst_trait public static functions

          -
        1. static day_of_week_type start_day(year_type);
          2. -
        2. static month_type start_month(year_type);
          3. -
        3. static day_of_week_type end_day(year_type);
          4. -
        4. static month_type end_month(year_type);
          5. -
        5. static int dst_start_offset_minutes();
          6. -
        6. static int dst_end_offset_minutes();
          7. -
        7. static int dst_shift_length_minutes();
          8. -
        8. static date_type local_dst_start_day(year_type year);
          9. -
        9. static date_type local_dst_end_day(year_type year);
          10. +
        10. static day_of_week_type start_day(year_type);
          11. +
        11. static month_type start_month(year_type);
          12. +
        12. static day_of_week_type end_day(year_type);
          13. +
        13. static month_type end_month(year_type);
          14. +
        14. static int dst_start_offset_minutes();
          15. +
        15. static int dst_end_offset_minutes();
          16. +
        16. static int dst_shift_length_minutes();
          17. +
        17. static date_type local_dst_start_day(year_type year);
          18. +
        18. static date_type local_dst_end_day(year_type year);
        diff --git a/doc/html/boost/date_time/all_date_names_put.html b/doc/html/boost/date_time/all_date_names_put.html index 6e660ec27b..ffa75667cb 100644 --- a/doc/html/boost/date_time/all_date_names_put.html +++ b/doc/html/boost/date_time/all_date_names_put.html @@ -45,38 +45,38 @@ typedef Config::special_value_enum special_value_enum; // construct/copy/destruct - all_date_names_put(const charT *const, const charT *const, + all_date_names_put(const charT *const, const charT *const, const charT *const, const charT *const, const charT *const, charT = '-', ymd_order_spec = ymd_order_iso, month_format_spec = month_as_short_string); - // public member functions - const charT *const * get_short_month_names() const; - const charT *const * get_long_month_names() const; - const charT *const * get_special_value_names() const; - const charT *const * get_short_weekday_names() const; - const charT *const * get_long_weekday_names() const; + // public member functions + const charT *const * get_short_month_names() const; + const charT *const * get_long_month_names() const; + const charT *const * get_special_value_names() const; + const charT *const * get_short_weekday_names() const; + const charT *const * get_long_weekday_names() const; - // protected member functions - virtual void do_put_month_short(iter_type &, month_enum) const; - virtual void do_put_month_long(iter_type &, month_enum) const; - virtual void do_put_special_value(iter_type &, special_value_enum) const; - virtual void do_put_weekday_short(iter_type &, weekday_enum) const; - virtual void do_put_weekday_long(iter_type &, weekday_enum) const; - virtual void do_month_sep_char(iter_type &) const; - virtual void do_day_sep_char(iter_type &) const; - virtual ymd_order_spec do_date_order() const; - virtual month_format_spec do_month_format() const; + // protected member functions + virtual void do_put_month_short(iter_type &, month_enum) const; + virtual void do_put_month_long(iter_type &, month_enum) const; + virtual void do_put_special_value(iter_type &, special_value_enum) const; + virtual void do_put_weekday_short(iter_type &, weekday_enum) const; + virtual void do_put_weekday_long(iter_type &, weekday_enum) const; + virtual void do_month_sep_char(iter_type &) const; + virtual void do_day_sep_char(iter_type &) const; + virtual ymd_order_spec do_date_order() const; + virtual month_format_spec do_month_format() const; };
        -

        Description

        +

        Description

        -

        +

        all_date_names_put public construct/copy/destruct

        -
        1. all_date_names_put(const charT *const month_short_names, 
+
          1. all_date_names_put(const charT *const month_short_names, 
                    const charT *const month_long_names, 
                    const charT *const special_value_names, 
                    const charT *const weekday_short_names, 
@@ -86,37 +86,37 @@
                    month_format_spec month_format = month_as_short_string);
        -

        -all_date_names_put public member functions

        +

        +all_date_names_put public member functions

          -
        1. const charT *const * get_short_month_names() const;
          2. -
        2. const charT *const * get_long_month_names() const;
          3. -
        3. const charT *const * get_special_value_names() const;
          4. -
        4. const charT *const * get_short_weekday_names() const;
          5. -
        5. const charT *const * get_long_weekday_names() const;
          6. +
        6. const charT *const * get_short_month_names() const;
          7. +
        7. const charT *const * get_long_month_names() const;
          8. +
        8. const charT *const * get_special_value_names() const;
          9. +
        9. const charT *const * get_short_weekday_names() const;
          10. +
        10. const charT *const * get_long_weekday_names() const;
        -

        -all_date_names_put protected member functions

        +

        +all_date_names_put protected member functions

        1. -
          virtual void do_put_month_short(iter_type & oitr, month_enum moy) const;
          Generic facet that takes array of chars.
          2. +
          virtual void do_put_month_short(iter_type & oitr, month_enum moy) const;
          Generic facet that takes array of chars.
        2. -
          virtual void do_put_month_long(iter_type & oitr, month_enum moy) const;
          Long month names.
          3. +
          virtual void do_put_month_long(iter_type & oitr, month_enum moy) const;
          Long month names. 
        3. virtual void 
-do_put_special_value(iter_type & oitr, special_value_enum sv) const;
          Special values names.
          4. -
        4. virtual void do_put_weekday_short(iter_type & oitr, weekday_enum wd) const;
          5. -
        5. virtual void do_put_weekday_long(iter_type & oitr, weekday_enum wd) const;
          6. +do_put_special_value(iter_type & oitr, special_value_enum sv) const;Special values names. +
        6. virtual void do_put_weekday_short(iter_type & oitr, weekday_enum wd) const;
          7. +
        7. virtual void do_put_weekday_long(iter_type & oitr, weekday_enum wd) const;
        8. -
          virtual void do_month_sep_char(iter_type & oitr) const;
          char between year-month
          9. +
          virtual void do_month_sep_char(iter_type & oitr) const;
          char between year-month
        9. -
          virtual void do_day_sep_char(iter_type & oitr) const;
          Char to separate month-day.
          10. +
          virtual void do_day_sep_char(iter_type & oitr) const;
          Char to separate month-day.
        10. -
          virtual ymd_order_spec do_date_order() const;
          Set the date ordering.
          11. +
          virtual ymd_order_spec do_date_order() const;
          Set the date ordering.
        11. -
          virtual month_format_spec do_month_format() const;
          Set the date ordering.
          12. +
          virtual month_format_spec do_month_format() const;
          Set the date ordering.
        diff --git a/doc/html/boost/date_time/bad_field_count.html b/doc/html/boost/date_time/bad_field_count.html index 47fd02e4b1..50ef859ba4 100644 --- a/doc/html/boost/date_time/bad_field_count.html +++ b/doc/html/boost/date_time/bad_field_count.html @@ -36,16 +36,16 @@ class bad_field_count : public out_of_range { public: // construct/copy/destruct - bad_field_count(const std::string &); + bad_field_count(const std::string &); };
        -

        Description

        +

        Description

        -

        +

        bad_field_count public construct/copy/destruct

        -
        1. bad_field_count(const std::string & s);
        +
        1. bad_field_count(const std::string & s);
        diff --git a/doc/html/boost/date_time/base_time.html b/doc/html/boost/date_time/base_time.html index 91e53fd650..8376f6ae9a 100644 --- a/doc/html/boost/date_time/base_time.html +++ b/doc/html/boost/date_time/base_time.html @@ -38,7 +38,7 @@ { public: // types - typedef void _is_boost_date_time_time_point; + typedef void _is_boost_date_time_time_point; typedef T time_type; typedef time_system::time_rep_type time_rep_type; typedef time_system::date_type date_type; @@ -46,94 +46,94 @@ typedef time_system::time_duration_type time_duration_type; // construct/copy/destruct - base_time(const date_type &, const time_duration_type &, + base_time(const date_type &, const time_duration_type &, dst_flags = not_dst); - base_time(special_values); - base_time(const time_rep_type &); + base_time(special_values); + base_time(const time_rep_type &); - // public member functions - date_type date() const; - time_duration_type time_of_day() const; - std::string zone_name(bool = false) const; - std::string zone_abbrev(bool = false) const; - std::string zone_as_posix_string() const; - bool is_not_a_date_time() const; - bool is_infinity() const; - bool is_pos_infinity() const; - bool is_neg_infinity() const; - bool is_special() const; - bool operator==(const time_type &) const; - bool operator<(const time_type &) const; - time_duration_type operator-(const time_type &) const; - time_type operator+(const date_duration_type &) const; - time_type operator+=(const date_duration_type &); - time_type operator-(const date_duration_type &) const; - time_type operator-=(const date_duration_type &); - time_type operator+(const time_duration_type &) const; - time_type operator+=(const time_duration_type &); - time_type operator-(const time_duration_type &) const; - time_type operator-=(const time_duration_type &); + // public member functions + date_type date() const; + time_duration_type time_of_day() const; + std::string zone_name(bool = false) const; + std::string zone_abbrev(bool = false) const; + std::string zone_as_posix_string() const; + bool is_not_a_date_time() const; + bool is_infinity() const; + bool is_pos_infinity() const; + bool is_neg_infinity() const; + bool is_special() const; + bool operator==(const time_type &) const; + bool operator<(const time_type &) const; + time_duration_type operator-(const time_type &) const; + time_type operator+(const date_duration_type &) const; + time_type operator+=(const date_duration_type &); + time_type operator-(const date_duration_type &) const; + time_type operator-=(const date_duration_type &); + time_type operator+(const time_duration_type &) const; + time_type operator+=(const time_duration_type &); + time_type operator-(const time_duration_type &) const; + time_type operator-=(const time_duration_type &); };
        -

        Description

        +

        Description

        This class is a skeleton for the interface of a temporal type with a resolution that is higher than a day. It is intended that this class be the base class and that the actual time class be derived using the BN pattern. In this way, the derived class can make decisions such as 'should there be a default constructor' and what should it set its value to, should there be optional constructors say allowing only an time_durations that generate a time from a clock,etc. So, in fact multiple time types can be created for a time_system with different construction policies, and all of them can perform basic operations by only writing a copy constructor. Finally, compiler errors are also shorter.

        The real behavior of the time class is provided by the time_system template parameter. This class must provide all the logic for addition, subtraction, as well as define all the interface types.

        -

        +

        base_time public construct/copy/destruct

          -
        1. base_time(const date_type & day, const time_duration_type & td, 
+
        2. base_time(const date_type & day, const time_duration_type & td, 
           dst_flags dst = not_dst);
          3. 
-
        3. base_time(special_values sv);
          4. 
-
        4. base_time(const time_rep_type & rhs);
          5. 
+
        5. base_time(special_values sv);
          6. 
+
        6. base_time(const time_rep_type & rhs);
          7.
        -

        -base_time public member functions

        +

        +base_time public member functions

          -
        1. date_type date() const;
          2. -
        2. time_duration_type time_of_day() const;
          3. +
        3. date_type date() const;
          4. +
        4. time_duration_type time_of_day() const;
        5. -
          std::string zone_name(bool = false) const;
          +
          std::string zone_name(bool = false) const;

          Optional bool parameter will return time zone as an offset (ie "+07:00"). Empty string is returned for classes that do not use a time_zone

        6. -
          std::string zone_abbrev(bool = false) const;
          +
          std::string zone_abbrev(bool = false) const;

          Optional bool parameter will return time zone as an offset (ie "+07:00"). Empty string is returned for classes that do not use a time_zone

        7. -
          std::string zone_as_posix_string() const;
          An empty string is returned for classes that do not use a time_zone.
          8. +
          std::string zone_as_posix_string() const;
          An empty string is returned for classes that do not use a time_zone.
        8. -
          bool is_not_a_date_time() const;
          check to see if date is not a value
          9. +
          bool is_not_a_date_time() const;
          check to see if date is not a value
        9. -
          bool is_infinity() const;
          check to see if date is one of the infinity values
          10. +
          bool is_infinity() const;
          check to see if date is one of the infinity values
        10. -
          bool is_pos_infinity() const;
          check to see if date is greater than all possible dates
          11. +
          bool is_pos_infinity() const;
          check to see if date is greater than all possible dates
        11. -
          bool is_neg_infinity() const;
          check to see if date is greater than all possible dates
          12. +
          bool is_neg_infinity() const;
          check to see if date is greater than all possible dates
        12. -
          bool is_special() const;
          check to see if time is a special value
          13. +
          bool is_special() const;
          check to see if time is a special value
        13. -
          bool operator==(const time_type & rhs) const;
          Equality operator – others generated by boost::equality_comparable.
          14. +
          bool operator==(const time_type & rhs) const;
          Equality operator – others generated by boost::equality_comparable.
        14. -
          bool operator<(const time_type & rhs) const;
          Equality operator – others generated by boost::less_than_comparable.
          15. +
          bool operator<(const time_type & rhs) const;
          Equality operator – others generated by boost::less_than_comparable.
        15. -
          time_duration_type operator-(const time_type & rhs) const;
          difference between two times
          16. +
          time_duration_type operator-(const time_type & rhs) const;
          difference between two times
        16. -
          time_type operator+(const date_duration_type & dd) const;
          add date durations
          17. -
        17. time_type operator+=(const date_duration_type & dd);
          18. +
          time_type operator+(const date_duration_type & dd) const;
          add date durations +
        18. time_type operator+=(const date_duration_type & dd);
        19. -
          time_type operator-(const date_duration_type & dd) const;
          subtract date durations
          20. -
        20. time_type operator-=(const date_duration_type & dd);
          21. +
          time_type operator-(const date_duration_type & dd) const;
          subtract date durations +
        21. time_type operator-=(const date_duration_type & dd);
        22. -
          time_type operator+(const time_duration_type & td) const;
          add time durations
          23. -
        23. time_type operator+=(const time_duration_type & td);
          24. +
          time_type operator+(const time_duration_type & td) const;
          add time durations +
        24. time_type operator+=(const time_duration_type & td);
        25. -
          time_type operator-(const time_duration_type & rhs) const;
          subtract time durations
          26. -
        26. time_type operator-=(const time_duration_type & td);
          27. +
          time_type operator-(const time_duration_type & rhs) const;
          subtract time durations +
        27. time_type operator-=(const time_duration_type & td);
        diff --git a/doc/html/boost/date_time/c_local_adjustor.html b/doc/html/boost/date_time/c_local_adjustor.html index cfcaf5ac8a..db608cde39 100644 --- a/doc/html/boost/date_time/c_local_adjustor.html +++ b/doc/html/boost/date_time/c_local_adjustor.html @@ -40,17 +40,17 @@ typedef time_type::date_type date_type; typedef date_type::duration_type date_duration_type; - // public static functions - static time_type utc_to_local(const time_type &); + // public static functions + static time_type utc_to_local(const time_type &); };
        -

        Description

        +

        Description

        Warning!!! This class assumes that timezone settings of the machine are correct. This can be a very dangerous assumption.

        -

        -c_local_adjustor public static functions

        +

        +c_local_adjustor public static functions

        1. -
          static time_type utc_to_local(const time_type & t);
          Convert a utc time to local time.
        +
        static time_type utc_to_local(const time_type & t);
        Convert a utc time to local time.
        diff --git a/doc/html/boost/date_time/c_time.html b/doc/html/boost/date_time/c_time.html index 659e9202b9..e27b1e6aee 100644 --- a/doc/html/boost/date_time/c_time.html +++ b/doc/html/boost/date_time/c_time.html @@ -35,27 +35,27 @@ struct c_time { - // public static functions - static std::tm * localtime(const std::time_t *, std::tm *); - static std::tm * gmtime(const std::time_t *, std::tm *); - static std::tm * localtime(const std::time_t *, std::tm *); - static std::tm * gmtime(const std::time_t *, std::tm *); + // public static functions + static std::tm * localtime(const std::time_t *, std::tm *); + static std::tm * gmtime(const std::time_t *, std::tm *); + static std::tm * localtime(const std::time_t *, std::tm *); + static std::tm * gmtime(const std::time_t *, std::tm *); };
        -

        Description

        +

        Description

        Provides a uniform interface to some ctime functions and their '_r' counterparts. The '_r' functions require a pointer to a user created std::tm struct whereas the regular functions use a staticly created struct and return a pointer to that. These wrapper functions require the user to create a std::tm struct and send in a pointer to it. This struct may be used to store the resulting time. The returned pointer may or may not point to this struct, however, it will point to the result of the corresponding function. All functions do proper checking of the C function results and throw exceptions on error. Therefore the functions will never return NULL.

        -

        -c_time public static functions

        +

        +c_time public static functions

        1. -
          static std::tm * localtime(const std::time_t * t, std::tm * result);
          requires a pointer to a user created std::tm struct
          2. +
          static std::tm * localtime(const std::time_t * t, std::tm * result);
          requires a pointer to a user created std::tm struct
        2. -
          static std::tm * gmtime(const std::time_t * t, std::tm * result);
          requires a pointer to a user created std::tm struct
          3. +
          static std::tm * gmtime(const std::time_t * t, std::tm * result);
          requires a pointer to a user created std::tm struct
        3. -
          static std::tm * localtime(const std::time_t * t, std::tm * result);
          requires a pointer to a user created std::tm struct
          4. +
          static std::tm * localtime(const std::time_t * t, std::tm * result);
          requires a pointer to a user created std::tm struct
        4. -
          static std::tm * gmtime(const std::time_t * t, std::tm * result);
          requires a pointer to a user created std::tm struct
          5. +
          static std::tm * gmtime(const std::time_t * t, std::tm * result);
          requires a pointer to a user created std::tm struct
        diff --git a/doc/html/boost/date_time/convert_string_type.html b/doc/html/boost/date_time/convert_string_type.html index 1f4651da2a..0ca5f0a55a 100644 --- a/doc/html/boost/date_time/convert_string_type.html +++ b/doc/html/boost/date_time/convert_string_type.html @@ -37,7 +37,7 @@ std::basic_string< OutputT > convert_string_type(const std::basic_string< InputT > & inp_str);
        -

        Description

        +

        Description

        Converts a wstring to a string (or a string to wstring). If both template parameters are of same type, a copy of the input string is returned.

        diff --git a/doc/html/boost/date_time/convert_to_lower.html b/doc/html/boost/date_time/convert_to_lower.html index 92f1068a9d..2d687b3102 100644 --- a/doc/html/boost/date_time/convert_to_lower.html +++ b/doc/html/boost/date_time/convert_to_lower.html @@ -35,7 +35,7 @@ std::string convert_to_lower(std::string inp);
        -

        Description

        +

        Description

        This function simply takes a string, and changes all the characters in that string to lowercase (according to the default system locale). In the event that a compiler does not support locales, the old C style tolower() is used.

        diff --git a/doc/html/boost/date_time/counted_time_rep.html b/doc/html/boost/date_time/counted_time_rep.html index ce898be3b1..688981e184 100644 --- a/doc/html/boost/date_time/counted_time_rep.html +++ b/doc/html/boost/date_time/counted_time_rep.html @@ -45,56 +45,56 @@ typedef config::resolution_traits resolution_traits; // construct/copy/destruct - counted_time_rep(const date_type &, const time_duration_type &); - explicit counted_time_rep(int_type); - explicit counted_time_rep(impl_type); + counted_time_rep(const date_type &, const time_duration_type &); + explicit counted_time_rep(int_type); + explicit counted_time_rep(impl_type); - // public member functions - date_type date() const; - unsigned long day_count() const; - int_type time_count() const; - int_type tod() const; - bool is_pos_infinity() const; - bool is_neg_infinity() const; - bool is_not_a_date_time() const; - bool is_special() const; - impl_type get_rep() const; + // public member functions + date_type date() const; + unsigned long day_count() const; + int_type time_count() const; + int_type tod() const; + bool is_pos_infinity() const; + bool is_neg_infinity() const; + bool is_not_a_date_time() const; + bool is_special() const; + impl_type get_rep() const; - // public static functions - static int_type frac_sec_per_day(); + // public static functions + static int_type frac_sec_per_day(); };
        -

        Description

        +

        Description

        -

        +

        counted_time_rep public construct/copy/destruct

          -
        1. counted_time_rep(const date_type & d, const time_duration_type & time_of_day);
          2. -
        2. explicit counted_time_rep(int_type count);
          3. -
        3. explicit counted_time_rep(impl_type count);
          4. +
        4. counted_time_rep(const date_type & d, const time_duration_type & time_of_day);
          5. +
        5. explicit counted_time_rep(int_type count);
          6. +
        6. explicit counted_time_rep(impl_type count);
        -

        -counted_time_rep public member functions

        +

        +counted_time_rep public member functions

          -
        1. date_type date() const;
          2. -
        2. unsigned long day_count() const;
          3. -
        3. int_type time_count() const;
          4. -
        4. int_type tod() const;
          5. -
        5. bool is_pos_infinity() const;
          6. -
        6. bool is_neg_infinity() const;
          7. -
        7. bool is_not_a_date_time() const;
          8. -
        8. bool is_special() const;
          9. -
        9. impl_type get_rep() const;
          10. +
        10. date_type date() const;
          11. +
        11. unsigned long day_count() const;
          12. +
        12. int_type time_count() const;
          13. +
        13. int_type tod() const;
          14. +
        14. bool is_pos_infinity() const;
          15. +
        15. bool is_neg_infinity() const;
          16. +
        16. bool is_not_a_date_time() const;
          17. +
        17. bool is_special() const;
          18. +
        18. impl_type get_rep() const;
        -

        -counted_time_rep public static functions

        -
        1. static int_type frac_sec_per_day();
        +

        +counted_time_rep public static functions

        +
        1. static int_type frac_sec_per_day();
        diff --git a/doc/html/boost/date_time/counted_time_system.html b/doc/html/boost/date_time/counted_time_system.html index 08907d0549..a28309cd94 100644 --- a/doc/html/boost/date_time/counted_time_system.html +++ b/doc/html/boost/date_time/counted_time_system.html @@ -43,55 +43,55 @@ typedef time_rep_type::date_type date_type; typedef time_rep_type::date_duration_type date_duration_type; - // public static functions - template<typename T> static void unused_var(const T &); + // public static functions + template<typename T> static void unused_var(const T &); static time_rep_type - get_time_rep(const date_type &, const time_duration_type &, + get_time_rep(const date_type &, const time_duration_type &, date_time::dst_flags = not_dst); - static time_rep_type get_time_rep(special_values); - static date_type get_date(const time_rep_type &); - static time_duration_type get_time_of_day(const time_rep_type &); - static std::string zone_name(const time_rep_type &); - static bool is_equal(const time_rep_type &, const time_rep_type &); - static bool is_less(const time_rep_type &, const time_rep_type &); + static time_rep_type get_time_rep(special_values); + static date_type get_date(const time_rep_type &); + static time_duration_type get_time_of_day(const time_rep_type &); + static std::string zone_name(const time_rep_type &); + static bool is_equal(const time_rep_type &, const time_rep_type &); + static bool is_less(const time_rep_type &, const time_rep_type &); static time_rep_type - add_days(const time_rep_type &, const date_duration_type &); + add_days(const time_rep_type &, const date_duration_type &); static time_rep_type - subtract_days(const time_rep_type &, const date_duration_type &); + subtract_days(const time_rep_type &, const date_duration_type &); static time_rep_type - subtract_time_duration(const time_rep_type &, const time_duration_type &); + subtract_time_duration(const time_rep_type &, const time_duration_type &); static time_rep_type - add_time_duration(const time_rep_type &, time_duration_type); + add_time_duration(const time_rep_type &, time_duration_type); static time_duration_type - subtract_times(const time_rep_type &, const time_rep_type &); + subtract_times(const time_rep_type &, const time_rep_type &); };
        -

        Description

        +

        Description

        -

        -counted_time_system public static functions

        +

        +counted_time_system public static functions

          -
        1. template<typename T> static void unused_var(const T &);
          2. +
        2. template<typename T> static void unused_var(const T &);
        3. static time_rep_type 
-get_time_rep(const date_type & day, const time_duration_type & tod, 
+get_time_rep(const date_type & day, const time_duration_type & tod, 
              date_time::dst_flags dst = not_dst);
          4. -
        4. static time_rep_type get_time_rep(special_values sv);
          5. -
        5. static date_type get_date(const time_rep_type & val);
          6. -
        6. static time_duration_type get_time_of_day(const time_rep_type & val);
          7. -
        7. static std::string zone_name(const time_rep_type &);
          8. -
        8. static bool is_equal(const time_rep_type & lhs, const time_rep_type & rhs);
          9. -
        9. static bool is_less(const time_rep_type & lhs, const time_rep_type & rhs);
          10. +
        10. static time_rep_type get_time_rep(special_values sv);
          11. +
        11. static date_type get_date(const time_rep_type & val);
          12. +
        12. static time_duration_type get_time_of_day(const time_rep_type & val);
          13. +
        13. static std::string zone_name(const time_rep_type &);
          14. +
        14. static bool is_equal(const time_rep_type & lhs, const time_rep_type & rhs);
          15. +
        15. static bool is_less(const time_rep_type & lhs, const time_rep_type & rhs);
        16. static time_rep_type 
-add_days(const time_rep_type & base, const date_duration_type & dd);
          17. +add_days(const time_rep_type & base, const date_duration_type & dd); 
        17. static time_rep_type 
-subtract_days(const time_rep_type & base, const date_duration_type & dd);
          18. +subtract_days(const time_rep_type & base, const date_duration_type & dd); 
        18. static time_rep_type 
-subtract_time_duration(const time_rep_type & base, 
+subtract_time_duration(const time_rep_type & base, 
                        const time_duration_type & td);
        19. static time_rep_type 
-add_time_duration(const time_rep_type & base, time_duration_type td);
          20. +add_time_duration(const time_rep_type & base, time_duration_type td); 
        20. static time_duration_type 
-subtract_times(const time_rep_type & lhs, const time_rep_type & rhs);
          21. +subtract_times(const time_rep_type & lhs, const time_rep_type & rhs);
        diff --git a/doc/html/boost/date_time/data_not_accessible.html b/doc/html/boost/date_time/data_not_accessible.html index 4fa3e12216..d6b537e7f0 100644 --- a/doc/html/boost/date_time/data_not_accessible.html +++ b/doc/html/boost/date_time/data_not_accessible.html @@ -36,19 +36,19 @@ class data_not_accessible : public logic_error { public: // construct/copy/destruct - data_not_accessible(); - data_not_accessible(const std::string &); + data_not_accessible(); + data_not_accessible(const std::string &); };
        -

        Description

        +

        Description

        -

        +

        data_not_accessible public construct/copy/destruct

          -
        1. data_not_accessible();
          2. -
        2. data_not_accessible(const std::string & filespec);
          3. +
        3. data_not_accessible();
          4. +
        4. data_not_accessible(const std::string & filespec);
        diff --git a/doc/html/boost/date_time/date.html b/doc/html/boost/date_time/date.html index 011eaffc4d..45a962bf9d 100644 --- a/doc/html/boost/date_time/date.html +++ b/doc/html/boost/date_time/date.html @@ -51,82 +51,82 @@ typedef calendar::day_of_week_type day_of_week_type; // construct/copy/destruct - date(year_type, month_type, day_type); - date(const ymd_type &); - explicit date(date_int_type); - explicit date(date_rep_type); + date(year_type, month_type, day_type); + date(const ymd_type &); + explicit date(date_int_type); + explicit date(date_rep_type); - // public member functions - year_type year() const; - month_type month() const; - day_type day() const; - day_of_week_type day_of_week() const; - ymd_type year_month_day() const; - bool operator<(const date_type &) const; - bool operator==(const date_type &) const; - bool is_special() const; - bool is_not_a_date() const; - bool is_infinity() const; - bool is_pos_infinity() const; - bool is_neg_infinity() const; - special_values as_special() const; - duration_type operator-(const date_type &) const; - date_type operator-(const duration_type &) const; - date_type operator-=(const duration_type &); - date_rep_type day_count() const; - date_type operator+(const duration_type &) const; - date_type operator+=(const duration_type &); + // public member functions + year_type year() const; + month_type month() const; + day_type day() const; + day_of_week_type day_of_week() const; + ymd_type year_month_day() const; + bool operator<(const date_type &) const; + bool operator==(const date_type &) const; + bool is_special() const; + bool is_not_a_date() const; + bool is_infinity() const; + bool is_pos_infinity() const; + bool is_neg_infinity() const; + special_values as_special() const; + duration_type operator-(const date_type &) const; + date_type operator-(const duration_type &) const; + date_type operator-=(const duration_type &); + date_rep_type day_count() const; + date_type operator+(const duration_type &) const; + date_type operator+=(const duration_type &); };
        -

        Description

        +

        Description

        The date template represents an interface shell for a date class that is based on a year-month-day system such as the gregorian or iso systems. It provides basic operations to enable calculation and comparisons.

        Theory

        This date representation fundamentally departs from the C tm struct approach. The goal for this type is to provide efficient date operations (add, subtract) and storage (minimize space to represent) in a concrete class. Thus, the date uses a count internally to represent a particular date. The calendar parameter defines the policies for converting the the year-month-day and internal counted form here. Applications that need to perform heavy formatting of the same date repeatedly will perform better by using the year-month-day representation.

        Internally the date uses a day number to represent the date. This is a monotonic time representation. This representation allows for fast comparison as well as simplifying the creation of writing numeric operations. Essentially, the internal day number is like adjusted julian day. The adjustment is determined by the Epoch date which is represented as day 1 of the calendar. Day 0 is reserved for negative infinity so that any actual date is automatically greater than negative infinity. When a date is constructed from a date or formatted for output, the appropriate conversions are applied to create the year, month, day representations.

        -

        +

        date public construct/copy/destruct

          -
        1. date(year_type y, month_type m, day_type d);
          2. -
        2. date(const ymd_type & ymd);
          3. +
        3. date(year_type y, month_type m, day_type d);
          4. +
        4. date(const ymd_type & ymd);
        5. -
          explicit date(date_int_type days);
          +
          explicit date(date_int_type days);

          This is a private constructor which allows for the creation of new dates. It is not exposed to users since that would require class users to understand the inner workings of the date class.

          6. -
        6. explicit date(date_rep_type days);
          7. +
        7. explicit date(date_rep_type days);
        -

        -date public member functions

        +

        +date public member functions

          -
        1. year_type year() const;
          2. -
        2. month_type month() const;
          3. -
        3. day_type day() const;
          4. -
        4. day_of_week_type day_of_week() const;
          5. -
        5. ymd_type year_month_day() const;
          6. -
        6. bool operator<(const date_type & rhs) const;
          7. -
        7. bool operator==(const date_type & rhs) const;
          8. +
        8. year_type year() const;
          9. +
        9. month_type month() const;
          10. +
        10. day_type day() const;
          11. +
        11. day_of_week_type day_of_week() const;
          12. +
        12. ymd_type year_month_day() const;
          13. +
        13. bool operator<(const date_type & rhs) const;
          14. +
        14. bool operator==(const date_type & rhs) const;
        15. -
          bool is_special() const;
          check to see if date is a special value
          16. +
          bool is_special() const;
          check to see if date is a special value
        16. -
          bool is_not_a_date() const;
          check to see if date is not a value
          17. +
          bool is_not_a_date() const;
          check to see if date is not a value
        17. -
          bool is_infinity() const;
          check to see if date is one of the infinity values
          18. +
          bool is_infinity() const;
          check to see if date is one of the infinity values
        18. -
          bool is_pos_infinity() const;
          check to see if date is greater than all possible dates
          19. +
          bool is_pos_infinity() const;
          check to see if date is greater than all possible dates
        19. -
          bool is_neg_infinity() const;
          check to see if date is greater than all possible dates
          20. +
          bool is_neg_infinity() const;
          check to see if date is greater than all possible dates
        20. -
          special_values as_special() const;
          return as a special value or a not_special if a normal date
          21. -
        21. duration_type operator-(const date_type & d) const;
          22. -
        22. date_type operator-(const duration_type & dd) const;
          23. -
        23. date_type operator-=(const duration_type & dd);
          24. -
        24. date_rep_type day_count() const;
          25. -
        25. date_type operator+(const duration_type & dd) const;
          26. -
        26. date_type operator+=(const duration_type & dd);
          27. +
          special_values as_special() const;
          return as a special value or a not_special if a normal date +
        27. duration_type operator-(const date_type & d) const;
          28. +
        28. date_type operator-(const duration_type & dd) const;
          29. +
        29. date_type operator-=(const duration_type & dd);
          30. +
        30. date_rep_type day_count() const;
          31. +
        31. date_type operator+(const duration_type & dd) const;
          32. +
        32. date_type operator+=(const duration_type & dd);
        diff --git a/doc/html/boost/date_time/date_duration.html b/doc/html/boost/date_time/date_duration.html index 92086a7503..59415edd44 100644 --- a/doc/html/boost/date_time/date_duration.html +++ b/doc/html/boost/date_time/date_duration.html @@ -41,73 +41,75 @@ typedef duration_rep_traits::impl_type duration_rep; // construct/copy/destruct - explicit date_duration(duration_rep); - date_duration(special_values); - date_duration(const date_duration< duration_rep_traits > &); + explicit date_duration(duration_rep); + date_duration(special_values); + date_duration(const date_duration< duration_rep_traits > &); - // public member functions - duration_rep get_rep() const; - bool is_special() const; - duration_rep_type days() const; - bool operator==(const date_duration &) const; - bool operator<(const date_duration &) const; - date_duration & operator-=(const date_duration &); - date_duration & operator+=(const date_duration &); - date_duration operator-() const; - date_duration & operator/=(int); - bool is_negative() const; + // public member functions + duration_rep get_rep() const; + special_values as_special() const; + bool is_special() const; + duration_rep_type days() const; + bool operator==(const date_duration &) const; + bool operator<(const date_duration &) const; + date_duration & operator-=(const date_duration &); + date_duration & operator+=(const date_duration &); + date_duration operator-() const; + date_duration & operator/=(int); + bool is_negative() const; - // public static functions - static date_duration unit(); + // public static functions + static date_duration unit(); };
        -

        Description

        +

        Description

        -

        +

        date_duration public construct/copy/destruct

        1. -
          explicit date_duration(duration_rep day_count);
          Construct from a day count.
          2. +
          explicit date_duration(duration_rep day_count);
          Construct from a day count.
        2. -
          date_duration(special_values sv);
          +
          date_duration(special_values sv);

          construct from special_values - only works when instantiated with duration_traits_adapted

        3. -
          date_duration(const date_duration< duration_rep_traits > & other);
          Construct from another date_duration (Copy Constructor)
          4. +
          date_duration(const date_duration< duration_rep_traits > & other);
          Construct from another date_duration (Copy Constructor)
        -

        -date_duration public member functions

        +

        +date_duration public member functions

        1. -
          duration_rep get_rep() const;
          returns days_ as it's instantiated type - used for streaming
          2. -
        2. bool is_special() const;
          3. +
          duration_rep get_rep() const;
          returns days_ as it's instantiated type - used for streaming +
        3. special_values as_special() const;
          4. +
        4. bool is_special() const;
        5. -
          duration_rep_type days() const;
          returns days as value, not object.
          6. +
          duration_rep_type days() const;
          returns days as value, not object.
        6. -
          bool operator==(const date_duration & rhs) const;
          Equality.
          7. +
          bool operator==(const date_duration & rhs) const;
          Equality.
        7. -
          bool operator<(const date_duration & rhs) const;
          Less.
          8. +
          bool operator<(const date_duration & rhs) const;
          Less.
        8. -
          date_duration & operator-=(const date_duration & rhs);
          Subtract another duration – result is signed.
          9. +
          date_duration & operator-=(const date_duration & rhs);
          Subtract another duration – result is signed.
        9. -
          date_duration & operator+=(const date_duration & rhs);
          Add a duration – result is signed.
          10. +
          date_duration & operator+=(const date_duration & rhs);
          Add a duration – result is signed.
        10. -
          date_duration operator-() const;
          unary- Allows for dd = -date_duration(2); -> dd == -2
          11. +
          date_duration operator-() const;
          unary- Allows for dd = -date_duration(2); -> dd == -2
        11. -
          date_duration & operator/=(int divisor);
          Division operations on a duration with an integer.
          12. +
          date_duration & operator/=(int divisor);
          Division operations on a duration with an integer.
        12. -
          bool is_negative() const;
          return sign information
          13. +
          bool is_negative() const;
          return sign information
        -

        -date_duration public static functions

        +

        +date_duration public static functions

        1. -
          static date_duration unit();
          Returns the smallest duration – used by to calculate 'end'.
        +
        static date_duration unit();
        Returns the smallest duration – used by to calculate 'end'.
        diff --git a/doc/html/boost/date_time/date_facet.html b/doc/html/boost/date_time/date_facet.html index 190254d32a..b5fe3fddb8 100644 --- a/doc/html/boost/date_time/date_facet.html +++ b/doc/html/boost/date_time/date_facet.html @@ -45,7 +45,7 @@ typedef std::basic_string< CharT > string_type; typedef CharT char_type; typedef boost::date_time::period_formatter< CharT > period_formatter_type; - typedef boost::date_time::special_values_formatter< CharT > special_values_formatter_type; + typedef boost::date_time::special_values_formatter< CharT > special_values_formatter_type; typedef std::vector< std::basic_string< CharT > > input_collection_type; typedef date_generator_formatter< date_type, CharT > date_gen_formatter_type; typedef partial_date< date_type > partial_date_type; @@ -56,49 +56,49 @@ typedef first_kday_before< date_type > kday_before_type; // construct/copy/destruct - explicit date_facet(::size_t = 0); - explicit date_facet(const char_type *, const input_collection_type &, + explicit date_facet(::size_t = 0); + explicit date_facet(const char_type *, const input_collection_type &, ::size_t = 0); - explicit date_facet(const char_type *, + explicit date_facet(const char_type *, period_formatter_type = period_formatter_type(), - special_values_formatter_type = special_values_formatter_type(), + special_values_formatter_type = special_values_formatter_type(), date_gen_formatter_type = date_gen_formatter_type(), ::size_t = 0); - // public member functions - std::locale::id & __get_id(void) const; - void format(const char_type *const); - virtual void set_iso_format(); - virtual void set_iso_extended_format(); - void month_format(const char_type *const); - void weekday_format(const char_type *const); - void period_formatter(period_formatter_type); - void special_values_formatter(const special_values_formatter_type &); - void short_weekday_names(const input_collection_type &); - void long_weekday_names(const input_collection_type &); - void short_month_names(const input_collection_type &); - void long_month_names(const input_collection_type &); - void date_gen_phrase_strings(const input_collection_type &, + // public member functions + std::locale::id & __get_id(void) const; + void format(const char_type *const); + virtual void set_iso_format(); + virtual void set_iso_extended_format(); + void month_format(const char_type *const); + void weekday_format(const char_type *const); + void period_formatter(period_formatter_type); + void special_values_formatter(const special_values_formatter_type &); + void short_weekday_names(const input_collection_type &); + void long_weekday_names(const input_collection_type &); + void short_month_names(const input_collection_type &); + void long_month_names(const input_collection_type &); + void date_gen_phrase_strings(const input_collection_type &, typename date_gen_formatter_type::phrase_elements = date_gen_formatter_type::first); - OutItrT put(OutItrT, std::ios_base &, char_type, const date_type &) const; - OutItrT put(OutItrT, std::ios_base &, char_type, const duration_type &) const; - OutItrT put(OutItrT, std::ios_base &, char_type, const month_type &) const; - OutItrT put(OutItrT, std::ios_base &, char_type, const day_type &) const; - OutItrT put(OutItrT, std::ios_base &, char_type, const day_of_week_type &) const; - OutItrT put(OutItrT, std::ios_base &, char_type, const period_type &) const; - OutItrT put(OutItrT, std::ios_base &, char_type, const partial_date_type &) const; - OutItrT put(OutItrT, std::ios_base &, char_type, const nth_kday_type &) const; - OutItrT put(OutItrT, std::ios_base &, char_type, const first_kday_type &) const; - OutItrT put(OutItrT, std::ios_base &, char_type, const last_kday_type &) const; - OutItrT put(OutItrT, std::ios_base &, char_type, const kday_before_type &) const; - OutItrT put(OutItrT, std::ios_base &, char_type, const kday_after_type &) const; + OutItrT put(OutItrT, std::ios_base &, char_type, const date_type &) const; + OutItrT put(OutItrT, std::ios_base &, char_type, const duration_type &) const; + OutItrT put(OutItrT, std::ios_base &, char_type, const month_type &) const; + OutItrT put(OutItrT, std::ios_base &, char_type, const day_type &) const; + OutItrT put(OutItrT, std::ios_base &, char_type, const day_of_week_type &) const; + OutItrT put(OutItrT, std::ios_base &, char_type, const period_type &) const; + OutItrT put(OutItrT, std::ios_base &, char_type, const partial_date_type &) const; + OutItrT put(OutItrT, std::ios_base &, char_type, const nth_kday_type &) const; + OutItrT put(OutItrT, std::ios_base &, char_type, const first_kday_type &) const; + OutItrT put(OutItrT, std::ios_base &, char_type, const last_kday_type &) const; + OutItrT put(OutItrT, std::ios_base &, char_type, const kday_before_type &) const; + OutItrT put(OutItrT, std::ios_base &, char_type, const kday_after_type &) const; - // protected member functions + // protected member functions virtual OutItrT - do_put_special(OutItrT, std::ios_base &, char_type, + do_put_special(OutItrT, std::ios_base &, char_type, const boost::date_time::special_values) const; virtual OutItrT - do_put_tm(OutItrT, std::ios_base &, char_type, const tm &, string_type) const; + do_put_tm(OutItrT, std::ios_base &, char_type, const tm &, string_type) const; // public data members static const char_type long_weekday_format; @@ -113,7 +113,7 @@ static std::locale::id id; };
        -

        Description

        +

        Description

        Class that provides format based I/O facet for date types.

        This class allows the formatting of dates by using format string. Format strings are:

          @@ -128,76 +128,76 @@

          Default month format == b Default weekday format == a

          -

          +

          date_facet public construct/copy/destruct

            -
          1. explicit date_facet(::size_t a_ref = 0);
            2. -
          2. explicit date_facet(const char_type * format_str, 
+
          3. explicit date_facet(::size_t a_ref = 0);
            4. 
+
          4. explicit date_facet(const char_type * format_str, 
                     const input_collection_type & short_names, 
                     ::size_t ref_count = 0);
            5. 
-
          5. explicit date_facet(const char_type * format_str, 
+
          6. explicit date_facet(const char_type * format_str, 
                     period_formatter_type per_formatter = period_formatter_type(), 
-                    special_values_formatter_type sv_formatter = special_values_formatter_type(), 
+                    special_values_formatter_type sv_formatter = special_values_formatter_type(), 
                     date_gen_formatter_type dg_formatter = date_gen_formatter_type(), 
                     ::size_t ref_count = 0);
            7.
          -

          -date_facet public member functions

          +

          +date_facet public member functions

            -
          1. std::locale::id & __get_id(void) const;
            2. -
          2. void format(const char_type *const format_str);
            3. -
          3. virtual void set_iso_format();
            4. -
          4. virtual void set_iso_extended_format();
            5. -
          5. void month_format(const char_type *const format_str);
            6. -
          6. void weekday_format(const char_type *const format_str);
            7. -
          7. void period_formatter(period_formatter_type per_formatter);
            8. -
          8. void special_values_formatter(const special_values_formatter_type & svf);
            9. -
          9. void short_weekday_names(const input_collection_type & short_names);
            10. -
          10. void long_weekday_names(const input_collection_type & long_names);
            11. -
          11. void short_month_names(const input_collection_type & short_names);
            12. -
          12. void long_month_names(const input_collection_type & long_names);
            13. -
          13. void date_gen_phrase_strings(const input_collection_type & new_strings, 
+
          14. std::locale::id & __get_id(void) const;
            15. 
+
          15. void format(const char_type *const format_str);
            16. 
+
          16. virtual void set_iso_format();
            17. 
+
          17. virtual void set_iso_extended_format();
            18. 
+
          18. void month_format(const char_type *const format_str);
            19. 
+
          19. void weekday_format(const char_type *const format_str);
            20. 
+
          20. void period_formatter(period_formatter_type per_formatter);
            21. 
+
          21. void special_values_formatter(const special_values_formatter_type & svf);
            22. 
+
          22. void short_weekday_names(const input_collection_type & short_names);
            23. 
+
          23. void long_weekday_names(const input_collection_type & long_names);
            24. 
+
          24. void short_month_names(const input_collection_type & short_names);
            25. 
+
          25. void long_month_names(const input_collection_type & long_names);
            26. 
+
          26. void date_gen_phrase_strings(const input_collection_type & new_strings, 
                              typename date_gen_formatter_type::phrase_elements beg_pos = date_gen_formatter_type::first);
            27. 
-
          27. OutItrT put(OutItrT next, std::ios_base & a_ios, char_type fill_char, 
+
          28. OutItrT put(OutItrT next, std::ios_base & a_ios, char_type fill_char, 
             const date_type & d) const;
            29. 
-
          29. OutItrT put(OutItrT next, std::ios_base & a_ios, char_type fill_char, 
+
          30. OutItrT put(OutItrT next, std::ios_base & a_ios, char_type fill_char, 
             const duration_type & dd) const;
            31. 
-
          31. OutItrT put(OutItrT next, std::ios_base & a_ios, char_type fill_char, 
+
          32. OutItrT put(OutItrT next, std::ios_base & a_ios, char_type fill_char, 
             const month_type & m) const;
            33. 
 
          33. 
-
            OutItrT put(OutItrT next, std::ios_base & a_ios, char_type fill_char, 
+
            OutItrT put(OutItrT next, std::ios_base & a_ios, char_type fill_char, 
             const day_type & day) const;
            puts the day of month 
            34. 
-
          34. OutItrT put(OutItrT next, std::ios_base & a_ios, char_type fill_char, 
+
          35. OutItrT put(OutItrT next, std::ios_base & a_ios, char_type fill_char, 
             const day_of_week_type & dow) const;
            36. 
-
          36. OutItrT put(OutItrT next, std::ios_base & a_ios, char_type fill_char, 
+
          37. OutItrT put(OutItrT next, std::ios_base & a_ios, char_type fill_char, 
             const period_type & p) const;
            38. 
-
          38. OutItrT put(OutItrT next, std::ios_base & a_ios, char_type fill_char, 
+
          39. OutItrT put(OutItrT next, std::ios_base & a_ios, char_type fill_char, 
             const partial_date_type & pd) const;
            40. 
-
          40. OutItrT put(OutItrT next, std::ios_base & a_ios, char_type fill_char, 
+
          41. OutItrT put(OutItrT next, std::ios_base & a_ios, char_type fill_char, 
             const nth_kday_type & nkd) const;
            42. 
-
          42. OutItrT put(OutItrT next, std::ios_base & a_ios, char_type fill_char, 
+
          43. OutItrT put(OutItrT next, std::ios_base & a_ios, char_type fill_char, 
             const first_kday_type & fkd) const;
            44. 
-
          44. OutItrT put(OutItrT next, std::ios_base & a_ios, char_type fill_char, 
+
          45. OutItrT put(OutItrT next, std::ios_base & a_ios, char_type fill_char, 
             const last_kday_type & lkd) const;
            46. 
-
          46. OutItrT put(OutItrT next, std::ios_base & a_ios, char_type fill_char, 
+
          47. OutItrT put(OutItrT next, std::ios_base & a_ios, char_type fill_char, 
             const kday_before_type & fkb) const;
            48. 
-
          48. OutItrT put(OutItrT next, std::ios_base & a_ios, char_type fill_char, 
+
          49. OutItrT put(OutItrT next, std::ios_base & a_ios, char_type fill_char, 
             const kday_after_type & fka) const;
            50.
          -

          -date_facet protected member functions

          +

          +date_facet protected member functions

          1. virtual OutItrT 
-do_put_special(OutItrT next, std::ios_base &, char_type, 
+do_put_special(OutItrT next, std::ios_base &, char_type, 
                const boost::date_time::special_values sv) const;
          2. virtual OutItrT 
-do_put_tm(OutItrT next, std::ios_base & a_ios, char_type fill_char, 
+do_put_tm(OutItrT next, std::ios_base & a_ios, char_type fill_char, 
           const tm & tm_value, string_type a_format) const;
          diff --git a/doc/html/boost/date_time/date_formatter.html b/doc/html/boost/date_time/date_formatter.html index 409b0d6fd7..85ebced4b4 100644 --- a/doc/html/boost/date_time/date_formatter.html +++ b/doc/html/boost/date_time/date_formatter.html @@ -36,20 +36,20 @@ class date_formatter { public: - // public static functions - static std::string date_to_string(date_type); - static string_type date_to_string(date_type); + // public static functions + static std::string date_to_string(date_type); + static string_type date_to_string(date_type); };
        -

        Description

        +

        Description

        -

        -date_formatter public static functions

        +

        +date_formatter public static functions

        1. -
          static std::string date_to_string(date_type d);
          Convert to a date to standard string using format policies.
          2. +
          static std::string date_to_string(date_type d);
          Convert to a date to standard string using format policies.
        2. -
          static string_type date_to_string(date_type d);
          Convert to a date to standard string using format policies.
          3. +
          static string_type date_to_string(date_type d);
          Convert to a date to standard string using format policies.
        diff --git a/doc/html/boost/date_time/date_generator_formatter.html b/doc/html/boost/date_time/date_generator_formatter.html index aa55dc4a38..a2eceec81d 100644 --- a/doc/html/boost/date_time/date_generator_formatter.html +++ b/doc/html/boost/date_time/date_generator_formatter.html @@ -51,36 +51,36 @@ before, after, of, number_of_phrase_elements }; // construct/copy/destruct - date_generator_formatter(); - date_generator_formatter(const string_type &, const string_type &, + date_generator_formatter(); + date_generator_formatter(const string_type &, const string_type &, const string_type &, const string_type &, const string_type &, const string_type &, const string_type &, const string_type &, const string_type &); - // public member functions - void elements(const collection_type &, phrase_elements = first); + // public member functions + void elements(const collection_type &, phrase_elements = first); template<typename facet_type> - OutItrT put_partial_date(OutItrT, std::ios_base &, CharT, + OutItrT put_partial_date(OutItrT, std::ios_base &, CharT, const partial_date_type &, const facet_type &) const; template<typename facet_type> - OutItrT put_nth_kday(OutItrT, std::ios_base &, CharT, + OutItrT put_nth_kday(OutItrT, std::ios_base &, CharT, const nth_kday_type &, const facet_type &) const; template<typename facet_type> - OutItrT put_first_kday(OutItrT, std::ios_base &, CharT, + OutItrT put_first_kday(OutItrT, std::ios_base &, CharT, const first_kday_type &, const facet_type &) const; template<typename facet_type> - OutItrT put_last_kday(OutItrT, std::ios_base &, CharT, + OutItrT put_last_kday(OutItrT, std::ios_base &, CharT, const last_kday_type &, const facet_type &) const; template<typename facet_type> - OutItrT put_kday_before(OutItrT, std::ios_base &, CharT, + OutItrT put_kday_before(OutItrT, std::ios_base &, CharT, const kday_before_type &, const facet_type &) const; template<typename facet_type> - OutItrT put_kday_after(OutItrT, std::ios_base &, CharT, + OutItrT put_kday_after(OutItrT, std::ios_base &, CharT, const kday_after_type &, const facet_type &) const; - // private member functions - OutItrT put_string(OutItrT, const string_type &) const; + // private member functions + OutItrT put_string(OutItrT, const string_type &) const; // public data members static const char_type first_string; @@ -94,7 +94,7 @@ static const char_type of_string; };
        -

        Description

        +

        Description

        Formatting of date_generators follows specific orders for the various types of date_generators.

        • partial_date => "dd Month"

          • @@ -107,15 +107,15 @@

          -

          +

          date_generator_formatter public construct/copy/destruct

          1. -
            date_generator_formatter();
            Default format elements used.
            2. +
            date_generator_formatter();
            Default format elements used.
          2. -
            date_generator_formatter(const string_type & first_str, 
+
            date_generator_formatter(const string_type & first_str, 
                          const string_type & second_str, 
                          const string_type & third_str, 
                          const string_type & fourth_str, 
@@ -127,11 +127,11 @@
          -

          -date_generator_formatter public member functions

          +

          +date_generator_formatter public member functions

          1. -
            void elements(const collection_type & new_strings, 
+
            void elements(const collection_type & new_strings, 
               phrase_elements beg_pos = first);
            Replace the set of phrase elements with those contained in new_strings. 
            The order of the strings in the given collection is important. They must follow:
            
 
            • first, second, third, fourth, fifth, last, before, after, of.
            
 
            
@@ -144,39 +144,39 @@
 
          2. template<typename facet_type> 
-  OutItrT put_partial_date(OutItrT next, std::ios_base & a_ios, CharT a_fill, 
+  OutItrT put_partial_date(OutItrT next, std::ios_base & a_ios, CharT a_fill, 
                            const partial_date_type & pd, 
                            const facet_type & facet) const;
            Put a partial_date => "dd Month". 
          3. template<typename facet_type> 
-  OutItrT put_nth_kday(OutItrT next, std::ios_base & a_ios, CharT a_fill, 
+  OutItrT put_nth_kday(OutItrT next, std::ios_base & a_ios, CharT a_fill, 
                        const nth_kday_type & nkd, const facet_type & facet) const;
            Put an nth_day_of_the_week_in_month => "nth weekday of month". 
          4. template<typename facet_type> 
-  OutItrT put_first_kday(OutItrT next, std::ios_base & a_ios, CharT a_fill, 
+  OutItrT put_first_kday(OutItrT next, std::ios_base & a_ios, CharT a_fill, 
                          const first_kday_type & fkd, 
                          const facet_type & facet) const;
            Put a first_day_of_the_week_in_month => "first weekday of month". 
          5. template<typename facet_type> 
-  OutItrT put_last_kday(OutItrT next, std::ios_base & a_ios, CharT a_fill, 
+  OutItrT put_last_kday(OutItrT next, std::ios_base & a_ios, CharT a_fill, 
                         const last_kday_type & lkd, const facet_type & facet) const;
            Put a last_day_of_the_week_in_month => "last weekday of month". 
          6. template<typename facet_type> 
-  OutItrT put_kday_before(OutItrT next, std::ios_base & a_ios, CharT a_fill, 
+  OutItrT put_kday_before(OutItrT next, std::ios_base & a_ios, CharT a_fill, 
                           const kday_before_type & fkb, 
                           const facet_type & facet) const;
            Put a first_day_of_the_week_before => "weekday before". 
          7. template<typename facet_type> 
-  OutItrT put_kday_after(OutItrT next, std::ios_base & a_ios, CharT a_fill, 
+  OutItrT put_kday_after(OutItrT next, std::ios_base & a_ios, CharT a_fill, 
                          const kday_after_type & fka, 
                          const facet_type & facet) const;
            Put a first_day_of_the_week_after => "weekday after".
          -

          -date_generator_formatter private member functions

          +

          +date_generator_formatter private member functions

          1. -
            OutItrT put_string(OutItrT next, const string_type & str) const;
            helper function to put the various member string into stream
          +
          OutItrT put_string(OutItrT next, const string_type & str) const;
          helper function to put the various member string into stream
        diff --git a/doc/html/boost/date_time/date_generator_parser.html b/doc/html/boost/date_time/date_generator_parser.html index 961ef8cbca..1dd6a03047 100644 --- a/doc/html/boost/date_time/date_generator_parser.html +++ b/doc/html/boost/date_time/date_generator_parser.html @@ -56,47 +56,47 @@ before, after, of, number_of_phrase_elements }; // construct/copy/destruct - date_generator_parser(); - date_generator_parser(const string_type &, const string_type &, + date_generator_parser(); + date_generator_parser(const string_type &, const string_type &, const string_type &, const string_type &, const string_type &, const string_type &, const string_type &, const string_type &, const string_type &); - // public member functions - void element_strings(const string_type &, const string_type &, + // public member functions + void element_strings(const string_type &, const string_type &, const string_type &, const string_type &, const string_type &, const string_type &, const string_type &, const string_type &, const string_type &); - void element_strings(const collection_type &); + void element_strings(const collection_type &); template<typename facet_type> partial_date_type - get_partial_date_type(stream_itr_type &, stream_itr_type &, + get_partial_date_type(stream_itr_type &, stream_itr_type &, std::ios_base &, const facet_type &) const; template<typename facet_type> nth_kday_type - get_nth_kday_type(stream_itr_type &, stream_itr_type &, std::ios_base &, + get_nth_kday_type(stream_itr_type &, stream_itr_type &, std::ios_base &, const facet_type &) const; template<typename facet_type> first_kday_type - get_first_kday_type(stream_itr_type &, stream_itr_type &, std::ios_base &, + get_first_kday_type(stream_itr_type &, stream_itr_type &, std::ios_base &, const facet_type &) const; template<typename facet_type> last_kday_type - get_last_kday_type(stream_itr_type &, stream_itr_type &, std::ios_base &, + get_last_kday_type(stream_itr_type &, stream_itr_type &, std::ios_base &, const facet_type &) const; template<typename facet_type> kday_before_type - get_kday_before_type(stream_itr_type &, stream_itr_type &, + get_kday_before_type(stream_itr_type &, stream_itr_type &, std::ios_base &, const facet_type &) const; template<typename facet_type> kday_after_type - get_kday_after_type(stream_itr_type &, stream_itr_type &, std::ios_base &, + get_kday_after_type(stream_itr_type &, stream_itr_type &, std::ios_base &, const facet_type &) const; - // private member functions - void extract_element(stream_itr_type &, stream_itr_type &, + // private member functions + void extract_element(stream_itr_type &, stream_itr_type &, typename date_generator_parser::phrase_elements) const; // public data members @@ -111,7 +111,7 @@ static const char_type of_string; };
        -

        Description

        +

        Description

        The elements of a date_generator "phrase" are parsed from the input stream in a particular order. All elements are required and the order in which they appear cannot change, however, the elements themselves can be changed. The default elements and their order are as follows:

        • partial_date => "dd Month"

          • @@ -125,15 +125,15 @@

          Weekday and Month names and formats are handled via the date_input_facet.

          -

          +

          date_generator_parser public construct/copy/destruct

          1. -
            date_generator_parser();
            Creates a date_generator_parser with the default set of "element_strings".
            2. +
            date_generator_parser();
            Creates a date_generator_parser with the default set of "element_strings".
          2. -
            date_generator_parser(const string_type & first_str, 
+
            date_generator_parser(const string_type & first_str, 
                       const string_type & second_str, 
                       const string_type & third_str, 
                       const string_type & fourth_str, 
@@ -145,11 +145,11 @@
          -

          -date_generator_parser public member functions

          +

          +date_generator_parser public member functions

          1. -
            void element_strings(const string_type & first_str, 
+
            void element_strings(const string_type & first_str, 
                      const string_type & second_str, 
                      const string_type & third_str, 
                      const string_type & fourth_str, 
@@ -158,44 +158,44 @@
                      const string_type & before_str, 
                      const string_type & after_str, 
                      const string_type & of_str);
            Replace strings that determine nth week for generator.
            2. -
          2. void element_strings(const collection_type & col);
            3. +
          3. void element_strings(const collection_type & col);
          4. template<typename facet_type> 
   partial_date_type 
-  get_partial_date_type(stream_itr_type & sitr, stream_itr_type & stream_end, 
+  get_partial_date_type(stream_itr_type & sitr, stream_itr_type & stream_end, 
                         std::ios_base & a_ios, const facet_type & facet) const;
            returns partial_date parsed from stream 
          5. template<typename facet_type> 
   nth_kday_type 
-  get_nth_kday_type(stream_itr_type & sitr, stream_itr_type & stream_end, 
+  get_nth_kday_type(stream_itr_type & sitr, stream_itr_type & stream_end, 
                     std::ios_base & a_ios, const facet_type & facet) const;
            returns nth_kday_of_week parsed from stream 
          6. template<typename facet_type> 
   first_kday_type 
-  get_first_kday_type(stream_itr_type & sitr, stream_itr_type & stream_end, 
+  get_first_kday_type(stream_itr_type & sitr, stream_itr_type & stream_end, 
                       std::ios_base & a_ios, const facet_type & facet) const;
            returns first_kday_of_week parsed from stream 
          7. template<typename facet_type> 
   last_kday_type 
-  get_last_kday_type(stream_itr_type & sitr, stream_itr_type & stream_end, 
+  get_last_kday_type(stream_itr_type & sitr, stream_itr_type & stream_end, 
                      std::ios_base & a_ios, const facet_type & facet) const;
            returns last_kday_of_week parsed from stream 
          8. template<typename facet_type> 
   kday_before_type 
-  get_kday_before_type(stream_itr_type & sitr, stream_itr_type & stream_end, 
+  get_kday_before_type(stream_itr_type & sitr, stream_itr_type & stream_end, 
                        std::ios_base & a_ios, const facet_type & facet) const;
            returns first_kday_of_week parsed from stream 
          9. template<typename facet_type> 
   kday_after_type 
-  get_kday_after_type(stream_itr_type & sitr, stream_itr_type & stream_end, 
+  get_kday_after_type(stream_itr_type & sitr, stream_itr_type & stream_end, 
                       std::ios_base & a_ios, const facet_type & facet) const;
            returns first_kday_of_week parsed from stream
          -

          -date_generator_parser private member functions

          +

          +date_generator_parser private member functions

          1. -
            void extract_element(stream_itr_type & sitr, stream_itr_type & stream_end, 
+
            void extract_element(stream_itr_type & sitr, stream_itr_type & stream_end, 
                      typename date_generator_parser::phrase_elements ele) const;
            Extracts phrase element from input. Throws ios_base::failure on error.
        diff --git a/doc/html/boost/date_time/date_input_facet.html b/doc/html/boost/date_time/date_input_facet.html index 56295d4686..4aef340846 100644 --- a/doc/html/boost/date_time/date_input_facet.html +++ b/doc/html/boost/date_time/date_input_facet.html @@ -58,46 +58,46 @@ typedef first_kday_before< date_type > kday_before_type; // construct/copy/destruct - explicit date_input_facet(::size_t = 0); - explicit date_input_facet(const string_type &, ::size_t = 0); - explicit date_input_facet(const string_type &, + explicit date_input_facet(::size_t = 0); + explicit date_input_facet(const string_type &, ::size_t = 0); + explicit date_input_facet(const string_type &, const format_date_parser_type &, const special_values_parser_type &, const period_parser_type &, const date_gen_parser_type &, ::size_t = 0); - // public member functions - void format(const char_type *const); - virtual void set_iso_format(); - virtual void set_iso_extended_format(); - void month_format(const char_type *const); - void weekday_format(const char_type *const); - void year_format(const char_type *const); - void period_parser(period_parser_type); - void short_weekday_names(const input_collection_type &); - void long_weekday_names(const input_collection_type &); - void short_month_names(const input_collection_type &); - void long_month_names(const input_collection_type &); - void date_gen_element_strings(const input_collection_type &); - void date_gen_element_strings(const string_type &, const string_type &, + // public member functions + void format(const char_type *const); + virtual void set_iso_format(); + virtual void set_iso_extended_format(); + void month_format(const char_type *const); + void weekday_format(const char_type *const); + void year_format(const char_type *const); + void period_parser(period_parser_type); + void short_weekday_names(const input_collection_type &); + void long_weekday_names(const input_collection_type &); + void short_month_names(const input_collection_type &); + void long_month_names(const input_collection_type &); + void date_gen_element_strings(const input_collection_type &); + void date_gen_element_strings(const string_type &, const string_type &, const string_type &, const string_type &, const string_type &, const string_type &, const string_type &, const string_type &, const string_type &); - void special_values_parser(special_values_parser_type); - InItrT get(InItrT &, InItrT &, std::ios_base &, date_type &) const; - InItrT get(InItrT &, InItrT &, std::ios_base &, month_type &) const; - InItrT get(InItrT &, InItrT &, std::ios_base &, day_of_week_type &) const; - InItrT get(InItrT &, InItrT &, std::ios_base &, day_type &) const; - InItrT get(InItrT &, InItrT &, std::ios_base &, year_type &) const; - InItrT get(InItrT &, InItrT &, std::ios_base &, duration_type &) const; - InItrT get(InItrT &, InItrT &, std::ios_base &, period_type &) const; - InItrT get(InItrT &, InItrT &, std::ios_base &, nth_kday_type &) const; - InItrT get(InItrT &, InItrT &, std::ios_base &, partial_date_type &) const; - InItrT get(InItrT &, InItrT &, std::ios_base &, first_kday_type &) const; - InItrT get(InItrT &, InItrT &, std::ios_base &, last_kday_type &) const; - InItrT get(InItrT &, InItrT &, std::ios_base &, kday_before_type &) const; - InItrT get(InItrT &, InItrT &, std::ios_base &, kday_after_type &) const; + void special_values_parser(special_values_parser_type); + InItrT get(InItrT &, InItrT &, std::ios_base &, date_type &) const; + InItrT get(InItrT &, InItrT &, std::ios_base &, month_type &) const; + InItrT get(InItrT &, InItrT &, std::ios_base &, day_of_week_type &) const; + InItrT get(InItrT &, InItrT &, std::ios_base &, day_type &) const; + InItrT get(InItrT &, InItrT &, std::ios_base &, year_type &) const; + InItrT get(InItrT &, InItrT &, std::ios_base &, duration_type &) const; + InItrT get(InItrT &, InItrT &, std::ios_base &, period_type &) const; + InItrT get(InItrT &, InItrT &, std::ios_base &, nth_kday_type &) const; + InItrT get(InItrT &, InItrT &, std::ios_base &, partial_date_type &) const; + InItrT get(InItrT &, InItrT &, std::ios_base &, first_kday_type &) const; + InItrT get(InItrT &, InItrT &, std::ios_base &, last_kday_type &) const; + InItrT get(InItrT &, InItrT &, std::ios_base &, kday_before_type &) const; + InItrT get(InItrT &, InItrT &, std::ios_base &, kday_after_type &) const; // public data members static const char_type long_weekday_format; @@ -114,16 +114,16 @@ static std::locale::id id; };
        -

        Description

        +

        Description

        -

        +

        date_input_facet public construct/copy/destruct

          -
        1. explicit date_input_facet(::size_t a_ref = 0);
          2. -
        2. explicit date_input_facet(const string_type & format_str, ::size_t a_ref = 0);
          3. -
        3. explicit date_input_facet(const string_type & format_str, 
+
        4. explicit date_input_facet(::size_t a_ref = 0);
          5. 
+
        5. explicit date_input_facet(const string_type & format_str, ::size_t a_ref = 0);
          6. 
+
        6. explicit date_input_facet(const string_type & format_str, 
                           const format_date_parser_type & date_parser, 
                           const special_values_parser_type & sv_parser, 
                           const period_parser_type & per_parser, 
@@ -132,22 +132,22 @@
        -

        -date_input_facet public member functions

        +

        +date_input_facet public member functions

          -
        1. void format(const char_type *const format_str);
          2. -
        2. virtual void set_iso_format();
          3. -
        3. virtual void set_iso_extended_format();
          4. -
        4. void month_format(const char_type *const format_str);
          5. -
        5. void weekday_format(const char_type *const format_str);
          6. -
        6. void year_format(const char_type *const format_str);
          7. -
        7. void period_parser(period_parser_type per_parser);
          8. -
        8. void short_weekday_names(const input_collection_type & weekday_names);
          9. -
        9. void long_weekday_names(const input_collection_type & weekday_names);
          10. -
        10. void short_month_names(const input_collection_type & month_names);
          11. -
        11. void long_month_names(const input_collection_type & month_names);
          12. -
        12. void date_gen_element_strings(const input_collection_type & col);
          13. -
        13. void date_gen_element_strings(const string_type & first, 
+
        14. void format(const char_type *const format_str);
          15. 
+
        15. virtual void set_iso_format();
          16. 
+
        16. virtual void set_iso_extended_format();
          17. 
+
        17. void month_format(const char_type *const format_str);
          18. 
+
        18. void weekday_format(const char_type *const format_str);
          19. 
+
        19. void year_format(const char_type *const format_str);
          20. 
+
        20. void period_parser(period_parser_type per_parser);
          21. 
+
        21. void short_weekday_names(const input_collection_type & weekday_names);
          22. 
+
        22. void long_weekday_names(const input_collection_type & weekday_names);
          23. 
+
        23. void short_month_names(const input_collection_type & month_names);
          24. 
+
        24. void long_month_names(const input_collection_type & month_names);
          25. 
+
        25. void date_gen_element_strings(const input_collection_type & col);
          26. 
+
        26. void date_gen_element_strings(const string_type & first, 
                               const string_type & second, 
                               const string_type & third, 
                               const string_type & fourth, 
@@ -156,27 +156,27 @@
                               const string_type & before, 
                               const string_type & after, 
                               const string_type & of);
          27. 
-
        27. void special_values_parser(special_values_parser_type sv_parser);
          28. 
-
        28. InItrT get(InItrT & from, InItrT & to, std::ios_base &, date_type & d) const;
          29. 
-
        29. InItrT get(InItrT & from, InItrT & to, std::ios_base &, month_type & m) const;
          30. 
-
        30. InItrT get(InItrT & from, InItrT & to, std::ios_base &, day_of_week_type & wd) const;
          31. 
+
        31. void special_values_parser(special_values_parser_type sv_parser);
          32. 
+
        32. InItrT get(InItrT & from, InItrT & to, std::ios_base &, date_type & d) const;
          33. 
+
        33. InItrT get(InItrT & from, InItrT & to, std::ios_base &, month_type & m) const;
          34. 
+
        34. InItrT get(InItrT & from, InItrT & to, std::ios_base &, day_of_week_type & wd) const;
          35. 
 
        35. 
-
          InItrT get(InItrT & from, InItrT & to, std::ios_base &, day_type & d) const;
          Expects 1 or 2 digit day range: 1-31. 
          36. 
-
        36. InItrT get(InItrT & from, InItrT & to, std::ios_base &, year_type & y) const;
          37. 
-
        37. InItrT get(InItrT & from, InItrT & to, std::ios_base & a_ios, 
+
          InItrT get(InItrT & from, InItrT & to, std::ios_base &, day_type & d) const;
          Expects 1 or 2 digit day range: 1-31. 
          38. 
+
        38. InItrT get(InItrT & from, InItrT & to, std::ios_base &, year_type & y) const;
          39. 
+
        39. InItrT get(InItrT & from, InItrT & to, std::ios_base & a_ios, 
            duration_type & dd) const;
          40. 
-
        40. InItrT get(InItrT & from, InItrT & to, std::ios_base & a_ios, period_type & p) const;
          41. 
-
        41. InItrT get(InItrT & from, InItrT & to, std::ios_base & a_ios, 
+
        42. InItrT get(InItrT & from, InItrT & to, std::ios_base & a_ios, period_type & p) const;
          43. 
+
        43. InItrT get(InItrT & from, InItrT & to, std::ios_base & a_ios, 
            nth_kday_type & nkd) const;
          44. 
-
        44. InItrT get(InItrT & from, InItrT & to, std::ios_base & a_ios, 
+
        45. InItrT get(InItrT & from, InItrT & to, std::ios_base & a_ios, 
            partial_date_type & pd) const;
          46. 
-
        46. InItrT get(InItrT & from, InItrT & to, std::ios_base & a_ios, 
+
        47. InItrT get(InItrT & from, InItrT & to, std::ios_base & a_ios, 
            first_kday_type & fkd) const;
          48. 
-
        48. InItrT get(InItrT & from, InItrT & to, std::ios_base & a_ios, 
+
        49. InItrT get(InItrT & from, InItrT & to, std::ios_base & a_ios, 
            last_kday_type & lkd) const;
          50. 
-
        50. InItrT get(InItrT & from, InItrT & to, std::ios_base & a_ios, 
+
        51. InItrT get(InItrT & from, InItrT & to, std::ios_base & a_ios, 
            kday_before_type & fkb) const;
          52. 
-
        52. InItrT get(InItrT & from, InItrT & to, std::ios_base & a_ios, 
+
        53. InItrT get(InItrT & from, InItrT & to, std::ios_base & a_ios, 
            kday_after_type & fka) const;
          54.
        diff --git a/doc/html/boost/date_time/date_itr.html b/doc/html/boost/date_time/date_itr.html index 040e1b5248..96ac5c85fc 100644 --- a/doc/html/boost/date_time/date_itr.html +++ b/doc/html/boost/date_time/date_itr.html @@ -39,27 +39,27 @@ typedef date_type::duration_type duration_type; // construct/copy/destruct - date_itr(date_type, int = 1); + date_itr(date_type, int = 1); - // private member functions - virtual duration_type get_offset(const date_type &) const; - virtual duration_type get_neg_offset(const date_type &) const; + // private member functions + virtual duration_type get_offset(const date_type &) const; + virtual duration_type get_neg_offset(const date_type &) const; };
        -

        Description

        +

        Description

        -

        +

        date_itr public construct/copy/destruct

        -
        1. date_itr(date_type d, int factor = 1);
        +
        1. date_itr(date_type d, int factor = 1);
        -

        -date_itr private member functions

        +

        +date_itr private member functions

          -
        1. virtual duration_type get_offset(const date_type & current) const;
          2. -
        2. virtual duration_type get_neg_offset(const date_type & current) const;
          3. +
        3. virtual duration_type get_offset(const date_type & current) const;
          4. +
        4. virtual duration_type get_neg_offset(const date_type & current) const;
        diff --git a/doc/html/boost/date_time/date_itr_base.html b/doc/html/boost/date_time/date_itr_base.html index b83e93ae21..c08f6b8673 100644 --- a/doc/html/boost/date_time/date_itr_base.html +++ b/doc/html/boost/date_time/date_itr_base.html @@ -41,55 +41,55 @@ typedef std::input_iterator_tag iterator_category; // construct/copy/destruct - date_itr_base(date_type); - ~date_itr_base(); + date_itr_base(date_type); + ~date_itr_base(); - // public member functions - date_itr_base & operator++(); - date_itr_base & operator--(); - virtual duration_type get_offset(const date_type &) const = 0; - virtual duration_type get_neg_offset(const date_type &) const = 0; - date_type operator*(); - date_type * operator->(); - bool operator<(const date_type &); - bool operator<=(const date_type &); - bool operator>(const date_type &); - bool operator>=(const date_type &); - bool operator==(const date_type &); - bool operator!=(const date_type &); + // public member functions + date_itr_base & operator++(); + date_itr_base & operator--(); + virtual duration_type get_offset(const date_type &) const = 0; + virtual duration_type get_neg_offset(const date_type &) const = 0; + date_type operator*(); + date_type * operator->(); + bool operator<(const date_type &); + bool operator<=(const date_type &); + bool operator>(const date_type &); + bool operator>=(const date_type &); + bool operator==(const date_type &); + bool operator!=(const date_type &); };
        -

        Description

        +

        Description

        This class provides the skeleton for the creation of iterators. New and interesting interators can be created by plugging in a new function that derives the next value from the current state. generation of various types of -based information.

        Template Parameters

        date_type

        The date_type is a concrete date_type. The date_type must define a duration_type and a calendar_type.

        -

        +

        date_itr_base public construct/copy/destruct

          -
        1. date_itr_base(date_type d);
          2. -
        2. ~date_itr_base();
          3. +
        3. date_itr_base(date_type d);
          4. +
        4. ~date_itr_base();
        -

        -date_itr_base public member functions

        +

        +date_itr_base public member functions

          -
        1. date_itr_base & operator++();
          2. -
        2. date_itr_base & operator--();
          3. -
        3. virtual duration_type get_offset(const date_type & current) const = 0;
          4. -
        4. virtual duration_type get_neg_offset(const date_type & current) const = 0;
          5. -
        5. date_type operator*();
          6. -
        6. date_type * operator->();
          7. -
        7. bool operator<(const date_type & d);
          8. -
        8. bool operator<=(const date_type & d);
          9. -
        9. bool operator>(const date_type & d);
          10. -
        10. bool operator>=(const date_type & d);
          11. -
        11. bool operator==(const date_type & d);
          12. -
        12. bool operator!=(const date_type & d);
          13. +
        13. date_itr_base & operator++();
          14. +
        14. date_itr_base & operator--();
          15. +
        15. virtual duration_type get_offset(const date_type & current) const = 0;
          16. +
        16. virtual duration_type get_neg_offset(const date_type & current) const = 0;
          17. +
        17. date_type operator*();
          18. +
        18. date_type * operator->();
          19. +
        19. bool operator<(const date_type & d);
          20. +
        20. bool operator<=(const date_type & d);
          21. +
        21. bool operator>(const date_type & d);
          22. +
        22. bool operator>=(const date_type & d);
          23. +
        23. bool operator==(const date_type & d);
          24. +
        24. bool operator!=(const date_type & d);
        diff --git a/doc/html/boost/date_time/date_names_put.html b/doc/html/boost/date_time/date_names_put.html index a4ed06a4b8..aa3c2c3542 100644 --- a/doc/html/boost/date_time/date_names_put.html +++ b/doc/html/boost/date_time/date_names_put.html @@ -46,36 +46,36 @@ typedef charT char_type; // construct/copy/destruct - date_names_put(); + date_names_put(); - // public member functions - std::locale::id & __get_id(void) const; - void put_special_value(iter_type &, special_value_enum) const; - void put_month_short(iter_type &, month_enum) const; - void put_month_long(iter_type &, month_enum) const; - void put_weekday_short(iter_type &, weekday_enum) const; - void put_weekday_long(iter_type &, weekday_enum) const; - bool has_date_sep_chars() const; - void year_sep_char(iter_type &) const; - void month_sep_char(iter_type &) const; - void day_sep_char(iter_type &) const; - ymd_order_spec date_order() const; - month_format_spec month_format() const; + // public member functions + std::locale::id & __get_id(void) const; + void put_special_value(iter_type &, special_value_enum) const; + void put_month_short(iter_type &, month_enum) const; + void put_month_long(iter_type &, month_enum) const; + void put_weekday_short(iter_type &, weekday_enum) const; + void put_weekday_long(iter_type &, weekday_enum) const; + bool has_date_sep_chars() const; + void year_sep_char(iter_type &) const; + void month_sep_char(iter_type &) const; + void day_sep_char(iter_type &) const; + ymd_order_spec date_order() const; + month_format_spec month_format() const; - // protected member functions - virtual void do_put_month_short(iter_type &, month_enum) const; - virtual void do_put_month_long(iter_type &, month_enum) const; - virtual void do_put_special_value(iter_type &, special_value_enum) const; - virtual void do_put_weekday_short(iter_type &, weekday_enum) const; - virtual void do_put_weekday_long(iter_type &, weekday_enum) const; - virtual bool do_has_date_sep_chars() const; - virtual void do_year_sep_char(iter_type &) const; - virtual void do_month_sep_char(iter_type &) const; - virtual void do_day_sep_char(iter_type &) const; - virtual ymd_order_spec do_date_order() const; - virtual month_format_spec do_month_format() const; - void put_string(iter_type &, const charT *const) const; - void put_string(iter_type &, const string_type &) const; + // protected member functions + virtual void do_put_month_short(iter_type &, month_enum) const; + virtual void do_put_month_long(iter_type &, month_enum) const; + virtual void do_put_special_value(iter_type &, special_value_enum) const; + virtual void do_put_weekday_short(iter_type &, weekday_enum) const; + virtual void do_put_weekday_long(iter_type &, weekday_enum) const; + virtual bool do_has_date_sep_chars() const; + virtual void do_year_sep_char(iter_type &) const; + virtual void do_month_sep_char(iter_type &) const; + virtual void do_day_sep_char(iter_type &) const; + virtual ymd_order_spec do_date_order() const; + virtual month_format_spec do_month_format() const; + void put_string(iter_type &, const charT *const) const; + void put_string(iter_type &, const string_type &) const; // public data members static const char_type default_special_value_names; @@ -83,7 +83,7 @@ static std::locale::id id; // Generate storage location for a std::locale::id. };
        -

        Description

        +

        Description

        This class is a base class for date facets used to localize the names of months and the names of days in the week.

        Requirements of Config

          @@ -94,59 +94,59 @@

          (see langer & kreft p334).

          -

          +

          date_names_put public construct/copy/destruct

          -
          1. date_names_put();
          +
          1. date_names_put();
          -

          -date_names_put public member functions

          +

          +date_names_put public member functions

            -
          1. std::locale::id & __get_id(void) const;
            2. -
          2. void put_special_value(iter_type & oitr, special_value_enum sv) const;
            3. -
          3. void put_month_short(iter_type & oitr, month_enum moy) const;
            4. -
          4. void put_month_long(iter_type & oitr, month_enum moy) const;
            5. -
          5. void put_weekday_short(iter_type & oitr, weekday_enum wd) const;
            6. -
          6. void put_weekday_long(iter_type & oitr, weekday_enum wd) const;
            7. -
          7. bool has_date_sep_chars() const;
            8. -
          8. void year_sep_char(iter_type & oitr) const;
            9. +
          9. std::locale::id & __get_id(void) const;
            10. +
          10. void put_special_value(iter_type & oitr, special_value_enum sv) const;
            11. +
          11. void put_month_short(iter_type & oitr, month_enum moy) const;
            12. +
          12. void put_month_long(iter_type & oitr, month_enum moy) const;
            13. +
          13. void put_weekday_short(iter_type & oitr, weekday_enum wd) const;
            14. +
          14. void put_weekday_long(iter_type & oitr, weekday_enum wd) const;
            15. +
          15. bool has_date_sep_chars() const;
            16. +
          16. void year_sep_char(iter_type & oitr) const;
          17. -
            void month_sep_char(iter_type & oitr) const;
            char between year-month
            18. +
            void month_sep_char(iter_type & oitr) const;
            char between year-month
          18. -
            void day_sep_char(iter_type & oitr) const;
            Char to separate month-day.
            19. +
            void day_sep_char(iter_type & oitr) const;
            Char to separate month-day.
          19. -
            ymd_order_spec date_order() const;
            Determines the order to put the date elements.
            20. +
            ymd_order_spec date_order() const;
            Determines the order to put the date elements.
          20. -
            month_format_spec month_format() const;
            Determines if month is displayed as integer, short or long string.
            21. +
            month_format_spec month_format() const;
            Determines if month is displayed as integer, short or long string.
          -

          -date_names_put protected member functions

          +

          +date_names_put protected member functions

          1. -
            virtual void do_put_month_short(iter_type & oitr, month_enum moy) const;
            Default facet implementation uses month_type defaults.
            2. +
            virtual void do_put_month_short(iter_type & oitr, month_enum moy) const;
            Default facet implementation uses month_type defaults.
          2. -
            virtual void do_put_month_long(iter_type & oitr, month_enum moy) const;
            Default facet implementation uses month_type defaults.
            3. +
            virtual void do_put_month_long(iter_type & oitr, month_enum moy) const;
            Default facet implementation uses month_type defaults. 
          3. virtual void 
-do_put_special_value(iter_type & oitr, special_value_enum sv) const;
            Default facet implementation for special value types.
            4. -
          4. virtual void do_put_weekday_short(iter_type &, weekday_enum) const;
            5. -
          5. virtual void do_put_weekday_long(iter_type &, weekday_enum) const;
            6. -
          6. virtual bool do_has_date_sep_chars() const;
            7. -
          7. virtual void do_year_sep_char(iter_type & oitr) const;
            8. +do_put_special_value(iter_type & oitr, special_value_enum sv) const;Default facet implementation for special value types. +
          8. virtual void do_put_weekday_short(iter_type &, weekday_enum) const;
            9. +
          9. virtual void do_put_weekday_long(iter_type &, weekday_enum) const;
            10. +
          10. virtual bool do_has_date_sep_chars() const;
            11. +
          11. virtual void do_year_sep_char(iter_type & oitr) const;
          12. -
            virtual void do_month_sep_char(iter_type & oitr) const;
            char between year-month
            13. +
            virtual void do_month_sep_char(iter_type & oitr) const;
            char between year-month
          13. -
            virtual void do_day_sep_char(iter_type & oitr) const;
            Char to separate month-day.
            14. +
            virtual void do_day_sep_char(iter_type & oitr) const;
            Char to separate month-day.
          14. -
            virtual ymd_order_spec do_date_order() const;
            Default for date order.
            15. +
            virtual ymd_order_spec do_date_order() const;
            Default for date order.
          15. -
            virtual month_format_spec do_month_format() const;
            Default month format.
            16. -
          16. void put_string(iter_type & oi, const charT *const s) const;
            17. -
          17. void put_string(iter_type & oi, const string_type & s1) const;
            18. +
            virtual month_format_spec do_month_format() const;
            Default month format. +
          18. void put_string(iter_type & oi, const charT *const s) const;
            19. +
          19. void put_string(iter_type & oi, const string_type & s1) const;
        diff --git a/doc/html/boost/date_time/day_calc_dst_rule.html b/doc/html/boost/date_time/day_calc_dst_rule.html index 3b6476d169..10c64e981f 100644 --- a/doc/html/boost/date_time/day_calc_dst_rule.html +++ b/doc/html/boost/date_time/day_calc_dst_rule.html @@ -44,34 +44,34 @@ typedef spec::end_rule end_rule; // construct/copy/destruct - day_calc_dst_rule(start_rule, end_rule); + day_calc_dst_rule(start_rule, end_rule); - // public member functions - virtual date_type start_day(year_type) const; - virtual std::string start_rule_as_string() const; - virtual date_type end_day(year_type) const; - virtual std::string end_rule_as_string() const; + // public member functions + virtual date_type start_day(year_type) const; + virtual std::string start_rule_as_string() const; + virtual date_type end_day(year_type) const; + virtual std::string end_rule_as_string() const; };
        -

        Description

        +

        Description

        This class is used to generate specific sets of dst rules

        -

        +

        day_calc_dst_rule public construct/copy/destruct

        -
        1. day_calc_dst_rule(start_rule dst_start, end_rule dst_end);
        +
        1. day_calc_dst_rule(start_rule dst_start, end_rule dst_end);
        -

        -day_calc_dst_rule public member functions

        +

        +day_calc_dst_rule public member functions

          -
        1. virtual date_type start_day(year_type y) const;
          2. -
        2. virtual std::string start_rule_as_string() const;
          3. -
        3. virtual date_type end_day(year_type y) const;
          4. -
        4. virtual std::string end_rule_as_string() const;
          5. +
        5. virtual date_type start_day(year_type y) const;
          6. +
        6. virtual std::string start_rule_as_string() const;
          7. +
        7. virtual date_type end_day(year_type y) const;
          8. +
        8. virtual std::string end_rule_as_string() const;
        diff --git a/doc/html/boost/date_time/day_clock.html b/doc/html/boost/date_time/day_clock.html index 6783ff0ce1..a538103739 100644 --- a/doc/html/boost/date_time/day_clock.html +++ b/doc/html/boost/date_time/day_clock.html @@ -38,39 +38,39 @@ // types typedef date_type::ymd_type ymd_type; - // public static functions - static date_type local_day(); - static date_type::ymd_type local_day_ymd(); - static date_type::ymd_type universal_day_ymd(); - static date_type universal_day(); + // public static functions + static date_type local_day(); + static date_type::ymd_type local_day_ymd(); + static date_type::ymd_type universal_day_ymd(); + static date_type universal_day(); - // private static functions - static ::std::tm * get_local_time(std::tm &); - static ::std::tm * get_universal_time(std::tm &); + // private static functions + static ::std::tm * get_local_time(std::tm &); + static ::std::tm * get_universal_time(std::tm &); };
        -

        Description

        +

        Description

        This clock uses Posix interfaces as its implementation and hence uses the timezone settings of the operating system. Incorrect user settings will result in incorrect results for the calls to local_day.

        -

        -day_clock public static functions

        +

        +day_clock public static functions

        1. -
          static date_type local_day();
          Get the local day as a date type.
          2. +
          static date_type local_day();
          Get the local day as a date type.
        2. -
          static date_type::ymd_type local_day_ymd();
          Get the local day as a ymd_type.
          3. +
          static date_type::ymd_type local_day_ymd();
          Get the local day as a ymd_type.
        3. -
          static date_type::ymd_type universal_day_ymd();
          Get the current day in universal date as a ymd_type.
          4. +
          static date_type::ymd_type universal_day_ymd();
          Get the current day in universal date as a ymd_type.
        4. -
          static date_type universal_day();
          Get the UTC day as a date type.
          5. +
          static date_type universal_day();
          Get the UTC day as a date type.
        -

        -day_clock private static functions

        +

        +day_clock private static functions

          -
        1. static ::std::tm * get_local_time(std::tm & result);
          2. -
        2. static ::std::tm * get_universal_time(std::tm & result);
          3. +
        3. static ::std::tm * get_local_time(std::tm & result);
          4. +
        4. static ::std::tm * get_universal_time(std::tm & result);
        diff --git a/doc/html/boost/date_time/day_functor.html b/doc/html/boost/date_time/day_functor.html index 51411f629e..3d82abc1d3 100644 --- a/doc/html/boost/date_time/day_functor.html +++ b/doc/html/boost/date_time/day_functor.html @@ -39,27 +39,27 @@ typedef date_type::duration_type duration_type; // construct/copy/destruct - day_functor(int); + day_functor(int); - // public member functions - duration_type get_offset(const date_type &) const; - duration_type get_neg_offset(const date_type &) const; + // public member functions + duration_type get_offset(const date_type &) const; + duration_type get_neg_offset(const date_type &) const; };
        -

        Description

        +

        Description

        -

        +

        day_functor public construct/copy/destruct

        -
        1. day_functor(int f);
        +
        1. day_functor(int f);
        -

        -day_functor public member functions

        +

        +day_functor public member functions

          -
        1. duration_type get_offset(const date_type & d) const;
          2. -
        2. duration_type get_neg_offset(const date_type & d) const;
          3. +
        3. duration_type get_offset(const date_type &) const;
          4. +
        4. duration_type get_neg_offset(const date_type &) const;
        diff --git a/doc/html/boost/date_time/days_before_weekday.html b/doc/html/boost/date_time/days_before_weekday.html index 6754de5c5a..9b99aa1cee 100644 --- a/doc/html/boost/date_time/days_before_weekday.html +++ b/doc/html/boost/date_time/days_before_weekday.html @@ -37,7 +37,7 @@ date_type::duration_type days_before_weekday(const date_type & d, const weekday_type & wd);
        -

        Description

        +

        Description

        Calculates the number of days since the previous weekday If the date given falls on a Sunday and the given weekday is Tuesday the result will be 5 days. The answer will be a positive number because Tuesday is 5 days before Sunday, not -5 days before.

        diff --git a/doc/html/boost/date_time/days_until_weekday.html b/doc/html/boost/date_time/days_until_weekday.html index 58b579cc87..54c1063630 100644 --- a/doc/html/boost/date_time/days_until_weekday.html +++ b/doc/html/boost/date_time/days_until_weekday.html @@ -37,7 +37,7 @@ date_type::duration_type days_until_weekday(const date_type & d, const weekday_type & wd);
        -

        Description

        +

        Description

        Calculates the number of days until the next weekday. If the date given falls on a Sunday and the given weekday is Tuesday the result will be 2 days

        diff --git a/doc/html/boost/date_time/dst_adjustment_offsets.html b/doc/html/boost/date_time/dst_adjustment_offsets.html index d0a0d0abd9..77c7543220 100644 --- a/doc/html/boost/date_time/dst_adjustment_offsets.html +++ b/doc/html/boost/date_time/dst_adjustment_offsets.html @@ -36,7 +36,7 @@ class dst_adjustment_offsets { public: // construct/copy/destruct - dst_adjustment_offsets(const time_duration_type &, + dst_adjustment_offsets(const time_duration_type &, const time_duration_type &, const time_duration_type &); @@ -46,15 +46,15 @@ time_duration_type dst_end_offset_; // Time past midnight on end transition day that dst ends. };
        -

        Description

        +

        Description

        -

        +

        dst_adjustment_offsets public construct/copy/destruct

        -
        1. dst_adjustment_offsets(const time_duration_type & dst_adjust, 
+
          1. dst_adjustment_offsets(const time_duration_type & dst_adjust, 
                        const time_duration_type & dst_start_offset, 
                        const time_duration_type & dst_end_offset);
        diff --git a/doc/html/boost/date_time/dst_calc_engine.html b/doc/html/boost/date_time/dst_calc_engine.html index 5668070534..d4b45dfcd6 100644 --- a/doc/html/boost/date_time/dst_calc_engine.html +++ b/doc/html/boost/date_time/dst_calc_engine.html @@ -40,30 +40,30 @@ typedef date_type::calendar_type calendar_type; typedef dst_calculator< date_type, time_duration_type > dstcalc; - // public static functions + // public static functions static time_is_dst_result - local_is_dst(const date_type &, const time_duration_type &); - static bool is_dst_boundary_day(date_type); - static time_duration_type dst_offset(); - static date_type local_dst_start_day(year_type); - static date_type local_dst_end_day(year_type); + local_is_dst(const date_type &, const time_duration_type &); + static bool is_dst_boundary_day(date_type); + static time_duration_type dst_offset(); + static date_type local_dst_start_day(year_type); + static date_type local_dst_end_day(year_type); };
        -

        Description

        +

        Description

        -

        -dst_calc_engine public static functions

        +

        +dst_calc_engine public static functions

        1. static time_is_dst_result 
-local_is_dst(const date_type & d, const time_duration_type & td);
          Calculates if the given local time is dst or not.

          Determines if the time is really in DST or not. Also checks for invalid and ambiguous. +local_is_dst(const date_type & d, const time_duration_type & td);Calculates if the given local time is dst or not.

          Determines if the time is really in DST or not. Also checks for invalid and ambiguous.

          2. -
        2. static bool is_dst_boundary_day(date_type d);
          3. +
        3. static bool is_dst_boundary_day(date_type d);
        4. -
          static time_duration_type dst_offset();
          The time of day for the dst transition (eg: typically 01:00:00 or 02:00:00)
          5. -
        5. static date_type local_dst_start_day(year_type year);
          6. -
        6. static date_type local_dst_end_day(year_type year);
          7. +
          static time_duration_type dst_offset();
          The time of day for the dst transition (eg: typically 01:00:00 or 02:00:00) +
        7. static date_type local_dst_start_day(year_type year);
          8. +
        8. static date_type local_dst_end_day(year_type year);
        diff --git a/doc/html/boost/date_time/dst_calculator.html b/doc/html/boost/date_time/dst_calculator.html index 0ec7f9f237..4bebb6cbce 100644 --- a/doc/html/boost/date_time/dst_calculator.html +++ b/doc/html/boost/date_time/dst_calculator.html @@ -7,7 +7,7 @@ - + @@ -21,7 +21,7 @@
        -PrevUpHomeNext +PrevUpHomeNext
        @@ -39,30 +39,30 @@ typedef time_duration_type_ time_duration_type; typedef date_type_ date_type; - // public static functions + // public static functions static time_is_dst_result - process_local_dst_start_day(const time_duration_type &, unsigned int, long); + process_local_dst_start_day(const time_duration_type &, unsigned int, long); static time_is_dst_result - process_local_dst_end_day(const time_duration_type &, unsigned int, long); + process_local_dst_end_day(const time_duration_type &, unsigned int, long); static time_is_dst_result - local_is_dst(const date_type &, const time_duration_type &, + local_is_dst(const date_type &, const time_duration_type &, const date_type &, const time_duration_type &, const date_type &, const time_duration_type &, const time_duration_type &); static time_is_dst_result - local_is_dst(const date_type &, const time_duration_type &, + local_is_dst(const date_type &, const time_duration_type &, const date_type &, unsigned int, const date_type &, unsigned int, long); };
        -

        Description

        +

        Description

        -

        -dst_calculator public static functions

        +

        +dst_calculator public static functions

        1. static time_is_dst_result 
-process_local_dst_start_day(const time_duration_type & time_of_day, 
+process_local_dst_start_day(const time_duration_type & time_of_day, 
                             unsigned int dst_start_offset_minutes, 
                             long dst_length_minutes);
          Check the local time offset when on dst start day.

          On this dst transition, the time label between the transition boundary and the boudary + the offset are invalid times. If before the boundary then still not in dst. @@ -99,7 +99,7 @@ 

        2. static time_is_dst_result 
-process_local_dst_end_day(const time_duration_type & time_of_day, 
+process_local_dst_end_day(const time_duration_type & time_of_day, 
                           unsigned int dst_end_offset_minutes, 
                           long dst_length_minutes);
          Check the local time offset when on the last day of dst.

          This is the calculation for the DST end day. On that day times prior to the conversion time - dst_length (1 am in US) are still in dst. Times between the above and the switch time are ambiguous. Times after the start_offset are not in dst. @@ -132,7 +132,7 @@ 

        3. static time_is_dst_result 
-local_is_dst(const date_type & current_day, 
+local_is_dst(const date_type & current_day, 
              const time_duration_type & time_of_day, 
              const date_type & dst_start_day, 
              const time_duration_type & dst_start_offset, 
@@ -185,7 +185,7 @@
 
        4. static time_is_dst_result 
-local_is_dst(const date_type & current_day, 
+local_is_dst(const date_type & current_day, 
              const time_duration_type & time_of_day, 
              const date_type & dst_start_day, 
              unsigned int dst_start_offset_minutes, 
@@ -251,7 +251,7 @@
        -PrevUpHomeNext +PrevUpHomeNext
        diff --git a/doc/html/boost/date_time/dst_day_calc_rule.html b/doc/html/boost/date_time/dst_day_calc_rule.html index 4f92956778..d2bc18ea2f 100644 --- a/doc/html/boost/date_time/dst_day_calc_rule.html +++ b/doc/html/boost/date_time/dst_day_calc_rule.html @@ -39,31 +39,31 @@ typedef date_type::year_type year_type; // construct/copy/destruct - ~dst_day_calc_rule(); + ~dst_day_calc_rule(); - // public member functions - virtual date_type start_day(year_type) const = 0; - virtual std::string start_rule_as_string() const = 0; - virtual date_type end_day(year_type) const = 0; - virtual std::string end_rule_as_string() const = 0; + // public member functions + virtual date_type start_day(year_type) const = 0; + virtual std::string start_rule_as_string() const = 0; + virtual date_type end_day(year_type) const = 0; + virtual std::string end_rule_as_string() const = 0; };
        -

        Description

        +

        Description

        -

        +

        dst_day_calc_rule public construct/copy/destruct

        -
        1. ~dst_day_calc_rule();
        +
        1. ~dst_day_calc_rule();
        -

        -dst_day_calc_rule public member functions

        +

        +dst_day_calc_rule public member functions

          -
        1. virtual date_type start_day(year_type y) const = 0;
          2. -
        2. virtual std::string start_rule_as_string() const = 0;
          3. -
        3. virtual date_type end_day(year_type y) const = 0;
          4. -
        4. virtual std::string end_rule_as_string() const = 0;
          5. +
        5. virtual date_type start_day(year_type y) const = 0;
          6. +
        6. virtual std::string start_rule_as_string() const = 0;
          7. +
        7. virtual date_type end_day(year_type y) const = 0;
          8. +
        8. virtual std::string end_rule_as_string() const = 0;
        diff --git a/doc/html/boost/date_time/duration_traits_adapted.html b/doc/html/boost/date_time/duration_traits_adapted.html index 5c61c695ab..458b1857b3 100644 --- a/doc/html/boost/date_time/duration_traits_adapted.html +++ b/doc/html/boost/date_time/duration_traits_adapted.html @@ -38,16 +38,16 @@ typedef long int_type; typedef boost::date_time::int_adapter< long > impl_type; - // public static functions - static int_type as_number(impl_type); + // public static functions + static int_type as_number(impl_type); };
        -

        Description

        +

        Description

        Struct for instantiating date_duration WITH special values functionality. Allows for transparent implementation of either date_duration<long> or date_duration<int_adapter<long> >

        -

        -duration_traits_adapted public static functions

        -
        1. static int_type as_number(impl_type i);
        +

        +duration_traits_adapted public static functions

        +
        1. static int_type as_number(impl_type i);
        diff --git a/doc/html/boost/date_time/duration_traits_long.html b/doc/html/boost/date_time/duration_traits_long.html index 213f5aa8a2..f7cd1e1d1c 100644 --- a/doc/html/boost/date_time/duration_traits_long.html +++ b/doc/html/boost/date_time/duration_traits_long.html @@ -38,16 +38,16 @@ typedef long int_type; typedef long impl_type; - // public static functions - static int_type as_number(impl_type); + // public static functions + static int_type as_number(impl_type); };
        -

        Description

        +

        Description

        Struct for instantiating date_duration with NO special values functionality. Allows for transparent implementation of either date_duration<long> or date_duration<int_adapter<long> >

        -

        -duration_traits_long public static functions

        -
        1. static int_type as_number(impl_type i);
        +

        +duration_traits_long public static functions

        +
        1. static int_type as_number(impl_type i);
        diff --git a/doc/html/boost/date_time/dynam_1_3_12_15_3_30_2_1_2.html b/doc/html/boost/date_time/dynam_1_3_12_15_3_30_2_1_2.html deleted file mode 100644 index a892a7a097..0000000000 --- a/doc/html/boost/date_time/dynam_1_3_12_15_3_30_2_1_2.html +++ /dev/null @@ -1,76 +0,0 @@ - - - - -Class template dynamic_local_time_adjustor - - - - - - - - - - - - - - - -
        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
        -
        -
        -PrevUpHomeNext -
        -
        -
        -
        -

        Class template dynamic_local_time_adjustor

        -

        boost::date_time::dynamic_local_time_adjustor — Allow sliding utc adjustment with fixed dst rules.

        -
        -

        Synopsis

        -
        // In header: <boost/date_time/local_time_adjustor.hpp>
-
-template<typename time_type, typename dst_rules> 
-class dynamic_local_time_adjustor : public dst_rules {
-public:
-  // types
-  typedef time_type::time_duration_type time_duration_type;
-  typedef time_type::date_type          date_type;         
-
-  // construct/copy/destruct
-  dynamic_local_time_adjustor(time_duration_type);
-
-  // public member functions
-  time_duration_type utc_offset(bool);
-};
        -
        -

        Description

        -
        -

        -dynamic_local_time_adjustor - public - construct/copy/destruct

        -
        1. dynamic_local_time_adjustor(time_duration_type utc_offset);
        -
        -
        -

        -dynamic_local_time_adjustor public member functions

        -
        1. -
          time_duration_type utc_offset(bool is_dst);
          Presumes local time.
        -
        -
        -
        - - - -
        Copyright © 2001-2005 CrystalClear Software, Inc

        Subject to the Boost Software License, Version 1.0. (See accompanying file - LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

        -
        -
        -
        -PrevUpHomeNext -
        - - diff --git a/doc/html/boost/date_time/dynam_1_3_13_15_3_30_2_1_2.html b/doc/html/boost/date_time/dynam_1_3_13_15_3_30_2_1_2.html new file mode 100644 index 0000000000..22b37150ec --- /dev/null +++ b/doc/html/boost/date_time/dynam_1_3_13_15_3_30_2_1_2.html @@ -0,0 +1,76 @@ + + + + +Class template dynamic_local_time_adjustor + + + + + + + + + + + + + + + +
        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
        +
        +
        +PrevUpHomeNext +
        +
        +
        +
        +

        Class template dynamic_local_time_adjustor

        +

        boost::date_time::dynamic_local_time_adjustor — Allow sliding utc adjustment with fixed dst rules.

        +
        +

        Synopsis

        +
        // In header: <boost/date_time/local_time_adjustor.hpp>
+
+template<typename time_type, typename dst_rules> 
+class dynamic_local_time_adjustor : public dst_rules {
+public:
+  // types
+  typedef time_type::time_duration_type time_duration_type;
+  typedef time_type::date_type          date_type;         
+
+  // construct/copy/destruct
+  dynamic_local_time_adjustor(time_duration_type);
+
+  // public member functions
+  time_duration_type utc_offset(bool);
+};
        +
        +

        Description

        +
        +

        +dynamic_local_time_adjustor + public + construct/copy/destruct

        +
        1. dynamic_local_time_adjustor(time_duration_type utc_offset);
        +
        +
        +

        +dynamic_local_time_adjustor public member functions

        +
        1. +
          time_duration_type utc_offset(bool is_dst);
          Presumes local time.
        +
        +
        +
        + + + +
        Copyright © 2001-2005 CrystalClear Software, Inc

        Subject to the Boost Software License, Version 1.0. (See accompanying file + LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

        +
        +
        +
        +PrevUpHomeNext +
        + + diff --git a/doc/html/boost/date_time/eu_dst_trait.html b/doc/html/boost/date_time/eu_dst_trait.html index 0037a08eb0..c26efb6f6a 100644 --- a/doc/html/boost/date_time/eu_dst_trait.html +++ b/doc/html/boost/date_time/eu_dst_trait.html @@ -41,19 +41,19 @@ typedef date_time::last_kday_of_month< date_type > start_rule_functor; typedef date_time::last_kday_of_month< date_type > end_rule_functor; - // public static functions - static day_of_week_type start_day(year_type); - static month_type start_month(year_type); - static day_of_week_type end_day(year_type); - static month_type end_month(year_type); - static int dst_start_offset_minutes(); - static int dst_end_offset_minutes(); - static int dst_shift_length_minutes(); - static date_type local_dst_start_day(year_type); - static date_type local_dst_end_day(year_type); + // public static functions + static day_of_week_type start_day(year_type); + static month_type start_month(year_type); + static day_of_week_type end_day(year_type); + static month_type end_month(year_type); + static int dst_start_offset_minutes(); + static int dst_end_offset_minutes(); + static int dst_shift_length_minutes(); + static date_type local_dst_start_day(year_type); + static date_type local_dst_end_day(year_type); };
        -

        Description

        +

        Description

        These amount to the following:

        • Start of dst day is last Sunday in March

          • @@ -65,18 +65,18 @@

          -

          -eu_dst_trait public static functions

          +

          +eu_dst_trait public static functions

            -
          1. static day_of_week_type start_day(year_type);
            2. -
          2. static month_type start_month(year_type);
            3. -
          3. static day_of_week_type end_day(year_type);
            4. -
          4. static month_type end_month(year_type);
            5. -
          5. static int dst_start_offset_minutes();
            6. -
          6. static int dst_end_offset_minutes();
            7. -
          7. static int dst_shift_length_minutes();
            8. -
          8. static date_type local_dst_start_day(year_type year);
            9. -
          9. static date_type local_dst_end_day(year_type year);
            10. +
          10. static day_of_week_type start_day(year_type);
            11. +
          11. static month_type start_month(year_type);
            12. +
          12. static day_of_week_type end_day(year_type);
            13. +
          13. static month_type end_month(year_type);
            14. +
          14. static int dst_start_offset_minutes();
            15. +
          15. static int dst_end_offset_minutes();
            16. +
          16. static int dst_shift_length_minutes();
            17. +
          17. static date_type local_dst_start_day(year_type year);
            18. +
          18. static date_type local_dst_end_day(year_type year);
        diff --git a/doc/html/boost/date_time/find_match.html b/doc/html/boost/date_time/find_match.html index 72fa462f4c..52086e8b48 100644 --- a/doc/html/boost/date_time/find_match.html +++ b/doc/html/boost/date_time/find_match.html @@ -38,7 +38,7 @@ const charT *const * long_names, short size, const std::basic_string< charT > & s);
        -

        Description

        +

        Description

        find_match searches both arrays for a match to 's'. Both arrays must contain 'size' elements. The index of the match is returned. If no match is found, 'size' is returned. Ex. "Jan" returns 0, "Dec" returns 11, "Tue" returns 2. 'size' can be sent in with: (greg_month::max)() (which 12), (greg_weekday::max)() + 1 (which is 7) or date_time::NumSpecialValues

        diff --git a/doc/html/boost/date_time/first_kday_after.html b/doc/html/boost/date_time/first_kday_after.html index 58a2660af1..54d316ac0b 100644 --- a/doc/html/boost/date_time/first_kday_after.html +++ b/doc/html/boost/date_time/first_kday_after.html @@ -41,14 +41,14 @@ typedef date_type::duration_type duration_type; // construct/copy/destruct - first_kday_after(day_of_week_type); + first_kday_after(day_of_week_type); - // public member functions - date_type get_date(date_type) const; - day_of_week_type day_of_week() const; + // public member functions + date_type get_date(date_type) const; + day_of_week_type day_of_week() const; };
        -

        Description

        +

        Description

        Date generator that takes a date and finds kday after 

        typedef boost::date_time::first_kday_after<date> firstkdayafter;
 firstkdayafter fkaf(Monday);
@@ -56,19 +56,19 @@

        -

        +

        first_kday_after public construct/copy/destruct

        -
        1. first_kday_after(day_of_week_type dow);
        +
        1. first_kday_after(day_of_week_type dow);
        -

        -first_kday_after public member functions

        +

        +first_kday_after public member functions

        1. -
          date_type get_date(date_type start_day) const;
          Return next kday given.
          2. -
        2. day_of_week_type day_of_week() const;
          3. +
          date_type get_date(date_type start_day) const;
          Return next kday given. +
        3. day_of_week_type day_of_week() const;
        diff --git a/doc/html/boost/date_time/first_kday_before.html b/doc/html/boost/date_time/first_kday_before.html index 7bdd7fee87..a37d2981d6 100644 --- a/doc/html/boost/date_time/first_kday_before.html +++ b/doc/html/boost/date_time/first_kday_before.html @@ -41,14 +41,14 @@ typedef date_type::duration_type duration_type; // construct/copy/destruct - first_kday_before(day_of_week_type); + first_kday_before(day_of_week_type); - // public member functions - date_type get_date(date_type) const; - day_of_week_type day_of_week() const; + // public member functions + date_type get_date(date_type) const; + day_of_week_type day_of_week() const; };
        -

        Description

        +

        Description

        Date generator that takes a date and finds kday after 

        typedef boost::date_time::first_kday_before<date> firstkdaybefore;
 firstkdaybefore fkbf(Monday);
@@ -56,19 +56,19 @@

        -

        +

        first_kday_before public construct/copy/destruct

        -
        1. first_kday_before(day_of_week_type dow);
        +
        1. first_kday_before(day_of_week_type dow);
        -

        -first_kday_before public member functions

        +

        +first_kday_before public member functions

        1. -
          date_type get_date(date_type start_day) const;
          Return next kday given.
          2. -
        2. day_of_week_type day_of_week() const;
          3. +
          date_type get_date(date_type start_day) const;
          Return next kday given. +
        3. day_of_week_type day_of_week() const;
        diff --git a/doc/html/boost/date_time/first_kday_of_month.html b/doc/html/boost/date_time/first_kday_of_month.html index cb70acb9e7..4330912ae3 100644 --- a/doc/html/boost/date_time/first_kday_of_month.html +++ b/doc/html/boost/date_time/first_kday_of_month.html @@ -45,24 +45,24 @@ typedef date_type::duration_type duration_type; // construct/copy/destruct - first_kday_of_month(day_of_week_type, month_type); + first_kday_of_month(day_of_week_type, month_type); - // public member functions - virtual date_type get_date(year_type) const; - month_type month() const; - day_of_week_type day_of_week() const; - virtual std::string to_string() const; + // public member functions + virtual date_type get_date(year_type) const; + month_type month() const; + day_of_week_type day_of_week() const; + virtual std::string to_string() const; };
        -

        Description

        +

        Description

        Similar to nth_kday_of_month, but requires less paramters

        -

        +

        first_kday_of_month public construct/copy/destruct

        1. -
          first_kday_of_month(day_of_week_type dow, month_type m);
          Specify the first 'Sunday' in 'April' spec.

          +

          first_kday_of_month(day_of_week_type dow, month_type m);
          Specify the first 'Sunday' in 'April' spec.

          @@ -92,15 +92,15 @@
          -

          -first_kday_of_month public member functions

          +

          +first_kday_of_month public member functions

          1. -
            virtual date_type get_date(year_type year) const;
            Return a concrete date when provided with a year specific year.
            2. -
          2. month_type month() const;
            3. -
          3. day_of_week_type day_of_week() const;
            4. +
            virtual date_type get_date(year_type year) const;
            Return a concrete date when provided with a year specific year. +
          4. month_type month() const;
            5. +
          5. day_of_week_type day_of_week() const;
          6. -
            virtual std::string to_string() const;
            Returns string suitable for use in POSIX time zone string.

            Returns a string formatted as "M4.1.0" ==> 1st Sunday in April.

            +
            virtual std::string to_string() const;
            Returns string suitable for use in POSIX time zone string.

            Returns a string formatted as "M4.1.0" ==> 1st Sunday in April.

          diff --git a/doc/html/boost/date_time/fixed_1_3_12_15_3_26_2_1_2.html b/doc/html/boost/date_time/fixed_1_3_12_15_3_26_2_1_2.html deleted file mode 100644 index e56ebac197..0000000000 --- a/doc/html/boost/date_time/fixed_1_3_12_15_3_26_2_1_2.html +++ /dev/null @@ -1,57 +0,0 @@ - - - - -Function template fixed_string_to_int - - - - - - - - -
          - - - - - - -
          Boost C++ LibrariesHomeLibrariesPeopleFAQMore
          -
          -
          -PrevUpHomeNext -
          -
          -
          -
          -

          Function template fixed_string_to_int

          -

          boost::date_time::fixed_string_to_int — Helper function for parsing fixed length strings into integers.

          -
          -

          Synopsis

          -
          // In header: <boost/date_time/format_date_parser.hpp>
-
-
-template<typename int_type, typename charT> 
-  int_type fixed_string_to_int(std::istreambuf_iterator< charT > & itr, 
-                               std::istreambuf_iterator< charT > & stream_end, 
-                               parse_match_result< charT > & mr, 
-                               unsigned int length, const charT & fill_char);
          -
          -

          Description

          -

          Will consume 'length' number of characters from stream. Consumed character are transfered to parse_match_result struct. Returns '-1' if no number can be parsed or incorrect number of digits in stream.

          -
          -
          - - - -
          Copyright © 2001-2005 CrystalClear Software, Inc

          Subject to the Boost Software License, Version 1.0. (See accompanying file - LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

          -
          -
          -
          -PrevUpHomeNext -
          - - diff --git a/doc/html/boost/date_time/fixed_1_3_12_15_3_26_2_1_3.html b/doc/html/boost/date_time/fixed_1_3_12_15_3_26_2_1_3.html deleted file mode 100644 index 7c91dd5039..0000000000 --- a/doc/html/boost/date_time/fixed_1_3_12_15_3_26_2_1_3.html +++ /dev/null @@ -1,57 +0,0 @@ - - - - -Function template fixed_string_to_int - - - - - - - - - - - - - - - -
          Boost C++ LibrariesHomeLibrariesPeopleFAQMore
          -
          -
          -PrevUpHomeNext -
          -
          -
          -
          -

          Function template fixed_string_to_int

          -

          boost::date_time::fixed_string_to_int — Helper function for parsing fixed length strings into integers.

          -
          -

          Synopsis

          -
          // In header: <boost/date_time/format_date_parser.hpp>
-
-
-template<typename int_type, typename charT> 
-  int_type fixed_string_to_int(std::istreambuf_iterator< charT > & itr, 
-                               std::istreambuf_iterator< charT > & stream_end, 
-                               parse_match_result< charT > & mr, 
-                               unsigned int length);
          -
          -

          Description

          -

          Will consume 'length' number of characters from stream. Consumed character are transfered to parse_match_result struct. Returns '-1' if no number can be parsed or incorrect number of digits in stream.

          -
          -
          - - - -
          Copyright © 2001-2005 CrystalClear Software, Inc

          Subject to the Boost Software License, Version 1.0. (See accompanying file - LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

          -
          -
          -
          -PrevUpHomeNext -
          - - diff --git a/doc/html/boost/date_time/fixed_1_3_13_15_3_26_2_1_2.html b/doc/html/boost/date_time/fixed_1_3_13_15_3_26_2_1_2.html new file mode 100644 index 0000000000..9e8d266d7e --- /dev/null +++ b/doc/html/boost/date_time/fixed_1_3_13_15_3_26_2_1_2.html @@ -0,0 +1,57 @@ + + + + +Function template fixed_string_to_int + + + + + + + + + + + + + + + +
          Boost C++ LibrariesHomeLibrariesPeopleFAQMore
          +
          +
          +PrevUpHomeNext +
          +
          +
          +
          +

          Function template fixed_string_to_int

          +

          boost::date_time::fixed_string_to_int — Helper function for parsing fixed length strings into integers.

          +
          +

          Synopsis

          +
          // In header: <boost/date_time/format_date_parser.hpp>
+
+
+template<typename int_type, typename charT> 
+  int_type fixed_string_to_int(std::istreambuf_iterator< charT > & itr, 
+                               std::istreambuf_iterator< charT > & stream_end, 
+                               parse_match_result< charT > & mr, 
+                               unsigned int length, const charT & fill_char);
          +
          +

          Description

          +

          Will consume 'length' number of characters from stream. Consumed character are transfered to parse_match_result struct. Returns '-1' if no number can be parsed or incorrect number of digits in stream.

          +
          +
          + + + +
          Copyright © 2001-2005 CrystalClear Software, Inc

          Subject to the Boost Software License, Version 1.0. (See accompanying file + LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

          +
          +
          +
          +PrevUpHomeNext +
          + + diff --git a/doc/html/boost/date_time/fixed_1_3_13_15_3_26_2_1_3.html b/doc/html/boost/date_time/fixed_1_3_13_15_3_26_2_1_3.html new file mode 100644 index 0000000000..00499d8ea1 --- /dev/null +++ b/doc/html/boost/date_time/fixed_1_3_13_15_3_26_2_1_3.html @@ -0,0 +1,57 @@ + + + + +Function template fixed_string_to_int + + + + + + + + + + + + + + + +
          Boost C++ LibrariesHomeLibrariesPeopleFAQMore
          +
          +
          +PrevUpHomeNext +
          +
          +
          +
          +

          Function template fixed_string_to_int

          +

          boost::date_time::fixed_string_to_int — Helper function for parsing fixed length strings into integers.

          +
          +

          Synopsis

          +
          // In header: <boost/date_time/format_date_parser.hpp>
+
+
+template<typename int_type, typename charT> 
+  int_type fixed_string_to_int(std::istreambuf_iterator< charT > & itr, 
+                               std::istreambuf_iterator< charT > & stream_end, 
+                               parse_match_result< charT > & mr, 
+                               unsigned int length);
          +
          +

          Description

          +

          Will consume 'length' number of characters from stream. Consumed character are transfered to parse_match_result struct. Returns '-1' if no number can be parsed or incorrect number of digits in stream.

          +
          +
          + + + +
          Copyright © 2001-2005 CrystalClear Software, Inc

          Subject to the Boost Software License, Version 1.0. (See accompanying file + LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

          +
          +
          +
          +PrevUpHomeNext +
          + + diff --git a/doc/html/boost/date_time/format_date_parser.html b/doc/html/boost/date_time/format_date_parser.html index 61adf3a9b9..666acd8a7b 100644 --- a/doc/html/boost/date_time/format_date_parser.html +++ b/doc/html/boost/date_time/format_date_parser.html @@ -8,7 +8,7 @@ - + @@ -21,7 +21,7 @@
          -PrevUpHomeNext +PrevUpHomeNext
          @@ -51,52 +51,52 @@ typedef std::vector< std::basic_string< charT > > input_collection_type; // construct/copy/destruct - format_date_parser(const string_type &, const input_collection_type &, + format_date_parser(const string_type &, const input_collection_type &, const input_collection_type &, const input_collection_type &, const input_collection_type &); - format_date_parser(const string_type &, const std::locale &); - format_date_parser(const format_date_parser< date_type, charT > &); + format_date_parser(const string_type &, const std::locale &); + format_date_parser(const format_date_parser< date_type, charT > &); - // public member functions - string_type format() const; - void format(string_type); - void short_month_names(const input_collection_type &); - void long_month_names(const input_collection_type &); - void short_weekday_names(const input_collection_type &); - void long_weekday_names(const input_collection_type &); - date_type parse_date(const string_type &, const string_type &, + // public member functions + string_type format() const; + void format(string_type); + void short_month_names(const input_collection_type &); + void long_month_names(const input_collection_type &); + void short_weekday_names(const input_collection_type &); + void long_weekday_names(const input_collection_type &); + date_type parse_date(const string_type &, const string_type &, const special_values_parser< date_type, charT > &) const; - date_type parse_date(std::istreambuf_iterator< charT > &, + date_type parse_date(std::istreambuf_iterator< charT > &, std::istreambuf_iterator< charT > &, const special_values_parser< date_type, charT > &) const; - date_type parse_date(std::istreambuf_iterator< charT > &, + date_type parse_date(std::istreambuf_iterator< charT > &, std::istreambuf_iterator< charT > &, string_type, const special_values_parser< date_type, charT > &) const; - month_type parse_month(std::istreambuf_iterator< charT > &, + month_type parse_month(std::istreambuf_iterator< charT > &, std::istreambuf_iterator< charT > &, string_type) const; - month_type parse_month(std::istreambuf_iterator< charT > &, + month_type parse_month(std::istreambuf_iterator< charT > &, std::istreambuf_iterator< charT > &, string_type, match_results &) const; - day_type parse_var_day_of_month(std::istreambuf_iterator< charT > &, + day_type parse_var_day_of_month(std::istreambuf_iterator< charT > &, std::istreambuf_iterator< charT > &) const; - day_type parse_day_of_month(std::istreambuf_iterator< charT > &, + day_type parse_day_of_month(std::istreambuf_iterator< charT > &, std::istreambuf_iterator< charT > &) const; day_of_week_type - parse_weekday(std::istreambuf_iterator< charT > &, + parse_weekday(std::istreambuf_iterator< charT > &, std::istreambuf_iterator< charT > &, string_type) const; day_of_week_type - parse_weekday(std::istreambuf_iterator< charT > &, + parse_weekday(std::istreambuf_iterator< charT > &, std::istreambuf_iterator< charT > &, string_type, match_results &) const; - year_type parse_year(std::istreambuf_iterator< charT > &, + year_type parse_year(std::istreambuf_iterator< charT > &, std::istreambuf_iterator< charT > &, string_type) const; - year_type parse_year(std::istreambuf_iterator< charT > &, + year_type parse_year(std::istreambuf_iterator< charT > &, std::istreambuf_iterator< charT > &, string_type, match_results &) const; };
          -

          Description

          +

          Description

          The following is the set of recognized format specifiers

          • a - Short weekday name

            • @@ -119,71 +119,71 @@

            todo – Another interesting feature that this approach could provide is an option to fill in any missing fields with the current values from the clock. So if you have m-d the parser would detect the missing year value and fill it in using the clock.

            todo – What to do with the x. x in the classic facet is just bad...

            -

            +

            format_date_parser public construct/copy/destruct

              -
            1. format_date_parser(const string_type & format_str, 
+
            2. format_date_parser(const string_type & format_str, 
                    const input_collection_type & month_short_names, 
                    const input_collection_type & month_long_names, 
                    const input_collection_type & weekday_short_names, 
                    const input_collection_type & weekday_long_names);
              3. 
-
            3. format_date_parser(const string_type & format_str, const std::locale & locale);
              4. 
-
            4. format_date_parser(const format_date_parser< date_type, charT > & fdp);
              5. 
+
            5. format_date_parser(const string_type & format_str, const std::locale & locale);
              6. 
+
            6. format_date_parser(const format_date_parser< date_type, charT > & fdp);
              7.
            -

            -format_date_parser public member functions

            +

            +format_date_parser public member functions

              -
            1. string_type format() const;
              2. -
            2. void format(string_type format_str);
              3. -
            3. void short_month_names(const input_collection_type & month_names);
              4. -
            4. void long_month_names(const input_collection_type & month_names);
              5. -
            5. void short_weekday_names(const input_collection_type & weekday_names);
              6. -
            6. void long_weekday_names(const input_collection_type & weekday_names);
              7. -
            7. date_type parse_date(const string_type & value, 
+
            8. string_type format() const;
              9. 
+
            9. void format(string_type format_str);
              10. 
+
            10. void short_month_names(const input_collection_type & month_names);
              11. 
+
            11. void long_month_names(const input_collection_type & month_names);
              12. 
+
            12. void short_weekday_names(const input_collection_type & weekday_names);
              13. 
+
            13. void long_weekday_names(const input_collection_type & weekday_names);
              14. 
+
            14. date_type parse_date(const string_type & value, 
                      const string_type & format_str, 
                      const special_values_parser< date_type, charT > & sv_parser) const;
              15. 
-
            15. date_type parse_date(std::istreambuf_iterator< charT > & sitr, 
+
            16. date_type parse_date(std::istreambuf_iterator< charT > & sitr, 
                      std::istreambuf_iterator< charT > & stream_end, 
                      const special_values_parser< date_type, charT > & sv_parser) const;
              17. 
 
            17. 
-
              date_type parse_date(std::istreambuf_iterator< charT > & sitr, 
+
              date_type parse_date(std::istreambuf_iterator< charT > & sitr, 
                      std::istreambuf_iterator< charT > & stream_end, 
                      string_type format_str, 
                      const special_values_parser< date_type, charT > & sv_parser) const;
              
 
              Of all the objects that the format_date_parser can parse, only a date can be a special value. Therefore, only parse_date checks for special_values. 
              
 
              18. 
 
            18. 
-
              month_type parse_month(std::istreambuf_iterator< charT > & sitr, 
+
              month_type parse_month(std::istreambuf_iterator< charT > & sitr, 
                        std::istreambuf_iterator< charT > & stream_end, 
                        string_type format_str) const;
              Throws bad_month if unable to parse. 
              19. 
 
            19. 
-
              month_type parse_month(std::istreambuf_iterator< charT > & sitr, 
+
              month_type parse_month(std::istreambuf_iterator< charT > & sitr, 
                        std::istreambuf_iterator< charT > & stream_end, 
                        string_type format_str, match_results & mr) const;
              Throws bad_month if unable to parse. 
              20. 
 
            20. 
-
              day_type parse_var_day_of_month(std::istreambuf_iterator< charT > & sitr, 
+
              day_type parse_var_day_of_month(std::istreambuf_iterator< charT > & sitr, 
                                 std::istreambuf_iterator< charT > & stream_end) const;
              Expects 1 or 2 digits 1-31. Throws bad_day_of_month if unable to parse. 
              21. 
 
            21. 
-
              day_type parse_day_of_month(std::istreambuf_iterator< charT > & sitr, 
+
              day_type parse_day_of_month(std::istreambuf_iterator< charT > & sitr, 
                             std::istreambuf_iterator< charT > & stream_end) const;
              Expects 2 digits 01-31. Throws bad_day_of_month if unable to parse. 
              22. 
 
            22. day_of_week_type 
-parse_weekday(std::istreambuf_iterator< charT > & sitr, 
+parse_weekday(std::istreambuf_iterator< charT > & sitr, 
               std::istreambuf_iterator< charT > & stream_end, 
               string_type format_str) const;
              23. 
 
            23. day_of_week_type 
-parse_weekday(std::istreambuf_iterator< charT > & sitr, 
+parse_weekday(std::istreambuf_iterator< charT > & sitr, 
               std::istreambuf_iterator< charT > & stream_end, 
               string_type format_str, match_results & mr) const;
              24. 
 
            24. 
-
              year_type parse_year(std::istreambuf_iterator< charT > & sitr, 
+
              year_type parse_year(std::istreambuf_iterator< charT > & sitr, 
                      std::istreambuf_iterator< charT > & stream_end, 
                      string_type format_str) const;
              throws bad_year if unable to parse 
              25. 
 
            25. 
-
              year_type parse_year(std::istreambuf_iterator< charT > & sitr, 
+
              year_type parse_year(std::istreambuf_iterator< charT > & sitr, 
                      std::istreambuf_iterator< charT > & stream_end, 
                      string_type format_str, match_results & mr) const;
              throws bad_year if unable to parse 
              26.
            @@ -198,7 +198,7 @@
        -PrevUpHomeNext +PrevUpHomeNext
        diff --git a/doc/html/boost/date_time/from__1_3_12_15_3_22_1_1_6.html b/doc/html/boost/date_time/from__1_3_12_15_3_22_1_1_6.html deleted file mode 100644 index 52add2992d..0000000000 --- a/doc/html/boost/date_time/from__1_3_12_15_3_22_1_1_6.html +++ /dev/null @@ -1,55 +0,0 @@ - - - - -Function template from_stream_type - - - - - - - - - - - - - - - -
        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
        -
        -
        -PrevUpHomeNext -
        -
        -
        -
        -

        Function template from_stream_type

        -

        boost::date_time::from_stream_type — Helper function for 'date gregorian::from_stream()'.

        -
        -

        Synopsis

        -
        // In header: <boost/date_time/date_parsing.hpp>
-
-
-template<typename date_type, typename iterator_type> 
-  date_type from_stream_type(iterator_type & beg, iterator_type const & end, 
-                             char);
        -
        -

        Description

        -

        Creates a string from the iterators that reference the begining & end of a char[] or string. All elements are used in output string

        -
        -
        - - - -
        Copyright © 2001-2005 CrystalClear Software, Inc

        Subject to the Boost Software License, Version 1.0. (See accompanying file - LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

        -
        -
        -
        -PrevUpHomeNext -
        - - diff --git a/doc/html/boost/date_time/from__1_3_12_15_3_22_1_1_7.html b/doc/html/boost/date_time/from__1_3_12_15_3_22_1_1_7.html deleted file mode 100644 index 33526b8647..0000000000 --- a/doc/html/boost/date_time/from__1_3_12_15_3_22_1_1_7.html +++ /dev/null @@ -1,55 +0,0 @@ - - - - -Function template from_stream_type - - - - - - - - - - - - - - - -
        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
        -
        -
        -PrevUpHomeNext -
        -
        -
        -
        -

        Function template from_stream_type

        -

        boost::date_time::from_stream_type — Helper function for 'date gregorian::from_stream()'.

        -
        -

        Synopsis

        -
        // In header: <boost/date_time/date_parsing.hpp>
-
-
-template<typename date_type, typename iterator_type> 
-  date_type from_stream_type(iterator_type & beg, iterator_type const &, 
-                             std::string const &);
        -
        -

        Description

        -

        Returns the first string found in the stream referenced by the begining & end iterators

        -
        -
        - - - -
        Copyright © 2001-2005 CrystalClear Software, Inc

        Subject to the Boost Software License, Version 1.0. (See accompanying file - LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

        -
        -
        -
        -PrevUpHomeNext -
        - - diff --git a/doc/html/boost/date_time/from__1_3_12_15_3_22_1_1_8.html b/doc/html/boost/date_time/from__1_3_12_15_3_22_1_1_8.html deleted file mode 100644 index 2778b6b7d1..0000000000 --- a/doc/html/boost/date_time/from__1_3_12_15_3_22_1_1_8.html +++ /dev/null @@ -1,55 +0,0 @@ - - - - -Function template from_stream_type - - - - - - - - - - - - - - - -
        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
        -
        -
        -PrevUpHomeNext -
        -
        -
        -
        -

        Function template from_stream_type

        -

        boost::date_time::from_stream_type — Helper function for 'date gregorian::from_stream()'.

        -
        -

        Synopsis

        -
        // In header: <boost/date_time/date_parsing.hpp>
-
-
-template<typename date_type, typename iterator_type> 
-  date_type from_stream_type(iterator_type & beg, iterator_type const & end, 
-                             wchar_t);
        -
        -

        Description

        -

        Creates a string from the iterators that reference the begining & end of a wstring. All elements are used in output string

        -
        -
        - - - -
        Copyright © 2001-2005 CrystalClear Software, Inc

        Subject to the Boost Software License, Version 1.0. (See accompanying file - LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

        -
        -
        -
        -PrevUpHomeNext -
        - - diff --git a/doc/html/boost/date_time/from__1_3_12_15_3_22_1_1_9.html b/doc/html/boost/date_time/from__1_3_12_15_3_22_1_1_9.html deleted file mode 100644 index 021300e755..0000000000 --- a/doc/html/boost/date_time/from__1_3_12_15_3_22_1_1_9.html +++ /dev/null @@ -1,55 +0,0 @@ - - - - -Function template from_stream_type - - - - - - - - - - - - - - - -
        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
        -
        -
        -PrevUpHomeNext -
        -
        -
        -
        -

        Function template from_stream_type

        -

        boost::date_time::from_stream_type — Helper function for 'date gregorian::from_stream()'.

        -
        -

        Synopsis

        -
        // In header: <boost/date_time/date_parsing.hpp>
-
-
-template<typename date_type, typename iterator_type> 
-  date_type from_stream_type(iterator_type & beg, iterator_type const &, 
-                             std::wstring const &);
        -
        -

        Description

        -

        Creates a string from the first wstring found in the stream referenced by the begining & end iterators

        -
        -
        - - - -
        Copyright © 2001-2005 CrystalClear Software, Inc

        Subject to the Boost Software License, Version 1.0. (See accompanying file - LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

        -
        -
        -
        -PrevUpHomeNext -
        - - diff --git a/doc/html/boost/date_time/from__1_3_13_15_3_22_1_1_6.html b/doc/html/boost/date_time/from__1_3_13_15_3_22_1_1_6.html new file mode 100644 index 0000000000..dd9eadbb31 --- /dev/null +++ b/doc/html/boost/date_time/from__1_3_13_15_3_22_1_1_6.html @@ -0,0 +1,55 @@ + + + + +Function template from_stream_type + + + + + + + + + + + + + + + +
        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
        +
        +
        +PrevUpHomeNext +
        +
        +
        +
        +

        Function template from_stream_type

        +

        boost::date_time::from_stream_type — Helper function for 'date gregorian::from_stream()'.

        +
        +

        Synopsis

        +
        // In header: <boost/date_time/date_parsing.hpp>
+
+
+template<typename date_type, typename iterator_type> 
+  date_type from_stream_type(iterator_type & beg, iterator_type const & end, 
+                             char);
        +
        +

        Description

        +

        Creates a string from the iterators that reference the begining & end of a char[] or string. All elements are used in output string

        +
        +
        + + + +
        Copyright © 2001-2005 CrystalClear Software, Inc

        Subject to the Boost Software License, Version 1.0. (See accompanying file + LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

        +
        +
        +
        +PrevUpHomeNext +
        + + diff --git a/doc/html/boost/date_time/from__1_3_13_15_3_22_1_1_7.html b/doc/html/boost/date_time/from__1_3_13_15_3_22_1_1_7.html new file mode 100644 index 0000000000..0cdbfc386d --- /dev/null +++ b/doc/html/boost/date_time/from__1_3_13_15_3_22_1_1_7.html @@ -0,0 +1,55 @@ + + + + +Function template from_stream_type + + + + + + + + + + + + + + + +
        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
        +
        +
        +PrevUpHomeNext +
        +
        +
        +
        +

        Function template from_stream_type

        +

        boost::date_time::from_stream_type — Helper function for 'date gregorian::from_stream()'.

        +
        +

        Synopsis

        +
        // In header: <boost/date_time/date_parsing.hpp>
+
+
+template<typename date_type, typename iterator_type> 
+  date_type from_stream_type(iterator_type & beg, iterator_type const &, 
+                             std::string const &);
        +
        +

        Description

        +

        Returns the first string found in the stream referenced by the begining & end iterators

        +
        +
        + + + +
        Copyright © 2001-2005 CrystalClear Software, Inc

        Subject to the Boost Software License, Version 1.0. (See accompanying file + LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

        +
        +
        +
        +PrevUpHomeNext +
        + + diff --git a/doc/html/boost/date_time/from__1_3_13_15_3_22_1_1_8.html b/doc/html/boost/date_time/from__1_3_13_15_3_22_1_1_8.html new file mode 100644 index 0000000000..c26dce9ed8 --- /dev/null +++ b/doc/html/boost/date_time/from__1_3_13_15_3_22_1_1_8.html @@ -0,0 +1,55 @@ + + + + +Function template from_stream_type + + + + + + + + + + + + + + + +
        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
        +
        +
        +PrevUpHomeNext +
        +
        +
        +
        +

        Function template from_stream_type

        +

        boost::date_time::from_stream_type — Helper function for 'date gregorian::from_stream()'.

        +
        +

        Synopsis

        +
        // In header: <boost/date_time/date_parsing.hpp>
+
+
+template<typename date_type, typename iterator_type> 
+  date_type from_stream_type(iterator_type & beg, iterator_type const & end, 
+                             wchar_t);
        +
        +

        Description

        +

        Creates a string from the iterators that reference the begining & end of a wstring. All elements are used in output string

        +
        +
        + + + +
        Copyright © 2001-2005 CrystalClear Software, Inc

        Subject to the Boost Software License, Version 1.0. (See accompanying file + LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

        +
        +
        +
        +PrevUpHomeNext +
        + + diff --git a/doc/html/boost/date_time/from__1_3_13_15_3_22_1_1_9.html b/doc/html/boost/date_time/from__1_3_13_15_3_22_1_1_9.html new file mode 100644 index 0000000000..5192c52a89 --- /dev/null +++ b/doc/html/boost/date_time/from__1_3_13_15_3_22_1_1_9.html @@ -0,0 +1,55 @@ + + + + +Function template from_stream_type + + + + + + + + + + + + + + + +
        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
        +
        +
        +PrevUpHomeNext +
        +
        +
        +
        +

        Function template from_stream_type

        +

        boost::date_time::from_stream_type — Helper function for 'date gregorian::from_stream()'.

        +
        +

        Synopsis

        +
        // In header: <boost/date_time/date_parsing.hpp>
+
+
+template<typename date_type, typename iterator_type> 
+  date_type from_stream_type(iterator_type & beg, iterator_type const &, 
+                             std::wstring const &);
        +
        +

        Description

        +

        Creates a string from the first wstring found in the stream referenced by the begining & end iterators

        +
        +
        + + + +
        Copyright © 2001-2005 CrystalClear Software, Inc

        Subject to the Boost Software License, Version 1.0. (See accompanying file + LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

        +
        +
        +
        +PrevUpHomeNext +
        + + diff --git a/doc/html/boost/date_time/gather_month_strings.html b/doc/html/boost/date_time/gather_month_strings.html index 2569a44660..e742ee245a 100644 --- a/doc/html/boost/date_time/gather_month_strings.html +++ b/doc/html/boost/date_time/gather_month_strings.html @@ -37,7 +37,7 @@ std::vector< std::basic_string< charT > > gather_month_strings(const std::locale & locale, bool short_strings = true);
        -

        Description

        +

        Description

        Using the time_put facet, this function creates a collection of all the month strings from a locale. This is handy when building custom date parsers or formatters that need to be localized.

        diff --git a/doc/html/boost/date_time/gather_weekday_strings.html b/doc/html/boost/date_time/gather_weekday_strings.html index f3b628ab75..afc51f4871 100644 --- a/doc/html/boost/date_time/gather_weekday_strings.html +++ b/doc/html/boost/date_time/gather_weekday_strings.html @@ -38,7 +38,7 @@ gather_weekday_strings(const std::locale & locale, bool short_strings = true);

        -

        Description

        +

        Description

        Using the time_put facet, this function creates a collection of all the weekday strings from a locale starting with the string for 'Sunday'. This is handy when building custom date parsers or formatters that need to be localized.

        diff --git a/doc/html/boost/date_time/gregorian_calendar_base.html b/doc/html/boost/date_time/gregorian_calendar_base.html index 76425cfc19..e3d27edcd2 100644 --- a/doc/html/boost/date_time/gregorian_calendar_base.html +++ b/doc/html/boost/date_time/gregorian_calendar_base.html @@ -42,40 +42,40 @@ typedef ymd_type::year_type year_type; // Type to hold a stand alone year value (eg: 2002) typedef date_int_type_ date_int_type; // Define the integer type to use for internal calculations. - // public static functions - static unsigned short day_of_week(const ymd_type &); - static int week_number(const ymd_type &); - static date_int_type day_number(const ymd_type &); - static date_int_type julian_day_number(const ymd_type &); - static date_int_type modjulian_day_number(const ymd_type &); - static ymd_type from_day_number(date_int_type); - static ymd_type from_julian_day_number(date_int_type); - static ymd_type from_modjulian_day_number(date_int_type); - static bool is_leap_year(year_type); - static unsigned short end_of_month_day(year_type, month_type); - static ymd_type epoch(); - static unsigned short days_in_week(); + // public static functions + static unsigned short day_of_week(const ymd_type &); + static int week_number(const ymd_type &); + static date_int_type day_number(const ymd_type &); + static date_int_type julian_day_number(const ymd_type &); + static date_int_type modjulian_day_number(const ymd_type &); + static ymd_type from_day_number(date_int_type); + static ymd_type from_julian_day_number(date_int_type); + static ymd_type from_modjulian_day_number(date_int_type); + static bool is_leap_year(year_type); + static unsigned short end_of_month_day(year_type, month_type); + static ymd_type epoch(); + static unsigned short days_in_week(); };

        -

        Description

        +

        Description

        This is a parameterized implementation of a proleptic Gregorian Calendar that can be used in the creation of date systems or just to perform calculations. All the methods of this class are static functions, so the intent is to never create instances of this class.

        -

        -gregorian_calendar_base public static functions

        +

        +gregorian_calendar_base public static functions

          -
        1. static unsigned short day_of_week(const ymd_type & ymd);
          2. -
        2. static int week_number(const ymd_type & ymd);
          3. -
        3. static date_int_type day_number(const ymd_type & ymd);
          4. -
        4. static date_int_type julian_day_number(const ymd_type & ymd);
          5. -
        5. static date_int_type modjulian_day_number(const ymd_type & ymd);
          6. -
        6. static ymd_type from_day_number(date_int_type);
          7. -
        7. static ymd_type from_julian_day_number(date_int_type);
          8. -
        8. static ymd_type from_modjulian_day_number(date_int_type);
          9. -
        9. static bool is_leap_year(year_type);
          10. -
        10. static unsigned short end_of_month_day(year_type y, month_type m);
          11. -
        11. static ymd_type epoch();
          12. -
        12. static unsigned short days_in_week();
          13. +
        13. static unsigned short day_of_week(const ymd_type & ymd);
          14. +
        14. static int week_number(const ymd_type & ymd);
          15. +
        15. static date_int_type day_number(const ymd_type & ymd);
          16. +
        16. static date_int_type julian_day_number(const ymd_type & ymd);
          17. +
        17. static date_int_type modjulian_day_number(const ymd_type & ymd);
          18. +
        18. static ymd_type from_day_number(date_int_type);
          19. +
        19. static ymd_type from_julian_day_number(date_int_type);
          20. +
        20. static ymd_type from_modjulian_day_number(date_int_type);
          21. +
        21. static bool is_leap_year(year_type);
          22. +
        22. static unsigned short end_of_month_day(year_type y, month_type m);
          23. +
        23. static ymd_type epoch();
          24. +
        24. static unsigned short days_in_week();
        diff --git a/doc/html/boost/date_time/int_adapter.html b/doc/html/boost/date_time/int_adapter.html index bcd203a577..dcd4c2e0ae 100644 --- a/doc/html/boost/date_time/int_adapter.html +++ b/doc/html/boost/date_time/int_adapter.html @@ -8,7 +8,7 @@ - + @@ -21,7 +21,7 @@
        -PrevUpHomeNext +PrevUpHomeNext
        @@ -39,58 +39,58 @@ typedef int_type_ int_type; // construct/copy/destruct - int_adapter(int_type); + int_adapter(int_type); - // public member functions - bool is_infinity() const; - bool is_pos_infinity() const; - bool is_neg_infinity() const; - bool is_nan() const; - bool is_special() const; - bool operator==(const int_adapter &) const; - bool operator==(const int &) const; - bool operator!=(const int_adapter &) const; - bool operator!=(const int &) const; - bool operator<(const int_adapter &) const; - bool operator<(const int &) const; - bool operator>(const int_adapter &) const; - int_type as_number() const; - special_values as_special() const; + // public member functions + bool is_infinity() const; + bool is_pos_infinity() const; + bool is_neg_infinity() const; + bool is_nan() const; + bool is_special() const; + bool operator==(const int_adapter &) const; + bool operator==(const int &) const; + bool operator!=(const int_adapter &) const; + bool operator!=(const int &) const; + bool operator<(const int_adapter &) const; + bool operator<(const int &) const; + bool operator>(const int_adapter &) const; + int_type as_number() const; + special_values as_special() const; template<typename rhs_type> - int_adapter operator+(const int_adapter< rhs_type > &) const; - int_adapter operator+(const int_type) const; + int_adapter operator+(const int_adapter< rhs_type > &) const; + int_adapter operator+(const int_type) const; template<typename rhs_type> - int_adapter operator-(const int_adapter< rhs_type > &) const; - int_adapter operator-(const int_type) const; - int_adapter operator*(const int_adapter &) const; - int_adapter operator*(const int) const; - int_adapter operator/(const int_adapter &) const; - int_adapter operator/(const int) const; - int_adapter operator%(const int_adapter &) const; - int_adapter operator%(const int) const; + int_adapter operator-(const int_adapter< rhs_type > &) const; + int_adapter operator-(const int_type) const; + int_adapter operator*(const int_adapter &) const; + int_adapter operator*(const int) const; + int_adapter operator/(const int_adapter &) const; + int_adapter operator/(const int) const; + int_adapter operator%(const int_adapter &) const; + int_adapter operator%(const int) const; - // public static functions - static bool has_infinity(); - static const int_adapter pos_infinity(); - static const int_adapter neg_infinity(); - static const int_adapter not_a_number(); - static int_adapter max BOOST_PREVENT_MACRO_SUBSTITUTION(); - static int_adapter min BOOST_PREVENT_MACRO_SUBSTITUTION(); - static int_adapter from_special(special_values); - static bool is_inf(int_type); - static bool is_neg_inf(int_type); - static bool is_pos_inf(int_type); - static bool is_not_a_number(int_type); - static special_values to_special(int_type); - static int_type maxcount(); + // public static functions + static bool has_infinity(); + static const int_adapter pos_infinity(); + static const int_adapter neg_infinity(); + static const int_adapter not_a_number(); + static int_adapter max BOOST_PREVENT_MACRO_SUBSTITUTION(); + static int_adapter min BOOST_PREVENT_MACRO_SUBSTITUTION(); + static int_adapter from_special(special_values); + static bool is_inf(int_type); + static bool is_neg_inf(int_type); + static bool is_pos_inf(int_type); + static bool is_not_a_number(int_type); + static special_values to_special(int_type); + static int_type maxcount(); - // private member functions - int compare(const int_adapter &) const; - int_adapter mult_div_specials(const int_adapter &) const; - int_adapter mult_div_specials(const int &) const; + // private member functions + int compare(const int_adapter &) const; + int_adapter mult_div_specials(const int_adapter &) const; + int_adapter mult_div_specials(const int &) const; };
        -

        Description

        +

        Description

        This class is used internally in counted date/time representations. It adds the floating point like features of infinities and not a number. It also provides mathmatical operations with consideration to special values following these rules: 

        +infinity  -  infinity  == Not A Number (NAN)
  infinity  *  non-zero  == infinity
@@ -101,90 +101,90 @@

        -

        +

        int_adapter public construct/copy/destruct

        -
        1. int_adapter(int_type v);
        +
        1. int_adapter(int_type v);
        -

        -int_adapter public member functions

        +

        +int_adapter public member functions

          -
        1. bool is_infinity() const;
          2. -
        2. bool is_pos_infinity() const;
          3. -
        3. bool is_neg_infinity() const;
          4. -
        4. bool is_nan() const;
          5. -
        5. bool is_special() const;
          6. -
        6. bool operator==(const int_adapter & rhs) const;
          7. -
        7. bool operator==(const int & rhs) const;
          8. -
        8. bool operator!=(const int_adapter & rhs) const;
          9. -
        9. bool operator!=(const int & rhs) const;
          10. -
        10. bool operator<(const int_adapter & rhs) const;
          11. -
        11. bool operator<(const int & rhs) const;
          12. -
        12. bool operator>(const int_adapter & rhs) const;
          13. -
        13. int_type as_number() const;
          14. +
        14. bool is_infinity() const;
          15. +
        15. bool is_pos_infinity() const;
          16. +
        16. bool is_neg_infinity() const;
          17. +
        17. bool is_nan() const;
          18. +
        18. bool is_special() const;
          19. +
        19. bool operator==(const int_adapter & rhs) const;
          20. +
        20. bool operator==(const int & rhs) const;
          21. +
        21. bool operator!=(const int_adapter & rhs) const;
          22. +
        22. bool operator!=(const int & rhs) const;
          23. +
        23. bool operator<(const int_adapter & rhs) const;
          24. +
        24. bool operator<(const int & rhs) const;
          25. +
        25. bool operator>(const int_adapter & rhs) const;
          26. +
        26. int_type as_number() const;
        27. -
          special_values as_special() const;
          Returns either special value type or is_not_special.
          28. +
          special_values as_special() const;
          Returns either special value type or is_not_special. 
        28. template<typename rhs_type> 
-  int_adapter operator+(const int_adapter< rhs_type > & rhs) const;
          + int_adapter operator+(const int_adapter< rhs_type > & rhs) const;

          Operator allows for adding dissimilar int_adapter types. The return type will match that of the the calling object's type

          29. -
        29. int_adapter operator+(const int_type rhs) const;
          30. +
        30. int_adapter operator+(const int_type rhs) const;
        31. template<typename rhs_type> 
-  int_adapter operator-(const int_adapter< rhs_type > & rhs) const;
          + int_adapter operator-(const int_adapter< rhs_type > & rhs) const;

          Operator allows for subtracting dissimilar int_adapter types. The return type will match that of the the calling object's type

          32. -
        32. int_adapter operator-(const int_type rhs) const;
          33. -
        33. int_adapter operator*(const int_adapter & rhs) const;
          34. +
        34. int_adapter operator-(const int_type rhs) const;
          35. +
        35. int_adapter operator*(const int_adapter & rhs) const;
        36. -
          int_adapter operator*(const int rhs) const;
          +
          int_adapter operator*(const int rhs) const;

          Provided for cases when automatic conversion from 'int' to 'int_adapter' causes incorrect results.

          37. -
        37. int_adapter operator/(const int_adapter & rhs) const;
          38. +
        38. int_adapter operator/(const int_adapter & rhs) const;
        39. -
          int_adapter operator/(const int rhs) const;
          +
          int_adapter operator/(const int rhs) const;

          Provided for cases when automatic conversion from 'int' to 'int_adapter' causes incorrect results.

          40. -
        40. int_adapter operator%(const int_adapter & rhs) const;
          41. +
        41. int_adapter operator%(const int_adapter & rhs) const;
        42. -
          int_adapter operator%(const int rhs) const;
          +
          int_adapter operator%(const int rhs) const;

          Provided for cases when automatic conversion from 'int' to 'int_adapter' causes incorrect results.

        -

        -int_adapter public static functions

        +

        +int_adapter public static functions

          -
        1. static bool has_infinity();
          2. -
        2. static const int_adapter pos_infinity();
          3. -
        3. static const int_adapter neg_infinity();
          4. -
        4. static const int_adapter not_a_number();
          5. -
        5. static int_adapter max BOOST_PREVENT_MACRO_SUBSTITUTION();
          6. -
        6. static int_adapter min BOOST_PREVENT_MACRO_SUBSTITUTION();
          7. -
        7. static int_adapter from_special(special_values sv);
          8. -
        8. static bool is_inf(int_type v);
          9. -
        9. static bool is_neg_inf(int_type v);
          10. -
        10. static bool is_pos_inf(int_type v);
          11. -
        11. static bool is_not_a_number(int_type v);
          12. +
        12. static bool has_infinity();
          13. +
        13. static const int_adapter pos_infinity();
          14. +
        14. static const int_adapter neg_infinity();
          15. +
        15. static const int_adapter not_a_number();
          16. +
        16. static int_adapter max BOOST_PREVENT_MACRO_SUBSTITUTION();
          17. +
        17. static int_adapter min BOOST_PREVENT_MACRO_SUBSTITUTION();
          18. +
        18. static int_adapter from_special(special_values sv);
          19. +
        19. static bool is_inf(int_type v);
          20. +
        20. static bool is_neg_inf(int_type v);
          21. +
        21. static bool is_pos_inf(int_type v);
          22. +
        22. static bool is_not_a_number(int_type v);
        23. -
          static special_values to_special(int_type v);
          Returns either special value type or is_not_special.
          24. -
        24. static int_type maxcount();
          25. +
          static special_values to_special(int_type v);
          Returns either special value type or is_not_special. +
        25. static int_type maxcount();
        -

        -int_adapter private member functions

        +

        +int_adapter private member functions

        1. -
          int compare(const int_adapter & rhs) const;
          returns -1, 0, 1, or 2 if 'this' is <, ==, >, or 'nan comparison' rhs
          2. +
          int compare(const int_adapter & rhs) const;
          returns -1, 0, 1, or 2 if 'this' is <, ==, >, or 'nan comparison' rhs
        2. -
          int_adapter mult_div_specials(const int_adapter & rhs) const;
          Assumes at least 'this' or 'rhs' is a special value.
          3. +
          int_adapter mult_div_specials(const int_adapter & rhs) const;
          Assumes at least 'this' or 'rhs' is a special value.
        3. -
          int_adapter mult_div_specials(const int & rhs) const;
          Assumes 'this' is a special value.
          4. +
          int_adapter mult_div_specials(const int & rhs) const;
          Assumes 'this' is a special value.
        @@ -197,7 +197,7 @@
        -PrevUpHomeNext +PrevUpHomeNext
        diff --git a/doc/html/boost/date_time/iso_extended_format.html b/doc/html/boost/date_time/iso_extended_format.html index bde4e0e437..67d77e9d00 100644 --- a/doc/html/boost/date_time/iso_extended_format.html +++ b/doc/html/boost/date_time/iso_extended_format.html @@ -36,16 +36,16 @@ class iso_extended_format : public boost::date_time::iso_format_base< charT > { public: - // public static functions - static bool has_date_sep_chars(); + // public static functions + static bool has_date_sep_chars(); };
        -

        Description

        +

        Description

        -

        -iso_extended_format public static functions

        +

        +iso_extended_format public static functions

        1. -
          static bool has_date_sep_chars();
          Extended format needs char separators.
        +
        static bool has_date_sep_chars();
        Extended format needs char separators.
        diff --git a/doc/html/boost/date_time/iso_f_1_3_12_15_3_29_1_1_2.html b/doc/html/boost/date_time/iso_f_1_3_12_15_3_29_1_1_2.html deleted file mode 100644 index c5a4bc5831..0000000000 --- a/doc/html/boost/date_time/iso_f_1_3_12_15_3_29_1_1_2.html +++ /dev/null @@ -1,118 +0,0 @@ - - - - -Class iso_format_base<wchar_t> - - - - - - - - - - - - - - - -
        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
        -
        -
        -PrevUpHomeNext -
        -
        -
        -
        -

        Class iso_format_base<wchar_t>

        -

        boost::date_time::iso_format_base<wchar_t> — Class to provide common iso formatting spec.

        -
        -

        Synopsis

        -
        // In header: <boost/date_time/iso_format.hpp>
-
-
-class iso_format_base<wchar_t> {
-public:
-
-  // public static functions
-  static month_format_spec month_format();
-  static const wchar_t * not_a_date();
-  static const wchar_t * pos_infinity();
-  static const wchar_t * neg_infinity();
-  static wchar_t year_sep_char();
-  static wchar_t month_sep_char();
-  static wchar_t day_sep_char();
-  static wchar_t hour_sep_char();
-  static wchar_t minute_sep_char();
-  static wchar_t second_sep_char();
-  static wchar_t period_start_char();
-  static wchar_t time_start_char();
-  static wchar_t week_start_char();
-  static wchar_t period_sep_char();
-  static wchar_t time_sep_char();
-  static wchar_t fractional_time_sep_char();
-  static bool is_component_sep(wchar_t);
-  static bool is_fractional_time_sep(wchar_t);
-  static bool is_timezone_sep(wchar_t);
-  static wchar_t element_sep_char();
-};
        -
        -

        Description

        -
        -

        -iso_format_base public static functions

        -
          -
        1. -
          static month_format_spec month_format();
          Describe month format – its an integer in iso format.
          2. -
        2. -
          static const wchar_t * not_a_date();
          String used printed is date is invalid.
          3. -
        3. -
          static const wchar_t * pos_infinity();
          String used to for positive infinity value.
          4. -
        4. -
          static const wchar_t * neg_infinity();
          String used to for positive infinity value.
          5. -
        5. -
          static wchar_t year_sep_char();
          ISO char for a year – used in durations.
          6. -
        6. -
          static wchar_t month_sep_char();
          ISO char for a month.
          7. -
        7. -
          static wchar_t day_sep_char();
          ISO char for a day.
          8. -
        8. -
          static wchar_t hour_sep_char();
          char for minute
          9. -
        9. -
          static wchar_t minute_sep_char();
          char for minute
          10. -
        10. -
          static wchar_t second_sep_char();
          char for second
          11. -
        11. -
          static wchar_t period_start_char();
          ISO char for a period.
          12. -
        12. -
          static wchar_t time_start_char();
          Used in time in mixed strings to set start of time.
          13. -
        13. -
          static wchar_t week_start_char();
          Used in mixed strings to identify start of a week number.
          14. -
        14. -
          static wchar_t period_sep_char();
          Separators for periods.
          15. -
        15. -
          static wchar_t time_sep_char();
          Separator for hh:mm:ss.
          16. -
        16. -
          static wchar_t fractional_time_sep_char();
          Preferred Separator for hh:mm:ss,decimal_fraction.
          17. -
        17. static bool is_component_sep(wchar_t sep);
          18. -
        18. static bool is_fractional_time_sep(wchar_t sep);
          19. -
        19. static bool is_timezone_sep(wchar_t sep);
          20. -
        20. static wchar_t element_sep_char();
          21. -
        -
        -
        -
        - - - -
        Copyright © 2001-2005 CrystalClear Software, Inc

        Subject to the Boost Software License, Version 1.0. (See accompanying file - LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

        -
        -
        -
        -PrevUpHomeNext -
        - - diff --git a/doc/html/boost/date_time/iso_f_1_3_13_15_3_29_1_1_2.html b/doc/html/boost/date_time/iso_f_1_3_13_15_3_29_1_1_2.html new file mode 100644 index 0000000000..b54f195710 --- /dev/null +++ b/doc/html/boost/date_time/iso_f_1_3_13_15_3_29_1_1_2.html @@ -0,0 +1,118 @@ + + + + +Class iso_format_base<wchar_t> + + + + + + + + + + + + + + + +
        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
        +
        +
        +PrevUpHomeNext +
        +
        +
        +
        +

        Class iso_format_base<wchar_t>

        +

        boost::date_time::iso_format_base<wchar_t> — Class to provide common iso formatting spec.

        +
        +

        Synopsis

        +
        // In header: <boost/date_time/iso_format.hpp>
+
+
+class iso_format_base<wchar_t> {
+public:
+
+  // public static functions
+  static month_format_spec month_format();
+  static const wchar_t * not_a_date();
+  static const wchar_t * pos_infinity();
+  static const wchar_t * neg_infinity();
+  static wchar_t year_sep_char();
+  static wchar_t month_sep_char();
+  static wchar_t day_sep_char();
+  static wchar_t hour_sep_char();
+  static wchar_t minute_sep_char();
+  static wchar_t second_sep_char();
+  static wchar_t period_start_char();
+  static wchar_t time_start_char();
+  static wchar_t week_start_char();
+  static wchar_t period_sep_char();
+  static wchar_t time_sep_char();
+  static wchar_t fractional_time_sep_char();
+  static bool is_component_sep(wchar_t);
+  static bool is_fractional_time_sep(wchar_t);
+  static bool is_timezone_sep(wchar_t);
+  static wchar_t element_sep_char();
+};
        +
        +

        Description

        +
        +

        +iso_format_base public static functions

        +
          +
        1. +
          static month_format_spec month_format();
          Describe month format – its an integer in iso format.
          2. +
        2. +
          static const wchar_t * not_a_date();
          String used printed is date is invalid.
          3. +
        3. +
          static const wchar_t * pos_infinity();
          String used to for positive infinity value.
          4. +
        4. +
          static const wchar_t * neg_infinity();
          String used to for positive infinity value.
          5. +
        5. +
          static wchar_t year_sep_char();
          ISO char for a year – used in durations.
          6. +
        6. +
          static wchar_t month_sep_char();
          ISO char for a month.
          7. +
        7. +
          static wchar_t day_sep_char();
          ISO char for a day.
          8. +
        8. +
          static wchar_t hour_sep_char();
          char for minute
          9. +
        9. +
          static wchar_t minute_sep_char();
          char for minute
          10. +
        10. +
          static wchar_t second_sep_char();
          char for second
          11. +
        11. +
          static wchar_t period_start_char();
          ISO char for a period.
          12. +
        12. +
          static wchar_t time_start_char();
          Used in time in mixed strings to set start of time.
          13. +
        13. +
          static wchar_t week_start_char();
          Used in mixed strings to identify start of a week number.
          14. +
        14. +
          static wchar_t period_sep_char();
          Separators for periods.
          15. +
        15. +
          static wchar_t time_sep_char();
          Separator for hh:mm:ss.
          16. +
        16. +
          static wchar_t fractional_time_sep_char();
          Preferred Separator for hh:mm:ss,decimal_fraction.
          17. +
        17. static bool is_component_sep(wchar_t sep);
          18. +
        18. static bool is_fractional_time_sep(wchar_t sep);
          19. +
        19. static bool is_timezone_sep(wchar_t sep);
          20. +
        20. static wchar_t element_sep_char();
          21. +
        +
        +
        +
        + + + +
        Copyright © 2001-2005 CrystalClear Software, Inc

        Subject to the Boost Software License, Version 1.0. (See accompanying file + LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

        +
        +
        +
        +PrevUpHomeNext +
        + + diff --git a/doc/html/boost/date_time/iso_format.html b/doc/html/boost/date_time/iso_format.html index 04ba51a1c6..cef04c39cf 100644 --- a/doc/html/boost/date_time/iso_format.html +++ b/doc/html/boost/date_time/iso_format.html @@ -7,7 +7,7 @@ - + @@ -21,7 +21,7 @@
        -PrevUpHomeNext +PrevUpHomeNext
        @@ -36,16 +36,16 @@ class iso_format : public boost::date_time::iso_format_base< charT > { public: - // public static functions - static bool has_date_sep_chars(); + // public static functions + static bool has_date_sep_chars(); };
        -

        Description

        +

        Description

        -

        -iso_format public static functions

        +

        +iso_format public static functions

        1. -
          static bool has_date_sep_chars();
          The ios standard format doesn't use char separators.
        +
        static bool has_date_sep_chars();
        The ios standard format doesn't use char separators.
        @@ -57,7 +57,7 @@
        -PrevUpHomeNext +PrevUpHomeNext
        diff --git a/doc/html/boost/date_time/iso_format_base.html b/doc/html/boost/date_time/iso_format_base.html index 8395d40873..e591b7f2ec 100644 --- a/doc/html/boost/date_time/iso_format_base.html +++ b/doc/html/boost/date_time/iso_format_base.html @@ -7,8 +7,8 @@ - - + + @@ -21,7 +21,7 @@
        -PrevUpHomeNext +PrevUpHomeNext
        @@ -36,75 +36,75 @@ class iso_format_base { public: - // public static functions - static month_format_spec month_format(); - static const charT * not_a_date(); - static const charT * pos_infinity(); - static const charT * neg_infinity(); - static charT year_sep_char(); - static charT month_sep_char(); - static charT day_sep_char(); - static charT hour_sep_char(); - static charT minute_sep_char(); - static charT second_sep_char(); - static charT period_start_char(); - static charT time_start_char(); - static charT week_start_char(); - static charT period_sep_char(); - static charT time_sep_char(); - static charT fractional_time_sep_char(); - static bool is_component_sep(charT); - static bool is_fractional_time_sep(charT); - static bool is_timezone_sep(charT); - static charT element_sep_char(); + // public static functions + static month_format_spec month_format(); + static const charT * not_a_date(); + static const charT * pos_infinity(); + static const charT * neg_infinity(); + static charT year_sep_char(); + static charT month_sep_char(); + static charT day_sep_char(); + static charT hour_sep_char(); + static charT minute_sep_char(); + static charT second_sep_char(); + static charT period_start_char(); + static charT time_start_char(); + static charT week_start_char(); + static charT period_sep_char(); + static charT time_sep_char(); + static charT fractional_time_sep_char(); + static bool is_component_sep(charT); + static bool is_fractional_time_sep(charT); + static bool is_timezone_sep(charT); + static charT element_sep_char(); };
        -

        Description

        +

        Description

        -

        -iso_format_base public static functions

        +

        +iso_format_base public static functions

        1. -
          static month_format_spec month_format();
          Describe month format – its an integer in iso format.
          2. +
          static month_format_spec month_format();
          Describe month format – its an integer in iso format.
        2. -
          static const charT * not_a_date();
          String used printed is date is invalid.
          3. +
          static const charT * not_a_date();
          String used printed is date is invalid.
        3. -
          static const charT * pos_infinity();
          String used to for positive infinity value.
          4. +
          static const charT * pos_infinity();
          String used to for positive infinity value.
        4. -
          static const charT * neg_infinity();
          String used to for positive infinity value.
          5. +
          static const charT * neg_infinity();
          String used to for positive infinity value.
        5. -
          static charT year_sep_char();
          ISO char for a year – used in durations.
          6. +
          static charT year_sep_char();
          ISO char for a year – used in durations.
        6. -
          static charT month_sep_char();
          ISO char for a month.
          7. +
          static charT month_sep_char();
          ISO char for a month.
        7. -
          static charT day_sep_char();
          ISO char for a day.
          8. +
          static charT day_sep_char();
          ISO char for a day.
        8. -
          static charT hour_sep_char();
          char for minute
          9. +
          static charT hour_sep_char();
          char for minute
        9. -
          static charT minute_sep_char();
          char for minute
          10. +
          static charT minute_sep_char();
          char for minute
        10. -
          static charT second_sep_char();
          char for second
          11. +
          static charT second_sep_char();
          char for second
        11. -
          static charT period_start_char();
          ISO char for a period.
          12. +
          static charT period_start_char();
          ISO char for a period.
        12. -
          static charT time_start_char();
          Used in time in mixed strings to set start of time.
          13. +
          static charT time_start_char();
          Used in time in mixed strings to set start of time.
        13. -
          static charT week_start_char();
          Used in mixed strings to identify start of a week number.
          14. +
          static charT week_start_char();
          Used in mixed strings to identify start of a week number.
        14. -
          static charT period_sep_char();
          Separators for periods.
          15. +
          static charT period_sep_char();
          Separators for periods.
        15. -
          static charT time_sep_char();
          Separator for hh:mm:ss.
          16. +
          static charT time_sep_char();
          Separator for hh:mm:ss.
        16. -
          static charT fractional_time_sep_char();
          Preferred Separator for hh:mm:ss,decimal_fraction.
          17. -
        17. static bool is_component_sep(charT sep);
          18. -
        18. static bool is_fractional_time_sep(charT sep);
          19. -
        19. static bool is_timezone_sep(charT sep);
          20. -
        20. static charT element_sep_char();
          21. +
          static charT fractional_time_sep_char();
          Preferred Separator for hh:mm:ss,decimal_fraction. +
        21. static bool is_component_sep(charT sep);
          22. +
        22. static bool is_fractional_time_sep(charT sep);
          23. +
        23. static bool is_timezone_sep(charT sep);
          24. +
        24. static charT element_sep_char();
        -

        Specializations

        -
        +

        Specializations

        +
        @@ -116,7 +116,7 @@
        -PrevUpHomeNext +PrevUpHomeNext
        diff --git a/doc/html/boost/date_time/last_kday_of_month.html b/doc/html/boost/date_time/last_kday_of_month.html index ab859c4717..eda67c31be 100644 --- a/doc/html/boost/date_time/last_kday_of_month.html +++ b/doc/html/boost/date_time/last_kday_of_month.html @@ -45,25 +45,25 @@ typedef date_type::duration_type duration_type; // construct/copy/destruct - last_kday_of_month(day_of_week_type, month_type); + last_kday_of_month(day_of_week_type, month_type); - // public member functions - virtual date_type get_date(year_type) const; - month_type month() const; - day_of_week_type day_of_week() const; - virtual std::string to_string() const; + // public member functions + virtual date_type get_date(year_type) const; + month_type month() const; + day_of_week_type day_of_week() const; + virtual std::string to_string() const; };
        -

        Description

        +

        Description

        Useful generator functor for finding holidays and daylight savings Get the last day of the month and then calculate the difference to the last previous day.

        -

        +

        last_kday_of_month public construct/copy/destruct

        1. -
          last_kday_of_month(day_of_week_type dow, month_type m);
          Specify the date spec like last 'Sunday' in 'April' spec.

          +

          last_kday_of_month(day_of_week_type dow, month_type m);
          Specify the date spec like last 'Sunday' in 'April' spec.

          @@ -93,15 +93,15 @@
          -

          -last_kday_of_month public member functions

          +

          +last_kday_of_month public member functions

          1. -
            virtual date_type get_date(year_type year) const;
            Return a concrete date when provided with a year specific year.
            2. -
          2. month_type month() const;
            3. -
          3. day_of_week_type day_of_week() const;
            4. +
            virtual date_type get_date(year_type year) const;
            Return a concrete date when provided with a year specific year. +
          4. month_type month() const;
            5. +
          5. day_of_week_type day_of_week() const;
          6. -
            virtual std::string to_string() const;
            Returns string suitable for use in POSIX time zone string.

            Returns a string formatted as "M4.5.0" ==> last Sunday in April.

            +
            virtual std::string to_string() const;
            Returns string suitable for use in POSIX time zone string.

            Returns a string formatted as "M4.5.0" ==> last Sunday in April.

          diff --git a/doc/html/boost/date_time/local_adjustor.html b/doc/html/boost/date_time/local_adjustor.html index 45b504e4f2..f7b8c6bf5e 100644 --- a/doc/html/boost/date_time/local_adjustor.html +++ b/doc/html/boost/date_time/local_adjustor.html @@ -40,13 +40,13 @@ typedeftime_type::date_typedate_type;typedefstatic_local_time_adjustor<time_type,dst_rule,utc_adjustment<time_duration_type,utc_offset>>dst_adjustor; - // public static functions - statictime_typeutc_to_local(consttime_type&); + // public static functions + statictime_typeutc_to_local(consttime_type&);statictime_type - local_to_utc(consttime_type&,date_time::dst_flags=date_time::calculate); + local_to_utc(consttime_type&,date_time::dst_flags=date_time::calculate);};
          -

          Description

          +

          Description

          Use this template to create the timezone to utc convertors as required.

          This class will also work for other regions that don't use dst and have a utc offset which is an integral number of hours.

          Template Parameters -time_type – Time class to use -utc_offset – Number hours local time is adjust from utc -use_dst – true (default) if region uses dst, false otherwise For example:

          @@ -59,14 +59,14 @@

          -

          -local_adjustor public static functions

          +

          +local_adjustor public static functions

          1. -
            static time_type utc_to_local(const time_type & t);
            Convert a utc time to local time.
            2. +
            static time_type utc_to_local(const time_type & t);
            Convert a utc time to local time. 
          2. static time_type 
-local_to_utc(const time_type & t, 
+local_to_utc(const time_type & t, 
              date_time::dst_flags dst = date_time::calculate);
            Convert a local time to utc.
          diff --git a/doc/html/boost/date_time/microsec_clock.html b/doc/html/boost/date_time/microsec_clock.html index 766fa5cd92..c18b18faed 100644 --- a/doc/html/boost/date_time/microsec_clock.html +++ b/doc/html/boost/date_time/microsec_clock.html @@ -40,41 +40,41 @@ typedef time_type::time_duration_type time_duration_type; typedef time_duration_type::rep_type resolution_traits_type; - // public static functions + // public static functions template<typename time_zone_type> - static time_type local_time(shared_ptr< time_zone_type >); - static time_type local_time(); - static time_type universal_time(); + static time_type local_time(shared_ptr< time_zone_type >); + static time_type local_time(); + static time_type universal_time(); - // private static functions - static time_type create_time(time_converter); + // private static functions + static time_type create_time(time_converter); static boost::uint64_t - file_time_to_microseconds(boost::winapi::FILETIME_ const &); + file_time_to_microseconds(boost::winapi::FILETIME_ const &); };
          -

          Description

          +

          Description

          A high precision clock that measures the local time at a resolution up to microseconds and adjusts to the resolution of the time system. For example, for the a library configuration with nano second resolution, the last 3 places of the fractional seconds will always be 000 since there are 1000 nano-seconds in a micro second.

          -

          -microsec_clock public static functions

          +

          +microsec_clock public static functions

          1. template<typename time_zone_type> 
-  static time_type local_time(shared_ptr< time_zone_type > tz_ptr);
            return a local time object for the given zone, based on computer clock
            2. + static time_type local_time(shared_ptr< time_zone_type > tz_ptr);return a local time object for the given zone, based on computer clock
          2. -
            static time_type local_time();
            Returns the local time based on computer clock settings.
            3. +
            static time_type local_time();
            Returns the local time based on computer clock settings.
          3. -
            static time_type universal_time();
            Returns the UTC time based on computer settings.
            4. +
            static time_type universal_time();
            Returns the UTC time based on computer settings.
          -

          -microsec_clock private static functions

          +

          +microsec_clock private static functions

            -
          1. static time_type create_time(time_converter converter);
            2. +
          2. static time_type create_time(time_converter converter);
          3. static boost::uint64_t 
-file_time_to_microseconds(boost::winapi::FILETIME_ const & ft);
            +file_time_to_microseconds(boost::winapi::FILETIME_ const & ft);

            The function converts file_time into number of microseconds elapsed since 1970-Jan-01

          diff --git a/doc/html/boost/date_time/month_formatter.html b/doc/html/boost/date_time/month_formatter.html index 21a59076f6..675f675608 100644 --- a/doc/html/boost/date_time/month_formatter.html +++ b/doc/html/boost/date_time/month_formatter.html @@ -7,7 +7,7 @@ - + @@ -21,7 +21,7 @@
          -PrevUpHomeNext +PrevUpHomeNext
          @@ -36,23 +36,23 @@ class month_formatter { public: - // public static functions - static std::ostream & format_month(const month_type &, std::ostream &); - static ostream_type & format_month(const month_type &, ostream_type &); + // public static functions + static std::ostream & format_month(const month_type &, std::ostream &); + static ostream_type & format_month(const month_type &, ostream_type &); };
          -

          Description

          +

          Description

          -

          -month_formatter public static functions

          +

          +month_formatter public static functions

          1. static std::ostream & 
-format_month(const month_type & month, std::ostream & os);
            Formats a month as as string into an ostream.

            This function demands that month_type provide functions for converting to short and long strings if that capability is used.

            +format_month(const month_type & month, std::ostream & os);Formats a month as as string into an ostream.

            This function demands that month_type provide functions for converting to short and long strings if that capability is used. 

          2. static ostream_type & 
-format_month(const month_type & month, ostream_type & os);
            Formats a month as as string into an ostream.

            This function demands that month_type provide functions for converting to short and long strings if that capability is used.

            +format_month(const month_type & month, ostream_type & os);Formats a month as as string into an ostream.

            This function demands that month_type provide functions for converting to short and long strings if that capability is used.

          @@ -66,7 +66,7 @@
        -PrevUpHomeNext +PrevUpHomeNext
        diff --git a/doc/html/boost/date_time/month_functor.html b/doc/html/boost/date_time/month_functor.html index 83fe3a642e..3f5ab155d1 100644 --- a/doc/html/boost/date_time/month_functor.html +++ b/doc/html/boost/date_time/month_functor.html @@ -42,29 +42,29 @@ typedef cal_type::day_type day_type; // construct/copy/destruct - month_functor(int); + month_functor(int); - // public member functions - duration_type get_offset(const date_type &) const; - duration_type get_neg_offset(const date_type &) const; + // public member functions + duration_type get_offset(const date_type &) const; + duration_type get_neg_offset(const date_type &) const; };
        -

        Description

        +

        Description

        This adjustment function provides the logic for 'month-based' advancement on a ymd based calendar. The policy it uses to handle the non existant end of month days is to back up to the last day of the month. Also, if the starting date is the last day of a month, this functor will attempt to adjust to the end of the month.

        -

        +

        month_functor public construct/copy/destruct

        -
        1. month_functor(int f);
        +
        1. month_functor(int f);
        -

        -month_functor public member functions

        +

        +month_functor public member functions

          -
        1. duration_type get_offset(const date_type & d) const;
          2. +
        2. duration_type get_offset(const date_type & d) const;
        3. -
          duration_type get_neg_offset(const date_type & d) const;
          Returns a negative duration_type.
          4. +
          duration_type get_neg_offset(const date_type & d) const;
          Returns a negative duration_type.
        diff --git a/doc/html/boost/date_time/months_duration.html b/doc/html/boost/date_time/months_duration.html index b0a3b0c372..4611258337 100644 --- a/doc/html/boost/date_time/months_duration.html +++ b/doc/html/boost/date_time/months_duration.html @@ -36,64 +36,64 @@ class months_duration { public: // construct/copy/destruct - months_duration(int_rep); - months_duration(special_values); + months_duration(int_rep); + months_duration(special_values); - // public member functions - int_rep number_of_months() const; - duration_type get_neg_offset(const date_type &) const; - duration_type get_offset(const date_type &) const; - bool operator==(const months_type &) const; - bool operator!=(const months_type &) const; - months_type operator+(const months_type &) const; - months_type & operator+=(const months_type &); - months_type operator-(const months_type &) const; - months_type & operator-=(const months_type &); - months_type operator*(const int_type) const; - months_type & operator*=(const int_type); - months_type operator/(const int_type) const; - months_type & operator/=(const int_type); - months_type operator+(const years_type &) const; - months_type & operator+=(const years_type &); - months_type operator-(const years_type &) const; - months_type & operator-=(const years_type &); + // public member functions + int_rep number_of_months() const; + duration_type get_neg_offset(const date_type &) const; + duration_type get_offset(const date_type &) const; + bool operator==(const months_type &) const; + bool operator!=(const months_type &) const; + months_type operator+(const months_type &) const; + months_type & operator+=(const months_type &); + months_type operator-(const months_type &) const; + months_type & operator-=(const months_type &); + months_type operator*(const int_type) const; + months_type & operator*=(const int_type); + months_type operator/(const int_type) const; + months_type & operator/=(const int_type); + months_type operator+(const years_type &) const; + months_type & operator+=(const years_type &); + months_type operator-(const years_type &) const; + months_type & operator-=(const years_type &); };
        -

        Description

        +

        Description

        A logical month enables things like: "date(2002,Mar,2) + months(2) -> 2002-May2". If the date is a last day-of-the-month, the result will also be a last-day-of-the-month.

        -

        +

        months_duration public construct/copy/destruct

          -
        1. months_duration(int_rep num);
          2. -
        2. months_duration(special_values sv);
          3. +
        3. months_duration(int_rep num);
          4. +
        4. months_duration(special_values sv);
        -

        -months_duration public member functions

        +

        +months_duration public member functions

          -
        1. int_rep number_of_months() const;
          2. +
        2. int_rep number_of_months() const;
        3. -
          duration_type get_neg_offset(const date_type & d) const;
          returns a negative duration
          4. -
        4. duration_type get_offset(const date_type & d) const;
          5. -
        5. bool operator==(const months_type & rhs) const;
          6. -
        6. bool operator!=(const months_type & rhs) const;
          7. -
        7. months_type operator+(const months_type & rhs) const;
          8. -
        8. months_type & operator+=(const months_type & rhs);
          9. -
        9. months_type operator-(const months_type & rhs) const;
          10. -
        10. months_type & operator-=(const months_type & rhs);
          11. -
        11. months_type operator*(const int_type rhs) const;
          12. -
        12. months_type & operator*=(const int_type rhs);
          13. -
        13. months_type operator/(const int_type rhs) const;
          14. -
        14. months_type & operator/=(const int_type rhs);
          15. -
        15. months_type operator+(const years_type & y) const;
          16. -
        16. months_type & operator+=(const years_type & y);
          17. -
        17. months_type operator-(const years_type & y) const;
          18. -
        18. months_type & operator-=(const years_type & y);
          19. +
          duration_type get_neg_offset(const date_type & d) const;
          returns a negative duration +
        19. duration_type get_offset(const date_type & d) const;
          20. +
        20. bool operator==(const months_type & rhs) const;
          21. +
        21. bool operator!=(const months_type & rhs) const;
          22. +
        22. months_type operator+(const months_type & rhs) const;
          23. +
        23. months_type & operator+=(const months_type & rhs);
          24. +
        24. months_type operator-(const months_type & rhs) const;
          25. +
        25. months_type & operator-=(const months_type & rhs);
          26. +
        26. months_type operator*(const int_type rhs) const;
          27. +
        27. months_type & operator*=(const int_type rhs);
          28. +
        28. months_type operator/(const int_type rhs) const;
          29. +
        29. months_type & operator/=(const int_type rhs);
          30. +
        30. months_type operator+(const years_type & y) const;
          31. +
        31. months_type & operator+=(const years_type & y);
          32. +
        32. months_type operator-(const years_type & y) const;
          33. +
        33. months_type & operator-=(const years_type & y);
        diff --git a/doc/html/boost/date_time/next_weekday.html b/doc/html/boost/date_time/next_weekday.html index 16b227c87a..4fd346a938 100644 --- a/doc/html/boost/date_time/next_weekday.html +++ b/doc/html/boost/date_time/next_weekday.html @@ -36,7 +36,7 @@ template<typename date_type, typename weekday_type> date_type next_weekday(const date_type & d, const weekday_type & wd);
        -

        Description

        +

        Description

        Generates a date object representing the date of the following weekday from the given date. If the date given is 2004-May-9 (a Sunday) and the given weekday is Tuesday then the resulting date will be 2004-May-11.

        diff --git a/doc/html/boost/date_time/nth_kday_of_month.html b/doc/html/boost/date_time/nth_kday_of_month.html index 02201d3976..2db5df0253 100644 --- a/doc/html/boost/date_time/nth_kday_of_month.html +++ b/doc/html/boost/date_time/nth_kday_of_month.html @@ -47,39 +47,39 @@ enum week_num { first = =1, second, third, fourth, fifth }; // construct/copy/destruct - nth_kday_of_month(week_num, day_of_week_type, month_type); + nth_kday_of_month(week_num, day_of_week_type, month_type); - // public member functions - virtual date_type get_date(year_type) const; - month_type month() const; - week_num nth_week() const; - day_of_week_type day_of_week() const; - const char * nth_week_as_str() const; - virtual std::string to_string() const; + // public member functions + virtual date_type get_date(year_type) const; + month_type month() const; + week_num nth_week() const; + day_of_week_type day_of_week() const; + const char * nth_week_as_str() const; + virtual std::string to_string() const; };
        -

        Description

        +

        Description

        Based on the idea in Cal. Calc. for finding holidays that are the 'first Monday of September'. When instantiated with 'fifth' kday of month, the result will be the last kday of month which can be the fourth or fifth depending on the structure of the month.

        The algorithm here basically guesses for the first day of the month. Then finds the first day of the correct type. That is, if the first of the month is a Tuesday and it needs Wenesday then we simply increment by a day and then we can add the length of a week until we get to the 'nth kday'. There are probably more efficient algorithms based on using a mod 7, but this one works reasonably well for basic applications.

        -

        +

        nth_kday_of_month public construct/copy/destruct

        -
        1. nth_kday_of_month(week_num week_no, day_of_week_type dow, month_type m);
        +
        1. nth_kday_of_month(week_num week_no, day_of_week_type dow, month_type m);
        -

        -nth_kday_of_month public member functions

        +

        +nth_kday_of_month public member functions

        1. -
          virtual date_type get_date(year_type y) const;
          Return a concrete date when provided with a year specific year.
          2. -
        2. month_type month() const;
          3. -
        3. week_num nth_week() const;
          4. -
        4. day_of_week_type day_of_week() const;
          5. -
        5. const char * nth_week_as_str() const;
          6. +
          virtual date_type get_date(year_type y) const;
          Return a concrete date when provided with a year specific year. +
        6. month_type month() const;
          7. +
        7. week_num nth_week() const;
          8. +
        8. day_of_week_type day_of_week() const;
          9. +
        9. const char * nth_week_as_str() const;
        10. -
          virtual std::string to_string() const;
          Returns string suitable for use in POSIX time zone string.

          Returns a string formatted as "M4.3.0" ==> 3rd Sunday in April.

          +
          virtual std::string to_string() const;
          Returns string suitable for use in POSIX time zone string.

          Returns a string formatted as "M4.3.0" ==> 3rd Sunday in April.

        diff --git a/doc/html/boost/date_time/null_dst_rules.html b/doc/html/boost/date_time/null_dst_rules.html index 0671ff307d..29a8e7e7c7 100644 --- a/doc/html/boost/date_time/null_dst_rules.html +++ b/doc/html/boost/date_time/null_dst_rules.html @@ -39,30 +39,30 @@ typedef time_duration_type_ time_duration_type; typedef date_type_ date_type; - // public static functions + // public static functions static time_is_dst_result - local_is_dst(const date_type &, const time_duration_type &); + local_is_dst(const date_type &, const time_duration_type &); static time_is_dst_result - utc_is_dst(const date_type &, const time_duration_type &); - static bool is_dst_boundary_day(date_type); - static time_duration_type dst_offset(); + utc_is_dst(const date_type &, const time_duration_type &); + static bool is_dst_boundary_day(date_type); + static time_duration_type dst_offset(); };
        -

        Description

        +

        Description

        -

        -null_dst_rules public static functions

        +

        +null_dst_rules public static functions

        1. static time_is_dst_result 
-local_is_dst(const date_type &, const time_duration_type &);
          Calculates if the given local time is dst or not.

          +local_is_dst(const date_type &, const time_duration_type &);Calculates if the given local time is dst or not. 

        2. static time_is_dst_result 
-utc_is_dst(const date_type &, const time_duration_type &);
          Calculates if the given utc time is in dst.
          3. -
        3. static bool is_dst_boundary_day(date_type);
          4. -
        4. static time_duration_type dst_offset();
          5. +utc_is_dst(const date_type &, const time_duration_type &);Calculates if the given utc time is in dst. +
        5. static bool is_dst_boundary_day(date_type);
          6. +
        6. static time_duration_type dst_offset();
        diff --git a/doc/html/boost/date_time/opera_1_3_12_15_3_28_1_1_2.html b/doc/html/boost/date_time/opera_1_3_12_15_3_28_1_1_2.html deleted file mode 100644 index 7898614aee..0000000000 --- a/doc/html/boost/date_time/opera_1_3_12_15_3_28_1_1_2.html +++ /dev/null @@ -1,57 +0,0 @@ - - - - -Function template operator<< - - - - - - - - - - - - - - - -
        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
        -
        -
        -PrevUpHomeNext -
        -
        -
        -
        -

        Function template operator<<

        -

        boost::date_time::operator<<

        -
        -

        Synopsis

        -
        // In header: <boost/date_time/int_adapter.hpp>
-
-
-template<typename charT, typename traits, typename int_type> 
-  std::basic_ostream< charT, traits > & 
-  operator<<(std::basic_ostream< charT, traits > & os, 
-             const int_adapter< int_type > & ia);
        -
        -

        Description

        -

        Expected output is either a numeric representation or a special values representation.
        - Ex. "12", "+infinity", "not-a-number", etc.

        -
        -
        - - - -
        Copyright © 2001-2005 CrystalClear Software, Inc

        Subject to the Boost Software License, Version 1.0. (See accompanying file - LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

        -
        -
        -
        -PrevUpHomeNext -
        - - diff --git a/doc/html/boost/date_time/opera_1_3_13_15_3_28_1_1_2.html b/doc/html/boost/date_time/opera_1_3_13_15_3_28_1_1_2.html new file mode 100644 index 0000000000..12d0ecdd2d --- /dev/null +++ b/doc/html/boost/date_time/opera_1_3_13_15_3_28_1_1_2.html @@ -0,0 +1,57 @@ + + + + +Function template operator<< + + + + + + + + + + + + + + + +
        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
        +
        +
        +PrevUpHomeNext +
        +
        +
        +
        +

        Function template operator<<

        +

        boost::date_time::operator<<

        +
        +

        Synopsis

        +
        // In header: <boost/date_time/int_adapter.hpp>
+
+
+template<typename charT, typename traits, typename int_type> 
+  std::basic_ostream< charT, traits > & 
+  operator<<(std::basic_ostream< charT, traits > & os, 
+             const int_adapter< int_type > & ia);
        +
        +

        Description

        +

        Expected output is either a numeric representation or a special values representation.
        + Ex. "12", "+infinity", "not-a-number", etc.

        +
        +
        + + + +
        Copyright © 2001-2005 CrystalClear Software, Inc

        Subject to the Boost Software License, Version 1.0. (See accompanying file + LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

        +
        +
        +
        +PrevUpHomeNext +
        + + diff --git a/doc/html/boost/date_time/ostre_1_3_12_15_3_49_1_1_1.html b/doc/html/boost/date_time/ostre_1_3_12_15_3_49_1_1_1.html deleted file mode 100644 index e3c5e52430..0000000000 --- a/doc/html/boost/date_time/ostre_1_3_12_15_3_49_1_1_1.html +++ /dev/null @@ -1,66 +0,0 @@ - - - - -Class template ostream_time_duration_formatter - - - - - - - - - - - - - - - -
        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
        -
        -
        -PrevUpHomeNext -
        -
        -
        -
        -

        Class template ostream_time_duration_formatter

        -

        boost::date_time::ostream_time_duration_formatter — Put a time type into a stream using appropriate facets.

        -
        -

        Synopsis

        -
        // In header: <boost/date_time/time_formatting_streams.hpp>
-
-template<typename time_duration_type, typename charT = char> 
-class ostream_time_duration_formatter {
-public:
-  // types
-  typedef std::basic_ostream< charT >                 ostream_type;           
-  typedef time_duration_type::fractional_seconds_type fractional_seconds_type;
-
-  // public static functions
-  static void duration_put(const time_duration_type &, ostream_type &);
-};
        -
        -

        Description

        -
        -

        -ostream_time_duration_formatter public static functions

        -
        1. -
          static void duration_put(const time_duration_type & td, ostream_type & os);
          Put time into an ostream.
        -
        -
        -
        - - - -
        Copyright © 2001-2005 CrystalClear Software, Inc

        Subject to the Boost Software License, Version 1.0. (See accompanying file - LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

        -
        -
        -
        -PrevUpHomeNext -
        - - diff --git a/doc/html/boost/date_time/ostre_1_3_12_15_3_49_1_1_3.html b/doc/html/boost/date_time/ostre_1_3_12_15_3_49_1_1_3.html deleted file mode 100644 index f2584128e8..0000000000 --- a/doc/html/boost/date_time/ostre_1_3_12_15_3_49_1_1_3.html +++ /dev/null @@ -1,67 +0,0 @@ - - - - -Class template ostream_time_period_formatter - - - - - - - - - - - - - - - -
        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
        -
        -
        -PrevUpHomeNext -
        -
        -
        -
        -

        Class template ostream_time_period_formatter

        -

        boost::date_time::ostream_time_period_formatter — Put a time period into a stream using appropriate facets.

        -
        -

        Synopsis

        -
        // In header: <boost/date_time/time_formatting_streams.hpp>
-
-template<typename time_period_type, typename charT = char> 
-class ostream_time_period_formatter {
-public:
-  // types
-  typedef std::basic_ostream< charT >                ostream_type;  
-  typedef time_period_type::point_type               time_type;     
-  typedef ostream_time_formatter< time_type, charT > time_formatter;
-
-  // public static functions
-  static void period_put(const time_period_type &, ostream_type &);
-};
        -
        -

        Description

        -
        -

        -ostream_time_period_formatter public static functions

        -
        1. -
          static void period_put(const time_period_type & tp, ostream_type & os);
          Put time into an ostream.
        -
        -
        -
        - - - -
        Copyright © 2001-2005 CrystalClear Software, Inc

        Subject to the Boost Software License, Version 1.0. (See accompanying file - LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

        -
        -
        -
        -PrevUpHomeNext -
        - - diff --git a/doc/html/boost/date_time/ostre_1_3_13_15_3_49_1_1_1.html b/doc/html/boost/date_time/ostre_1_3_13_15_3_49_1_1_1.html new file mode 100644 index 0000000000..8ae0db57e8 --- /dev/null +++ b/doc/html/boost/date_time/ostre_1_3_13_15_3_49_1_1_1.html @@ -0,0 +1,66 @@ + + + + +Class template ostream_time_duration_formatter + + + + + + + + + + + + + + + +
        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
        +
        +
        +PrevUpHomeNext +
        +
        +
        +
        +

        Class template ostream_time_duration_formatter

        +

        boost::date_time::ostream_time_duration_formatter — Put a time type into a stream using appropriate facets.

        +
        +

        Synopsis

        +
        // In header: <boost/date_time/time_formatting_streams.hpp>
+
+template<typename time_duration_type, typename charT = char> 
+class ostream_time_duration_formatter {
+public:
+  // types
+  typedef std::basic_ostream< charT >                 ostream_type;           
+  typedef time_duration_type::fractional_seconds_type fractional_seconds_type;
+
+  // public static functions
+  static void duration_put(const time_duration_type &, ostream_type &);
+};
        +
        +

        Description

        +
        +

        +ostream_time_duration_formatter public static functions

        +
        1. +
          static void duration_put(const time_duration_type & td, ostream_type & os);
          Put time into an ostream.
        +
        +
        +
        + + + +
        Copyright © 2001-2005 CrystalClear Software, Inc

        Subject to the Boost Software License, Version 1.0. (See accompanying file + LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

        +
        +
        +
        +PrevUpHomeNext +
        + + diff --git a/doc/html/boost/date_time/ostre_1_3_13_15_3_49_1_1_3.html b/doc/html/boost/date_time/ostre_1_3_13_15_3_49_1_1_3.html new file mode 100644 index 0000000000..fbbd63b53b --- /dev/null +++ b/doc/html/boost/date_time/ostre_1_3_13_15_3_49_1_1_3.html @@ -0,0 +1,67 @@ + + + + +Class template ostream_time_period_formatter + + + + + + + + + + + + + + + +
        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
        +
        +
        +PrevUpHomeNext +
        +
        +
        +
        +

        Class template ostream_time_period_formatter

        +

        boost::date_time::ostream_time_period_formatter — Put a time period into a stream using appropriate facets.

        +
        +

        Synopsis

        +
        // In header: <boost/date_time/time_formatting_streams.hpp>
+
+template<typename time_period_type, typename charT = char> 
+class ostream_time_period_formatter {
+public:
+  // types
+  typedef std::basic_ostream< charT >                ostream_type;  
+  typedef time_period_type::point_type               time_type;     
+  typedef ostream_time_formatter< time_type, charT > time_formatter;
+
+  // public static functions
+  static void period_put(const time_period_type &, ostream_type &);
+};
        +
        +

        Description

        +
        +

        +ostream_time_period_formatter public static functions

        +
        1. +
          static void period_put(const time_period_type & tp, ostream_type & os);
          Put time into an ostream.
        +
        +
        +
        + + + +
        Copyright © 2001-2005 CrystalClear Software, Inc

        Subject to the Boost Software License, Version 1.0. (See accompanying file + LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

        +
        +
        +
        +PrevUpHomeNext +
        + + diff --git a/doc/html/boost/date_time/ostream_date_formatter.html b/doc/html/boost/date_time/ostream_date_formatter.html index ce15551c3b..7fce6de69d 100644 --- a/doc/html/boost/date_time/ostream_date_formatter.html +++ b/doc/html/boost/date_time/ostream_date_formatter.html @@ -39,21 +39,21 @@ typedef std::basic_ostream< charT > ostream_type; typedef date_type::ymd_type ymd_type; - // public static functions - static void date_put(const date_type &, ostream_type &, const facet_type &); - static void date_put(const date_type &, ostream_type &); + // public static functions + static void date_put(const date_type &, ostream_type &, const facet_type &); + static void date_put(const date_type &, ostream_type &); };
        -

        Description

        +

        Description

        -

        -ostream_date_formatter public static functions

        +

        +ostream_date_formatter public static functions

        1. -
          static void date_put(const date_type & d, ostream_type & os, 
+
          static void date_put(const date_type & d, ostream_type & os, 
                      const facet_type & f);
          Put date into an ostream.
        2. -
          static void date_put(const date_type & d, ostream_type & os);
          Put date into an ostream.
          3. +
          static void date_put(const date_type & d, ostream_type & os);
          Put date into an ostream.
        diff --git a/doc/html/boost/date_time/ostream_month_formatter.html b/doc/html/boost/date_time/ostream_month_formatter.html index fcf237cd43..c167fc4519 100644 --- a/doc/html/boost/date_time/ostream_month_formatter.html +++ b/doc/html/boost/date_time/ostream_month_formatter.html @@ -39,17 +39,17 @@ typedef facet_type::month_type month_type; typedef std::basic_ostream< charT > ostream_type; - // public static functions - static void format_month(const month_type &, ostream_type &, + // public static functions + static void format_month(const month_type &, ostream_type &, const facet_type &); };
        -

        Description

        +

        Description

        -

        -ostream_month_formatter public static functions

        +

        +ostream_month_formatter public static functions

        1. -
          static void format_month(const month_type & month, ostream_type & os, 
+
          static void format_month(const month_type & month, ostream_type & os, 
                          const facet_type & f);
          Formats a month as as string into an output iterator.
        diff --git a/doc/html/boost/date_time/ostream_time_formatter.html b/doc/html/boost/date_time/ostream_time_formatter.html index b2873153f6..7dc7a805d9 100644 --- a/doc/html/boost/date_time/ostream_time_formatter.html +++ b/doc/html/boost/date_time/ostream_time_formatter.html @@ -7,8 +7,8 @@ - - + + @@ -21,7 +21,7 @@
        -PrevUpHomeNext +PrevUpHomeNext
        @@ -39,18 +39,18 @@ typedef std::basic_ostream< charT > ostream_type; typedef time_type::date_type date_type; typedef time_type::time_duration_type time_duration_type; - typedef ostream_time_duration_formatter< time_duration_type, charT > duration_formatter; + typedef ostream_time_duration_formatter< time_duration_type, charT > duration_formatter; - // public static functions - static void time_put(const time_type &, ostream_type &); + // public static functions + static void time_put(const time_type &, ostream_type &); };
        -

        Description

        +

        Description

        -

        -ostream_time_formatter public static functions

        +

        +ostream_time_formatter public static functions

        1. -
          static void time_put(const time_type & t, ostream_type & os);
          Put time into an ostream.
        +
        static void time_put(const time_type & t, ostream_type & os);
        Put time into an ostream.
        @@ -62,7 +62,7 @@
        -PrevUpHomeNext +PrevUpHomeNext
        diff --git a/doc/html/boost/date_time/ostream_weekday_formatter.html b/doc/html/boost/date_time/ostream_weekday_formatter.html index ecd9bff25e..e9c99bcdef 100644 --- a/doc/html/boost/date_time/ostream_weekday_formatter.html +++ b/doc/html/boost/date_time/ostream_weekday_formatter.html @@ -39,17 +39,17 @@ typedef facet_type::month_type month_type; typedef std::basic_ostream< charT > ostream_type; - // public static functions - static void format_weekday(const weekday_type &, ostream_type &, + // public static functions + static void format_weekday(const weekday_type &, ostream_type &, const facet_type &, bool); };
        -

        Description

        +

        Description

        -

        -ostream_weekday_formatter public static functions

        +

        +ostream_weekday_formatter public static functions

        1. -
          static void format_weekday(const weekday_type & wd, ostream_type & os, 
+
          static void format_weekday(const weekday_type & wd, ostream_type & os, 
                            const facet_type & f, bool as_long_string);
          Formats a month as as string into an output iterator.
        diff --git a/doc/html/boost/date_time/ostream_ymd_formatter.html b/doc/html/boost/date_time/ostream_ymd_formatter.html index 42fe47b17a..01a17eb682 100644 --- a/doc/html/boost/date_time/ostream_ymd_formatter.html +++ b/doc/html/boost/date_time/ostream_ymd_formatter.html @@ -41,16 +41,16 @@ typedef std::basic_ostream< charT > ostream_type; typedef std::basic_string< charT > foo_type; - // public static functions - static void ymd_put(ymd_type, ostream_type &, const facet_type &); + // public static functions + static void ymd_put(ymd_type, ostream_type &, const facet_type &); };
        -

        Description

        +

        Description

        -

        -ostream_ymd_formatter public static functions

        +

        +ostream_ymd_formatter public static functions

        1. -
          static void ymd_put(ymd_type ymd, ostream_type & os, const facet_type & f);
          Convert ymd to a standard string formatting policies.

          This is standard code for handling date formatting with year-month-day based date information. This function uses the format_type to control whether the string will contain separator characters, and if so what the character will be. In addtion, it can format the month as either an integer or a string as controled by the formatting policy

          +
          static void ymd_put(ymd_type ymd, ostream_type & os, const facet_type & f);
          Convert ymd to a standard string formatting policies.

          This is standard code for handling date formatting with year-month-day based date information. This function uses the format_type to control whether the string will contain separator characters, and if so what the character will be. In addtion, it can format the month as either an integer or a string as controled by the formatting policy

        diff --git a/doc/html/boost/date_time/parse_1_3_12_15_3_51_1_1_3.html b/doc/html/boost/date_time/parse_1_3_12_15_3_51_1_1_3.html deleted file mode 100644 index ff04180445..0000000000 --- a/doc/html/boost/date_time/parse_1_3_12_15_3_51_1_1_3.html +++ /dev/null @@ -1,55 +0,0 @@ - - - - -Function template parse_delimited_time_duration - - - - - - - - - - - - - - - -
        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
        -
        -
        -PrevUpHomeNext -
        -
        -
        -
        -

        Function template parse_delimited_time_duration

        -

        boost::date_time::parse_delimited_time_duration — Creates a time_duration object from a delimited string.

        -
        -

        Synopsis

        -
        // In header: <boost/date_time/time_parsing.hpp>
-
-
-template<typename time_duration> 
-  time_duration parse_delimited_time_duration(const std::string & s);
        -
        -

        Description

        -

        Expected format for string is "[-]h[h][:mm][:ss][.fff]". If the number of fractional digits provided is greater than the precision of the time duration type then the extra digits are truncated.

        -

        A negative duration will be created if the first character in string is a '-', all other '-' will be treated as delimiters. Accepted delimiters are "-:,.".

        -
        -
        - - - -
        Copyright © 2001-2005 CrystalClear Software, Inc

        Subject to the Boost Software License, Version 1.0. (See accompanying file - LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

        -
        -
        -
        -PrevUpHomeNext -
        - - diff --git a/doc/html/boost/date_time/parse_1_3_13_15_3_51_1_1_3.html b/doc/html/boost/date_time/parse_1_3_13_15_3_51_1_1_3.html new file mode 100644 index 0000000000..6ed53e8c67 --- /dev/null +++ b/doc/html/boost/date_time/parse_1_3_13_15_3_51_1_1_3.html @@ -0,0 +1,55 @@ + + + + +Function template parse_delimited_time_duration + + + + + + + + + + + + + + + +
        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
        +
        +
        +PrevUpHomeNext +
        +
        +
        +
        +

        Function template parse_delimited_time_duration

        +

        boost::date_time::parse_delimited_time_duration — Creates a time_duration object from a delimited string.

        +
        +

        Synopsis

        +
        // In header: <boost/date_time/time_parsing.hpp>
+
+
+template<typename time_duration> 
+  time_duration parse_delimited_time_duration(const std::string & s);
        +
        +

        Description

        +

        Expected format for string is "[-]h[h][:mm][:ss][.fff]". If the number of fractional digits provided is greater than the precision of the time duration type then the extra digits are truncated.

        +

        A negative duration will be created if the first character in string is a '-', all other '-' will be treated as delimiters. Accepted delimiters are "-:,.".

        +
        +
        + + + +
        Copyright © 2001-2005 CrystalClear Software, Inc

        Subject to the Boost Software License, Version 1.0. (See accompanying file + LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

        +
        +
        +
        +PrevUpHomeNext +
        + + diff --git a/doc/html/boost/date_time/parse_date.html b/doc/html/boost/date_time/parse_date.html index c81f65ba9a..c68c489b68 100644 --- a/doc/html/boost/date_time/parse_date.html +++ b/doc/html/boost/date_time/parse_date.html @@ -8,7 +8,7 @@ - + @@ -21,7 +21,7 @@
        -PrevUpHomeNext +PrevUpHomeNext
        @@ -36,7 +36,7 @@ template<typename date_type> date_type parse_date(const std::string & s, int order_spec = ymd_order_iso);
        -

        Description

        +

        Description

        Accepted formats are: "2003-02-10" or " 2003-Feb-10" or "2003-Feburary-10" The order in which the Month, Day, & Year appear in the argument string can be accomodated by passing in the appropriate ymd_order_spec

        @@ -48,7 +48,7 @@
        -PrevUpHomeNext +PrevUpHomeNext
        diff --git a/doc/html/boost/date_time/parse_match_result.html b/doc/html/boost/date_time/parse_match_result.html index dc4cd0c777..aaa34c0862 100644 --- a/doc/html/boost/date_time/parse_match_result.html +++ b/doc/html/boost/date_time/parse_match_result.html @@ -40,12 +40,12 @@ enum PARSE_STATE { PARSE_ERROR = = -1 }; // construct/copy/destruct - parse_match_result(); + parse_match_result(); - // public member functions - string_type remaining() const; - charT last_char() const; - bool has_remaining() const; + // public member functions + string_type remaining() const; + charT last_char() const; + bool has_remaining() const; // public data members string_type cache; @@ -53,22 +53,22 @@ short current_match; };
        -

        Description

        +

        Description

        -

        +

        parse_match_result public construct/copy/destruct

        -
        1. parse_match_result();
        +
        1. parse_match_result();
        -

        -parse_match_result public member functions

        +

        +parse_match_result public member functions

          -
        1. string_type remaining() const;
          2. -
        2. charT last_char() const;
          3. +
        3. string_type remaining() const;
          4. +
        4. charT last_char() const;
        5. -
          bool has_remaining() const;
          Returns true if more characters were parsed than was necessary.

          Should be used in conjunction with last_char() to get the remaining character.

          +
          bool has_remaining() const;
          Returns true if more characters were parsed than was necessary.

          Should be used in conjunction with last_char() to get the remaining character.

        diff --git a/doc/html/boost/date_time/partial_date.html b/doc/html/boost/date_time/partial_date.html index e0957b8a52..7530a75dc7 100644 --- a/doc/html/boost/date_time/partial_date.html +++ b/doc/html/boost/date_time/partial_date.html @@ -46,20 +46,20 @@ typedef duration_type::duration_rep duration_rep; // construct/copy/destruct - partial_date(day_type, month_type); - partial_date(duration_rep); + partial_date(day_type, month_type); + partial_date(duration_rep); - // public member functions - virtual date_type get_date(year_type) const; - date_type operator()(year_type) const; - bool operator==(const partial_date &) const; - bool operator<(const partial_date &) const; - month_type month() const; - day_type day() const; - virtual std::string to_string() const; + // public member functions + virtual date_type get_date(year_type) const; + date_type operator()(year_type) const; + bool operator==(const partial_date &) const; + bool operator<(const partial_date &) const; + month_type month() const; + day_type day() const; + virtual std::string to_string() const; };
        -

        Description

        +

        Description

        Example usage: 

        partial_date pd(1, Jan);
 partial_date pd2(70);
@@ -68,36 +68,36 @@

        -

        +

        partial_date public construct/copy/destruct

          -
        1. partial_date(day_type d, month_type m);
          2. +
        2. partial_date(day_type d, month_type m);
        3. -
          partial_date(duration_rep days);
          Partial date created from number of days into year. Range 1-366.

          Allowable values range from 1 to 366. 1=Jan1, 366=Dec31. If argument exceeds range, partial_date will be created with closest in-range value. 60 will always be Feb29, if get_date() is called with a non-leap year an exception will be thrown

          +
          partial_date(duration_rep days);
          Partial date created from number of days into year. Range 1-366.

          Allowable values range from 1 to 366. 1=Jan1, 366=Dec31. If argument exceeds range, partial_date will be created with closest in-range value. 60 will always be Feb29, if get_date() is called with a non-leap year an exception will be thrown

        -

        -partial_date public member functions

        +

        +partial_date public member functions

        1. -
          virtual date_type get_date(year_type y) const;
          Return a concrete date when provided with a year specific year.

          Will throw an 'invalid_argument' exception if a partial_date object, instantiated with Feb-29, has get_date called with a non-leap year. Example:

          +
          virtual date_type get_date(year_type y) const;
          Return a concrete date when provided with a year specific year.

          Will throw an 'invalid_argument' exception if a partial_date object, instantiated with Feb-29, has get_date called with a non-leap year. Example: 

          partial_date pd(29, Feb);
 pd.get_date(2003); // throws invalid_argument exception
 pg.get_date(2000); // returns 2000-2-29

          2. -
        2. date_type operator()(year_type y) const;
          3. -
        3. bool operator==(const partial_date & rhs) const;
          4. -
        4. bool operator<(const partial_date & rhs) const;
          5. -
        5. month_type month() const;
          6. -
        6. day_type day() const;
          7. +
        7. date_type operator()(year_type y) const;
          8. +
        8. bool operator==(const partial_date & rhs) const;
          9. +
        9. bool operator<(const partial_date & rhs) const;
          10. +
        10. month_type month() const;
          11. +
        11. day_type day() const;
        12. -
          virtual std::string to_string() const;
          Returns string suitable for use in POSIX time zone string.

          Returns string formatted with up to 3 digits: Jan-01 == "0" Feb-29 == "58" Dec-31 == "365"

          +
          virtual std::string to_string() const;
          Returns string suitable for use in POSIX time zone string.

          Returns string formatted with up to 3 digits: Jan-01 == "0" Feb-29 == "58" Dec-31 == "365"

        diff --git a/doc/html/boost/date_time/period.html b/doc/html/boost/date_time/period.html index 252bbfe4c1..807f368905 100644 --- a/doc/html/boost/date_time/period.html +++ b/doc/html/boost/date_time/period.html @@ -41,72 +41,72 @@ typedef duration_rep duration_type; // construct/copy/destruct - period(point_rep, point_rep); - period(point_rep, duration_rep); + period(point_rep, point_rep); + period(point_rep, duration_rep); - // public member functions - point_rep begin() const; - point_rep end() const; - point_rep last() const; - duration_rep length() const; - bool is_null() const; - bool operator==(const period &) const; - bool operator<(const period &) const; - void shift(const duration_rep &); - void expand(const duration_rep &); - bool contains(const point_rep &) const; - bool contains(const period &) const; - bool intersects(const period &) const; - bool is_adjacent(const period &) const; - bool is_before(const point_rep &) const; - bool is_after(const point_rep &) const; - period intersection(const period &) const; - period merge(const period &) const; - period span(const period &) const; + // public member functions + point_rep begin() const; + point_rep end() const; + point_rep last() const; + duration_rep length() const; + bool is_null() const; + bool operator==(const period &) const; + bool operator<(const period &) const; + void shift(const duration_rep &); + void expand(const duration_rep &); + bool contains(const point_rep &) const; + bool contains(const period &) const; + bool intersects(const period &) const; + bool is_adjacent(const period &) const; + bool is_before(const point_rep &) const; + bool is_after(const point_rep &) const; + period intersection(const period &) const; + period merge(const period &) const; + period span(const period &) const; };
        -

        Description

        +

        Description

        This template uses a class to represent a time point within the period and another class to represent a duration. As a result, this class is not appropriate for use when the number and duration representation are the same (eg: in the regular number domain).

        A period can be specified by providing either the begining point and a duration or the begining point and the end point( end is NOT part of the period but 1 unit past it. A period will be "invalid" if either end_point <= begin_point or the given duration is <= 0. Any valid period will return false for is_null().

        Zero length periods are also considered invalid. Zero length periods are periods where the begining and end points are the same, or, the given duration is zero. For a zero length period, the last point will be one unit less than the begining point.

        In the case that the begin and last are the same, the period has a length of one unit.

        The best way to handle periods is usually to provide a begining point and a duration. So, day1 + 7 days is a week period which includes all of the first day and 6 more days (eg: Sun to Sat).

        -

        +

        period public construct/copy/destruct

        1. -
          period(point_rep first_point, point_rep end_point);
          create a period from begin to last eg: [begin,end)

          If end <= begin then the period will be invalid

          +
          period(point_rep first_point, point_rep end_point);
          create a period from begin to last eg: [begin,end)

          If end <= begin then the period will be invalid

        2. -
          period(point_rep first_point, duration_rep len);
          create a period as [begin, begin+len)

          If len is <= 0 then the period will be invalid

          +
          period(point_rep first_point, duration_rep len);
          create a period as [begin, begin+len)

          If len is <= 0 then the period will be invalid

        -

        -period public member functions

        +

        +period public member functions

        1. -
          point_rep begin() const;
          Return the first element in the period.
          2. +
          point_rep begin() const;
          Return the first element in the period.
        2. -
          point_rep end() const;
          Return one past the last element.
          3. +
          point_rep end() const;
          Return one past the last element.
        3. -
          point_rep last() const;
          Return the last item in the period.
          4. +
          point_rep last() const;
          Return the last item in the period.
        4. -
          duration_rep length() const;
          Return the length of the period.
          5. +
          duration_rep length() const;
          Return the length of the period.
        5. -
          bool is_null() const;
          True if period is ill formed (length is zero or less)
          6. +
          bool is_null() const;
          True if period is ill formed (length is zero or less)
        6. -
          bool operator==(const period & rhs) const;
          Equality operator.
          7. +
          bool operator==(const period & rhs) const;
          Equality operator.
        7. -
          bool operator<(const period & rhs) const;
          Strict as defined by rhs.last <= lhs.last.
          8. +
          bool operator<(const period & rhs) const;
          Strict as defined by rhs.last <= lhs.last.
        8. -
          void shift(const duration_rep & d);
          Shift the start and end by the specified amount.
          9. +
          void shift(const duration_rep & d);
          Shift the start and end by the specified amount.
        9. -
          void expand(const duration_rep & d);
          +
          void expand(const duration_rep & d);

          Expands the size of the period by the duration on both ends.

          So before expand 

                  [-------]
@@ -121,23 +121,23 @@
        10. -
          bool contains(const point_rep & point) const;
          True if the point is inside the period, zero length periods contain no points.
          11. +
          bool contains(const point_rep & point) const;
          True if the point is inside the period, zero length periods contain no points.
        11. -
          bool contains(const period & other) const;
          True if this period fully contains (or equals) the other period.
          12. +
          bool contains(const period & other) const;
          True if this period fully contains (or equals) the other period.
        12. -
          bool intersects(const period & other) const;
          True if the periods overlap in any way.
          13. +
          bool intersects(const period & other) const;
          True if the periods overlap in any way.
        13. -
          bool is_adjacent(const period & other) const;
          True if periods are next to each other without a gap.
          14. +
          bool is_adjacent(const period & other) const;
          True if periods are next to each other without a gap.
        14. -
          bool is_before(const point_rep & point) const;
          True if all of the period is prior to the passed point or end <= t.
          15. +
          bool is_before(const point_rep & point) const;
          True if all of the period is prior to the passed point or end <= t.
        15. -
          bool is_after(const point_rep & point) const;
          True if all of the period is prior or t < start.
          16. +
          bool is_after(const point_rep & point) const;
          True if all of the period is prior or t < start.
        16. -
          period intersection(const period & other) const;
          Returns the period of intersection or invalid range no intersection.
          17. +
          period intersection(const period & other) const;
          Returns the period of intersection or invalid range no intersection.
        17. -
          period merge(const period & other) const;
          Returns the union of intersecting periods – or null period.
          18. +
          period merge(const period & other) const;
          Returns the union of intersecting periods – or null period.
        18. -
          period span(const period & other) const;
          Combine two periods with earliest start and latest end.

          Combines two periods and any gap between them such that start = min(p1.start, p2.start) end = max(p1.end , p2.end)

          +
          period span(const period & other) const;
          Combine two periods with earliest start and latest end.

          Combines two periods and any gap between them such that start = min(p1.start, p2.start) end = max(p1.end , p2.end) 

                 [---p1---)
                       [---p2---)
 result:
diff --git a/doc/html/boost/date_time/period_formatter.html b/doc/html/boost/date_time/period_formatter.html
index 2d89120bf4..793a94ad86 100644
--- a/doc/html/boost/date_time/period_formatter.html
+++ b/doc/html/boost/date_time/period_formatter.html
@@ -45,22 +45,22 @@
   enum range_display_options { AS_OPEN_RANGE, AS_CLOSED_RANGE };
 
   // construct/copy/destruct
-  period_formatter(range_display_options = AS_CLOSED_RANGE, 
+  period_formatter(range_display_options = AS_CLOSED_RANGE, 
                    const char_type *const = default_period_separator, 
                    const char_type *const = default_period_start_delimeter, 
                    const char_type *const = default_period_open_range_end_delimeter, 
                    const char_type *const = default_period_closed_range_end_delimeter);
 
-  // public member functions
-  OutItrT put_period_separator(OutItrT &) const;
-  OutItrT put_period_start_delimeter(OutItrT &) const;
-  OutItrT put_period_end_delimeter(OutItrT &) const;
-  range_display_options range_option() const;
-  void range_option(range_display_options) const;
-  void delimiter_strings(const string_type &, const string_type &, 
+  // public member functions
+  OutItrT put_period_separator(OutItrT &) const;
+  OutItrT put_period_start_delimeter(OutItrT &) const;
+  OutItrT put_period_end_delimeter(OutItrT &) const;
+  range_display_options range_option() const;
+  void range_option(range_display_options) const;
+  void delimiter_strings(const string_type &, const string_type &, 
                          const string_type &, const string_type &);
   template<typename period_type, typename facet_type> 
-    OutItrT put_period(OutItrT, std::ios_base &, char_type, 
+    OutItrT put_period(OutItrT, std::ios_base &, char_type, 
                        const period_type &, const facet_type &) const;
 
   // public data members
@@ -70,7 +70,7 @@
   static const char_type default_period_closed_range_end_delimeter;
 };
        -

        Description

        +

        Description

        Provides settings for the following:

        • period_separator – default '/'

          • @@ -89,35 +89,38 @@

          where the date formatting is controlled by the date facet

          -

          +

          period_formatter public construct/copy/destruct

          1. -
            period_formatter(range_display_options range_option_in = AS_CLOSED_RANGE, 
+
            period_formatter(range_display_options range_option_in = AS_CLOSED_RANGE, 
                  const char_type *const period_separator = default_period_separator, 
                  const char_type *const period_start_delimeter = default_period_start_delimeter, 
                  const char_type *const period_open_range_end_delimeter = default_period_open_range_end_delimeter, 
                  const char_type *const period_closed_range_end_delimeter = default_period_closed_range_end_delimeter);
            Constructor that sets up period formatter options – default should suffice most cases.
          -

          -period_formatter public member functions

          +

          +period_formatter public member functions

          1. -
            OutItrT put_period_separator(OutItrT & oitr) const;
            Puts the characters between period elements into stream – default is /.
            2. +
            OutItrT put_period_separator(OutItrT & oitr) const;
            Puts the characters between period elements into stream – default is /.
          2. -
            OutItrT put_period_start_delimeter(OutItrT & oitr) const;
            Puts the period start characters into stream – default is [.
            3. +
            OutItrT put_period_start_delimeter(OutItrT & oitr) const;
            Puts the period start characters into stream – default is [.
          3. -
            OutItrT put_period_end_delimeter(OutItrT & oitr) const;
            Puts the period end characters into stream as controled by open/closed range setting.
            4. -
          4. range_display_options range_option() const;
            5. +
            OutItrT put_period_end_delimeter(OutItrT & oitr) const;
            Puts the period end characters into stream as controled by open/closed range setting. +
          5. range_display_options range_option() const;
          6. -
            void range_option(range_display_options option) const;
            Reset the range_option control.
            7. -
          7. void delimiter_strings(const string_type &, const string_type &, 
-                       const string_type &, const string_type &);
            8. +
            void range_option(range_display_options option) const;
            Reset the range_option control. +
          8. +
            void delimiter_strings(const string_type & separator, 
+                       const string_type & start_delim, 
+                       const string_type & open_end_delim, 
+                       const string_type & closed_end_delim);
            Change the delimiter strings. 
          9. template<typename period_type, typename facet_type> 
-  OutItrT put_period(OutItrT next, std::ios_base & a_ios, char_type a_fill, 
+  OutItrT put_period(OutItrT next, std::ios_base & a_ios, char_type a_fill, 
                      const period_type & p, const facet_type & facet) const;
            Generic code to output a period – no matter the period type.

            This generic code will output any period using a facet to to output the 'elements'. For example, in the case of a date_period the elements will be instances of a date which will be formatted according the to setup in the passed facet parameter.

            The steps for formatting a period are always the same:

              diff --git a/doc/html/boost/date_time/period_parser.html b/doc/html/boost/date_time/period_parser.html index bbc95fc4be..16b97148e1 100644 --- a/doc/html/boost/date_time/period_parser.html +++ b/doc/html/boost/date_time/period_parser.html @@ -46,26 +46,26 @@ enum period_range_option { AS_OPEN_RANGE, AS_CLOSED_RANGE }; // construct/copy/destruct - period_parser(period_range_option = AS_CLOSED_RANGE, + period_parser(period_range_option = AS_CLOSED_RANGE, const char_type *const = default_period_separator, const char_type *const = default_period_start_delimeter, const char_type *const = default_period_open_range_end_delimeter, const char_type *const = default_period_closed_range_end_delimeter); - period_parser(const period_parser< date_type, CharT > &); + period_parser(const period_parser< date_type, CharT > &); - // public member functions - period_range_option range_option() const; - void range_option(period_range_option); - collection_type delimiter_strings() const; - void delimiter_strings(const string_type &, const string_type &, + // public member functions + period_range_option range_option() const; + void range_option(period_range_option); + collection_type delimiter_strings() const; + void delimiter_strings(const string_type &, const string_type &, const string_type &, const string_type &); template<typename period_type, typename duration_type, typename facet_type> - period_type get_period(stream_itr_type &, stream_itr_type &, + period_type get_period(stream_itr_type &, stream_itr_type &, std::ios_base &, const period_type &, const duration_type &, const facet_type &) const; - // private member functions - void consume_delim(stream_itr_type &, stream_itr_type &, + // private member functions + void consume_delim(stream_itr_type &, stream_itr_type &, const string_type &) const; // public data members @@ -75,7 +75,7 @@ static const char_type default_period_closed_range_end_delimeter; };
            -

            Description

            +

            Description

            Provides settings for the following:

            • period_separator – default '/'

              • @@ -91,34 +91,34 @@

              where the date format is controlled by the date facet

              -

              +

              period_parser public construct/copy/destruct

              1. -
                period_parser(period_range_option range_opt = AS_CLOSED_RANGE, 
+
                period_parser(period_range_option range_opt = AS_CLOSED_RANGE, 
               const char_type *const period_separator = default_period_separator, 
               const char_type *const period_start_delimeter = default_period_start_delimeter, 
               const char_type *const period_open_range_end_delimeter = default_period_open_range_end_delimeter, 
               const char_type *const period_closed_range_end_delimeter = default_period_closed_range_end_delimeter);
                Constructor that sets up period parser options.
                2. -
              2. period_parser(const period_parser< date_type, CharT > & p_parser);
                3. +
              3. period_parser(const period_parser< date_type, CharT > & p_parser);
              -

              -period_parser public member functions

              +

              +period_parser public member functions

                -
              1. period_range_option range_option() const;
                2. -
              2. void range_option(period_range_option option);
                3. -
              3. collection_type delimiter_strings() const;
                4. -
              4. void delimiter_strings(const string_type & separator, 
+
              5. period_range_option range_option() const;
                6. 
+
              6. void range_option(period_range_option option);
                7. 
+
              7. collection_type delimiter_strings() const;
                8. 
+
              8. void delimiter_strings(const string_type & separator, 
                        const string_type & start_delim, 
                        const string_type & open_end_delim, 
                        const string_type & closed_end_delim);
                9. 
 
              9. 
 
                template<typename period_type, typename duration_type, typename facet_type> 
-  period_type get_period(stream_itr_type & sitr, stream_itr_type & stream_end, 
+  period_type get_period(stream_itr_type & sitr, stream_itr_type & stream_end, 
                          std::ios_base & a_ios, const period_type &, 
                          const duration_type & dur_unit, 
                          const facet_type & facet) const;
                Generic code to parse a period – no matter the period type. 
                This generic code will parse any period using a facet to to get the 'elements'. For example, in the case of a date_period the elements will be instances of a date which will be parsed according the to setup in the passed facet parameter.
                
@@ -141,10 +141,10 @@
              -

              -period_parser private member functions

              +

              +period_parser private member functions

              1. -
                void consume_delim(stream_itr_type & sitr, stream_itr_type & stream_end, 
+
                void consume_delim(stream_itr_type & sitr, stream_itr_type & stream_end, 
                    const string_type & delim) const;
                throws ios_base::failure if delimiter and parsed data do not match
            diff --git a/doc/html/boost/date_time/previous_weekday.html b/doc/html/boost/date_time/previous_weekday.html index 95943a7cc2..890e22c18b 100644 --- a/doc/html/boost/date_time/previous_weekday.html +++ b/doc/html/boost/date_time/previous_weekday.html @@ -36,7 +36,7 @@ template<typename date_type, typename weekday_type> date_type previous_weekday(const date_type & d, const weekday_type & wd);
            -

            Description

            +

            Description

            Generates a date object representing the date of the previous weekday from the given date. If the date given is 2004-May-9 (a Sunday) and the given weekday is Tuesday then the resulting date will be 2004-May-4.

          diff --git a/doc/html/boost/date_time/second_clock.html b/doc/html/boost/date_time/second_clock.html index 8a2d49a5fe..1621a84c59 100644 --- a/doc/html/boost/date_time/second_clock.html +++ b/doc/html/boost/date_time/second_clock.html @@ -39,33 +39,33 @@ typedef time_type::date_type date_type; typedef time_type::time_duration_type time_duration_type; - // public static functions - static time_type local_time(); - static time_type universal_time(); + // public static functions + static time_type local_time(); + static time_type universal_time(); template<typename time_zone_type> - static time_type local_time(boost::shared_ptr< time_zone_type >); + static time_type local_time(boost::shared_ptr< time_zone_type >); - // private static functions - static time_type create_time(::std::tm *); + // private static functions + static time_type create_time(::std::tm *); };
          -

          Description

          +

          Description

          This clock provides resolution to the 1 second level

          -

          -second_clock public static functions

          +

          +second_clock public static functions

            -
          1. static time_type local_time();
            2. +
          2. static time_type local_time();
          3. -
            static time_type universal_time();
            Get the current day in universal date as a ymd_type.
            4. +
            static time_type universal_time();
            Get the current day in universal date as a ymd_type. 
          4. template<typename time_zone_type> 
-  static time_type local_time(boost::shared_ptr< time_zone_type > tz_ptr);
            5. + static time_type local_time(boost::shared_ptr< time_zone_type > tz_ptr);
          -

          -second_clock private static functions

          -
          1. static time_type create_time(::std::tm * current);
          +

          +second_clock private static functions

          +
          1. static time_type create_time(::std::tm * current);
        diff --git a/doc/html/boost/date_time/simpl_1_3_12_15_3_13_1_1_2.html b/doc/html/boost/date_time/simpl_1_3_12_15_3_13_1_1_2.html deleted file mode 100644 index f15db8916d..0000000000 --- a/doc/html/boost/date_time/simpl_1_3_12_15_3_13_1_1_2.html +++ /dev/null @@ -1,97 +0,0 @@ - - - - -Class simple_format<wchar_t> - - - - - - - - - - - - - - - -
        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
        -
        -
        -PrevUpHomeNext -
        -
        -
        -
        -

        Class simple_format<wchar_t>

        -

        boost::date_time::simple_format<wchar_t> — Specialization of formmating rules for wchar_t.

        -
        -

        Synopsis

        -
        // In header: <boost/date_time/date_format_simple.hpp>
-
-
-class simple_format<wchar_t> {
-public:
-
-  // public static functions
-  static const wchar_t * not_a_date();
-  static const wchar_t * pos_infinity();
-  static const wchar_t * neg_infinity();
-  static month_format_spec month_format();
-  static ymd_order_spec date_order();
-  static bool has_date_sep_chars();
-  static wchar_t year_sep_char();
-  static wchar_t month_sep_char();
-  static wchar_t day_sep_char();
-  static wchar_t hour_sep_char();
-  static wchar_t minute_sep_char();
-  static wchar_t second_sep_char();
-};
        -
        -

        Description

        -
        -

        -simple_format public static functions

        -
          -
        1. -
          static const wchar_t * not_a_date();
          String used printed is date is invalid.
          2. -
        2. -
          static const wchar_t * pos_infinity();
          String used to for positive infinity value.
          3. -
        3. -
          static const wchar_t * neg_infinity();
          String used to for positive infinity value.
          4. -
        4. -
          static month_format_spec month_format();
          Describe month format.
          5. -
        5. static ymd_order_spec date_order();
          6. -
        6. -
          static bool has_date_sep_chars();
          This format uses '-' to separate date elements.
          7. -
        7. -
          static wchar_t year_sep_char();
          Char to sep?
          8. -
        8. -
          static wchar_t month_sep_char();
          char between year-month
          9. -
        9. -
          static wchar_t day_sep_char();
          Char to separate month-day.
          10. -
        10. -
          static wchar_t hour_sep_char();
          char between date-hours
          11. -
        11. -
          static wchar_t minute_sep_char();
          char between hour and minute
          12. -
        12. -
          static wchar_t second_sep_char();
          char for second
          13. -
        -
        -
        -
        - - - -
        Copyright © 2001-2005 CrystalClear Software, Inc

        Subject to the Boost Software License, Version 1.0. (See accompanying file - LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

        -
        -
        -
        -PrevUpHomeNext -
        - - diff --git a/doc/html/boost/date_time/simpl_1_3_13_15_3_13_1_1_2.html b/doc/html/boost/date_time/simpl_1_3_13_15_3_13_1_1_2.html new file mode 100644 index 0000000000..f888b260cc --- /dev/null +++ b/doc/html/boost/date_time/simpl_1_3_13_15_3_13_1_1_2.html @@ -0,0 +1,97 @@ + + + + +Class simple_format<wchar_t> + + + + + + + + + + + + + + + +
        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
        +
        +
        +PrevUpHomeNext +
        +
        +
        +
        +

        Class simple_format<wchar_t>

        +

        boost::date_time::simple_format<wchar_t> — Specialization of formmating rules for wchar_t.

        +
        +

        Synopsis

        +
        // In header: <boost/date_time/date_format_simple.hpp>
+
+
+class simple_format<wchar_t> {
+public:
+
+  // public static functions
+  static const wchar_t * not_a_date();
+  static const wchar_t * pos_infinity();
+  static const wchar_t * neg_infinity();
+  static month_format_spec month_format();
+  static ymd_order_spec date_order();
+  static bool has_date_sep_chars();
+  static wchar_t year_sep_char();
+  static wchar_t month_sep_char();
+  static wchar_t day_sep_char();
+  static wchar_t hour_sep_char();
+  static wchar_t minute_sep_char();
+  static wchar_t second_sep_char();
+};
        +
        +

        Description

        +
        +

        +simple_format public static functions

        +
          +
        1. +
          static const wchar_t * not_a_date();
          String used printed is date is invalid.
          2. +
        2. +
          static const wchar_t * pos_infinity();
          String used to for positive infinity value.
          3. +
        3. +
          static const wchar_t * neg_infinity();
          String used to for positive infinity value.
          4. +
        4. +
          static month_format_spec month_format();
          Describe month format.
          5. +
        5. static ymd_order_spec date_order();
          6. +
        6. +
          static bool has_date_sep_chars();
          This format uses '-' to separate date elements.
          7. +
        7. +
          static wchar_t year_sep_char();
          Char to sep?
          8. +
        8. +
          static wchar_t month_sep_char();
          char between year-month
          9. +
        9. +
          static wchar_t day_sep_char();
          Char to separate month-day.
          10. +
        10. +
          static wchar_t hour_sep_char();
          char between date-hours
          11. +
        11. +
          static wchar_t minute_sep_char();
          char between hour and minute
          12. +
        12. +
          static wchar_t second_sep_char();
          char for second
          13. +
        +
        +
        +
        + + + +
        Copyright © 2001-2005 CrystalClear Software, Inc

        Subject to the Boost Software License, Version 1.0. (See accompanying file + LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

        +
        +
        +
        +PrevUpHomeNext +
        + + diff --git a/doc/html/boost/date_time/simple_format.html b/doc/html/boost/date_time/simple_format.html index f664eb6836..4bf7e39e75 100644 --- a/doc/html/boost/date_time/simple_format.html +++ b/doc/html/boost/date_time/simple_format.html @@ -8,7 +8,7 @@ - + @@ -21,7 +21,7 @@
        -PrevUpHomeNext +PrevUpHomeNext
        @@ -36,54 +36,54 @@ class simple_format { public: - // public static functions - static const charT * not_a_date(); - static const charT * pos_infinity(); - static const charT * neg_infinity(); - static month_format_spec month_format(); - static ymd_order_spec date_order(); - static bool has_date_sep_chars(); - static charT year_sep_char(); - static charT month_sep_char(); - static charT day_sep_char(); - static charT hour_sep_char(); - static charT minute_sep_char(); - static charT second_sep_char(); + // public static functions + static const charT * not_a_date(); + static const charT * pos_infinity(); + static const charT * neg_infinity(); + static month_format_spec month_format(); + static ymd_order_spec date_order(); + static bool has_date_sep_chars(); + static charT year_sep_char(); + static charT month_sep_char(); + static charT day_sep_char(); + static charT hour_sep_char(); + static charT minute_sep_char(); + static charT second_sep_char(); };
        -

        Description

        +

        Description

        -

        -simple_format public static functions

        +

        +simple_format public static functions

        1. -
          static const charT * not_a_date();
          String used printed is date is invalid.
          2. +
          static const charT * not_a_date();
          String used printed is date is invalid.
        2. -
          static const charT * pos_infinity();
          String used to for positive infinity value.
          3. +
          static const charT * pos_infinity();
          String used to for positive infinity value.
        3. -
          static const charT * neg_infinity();
          String used to for positive infinity value.
          4. +
          static const charT * neg_infinity();
          String used to for positive infinity value.
        4. -
          static month_format_spec month_format();
          Describe month format.
          5. -
        5. static ymd_order_spec date_order();
          6. +
          static month_format_spec month_format();
          Describe month format. +
        6. static ymd_order_spec date_order();
        7. -
          static bool has_date_sep_chars();
          This format uses '-' to separate date elements.
          8. +
          static bool has_date_sep_chars();
          This format uses '-' to separate date elements.
        8. -
          static charT year_sep_char();
          Char to sep?
          9. +
          static charT year_sep_char();
          Char to sep?
        9. -
          static charT month_sep_char();
          char between year-month
          10. +
          static charT month_sep_char();
          char between year-month
        10. -
          static charT day_sep_char();
          Char to separate month-day.
          11. +
          static charT day_sep_char();
          Char to separate month-day.
        11. -
          static charT hour_sep_char();
          char between date-hours
          12. +
          static charT hour_sep_char();
          char between date-hours
        12. -
          static charT minute_sep_char();
          char between hour and minute
          13. +
          static charT minute_sep_char();
          char between hour and minute
        13. -
          static charT second_sep_char();
          char for second
          14. +
          static charT second_sep_char();
          char for second
        -

        Specializations

        -
        +

        Specializations

        +
        @@ -95,7 +95,7 @@
        -PrevUpHomeNext +PrevUpHomeNext
        diff --git a/doc/html/boost/date_time/special_values_formatter.html b/doc/html/boost/date_time/special_values_formatter.html index 968677f6ca..15d94e839b 100644 --- a/doc/html/boost/date_time/special_values_formatter.html +++ b/doc/html/boost/date_time/special_values_formatter.html @@ -42,32 +42,32 @@ typedef std::vector< string_type > collection_type; // construct/copy/destruct - special_values_formatter(); - special_values_formatter(const char_type *const *, const char_type *const *); - special_values_formatter(typename collection_type::iterator, + special_values_formatter(); + special_values_formatter(const char_type *const *, const char_type *const *); + special_values_formatter(typename collection_type::iterator, typename collection_type::iterator); - // public member functions - OutItrT put_special(OutItrT, const boost::date_time::special_values &) const; + // public member functions + OutItrT put_special(OutItrT, const boost::date_time::special_values &) const; // public data members static const char_type default_special_value_names; // Storage for the strings used to indicate special values. };
        -

        Description

        +

        Description

        This class provides for the formmating of special values to an output stream. In particular, it produces strings for the values of negative and positive infinity as well as not_a_date_time.

        While not a facet, this class is used by the date and time facets for formatting special value types.

        -

        +

        special_values_formatter public construct/copy/destruct

        1. -
          special_values_formatter();
          Construct special values formatter using default strings.

          Default strings are not-a-date-time -infinity +infinity

          +
          special_values_formatter();
          Construct special values formatter using default strings.

          Default strings are not-a-date-time -infinity +infinity

        2. -
          special_values_formatter(const char_type *const * begin, 
+
          special_values_formatter(const char_type *const * begin, 
                          const char_type *const * end);
          Construct special values formatter from array of strings. 
          This constructor will take pair of iterators from an array of strings that represent the special values and copy them for use in formatting special values. 
          
 
          const char* const special_value_names[]={"nadt","-inf","+inf" };
 
@@ -75,14 +75,14 @@
          3. -
        3. special_values_formatter(typename collection_type::iterator beg, 
+
        4. special_values_formatter(typename collection_type::iterator beg, 
                          typename collection_type::iterator end);
          5.
        -

        -special_values_formatter public member functions

        -
        1. OutItrT put_special(OutItrT next, 
+
          
+special_values_formatter public member functions
          
+
          1. OutItrT put_special(OutItrT next, 
                     const boost::date_time::special_values & value) const;
        diff --git a/doc/html/boost/date_time/special_values_parser.html b/doc/html/boost/date_time/special_values_parser.html index 129293743d..efa19535e8 100644 --- a/doc/html/boost/date_time/special_values_parser.html +++ b/doc/html/boost/date_time/special_values_parser.html @@ -36,28 +36,32 @@ class special_values_parser { public: // types - typedef std::basic_string< charT > string_type; - typedef std::istreambuf_iterator< charT > stream_itr_type; - typedef date_type::duration_type duration_type; - typedef string_parse_tree< charT > parse_tree_type; - typedef parse_tree_type::parse_match_result_type match_results; - typedef std::vector< std::basic_string< charT > > collection_type; - typedef charT char_type; + typedef std::basic_string< charT > string_type; + typedef std::basic_stringstream< charT > stringstream_type; + typedef std::istreambuf_iterator< charT > stream_itr_type; + typedef date_type::duration_type duration_type; + typedef string_parse_tree< charT > parse_tree_type; + typedef parse_tree_type::parse_match_result_type match_results; + typedef std::vector< std::basic_string< charT > > collection_type; + typedef charT char_type; // construct/copy/destruct - special_values_parser(); - special_values_parser(const string_type &, const string_type &, + special_values_parser(); + special_values_parser(const string_type &, const string_type &, const string_type &, const string_type &, const string_type &); - special_values_parser(typename collection_type::iterator, + special_values_parser(typename collection_type::iterator, typename collection_type::iterator); - special_values_parser(const special_values_parser< date_type, charT > &); + special_values_parser(const special_values_parser< date_type, charT > &); - // public member functions - void sv_strings(const string_type &, const string_type &, + // public member functions + void sv_strings(const string_type &, const string_type &, const string_type &, const string_type &, const string_type &); - bool match(stream_itr_type &, stream_itr_type &, match_results &) const; + bool match(stream_itr_type &, stream_itr_type &, match_results &) const; + + // public static functions + static bool likely(const string_type &); // public data members static const char_type nadt_string; @@ -67,7 +71,7 @@ static const char_type max_date_time_string; };
        -

        Description

        +

        Description

        TODO: add doc-comments for which elements can be changed Parses input stream for strings representing special_values. Special values parsed are:

        • not_a_date_time

          • @@ -79,38 +83,112 @@

          -

          +

          special_values_parser public construct/copy/destruct

          1. -
            special_values_parser();
            Creates a special_values_parser with the default set of "sv_strings".
            2. +
            special_values_parser();
            Creates a special_values_parser with the default set of "sv_strings".
          2. -
            special_values_parser(const string_type & nadt_str, 
+
            special_values_parser(const string_type & nadt_str, 
                       const string_type & neg_inf_str, 
                       const string_type & pos_inf_str, 
                       const string_type & min_dt_str, 
                       const string_type & max_dt_str);
            Creates a special_values_parser using a user defined set of element strings.
            3. -
          3. special_values_parser(typename collection_type::iterator beg, 
+
          4. special_values_parser(typename collection_type::iterator beg, 
                       typename collection_type::iterator end);
            5. 
-
          5. special_values_parser(const special_values_parser< date_type, charT > & svp);
            6. 
+
          6. special_values_parser(const special_values_parser< date_type, charT > & svp);
            7.
          -

          -special_values_parser public member functions

          +

          +special_values_parser public member functions

          1. -
            void sv_strings(const string_type & nadt_str, const string_type & neg_inf_str, 
+
            void sv_strings(const string_type & nadt_str, const string_type & neg_inf_str, 
                 const string_type & pos_inf_str, 
                 const string_type & min_dt_str, 
                 const string_type & max_dt_str);
            Replace special value strings.
          2. -
            bool match(stream_itr_type & sitr, stream_itr_type & str_end, 
-           match_results & mr) const;
            Sets match_results.current_match to the corresponding special_value or -1.
            3. +
            bool match(stream_itr_type & sitr, stream_itr_type & str_end, 
+           match_results & mr) const;
            +

            Given an input iterator, attempt to match it to a known special value + +

            +
            ++++ + + + + + + + + + + +

            Parameters:

            ++++ + + + + + + + + + + + + + + +

            mr

            the match result: mr.current_match is set to the corresponding special_value or -1

            sitr

            the start iterator

            str_end

            the end iterator

            Returns:

            whether something matched

            +
          +
          +

          +special_values_parser public static functions

          +
          1. +
            static bool likely(const string_type & str);
            +

            The parser is expensive to create, and not thread-safe so it cannot be static therefore given a string, determine if it is likely to be a special value. A negative response is a definite no, whereas a positive is only likely and match() should be called and return value checked. + +

            +
            ++++ + + + + + + + + + + +

            Parameters:

            ++++ + + + + +

            str

            the string to check

            Returns:

            false if it is definitely not a special value

            +
          +
        diff --git a/doc/html/boost/date_time/split_timedate_system.html b/doc/html/boost/date_time/split_timedate_system.html index 405c5b603b..ad7915e51c 100644 --- a/doc/html/boost/date_time/split_timedate_system.html +++ b/doc/html/boost/date_time/split_timedate_system.html @@ -46,63 +46,63 @@ typedefdate_time::wrapping_int<split_timedate_system::int_type,split_timedate_system::ticks_per_day>wrap_int_type;typedefdate_time::wrapping_int<int_type,ticks_per_day>wrap_int_type; - // private member functions - BOOST_STATIC_CONSTANT(int_type, + // private member functions + BOOST_STATIC_CONSTANT(int_type,ticks_per_day=INT64_C(86400)*config::tick_per_second); - // public static functions - statictime_rep_typeget_time_rep(special_values); + // public static functions + statictime_rep_typeget_time_rep(special_values);statictime_rep_type - get_time_rep(constdate_type&,consttime_duration_type&, + get_time_rep(constdate_type&,consttime_duration_type&,date_time::dst_flags=not_dst); - staticdate_typeget_date(consttime_rep_type&); - statictime_duration_typeget_time_of_day(consttime_rep_type&); - staticstd::stringzone_name(consttime_rep_type&); - staticboolis_equal(consttime_rep_type&,consttime_rep_type&); - staticboolis_less(consttime_rep_type&,consttime_rep_type&); + staticdate_typeget_date(consttime_rep_type&); + statictime_duration_typeget_time_of_day(consttime_rep_type&); + staticstd::stringzone_name(consttime_rep_type&); + staticboolis_equal(consttime_rep_type&,consttime_rep_type&); + staticboolis_less(consttime_rep_type&,consttime_rep_type&);statictime_rep_type - add_days(consttime_rep_type&,constdate_duration_type&); + add_days(consttime_rep_type&,constdate_duration_type&);statictime_rep_type - subtract_days(consttime_rep_type&,constdate_duration_type&); + subtract_days(consttime_rep_type&,constdate_duration_type&);statictime_rep_type - subtract_time_duration(consttime_rep_type&,consttime_duration_type&); + subtract_time_duration(consttime_rep_type&,consttime_duration_type&);statictime_rep_type - add_time_duration(consttime_rep_type&,time_duration_type); + add_time_duration(consttime_rep_type&,time_duration_type);statictime_duration_type - subtract_times(consttime_rep_type&,consttime_rep_type&); + subtract_times(consttime_rep_type&,consttime_rep_type&);};
        -

        Description

        +

        Description

        -

        -split_timedate_system private member functions

        -
        1.  BOOST_STATIC_CONSTANT(int_type, 
+
          
+split_timedate_system private member functions
          
+
          1.  BOOST_STATIC_CONSTANT(int_type, 
                        ticks_per_day = INT64_C(86400)*config::tick_per_second);
        -

        -split_timedate_system public static functions

        +

        +split_timedate_system public static functions

          -
        1. static time_rep_type get_time_rep(special_values sv);
          2. +
        2. static time_rep_type get_time_rep(special_values sv);
        3. static time_rep_type 
-get_time_rep(const date_type & day, const time_duration_type & tod, 
+get_time_rep(const date_type & day, const time_duration_type & tod, 
              date_time::dst_flags = not_dst);
          4. -
        4. static date_type get_date(const time_rep_type & val);
          5. -
        5. static time_duration_type get_time_of_day(const time_rep_type & val);
          6. -
        6. static std::string zone_name(const time_rep_type &);
          7. -
        7. static bool is_equal(const time_rep_type & lhs, const time_rep_type & rhs);
          8. -
        8. static bool is_less(const time_rep_type & lhs, const time_rep_type & rhs);
          9. +
        9. static date_type get_date(const time_rep_type & val);
          10. +
        10. static time_duration_type get_time_of_day(const time_rep_type & val);
          11. +
        11. static std::string zone_name(const time_rep_type &);
          12. +
        12. static bool is_equal(const time_rep_type & lhs, const time_rep_type & rhs);
          13. +
        13. static bool is_less(const time_rep_type & lhs, const time_rep_type & rhs);
        14. static time_rep_type 
-add_days(const time_rep_type & base, const date_duration_type & dd);
          15. +add_days(const time_rep_type & base, const date_duration_type & dd); 
        15. static time_rep_type 
-subtract_days(const time_rep_type & base, const date_duration_type & dd);
          16. +subtract_days(const time_rep_type & base, const date_duration_type & dd); 
        16. static time_rep_type 
-subtract_time_duration(const time_rep_type & base, 
+subtract_time_duration(const time_rep_type & base, 
                        const time_duration_type & td);
        17. static time_rep_type 
-add_time_duration(const time_rep_type & base, time_duration_type td);
          18. +add_time_duration(const time_rep_type & base, time_duration_type td); 
        18. static time_duration_type 
-subtract_times(const time_rep_type & lhs, const time_rep_type & rhs);
          19. +subtract_times(const time_rep_type & lhs, const time_rep_type & rhs);
        diff --git a/doc/html/boost/date_time/static_local_time_adjustor.html b/doc/html/boost/date_time/static_local_time_adjustor.html index 5199604add..4541d9bcfa 100644 --- a/doc/html/boost/date_time/static_local_time_adjustor.html +++ b/doc/html/boost/date_time/static_local_time_adjustor.html @@ -7,7 +7,7 @@ - + @@ -21,7 +21,7 @@
        -PrevUpHomeNext +PrevUpHomeNext
        @@ -39,20 +39,20 @@ typedef time_type::time_duration_type time_duration_type; typedef time_type::date_type date_type; - // public static functions - static time_duration_type utc_to_local_offset(const time_type &); + // public static functions + static time_duration_type utc_to_local_offset(const time_type &); static time_duration_type - local_to_utc_offset(const time_type &, + local_to_utc_offset(const time_type &, date_time::dst_flags = date_time::calculate); };
        -

        Description

        +

        Description

        -

        -static_local_time_adjustor public static functions

        +

        +static_local_time_adjustor public static functions

        1. -
          static time_duration_type utc_to_local_offset(const time_type & t);
          Calculates the offset from a utc time to local based on dst and utc offset.

          +

          static time_duration_type utc_to_local_offset(const time_type & t);
          Calculates the offset from a utc time to local based on dst and utc offset.

          The logic is as follows. Starting with UTC time use the offset to create a label for an non-dst adjusted local time. Then call dst_rules::local_is_dst with the non adjust local time. The results of this function will either unabiguously decide that the initial local time is in dst or return an illegal or ambiguous result. An illegal result only occurs at the end of dst (where labels are skipped) and indicates that dst has ended. An ambiguous result means that we need to recheck by making a dst adjustment and then rechecking. If the dst offset is added to the utc time and the recheck proves non-ambiguous then we are past the boundary. If it is still ambiguous then we are ahead of the boundary and dst is still in effect.

          TODO – check if all dst offsets are positive. If not then the algorithm needs to check for this and reverse the illegal/ambiguous logic.

          @@ -77,7 +77,7 @@ The logic is as follows. Starting with UTC time use the offset to create a label 
        2. static time_duration_type 
-local_to_utc_offset(const time_type & t, 
+local_to_utc_offset(const time_type & t, 
                     date_time::dst_flags dst = date_time::calculate);
          Get the offset to UTC given a local time.
          3. @@ -91,7 +91,7 @@ The logic is as follows. Starting with UTC time use the offset to create a label
          -PrevUpHomeNext +PrevUpHomeNext
          diff --git a/doc/html/boost/date_time/str_f_1_3_12_15_3_51_1_1_2.html b/doc/html/boost/date_time/str_f_1_3_12_15_3_51_1_1_2.html deleted file mode 100644 index 10125b2a58..0000000000 --- a/doc/html/boost/date_time/str_f_1_3_12_15_3_51_1_1_2.html +++ /dev/null @@ -1,56 +0,0 @@ - - - - -Function template str_from_delimited_time_duration - - - - - - - - - - - - - - - -
          Boost C++ LibrariesHomeLibrariesPeopleFAQMore
          -
          -
          -PrevUpHomeNext -
          -
          -
          -
          -

          Function template str_from_delimited_time_duration

          -

          boost::date_time::str_from_delimited_time_duration — Creates a time_duration object from a delimited string.

          -
          -

          Synopsis

          -
          // In header: <boost/date_time/time_parsing.hpp>
-
-
-template<typename time_duration, typename char_type> 
-  time_duration 
-  str_from_delimited_time_duration(const std::basic_string< char_type > & s);
          -
          -

          Description

          -

          Expected format for string is "[-]h[h][:mm][:ss][.fff]". If the number of fractional digits provided is greater than the precision of the time duration type then the extra digits are truncated.

          -

          A negative duration will be created if the first character in string is a '-', all other '-' will be treated as delimiters. Accepted delimiters are "-:,.".

          -
          -
          - - - -
          Copyright © 2001-2005 CrystalClear Software, Inc

          Subject to the Boost Software License, Version 1.0. (See accompanying file - LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

          -
          -
          -
          -PrevUpHomeNext -
          - - diff --git a/doc/html/boost/date_time/str_f_1_3_13_15_3_51_1_1_2.html b/doc/html/boost/date_time/str_f_1_3_13_15_3_51_1_1_2.html new file mode 100644 index 0000000000..2d7ce0986c --- /dev/null +++ b/doc/html/boost/date_time/str_f_1_3_13_15_3_51_1_1_2.html @@ -0,0 +1,56 @@ + + + + +Function template str_from_delimited_time_duration + + + + + + + + + + + + + + + +
          Boost C++ LibrariesHomeLibrariesPeopleFAQMore
          +
          +
          +PrevUpHomeNext +
          +
          +
          +
          +

          Function template str_from_delimited_time_duration

          +

          boost::date_time::str_from_delimited_time_duration — Creates a time_duration object from a delimited string.

          +
          +

          Synopsis

          +
          // In header: <boost/date_time/time_parsing.hpp>
+
+
+template<typename time_duration, typename char_type> 
+  time_duration 
+  str_from_delimited_time_duration(const std::basic_string< char_type > & s);
          +
          +

          Description

          +

          Expected format for string is "[-]h[h][:mm][:ss][.fff]". If the number of fractional digits provided is greater than the precision of the time duration type then the extra digits are truncated.

          +

          A negative duration will be created if the first character in string is a '-', all other '-' will be treated as delimiters. Accepted delimiters are "-:,.".

          +
          +
          + + + +
          Copyright © 2001-2005 CrystalClear Software, Inc

          Subject to the Boost Software License, Version 1.0. (See accompanying file + LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

          +
          +
          +
          +PrevUpHomeNext +
          + + diff --git a/doc/html/boost/date_time/string_parse_tree.html b/doc/html/boost/date_time/string_parse_tree.html index 5363af60b2..2b7af0ff81 100644 --- a/doc/html/boost/date_time/string_parse_tree.html +++ b/doc/html/boost/date_time/string_parse_tree.html @@ -45,61 +45,61 @@ typedef parse_match_result< charT > parse_match_result_type; // construct/copy/destruct - string_parse_tree(collection_type, unsigned int = 0); - string_parse_tree(short = -1); + string_parse_tree(collection_type, unsigned int = 0); + string_parse_tree(short = parse_match_result_type::PARSE_ERROR); - // public member functions - void insert(const string_type &, unsigned short); - short match(std::istreambuf_iterator< charT > &, + // public member functions + void insert(const string_type &, unsigned short); + short match(std::istreambuf_iterator< charT > &, std::istreambuf_iterator< charT > &, parse_match_result_type &, unsigned int &) const; parse_match_result_type - match(std::istreambuf_iterator< charT > &, + match(std::istreambuf_iterator< charT > &, std::istreambuf_iterator< charT > &) const; - void printme(std::ostream &, int &); - void print(std::ostream &); - void printmatch(std::ostream &, charT); + void printme(std::ostream &, int &); + void print(std::ostream &); + void printmatch(std::ostream &, charT); // public data members ptree_coll m_next_chars; short m_value; };
          -

          Description

          +

          Description

          This class provides a quick lookup by building what amounts to a tree data structure. It also features a match function which can can handle nasty input interators by caching values as it recurses the tree so that it can backtrack as needed.

          -

          +

          string_parse_tree public construct/copy/destruct

          1. -
            string_parse_tree(collection_type names, unsigned int starting_point = 0);
            +
            string_parse_tree(collection_type names, unsigned int starting_point = 0);

            Parameter "starting_point" designates where the numbering begins. A starting_point of zero will start the numbering at zero (Sun=0, Mon=1, ...) were a starting_point of one starts the numbering at one (Jan=1, Feb=2, ...). The default is zero, negative vaules are not allowed

            2. -
          2. string_parse_tree(short value = -1);
            3. +
          3. string_parse_tree(short value = parse_match_result_type::PARSE_ERROR);
          -

          -string_parse_tree public member functions

          +

          +string_parse_tree public member functions

            -
          1. void insert(const string_type & s, unsigned short value);
            2. +
          2. void insert(const string_type & s, unsigned short value);
          3. -
            short match(std::istreambuf_iterator< charT > & sitr, 
+
            short match(std::istreambuf_iterator< charT > & sitr, 
             std::istreambuf_iterator< charT > & stream_end, 
             parse_match_result_type & result, unsigned int & level) const;
            Recursive function that finds a matching string in the tree. 
            Must check match_results::has_remaining() after match() is called. This is required so the user can determine if stream iterator is already pointing to the expected character or not (match() might advance sitr to next char in stream).
            
 
            A parse_match_result that has been returned from a failed match attempt can be sent in to the match function of a different string_parse_tree to attempt a match there. Use the iterators for the partially consumed stream, the parse_match_result object, and '0' for the level parameter. 
            
 
          4. parse_match_result_type 
-match(std::istreambuf_iterator< charT > & sitr, 
+match(std::istreambuf_iterator< charT > & sitr, 
       std::istreambuf_iterator< charT > & stream_end) const;

            Must check match_results::has_remaining() after match() is called. This is required so the user can determine if stream iterator is already pointing to the expected character or not (match() might advance sitr to next char in stream).

            5. -
          5. void printme(std::ostream & os, int & level);
            6. -
          6. void print(std::ostream & os);
            7. -
          7. void printmatch(std::ostream & os, charT c);
            8. +
          8. void printme(std::ostream & os, int & level);
            9. +
          9. void print(std::ostream & os);
            10. +
          10. void printmatch(std::ostream & os, charT c);
          diff --git a/doc/html/boost/date_time/subsecond_duration.html b/doc/html/boost/date_time/subsecond_duration.html index d5689dcb2d..e73a08d5ff 100644 --- a/doc/html/boost/date_time/subsecond_duration.html +++ b/doc/html/boost/date_time/subsecond_duration.html @@ -40,30 +40,34 @@ typedef base_duration::traits_type traits_type; // construct/copy/destruct - explicit subsecond_duration(boost::int64_t); + template<typename T> + explicit subsecond_duration(T const &, + typename boost::enable_if< boost::is_integral< T >, void >::type * = 0); - // private member functions - BOOST_STATIC_ASSERT_MSG((traits_type::ticks_per_second >=frac_of_second?traits_type::ticks_per_second%frac_of_second:frac_of_second%traits_type::ticks_per_second) = =0, + // private member functions + BOOST_STATIC_ASSERT_MSG((traits_type::ticks_per_second >=frac_of_second?traits_type::ticks_per_second%frac_of_second:frac_of_second%traits_type::ticks_per_second) = =0, \"The base duration resolution must be a multiple of the subsecond duration resolution"); - BOOST_STATIC_CONSTANT(boost::int64_t, + BOOST_STATIC_CONSTANT(boost::int64_t, adjustment_ratio = (traits_type::ticks_per_second >=frac_of_second?traits_type::ticks_per_second/frac_of_second:frac_of_second/traits_type::ticks_per_second)); };
        -

        Description

        +

        Description

        -

        +

        subsecond_duration public construct/copy/destruct

        -
        1. explicit subsecond_duration(boost::int64_t ss);
        +
        1. template<typename T> 
+  explicit subsecond_duration(T const & ss, 
+                              typename boost::enable_if< boost::is_integral< T >, void >::type * = 0);
        -

        -subsecond_duration private member functions

        +

        +subsecond_duration private member functions

          -
        1.  BOOST_STATIC_ASSERT_MSG((traits_type::ticks_per_second >=frac_of_second?traits_type::ticks_per_second%frac_of_second:frac_of_second%traits_type::ticks_per_second) = =0, 
+
        2.  BOOST_STATIC_ASSERT_MSG((traits_type::ticks_per_second >=frac_of_second?traits_type::ticks_per_second%frac_of_second:frac_of_second%traits_type::ticks_per_second) = =0, 
                          \"The base duration resolution must be a multiple of the subsecond duration resolution");
          3. 
-
        3.  BOOST_STATIC_CONSTANT(boost::int64_t, 
+
        4.  BOOST_STATIC_CONSTANT(boost::int64_t, 
                        adjustment_ratio = (traits_type::ticks_per_second >=frac_of_second?traits_type::ticks_per_second/frac_of_second:frac_of_second/traits_type::ticks_per_second));
          5.
        diff --git a/doc/html/boost/date_time/time__1_3_12_15_3_52_1_1_1.html b/doc/html/boost/date_time/time__1_3_12_15_3_52_1_1_1.html deleted file mode 100644 index 44609b92e3..0000000000 --- a/doc/html/boost/date_time/time__1_3_12_15_3_52_1_1_1.html +++ /dev/null @@ -1,69 +0,0 @@ - - - - -Struct time_resolution_traits_bi32_impl - - - - - - - - - - - - - - - -
        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
        -
        -
        -PrevUpHomeNext -
        -
        -
        -
        -

        Struct time_resolution_traits_bi32_impl

        -

        boost::date_time::time_resolution_traits_bi32_impl — traits struct for time_resolution_traits implementation type

        -
        -

        Synopsis

        -
        // In header: <boost/date_time/time_resolution_traits.hpp>
-
-
-struct time_resolution_traits_bi32_impl {
-  // types
-  typedef boost::int32_t int_type; 
-  typedef boost::int32_t impl_type;
-
-  // public static functions
-  static int_type as_number(impl_type);
-  static bool is_adapted();
-};
        -
        -

        Description

        -
        -

        -time_resolution_traits_bi32_impl public static functions

        -
          -
        1. static int_type as_number(impl_type i);
          2. -
        2. -
          static bool is_adapted();
          Used to determine if implemented type is int_adapter or int.
          3. -
        -
        -
        -
        - - - -
        Copyright © 2001-2005 CrystalClear Software, Inc

        Subject to the Boost Software License, Version 1.0. (See accompanying file - LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

        -
        -
        -
        -PrevUpHomeNext -
        - - diff --git a/doc/html/boost/date_time/time__1_3_12_15_3_52_1_1_2.html b/doc/html/boost/date_time/time__1_3_12_15_3_52_1_1_2.html deleted file mode 100644 index bfdc587f1a..0000000000 --- a/doc/html/boost/date_time/time__1_3_12_15_3_52_1_1_2.html +++ /dev/null @@ -1,69 +0,0 @@ - - - - -Struct time_resolution_traits_adapted32_impl - - - - - - - - - - - - - - - -
        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
        -
        -
        -PrevUpHomeNext -
        -
        -
        -
        -

        Struct time_resolution_traits_adapted32_impl

        -

        boost::date_time::time_resolution_traits_adapted32_impl — traits struct for time_resolution_traits implementation type

        -
        -

        Synopsis

        -
        // In header: <boost/date_time/time_resolution_traits.hpp>
-
-
-struct time_resolution_traits_adapted32_impl {
-  // types
-  typedef boost::int32_t                                  int_type; 
-  typedef boost::date_time::int_adapter< boost::int32_t > impl_type;
-
-  // public static functions
-  static int_type as_number(impl_type);
-  static bool is_adapted();
-};
        -
        -

        Description

        -
        -

        -time_resolution_traits_adapted32_impl public static functions

        -
          -
        1. static int_type as_number(impl_type i);
          2. -
        2. -
          static bool is_adapted();
          Used to determine if implemented type is int_adapter or int.
          3. -
        -
        -
        -
        - - - -
        Copyright © 2001-2005 CrystalClear Software, Inc

        Subject to the Boost Software License, Version 1.0. (See accompanying file - LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

        -
        -
        -
        -PrevUpHomeNext -
        - - diff --git a/doc/html/boost/date_time/time__1_3_12_15_3_52_1_1_3.html b/doc/html/boost/date_time/time__1_3_12_15_3_52_1_1_3.html deleted file mode 100644 index fadec7a948..0000000000 --- a/doc/html/boost/date_time/time__1_3_12_15_3_52_1_1_3.html +++ /dev/null @@ -1,69 +0,0 @@ - - - - -Struct time_resolution_traits_bi64_impl - - - - - - - - - - - - - - - -
        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
        -
        -
        -PrevUpHomeNext -
        -
        -
        -
        -

        Struct time_resolution_traits_bi64_impl

        -

        boost::date_time::time_resolution_traits_bi64_impl — traits struct for time_resolution_traits implementation type

        -
        -

        Synopsis

        -
        // In header: <boost/date_time/time_resolution_traits.hpp>
-
-
-struct time_resolution_traits_bi64_impl {
-  // types
-  typedef boost::int64_t int_type; 
-  typedef boost::int64_t impl_type;
-
-  // public static functions
-  static int_type as_number(impl_type);
-  static bool is_adapted();
-};
        -
        -

        Description

        -
        -

        -time_resolution_traits_bi64_impl public static functions

        -
          -
        1. static int_type as_number(impl_type i);
          2. -
        2. -
          static bool is_adapted();
          Used to determine if implemented type is int_adapter or int.
          3. -
        -
        -
        -
        - - - -
        Copyright © 2001-2005 CrystalClear Software, Inc

        Subject to the Boost Software License, Version 1.0. (See accompanying file - LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

        -
        -
        -
        -PrevUpHomeNext -
        - - diff --git a/doc/html/boost/date_time/time__1_3_12_15_3_52_1_1_4.html b/doc/html/boost/date_time/time__1_3_12_15_3_52_1_1_4.html deleted file mode 100644 index ce94c9e175..0000000000 --- a/doc/html/boost/date_time/time__1_3_12_15_3_52_1_1_4.html +++ /dev/null @@ -1,69 +0,0 @@ - - - - -Struct time_resolution_traits_adapted64_impl - - - - - - - - - - - - - - - -
        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
        -
        -
        -PrevUpHomeNext -
        -
        -
        -
        -

        Struct time_resolution_traits_adapted64_impl

        -

        boost::date_time::time_resolution_traits_adapted64_impl — traits struct for time_resolution_traits implementation type

        -
        -

        Synopsis

        -
        // In header: <boost/date_time/time_resolution_traits.hpp>
-
-
-struct time_resolution_traits_adapted64_impl {
-  // types
-  typedef boost::int64_t                                  int_type; 
-  typedef boost::date_time::int_adapter< boost::int64_t > impl_type;
-
-  // public static functions
-  static int_type as_number(impl_type);
-  static bool is_adapted();
-};
        -
        -

        Description

        -
        -

        -time_resolution_traits_adapted64_impl public static functions

        -
          -
        1. static int_type as_number(impl_type i);
          2. -
        2. -
          static bool is_adapted();
          Used to determine if implemented type is int_adapter or int.
          3. -
        -
        -
        -
        - - - -
        Copyright © 2001-2005 CrystalClear Software, Inc

        Subject to the Boost Software License, Version 1.0. (See accompanying file - LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

        -
        -
        -
        -PrevUpHomeNext -
        - - diff --git a/doc/html/boost/date_time/time__1_3_13_15_3_52_1_1_1.html b/doc/html/boost/date_time/time__1_3_13_15_3_52_1_1_1.html new file mode 100644 index 0000000000..508634d7ba --- /dev/null +++ b/doc/html/boost/date_time/time__1_3_13_15_3_52_1_1_1.html @@ -0,0 +1,69 @@ + + + + +Struct time_resolution_traits_bi32_impl + + + + + + + + + + + + + + + +
        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
        +
        +
        +PrevUpHomeNext +
        +
        +
        +
        +

        Struct time_resolution_traits_bi32_impl

        +

        boost::date_time::time_resolution_traits_bi32_impl — traits struct for time_resolution_traits implementation type

        +
        +

        Synopsis

        +
        // In header: <boost/date_time/time_resolution_traits.hpp>
+
+
+struct time_resolution_traits_bi32_impl {
+  // types
+  typedef boost::int32_t int_type; 
+  typedef boost::int32_t impl_type;
+
+  // public static functions
+  static int_type as_number(impl_type);
+  static bool is_adapted();
+};
        +
        +

        Description

        +
        +

        +time_resolution_traits_bi32_impl public static functions

        +
          +
        1. static int_type as_number(impl_type i);
          2. +
        2. +
          static bool is_adapted();
          Used to determine if implemented type is int_adapter or int.
          3. +
        +
        +
        +
        + + + +
        Copyright © 2001-2005 CrystalClear Software, Inc

        Subject to the Boost Software License, Version 1.0. (See accompanying file + LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

        +
        +
        +
        +PrevUpHomeNext +
        + + diff --git a/doc/html/boost/date_time/time__1_3_13_15_3_52_1_1_2.html b/doc/html/boost/date_time/time__1_3_13_15_3_52_1_1_2.html new file mode 100644 index 0000000000..9456de1ad0 --- /dev/null +++ b/doc/html/boost/date_time/time__1_3_13_15_3_52_1_1_2.html @@ -0,0 +1,69 @@ + + + + +Struct time_resolution_traits_adapted32_impl + + + + + + + + + + + + + + + +
        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
        +
        +
        +PrevUpHomeNext +
        +
        +
        +
        +

        Struct time_resolution_traits_adapted32_impl

        +

        boost::date_time::time_resolution_traits_adapted32_impl — traits struct for time_resolution_traits implementation type

        +
        +

        Synopsis

        +
        // In header: <boost/date_time/time_resolution_traits.hpp>
+
+
+struct time_resolution_traits_adapted32_impl {
+  // types
+  typedef boost::int32_t                                  int_type; 
+  typedef boost::date_time::int_adapter< boost::int32_t > impl_type;
+
+  // public static functions
+  static int_type as_number(impl_type);
+  static bool is_adapted();
+};
        +
        +

        Description

        +
        +

        +time_resolution_traits_adapted32_impl public static functions

        +
          +
        1. static int_type as_number(impl_type i);
          2. +
        2. +
          static bool is_adapted();
          Used to determine if implemented type is int_adapter or int.
          3. +
        +
        +
        +
        + + + +
        Copyright © 2001-2005 CrystalClear Software, Inc

        Subject to the Boost Software License, Version 1.0. (See accompanying file + LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

        +
        +
        +
        +PrevUpHomeNext +
        + + diff --git a/doc/html/boost/date_time/time__1_3_13_15_3_52_1_1_3.html b/doc/html/boost/date_time/time__1_3_13_15_3_52_1_1_3.html new file mode 100644 index 0000000000..1fcd75e9c0 --- /dev/null +++ b/doc/html/boost/date_time/time__1_3_13_15_3_52_1_1_3.html @@ -0,0 +1,69 @@ + + + + +Struct time_resolution_traits_bi64_impl + + + + + + + + + + + + + + + +
        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
        +
        +
        +PrevUpHomeNext +
        +
        +
        +
        +

        Struct time_resolution_traits_bi64_impl

        +

        boost::date_time::time_resolution_traits_bi64_impl — traits struct for time_resolution_traits implementation type

        +
        +

        Synopsis

        +
        // In header: <boost/date_time/time_resolution_traits.hpp>
+
+
+struct time_resolution_traits_bi64_impl {
+  // types
+  typedef boost::int64_t int_type; 
+  typedef boost::int64_t impl_type;
+
+  // public static functions
+  static int_type as_number(impl_type);
+  static bool is_adapted();
+};
        +
        +

        Description

        +
        +

        +time_resolution_traits_bi64_impl public static functions

        +
          +
        1. static int_type as_number(impl_type i);
          2. +
        2. +
          static bool is_adapted();
          Used to determine if implemented type is int_adapter or int.
          3. +
        +
        +
        +
        + + + +
        Copyright © 2001-2005 CrystalClear Software, Inc

        Subject to the Boost Software License, Version 1.0. (See accompanying file + LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

        +
        +
        +
        +PrevUpHomeNext +
        + + diff --git a/doc/html/boost/date_time/time__1_3_13_15_3_52_1_1_4.html b/doc/html/boost/date_time/time__1_3_13_15_3_52_1_1_4.html new file mode 100644 index 0000000000..2abea01da5 --- /dev/null +++ b/doc/html/boost/date_time/time__1_3_13_15_3_52_1_1_4.html @@ -0,0 +1,69 @@ + + + + +Struct time_resolution_traits_adapted64_impl + + + + + + + + + + + + + + + +
        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
        +
        +
        +PrevUpHomeNext +
        +
        +
        +
        +

        Struct time_resolution_traits_adapted64_impl

        +

        boost::date_time::time_resolution_traits_adapted64_impl — traits struct for time_resolution_traits implementation type

        +
        +

        Synopsis

        +
        // In header: <boost/date_time/time_resolution_traits.hpp>
+
+
+struct time_resolution_traits_adapted64_impl {
+  // types
+  typedef boost::int64_t                                  int_type; 
+  typedef boost::date_time::int_adapter< boost::int64_t > impl_type;
+
+  // public static functions
+  static int_type as_number(impl_type);
+  static bool is_adapted();
+};
        +
        +

        Description

        +
        +

        +time_resolution_traits_adapted64_impl public static functions

        +
          +
        1. static int_type as_number(impl_type i);
          2. +
        2. +
          static bool is_adapted();
          Used to determine if implemented type is int_adapter or int.
          3. +
        +
        +
        +
        + + + +
        Copyright © 2001-2005 CrystalClear Software, Inc

        Subject to the Boost Software License, Version 1.0. (See accompanying file + LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

        +
        +
        +
        +PrevUpHomeNext +
        + + diff --git a/doc/html/boost/date_time/time_duration.html b/doc/html/boost/date_time/time_duration.html index 7813d5652e..bd699c41d9 100644 --- a/doc/html/boost/date_time/time_duration.html +++ b/doc/html/boost/date_time/time_duration.html @@ -38,7 +38,7 @@ { public: // types - typedef void _is_boost_date_time_duration; + typedef void _is_boost_date_time_duration; typedef T duration_type; typedef rep_type traits_type; typedef rep_type::day_type day_type; @@ -50,131 +50,131 @@ typedef rep_type::impl_type impl_type; // construct/copy/destruct - time_duration(); - time_duration(hour_type, min_type, sec_type = 0, + time_duration(); + time_duration(hour_type, min_type, sec_type = 0, fractional_seconds_type = 0); - time_duration(const time_duration< T, rep_type > &); - time_duration(special_values); - explicit time_duration(impl_type); + time_duration(const time_duration< T, rep_type > &); + time_duration(special_values); + explicit time_duration(impl_type); - // public member functions - hour_type hours() const; - min_type minutes() const; - sec_type seconds() const; - sec_type total_seconds() const; - tick_type total_milliseconds() const; - tick_type total_nanoseconds() const; - tick_type total_microseconds() const; - fractional_seconds_type fractional_seconds() const; - duration_type invert_sign() const; - bool is_negative() const; - bool operator<(const time_duration &) const; - bool operator==(const time_duration &) const; - duration_type operator-() const; - duration_type operator-(const duration_type &) const; - duration_type operator+(const duration_type &) const; - duration_type operator/(int) const; - duration_type operator-=(const duration_type &); - duration_type operator+=(const duration_type &); - duration_type operator/=(int); - duration_type operator*(int) const; - duration_type operator*=(int); - tick_type ticks() const; - bool is_special() const; - bool is_pos_infinity() const; - bool is_neg_infinity() const; - bool is_not_a_date_time() const; - impl_type get_rep() const; + // public member functions + hour_type hours() const; + min_type minutes() const; + sec_type seconds() const; + sec_type total_seconds() const; + tick_type total_milliseconds() const; + tick_type total_nanoseconds() const; + tick_type total_microseconds() const; + fractional_seconds_type fractional_seconds() const; + duration_type invert_sign() const; + bool is_negative() const; + bool operator<(const time_duration &) const; + bool operator==(const time_duration &) const; + duration_type operator-() const; + duration_type operator-(const duration_type &) const; + duration_type operator+(const duration_type &) const; + duration_type operator/(int) const; + duration_type operator-=(const duration_type &); + duration_type operator+=(const duration_type &); + duration_type operator/=(int); + duration_type operator*(int) const; + duration_type operator*=(int); + tick_type ticks() const; + bool is_special() const; + bool is_pos_infinity() const; + bool is_neg_infinity() const; + bool is_not_a_date_time() const; + impl_type get_rep() const; - // public static functions - static duration_type unit(); - static tick_type ticks_per_second(); - static time_resolutions resolution(); - static unsigned short num_fractional_digits(); + // public static functions + static duration_type unit(); + static tick_type ticks_per_second(); + static time_resolutions resolution(); + static unsigned short num_fractional_digits(); };
        -

        Description

        +

        Description

        This class represents a standard set of capabilities for all counted time durations. Time duration implementations should derive from this class passing their type as the first template parameter. This design allows the subclass duration types to provide custom construction policies or other custom features not provided here.

        -

        +

        time_duration public construct/copy/destruct

          -
        1. time_duration();
          2. -
        2. time_duration(hour_type hours_in, min_type minutes_in, 
+
        3. time_duration();
          4. 
+
        4. time_duration(hour_type hours_in, min_type minutes_in, 
               sec_type seconds_in = 0, 
               fractional_seconds_type frac_sec_in = 0);
          5. 
 
        5. 
-
          time_duration(const time_duration< T, rep_type > & other);
          Construct from another time_duration (Copy constructor) 
          6. 
+
          time_duration(const time_duration< T, rep_type > & other);
          Construct from another time_duration (Copy constructor)
        6. -
          time_duration(special_values sv);
          Construct from special_values.
          7. -
        7. explicit time_duration(impl_type in);
          8. +
          time_duration(special_values sv);
          Construct from special_values. +
        8. explicit time_duration(impl_type in);
        -

        -time_duration public member functions

        +

        +time_duration public member functions

        1. -
          hour_type hours() const;
          Returns number of hours in the duration.
          2. +
          hour_type hours() const;
          Returns number of hours in the duration.
        2. -
          min_type minutes() const;
          Returns normalized number of minutes.
          3. +
          min_type minutes() const;
          Returns normalized number of minutes.
        3. -
          sec_type seconds() const;
          Returns normalized number of seconds (0..60)
          4. +
          sec_type seconds() const;
          Returns normalized number of seconds (0..60)
        4. -
          sec_type total_seconds() const;
          Returns total number of seconds truncating any fractional seconds.
          5. +
          sec_type total_seconds() const;
          Returns total number of seconds truncating any fractional seconds.
        5. -
          tick_type total_milliseconds() const;
          Returns total number of milliseconds truncating any fractional seconds.
          6. +
          tick_type total_milliseconds() const;
          Returns total number of milliseconds truncating any fractional seconds.
        6. -
          tick_type total_nanoseconds() const;
          Returns total number of nanoseconds truncating any sub millisecond values.
          7. +
          tick_type total_nanoseconds() const;
          Returns total number of nanoseconds truncating any sub millisecond values.
        7. -
          tick_type total_microseconds() const;
          Returns total number of microseconds truncating any sub microsecond values.
          8. +
          tick_type total_microseconds() const;
          Returns total number of microseconds truncating any sub microsecond values.
        8. -
          fractional_seconds_type fractional_seconds() const;
          Returns count of fractional seconds at given resolution.
          9. -
        9. duration_type invert_sign() const;
          10. -
        10. bool is_negative() const;
          11. -
        11. bool operator<(const time_duration & rhs) const;
          12. -
        12. bool operator==(const time_duration & rhs) const;
          13. +
          fractional_seconds_type fractional_seconds() const;
          Returns count of fractional seconds at given resolution. +
        13. duration_type invert_sign() const;
          14. +
        14. bool is_negative() const;
          15. +
        15. bool operator<(const time_duration & rhs) const;
          16. +
        16. bool operator==(const time_duration & rhs) const;
        17. -
          duration_type operator-() const;
          unary- Allows for time_duration td = -td1
          18. -
        18. duration_type operator-(const duration_type & d) const;
          19. -
        19. duration_type operator+(const duration_type & d) const;
          20. -
        20. duration_type operator/(int divisor) const;
          21. -
        21. duration_type operator-=(const duration_type & d);
          22. -
        22. duration_type operator+=(const duration_type & d);
          23. +
          duration_type operator-() const;
          unary- Allows for time_duration td = -td1 +
        23. duration_type operator-(const duration_type & d) const;
          24. +
        24. duration_type operator+(const duration_type & d) const;
          25. +
        25. duration_type operator/(int divisor) const;
          26. +
        26. duration_type operator-=(const duration_type & d);
          27. +
        27. duration_type operator+=(const duration_type & d);
        28. -
          duration_type operator/=(int divisor);
          Division operations on a duration with an integer.
          29. +
          duration_type operator/=(int divisor);
          Division operations on a duration with an integer.
        29. -
          duration_type operator*(int rhs) const;
          Multiplication operations an a duration with an integer.
          30. -
        30. duration_type operator*=(int divisor);
          31. -
        31. tick_type ticks() const;
          32. +
          duration_type operator*(int rhs) const;
          Multiplication operations an a duration with an integer. +
        32. duration_type operator*=(int divisor);
          33. +
        33. tick_type ticks() const;
        34. -
          bool is_special() const;
          Is ticks_ a special value?
          35. +
          bool is_special() const;
          Is ticks_ a special value?
        35. -
          bool is_pos_infinity() const;
          Is duration pos-infinity.
          36. +
          bool is_pos_infinity() const;
          Is duration pos-infinity.
        36. -
          bool is_neg_infinity() const;
          Is duration neg-infinity.
          37. +
          bool is_neg_infinity() const;
          Is duration neg-infinity.
        37. -
          bool is_not_a_date_time() const;
          Is duration not-a-date-time.
          38. +
          bool is_not_a_date_time() const;
          Is duration not-a-date-time.
        38. -
          impl_type get_rep() const;
          Used for special_values output.
          39. +
          impl_type get_rep() const;
          Used for special_values output.
        -

        -time_duration public static functions

        +

        +time_duration public static functions

        1. -
          static duration_type unit();
          Returns smallest representable duration.
          2. +
          static duration_type unit();
          Returns smallest representable duration.
        2. -
          static tick_type ticks_per_second();
          Return the number of ticks in a second.
          3. +
          static tick_type ticks_per_second();
          Return the number of ticks in a second.
        3. -
          static time_resolutions resolution();
          Provide the resolution of this duration type.
          4. +
          static time_resolutions resolution();
          Provide the resolution of this duration type.
        4. -
          static unsigned short num_fractional_digits();
          Returns number of possible digits in fractional seconds.
          5. +
          static unsigned short num_fractional_digits();
          Returns number of possible digits in fractional seconds.
        diff --git a/doc/html/boost/date_time/time_facet.html b/doc/html/boost/date_time/time_facet.html index 59241f2c62..a687df6289 100644 --- a/doc/html/boost/date_time/time_facet.html +++ b/doc/html/boost/date_time/time_facet.html @@ -46,31 +46,31 @@ typedef base_type::string_type string_type; typedef base_type::char_type char_type; typedef base_type::period_formatter_type period_formatter_type; - typedef base_type::special_values_formatter_type special_values_formatter_type; + typedef base_type::special_values_formatter_type special_values_formatter_type; typedef base_type::date_gen_formatter_type date_gen_formatter_type; // construct/copy/destruct - explicit time_facet(::size_t = 0); - explicit time_facet(const char_type *, + explicit time_facet(::size_t = 0); + explicit time_facet(const char_type *, period_formatter_type = period_formatter_type(), - const special_values_formatter_type & = special_values_formatter_type(), + const special_values_formatter_type & = special_values_formatter_type(), date_gen_formatter_type = date_gen_formatter_type(), ::size_t = 0); - // public member functions - std::locale::id & __get_id(void) const; - void time_duration_format(const char_type *const); - virtual void set_iso_format(); - virtual void set_iso_extended_format(); - OutItrT put(OutItrT, std::ios_base &, char_type, const time_type &) const; - OutItrT put(OutItrT, std::ios_base &, char_type, const time_duration_type &) const; - OutItrT put(OutItrT, std::ios_base &, char_type, const period_type &) const; + // public member functions + std::locale::id & __get_id(void) const; + void time_duration_format(const char_type *const); + virtual void set_iso_format(); + virtual void set_iso_extended_format(); + OutItrT put(OutItrT, std::ios_base &, char_type, const time_type &) const; + OutItrT put(OutItrT, std::ios_base &, char_type, const time_duration_type &) const; + OutItrT put(OutItrT, std::ios_base &, char_type, const period_type &) const; - // protected static functions + // protected static functions static string_type - fractional_seconds_as_string(const time_duration_type &, bool); - static string_type hours_as_string(const time_duration_type &, int = 2); - template<typename IntT> static string_type integral_as_string(IntT, int = 2); + fractional_seconds_as_string(const time_duration_type &, bool); + static string_type hours_as_string(const time_duration_type &, int = 2); + template<typename IntT> static string_type integral_as_string(IntT, int = 2); // public data members static const char_type * fractional_seconds_format; @@ -97,7 +97,7 @@ static std::locale::id id; };
        -

        Description

        +

        Description

        Facet used for format-based output of time types This class provides for the use of format strings to output times. In addition to the flags for formatting date elements, the following are the allowed format flags:

        • x X => default format - enables addition of more flags to default (ie. "%x %X %z")

          • @@ -111,52 +111,52 @@

          -

          +

          time_facet public construct/copy/destruct

          1. -
            explicit time_facet(::size_t ref_arg = 0);
            sets default formats for ptime, local_date_time, and time_duration +
            explicit time_facet(::size_t ref_arg = 0);
            sets default formats for ptime, local_date_time, and time_duration
          2. -
            explicit time_facet(const char_type * format_arg, 
+
            explicit time_facet(const char_type * format_arg, 
                     period_formatter_type period_formatter_arg = period_formatter_type(), 
-                    const special_values_formatter_type & special_value_formatter = special_values_formatter_type(), 
+                    const special_values_formatter_type & special_value_formatter = special_values_formatter_type(), 
                     date_gen_formatter_type dg_formatter = date_gen_formatter_type(), 
                     ::size_t ref_arg = 0);
            Construct the facet with an explicitly specified format.
          -

          -time_facet public member functions

          +

          +time_facet public member functions

            -
          1. std::locale::id & __get_id(void) const;
            2. +
          2. std::locale::id & __get_id(void) const;
          3. -
            void time_duration_format(const char_type *const format);
            Changes format for time_duration.
            4. -
          4. virtual void set_iso_format();
            5. -
          5. virtual void set_iso_extended_format();
            6. -
          6. OutItrT put(OutItrT next_arg, std::ios_base & ios_arg, char_type fill_arg, 
+
            void time_duration_format(const char_type *const format);
            Changes format for time_duration.
            7. +
          7. virtual void set_iso_format();
            8. +
          8. virtual void set_iso_extended_format();
            9. +
          9. OutItrT put(OutItrT next_arg, std::ios_base & ios_arg, char_type fill_arg, 
             const time_type & time_arg) const;
          10. -
            OutItrT put(OutItrT next_arg, std::ios_base & ios_arg, char_type fill_arg, 
+
            OutItrT put(OutItrT next_arg, std::ios_base & ios_arg, char_type fill_arg, 
             const time_duration_type & time_dur_arg) const;
            put function for time_duration
            11. -
          11. OutItrT put(OutItrT next, std::ios_base & ios_arg, char_type fill, 
+
          12. OutItrT put(OutItrT next, std::ios_base & ios_arg, char_type fill, 
             const period_type & p) const;
            13.
          -

          -time_facet protected static functions

          +

          +time_facet protected static functions

          1. static string_type 
-fractional_seconds_as_string(const time_duration_type & time_arg, 
+fractional_seconds_as_string(const time_duration_type & time_arg, 
                              bool null_when_zero);
          2. static string_type 
-hours_as_string(const time_duration_type & time_arg, int width = 2);
            3. +hours_as_string(const time_duration_type & time_arg, int width = 2); 
          3. template<typename IntT> 
-  static string_type integral_as_string(IntT val, int width = 2);
            4. + static string_type integral_as_string(IntT val, int width = 2);
        diff --git a/doc/html/boost/date_time/time_from_ftime.html b/doc/html/boost/date_time/time_from_ftime.html index b9511ce276..83521accac 100644 --- a/doc/html/boost/date_time/time_from_ftime.html +++ b/doc/html/boost/date_time/time_from_ftime.html @@ -36,7 +36,7 @@ template<typename TimeT, typename FileTimeT> TimeT time_from_ftime(const FileTimeT & ft);
        -

        Description

        +

        Description

        Create a time object from an initialized FILETIME struct. A FILETIME struct holds 100-nanosecond units (0.0000001). When built with microsecond resolution the file_time's sub second value will be truncated. Nanosecond resolution has no truncation.

        diff --git a/doc/html/boost/date_time/time_input_facet.html b/doc/html/boost/date_time/time_input_facet.html index 2e1534b7cd..c880f38eea 100644 --- a/doc/html/boost/date_time/time_input_facet.html +++ b/doc/html/boost/date_time/time_input_facet.html @@ -8,7 +8,7 @@ - +
        @@ -21,7 +21,7 @@
        -PrevUpHomeNext +PrevUpHomeNext
        @@ -57,35 +57,35 @@ typedef base_type::special_values_parser_type::match_results match_results; // construct/copy/destruct - explicit time_input_facet(const string_type &, ::size_t = 0); - explicit time_input_facet(const string_type &, + explicit time_input_facet(const string_type &, ::size_t = 0); + explicit time_input_facet(const string_type &, const format_date_parser_type &, const special_values_parser_type &, const period_parser_type &, const date_gen_parser_type &, ::size_t = 0); - explicit time_input_facet(::size_t = 0); + explicit time_input_facet(::size_t = 0); - // public member functions - void time_duration_format(const char_type *const); - virtual void set_iso_format(); - virtual void set_iso_extended_format(); - InItrT get(InItrT &, InItrT &, std::ios_base &, period_type &) const; - InItrT get(InItrT &, InItrT &, std::ios_base &, time_duration_type &) const; - InItrT get(InItrT &, InItrT &, std::ios_base &, time_type &) const; - InItrT get_local_time(InItrT &, InItrT &, std::ios_base &, time_type &, + // public member functions + void time_duration_format(const char_type *const); + virtual void set_iso_format(); + virtual void set_iso_extended_format(); + InItrT get(InItrT &, InItrT &, std::ios_base &, period_type &) const; + InItrT get(InItrT &, InItrT &, std::ios_base &, time_duration_type &) const; + InItrT get(InItrT &, InItrT &, std::ios_base &, time_type &) const; + InItrT get_local_time(InItrT &, InItrT &, std::ios_base &, time_type &, string_type &) const; - // protected member functions - InItrT get(InItrT &, InItrT &, std::ios_base &, time_type &, string_type &, + // protected member functions + InItrT get(InItrT &, InItrT &, std::ios_base &, time_type &, string_type &, bool) const; template<typename temporal_type> - InItrT check_special_value(InItrT &, InItrT &, temporal_type &, + InItrT check_special_value(InItrT &, InItrT &, temporal_type &, char_type = '\0') const; - void parse_frac_type(InItrT &, InItrT &, fracional_seconds_type &) const; + void parse_frac_type(InItrT &, InItrT &, fracional_seconds_type &) const; - // private member functions + // private member functions template<typename int_type> - int_type decimal_adjust(int_type, const unsigned short) const; + int_type decimal_adjust(int_type, const unsigned short) const; // public data members static const char_type * fractional_seconds_format; @@ -105,69 +105,69 @@ static std::locale::id id; };
        -

        Description

        +

        Description

        -

        +

        time_input_facet public construct/copy/destruct

        1. -
          explicit time_input_facet(const string_type & format, ::size_t ref_arg = 0);
          Constructor that takes a format string for a ptime.
          2. -
        2. explicit time_input_facet(const string_type & format, 
+
          explicit time_input_facet(const string_type & format, ::size_t ref_arg = 0);
          Constructor that takes a format string for a ptime.
          3. +
        3. explicit time_input_facet(const string_type & format, 
                           const format_date_parser_type & date_parser, 
                           const special_values_parser_type & sv_parser, 
                           const period_parser_type & per_parser, 
                           const date_gen_parser_type & date_gen_parser, 
                           ::size_t ref_arg = 0);
        4. -
          explicit time_input_facet(::size_t ref_arg = 0);
          sets default formats for ptime, local_date_time, and time_duration +
          explicit time_input_facet(::size_t ref_arg = 0);
          sets default formats for ptime, local_date_time, and time_duration
        -

        -time_input_facet public member functions

        +

        +time_input_facet public member functions

        1. -
          void time_duration_format(const char_type *const format);
          Set the format for time_duration.
          2. -
        2. virtual void set_iso_format();
          3. -
        3. virtual void set_iso_extended_format();
          4. -
        4. InItrT get(InItrT & sitr, InItrT & stream_end, std::ios_base & ios_arg, 
+
          void time_duration_format(const char_type *const format);
          Set the format for time_duration.
          5. +
        5. virtual void set_iso_format();
          6. +
        6. virtual void set_iso_extended_format();
          7. +
        7. InItrT get(InItrT & sitr, InItrT & stream_end, std::ios_base & ios_arg, 
            period_type & p) const;
          8. -
        8. InItrT get(InItrT & sitr, InItrT & stream_end, std::ios_base & ios_arg, 
+
        9. InItrT get(InItrT & sitr, InItrT & stream_end, std::ios_base & ios_arg, 
            time_duration_type & td) const;
          10. 
 
        10. 
-
          InItrT get(InItrT & sitr, InItrT & stream_end, std::ios_base & ios_arg, 
+
          InItrT get(InItrT & sitr, InItrT & stream_end, std::ios_base & ios_arg, 
            time_type & t) const;
          Parses a time object from the input stream. 
          11. 
 
        11. 
-
          InItrT get_local_time(InItrT & sitr, InItrT & stream_end, 
+
          InItrT get_local_time(InItrT & sitr, InItrT & stream_end, 
                       std::ios_base & ios_arg, time_type & t, 
                       string_type & tz_str) const;
          Expects a time_zone in the input stream. 
          12.
        -

        -time_input_facet protected member functions

        +

        +time_input_facet protected member functions

          -
        1. InItrT get(InItrT & sitr, InItrT & stream_end, std::ios_base & ios_arg, 
+
        2. InItrT get(InItrT & sitr, InItrT & stream_end, std::ios_base & ios_arg, 
            time_type & t, string_type & tz_str, bool time_is_local) const;
          3. 
 
        3. 
 
          template<typename temporal_type> 
-  InItrT check_special_value(InItrT & sitr, InItrT & stream_end, 
+  InItrT check_special_value(InItrT & sitr, InItrT & stream_end, 
                              temporal_type & tt, char_type c = '\0') const;
          Helper function to check for special_value. 
          First character may have been consumed during original parse attempt. Parameter 'c' should be a copy of that character. Throws ios_base::failure if parse fails. 
          
 
          4. 
 
        4. 
-
          void parse_frac_type(InItrT & sitr, InItrT & stream_end, 
+
          void parse_frac_type(InItrT & sitr, InItrT & stream_end, 
                      fracional_seconds_type & frac) const;
          Helper function for parsing a fractional second type from the stream. 
          5.
        -

        -time_input_facet private member functions

        +

        +time_input_facet private member functions

        1. template<typename int_type> 
-  int_type decimal_adjust(int_type val, const unsigned short places) const;
          Helper function to adjust trailing zeros when parsing fractional digits.
        + int_type decimal_adjust(int_type val, const unsigned short places) const;Helper function to adjust trailing zeros when parsing fractional digits.
        @@ -179,7 +179,7 @@
        -PrevUpHomeNext +PrevUpHomeNext
        diff --git a/doc/html/boost/date_time/time_itr.html b/doc/html/boost/date_time/time_itr.html index 987ea15901..d2b3b3d738 100644 --- a/doc/html/boost/date_time/time_itr.html +++ b/doc/html/boost/date_time/time_itr.html @@ -7,8 +7,8 @@ - - + + @@ -21,7 +21,7 @@
        -PrevUpHomeNext +PrevUpHomeNext
        @@ -39,43 +39,43 @@ typedef time_type::time_duration_type time_duration_type; // construct/copy/destruct - time_itr(time_type, time_duration_type); + time_itr(time_type, time_duration_type); - // public member functions - time_itr & operator++(); - time_itr & operator--(); - time_type operator*(); - time_type * operator->(); - bool operator<(const time_type &); - bool operator<=(const time_type &); - bool operator!=(const time_type &); - bool operator==(const time_type &); - bool operator>(const time_type &); - bool operator>=(const time_type &); + // public member functions + time_itr & operator++(); + time_itr & operator--(); + time_type operator*(); + time_type * operator->(); + bool operator<(const time_type &); + bool operator<=(const time_type &); + bool operator!=(const time_type &); + bool operator==(const time_type &); + bool operator>(const time_type &); + bool operator>=(const time_type &); };
        -

        Description

        +

        Description

        -

        +

        time_itr public construct/copy/destruct

        -
        1. time_itr(time_type t, time_duration_type d);
        +
        1. time_itr(time_type t, time_duration_type d);
        -

        -time_itr public member functions

        +

        +time_itr public member functions

          -
        1. time_itr & operator++();
          2. -
        2. time_itr & operator--();
          3. -
        3. time_type operator*();
          4. -
        4. time_type * operator->();
          5. -
        5. bool operator<(const time_type & t);
          6. -
        6. bool operator<=(const time_type & t);
          7. -
        7. bool operator!=(const time_type & t);
          8. -
        8. bool operator==(const time_type & t);
          9. -
        9. bool operator>(const time_type & t);
          10. -
        10. bool operator>=(const time_type & t);
          11. +
        11. time_itr & operator++();
          12. +
        12. time_itr & operator--();
          13. +
        13. time_type operator*();
          14. +
        14. time_type * operator->();
          15. +
        15. bool operator<(const time_type & t);
          16. +
        16. bool operator<=(const time_type & t);
          17. +
        17. bool operator!=(const time_type & t);
          18. +
        18. bool operator==(const time_type & t);
          19. +
        19. bool operator>(const time_type & t);
          20. +
        20. bool operator>=(const time_type & t);
        @@ -88,7 +88,7 @@
        -PrevUpHomeNext +PrevUpHomeNext
        diff --git a/doc/html/boost/date_time/time_resolution_traits.html b/doc/html/boost/date_time/time_resolution_traits.html index 700da35ff9..d6d3713064 100644 --- a/doc/html/boost/date_time/time_resolution_traits.html +++ b/doc/html/boost/date_time/time_resolution_traits.html @@ -7,7 +7,7 @@ - + @@ -21,7 +21,7 @@
        -PrevUpHomeNext +PrevUpHomeNext
        @@ -35,7 +35,8 @@ template<typename frac_sec_type, time_resolutions res, #if(defined(BOOST_MSVC)&&(_MSC_VER< 1300)) boost::int64_t resolution_adjust, #else typename frac_sec_type::int_type resolution_adjust, - #endif unsigned short frac_digits, typename var_type = std::time_t> + #endif unsigned short frac_digits, + typename var_type = boost::int64_t> class time_resolution_traits { public: // types @@ -47,43 +48,43 @@ typedef var_type min_type; typedef var_type sec_type; - // public static functions - static fractional_seconds_type as_number(impl_type); - static bool is_adapted(); - static time_resolutions resolution(); - static unsigned short num_fractional_digits(); - static fractional_seconds_type res_adjust(); + // public static functions + static fractional_seconds_type as_number(impl_type); + static bool is_adapted(); + static time_resolutions resolution(); + static unsigned short num_fractional_digits(); + static fractional_seconds_type res_adjust(); static tick_type - to_tick_count(hour_type, min_type, sec_type, fractional_seconds_type); + to_tick_count(hour_type, min_type, sec_type, fractional_seconds_type); - // public member functions - BOOST_STATIC_CONSTANT(boost::int64_t, ticks_per_second = resolution_adjust); - BOOST_STATIC_CONSTANT(fractional_seconds_type, + // public member functions + BOOST_STATIC_CONSTANT(boost::int64_t, ticks_per_second = resolution_adjust); + BOOST_STATIC_CONSTANT(fractional_seconds_type, ticks_per_second = resolution_adjust); };
        -

        Description

        +

        Description

        -

        -time_resolution_traits public static functions

        +

        +time_resolution_traits public static functions

          -
        1. static fractional_seconds_type as_number(impl_type i);
          2. -
        2. static bool is_adapted();
          3. -
        3. static time_resolutions resolution();
          4. -
        4. static unsigned short num_fractional_digits();
          5. -
        5. static fractional_seconds_type res_adjust();
          6. +
        6. static fractional_seconds_type as_number(impl_type i);
          7. +
        7. static bool is_adapted();
          8. +
        8. static time_resolutions resolution();
          9. +
        9. static unsigned short num_fractional_digits();
          10. +
        10. static fractional_seconds_type res_adjust();
        11. static tick_type 
-to_tick_count(hour_type hours, min_type minutes, sec_type seconds, 
+to_tick_count(hour_type hours, min_type minutes, sec_type seconds, 
               fractional_seconds_type fs);
          Any negative argument results in a negative tick_count.
        -

        -time_resolution_traits public member functions

        +

        +time_resolution_traits public member functions

          -
        1.  BOOST_STATIC_CONSTANT(boost::int64_t, ticks_per_second = resolution_adjust);
          2. -
        2.  BOOST_STATIC_CONSTANT(fractional_seconds_type, 
+
        3.  BOOST_STATIC_CONSTANT(boost::int64_t, ticks_per_second = resolution_adjust);
          4. 
+
        4.  BOOST_STATIC_CONSTANT(fractional_seconds_type, 
                        ticks_per_second = resolution_adjust);
          5.
        @@ -97,7 +98,7 @@
      -PrevUpHomeNext +PrevUpHomeNext
      diff --git a/doc/html/boost/date_time/time_zone_base.html b/doc/html/boost/date_time/time_zone_base.html index 85b37b3a17..d3da665319 100644 --- a/doc/html/boost/date_time/time_zone_base.html +++ b/doc/html/boost/date_time/time_zone_base.html @@ -43,59 +43,59 @@ typedef time_type::time_duration_type time_duration_type; // construct/copy/destruct - time_zone_base(); - ~time_zone_base(); + time_zone_base(); + ~time_zone_base(); - // public member functions - virtual string_type dst_zone_abbrev() const = 0; - virtual string_type std_zone_abbrev() const = 0; - virtual string_type dst_zone_name() const = 0; - virtual string_type std_zone_name() const = 0; - virtual bool has_dst() const = 0; - virtual time_type dst_local_start_time(year_type) const = 0; - virtual time_type dst_local_end_time(year_type) const = 0; - virtual time_duration_type base_utc_offset() const = 0; - virtual time_duration_type dst_offset() const = 0; - virtual string_type to_posix_string() const = 0; + // public member functions + virtual string_type dst_zone_abbrev() const = 0; + virtual string_type std_zone_abbrev() const = 0; + virtual string_type dst_zone_name() const = 0; + virtual string_type std_zone_name() const = 0; + virtual bool has_dst() const = 0; + virtual time_type dst_local_start_time(year_type) const = 0; + virtual time_type dst_local_end_time(year_type) const = 0; + virtual time_duration_type base_utc_offset() const = 0; + virtual time_duration_type dst_offset() const = 0; + virtual string_type to_posix_string() const = 0; };
      -

      Description

      +

      Description

      This class represents the base interface for all timezone representations. Subclasses may provide different systems for identifying a particular zone. For example some may provide a geographical based zone construction while others may specify the offset from GMT. Another possible implementation would be to convert from POSIX timezone strings. Regardless of the construction technique, this is the interface that these time zone types must provide.

      Note that this class is intended to be used as a shared resource (hence the derivation from boost::counted_base.

      -

      +

      time_zone_base public construct/copy/destruct

        -
      1. time_zone_base();
        2. -
      2. ~time_zone_base();
        3. +
      3. time_zone_base();
        4. +
      4. ~time_zone_base();
      -

      -time_zone_base public member functions

      +

      +time_zone_base public member functions

      1. -
        virtual string_type dst_zone_abbrev() const = 0;
        String for the timezone when in daylight savings (eg: EDT)
        2. +
        virtual string_type dst_zone_abbrev() const = 0;
        String for the timezone when in daylight savings (eg: EDT)
      2. -
        virtual string_type std_zone_abbrev() const = 0;
        String for the zone when not in daylight savings (eg: EST)
        3. +
        virtual string_type std_zone_abbrev() const = 0;
        String for the zone when not in daylight savings (eg: EST)
      3. -
        virtual string_type dst_zone_name() const = 0;
        String for the timezone when in daylight savings (eg: Eastern Daylight Time)
        4. +
        virtual string_type dst_zone_name() const = 0;
        String for the timezone when in daylight savings (eg: Eastern Daylight Time)
      4. -
        virtual string_type std_zone_name() const = 0;
        String for the zone when not in daylight savings (eg: Eastern Standard Time)
        5. +
        virtual string_type std_zone_name() const = 0;
        String for the zone when not in daylight savings (eg: Eastern Standard Time)
      5. -
        virtual bool has_dst() const = 0;
        True if zone uses daylight savings adjustments otherwise false.
        6. +
        virtual bool has_dst() const = 0;
        True if zone uses daylight savings adjustments otherwise false.
      6. -
        virtual time_type dst_local_start_time(year_type y) const = 0;
        Local time that DST starts – undefined if has_dst is false.
        7. +
        virtual time_type dst_local_start_time(year_type y) const = 0;
        Local time that DST starts – undefined if has_dst is false.
      7. -
        virtual time_type dst_local_end_time(year_type y) const = 0;
        Local time that DST ends – undefined if has_dst is false.
        8. +
        virtual time_type dst_local_end_time(year_type y) const = 0;
        Local time that DST ends – undefined if has_dst is false.
      8. -
        virtual time_duration_type base_utc_offset() const = 0;
        Base offset from UTC for zone (eg: -07:30:00)
        9. +
        virtual time_duration_type base_utc_offset() const = 0;
        Base offset from UTC for zone (eg: -07:30:00)
      9. -
        virtual time_duration_type dst_offset() const = 0;
        Adjustment forward or back made while DST is in effect.
        10. +
        virtual time_duration_type dst_offset() const = 0;
        Adjustment forward or back made while DST is in effect.
      10. -
        virtual string_type to_posix_string() const = 0;
        Returns a POSIX time_zone string for this object.
        11. +
        virtual string_type to_posix_string() const = 0;
        Returns a POSIX time_zone string for this object.
      diff --git a/doc/html/boost/date_time/time_zone_names_base.html b/doc/html/boost/date_time/time_zone_names_base.html index 6ef10608eb..9b53037c33 100644 --- a/doc/html/boost/date_time/time_zone_names_base.html +++ b/doc/html/boost/date_time/time_zone_names_base.html @@ -39,40 +39,40 @@ typedef std::basic_string< CharT > string_type; // construct/copy/destruct - time_zone_names_base(); - time_zone_names_base(const string_type &, const string_type &, + time_zone_names_base(); + time_zone_names_base(const string_type &, const string_type &, const string_type &, const string_type &); - // public member functions - string_type dst_zone_abbrev() const; - string_type std_zone_abbrev() const; - string_type dst_zone_name() const; - string_type std_zone_name() const; + // public member functions + string_type dst_zone_abbrev() const; + string_type std_zone_abbrev() const; + string_type dst_zone_name() const; + string_type std_zone_name() const; };
      -

      Description

      +

      Description

      Class that holds various types of strings used for timezones. For example, for the western United States there is the full name: Pacific Standard Time and the abbreviated name: PST. During daylight savings there are additional names: Pacific Daylight Time and PDT. CharT Allows class to support different character types

      -

      +

      time_zone_names_base public construct/copy/destruct

        -
      1. time_zone_names_base();
        2. -
      2. time_zone_names_base(const string_type & std_zone_name_str, 
+
      3. time_zone_names_base();
        4. 
+
      4. time_zone_names_base(const string_type & std_zone_name_str, 
                      const string_type & std_zone_abbrev_str, 
                      const string_type & dst_zone_name_str, 
                      const string_type & dst_zone_abbrev_str);
        5.
      -

      -time_zone_names_base public member functions

      +

      +time_zone_names_base public member functions

        -
      1. string_type dst_zone_abbrev() const;
        2. -
      2. string_type std_zone_abbrev() const;
        3. -
      3. string_type dst_zone_name() const;
        4. -
      4. string_type std_zone_name() const;
        5. +
      5. string_type dst_zone_abbrev() const;
        6. +
      6. string_type std_zone_abbrev() const;
        7. +
      7. string_type dst_zone_name() const;
        8. +
      8. string_type std_zone_name() const;
      diff --git a/doc/html/boost/date_time/tz_db_base.html b/doc/html/boost/date_time/tz_db_base.html index 3045123237..4eaf8d26a4 100644 --- a/doc/html/boost/date_time/tz_db_base.html +++ b/doc/html/boost/date_time/tz_db_base.html @@ -44,25 +44,25 @@ typedef std::basic_string< char_type > string_type; // construct/copy/destruct - tz_db_base(); + tz_db_base(); - // public member functions - void load_from_stream(std::istream &); - void load_from_file(const std::string &); - bool add_record(const string_type &, + // public member functions + void load_from_stream(std::istream &); + void load_from_file(const std::string &); + bool add_record(const string_type &, boost::shared_ptr< time_zone_base_type >); boost::shared_ptr< time_zone_base_type > - time_zone_from_region(const string_type &) const; - std::vector< std::string > region_list() const; + time_zone_from_region(const string_type &) const; + std::vector< std::string > region_list() const; - // private member functions - rule_type * parse_rules(const string_type &, const string_type &) const; - week_num get_week_num(int) const; - void split_rule_spec(int &, int &, int &, string_type) const; - bool parse_string(string_type &); + // private member functions + rule_type * parse_rules(const string_type &, const string_type &) const; + week_num get_week_num(int) const; + void split_rule_spec(int &, int &, int &, string_type) const; + bool parse_string(string_type &); };
      -

      Description

      +

      Description

      The csv file containing the zone_specs used by the tz_db_base is intended to be customized by the library user. When customizing this file (or creating your own) the file must follow a specific format.

      This first line is expected to contain column headings and is therefore not processed by the tz_db_base.

      Each record (line) must have eleven fields. Some of those fields can be empty. Every field (even empty ones) must be enclosed in double-quotes. Ex:

      @@ -93,47 +93,47 @@

      DST End date rule: See DST Start date rule. The difference here is this is the day daylight savings ends (transition to STD).

      End time: Same as Start time.

      -

      +

      tz_db_base public construct/copy/destruct

      1. -
        tz_db_base();
        Constructs an empty database.
      +
      tz_db_base();
      Constructs an empty database.
      -

      -tz_db_base public member functions

      +

      +tz_db_base public member functions

      1. -
        void load_from_stream(std::istream & in);
        Process csv data file, may throw exceptions.

        May throw bad_field_count exceptions

        +
        void load_from_stream(std::istream & in);
        Process csv data file, may throw exceptions.

        May throw bad_field_count exceptions

      2. -
        void load_from_file(const std::string & pathspec);
        Process csv data file, may throw exceptions.

        May throw data_not_accessible, or bad_field_count exceptions

        +
        void load_from_file(const std::string & pathspec);
        Process csv data file, may throw exceptions.

        May throw data_not_accessible, or bad_field_count exceptions

      3. -
        bool add_record(const string_type & region, 
+
        bool add_record(const string_type & region, 
                 boost::shared_ptr< time_zone_base_type > tz);
        returns true if record successfully added to map 
        Takes a region name in the form of "America/Phoenix", and a time_zone object for that region. The id string must be a unique name that does not already exist in the database. 
        
 
      4. boost::shared_ptr< time_zone_base_type > 
-time_zone_from_region(const string_type & region) const;
        Returns a time_zone object built from the specs for the given region.

        Returns a time_zone object built from the specs for the given region. If region does not exist a local_time::record_not_found exception will be thrown

        +time_zone_from_region(const string_type & region) const;Returns a time_zone object built from the specs for the given region.

        Returns a time_zone object built from the specs for the given region. If region does not exist a local_time::record_not_found exception will be thrown

      5. -
        std::vector< std::string > region_list() const;
        Returns a vector of strings holding the time zone regions in the database.
        6. +
        std::vector< std::string > region_list() const;
        Returns a vector of strings holding the time zone regions in the database.
      -

      -tz_db_base private member functions

      +

      +tz_db_base private member functions

      1. -
        rule_type * parse_rules(const string_type & sr, const string_type & er) const;
        parses rule specs for transition day rules
        2. +
        rule_type * parse_rules(const string_type & sr, const string_type & er) const;
        parses rule specs for transition day rules
      2. -
        week_num get_week_num(int nth) const;
        helper function for parse_rules()
        3. +
        week_num get_week_num(int nth) const;
        helper function for parse_rules()
      3. -
        void split_rule_spec(int & nth, int & d, int & m, string_type rule) const;
        splits the [start|end]_date_rule string into 3 ints
        4. +
        void split_rule_spec(int & nth, int & d, int & m, string_type rule) const;
        splits the [start|end]_date_rule string into 3 ints
      4. -
        bool parse_string(string_type & s);
        Take a line from the csv, turn it into a time_zone_type.

        Take a line from the csv, turn it into a time_zone_type, and add it to the map. Zone_specs in csv file are expected to have eleven fields that describe the time zone. Returns true if zone_spec successfully added to database

        +
        bool parse_string(string_type & s);
        Take a line from the csv, turn it into a time_zone_type.

        Take a line from the csv, turn it into a time_zone_type, and add it to the map. Zone_specs in csv file are expected to have eleven fields that describe the time zone. Returns true if zone_spec successfully added to database

      diff --git a/doc/html/boost/date_time/uk_dst_trait.html b/doc/html/boost/date_time/uk_dst_trait.html index 085bb31b43..f9d5271450 100644 --- a/doc/html/boost/date_time/uk_dst_trait.html +++ b/doc/html/boost/date_time/uk_dst_trait.html @@ -35,20 +35,20 @@ template<typename date_type> struct uk_dst_trait : public boost::date_time::eu_dst_trait< date_type > { - // public static functions - static int dst_start_offset_minutes(); - static int dst_end_offset_minutes(); - static int dst_shift_length_minutes(); + // public static functions + static int dst_start_offset_minutes(); + static int dst_end_offset_minutes(); + static int dst_shift_length_minutes(); };
      -

      Description

      +

      Description

      -

      -uk_dst_trait public static functions

      +

      +uk_dst_trait public static functions

        -
      1. static int dst_start_offset_minutes();
        2. -
      2. static int dst_end_offset_minutes();
        3. -
      3. static int dst_shift_length_minutes();
        4. +
      4. static int dst_start_offset_minutes();
        5. +
      5. static int dst_end_offset_minutes();
        6. +
      6. static int dst_shift_length_minutes();
      diff --git a/doc/html/boost/date_time/us_dst_rules.html b/doc/html/boost/date_time/us_dst_rules.html index 794ebd5aba..af5bb6ea1c 100644 --- a/doc/html/boost/date_time/us_dst_rules.html +++ b/doc/html/boost/date_time/us_dst_rules.html @@ -47,29 +47,29 @@ typedef date_time::nth_kday_of_month< date_type > nkday; typedef dst_calculator< date_type, time_duration_type > dstcalc; - // public static functions + // public static functions static time_is_dst_result - local_is_dst(const date_type &, const time_duration_type &); - static bool is_dst_boundary_day(date_type); - static date_type local_dst_start_day(year_type); - static date_type local_dst_end_day(year_type); - static time_duration_type dst_offset(); + local_is_dst(const date_type &, const time_duration_type &); + static bool is_dst_boundary_day(date_type); + static date_type local_dst_start_day(year_type); + static date_type local_dst_end_day(year_type); + static time_duration_type dst_offset(); };
      -

      Description

      +

      Description

      -

      -us_dst_rules public static functions

      +

      +us_dst_rules public static functions

      1. static time_is_dst_result 
-local_is_dst(const date_type & d, const time_duration_type & td);
        Calculates if the given local time is dst or not.

        Determines if the time is really in DST or not. Also checks for invalid and ambiguous. +local_is_dst(const date_type & d, const time_duration_type & td);Calculates if the given local time is dst or not.

        Determines if the time is really in DST or not. Also checks for invalid and ambiguous.

        2. -
      2. static bool is_dst_boundary_day(date_type d);
        3. -
      3. static date_type local_dst_start_day(year_type year);
        4. -
      4. static date_type local_dst_end_day(year_type year);
        5. -
      5. static time_duration_type dst_offset();
        6. +
      6. static bool is_dst_boundary_day(date_type d);
        7. +
      7. static date_type local_dst_start_day(year_type year);
        8. +
      8. static date_type local_dst_end_day(year_type year);
        9. +
      9. static time_duration_type dst_offset();
      diff --git a/doc/html/boost/date_time/us_dst_trait.html b/doc/html/boost/date_time/us_dst_trait.html index 9c22e1340c..a748b64db4 100644 --- a/doc/html/boost/date_time/us_dst_trait.html +++ b/doc/html/boost/date_time/us_dst_trait.html @@ -43,19 +43,19 @@ typedef date_time::first_kday_of_month< date_type > start_rule_functor_pre2007; typedef date_time::last_kday_of_month< date_type > end_rule_functor_pre2007; - // public static functions - static day_of_week_type start_day(year_type); - static month_type start_month(year_type); - static day_of_week_type end_day(year_type); - static month_type end_month(year_type); - static date_type local_dst_start_day(year_type); - static date_type local_dst_end_day(year_type); - static int dst_start_offset_minutes(); - static int dst_end_offset_minutes(); - static int dst_shift_length_minutes(); + // public static functions + static day_of_week_type start_day(year_type); + static month_type start_month(year_type); + static day_of_week_type end_day(year_type); + static month_type end_month(year_type); + static date_type local_dst_start_day(year_type); + static date_type local_dst_end_day(year_type); + static int dst_start_offset_minutes(); + static int dst_end_offset_minutes(); + static int dst_shift_length_minutes(); };
      -

      Description

      +

      Description

      This class is used to configure dst_calc_engine template typically as follows: 

      using namespace boost::gregorian;
 using namespace boost::posix_time;
@@ -80,18 +80,18 @@

      This generates a type suitable for the calculation of dst transitions for the United States. Of course other templates can be used for other locales.

      -

      -us_dst_trait public static functions

      +

      +us_dst_trait public static functions

        -
      1. static day_of_week_type start_day(year_type);
        2. -
      2. static month_type start_month(year_type y);
        3. -
      3. static day_of_week_type end_day(year_type);
        4. -
      4. static month_type end_month(year_type y);
        5. -
      5. static date_type local_dst_start_day(year_type year);
        6. -
      6. static date_type local_dst_end_day(year_type year);
        7. -
      7. static int dst_start_offset_minutes();
        8. -
      8. static int dst_end_offset_minutes();
        9. -
      9. static int dst_shift_length_minutes();
        10. +
      10. static day_of_week_type start_day(year_type);
        11. +
      11. static month_type start_month(year_type y);
        12. +
      12. static day_of_week_type end_day(year_type);
        13. +
      13. static month_type end_month(year_type y);
        14. +
      14. static date_type local_dst_start_day(year_type year);
        15. +
      15. static date_type local_dst_end_day(year_type year);
        16. +
      16. static int dst_start_offset_minutes();
        17. +
      17. static int dst_end_offset_minutes();
        18. +
      18. static int dst_shift_length_minutes();
      diff --git a/doc/html/boost/date_time/utc_adjustment.html b/doc/html/boost/date_time/utc_adjustment.html index 190ebc19cc..bc6f2e194c 100644 --- a/doc/html/boost/date_time/utc_adjustment.html +++ b/doc/html/boost/date_time/utc_adjustment.html @@ -8,7 +8,7 @@ - + @@ -21,7 +21,7 @@
      -PrevUpHomeNext +PrevUpHomeNext
      @@ -36,18 +36,18 @@ class utc_adjustment { public: - // public static functions - static time_duration_type local_to_utc_base_offset(); - static time_duration_type utc_to_local_base_offset(); + // public static functions + static time_duration_type local_to_utc_base_offset(); + static time_duration_type utc_to_local_base_offset(); };
      -

      Description

      +

      Description

      -

      -utc_adjustment public static functions

      +

      +utc_adjustment public static functions

        -
      1. static time_duration_type local_to_utc_base_offset();
        2. -
      2. static time_duration_type utc_to_local_base_offset();
        3. +
      3. static time_duration_type local_to_utc_base_offset();
        4. +
      4. static time_duration_type utc_to_local_base_offset();
      @@ -60,7 +60,7 @@
      -PrevUpHomeNext +PrevUpHomeNext
      diff --git a/doc/html/boost/date_time/var_string_to_int.html b/doc/html/boost/date_time/var_string_to_int.html index f43c0a9fd3..554d7d3085 100644 --- a/doc/html/boost/date_time/var_string_to_int.html +++ b/doc/html/boost/date_time/var_string_to_int.html @@ -7,7 +7,7 @@ - + @@ -21,7 +21,7 @@
      -PrevUpHomeNext +PrevUpHomeNext
      @@ -38,7 +38,7 @@ const std::istreambuf_iterator< charT > & stream_end, unsigned int max_length);
      -

      Description

      +

      Description

      Will consume 'max_length' characters from stream only if those characters are digits. Returns '-1' if no number can be parsed. Will not parse a number preceeded by a '+' or '-'.

      @@ -50,7 +50,7 @@
      -PrevUpHomeNext +PrevUpHomeNext
      diff --git a/doc/html/boost/date_time/week_functor.html b/doc/html/boost/date_time/week_functor.html index fbcb428e46..ffc99d82e7 100644 --- a/doc/html/boost/date_time/week_functor.html +++ b/doc/html/boost/date_time/week_functor.html @@ -40,27 +40,27 @@ typedef date_type::calendar_type calendar_type; // construct/copy/destruct - week_functor(int); + week_functor(int); - // public member functions - duration_type get_offset(const date_type &) const; - duration_type get_neg_offset(const date_type &) const; + // public member functions + duration_type get_offset(const date_type &) const; + duration_type get_neg_offset(const date_type &) const; };
      -

      Description

      +

      Description

      -

      +

      week_functor public construct/copy/destruct

      -
      1. week_functor(int f);
      +
      1. week_functor(int f);
      -

      -week_functor public member functions

      +

      +week_functor public member functions

        -
      1. duration_type get_offset(const date_type & d) const;
        2. -
      2. duration_type get_neg_offset(const date_type & d) const;
        3. +
      3. duration_type get_offset(const date_type &) const;
        4. +
      4. duration_type get_neg_offset(const date_type &) const;
      diff --git a/doc/html/boost/date_time/weeks_duration.html b/doc/html/boost/date_time/weeks_duration.html index 07177ff306..9ac3d38c3f 100644 --- a/doc/html/boost/date_time/weeks_duration.html +++ b/doc/html/boost/date_time/weeks_duration.html @@ -38,19 +38,19 @@ { public: // construct/copy/destruct - weeks_duration(typename duration_config::impl_type); - weeks_duration(special_values); + weeks_duration(typename duration_config::impl_type); + weeks_duration(special_values); };
      -

      Description

      +

      Description

      -

      +

      weeks_duration public construct/copy/destruct

        -
      1. weeks_duration(typename duration_config::impl_type w);
        2. -
      2. weeks_duration(special_values sv);
        3. +
      3. weeks_duration(typename duration_config::impl_type w);
        4. +
      4. weeks_duration(special_values sv);
      diff --git a/doc/html/boost/date_time/wrapping_int.html b/doc/html/boost/date_time/wrapping_int.html index 4903192812..fb0aabe704 100644 --- a/doc/html/boost/date_time/wrapping_int.html +++ b/doc/html/boost/date_time/wrapping_int.html @@ -39,57 +39,57 @@ typedef int_type_ int_type; // construct/copy/destruct - wrapping_int(int_type); + wrapping_int(int_type); - // public static functions - static int_type wrap_value(); + // public static functions + static int_type wrap_value(); - // public member functions - int_type as_int() const; - operator int_type() const; - template<typename IntT> IntT add(IntT); - template<typename IntT> IntT subtract(IntT); + // public member functions + int_type as_int() const; + operator int_type() const; + template<typename IntT> IntT add(IntT); + template<typename IntT> IntT subtract(IntT); - // private member functions - template<typename IntT> IntT calculate_wrap(IntT); + // private member functions + template<typename IntT> IntT calculate_wrap(IntT); };
      -

      Description

      +

      Description

      In composite date and time types this type is used to wrap at the day boundary. Ex: A wrapping_int<short, 10> will roll over after nine, and roll under below zero. This gives a range of [0,9]

      NOTE: it is strongly recommended that wrapping_int2 be used instead of wrapping_int as wrapping_int is to be depricated at some point soon.

      Also Note that warnings will occur if instantiated with an unsigned type. Only a signed type should be used!

      -

      +

      wrapping_int public construct/copy/destruct

      1. -
        wrapping_int(int_type v);
        Add, return true if wrapped.
      +
      wrapping_int(int_type v);
      Add, return true if wrapped.
      -

      -wrapping_int public static functions

      -
      1. static int_type wrap_value();
      +

      +wrapping_int public static functions

      +
      1. static int_type wrap_value();
      -

      -wrapping_int public member functions

      +

      +wrapping_int public member functions

      1. -
        int_type as_int() const;
        Explicit converion method.
        2. -
      2. operator int_type() const;
        3. +
        int_type as_int() const;
        Explicit converion method. +
      3. operator int_type() const;
      4. -
        template<typename IntT> IntT add(IntT v);
        Add, return number of wraps performed.

        The sign of the returned value will indicate which direction the wraps went. Ex: add a negative number and wrapping under could occur, this would be indicated by a negative return value. If wrapping over took place, a positive value would be returned

        +
        template<typename IntT> IntT add(IntT v);
        Add, return number of wraps performed.

        The sign of the returned value will indicate which direction the wraps went. Ex: add a negative number and wrapping under could occur, this would be indicated by a negative return value. If wrapping over took place, a positive value would be returned

      5. -
        template<typename IntT> IntT subtract(IntT v);
        Subtract will return '+d' if wrapping under took place ('d' is the number of wraps)

        The sign of the returned value will indicate which direction the wraps went (positive indicates wrap under, negative indicates wrap over). Ex: subtract a negative number and wrapping over could occur, this would be indicated by a negative return value. If wrapping under took place, a positive value would be returned.

        +
        template<typename IntT> IntT subtract(IntT v);
        Subtract will return '+d' if wrapping under took place ('d' is the number of wraps)

        The sign of the returned value will indicate which direction the wraps went (positive indicates wrap under, negative indicates wrap over). Ex: subtract a negative number and wrapping over could occur, this would be indicated by a negative return value. If wrapping under took place, a positive value would be returned.

      -

      -wrapping_int private member functions

      -
      1. template<typename IntT> IntT calculate_wrap(IntT wrap);
      +

      +wrapping_int private member functions

      +
      1. template<typename IntT> IntT calculate_wrap(IntT wrap);
      diff --git a/doc/html/boost/date_time/wrapping_int2.html b/doc/html/boost/date_time/wrapping_int2.html index e9ab243d6a..ed3853e97b 100644 --- a/doc/html/boost/date_time/wrapping_int2.html +++ b/doc/html/boost/date_time/wrapping_int2.html @@ -39,61 +39,61 @@ typedef int_type_ int_type; // construct/copy/destruct - wrapping_int2(int_type); + wrapping_int2(int_type); - // public static functions - static int_type wrap_value(); - static int_type min_value(); + // public static functions + static int_type wrap_value(); + static int_type min_value(); - // public member functions - int_type as_int() const; - operator int_type() const; - template<typename IntT> IntT add(IntT); - template<typename IntT> IntT subtract(IntT); + // public member functions + int_type as_int() const; + operator int_type() const; + template<typename IntT> IntT add(IntT); + template<typename IntT> IntT subtract(IntT); - // private member functions - template<typename IntT> IntT calculate_wrap(IntT); + // private member functions + template<typename IntT> IntT calculate_wrap(IntT); };
      -

      Description

      +

      Description

      Bad name, quick impl to fix a bug – fix later!! This allows the wrap to restart at a value other than 0.

      -

      +

      wrapping_int2 public construct/copy/destruct

      1. -
        wrapping_int2(int_type v);
        +
        wrapping_int2(int_type v);

        If initializing value is out of range of [wrap_min, wrap_max], value will be initialized to closest of min or max

      -

      -wrapping_int2 public static functions

      +

      +wrapping_int2 public static functions

        -
      1. static int_type wrap_value();
        2. -
      2. static int_type min_value();
        3. +
      3. static int_type wrap_value();
        4. +
      4. static int_type min_value();
      -

      -wrapping_int2 public member functions

      +

      +wrapping_int2 public member functions

      1. -
        int_type as_int() const;
        Explicit converion method.
        2. -
      2. operator int_type() const;
        3. +
        int_type as_int() const;
        Explicit converion method. +
      3. operator int_type() const;
      4. -
        template<typename IntT> IntT add(IntT v);
        Add, return number of wraps performed.

        The sign of the returned value will indicate which direction the wraps went. Ex: add a negative number and wrapping under could occur, this would be indicated by a negative return value. If wrapping over took place, a positive value would be returned

        +
        template<typename IntT> IntT add(IntT v);
        Add, return number of wraps performed.

        The sign of the returned value will indicate which direction the wraps went. Ex: add a negative number and wrapping under could occur, this would be indicated by a negative return value. If wrapping over took place, a positive value would be returned

      5. -
        template<typename IntT> IntT subtract(IntT v);
        Subtract will return '-d' if wrapping under took place ('d' is the number of wraps)

        The sign of the returned value will indicate which direction the wraps went. Ex: subtract a negative number and wrapping over could occur, this would be indicated by a positive return value. If wrapping under took place, a negative value would be returned

        +
        template<typename IntT> IntT subtract(IntT v);
        Subtract will return '-d' if wrapping under took place ('d' is the number of wraps)

        The sign of the returned value will indicate which direction the wraps went. Ex: subtract a negative number and wrapping over could occur, this would be indicated by a positive return value. If wrapping under took place, a negative value would be returned

      -

      -wrapping_int2 private member functions

      -
      1. template<typename IntT> IntT calculate_wrap(IntT wrap);
      +

      +wrapping_int2 private member functions

      +
      1. template<typename IntT> IntT calculate_wrap(IntT wrap);
      diff --git a/doc/html/boost/date_time/year_based_generator.html b/doc/html/boost/date_time/year_based_generator.html index 6527566948..de03d169af 100644 --- a/doc/html/boost/date_time/year_based_generator.html +++ b/doc/html/boost/date_time/year_based_generator.html @@ -40,34 +40,34 @@ typedef calendar_type::year_type year_type; // construct/copy/destruct - year_based_generator(); - ~year_based_generator(); + year_based_generator(); + ~year_based_generator(); - // public member functions - virtual date_type get_date(year_type) const = 0; - virtual std::string to_string() const = 0; + // public member functions + virtual date_type get_date(year_type) const = 0; + virtual std::string to_string() const = 0; };
      -

      Description

      +

      Description

      This class is a base class for polymorphic function objects that take a year and produce a concrete date.

      -

      +

      year_based_generator public construct/copy/destruct

        -
      1. year_based_generator();
        2. -
      2. ~year_based_generator();
        3. +
      3. year_based_generator();
        4. +
      4. ~year_based_generator();
      -

      -year_based_generator public member functions

      +

      +year_based_generator public member functions

        -
      1. virtual date_type get_date(year_type y) const = 0;
        2. +
      2. virtual date_type get_date(year_type y) const = 0;
      3. -
        virtual std::string to_string() const = 0;
        Returns a string for use in a POSIX time_zone string.
        4. +
        virtual std::string to_string() const = 0;
        Returns a string for use in a POSIX time_zone string.
      diff --git a/doc/html/boost/date_time/year_functor.html b/doc/html/boost/date_time/year_functor.html index 5e9491d2f2..d72f206790 100644 --- a/doc/html/boost/date_time/year_functor.html +++ b/doc/html/boost/date_time/year_functor.html @@ -39,27 +39,27 @@ typedef date_type::duration_type duration_type; // construct/copy/destruct - year_functor(int); + year_functor(int); - // public member functions - duration_type get_offset(const date_type &) const; - duration_type get_neg_offset(const date_type &) const; + // public member functions + duration_type get_offset(const date_type &) const; + duration_type get_neg_offset(const date_type &) const; };
      -

      Description

      +

      Description

      -

      +

      year_functor public construct/copy/destruct

      -
      1. year_functor(int f);
      +
      1. year_functor(int f);
      -

      -year_functor public member functions

      +

      +year_functor public member functions

        -
      1. duration_type get_offset(const date_type & d) const;
        2. -
      2. duration_type get_neg_offset(const date_type & d) const;
        3. +
      3. duration_type get_offset(const date_type & d) const;
        4. +
      4. duration_type get_neg_offset(const date_type & d) const;
      diff --git a/doc/html/boost/date_time/year_month_day_base.html b/doc/html/boost/date_time/year_month_day_base.html index befae78741..259a3c4daf 100644 --- a/doc/html/boost/date_time/year_month_day_base.html +++ b/doc/html/boost/date_time/year_month_day_base.html @@ -40,7 +40,7 @@ typedef DayType day_type; // construct/copy/destruct - year_month_day_base(YearType, MonthType, DayType); + year_month_day_base(YearType, MonthType, DayType); // public data members YearType year; @@ -48,14 +48,14 @@ DayType day; };
      -

      Description

      +

      Description

      -

      +

      year_month_day_base public construct/copy/destruct

      1. -
        year_month_day_base(YearType year, MonthType month, DayType day);
        A basic constructor.
      +
      year_month_day_base(YearType year, MonthType month, DayType day);
      A basic constructor.
      diff --git a/doc/html/boost/date_time/ymd_formatter.html b/doc/html/boost/date_time/ymd_formatter.html index d3f1c3da2c..713824fc8e 100644 --- a/doc/html/boost/date_time/ymd_formatter.html +++ b/doc/html/boost/date_time/ymd_formatter.html @@ -36,21 +36,21 @@ class ymd_formatter { public: - // public static functions - static std::string ymd_to_string(ymd_type); - static std::basic_string< charT > ymd_to_string(ymd_type); + // public static functions + static std::string ymd_to_string(ymd_type); + static std::basic_string< charT > ymd_to_string(ymd_type); };
      -

      Description

      +

      Description

      -

      -ymd_formatter public static functions

      +

      +ymd_formatter public static functions

      1. -
        static std::string ymd_to_string(ymd_type ymd);
        Convert ymd to a standard string formatting policies.

        This is standard code for handling date formatting with year-month-day based date information. This function uses the format_type to control whether the string will contain separator characters, and if so what the character will be. In addtion, it can format the month as either an integer or a string as controled by the formatting policy

        +
        static std::string ymd_to_string(ymd_type ymd);
        Convert ymd to a standard string formatting policies.

        This is standard code for handling date formatting with year-month-day based date information. This function uses the format_type to control whether the string will contain separator characters, and if so what the character will be. In addtion, it can format the month as either an integer or a string as controled by the formatting policy

      2. -
        static std::basic_string< charT > ymd_to_string(ymd_type ymd);
        Convert ymd to a standard string formatting policies.

        This is standard code for handling date formatting with year-month-day based date information. This function uses the format_type to control whether the string will contain separator characters, and if so what the character will be. In addtion, it can format the month as either an integer or a string as controled by the formatting policy

        +
        static std::basic_string< charT > ymd_to_string(ymd_type ymd);
        Convert ymd to a standard string formatting policies.

        This is standard code for handling date formatting with year-month-day based date information. This function uses the format_type to control whether the string will contain separator characters, and if so what the character will be. In addtion, it can format the month as either an integer or a string as controled by the formatting policy

      diff --git a/doc/html/boost/date_time/ymd_order_spec.html b/doc/html/boost/date_time/ymd_order_spec.html index 64b534da48..f8e5d22f5f 100644 --- a/doc/html/boost/date_time/ymd_order_spec.html +++ b/doc/html/boost/date_time/ymd_order_spec.html @@ -36,7 +36,7 @@ enum ymd_order_spec { ymd_order_iso, ymd_order_dmy, ymd_order_us };
      -

      Description

      +

      Description

      Enum for distinguishing the order in which Month, Day, & Year will appear in a date string

      diff --git a/doc/html/boost/dll/experimental/get_idp28753888.html b/doc/html/boost/dll/experimental/get_idp28753888.html deleted file mode 100644 index ffc7848c57..0000000000 --- a/doc/html/boost/dll/experimental/get_idp28753888.html +++ /dev/null @@ -1,89 +0,0 @@ - - - - -Function template get - - - - - - - - - - - - - - - -
      Boost C++ LibrariesHomeLibrariesPeopleFAQMore
      -
      -
      -PrevUpHomeNext -
      -
      -
      -
      -

      Function template get

      -

      boost::dll::experimental::get

      -
      -

      Synopsis

      -
      // In header: <boost/dll/smart_library.hpp>
-
-
-template<typename T, typename T2> 
-  void get(const smart_library & sm, const std::string & name);
      -
      -

      Description

      -

      Helper functions for overloads.

      -

      Gets either a variable, function or member-function, depending on the signature.

      -
      smart_library sm("lib.so");
-get<int>(sm, "space::value"); //import a variable
-get<void(int)>(sm, "space::func"); //import a function
-get<some_class, void(int)>(sm, "space::class_::mem_fn"); //import a member function
-
      -

      -

      -
      ---- - - - - -

      Parameters:

      ---- - - - - - - - - - - -

      name

      The name of the entity to import

      sm

      A reference to the smart_library

      -
      -
      - - - -
      Copyright © 2014 Renato Tegon Forti, Antony Polukhin
      Copyright © 2015 Antony Polukhin
      Copyright © 2016 Antony Polukhin, Klemens Morgenstern

      - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

      -
      -
      -
      -PrevUpHomeNext -
      - - diff --git a/doc/html/boost/dll/experimental/get_idp28770608.html b/doc/html/boost/dll/experimental/get_idp28770608.html deleted file mode 100644 index 77d06b6280..0000000000 --- a/doc/html/boost/dll/experimental/get_idp28770608.html +++ /dev/null @@ -1,89 +0,0 @@ - - - - -Function template get - - - - - - - - - - - - - - - -
      Boost C++ LibrariesHomeLibrariesPeopleFAQMore
      -
      -
      -PrevUpHomeNext -
      -
      -
      -
      -

      Function template get

      -

      boost::dll::experimental::get

      -
      -

      Synopsis

      -
      // In header: <boost/dll/smart_library.hpp>
-
-
-template<typename Class, typename Signature> 
-  auto get(const smart_library & sm, const std::string & name);
      -
      -

      Description

      -

      Helper functions for overloads.

      -

      Gets either a variable, function or member-function, depending on the signature.

      -
      smart_library sm("lib.so");
-get<int>(sm, "space::value"); //import a variable
-get<void(int)>(sm, "space::func"); //import a function
-get<some_class, void(int)>(sm, "space::class_::mem_fn"); //import a member function
-
      -

      -

      -
      ---- - - - - -

      Parameters:

      ---- - - - - - - - - - - -

      name

      The name of the entity to import

      sm

      A reference to the smart_library

      -
      -
      - - - -
      Copyright © 2014 Renato Tegon Forti, Antony Polukhin
      Copyright © 2015 Antony Polukhin
      Copyright © 2016 Antony Polukhin, Klemens Morgenstern

      - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

      -
      -
      -
      -PrevUpHomeNext -
      - - diff --git a/doc/html/boost/dll/experimental/get_idp38057568.html b/doc/html/boost/dll/experimental/get_idp38057568.html new file mode 100644 index 0000000000..58a5513450 --- /dev/null +++ b/doc/html/boost/dll/experimental/get_idp38057568.html @@ -0,0 +1,89 @@ + + + + +Function template get + + + + + + + + + + + + + + + +
      Boost C++ LibrariesHomeLibrariesPeopleFAQMore
      +
      +
      +PrevUpHomeNext +
      +
      +
      +
      +

      Function template get

      +

      boost::dll::experimental::get

      +
      +

      Synopsis

      +
      // In header: <boost/dll/smart_library.hpp>
+
+
+template<typename T, typename T2> 
+  void get(const smart_library & sm, const std::string & name);
      +
      +

      Description

      +

      Helper functions for overloads.

      +

      Gets either a variable, function or member-function, depending on the signature.

      +
      smart_library sm("lib.so");
+get<int>(sm, "space::value"); //import a variable
+get<void(int)>(sm, "space::func"); //import a function
+get<some_class, void(int)>(sm, "space::class_::mem_fn"); //import a member function
+
      +

      +

      +
      ++++ + + + + +

      Parameters:

      ++++ + + + + + + + + + + +

      name

      The name of the entity to import

      sm

      A reference to the smart_library

      +
      +
      + + + +
      Copyright © 2014 Renato Tegon Forti, Antony Polukhin
      Copyright © 2015 Antony Polukhin
      Copyright © 2016 Antony Polukhin, Klemens Morgenstern

      + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

      +
      +
      +
      +PrevUpHomeNext +
      + + diff --git a/doc/html/boost/dll/experimental/get_idp38074288.html b/doc/html/boost/dll/experimental/get_idp38074288.html new file mode 100644 index 0000000000..86d982c84e --- /dev/null +++ b/doc/html/boost/dll/experimental/get_idp38074288.html @@ -0,0 +1,89 @@ + + + + +Function template get + + + + + + + + + + + + + + + +
      Boost C++ LibrariesHomeLibrariesPeopleFAQMore
      +
      +
      +PrevUpHomeNext +
      +
      +
      +
      +

      Function template get

      +

      boost::dll::experimental::get

      +
      +

      Synopsis

      +
      // In header: <boost/dll/smart_library.hpp>
+
+
+template<typename Class, typename Signature> 
+  auto get(const smart_library & sm, const std::string & name);
      +
      +

      Description

      +

      Helper functions for overloads.

      +

      Gets either a variable, function or member-function, depending on the signature.

      +
      smart_library sm("lib.so");
+get<int>(sm, "space::value"); //import a variable
+get<void(int)>(sm, "space::func"); //import a function
+get<some_class, void(int)>(sm, "space::class_::mem_fn"); //import a member function
+
      +

      +

      +
      ++++ + + + + +

      Parameters:

      ++++ + + + + + + + + + + +

      name

      The name of the entity to import

      sm

      A reference to the smart_library

      +
      +
      + + + +
      Copyright © 2014 Renato Tegon Forti, Antony Polukhin
      Copyright © 2015 Antony Polukhin
      Copyright © 2016 Antony Polukhin, Klemens Morgenstern

      + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

      +
      +
      +
      +PrevUpHomeNext +
      + + diff --git a/doc/html/boost/dll/experimental/import_class_idp28282208.html b/doc/html/boost/dll/experimental/import_class_idp28282208.html deleted file mode 100644 index dfd4385935..0000000000 --- a/doc/html/boost/dll/experimental/import_class_idp28282208.html +++ /dev/null @@ -1,130 +0,0 @@ - - - - -Function import_class - - - - - - - - - - - - - - - -
      Boost C++ LibrariesHomeLibrariesPeopleFAQMore
      -
      -
      -PrevUpHomeNext -
      -
      -
      -
      -

      Function import_class

      -

      boost::dll::experimental::import_class

      -
      -

      Synopsis

      -
      // In header: <boost/dll/import_class.hpp>
-
-
-template<typename T, typename... Args> 
-  imported_class< T > 
-  import_class(const smart_library & lib, std::size_t size, Args... args);
-template<typename T, typename... Args> 
-  imported_class< T > 
-  import_class(const smart_library & lib, std::size_t size, 
-               const std::string & alias_name, Args... args);
-template<typename T, typename... Args> 
-  imported_class< T > 
-  import_class(const smart_library & lib_, const std::string & alias_name, 
-               std::size_t size, Args... args);
-template<typename T, typename... Args> 
-  imported_class< T > import_class(smart_library && lib, Args... args);
-template<typename T, typename... Args> 
-  imported_class< T > 
-  import_class(smart_library && lib, const std::string & alias_name, 
-               Args... args);
-template<typename T, typename... Args> 
-  imported_class< T > 
-  import_class(smart_library && lib, std::size_t size, Args... args);
-template<typename T, typename... Args> 
-  imported_class< T > 
-  import_class(smart_library && lib, std::size_t size, 
-               const std::string & alias_name, Args... args);
-template<typename T, typename... Args> 
-  imported_class< T > 
-  import_class(smart_library && lib, const std::string & alias_name, 
-               std::size_t size, Args... args);
      -
      -

      Description

      -

      Returns an instance of imported_class which allows to call or import more functions. It takes a copy of the smart_libray, so no added type_aliases will be visible, for the object.

      -

      Few compilers do implement an allocating constructor, which allows the construction of the class without knowing the size. That is not portable, so the actual size of the class shall always be provided.

      -

      Example:

      -
      auto import_class<class type_alias, const std::string&, std::size_t>(lib, "class_name", 20, "param1", 42);
-
      -

      In this example we construct an instance of the class "class_name" with the size 20, which has "type_alias" as an alias, through a constructor which takes a const-ref of std::string and an std::size_t parameter.

      -

      - - - -

      -
      - - - - - -
      [Note]Note

      This function does add the type alias to the boost::dll::experimental::smart_library.

      -

      -

      -
      ---- - - - - - - - - - - - - - - -

      Parameters:

      ---- - - - - -

      lib

      Path to shared library or shared library to load function from.

      Returns:

      class object.

      Throws:

      		boost::system::system_error if symbol does not exist or if the DLL/DSO was not loaded. Overload that accepts path also throws std::bad_alloc in case of insufficient memory.
      -
      -
      - - - -
      Copyright © 2014 Renato Tegon Forti, Antony Polukhin
      Copyright © 2015 Antony Polukhin
      Copyright © 2016 Antony Polukhin, Klemens Morgenstern

      - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

      -
      -
      -
      -PrevUpHomeNext -
      - - diff --git a/doc/html/boost/dll/experimental/import_class_idp37573920.html b/doc/html/boost/dll/experimental/import_class_idp37573920.html new file mode 100644 index 0000000000..b0b6eb99a2 --- /dev/null +++ b/doc/html/boost/dll/experimental/import_class_idp37573920.html @@ -0,0 +1,130 @@ + + + + +Function import_class + + + + + + + + + + + + + + + +
      Boost C++ LibrariesHomeLibrariesPeopleFAQMore
      +
      +
      +PrevUpHomeNext +
      +
      +
      +
      +

      Function import_class

      +

      boost::dll::experimental::import_class

      +
      +

      Synopsis

      +
      // In header: <boost/dll/import_class.hpp>
+
+
+template<typename T, typename... Args> 
+  imported_class< T > 
+  import_class(const smart_library & lib, std::size_t size, Args... args);
+template<typename T, typename... Args> 
+  imported_class< T > 
+  import_class(const smart_library & lib, std::size_t size, 
+               const std::string & alias_name, Args... args);
+template<typename T, typename... Args> 
+  imported_class< T > 
+  import_class(const smart_library & lib_, const std::string & alias_name, 
+               std::size_t size, Args... args);
+template<typename T, typename... Args> 
+  imported_class< T > import_class(smart_library && lib, Args... args);
+template<typename T, typename... Args> 
+  imported_class< T > 
+  import_class(smart_library && lib, const std::string & alias_name, 
+               Args... args);
+template<typename T, typename... Args> 
+  imported_class< T > 
+  import_class(smart_library && lib, std::size_t size, Args... args);
+template<typename T, typename... Args> 
+  imported_class< T > 
+  import_class(smart_library && lib, std::size_t size, 
+               const std::string & alias_name, Args... args);
+template<typename T, typename... Args> 
+  imported_class< T > 
+  import_class(smart_library && lib, const std::string & alias_name, 
+               std::size_t size, Args... args);
      +
      +

      Description

      +

      Returns an instance of imported_class which allows to call or import more functions. It takes a copy of the smart_libray, so no added type_aliases will be visible, for the object.

      +

      Few compilers do implement an allocating constructor, which allows the construction of the class without knowing the size. That is not portable, so the actual size of the class shall always be provided.

      +

      Example:

      +
      auto import_class<class type_alias, const std::string&, std::size_t>(lib, "class_name", 20, "param1", 42);
+
      +

      In this example we construct an instance of the class "class_name" with the size 20, which has "type_alias" as an alias, through a constructor which takes a const-ref of std::string and an std::size_t parameter.

      +

      + + + +

      +
      + + + + + +
      [Note]Note

      This function does add the type alias to the boost::dll::experimental::smart_library.

      +

      +

      +
      ++++ + + + + + + + + + + + + + + +

      Parameters:

      ++++ + + + + +

      lib

      Path to shared library or shared library to load function from.

      Returns:

      class object.

      Throws:

      		boost::system::system_error if symbol does not exist or if the DLL/DSO was not loaded. Overload that accepts path also throws std::bad_alloc in case of insufficient memory.
      +
      +
      + + + +
      Copyright © 2014 Renato Tegon Forti, Antony Polukhin
      Copyright © 2015 Antony Polukhin
      Copyright © 2016 Antony Polukhin, Klemens Morgenstern

      + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

      +
      +
      +
      +PrevUpHomeNext +
      + + diff --git a/doc/html/boost/dll/experimental/import_mangled.html b/doc/html/boost/dll/experimental/import_mangled.html index a6ed129d75..1984683cac 100644 --- a/doc/html/boost/dll/experimental/import_mangled.html +++ b/doc/html/boost/dll/experimental/import_mangled.html @@ -7,7 +7,7 @@ - + @@ -21,7 +21,7 @@
      -PrevUpHomeNext +PrevUpHomeNext
      @@ -60,7 +60,7 @@ template<class... Args> result_type import_mangled(shared_library && lib, const std::string & name);
      -

      Description

      +

      Description

      Returns callable object or boost::shared_ptr<T> that holds the symbol imported from the loaded library. Returned value refcounts usage of the loaded shared library, so that it won't get unload until all copies of return value are not destroyed.

      For importing symbols by alias names use boost::dll::import_alias method.

      Examples:

      @@ -140,7 +140,7 @@
      -PrevUpHomeNext +PrevUpHomeNext
      diff --git a/doc/html/boost/dll/experimental/imported_class.html b/doc/html/boost/dll/experimental/imported_class.html index ad0b84efae..d31db0cea9 100644 --- a/doc/html/boost/dll/experimental/imported_class.html +++ b/doc/html/boost/dll/experimental/imported_class.html @@ -8,7 +8,7 @@ - + @@ -21,7 +21,7 @@
      -PrevUpHomeNext +PrevUpHomeNext
      @@ -40,57 +40,57 @@ // construct/copy/destruct template<typename... Args> - imported_class(unspecified, const smart_library &, Args...); + imported_class(unspecified, const smart_library &, Args...); template<typename... Args> - imported_class(unspecified, const smart_library &, std::size_t, Args...); + imported_class(unspecified, const smart_library &, std::size_t, Args...); template<typename... Args> - imported_class(unspecified, smart_library &&, Args...); + imported_class(unspecified, smart_library &&, Args...); template<typename... Args> - imported_class(unspecified, smart_library &&, std::size_t, Args...); - imported_class() = delete; - imported_class(imported_class &) = delete; - imported_class(imported_class &&) = default; - imported_class & operator=(imported_class &) = delete; - imported_class & operator=(imported_class &&) = default; + imported_class(unspecified, smart_library &&, std::size_t, Args...); + imported_class() = delete; + imported_class(imported_class &) = delete; + imported_class(imported_class &&) = default; + imported_class & operator=(imported_class &) = delete; + imported_class & operator=(imported_class &&) = default; - // private member functions + // private member functions template<typename... Args> - unspecified make_data(const smart_library &, Args...); + unspecified make_data(const smart_library &, Args...); template<typename... Args> - unspecified make_data(const smart_library &, std::size_t, Args...); + unspecified make_data(const smart_library &, std::size_t, Args...); - // public static functions + // public static functions template<typename... Args> - static imported_class< T > make(smart_library &&, Args...); + static imported_class< T > make(smart_library &&, Args...); template<typename... Args> - static imported_class< T > make(smart_library &&, std::size_t, Args...); + static imported_class< T > make(smart_library &&, std::size_t, Args...); template<typename... Args> - static imported_class< T > make(const smart_library &, Args...); + static imported_class< T > make(const smart_library &, Args...); template<typename... Args> static imported_class< T > - make(const smart_library &, std::size_t, Args...); + make(const smart_library &, std::size_t, Args...); - // public member functions - T * get(); - bool is_move_constructible(); - bool is_move_assignable(); - bool is_copy_constructible(); - bool is_copy_assignable(); - imported_class< T > copy() const; - imported_class< T > move(); - void copy_assign(const imported_class< T > &) const; - void move_assign(imported_class< T > &); - explicit operator bool() const; - const std::type_info & get_type_info(); - template<typename Signature> unspecified call(const std::string &); + // public member functions + T * get(); + bool is_move_constructible(); + bool is_move_assignable(); + bool is_copy_constructible(); + bool is_copy_assignable(); + imported_class< T > copy() const; + imported_class< T > move(); + void copy_assign(const imported_class< T > &) const; + void move_assign(imported_class< T > &); + explicit operator bool() const; + const std::type_info & get_type_info(); + template<typename Signature> unspecified call(const std::string &); template<typename Tin, typename Signature, typename = boost::enable_if<detail::unqalified_is_same<T, Tin>> > - unspecified call(const std::string &); - template<typename Tin, typename T2> unspecified operator->*(unspecified); - template<class... Args> unspecified import(const std::string &); + unspecified call(const std::string &); + template<typename Tin, typename T2> unspecified operator->*(unspecified); + template<class... Args> unspecified import(const std::string &); };
      -

      Description

      +

      Description

      This class represents an imported class.

      @@ -103,73 +103,73 @@

      -

      +

      imported_class public construct/copy/destruct

      1. template<typename... Args> 
-  imported_class(unspecified, const smart_library & lib, Args... args);
        2. + imported_class(unspecified, const smart_library & lib, Args... args); 
      2. template<typename... Args> 
-  imported_class(unspecified, const smart_library & lib, std::size_t size, 
+  imported_class(unspecified, const smart_library & lib, std::size_t size, 
                  Args... args);
      3. template<typename... Args> 
-  imported_class(unspecified, smart_library && lib, Args... args);
        4. + imported_class(unspecified, smart_library && lib, Args... args); 
      4. template<typename... Args> 
-  imported_class(unspecified, smart_library && lib, std::size_t size, 
+  imported_class(unspecified, smart_library && lib, std::size_t size, 
                  Args... args);
        5. -
      5. imported_class() = delete;
        6. -
      6. imported_class(imported_class &) = delete;
        7. +
      7. imported_class() = delete;
        8. +
      8. imported_class(imported_class &) = delete;
      9. -
        imported_class(imported_class &&) = default;
        Move constructor.
        10. -
      10. imported_class & operator=(imported_class &) = delete;
        11. +
        imported_class(imported_class &&) = default;
        Move constructor. +
      11. imported_class & operator=(imported_class &) = delete;
      12. -
        imported_class & operator=(imported_class &&) = default;
        Move assignmend.
        13. +
        imported_class & operator=(imported_class &&) = default;
        Move assignmend.
      -

      -imported_class private member functions

      +

      +imported_class private member functions

      1. template<typename... Args> 
-  unspecified make_data(const smart_library & lib, Args... args);
        2. + unspecified make_data(const smart_library & lib, Args... args); 
      2. template<typename... Args> 
-  unspecified make_data(const smart_library & lib, std::size_t size, 
+  unspecified make_data(const smart_library & lib, std::size_t size, 
                         Args... args);
      -

      -imported_class public static functions

      +

      +imported_class public static functions

      1. template<typename... Args> 
-  static imported_class< T > make(smart_library && lib, Args... args);
        2. + static imported_class< T > make(smart_library && lib, Args... args); 
      2. template<typename... Args> 
   static imported_class< T > 
-  make(smart_library && lib, std::size_t size, Args... args);
        3. + make(smart_library && lib, std::size_t size, Args... args); 
      3. template<typename... Args> 
-  static imported_class< T > make(const smart_library & lib, Args... args);
        4. + static imported_class< T > make(const smart_library & lib, Args... args); 
      4. template<typename... Args> 
   static imported_class< T > 
-  make(const smart_library & lib, std::size_t size, Args... args);
        5. + make(const smart_library & lib, std::size_t size, Args... args);
      -

      -imported_class public member functions

      +

      +imported_class public member functions

      1. -
        T * get();
        Returns a pointer to the underlying class.
        2. +
        T * get();
        Returns a pointer to the underlying class.
      2. -
        bool is_move_constructible();
        Check if the imported class is move-constructible.
        3. +
        bool is_move_constructible();
        Check if the imported class is move-constructible.
      3. -
        bool is_move_assignable();
        Check if the imported class is move-assignable.
        4. +
        bool is_move_assignable();
        Check if the imported class is move-assignable.
      4. -
        bool is_copy_constructible();
        Check if the imported class is copy-constructible.
        5. +
        bool is_copy_constructible();
        Check if the imported class is copy-constructible.
      5. -
        bool is_copy_assignable();
        Check if the imported class is copy-assignable.
        6. +
        bool is_copy_assignable();
        Check if the imported class is copy-assignable.
      6. -
        imported_class< T > copy() const;
        Invoke the copy constructor.
      +
      imported_class< T > copy() const;
      Invoke the copy constructor.
      @@ -180,7 +180,7 @@

    • -
      imported_class< T > move();
      Invoke the move constructor.
      • [Note] Note
      +
      imported_class< T > move();
      Invoke the move constructor.
      @@ -191,7 +191,7 @@

    • -
      void copy_assign(const imported_class< T > & lhs) const;
      Invoke the copy assignment.
      • [Note] Note
      +
      void copy_assign(const imported_class< T > & lhs) const;
      Invoke the copy assignment.
      @@ -202,7 +202,7 @@

    • -
      void move_assign(imported_class< T > & lhs);
      Invoke the move assignment.
      • [Note] Note
      +
      void move_assign(imported_class< T > & lhs);
      Invoke the move assignment.
      @@ -213,11 +213,11 @@

    • -
      explicit operator bool() const;
      Check if the class is loaded.
      • +
      explicit operator bool() const;
      Check if the class is loaded.
    • -
      const std::type_info & get_type_info();
      Get a const reference to the std::type_info.
      • +
      const std::type_info & get_type_info();
      Get a const reference to the std::type_info.
    • -
      template<typename Signature> unspecified call(const std::string & name);
      +
      template<typename Signature> unspecified call(const std::string & name);

      Call a member function. This returns a proxy to the function. The proxy mechanic mechanic is necessary, so the signaute can be passed.

      Example 

      im_class.call<void(const char*)>("function_name")("MyString");
@@ -227,7 +227,7 @@
 
    • 
 
      template<typename Tin, typename Signature, 
          typename  = boost::enable_if<detail::unqalified_is_same<T, Tin>> > 
-  unspecified call(const std::string & name);
      
+  unspecified call(const std::string & name);

      • Call a qualified member function, i.e. const and or volatile.

      Example 

      im_class.call<const type_alias, void(const char*)>("function_name")("MyString");
@@ -235,9 +235,9 @@
    • -
      template<typename Tin, typename T2> unspecified operator->*(unspecified mn);
      Overload of ->* for an imported method.
      • +
      template<typename Tin, typename T2> unspecified operator->*(unspecified mn);
      Overload of ->* for an imported method.
    • -
      template<class... Args> unspecified import(const std::string & name);
      Import a method of the class.
      • +
      template<class... Args> unspecified import(const std::string & name);
      Import a method of the class. @@ -252,7 +252,7 @@
      [Note] Note
      -PrevUpHomeNext +PrevUpHomeNext
      diff --git a/doc/html/boost/dll/experimental/smart_library.html b/doc/html/boost/dll/experimental/smart_library.html index 69b20bfa41..81f5f02560 100644 --- a/doc/html/boost/dll/experimental/smart_library.html +++ b/doc/html/boost/dll/experimental/smart_library.html @@ -8,7 +8,7 @@ - + @@ -21,7 +21,7 @@
      -PrevUpHomeNext +PrevUpHomeNext
      @@ -39,49 +39,49 @@ typedef unspecified mangled_storage; // construct/copy/destruct - smart_library() noexcept; - smart_library(const boost::filesystem::path &, + smart_library() noexcept; + smart_library(const boost::filesystem::path &, load_mode::type = load_mode::default_mode); - smart_library(const boost::filesystem::path &, boost::system::error_code &, + smart_library(const boost::filesystem::path &, boost::system::error_code &, load_mode::type = load_mode::default_mode); - smart_library(const boost::filesystem::path &, load_mode::type, + smart_library(const boost::filesystem::path &, load_mode::type, boost::system::error_code &); - smart_library(const smart_library &) noexcept; - smart_library(smart_library &&) noexcept; - explicit smart_library(const shared_library &) noexcept; - explicit smart_library(shared_library &&) noexcept; - ~smart_library(); + smart_library(const smart_library &) noexcept; + smart_library(smart_library &&) noexcept; + explicit smart_library(const shared_library &) noexcept; + explicit smart_library(shared_library &&) noexcept; + ~smart_library(); - // public member functions - const shared_library & shared_lib() const; - const mangled_storage & symbol_storage() const; - mangled_storage & symbol_storage(); - void load(const boost::filesystem::path &, + // public member functions + const shared_library & shared_lib() const; + const mangled_storage & symbol_storage() const; + mangled_storage & symbol_storage(); + void load(const boost::filesystem::path &, load_mode::type = load_mode::default_mode); - void load(const boost::filesystem::path &, boost::system::error_code &, + void load(const boost::filesystem::path &, boost::system::error_code &, load_mode::type = load_mode::default_mode); - void load(const boost::filesystem::path &, load_mode::type, + void load(const boost::filesystem::path &, load_mode::type, boost::system::error_code &); - template<typename T> T & get_variable(const std::string &) const; - template<typename Func> Func & get_function(const std::string &) const; + template<typename T> T & get_variable(const std::string &) const; + template<typename Func> Func & get_function(const std::string &) const; template<typename Class, typename Func> - unspecified get_mem_fn(const std::string &) const; + unspecified get_mem_fn(const std::string &) const; template<typename Signature> - constructor< Signature > get_constructor() const; - template<typename Class> destructor< Class > get_destructor() const; - template<typename Class> const std::type_info & get_type_info() const; - template<typename Alias> void add_type_alias(const std::string &); - void unload() noexcept; - bool is_loaded() const noexcept; - bool operator!() const noexcept; - explicit operator bool() const noexcept; - bool has(const char *) const noexcept; - bool has(const std::string &) const noexcept; - smart_library & assign(const smart_library &); - void swap(smart_library &) noexcept; + constructor< Signature > get_constructor() const; + template<typename Class> destructor< Class > get_destructor() const; + template<typename Class> const std::type_info & get_type_info() const; + template<typename Alias> void add_type_alias(const std::string &); + void unload() noexcept; + bool is_loaded() const noexcept; + bool operator!() const noexcept; + explicit operator bool() const noexcept; + bool has(const char *) const noexcept; + bool has(const std::string &) const noexcept; + smart_library & assign(const smart_library &); + void swap(smart_library &) noexcept; };
      -

      Description

      +

      Description

      This class allows type safe loading of overloaded functions, member-functions, constructors and variables. It also allows to overwrite classes so they can be loaded, while being declared with different names.

      @@ -105,13 +105,13 @@ Currently known limitations:

      This does however not happen when the value is set inside the constructor function.

      -

      +

      smart_library public construct/copy/destruct

      1. -
        smart_library() noexcept;
        +
        smart_library() noexcept;

        Creates in anstance that does not reference any DLL/DSO.

        @@ -134,7 +134,7 @@ Currently known limitations:

    • -
      smart_library(const boost::filesystem::path & lib_path, 
+
      smart_library(const boost::filesystem::path & lib_path, 
               load_mode::type mode = load_mode::default_mode);
      
 
      Loads a library by specified path with a specified mode.
      
 
      
@@ -173,7 +173,7 @@ Currently known limitations:
  • -
    smart_library(const boost::filesystem::path & lib_path, 
+
    smart_library(const boost::filesystem::path & lib_path, 
               boost::system::error_code & ec, 
               load_mode::type mode = load_mode::default_mode);
    
 
    Loads a library by specified path with a specified mode.
    
@@ -217,12 +217,12 @@ Currently known limitations:
  • -
    smart_library(const boost::filesystem::path & lib_path, load_mode::type mode, 
+
    smart_library(const boost::filesystem::path & lib_path, load_mode::type mode, 
               boost::system::error_code & ec);
    
 
    This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.
  • -
    smart_library(const smart_library & lib) noexcept;
    +
    smart_library(const smart_library & lib) noexcept;

    copy a smart_library object.

    @@ -254,7 +254,7 @@ Currently known limitations:

  • -
    smart_library(smart_library && lib) noexcept;
    +
    smart_library(smart_library && lib) noexcept;

    Move a smart_library object.

    @@ -286,7 +286,7 @@ Currently known limitations:

  • -
    explicit smart_library(const shared_library & lib) noexcept;
    +
    explicit smart_library(const shared_library & lib) noexcept;

    Construct from a shared_library object.

    @@ -318,7 +318,7 @@ Currently known limitations:

  • -
    explicit smart_library(shared_library && lib) noexcept;
    +
    explicit smart_library(shared_library && lib) noexcept;

    Construct from a shared_library object.

    @@ -350,7 +350,7 @@ Currently known limitations:

  • -
    ~smart_library();
    +
    ~smart_library();

    Destroys the smart_library. unload() is called if the DLL/DSO was loaded. If library was loaded multiple times by different instances of shared_library, the actual DLL/DSO won't be unloaded until there is at least one instance of shared_library.

    @@ -368,15 +368,15 @@ Currently known limitations:

    -

    -smart_library public member functions

    +

    +smart_library public member functions

    1. -
      const shared_library & shared_lib() const;
      +
      const shared_library & shared_lib() const;

      Get the underlying shared_library

    2. -
      const mangled_storage & symbol_storage() const;
      +
      const mangled_storage & symbol_storage() const;

      Acces to the mangled storage, which is created on construction.

      @@ -392,9 +392,9 @@ Currently known limitations:

  • -
    mangled_storage & symbol_storage();
    Overload, for current development.
    • +
    mangled_storage & symbol_storage();
    Overload, for current development.
  • -
    void load(const boost::filesystem::path & lib_path, 
+
    void load(const boost::filesystem::path & lib_path, 
           load_mode::type mode = load_mode::default_mode);
    
 
    Loads a library by specified path with a specified mode.
    
 
    Note that if some library is already loaded in this instance, load will call unload() and then load the new provided library.
    
@@ -434,7 +434,7 @@ Currently known limitations:
  • -
    void load(const boost::filesystem::path & lib_path, 
+
    void load(const boost::filesystem::path & lib_path, 
           boost::system::error_code & ec, 
           load_mode::type mode = load_mode::default_mode);
    
 
    Loads a library by specified path with a specified mode.
    
@@ -479,12 +479,12 @@ Currently known limitations:
  • -
    void load(const boost::filesystem::path & lib_path, load_mode::type mode, 
+
    void load(const boost::filesystem::path & lib_path, load_mode::type mode, 
           boost::system::error_code & ec);
    
 
    This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.
  • -
    template<typename T> T & get_variable(const std::string & name) const;
    +
    template<typename T> T & get_variable(const std::string & name) const;

    Load a variable from the referenced library.

    Unlinke shared_library::get this function will also load scoped variables, which also includes static class members.

    @@ -544,7 +544,7 @@ Currently known limitations:

  • -
    template<typename Func> Func & get_function(const std::string & name) const;
    +
    template<typename Func> Func & get_function(const std::string & name) const;

    Load a function from the referenced library.

    Example: 

    smart_library lib("test_lib.so");
@@ -611,7 +611,7 @@ Currently known limitations:
    
 
  • template<typename Class, typename Func> 
-  unspecified get_mem_fn(const std::string & name) const;
    + unspecified get_mem_fn(const std::string & name) const;

    Load a member-function from the referenced library.

    Example (import class is MyClass, which is available inside the library and the host):

    smart_library lib("test_lib.so");
@@ -685,7 +685,7 @@ Currently known limitations:
  • -
    template<typename Signature> constructor< Signature > get_constructor() const;
    +
    template<typename Signature> constructor< Signature > get_constructor() const;

    Load a constructor from the referenced library.

    Example (import class is MyClass, which is available inside the library and the host):

    smart_library lib("test_lib.so");
@@ -727,7 +727,7 @@ Currently known limitations:
  • -
    template<typename Class> destructor< Class > get_destructor() const;
    +
    template<typename Class> destructor< Class > get_destructor() const;

    Load a destructor from the referenced library.

    Example (import class is MyClass, which is available inside the library and the host):

    smart_library lib("test_lib.so");
@@ -769,7 +769,7 @@ Currently known limitations:
  • -
    template<typename Class> const std::type_info & get_type_info() const;
    +
    template<typename Class> const std::type_info & get_type_info() const;

    Load the typeinfo of the given type.

    Example (import class is MyClass, which is available inside the library and the host):

    smart_library lib("test_lib.so");
@@ -811,7 +811,7 @@ Currently known limitations:
  • -
    template<typename Alias> void add_type_alias(const std::string & name);
    +
    template<typename Alias> void add_type_alias(const std::string & name);

    This function can be used to add a type alias.

    This is to be used, when a class shall be imported, which is not declared on the host side.

    Example:

    @@ -863,7 +863,7 @@ Currently known limitations:

  • -
    void unload() noexcept;
    +
    void unload() noexcept;

    Unloads a shared library. If library was loaded multiple times by different instances, the actual DLL/DSO won't be unloaded until there is at least one instance that references the DLL/DSO.

    @@ -886,7 +886,7 @@ Currently known limitations:

  • -
    bool is_loaded() const noexcept;
    +
    bool is_loaded() const noexcept;

    Check if an library is loaded.

    @@ -909,7 +909,7 @@ Currently known limitations:

  • -
    bool operator!() const noexcept;
    +
    bool operator!() const noexcept;

    Check if an library is not loaded.

    @@ -932,10 +932,10 @@ Currently known limitations:

  • -
    explicit operator bool() const noexcept;
    bool() const

    bool() const

    +
    explicit operator bool() const noexcept;
    bool() const

    bool() const

  • -
    bool has(const char * symbol_name) const noexcept;
    +
    bool has(const char * symbol_name) const noexcept;

    Search for a given symbol on loaded library. Works for all symbols, including alias names.

    @@ -972,11 +972,11 @@ Currently known limitations:

  • -
    bool has(const std::string & symbol_name) const noexcept;
    +
    bool has(const std::string & symbol_name) const noexcept;

    This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

  • -
    smart_library & assign(const smart_library & lib);
    +
    smart_library & assign(const smart_library & lib);

    Makes *this share the same shared object as lib. If *this is loaded, then unloads it.

    @@ -1013,7 +1013,7 @@ Currently known limitations:

  • -
    void swap(smart_library & rhs) noexcept;
    +
    void swap(smart_library & rhs) noexcept;

    Swaps two libraries. Does not invalidate existing symbols and functions loaded from libraries.

    @@ -1058,7 +1058,7 @@ Currently known limitations:

    • -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/dll/import.html b/doc/html/boost/dll/import.html index 04b4b99684..8d3ce324df 100644 --- a/doc/html/boost/dll/import.html +++ b/doc/html/boost/dll/import.html @@ -7,7 +7,7 @@ - + @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -49,7 +49,7 @@ template<typename T> result_type import(shared_library && lib, const std::string & name);
    -

    Description

    +

    Description

    Returns callable object or boost::shared_ptr<T> that holds the symbol imported from the loaded library. Returned value refcounts usage of the loaded shared library, so that it won't get unload until all copies of return value are not destroyed.

    This call will succeed if call to boost::dll::shared_library::has(const char* ) function with the same symbol name returned true.

    For importing symbols by alias names use boost::dll::import_alias method.

    @@ -116,7 +116,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/dll/import_alias.html b/doc/html/boost/dll/import_alias.html index ab08e8580c..0a09e05b36 100644 --- a/doc/html/boost/dll/import_alias.html +++ b/doc/html/boost/dll/import_alias.html @@ -51,7 +51,7 @@ template<typename T> result_type import_alias(shared_library && lib, const std::string & name);
    -

    Description

    +

    Description

    Returns callable object or boost::shared_ptr<T> that holds the symbol imported from the loaded library. Returned value refcounts usage of the loaded shared library, so that it won't get unload until all copies of return value are not destroyed.

    This call will succeed if call to boost::dll::shared_library::has(const char* ) function with the same symbol name returned true.

    For importing symbols by non alias names use boost::dll::import method.

    diff --git a/doc/html/boost/dll/library_info.html b/doc/html/boost/dll/library_info.html index a65b6beca0..2a634f6efa 100644 --- a/doc/html/boost/dll/library_info.html +++ b/doc/html/boost/dll/library_info.html @@ -36,25 +36,25 @@ class library_info : private noncopyable { public: // construct/copy/destruct - explicit library_info(const boost::filesystem::path &, bool = true); - ~library_info(); + explicit library_info(const boost::filesystem::path &, bool = true); + ~library_info(); - // public member functions - std::vector< std::string > sections(); - std::vector< std::string > symbols(); - std::vector< std::string > symbols(const char *); - std::vector< std::string > symbols(const std::string &); + // public member functions + std::vector< std::string > sections(); + std::vector< std::string > symbols(); + std::vector< std::string > symbols(const char *); + std::vector< std::string > symbols(const std::string &); };
    -

    Description

    +

    Description

    -

    +

    library_info public construct/copy/destruct

    1. -
      explicit library_info(const boost::filesystem::path & library_path, 
+
      explicit library_info(const boost::filesystem::path & library_path, 
                       bool throw_if_not_native_format = true);
      
 
      Opens file with specified path and prepares for information extraction. 
 
      
@@ -85,7 +85,7 @@
  • -
    ~library_info();
    +
    ~library_info();

    @@ -102,11 +102,11 @@
    -

    -library_info public member functions

    +

    +library_info public member functions

    1. -
      std::vector< std::string > sections();
      +
      std::vector< std::string > sections();

    @@ -121,7 +121,7 @@
  • -
    std::vector< std::string > symbols();
    +
    std::vector< std::string > symbols();

    @@ -136,7 +136,7 @@
  • -
    std::vector< std::string > symbols(const char * section_name);
    +
    std::vector< std::string > symbols(const char * section_name);

    @@ -167,7 +167,7 @@
  • -
    std::vector< std::string > symbols(const std::string & section_name);
    +
    std::vector< std::string > symbols(const std::string & section_name);

    This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

    • diff --git a/doc/html/boost/dll/load_mode/type.html b/doc/html/boost/dll/load_mode/type.html index ac1ead5d14..d8476e11e7 100644 --- a/doc/html/boost/dll/load_mode/type.html +++ b/doc/html/boost/dll/load_mode/type.html @@ -38,7 +38,7 @@ rtld_lazy, rtld_now, rtld_global, rtld_local, rtld_deepbind, append_decorations, search_system_folders };
    -

    Description

    +

    Description

    Library load modes.

    Each of system family provides own modes. Flags not supported by a particular platform will be silently ignored.

    For a detailed description of platform specific options see: Windows specific options, POSIX specific options.

    diff --git a/doc/html/boost/dll/program_location.html b/doc/html/boost/dll/program_location.html index 045770e655..452649597b 100644 --- a/doc/html/boost/dll/program_location.html +++ b/doc/html/boost/dll/program_location.html @@ -36,7 +36,7 @@ boost::filesystem::path program_location(boost::system::error_code & ec); boost::filesystem::path program_location();
    -

    Description

    +

    Description

    On success returns full path and name of the currently running program (the one which contains the main() function).

    Return value can be used as a parameter for shared_library. See Tutorial "Linking plugin into the executable" for usage example. Flag '-rdynamic' must be used when linking the plugin into the executable on Linux OS.

    diff --git a/doc/html/boost/dll/shared_library.html b/doc/html/boost/dll/shared_library.html index 257350b064..72c3dc9f11 100644 --- a/doc/html/boost/dll/shared_library.html +++ b/doc/html/boost/dll/shared_library.html @@ -39,69 +39,69 @@ typedef platform_specific native_handle_t; // construct/copy/destruct - shared_library() noexcept; - shared_library(const shared_library &); - shared_library(const shared_library &, boost::system::error_code &); - shared_library(shared_library &&) noexcept; - explicit shared_library(const boost::filesystem::path &, + shared_library() noexcept; + shared_library(const shared_library &); + shared_library(const shared_library &, boost::system::error_code &); + shared_library(shared_library &&) noexcept; + explicit shared_library(const boost::filesystem::path &, load_mode::type = load_mode::default_mode); - shared_library(const boost::filesystem::path &, boost::system::error_code &, + shared_library(const boost::filesystem::path &, boost::system::error_code &, load_mode::type = load_mode::default_mode); - shared_library(const boost::filesystem::path &, load_mode::type, + shared_library(const boost::filesystem::path &, load_mode::type, boost::system::error_code &); - shared_library & operator=(const shared_library &); - shared_library & operator=(shared_library &&) noexcept; - ~shared_library(); - - // public member functions - shared_library & assign(const shared_library &, boost::system::error_code &); - shared_library & assign(const shared_library &); - void load(const boost::filesystem::path &, + shared_library & operator=(const shared_library &); + shared_library & operator=(shared_library &&) noexcept; + ~shared_library(); + + // public member functions + shared_library & assign(const shared_library &, boost::system::error_code &); + shared_library & assign(const shared_library &); + void load(const boost::filesystem::path &, load_mode::type = load_mode::default_mode); - void load(const boost::filesystem::path &, boost::system::error_code &, + void load(const boost::filesystem::path &, boost::system::error_code &, load_mode::type = load_mode::default_mode); - void load(const boost::filesystem::path &, load_mode::type, + void load(const boost::filesystem::path &, load_mode::type, boost::system::error_code &); - void unload() noexcept; - bool is_loaded() const noexcept; - bool operator!() const noexcept; - explicit operator bool() const noexcept; - bool has(const char *) const noexcept; - bool has(const std::string &) const noexcept; + void unload() noexcept; + bool is_loaded() const noexcept; + bool operator!() const noexcept; + explicit operator bool() const noexcept; + bool has(const char *) const noexcept; + bool has(const std::string &) const noexcept; template<typename T> boost::enable_if_c< boost::is_member_pointer< T >::value||boost::is_reference< T >::value, T >::type - get(const std::string &) const; + get(const std::string &) const; template<typename T> boost::disable_if_c< boost::is_member_pointer< T >::value||boost::is_reference< T >::value, T & >::type - get(const std::string &) const; + get(const std::string &) const; template<typename T> boost::enable_if_c< boost::is_member_pointer< T >::value||boost::is_reference< T >::value, T >::type - get(const char *) const; + get(const char *) const; template<typename T> boost::disable_if_c< boost::is_member_pointer< T >::value||boost::is_reference< T >::value, T & >::type - get(const char *) const; - template<typename T> T & get_alias(const char *) const; - template<typename T> T & get_alias(const std::string &) const; - native_handle_t native() const noexcept; - boost::filesystem::path location() const; - boost::filesystem::path location(boost::system::error_code &) const; - void swap(shared_library &) noexcept; - - // public static functions - static boost::filesystem::path suffix(); + get(const char *) const; + template<typename T> T & get_alias(const char *) const; + template<typename T> T & get_alias(const std::string &) const; + native_handle_t native() const noexcept; + boost::filesystem::path location() const; + boost::filesystem::path location(boost::system::error_code &) const; + void swap(shared_library &) noexcept; + + // public static functions + static boost::filesystem::path suffix(); };

    -

    Description

    +

    Description

    shared_library instances share reference count to an actual loaded DLL/DSO, so it is safe and memory efficient to have multiple instances of shared_library referencing the same DLL/DSO even if those instances were loaded using different paths (relative + absolute) referencing the same object.

    On Linux/POSIX link with library "dl". "-fvisibility=hidden" flag is also recommended for use on Linux/POSIX.

    -

    +

    shared_library public construct/copy/destruct

    1. -
      shared_library() noexcept;
      +
      shared_library() noexcept;

      Creates in anstance that does not reference any DLL/DSO.

      @@ -124,7 +124,7 @@

  • -
    shared_library(const shared_library & lib);
    +
    shared_library(const shared_library & lib);

    Copy constructor that increments the reference count of an underlying shared library. Same as calling constructor with lib.location() parameter.

    @@ -161,7 +161,7 @@

  • -
    shared_library(const shared_library & lib, boost::system::error_code & ec);
    +
    shared_library(const shared_library & lib, boost::system::error_code & ec);

    Copy constructor that increments the reference count of an underlying shared library. Same as calling constructor with lib.location(), ec parameters.

    @@ -204,7 +204,7 @@

  • -
    shared_library(shared_library && lib) noexcept;
    +
    shared_library(shared_library && lib) noexcept;

    Move constructor. Does not invalidate existing symbols and functions loaded from lib.

    @@ -241,7 +241,7 @@

  • -
    explicit shared_library(const boost::filesystem::path & lib_path, 
+
    explicit shared_library(const boost::filesystem::path & lib_path, 
                         load_mode::type mode = load_mode::default_mode);
    
 
    Loads a library by specified path with a specified mode.
    
 
    
@@ -280,7 +280,7 @@
  • -
    shared_library(const boost::filesystem::path & lib_path, 
+
    shared_library(const boost::filesystem::path & lib_path, 
                boost::system::error_code & ec, 
                load_mode::type mode = load_mode::default_mode);
    
 
    Loads a library by specified path with a specified mode.
    
@@ -324,12 +324,12 @@
  • -
    shared_library(const boost::filesystem::path & lib_path, load_mode::type mode, 
+
    shared_library(const boost::filesystem::path & lib_path, load_mode::type mode, 
                boost::system::error_code & ec);
    
 
    This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.
  • -
    shared_library & operator=(const shared_library & lib);
    +
    shared_library & operator=(const shared_library & lib);

    Assignment operator. If this->is_loaded() then calls this->unload(). Does not invalidate existing symbols and functions loaded from lib.

    @@ -366,7 +366,7 @@

  • -
    shared_library & operator=(shared_library && lib) noexcept;
    +
    shared_library & operator=(shared_library && lib) noexcept;

    Move assignment operator. If this->is_loaded() then calls this->unload(). Does not invalidate existing symbols and functions loaded from lib.

    @@ -403,7 +403,7 @@

  • -
    ~shared_library();
    +
    ~shared_library();

    Destroys the object by calling unload(). If library was loaded multiple times by different instances, the actual DLL/DSO won't be unloaded until there is at least one instance that references the DLL/DSO.

    @@ -421,12 +421,12 @@
    -

    -shared_library public member functions

    +

    +shared_library public member functions

    1. shared_library & 
-assign(const shared_library & lib, boost::system::error_code & ec);
      +assign(const shared_library & lib, boost::system::error_code & ec);

      Makes *this share the same shared object as lib. If *this is loaded, then unloads it.

      @@ -469,7 +469,7 @@

  • -
    shared_library & assign(const shared_library & lib);
    +
    shared_library & assign(const shared_library & lib);

    Makes *this share the same shared object as lib. If *this is loaded, then unloads it.

    @@ -506,7 +506,7 @@

  • -
    void load(const boost::filesystem::path & lib_path, 
+
    void load(const boost::filesystem::path & lib_path, 
           load_mode::type mode = load_mode::default_mode);
    
 
    Loads a library by specified path with a specified mode.
    
 
    Note that if some library is already loaded in this instance, load will call unload() and then load the new provided library.
    
@@ -546,7 +546,7 @@
  • -
    void load(const boost::filesystem::path & lib_path, 
+
    void load(const boost::filesystem::path & lib_path, 
           boost::system::error_code & ec, 
           load_mode::type mode = load_mode::default_mode);
    
 
    Loads a library by specified path with a specified mode.
    
@@ -591,12 +591,12 @@
  • -
    void load(const boost::filesystem::path & lib_path, load_mode::type mode, 
+
    void load(const boost::filesystem::path & lib_path, load_mode::type mode, 
           boost::system::error_code & ec);
    
 
    This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.
  • -
    void unload() noexcept;
    +
    void unload() noexcept;

    Unloads a shared library. If library was loaded multiple times by different instances, the actual DLL/DSO won't be unloaded until there is at least one instance that references the DLL/DSO.

    @@ -619,7 +619,7 @@

  • -
    bool is_loaded() const noexcept;
    +
    bool is_loaded() const noexcept;

    Check if an library is loaded.

    @@ -642,7 +642,7 @@

  • -
    bool operator!() const noexcept;
    +
    bool operator!() const noexcept;

    Check if an library is not loaded.

    @@ -665,7 +665,7 @@

  • -
    explicit operator bool() const noexcept;
    +
    explicit operator bool() const noexcept;

    Check if an library is loaded.

    @@ -688,7 +688,7 @@

  • -
    bool has(const char * symbol_name) const noexcept;
    +
    bool has(const char * symbol_name) const noexcept;

    Search for a given symbol on loaded library. Works for all symbols, including alias names.

    @@ -725,13 +725,13 @@

  • -
    bool has(const std::string & symbol_name) const noexcept;
    +
    bool has(const std::string & symbol_name) const noexcept;

    This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts. 

  • template<typename T> 
   boost::enable_if_c< boost::is_member_pointer< T >::value||boost::is_reference< T >::value, T >::type 
-  get(const std::string & symbol_name) const;
    + get(const std::string & symbol_name) const;

    Returns reference to the symbol (function or variable) with the given name from the loaded library. This call will always succeed and throw nothing if call to has(const char* ) member function with the same symbol name returned true.

    Example: 

    int& i0 = lib.get<int>("integer_name");
@@ -788,23 +788,23 @@
 
  • 
 
    template<typename T> 
   boost::disable_if_c< boost::is_member_pointer< T >::value||boost::is_reference< T >::value, T & >::type 
-  get(const std::string & symbol_name) const;
    
+  get(const std::string & symbol_name) const;

    • This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts. 

  • template<typename T> 
   boost::enable_if_c< boost::is_member_pointer< T >::value||boost::is_reference< T >::value, T >::type 
-  get(const char * symbol_name) const;
    + get(const char * symbol_name) const;

    This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts. 

  • template<typename T> 
   boost::disable_if_c< boost::is_member_pointer< T >::value||boost::is_reference< T >::value, T & >::type 
-  get(const char * symbol_name) const;
    + get(const char * symbol_name) const;

    This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

  • -
    template<typename T> T & get_alias(const char * alias_name) const;
    +
    template<typename T> T & get_alias(const char * alias_name) const;

    Returns a symbol (function or variable) from a shared library by alias name of the symbol.

    Example: 

    int& i = lib.get_alias<int>("integer_alias_name");
@@ -853,11 +853,11 @@
  • -
    template<typename T> T & get_alias(const std::string & alias_name) const;
    +
    template<typename T> T & get_alias(const std::string & alias_name) const;

    This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

  • -
    native_handle_t native() const noexcept;
    +
    native_handle_t native() const noexcept;

    Returns the native handler of the loaded library.

    @@ -873,7 +873,7 @@
  • -
    boost::filesystem::path location() const;
    +
    boost::filesystem::path location() const;

    Returns full path and name of this shared object.

    Example: 

    shared_library lib("test_lib.dll");
@@ -900,7 +900,7 @@
  • -
    boost::filesystem::path location(boost::system::error_code & ec) const;
    +
    boost::filesystem::path location(boost::system::error_code & ec) const;

    Returns full path and name of shared module.

    Example: 

    shared_library lib("test_lib.dll");
@@ -941,7 +941,7 @@
  • -
    void swap(shared_library & rhs) noexcept;
    +
    void swap(shared_library & rhs) noexcept;

    Swaps two libraries. Does not invalidate existing symbols and functions loaded from libraries.

    @@ -975,10 +975,10 @@

    -

    -shared_library public static functions

    +

    +shared_library public static functions

    1. -
      static boost::filesystem::path suffix();
      +
      static boost::filesystem::path suffix();

      Returns suffix of shared module: in a call to load() or the constructor/load.

      diff --git a/doc/html/boost/dll/symbol_location.html b/doc/html/boost/dll/symbol_location.html index 4c9e689e01..3e31691214 100644 --- a/doc/html/boost/dll/symbol_location.html +++ b/doc/html/boost/dll/symbol_location.html @@ -38,7 +38,7 @@ symbol_location(const T & symbol, boost::system::error_code & ec); template<typename T> boost::filesystem::path symbol_location(const T & symbol);
    -

    Description

    +

    Description

    On success returns full path and name of the binary object that holds symbol.

    diff --git a/doc/html/boost/dll/symbol_location_ptr.html b/doc/html/boost/dll/symbol_location_ptr.html index cc705d6836..899ecc0a55 100644 --- a/doc/html/boost/dll/symbol_location_ptr.html +++ b/doc/html/boost/dll/symbol_location_ptr.html @@ -39,7 +39,7 @@ template<typename T> boost::filesystem::path symbol_location_ptr(T ptr_to_symbol);

    -

    Description

    +

    Description

    On success returns full path and name to the binary object that holds symbol pointed by ptr_to_symbol.

    diff --git a/doc/html/boost/dll/this_line_location.html b/doc/html/boost/dll/this_line_location.html index cdfb9a8027..a27754975e 100644 --- a/doc/html/boost/dll/this_line_location.html +++ b/doc/html/boost/dll/this_line_location.html @@ -36,7 +36,7 @@ boost::filesystem::path this_line_location(boost::system::error_code & ec); boost::filesystem::path this_line_location();

    -

    Description

    +

    Description

    On success returns full path and name of the binary object that holds the current line of code (the line in which the this_line_location() method was called).

    diff --git a/doc/html/boost/function.html b/doc/html/boost/function.html index 6f247a2c11..e9fcf025f8 100644 --- a/doc/html/boost/function.html +++ b/doc/html/boost/function.html @@ -61,65 +61,65 @@ }; // construct/copy/destruct - function(); - function(const functionN&); - function(functionN&&); - function(const function&); - function(function&&); - template<typename F> function(F); - template<typename F, typename Allocator> function(F, Allocator); - function& operator=(const functionN&); - function& operator=(functionN&&); - function& operator=(const function&); - function& operator=(function&&); - ~function(); + function(); + function(const functionN&); + function(functionN&&); + function(const function&); + function(function&&); + template<typename F> function(F); + template<typename F, typename Allocator> function(F, Allocator); + function& operator=(const functionN&); + function& operator=(functionN&&); + function& operator=(const function&); + function& operator=(function&&); + ~function(); - // modifiers - void swap(const function&); - void clear(); + // modifiers + void swap(const function&); + void clear(); - // capacity - bool empty() const; - operator safe_bool() const; - bool operator!() const; + // capacity + bool empty() const; + operator safe_bool() const; + bool operator!() const; - // target access - template<typename Functor> Functor* target(); - template<typename Functor> const Functor* target() const; - template<typename Functor> bool contains(const Functor&) const; - const std::type_info& target_type() const; + // target access + template<typename Functor> Functor* target(); + template<typename Functor> const Functor* target() const; + template<typename Functor> bool contains(const Functor&) const; + const std::type_info& target_type() const; - // invocation - result_type operator()(arg1_type, arg2_type, ..., argN_type) const; + // invocation + result_type operator()(arg1_type, arg2_type, ..., argN_type) const; }; -// specialized algorithms +// specialized algorithms template<typename Signature> void swap(function<Signature>&, function<Signature>&); -// comparison operators +// comparison operators template<typename Signature, typename Functor> - bool operator==(const function<Signature>&, Functor); + bool operator==(const function<Signature>&, Functor); template<typename Signature, typename Functor> - bool operator==(Functor, const function<Signature>&); + bool operator==(Functor, const function<Signature>&); template<typename Signature, typename Functor> - bool operator==(const function<Signature>&, reference_wrapper<Functor>); + bool operator==(const function<Signature>&, reference_wrapper<Functor>); template<typename Signature, typename Functor> - bool operator==(reference_wrapper<Functor>, const function<Signature>&); + bool operator==(reference_wrapper<Functor>, const function<Signature>&); template<typename Signature1, typename Signature2> - void operator==(const function<Signature1>&, const function<Signature2>&); + void operator==(const function<Signature1>&, const function<Signature2>&); template<typename Signature, typename Functor> - bool operator!=(const function<Signature>&, Functor); + bool operator!=(const function<Signature>&, Functor); template<typename Signature, typename Functor> - bool operator!=(Functor, const function<Signature>&); + bool operator!=(Functor, const function<Signature>&); template<typename Signature, typename Functor> - bool operator!=(const function<Signature>&, reference_wrapper<Functor>); + bool operator!=(const function<Signature>&, reference_wrapper<Functor>); template<typename Signature, typename Functor> - bool operator!=(reference_wrapper<Functor>, const function<Signature>&); + bool operator!=(reference_wrapper<Functor>, const function<Signature>&); template<typename Signature1, typename Signature2> - void operator!=(const function<Signature1>&, const function<Signature2>&);

    + void operator!=(const function<Signature1>&, const function<Signature2>&);
    -

    Description

    +

    Description

    Class template function is a thin wrapper around the numbered class templates function0, function1, etc. It accepts a function type with N arguments and will will derive from @@ -131,20 +131,20 @@ additional member functions are required to allow proper copy construction and copy assignment of function objects.

    -

    Template Parameters

    +

    Template Parameters

    1. typename Signature

    -

    +

    function public construct/copy/destruct

    1. -
      function();
      +
      function();
      @@ -153,7 +153,7 @@ - + @@ -163,7 +163,7 @@

      Postconditions:

      		this->empty()this->empty()

      Throws:

    2. -
      function(const functionN& f);
      +
      function(const functionN& f);
      @@ -172,7 +172,7 @@ - + @@ -182,7 +182,7 @@

      Postconditions:

      		Contains a copy of the f's target, if it has one, or is empty if f.empty().Contains a copy of the f's target, if it has one, or is empty if f.empty().

      Throws:

    3. -
      function(functionN&& f);
      +
      function(functionN&& f);
      @@ -205,7 +205,7 @@
    4. -
      function(const function& f);
      +
      function(const function& f);
      @@ -214,7 +214,7 @@ - + @@ -224,7 +224,7 @@

      Postconditions:

      		Contains a copy of the f's target, if it has one, or is empty if f.empty().Contains a copy of the f's target, if it has one, or is empty if f.empty().

      Throws:

    5. -
      function(function&& f);
      +
      function(function&& f);
      @@ -247,7 +247,7 @@
    6. -
      template<typename F> function(F f);
      +
      template<typename F> function(F f);
      @@ -261,13 +261,13 @@ +*this targets a copy of f if f is nonempty, or this->empty() if f is empty.

      Postconditions:

      		 -*this targets a copy of f if f is nonempty, or this->empty() if f is empty.
    7. -
      template<typename F, typename Allocator> function(F f, Allocator alloc);
      +
      template<typename F, typename Allocator> function(F f, Allocator alloc);
      @@ -281,7 +281,7 @@ +*this targets a copy of f if f is nonempty, or this->empty() if f is empty. @@ -291,7 +291,7 @@

      Postconditions:

      		 -*this targets a copy of f if f is nonempty, or this->empty() if f is empty.

      Effects:

    8. -
      function& operator=(const functionN& f);
      +
      function& operator=(const functionN& f);
      @@ -299,12 +299,12 @@ - +

      Postconditions:

      		If copy construction does not throw, *this targets a copy of f's target, if it has one, or is empty if f.empty(). If copy construction does throw, this->empty().If copy construction does not throw, *this targets a copy of f's target, if it has one, or is empty if f.empty(). If copy construction does throw, this->empty().
    9. -
      function& operator=(functionN&& f);
      +
      function& operator=(functionN&& f);
      @@ -327,7 +327,7 @@
    10. -
      function& operator=(const function& f);
      +
      function& operator=(const function& f);
      @@ -336,17 +336,17 @@ - + - +

      Postconditions:

      		If copy construction of the target of f does not throw, *this targets a copy of f's target, if it has one, or is empty if f.empty(). If copy construction of the target of f does not throw, *this targets a copy of f's target, if it has one, or is empty if f.empty().

      Throws:

      		Will not throw when the target of f is a stateless function object or a reference to the function object. If copy construction does throw, this->empty().Will not throw when the target of f is a stateless function object or a reference to the function object. If copy construction does throw, this->empty().
    11. -
      function& operator=(function&& f);
      +
      function& operator=(function&& f);
      @@ -369,7 +369,7 @@
    12. -
      ~function();
      +
      ~function();
      @@ -377,18 +377,18 @@ - +

      Effects:

      		If !this->empty(), destroys the target of this.If !this->empty(), destroys the target of this.
    -

    -function modifiers

    +

    +function modifiers

    1. -
      void swap(const function& f);
      +
      void swap(const function& f);
      @@ -401,7 +401,7 @@
    2. -
      void clear();
      +
      void clear();
      @@ -410,7 +410,7 @@ - + @@ -422,11 +422,11 @@
      -

      -function capacity

      +

      +function capacity

      1. -
        bool empty() const;
        +
        bool empty() const;

      Postconditions:

      		this->empty()this->empty()

      Throws:
      @@ -446,7 +446,7 @@
    3. -
      operator safe_bool() const;
      +
      operator safe_bool() const;
      @@ -455,7 +455,7 @@ - + @@ -465,7 +465,7 @@

      Returns:

      		A safe_bool that evaluates false in a boolean context when this->empty(), and true otherwise.A safe_bool that evaluates false in a boolean context when this->empty(), and true otherwise.

      Throws:

    4. -
      bool operator!() const;
      +
      bool operator!() const;
      @@ -474,7 +474,7 @@ - + @@ -486,12 +486,12 @@
      -

      -function target access

      +

      +function target access

      1. -
        template<typename Functor> Functor* target();
-template<typename Functor> const Functor* target() const;
        +
        template<typename Functor> Functor* target();
+template<typename Functor> const Functor* target() const;

      Returns:

      		this->empty()this->empty()

      Throws:
      @@ -513,7 +513,7 @@
    5. -
      template<typename Functor> bool contains(const Functor& f) const;
      +
      template<typename Functor> bool contains(const Functor& f) const;
      @@ -522,13 +522,13 @@

      Returns:

      		 -true if this->target<Functor>() is non-NULL and function_equal(*(this->target<Functor>()), f) +true if this->target<Functor>() is non-NULL and function_equal(*(this->target<Functor>()), f)
    6. -
      const std::type_info& target_type() const;
      +
      const std::type_info& target_type() const;
      @@ -538,7 +538,7 @@ +typeid of the target function object, or typeid(void) if this->empty(). @@ -550,10 +550,10 @@
      -

      -function invocation

      +

      +function invocation

      1. -
        result_type operator()(arg1_type a1, arg2_type a2, ..., argN_type aN) const;
        +
        result_type operator()(arg1_type a1, arg2_type a2, ..., argN_type aN) const;

      Returns:

      		 -typeid of the target function object, or typeid(void) if this->empty().

      Throws:
      @@ -572,15 +572,15 @@ +bad_function_call if this->empty(). Otherwise, may through any exception thrown by the target function f.

      Throws:

      		 -bad_function_call if this->empty(). Otherwise, may through any exception thrown by the target function f.
    -

    -function specialized algorithms

    +

    +function specialized algorithms

    1. template<typename Signature> 
   void swap(function<Signature>& f1, function<Signature>& f2);
      @@ -591,27 +591,27 @@

      Effects:

      -f1.swap(f2) +f1.swap(f2)
    • -

    -function comparison operators

    +

    +function comparison operators

    1. template<typename Signature, typename Functor> 
-  bool operator==(const function<Signature>& f, Functor g);
+  bool operator==(const function<Signature>& f, Functor g);
 template<typename Signature, typename Functor> 
-  bool operator==(Functor g, const function<Signature>& f);
+  bool operator==(Functor g, const function<Signature>& f);
 template<typename Signature, typename Functor> 
-  bool operator==(const function<Signature>& f, reference_wrapper<Functor> g);
+  bool operator==(const function<Signature>& f, reference_wrapper<Functor> g);
 template<typename Signature, typename Functor> 
-  bool operator==(reference_wrapper<Functor> g, const function<Signature>& f);
+  bool operator==(reference_wrapper<Functor> g, const function<Signature>& f);
 template<typename Signature1, typename Signature2> 
-  void operator==(const function<Signature1>& f1, 
+  void operator==(const function<Signature1>& f1, 
                   const function<Signature2>& f2);
      @@ -657,15 +657,15 @@ 

    2. template<typename Signature, typename Functor> 
-  bool operator!=(const function<Signature>& f, Functor g);
+  bool operator!=(const function<Signature>& f, Functor g);
 template<typename Signature, typename Functor> 
-  bool operator!=(Functor g, const function<Signature>& f);
+  bool operator!=(Functor g, const function<Signature>& f);
 template<typename Signature, typename Functor> 
-  bool operator!=(const function<Signature>& f, reference_wrapper<Functor> g);
+  bool operator!=(const function<Signature>& f, reference_wrapper<Functor> g);
 template<typename Signature, typename Functor> 
-  bool operator!=(reference_wrapper<Functor> g, const function<Signature>& f);
+  bool operator!=(reference_wrapper<Functor> g, const function<Signature>& f);
 template<typename Signature1, typename Signature2> 
-  void operator!=(const function<Signature1>& f1, 
+  void operator!=(const function<Signature1>& f1, 
                   const function<Signature2>& f2);
      3. diff --git a/doc/html/boost/function/sig.html b/doc/html/boost/function/sig.html index 3c17b52cad..f9c5841296 100644 --- a/doc/html/boost/function/sig.html +++ b/doc/html/boost/function/sig.html @@ -6,7 +6,7 @@ - + @@ -21,7 +21,7 @@
      -PrevUpHomeNext +PrevUpHomeNext
      @@ -50,7 +50,7 @@
      -PrevUpHomeNext +PrevUpHomeNext
      diff --git a/doc/html/boost/functionN.html b/doc/html/boost/functionN.html index 791a7cc4c3..cf3ddcfb65 100644 --- a/doc/html/boost/functionN.html +++ b/doc/html/boost/functionN.html @@ -60,81 +60,81 @@ }; // construct/copy/destruct - functionN(); - functionN(const functionN&); - functionN(functionN&&); - template<typename F> functionN(F); - template<typename F, typename Allocator> functionN(F, Allocator); - functionN& operator=(const functionN&); - functionN& operator=(functionN&&); - ~functionN(); + functionN(); + functionN(const functionN&); + functionN(functionN&&); + template<typename F> functionN(F); + template<typename F, typename Allocator> functionN(F, Allocator); + functionN& operator=(const functionN&); + functionN& operator=(functionN&&); + ~functionN(); - // modifiers - void swap(const functionN&); - void clear(); + // modifiers + void swap(const functionN&); + void clear(); - // capacity - bool empty() const; - operator safe_bool() const; - bool operator!() const; + // capacity + bool empty() const; + operator safe_bool() const; + bool operator!() const; - // target access - template<typename Functor> Functor* target(); - template<typename Functor> const Functor* target() const; - template<typename Functor> bool contains(const Functor&) const; - const std::type_info& target_type() const; + // target access + template<typename Functor> Functor* target(); + template<typename Functor> const Functor* target() const; + template<typename Functor> bool contains(const Functor&) const; + const std::type_info& target_type() const; - // invocation - result_type operator()(arg1_type, arg2_type, ..., argN_type) const; + // invocation + result_type operator()(arg1_type, arg2_type, ..., argN_type) const; }; -// specialized algorithms +// specialized algorithms template<typename T1, typename T2, ..., typename TN> void swap(functionN<T1, T2, ..., TN>&, functionN<T1, T2, ..., TN>&); -// comparison operators +// comparison operators template<typename T1, typename T2, ..., typename TN, typename Functor> - bool operator==(const functionN<T1, T2, ..., TN>&, Functor); + bool operator==(const functionN<T1, T2, ..., TN>&, Functor); template<typename T1, typename T2, ..., typename TN, typename Functor> - bool operator==(Functor, const functionN<T1, T2, ..., TN>&); + bool operator==(Functor, const functionN<T1, T2, ..., TN>&); template<typename T1, typename T2, ..., typename TN, typename Functor> - bool operator==(const functionN<T1, T2, ..., TN>&, + bool operator==(const functionN<T1, T2, ..., TN>&, reference_wrapper<Functor>); template<typename T1, typename T2, ..., typename TN, typename Functor> - bool operator==(reference_wrapper<Functor>, + bool operator==(reference_wrapper<Functor>, const functionN<T1, T2, ..., TN>&); template<typename T1, typename T2, ..., typename TN, typename U1, typename U2, ..., typename UN> - void operator==(const functionN<T1, T2, ..., TN>&, + void operator==(const functionN<T1, T2, ..., TN>&, const functionN<U1, U2, ..., UN>&); template<typename T1, typename T2, ..., typename TN, typename Functor> - bool operator!=(const functionN<T1, T2, ..., TN>&, Functor); + bool operator!=(const functionN<T1, T2, ..., TN>&, Functor); template<typename T1, typename T2, ..., typename TN, typename Functor> - bool operator!=(Functor, const functionN<T1, T2, ..., TN>&); + bool operator!=(Functor, const functionN<T1, T2, ..., TN>&); template<typename T1, typename T2, ..., typename TN, typename Functor> - bool operator!=(const functionN<T1, T2, ..., TN>&, + bool operator!=(const functionN<T1, T2, ..., TN>&, reference_wrapper<Functor>); template<typename T1, typename T2, ..., typename TN, typename Functor> - bool operator!=(reference_wrapper<Functor>, + bool operator!=(reference_wrapper<Functor>, const functionN<T1, T2, ..., TN>&); template<typename T1, typename T2, ..., typename TN, typename U1, typename U2, ..., typename UN> - void operator!=(const functionN<T1, T2, ..., TN>&, + void operator!=(const functionN<T1, T2, ..., TN>&, const functionN<U1, U2, ..., UN>&);
      -

      Description

      +

      Description

      Class template functionN is actually a family of related classes function0, function1, etc., up to some implementation-defined maximum. In this context, N refers to the number of parameters.

      -

      +

      functionN public construct/copy/destruct

      1. -
        functionN();
        +
        functionN();
        @@ -143,7 +143,7 @@ - + @@ -153,7 +153,7 @@

        Postconditions:

        		this->empty()this->empty()

        Throws:

      2. -
        functionN(const functionN& f);
        +
        functionN(const functionN& f);
        @@ -162,7 +162,7 @@ - + @@ -172,7 +172,7 @@

        Postconditions:

        		Contains a copy of the f's target, if it has one, or is empty if f.empty().Contains a copy of the f's target, if it has one, or is empty if f.empty().

        Throws:

      3. -
        functionN(functionN&& f);
        +
        functionN(functionN&& f);
        @@ -195,7 +195,7 @@
      4. -
        template<typename F> functionN(F f);
        +
        template<typename F> functionN(F f);
        @@ -209,13 +209,13 @@ +*this targets a copy of f if f is nonempty, or this->empty() if f is empty.

        Postconditions:

        		 -*this targets a copy of f if f is nonempty, or this->empty() if f is empty.
      5. -
        template<typename F, typename Allocator> functionN(F f, Allocator alloc);
        +
        template<typename F, typename Allocator> functionN(F f, Allocator alloc);
        @@ -229,7 +229,7 @@ +*this targets a copy of f if f is nonempty, or this->empty() if f is empty. @@ -239,7 +239,7 @@

        Postconditions:

        		 -*this targets a copy of f if f is nonempty, or this->empty() if f is empty.

        Effects:

      6. -
        functionN& operator=(const functionN& f);
        +
        functionN& operator=(const functionN& f);
        @@ -247,12 +247,12 @@ - +

        Postconditions:

        		If copy construction does not throw, *this targets a copy of f's target, if it has one, or is empty if f.empty(). If copy construction does throw, this->empty().If copy construction does not throw, *this targets a copy of f's target, if it has one, or is empty if f.empty(). If copy construction does throw, this->empty().
      7. -
        functionN& operator=(functionN&& f);
        +
        functionN& operator=(functionN&& f);
        @@ -275,7 +275,7 @@
      8. -
        ~functionN();
        +
        ~functionN();
        @@ -283,18 +283,18 @@ - +

        Effects:

        		If !this->empty(), destroys the target of this.If !this->empty(), destroys the target of this.
      -

      -functionN modifiers

      +

      +functionN modifiers

      1. -
        void swap(const functionN& f);
        +
        void swap(const functionN& f);
        @@ -307,7 +307,7 @@
      2. -
        void clear();
        +
        void clear();
        @@ -315,18 +315,18 @@ - +

        Postconditions:

        		this->empty()this->empty()
      -

      -functionN capacity

      +

      +functionN capacity

      1. -
        bool empty() const;
        +
        bool empty() const;
        @@ -346,7 +346,7 @@
      2. -
        operator safe_bool() const;
        +
        operator safe_bool() const;
        @@ -355,7 +355,7 @@ - + @@ -365,7 +365,7 @@

        Returns:

        		A safe_bool that evaluates false in a boolean context when this->empty(), and true otherwise.A safe_bool that evaluates false in a boolean context when this->empty(), and true otherwise.

        Throws:

      3. -
        bool operator!() const;
        +
        bool operator!() const;
        @@ -374,7 +374,7 @@ - + @@ -386,12 +386,12 @@
        -

        -functionN target access

        +

        +functionN target access

        1. -
          template<typename Functor> Functor* target();
-template<typename Functor> const Functor* target() const;
          +
          template<typename Functor> Functor* target();
+template<typename Functor> const Functor* target() const;

        Returns:

        		this->empty()this->empty()

        Throws:
        @@ -413,7 +413,7 @@
      4. -
        template<typename Functor> bool contains(const Functor& f) const;
        +
        template<typename Functor> bool contains(const Functor& f) const;
        @@ -422,13 +422,13 @@

        Returns:

        		 -true if this->target<Functor>() is non-NULL and function_equal(*(this->target<Functor>()), f) +true if this->target<Functor>() is non-NULL and function_equal(*(this->target<Functor>()), f)
      5. -
        const std::type_info& target_type() const;
        +
        const std::type_info& target_type() const;
        @@ -438,7 +438,7 @@ +typeid of the target function object, or typeid(void) if this->empty(). @@ -450,10 +450,10 @@
        -

        -functionN invocation

        +

        +functionN invocation

        1. -
          result_type operator()(arg1_type a1, arg2_type a2, ..., argN_type aN) const;
          +
          result_type operator()(arg1_type a1, arg2_type a2, ..., argN_type aN) const;

        Returns:

        		 -typeid of the target function object, or typeid(void) if this->empty().

        Throws:
        @@ -472,15 +472,15 @@ +bad_function_call if this->empty(). Otherwise, may through any exception thrown by the target function f.

        Throws:

        		 -bad_function_call if this->empty(). Otherwise, may through any exception thrown by the target function f.
      -

      -functionN specialized algorithms

      +

      +functionN specialized algorithms

      1. template<typename T1, typename T2, ..., typename TN> 
   void swap(functionN<T1, T2, ..., TN>& f1, functionN<T1, T2, ..., TN>& f2);
        @@ -491,30 +491,30 @@

        Effects:

        -f1.swap(f2) +f1.swap(f2)
    -

    -functionN comparison operators

    +

    +functionN comparison operators

    1. template<typename T1, typename T2, ..., typename TN, typename Functor> 
-  bool operator==(const functionN<T1, T2, ..., TN>& f, Functor g);
+  bool operator==(const functionN<T1, T2, ..., TN>& f, Functor g);
 template<typename T1, typename T2, ..., typename TN, typename Functor> 
-  bool operator==(Functor g, const functionN<T1, T2, ..., TN>& f);
+  bool operator==(Functor g, const functionN<T1, T2, ..., TN>& f);
 template<typename T1, typename T2, ..., typename TN, typename Functor> 
-  bool operator==(const functionN<T1, T2, ..., TN>& f, 
+  bool operator==(const functionN<T1, T2, ..., TN>& f, 
                   reference_wrapper<Functor> g);
 template<typename T1, typename T2, ..., typename TN, typename Functor> 
-  bool operator==(reference_wrapper<Functor> g, 
+  bool operator==(reference_wrapper<Functor> g, 
                   const functionN<T1, T2, ..., TN>& f);
 template<typename T1, typename T2, ..., typename TN, typename U1, typename U2, 
          ..., typename UN> 
-  void operator==(const functionN<T1, T2, ..., TN>& f1, 
+  void operator==(const functionN<T1, T2, ..., TN>& f1, 
                   const functionN<U1, U2, ..., UN>& f2);
      @@ -562,18 +562,18 @@ 

    2. template<typename T1, typename T2, ..., typename TN, typename Functor> 
-  bool operator!=(const functionN<T1, T2, ..., TN>& f, Functor g);
+  bool operator!=(const functionN<T1, T2, ..., TN>& f, Functor g);
 template<typename T1, typename T2, ..., typename TN, typename Functor> 
-  bool operator!=(Functor g, const functionN<T1, T2, ..., TN>& f);
+  bool operator!=(Functor g, const functionN<T1, T2, ..., TN>& f);
 template<typename T1, typename T2, ..., typename TN, typename Functor> 
-  bool operator!=(const functionN<T1, T2, ..., TN>& f, 
+  bool operator!=(const functionN<T1, T2, ..., TN>& f, 
                   reference_wrapper<Functor> g);
 template<typename T1, typename T2, ..., typename TN, typename Functor> 
-  bool operator!=(reference_wrapper<Functor> g, 
+  bool operator!=(reference_wrapper<Functor> g, 
                   const functionN<T1, T2, ..., TN>& f);
 template<typename T1, typename T2, ..., typename TN, typename U1, typename U2, 
          ..., typename UN> 
-  void operator!=(const functionN<T1, T2, ..., TN>& f1, 
+  void operator!=(const functionN<T1, T2, ..., TN>& f1, 
                   const functionN<U1, U2, ..., UN>& f2);
      3. diff --git a/doc/html/boost/functionN/sig.html b/doc/html/boost/functionN/sig.html index 20f096a5e3..429464e2e9 100644 --- a/doc/html/boost/functionN/sig.html +++ b/doc/html/boost/functionN/sig.html @@ -6,7 +6,7 @@ - + @@ -21,7 +21,7 @@
      -PrevUpHomeNext +PrevUpHomeNext
      @@ -50,7 +50,7 @@
      -PrevUpHomeNext +PrevUpHomeNext
      diff --git a/doc/html/boost/function_base.html b/doc/html/boost/function_base.html index cf678e5952..95af3a89e5 100644 --- a/doc/html/boost/function_base.html +++ b/doc/html/boost/function_base.html @@ -38,22 +38,22 @@ class function_base { public: - // capacity - bool empty() const; + // capacity + bool empty() const; - // target access - template<typename Functor> Functor* target(); - template<typename Functor> const Functor* target() const; - template<typename Functor> bool contains(const Functor&) const; - const std::type_info& target_type() const; + // target access + template<typename Functor> Functor* target(); + template<typename Functor> const Functor* target() const; + template<typename Functor> bool contains(const Functor&) const; + const std::type_info& target_type() const; };
      -

      Description

      +

      Description

      -

      -function_base capacity

      +

      +function_base capacity

      1. -
        bool empty() const;
        +
        bool empty() const;
        @@ -74,12 +74,12 @@
        -

        -function_base target access

        +

        +function_base target access

        1. -
          template<typename Functor> Functor* target();
-template<typename Functor> const Functor* target() const;
          +
          template<typename Functor> Functor* target();
+template<typename Functor> const Functor* target() const;
        @@ -101,7 +101,7 @@
      2. -
        template<typename Functor> bool contains(const Functor& f) const;
        +
        template<typename Functor> bool contains(const Functor& f) const;
        @@ -110,13 +110,13 @@

        Returns:

        		 -true if this->target<Functor>() is non-NULL and function_equal(*(this->target<Functor>()), f) +true if this->target<Functor>() is non-NULL and function_equal(*(this->target<Functor>()), f)
      3. -
        const std::type_info& target_type() const;
        +
        const std::type_info& target_type() const;
        @@ -126,7 +126,7 @@ +typeid of the target function object, or typeid(void) if this->empty(). Works even with RTTI off. diff --git a/doc/html/boost/function_equal.html b/doc/html/boost/function_equal.html index 114b6bff98..7fe8c14fb0 100644 --- a/doc/html/boost/function_equal.html +++ b/doc/html/boost/function_equal.html @@ -35,7 +35,7 @@ template<typename F,typename G>boolfunction_equal(constF& f,constG& g);
        -

        Description

        +

        Description

        Returns:

        		 -typeid of the target function object, or typeid(void) if this->empty(). Works even with RTTI off.

        Throws:
        diff --git a/doc/html/boost/graph_t_1_3_26_5_14_12_2_1.html b/doc/html/boost/graph_t_1_3_26_5_14_12_2_1.html new file mode 100644 index 0000000000..64be574f17 --- /dev/null +++ b/doc/html/boost/graph_t_1_3_26_5_14_12_2_1.html @@ -0,0 +1,79 @@ + + + + +Struct graph_traits<mpi::graph_communicator> + + + + + + + + +
        + + + + + + +
        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
        +
        +
        +PrevUpHomeNext +
        +
        +
        +
        +

        Struct graph_traits<mpi::graph_communicator>

        +

        boost::graph_traits<mpi::graph_communicator> — Traits structure that allows a communicator with graph topology to be view as a graph by the Boost Graph Library.

        +
        +

        Synopsis

        +
        // In header: <boost/mpi/graph_communicator.hpp>
+
+
+struct graph_traits<mpi::graph_communicator> {
+  // types
+  typedef int                        vertex_descriptor;     
+  typedef std::pair< int, int >      edge_descriptor;       
+  typedef directed_tag               directed_category;     
+  typedef disallow_parallel_edge_tag edge_parallel_category;
+  typedef unspecified                out_edge_iterator;     
+  typedef int                        degree_size_type;      
+  typedef unspecified                adjacency_iterator;    
+  typedef counting_iterator< int >   vertex_iterator;       
+  typedef int                        vertices_size_type;    
+  typedef unspecified                edge_iterator;         
+  typedef int                        edges_size_type;       
+
+  // public static functions
+  static vertex_descriptor null_vertex();
+};
        +
        +

        Description

        +

        The specialization of graph_traits for an MPI communicator allows a communicator with graph topology to be viewed as a graph. An MPI communicator with graph topology meets the requirements of the Graph, Incidence Graph, Adjacency Graph, Vertex List Graph, and Edge List Graph concepts from the Boost Graph Library.

        +
        +

        +graph_traits public static functions

        +
        1. +
          static vertex_descriptor null_vertex();
          Returns a vertex descriptor that can never refer to any valid vertex.
        +
        +
        +
        + + + +
        Copyright © 2005-2007 Douglas Gregor, + Matthias Troyer, Trustees of Indiana University

        + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at + http://www.boost.org/LICENSE_1_0.txt ) +

        +
        +
        +
        +PrevUpHomeNext +
        + + diff --git a/doc/html/boost/graph_trai_1_3_26_6_11_2_1.html b/doc/html/boost/graph_trai_1_3_26_6_11_2_1.html deleted file mode 100644 index a20359791d..0000000000 --- a/doc/html/boost/graph_trai_1_3_26_6_11_2_1.html +++ /dev/null @@ -1,79 +0,0 @@ - - - - -Struct graph_traits<mpi::graph_communicator> - - - - - - - - - - - - - - - -
        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
        -
        -
        -PrevUpHomeNext -
        -
        -
        -
        -

        Struct graph_traits<mpi::graph_communicator>

        -

        boost::graph_traits<mpi::graph_communicator> — Traits structure that allows a communicator with graph topology to be view as a graph by the Boost Graph Library.

        -
        -

        Synopsis

        -
        // In header: <boost/mpi/graph_communicator.hpp>
-
-
-struct graph_traits<mpi::graph_communicator> {
-  // types
-  typedef int                        vertex_descriptor;     
-  typedef std::pair< int, int >      edge_descriptor;       
-  typedef directed_tag               directed_category;     
-  typedef disallow_parallel_edge_tag edge_parallel_category;
-  typedef unspecified                out_edge_iterator;     
-  typedef int                        degree_size_type;      
-  typedef unspecified                adjacency_iterator;    
-  typedef counting_iterator< int >   vertex_iterator;       
-  typedef int                        vertices_size_type;    
-  typedef unspecified                edge_iterator;         
-  typedef int                        edges_size_type;       
-
-  // public static functions
-  static vertex_descriptor null_vertex();
-};
        -
        -

        Description

        -

        The specialization of graph_traits for an MPI communicator allows a communicator with graph topology to be viewed as a graph. An MPI communicator with graph topology meets the requirements of the Graph, Incidence Graph, Adjacency Graph, Vertex List Graph, and Edge List Graph concepts from the Boost Graph Library.

        -
        -

        -graph_traits public static functions

        -
        1. -
          static vertex_descriptor null_vertex();
          Returns a vertex descriptor that can never refer to any valid vertex.
        -
        -
        -
        - - - -
        Copyright © 2005-2007 Douglas Gregor, - Matthias Troyer, Trustees of Indiana University

        - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at - http://www.boost.org/LICENSE_1_0.txt ) -

        -
        -
        -
        -PrevUpHomeNext -
        - - diff --git a/doc/html/boost/gregorian/bad_day_of_month.html b/doc/html/boost/gregorian/bad_day_of_month.html index 3e4f40dc3b..e8ea30652b 100644 --- a/doc/html/boost/gregorian/bad_day_of_month.html +++ b/doc/html/boost/gregorian/bad_day_of_month.html @@ -35,20 +35,20 @@ struct bad_day_of_month : public out_of_range { // construct/copy/destruct - bad_day_of_month(); - bad_day_of_month(const std::string &); + bad_day_of_month(); + bad_day_of_month(const std::string &); };
        -

        Description

        +

        Description

        -

        +

        bad_day_of_month public construct/copy/destruct

          -
        1. bad_day_of_month();
          2. +
        2. bad_day_of_month();
        3. -
          bad_day_of_month(const std::string & s);
          Allow other classes to throw with unique string for bad day like Feb 29.
          4. +
          bad_day_of_month(const std::string & s);
          Allow other classes to throw with unique string for bad day like Feb 29.
        diff --git a/doc/html/boost/gregorian/bad_day_of_year.html b/doc/html/boost/gregorian/bad_day_of_year.html index a6e0c6edad..5852bafd85 100644 --- a/doc/html/boost/gregorian/bad_day_of_year.html +++ b/doc/html/boost/gregorian/bad_day_of_year.html @@ -35,16 +35,16 @@ struct bad_day_of_year : public out_of_range { // construct/copy/destruct - bad_day_of_year(); + bad_day_of_year(); };
      -

      Description

      +

      Description

      -

      +

      bad_day_of_year public construct/copy/destruct

      -
      1. bad_day_of_year();
      +
      1. bad_day_of_year();
      diff --git a/doc/html/boost/gregorian/bad_month.html b/doc/html/boost/gregorian/bad_month.html index 1abfac656b..8ecde5076f 100644 --- a/doc/html/boost/gregorian/bad_month.html +++ b/doc/html/boost/gregorian/bad_month.html @@ -7,7 +7,7 @@ - + @@ -21,7 +21,7 @@
      -PrevUpHomeNext +PrevUpHomeNext
      @@ -35,16 +35,16 @@ struct bad_month : public out_of_range { // construct/copy/destruct - bad_month(); + bad_month(); };
      -

      Description

      +

      Description

      -

      +

      bad_month public construct/copy/destruct

      -
      1. bad_month();
      +
      1. bad_month();
      @@ -56,7 +56,7 @@
      -PrevUpHomeNext +PrevUpHomeNext
      diff --git a/doc/html/boost/gregorian/bad_weekday.html b/doc/html/boost/gregorian/bad_weekday.html index 57939bbfb7..72ead20c80 100644 --- a/doc/html/boost/gregorian/bad_weekday.html +++ b/doc/html/boost/gregorian/bad_weekday.html @@ -7,7 +7,7 @@ - + @@ -21,7 +21,7 @@
      -PrevUpHomeNext +PrevUpHomeNext
      @@ -35,16 +35,16 @@ struct bad_weekday : public out_of_range { // construct/copy/destruct - bad_weekday(); + bad_weekday(); };
      -

      Description

      +

      Description

      -

      +

      bad_weekday public construct/copy/destruct

      -
      1. bad_weekday();
      +
      1. bad_weekday();
      @@ -56,7 +56,7 @@
      -PrevUpHomeNext +PrevUpHomeNext
      diff --git a/doc/html/boost/gregorian/bad_year.html b/doc/html/boost/gregorian/bad_year.html index 6217a6be40..1ad759a7b6 100644 --- a/doc/html/boost/gregorian/bad_year.html +++ b/doc/html/boost/gregorian/bad_year.html @@ -35,16 +35,16 @@ struct bad_year : public out_of_range { // construct/copy/destruct - bad_year(); + bad_year(); };
    -

    Description

    +

    Description

    -

    +

    bad_year public construct/copy/destruct

    -
    1. bad_year();
    +
    1. bad_year();
    diff --git a/doc/html/boost/gregorian/date.html b/doc/html/boost/gregorian/date.html index ee29aedc27..16645b913a 100644 --- a/doc/html/boost/gregorian/date.html +++ b/doc/html/boost/gregorian/date.html @@ -48,60 +48,60 @@ typedef date_duration duration_type; // construct/copy/destruct - date(); - date(year_type, month_type, day_type); - explicit date(const ymd_type &); - explicit date(const date_int_type &); - explicit date(date_rep_type); - explicit date(special_values); + date(); + date(year_type, month_type, day_type); + explicit date(const ymd_type &); + explicit date(const date_int_type &); + explicit date(date_rep_type); + explicit date(special_values); - // public member functions - date_int_type julian_day() const; - day_of_year_type day_of_year() const; - date_int_type modjulian_day() const; - int week_number() const; - date_int_type day_number() const; - date end_of_month() const; + // public member functions + date_int_type julian_day() const; + day_of_year_type day_of_year() const; + date_int_type modjulian_day() const; + int week_number() const; + date_int_type day_number() const; + date end_of_month() const; };
    -

    Description

    +

    Description

    This class is the primary interface for programming with greogorian dates. The is a lightweight type that can be freely passed by value. All comparison operators are supported.

    -

    +

    date public construct/copy/destruct

    1. -
      date();
      Default constructor constructs with not_a_date_time.
      2. +
      date();
      Default constructor constructs with not_a_date_time.
    2. -
      date(year_type y, month_type m, day_type d);
      Main constructor with year, month, day.
      3. +
      date(year_type y, month_type m, day_type d);
      Main constructor with year, month, day.
    3. -
      explicit date(const ymd_type & ymd);
      Constructor from a ymd_type structure.
      4. +
      explicit date(const ymd_type & ymd);
      Constructor from a ymd_type structure.
    4. -
      explicit date(const date_int_type & rhs);
      Needed copy constructor.
      5. +
      explicit date(const date_int_type & rhs);
      Needed copy constructor.
    5. -
      explicit date(date_rep_type rhs);
      Needed copy constructor.
      6. +
      explicit date(date_rep_type rhs);
      Needed copy constructor.
    6. -
      explicit date(special_values sv);
      Constructor for infinities, not a date, max and min date.
      7. +
      explicit date(special_values sv);
      Constructor for infinities, not a date, max and min date.
    -

    -date public member functions

    +

    +date public member functions

    1. -
      date_int_type julian_day() const;
      Return the Julian Day number for the date.
      2. +
      date_int_type julian_day() const;
      Return the Julian Day number for the date.
    2. -
      day_of_year_type day_of_year() const;
      Return the day of year 1..365 or 1..366 (for leap year)
      3. +
      day_of_year_type day_of_year() const;
      Return the day of year 1..365 or 1..366 (for leap year)
    3. -
      date_int_type modjulian_day() const;
      Return the Modified Julian Day number for the date.
      4. +
      date_int_type modjulian_day() const;
      Return the Modified Julian Day number for the date.
    4. -
      int week_number() const;
      Return the iso 8601 week number 1..53.
      5. +
      int week_number() const;
      Return the iso 8601 week number 1..53.
    5. -
      date_int_type day_number() const;
      Return the day number from the calendar.
      6. +
      date_int_type day_number() const;
      Return the day number from the calendar.
    6. -
      date end_of_month() const;
      Return the last day of the current month.
      7. +
      date end_of_month() const;
      Return the last day of the current month.
    diff --git a/doc/html/boost/gregorian/date_duration.html b/doc/html/boost/gregorian/date_duration.html index 91f92ce7bb..24db5ac917 100644 --- a/doc/html/boost/gregorian/date_duration.html +++ b/doc/html/boost/gregorian/date_duration.html @@ -41,69 +41,69 @@ typedef base_type::duration_rep duration_rep; // construct/copy/destruct - explicit date_duration(duration_rep = 0); - date_duration(date_time::special_values); - date_duration(const date_duration &); - date_duration(const base_type &); + explicit date_duration(duration_rep = 0); + date_duration(date_time::special_values); + date_duration(const date_duration &); + date_duration(const base_type &); - // public member functions - bool operator==(const date_duration &) const; - bool operator!=(const date_duration &) const; - bool operator<(const date_duration &) const; - bool operator>(const date_duration &) const; - bool operator<=(const date_duration &) const; - bool operator>=(const date_duration &) const; - date_duration & operator-=(const date_duration &); - date_duration & operator+=(const date_duration &); - date_duration operator-() const; - date_duration & operator/=(int); + // public member functions + bool operator==(const date_duration &) const; + bool operator!=(const date_duration &) const; + bool operator<(const date_duration &) const; + bool operator>(const date_duration &) const; + bool operator<=(const date_duration &) const; + bool operator>=(const date_duration &) const; + date_duration & operator-=(const date_duration &); + date_duration & operator+=(const date_duration &); + date_duration operator-() const; + date_duration & operator/=(int); - // public static functions - static date_duration unit(); + // public static functions + static date_duration unit(); };
    -

    Description

    +

    Description

    -

    +

    date_duration public construct/copy/destruct

    1. -
      explicit date_duration(duration_rep day_count = 0);
      Construct from a day count.
      2. +
      explicit date_duration(duration_rep day_count = 0);
      Construct from a day count.
    2. -
      date_duration(date_time::special_values sv);
      construct from special_values
      3. +
      date_duration(date_time::special_values sv);
      construct from special_values
    3. -
      date_duration(const date_duration & other);
      Copy constructor.
      4. +
      date_duration(const date_duration & other);
      Copy constructor.
    4. -
      date_duration(const base_type & other);
      Construct from another date_duration.
      5. +
      date_duration(const base_type & other);
      Construct from another date_duration.
    -

    -date_duration public member functions

    +

    +date_duration public member functions

      -
    1. bool operator==(const date_duration & rhs) const;
      2. -
    2. bool operator!=(const date_duration & rhs) const;
      3. -
    3. bool operator<(const date_duration & rhs) const;
      4. -
    4. bool operator>(const date_duration & rhs) const;
      5. -
    5. bool operator<=(const date_duration & rhs) const;
      6. -
    6. bool operator>=(const date_duration & rhs) const;
      7. +
    7. bool operator==(const date_duration & rhs) const;
      8. +
    8. bool operator!=(const date_duration & rhs) const;
      9. +
    9. bool operator<(const date_duration & rhs) const;
      10. +
    10. bool operator>(const date_duration & rhs) const;
      11. +
    11. bool operator<=(const date_duration & rhs) const;
      12. +
    12. bool operator>=(const date_duration & rhs) const;
    13. -
      date_duration & operator-=(const date_duration & rhs);
      Subtract another duration – result is signed.
      14. +
      date_duration & operator-=(const date_duration & rhs);
      Subtract another duration – result is signed.
    14. -
      date_duration & operator+=(const date_duration & rhs);
      Add a duration – result is signed.
      15. +
      date_duration & operator+=(const date_duration & rhs);
      Add a duration – result is signed.
    15. -
      date_duration operator-() const;
      unary- Allows for dd = -date_duration(2); -> dd == -2
      16. +
      date_duration operator-() const;
      unary- Allows for dd = -date_duration(2); -> dd == -2
    16. -
      date_duration & operator/=(int divisor);
      Division operations on a duration with an integer.
      17. +
      date_duration & operator/=(int divisor);
      Division operations on a duration with an integer.
    -

    -date_duration public static functions

    +

    +date_duration public static functions

    1. -
      static date_duration unit();
      Returns the smallest duration – used by to calculate 'end'.
    +
    static date_duration unit();
    Returns the smallest duration – used by to calculate 'end'.
    diff --git a/doc/html/boost/gregorian/greg_day.html b/doc/html/boost/gregorian/greg_day.html index bb531fe139..36e794d072 100644 --- a/doc/html/boost/gregorian/greg_day.html +++ b/doc/html/boost/gregorian/greg_day.html @@ -36,28 +36,28 @@ class greg_day : public greg_day_rep { public: // construct/copy/destruct - greg_day(value_type); + greg_day(value_type); - // public member functions - value_type as_number() const; - operator value_type() const; + // public member functions + value_type as_number() const; + operator value_type() const; };
    -

    Description

    +

    Description

    This small class allows for simple conversion an integer value into a day of the month for a standard gregorian calendar. The type is automatically range checked so values outside of the range 1-31 will cause a bad_day_of_month exception

    -

    +

    greg_day public construct/copy/destruct

    -
    1. greg_day(value_type day_of_month);
    +
    1. greg_day(value_type day_of_month);
    -

    -greg_day public member functions

    +

    +greg_day public member functions

      -
    1. value_type as_number() const;
      2. -
    2. operator value_type() const;
      3. +
    3. value_type as_number() const;
      4. +
    4. operator value_type() const;
    diff --git a/doc/html/boost/gregorian/greg_facet_config.html b/doc/html/boost/gregorian/greg_facet_config.html index 74ffd2717f..62188c739e 100644 --- a/doc/html/boost/gregorian/greg_facet_config.html +++ b/doc/html/boost/gregorian/greg_facet_config.html @@ -8,7 +8,7 @@ - + @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -49,7 +49,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/gregorian/greg_month.html b/doc/html/boost/gregorian/greg_month.html index a63716baf7..533a890d66 100644 --- a/doc/html/boost/gregorian/greg_month.html +++ b/doc/html/boost/gregorian/greg_month.html @@ -41,63 +41,63 @@ typedef boost::shared_ptr< month_map_type > month_map_ptr_type; // construct/copy/destruct - greg_month(month_enum); - greg_month(value_type); + greg_month(month_enum); + greg_month(value_type); - // public member functions - operator value_type() const; - value_type as_number() const; - month_enum as_enum() const; - const char * as_short_string() const; - const char * as_long_string() const; - const wchar_t * as_short_wstring() const; - const wchar_t * as_long_wstring() const; - const char * as_short_string(char) const; - const char * as_long_string(char) const; - const wchar_t * as_short_string(wchar_t) const; - const wchar_t * as_long_string(wchar_t) const; + // public member functions + operator value_type() const; + value_type as_number() const; + month_enum as_enum() const; + const char * as_short_string() const; + const char * as_long_string() const; + const wchar_t * as_short_wstring() const; + const wchar_t * as_long_wstring() const; + const char * as_short_string(char) const; + const char * as_long_string(char) const; + const wchar_t * as_short_string(wchar_t) const; + const wchar_t * as_long_string(wchar_t) const; - // public static functions - static month_map_ptr_type get_month_map_ptr(); + // public static functions + static month_map_ptr_type get_month_map_ptr(); };
    -

    Description

    +

    Description

    -

    +

    greg_month public construct/copy/destruct

    1. -
      greg_month(month_enum theMonth);
      Construct a month from the months_of_year enumeration.
      2. +
      greg_month(month_enum theMonth);
      Construct a month from the months_of_year enumeration.
    2. -
      greg_month(value_type theMonth);
      Construct from a short value.
      3. +
      greg_month(value_type theMonth);
      Construct from a short value.
    -

    -greg_month public member functions

    +

    +greg_month public member functions

    1. -
      operator value_type() const;
      Convert the value back to a short.
      2. +
      operator value_type() const;
      Convert the value back to a short.
    2. -
      value_type as_number() const;
      Returns month as number from 1 to 12.
      3. -
    3. month_enum as_enum() const;
      4. -
    4. const char * as_short_string() const;
      5. -
    5. const char * as_long_string() const;
      6. -
    6. const wchar_t * as_short_wstring() const;
      7. -
    7. const wchar_t * as_long_wstring() const;
      8. -
    8. const char * as_short_string(char) const;
      9. -
    9. const char * as_long_string(char) const;
      10. -
    10. const wchar_t * as_short_string(wchar_t) const;
      11. -
    11. const wchar_t * as_long_string(wchar_t) const;
      12. +
      value_type as_number() const;
      Returns month as number from 1 to 12. +
    12. month_enum as_enum() const;
      13. +
    13. const char * as_short_string() const;
      14. +
    14. const char * as_long_string() const;
      15. +
    15. const wchar_t * as_short_wstring() const;
      16. +
    16. const wchar_t * as_long_wstring() const;
      17. +
    17. const char * as_short_string(char) const;
      18. +
    18. const char * as_long_string(char) const;
      19. +
    19. const wchar_t * as_short_string(wchar_t) const;
      20. +
    20. const wchar_t * as_long_string(wchar_t) const;
    -

    -greg_month public static functions

    +

    +greg_month public static functions

    1. -
      static month_map_ptr_type get_month_map_ptr();
      Shared pointer to a map of Month strings (Names & Abbrev) & numbers.
    +
    static month_map_ptr_type get_month_map_ptr();
    Shared pointer to a map of Month strings (Names & Abbrev) & numbers.
    diff --git a/doc/html/boost/gregorian/greg_weekday.html b/doc/html/boost/gregorian/greg_weekday.html index 04baf2dad7..46ddde6a2e 100644 --- a/doc/html/boost/gregorian/greg_weekday.html +++ b/doc/html/boost/gregorian/greg_weekday.html @@ -39,35 +39,35 @@ typedef boost::date_time::weekdays weekday_enum; // construct/copy/destruct - greg_weekday(value_type); + greg_weekday(value_type); - // public member functions - value_type as_number() const; - const char * as_short_string() const; - const char * as_long_string() const; - const wchar_t * as_short_wstring() const; - const wchar_t * as_long_wstring() const; - weekday_enum as_enum() const; + // public member functions + value_type as_number() const; + const char * as_short_string() const; + const char * as_long_string() const; + const wchar_t * as_short_wstring() const; + const wchar_t * as_long_wstring() const; + weekday_enum as_enum() const; };
    -

    Description

    +

    Description

    -

    +

    greg_weekday public construct/copy/destruct

    -
    1. greg_weekday(value_type day_of_week_num);
    +
    1. greg_weekday(value_type day_of_week_num);
    -

    -greg_weekday public member functions

    +

    +greg_weekday public member functions

      -
    1. value_type as_number() const;
      2. -
    2. const char * as_short_string() const;
      3. -
    3. const char * as_long_string() const;
      4. -
    4. const wchar_t * as_short_wstring() const;
      5. -
    5. const wchar_t * as_long_wstring() const;
      6. -
    6. weekday_enum as_enum() const;
      7. +
    7. value_type as_number() const;
      8. +
    8. const char * as_short_string() const;
      9. +
    9. const char * as_long_string() const;
      10. +
    10. const wchar_t * as_short_wstring() const;
      11. +
    11. const wchar_t * as_long_wstring() const;
      12. +
    12. weekday_enum as_enum() const;
    diff --git a/doc/html/boost/gregorian/greg_year.html b/doc/html/boost/gregorian/greg_year.html index 5c770686bd..657f0ae304 100644 --- a/doc/html/boost/gregorian/greg_year.html +++ b/doc/html/boost/gregorian/greg_year.html @@ -27,7 +27,7 @@

    Class greg_year

    -

    boost::gregorian::greg_year — Represent a year (range 1400 - 10000)

    +

    boost::gregorian::greg_year — Represent a year (range 1400 - 9999)

    Synopsis

    // In header: <boost/date_time/gregorian/greg_year.hpp>
@@ -36,25 +36,25 @@
 class greg_year : public greg_year_rep {
 public:
   // construct/copy/destruct
-  greg_year(value_type);
+  greg_year(value_type);
 
-  // public member functions
-  operator value_type() const;
+  // public member functions
+  operator value_type() const;
 };
    -

    Description

    -

    This small class allows for simple conversion an integer value into a year for the gregorian calendar. This currently only allows a range of 1400 to 10000. Both ends of the range are a bit arbitrary at the moment, but they are the limits of current testing of the library. As such they may be increased in the future.

    +

    Description

    +

    This small class allows for simple conversion an integer value into a year for the gregorian calendar. This currently only allows a range of 1400 to 9999. Both ends of the range are a bit arbitrary at the moment, but they are the limits of current testing of the library. As such they may be increased in the future.

    -

    +

    greg_year public construct/copy/destruct

    -
    1. greg_year(value_type year);
    +
    1. greg_year(value_type year);
    -

    -greg_year public member functions

    -
    1. operator value_type() const;
    +

    +greg_year public member functions

    +
    1. operator value_type() const;
    diff --git a/doc/html/boost/gregorian/opera_1_3_12_15_4_11_1_1_3.html b/doc/html/boost/gregorian/opera_1_3_12_15_4_11_1_1_3.html deleted file mode 100644 index 74eda47ab9..0000000000 --- a/doc/html/boost/gregorian/opera_1_3_12_15_4_11_1_1_3.html +++ /dev/null @@ -1,63 +0,0 @@ - - - - -Function template operator<< - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Function template operator<<

    -

    boost::gregorian::operator<< — ostream operator for gregorian::date

    -
    -

    Synopsis

    -
    // In header: <boost/date_time/gregorian/greg_facet.hpp>
-
-
-template<typename charT, typename traits> 
-  std::basic_ostream< charT, traits > & 
-  operator<<(std::basic_ostream< charT, traits > & os, const date & d);
    -
    -

    Description

    -

    Uses the date facet to determine various output parameters including:

    -
      -

    • string values for the month (eg: Jan, Feb, Mar) (default: English)

      • -

    • string values for special values (eg: not-a-date-time) (default: English)

      • -

    • selection of long, short strings, or numerical month representation (default: short string)

      • -

    • month day year order (default yyyy-mmm-dd)

      • -
    -

    -

    -
    -
    - - - -
    Copyright © 2001-2005 CrystalClear Software, Inc

    Subject to the Boost Software License, Version 1.0. (See accompanying file - LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/gregorian/opera_1_3_12_15_4_11_1_1_4.html b/doc/html/boost/gregorian/opera_1_3_12_15_4_11_1_1_4.html deleted file mode 100644 index ab6366f914..0000000000 --- a/doc/html/boost/gregorian/opera_1_3_12_15_4_11_1_1_4.html +++ /dev/null @@ -1,55 +0,0 @@ - - - - -Function template operator<< - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Function template operator<<

    -

    boost::gregorian::operator<< — operator<< for gregorian::greg_month typically streaming: Jan, Feb, Mar...

    -
    -

    Synopsis

    -
    // In header: <boost/date_time/gregorian/greg_facet.hpp>
-
-
-template<typename charT, typename traits> 
-  std::basic_ostream< charT, traits > & 
-  operator<<(std::basic_ostream< charT, traits > & os, const greg_month & m);
    -
    -

    Description

    -

    Uses the date facet to determine output string as well as selection of long or short strings. Default if no facet is installed is to output a 2 wide numeric value for the month eg: 01 == Jan, 02 == Feb, ... 12 == Dec.

    -
    -
    - - - -
    Copyright © 2001-2005 CrystalClear Software, Inc

    Subject to the Boost Software License, Version 1.0. (See accompanying file - LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/gregorian/opera_1_3_12_15_4_11_1_1_5.html b/doc/html/boost/gregorian/opera_1_3_12_15_4_11_1_1_5.html deleted file mode 100644 index 24c3829220..0000000000 --- a/doc/html/boost/gregorian/opera_1_3_12_15_4_11_1_1_5.html +++ /dev/null @@ -1,56 +0,0 @@ - - - - -Function template operator<< - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Function template operator<<

    -

    boost::gregorian::operator<< — operator<< for gregorian::greg_weekday typically streaming: Sun, Mon, Tue, ...

    -
    -

    Synopsis

    -
    // In header: <boost/date_time/gregorian/greg_facet.hpp>
-
-
-template<typename charT, typename traits> 
-  std::basic_ostream< charT, traits > & 
-  operator<<(std::basic_ostream< charT, traits > & os, 
-             const greg_weekday & wd);
    -
    -

    Description

    -

    Uses the date facet to determine output string as well as selection of long or short string. Default if no facet is installed is to output a 3 char english string for the day of the week.

    -
    -
    - - - -
    Copyright © 2001-2005 CrystalClear Software, Inc

    Subject to the Boost Software License, Version 1.0. (See accompanying file - LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/gregorian/opera_1_3_12_15_4_11_1_1_6.html b/doc/html/boost/gregorian/opera_1_3_12_15_4_11_1_1_6.html deleted file mode 100644 index 5324336934..0000000000 --- a/doc/html/boost/gregorian/opera_1_3_12_15_4_11_1_1_6.html +++ /dev/null @@ -1,55 +0,0 @@ - - - - -Function template operator<< - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Function template operator<<

    -

    boost::gregorian::operator<< — operator<< for gregorian::date_period typical output: [2002-Jan-01/2002-Jan-31]

    -
    -

    Synopsis

    -
    // In header: <boost/date_time/gregorian/greg_facet.hpp>
-
-
-template<typename charT, typename traits> 
-  std::basic_ostream< charT, traits > & 
-  operator<<(std::basic_ostream< charT, traits > & os, const date_period & dp);
    -
    -

    Description

    -

    Uses the date facet to determine output string as well as selection of long or short string fr dates. Default if no facet is installed is to output a 3 char english string for the day of the week.

    -
    -
    - - - -
    Copyright © 2001-2005 CrystalClear Software, Inc

    Subject to the Boost Software License, Version 1.0. (See accompanying file - LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/gregorian/opera_1_3_13_15_4_11_1_1_3.html b/doc/html/boost/gregorian/opera_1_3_13_15_4_11_1_1_3.html new file mode 100644 index 0000000000..4f6c77d354 --- /dev/null +++ b/doc/html/boost/gregorian/opera_1_3_13_15_4_11_1_1_3.html @@ -0,0 +1,63 @@ + + + + +Function template operator<< + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Function template operator<<

    +

    boost::gregorian::operator<< — ostream operator for gregorian::date

    +
    +

    Synopsis

    +
    // In header: <boost/date_time/gregorian/greg_facet.hpp>
+
+
+template<typename charT, typename traits> 
+  std::basic_ostream< charT, traits > & 
+  operator<<(std::basic_ostream< charT, traits > & os, const date & d);
    +
    +

    Description

    +

    Uses the date facet to determine various output parameters including:

    +
      +

    • string values for the month (eg: Jan, Feb, Mar) (default: English)

      • +

    • string values for special values (eg: not-a-date-time) (default: English)

      • +

    • selection of long, short strings, or numerical month representation (default: short string)

      • +

    • month day year order (default yyyy-mmm-dd)

      • +
    +

    +

    +
    +
    + + + +
    Copyright © 2001-2005 CrystalClear Software, Inc

    Subject to the Boost Software License, Version 1.0. (See accompanying file + LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/gregorian/opera_1_3_13_15_4_11_1_1_4.html b/doc/html/boost/gregorian/opera_1_3_13_15_4_11_1_1_4.html new file mode 100644 index 0000000000..afc1b086f6 --- /dev/null +++ b/doc/html/boost/gregorian/opera_1_3_13_15_4_11_1_1_4.html @@ -0,0 +1,55 @@ + + + + +Function template operator<< + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Function template operator<<

    +

    boost::gregorian::operator<< — operator<< for gregorian::greg_month typically streaming: Jan, Feb, Mar...

    +
    +

    Synopsis

    +
    // In header: <boost/date_time/gregorian/greg_facet.hpp>
+
+
+template<typename charT, typename traits> 
+  std::basic_ostream< charT, traits > & 
+  operator<<(std::basic_ostream< charT, traits > & os, const greg_month & m);
    +
    +

    Description

    +

    Uses the date facet to determine output string as well as selection of long or short strings. Default if no facet is installed is to output a 2 wide numeric value for the month eg: 01 == Jan, 02 == Feb, ... 12 == Dec.

    +
    +
    + + + +
    Copyright © 2001-2005 CrystalClear Software, Inc

    Subject to the Boost Software License, Version 1.0. (See accompanying file + LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/gregorian/opera_1_3_13_15_4_11_1_1_5.html b/doc/html/boost/gregorian/opera_1_3_13_15_4_11_1_1_5.html new file mode 100644 index 0000000000..cc51f8fa92 --- /dev/null +++ b/doc/html/boost/gregorian/opera_1_3_13_15_4_11_1_1_5.html @@ -0,0 +1,56 @@ + + + + +Function template operator<< + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Function template operator<<

    +

    boost::gregorian::operator<< — operator<< for gregorian::greg_weekday typically streaming: Sun, Mon, Tue, ...

    +
    +

    Synopsis

    +
    // In header: <boost/date_time/gregorian/greg_facet.hpp>
+
+
+template<typename charT, typename traits> 
+  std::basic_ostream< charT, traits > & 
+  operator<<(std::basic_ostream< charT, traits > & os, 
+             const greg_weekday & wd);
    +
    +

    Description

    +

    Uses the date facet to determine output string as well as selection of long or short string. Default if no facet is installed is to output a 3 char english string for the day of the week.

    +
    +
    + + + +
    Copyright © 2001-2005 CrystalClear Software, Inc

    Subject to the Boost Software License, Version 1.0. (See accompanying file + LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/gregorian/opera_1_3_13_15_4_11_1_1_6.html b/doc/html/boost/gregorian/opera_1_3_13_15_4_11_1_1_6.html new file mode 100644 index 0000000000..8a6a235245 --- /dev/null +++ b/doc/html/boost/gregorian/opera_1_3_13_15_4_11_1_1_6.html @@ -0,0 +1,55 @@ + + + + +Function template operator<< + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Function template operator<<

    +

    boost::gregorian::operator<< — operator<< for gregorian::date_period typical output: [2002-Jan-01/2002-Jan-31]

    +
    +

    Synopsis

    +
    // In header: <boost/date_time/gregorian/greg_facet.hpp>
+
+
+template<typename charT, typename traits> 
+  std::basic_ostream< charT, traits > & 
+  operator<<(std::basic_ostream< charT, traits > & os, const date_period & dp);
    +
    +

    Description

    +

    Uses the date facet to determine output string as well as selection of long or short string fr dates. Default if no facet is installed is to output a 3 char english string for the day of the week.

    +
    +
    + + + +
    Copyright © 2001-2005 CrystalClear Software, Inc

    Subject to the Boost Software License, Version 1.0. (See accompanying file + LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/gregorian/special_value_from_string.html b/doc/html/boost/gregorian/special_value_from_string.html index b53e22a5b3..4225905844 100644 --- a/doc/html/boost/gregorian/special_value_from_string.html +++ b/doc/html/boost/gregorian/special_value_from_string.html @@ -36,7 +36,7 @@ BOOST_DATE_TIME_DECL special_values special_value_from_string(const std::string & s);
    -

    Description

    +

    Description

    Return special_value from string argument. If argument is not one of the special value names (defined in src/gregorian/names.hpp), return 'not_special'

    diff --git a/doc/html/boost/gregorian/weeks_duration.html b/doc/html/boost/gregorian/weeks_duration.html index 1c8b4805c8..b7fa2dbf63 100644 --- a/doc/html/boost/gregorian/weeks_duration.html +++ b/doc/html/boost/gregorian/weeks_duration.html @@ -36,19 +36,19 @@ class weeks_duration : public boost::gregorian::date_duration { public: // construct/copy/destruct - weeks_duration(duration_rep); - weeks_duration(date_time::special_values); + weeks_duration(duration_rep); + weeks_duration(date_time::special_values); };
    -

    Description

    +

    Description

    -

    +

    weeks_duration public construct/copy/destruct

      -
    1. weeks_duration(duration_rep w);
      2. -
    2. weeks_duration(date_time::special_values sv);
      3. +
    3. weeks_duration(duration_rep w);
      4. +
    4. weeks_duration(date_time::special_values sv);
    diff --git a/doc/html/boost/gregorian/year_based_generator.html b/doc/html/boost/gregorian/year_based_generator.html index 9814ec9c1a..0c9df81aea 100644 --- a/doc/html/boost/gregorian/year_based_generator.html +++ b/doc/html/boost/gregorian/year_based_generator.html @@ -35,7 +35,7 @@     typedef date_time::year_based_generator< date > year_based_generator;
    -

    Description

    +

    Description

    A unifying date_generator base type for: partial_date, nth_day_of_the_week_in_month, first_day_of_the_week_in_month, and last_day_of_the_week_in_month

    diff --git a/doc/html/boost/hash.html b/doc/html/boost/hash.html index 95b6f488bd..0efa2f2d26 100644 --- a/doc/html/boost/hash.html +++ b/doc/html/boost/hash.html @@ -6,9 +6,9 @@ - + - + @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -30,15 +30,15 @@

    boost::hash — A TR1 compliant hash function object.

    Synopsis

    -
    // In header: <boost/functional/hash.hpp>
+
    // In header: <boost/container_hash/hash.hpp>
 
 template<typename T> 
 struct hash : public std::unary_function<T, std::size_t> {
-  std::size_t operator()(T const&) const;
+  std::size_t operator()(T const&) const;
 };
    
 
    
-
    Description
    
-
    std::size_t operator()(T const& val) const;
    
+
    Description
    
+
    std::size_t operator()(T const& val) const;
    
 
    @@ -50,7 +50,7 @@
 
@@ -59,7 +59,7 @@
 
@@ -101,7 +101,7 @@
 
    
 
 

    
 
    
             
    
-
    hash_value(val)
    
+
    hash_value(val)
    
 
    
           
    
 
    Notes:
    		
 
 
    
-              The call to hash_value
+              The call to hash_value
               is unqualified, so that custom overloads can be
               found via argument dependent lookup.
             
    
@@ -70,7 +70,7 @@
             
    
 
    
               Forward declared in
-              <boost/functional/hash_fwd.hpp>
+              <boost/container_hash/hash_fwd.hpp>
             
    
 
    
               This hash function is not intended for general use, and isn't
@@ -83,7 +83,7 @@
 
    Throws:
    		
 
    
             Only throws if
-            hash_value(T) throws.
+            hash_value(T) throws.
           
    		
 
    
 
    
 
    
 
    
-PrevUpHomeNext
+PrevUpHomeNext
 
    
 
 
diff --git a/doc/html/boost/hash_T_1_3_11_11_2_2_24.html b/doc/html/boost/hash_T_1_3_11_11_2_2_24.html
new file mode 100644
index 0000000000..3dca5be64c
--- /dev/null
+++ b/doc/html/boost/hash_T_1_3_11_11_2_2_24.html
@@ -0,0 +1,74 @@
+
+
+
+
+Struct template hash<T*>
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    
+
    
+
    
+PrevUpHomeNext
+
    
+
    
+
    
+
    
+
    Struct template hash<T*>
    
+
    boost::hash<T*>
    
+
    
+
    Synopsis
    
+
    // In header: <boost/container_hash/hash.hpp>
+
+template<typename T> 
+struct hash<T*> {
+  std::size_t operator()(T*) const;
+};
    
+
    
+
    Description
    
+
    std::size_t operator()(T* val) const;
    
+
    
++++
+
+
+
+
+
+
+
+
+
+
+
    



    Returns:
    Unspecified in TR1, except that equal arguments yield the same result.
    Throws:
    Doesn't throw
    
+
    
+
    
+
+
+
+
    Copyright © 2005-2008 Daniel
+      James
    
+        Distributed under the Boost Software License, Version 1.0. (See accompanying
+        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+      
    
+
    
+
    
+
    
+PrevUpHomeNext
+
    
+
+
diff --git a/doc/html/boost/hash_T_1_3_16_11_2_2_24.html b/doc/html/boost/hash_T_1_3_16_11_2_2_24.html
deleted file mode 100644
index 696fa45848..0000000000
--- a/doc/html/boost/hash_T_1_3_16_11_2_2_24.html
+++ /dev/null
@@ -1,74 +0,0 @@
-
-
-
-
-Struct template hash<T*>
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    
-
    
-
    
-PrevUpHomeNext
-
    
-
    
-
    
-
    
-
    Struct template hash<T*>
    
-
    boost::hash<T*>
    
-
    
-
    Synopsis
    
-
    // In header: <boost/functional/hash.hpp>
-
-template<typename T> 
-struct hash<T*> {
-  std::size_t operator()(T*) const;
-};
    
-
    
-
    Description
    
-
    std::size_t operator()(T* val) const;
    
-
    
----
-
-
-
-
-
-
-
-
-
-
-
    



    Returns:
    Unspecified in TR1, except that equal arguments yield the same result.
    Throws:
    Doesn't throw
    
-
    
-
    
-
-
-
-
    Copyright © 2005-2008 Daniel
-      James
    
-        Distributed under the Boost Software License, Version 1.0. (See accompanying
-        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-      
    
-
    
-
    
-
    
-PrevUpHomeNext
-
    
-
-
diff --git a/doc/html/boost/hash_bool_1_3_11_11_2_2_2.html b/doc/html/boost/hash_bool_1_3_11_11_2_2_2.html
new file mode 100644
index 0000000000..d73050b8c8
--- /dev/null
+++ b/doc/html/boost/hash_bool_1_3_11_11_2_2_2.html
@@ -0,0 +1,77 @@
+
+
+
+
+Struct hash<bool>
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    
+
    
+
    
+PrevUpHomeNext
+
    
+
    
+
    
+
    
+
    Struct hash<bool>
    
+
    boost::hash<bool>
    
+
    
+
    Synopsis
    
+
    // In header: <boost/container_hash/hash.hpp>
+
+
+struct hash<bool> {
+  std::size_t operator()(bool) const;
+};
    
+
    
+
    Description
    
+
    std::size_t operator()(bool val) const;
    
+
    
++++
+
+
+
+
+
+
+
+
+
+
+
    



    Returns:
    		
+
    Unspecified in TR1, except that equal arguments yield the same result.
    
+
    hash_value(val) in Boost.
    
+
    Throws:
    Doesn't throw
    
+
    
+
    
+
+
+
+
    Copyright © 2005-2008 Daniel
+      James
    
+        Distributed under the Boost Software License, Version 1.0. (See accompanying
+        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+      
    
+
    
+
    
+
    
+PrevUpHomeNext
+
    
+
+
diff --git a/doc/html/boost/hash_bool_1_3_16_11_2_2_2.html b/doc/html/boost/hash_bool_1_3_16_11_2_2_2.html
deleted file mode 100644
index 279a75b1a1..0000000000
--- a/doc/html/boost/hash_bool_1_3_16_11_2_2_2.html
+++ /dev/null
@@ -1,77 +0,0 @@
-
-
-
-
-Struct hash<bool>
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    
-
    
-
    
-PrevUpHomeNext
-
    
-
    
-
    
-
    
-
    Struct hash<bool>
    
-
    boost::hash<bool>
    
-
    
-
    Synopsis
    
-
    // In header: <boost/functional/hash.hpp>
-
-
-struct hash<bool> {
-  std::size_t operator()(bool) const;
-};
    
-
    
-
    Description
    
-
    std::size_t operator()(bool val) const;
    
-
    
----
-
-
-
-
-
-
-
-
-
-
-
    



    Returns:
    		
-
    Unspecified in TR1, except that equal arguments yield the same result.
    
-
    hash_value(val) in Boost.
    
-
    Throws:
    Doesn't throw
    
-
    
-
    
-
-
-
-
    Copyright © 2005-2008 Daniel
-      James
    
-        Distributed under the Boost Software License, Version 1.0. (See accompanying
-        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-      
    
-
    
-
    
-
    
-PrevUpHomeNext
-
    
-
-
diff --git a/doc/html/boost/hash_char1_1_3_11_11_2_2_7.html b/doc/html/boost/hash_char1_1_3_11_11_2_2_7.html
new file mode 100644
index 0000000000..f80e0fa41a
--- /dev/null
+++ b/doc/html/boost/hash_char1_1_3_11_11_2_2_7.html
@@ -0,0 +1,77 @@
+
+
+
+
+Struct hash<char16_t>
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    
+
    
+
    
+PrevUpHomeNext
+
    
+
    
+
    
+
    
+
    Struct hash<char16_t>
    
+
    boost::hash<char16_t>
    
+
    
+
    Synopsis
    
+
    // In header: <boost/container_hash/hash.hpp>
+
+
+struct hash<char16_t> {
+  std::size_t operator()(char16_t) const;
+};
    
+
    
+
    Description
    
+
    std::size_t operator()(char16_t val) const;
    
+
    
++++
+
+
+
+
+
+
+
+
+
+
+
    



    Returns:
    		
+
    Unspecified in TR1, except that equal arguments yield the same result.
    
+
    hash_value(val) in Boost.
    
+
    Throws:
    Doesn't throw
    
+
    
+
    
+
+
+
+
    Copyright © 2005-2008 Daniel
+      James
    
+        Distributed under the Boost Software License, Version 1.0. (See accompanying
+        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+      
    
+
    
+
    
+
    
+PrevUpHomeNext
+
    
+
+
diff --git a/doc/html/boost/hash_char1_1_3_16_11_2_2_7.html b/doc/html/boost/hash_char1_1_3_16_11_2_2_7.html
deleted file mode 100644
index 95caa4d72e..0000000000
--- a/doc/html/boost/hash_char1_1_3_16_11_2_2_7.html
+++ /dev/null
@@ -1,77 +0,0 @@
-
-
-
-
-Struct hash<char16_t>
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    
-
    
-
    
-PrevUpHomeNext
-
    
-
    
-
    
-
    
-
    Struct hash<char16_t>
    
-
    boost::hash<char16_t>
    
-
    
-
    Synopsis
    
-
    // In header: <boost/functional/hash.hpp>
-
-
-struct hash<char16_t> {
-  std::size_t operator()(char16_t) const;
-};
    
-
    
-
    Description
    
-
    std::size_t operator()(char16_t val) const;
    
-
    
----
-
-
-
-
-
-
-
-
-
-
-
    



    Returns:
    		
-
    Unspecified in TR1, except that equal arguments yield the same result.
    
-
    hash_value(val) in Boost.
    
-
    Throws:
    Doesn't throw
    
-
    
-
    
-
-
-
-
    Copyright © 2005-2008 Daniel
-      James
    
-        Distributed under the Boost Software License, Version 1.0. (See accompanying
-        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-      
    
-
    
-
    
-
    
-PrevUpHomeNext
-
    
-
-
diff --git a/doc/html/boost/hash_char3_1_3_11_11_2_2_8.html b/doc/html/boost/hash_char3_1_3_11_11_2_2_8.html
new file mode 100644
index 0000000000..7532d76a6b
--- /dev/null
+++ b/doc/html/boost/hash_char3_1_3_11_11_2_2_8.html
@@ -0,0 +1,77 @@
+
+
+
+
+Struct hash<char32_t>
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    
+
    
+
    
+PrevUpHomeNext
+
    
+
    
+
    
+
    
+
    Struct hash<char32_t>
    
+
    boost::hash<char32_t>
    
+
    
+
    Synopsis
    
+
    // In header: <boost/container_hash/hash.hpp>
+
+
+struct hash<char32_t> {
+  std::size_t operator()(char32_t) const;
+};
    
+
    
+
    Description
    
+
    std::size_t operator()(char32_t val) const;
    
+
    
++++
+
+
+
+
+
+
+
+
+
+
+
    



    Returns:
    		
+
    Unspecified in TR1, except that equal arguments yield the same result.
    
+
    hash_value(val) in Boost.
    
+
    Throws:
    Doesn't throw
    
+
    
+
    
+
+
+
+
    Copyright © 2005-2008 Daniel
+      James
    
+        Distributed under the Boost Software License, Version 1.0. (See accompanying
+        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+      
    
+
    
+
    
+
    
+PrevUpHomeNext
+
    
+
+
diff --git a/doc/html/boost/hash_char3_1_3_16_11_2_2_8.html b/doc/html/boost/hash_char3_1_3_16_11_2_2_8.html
deleted file mode 100644
index e99107ad55..0000000000
--- a/doc/html/boost/hash_char3_1_3_16_11_2_2_8.html
+++ /dev/null
@@ -1,77 +0,0 @@
-
-
-
-
-Struct hash<char32_t>
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    
-
    
-
    
-PrevUpHomeNext
-
    
-
    
-
    
-
    
-
    Struct hash<char32_t>
    
-
    boost::hash<char32_t>
    
-
    
-
    Synopsis
    
-
    // In header: <boost/functional/hash.hpp>
-
-
-struct hash<char32_t> {
-  std::size_t operator()(char32_t) const;
-};
    
-
    
-
    Description
    
-
    std::size_t operator()(char32_t val) const;
    
-
    
----
-
-
-
-
-
-
-
-
-
-
-
    



    Returns:
    		
-
    Unspecified in TR1, except that equal arguments yield the same result.
    
-
    hash_value(val) in Boost.
    
-
    Throws:
    Doesn't throw
    
-
    
-
    
-
-
-
-
    Copyright © 2005-2008 Daniel
-      James
    
-        Distributed under the Boost Software License, Version 1.0. (See accompanying
-        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-      
    
-
    
-
    
-
    
-PrevUpHomeNext
-
    
-
-
diff --git a/doc/html/boost/hash_char_1_3_11_11_2_2_3.html b/doc/html/boost/hash_char_1_3_11_11_2_2_3.html
new file mode 100644
index 0000000000..a42fcf71ee
--- /dev/null
+++ b/doc/html/boost/hash_char_1_3_11_11_2_2_3.html
@@ -0,0 +1,77 @@
+
+
+
+
+Struct hash<char>
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    
+
    
+
    
+PrevUpHomeNext
+
    
+
    
+
    
+
    
+
    Struct hash<char>
    
+
    boost::hash<char>
    
+
    
+
    Synopsis
    
+
    // In header: <boost/container_hash/hash.hpp>
+
+
+struct hash<char> {
+  std::size_t operator()(char) const;
+};
    
+
    
+
    Description
    
+
    std::size_t operator()(char val) const;
    
+
    
++++
+
+
+
+
+
+
+
+
+
+
+
    



    Returns:
    		
+
    Unspecified in TR1, except that equal arguments yield the same result.
    
+
    hash_value(val) in Boost.
    
+
    Throws:
    Doesn't throw
    
+
    
+
    
+
+
+
+
    Copyright © 2005-2008 Daniel
+      James
    
+        Distributed under the Boost Software License, Version 1.0. (See accompanying
+        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+      
    
+
    
+
    
+
    
+PrevUpHomeNext
+
    
+
+
diff --git a/doc/html/boost/hash_char_1_3_16_11_2_2_3.html b/doc/html/boost/hash_char_1_3_16_11_2_2_3.html
deleted file mode 100644
index 5156865bd9..0000000000
--- a/doc/html/boost/hash_char_1_3_16_11_2_2_3.html
+++ /dev/null
@@ -1,77 +0,0 @@
-
-
-
-
-Struct hash<char>
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    
-
    
-
    
-PrevUpHomeNext
-
    
-
    
-
    
-
    
-
    Struct hash<char>
    
-
    boost::hash<char>
    
-
    
-
    Synopsis
    
-
    // In header: <boost/functional/hash.hpp>
-
-
-struct hash<char> {
-  std::size_t operator()(char) const;
-};
    
-
    
-
    Description
    
-
    std::size_t operator()(char val) const;
    
-
    
----
-
-
-
-
-
-
-
-
-
-
-
    



    Returns:
    		
-
    Unspecified in TR1, except that equal arguments yield the same result.
    
-
    hash_value(val) in Boost.
    
-
    Throws:
    Doesn't throw
    
-
    
-
    
-
-
-
-
    Copyright © 2005-2008 Daniel
-      James
    
-        Distributed under the Boost Software License, Version 1.0. (See accompanying
-        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-      
    
-
    
-
    
-
    
-PrevUpHomeNext
-
    
-
-
diff --git a/doc/html/boost/hash_doub_1_3_11_11_2_2_18.html b/doc/html/boost/hash_doub_1_3_11_11_2_2_18.html
new file mode 100644
index 0000000000..e2275098b1
--- /dev/null
+++ b/doc/html/boost/hash_doub_1_3_11_11_2_2_18.html
@@ -0,0 +1,77 @@
+
+
+
+
+Struct hash<double>
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    
+
    
+
    
+PrevUpHomeNext
+
    
+
    
+
    
+
    
+
    Struct hash<double>
    
+
    boost::hash<double>
    
+
    
+
    Synopsis
    
+
    // In header: <boost/container_hash/hash.hpp>
+
+
+struct hash<double> {
+  std::size_t operator()(double) const;
+};
    
+
    
+
    Description
    
+
    std::size_t operator()(double val) const;
    
+
    
++++
+
+
+
+
+
+
+
+
+
+
+
    



    Returns:
    		
+
    Unspecified in TR1, except that equal arguments yield the same result.
    
+
    hash_value(val) in Boost.
    
+
    Throws:
    Doesn't throw
    
+
    
+
    
+
+
+
+
    Copyright © 2005-2008 Daniel
+      James
    
+        Distributed under the Boost Software License, Version 1.0. (See accompanying
+        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+      
    
+
    
+
    
+
    
+PrevUpHomeNext
+
    
+
+
diff --git a/doc/html/boost/hash_doub_1_3_16_11_2_2_18.html b/doc/html/boost/hash_doub_1_3_16_11_2_2_18.html
deleted file mode 100644
index 18e21058a2..0000000000
--- a/doc/html/boost/hash_doub_1_3_16_11_2_2_18.html
+++ /dev/null
@@ -1,77 +0,0 @@
-
-
-
-
-Struct hash<double>
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    
-
    
-
    
-PrevUpHomeNext
-
    
-
    
-
    
-
    
-
    Struct hash<double>
    
-
    boost::hash<double>
    
-
    
-
    Synopsis
    
-
    // In header: <boost/functional/hash.hpp>
-
-
-struct hash<double> {
-  std::size_t operator()(double) const;
-};
    
-
    
-
    Description
    
-
    std::size_t operator()(double val) const;
    
-
    
----
-
-
-
-
-
-
-
-
-
-
-
    



    Returns:
    		
-
    Unspecified in TR1, except that equal arguments yield the same result.
    
-
    hash_value(val) in Boost.
    
-
    Throws:
    Doesn't throw
    
-
    
-
    
-
-
-
-
    Copyright © 2005-2008 Daniel
-      James
    
-        Distributed under the Boost Software License, Version 1.0. (See accompanying
-        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-      
    
-
    
-
    
-
    
-PrevUpHomeNext
-
    
-
-
diff --git a/doc/html/boost/hash_floa_1_3_11_11_2_2_17.html b/doc/html/boost/hash_floa_1_3_11_11_2_2_17.html
new file mode 100644
index 0000000000..0dc35731f1
--- /dev/null
+++ b/doc/html/boost/hash_floa_1_3_11_11_2_2_17.html
@@ -0,0 +1,77 @@
+
+
+
+
+Struct hash<float>
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    
+
    
+
    
+PrevUpHomeNext
+
    
+
    
+
    
+
    
+
    Struct hash<float>
    
+
    boost::hash<float>
    
+
    
+
    Synopsis
    
+
    // In header: <boost/container_hash/hash.hpp>
+
+
+struct hash<float> {
+  std::size_t operator()(float) const;
+};
    
+
    
+
    Description
    
+
    std::size_t operator()(float val) const;
    
+
    
++++
+
+
+
+
+
+
+
+
+
+
+
    



    Returns:
    		
+
    Unspecified in TR1, except that equal arguments yield the same result.
    
+
    hash_value(val) in Boost.
    
+
    Throws:
    Doesn't throw
    
+
    
+
    
+
+
+
+
    Copyright © 2005-2008 Daniel
+      James
    
+        Distributed under the Boost Software License, Version 1.0. (See accompanying
+        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+      
    
+
    
+
    
+
    
+PrevUpHomeNext
+
    
+
+
diff --git a/doc/html/boost/hash_floa_1_3_16_11_2_2_17.html b/doc/html/boost/hash_floa_1_3_16_11_2_2_17.html
deleted file mode 100644
index 9333cc31cd..0000000000
--- a/doc/html/boost/hash_floa_1_3_16_11_2_2_17.html
+++ /dev/null
@@ -1,77 +0,0 @@
-
-
-
-
-Struct hash<float>
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    
-
    
-
    
-PrevUpHomeNext
-
    
-
    
-
    
-
    
-
    Struct hash<float>
    
-
    boost::hash<float>
    
-
    
-
    Synopsis
    
-
    // In header: <boost/functional/hash.hpp>
-
-
-struct hash<float> {
-  std::size_t operator()(float) const;
-};
    
-
    
-
    Description
    
-
    std::size_t operator()(float val) const;
    
-
    
----
-
-
-
-
-
-
-
-
-
-
-
    



    Returns:
    		
-
    Unspecified in TR1, except that equal arguments yield the same result.
    
-
    hash_value(val) in Boost.
    
-
    Throws:
    Doesn't throw
    
-
    
-
    
-
-
-
-
    Copyright © 2005-2008 Daniel
-      James
    
-        Distributed under the Boost Software License, Version 1.0. (See accompanying
-        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-      
    
-
    
-
    
-
    
-PrevUpHomeNext
-
    
-
-
diff --git a/doc/html/boost/hash_int_1_3_11_11_2_2_11.html b/doc/html/boost/hash_int_1_3_11_11_2_2_11.html
new file mode 100644
index 0000000000..2c9eec8f35
--- /dev/null
+++ b/doc/html/boost/hash_int_1_3_11_11_2_2_11.html
@@ -0,0 +1,77 @@
+
+
+
+
+Struct hash<int>
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    
+
    
+
    
+PrevUpHomeNext
+
    
+
    
+
    
+
    
+
    Struct hash<int>
    
+
    boost::hash<int>
    
+
    
+
    Synopsis
    
+
    // In header: <boost/container_hash/hash.hpp>
+
+
+struct hash<int> {
+  std::size_t operator()(int) const;
+};
    
+
    
+
    Description
    
+
    std::size_t operator()(int val) const;
    
+
    
++++
+
+
+
+
+
+
+
+
+
+
+
    



    Returns:
    		
+
    Unspecified in TR1, except that equal arguments yield the same result.
    
+
    hash_value(val) in Boost.
    
+
    Throws:
    Doesn't throw
    
+
    
+
    
+
+
+
+
    Copyright © 2005-2008 Daniel
+      James
    
+        Distributed under the Boost Software License, Version 1.0. (See accompanying
+        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+      
    
+
    
+
    
+
    
+PrevUpHomeNext
+
    
+
+
diff --git a/doc/html/boost/hash_int_1_3_16_11_2_2_11.html b/doc/html/boost/hash_int_1_3_16_11_2_2_11.html
deleted file mode 100644
index 96f3352160..0000000000
--- a/doc/html/boost/hash_int_1_3_16_11_2_2_11.html
+++ /dev/null
@@ -1,77 +0,0 @@
-
-
-
-
-Struct hash<int>
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    
-
    
-
    
-PrevUpHomeNext
-
    
-
    
-
    
-
    
-
    Struct hash<int>
    
-
    boost::hash<int>
    
-
    
-
    Synopsis
    
-
    // In header: <boost/functional/hash.hpp>
-
-
-struct hash<int> {
-  std::size_t operator()(int) const;
-};
    
-
    
-
    Description
    
-
    std::size_t operator()(int val) const;
    
-
    
----
-
-
-
-
-
-
-
-
-
-
-
    



    Returns:
    		
-
    Unspecified in TR1, except that equal arguments yield the same result.
    
-
    hash_value(val) in Boost.
    
-
    Throws:
    Doesn't throw
    
-
    
-
    
-
-
-
-
    Copyright © 2005-2008 Daniel
-      James
    
-        Distributed under the Boost Software License, Version 1.0. (See accompanying
-        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-      
    
-
    
-
    
-
    
-PrevUpHomeNext
-
    
-
-
diff --git a/doc/html/boost/hash_long_1_3_11_11_2_2_13.html b/doc/html/boost/hash_long_1_3_11_11_2_2_13.html
new file mode 100644
index 0000000000..fe3802c86e
--- /dev/null
+++ b/doc/html/boost/hash_long_1_3_11_11_2_2_13.html
@@ -0,0 +1,77 @@
+
+
+
+
+Struct hash<long>
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    
+
    
+
    
+PrevUpHomeNext
+
    
+
    
+
    
+
    
+
    Struct hash<long>
    
+
    boost::hash<long>
    
+
    
+
    Synopsis
    
+
    // In header: <boost/container_hash/hash.hpp>
+
+
+struct hash<long> {
+  std::size_t operator()(long) const;
+};
    
+
    
+
    Description
    
+
    std::size_t operator()(long val) const;
    
+
    
++++
+
+
+
+
+
+
+
+
+
+
+
    



    Returns:
    		
+
    Unspecified in TR1, except that equal arguments yield the same result.
    
+
    hash_value(val) in Boost.
    
+
    Throws:
    Doesn't throw
    
+
    
+
    
+
+
+
+
    Copyright © 2005-2008 Daniel
+      James
    
+        Distributed under the Boost Software License, Version 1.0. (See accompanying
+        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+      
    
+
    
+
    
+
    
+PrevUpHomeNext
+
    
+
+
diff --git a/doc/html/boost/hash_long_1_3_11_11_2_2_15.html b/doc/html/boost/hash_long_1_3_11_11_2_2_15.html
new file mode 100644
index 0000000000..a4852aae12
--- /dev/null
+++ b/doc/html/boost/hash_long_1_3_11_11_2_2_15.html
@@ -0,0 +1,77 @@
+
+
+
+
+Struct hash<long long>
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    
+
    
+
    
+PrevUpHomeNext
+
    
+
    
+
    
+
    
+
    Struct hash<long long>
    
+
    boost::hash<long long>
    
+
    
+
    Synopsis
    
+
    // In header: <boost/container_hash/hash.hpp>
+
+
+struct hash<long long> {
+  std::size_t operator()(long long) const;
+};
    
+
    
+
    Description
    
+
    std::size_t operator()(long long val) const;
    
+
    
++++
+
+
+
+
+
+
+
+
+
+
+
    



    Returns:
    		
+
    Unspecified in TR1, except that equal arguments yield the same result.
    
+
    hash_value(val) in Boost.
    
+
    Throws:
    Doesn't throw
    
+
    
+
    
+
+
+
+
    Copyright © 2005-2008 Daniel
+      James
    
+        Distributed under the Boost Software License, Version 1.0. (See accompanying
+        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+      
    
+
    
+
    
+
    
+PrevUpHomeNext
+
    
+
+
diff --git a/doc/html/boost/hash_long_1_3_11_11_2_2_19.html b/doc/html/boost/hash_long_1_3_11_11_2_2_19.html
new file mode 100644
index 0000000000..bba4e2631c
--- /dev/null
+++ b/doc/html/boost/hash_long_1_3_11_11_2_2_19.html
@@ -0,0 +1,77 @@
+
+
+
+
+Struct hash<long double>
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    
+
    
+
    
+PrevUpHomeNext
+
    
+
    
+
    
+
    
+
    Struct hash<long double>
    
+
    boost::hash<long double>
    
+
    
+
    Synopsis
    
+
    // In header: <boost/container_hash/hash.hpp>
+
+
+struct hash<long double> {
+  std::size_t operator()(long double) const;
+};
    
+
    
+
    Description
    
+
    std::size_t operator()(long double val) const;
    
+
    
++++
+
+
+
+
+
+
+
+
+
+
+
    



    Returns:
    		
+
    Unspecified in TR1, except that equal arguments yield the same result.
    
+
    hash_value(val) in Boost.
    
+
    Throws:
    Doesn't throw
    
+
    
+
    
+
+
+
+
    Copyright © 2005-2008 Daniel
+      James
    
+        Distributed under the Boost Software License, Version 1.0. (See accompanying
+        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+      
    
+
    
+
    
+
    
+PrevUpHomeNext
+
    
+
+
diff --git a/doc/html/boost/hash_long_1_3_16_11_2_2_13.html b/doc/html/boost/hash_long_1_3_16_11_2_2_13.html
deleted file mode 100644
index 35b568c497..0000000000
--- a/doc/html/boost/hash_long_1_3_16_11_2_2_13.html
+++ /dev/null
@@ -1,77 +0,0 @@
-
-
-
-
-Struct hash<long>
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    
-
    
-
    
-PrevUpHomeNext
-
    
-
    
-
    
-
    
-
    Struct hash<long>
    
-
    boost::hash<long>
    
-
    
-
    Synopsis
    
-
    // In header: <boost/functional/hash.hpp>
-
-
-struct hash<long> {
-  std::size_t operator()(long) const;
-};
    
-
    
-
    Description
    
-
    std::size_t operator()(long val) const;
    
-
    
----
-
-
-
-
-
-
-
-
-
-
-
    



    Returns:
    		
-
    Unspecified in TR1, except that equal arguments yield the same result.
    
-
    hash_value(val) in Boost.
    
-
    Throws:
    Doesn't throw
    
-
    
-
    
-
-
-
-
    Copyright © 2005-2008 Daniel
-      James
    
-        Distributed under the Boost Software License, Version 1.0. (See accompanying
-        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-      
    
-
    
-
    
-
    
-PrevUpHomeNext
-
    
-
-
diff --git a/doc/html/boost/hash_long_1_3_16_11_2_2_15.html b/doc/html/boost/hash_long_1_3_16_11_2_2_15.html
deleted file mode 100644
index b738e9588a..0000000000
--- a/doc/html/boost/hash_long_1_3_16_11_2_2_15.html
+++ /dev/null
@@ -1,77 +0,0 @@
-
-
-
-
-Struct hash<long long>
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    
-
    
-
    
-PrevUpHomeNext
-
    
-
    
-
    
-
    
-
    Struct hash<long long>
    
-
    boost::hash<long long>
    
-
    
-
    Synopsis
    
-
    // In header: <boost/functional/hash.hpp>
-
-
-struct hash<long long> {
-  std::size_t operator()(long long) const;
-};
    
-
    
-
    Description
    
-
    std::size_t operator()(long long val) const;
    
-
    
----
-
-
-
-
-
-
-
-
-
-
-
    



    Returns:
    		
-
    Unspecified in TR1, except that equal arguments yield the same result.
    
-
    hash_value(val) in Boost.
    
-
    Throws:
    Doesn't throw
    
-
    
-
    
-
-
-
-
    Copyright © 2005-2008 Daniel
-      James
    
-        Distributed under the Boost Software License, Version 1.0. (See accompanying
-        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-      
    
-
    
-
    
-
    
-PrevUpHomeNext
-
    
-
-
diff --git a/doc/html/boost/hash_long_1_3_16_11_2_2_19.html b/doc/html/boost/hash_long_1_3_16_11_2_2_19.html
deleted file mode 100644
index c8d21bb1a5..0000000000
--- a/doc/html/boost/hash_long_1_3_16_11_2_2_19.html
+++ /dev/null
@@ -1,77 +0,0 @@
-
-
-
-
-Struct hash<long double>
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    
-
    
-
    
-PrevUpHomeNext
-
    
-
    
-
    
-
    
-
    Struct hash<long double>
    
-
    boost::hash<long double>
    
-
    
-
    Synopsis
    
-
    // In header: <boost/functional/hash.hpp>
-
-
-struct hash<long double> {
-  std::size_t operator()(long double) const;
-};
    
-
    
-
    Description
    
-
    std::size_t operator()(long double val) const;
    
-
    
----
-
-
-
-
-
-
-
-
-
-
-
    



    Returns:
    		
-
    Unspecified in TR1, except that equal arguments yield the same result.
    
-
    hash_value(val) in Boost.
    
-
    Throws:
    Doesn't throw
    
-
    
-
    
-
-
-
-
    Copyright © 2005-2008 Daniel
-      James
    
-        Distributed under the Boost Software License, Version 1.0. (See accompanying
-        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-      
    
-
    
-
    
-
    
-PrevUpHomeNext
-
    
-
-
diff --git a/doc/html/boost/hash_short_1_3_11_11_2_2_9.html b/doc/html/boost/hash_short_1_3_11_11_2_2_9.html
new file mode 100644
index 0000000000..a4129e6e4b
--- /dev/null
+++ b/doc/html/boost/hash_short_1_3_11_11_2_2_9.html
@@ -0,0 +1,77 @@
+
+
+
+
+Struct hash<short>
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    
+
    
+
    
+PrevUpHomeNext
+
    
+
    
+
    
+
    
+
    Struct hash<short>
    
+
    boost::hash<short>
    
+
    
+
    Synopsis
    
+
    // In header: <boost/container_hash/hash.hpp>
+
+
+struct hash<short> {
+  std::size_t operator()(short) const;
+};
    
+
    
+
    Description
    
+
    std::size_t operator()(short val) const;
    
+
    
++++
+
+
+
+
+
+
+
+
+
+
+
    



    Returns:
    		
+
    Unspecified in TR1, except that equal arguments yield the same result.
    
+
    hash_value(val) in Boost.
    
+
    Throws:
    Doesn't throw
    
+
    
+
    
+
+
+
+
    Copyright © 2005-2008 Daniel
+      James
    
+        Distributed under the Boost Software License, Version 1.0. (See accompanying
+        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+      
    
+
    
+
    
+
    
+PrevUpHomeNext
+
    
+
+
diff --git a/doc/html/boost/hash_short_1_3_16_11_2_2_9.html b/doc/html/boost/hash_short_1_3_16_11_2_2_9.html
deleted file mode 100644
index fb5b5a6916..0000000000
--- a/doc/html/boost/hash_short_1_3_16_11_2_2_9.html
+++ /dev/null
@@ -1,77 +0,0 @@
-
-
-
-
-Struct hash<short>
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    
-
    
-
    
-PrevUpHomeNext
-
    
-
    
-
    
-
    
-
    Struct hash<short>
    
-
    boost::hash<short>
    
-
    
-
    Synopsis
    
-
    // In header: <boost/functional/hash.hpp>
-
-
-struct hash<short> {
-  std::size_t operator()(short) const;
-};
    
-
    
-
    Description
    
-
    std::size_t operator()(short val) const;
    
-
    
----
-
-
-
-
-
-
-
-
-
-
-
    



    Returns:
    		
-
    Unspecified in TR1, except that equal arguments yield the same result.
    
-
    hash_value(val) in Boost.
    
-
    Throws:
    Doesn't throw
    
-
    
-
    
-
-
-
-
    Copyright © 2005-2008 Daniel
-      James
    
-        Distributed under the Boost Software License, Version 1.0. (See accompanying
-        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-      
    
-
    
-
    
-
    
-PrevUpHomeNext
-
    
-
-
diff --git a/doc/html/boost/hash_signe_1_3_11_11_2_2_4.html b/doc/html/boost/hash_signe_1_3_11_11_2_2_4.html
new file mode 100644
index 0000000000..478b147cc0
--- /dev/null
+++ b/doc/html/boost/hash_signe_1_3_11_11_2_2_4.html
@@ -0,0 +1,77 @@
+
+
+
+
+Struct hash<signed char>
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    
+
    
+
    
+PrevUpHomeNext
+
    
+
    
+
    
+
    
+
    Struct hash<signed char>
    
+
    boost::hash<signed char>
    
+
    
+
    Synopsis
    
+
    // In header: <boost/container_hash/hash.hpp>
+
+
+struct hash<signed char> {
+  std::size_t operator()(signed char) const;
+};
    
+
    
+
    Description
    
+
    std::size_t operator()(signed char val) const;
    
+
    
++++
+
+
+
+
+
+
+
+
+
+
+
    



    Returns:
    		
+
    Unspecified in TR1, except that equal arguments yield the same result.
    
+
    hash_value(val) in Boost.
    
+
    Throws:
    Doesn't throw
    
+
    
+
    
+
+
+
+
    Copyright © 2005-2008 Daniel
+      James
    
+        Distributed under the Boost Software License, Version 1.0. (See accompanying
+        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+      
    
+
    
+
    
+
    
+PrevUpHomeNext
+
    
+
+
diff --git a/doc/html/boost/hash_signe_1_3_16_11_2_2_4.html b/doc/html/boost/hash_signe_1_3_16_11_2_2_4.html
deleted file mode 100644
index bf148fbeb7..0000000000
--- a/doc/html/boost/hash_signe_1_3_16_11_2_2_4.html
+++ /dev/null
@@ -1,77 +0,0 @@
-
-
-
-
-Struct hash<signed char>
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    
-
    
-
    
-PrevUpHomeNext
-
    
-
    
-
    
-
    
-
    Struct hash<signed char>
    
-
    boost::hash<signed char>
    
-
    
-
    Synopsis
    
-
    // In header: <boost/functional/hash.hpp>
-
-
-struct hash<signed char> {
-  std::size_t operator()(signed char) const;
-};
    
-
    
-
    Description
    
-
    std::size_t operator()(signed char val) const;
    
-
    
----
-
-
-
-
-
-
-
-
-
-
-
    



    Returns:
    		
-
    Unspecified in TR1, except that equal arguments yield the same result.
    
-
    hash_value(val) in Boost.
    
-
    Throws:
    Doesn't throw
    
-
    
-
    
-
-
-
-
    Copyright © 2005-2008 Daniel
-      James
    
-        Distributed under the Boost Software License, Version 1.0. (See accompanying
-        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-      
    
-
    
-
    
-
    
-PrevUpHomeNext
-
    
-
-
diff --git a/doc/html/boost/hash_std__1_3_11_11_2_2_20.html b/doc/html/boost/hash_std__1_3_11_11_2_2_20.html
new file mode 100644
index 0000000000..5792f8c0ec
--- /dev/null
+++ b/doc/html/boost/hash_std__1_3_11_11_2_2_20.html
@@ -0,0 +1,77 @@
+
+
+
+
+Struct hash<std::string>
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    
+
    
+
    
+PrevUpHomeNext
+
    
+
    
+
    
+
    
+
    Struct hash<std::string>
    
+
    boost::hash<std::string>
    
+
    
+
    Synopsis
    
+
    // In header: <boost/container_hash/hash.hpp>
+
+
+struct hash<std::string> {
+  std::size_t operator()(std::string const&) const;
+};
    
+
    
+
    Description
    
+
    std::size_t operator()(std::string const& val) const;
    
+
    
++++
+
+
+
+
+
+
+
+
+
+
+
    



    Returns:
    		
+
    Unspecified in TR1, except that equal arguments yield the same result.
    
+
    hash_value(val) in Boost.
    
+
    Throws:
    Doesn't throw
    
+
    
+
    
+
+
+
+
    Copyright © 2005-2008 Daniel
+      James
    
+        Distributed under the Boost Software License, Version 1.0. (See accompanying
+        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+      
    
+
    
+
    
+
    
+PrevUpHomeNext
+
    
+
+
diff --git a/doc/html/boost/hash_std__1_3_11_11_2_2_21.html b/doc/html/boost/hash_std__1_3_11_11_2_2_21.html
new file mode 100644
index 0000000000..af785ab9e2
--- /dev/null
+++ b/doc/html/boost/hash_std__1_3_11_11_2_2_21.html
@@ -0,0 +1,77 @@
+
+
+
+
+Struct hash<std::wstring>
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    
+
    
+
    
+PrevUpHomeNext
+
    
+
    
+
    
+
    
+
    Struct hash<std::wstring>
    
+
    boost::hash<std::wstring>
    
+
    
+
    Synopsis
    
+
    // In header: <boost/container_hash/hash.hpp>
+
+
+struct hash<std::wstring> {
+  std::size_t operator()(std::wstring const&) const;
+};
    
+
    
+
    Description
    
+
    std::size_t operator()(std::wstring const& val) const;
    
+
    
++++
+
+
+
+
+
+
+
+
+
+
+
    



    Returns:
    		
+
    Unspecified in TR1, except that equal arguments yield the same result.
    
+
    hash_value(val) in Boost.
    
+
    Throws:
    Doesn't throw
    
+
    
+
    
+
+
+
+
    Copyright © 2005-2008 Daniel
+      James
    
+        Distributed under the Boost Software License, Version 1.0. (See accompanying
+        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+      
    
+
    
+
    
+
    
+PrevUpHomeNext
+
    
+
+
diff --git a/doc/html/boost/hash_std__1_3_11_11_2_2_22.html b/doc/html/boost/hash_std__1_3_11_11_2_2_22.html
new file mode 100644
index 0000000000..83aa6f4047
--- /dev/null
+++ b/doc/html/boost/hash_std__1_3_11_11_2_2_22.html
@@ -0,0 +1,77 @@
+
+
+
+
+Struct hash<std::u16string>
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    
+
    
+
    
+PrevUpHomeNext
+
    
+
    
+
    
+
    
+
    Struct hash<std::u16string>
    
+
    boost::hash<std::u16string>
    
+
    
+
    Synopsis
    
+
    // In header: <boost/container_hash/hash.hpp>
+
+
+struct hash<std::u16string> {
+  std::size_t operator()(std::u16string const&) const;
+};
    
+
    
+
    Description
    
+
    std::size_t operator()(std::u16string const& val) const;
    
+
    
++++
+
+
+
+
+
+
+
+
+
+
+
    



    Returns:
    		
+
    Unspecified in TR1, except that equal arguments yield the same result.
    
+
    hash_value(val) in Boost.
    
+
    Throws:
    Doesn't throw
    
+
    
+
    
+
+
+
+
    Copyright © 2005-2008 Daniel
+      James
    
+        Distributed under the Boost Software License, Version 1.0. (See accompanying
+        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+      
    
+
    
+
    
+
    
+PrevUpHomeNext
+
    
+
+
diff --git a/doc/html/boost/hash_std__1_3_11_11_2_2_23.html b/doc/html/boost/hash_std__1_3_11_11_2_2_23.html
new file mode 100644
index 0000000000..c164802a4e
--- /dev/null
+++ b/doc/html/boost/hash_std__1_3_11_11_2_2_23.html
@@ -0,0 +1,77 @@
+
+
+
+
+Struct hash<std::u32string>
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    
+
    
+
    
+PrevUpHomeNext
+
    
+
    
+
    
+
    
+
    Struct hash<std::u32string>
    
+
    boost::hash<std::u32string>
    
+
    
+
    Synopsis
    
+
    // In header: <boost/container_hash/hash.hpp>
+
+
+struct hash<std::u32string> {
+  std::size_t operator()(std::u32string const&) const;
+};
    
+
    
+
    Description
    
+
    std::size_t operator()(std::u32string const& val) const;
    
+
    
++++
+
+
+
+
+
+
+
+
+
+
+
    



    Returns:
    		
+
    Unspecified in TR1, except that equal arguments yield the same result.
    
+
    hash_value(val) in Boost.
    
+
    Throws:
    Doesn't throw
    
+
    
+
    
+
+
+
+
    Copyright © 2005-2008 Daniel
+      James
    
+        Distributed under the Boost Software License, Version 1.0. (See accompanying
+        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+      
    
+
    
+
    
+
    
+PrevUpHomeNext
+
    
+
+
diff --git a/doc/html/boost/hash_std__1_3_11_11_2_2_25.html b/doc/html/boost/hash_std__1_3_11_11_2_2_25.html
new file mode 100644
index 0000000000..8db12483a3
--- /dev/null
+++ b/doc/html/boost/hash_std__1_3_11_11_2_2_25.html
@@ -0,0 +1,74 @@
+
+
+
+
+Struct hash<std::type_index>
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    
+
    
+
    
+PrevUpHomeNext
+
    
+
    
+
    
+
    
+
    Struct hash<std::type_index>
    
+
    boost::hash<std::type_index>
    
+
    
+
    Synopsis
    
+
    // In header: <boost/container_hash/hash.hpp>
+
+
+struct hash<std::type_index> {
+  std::size_t operator()(std::type_index) const;
+};
    
+
    
+
    Description
    
+
    std::size_t operator()(std::type_index val) const;
    
+
    
++++
+
+
+
+
+
+
+
+
+
+
+
    



    Returns:
    val.hash_code()
    Throws:
    Doesn't throw
    
+
    
+
    
+
+
+
+
    Copyright © 2005-2008 Daniel
+      James
    
+        Distributed under the Boost Software License, Version 1.0. (See accompanying
+        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+      
    
+
    
+
    
+
    
+PrevUpHomeNext
+
    
+
+
diff --git a/doc/html/boost/hash_std__1_3_16_11_2_2_20.html b/doc/html/boost/hash_std__1_3_16_11_2_2_20.html
deleted file mode 100644
index e738eabe3a..0000000000
--- a/doc/html/boost/hash_std__1_3_16_11_2_2_20.html
+++ /dev/null
@@ -1,77 +0,0 @@
-
-
-
-
-Struct hash<std::string>
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    
-
    
-
    
-PrevUpHomeNext
-
    
-
    
-
    
-
    
-
    Struct hash<std::string>
    
-
    boost::hash<std::string>
    
-
    
-
    Synopsis
    
-
    // In header: <boost/functional/hash.hpp>
-
-
-struct hash<std::string> {
-  std::size_t operator()(std::string const&) const;
-};
    
-
    
-
    Description
    
-
    std::size_t operator()(std::string const& val) const;
    
-
    
----
-
-
-
-
-
-
-
-
-
-
-
    



    Returns:
    		
-
    Unspecified in TR1, except that equal arguments yield the same result.
    
-
    hash_value(val) in Boost.
    
-
    Throws:
    Doesn't throw
    
-
    
-
    
-
-
-
-
    Copyright © 2005-2008 Daniel
-      James
    
-        Distributed under the Boost Software License, Version 1.0. (See accompanying
-        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-      
    
-
    
-
    
-
    
-PrevUpHomeNext
-
    
-
-
diff --git a/doc/html/boost/hash_std__1_3_16_11_2_2_21.html b/doc/html/boost/hash_std__1_3_16_11_2_2_21.html
deleted file mode 100644
index 0eeb1b9fd8..0000000000
--- a/doc/html/boost/hash_std__1_3_16_11_2_2_21.html
+++ /dev/null
@@ -1,77 +0,0 @@
-
-
-
-
-Struct hash<std::wstring>
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    
-
    
-
    
-PrevUpHomeNext
-
    
-
    
-
    
-
    
-
    Struct hash<std::wstring>
    
-
    boost::hash<std::wstring>
    
-
    
-
    Synopsis
    
-
    // In header: <boost/functional/hash.hpp>
-
-
-struct hash<std::wstring> {
-  std::size_t operator()(std::wstring const&) const;
-};
    
-
    
-
    Description
    
-
    std::size_t operator()(std::wstring const& val) const;
    
-
    
----
-
-
-
-
-
-
-
-
-
-
-
    



    Returns:
    		
-
    Unspecified in TR1, except that equal arguments yield the same result.
    
-
    hash_value(val) in Boost.
    
-
    Throws:
    Doesn't throw
    
-
    
-
    
-
-
-
-
    Copyright © 2005-2008 Daniel
-      James
    
-        Distributed under the Boost Software License, Version 1.0. (See accompanying
-        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-      
    
-
    
-
    
-
    
-PrevUpHomeNext
-
    
-
-
diff --git a/doc/html/boost/hash_std__1_3_16_11_2_2_22.html b/doc/html/boost/hash_std__1_3_16_11_2_2_22.html
deleted file mode 100644
index 3a0a2eb277..0000000000
--- a/doc/html/boost/hash_std__1_3_16_11_2_2_22.html
+++ /dev/null
@@ -1,77 +0,0 @@
-
-
-
-
-Struct hash<std::u16string>
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    
-
    
-
    
-PrevUpHomeNext
-
    
-
    
-
    
-
    
-
    Struct hash<std::u16string>
    
-
    boost::hash<std::u16string>
    
-
    
-
    Synopsis
    
-
    // In header: <boost/functional/hash.hpp>
-
-
-struct hash<std::u16string> {
-  std::size_t operator()(std::u16string const&) const;
-};
    
-
    
-
    Description
    
-
    std::size_t operator()(std::u16string const& val) const;
    
-
    
----
-
-
-
-
-
-
-
-
-
-
-
    



    Returns:
    		
-
    Unspecified in TR1, except that equal arguments yield the same result.
    
-
    hash_value(val) in Boost.
    
-
    Throws:
    Doesn't throw
    
-
    
-
    
-
-
-
-
    Copyright © 2005-2008 Daniel
-      James
    
-        Distributed under the Boost Software License, Version 1.0. (See accompanying
-        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-      
    
-
    
-
    
-
    
-PrevUpHomeNext
-
    
-
-
diff --git a/doc/html/boost/hash_std__1_3_16_11_2_2_23.html b/doc/html/boost/hash_std__1_3_16_11_2_2_23.html
deleted file mode 100644
index b279f93bc0..0000000000
--- a/doc/html/boost/hash_std__1_3_16_11_2_2_23.html
+++ /dev/null
@@ -1,77 +0,0 @@
-
-
-
-
-Struct hash<std::u32string>
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    
-
    
-
    
-PrevUpHomeNext
-
    
-
    
-
    
-
    
-
    Struct hash<std::u32string>
    
-
    boost::hash<std::u32string>
    
-
    
-
    Synopsis
    
-
    // In header: <boost/functional/hash.hpp>
-
-
-struct hash<std::u32string> {
-  std::size_t operator()(std::u32string const&) const;
-};
    
-
    
-
    Description
    
-
    std::size_t operator()(std::u32string const& val) const;
    
-
    
----
-
-
-
-
-
-
-
-
-
-
-
    



    Returns:
    		
-
    Unspecified in TR1, except that equal arguments yield the same result.
    
-
    hash_value(val) in Boost.
    
-
    Throws:
    Doesn't throw
    
-
    
-
    
-
-
-
-
    Copyright © 2005-2008 Daniel
-      James
    
-        Distributed under the Boost Software License, Version 1.0. (See accompanying
-        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-      
    
-
    
-
    
-
    
-PrevUpHomeNext
-
    
-
-
diff --git a/doc/html/boost/hash_std__1_3_16_11_2_2_25.html b/doc/html/boost/hash_std__1_3_16_11_2_2_25.html
deleted file mode 100644
index 81173cffa2..0000000000
--- a/doc/html/boost/hash_std__1_3_16_11_2_2_25.html
+++ /dev/null
@@ -1,74 +0,0 @@
-
-
-
-
-Struct hash<std::type_index>
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    
-
    
-
    
-PrevUpHomeNext
-
    
-
    
-
    
-
    
-
    Struct hash<std::type_index>
    
-
    boost::hash<std::type_index>
    
-
    
-
    Synopsis
    
-
    // In header: <boost/functional/hash.hpp>
-
-
-struct hash<std::type_index> {
-  std::size_t operator()(std::type_index) const;
-};
    
-
    
-
    Description
    
-
    std::size_t operator()(std::type_index val) const;
    
-
    
----
-
-
-
-
-
-
-
-
-
-
-
    



    Returns:
    val.hash_code()
    Throws:
    Doesn't throw
    
-
    
-
    
-
-
-
-
    Copyright © 2005-2008 Daniel
-      James
    
-        Distributed under the Boost Software License, Version 1.0. (See accompanying
-        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-      
    
-
    
-
    
-
    
-PrevUpHomeNext
-
    
-
-
diff --git a/doc/html/boost/hash_unsi_1_3_11_11_2_2_10.html b/doc/html/boost/hash_unsi_1_3_11_11_2_2_10.html
new file mode 100644
index 0000000000..726b41c7b8
--- /dev/null
+++ b/doc/html/boost/hash_unsi_1_3_11_11_2_2_10.html
@@ -0,0 +1,77 @@
+
+
+
+
+Struct hash<unsigned short>
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    
+
    
+
    
+PrevUpHomeNext
+
    
+
    
+
    
+
    
+
    Struct hash<unsigned short>
    
+
    boost::hash<unsigned short>
    
+
    
+
    Synopsis
    
+
    // In header: <boost/container_hash/hash.hpp>
+
+
+struct hash<unsigned short> {
+  std::size_t operator()(unsigned short) const;
+};
    
+
    
+
    Description
    
+
    std::size_t operator()(unsigned short val) const;
    
+
    
++++
+
+
+
+
+
+
+
+
+
+
+
    



    Returns:
    		
+
    Unspecified in TR1, except that equal arguments yield the same result.
    
+
    hash_value(val) in Boost.
    
+
    Throws:
    Doesn't throw
    
+
    
+
    
+
+
+
+
    Copyright © 2005-2008 Daniel
+      James
    
+        Distributed under the Boost Software License, Version 1.0. (See accompanying
+        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+      
    
+
    
+
    
+
    
+PrevUpHomeNext
+
    
+
+
diff --git a/doc/html/boost/hash_unsi_1_3_11_11_2_2_12.html b/doc/html/boost/hash_unsi_1_3_11_11_2_2_12.html
new file mode 100644
index 0000000000..853d717647
--- /dev/null
+++ b/doc/html/boost/hash_unsi_1_3_11_11_2_2_12.html
@@ -0,0 +1,77 @@
+
+
+
+
+Struct hash<unsigned int>
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    
+
    
+
    
+PrevUpHomeNext
+
    
+
    
+
    
+
    
+
    Struct hash<unsigned int>
    
+
    boost::hash<unsigned int>
    
+
    
+
    Synopsis
    
+
    // In header: <boost/container_hash/hash.hpp>
+
+
+struct hash<unsigned int> {
+  std::size_t operator()(unsigned int) const;
+};
    
+
    
+
    Description
    
+
    std::size_t operator()(unsigned int val) const;
    
+
    
++++
+
+
+
+
+
+
+
+
+
+
+
    



    Returns:
    		
+
    Unspecified in TR1, except that equal arguments yield the same result.
    
+
    hash_value(val) in Boost.
    
+
    Throws:
    Doesn't throw
    
+
    
+
    
+
+
+
+
    Copyright © 2005-2008 Daniel
+      James
    
+        Distributed under the Boost Software License, Version 1.0. (See accompanying
+        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+      
    
+
    
+
    
+
    
+PrevUpHomeNext
+
    
+
+
diff --git a/doc/html/boost/hash_unsi_1_3_11_11_2_2_14.html b/doc/html/boost/hash_unsi_1_3_11_11_2_2_14.html
new file mode 100644
index 0000000000..73fc4c1475
--- /dev/null
+++ b/doc/html/boost/hash_unsi_1_3_11_11_2_2_14.html
@@ -0,0 +1,77 @@
+
+
+
+
+Struct hash<unsigned long>
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    
+
    
+
    
+PrevUpHomeNext
+
    
+
    
+
    
+
    
+
    Struct hash<unsigned long>
    
+
    boost::hash<unsigned long>
    
+
    
+
    Synopsis
    
+
    // In header: <boost/container_hash/hash.hpp>
+
+
+struct hash<unsigned long> {
+  std::size_t operator()(unsigned long) const;
+};
    
+
    
+
    Description
    
+
    std::size_t operator()(unsigned long val) const;
    
+
    
++++
+
+
+
+
+
+
+
+
+
+
+
    



    Returns:
    		
+
    Unspecified in TR1, except that equal arguments yield the same result.
    
+
    hash_value(val) in Boost.
    
+
    Throws:
    Doesn't throw
    
+
    
+
    
+
+
+
+
    Copyright © 2005-2008 Daniel
+      James
    
+        Distributed under the Boost Software License, Version 1.0. (See accompanying
+        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+      
    
+
    
+
    
+
    
+PrevUpHomeNext
+
    
+
+
diff --git a/doc/html/boost/hash_unsi_1_3_11_11_2_2_16.html b/doc/html/boost/hash_unsi_1_3_11_11_2_2_16.html
new file mode 100644
index 0000000000..8095b0a65d
--- /dev/null
+++ b/doc/html/boost/hash_unsi_1_3_11_11_2_2_16.html
@@ -0,0 +1,77 @@
+
+
+
+
+Struct hash<unsigned long long>
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    
+
    
+
    
+PrevUpHomeNext
+
    
+
    
+
    
+
    
+
    Struct hash<unsigned long long>
    
+
    boost::hash<unsigned long long>
    
+
    
+
    Synopsis
    
+
    // In header: <boost/container_hash/hash.hpp>
+
+
+struct hash<unsigned long long> {
+  std::size_t operator()(unsigned long long) const;
+};
    
+
    
+
    Description
    
+
    std::size_t operator()(unsigned long long val) const;
    
+
    
++++
+
+
+
+
+
+
+
+
+
+
+
    



    Returns:
    		
+
    Unspecified in TR1, except that equal arguments yield the same result.
    
+
    hash_value(val) in Boost.
    
+
    Throws:
    Doesn't throw
    
+
    
+
    
+
+
+
+
    Copyright © 2005-2008 Daniel
+      James
    
+        Distributed under the Boost Software License, Version 1.0. (See accompanying
+        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+      
    
+
    
+
    
+
    
+PrevUpHomeNext
+
    
+
+
diff --git a/doc/html/boost/hash_unsi_1_3_16_11_2_2_10.html b/doc/html/boost/hash_unsi_1_3_16_11_2_2_10.html
deleted file mode 100644
index d66d611c5d..0000000000
--- a/doc/html/boost/hash_unsi_1_3_16_11_2_2_10.html
+++ /dev/null
@@ -1,77 +0,0 @@
-
-
-
-
-Struct hash<unsigned short>
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    
-
    
-
    
-PrevUpHomeNext
-
    
-
    
-
    
-
    
-
    Struct hash<unsigned short>
    
-
    boost::hash<unsigned short>
    
-
    
-
    Synopsis
    
-
    // In header: <boost/functional/hash.hpp>
-
-
-struct hash<unsigned short> {
-  std::size_t operator()(unsigned short) const;
-};
    
-
    
-
    Description
    
-
    std::size_t operator()(unsigned short val) const;
    
-
    
----
-
-
-
-
-
-
-
-
-
-
-
    



    Returns:
    		
-
    Unspecified in TR1, except that equal arguments yield the same result.
    
-
    hash_value(val) in Boost.
    
-
    Throws:
    Doesn't throw
    
-
    
-
    
-
-
-
-
    Copyright © 2005-2008 Daniel
-      James
    
-        Distributed under the Boost Software License, Version 1.0. (See accompanying
-        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-      
    
-
    
-
    
-
    
-PrevUpHomeNext
-
    
-
-
diff --git a/doc/html/boost/hash_unsi_1_3_16_11_2_2_12.html b/doc/html/boost/hash_unsi_1_3_16_11_2_2_12.html
deleted file mode 100644
index c86144e280..0000000000
--- a/doc/html/boost/hash_unsi_1_3_16_11_2_2_12.html
+++ /dev/null
@@ -1,77 +0,0 @@
-
-
-
-
-Struct hash<unsigned int>
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    
-
    
-
    
-PrevUpHomeNext
-
    
-
    
-
    
-
    
-
    Struct hash<unsigned int>
    
-
    boost::hash<unsigned int>
    
-
    
-
    Synopsis
    
-
    // In header: <boost/functional/hash.hpp>
-
-
-struct hash<unsigned int> {
-  std::size_t operator()(unsigned int) const;
-};
    
-
    
-
    Description
    
-
    std::size_t operator()(unsigned int val) const;
    
-
    
----
-
-
-
-
-
-
-
-
-
-
-
    



    Returns:
    		
-
    Unspecified in TR1, except that equal arguments yield the same result.
    
-
    hash_value(val) in Boost.
    
-
    Throws:
    Doesn't throw
    
-
    
-
    
-
-
-
-
    Copyright © 2005-2008 Daniel
-      James
    
-        Distributed under the Boost Software License, Version 1.0. (See accompanying
-        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-      
    
-
    
-
    
-
    
-PrevUpHomeNext
-
    
-
-
diff --git a/doc/html/boost/hash_unsi_1_3_16_11_2_2_14.html b/doc/html/boost/hash_unsi_1_3_16_11_2_2_14.html
deleted file mode 100644
index a9c3fa00b4..0000000000
--- a/doc/html/boost/hash_unsi_1_3_16_11_2_2_14.html
+++ /dev/null
@@ -1,77 +0,0 @@
-
-
-
-
-Struct hash<unsigned long>
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    
-
    
-
    
-PrevUpHomeNext
-
    
-
    
-
    
-
    
-
    Struct hash<unsigned long>
    
-
    boost::hash<unsigned long>
    
-
    
-
    Synopsis
    
-
    // In header: <boost/functional/hash.hpp>
-
-
-struct hash<unsigned long> {
-  std::size_t operator()(unsigned long) const;
-};
    
-
    
-
    Description
    
-
    std::size_t operator()(unsigned long val) const;
    
-
    
----
-
-
-
-
-
-
-
-
-
-
-
    



    Returns:
    		
-
    Unspecified in TR1, except that equal arguments yield the same result.
    
-
    hash_value(val) in Boost.
    
-
    Throws:
    Doesn't throw
    
-
    
-
    
-
-
-
-
    Copyright © 2005-2008 Daniel
-      James
    
-        Distributed under the Boost Software License, Version 1.0. (See accompanying
-        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-      
    
-
    
-
    
-
    
-PrevUpHomeNext
-
    
-
-
diff --git a/doc/html/boost/hash_unsi_1_3_16_11_2_2_16.html b/doc/html/boost/hash_unsi_1_3_16_11_2_2_16.html
deleted file mode 100644
index ee9c94f8b8..0000000000
--- a/doc/html/boost/hash_unsi_1_3_16_11_2_2_16.html
+++ /dev/null
@@ -1,77 +0,0 @@
-
-
-
-
-Struct hash<unsigned long long>
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    
-
    
-
    
-PrevUpHomeNext
-
    
-
    
-
    
-
    
-
    Struct hash<unsigned long long>
    
-
    boost::hash<unsigned long long>
    
-
    
-
    Synopsis
    
-
    // In header: <boost/functional/hash.hpp>
-
-
-struct hash<unsigned long long> {
-  std::size_t operator()(unsigned long long) const;
-};
    
-
    
-
    Description
    
-
    std::size_t operator()(unsigned long long val) const;
    
-
    
----
-
-
-
-
-
-
-
-
-
-
-
    



    Returns:
    		
-
    Unspecified in TR1, except that equal arguments yield the same result.
    
-
    hash_value(val) in Boost.
    
-
    Throws:
    Doesn't throw
    
-
    
-
    
-
-
-
-
    Copyright © 2005-2008 Daniel
-      James
    
-        Distributed under the Boost Software License, Version 1.0. (See accompanying
-        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-      
    
-
    
-
    
-
    
-PrevUpHomeNext
-
    
-
-
diff --git a/doc/html/boost/hash_unsig_1_3_11_11_2_2_5.html b/doc/html/boost/hash_unsig_1_3_11_11_2_2_5.html
new file mode 100644
index 0000000000..de084a7b30
--- /dev/null
+++ b/doc/html/boost/hash_unsig_1_3_11_11_2_2_5.html
@@ -0,0 +1,77 @@
+
+
+
+
+Struct hash<unsigned char>
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    
+
    
+
    
+PrevUpHomeNext
+
    
+
    
+
    
+
    
+
    Struct hash<unsigned char>
    
+
    boost::hash<unsigned char>
    
+
    
+
    Synopsis
    
+
    // In header: <boost/container_hash/hash.hpp>
+
+
+struct hash<unsigned char> {
+  std::size_t operator()(unsigned char) const;
+};
    
+
    
+
    Description
    
+
    std::size_t operator()(unsigned char val) const;
    
+
    
++++
+
+
+
+
+
+
+
+
+
+
+
    



    Returns:
    		
+
    Unspecified in TR1, except that equal arguments yield the same result.
    
+
    hash_value(val) in Boost.
    
+
    Throws:
    Doesn't throw
    
+
    
+
    
+
+
+
+
    Copyright © 2005-2008 Daniel
+      James
    
+        Distributed under the Boost Software License, Version 1.0. (See accompanying
+        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+      
    
+
    
+
    
+
    
+PrevUpHomeNext
+
    
+
+
diff --git a/doc/html/boost/hash_unsig_1_3_16_11_2_2_5.html b/doc/html/boost/hash_unsig_1_3_16_11_2_2_5.html
deleted file mode 100644
index e2f35fcf5f..0000000000
--- a/doc/html/boost/hash_unsig_1_3_16_11_2_2_5.html
+++ /dev/null
@@ -1,77 +0,0 @@
-
-
-
-
-Struct hash<unsigned char>
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    
-
    
-
    
-PrevUpHomeNext
-
    
-
    
-
    
-
    
-
    Struct hash<unsigned char>
    
-
    boost::hash<unsigned char>
    
-
    
-
    Synopsis
    
-
    // In header: <boost/functional/hash.hpp>
-
-
-struct hash<unsigned char> {
-  std::size_t operator()(unsigned char) const;
-};
    
-
    
-
    Description
    
-
    std::size_t operator()(unsigned char val) const;
    
-
    
----
-
-
-
-
-
-
-
-
-
-
-
    



    Returns:
    		
-
    Unspecified in TR1, except that equal arguments yield the same result.
    
-
    hash_value(val) in Boost.
    
-
    Throws:
    Doesn't throw
    
-
    
-
    
-
-
-
-
    Copyright © 2005-2008 Daniel
-      James
    
-        Distributed under the Boost Software License, Version 1.0. (See accompanying
-        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-      
    
-
    
-
    
-
    
-PrevUpHomeNext
-
    
-
-
diff --git a/doc/html/boost/hash_wchar_1_3_11_11_2_2_6.html b/doc/html/boost/hash_wchar_1_3_11_11_2_2_6.html
new file mode 100644
index 0000000000..7dfbcd1b10
--- /dev/null
+++ b/doc/html/boost/hash_wchar_1_3_11_11_2_2_6.html
@@ -0,0 +1,77 @@
+
+
+
+
+Struct hash<wchar_t>
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    
+
    
+
    
+PrevUpHomeNext
+
    
+
    
+
    
+
    
+
    Struct hash<wchar_t>
    
+
    boost::hash<wchar_t>
    
+
    
+
    Synopsis
    
+
    // In header: <boost/container_hash/hash.hpp>
+
+
+struct hash<wchar_t> {
+  std::size_t operator()(wchar_t) const;
+};
    
+
    
+
    Description
    
+
    std::size_t operator()(wchar_t val) const;
    
+
    
++++
+
+
+
+
+
+
+
+
+
+
+
    



    Returns:
    		
+
    Unspecified in TR1, except that equal arguments yield the same result.
    
+
    hash_value(val) in Boost.
    
+
    Throws:
    Doesn't throw
    
+
    
+
    
+
+
+
+
    Copyright © 2005-2008 Daniel
+      James
    
+        Distributed under the Boost Software License, Version 1.0. (See accompanying
+        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+      
    
+
    
+
    
+
    
+PrevUpHomeNext
+
    
+
+
diff --git a/doc/html/boost/hash_wchar_1_3_16_11_2_2_6.html b/doc/html/boost/hash_wchar_1_3_16_11_2_2_6.html
deleted file mode 100644
index f74fefdcdf..0000000000
--- a/doc/html/boost/hash_wchar_1_3_16_11_2_2_6.html
+++ /dev/null
@@ -1,77 +0,0 @@
-
-
-
-
-Struct hash<wchar_t>
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    
-
    
-
    
-PrevUpHomeNext
-
    
-
    
-
    
-
    
-
    Struct hash<wchar_t>
    
-
    boost::hash<wchar_t>
    
-
    
-
    Synopsis
    
-
    // In header: <boost/functional/hash.hpp>
-
-
-struct hash<wchar_t> {
-  std::size_t operator()(wchar_t) const;
-};
    
-
    
-
    Description
    
-
    std::size_t operator()(wchar_t val) const;
    
-
    
----
-
-
-
-
-
-
-
-
-
-
-
    



    Returns:
    		
-
    Unspecified in TR1, except that equal arguments yield the same result.
    
-
    hash_value(val) in Boost.
    
-
    Throws:
    Doesn't throw
    
-
    
-
    
-
-
-
-
    Copyright © 2005-2008 Daniel
-      James
    
-        Distributed under the Boost Software License, Version 1.0. (See accompanying
-        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-      
    
-
    
-
    
-
    
-PrevUpHomeNext
-
    
-
-
diff --git a/doc/html/boost/heap/skew_heap.html b/doc/html/boost/heap/skew_heap.html
index c763e90eaf..626f07a471 100644
--- a/doc/html/boost/heap/skew_heap.html
+++ b/doc/html/boost/heap/skew_heap.html
@@ -8,7 +8,7 @@
 
 
 
-
+
 
 
 
@@ -51,8 +51,14 @@
   typedefmpl::if_c<is_mutable,typenameimplementation_defined::handle_type,void*>::typehandle_type;// member classes/structs/unions
-
-  structimplementation_defined{
+  template<typename T,typename A0 =boost::parameter::void_, 
+           typename A1 =boost::parameter::void_, 
+           typename A2 =boost::parameter::void_, 
+           typename A3 =boost::parameter::void_, 
+           typename A4 =boost::parameter::void_, 
+           typename A5 =boost::parameter::void_, 
+           typename A6 =boost::parameter::void_> 
+  structimplementation_defined{// typestypedefTvalue_type;typedefbase_maker::compare_argumentvalue_compare;      
@@ -69,49 +75,87 @@
     typedefunspecifiedreference;typedefunspecifiedhandle_type;};
+  template<typename T,typename A0 =boost::parameter::void_, 
+           typename A1 =boost::parameter::void_, 
+           typename A2 =boost::parameter::void_, 
+           typename A3 =boost::parameter::void_, 
+           typename A4 =boost::parameter::void_, 
+           typename A5 =boost::parameter::void_, 
+           typename A6 =boost::parameter::void_> 
+  structpush_handle{
+
+    // public static functions
+    statichandle_typepush(skew_heap*,const_reference);
+    template<class... Args> 
+      statichandle_typeemplace(skew_heap*,Args&&...);
+  };
+  template<typename T,typename A0 =boost::parameter::void_, 
+           typename A1 =boost::parameter::void_, 
+           typename A2 =boost::parameter::void_, 
+           typename A3 =boost::parameter::void_, 
+           typename A4 =boost::parameter::void_, 
+           typename A5 =boost::parameter::void_, 
+           typename A6 =boost::parameter::void_> 
+  structpush_void{
+
+    // public static functions
+    staticvoidpush(skew_heap*,const_reference);
+    template<class... Args>staticvoidemplace(skew_heap*,Args&&...);
+  };// construct/copy/destruct
-  explicitskew_heap(value_compareconst&=value_compare());
-  skew_heap(skew_heapconst&);
-  skew_heap(skew_heap&&);
-  skew_heap&operator=(skew_heapconst&);
-  skew_heap&operator=(skew_heap&&);
-  ~skew_heap(void);
+  explicitskew_heap(value_compareconst&=value_compare());
+  skew_heap(skew_heapconst&);
+  skew_heap(skew_heap&&);
+  skew_heap&operator=(skew_heapconst&);
+  skew_heap&operator=(skew_heap&&);
+  ~skew_heap(void);
 
-  // public member functions
-  mpl::if_c<is_mutable,handle_type,void>::typepush(value_typeconst&);
+  // public member functions
+  mpl::if_c<is_mutable,handle_type,void>::typepush(value_typeconst&);template<typename... Args> 
-    mpl::if_c<is_mutable,handle_type,void>::typeemplace(Args&&...);
-  boolempty(void)const;
-  size_typesize(void)const;
-  size_typemax_size(void)const;
-  voidclear(void);
-  allocator_typeget_allocator(void)const;
-  voidswap(skew_heap&);
-  const_referencetop(void)const;
-  voidpop(void);
-  iteratorbegin(void)const;
-  iteratorend(void)const;
-  ordered_iteratorordered_begin(void)const;
-  ordered_iteratorordered_end(void)const;
-  voidmerge(skew_heap&);
-  value_compareconst&value_comp(void)const;
-  template<typename HeapType>booloperator<(HeapTypeconst&)const;
-  template<typename HeapType>booloperator>(HeapTypeconst&)const;
-  template<typename HeapType>booloperator>=(HeapTypeconst&)const;
-  template<typename HeapType>booloperator<=(HeapTypeconst&)const;
-  template<typename HeapType>booloperator==(HeapTypeconst&)const;
-  template<typename HeapType>booloperator!=(HeapTypeconst&)const;
-  voiderase(handle_type);
-  voidupdate(handle_type,const_reference);
-  voidupdate(handle_type);
-  voidincrease(handle_type,const_reference);
-  voidincrease(handle_type);
-  voiddecrease(handle_type,const_reference);
-  voiddecrease(handle_type);
+    mpl::if_c<is_mutable,handle_type,void>::typeemplace(Args&&...);
+  boolempty(void)const;
+  size_typesize(void)const;
+  size_typemax_size(void)const;
+  voidclear(void);
+  allocator_typeget_allocator(void)const;
+  voidswap(skew_heap&);
+  const_referencetop(void)const;
+  voidpop(void);
+  iteratorbegin(void)const;
+  iteratorend(void)const;
+  ordered_iteratorordered_begin(void)const;
+  ordered_iteratorordered_end(void)const;
+  voidmerge(skew_heap&);
+  value_compareconst&value_comp(void)const;
+  template<typename HeapType>booloperator<(HeapTypeconst&)const;
+  template<typename HeapType>booloperator>(HeapTypeconst&)const;
+  template<typename HeapType>booloperator>=(HeapTypeconst&)const;
+  template<typename HeapType>booloperator<=(HeapTypeconst&)const;
+  template<typename HeapType>booloperator==(HeapTypeconst&)const;
+  template<typename HeapType>booloperator!=(HeapTypeconst&)const;
+  voiderase(handle_type);
+  voidupdate(handle_type,const_reference);
+  voidupdate(handle_type);
+  voidincrease(handle_type,const_reference);
+  voidincrease(handle_type);
+  voiddecrease(handle_type,const_reference);
+  voiddecrease(handle_type);
 
-  // public static functions
-  statichandle_types_handle_from_iterator(iteratorconst&);
+  // public static functions
+  statichandle_types_handle_from_iterator(iteratorconst&);
+
+  // private member functions
+  node_pointerpush_internal(const_reference);
+  template<class... Args>node_pointeremplace_internal(Args&&...);
+  voidunlink_node(node_pointer);
+  voidclone_tree(skew_heapconst&);
+  voidmerge_node(node_pointer);
+  node_pointermerge_nodes(node_pointer,node_pointer,node_pointer);
+  node_pointermerge_children(node_pointer);
+  node_pointermerge_nodes_recursive(node_pointer,node_pointer,node_pointer);
+  voidsanity_check(void);// public data membersstaticconstboolconstant_time_size;
@@ -154,181 +198,181 @@
        construct/copy/destruct
      
 
    1. 
-
      explicit skew_heap(value_compare const & cmp = value_compare());
      
+
      explicit skew_heap(value_compare const & cmp = value_compare());
      
 
      Effects: constructs an empty priority queue.
      
 
      Complexity: Constant. 
      
 
      2. 
 
    2. 
-
      skew_heap(skew_heap const & rhs);
      
+
      skew_heap(skew_heap const & rhs);
      
 
      Effects: copy-constructs priority queue from rhs.
      
 
      Complexity: Linear. 
      
 
      3. 
 
    3. 
-
      skew_heap(skew_heap && rhs);
      
+
      skew_heap(skew_heap && rhs);
      
 
      Effects: C++11-style move constructor.
      
 
      Complexity: Constant.
      
 
      Note: Only available, if BOOST_NO_CXX11_RVALUE_REFERENCES is not defined 
      
 
      4. 
 
    4. 
-
      skew_heap & operator=(skew_heap const & rhs);
      
+
      skew_heap & operator=(skew_heap const & rhs);
      
 
      Effects: Assigns priority queue from rhs.
      
 
      Complexity: Linear. 
      
 
      5. 
 
    5. 
-
      skew_heap & operator=(skew_heap && rhs);
      
+
      skew_heap & operator=(skew_heap && rhs);
      
 
      Effects: C++11-style move assignment.
      
 
      Complexity: Constant.
      
 
      Note: Only available, if BOOST_NO_CXX11_RVALUE_REFERENCES is not defined 
      
 
      6. 
-
    6. ~skew_heap(void);
      7. 
+
    7. ~skew_heap(void);
      8. 
 
    
 
    
-skew_heap public member functions
    
+skew_heap public member functions
 
      
 
    1. 
-
      mpl::if_c< is_mutable, handle_type, void >::type push(value_type const & v);
      
+
      mpl::if_c< is_mutable, handle_type, void >::type push(value_type const & v);
      
 
      Effects: Adds a new element to the priority queue.
      
 
      Complexity: Logarithmic (amortized). 
      
 
      2. 
 
    2. 
 
      template<typename... Args> 
-  mpl::if_c< is_mutable, handle_type, void >::type emplace(Args &&... args);
      
+  mpl::if_c< is_mutable, handle_type, void >::type emplace(Args &&... args);
 
      Effects: Adds a new element to the priority queue. The element is directly constructed in-place.
      
 
      Complexity: Logarithmic (amortized). 
      
 
      3. 
 
    3. 
-
      bool empty(void) const;
      
+
      bool empty(void) const;
      
 
      Effects: Returns true, if the priority queue contains no elements.
      
 
      Complexity: Constant. 
      
 
      4. 
 
    4. 
-
      size_type size(void) const;
      
+
      size_type size(void) const;
      
 
      Effects: Returns the number of elements contained in the priority queue.
      
 
      Complexity: Constant, if configured with constant_time_size<true>, otherwise linear. 
      
 
      5. 
 
    5. 
-
      size_type max_size(void) const;
      
+
      size_type max_size(void) const;
      
 
      Effects: Returns the maximum number of elements the priority queue can contain.
      
 
      Complexity: Constant. 
      
 
      6. 
 
    6. 
-
      void clear(void);
      
+
      void clear(void);
      
 
      Effects: Removes all elements from the priority queue.
      
 
      Complexity: Linear. 
      
 
      7. 
 
    7. 
-
      allocator_type get_allocator(void) const;
      
+
      allocator_type get_allocator(void) const;
      
 
      Effects: Returns allocator.
      
 
      Complexity: Constant. 
      
 
      8. 
 
    8. 
-
      void swap(skew_heap & rhs);
      
+
      void swap(skew_heap & rhs);
      
 
      Effects: Swaps two priority queues.
      
 
      Complexity: Constant. 
      
 
      9. 
 
    9. 
-
      const_reference top(void) const;
      
+
      const_reference top(void) const;
      
 
      Effects: Returns a const_reference to the maximum element.
      
 
      Complexity: Constant. 
      
 
      10. 
 
    10. 
-
      void pop(void);
      
+
      void pop(void);
      
 
      Effects: Removes the top element from the priority queue.
      
 
      Complexity: Logarithmic (amortized). 
      
 
      11. 
 
    11. 
-
      iterator begin(void) const;
      
+
      iterator begin(void) const;
      
 
      Effects: Returns an iterator to the first element contained in the priority queue.
      
 
      Complexity: Constant. 
      
 
      12. 
 
    12. 
-
      iterator end(void) const;
      
+
      iterator end(void) const;
      
 
      Effects: Returns an iterator to the end of the priority queue.
      
 
      Complexity: Constant. 
      
 
      13. 
 
    13. 
-
      ordered_iterator ordered_begin(void) const;
      
+
      ordered_iterator ordered_begin(void) const;
      
 
      Effects: Returns an ordered iterator to the first element contained in the priority queue.
      
 
      Note: Ordered iterators traverse the priority queue in heap order. 
      
 
      14. 
 
    14. 
-
      ordered_iterator ordered_end(void) const;
      
+
      ordered_iterator ordered_end(void) const;
      
 
      Effects: Returns an ordered iterator to the first element contained in the priority queue.
      
 
      Note: Ordered iterators traverse the priority queue in heap order. 
      
 
      15. 
 
    15. 
-
      void merge(skew_heap & rhs);
      
+
      void merge(skew_heap & rhs);
      
 
      Effects: Merge all elements from rhs into this
      
 
      Complexity: Logarithmic (amortized). 
      
 
      16. 
 
    16. 
-
      value_compare const & value_comp(void) const;
      
+
      value_compare const & value_comp(void) const;
      
 
      Effect: Returns the value_compare object used by the priority queue 
      
 
      17. 
 
    17. 
-
      template<typename HeapType> bool operator<(HeapType const & rhs) const;
      
+
      template<typename HeapType> bool operator<(HeapType const & rhs) const;
      
 
      Returns: Element-wise comparison of heap data structures
      
 
      Requirement: the value_compare object of both heaps must match. 
      
 
      18. 
 
    18. 
-
      template<typename HeapType> bool operator>(HeapType const & rhs) const;
      
+
      template<typename HeapType> bool operator>(HeapType const & rhs) const;
      
 
      Returns: Element-wise comparison of heap data structures
      
 
      Requirement: the value_compare object of both heaps must match. 
      
 
      19. 
 
    19. 
-
      template<typename HeapType> bool operator>=(HeapType const & rhs) const;
      
+
      template<typename HeapType> bool operator>=(HeapType const & rhs) const;
      
 
      Returns: Element-wise comparison of heap data structures
      
 
      Requirement: the value_compare object of both heaps must match. 
      
 
      20. 
 
    20. 
-
      template<typename HeapType> bool operator<=(HeapType const & rhs) const;
      
+
      template<typename HeapType> bool operator<=(HeapType const & rhs) const;
      
 
      Returns: Element-wise comparison of heap data structures
      
 
      Requirement: the value_compare object of both heaps must match. 
      
 
      21. 
 
    21. 
-
      template<typename HeapType> bool operator==(HeapType const & rhs) const;
      Equivalent comparison Returns: True, if both heap data structures are equivalent. 
      Requirement: the value_compare object of both heaps must match. 
      
+
      template<typename HeapType> bool operator==(HeapType const & rhs) const;
      Equivalent comparison Returns: True, if both heap data structures are equivalent. 
      Requirement: the value_compare object of both heaps must match. 
      
 
      22. 
 
    22. 
-
      template<typename HeapType> bool operator!=(HeapType const & rhs) const;
      Equivalent comparison Returns: True, if both heap data structures are not equivalent. 
      Requirement: the value_compare object of both heaps must match. 
      
+
      template<typename HeapType> bool operator!=(HeapType const & rhs) const;
      Equivalent comparison Returns: True, if both heap data structures are not equivalent. 
      Requirement: the value_compare object of both heaps must match. 
      
 
      23. 
 
    23. 
-
      void erase(handle_type object);
      
+
      void erase(handle_type object);
      
 
      Effects: Removes the element handled by handle from the priority_queue.
      
 
      Complexity: Logarithmic (amortized). 
      
 
      24. 
 
    24. 
-
      void update(handle_type handle, const_reference v);
      
+
      void update(handle_type handle, const_reference v);
      
 
      Effects: Assigns v to the element handled by handle & updates the priority queue.
      
 
      Complexity: Logarithmic (amortized). 
      
 
      25. 
 
    25. 
-
      void update(handle_type handle);
      
+
      void update(handle_type handle);
      
 
      Effects: Updates the heap after the element handled by handle has been changed.
      
 
      Complexity: Logarithmic (amortized).
      
 
      Note: If this is not called, after a handle has been updated, the behavior of the data structure is undefined! 
      
 
      26. 
 
    26. 
-
      void increase(handle_type handle, const_reference v);
      
+
      void increase(handle_type handle, const_reference v);
      
 
      Effects: Assigns v to the element handled by handle & updates the priority queue.
      
 
      Complexity: Logarithmic (amortized).
      
 
      Note: The new value is expected to be greater than the current one 
      
 
      27. 
 
    27. 
-
      void increase(handle_type handle);
      
+
      void increase(handle_type handle);
      
 
      Effects: Updates the heap after the element handled by handle has been changed.
      
 
      Complexity: Logarithmic (amortized).
      
 
      Note: If this is not called, after a handle has been updated, the behavior of the data structure is undefined! 
      
 
      28. 
 
    28. 
-
      void decrease(handle_type handle, const_reference v);
      
+
      void decrease(handle_type handle, const_reference v);
      
 
      Effects: Assigns v to the element handled by handle & updates the priority queue.
      
 
      Complexity: Logarithmic (amortized).
      
 
      Note: The new value is expected to be less than the current one 
      
 
      29. 
 
    29. 
-
      void decrease(handle_type handle);
      
+
      void decrease(handle_type handle);
      
 
      Effects: Updates the heap after the element handled by handle has been changed.
      
 
      Complexity: Logarithmic (amortized).
      
 
      Note: The new value is expected to be less than the current one. If this is not called, after a handle has been updated, the behavior of the data structure is undefined! 
      
@@ -337,14 +381,32 @@
 
    
 
    
 
    
-skew_heap public static functions
    
+skew_heap public static functions
 
    1. 
-
      static handle_type s_handle_from_iterator(iterator const & it);
      
+
      static handle_type s_handle_from_iterator(iterator const & it);
      
 
      Effects: Casts an iterator to a node handle.
      
 
      Complexity: Constant.
      
 
      Requirement: data structure must be configured as mutable 
      
 
    
 
    
+
    
+
    
+skew_heap private member functions
    
+
      
+
    1. node_pointer push_internal(const_reference v);
      2. 
+
    2. template<class... Args> node_pointer emplace_internal(Args &&... args);
      3. 
+
    3. void unlink_node(node_pointer node);
      4. 
+
    4. void clone_tree(skew_heap const & rhs);
      5. 
+
    5. void merge_node(node_pointer other);
      6. 
+
    6. node_pointer 
+merge_nodes(node_pointer node1, node_pointer node2, node_pointer new_parent);
      7. 
+
    7. node_pointer merge_children(node_pointer node);
      8. 
+
    8. node_pointer 
+merge_nodes_recursive(node_pointer node1, node_pointer node2, 
+                      node_pointer new_parent);
      9. 
+
    9. void sanity_check(void);
      10. 
+
    
+
    
 
                 
 
               
     
                                              
                                          
                                   
                                          
 
                                               
                                                                                                                                                                                
 
   
      
 
 
 
 
 
    
diff --git a/doc/html/boost/heap/skew_heap/implementation_defined.html b/doc/html/boost/heap/skew_heap/implementation_defined.html
index 048b196fcd..54aa54cc76 100644
--- a/doc/html/boost/heap/skew_heap/implementation_defined.html
+++ b/doc/html/boost/heap/skew_heap/implementation_defined.html
@@ -2,13 +2,13 @@
 
-Struct implementation_defined
+Struct template implementation_defined
-
+
    
 
 
 
 
 
 
 
 
 
 
    
@@ -21,20 +21,26 @@
 
    
 
    
 
    
-PrevUpHomeNext
+PrevUpHomeNext
 
    
 
    
 
    
 
    
-
    Struct implementation_defined
    
+
    Struct template implementation_defined
    
 
    boost::heap::skew_heap::implementation_defined
    
 
    
 
    Synopsis
    
 
    // In header: <boost/heap/skew_heap.hpp>
 
 
-
-struct implementation_defined {
+template<typename T, typename A0 = boost::parameter::void_, 
+         typename A1 = boost::parameter::void_, 
+         typename A2 = boost::parameter::void_, 
+         typename A3 = boost::parameter::void_, 
+         typename A4 = boost::parameter::void_, 
+         typename A5 = boost::parameter::void_, 
+         typename A6 = boost::parameter::void_> 
+struct implementation_defined {
   // types
   typedef T                               value_type;         
   typedef base_maker::compare_argument    value_compare;      
@@ -62,7 +68,7 @@
 
 
    
 
    
-PrevUpHomeNext
+PrevUpHomeNext
 
    
 
 
diff --git a/doc/html/boost/heap/skew_heap/push_handle.html b/doc/html/boost/heap/skew_heap/push_handle.html
new file mode 100644
index 0000000000..78482c9919
--- /dev/null
+++ b/doc/html/boost/heap/skew_heap/push_handle.html
@@ -0,0 +1,75 @@
+
+
+
+
+Struct template push_handle
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    
+
    
+
    
+PrevUpHomeNext
+
    
+
    
+
    
+
    
+
    Struct template push_handle
    
+
    boost::heap::skew_heap::push_handle
    
+
    
+
    Synopsis
    
+
    // In header: <boost/heap/skew_heap.hpp>
+
+
+template<typename T, typename A0 = boost::parameter::void_, 
+         typename A1 = boost::parameter::void_, 
+         typename A2 = boost::parameter::void_, 
+         typename A3 = boost::parameter::void_, 
+         typename A4 = boost::parameter::void_, 
+         typename A5 = boost::parameter::void_, 
+         typename A6 = boost::parameter::void_> 
+struct push_handle {
+
+  // public static functions
+  static handle_type push(skew_heap *, const_reference);
+  template<class... Args> static handle_type emplace(skew_heap *, Args &&...);
+};
    
+
    
+
    Description
    
+
    
+
    
+push_handle public static functions
    
+
      
+
    1. static handle_type push(skew_heap * self, const_reference v);
      2. 
+
    2. template<class... Args> 
+  static handle_type emplace(skew_heap * self, Args &&... args);
      3. 
+
    
+
    
+
    
+
    
+
+
+
+
    Copyright © 2010, 2011 Tim Blechmann
    
+        Distributed under the Boost Software License, Version 1.0. (See accompanying
+        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+      
    
+
    
+
    
+
    
+PrevUpHomeNext
+
    
+
+
diff --git a/doc/html/boost/heap/skew_heap/push_void.html b/doc/html/boost/heap/skew_heap/push_void.html
new file mode 100644
index 0000000000..7f1c32327a
--- /dev/null
+++ b/doc/html/boost/heap/skew_heap/push_void.html
@@ -0,0 +1,74 @@
+
+
+
+
+Struct template push_void
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    
+
    
+
    
+PrevUpHomeNext
+
    
+
    
+
    
+
    
+
    Struct template push_void
    
+
    boost::heap::skew_heap::push_void
    
+
    
+
    Synopsis
    
+
    // In header: <boost/heap/skew_heap.hpp>
+
+
+template<typename T, typename A0 = boost::parameter::void_, 
+         typename A1 = boost::parameter::void_, 
+         typename A2 = boost::parameter::void_, 
+         typename A3 = boost::parameter::void_, 
+         typename A4 = boost::parameter::void_, 
+         typename A5 = boost::parameter::void_, 
+         typename A6 = boost::parameter::void_> 
+struct push_void {
+
+  // public static functions
+  static void push(skew_heap *, const_reference);
+  template<class... Args> static void emplace(skew_heap *, Args &&...);
+};
    
+
    
+
    Description
    
+
    
+
    
+push_void public static functions
    
+
      
+
    1. static void push(skew_heap * self, const_reference v);
      2. 
+
    2. template<class... Args> static void emplace(skew_heap * self, Args &&... args);
      3. 
+
    
+
    
+
    
+
    
+
+
+
+
    Copyright © 2010, 2011 Tim Blechmann
    
+        Distributed under the Boost Software License, Version 1.0. (See accompanying
+        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+      
    
+
    
+
    
+
    
+PrevUpHomeNext
+
    
+
+
diff --git a/doc/html/boost/interprocess/adaptive_pool.html b/doc/html/boost/interprocess/adaptive_pool.html
index ac82cb755d..2b9df9c1b5 100644
--- a/doc/html/boost/interprocess/adaptive_pool.html
+++ b/doc/html/boost/interprocess/adaptive_pool.html
@@ -55,38 +55,38 @@
   };
 
   // construct/copy/destruct
-  adaptive_pool(segment_manager *);
-  adaptive_pool(const adaptive_pool &);
+  adaptive_pool(segment_manager *);
+  adaptive_pool(const adaptive_pool &);
   template<typename T2> 
-    adaptive_pool(const adaptive_pool< T2, SegmentManager, NodesPerBlock, MaxFreeBlocks, OverheadPercent > &);
+    adaptive_pool(const adaptive_pool< T2, SegmentManager, NodesPerBlock, MaxFreeBlocks, OverheadPercent > &);
   template<typename T2, typename SegmentManager2, std::size_t N2, 
            std::size_t F2, unsigned char OP2> 
     adaptive_pool & 
-    operator=(const adaptive_pool< T2, SegmentManager2, N2, F2, OP2 > &);
-  ~adaptive_pool();
+    operator=(const adaptive_pool< T2, SegmentManager2, N2, F2, OP2 > &);
+  ~adaptive_pool();
 
-  // public member functions
-  void * get_node_pool() const;
-  segment_manager * get_segment_manager() const;
-  size_type max_size() const;
-  pointer allocate(size_type, cvoid_pointer = 0);
-  void deallocate(const pointer &, size_type);
-  void deallocate_free_blocks();
-  pointer address(reference) const;
-  const_pointer address(const_reference) const;
-  size_type size(const pointer &) const;
-  pointer allocation_command(boost::interprocess::allocation_type, size_type, 
+  // public member functions
+  void * get_node_pool() const;
+  segment_manager * get_segment_manager() const;
+  size_type max_size() const;
+  pointer allocate(size_type, cvoid_pointer = 0);
+  void deallocate(const pointer &, size_type);
+  void deallocate_free_blocks();
+  pointer address(reference) const;
+  const_pointer address(const_reference) const;
+  size_type size(const pointer &) const;
+  pointer allocation_command(boost::interprocess::allocation_type, size_type, 
                              size_type &, pointer &);
-  void allocate_many(size_type, size_type, multiallocation_chain &);
-  void allocate_many(const size_type *, size_type, multiallocation_chain &);
-  void deallocate_many(multiallocation_chain &);
-  pointer allocate_one();
-  void allocate_individual(size_type, multiallocation_chain &);
-  void deallocate_one(const pointer &);
-  void deallocate_individual(multiallocation_chain &);
+  void allocate_many(size_type, size_type, multiallocation_chain &);
+  void allocate_many(const size_type *, size_type, multiallocation_chain &);
+  void deallocate_many(multiallocation_chain &);
+  pointer allocate_one();
+  void allocate_individual(size_type, multiallocation_chain &);
+  void deallocate_one(const pointer &);
+  void deallocate_individual(multiallocation_chain &);
 
-  // friend functions
-  friend void swap(self_t &, self_t &);
+  // friend functions
+  friend void swap(self_t &, self_t &);
 };
    
 
    
 
    Description
    
@@ -100,113 +100,113 @@
        construct/copy/destruct
 
      
 
    1. 
-
      adaptive_pool(segment_manager * segment_mngr);
      
+
      adaptive_pool(segment_manager * segment_mngr);
      
 
      Not assignable from other adaptive_pool Constructor from a segment manager. If not present, constructs a node pool. Increments the reference count of the associated node pool. Can throw boost::interprocess::bad_alloc 
      
 
      2. 
 
    2. 
-
      adaptive_pool(const adaptive_pool & other);
      
+
      adaptive_pool(const adaptive_pool & other);
      
 
      Copy constructor from other adaptive_pool. Increments the reference count of the associated node pool. Never throws 
      
 
      3. 
 
    3. 
 
      template<typename T2> 
-  adaptive_pool(const adaptive_pool< T2, SegmentManager, NodesPerBlock, MaxFreeBlocks, OverheadPercent > & other);
      
+  adaptive_pool(const adaptive_pool< T2, SegmentManager, NodesPerBlock, MaxFreeBlocks, OverheadPercent > & other);

    Copy constructor from related adaptive_pool. If not present, constructs a node pool. Increments the reference count of the associated node pool. Can throw boost::interprocess::bad_alloc 

  • template<typename T2, typename SegmentManager2, std::size_t N2, 
          std::size_t F2, unsigned char OP2> 
   adaptive_pool & 
-  operator=(const adaptive_pool< T2, SegmentManager2, N2, F2, OP2 > &);
    + operator=(const adaptive_pool< T2, SegmentManager2, N2, F2, OP2 > &);

    Not assignable from related adaptive_pool

  • -
    ~adaptive_pool();
    +
    ~adaptive_pool();

    Destructor, removes node_pool_t from memory if its reference count reaches to zero. Never throws

    • -adaptive_pool public member functions

    +adaptive_pool public member functions
    1. -
      void * get_node_pool() const;
      +
      void * get_node_pool() const;

      Returns a pointer to the node pool. Never throws

    2. -
      segment_manager * get_segment_manager() const;
      +
      segment_manager * get_segment_manager() const;

      Returns the segment manager. Never throws

    3. -
      size_type max_size() const;
      +
      size_type max_size() const;

      Returns the number of elements that could be allocated. Never throws

    4. -
      pointer allocate(size_type count, cvoid_pointer hint = 0);
      +
      pointer allocate(size_type count, cvoid_pointer hint = 0);

      Allocate memory for an array of count elements. Throws boost::interprocess::bad_alloc if there is no enough memory

    5. -
      void deallocate(const pointer & ptr, size_type count);
      +
      void deallocate(const pointer & ptr, size_type count);

      Deallocate allocated memory. Never throws

    6. -
      void deallocate_free_blocks();
      +
      void deallocate_free_blocks();

      Deallocates all free blocks of the pool

    7. -
      pointer address(reference value) const;
      +
      pointer address(reference value) const;

      Returns address of mutable object. Never throws

    8. -
      const_pointer address(const_reference value) const;
      +
      const_pointer address(const_reference value) const;

      Returns address of non mutable object. Never throws

    9. -
      size_type size(const pointer & p) const;
      +
      size_type size(const pointer & p) const;

      Returns maximum the number of objects the previously allocated memory pointed by p can hold. This size only works for memory allocated with allocate, allocation_command and allocate_many.

      10. -
    10. pointer allocation_command(boost::interprocess::allocation_type command, 
+
    11. pointer allocation_command(boost::interprocess::allocation_type command, 
                            size_type limit_size, 
                            size_type & prefer_in_recvd_out_size, 
                            pointer & reuse);
      12. 
 
    12. 
-
      void allocate_many(size_type elem_size, size_type num_elements, 
+
      void allocate_many(size_type elem_size, size_type num_elements, 
                    multiallocation_chain & chain);
      
 
      Allocates many elements of size elem_size in a contiguous block of memory. The minimum number to be allocated is min_elements, the preferred and maximum number is preferred_elements. The number of actually allocated elements is will be assigned to received_size. The elements must be deallocated with deallocate(...) 
      
 
      13. 
 
    13. 
-
      void allocate_many(const size_type * elem_sizes, size_type n_elements, 
+
      void allocate_many(const size_type * elem_sizes, size_type n_elements, 
                    multiallocation_chain & chain);
      
 
      Allocates n_elements elements, each one of size elem_sizes[i]in a contiguous block of memory. The elements must be deallocated 
      
 
      14. 
 
    14. 
-
      void deallocate_many(multiallocation_chain & chain);
      
+
      void deallocate_many(multiallocation_chain & chain);
      
 
      Allocates many elements of size elem_size in a contiguous block of memory. The minimum number to be allocated is min_elements, the preferred and maximum number is preferred_elements. The number of actually allocated elements is will be assigned to received_size. The elements must be deallocated with deallocate(...) 
      
 
      15. 
 
    15. 
-
      pointer allocate_one();
      
+
      pointer allocate_one();
      
 
      Allocates just one object. Memory allocated with this function must be deallocated only with deallocate_one(). Throws boost::interprocess::bad_alloc if there is no enough memory 
      
 
      16. 
 
    16. 
-
      void allocate_individual(size_type num_elements, 
+
      void allocate_individual(size_type num_elements, 
                          multiallocation_chain & chain);
      
 
      Allocates many elements of size == 1 in a contiguous block of memory. The minimum number to be allocated is min_elements, the preferred and maximum number is preferred_elements. The number of actually allocated elements is will be assigned to received_size. Memory allocated with this function must be deallocated only with deallocate_one(). 
      
 
      17. 
 
    17. 
-
      void deallocate_one(const pointer & p);
      
+
      void deallocate_one(const pointer & p);
      
 
      Deallocates memory previously allocated with allocate_one(). You should never use deallocate_one to deallocate memory allocated with other functions different from allocate_one(). Never throws 
      
 
      18. 
 
    18. 
-
      void deallocate_individual(multiallocation_chain & chain);
      
+
      void deallocate_individual(multiallocation_chain & chain);
      
 
      Allocates many elements of size == 1 in a contiguous block of memory. The minimum number to be allocated is min_elements, the preferred and maximum number is preferred_elements. The number of actually allocated elements is will be assigned to received_size. Memory allocated with this function must be deallocated only with deallocate_one(). 
      
 
      19.

    -adaptive_pool friend functions

    +adaptive_pool friend functions
    1. -
      friend void swap(self_t & alloc1, self_t & alloc2);
      +
      friend void swap(self_t & alloc1, self_t & alloc2);

      Swaps allocators. Does not throw. If each allocator is placed in a different memory segment, the result is undefined.

    diff --git a/doc/html/boost/interprocess/adaptive_pool/rebind.html b/doc/html/boost/interprocess/adaptive_pool/rebind.html index 3347ee6116..4ab0cecd57 100644 --- a/doc/html/boost/interprocess/adaptive_pool/rebind.html +++ b/doc/html/boost/interprocess/adaptive_pool/rebind.html @@ -8,7 +8,7 @@ - + @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -53,7 +53,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/interprocess/allocator.html b/doc/html/boost/interprocess/allocator.html index 56a0fd3a79..658bca8ae7 100644 --- a/doc/html/boost/interprocess/allocator.html +++ b/doc/html/boost/interprocess/allocator.html @@ -7,7 +7,7 @@ - + @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -55,32 +55,32 @@ }; // construct/copy/destruct - allocator(segment_manager *); - allocator(const allocator &); - template<typename T2> allocator(const allocator< T2, SegmentManager > &); + allocator(segment_manager *); + allocator(const allocator &); + template<typename T2> allocator(const allocator< T2, SegmentManager > &); - // public member functions - segment_manager * get_segment_manager() const; - pointer allocate(size_type, cvoid_ptr = 0); - void deallocate(const pointer &, size_type); - size_type max_size() const; - size_type size(const pointer &) const; - pointer allocation_command(boost::interprocess::allocation_type, size_type, + // public member functions + segment_manager * get_segment_manager() const; + pointer allocate(size_type, cvoid_ptr = 0); + void deallocate(const pointer &, size_type); + size_type max_size() const; + size_type size(const pointer &) const; + pointer allocation_command(boost::interprocess::allocation_type, size_type, size_type &, pointer &); - void allocate_many(size_type, size_type, multiallocation_chain &); - void allocate_many(const size_type *, size_type, multiallocation_chain &); - void deallocate_many(multiallocation_chain &); - pointer allocate_one(); - void allocate_individual(size_type, multiallocation_chain &); - void deallocate_one(const pointer &); - void deallocate_individual(multiallocation_chain &); - pointer address(reference) const; - const_pointer address(const_reference) const; - template<typename P> void construct(const pointer &, P &&); - void destroy(const pointer &); + void allocate_many(size_type, size_type, multiallocation_chain &); + void allocate_many(const size_type *, size_type, multiallocation_chain &); + void deallocate_many(multiallocation_chain &); + pointer allocate_one(); + void allocate_individual(size_type, multiallocation_chain &); + void deallocate_one(const pointer &); + void deallocate_individual(multiallocation_chain &); + pointer address(reference) const; + const_pointer address(const_reference) const; + template<typename P> void construct(const pointer &, P &&); + void destroy(const pointer &); - // friend functions - friend void swap(self_t &, self_t &); + // friend functions + friend void swap(self_t &, self_t &); };

    Description

    @@ -92,101 +92,101 @@ construct/copy/destruct
    1. -
      allocator(segment_manager * segment_mngr);
      +
      allocator(segment_manager * segment_mngr);

      Constructor from the segment manager. Never throws

    2. -
      allocator(const allocator & other);
      +
      allocator(const allocator & other);

      Constructor from other allocator. Never throws

    3. -
      template<typename T2> allocator(const allocator< T2, SegmentManager > & other);
      +
      template<typename T2> allocator(const allocator< T2, SegmentManager > & other);

      Constructor from related allocator. Never throws

    -allocator public member functions

    +allocator public member functions
    1. -
      segment_manager * get_segment_manager() const;
      +
      segment_manager * get_segment_manager() const;

      Returns the segment manager. Never throws

    2. -
      pointer allocate(size_type count, cvoid_ptr hint = 0);
      +
      pointer allocate(size_type count, cvoid_ptr hint = 0);

      Allocates memory for an array of count elements. Throws boost::interprocess::bad_alloc if there is no enough memory

    3. -
      void deallocate(const pointer & ptr, size_type);
      +
      void deallocate(const pointer & ptr, size_type);

      Deallocates memory previously allocated. Never throws

    4. -
      size_type max_size() const;
      +
      size_type max_size() const;

      Returns the number of elements that could be allocated. Never throws

    5. -
      size_type size(const pointer & p) const;
      +
      size_type size(const pointer & p) const;

      Returns maximum the number of objects the previously allocated memory pointed by p can hold. This size only works for memory allocated with allocate, allocation_command and allocate_many.

      6. -
    6. pointer allocation_command(boost::interprocess::allocation_type command, 
+
    7. pointer allocation_command(boost::interprocess::allocation_type command, 
                            size_type limit_size, 
                            size_type & prefer_in_recvd_out_size, 
                            pointer & reuse);
      8. 
 
    8. 
-
      void allocate_many(size_type elem_size, size_type num_elements, 
+
      void allocate_many(size_type elem_size, size_type num_elements, 
                    multiallocation_chain & chain);
      
 
      Allocates many elements of size elem_size in a contiguous block of memory. The minimum number to be allocated is min_elements, the preferred and maximum number is preferred_elements. The number of actually allocated elements is will be assigned to received_size. The elements must be deallocated with deallocate(...) 
      
 
      9. 
 
    9. 
-
      void allocate_many(const size_type * elem_sizes, size_type n_elements, 
+
      void allocate_many(const size_type * elem_sizes, size_type n_elements, 
                    multiallocation_chain & chain);
      
 
      Allocates n_elements elements, each one of size elem_sizes[i]in a contiguous block of memory. The elements must be deallocated 
      
 
      10. 
 
    10. 
-
      void deallocate_many(multiallocation_chain & chain);
      
+
      void deallocate_many(multiallocation_chain & chain);
      
 
      Allocates many elements of size elem_size in a contiguous block of memory. The minimum number to be allocated is min_elements, the preferred and maximum number is preferred_elements. The number of actually allocated elements is will be assigned to received_size. The elements must be deallocated with deallocate(...) 
      
 
      11. 
 
    11. 
-
      pointer allocate_one();
      
+
      pointer allocate_one();
      
 
      Allocates just one object. Memory allocated with this function must be deallocated only with deallocate_one(). Throws boost::interprocess::bad_alloc if there is no enough memory 
      
 
      12. 
 
    12. 
-
      void allocate_individual(size_type num_elements, 
+
      void allocate_individual(size_type num_elements, 
                          multiallocation_chain & chain);
      
 
      Allocates many elements of size == 1 in a contiguous block of memory. The minimum number to be allocated is min_elements, the preferred and maximum number is preferred_elements. The number of actually allocated elements is will be assigned to received_size. Memory allocated with this function must be deallocated only with deallocate_one(). 
      
 
      13. 
 
    13. 
-
      void deallocate_one(const pointer & p);
      
+
      void deallocate_one(const pointer & p);
      
 
      Deallocates memory previously allocated with allocate_one(). You should never use deallocate_one to deallocate memory allocated with other functions different from allocate_one(). Never throws 
      
 
      14. 
 
    14. 
-
      void deallocate_individual(multiallocation_chain & chain);
      
+
      void deallocate_individual(multiallocation_chain & chain);
      
 
      Allocates many elements of size == 1 in a contiguous block of memory. The minimum number to be allocated is min_elements, the preferred and maximum number is preferred_elements. The number of actually allocated elements is will be assigned to received_size. Memory allocated with this function must be deallocated only with deallocate_one(). 
      
 
      15. 
 
    15. 
-
      pointer address(reference value) const;
      
+
      pointer address(reference value) const;
      
 
      Returns address of mutable object. Never throws 
      
 
      16. 
 
    16. 
-
      const_pointer address(const_reference value) const;
      
+
      const_pointer address(const_reference value) const;
      
 
      Returns address of non mutable object. Never throws 
      
 
      17. 
 
    17. 
-
      template<typename P> void construct(const pointer & ptr, P && p);
      
+
      template<typename P> void construct(const pointer & ptr, P && p);
      
 
      Constructs an object Throws if T's constructor throws For backwards compatibility with libraries using C++03 allocators 
      
 
      18. 
 
    18. 
-
      void destroy(const pointer & ptr);
      
+
      void destroy(const pointer & ptr);
      
 
      Destroys object. Throws if object's destructor throws 
      
 
      19.

    -allocator friend functions

    +allocator friend functions
    1. -
      friend void swap(self_t & alloc1, self_t & alloc2);
      +
      friend void swap(self_t & alloc1, self_t & alloc2);

      Swap segment manager. Does not throw. If each allocator is placed in different memory segments, the result is undefined.

    @@ -202,7 +202,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/interprocess/allocator/rebind.html b/doc/html/boost/interprocess/allocator/rebind.html index ee77ecbfca..cb72cff377 100644 --- a/doc/html/boost/interprocess/allocator/rebind.html +++ b/doc/html/boost/interprocess/allocator/rebind.html @@ -8,7 +8,7 @@ - + @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -53,7 +53,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/interprocess/anonymous_shared_memory.html b/doc/html/boost/interprocess/anonymous_shared_memory.html index d87f5d2457..8aecc75858 100644 --- a/doc/html/boost/interprocess/anonymous_shared_memory.html +++ b/doc/html/boost/interprocess/anonymous_shared_memory.html @@ -7,7 +7,7 @@ - + @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -49,7 +49,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/interprocess/bad_alloc.html b/doc/html/boost/interprocess/bad_alloc.html index 169083ab4e..a648959e42 100644 --- a/doc/html/boost/interprocess/bad_alloc.html +++ b/doc/html/boost/interprocess/bad_alloc.html @@ -36,10 +36,10 @@ class bad_alloc : public boost::interprocess::interprocess_exception { public: // construct/copy/destruct - bad_alloc(); + bad_alloc(); - // public member functions - virtual const char * what() const; + // public member functions + virtual const char * what() const; };

    Description

    @@ -49,12 +49,12 @@ bad_alloc public construct/copy/destruct -
    1. bad_alloc();
    +
    1. bad_alloc();

    -bad_alloc public member functions

    -
    1. virtual const char * what() const;
    +bad_alloc public member functions +
    1. virtual const char * what() const;
    diff --git a/doc/html/boost/interprocess/basic_bufferbuf.html b/doc/html/boost/interprocess/basic_bufferbuf.html index 46db4b95fa..bf11fdf9b1 100644 --- a/doc/html/boost/interprocess/basic_bufferbuf.html +++ b/doc/html/boost/interprocess/basic_bufferbuf.html @@ -44,14 +44,14 @@ typedef std::basic_streambuf< char_type, traits_type > basic_streambuf_t; // construct/copy/destruct - explicit basic_bufferbuf(std::ios_base::openmode = std::ios_base::in|std::ios_base::out); - explicit basic_bufferbuf(CharT *, std::size_t, + explicit basic_bufferbuf(std::ios_base::openmode = std::ios_base::in|std::ios_base::out); + explicit basic_bufferbuf(CharT *, std::size_t, std::ios_base::openmode = std::ios_base::in|std::ios_base::out); - ~basic_bufferbuf(); + ~basic_bufferbuf(); - // public member functions - std::pair< CharT *, std::size_t > buffer() const; - void buffer(CharT *, std::size_t); + // public member functions + std::pair< CharT *, std::size_t > buffer() const; + void buffer(CharT *, std::size_t); };

    Description

    @@ -63,27 +63,27 @@ construct/copy/destruct
    1. -
      explicit basic_bufferbuf(std::ios_base::openmode mode = std::ios_base::in|std::ios_base::out);
      +
      explicit basic_bufferbuf(std::ios_base::openmode mode = std::ios_base::in|std::ios_base::out);

      Constructor. Does not throw.

    2. -
      explicit basic_bufferbuf(CharT * buf, std::size_t length, 
+
      explicit basic_bufferbuf(CharT * buf, std::size_t length, 
                          std::ios_base::openmode mode = std::ios_base::in|std::ios_base::out);
      
 
      Constructor. Assigns formatting buffer. Does not throw.
      3. -
    3. ~basic_bufferbuf();
      4. +
    4. ~basic_bufferbuf();

    -basic_bufferbuf public member functions

    +basic_bufferbuf public member functions
    1. -
      std::pair< CharT *, std::size_t > buffer() const;
      +
      std::pair< CharT *, std::size_t > buffer() const;

      Returns the pointer and size of the internal buffer. Does not throw.

    2. -
      void buffer(CharT * buf, std::size_t length);
      +
      void buffer(CharT * buf, std::size_t length);

      Sets the underlying buffer to a new value Does not throw.

    diff --git a/doc/html/boost/interprocess/basic_bufferstream.html b/doc/html/boost/interprocess/basic_bufferstream.html index 678f06d32e..c1660fe09a 100644 --- a/doc/html/boost/interprocess/basic_bufferstream.html +++ b/doc/html/boost/interprocess/basic_bufferstream.html @@ -43,15 +43,15 @@ typedef std::basic_ios< char_type, CharTraits >::traits_type traits_type; // construct/copy/destruct - basic_bufferstream(std::ios_base::openmode = std::ios_base::in|std::ios_base::out); - basic_bufferstream(CharT *, std::size_t, + basic_bufferstream(std::ios_base::openmode = std::ios_base::in|std::ios_base::out); + basic_bufferstream(CharT *, std::size_t, std::ios_base::openmode = std::ios_base::in|std::ios_base::out); - ~basic_bufferstream(); + ~basic_bufferstream(); - // public member functions - basic_bufferbuf< CharT, CharTraits > * rdbuf() const; - std::pair< CharT *, std::size_t > buffer() const; - void buffer(CharT *, std::size_t); + // public member functions + basic_bufferbuf< CharT, CharTraits > * rdbuf() const; + std::pair< CharT *, std::size_t > buffer() const; + void buffer(CharT *, std::size_t); };

    Description

    @@ -63,31 +63,31 @@ construct/copy/destruct
    1. -
      basic_bufferstream(std::ios_base::openmode mode = std::ios_base::in|std::ios_base::out);
      +
      basic_bufferstream(std::ios_base::openmode mode = std::ios_base::in|std::ios_base::out);

      Constructor. Does not throw.

    2. -
      basic_bufferstream(CharT * buf, std::size_t length, 
+
      basic_bufferstream(CharT * buf, std::size_t length, 
                    std::ios_base::openmode mode = std::ios_base::in|std::ios_base::out);
      
 
      Constructor. Assigns formatting buffer. Does not throw.
      3. -
    3. ~basic_bufferstream();
      4. +
    4. ~basic_bufferstream();

    -basic_bufferstream public member functions

    +basic_bufferstream public member functions
    1. -
      basic_bufferbuf< CharT, CharTraits > * rdbuf() const;
      +
      basic_bufferbuf< CharT, CharTraits > * rdbuf() const;

      Returns the address of the stored stream buffer.

    2. -
      std::pair< CharT *, std::size_t > buffer() const;
      +
      std::pair< CharT *, std::size_t > buffer() const;

      Returns the pointer and size of the internal buffer. Does not throw.

    3. -
      void buffer(CharT * buf, std::size_t length);
      +
      void buffer(CharT * buf, std::size_t length);

      Sets the underlying buffer to a new value. Resets stream position. Does not throw.

    diff --git a/doc/html/boost/interprocess/basic_ibufferstream.html b/doc/html/boost/interprocess/basic_ibufferstream.html index bd4cd83da7..d0540d4187 100644 --- a/doc/html/boost/interprocess/basic_ibufferstream.html +++ b/doc/html/boost/interprocess/basic_ibufferstream.html @@ -43,15 +43,15 @@ typedef std::basic_ios< char_type, CharTraits >::traits_type traits_type; // construct/copy/destruct - basic_ibufferstream(std::ios_base::openmode = std::ios_base::in); - basic_ibufferstream(const CharT *, std::size_t, + basic_ibufferstream(std::ios_base::openmode = std::ios_base::in); + basic_ibufferstream(const CharT *, std::size_t, std::ios_base::openmode = std::ios_base::in); - ~basic_ibufferstream(); + ~basic_ibufferstream(); - // public member functions - basic_bufferbuf< CharT, CharTraits > * rdbuf() const; - std::pair< const CharT *, std::size_t > buffer() const; - void buffer(const CharT *, std::size_t); + // public member functions + basic_bufferbuf< CharT, CharTraits > * rdbuf() const; + std::pair< const CharT *, std::size_t > buffer() const; + void buffer(const CharT *, std::size_t); };

    Description

    @@ -63,31 +63,31 @@ construct/copy/destruct
    1. -
      basic_ibufferstream(std::ios_base::openmode mode = std::ios_base::in);
      +
      basic_ibufferstream(std::ios_base::openmode mode = std::ios_base::in);

      Constructor. Does not throw.

    2. -
      basic_ibufferstream(const CharT * buf, std::size_t length, 
+
      basic_ibufferstream(const CharT * buf, std::size_t length, 
                     std::ios_base::openmode mode = std::ios_base::in);
      
 
      Constructor. Assigns formatting buffer. Does not throw.
      3. -
    3. ~basic_ibufferstream();
      4. +
    4. ~basic_ibufferstream();

    -basic_ibufferstream public member functions

    +basic_ibufferstream public member functions
    1. -
      basic_bufferbuf< CharT, CharTraits > * rdbuf() const;
      +
      basic_bufferbuf< CharT, CharTraits > * rdbuf() const;

      Returns the address of the stored stream buffer.

    2. -
      std::pair< const CharT *, std::size_t > buffer() const;
      +
      std::pair< const CharT *, std::size_t > buffer() const;

      Returns the pointer and size of the internal buffer. Does not throw.

    3. -
      void buffer(const CharT * buf, std::size_t length);
      +
      void buffer(const CharT * buf, std::size_t length);

      Sets the underlying buffer to a new value. Resets stream position. Does not throw.

    diff --git a/doc/html/boost/interprocess/basic_ivectorstream.html b/doc/html/boost/interprocess/basic_ivectorstream.html index ad558a09c9..493310a688 100644 --- a/doc/html/boost/interprocess/basic_ivectorstream.html +++ b/doc/html/boost/interprocess/basic_ivectorstream.html @@ -46,17 +46,17 @@ typedef std::basic_ios< char_type, CharTraits >::traits_type traits_type; // construct/copy/destruct - basic_ivectorstream(std::ios_base::openmode = std::ios_base::in); + basic_ivectorstream(std::ios_base::openmode = std::ios_base::in); template<typename VectorParameter> - basic_ivectorstream(const VectorParameter &, + basic_ivectorstream(const VectorParameter &, std::ios_base::openmode = std::ios_base::in); - // public member functions - basic_vectorbuf< CharVector, CharTraits > * rdbuf() const; - void swap_vector(vector_type &); - const vector_type & vector() const; - void reserve(typename vector_type::size_type); - void clear(); + // public member functions + basic_vectorbuf< CharVector, CharTraits > * rdbuf() const; + void swap_vector(vector_type &); + const vector_type & vector() const; + void reserve(typename vector_type::size_type); + void clear(); };

    Description

    @@ -68,12 +68,12 @@ construct/copy/destruct
    1. -
      basic_ivectorstream(std::ios_base::openmode mode = std::ios_base::in);
      +
      basic_ivectorstream(std::ios_base::openmode mode = std::ios_base::in);

      Constructor. Throws if vector_type default constructor throws. 

    2. template<typename VectorParameter> 
-  basic_ivectorstream(const VectorParameter & param, 
+  basic_ivectorstream(const VectorParameter & param, 
                       std::ios_base::openmode mode = std::ios_base::in);

      Constructor. Throws if vector_type(const VectorParameter &param) throws.

      3. @@ -81,26 +81,26 @@

    -basic_ivectorstream public member functions

    +basic_ivectorstream public member functions
    1. -
      basic_vectorbuf< CharVector, CharTraits > * rdbuf() const;
      +
      basic_vectorbuf< CharVector, CharTraits > * rdbuf() const;

      Returns the address of the stored stream buffer.

    2. -
      void swap_vector(vector_type & vect);
      +
      void swap_vector(vector_type & vect);

      Swaps the underlying vector with the passed vector. This function resets the read position in the stream. Does not throw.

    3. -
      const vector_type & vector() const;
      +
      const vector_type & vector() const;

      Returns a const reference to the internal vector. Does not throw.

    4. -
      void reserve(typename vector_type::size_type size);
      +
      void reserve(typename vector_type::size_type size);

      Calls reserve() method of the internal vector. Resets the stream to the first position. Throws if the internals vector's reserve throws.

    5. -
      void clear();
      +
      void clear();

      Calls clear() method of the internal vector. Resets the stream to the first position.

    diff --git a/doc/html/boost/interprocess/basic_managed__idp39474400.html b/doc/html/boost/interprocess/basic_managed__idp39474400.html new file mode 100644 index 0000000000..59f61cb1fc --- /dev/null +++ b/doc/html/boost/interprocess/basic_managed__idp39474400.html @@ -0,0 +1,103 @@ + + + + +Class template basic_managed_external_buffer + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Class template basic_managed_external_buffer

    +

    boost::interprocess::basic_managed_external_buffer

    +
    +

    Synopsis

    +
    // In header: <boost/interprocess/managed_external_buffer.hpp>
+
+template<typename CharType, typename AllocationAlgorithm, 
+         template< class IndexConfig > class IndexType> 
+class basic_managed_external_buffer {
+public:
+  // types
+  typedef base_t::size_type size_type;
+
+  // construct/copy/destruct
+  basic_managed_external_buffer();
+  basic_managed_external_buffer(create_only_t, void *, size_type);
+  basic_managed_external_buffer(open_only_t, void *, size_type);
+  basic_managed_external_buffer(basic_managed_external_buffer &&);
+  basic_managed_external_buffer & operator=(basic_managed_external_buffer &&);
+
+  // public member functions
+  void grow(size_type);
+  void swap(basic_managed_external_buffer &);
+};
    +
    +

    Description

    +

    A basic user memory named object creation class. Inherits all basic functionality from basic_managed_memory_impl<CharType, AllocationAlgorithm, IndexType>

    +
    +

    +basic_managed_external_buffer + public + construct/copy/destruct

    +
      +
    1. +
      basic_managed_external_buffer();
      +

      Default constructor. Does nothing. Useful in combination with move semantics

      +
      2. +
    2. +
      basic_managed_external_buffer(create_only_t, void * addr, size_type size);
      Creates and places the segment manager. This can throw.
      3. +
    3. +
      basic_managed_external_buffer(open_only_t, void * addr, size_type size);
      Creates and places the segment manager. This can throw.
      4. +
    4. +
      basic_managed_external_buffer(basic_managed_external_buffer && moved);
      Moves the ownership of "moved"'s managed memory to *this. Does not throw.
      5. +
    5. +
      basic_managed_external_buffer & 
+operator=(basic_managed_external_buffer && moved);
      Moves the ownership of "moved"'s managed memory to *this. Does not throw.
      6. +
    +
    +
    +

    +basic_managed_external_buffer public member functions

    +
      +
    1. void grow(size_type extra_bytes);
      2. +
    2. +
      void swap(basic_managed_external_buffer & other);
      +

      Swaps the ownership of the managed heap memories managed by *this and other. Never throws.

      +
      3. +
    +
    +
    +
    + + + +
    Copyright © 2005-2015 Ion Gaztanaga

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/interprocess/basic_managed__idp39582912.html b/doc/html/boost/interprocess/basic_managed__idp39582912.html new file mode 100644 index 0000000000..994b3ccc55 --- /dev/null +++ b/doc/html/boost/interprocess/basic_managed__idp39582912.html @@ -0,0 +1,156 @@ + + + + +Class template basic_managed_shared_memory + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Class template basic_managed_shared_memory

    +

    boost::interprocess::basic_managed_shared_memory

    +
    +

    Synopsis

    +
    // In header: <boost/interprocess/managed_shared_memory.hpp>
+
+template<typename CharType, typename AllocationAlgorithm, 
+         template< class IndexConfig > class IndexType> 
+class basic_managed_shared_memory {
+public:
+  // construct/copy/destruct
+  basic_managed_shared_memory();
+  basic_managed_shared_memory(create_only_t, const char *, size_type, 
+                              const void * = 0, 
+                              const permissions & = permissions());
+  basic_managed_shared_memory(open_or_create_t, const char *, size_type, 
+                              const void * = 0, 
+                              const permissions & = permissions());
+  basic_managed_shared_memory(open_copy_on_write_t, const char *, 
+                              const void * = 0);
+  basic_managed_shared_memory(open_read_only_t, const char *, 
+                              const void * = 0);
+  basic_managed_shared_memory(open_only_t, const char *, const void * = 0);
+  basic_managed_shared_memory(basic_managed_shared_memory &&);
+  basic_managed_shared_memory & operator=(basic_managed_shared_memory &&);
+  ~basic_managed_shared_memory();
+
+  // public member functions
+  void swap(basic_managed_shared_memory &);
+
+  // public static functions
+  static bool grow(const char *, size_type);
+  static bool shrink_to_fit(const char *);
+};
    +
    +

    Description

    +

    A basic shared memory named object creation class. Initializes the shared memory segment. Inherits all basic functionality from basic_managed_memory_impl<CharType, AllocationAlgorithm, IndexType>

    +
    +

    +basic_managed_shared_memory + public + construct/copy/destruct

    +
      +
    1. +
      basic_managed_shared_memory();
      +

      Default constructor. Does nothing. Useful in combination with move semantics

      +
      2. +
    2. +
      basic_managed_shared_memory(create_only_t, const char * name, size_type size, 
+                            const void * addr = 0, 
+                            const permissions & perm = permissions());
      +

      Creates shared memory and creates and places the segment manager. This can throw.

      +
      3. +
    3. +
      basic_managed_shared_memory(open_or_create_t, const char * name, 
+                            size_type size, const void * addr = 0, 
+                            const permissions & perm = permissions());
      +

      Creates shared memory and creates and places the segment manager if segment was not created. If segment was created it connects to the segment. This can throw.

      +
      4. +
    4. +
      basic_managed_shared_memory(open_copy_on_write_t, const char * name, 
+                            const void * addr = 0);
      +

      Connects to a created shared memory and its segment manager. in copy_on_write mode. This can throw.

      +
      5. +
    5. +
      basic_managed_shared_memory(open_read_only_t, const char * name, 
+                            const void * addr = 0);
      +

      Connects to a created shared memory and its segment manager. in read-only mode. This can throw.

      +
      6. +
    6. +
      basic_managed_shared_memory(open_only_t, const char * name, 
+                            const void * addr = 0);
      +

      Connects to a created shared memory and its segment manager. This can throw.

      +
      7. +
    7. +
      basic_managed_shared_memory(basic_managed_shared_memory && moved);
      +

      Moves the ownership of "moved"'s managed memory to *this. Does not throw

      +
      8. +
    8. +
      basic_managed_shared_memory & operator=(basic_managed_shared_memory && moved);
      +

      Moves the ownership of "moved"'s managed memory to *this. Does not throw

      +
      9. +
    9. +
      ~basic_managed_shared_memory();
      +

      Destroys *this and indicates that the calling process is finished using the resource. The destructor function will deallocate any system resources allocated by the system for use by this process for this resource. The resource can still be opened again calling the open constructor overload. To erase the resource from the system use remove().

      +
      10. +
    +
    +
    +

    +basic_managed_shared_memory public member functions

    +
    1. +
      void swap(basic_managed_shared_memory & other);
      +

      Swaps the ownership of the managed shared memories managed by *this and other. Never throws.

      +
    +
    +
    +

    +basic_managed_shared_memory public static functions

    +
      +
    1. +
      static bool grow(const char * shmname, size_type extra_bytes);
      +

      Tries to resize the managed shared memory object so that we have room for more objects.

      +

      This function is not synchronized so no other thread or process should be reading or writing the file

      +
      2. +
    2. +
      static bool shrink_to_fit(const char * shmname);
      +

      Tries to resize the managed shared memory to minimized the size of the file.

      +

      This function is not synchronized so no other thread or process should be reading or writing the file

      +
      3. +
    +
    +
    +
    + + + +
    Copyright © 2005-2015 Ion Gaztanaga

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/interprocess/basic_managed__idp39640656.html b/doc/html/boost/interprocess/basic_managed__idp39640656.html new file mode 100644 index 0000000000..335f455654 --- /dev/null +++ b/doc/html/boost/interprocess/basic_managed__idp39640656.html @@ -0,0 +1,143 @@ + + + + +Class template basic_managed_windows_shared_memory + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Class template basic_managed_windows_shared_memory

    +

    boost::interprocess::basic_managed_windows_shared_memory

    +
    +

    Synopsis

    +
    // In header: <boost/interprocess/managed_windows_shared_memory.hpp>
+
+template<typename CharType, typename AllocationAlgorithm, 
+         template< class IndexConfig > class IndexType> 
+class basic_managed_windows_shared_memory {
+public:
+  // types
+  typedef base_t::size_type size_type;
+
+  // construct/copy/destruct
+  basic_managed_windows_shared_memory();
+  basic_managed_windows_shared_memory(create_only_t, const char *, size_type, 
+                                      const void * = 0, 
+                                      const permissions & = permissions());
+  basic_managed_windows_shared_memory(open_or_create_t, const char *, 
+                                      size_type, const void * = 0, 
+                                      const permissions & = permissions());
+  basic_managed_windows_shared_memory(open_only_t, const char *, 
+                                      const void * = 0);
+  basic_managed_windows_shared_memory(open_copy_on_write_t, const char *, 
+                                      const void * = 0);
+  basic_managed_windows_shared_memory(open_read_only_t, const char *, 
+                                      const void * = 0);
+  basic_managed_windows_shared_memory(basic_managed_windows_shared_memory &&);
+  basic_managed_windows_shared_memory & 
+  operator=(basic_managed_windows_shared_memory &&);
+  ~basic_managed_windows_shared_memory();
+
+  // public member functions
+  void swap(basic_managed_windows_shared_memory &);
+};
    +
    +

    Description

    +

    A basic managed windows shared memory creation class. Initializes the shared memory segment. Inherits all basic functionality from basic_managed_memory_impl<CharType, AllocationAlgorithm, IndexType> Unlike basic_managed_shared_memory, it has no kernel persistence and the shared memory is destroyed when all processes destroy all their windows_shared_memory objects and mapped regions for the same shared memory or the processes end/crash.

    +

    Warning: basic_managed_windows_shared_memory and basic_managed_shared_memory can't communicate between them.

    +
    +

    +basic_managed_windows_shared_memory + public + construct/copy/destruct

    +
      +
    1. +
      basic_managed_windows_shared_memory();
      +

      Default constructor. Does nothing. Useful in combination with move semantics

      +
      2. +
    2. +
      basic_managed_windows_shared_memory(create_only_t, const char * name, 
+                                    size_type size, const void * addr = 0, 
+                                    const permissions & perm = permissions());
      +

      Creates shared memory and creates and places the segment manager. This can throw.

      +
      3. +
    3. +
      basic_managed_windows_shared_memory(open_or_create_t, const char * name, 
+                                    size_type size, const void * addr = 0, 
+                                    const permissions & perm = permissions());
      +

      Creates shared memory and creates and places the segment manager if segment was not created. If segment was created it connects to the segment. This can throw.

      +
      4. +
    4. +
      basic_managed_windows_shared_memory(open_only_t, const char * name, 
+                                    const void * addr = 0);
      +

      Connects to a created shared memory and its segment manager. This can throw.

      +
      5. +
    5. +
      basic_managed_windows_shared_memory(open_copy_on_write_t, const char * name, 
+                                    const void * addr = 0);
      +

      Connects to a created shared memory and its segment manager in copy_on_write mode. This can throw.

      +
      6. +
    6. +
      basic_managed_windows_shared_memory(open_read_only_t, const char * name, 
+                                    const void * addr = 0);
      +

      Connects to a created shared memory and its segment manager in read-only mode. This can throw.

      +
      7. +
    7. +
      basic_managed_windows_shared_memory(basic_managed_windows_shared_memory && moved);
      +

      Moves the ownership of "moved"'s managed memory to *this. Does not throw

      +
      8. +
    8. +
      basic_managed_windows_shared_memory & 
+operator=(basic_managed_windows_shared_memory && moved);
      +

      Moves the ownership of "moved"'s managed memory to *this. Does not throw

      +
      9. +
    9. +
      ~basic_managed_windows_shared_memory();
      +

      Destroys *this and indicates that the calling process is finished using the resource. All mapped regions are still valid after destruction. When all mapped regions and basic_managed_windows_shared_memory objects referring the shared memory are destroyed, the operating system will destroy the shared memory.

      +
      10. +
    +
    +
    +

    +basic_managed_windows_shared_memory public member functions

    +
    1. +
      void swap(basic_managed_windows_shared_memory & other);
      +

      Swaps the ownership of the managed mapped memories managed by *this and other. Never throws.

      +
    +
    +
    +
    + + + +
    Copyright © 2005-2015 Ion Gaztanaga

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/interprocess/basic_managed__idp39689376.html b/doc/html/boost/interprocess/basic_managed__idp39689376.html new file mode 100644 index 0000000000..980327b5dd --- /dev/null +++ b/doc/html/boost/interprocess/basic_managed__idp39689376.html @@ -0,0 +1,150 @@ + + + + +Class template basic_managed_xsi_shared_memory + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Class template basic_managed_xsi_shared_memory

    +

    boost::interprocess::basic_managed_xsi_shared_memory

    +
    +

    Synopsis

    +
    // In header: <boost/interprocess/managed_xsi_shared_memory.hpp>
+
+template<typename CharType, typename AllocationAlgorithm, 
+         template< class IndexConfig > class IndexType> 
+class basic_managed_xsi_shared_memory {
+public:
+  // types
+  typedef base_t::size_type size_type;
+
+  // construct/copy/destruct
+  basic_managed_xsi_shared_memory();
+  basic_managed_xsi_shared_memory(create_only_t, const xsi_key &, std::size_t, 
+                                  const void * = 0, 
+                                  const permissions & = permissions());
+  basic_managed_xsi_shared_memory(open_or_create_t, const xsi_key &, 
+                                  std::size_t, const void * = 0, 
+                                  const permissions & = permissions());
+  basic_managed_xsi_shared_memory(open_read_only_t, const xsi_key &, 
+                                  const void * = 0);
+  basic_managed_xsi_shared_memory(open_only_t, const xsi_key &, 
+                                  const void * = 0);
+  basic_managed_xsi_shared_memory(basic_managed_xsi_shared_memory &&);
+  basic_managed_xsi_shared_memory & 
+  operator=(basic_managed_xsi_shared_memory &&);
+  ~basic_managed_xsi_shared_memory();
+
+  // public member functions
+  void swap(basic_managed_xsi_shared_memory &);
+  int get_shmid() const;
+
+  // public static functions
+  static bool remove(int);
+};
    +
    +

    Description

    +

    A basic X/Open System Interface (XSI) shared memory named object creation class. Initializes the shared memory segment. Inherits all basic functionality from basic_managed_memory_impl<CharType, AllocationAlgorithm, IndexType>

    +
    +

    +basic_managed_xsi_shared_memory + public + construct/copy/destruct

    +
      +
    1. +
      basic_managed_xsi_shared_memory();
      +

      Default constructor. Does nothing. Useful in combination with move semantics

      +
      2. +
    2. +
      basic_managed_xsi_shared_memory(create_only_t, const xsi_key & key, 
+                                std::size_t size, const void * addr = 0, 
+                                const permissions & perm = permissions());
      +

      Creates shared memory and creates and places the segment manager. This can throw.

      +
      3. +
    3. +
      basic_managed_xsi_shared_memory(open_or_create_t, const xsi_key & key, 
+                                std::size_t size, const void * addr = 0, 
+                                const permissions & perm = permissions());
      +

      Creates shared memory and creates and places the segment manager if segment was not created. If segment was created it connects to the segment. This can throw.

      +
      4. +
    4. +
      basic_managed_xsi_shared_memory(open_read_only_t, const xsi_key & key, 
+                                const void * addr = 0);
      +

      Connects to a created shared memory and its segment manager. in read-only mode. This can throw.

      +
      5. +
    5. +
      basic_managed_xsi_shared_memory(open_only_t, const xsi_key & key, 
+                                const void * addr = 0);
      +

      Connects to a created shared memory and its segment manager. This can throw.

      +
      6. +
    6. +
      basic_managed_xsi_shared_memory(basic_managed_xsi_shared_memory && moved);
      +

      Moves the ownership of "moved"'s managed memory to *this. Does not throw

      +
      7. +
    7. +
      basic_managed_xsi_shared_memory & 
+operator=(basic_managed_xsi_shared_memory && moved);
      +

      Moves the ownership of "moved"'s managed memory to *this. Does not throw

      +
      8. +
    8. +
      ~basic_managed_xsi_shared_memory();
      +

      Destroys *this and indicates that the calling process is finished using the resource. The destructor function will deallocate any system resources allocated by the system for use by this process for this resource. The resource can still be opened again calling the open constructor overload. To erase the resource from the system use remove().

      +
      9. +
    +
    +
    +

    +basic_managed_xsi_shared_memory public member functions

    +
      +
    1. +
      void swap(basic_managed_xsi_shared_memory & other);
      +

      Swaps the ownership of the managed shared memories managed by *this and other. Never throws.

      +
      2. +
    2. int get_shmid() const;
      3. +
    +
    +
    +

    +basic_managed_xsi_shared_memory public static functions

    +
    1. +
      static bool remove(int shmid);
      +

      Erases a XSI shared memory object identified by shmid from the system. Returns false on error. Never throws

      +
    +
    +
    +
    + + + +
    Copyright © 2005-2015 Ion Gaztanaga

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/interprocess/basic_managed__idp55379840.html b/doc/html/boost/interprocess/basic_managed__idp55379840.html deleted file mode 100644 index f693387f94..0000000000 --- a/doc/html/boost/interprocess/basic_managed__idp55379840.html +++ /dev/null @@ -1,103 +0,0 @@ - - - - -Class template basic_managed_external_buffer - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Class template basic_managed_external_buffer

    -

    boost::interprocess::basic_managed_external_buffer

    -
    -

    Synopsis

    -
    // In header: <boost/interprocess/managed_external_buffer.hpp>
-
-template<typename CharType, typename AllocationAlgorithm, 
-         template< class IndexConfig > class IndexType> 
-class basic_managed_external_buffer {
-public:
-  // types
-  typedef base_t::size_type size_type;
-
-  // construct/copy/destruct
-  basic_managed_external_buffer();
-  basic_managed_external_buffer(create_only_t, void *, size_type);
-  basic_managed_external_buffer(open_only_t, void *, size_type);
-  basic_managed_external_buffer(basic_managed_external_buffer &&);
-  basic_managed_external_buffer & operator=(basic_managed_external_buffer &&);
-
-  // public member functions
-  void grow(size_type);
-  void swap(basic_managed_external_buffer &);
-};
    -
    -

    Description

    -

    A basic user memory named object creation class. Inherits all basic functionality from basic_managed_memory_impl<CharType, AllocationAlgorithm, IndexType>

    -
    -

    -basic_managed_external_buffer - public - construct/copy/destruct

    -
      -
    1. -
      basic_managed_external_buffer();
      -

      Default constructor. Does nothing. Useful in combination with move semantics

      -
      2. -
    2. -
      basic_managed_external_buffer(create_only_t, void * addr, size_type size);
      Creates and places the segment manager. This can throw.
      3. -
    3. -
      basic_managed_external_buffer(open_only_t, void * addr, size_type size);
      Creates and places the segment manager. This can throw.
      4. -
    4. -
      basic_managed_external_buffer(basic_managed_external_buffer && moved);
      Moves the ownership of "moved"'s managed memory to *this. Does not throw.
      5. -
    5. -
      basic_managed_external_buffer & 
-operator=(basic_managed_external_buffer && moved);
      Moves the ownership of "moved"'s managed memory to *this. Does not throw.
      6. -
    -
    -
    -

    -basic_managed_external_buffer public member functions

    -
      -
    1. void grow(size_type extra_bytes);
      2. -
    2. -
      void swap(basic_managed_external_buffer & other);
      -

      Swaps the ownership of the managed heap memories managed by *this and other. Never throws.

      -
      3. -
    -
    -
    -
    - - - -
    Copyright © 2005-2015 Ion Gaztanaga

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/interprocess/basic_managed__idp55488352.html b/doc/html/boost/interprocess/basic_managed__idp55488352.html deleted file mode 100644 index 8e51647ffd..0000000000 --- a/doc/html/boost/interprocess/basic_managed__idp55488352.html +++ /dev/null @@ -1,156 +0,0 @@ - - - - -Class template basic_managed_shared_memory - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Class template basic_managed_shared_memory

    -

    boost::interprocess::basic_managed_shared_memory

    -
    -

    Synopsis

    -
    // In header: <boost/interprocess/managed_shared_memory.hpp>
-
-template<typename CharType, typename AllocationAlgorithm, 
-         template< class IndexConfig > class IndexType> 
-class basic_managed_shared_memory {
-public:
-  // construct/copy/destruct
-  basic_managed_shared_memory();
-  basic_managed_shared_memory(create_only_t, const char *, size_type, 
-                              const void * = 0, 
-                              const permissions & = permissions());
-  basic_managed_shared_memory(open_or_create_t, const char *, size_type, 
-                              const void * = 0, 
-                              const permissions & = permissions());
-  basic_managed_shared_memory(open_copy_on_write_t, const char *, 
-                              const void * = 0);
-  basic_managed_shared_memory(open_read_only_t, const char *, 
-                              const void * = 0);
-  basic_managed_shared_memory(open_only_t, const char *, const void * = 0);
-  basic_managed_shared_memory(basic_managed_shared_memory &&);
-  basic_managed_shared_memory & operator=(basic_managed_shared_memory &&);
-  ~basic_managed_shared_memory();
-
-  // public member functions
-  void swap(basic_managed_shared_memory &);
-
-  // public static functions
-  static bool grow(const char *, size_type);
-  static bool shrink_to_fit(const char *);
-};
    -
    -

    Description

    -

    A basic shared memory named object creation class. Initializes the shared memory segment. Inherits all basic functionality from basic_managed_memory_impl<CharType, AllocationAlgorithm, IndexType>

    -
    -

    -basic_managed_shared_memory - public - construct/copy/destruct

    -
      -
    1. -
      basic_managed_shared_memory();
      -

      Default constructor. Does nothing. Useful in combination with move semantics

      -
      2. -
    2. -
      basic_managed_shared_memory(create_only_t, const char * name, size_type size, 
-                            const void * addr = 0, 
-                            const permissions & perm = permissions());
      -

      Creates shared memory and creates and places the segment manager. This can throw.

      -
      3. -
    3. -
      basic_managed_shared_memory(open_or_create_t, const char * name, 
-                            size_type size, const void * addr = 0, 
-                            const permissions & perm = permissions());
      -

      Creates shared memory and creates and places the segment manager if segment was not created. If segment was created it connects to the segment. This can throw.

      -
      4. -
    4. -
      basic_managed_shared_memory(open_copy_on_write_t, const char * name, 
-                            const void * addr = 0);
      -

      Connects to a created shared memory and its segment manager. in copy_on_write mode. This can throw.

      -
      5. -
    5. -
      basic_managed_shared_memory(open_read_only_t, const char * name, 
-                            const void * addr = 0);
      -

      Connects to a created shared memory and its segment manager. in read-only mode. This can throw.

      -
      6. -
    6. -
      basic_managed_shared_memory(open_only_t, const char * name, 
-                            const void * addr = 0);
      -

      Connects to a created shared memory and its segment manager. This can throw.

      -
      7. -
    7. -
      basic_managed_shared_memory(basic_managed_shared_memory && moved);
      -

      Moves the ownership of "moved"'s managed memory to *this. Does not throw

      -
      8. -
    8. -
      basic_managed_shared_memory & operator=(basic_managed_shared_memory && moved);
      -

      Moves the ownership of "moved"'s managed memory to *this. Does not throw

      -
      9. -
    9. -
      ~basic_managed_shared_memory();
      -

      Destroys *this and indicates that the calling process is finished using the resource. The destructor function will deallocate any system resources allocated by the system for use by this process for this resource. The resource can still be opened again calling the open constructor overload. To erase the resource from the system use remove().

      -
      10. -
    -
    -
    -

    -basic_managed_shared_memory public member functions

    -
    1. -
      void swap(basic_managed_shared_memory & other);
      -

      Swaps the ownership of the managed shared memories managed by *this and other. Never throws.

      -
    -
    -
    -

    -basic_managed_shared_memory public static functions

    -
      -
    1. -
      static bool grow(const char * shmname, size_type extra_bytes);
      -

      Tries to resize the managed shared memory object so that we have room for more objects.

      -

      This function is not synchronized so no other thread or process should be reading or writing the file

      -
      2. -
    2. -
      static bool shrink_to_fit(const char * shmname);
      -

      Tries to resize the managed shared memory to minimized the size of the file.

      -

      This function is not synchronized so no other thread or process should be reading or writing the file

      -
      3. -
    -
    -
    -
    - - - -
    Copyright © 2005-2015 Ion Gaztanaga

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/interprocess/basic_managed__idp55546096.html b/doc/html/boost/interprocess/basic_managed__idp55546096.html deleted file mode 100644 index cbbd9fa9d0..0000000000 --- a/doc/html/boost/interprocess/basic_managed__idp55546096.html +++ /dev/null @@ -1,143 +0,0 @@ - - - - -Class template basic_managed_windows_shared_memory - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Class template basic_managed_windows_shared_memory

    -

    boost::interprocess::basic_managed_windows_shared_memory

    -
    -

    Synopsis

    -
    // In header: <boost/interprocess/managed_windows_shared_memory.hpp>
-
-template<typename CharType, typename AllocationAlgorithm, 
-         template< class IndexConfig > class IndexType> 
-class basic_managed_windows_shared_memory {
-public:
-  // types
-  typedef base_t::size_type size_type;
-
-  // construct/copy/destruct
-  basic_managed_windows_shared_memory();
-  basic_managed_windows_shared_memory(create_only_t, const char *, size_type, 
-                                      const void * = 0, 
-                                      const permissions & = permissions());
-  basic_managed_windows_shared_memory(open_or_create_t, const char *, 
-                                      size_type, const void * = 0, 
-                                      const permissions & = permissions());
-  basic_managed_windows_shared_memory(open_only_t, const char *, 
-                                      const void * = 0);
-  basic_managed_windows_shared_memory(open_copy_on_write_t, const char *, 
-                                      const void * = 0);
-  basic_managed_windows_shared_memory(open_read_only_t, const char *, 
-                                      const void * = 0);
-  basic_managed_windows_shared_memory(basic_managed_windows_shared_memory &&);
-  basic_managed_windows_shared_memory & 
-  operator=(basic_managed_windows_shared_memory &&);
-  ~basic_managed_windows_shared_memory();
-
-  // public member functions
-  void swap(basic_managed_windows_shared_memory &);
-};
    -
    -

    Description

    -

    A basic managed windows shared memory creation class. Initializes the shared memory segment. Inherits all basic functionality from basic_managed_memory_impl<CharType, AllocationAlgorithm, IndexType> Unlike basic_managed_shared_memory, it has no kernel persistence and the shared memory is destroyed when all processes destroy all their windows_shared_memory objects and mapped regions for the same shared memory or the processes end/crash.

    -

    Warning: basic_managed_windows_shared_memory and basic_managed_shared_memory can't communicate between them.

    -
    -

    -basic_managed_windows_shared_memory - public - construct/copy/destruct

    -
      -
    1. -
      basic_managed_windows_shared_memory();
      -

      Default constructor. Does nothing. Useful in combination with move semantics

      -
      2. -
    2. -
      basic_managed_windows_shared_memory(create_only_t, const char * name, 
-                                    size_type size, const void * addr = 0, 
-                                    const permissions & perm = permissions());
      -

      Creates shared memory and creates and places the segment manager. This can throw.

      -
      3. -
    3. -
      basic_managed_windows_shared_memory(open_or_create_t, const char * name, 
-                                    size_type size, const void * addr = 0, 
-                                    const permissions & perm = permissions());
      -

      Creates shared memory and creates and places the segment manager if segment was not created. If segment was created it connects to the segment. This can throw.

      -
      4. -
    4. -
      basic_managed_windows_shared_memory(open_only_t, const char * name, 
-                                    const void * addr = 0);
      -

      Connects to a created shared memory and its segment manager. This can throw.

      -
      5. -
    5. -
      basic_managed_windows_shared_memory(open_copy_on_write_t, const char * name, 
-                                    const void * addr = 0);
      -

      Connects to a created shared memory and its segment manager in copy_on_write mode. This can throw.

      -
      6. -
    6. -
      basic_managed_windows_shared_memory(open_read_only_t, const char * name, 
-                                    const void * addr = 0);
      -

      Connects to a created shared memory and its segment manager in read-only mode. This can throw.

      -
      7. -
    7. -
      basic_managed_windows_shared_memory(basic_managed_windows_shared_memory && moved);
      -

      Moves the ownership of "moved"'s managed memory to *this. Does not throw

      -
      8. -
    8. -
      basic_managed_windows_shared_memory & 
-operator=(basic_managed_windows_shared_memory && moved);
      -

      Moves the ownership of "moved"'s managed memory to *this. Does not throw

      -
      9. -
    9. -
      ~basic_managed_windows_shared_memory();
      -

      Destroys *this and indicates that the calling process is finished using the resource. All mapped regions are still valid after destruction. When all mapped regions and basic_managed_windows_shared_memory objects referring the shared memory are destroyed, the operating system will destroy the shared memory.

      -
      10. -
    -
    -
    -

    -basic_managed_windows_shared_memory public member functions

    -
    1. -
      void swap(basic_managed_windows_shared_memory & other);
      -

      Swaps the ownership of the managed mapped memories managed by *this and other. Never throws.

      -
    -
    -
    -
    - - - -
    Copyright © 2005-2015 Ion Gaztanaga

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/interprocess/basic_managed__idp55594816.html b/doc/html/boost/interprocess/basic_managed__idp55594816.html deleted file mode 100644 index ea81ee65e3..0000000000 --- a/doc/html/boost/interprocess/basic_managed__idp55594816.html +++ /dev/null @@ -1,150 +0,0 @@ - - - - -Class template basic_managed_xsi_shared_memory - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Class template basic_managed_xsi_shared_memory

    -

    boost::interprocess::basic_managed_xsi_shared_memory

    -
    -

    Synopsis

    -
    // In header: <boost/interprocess/managed_xsi_shared_memory.hpp>
-
-template<typename CharType, typename AllocationAlgorithm, 
-         template< class IndexConfig > class IndexType> 
-class basic_managed_xsi_shared_memory {
-public:
-  // types
-  typedef base_t::size_type size_type;
-
-  // construct/copy/destruct
-  basic_managed_xsi_shared_memory();
-  basic_managed_xsi_shared_memory(create_only_t, const xsi_key &, std::size_t, 
-                                  const void * = 0, 
-                                  const permissions & = permissions());
-  basic_managed_xsi_shared_memory(open_or_create_t, const xsi_key &, 
-                                  std::size_t, const void * = 0, 
-                                  const permissions & = permissions());
-  basic_managed_xsi_shared_memory(open_read_only_t, const xsi_key &, 
-                                  const void * = 0);
-  basic_managed_xsi_shared_memory(open_only_t, const xsi_key &, 
-                                  const void * = 0);
-  basic_managed_xsi_shared_memory(basic_managed_xsi_shared_memory &&);
-  basic_managed_xsi_shared_memory & 
-  operator=(basic_managed_xsi_shared_memory &&);
-  ~basic_managed_xsi_shared_memory();
-
-  // public member functions
-  void swap(basic_managed_xsi_shared_memory &);
-  int get_shmid() const;
-
-  // public static functions
-  static bool remove(int);
-};
    -
    -

    Description

    -

    A basic X/Open System Interface (XSI) shared memory named object creation class. Initializes the shared memory segment. Inherits all basic functionality from basic_managed_memory_impl<CharType, AllocationAlgorithm, IndexType>

    -
    -

    -basic_managed_xsi_shared_memory - public - construct/copy/destruct

    -
      -
    1. -
      basic_managed_xsi_shared_memory();
      -

      Default constructor. Does nothing. Useful in combination with move semantics

      -
      2. -
    2. -
      basic_managed_xsi_shared_memory(create_only_t, const xsi_key & key, 
-                                std::size_t size, const void * addr = 0, 
-                                const permissions & perm = permissions());
      -

      Creates shared memory and creates and places the segment manager. This can throw.

      -
      3. -
    3. -
      basic_managed_xsi_shared_memory(open_or_create_t, const xsi_key & key, 
-                                std::size_t size, const void * addr = 0, 
-                                const permissions & perm = permissions());
      -

      Creates shared memory and creates and places the segment manager if segment was not created. If segment was created it connects to the segment. This can throw.

      -
      4. -
    4. -
      basic_managed_xsi_shared_memory(open_read_only_t, const xsi_key & key, 
-                                const void * addr = 0);
      -

      Connects to a created shared memory and its segment manager. in read-only mode. This can throw.

      -
      5. -
    5. -
      basic_managed_xsi_shared_memory(open_only_t, const xsi_key & key, 
-                                const void * addr = 0);
      -

      Connects to a created shared memory and its segment manager. This can throw.

      -
      6. -
    6. -
      basic_managed_xsi_shared_memory(basic_managed_xsi_shared_memory && moved);
      -

      Moves the ownership of "moved"'s managed memory to *this. Does not throw

      -
      7. -
    7. -
      basic_managed_xsi_shared_memory & 
-operator=(basic_managed_xsi_shared_memory && moved);
      -

      Moves the ownership of "moved"'s managed memory to *this. Does not throw

      -
      8. -
    8. -
      ~basic_managed_xsi_shared_memory();
      -

      Destroys *this and indicates that the calling process is finished using the resource. The destructor function will deallocate any system resources allocated by the system for use by this process for this resource. The resource can still be opened again calling the open constructor overload. To erase the resource from the system use remove().

      -
      9. -
    -
    -
    -

    -basic_managed_xsi_shared_memory public member functions

    -
      -
    1. -
      void swap(basic_managed_xsi_shared_memory & other);
      -

      Swaps the ownership of the managed shared memories managed by *this and other. Never throws.

      -
      2. -
    2. int get_shmid() const;
      3. -
    -
    -
    -

    -basic_managed_xsi_shared_memory public static functions

    -
    1. -
      static bool remove(int shmid);
      -

      Erases a XSI shared memory object identified by shmid from the system. Returns false on error. Never throws

      -
    -
    -
    -
    - - - -
    Copyright © 2005-2015 Ion Gaztanaga

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/interprocess/basic_managed_heap_memory.html b/doc/html/boost/interprocess/basic_managed_heap_memory.html index bca3fd8f74..f895802458 100644 --- a/doc/html/boost/interprocess/basic_managed_heap_memory.html +++ b/doc/html/boost/interprocess/basic_managed_heap_memory.html @@ -40,15 +40,15 @@ typedef base_t::size_type size_type; // construct/copy/destruct - basic_managed_heap_memory(); - basic_managed_heap_memory(size_type); - basic_managed_heap_memory(basic_managed_heap_memory &&); - basic_managed_heap_memory & operator=(basic_managed_heap_memory &&); - ~basic_managed_heap_memory(); + basic_managed_heap_memory(); + basic_managed_heap_memory(size_type); + basic_managed_heap_memory(basic_managed_heap_memory &&); + basic_managed_heap_memory & operator=(basic_managed_heap_memory &&); + ~basic_managed_heap_memory(); - // public member functions - bool grow(size_type); - void swap(basic_managed_heap_memory &); + // public member functions + bool grow(size_type); + void swap(basic_managed_heap_memory &); };

    Description

    @@ -60,33 +60,33 @@ construct/copy/destruct
    1. -
      basic_managed_heap_memory();
      +
      basic_managed_heap_memory();

      Default constructor. Does nothing. Useful in combination with move semantics

    2. -
      basic_managed_heap_memory(size_type size);
      +
      basic_managed_heap_memory(size_type size);

      Creates heap memory and initializes the segment manager. This can throw.

    3. -
      basic_managed_heap_memory(basic_managed_heap_memory && moved);
      Moves the ownership of "moved"'s managed memory to *this. Does not throw.
      4. +
      basic_managed_heap_memory(basic_managed_heap_memory && moved);
      Moves the ownership of "moved"'s managed memory to *this. Does not throw.
    4. -
      basic_managed_heap_memory & operator=(basic_managed_heap_memory && moved);
      Moves the ownership of "moved"'s managed memory to *this. Does not throw.
      5. +
      basic_managed_heap_memory & operator=(basic_managed_heap_memory && moved);
      Moves the ownership of "moved"'s managed memory to *this. Does not throw.
    5. -
      ~basic_managed_heap_memory();
      +
      ~basic_managed_heap_memory();

      Destructor. Liberates the heap memory holding the managed data. Never throws.

    -basic_managed_heap_memory public member functions

    +basic_managed_heap_memory public member functions
    1. -
      bool grow(size_type extra_bytes);
      +
      bool grow(size_type extra_bytes);

      Tries to resize internal heap memory so that we have room for more objects. WARNING: If memory is reallocated, all the objects will be binary-copied to the new buffer. To be able to use this function, all pointers constructed in this buffer must be offset pointers. Otherwise, the result is undefined. Returns true if the growth has been successful, so you will have some extra bytes to allocate new objects. If returns false, the heap allocation has failed.

    2. -
      void swap(basic_managed_heap_memory & other);
      +
      void swap(basic_managed_heap_memory & other);

      Swaps the ownership of the managed heap memories managed by *this and other. Never throws.

    diff --git a/doc/html/boost/interprocess/basic_managed_mapped_file.html b/doc/html/boost/interprocess/basic_managed_mapped_file.html index ca25d5097c..98d5fa066b 100644 --- a/doc/html/boost/interprocess/basic_managed_mapped_file.html +++ b/doc/html/boost/interprocess/basic_managed_mapped_file.html @@ -40,28 +40,28 @@ typedef implementation_defined size_type; // construct/copy/destruct - basic_managed_mapped_file(); - basic_managed_mapped_file(create_only_t, const char *, size_type, + basic_managed_mapped_file(); + basic_managed_mapped_file(create_only_t, const char *, size_type, const void * = 0, const permissions & = permissions()); - basic_managed_mapped_file(open_or_create_t, const char *, size_type, + basic_managed_mapped_file(open_or_create_t, const char *, size_type, const void * = 0, const permissions & = permissions()); - basic_managed_mapped_file(open_only_t, const char *, const void * = 0); - basic_managed_mapped_file(open_copy_on_write_t, const char *, + basic_managed_mapped_file(open_only_t, const char *, const void * = 0); + basic_managed_mapped_file(open_copy_on_write_t, const char *, const void * = 0); - basic_managed_mapped_file(open_read_only_t, const char *, const void * = 0); - basic_managed_mapped_file(basic_managed_mapped_file &&); - basic_managed_mapped_file & operator=(basic_managed_mapped_file &&); - ~basic_managed_mapped_file(); + basic_managed_mapped_file(open_read_only_t, const char *, const void * = 0); + basic_managed_mapped_file(basic_managed_mapped_file &&); + basic_managed_mapped_file & operator=(basic_managed_mapped_file &&); + ~basic_managed_mapped_file(); - // public member functions - void swap(basic_managed_mapped_file &); - bool flush(); + // public member functions + void swap(basic_managed_mapped_file &); + bool flush(); - // public static functions - static bool grow(const char *, size_type); - static bool shrink_to_fit(const char *); + // public static functions + static bool grow(const char *, size_type); + static bool shrink_to_fit(const char *); };

    Description

    @@ -84,75 +84,75 @@ construct/copy/destruct
    1. -
      basic_managed_mapped_file();
      +
      basic_managed_mapped_file();

      Creates mapped file and creates and places the segment manager. This can throw.

    2. -
      basic_managed_mapped_file(create_only_t, const char * name, size_type size, 
+
      basic_managed_mapped_file(create_only_t, const char * name, size_type size, 
                           const void * addr = 0, 
                           const permissions & perm = permissions());
      
 
      Creates mapped file and creates and places the segment manager. This can throw.
    3. -
      basic_managed_mapped_file(open_or_create_t, const char * name, size_type size, 
+
      basic_managed_mapped_file(open_or_create_t, const char * name, size_type size, 
                           const void * addr = 0, 
                           const permissions & perm = permissions());
      
 
      Creates mapped file and creates and places the segment manager if segment was not created. If segment was created it connects to the segment. This can throw.
    4. -
      basic_managed_mapped_file(open_only_t, const char * name, 
+
      basic_managed_mapped_file(open_only_t, const char * name, 
                           const void * addr = 0);
      
 
      Connects to a created mapped file and its segment manager. This can throw.
    5. -
      basic_managed_mapped_file(open_copy_on_write_t, const char * name, 
+
      basic_managed_mapped_file(open_copy_on_write_t, const char * name, 
                           const void * addr = 0);
      
 
      Connects to a created mapped file and its segment manager in copy_on_write mode. This can throw.
    6. -
      basic_managed_mapped_file(open_read_only_t, const char * name, 
+
      basic_managed_mapped_file(open_read_only_t, const char * name, 
                           const void * addr = 0);
      
 
      Connects to a created mapped file and its segment manager in read-only mode. This can throw.
    7. -
      basic_managed_mapped_file(basic_managed_mapped_file && moved);
      +
      basic_managed_mapped_file(basic_managed_mapped_file && moved);

      Moves the ownership of "moved"'s managed memory to *this. Does not throw

    8. -
      basic_managed_mapped_file & operator=(basic_managed_mapped_file && moved);
      +
      basic_managed_mapped_file & operator=(basic_managed_mapped_file && moved);

      Moves the ownership of "moved"'s managed memory to *this. Does not throw

    9. -
      ~basic_managed_mapped_file();
      +
      ~basic_managed_mapped_file();

      Destroys *this and indicates that the calling process is finished using the resource. The destructor function will deallocate any system resources allocated by the system for use by this process for this resource. The resource can still be opened again calling the open constructor overload. To erase the resource from the system use remove().

    -basic_managed_mapped_file public member functions

    +basic_managed_mapped_file public member functions
    1. -
      void swap(basic_managed_mapped_file & other);
      +
      void swap(basic_managed_mapped_file & other);

      Swaps the ownership of the managed mapped memories managed by *this and other. Never throws.

    2. -
      bool flush();
      +
      bool flush();

      Flushes cached data to file. Never throws

    -basic_managed_mapped_file public static functions

    +basic_managed_mapped_file public static functions
    1. -
      static bool grow(const char * filename, size_type extra_bytes);
      +
      static bool grow(const char * filename, size_type extra_bytes);

      Tries to resize mapped file so that we have room for more objects.

      This function is not synchronized so no other thread or process should be reading or writing the file

    2. -
      static bool shrink_to_fit(const char * filename);
      +
      static bool shrink_to_fit(const char * filename);

      Tries to resize mapped file to minimized the size of the file.

      This function is not synchronized so no other thread or process should be reading or writing the file

      3. diff --git a/doc/html/boost/interprocess/basic_obufferstream.html b/doc/html/boost/interprocess/basic_obufferstream.html index cdddb9d1f7..26727eaff0 100644 --- a/doc/html/boost/interprocess/basic_obufferstream.html +++ b/doc/html/boost/interprocess/basic_obufferstream.html @@ -43,15 +43,15 @@ typedef std::basic_ios< char_type, CharTraits >::traits_type traits_type; // construct/copy/destruct - basic_obufferstream(std::ios_base::openmode = std::ios_base::out); - basic_obufferstream(CharT *, std::size_t, + basic_obufferstream(std::ios_base::openmode = std::ios_base::out); + basic_obufferstream(CharT *, std::size_t, std::ios_base::openmode = std::ios_base::out); - ~basic_obufferstream(); + ~basic_obufferstream(); - // public member functions - basic_bufferbuf< CharT, CharTraits > * rdbuf() const; - std::pair< CharT *, std::size_t > buffer() const; - void buffer(CharT *, std::size_t); + // public member functions + basic_bufferbuf< CharT, CharTraits > * rdbuf() const; + std::pair< CharT *, std::size_t > buffer() const; + void buffer(CharT *, std::size_t); };

    Description

    @@ -63,31 +63,31 @@ construct/copy/destruct
    1. -
      basic_obufferstream(std::ios_base::openmode mode = std::ios_base::out);
      +
      basic_obufferstream(std::ios_base::openmode mode = std::ios_base::out);

      Constructor. Does not throw.

    2. -
      basic_obufferstream(CharT * buf, std::size_t length, 
+
      basic_obufferstream(CharT * buf, std::size_t length, 
                     std::ios_base::openmode mode = std::ios_base::out);
      
 
      Constructor. Assigns formatting buffer. Does not throw.
      3. -
    3. ~basic_obufferstream();
      4. +
    4. ~basic_obufferstream();

    -basic_obufferstream public member functions

    +basic_obufferstream public member functions
    1. -
      basic_bufferbuf< CharT, CharTraits > * rdbuf() const;
      +
      basic_bufferbuf< CharT, CharTraits > * rdbuf() const;

      Returns the address of the stored stream buffer.

    2. -
      std::pair< CharT *, std::size_t > buffer() const;
      +
      std::pair< CharT *, std::size_t > buffer() const;

      Returns the pointer and size of the internal buffer. Does not throw.

    3. -
      void buffer(CharT * buf, std::size_t length);
      +
      void buffer(CharT * buf, std::size_t length);

      Sets the underlying buffer to a new value. Resets stream position. Does not throw.

    diff --git a/doc/html/boost/interprocess/basic_ovectorstream.html b/doc/html/boost/interprocess/basic_ovectorstream.html index 02f7bb85a3..04b3fb03fd 100644 --- a/doc/html/boost/interprocess/basic_ovectorstream.html +++ b/doc/html/boost/interprocess/basic_ovectorstream.html @@ -46,16 +46,16 @@ typedef std::basic_ios< char_type, CharTraits >::traits_type traits_type; // construct/copy/destruct - basic_ovectorstream(std::ios_base::openmode = std::ios_base::out); + basic_ovectorstream(std::ios_base::openmode = std::ios_base::out); template<typename VectorParameter> - basic_ovectorstream(const VectorParameter &, + basic_ovectorstream(const VectorParameter &, std::ios_base::openmode = std::ios_base::out); - // public member functions - basic_vectorbuf< CharVector, CharTraits > * rdbuf() const; - void swap_vector(vector_type &); - const vector_type & vector() const; - void reserve(typename vector_type::size_type); + // public member functions + basic_vectorbuf< CharVector, CharTraits > * rdbuf() const; + void swap_vector(vector_type &); + const vector_type & vector() const; + void reserve(typename vector_type::size_type); };

    Description

    @@ -67,12 +67,12 @@ construct/copy/destruct
    1. -
      basic_ovectorstream(std::ios_base::openmode mode = std::ios_base::out);
      +
      basic_ovectorstream(std::ios_base::openmode mode = std::ios_base::out);

      Constructor. Throws if vector_type default constructor throws. 

    2. template<typename VectorParameter> 
-  basic_ovectorstream(const VectorParameter & param, 
+  basic_ovectorstream(const VectorParameter & param, 
                       std::ios_base::openmode mode = std::ios_base::out);

      Constructor. Throws if vector_type(const VectorParameter &param) throws.

      3. @@ -80,22 +80,22 @@

    -basic_ovectorstream public member functions

    +basic_ovectorstream public member functions
    1. -
      basic_vectorbuf< CharVector, CharTraits > * rdbuf() const;
      +
      basic_vectorbuf< CharVector, CharTraits > * rdbuf() const;

      Returns the address of the stored stream buffer.

    2. -
      void swap_vector(vector_type & vect);
      +
      void swap_vector(vector_type & vect);

      Swaps the underlying vector with the passed vector. This function resets the write position in the stream. Does not throw.

    3. -
      const vector_type & vector() const;
      +
      const vector_type & vector() const;

      Returns a const reference to the internal vector. Does not throw.

    4. -
      void reserve(typename vector_type::size_type size);
      +
      void reserve(typename vector_type::size_type size);

      Calls reserve() method of the internal vector. Resets the stream to the first position. Throws if the internals vector's reserve throws.

    diff --git a/doc/html/boost/interprocess/basic_vectorbuf.html b/doc/html/boost/interprocess/basic_vectorbuf.html index 13c5a2d87b..3fd1712d48 100644 --- a/doc/html/boost/interprocess/basic_vectorbuf.html +++ b/doc/html/boost/interprocess/basic_vectorbuf.html @@ -46,16 +46,16 @@ typedef CharTraits traits_type; // construct/copy/destruct - explicit basic_vectorbuf(std::ios_base::openmode = std::ios_base::in|std::ios_base::out); + explicit basic_vectorbuf(std::ios_base::openmode = std::ios_base::in|std::ios_base::out); template<typename VectorParameter> - explicit basic_vectorbuf(const VectorParameter &, + explicit basic_vectorbuf(const VectorParameter &, std::ios_base::openmode = std::ios_base::in|std::ios_base::out); - // public member functions - void swap_vector(vector_type &); - const vector_type & vector() const; - void reserve(typename vector_type::size_type); - void clear(); + // public member functions + void swap_vector(vector_type &); + const vector_type & vector() const; + void reserve(typename vector_type::size_type); + void clear(); };

    Description

    @@ -67,12 +67,12 @@ construct/copy/destruct
    1. -
      explicit basic_vectorbuf(std::ios_base::openmode mode = std::ios_base::in|std::ios_base::out);
      +
      explicit basic_vectorbuf(std::ios_base::openmode mode = std::ios_base::in|std::ios_base::out);

      Constructor. Throws if vector_type default constructor throws. 

    2. template<typename VectorParameter> 
-  explicit basic_vectorbuf(const VectorParameter & param, 
+  explicit basic_vectorbuf(const VectorParameter & param, 
                            std::ios_base::openmode mode = std::ios_base::in|std::ios_base::out);

      Constructor. Throws if vector_type(const VectorParameter &param) throws.

      3. @@ -80,22 +80,22 @@

    -basic_vectorbuf public member functions

    +basic_vectorbuf public member functions
    1. -
      void swap_vector(vector_type & vect);
      +
      void swap_vector(vector_type & vect);

      Swaps the underlying vector with the passed vector. This function resets the read/write position in the stream. Does not throw.

    2. -
      const vector_type & vector() const;
      +
      const vector_type & vector() const;

      Returns a const reference to the internal vector. Does not throw.

    3. -
      void reserve(typename vector_type::size_type size);
      +
      void reserve(typename vector_type::size_type size);

      Preallocates memory from the internal vector. Resets the stream to the first position. Throws if the internals vector's memory allocation throws.

    4. -
      void clear();
      +
      void clear();

      Calls clear() method of the internal vector. Resets the stream to the first position.

    diff --git a/doc/html/boost/interprocess/basic_vectorstream.html b/doc/html/boost/interprocess/basic_vectorstream.html index 1b787c8e49..c8f0ed0af0 100644 --- a/doc/html/boost/interprocess/basic_vectorstream.html +++ b/doc/html/boost/interprocess/basic_vectorstream.html @@ -46,17 +46,17 @@ typedef std::basic_ios< char_type, CharTraits >::traits_type traits_type; // construct/copy/destruct - basic_vectorstream(std::ios_base::openmode = std::ios_base::in|std::ios_base::out); + basic_vectorstream(std::ios_base::openmode = std::ios_base::in|std::ios_base::out); template<typename VectorParameter> - basic_vectorstream(const VectorParameter &, + basic_vectorstream(const VectorParameter &, std::ios_base::openmode = std::ios_base::in|std::ios_base::out); - // public member functions - basic_vectorbuf< CharVector, CharTraits > * rdbuf() const; - void swap_vector(vector_type &); - const vector_type & vector() const; - void reserve(typename vector_type::size_type); - void clear(); + // public member functions + basic_vectorbuf< CharVector, CharTraits > * rdbuf() const; + void swap_vector(vector_type &); + const vector_type & vector() const; + void reserve(typename vector_type::size_type); + void clear(); };

    Description

    @@ -68,12 +68,12 @@ construct/copy/destruct
    1. -
      basic_vectorstream(std::ios_base::openmode mode = std::ios_base::in|std::ios_base::out);
      +
      basic_vectorstream(std::ios_base::openmode mode = std::ios_base::in|std::ios_base::out);

      Constructor. Throws if vector_type default constructor throws. 

    2. template<typename VectorParameter> 
-  basic_vectorstream(const VectorParameter & param, 
+  basic_vectorstream(const VectorParameter & param, 
                      std::ios_base::openmode mode = std::ios_base::in|std::ios_base::out);

      Constructor. Throws if vector_type(const VectorParameter &param) throws.

      3. @@ -81,23 +81,23 @@

    -basic_vectorstream public member functions

    +basic_vectorstream public member functions
      -
    1. basic_vectorbuf< CharVector, CharTraits > * rdbuf() const;
      2. +
    2. basic_vectorbuf< CharVector, CharTraits > * rdbuf() const;
    3. -
      void swap_vector(vector_type & vect);
      +
      void swap_vector(vector_type & vect);

      Swaps the underlying vector with the passed vector. This function resets the read/write position in the stream. Does not throw.

    4. -
      const vector_type & vector() const;
      +
      const vector_type & vector() const;

      Returns a const reference to the internal vector. Does not throw.

    5. -
      void reserve(typename vector_type::size_type size);
      +
      void reserve(typename vector_type::size_type size);

      Calls reserve() method of the internal vector. Resets the stream to the first position. Throws if the internals vector's reserve throws.

    6. -
      void clear();
      +
      void clear();

      Calls clear() method of the internal vector. Resets the stream to the first position.

    diff --git a/doc/html/boost/interprocess/cached_adaptive_pool.html b/doc/html/boost/interprocess/cached_adaptive_pool.html index 2c1226b5fe..7844b23088 100644 --- a/doc/html/boost/interprocess/cached_adaptive_pool.html +++ b/doc/html/boost/interprocess/cached_adaptive_pool.html @@ -7,7 +7,7 @@ - + @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -55,43 +55,43 @@ }; // construct/copy/destruct - cached_adaptive_pool(segment_manager *); - cached_adaptive_pool(const cached_adaptive_pool &); + cached_adaptive_pool(segment_manager *); + cached_adaptive_pool(const cached_adaptive_pool &); template<typename T2> - cached_adaptive_pool(const cached_adaptive_pool< T2, SegmentManager, NodesPerBlock, MaxFreeBlocks, OverheadPercent > &); + cached_adaptive_pool(const cached_adaptive_pool< T2, SegmentManager, NodesPerBlock, MaxFreeBlocks, OverheadPercent > &); template<typename T2, typename SegmentManager2, std::size_t N2, std::size_t F2, unsigned char OP2> cached_adaptive_pool & - operator=(const cached_adaptive_pool< T2, SegmentManager2, N2, F2, OP2 > &); - cached_adaptive_pool & operator=(const cached_adaptive_pool &); - ~cached_adaptive_pool(); + operator=(const cached_adaptive_pool< T2, SegmentManager2, N2, F2, OP2 > &); + cached_adaptive_pool & operator=(const cached_adaptive_pool &); + ~cached_adaptive_pool(); - // public member functions - node_pool_t * get_node_pool() const; - segment_manager * get_segment_manager() const; - size_type max_size() const; - pointer allocate(size_type, cvoid_pointer = 0); - void deallocate(const pointer &, size_type); - void deallocate_free_blocks(); - pointer address(reference) const; - const_pointer address(const_reference) const; - void construct(const pointer &, const_reference); - void destroy(const pointer &); - size_type size(const pointer &) const; - pointer allocation_command(boost::interprocess::allocation_type, size_type, + // public member functions + node_pool_t * get_node_pool() const; + segment_manager * get_segment_manager() const; + size_type max_size() const; + pointer allocate(size_type, cvoid_pointer = 0); + void deallocate(const pointer &, size_type); + void deallocate_free_blocks(); + pointer address(reference) const; + const_pointer address(const_reference) const; + void construct(const pointer &, const_reference); + void destroy(const pointer &); + size_type size(const pointer &) const; + pointer allocation_command(boost::interprocess::allocation_type, size_type, size_type &, pointer &); - void allocate_many(size_type, size_type, multiallocation_chain &); - void allocate_many(const size_type *, size_type, multiallocation_chain &); - void deallocate_many(multiallocation_chain &); - pointer allocate_one(); - multiallocation_chain allocate_individual(size_type); - void deallocate_one(const pointer &); - void deallocate_individual(multiallocation_chain &); - void set_max_cached_nodes(size_type); - size_type get_max_cached_nodes() const; + void allocate_many(size_type, size_type, multiallocation_chain &); + void allocate_many(const size_type *, size_type, multiallocation_chain &); + void deallocate_many(multiallocation_chain &); + pointer allocate_one(); + multiallocation_chain allocate_individual(size_type); + void deallocate_one(const pointer &); + void deallocate_individual(multiallocation_chain &); + void set_max_cached_nodes(size_type); + size_type get_max_cached_nodes() const; - // friend functions - friend void swap(self_t &, self_t &); + // friend functions + friend void swap(self_t &, self_t &); };

    Description

    @@ -106,132 +106,132 @@ construct/copy/destruct
    1. -
      cached_adaptive_pool(segment_manager * segment_mngr);
      +
      cached_adaptive_pool(segment_manager * segment_mngr);

      Constructor from a segment manager. If not present, constructs a node pool. Increments the reference count of the associated node pool. Can throw boost::interprocess::bad_alloc

    2. -
      cached_adaptive_pool(const cached_adaptive_pool & other);
      +
      cached_adaptive_pool(const cached_adaptive_pool & other);

      Copy constructor from other cached_adaptive_pool. Increments the reference count of the associated node pool. Never throws 

    3. template<typename T2> 
-  cached_adaptive_pool(const cached_adaptive_pool< T2, SegmentManager, NodesPerBlock, MaxFreeBlocks, OverheadPercent > & other);
      + cached_adaptive_pool(const cached_adaptive_pool< T2, SegmentManager, NodesPerBlock, MaxFreeBlocks, OverheadPercent > & other);

      Copy constructor from related cached_adaptive_pool. If not present, constructs a node pool. Increments the reference count of the associated node pool. Can throw boost::interprocess::bad_alloc 

    4. template<typename T2, typename SegmentManager2, std::size_t N2, 
          std::size_t F2, unsigned char OP2> 
   cached_adaptive_pool & 
-  operator=(const cached_adaptive_pool< T2, SegmentManager2, N2, F2, OP2 > &);
      + operator=(const cached_adaptive_pool< T2, SegmentManager2, N2, F2, OP2 > &);

      Not assignable from related cached_adaptive_pool

    5. -
      cached_adaptive_pool & operator=(const cached_adaptive_pool &);
      +
      cached_adaptive_pool & operator=(const cached_adaptive_pool &);

      Not assignable from other cached_adaptive_pool

    6. -
      ~cached_adaptive_pool();
      +
      ~cached_adaptive_pool();

      Destructor, removes node_pool_t from memory if its reference count reaches to zero. Never throws

    -cached_adaptive_pool public member functions

    +cached_adaptive_pool public member functions
    1. -
      node_pool_t * get_node_pool() const;
      +
      node_pool_t * get_node_pool() const;

      Returns a pointer to the node pool. Never throws

    2. -
      segment_manager * get_segment_manager() const;
      +
      segment_manager * get_segment_manager() const;

      Returns the segment manager. Never throws

    3. -
      size_type max_size() const;
      +
      size_type max_size() const;

      Returns the number of elements that could be allocated. Never throws

    4. -
      pointer allocate(size_type count, cvoid_pointer hint = 0);
      +
      pointer allocate(size_type count, cvoid_pointer hint = 0);

      Allocate memory for an array of count elements. Throws boost::interprocess::bad_alloc if there is no enough memory

    5. -
      void deallocate(const pointer & ptr, size_type count);
      +
      void deallocate(const pointer & ptr, size_type count);

      Deallocate allocated memory. Never throws

    6. -
      void deallocate_free_blocks();
      +
      void deallocate_free_blocks();

      Deallocates all free blocks of the pool

    7. -
      pointer address(reference value) const;
      +
      pointer address(reference value) const;

      Returns address of mutable object. Never throws

    8. -
      const_pointer address(const_reference value) const;
      +
      const_pointer address(const_reference value) const;

      Returns address of non mutable object. Never throws

    9. -
      void construct(const pointer & ptr, const_reference v);
      +
      void construct(const pointer & ptr, const_reference v);

      Copy construct an object. Throws if T's copy constructor throws

    10. -
      void destroy(const pointer & ptr);
      +
      void destroy(const pointer & ptr);

      Destroys object. Throws if object's destructor throws

    11. -
      size_type size(const pointer & p) const;
      +
      size_type size(const pointer & p) const;

      Returns maximum the number of objects the previously allocated memory pointed by p can hold. This size only works for memory allocated with allocate, allocation_command and allocate_many.

      12. -
    12. pointer allocation_command(boost::interprocess::allocation_type command, 
+
    13. pointer allocation_command(boost::interprocess::allocation_type command, 
                            size_type limit_size, 
                            size_type & prefer_in_recvd_out_size, 
                            pointer & reuse);
      14. 
 
    14. 
-
      void allocate_many(size_type elem_size, size_type num_elements, 
+
      void allocate_many(size_type elem_size, size_type num_elements, 
                    multiallocation_chain & chain);
      
 
      Allocates many elements of size elem_size in a contiguous block of memory. The minimum number to be allocated is min_elements, the preferred and maximum number is preferred_elements. The number of actually allocated elements is will be assigned to received_size. The elements must be deallocated with deallocate(...) 
      
 
      15. 
 
    15. 
-
      void allocate_many(const size_type * elem_sizes, size_type n_elements, 
+
      void allocate_many(const size_type * elem_sizes, size_type n_elements, 
                    multiallocation_chain & chain);
      
 
      Allocates n_elements elements, each one of size elem_sizes[i]in a contiguous block of memory. The elements must be deallocated 
      
 
      16. 
 
    16. 
-
      void deallocate_many(multiallocation_chain & chain);
      
+
      void deallocate_many(multiallocation_chain & chain);
      
 
      Allocates many elements of size elem_size in a contiguous block of memory. The minimum number to be allocated is min_elements, the preferred and maximum number is preferred_elements. The number of actually allocated elements is will be assigned to received_size. The elements must be deallocated with deallocate(...) 
      
 
      17. 
 
    17. 
-
      pointer allocate_one();
      
+
      pointer allocate_one();
      
 
      Allocates just one object. Memory allocated with this function must be deallocated only with deallocate_one(). Throws boost::interprocess::bad_alloc if there is no enough memory 
      
 
      18. 
 
    18. 
-
      multiallocation_chain allocate_individual(size_type num_elements);
      
+
      multiallocation_chain allocate_individual(size_type num_elements);
      
 
      Allocates many elements of size == 1 in a contiguous block of memory. The minimum number to be allocated is min_elements, the preferred and maximum number is preferred_elements. The number of actually allocated elements is will be assigned to received_size. Memory allocated with this function must be deallocated only with deallocate_one(). 
      
 
      19. 
 
    19. 
-
      void deallocate_one(const pointer & p);
      
+
      void deallocate_one(const pointer & p);
      
 
      Deallocates memory previously allocated with allocate_one(). You should never use deallocate_one to deallocate memory allocated with other functions different from allocate_one(). Never throws 
      
 
      20. 
 
    20. 
-
      void deallocate_individual(multiallocation_chain & chain);
      
+
      void deallocate_individual(multiallocation_chain & chain);
      
 
      Allocates many elements of size == 1 in a contiguous block of memory. The minimum number to be allocated is min_elements, the preferred and maximum number is preferred_elements. The number of actually allocated elements is will be assigned to received_size. Memory allocated with this function must be deallocated only with deallocate_one(). 
      
 
      21. 
 
    21. 
-
      void set_max_cached_nodes(size_type newmax);
      
+
      void set_max_cached_nodes(size_type newmax);
      
 
      Sets the new max cached nodes value. This can provoke deallocations if "newmax" is less than current cached nodes. Never throws 
      
 
      22. 
 
    22. 
-
      size_type get_max_cached_nodes() const;
      
+
      size_type get_max_cached_nodes() const;
      
 
      Returns the max cached nodes parameter. Never throws 
      
 
      23.

    -cached_adaptive_pool friend functions

    +cached_adaptive_pool friend functions
    1. -
      friend void swap(self_t & alloc1, self_t & alloc2);
      +
      friend void swap(self_t & alloc1, self_t & alloc2);

      Swaps allocators. Does not throw. If each allocator is placed in a different memory segment, the result is undefined.

    @@ -247,7 +247,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/interprocess/cached_adaptive_pool/rebind.html b/doc/html/boost/interprocess/cached_adaptive_pool/rebind.html index 3f0255c598..63df04672c 100644 --- a/doc/html/boost/interprocess/cached_adaptive_pool/rebind.html +++ b/doc/html/boost/interprocess/cached_adaptive_pool/rebind.html @@ -8,7 +8,7 @@ - + @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -53,7 +53,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/interprocess/cached_node_allocator.html b/doc/html/boost/interprocess/cached_node_allocator.html index 0e3215c6c9..1016865d87 100644 --- a/doc/html/boost/interprocess/cached_node_allocator.html +++ b/doc/html/boost/interprocess/cached_node_allocator.html @@ -7,7 +7,7 @@ - + @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -54,42 +54,42 @@ }; // construct/copy/destruct - cached_node_allocator(segment_manager *); - cached_node_allocator(const cached_node_allocator &); + cached_node_allocator(segment_manager *); + cached_node_allocator(const cached_node_allocator &); template<typename T2> - cached_node_allocator(const cached_node_allocator< T2, SegmentManager, NodesPerBlock > &); + cached_node_allocator(const cached_node_allocator< T2, SegmentManager, NodesPerBlock > &); template<typename T2, typename SegmentManager2, std::size_t N2> cached_node_allocator & - operator=(const cached_node_allocator< T2, SegmentManager2, N2 > &); - cached_node_allocator & operator=(const cached_node_allocator &); - ~cached_node_allocator(); + operator=(const cached_node_allocator< T2, SegmentManager2, N2 > &); + cached_node_allocator & operator=(const cached_node_allocator &); + ~cached_node_allocator(); - // public member functions - node_pool_t * get_node_pool() const; - segment_manager * get_segment_manager() const; - size_type max_size() const; - pointer allocate(size_type, cvoid_pointer = 0); - void deallocate(const pointer &, size_type); - void deallocate_free_blocks(); - pointer address(reference) const; - const_pointer address(const_reference) const; - void construct(const pointer &, const_reference); - void destroy(const pointer &); - size_type size(const pointer &) const; - pointer allocation_command(boost::interprocess::allocation_type, size_type, + // public member functions + node_pool_t * get_node_pool() const; + segment_manager * get_segment_manager() const; + size_type max_size() const; + pointer allocate(size_type, cvoid_pointer = 0); + void deallocate(const pointer &, size_type); + void deallocate_free_blocks(); + pointer address(reference) const; + const_pointer address(const_reference) const; + void construct(const pointer &, const_reference); + void destroy(const pointer &); + size_type size(const pointer &) const; + pointer allocation_command(boost::interprocess::allocation_type, size_type, size_type &, pointer &); - void allocate_many(size_type, size_type, multiallocation_chain &); - void allocate_many(const size_type *, size_type, multiallocation_chain &); - void deallocate_many(multiallocation_chain &); - pointer allocate_one(); - multiallocation_chain allocate_individual(size_type); - void deallocate_one(const pointer &); - void deallocate_individual(multiallocation_chain); - void set_max_cached_nodes(size_type); - size_type get_max_cached_nodes() const; + void allocate_many(size_type, size_type, multiallocation_chain &); + void allocate_many(const size_type *, size_type, multiallocation_chain &); + void deallocate_many(multiallocation_chain &); + pointer allocate_one(); + multiallocation_chain allocate_individual(size_type); + void deallocate_one(const pointer &); + void deallocate_individual(multiallocation_chain); + void set_max_cached_nodes(size_type); + size_type get_max_cached_nodes() const; - // friend functions - friend void swap(self_t &, self_t &); + // friend functions + friend void swap(self_t &, self_t &); };

    Description

    @@ -100,131 +100,131 @@ construct/copy/destruct
    1. -
      cached_node_allocator(segment_manager * segment_mngr);
      +
      cached_node_allocator(segment_manager * segment_mngr);

      Constructor from a segment manager. If not present, constructs a node pool. Increments the reference count of the associated node pool. Can throw boost::interprocess::bad_alloc

    2. -
      cached_node_allocator(const cached_node_allocator & other);
      +
      cached_node_allocator(const cached_node_allocator & other);

      Copy constructor from other cached_node_allocator. Increments the reference count of the associated node pool. Never throws 

    3. template<typename T2> 
-  cached_node_allocator(const cached_node_allocator< T2, SegmentManager, NodesPerBlock > & other);
      + cached_node_allocator(const cached_node_allocator< T2, SegmentManager, NodesPerBlock > & other);

      Copy constructor from related cached_node_allocator. If not present, constructs a node pool. Increments the reference count of the associated node pool. Can throw boost::interprocess::bad_alloc 

    4. template<typename T2, typename SegmentManager2, std::size_t N2> 
   cached_node_allocator & 
-  operator=(const cached_node_allocator< T2, SegmentManager2, N2 > &);
      + operator=(const cached_node_allocator< T2, SegmentManager2, N2 > &);

      Not assignable from related cached_node_allocator

    5. -
      cached_node_allocator & operator=(const cached_node_allocator &);
      +
      cached_node_allocator & operator=(const cached_node_allocator &);

      Not assignable from other cached_node_allocator

    6. -
      ~cached_node_allocator();
      +
      ~cached_node_allocator();

      Destructor, removes node_pool_t from memory if its reference count reaches to zero. Never throws

    -cached_node_allocator public member functions

    +cached_node_allocator public member functions
    1. -
      node_pool_t * get_node_pool() const;
      +
      node_pool_t * get_node_pool() const;

      Returns a pointer to the node pool. Never throws

    2. -
      segment_manager * get_segment_manager() const;
      +
      segment_manager * get_segment_manager() const;

      Returns the segment manager. Never throws

    3. -
      size_type max_size() const;
      +
      size_type max_size() const;

      Returns the number of elements that could be allocated. Never throws

    4. -
      pointer allocate(size_type count, cvoid_pointer hint = 0);
      +
      pointer allocate(size_type count, cvoid_pointer hint = 0);

      Allocate memory for an array of count elements. Throws boost::interprocess::bad_alloc if there is no enough memory

    5. -
      void deallocate(const pointer & ptr, size_type count);
      +
      void deallocate(const pointer & ptr, size_type count);

      Deallocate allocated memory. Never throws

    6. -
      void deallocate_free_blocks();
      +
      void deallocate_free_blocks();

      Deallocates all free blocks of the pool

    7. -
      pointer address(reference value) const;
      +
      pointer address(reference value) const;

      Returns address of mutable object. Never throws

    8. -
      const_pointer address(const_reference value) const;
      +
      const_pointer address(const_reference value) const;

      Returns address of non mutable object. Never throws

    9. -
      void construct(const pointer & ptr, const_reference v);
      +
      void construct(const pointer & ptr, const_reference v);

      Default construct an object. Throws if T's default constructor throws

    10. -
      void destroy(const pointer & ptr);
      +
      void destroy(const pointer & ptr);

      Destroys object. Throws if object's destructor throws

    11. -
      size_type size(const pointer & p) const;
      +
      size_type size(const pointer & p) const;

      Returns maximum the number of objects the previously allocated memory pointed by p can hold. This size only works for memory allocated with allocate, allocation_command and allocate_many.

      12. -
    12. pointer allocation_command(boost::interprocess::allocation_type command, 
+
    13. pointer allocation_command(boost::interprocess::allocation_type command, 
                            size_type limit_size, 
                            size_type & prefer_in_recvd_out_size, 
                            pointer & reuse);
      14. 
 
    14. 
-
      void allocate_many(size_type elem_size, size_type num_elements, 
+
      void allocate_many(size_type elem_size, size_type num_elements, 
                    multiallocation_chain & chain);
      
 
      Allocates many elements of size elem_size in a contiguous block of memory. The minimum number to be allocated is min_elements, the preferred and maximum number is preferred_elements. The number of actually allocated elements is will be assigned to received_size. The elements must be deallocated with deallocate(...) 
      
 
      15. 
 
    15. 
-
      void allocate_many(const size_type * elem_sizes, size_type n_elements, 
+
      void allocate_many(const size_type * elem_sizes, size_type n_elements, 
                    multiallocation_chain & chain);
      
 
      Allocates n_elements elements, each one of size elem_sizes[i]in a contiguous block of memory. The elements must be deallocated 
      
 
      16. 
 
    16. 
-
      void deallocate_many(multiallocation_chain & chain);
      
+
      void deallocate_many(multiallocation_chain & chain);
      
 
      Allocates many elements of size elem_size in a contiguous block of memory. The minimum number to be allocated is min_elements, the preferred and maximum number is preferred_elements. The number of actually allocated elements is will be assigned to received_size. The elements must be deallocated with deallocate(...) 
      
 
      17. 
 
    17. 
-
      pointer allocate_one();
      
+
      pointer allocate_one();
      
 
      Allocates just one object. Memory allocated with this function must be deallocated only with deallocate_one(). Throws boost::interprocess::bad_alloc if there is no enough memory 
      
 
      18. 
 
    18. 
-
      multiallocation_chain allocate_individual(size_type num_elements);
      
+
      multiallocation_chain allocate_individual(size_type num_elements);
      
 
      Allocates many elements of size == 1 in a contiguous block of memory. The minimum number to be allocated is min_elements, the preferred and maximum number is preferred_elements. The number of actually allocated elements is will be assigned to received_size. Memory allocated with this function must be deallocated only with deallocate_one(). 
      
 
      19. 
 
    19. 
-
      void deallocate_one(const pointer & p);
      
+
      void deallocate_one(const pointer & p);
      
 
      Deallocates memory previously allocated with allocate_one(). You should never use deallocate_one to deallocate memory allocated with other functions different from allocate_one(). Never throws 
      
 
      20. 
 
    20. 
-
      void deallocate_individual(multiallocation_chain it);
      
+
      void deallocate_individual(multiallocation_chain it);
      
 
      Allocates many elements of size == 1 in a contiguous block of memory. The minimum number to be allocated is min_elements, the preferred and maximum number is preferred_elements. The number of actually allocated elements is will be assigned to received_size. Memory allocated with this function must be deallocated only with deallocate_one(). 
      
 
      21. 
 
    21. 
-
      void set_max_cached_nodes(size_type newmax);
      
+
      void set_max_cached_nodes(size_type newmax);
      
 
      Sets the new max cached nodes value. This can provoke deallocations if "newmax" is less than current cached nodes. Never throws 
      
 
      22. 
 
    22. 
-
      size_type get_max_cached_nodes() const;
      
+
      size_type get_max_cached_nodes() const;
      
 
      Returns the max cached nodes parameter. Never throws 
      
 
      23.

    -cached_node_allocator friend functions

    +cached_node_allocator friend functions
    1. -
      friend void swap(self_t & alloc1, self_t & alloc2);
      +
      friend void swap(self_t & alloc1, self_t & alloc2);

      Swaps allocators. Does not throw. If each allocator is placed in a different memory segment, the result is undefined.

    @@ -240,7 +240,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/interprocess/cached_node_allocator/rebind.html b/doc/html/boost/interprocess/cached_node_allocator/rebind.html index eb656a602f..b64b186e70 100644 --- a/doc/html/boost/interprocess/cached_node_allocator/rebind.html +++ b/doc/html/boost/interprocess/cached_node_allocator/rebind.html @@ -8,7 +8,7 @@ - + @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -53,7 +53,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/interprocess/defer_lock_type.html b/doc/html/boost/interprocess/defer_lock_type.html index e54c8f873c..6db72b633e 100644 --- a/doc/html/boost/interprocess/defer_lock_type.html +++ b/doc/html/boost/interprocess/defer_lock_type.html @@ -7,7 +7,7 @@ - + @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -46,7 +46,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/interprocess/deleter.html b/doc/html/boost/interprocess/deleter.html index 96467baf92..682a61a620 100644 --- a/doc/html/boost/interprocess/deleter.html +++ b/doc/html/boost/interprocess/deleter.html @@ -39,10 +39,10 @@ typedef boost::intrusive::pointer_traits< typename SegmentManager::void_pointer >::template rebind_pointer< T >::type pointer; // construct/copy/destruct - deleter(segment_manager_pointer); + deleter(segment_manager_pointer); - // public member functions - void operator()(const pointer &); + // public member functions + void operator()(const pointer &); };

    Description

    @@ -53,12 +53,12 @@ deleter public construct/copy/destruct -
    1. deleter(segment_manager_pointer pmngr);
    +
    1. deleter(segment_manager_pointer pmngr);

    -deleter public member functions

    -
    1. void operator()(const pointer & p);
    +deleter public member functions +
    1. void operator()(const pointer & p);
    diff --git a/doc/html/boost/interprocess/enable_shared_from_this.html b/doc/html/boost/interprocess/enable_shared_from_this.html index b3391906e3..412e1d0a93 100644 --- a/doc/html/boost/interprocess/enable_shared_from_this.html +++ b/doc/html/boost/interprocess/enable_shared_from_this.html @@ -7,7 +7,7 @@ - + @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -36,19 +36,19 @@ class enable_shared_from_this { public: - // public member functions - shared_ptr< T, A, D > shared_from_this(); - shared_ptr< T const, A, D > shared_from_this() const; + // public member functions + shared_ptr< T, A, D > shared_from_this(); + shared_ptr< T const, A, D > shared_from_this() const; };

    Description

    This class is used as a base class that allows a shared_ptr to the current object to be obtained from within a member function. enable_shared_from_this defines two member functions called shared_from_this that return a shared_ptr<T> and shared_ptr<T const>, depending on constness, to this.

    -enable_shared_from_this public member functions

    +enable_shared_from_this public member functions
      -
    1. shared_ptr< T, A, D > shared_from_this();
      2. -
    2. shared_ptr< T const, A, D > shared_from_this() const;
      3. +
    3. shared_ptr< T, A, D > shared_from_this();
      4. +
    4. shared_ptr< T const, A, D > shared_from_this() const;
    @@ -63,7 +63,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/interprocess/file_lock.html b/doc/html/boost/interprocess/file_lock.html index 9c6bb6a19a..c64d45c953 100644 --- a/doc/html/boost/interprocess/file_lock.html +++ b/doc/html/boost/interprocess/file_lock.html @@ -36,22 +36,22 @@ class file_lock { public: // construct/copy/destruct - file_lock(); - file_lock(const char *); - file_lock(file_lock &&); - file_lock & operator=(file_lock &&); - ~file_lock(); + file_lock(); + file_lock(const char *); + file_lock(file_lock &&); + file_lock & operator=(file_lock &&); + ~file_lock(); - // public member functions - void swap(file_lock &); - void lock(); - bool try_lock(); - bool timed_lock(const boost::posix_time::ptime &); - void unlock(); - void lock_sharable(); - bool try_lock_sharable(); - bool timed_lock_sharable(const boost::posix_time::ptime &); - void unlock_sharable(); + // public member functions + void swap(file_lock &); + void lock(); + bool try_lock(); + bool timed_lock(const boost::posix_time::ptime &); + void unlock(); + void lock_sharable(); + bool try_lock_sharable(); + bool timed_lock_sharable(const boost::posix_time::ptime &); + void unlock_sharable(); };

    Description

    @@ -63,63 +63,63 @@ construct/copy/destruct
    1. -
      file_lock();
      +
      file_lock();

      Constructs an empty file mapping. Does not throw

    2. -
      file_lock(const char * name);
      +
      file_lock(const char * name);

      Opens a file lock. Throws interprocess_exception if the file does not exist or there are no operating system resources.

    3. -
      file_lock(file_lock && moved);
      +
      file_lock(file_lock && moved);

      Moves the ownership of "moved"'s file mapping object to *this. After the call, "moved" does not represent any file mapping object. Does not throw

    4. -
      file_lock & operator=(file_lock && moved);
      +
      file_lock & operator=(file_lock && moved);

      Moves the ownership of "moved"'s file mapping to *this. After the call, "moved" does not represent any file mapping. Does not throw

    5. -
      ~file_lock();
      Closes a file lock. Does not throw.
      6. +
      ~file_lock();
      Closes a file lock. Does not throw.

    -file_lock public member functions

    +file_lock public member functions
    1. -
      void swap(file_lock & other);
      +
      void swap(file_lock & other);

      Swaps two file_locks. Does not throw.

    2. -
      void lock();
      +
      void lock();

      Effects: The calling thread tries to obtain exclusive ownership of the mutex, and if another thread has exclusive, or sharable ownership of the mutex, it waits until it can obtain the ownership. Throws: interprocess_exception on error.

    3. -
      bool try_lock();
      +
      bool try_lock();

      Effects: The calling thread tries to acquire exclusive ownership of the mutex without waiting. If no other thread has exclusive, or sharable ownership of the mutex this succeeds. Returns: If it can acquire exclusive ownership immediately returns true. If it has to wait, returns false. Throws: interprocess_exception on error.

    4. -
      bool timed_lock(const boost::posix_time::ptime & abs_time);
      +
      bool timed_lock(const boost::posix_time::ptime & abs_time);

      Effects: The calling thread tries to acquire exclusive ownership of the mutex waiting if necessary until no other thread has exclusive, or sharable ownership of the mutex or abs_time is reached. Returns: If acquires exclusive ownership, returns true. Otherwise returns false. Throws: interprocess_exception on error.

    5. -
      void unlock();
      +
      void unlock();

      Precondition: The thread must have exclusive ownership of the mutex. Effects: The calling thread releases the exclusive ownership of the mutex. Throws: An exception derived from interprocess_exception on error.

    6. -
      void lock_sharable();
      +
      void lock_sharable();

      Effects: The calling thread tries to obtain sharable ownership of the mutex, and if another thread has exclusive ownership of the mutex, waits until it can obtain the ownership. Throws: interprocess_exception on error.

    7. -
      bool try_lock_sharable();
      +
      bool try_lock_sharable();

      Effects: The calling thread tries to acquire sharable ownership of the mutex without waiting. If no other thread has exclusive ownership of the mutex this succeeds. Returns: If it can acquire sharable ownership immediately returns true. If it has to wait, returns false. Throws: interprocess_exception on error.

    8. -
      bool timed_lock_sharable(const boost::posix_time::ptime & abs_time);
      +
      bool timed_lock_sharable(const boost::posix_time::ptime & abs_time);

      Effects: The calling thread tries to acquire sharable ownership of the mutex waiting if necessary until no other thread has exclusive ownership of the mutex or abs_time is reached. Returns: If acquires sharable ownership, returns true. Otherwise returns false. Throws: interprocess_exception on error.

    9. -
      void unlock_sharable();
      +
      void unlock_sharable();

      Precondition: The thread must have sharable ownership of the mutex. Effects: The calling thread releases the sharable ownership of the mutex. Throws: An exception derived from interprocess_exception on error.

    diff --git a/doc/html/boost/interprocess/file_mapping.html b/doc/html/boost/interprocess/file_mapping.html index be3cb8a7bf..b39b70d31f 100644 --- a/doc/html/boost/interprocess/file_mapping.html +++ b/doc/html/boost/interprocess/file_mapping.html @@ -36,20 +36,20 @@ class file_mapping { public: // construct/copy/destruct - file_mapping(); - file_mapping(const char *, mode_t); - file_mapping(file_mapping &&); - file_mapping & operator=(file_mapping &&); - ~file_mapping(); + file_mapping(); + file_mapping(const char *, mode_t); + file_mapping(file_mapping &&); + file_mapping & operator=(file_mapping &&); + ~file_mapping(); - // public member functions - void swap(file_mapping &); - mode_t get_mode() const; - mapping_handle_t get_mapping_handle() const; - const char * get_name() const; + // public member functions + void swap(file_mapping &); + mode_t get_mode() const; + mapping_handle_t get_mapping_handle() const; + const char * get_name() const; - // public static functions - static bool remove(const char *); + // public static functions + static bool remove(const char *); };

    Description

    @@ -61,54 +61,54 @@ construct/copy/destruct
    1. -
      file_mapping();
      +
      file_mapping();

      Constructs an empty file mapping. Does not throw

    2. -
      file_mapping(const char * filename, mode_t mode);
      +
      file_mapping(const char * filename, mode_t mode);

      Opens a file mapping of file "filename", starting in offset "file_offset", and the mapping's size will be "size". The mapping can be opened for read-only "read_only" or read-write "read_write" modes. Throws interprocess_exception on error.

    3. -
      file_mapping(file_mapping && moved);
      +
      file_mapping(file_mapping && moved);

      Moves the ownership of "moved"'s file mapping object to *this. After the call, "moved" does not represent any file mapping object. Does not throw

    4. -
      file_mapping & operator=(file_mapping && moved);
      +
      file_mapping & operator=(file_mapping && moved);

      Moves the ownership of "moved"'s file mapping to *this. After the call, "moved" does not represent any file mapping. Does not throw

    5. -
      ~file_mapping();
      +
      ~file_mapping();

      Destroys the file mapping. All mapped regions created from this are still valid. Does not throw

    -file_mapping public member functions

    +file_mapping public member functions
    1. -
      void swap(file_mapping & other);
      +
      void swap(file_mapping & other);

      Swaps to file_mappings. Does not throw.

    2. -
      mode_t get_mode() const;
      +
      mode_t get_mode() const;

      Returns access mode used in the constructor

    3. -
      mapping_handle_t get_mapping_handle() const;
      +
      mapping_handle_t get_mapping_handle() const;

      Obtains the mapping handle to be used with mapped_region

    4. -
      const char * get_name() const;
      +
      const char * get_name() const;

      Returns the name of the file used in the constructor.

    -file_mapping public static functions

    +file_mapping public static functions
    1. -
      static bool remove(const char * filename);
      +
      static bool remove(const char * filename);

      Removes the file named "filename" even if it's been memory mapped. Returns true on success. The function might fail in some operating systems if the file is being used other processes and no deletion permission was shared.

    diff --git a/doc/html/boost/interprocess/fixed_managed__idp39630976.html b/doc/html/boost/interprocess/fixed_managed__idp39630976.html new file mode 100644 index 0000000000..5407859d31 --- /dev/null +++ b/doc/html/boost/interprocess/fixed_managed__idp39630976.html @@ -0,0 +1,55 @@ + + + + +Type definition fixed_managed_shared_memory + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Type definition fixed_managed_shared_memory

    +

    fixed_managed_shared_memory

    +
    +

    Synopsis

    +
    // In header: <boost/interprocess/managed_shared_memory.hpp>
+
+
+typedef basic_managed_shared_memory< char,rbtree_best_fit< mutex_family, void * >,iset_index > fixed_managed_shared_memory;
    +
    +

    Description

    +

    Typedef for a default basic_managed_shared_memory of narrow characters to be placed in a fixed address

    +
    +
    + + + +
    Copyright © 2005-2015 Ion Gaztanaga

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/interprocess/fixed_managed__idp55536416.html b/doc/html/boost/interprocess/fixed_managed__idp55536416.html deleted file mode 100644 index 4bf2a60460..0000000000 --- a/doc/html/boost/interprocess/fixed_managed__idp55536416.html +++ /dev/null @@ -1,55 +0,0 @@ - - - - -Type definition fixed_managed_shared_memory - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Type definition fixed_managed_shared_memory

    -

    fixed_managed_shared_memory

    -
    -

    Synopsis

    -
    // In header: <boost/interprocess/managed_shared_memory.hpp>
-
-
-typedef basic_managed_shared_memory< char,rbtree_best_fit< mutex_family, void * >,iset_index > fixed_managed_shared_memory;
    -
    -

    Description

    -

    Typedef for a default basic_managed_shared_memory of narrow characters to be placed in a fixed address

    -
    -
    - - - -
    Copyright © 2005-2015 Ion Gaztanaga

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/interprocess/flat_map_index.html b/doc/html/boost/interprocess/flat_map_index.html index ba672a81cf..bca3ba540e 100644 --- a/doc/html/boost/interprocess/flat_map_index.html +++ b/doc/html/boost/interprocess/flat_map_index.html @@ -36,11 +36,11 @@ class flat_map_index : public flat_map_index_aux::index_t< MapConfig > { public: // construct/copy/destruct - flat_map_index(segment_manager_base *); + flat_map_index(segment_manager_base *); - // public member functions - void reserve(typename segment_manager_base::size_type); - void shrink_to_fit(); + // public member functions + void reserve(typename segment_manager_base::size_type); + void shrink_to_fit(); };

    Description

    @@ -51,16 +51,16 @@ public construct/copy/destruct
    1. -
      flat_map_index(segment_manager_base * segment_mngr);
      Constructor. Takes a pointer to the segment manager. Can throw.
    +
    flat_map_index(segment_manager_base * segment_mngr);
    Constructor. Takes a pointer to the segment manager. Can throw.

    -flat_map_index public member functions

    +flat_map_index public member functions
    1. -
      void reserve(typename segment_manager_base::size_type n);
      This reserves memory to optimize the insertion of n elements in the index.
      2. +
      void reserve(typename segment_manager_base::size_type n);
      This reserves memory to optimize the insertion of n elements in the index.
    2. -
      void shrink_to_fit();
      This frees all unnecessary memory.
      3. +
      void shrink_to_fit();
      This frees all unnecessary memory.
    diff --git a/doc/html/boost/interprocess/interprocess_condition.html b/doc/html/boost/interprocess/interprocess_condition.html index 89a7fde719..1ce5f64064 100644 --- a/doc/html/boost/interprocess/interprocess_condition.html +++ b/doc/html/boost/interprocess/interprocess_condition.html @@ -36,17 +36,17 @@ class interprocess_condition { public: // construct/copy/destruct - interprocess_condition(); - ~interprocess_condition(); + interprocess_condition(); + ~interprocess_condition(); - // public member functions - void notify_one(); - void notify_all(); - template<typename L> void wait(L &); - template<typename L, typename Pr> void wait(L &, Pr); - template<typename L> bool timed_wait(L &, const boost::posix_time::ptime &); + // public member functions + void notify_one(); + void notify_all(); + template<typename L> void wait(L &); + template<typename L, typename Pr> void wait(L &, Pr); + template<typename L> bool timed_wait(L &, const boost::posix_time::ptime &); template<typename L, typename Pr> - bool timed_wait(L &, const boost::posix_time::ptime &, Pr); + bool timed_wait(L &, const boost::posix_time::ptime &, Pr); };

    Description

    @@ -59,41 +59,41 @@ construct/copy/destruct
    1. -
      interprocess_condition();
      Constructs a interprocess_condition. On error throws interprocess_exception.
      2. +
      interprocess_condition();
      Constructs a interprocess_condition. On error throws interprocess_exception.
    2. -
      ~interprocess_condition();
      +
      ~interprocess_condition();

      Destroys *this liberating system resources.

    -interprocess_condition public member functions

    +interprocess_condition public member functions
    1. -
      void notify_one();
      +
      void notify_one();

      If there is a thread waiting on *this, change that thread's state to ready. Otherwise there is no effect.

    2. -
      void notify_all();
      +
      void notify_all();

      Change the state of all threads waiting on *this to ready. If there are no waiting threads, notify_all() has no effect.

    3. -
      template<typename L> void wait(L & lock);
      +
      template<typename L> void wait(L & lock);

      Releases the lock on the interprocess_mutex object associated with lock, blocks the current thread of execution until readied by a call to this->notify_one() or this->notify_all(), and then reacquires the lock.

    4. -
      template<typename L, typename Pr> void wait(L & lock, Pr pred);
      +
      template<typename L, typename Pr> void wait(L & lock, Pr pred);

      The same as: while (!pred()) wait(lock) 

    5. template<typename L> 
-  bool timed_wait(L & lock, const boost::posix_time::ptime & abs_time);
      + bool timed_wait(L & lock, const boost::posix_time::ptime & abs_time);

      Releases the lock on the interprocess_mutex object associated with lock, blocks the current thread of execution until readied by a call to this->notify_one() or this->notify_all(), or until time abs_time is reached, and then reacquires the lock. Returns: false if time abs_time is reached, otherwise true. 

    6. template<typename L, typename Pr> 
-  bool timed_wait(L & lock, const boost::posix_time::ptime & abs_time, 
+  bool timed_wait(L & lock, const boost::posix_time::ptime & abs_time, 
                   Pr pred);

      The same as: while (!pred()) { if (!timed_wait(lock, abs_time)) return pred(); } return true;

      7. diff --git a/doc/html/boost/interprocess/interprocess_condition_any.html b/doc/html/boost/interprocess/interprocess_condition_any.html index 6f3165c06d..bf2fd52a85 100644 --- a/doc/html/boost/interprocess/interprocess_condition_any.html +++ b/doc/html/boost/interprocess/interprocess_condition_any.html @@ -36,17 +36,17 @@ class interprocess_condition_any { public: // construct/copy/destruct - interprocess_condition_any(); - ~interprocess_condition_any(); + interprocess_condition_any(); + ~interprocess_condition_any(); - // public member functions - void notify_one(); - void notify_all(); - template<typename L> void wait(L &); - template<typename L, typename Pr> void wait(L &, Pr); - template<typename L> bool timed_wait(L &, const boost::posix_time::ptime &); + // public member functions + void notify_one(); + void notify_all(); + template<typename L> void wait(L &); + template<typename L, typename Pr> void wait(L &, Pr); + template<typename L> bool timed_wait(L &, const boost::posix_time::ptime &); template<typename L, typename Pr> - bool timed_wait(L &, const boost::posix_time::ptime &, Pr); + bool timed_wait(L &, const boost::posix_time::ptime &, Pr); };

    Description

    @@ -60,41 +60,41 @@ construct/copy/destruct
    1. -
      interprocess_condition_any();
      Constructs a interprocess_condition_any. On error throws interprocess_exception.
      2. +
      interprocess_condition_any();
      Constructs a interprocess_condition_any. On error throws interprocess_exception.
    2. -
      ~interprocess_condition_any();
      +
      ~interprocess_condition_any();

      Destroys *this liberating system resources.

    -interprocess_condition_any public member functions

    +interprocess_condition_any public member functions
    1. -
      void notify_one();
      +
      void notify_one();

      If there is a thread waiting on *this, change that thread's state to ready. Otherwise there is no effect.

    2. -
      void notify_all();
      +
      void notify_all();

      Change the state of all threads waiting on *this to ready. If there are no waiting threads, notify_all() has no effect.

    3. -
      template<typename L> void wait(L & lock);
      +
      template<typename L> void wait(L & lock);

      Releases the lock on the interprocess_mutex object associated with lock, blocks the current thread of execution until readied by a call to this->notify_one() or this->notify_all(), and then reacquires the lock.

    4. -
      template<typename L, typename Pr> void wait(L & lock, Pr pred);
      +
      template<typename L, typename Pr> void wait(L & lock, Pr pred);

      The same as: while (!pred()) wait(lock) 

    5. template<typename L> 
-  bool timed_wait(L & lock, const boost::posix_time::ptime & abs_time);
      + bool timed_wait(L & lock, const boost::posix_time::ptime & abs_time);

      Releases the lock on the interprocess_mutex object associated with lock, blocks the current thread of execution until readied by a call to this->notify_one() or this->notify_all(), or until time abs_time is reached, and then reacquires the lock. Returns: false if time abs_time is reached, otherwise true. 

    6. template<typename L, typename Pr> 
-  bool timed_wait(L & lock, const boost::posix_time::ptime & abs_time, 
+  bool timed_wait(L & lock, const boost::posix_time::ptime & abs_time, 
                   Pr pred);

      The same as: while (!pred()) { if (!timed_wait(lock, abs_time)) return pred(); } return true;

      7. diff --git a/doc/html/boost/interprocess/interprocess_exception.html b/doc/html/boost/interprocess/interprocess_exception.html index 5fe886f1d4..524b622db5 100644 --- a/doc/html/boost/interprocess/interprocess_exception.html +++ b/doc/html/boost/interprocess/interprocess_exception.html @@ -36,14 +36,14 @@ class interprocess_exception : public exception { public: // construct/copy/destruct - interprocess_exception(const char *); - interprocess_exception(const error_info &, const char * = 0); - ~interprocess_exception(); + interprocess_exception(const char *); + interprocess_exception(const error_info &, const char * = 0); + ~interprocess_exception(); - // public member functions - virtual const char * what() const; - native_error_t get_native_error() const; - error_code_t get_error_code() const; + // public member functions + virtual const char * what() const; + native_error_t get_native_error() const; + error_code_t get_error_code() const; };

    Description

    @@ -54,18 +54,18 @@ public construct/copy/destruct
      -
    1. interprocess_exception(const char * err);
      2. -
    2. interprocess_exception(const error_info & err_info, const char * str = 0);
      3. -
    3. ~interprocess_exception();
      4. +
    4. interprocess_exception(const char * err);
      5. +
    5. interprocess_exception(const error_info & err_info, const char * str = 0);
      6. +
    6. ~interprocess_exception();

    -interprocess_exception public member functions

    +interprocess_exception public member functions
      -
    1. virtual const char * what() const;
      2. -
    2. native_error_t get_native_error() const;
      3. -
    3. error_code_t get_error_code() const;
      4. +
    4. virtual const char * what() const;
      5. +
    5. native_error_t get_native_error() const;
      6. +
    6. error_code_t get_error_code() const;
    diff --git a/doc/html/boost/interprocess/interprocess_mutex.html b/doc/html/boost/interprocess/interprocess_mutex.html index 5f6caf267e..37c3f5db57 100644 --- a/doc/html/boost/interprocess/interprocess_mutex.html +++ b/doc/html/boost/interprocess/interprocess_mutex.html @@ -8,7 +8,7 @@ - + @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -36,14 +36,14 @@ class interprocess_mutex { public: // construct/copy/destruct - interprocess_mutex(); - ~interprocess_mutex(); + interprocess_mutex(); + ~interprocess_mutex(); - // public member functions - void lock(); - bool try_lock(); - bool timed_lock(const boost::posix_time::ptime &); - void unlock(); + // public member functions + void lock(); + bool try_lock(); + bool timed_lock(const boost::posix_time::ptime &); + void unlock(); };

    Description

    @@ -55,33 +55,33 @@ construct/copy/destruct
    1. -
      interprocess_mutex();
      +
      interprocess_mutex();

      Constructor. Throws interprocess_exception on error.

    2. -
      ~interprocess_mutex();
      +
      ~interprocess_mutex();

      Destructor. If any process uses the mutex after the destructor is called the result is undefined. Does not throw.

    -interprocess_mutex public member functions

    +interprocess_mutex public member functions
    1. -
      void lock();
      +
      void lock();

      Effects: The calling thread tries to obtain ownership of the mutex, and if another thread has ownership of the mutex, it waits until it can obtain the ownership. If a thread takes ownership of the mutex the mutex must be unlocked by the same mutex. Throws: interprocess_exception on error.

    2. -
      bool try_lock();
      +
      bool try_lock();

      Effects: The calling thread tries to obtain ownership of the mutex, and if another thread has ownership of the mutex returns immediately. Returns: If the thread acquires ownership of the mutex, returns true, if the another thread has ownership of the mutex, returns false. Throws: interprocess_exception on error.

    3. -
      bool timed_lock(const boost::posix_time::ptime & abs_time);
      +
      bool timed_lock(const boost::posix_time::ptime & abs_time);

      Effects: The calling thread will try to obtain exclusive ownership of the mutex if it can do so in until the specified time is reached. If the mutex supports recursive locking, the mutex must be unlocked the same number of times it is locked. Returns: If the thread acquires ownership of the mutex, returns true, if the timeout expires returns false. Throws: interprocess_exception on error.

    4. -
      void unlock();
      +
      void unlock();

      Effects: The calling thread releases the exclusive ownership of the mutex. Throws: interprocess_exception on error.

    @@ -98,7 +98,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/interprocess/interprocess_r_idp40896864.html b/doc/html/boost/interprocess/interprocess_r_idp40896864.html new file mode 100644 index 0000000000..9ae0748076 --- /dev/null +++ b/doc/html/boost/interprocess/interprocess_r_idp40896864.html @@ -0,0 +1,104 @@ + + + + +Class interprocess_recursive_mutex + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Class interprocess_recursive_mutex

    +

    boost::interprocess::interprocess_recursive_mutex

    +
    +

    Synopsis

    +
    // In header: <boost/interprocess/sync/interprocess_recursive_mutex.hpp>
+
+
+class interprocess_recursive_mutex {
+public:
+  // construct/copy/destruct
+  interprocess_recursive_mutex();
+  ~interprocess_recursive_mutex();
+
+  // public member functions
+  void lock();
+  bool try_lock();
+  bool timed_lock(const boost::posix_time::ptime &);
+  void unlock();
+};
    +
    +

    Description

    +

    Wraps a interprocess_mutex that can be placed in shared memory and can be shared between processes. Allows several locking calls by the same process. Allows timed lock tries

    +
    +

    +interprocess_recursive_mutex + public + construct/copy/destruct

    +
      +
    1. +
      interprocess_recursive_mutex();
      +

      Constructor. Throws interprocess_exception on error.

      +
      2. +
    2. +
      ~interprocess_recursive_mutex();
      +

      Destructor. If any process uses the mutex after the destructor is called the result is undefined. Does not throw.

      +
      3. +
    +
    +
    +

    +interprocess_recursive_mutex public member functions

    +
      +
    1. +
      void lock();
      +

      Effects: The calling thread tries to obtain ownership of the mutex, and if another thread has ownership of the mutex, it waits until it can obtain the ownership. If a thread takes ownership of the mutex the mutex must be unlocked by the same mutex. The mutex must be unlocked the same number of times it is locked. Throws: interprocess_exception on error.

      +
      2. +
    2. +
      bool try_lock();
      +

      Tries to lock the interprocess_mutex, returns false when interprocess_mutex is already locked, returns true when success. The mutex must be unlocked the same number of times it is locked. Throws: interprocess_exception if a severe error is found

      +
      3. +
    3. +
      bool timed_lock(const boost::posix_time::ptime & abs_time);
      +

      Tries to lock the interprocess_mutex, if interprocess_mutex can't be locked before abs_time time, returns false. The mutex must be unlocked the same number of times it is locked. Throws: interprocess_exception if a severe error is found

      +
      4. +
    4. +
      void unlock();
      +

      Effects: The calling thread releases the exclusive ownership of the mutex. If the mutex supports recursive locking, the mutex must be unlocked the same number of times it is locked. Throws: interprocess_exception on error.

      +
      5. +
    +
    +
    +
    + + + +
    Copyright © 2005-2015 Ion Gaztanaga

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/interprocess/interprocess_r_idp56793568.html b/doc/html/boost/interprocess/interprocess_r_idp56793568.html deleted file mode 100644 index 2c5d1ee17d..0000000000 --- a/doc/html/boost/interprocess/interprocess_r_idp56793568.html +++ /dev/null @@ -1,104 +0,0 @@ - - - - -Class interprocess_recursive_mutex - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Class interprocess_recursive_mutex

    -

    boost::interprocess::interprocess_recursive_mutex

    -
    -

    Synopsis

    -
    // In header: <boost/interprocess/sync/interprocess_recursive_mutex.hpp>
-
-
-class interprocess_recursive_mutex {
-public:
-  // construct/copy/destruct
-  interprocess_recursive_mutex();
-  ~interprocess_recursive_mutex();
-
-  // public member functions
-  void lock();
-  bool try_lock();
-  bool timed_lock(const boost::posix_time::ptime &);
-  void unlock();
-};
    -
    -

    Description

    -

    Wraps a interprocess_mutex that can be placed in shared memory and can be shared between processes. Allows several locking calls by the same process. Allows timed lock tries

    -
    -

    -interprocess_recursive_mutex - public - construct/copy/destruct

    -
      -
    1. -
      interprocess_recursive_mutex();
      -

      Constructor. Throws interprocess_exception on error.

      -
      2. -
    2. -
      ~interprocess_recursive_mutex();
      -

      Destructor. If any process uses the mutex after the destructor is called the result is undefined. Does not throw.

      -
      3. -
    -
    -
    -

    -interprocess_recursive_mutex public member functions

    -
      -
    1. -
      void lock();
      -

      Effects: The calling thread tries to obtain ownership of the mutex, and if another thread has ownership of the mutex, it waits until it can obtain the ownership. If a thread takes ownership of the mutex the mutex must be unlocked by the same mutex. The mutex must be unlocked the same number of times it is locked. Throws: interprocess_exception on error.

      -
      2. -
    2. -
      bool try_lock();
      -

      Tries to lock the interprocess_mutex, returns false when interprocess_mutex is already locked, returns true when success. The mutex must be unlocked the same number of times it is locked. Throws: interprocess_exception if a severe error is found

      -
      3. -
    3. -
      bool timed_lock(const boost::posix_time::ptime & abs_time);
      -

      Tries to lock the interprocess_mutex, if interprocess_mutex can't be locked before abs_time time, returns false. The mutex must be unlocked the same number of times it is locked. Throws: interprocess_exception if a severe error is found

      -
      4. -
    4. -
      void unlock();
      -

      Effects: The calling thread releases the exclusive ownership of the mutex. If the mutex supports recursive locking, the mutex must be unlocked the same number of times it is locked. Throws: interprocess_exception on error.

      -
      5. -
    -
    -
    -
    - - - -
    Copyright © 2005-2015 Ion Gaztanaga

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/interprocess/interprocess_s_idp40942256.html b/doc/html/boost/interprocess/interprocess_s_idp40942256.html new file mode 100644 index 0000000000..a4d8507bcc --- /dev/null +++ b/doc/html/boost/interprocess/interprocess_s_idp40942256.html @@ -0,0 +1,128 @@ + + + + +Class interprocess_sharable_mutex + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Class interprocess_sharable_mutex

    +

    boost::interprocess::interprocess_sharable_mutex

    +
    +

    Synopsis

    +
    // In header: <boost/interprocess/sync/interprocess_sharable_mutex.hpp>
+
+
+class interprocess_sharable_mutex {
+public:
+  // construct/copy/destruct
+  interprocess_sharable_mutex(const interprocess_sharable_mutex &);
+  interprocess_sharable_mutex();
+  interprocess_sharable_mutex & operator=(const interprocess_sharable_mutex &);
+  ~interprocess_sharable_mutex();
+
+  // public member functions
+  void lock();
+  bool try_lock();
+  bool timed_lock(const boost::posix_time::ptime &);
+  void unlock();
+  void lock_sharable();
+  bool try_lock_sharable();
+  bool timed_lock_sharable(const boost::posix_time::ptime &);
+  void unlock_sharable();
+};
    +
    +

    Description

    +

    Wraps a interprocess_sharable_mutex that can be placed in shared memory and can be shared between processes. Allows timed lock tries

    +
    +

    +interprocess_sharable_mutex + public + construct/copy/destruct

    +
      +
    1. interprocess_sharable_mutex(const interprocess_sharable_mutex &);
      2. +
    2. +
      interprocess_sharable_mutex();
      +

      Constructs the sharable lock. Throws interprocess_exception on error.

      +
      3. +
    3. interprocess_sharable_mutex & operator=(const interprocess_sharable_mutex &);
      4. +
    4. +
      ~interprocess_sharable_mutex();
      +

      Destroys the sharable lock. Does not throw.

      +
      5. +
    +
    +
    +

    +interprocess_sharable_mutex public member functions

    +
      +
    1. +
      void lock();
      +

      Effects: The calling thread tries to obtain exclusive ownership of the mutex, and if another thread has exclusive or sharable ownership of the mutex, it waits until it can obtain the ownership. Throws: interprocess_exception on error.

      +
      2. +
    2. +
      bool try_lock();
      +

      Effects: The calling thread tries to acquire exclusive ownership of the mutex without waiting. If no other thread has exclusive or sharable ownership of the mutex this succeeds. Returns: If it can acquire exclusive ownership immediately returns true. If it has to wait, returns false. Throws: interprocess_exception on error.

      +
      3. +
    3. +
      bool timed_lock(const boost::posix_time::ptime & abs_time);
      +

      Effects: The calling thread tries to acquire exclusive ownership of the mutex waiting if necessary until no other thread has exclusive or sharable ownership of the mutex or abs_time is reached. Returns: If acquires exclusive ownership, returns true. Otherwise returns false. Throws: interprocess_exception on error.

      +
      4. +
    4. +
      void unlock();
      +

      Precondition: The thread must have exclusive ownership of the mutex. Effects: The calling thread releases the exclusive ownership of the mutex. Throws: An exception derived from interprocess_exception on error.

      +
      5. +
    5. +
      void lock_sharable();
      +

      Effects: The calling thread tries to obtain sharable ownership of the mutex, and if another thread has exclusive ownership of the mutex, waits until it can obtain the ownership. Throws: interprocess_exception on error.

      +
      6. +
    6. +
      bool try_lock_sharable();
      +

      Effects: The calling thread tries to acquire sharable ownership of the mutex without waiting. If no other thread has exclusive ownership of the mutex this succeeds. Returns: If it can acquire sharable ownership immediately returns true. If it has to wait, returns false. Throws: interprocess_exception on error.

      +
      7. +
    7. +
      bool timed_lock_sharable(const boost::posix_time::ptime & abs_time);
      +

      Effects: The calling thread tries to acquire sharable ownership of the mutex waiting if necessary until no other thread has exclusive ownership of the mutex or abs_time is reached. Returns: If acquires sharable ownership, returns true. Otherwise returns false. Throws: interprocess_exception on error.

      +
      8. +
    8. +
      void unlock_sharable();
      +

      Precondition: The thread must have sharable ownership of the mutex. Effects: The calling thread releases the sharable ownership of the mutex. Throws: An exception derived from interprocess_exception on error.

      +
      9. +
    +
    +
    +
    + + + +
    Copyright © 2005-2015 Ion Gaztanaga

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/interprocess/interprocess_s_idp56838960.html b/doc/html/boost/interprocess/interprocess_s_idp56838960.html deleted file mode 100644 index 931f333ab9..0000000000 --- a/doc/html/boost/interprocess/interprocess_s_idp56838960.html +++ /dev/null @@ -1,128 +0,0 @@ - - - - -Class interprocess_sharable_mutex - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Class interprocess_sharable_mutex

    -

    boost::interprocess::interprocess_sharable_mutex

    -
    -

    Synopsis

    -
    // In header: <boost/interprocess/sync/interprocess_sharable_mutex.hpp>
-
-
-class interprocess_sharable_mutex {
-public:
-  // construct/copy/destruct
-  interprocess_sharable_mutex(const interprocess_sharable_mutex &);
-  interprocess_sharable_mutex();
-  interprocess_sharable_mutex & operator=(const interprocess_sharable_mutex &);
-  ~interprocess_sharable_mutex();
-
-  // public member functions
-  void lock();
-  bool try_lock();
-  bool timed_lock(const boost::posix_time::ptime &);
-  void unlock();
-  void lock_sharable();
-  bool try_lock_sharable();
-  bool timed_lock_sharable(const boost::posix_time::ptime &);
-  void unlock_sharable();
-};
    -
    -

    Description

    -

    Wraps a interprocess_sharable_mutex that can be placed in shared memory and can be shared between processes. Allows timed lock tries

    -
    -

    -interprocess_sharable_mutex - public - construct/copy/destruct

    -
      -
    1. interprocess_sharable_mutex(const interprocess_sharable_mutex &);
      2. -
    2. -
      interprocess_sharable_mutex();
      -

      Constructs the sharable lock. Throws interprocess_exception on error.

      -
      3. -
    3. interprocess_sharable_mutex & operator=(const interprocess_sharable_mutex &);
      4. -
    4. -
      ~interprocess_sharable_mutex();
      -

      Destroys the sharable lock. Does not throw.

      -
      5. -
    -
    -
    -

    -interprocess_sharable_mutex public member functions

    -
      -
    1. -
      void lock();
      -

      Effects: The calling thread tries to obtain exclusive ownership of the mutex, and if another thread has exclusive or sharable ownership of the mutex, it waits until it can obtain the ownership. Throws: interprocess_exception on error.

      -
      2. -
    2. -
      bool try_lock();
      -

      Effects: The calling thread tries to acquire exclusive ownership of the mutex without waiting. If no other thread has exclusive or sharable ownership of the mutex this succeeds. Returns: If it can acquire exclusive ownership immediately returns true. If it has to wait, returns false. Throws: interprocess_exception on error.

      -
      3. -
    3. -
      bool timed_lock(const boost::posix_time::ptime & abs_time);
      -

      Effects: The calling thread tries to acquire exclusive ownership of the mutex waiting if necessary until no other thread has exclusive or sharable ownership of the mutex or abs_time is reached. Returns: If acquires exclusive ownership, returns true. Otherwise returns false. Throws: interprocess_exception on error.

      -
      4. -
    4. -
      void unlock();
      -

      Precondition: The thread must have exclusive ownership of the mutex. Effects: The calling thread releases the exclusive ownership of the mutex. Throws: An exception derived from interprocess_exception on error.

      -
      5. -
    5. -
      void lock_sharable();
      -

      Effects: The calling thread tries to obtain sharable ownership of the mutex, and if another thread has exclusive ownership of the mutex, waits until it can obtain the ownership. Throws: interprocess_exception on error.

      -
      6. -
    6. -
      bool try_lock_sharable();
      -

      Effects: The calling thread tries to acquire sharable ownership of the mutex without waiting. If no other thread has exclusive ownership of the mutex this succeeds. Returns: If it can acquire sharable ownership immediately returns true. If it has to wait, returns false. Throws: interprocess_exception on error.

      -
      7. -
    7. -
      bool timed_lock_sharable(const boost::posix_time::ptime & abs_time);
      -

      Effects: The calling thread tries to acquire sharable ownership of the mutex waiting if necessary until no other thread has exclusive ownership of the mutex or abs_time is reached. Returns: If acquires sharable ownership, returns true. Otherwise returns false. Throws: interprocess_exception on error.

      -
      8. -
    8. -
      void unlock_sharable();
      -

      Precondition: The thread must have sharable ownership of the mutex. Effects: The calling thread releases the sharable ownership of the mutex. Throws: An exception derived from interprocess_exception on error.

      -
      9. -
    -
    -
    -
    - - - -
    Copyright © 2005-2015 Ion Gaztanaga

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/interprocess/interprocess_semaphore.html b/doc/html/boost/interprocess/interprocess_semaphore.html index a458054967..64acddc323 100644 --- a/doc/html/boost/interprocess/interprocess_semaphore.html +++ b/doc/html/boost/interprocess/interprocess_semaphore.html @@ -7,8 +7,8 @@ - - + + @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -36,14 +36,14 @@ class interprocess_semaphore { public: // construct/copy/destruct - interprocess_semaphore(unsigned int); - ~interprocess_semaphore(); + interprocess_semaphore(unsigned int); + ~interprocess_semaphore(); - // public member functions - void post(); - void wait(); - bool try_wait(); - bool timed_wait(const boost::posix_time::ptime &); + // public member functions + void post(); + void wait(); + bool try_wait(); + bool timed_wait(const boost::posix_time::ptime &); };

    Description

    @@ -55,33 +55,33 @@ construct/copy/destruct
    1. -
      interprocess_semaphore(unsigned int initialCount);
      +
      interprocess_semaphore(unsigned int initialCount);

      Creates a interprocess_semaphore with the given initial count. interprocess_exception if there is an error.

    2. -
      ~interprocess_semaphore();
      +
      ~interprocess_semaphore();

      Destroys the interprocess_semaphore. Does not throw

    -interprocess_semaphore public member functions

    +interprocess_semaphore public member functions
    1. -
      void post();
      +
      void post();

      Increments the interprocess_semaphore count. If there are processes/threads blocked waiting for the interprocess_semaphore, then one of these processes will return successfully from its wait function. If there is an error an interprocess_exception exception is thrown.

    2. -
      void wait();
      +
      void wait();

      Decrements the interprocess_semaphore. If the interprocess_semaphore value is not greater than zero, then the calling process/thread blocks until it can decrement the counter. If there is an error an interprocess_exception exception is thrown.

    3. -
      bool try_wait();
      +
      bool try_wait();

      Decrements the interprocess_semaphore if the interprocess_semaphore's value is greater than zero and returns true. If the value is not greater than zero returns false. If there is an error an interprocess_exception exception is thrown.

    4. -
      bool timed_wait(const boost::posix_time::ptime & abs_time);
      +
      bool timed_wait(const boost::posix_time::ptime & abs_time);

      Decrements the interprocess_semaphore if the interprocess_semaphore's value is greater than zero and returns true. Otherwise, waits for the interprocess_semaphore to the posted or the timeout expires. If the timeout expires, the function returns false. If the interprocess_semaphore is posted the function returns true. If there is an error throws sem_exception

    @@ -98,7 +98,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/interprocess/interprocess_u_idp40973072.html b/doc/html/boost/interprocess/interprocess_u_idp40973072.html new file mode 100644 index 0000000000..0659f1832d --- /dev/null +++ b/doc/html/boost/interprocess/interprocess_u_idp40973072.html @@ -0,0 +1,190 @@ + + + + +Class interprocess_upgradable_mutex + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Class interprocess_upgradable_mutex

    +

    boost::interprocess::interprocess_upgradable_mutex

    +
    +

    Synopsis

    +
    // In header: <boost/interprocess/sync/interprocess_upgradable_mutex.hpp>
+
+
+class interprocess_upgradable_mutex {
+public:
+  // construct/copy/destruct
+  interprocess_upgradable_mutex(const interprocess_upgradable_mutex &);
+  interprocess_upgradable_mutex();
+  interprocess_upgradable_mutex & 
+  operator=(const interprocess_upgradable_mutex &);
+  ~interprocess_upgradable_mutex();
+
+  // public member functions
+  void lock();
+  bool try_lock();
+  bool timed_lock(const boost::posix_time::ptime &);
+  void unlock();
+  void lock_sharable();
+  bool try_lock_sharable();
+  bool timed_lock_sharable(const boost::posix_time::ptime &);
+  void unlock_sharable();
+  void lock_upgradable();
+  bool try_lock_upgradable();
+  bool timed_lock_upgradable(const boost::posix_time::ptime &);
+  void unlock_upgradable();
+  void unlock_and_lock_upgradable();
+  void unlock_and_lock_sharable();
+  void unlock_upgradable_and_lock_sharable();
+  void unlock_upgradable_and_lock();
+  bool try_unlock_upgradable_and_lock();
+  *bool timed_unlock_upgradable_and_lock(const boost::posix_time::ptime &);
+  bool try_unlock_sharable_and_lock();
+  bool try_unlock_sharable_and_lock_upgradable();
+};
    +
    +

    Description

    +

    Wraps a interprocess_upgradable_mutex that can be placed in shared memory and can be shared between processes. Allows timed lock tries

    +
    +

    +interprocess_upgradable_mutex + public + construct/copy/destruct

    +
      +
    1. interprocess_upgradable_mutex(const interprocess_upgradable_mutex &);
      2. +
    2. +
      interprocess_upgradable_mutex();
      +

      Constructs the upgradable lock. Throws interprocess_exception on error.

      +
      3. +
    3. interprocess_upgradable_mutex & 
+operator=(const interprocess_upgradable_mutex &);
      4. +
    4. +
      ~interprocess_upgradable_mutex();
      +

      Destroys the upgradable lock. Does not throw.

      +
      5. +
    +
    +
    +

    +interprocess_upgradable_mutex public member functions

    +
      +
    1. +
      void lock();
      +

      Effects: The calling thread tries to obtain exclusive ownership of the mutex, and if another thread has exclusive, sharable or upgradable ownership of the mutex, it waits until it can obtain the ownership. Throws: interprocess_exception on error.

      +
      2. +
    2. +
      bool try_lock();
      +

      Effects: The calling thread tries to acquire exclusive ownership of the mutex without waiting. If no other thread has exclusive, sharable or upgradable ownership of the mutex this succeeds. Returns: If it can acquire exclusive ownership immediately returns true. If it has to wait, returns false. Throws: interprocess_exception on error.

      +
      3. +
    3. +
      bool timed_lock(const boost::posix_time::ptime & abs_time);
      +

      Effects: The calling thread tries to acquire exclusive ownership of the mutex waiting if necessary until no other thread has exclusive, sharable or upgradable ownership of the mutex or abs_time is reached. Returns: If acquires exclusive ownership, returns true. Otherwise returns false. Throws: interprocess_exception on error.

      +
      4. +
    4. +
      void unlock();
      +

      Precondition: The thread must have exclusive ownership of the mutex. Effects: The calling thread releases the exclusive ownership of the mutex. Throws: An exception derived from interprocess_exception on error.

      +
      5. +
    5. +
      void lock_sharable();
      +

      Effects: The calling thread tries to obtain sharable ownership of the mutex, and if another thread has exclusive ownership of the mutex, waits until it can obtain the ownership. Throws: interprocess_exception on error.

      +
      6. +
    6. +
      bool try_lock_sharable();
      +

      Effects: The calling thread tries to acquire sharable ownership of the mutex without waiting. If no other thread has exclusive ownership of the mutex this succeeds. Returns: If it can acquire sharable ownership immediately returns true. If it has to wait, returns false. Throws: interprocess_exception on error.

      +
      7. +
    7. +
      bool timed_lock_sharable(const boost::posix_time::ptime & abs_time);
      +

      Effects: The calling thread tries to acquire sharable ownership of the mutex waiting if necessary until no other thread has exclusive ownership of the mutex or abs_time is reached. Returns: If acquires sharable ownership, returns true. Otherwise returns false. Throws: interprocess_exception on error.

      +
      8. +
    8. +
      void unlock_sharable();
      +

      Precondition: The thread must have sharable ownership of the mutex. Effects: The calling thread releases the sharable ownership of the mutex. Throws: An exception derived from interprocess_exception on error.

      +
      9. +
    9. +
      void lock_upgradable();
      +

      Effects: The calling thread tries to obtain upgradable ownership of the mutex, and if another thread has exclusive or upgradable ownership of the mutex, waits until it can obtain the ownership. Throws: interprocess_exception on error.

      +
      10. +
    10. +
      bool try_lock_upgradable();
      +

      Effects: The calling thread tries to acquire upgradable ownership of the mutex without waiting. If no other thread has exclusive or upgradable ownership of the mutex this succeeds. Returns: If it can acquire upgradable ownership immediately returns true. If it has to wait, returns false. Throws: interprocess_exception on error.

      +
      11. +
    11. +
      bool timed_lock_upgradable(const boost::posix_time::ptime & abs_time);
      +

      Effects: The calling thread tries to acquire upgradable ownership of the mutex waiting if necessary until no other thread has exclusive or upgradable ownership of the mutex or abs_time is reached. Returns: If acquires upgradable ownership, returns true. Otherwise returns false. Throws: interprocess_exception on error.

      +
      12. +
    12. +
      void unlock_upgradable();
      +

      Precondition: The thread must have upgradable ownership of the mutex. Effects: The calling thread releases the upgradable ownership of the mutex. Throws: An exception derived from interprocess_exception on error.

      +
      13. +
    13. +
      void unlock_and_lock_upgradable();
      +

      Precondition: The thread must have exclusive ownership of the mutex. Effects: The thread atomically releases exclusive ownership and acquires upgradable ownership. This operation is non-blocking. Throws: An exception derived from interprocess_exception on error.

      +
      14. +
    14. +
      void unlock_and_lock_sharable();
      +

      Precondition: The thread must have exclusive ownership of the mutex. Effects: The thread atomically releases exclusive ownership and acquires sharable ownership. This operation is non-blocking. Throws: An exception derived from interprocess_exception on error.

      +
      15. +
    15. +
      void unlock_upgradable_and_lock_sharable();
      +

      Precondition: The thread must have upgradable ownership of the mutex. Effects: The thread atomically releases upgradable ownership and acquires sharable ownership. This operation is non-blocking. Throws: An exception derived from interprocess_exception on error.

      +
      16. +
    16. +
      void unlock_upgradable_and_lock();
      +

      Precondition: The thread must have upgradable ownership of the mutex. Effects: The thread atomically releases upgradable ownership and acquires exclusive ownership. This operation will block until all threads with sharable ownership release their sharable lock. Throws: An exception derived from interprocess_exception on error.

      +
      17. +
    17. +
      bool try_unlock_upgradable_and_lock();
      +

      Precondition: The thread must have upgradable ownership of the mutex. Effects: The thread atomically releases upgradable ownership and tries to acquire exclusive ownership. This operation will fail if there are threads with sharable ownership, but it will maintain upgradable ownership. Returns: If acquires exclusive ownership, returns true. Otherwise returns false. Throws: An exception derived from interprocess_exception on error.

      +
      18. +
    18. +
      *bool timed_unlock_upgradable_and_lock(const boost::posix_time::ptime & abs_time);
      +

      Precondition: The thread must have upgradable ownership of the mutex. Effects: The thread atomically releases upgradable ownership and tries to acquire exclusive ownership, waiting if necessary until abs_time. This operation will fail if there are threads with sharable ownership or timeout reaches, but it will maintain upgradable ownership. Returns: If acquires exclusive ownership, returns true. Otherwise returns false. Throws: An exception derived from interprocess_exception on error.

      +
      19. +
    19. +
      bool try_unlock_sharable_and_lock();
      +

      Precondition: The thread must have sharable ownership of the mutex. Effects: The thread atomically releases sharable ownership and tries to acquire exclusive ownership. This operation will fail if there are threads with sharable or upgradable ownership, but it will maintain sharable ownership. Returns: If acquires exclusive ownership, returns true. Otherwise returns false. Throws: An exception derived from interprocess_exception on error.

      +
      20. +
    20. +
      bool try_unlock_sharable_and_lock_upgradable();
      +

      Precondition: The thread must have sharable ownership of the mutex. Effects: The thread atomically releases sharable ownership and tries to acquire upgradable ownership. This operation will fail if there are threads with sharable or upgradable ownership, but it will maintain sharable ownership. Returns: If acquires upgradable ownership, returns true. Otherwise returns false. Throws: An exception derived from interprocess_exception on error.

      +
      21. +
    +
    +
    +
    + + + +
    Copyright © 2005-2015 Ion Gaztanaga

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/interprocess/interprocess_u_idp56869776.html b/doc/html/boost/interprocess/interprocess_u_idp56869776.html deleted file mode 100644 index f19dbb6127..0000000000 --- a/doc/html/boost/interprocess/interprocess_u_idp56869776.html +++ /dev/null @@ -1,190 +0,0 @@ - - - - -Class interprocess_upgradable_mutex - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Class interprocess_upgradable_mutex

    -

    boost::interprocess::interprocess_upgradable_mutex

    -
    -

    Synopsis

    -
    // In header: <boost/interprocess/sync/interprocess_upgradable_mutex.hpp>
-
-
-class interprocess_upgradable_mutex {
-public:
-  // construct/copy/destruct
-  interprocess_upgradable_mutex(const interprocess_upgradable_mutex &);
-  interprocess_upgradable_mutex();
-  interprocess_upgradable_mutex & 
-  operator=(const interprocess_upgradable_mutex &);
-  ~interprocess_upgradable_mutex();
-
-  // public member functions
-  void lock();
-  bool try_lock();
-  bool timed_lock(const boost::posix_time::ptime &);
-  void unlock();
-  void lock_sharable();
-  bool try_lock_sharable();
-  bool timed_lock_sharable(const boost::posix_time::ptime &);
-  void unlock_sharable();
-  void lock_upgradable();
-  bool try_lock_upgradable();
-  bool timed_lock_upgradable(const boost::posix_time::ptime &);
-  void unlock_upgradable();
-  void unlock_and_lock_upgradable();
-  void unlock_and_lock_sharable();
-  void unlock_upgradable_and_lock_sharable();
-  void unlock_upgradable_and_lock();
-  bool try_unlock_upgradable_and_lock();
-  *bool timed_unlock_upgradable_and_lock(const boost::posix_time::ptime &);
-  bool try_unlock_sharable_and_lock();
-  bool try_unlock_sharable_and_lock_upgradable();
-};
    -
    -

    Description

    -

    Wraps a interprocess_upgradable_mutex that can be placed in shared memory and can be shared between processes. Allows timed lock tries

    -
    -

    -interprocess_upgradable_mutex - public - construct/copy/destruct

    -
      -
    1. interprocess_upgradable_mutex(const interprocess_upgradable_mutex &);
      2. -
    2. -
      interprocess_upgradable_mutex();
      -

      Constructs the upgradable lock. Throws interprocess_exception on error.

      -
      3. -
    3. interprocess_upgradable_mutex & 
-operator=(const interprocess_upgradable_mutex &);
      4. -
    4. -
      ~interprocess_upgradable_mutex();
      -

      Destroys the upgradable lock. Does not throw.

      -
      5. -
    -
    -
    -

    -interprocess_upgradable_mutex public member functions

    -
      -
    1. -
      void lock();
      -

      Effects: The calling thread tries to obtain exclusive ownership of the mutex, and if another thread has exclusive, sharable or upgradable ownership of the mutex, it waits until it can obtain the ownership. Throws: interprocess_exception on error.

      -
      2. -
    2. -
      bool try_lock();
      -

      Effects: The calling thread tries to acquire exclusive ownership of the mutex without waiting. If no other thread has exclusive, sharable or upgradable ownership of the mutex this succeeds. Returns: If it can acquire exclusive ownership immediately returns true. If it has to wait, returns false. Throws: interprocess_exception on error.

      -
      3. -
    3. -
      bool timed_lock(const boost::posix_time::ptime & abs_time);
      -

      Effects: The calling thread tries to acquire exclusive ownership of the mutex waiting if necessary until no other thread has exclusive, sharable or upgradable ownership of the mutex or abs_time is reached. Returns: If acquires exclusive ownership, returns true. Otherwise returns false. Throws: interprocess_exception on error.

      -
      4. -
    4. -
      void unlock();
      -

      Precondition: The thread must have exclusive ownership of the mutex. Effects: The calling thread releases the exclusive ownership of the mutex. Throws: An exception derived from interprocess_exception on error.

      -
      5. -
    5. -
      void lock_sharable();
      -

      Effects: The calling thread tries to obtain sharable ownership of the mutex, and if another thread has exclusive ownership of the mutex, waits until it can obtain the ownership. Throws: interprocess_exception on error.

      -
      6. -
    6. -
      bool try_lock_sharable();
      -

      Effects: The calling thread tries to acquire sharable ownership of the mutex without waiting. If no other thread has exclusive ownership of the mutex this succeeds. Returns: If it can acquire sharable ownership immediately returns true. If it has to wait, returns false. Throws: interprocess_exception on error.

      -
      7. -
    7. -
      bool timed_lock_sharable(const boost::posix_time::ptime & abs_time);
      -

      Effects: The calling thread tries to acquire sharable ownership of the mutex waiting if necessary until no other thread has exclusive ownership of the mutex or abs_time is reached. Returns: If acquires sharable ownership, returns true. Otherwise returns false. Throws: interprocess_exception on error.

      -
      8. -
    8. -
      void unlock_sharable();
      -

      Precondition: The thread must have sharable ownership of the mutex. Effects: The calling thread releases the sharable ownership of the mutex. Throws: An exception derived from interprocess_exception on error.

      -
      9. -
    9. -
      void lock_upgradable();
      -

      Effects: The calling thread tries to obtain upgradable ownership of the mutex, and if another thread has exclusive or upgradable ownership of the mutex, waits until it can obtain the ownership. Throws: interprocess_exception on error.

      -
      10. -
    10. -
      bool try_lock_upgradable();
      -

      Effects: The calling thread tries to acquire upgradable ownership of the mutex without waiting. If no other thread has exclusive or upgradable ownership of the mutex this succeeds. Returns: If it can acquire upgradable ownership immediately returns true. If it has to wait, returns false. Throws: interprocess_exception on error.

      -
      11. -
    11. -
      bool timed_lock_upgradable(const boost::posix_time::ptime & abs_time);
      -

      Effects: The calling thread tries to acquire upgradable ownership of the mutex waiting if necessary until no other thread has exclusive or upgradable ownership of the mutex or abs_time is reached. Returns: If acquires upgradable ownership, returns true. Otherwise returns false. Throws: interprocess_exception on error.

      -
      12. -
    12. -
      void unlock_upgradable();
      -

      Precondition: The thread must have upgradable ownership of the mutex. Effects: The calling thread releases the upgradable ownership of the mutex. Throws: An exception derived from interprocess_exception on error.

      -
      13. -
    13. -
      void unlock_and_lock_upgradable();
      -

      Precondition: The thread must have exclusive ownership of the mutex. Effects: The thread atomically releases exclusive ownership and acquires upgradable ownership. This operation is non-blocking. Throws: An exception derived from interprocess_exception on error.

      -
      14. -
    14. -
      void unlock_and_lock_sharable();
      -

      Precondition: The thread must have exclusive ownership of the mutex. Effects: The thread atomically releases exclusive ownership and acquires sharable ownership. This operation is non-blocking. Throws: An exception derived from interprocess_exception on error.

      -
      15. -
    15. -
      void unlock_upgradable_and_lock_sharable();
      -

      Precondition: The thread must have upgradable ownership of the mutex. Effects: The thread atomically releases upgradable ownership and acquires sharable ownership. This operation is non-blocking. Throws: An exception derived from interprocess_exception on error.

      -
      16. -
    16. -
      void unlock_upgradable_and_lock();
      -

      Precondition: The thread must have upgradable ownership of the mutex. Effects: The thread atomically releases upgradable ownership and acquires exclusive ownership. This operation will block until all threads with sharable ownership release their sharable lock. Throws: An exception derived from interprocess_exception on error.

      -
      17. -
    17. -
      bool try_unlock_upgradable_and_lock();
      -

      Precondition: The thread must have upgradable ownership of the mutex. Effects: The thread atomically releases upgradable ownership and tries to acquire exclusive ownership. This operation will fail if there are threads with sharable ownership, but it will maintain upgradable ownership. Returns: If acquires exclusive ownership, returns true. Otherwise returns false. Throws: An exception derived from interprocess_exception on error.

      -
      18. -
    18. -
      *bool timed_unlock_upgradable_and_lock(const boost::posix_time::ptime & abs_time);
      -

      Precondition: The thread must have upgradable ownership of the mutex. Effects: The thread atomically releases upgradable ownership and tries to acquire exclusive ownership, waiting if necessary until abs_time. This operation will fail if there are threads with sharable ownership or timeout reaches, but it will maintain upgradable ownership. Returns: If acquires exclusive ownership, returns true. Otherwise returns false. Throws: An exception derived from interprocess_exception on error.

      -
      19. -
    19. -
      bool try_unlock_sharable_and_lock();
      -

      Precondition: The thread must have sharable ownership of the mutex. Effects: The thread atomically releases sharable ownership and tries to acquire exclusive ownership. This operation will fail if there are threads with sharable or upgradable ownership, but it will maintain sharable ownership. Returns: If acquires exclusive ownership, returns true. Otherwise returns false. Throws: An exception derived from interprocess_exception on error.

      -
      20. -
    20. -
      bool try_unlock_sharable_and_lock_upgradable();
      -

      Precondition: The thread must have sharable ownership of the mutex. Effects: The thread atomically releases sharable ownership and tries to acquire upgradable ownership. This operation will fail if there are threads with sharable or upgradable ownership, but it will maintain sharable ownership. Returns: If acquires upgradable ownership, returns true. Otherwise returns false. Throws: An exception derived from interprocess_exception on error.

      -
      21. -
    -
    -
    -
    - - - -
    Copyright © 2005-2015 Ion Gaztanaga

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/interprocess/intrusive_ptr.html b/doc/html/boost/interprocess/intrusive_ptr.html index 39b1beda90..ab68f72d65 100644 --- a/doc/html/boost/interprocess/intrusive_ptr.html +++ b/doc/html/boost/interprocess/intrusive_ptr.html @@ -8,7 +8,7 @@ - + @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -40,30 +40,33 @@ typedef T element_type; // Provides the type of the stored pointer. // construct/copy/destruct - intrusive_ptr(); - intrusive_ptr(const pointer &, bool = true); - intrusive_ptr(intrusive_ptr const &); - template<typename U> intrusive_ptr(intrusive_ptr< U, VP > const &); - intrusive_ptr & operator=(intrusive_ptr const &); + intrusive_ptr() noexcept; + intrusive_ptr(const pointer &, bool = true) noexcept; + intrusive_ptr(intrusive_ptr const &) noexcept; + intrusive_ptr(intrusive_ptr &&) noexcept; + template<typename U> intrusive_ptr(intrusive_ptr< U, VP > const &) noexcept; + intrusive_ptr & operator=(BOOST_COPY_ASSIGN_REF(intrusive_ptr)) noexcept; + intrusive_ptr & operator=(intrusive_ptr &&) noexcept; template<typename U> - intrusive_ptr & operator=(intrusive_ptr< U, VP > const &); - intrusive_ptr & operator=(pointer); - ~intrusive_ptr(); + intrusive_ptr & operator=(intrusive_ptr< U, VP > const &) noexcept; + intrusive_ptr & operator=(pointer) noexcept; + ~intrusive_ptr(); - // public member functions - pointer & get(); - const pointer & get() const; - T & operator*() const; - const pointer & operator->() const; - pointer & operator->(); - operator unspecified_bool_type() const; - bool operator!() const; - void swap(intrusive_ptr &); + // public member functions + void reset() noexcept; + pointer & get() noexcept; + const pointer & get() const noexcept; + T & operator*() const noexcept; + const pointer & operator->() const noexcept; + pointer & operator->() noexcept; + operator unspecified_bool_type() const noexcept; + bool operator!() const noexcept; + void swap(intrusive_ptr &) noexcept; };

    Description

    The intrusive_ptr class template stores a pointer to an object with an embedded reference count. intrusive_ptr is parameterized on T (the type of the object pointed to) and VoidPointer(a void pointer type that defines the type of pointer that intrusive_ptr will store). intrusive_ptr<T, void *> defines a class with a T* member whereas intrusive_ptr<T, offset_ptr<void> > defines a class with a offset_ptr<T> member. Relies on unqualified calls to:

    -

    void intrusive_ptr_add_ref(T * p); void intrusive_ptr_release(T * p);

    +

    void intrusive_ptr_add_ref(T * p) BOOST_NOEXCEPT; void intrusive_ptr_release(T * p) BOOST_NOEXCEPT;

    with (p != 0)

    The object is responsible for destroying itself.

    @@ -73,74 +76,83 @@ construct/copy/destruct
    1. -
      intrusive_ptr();
      +
      intrusive_ptr() noexcept;

      Constructor. Initializes internal pointer to 0. Does not throw

    2. -
      intrusive_ptr(const pointer & p, bool add_ref = true);
      +
      intrusive_ptr(const pointer & p, bool add_ref = true) noexcept;

      Constructor. Copies pointer and if "p" is not zero and "add_ref" is true calls intrusive_ptr_add_ref(to_raw_pointer(p)). Does not throw

    3. -
      intrusive_ptr(intrusive_ptr const & rhs);
      +
      intrusive_ptr(intrusive_ptr const & rhs) noexcept;

      Copy constructor. Copies the internal pointer and if "p" is not zero calls intrusive_ptr_add_ref(to_raw_pointer(p)). Does not throw

    4. -
      template<typename U> intrusive_ptr(intrusive_ptr< U, VP > const & rhs);
      +
      intrusive_ptr(intrusive_ptr && rhs) noexcept;
      Move constructor. Moves the internal pointer. Does not throw.
      5. +
    5. +
      template<typename U> 
+  intrusive_ptr(intrusive_ptr< U, VP > const & rhs) noexcept;

      Constructor from related. Copies the internal pointer and if "p" is not zero calls intrusive_ptr_add_ref(to_raw_pointer(p)). Does not throw

    6. -
      intrusive_ptr & operator=(intrusive_ptr const & rhs);
      +
      intrusive_ptr & operator=(BOOST_COPY_ASSIGN_REF(intrusive_ptr) rhs) noexcept;

      Assignment operator. Equivalent to intrusive_ptr(r).swap(*this). Does not throw

    7. +
      intrusive_ptr & operator=(intrusive_ptr && rhs) noexcept;
      +

      Move Assignment operator Does not throw

      +
      8. +
    8. template<typename U> 
-  intrusive_ptr & operator=(intrusive_ptr< U, VP > const & rhs);
      + intrusive_ptr & operator=(intrusive_ptr< U, VP > const & rhs) noexcept;

      Assignment from related. Equivalent to intrusive_ptr(r).swap(*this). Does not throw

    9. -
      intrusive_ptr & operator=(pointer rhs);
      +
      intrusive_ptr & operator=(pointer rhs) noexcept;

      Assignment from pointer. Equivalent to intrusive_ptr(r).swap(*this). Does not throw

    10. -
      ~intrusive_ptr();
      -

      Destructor. If internal pointer is not 0, calls intrusive_ptr_release(to_raw_pointer(m_ptr)). Does not throw

      -
      11. +
      ~intrusive_ptr();
      Destructor. Calls reset(). Does not throw.

    -intrusive_ptr public member functions

    +intrusive_ptr public member functions
    1. -
      pointer & get();
      +
      void reset() noexcept;
      +

      Release internal pointer and set it to 0. If internal pointer is not 0, calls intrusive_ptr_release(to_raw_pointer(m_ptr)). Does not throw

      +
      2. +
    2. +
      pointer & get() noexcept;

      Returns a reference to the internal pointer. Does not throw

    3. -
      const pointer & get() const;
      +
      const pointer & get() const noexcept;

      Returns a reference to the internal pointer. Does not throw

    4. -
      T & operator*() const;
      +
      T & operator*() const noexcept;

      Returns *get(). Does not throw

    5. -
      const pointer & operator->() const;
      +
      const pointer & operator->() const noexcept;

      Returns *get(). Does not throw

    6. -
      pointer & operator->();
      +
      pointer & operator->() noexcept;

      Returns get(). Does not throw

    7. -
      operator unspecified_bool_type() const;
      +
      operator unspecified_bool_type() const noexcept;

      Conversion to boolean. Does not throw

    8. -
      bool operator!() const;
      +
      bool operator!() const noexcept;

      Not operator. Does not throw

    9. -
      void swap(intrusive_ptr & rhs);
      +
      void swap(intrusive_ptr & rhs) noexcept;

      Exchanges the contents of the two smart pointers. Does not throw

    @@ -157,7 +169,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/interprocess/iset_index.html b/doc/html/boost/interprocess/iset_index.html index aef400075e..550322033b 100644 --- a/doc/html/boost/interprocess/iset_index.html +++ b/doc/html/boost/interprocess/iset_index.html @@ -42,15 +42,15 @@ typedef index_type::value_type value_type; // construct/copy/destruct - iset_index(typename MapConfig::segment_manager_base *); + iset_index(typename MapConfig::segment_manager_base *); - // public member functions - void reserve(typename MapConfig::segment_manager_base::size_type); - void shrink_to_fit(); - iterator find(const intrusive_compare_key_type &); - const_iterator find(const intrusive_compare_key_type &) const; + // public member functions + void reserve(typename MapConfig::segment_manager_base::size_type); + void shrink_to_fit(); + iterator find(const intrusive_compare_key_type &); + const_iterator find(const intrusive_compare_key_type &) const; std::pair< iterator, bool > - insert_check(const intrusive_compare_key_type &, insert_commit_data &); + insert_check(const intrusive_compare_key_type &, insert_commit_data &); };

    Description

    @@ -61,24 +61,24 @@ public construct/copy/destruct
    1. -
      iset_index(typename MapConfig::segment_manager_base *);
      +
      iset_index(typename MapConfig::segment_manager_base *);

      Constructor. Takes a pointer to the segment manager. Can throw

    -iset_index public member functions

    +iset_index public member functions
    1. -
      void reserve(typename MapConfig::segment_manager_base::size_type);
      +
      void reserve(typename MapConfig::segment_manager_base::size_type);

      This reserves memory to optimize the insertion of n elements in the index

    2. -
      void shrink_to_fit();
      This frees all unnecessary memory.
      3. -
    3. iterator find(const intrusive_compare_key_type & key);
      4. -
    4. const_iterator find(const intrusive_compare_key_type & key) const;
      5. +
      void shrink_to_fit();
      This frees all unnecessary memory. +
    5. iterator find(const intrusive_compare_key_type & key);
      6. +
    6. const_iterator find(const intrusive_compare_key_type & key) const;
    7. std::pair< iterator, bool > 
-insert_check(const intrusive_compare_key_type & key, 
+insert_check(const intrusive_compare_key_type & key, 
              insert_commit_data & commit_data);
    diff --git a/doc/html/boost/interprocess/iunordered_set_index.html b/doc/html/boost/interprocess/iunordered_set_index.html index 8cb086e995..c53e69ee35 100644 --- a/doc/html/boost/interprocess/iunordered_set_index.html +++ b/doc/html/boost/interprocess/iunordered_set_index.html @@ -48,17 +48,17 @@ typedef index_type::size_type size_type; // construct/copy/destruct - iunordered_set_index(segment_manager_base *); - ~iunordered_set_index(); + iunordered_set_index(segment_manager_base *); + ~iunordered_set_index(); - // public member functions - void reserve(size_type); - void shrink_to_fit(); - iterator find(const intrusive_compare_key_type &); - const_iterator find(const intrusive_compare_key_type &) const; + // public member functions + void reserve(size_type); + void shrink_to_fit(); + iterator find(const intrusive_compare_key_type &); + const_iterator find(const intrusive_compare_key_type &) const; std::pair< iterator, bool > - insert_check(const intrusive_compare_key_type &, insert_commit_data &); - iterator insert_commit(value_type &, insert_commit_data &); + insert_check(const intrusive_compare_key_type &, insert_commit_data &); + iterator insert_commit(value_type &, insert_commit_data &); };

    Description

    @@ -70,30 +70,30 @@ construct/copy/destruct
    1. -
      iunordered_set_index(segment_manager_base * mngr);
      +
      iunordered_set_index(segment_manager_base * mngr);

      Constructor. Takes a pointer to the segment manager. Can throw

      2. -
    2. ~iunordered_set_index();
      3. +
    3. ~iunordered_set_index();

    -iunordered_set_index public member functions

    +iunordered_set_index public member functions
    1. -
      void reserve(size_type new_n);
      +
      void reserve(size_type new_n);

      This reserves memory to optimize the insertion of n elements in the index

    2. -
      void shrink_to_fit();
      +
      void shrink_to_fit();

      This tries to free unused memory previously allocated.

      3. -
    3. iterator find(const intrusive_compare_key_type & key);
      4. -
    4. const_iterator find(const intrusive_compare_key_type & key) const;
      5. +
    5. iterator find(const intrusive_compare_key_type & key);
      6. +
    6. const_iterator find(const intrusive_compare_key_type & key) const;
    7. std::pair< iterator, bool > 
-insert_check(const intrusive_compare_key_type & key, 
+insert_check(const intrusive_compare_key_type & key, 
              insert_commit_data & commit_data);
      8. -
    8. iterator insert_commit(value_type & val, insert_commit_data & commit_data);
      9. +
    9. iterator insert_commit(value_type & val, insert_commit_data & commit_data);
    diff --git a/doc/html/boost/interprocess/lock_exception.html b/doc/html/boost/interprocess/lock_exception.html index 312a6a72cd..230cb33fd7 100644 --- a/doc/html/boost/interprocess/lock_exception.html +++ b/doc/html/boost/interprocess/lock_exception.html @@ -36,10 +36,10 @@ class lock_exception : public boost::interprocess::interprocess_exception { public: // construct/copy/destruct - lock_exception(); + lock_exception(); - // public member functions - virtual const char * what() const; + // public member functions + virtual const char * what() const; };

    Description

    @@ -49,12 +49,12 @@ lock_exception public construct/copy/destruct -
    1. lock_exception();
    +
    1. lock_exception();

    -lock_exception public member functions

    -
    1. virtual const char * what() const;
    +lock_exception public member functions +
    1. virtual const char * what() const;
    diff --git a/doc/html/boost/interprocess/make_managed_s_idp40508976.html b/doc/html/boost/interprocess/make_managed_s_idp40508976.html new file mode 100644 index 0000000000..1dda3c49bb --- /dev/null +++ b/doc/html/boost/interprocess/make_managed_s_idp40508976.html @@ -0,0 +1,58 @@ + + + + +Function template make_managed_shared_ptr + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Function template make_managed_shared_ptr

    +

    boost::interprocess::make_managed_shared_ptr

    +
    +

    Synopsis

    +
    // In header: <boost/interprocess/smart_ptr/shared_ptr.hpp>
+
+
+template<typename T, typename ManagedMemory> 
+  managed_shared_ptr< T, ManagedMemory >::type 
+  make_managed_shared_ptr(T * constructed_object, 
+                          ManagedMemory & managed_memory);
    +
    +

    Description

    +

    Returns an instance of a shared pointer constructed with the default allocator and deleter from a pointer of type T that has been allocated in the passed managed segment

    +
    +
    + + + +
    Copyright © 2005-2015 Ion Gaztanaga

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/interprocess/make_managed_s_idp40513488.html b/doc/html/boost/interprocess/make_managed_s_idp40513488.html new file mode 100644 index 0000000000..c46da2fa2c --- /dev/null +++ b/doc/html/boost/interprocess/make_managed_s_idp40513488.html @@ -0,0 +1,59 @@ + + + + +Function template make_managed_shared_ptr + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Function template make_managed_shared_ptr

    +

    boost::interprocess::make_managed_shared_ptr

    +
    +

    Synopsis

    +
    // In header: <boost/interprocess/smart_ptr/shared_ptr.hpp>
+
+
+template<typename T, typename ManagedMemory> 
+  managed_shared_ptr< T, ManagedMemory >::type 
+  make_managed_shared_ptr(T * constructed_object, 
+                          ManagedMemory & managed_memory, 
+                          const std::nothrow_t &);
    +
    +

    Description

    +

    Returns an instance of a shared pointer constructed with the default allocator and deleter from a pointer of type T that has been allocated in the passed managed segment. Does not throw, return null shared pointer in error.

    +
    +
    + + + +
    Copyright © 2005-2015 Ion Gaztanaga

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/interprocess/make_managed_s_idp56405680.html b/doc/html/boost/interprocess/make_managed_s_idp56405680.html deleted file mode 100644 index 29277c15ff..0000000000 --- a/doc/html/boost/interprocess/make_managed_s_idp56405680.html +++ /dev/null @@ -1,58 +0,0 @@ - - - - -Function template make_managed_shared_ptr - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Function template make_managed_shared_ptr

    -

    boost::interprocess::make_managed_shared_ptr

    -
    -

    Synopsis

    -
    // In header: <boost/interprocess/smart_ptr/shared_ptr.hpp>
-
-
-template<typename T, typename ManagedMemory> 
-  managed_shared_ptr< T, ManagedMemory >::type 
-  make_managed_shared_ptr(T * constructed_object, 
-                          ManagedMemory & managed_memory);
    -
    -

    Description

    -

    Returns an instance of a shared pointer constructed with the default allocator and deleter from a pointer of type T that has been allocated in the passed managed segment

    -
    -
    - - - -
    Copyright © 2005-2015 Ion Gaztanaga

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/interprocess/make_managed_s_idp56410192.html b/doc/html/boost/interprocess/make_managed_s_idp56410192.html deleted file mode 100644 index 8a21eff230..0000000000 --- a/doc/html/boost/interprocess/make_managed_s_idp56410192.html +++ /dev/null @@ -1,59 +0,0 @@ - - - - -Function template make_managed_shared_ptr - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Function template make_managed_shared_ptr

    -

    boost::interprocess::make_managed_shared_ptr

    -
    -

    Synopsis

    -
    // In header: <boost/interprocess/smart_ptr/shared_ptr.hpp>
-
-
-template<typename T, typename ManagedMemory> 
-  managed_shared_ptr< T, ManagedMemory >::type 
-  make_managed_shared_ptr(T * constructed_object, 
-                          ManagedMemory & managed_memory, 
-                          const std::nothrow_t &);
    -
    -

    Description

    -

    Returns an instance of a shared pointer constructed with the default allocator and deleter from a pointer of type T that has been allocated in the passed managed segment. Does not throw, return null shared pointer in error.

    -
    -
    - - - -
    Copyright © 2005-2015 Ion Gaztanaga

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/interprocess/managed_external_buffer.html b/doc/html/boost/interprocess/managed_external_buffer.html index 0adc279831..08f1ff8ce5 100644 --- a/doc/html/boost/interprocess/managed_external_buffer.html +++ b/doc/html/boost/interprocess/managed_external_buffer.html @@ -7,7 +7,7 @@ - + @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -33,10 +33,10 @@ 
    // In header: <boost/interprocess/managed_external_buffer.hpp>
 
 
-typedef basic_managed_external_buffer< char,rbtree_best_fit< null_mutex_family >,iset_index > managed_external_buffer;
    +typedef basic_managed_external_buffer< char,rbtree_best_fit< null_mutex_family >,iset_index > managed_external_buffer;

    Description

    -

    Typedef for a default basic_managed_external_buffer of narrow characters

    +

    Typedef for a default basic_managed_external_buffer of narrow characters

    @@ -49,7 +49,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/interprocess/managed_shared_memory.html b/doc/html/boost/interprocess/managed_shared_memory.html index dba8c18a93..b0c26e70ff 100644 --- a/doc/html/boost/interprocess/managed_shared_memory.html +++ b/doc/html/boost/interprocess/managed_shared_memory.html @@ -7,7 +7,7 @@ - + @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -33,10 +33,10 @@ 
    // In header: <boost/interprocess/managed_shared_memory.hpp>
 
 
-typedef basic_managed_shared_memory< char,rbtree_best_fit< mutex_family >,iset_index > managed_shared_memory;
    +typedef basic_managed_shared_memory< char,rbtree_best_fit< mutex_family >,iset_index > managed_shared_memory;

    Description

    -

    Typedef for a default basic_managed_shared_memory of narrow characters

    +

    Typedef for a default basic_managed_shared_memory of narrow characters

    @@ -49,7 +49,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/interprocess/managed_shared_ptr.html b/doc/html/boost/interprocess/managed_shared_ptr.html index 4c37cc3655..d7d625d7d6 100644 --- a/doc/html/boost/interprocess/managed_shared_ptr.html +++ b/doc/html/boost/interprocess/managed_shared_ptr.html @@ -8,7 +8,7 @@ - + @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -54,7 +54,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/interprocess/managed_unique_ptr.html b/doc/html/boost/interprocess/managed_unique_ptr.html index 6832b0708c..c38b1e0cf3 100644 --- a/doc/html/boost/interprocess/managed_unique_ptr.html +++ b/doc/html/boost/interprocess/managed_unique_ptr.html @@ -7,7 +7,7 @@ - + @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -52,7 +52,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/interprocess/managed_window_idp39679728.html b/doc/html/boost/interprocess/managed_window_idp39679728.html new file mode 100644 index 0000000000..a1fcb609ba --- /dev/null +++ b/doc/html/boost/interprocess/managed_window_idp39679728.html @@ -0,0 +1,55 @@ + + + + +Type definition managed_windows_shared_memory + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Type definition managed_windows_shared_memory

    +

    managed_windows_shared_memory

    +
    +

    Synopsis

    +
    // In header: <boost/interprocess/managed_windows_shared_memory.hpp>
+
+
+typedef basic_managed_windows_shared_memory< char,rbtree_best_fit< mutex_family >,iset_index > managed_windows_shared_memory;
    +
    +

    Description

    +

    Typedef for a default basic_managed_windows_shared_memory of narrow characters

    +
    +
    + + + +
    Copyright © 2005-2015 Ion Gaztanaga

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/interprocess/managed_window_idp55585168.html b/doc/html/boost/interprocess/managed_window_idp55585168.html deleted file mode 100644 index aa21f81a7e..0000000000 --- a/doc/html/boost/interprocess/managed_window_idp55585168.html +++ /dev/null @@ -1,55 +0,0 @@ - - - - -Type definition managed_windows_shared_memory - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Type definition managed_windows_shared_memory

    -

    managed_windows_shared_memory

    -
    -

    Synopsis

    -
    // In header: <boost/interprocess/managed_windows_shared_memory.hpp>
-
-
-typedef basic_managed_windows_shared_memory< char,rbtree_best_fit< mutex_family >,iset_index > managed_windows_shared_memory;
    -
    -

    Description

    -

    Typedef for a default basic_managed_windows_shared_memory of narrow characters

    -
    -
    - - - -
    Copyright © 2005-2015 Ion Gaztanaga

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/interprocess/managed_xsi_shared_memory.html b/doc/html/boost/interprocess/managed_xsi_shared_memory.html index 857a27273f..ff9bb640fb 100644 --- a/doc/html/boost/interprocess/managed_xsi_shared_memory.html +++ b/doc/html/boost/interprocess/managed_xsi_shared_memory.html @@ -7,7 +7,7 @@ - + @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -33,10 +33,10 @@ 
    // In header: <boost/interprocess/managed_xsi_shared_memory.hpp>
 
 
-typedef basic_managed_xsi_shared_memory< char,rbtree_best_fit< mutex_family >,iset_index > managed_xsi_shared_memory;
    +typedef basic_managed_xsi_shared_memory< char,rbtree_best_fit< mutex_family >,iset_index > managed_xsi_shared_memory;

    Description

    -

    Typedef for a default basic_managed_xsi_shared_memory of narrow characters

    +

    Typedef for a default basic_managed_xsi_shared_memory of narrow characters

    @@ -49,7 +49,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/interprocess/map_index.html b/doc/html/boost/interprocess/map_index.html index ce5cdc3e34..e8bd4f56db 100644 --- a/doc/html/boost/interprocess/map_index.html +++ b/doc/html/boost/interprocess/map_index.html @@ -36,11 +36,11 @@ class map_index : public boost::container::map< MapConfig > { public: // construct/copy/destruct - map_index(segment_manager_base *); + map_index(segment_manager_base *); - // public member functions - void reserve(typename segment_manager_base::size_type); - void shrink_to_fit(); + // public member functions + void reserve(typename segment_manager_base::size_type); + void shrink_to_fit(); };

    Description

    @@ -51,20 +51,20 @@ public construct/copy/destruct
    1. -
      map_index(segment_manager_base * segment_mngr);
      +
      map_index(segment_manager_base * segment_mngr);

      Constructor. Takes a pointer to the segment manager. Can throw

    -map_index public member functions

    +map_index public member functions
    1. -
      void reserve(typename segment_manager_base::size_type);
      +
      void reserve(typename segment_manager_base::size_type);

      This reserves memory to optimize the insertion of n elements in the index

    2. -
      void shrink_to_fit();
      +
      void shrink_to_fit();

      This tries to free previously allocate unused memory.

    diff --git a/doc/html/boost/interprocess/mapped_region.html b/doc/html/boost/interprocess/mapped_region.html index e395bc2a59..5d8e4a70fd 100644 --- a/doc/html/boost/interprocess/mapped_region.html +++ b/doc/html/boost/interprocess/mapped_region.html @@ -38,25 +38,25 @@ enum advice_types; // construct/copy/destruct template<typename MemoryMappable> - mapped_region(const MemoryMappable &, mode_t, offset_t = 0, + mapped_region(const MemoryMappable &, mode_t, offset_t = 0, std::size_t = 0, const void * = 0, map_options_t = default_map_options); - mapped_region(); - mapped_region(mapped_region &&); - mapped_region & operator=(mapped_region &&); - ~mapped_region(); + mapped_region(); + mapped_region(mapped_region &&); + mapped_region & operator=(mapped_region &&); + ~mapped_region(); - // public member functions - void swap(mapped_region &); - std::size_t get_size() const; - void * get_address() const; - mode_t get_mode() const; - bool flush(std::size_t = 0, std::size_t = 0, bool = true); - bool shrink_by(std::size_t, bool = true); - bool advise(advice_types); + // public member functions + void swap(mapped_region &); + std::size_t get_size() const; + void * get_address() const; + mode_t get_mode() const; + bool flush(std::size_t = 0, std::size_t = 0, bool = true); + bool shrink_by(std::size_t, bool = true); + bool advise(advice_types); - // public static functions - static std::size_t get_page_size(); + // public static functions + static std::size_t get_page_size(); };

    Description

    @@ -70,7 +70,7 @@ 
    1. template<typename MemoryMappable> 
-  mapped_region(const MemoryMappable & mapping, mode_t mode, 
+  mapped_region(const MemoryMappable & mapping, mode_t mode, 
                 offset_t offset = 0, std::size_t size = 0, 
                 const void * address = 0, 
                 map_options_t map_options = default_map_options);
      @@ -83,61 +83,61 @@

      The OS could allocate more pages than size/page_size(), but get_address() will always return the address passed in this function (if not null) and get_size() will return the specified size.

    2. -
      mapped_region();
      +
      mapped_region();

      Default constructor. Address will be 0 (nullptr). Size will be 0. Does not throw

    3. -
      mapped_region(mapped_region && other);
      +
      mapped_region(mapped_region && other);

      Move constructor. *this will be constructed taking ownership of "other"'s region and "other" will be left in default constructor state.

    4. -
      mapped_region & operator=(mapped_region && other);
      +
      mapped_region & operator=(mapped_region && other);

      Move assignment. If *this owns a memory mapped region, it will be destroyed and it will take ownership of "other"'s memory mapped region.

    5. -
      ~mapped_region();
      +
      ~mapped_region();

      Destroys the mapped region. Does not throw

    -mapped_region public member functions

    +mapped_region public member functions
    1. -
      void swap(mapped_region & other);
      +
      void swap(mapped_region & other);

      Swaps the mapped_region with another mapped region

    2. -
      std::size_t get_size() const;
      Returns the size of the mapping. Never throws.
      3. +
      std::size_t get_size() const;
      Returns the size of the mapping. Never throws.
    3. -
      void * get_address() const;
      +
      void * get_address() const;

      Returns the base address of the mapping. Never throws.

    4. -
      mode_t get_mode() const;
      +
      mode_t get_mode() const;

      Returns the mode of the mapping used to construct the mapped region. Never throws.

    5. -
      bool flush(std::size_t mapping_offset = 0, std::size_t numbytes = 0, 
+
      bool flush(std::size_t mapping_offset = 0, std::size_t numbytes = 0, 
            bool async = true);
      
 
      Flushes to the disk a byte range within the mapped memory. If 'async' is true, the function will return before flushing operation is completed If 'async' is false, function will return once data has been written into the underlying device (i.e., in mapped files OS cached information is written to disk). Never throws. Returns false if operation could not be performed.
    6. -
      bool shrink_by(std::size_t bytes, bool from_back = true);
      +
      bool shrink_by(std::size_t bytes, bool from_back = true);

      Shrinks current mapped region. If after shrinking there is no longer need for a previously mapped memory page, accessing that page can trigger a segmentation fault. Depending on the OS, this operation might fail (XSI shared memory), it can decommit storage and free a portion of the virtual address space (e.g.POSIX) or this function can release some physical memory wihout freeing any virtual address space(Windows). Returns true on success. Never throws.

    7. -
      bool advise(advice_types advise);
      +
      bool advise(advice_types advise);

      Advises the implementation on the expected behavior of the application with respect to the data in the region. The implementation may use this information to optimize handling of the region data. This function has no effect on the semantics of access to memory in the region, although it may affect the performance of access. If the advise type is not known to the implementation, the function returns false. True otherwise.

    -mapped_region public static functions

    +mapped_region public static functions
    1. -
      static std::size_t get_page_size();
      +
      static std::size_t get_page_size();

      Returns the size of the page. This size is the minimum memory that will be used by the system when mapping a memory mappable source and will restrict the address and the offset to map.

    diff --git a/doc/html/boost/interprocess/message_queue.html b/doc/html/boost/interprocess/message_queue.html index c375a816fd..b1e73997b6 100644 --- a/doc/html/boost/interprocess/message_queue.html +++ b/doc/html/boost/interprocess/message_queue.html @@ -8,7 +8,7 @@ - + @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -49,7 +49,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/interprocess/message_queue_t.html b/doc/html/boost/interprocess/message_queue_t.html index 8b4260c83c..ff2b810ec7 100644 --- a/doc/html/boost/interprocess/message_queue_t.html +++ b/doc/html/boost/interprocess/message_queue_t.html @@ -39,31 +39,31 @@ typedef VoidPointer void_pointer; typedef boost::intrusive::pointer_traits< void_pointer >::template rebind_pointer< char >::type char_ptr; typedef boost::intrusive::pointer_traits< char_ptr >::difference_type difference_type; - typedef unspecified size_type; + typedef boost::container::dtl::make_unsigned< difference_type >::type size_type; // construct/copy/destruct - message_queue_t(create_only_t, const char *, size_type, size_type, + message_queue_t(create_only_t, const char *, size_type, size_type, const permissions & = permissions()); - message_queue_t(open_or_create_t, const char *, size_type, size_type, + message_queue_t(open_or_create_t, const char *, size_type, size_type, const permissions & = permissions()); - message_queue_t(open_only_t, const char *); - ~message_queue_t(); + message_queue_t(open_only_t, const char *); + ~message_queue_t(); - // public member functions - void send(const void *, size_type, unsigned int); - bool try_send(const void *, size_type, unsigned int); - bool timed_send(const void *, size_type, unsigned int, + // public member functions + void send(const void *, size_type, unsigned int); + bool try_send(const void *, size_type, unsigned int); + bool timed_send(const void *, size_type, unsigned int, const boost::posix_time::ptime &); - void receive(void *, size_type, size_type &, unsigned int &); - bool try_receive(void *, size_type, size_type &, unsigned int &); - bool timed_receive(void *, size_type, size_type &, unsigned int &, + void receive(void *, size_type, size_type &, unsigned int &); + bool try_receive(void *, size_type, size_type &, unsigned int &); + bool timed_receive(void *, size_type, size_type &, unsigned int &, const boost::posix_time::ptime &); - size_type get_max_msg() const; - size_type get_max_msg_size() const; - size_type get_num_msg() const; + size_type get_max_msg() const; + size_type get_max_msg_size() const; + size_type get_num_msg() const; - // public static functions - static bool remove(const char *); + // public static functions + static bool remove(const char *); };

    Description

    @@ -75,81 +75,81 @@ construct/copy/destruct
    1. -
      message_queue_t(create_only_t create_only, const char * name, 
+
      message_queue_t(create_only_t create_only, const char * name, 
                 size_type max_num_msg, size_type max_msg_size, 
                 const permissions & perm = permissions());
      
 
      Creates a process shared message queue with name "name". For this message queue, the maximum number of messages will be "max_num_msg" and the maximum message size will be "max_msg_size". Throws on error and if the queue was previously created.
    2. -
      message_queue_t(open_or_create_t open_or_create, const char * name, 
+
      message_queue_t(open_or_create_t open_or_create, const char * name, 
                 size_type max_num_msg, size_type max_msg_size, 
                 const permissions & perm = permissions());
      
 
      Opens or creates a process shared message queue with name "name". If the queue is created, the maximum number of messages will be "max_num_msg" and the maximum message size will be "max_msg_size". If queue was previously created the queue will be opened and "max_num_msg" and "max_msg_size" parameters are ignored. Throws on error.
    3. -
      message_queue_t(open_only_t open_only, const char * name);
      +
      message_queue_t(open_only_t open_only, const char * name);

      Opens a previously created process shared message queue with name "name". If the queue was not previously created or there are no free resources, throws an error.

    4. -
      ~message_queue_t();
      +
      ~message_queue_t();

      Destroys *this and indicates that the calling process is finished using the resource. All opened message queues are still valid after destruction. The destructor function will deallocate any system resources allocated by the system for use by this process for this resource. The resource can still be opened again calling the open constructor overload. To erase the message queue from the system use remove().

    -message_queue_t public member functions

    +message_queue_t public member functions
    1. -
      void send(const void * buffer, size_type buffer_size, unsigned int priority);
      +
      void send(const void * buffer, size_type buffer_size, unsigned int priority);

      Sends a message stored in buffer "buffer" with size "buffer_size" in the message queue with priority "priority". If the message queue is full the sender is blocked. Throws interprocess_error on error.

    2. -
      bool try_send(const void * buffer, size_type buffer_size, 
+
      bool try_send(const void * buffer, size_type buffer_size, 
               unsigned int priority);
      
 
      Sends a message stored in buffer "buffer" with size "buffer_size" through the message queue with priority "priority". If the message queue is full the sender is not blocked and returns false, otherwise returns true. Throws interprocess_error on error.
    3. -
      bool timed_send(const void * buffer, size_type buffer_size, 
+
      bool timed_send(const void * buffer, size_type buffer_size, 
                 unsigned int priority, 
                 const boost::posix_time::ptime & abs_time);
      
 
      Sends a message stored in buffer "buffer" with size "buffer_size" in the message queue with priority "priority". If the message queue is full the sender retries until time "abs_time" is reached. Returns true if the message has been successfully sent. Returns false if timeout is reached. Throws interprocess_error on error.
    4. -
      void receive(void * buffer, size_type buffer_size, size_type & recvd_size, 
+
      void receive(void * buffer, size_type buffer_size, size_type & recvd_size, 
              unsigned int & priority);
      
 
      Receives a message from the message queue. The message is stored in buffer "buffer", which has size "buffer_size". The received message has size "recvd_size" and priority "priority". If the message queue is empty the receiver is blocked. Throws interprocess_error on error.
    5. -
      bool try_receive(void * buffer, size_type buffer_size, size_type & recvd_size, 
+
      bool try_receive(void * buffer, size_type buffer_size, size_type & recvd_size, 
                  unsigned int & priority);
      
 
      Receives a message from the message queue. The message is stored in buffer "buffer", which has size "buffer_size". The received message has size "recvd_size" and priority "priority". If the message queue is empty the receiver is not blocked and returns false, otherwise returns true. Throws interprocess_error on error.
    6. -
      bool timed_receive(void * buffer, size_type buffer_size, 
+
      bool timed_receive(void * buffer, size_type buffer_size, 
                    size_type & recvd_size, unsigned int & priority, 
                    const boost::posix_time::ptime & abs_time);
      
 
      Receives a message from the message queue. The message is stored in buffer "buffer", which has size "buffer_size". The received message has size "recvd_size" and priority "priority". If the message queue is empty the receiver retries until time "abs_time" is reached. Returns true if the message has been successfully sent. Returns false if timeout is reached. Throws interprocess_error on error.
    7. -
      size_type get_max_msg() const;
      +
      size_type get_max_msg() const;

      Returns the maximum number of messages allowed by the queue. The message queue must be opened or created previously. Otherwise, returns 0. Never throws

    8. -
      size_type get_max_msg_size() const;
      +
      size_type get_max_msg_size() const;

      Returns the maximum size of message allowed by the queue. The message queue must be opened or created previously. Otherwise, returns 0. Never throws

    9. -
      size_type get_num_msg() const;
      +
      size_type get_num_msg() const;

      Returns the number of messages currently stored. Never throws

    -message_queue_t public static functions

    +message_queue_t public static functions
    1. -
      static bool remove(const char * name);
      +
      static bool remove(const char * name);

      Removes the message queue from the system. Returns false on error. Never throws

    diff --git a/doc/html/boost/interprocess/mutex_family.html b/doc/html/boost/interprocess/mutex_family.html index 87cd983476..3776efaaa8 100644 --- a/doc/html/boost/interprocess/mutex_family.html +++ b/doc/html/boost/interprocess/mutex_family.html @@ -36,7 +36,7 @@ struct mutex_family { // types typedef boost::interprocess::interprocess_mutex mutex_type; - typedef boost::interprocess::interprocess_recursive_mutex recursive_mutex_type; + typedef boost::interprocess::interprocess_recursive_mutex recursive_mutex_type; };

    Description

    diff --git a/doc/html/boost/interprocess/named_condition.html b/doc/html/boost/interprocess/named_condition.html index 2025e016da..5c6acfa13c 100644 --- a/doc/html/boost/interprocess/named_condition.html +++ b/doc/html/boost/interprocess/named_condition.html @@ -36,24 +36,24 @@ class named_condition { public: // construct/copy/destruct - named_condition(create_only_t, const char *, + named_condition(create_only_t, const char *, const permissions & = permissions()); - named_condition(open_or_create_t, const char *, + named_condition(open_or_create_t, const char *, const permissions & = permissions()); - named_condition(open_only_t, const char *); - ~named_condition(); + named_condition(open_only_t, const char *); + ~named_condition(); - // public member functions - *void notify_one(); - void notify_all(); - template<typename L> void wait(L &); - template<typename L, typename Pr> void wait(L &, Pr); - template<typename L> bool timed_wait(L &, const boost::posix_time::ptime &); + // public member functions + *void notify_one(); + void notify_all(); + template<typename L> void wait(L &); + template<typename L, typename Pr> void wait(L &, Pr); + template<typename L> bool timed_wait(L &, const boost::posix_time::ptime &); template<typename L, typename Pr> - bool timed_wait(L &, const boost::posix_time::ptime &, Pr); + bool timed_wait(L &, const boost::posix_time::ptime &, Pr); - // public static functions - static bool remove(const char *); + // public static functions + static bool remove(const char *); };

    Description

    @@ -65,53 +65,53 @@ construct/copy/destruct
    1. -
      named_condition(create_only_t create_only, const char * name, 
+
      named_condition(create_only_t create_only, const char * name, 
                 const permissions & perm = permissions());
      
 
      Creates a global condition with a name. If the condition can't be created throws interprocess_exception
    2. -
      named_condition(open_or_create_t open_or_create, const char * name, 
+
      named_condition(open_or_create_t open_or_create, const char * name, 
                 const permissions & perm = permissions());
      
 
      Opens or creates a global condition with a name. If the condition is created, this call is equivalent to named_condition(create_only_t, ... ) If the condition is already created, this call is equivalent named_condition(open_only_t, ... ) Does not throw
    3. -
      named_condition(open_only_t open_only, const char * name);
      +
      named_condition(open_only_t open_only, const char * name);

      Opens a global condition with a name if that condition is previously created. If it is not previously created this function throws interprocess_exception.

    4. -
      ~named_condition();
      +
      ~named_condition();

      Destroys *this and indicates that the calling process is finished using the resource. The destructor function will deallocate any system resources allocated by the system for use by this process for this resource. The resource can still be opened again calling the open constructor overload. To erase the resource from the system use remove().

    -named_condition public member functions

    +named_condition public member functions
    1. -
      *void notify_one();
      +
      *void notify_one();

      If there is a thread waiting on *this, change that thread's state to ready. Otherwise there is no effect.

    2. -
      void notify_all();
      +
      void notify_all();

      Change the state of all threads waiting on *this to ready. If there are no waiting threads, notify_all() has no effect.

    3. -
      template<typename L> void wait(L & lock);
      +
      template<typename L> void wait(L & lock);

      Releases the lock on the named_mutex object associated with lock, blocks the current thread of execution until readied by a call to this->notify_one() or this->notify_all(), and then reacquires the lock.

    4. -
      template<typename L, typename Pr> void wait(L & lock, Pr pred);
      +
      template<typename L, typename Pr> void wait(L & lock, Pr pred);

      The same as: while (!pred()) wait(lock) 

    5. template<typename L> 
-  bool timed_wait(L & lock, const boost::posix_time::ptime & abs_time);
      + bool timed_wait(L & lock, const boost::posix_time::ptime & abs_time);

      Releases the lock on the named_mutex object associated with lock, blocks the current thread of execution until readied by a call to this->notify_one() or this->notify_all(), or until time abs_time is reached, and then reacquires the lock. Returns: false if time abs_time is reached, otherwise true. 

    6. template<typename L, typename Pr> 
-  bool timed_wait(L & lock, const boost::posix_time::ptime & abs_time, 
+  bool timed_wait(L & lock, const boost::posix_time::ptime & abs_time, 
                   Pr pred);

      The same as: while (!pred()) { if (!timed_wait(lock, abs_time)) return pred(); } return true;

      7. @@ -119,9 +119,9 @@

    -named_condition public static functions

    +named_condition public static functions
    1. -
      static bool remove(const char * name);
      +
      static bool remove(const char * name);

      Erases a named condition from the system. Returns false on error. Never throws.

    diff --git a/doc/html/boost/interprocess/named_condition_any.html b/doc/html/boost/interprocess/named_condition_any.html index 131ca02df7..bdae41490d 100644 --- a/doc/html/boost/interprocess/named_condition_any.html +++ b/doc/html/boost/interprocess/named_condition_any.html @@ -36,24 +36,24 @@ class named_condition_any { public: // construct/copy/destruct - named_condition_any(create_only_t, const char *, + named_condition_any(create_only_t, const char *, const permissions & = permissions()); - named_condition_any(open_or_create_t, const char *, + named_condition_any(open_or_create_t, const char *, const permissions & = permissions()); - named_condition_any(open_only_t, const char *); - ~named_condition_any(); + named_condition_any(open_only_t, const char *); + ~named_condition_any(); - // public member functions - *void notify_one(); - void notify_all(); - template<typename L> void wait(L &); - template<typename L, typename Pr> void wait(L &, Pr); - template<typename L> bool timed_wait(L &, const boost::posix_time::ptime &); + // public member functions + *void notify_one(); + void notify_all(); + template<typename L> void wait(L &); + template<typename L, typename Pr> void wait(L &, Pr); + template<typename L> bool timed_wait(L &, const boost::posix_time::ptime &); template<typename L, typename Pr> - bool timed_wait(L &, const boost::posix_time::ptime &, Pr); + bool timed_wait(L &, const boost::posix_time::ptime &, Pr); - // public static functions - static bool remove(const char *); + // public static functions + static bool remove(const char *); };

    Description

    @@ -65,53 +65,53 @@ construct/copy/destruct
    1. -
      named_condition_any(create_only_t, const char * name, 
+
      named_condition_any(create_only_t, const char * name, 
                     const permissions & perm = permissions());
      
 
      Creates a global condition with a name. If the condition can't be created throws interprocess_exception
    2. -
      named_condition_any(open_or_create_t, const char * name, 
+
      named_condition_any(open_or_create_t, const char * name, 
                     const permissions & perm = permissions());
      
 
      Opens or creates a global condition with a name. If the condition is created, this call is equivalent to named_condition_any(create_only_t, ... ) If the condition is already created, this call is equivalent named_condition_any(open_only_t, ... ) Does not throw
    3. -
      named_condition_any(open_only_t, const char * name);
      +
      named_condition_any(open_only_t, const char * name);

      Opens a global condition with a name if that condition is previously created. If it is not previously created this function throws interprocess_exception.

    4. -
      ~named_condition_any();
      +
      ~named_condition_any();

      Destroys *this and indicates that the calling process is finished using the resource. The destructor function will deallocate any system resources allocated by the system for use by this process for this resource. The resource can still be opened again calling the open constructor overload. To erase the resource from the system use remove().

    -named_condition_any public member functions

    +named_condition_any public member functions
    1. -
      *void notify_one();
      +
      *void notify_one();

      If there is a thread waiting on *this, change that thread's state to ready. Otherwise there is no effect.

    2. -
      void notify_all();
      +
      void notify_all();

      Change the state of all threads waiting on *this to ready. If there are no waiting threads, notify_all() has no effect.

    3. -
      template<typename L> void wait(L & lock);
      +
      template<typename L> void wait(L & lock);

      Releases the lock on the named_mutex object associated with lock, blocks the current thread of execution until readied by a call to this->notify_one() or this->notify_all(), and then reacquires the lock.

    4. -
      template<typename L, typename Pr> void wait(L & lock, Pr pred);
      +
      template<typename L, typename Pr> void wait(L & lock, Pr pred);

      The same as: while (!pred()) wait(lock) 

    5. template<typename L> 
-  bool timed_wait(L & lock, const boost::posix_time::ptime & abs_time);
      + bool timed_wait(L & lock, const boost::posix_time::ptime & abs_time);

      Releases the lock on the named_mutex object associated with lock, blocks the current thread of execution until readied by a call to this->notify_one() or this->notify_all(), or until time abs_time is reached, and then reacquires the lock. Returns: false if time abs_time is reached, otherwise true. 

    6. template<typename L, typename Pr> 
-  bool timed_wait(L & lock, const boost::posix_time::ptime & abs_time, 
+  bool timed_wait(L & lock, const boost::posix_time::ptime & abs_time, 
                   Pr pred);

      The same as: while (!pred()) { if (!timed_wait(lock, abs_time)) return pred(); } return true;

      7. @@ -119,9 +119,9 @@

    -named_condition_any public static functions

    +named_condition_any public static functions
    1. -
      static bool remove(const char * name);
      +
      static bool remove(const char * name);

      Erases a named condition from the system. Returns false on error. Never throws.

    diff --git a/doc/html/boost/interprocess/named_mutex.html b/doc/html/boost/interprocess/named_mutex.html index e973e6e362..83371ffde7 100644 --- a/doc/html/boost/interprocess/named_mutex.html +++ b/doc/html/boost/interprocess/named_mutex.html @@ -36,21 +36,21 @@ class named_mutex { public: // construct/copy/destruct - named_mutex(create_only_t, const char *, + named_mutex(create_only_t, const char *, const permissions & = permissions()); - named_mutex(open_or_create_t, const char *, + named_mutex(open_or_create_t, const char *, const permissions & = permissions()); - named_mutex(open_only_t, const char *); - ~named_mutex(); + named_mutex(open_only_t, const char *); + ~named_mutex(); - // public member functions - void unlock(); - void lock(); - bool try_lock(); - bool timed_lock(const boost::posix_time::ptime &); + // public member functions + void unlock(); + void lock(); + bool try_lock(); + bool timed_lock(const boost::posix_time::ptime &); - // public static functions - static bool remove(const char *); + // public static functions + static bool remove(const char *); };

    Description

    @@ -62,52 +62,52 @@ construct/copy/destruct
    1. -
      named_mutex(create_only_t create_only, const char * name, 
+
      named_mutex(create_only_t create_only, const char * name, 
             const permissions & perm = permissions());
      
 
      Creates a global mutex with a name. Throws interprocess_exception on error.
    2. -
      named_mutex(open_or_create_t open_or_create, const char * name, 
+
      named_mutex(open_or_create_t open_or_create, const char * name, 
             const permissions & perm = permissions());
      
 
      Opens or creates a global mutex with a name. If the mutex is created, this call is equivalent to named_mutex(create_only_t, ... ) If the mutex is already created, this call is equivalent named_mutex(open_only_t, ... ) Does not throw
    3. -
      named_mutex(open_only_t open_only, const char * name);
      +
      named_mutex(open_only_t open_only, const char * name);

      Opens a global mutex with a name if that mutex is previously created. If it is not previously created this function throws interprocess_exception.

    4. -
      ~named_mutex();
      +
      ~named_mutex();

      Destroys *this and indicates that the calling process is finished using the resource. The destructor function will deallocate any system resources allocated by the system for use by this process for this resource. The resource can still be opened again calling the open constructor overload. To erase the resource from the system use remove().

    -named_mutex public member functions

    +named_mutex public member functions
    1. -
      void unlock();
      +
      void unlock();

      Unlocks a previously locked mutex.

    2. -
      void lock();
      +
      void lock();

      Locks the mutex, sleeps when the mutex is already locked. Throws interprocess_exception if a severe error is found

    3. -
      bool try_lock();
      +
      bool try_lock();

      Tries to lock the mutex, returns false when the mutex is already locked, returns true when success. Throws interprocess_exception if a severe error is found

    4. -
      bool timed_lock(const boost::posix_time::ptime & abs_time);
      +
      bool timed_lock(const boost::posix_time::ptime & abs_time);

      Tries to lock the the mutex until time abs_time, Returns false when timeout expires, returns true when locks. Throws interprocess_exception if a severe error is found

    -named_mutex public static functions

    +named_mutex public static functions
    1. -
      static bool remove(const char * name);
      +
      static bool remove(const char * name);

      Erases a named mutex from the system. Returns false on error. Never throws.

    diff --git a/doc/html/boost/interprocess/named_recursive_mutex.html b/doc/html/boost/interprocess/named_recursive_mutex.html index a5262355b3..6fef29363e 100644 --- a/doc/html/boost/interprocess/named_recursive_mutex.html +++ b/doc/html/boost/interprocess/named_recursive_mutex.html @@ -36,21 +36,21 @@ class named_recursive_mutex { public: // construct/copy/destruct - named_recursive_mutex(create_only_t, const char *, + named_recursive_mutex(create_only_t, const char *, const permissions & = permissions()); - named_recursive_mutex(open_or_create_t, const char *, + named_recursive_mutex(open_or_create_t, const char *, const permissions & = permissions()); - named_recursive_mutex(open_only_t, const char *); - ~named_recursive_mutex(); + named_recursive_mutex(open_only_t, const char *); + ~named_recursive_mutex(); - // public member functions - void unlock(); - void lock(); - bool try_lock(); - bool timed_lock(const boost::posix_time::ptime &); + // public member functions + void unlock(); + void lock(); + bool try_lock(); + bool timed_lock(const boost::posix_time::ptime &); - // public static functions - static bool remove(const char *); + // public static functions + static bool remove(const char *); };

    Description

    @@ -62,52 +62,52 @@ construct/copy/destruct
    1. -
      named_recursive_mutex(create_only_t create_only, const char * name, 
+
      named_recursive_mutex(create_only_t create_only, const char * name, 
                       const permissions & perm = permissions());
      
 
      Creates a global recursive_mutex with a name. If the recursive_mutex can't be created throws interprocess_exception
    2. -
      named_recursive_mutex(open_or_create_t open_or_create, const char * name, 
+
      named_recursive_mutex(open_or_create_t open_or_create, const char * name, 
                       const permissions & perm = permissions());
      
 
      Opens or creates a global recursive_mutex with a name. If the recursive_mutex is created, this call is equivalent to named_recursive_mutex(create_only_t, ... ) If the recursive_mutex is already created, this call is equivalent named_recursive_mutex(open_only_t, ... ) Does not throw
    3. -
      named_recursive_mutex(open_only_t open_only, const char * name);
      +
      named_recursive_mutex(open_only_t open_only, const char * name);

      Opens a global recursive_mutex with a name if that recursive_mutex is previously created. If it is not previously created this function throws interprocess_exception.

    4. -
      ~named_recursive_mutex();
      +
      ~named_recursive_mutex();

      Destroys *this and indicates that the calling process is finished using the resource. The destructor function will deallocate any system resources allocated by the system for use by this process for this resource. The resource can still be opened again calling the open constructor overload. To erase the resource from the system use remove().

    -named_recursive_mutex public member functions

    +named_recursive_mutex public member functions
    1. -
      void unlock();
      +
      void unlock();

      Unlocks a previously locked named_recursive_mutex.

    2. -
      void lock();
      +
      void lock();

      Locks named_recursive_mutex, sleeps when named_recursive_mutex is already locked. Throws interprocess_exception if a severe error is found.

    3. -
      bool try_lock();
      +
      bool try_lock();

      Tries to lock the named_recursive_mutex, returns false when named_recursive_mutex is already locked, returns true when success. Throws interprocess_exception if a severe error is found.

    4. -
      bool timed_lock(const boost::posix_time::ptime & abs_time);
      +
      bool timed_lock(const boost::posix_time::ptime & abs_time);

      Tries to lock the named_recursive_mutex until time abs_time, Returns false when timeout expires, returns true when locks. Throws interprocess_exception if a severe error is found

    -named_recursive_mutex public static functions

    +named_recursive_mutex public static functions
    1. -
      static bool remove(const char * name);
      +
      static bool remove(const char * name);

      Erases a named recursive mutex from the system

    diff --git a/doc/html/boost/interprocess/named_semaphore.html b/doc/html/boost/interprocess/named_semaphore.html index 8abfc5e6c3..f98c039256 100644 --- a/doc/html/boost/interprocess/named_semaphore.html +++ b/doc/html/boost/interprocess/named_semaphore.html @@ -36,21 +36,21 @@ class named_semaphore { public: // construct/copy/destruct - named_semaphore(create_only_t, const char *, unsigned int, + named_semaphore(create_only_t, const char *, unsigned int, const permissions & = permissions()); - named_semaphore(open_or_create_t, const char *, unsigned int, + named_semaphore(open_or_create_t, const char *, unsigned int, const permissions & = permissions()); - named_semaphore(open_only_t, const char *); - ~named_semaphore(); + named_semaphore(open_only_t, const char *); + ~named_semaphore(); - // public member functions - void post(); - void wait(); - bool try_wait(); - bool timed_wait(const boost::posix_time::ptime &); + // public member functions + void post(); + void wait(); + bool try_wait(); + bool timed_wait(const boost::posix_time::ptime &); - // public static functions - static bool remove(const char *); + // public static functions + static bool remove(const char *); };

    Description

    @@ -62,53 +62,53 @@ construct/copy/destruct
    1. -
      named_semaphore(create_only_t, const char * name, unsigned int initialCount, 
+
      named_semaphore(create_only_t, const char * name, unsigned int initialCount, 
                 const permissions & perm = permissions());
      
 
      Creates a global semaphore with a name, and an initial count. If the semaphore can't be created throws interprocess_exception
    2. -
      named_semaphore(open_or_create_t, const char * name, 
+
      named_semaphore(open_or_create_t, const char * name, 
                 unsigned int initialCount, 
                 const permissions & perm = permissions());
      
 
      Opens or creates a global semaphore with a name, and an initial count. If the semaphore is created, this call is equivalent to named_semaphore(create_only_t, ...) If the semaphore is already created, this call is equivalent to named_semaphore(open_only_t, ... ) and initialCount is ignored.
    3. -
      named_semaphore(open_only_t, const char * name);
      +
      named_semaphore(open_only_t, const char * name);

      Opens a global semaphore with a name if that semaphore is previously. created. If it is not previously created this function throws interprocess_exception.

    4. -
      ~named_semaphore();
      +
      ~named_semaphore();

      Destroys *this and indicates that the calling process is finished using the resource. The destructor function will deallocate any system resources allocated by the system for use by this process for this resource. The resource can still be opened again calling the open constructor overload. To erase the resource from the system use remove().

    -named_semaphore public member functions

    +named_semaphore public member functions
    1. -
      void post();
      +
      void post();

      Increments the semaphore count. If there are processes/threads blocked waiting for the semaphore, then one of these processes will return successfully from its wait function. If there is an error an interprocess_exception exception is thrown.

    2. -
      void wait();
      +
      void wait();

      Decrements the semaphore. If the semaphore value is not greater than zero, then the calling process/thread blocks until it can decrement the counter. If there is an error an interprocess_exception exception is thrown.

    3. -
      bool try_wait();
      +
      bool try_wait();

      Decrements the semaphore if the semaphore's value is greater than zero and returns true. If the value is not greater than zero returns false. If there is an error an interprocess_exception exception is thrown.

    4. -
      bool timed_wait(const boost::posix_time::ptime & abs_time);
      +
      bool timed_wait(const boost::posix_time::ptime & abs_time);

      Decrements the semaphore if the semaphore's value is greater than zero and returns true. Otherwise, waits for the semaphore to the posted or the timeout expires. If the timeout expires, the function returns false. If the semaphore is posted the function returns true. If there is an error throws sem_exception

    -named_semaphore public static functions

    +named_semaphore public static functions
    1. -
      static bool remove(const char * name);
      +
      static bool remove(const char * name);

      Erases a named semaphore from the system. Returns false on error. Never throws.

    diff --git a/doc/html/boost/interprocess/named_sharable_mutex.html b/doc/html/boost/interprocess/named_sharable_mutex.html index 3659830503..e07effe776 100644 --- a/doc/html/boost/interprocess/named_sharable_mutex.html +++ b/doc/html/boost/interprocess/named_sharable_mutex.html @@ -36,25 +36,25 @@ class named_sharable_mutex { public: // construct/copy/destruct - named_sharable_mutex(create_only_t, const char *, + named_sharable_mutex(create_only_t, const char *, const permissions & = permissions()); - named_sharable_mutex(open_or_create_t, const char *, + named_sharable_mutex(open_or_create_t, const char *, const permissions & = permissions()); - named_sharable_mutex(open_only_t, const char *); - ~named_sharable_mutex(); + named_sharable_mutex(open_only_t, const char *); + ~named_sharable_mutex(); - // public member functions - void lock(); - bool try_lock(); - bool timed_lock(const boost::posix_time::ptime &); - void unlock(); - void lock_sharable(); - bool try_lock_sharable(); - bool timed_lock_sharable(const boost::posix_time::ptime &); - void unlock_sharable(); + // public member functions + void lock(); + bool try_lock(); + bool timed_lock(const boost::posix_time::ptime &); + void unlock(); + void lock_sharable(); + bool try_lock_sharable(); + bool timed_lock_sharable(const boost::posix_time::ptime &); + void unlock_sharable(); - // public static functions - static bool remove(const char *); + // public static functions + static bool remove(const char *); };

    Description

    @@ -66,68 +66,68 @@ construct/copy/destruct
    1. -
      named_sharable_mutex(create_only_t create_only, const char * name, 
+
      named_sharable_mutex(create_only_t create_only, const char * name, 
                      const permissions & perm = permissions());
      
 
      Creates a global sharable mutex with a name. If the sharable mutex can't be created throws interprocess_exception
    2. -
      named_sharable_mutex(open_or_create_t open_or_create, const char * name, 
+
      named_sharable_mutex(open_or_create_t open_or_create, const char * name, 
                      const permissions & perm = permissions());
      
 
      Opens or creates a global sharable mutex with a name. If the sharable mutex is created, this call is equivalent to named_sharable_mutex(create_only_t, ...) If the sharable mutex is already created, this call is equivalent to named_sharable_mutex(open_only_t, ... ).
    3. -
      named_sharable_mutex(open_only_t open_only, const char * name);
      +
      named_sharable_mutex(open_only_t open_only, const char * name);

      Opens a global sharable mutex with a name if that sharable mutex is previously. created. If it is not previously created this function throws interprocess_exception.

    4. -
      ~named_sharable_mutex();
      +
      ~named_sharable_mutex();

      Destroys *this and indicates that the calling process is finished using the resource. The destructor function will deallocate any system resources allocated by the system for use by this process for this resource. The resource can still be opened again calling the open constructor overload. To erase the resource from the system use remove().

    -named_sharable_mutex public member functions

    +named_sharable_mutex public member functions
    1. -
      void lock();
      +
      void lock();

      Effects: The calling thread tries to obtain exclusive ownership of the mutex, and if another thread has exclusive or sharable ownership of the mutex, it waits until it can obtain the ownership. Throws: interprocess_exception on error.

    2. -
      bool try_lock();
      +
      bool try_lock();

      Effects: The calling thread tries to acquire exclusive ownership of the mutex without waiting. If no other thread has exclusive or sharable ownership of the mutex this succeeds. Returns: If it can acquire exclusive ownership immediately returns true. If it has to wait, returns false. Throws: interprocess_exception on error.

    3. -
      bool timed_lock(const boost::posix_time::ptime & abs_time);
      +
      bool timed_lock(const boost::posix_time::ptime & abs_time);

      Effects: The calling thread tries to acquire exclusive ownership of the mutex waiting if necessary until no other thread has exclusive, or sharable ownership of the mutex or abs_time is reached. Returns: If acquires exclusive ownership, returns true. Otherwise returns false. Throws: interprocess_exception on error.

    4. -
      void unlock();
      +
      void unlock();

      Precondition: The thread must have exclusive ownership of the mutex. Effects: The calling thread releases the exclusive ownership of the mutex. Throws: An exception derived from interprocess_exception on error.

    5. -
      void lock_sharable();
      +
      void lock_sharable();

      Effects: The calling thread tries to obtain sharable ownership of the mutex, and if another thread has exclusive ownership of the mutex, waits until it can obtain the ownership. Throws: interprocess_exception on error.

    6. -
      bool try_lock_sharable();
      +
      bool try_lock_sharable();

      Effects: The calling thread tries to acquire sharable ownership of the mutex without waiting. If no other thread has exclusive ownership of the mutex this succeeds. Returns: If it can acquire sharable ownership immediately returns true. If it has to wait, returns false. Throws: interprocess_exception on error.

    7. -
      bool timed_lock_sharable(const boost::posix_time::ptime & abs_time);
      +
      bool timed_lock_sharable(const boost::posix_time::ptime & abs_time);

      Effects: The calling thread tries to acquire sharable ownership of the mutex waiting if necessary until no other thread has exclusive ownership of the mutex or abs_time is reached. Returns: If acquires sharable ownership, returns true. Otherwise returns false. Throws: interprocess_exception on error.

    8. -
      void unlock_sharable();
      +
      void unlock_sharable();

      Precondition: The thread must have sharable ownership of the mutex. Effects: The calling thread releases the sharable ownership of the mutex. Throws: An exception derived from interprocess_exception on error.

    -named_sharable_mutex public static functions

    +named_sharable_mutex public static functions
    1. -
      static bool remove(const char * name);
      +
      static bool remove(const char * name);

      Erases a named sharable mutex from the system. Returns false on error. Never throws.

    diff --git a/doc/html/boost/interprocess/named_upgradable_mutex.html b/doc/html/boost/interprocess/named_upgradable_mutex.html index 2f85e07b32..72dd04cbe6 100644 --- a/doc/html/boost/interprocess/named_upgradable_mutex.html +++ b/doc/html/boost/interprocess/named_upgradable_mutex.html @@ -36,37 +36,37 @@ class named_upgradable_mutex { public: // construct/copy/destruct - named_upgradable_mutex(create_only_t, const char *, + named_upgradable_mutex(create_only_t, const char *, const permissions & = permissions()); - named_upgradable_mutex(open_or_create_t, const char *, + named_upgradable_mutex(open_or_create_t, const char *, const permissions & = permissions()); - named_upgradable_mutex(open_only_t, const char *); - ~named_upgradable_mutex(); + named_upgradable_mutex(open_only_t, const char *); + ~named_upgradable_mutex(); - // public member functions - void lock(); - bool try_lock(); - bool timed_lock(const boost::posix_time::ptime &); - void unlock(); - void lock_sharable(); - bool try_lock_sharable(); - bool timed_lock_sharable(const boost::posix_time::ptime &); - void unlock_sharable(); - void lock_upgradable(); - bool try_lock_upgradable(); - bool timed_lock_upgradable(const boost::posix_time::ptime &); - void unlock_upgradable(); - void unlock_and_lock_upgradable(); - void unlock_and_lock_sharable(); - void unlock_upgradable_and_lock_sharable(); - void unlock_upgradable_and_lock(); - bool try_unlock_upgradable_and_lock(); - bool timed_unlock_upgradable_and_lock(const boost::posix_time::ptime &); - bool try_unlock_sharable_and_lock(); - bool try_unlock_sharable_and_lock_upgradable(); + // public member functions + void lock(); + bool try_lock(); + bool timed_lock(const boost::posix_time::ptime &); + void unlock(); + void lock_sharable(); + bool try_lock_sharable(); + bool timed_lock_sharable(const boost::posix_time::ptime &); + void unlock_sharable(); + void lock_upgradable(); + bool try_lock_upgradable(); + bool timed_lock_upgradable(const boost::posix_time::ptime &); + void unlock_upgradable(); + void unlock_and_lock_upgradable(); + void unlock_and_lock_sharable(); + void unlock_upgradable_and_lock_sharable(); + void unlock_upgradable_and_lock(); + bool try_unlock_upgradable_and_lock(); + bool timed_unlock_upgradable_and_lock(const boost::posix_time::ptime &); + bool try_unlock_sharable_and_lock(); + bool try_unlock_sharable_and_lock_upgradable(); - // public static functions - static bool remove(const char *); + // public static functions + static bool remove(const char *); };

    Description

    @@ -78,116 +78,116 @@ construct/copy/destruct
    1. -
      named_upgradable_mutex(create_only_t create_only, const char * name, 
+
      named_upgradable_mutex(create_only_t create_only, const char * name, 
                        const permissions & perm = permissions());
      
 
      Creates a global upgradable mutex with a name. If the upgradable mutex can't be created throws interprocess_exception
    2. -
      named_upgradable_mutex(open_or_create_t open_or_create, const char * name, 
+
      named_upgradable_mutex(open_or_create_t open_or_create, const char * name, 
                        const permissions & perm = permissions());
      
 
      Opens or creates a global upgradable mutex with a name. If the upgradable mutex is created, this call is equivalent to named_upgradable_mutex(create_only_t, ...) If the upgradable mutex is already created, this call is equivalent to named_upgradable_mutex(open_only_t, ... ).
    3. -
      named_upgradable_mutex(open_only_t open_only, const char * name);
      +
      named_upgradable_mutex(open_only_t open_only, const char * name);

      Opens a global upgradable mutex with a name if that upgradable mutex is previously. created. If it is not previously created this function throws interprocess_exception.

    4. -
      ~named_upgradable_mutex();
      +
      ~named_upgradable_mutex();

      Destroys *this and indicates that the calling process is finished using the resource. The destructor function will deallocate any system resources allocated by the system for use by this process for this resource. The resource can still be opened again calling the open constructor overload. To erase the resource from the system use remove().

    -named_upgradable_mutex public member functions

    +named_upgradable_mutex public member functions
    1. -
      void lock();
      +
      void lock();

      Effects: The calling thread tries to obtain exclusive ownership of the mutex, and if another thread has exclusive, sharable or upgradable ownership of the mutex, it waits until it can obtain the ownership. Throws: interprocess_exception on error.

    2. -
      bool try_lock();
      +
      bool try_lock();

      Effects: The calling thread tries to acquire exclusive ownership of the mutex without waiting. If no other thread has exclusive, sharable or upgradable ownership of the mutex this succeeds. Returns: If it can acquire exclusive ownership immediately returns true. If it has to wait, returns false. Throws: interprocess_exception on error.

    3. -
      bool timed_lock(const boost::posix_time::ptime & abs_time);
      +
      bool timed_lock(const boost::posix_time::ptime & abs_time);

      Effects: The calling thread tries to acquire exclusive ownership of the mutex waiting if necessary until no other thread has exclusive, sharable or upgradable ownership of the mutex or abs_time is reached. Returns: If acquires exclusive ownership, returns true. Otherwise returns false. Throws: interprocess_exception on error.

    4. -
      void unlock();
      +
      void unlock();

      Precondition: The thread must have exclusive ownership of the mutex. Effects: The calling thread releases the exclusive ownership of the mutex. Throws: An exception derived from interprocess_exception on error.

    5. -
      void lock_sharable();
      +
      void lock_sharable();

      Effects: The calling thread tries to obtain sharable ownership of the mutex, and if another thread has exclusive ownership of the mutex, waits until it can obtain the ownership. Throws: interprocess_exception on error.

    6. -
      bool try_lock_sharable();
      +
      bool try_lock_sharable();

      Effects: The calling thread tries to acquire sharable ownership of the mutex without waiting. If no other thread has exclusive ownership of the mutex this succeeds. Returns: If it can acquire sharable ownership immediately returns true. If it has to wait, returns false. Throws: interprocess_exception on error.

    7. -
      bool timed_lock_sharable(const boost::posix_time::ptime & abs_time);
      +
      bool timed_lock_sharable(const boost::posix_time::ptime & abs_time);

      Effects: The calling thread tries to acquire sharable ownership of the mutex waiting if necessary until no other thread has exclusive ownership of the mutex or abs_time is reached. Returns: If acquires sharable ownership, returns true. Otherwise returns false. Throws: interprocess_exception on error.

    8. -
      void unlock_sharable();
      +
      void unlock_sharable();

      Precondition: The thread must have sharable ownership of the mutex. Effects: The calling thread releases the sharable ownership of the mutex. Throws: An exception derived from interprocess_exception on error.

    9. -
      void lock_upgradable();
      +
      void lock_upgradable();

      Effects: The calling thread tries to obtain upgradable ownership of the mutex, and if another thread has exclusive or upgradable ownership of the mutex, waits until it can obtain the ownership. Throws: interprocess_exception on error.

    10. -
      bool try_lock_upgradable();
      +
      bool try_lock_upgradable();

      Effects: The calling thread tries to acquire upgradable ownership of the mutex without waiting. If no other thread has exclusive or upgradable ownership of the mutex this succeeds. Returns: If it can acquire upgradable ownership immediately returns true. If it has to wait, returns false. Throws: interprocess_exception on error.

    11. -
      bool timed_lock_upgradable(const boost::posix_time::ptime & abs_time);
      +
      bool timed_lock_upgradable(const boost::posix_time::ptime & abs_time);

      Effects: The calling thread tries to acquire upgradable ownership of the mutex waiting if necessary until no other thread has exclusive or upgradable ownership of the mutex or abs_time is reached. Returns: If acquires upgradable ownership, returns true. Otherwise returns false. Throws: interprocess_exception on error.

    12. -
      void unlock_upgradable();
      +
      void unlock_upgradable();

      Precondition: The thread must have upgradable ownership of the mutex. Effects: The calling thread releases the upgradable ownership of the mutex. Throws: An exception derived from interprocess_exception on error.

    13. -
      void unlock_and_lock_upgradable();
      +
      void unlock_and_lock_upgradable();

      Precondition: The thread must have exclusive ownership of the mutex. Effects: The thread atomically releases exclusive ownership and acquires upgradable ownership. This operation is non-blocking. Throws: An exception derived from interprocess_exception on error.

    14. -
      void unlock_and_lock_sharable();
      +
      void unlock_and_lock_sharable();

      Precondition: The thread must have exclusive ownership of the mutex. Effects: The thread atomically releases exclusive ownership and acquires sharable ownership. This operation is non-blocking. Throws: An exception derived from interprocess_exception on error.

    15. -
      void unlock_upgradable_and_lock_sharable();
      +
      void unlock_upgradable_and_lock_sharable();

      Precondition: The thread must have upgradable ownership of the mutex. Effects: The thread atomically releases upgradable ownership and acquires sharable ownership. This operation is non-blocking. Throws: An exception derived from interprocess_exception on error.

    16. -
      void unlock_upgradable_and_lock();
      +
      void unlock_upgradable_and_lock();

      Precondition: The thread must have upgradable ownership of the mutex. Effects: The thread atomically releases upgradable ownership and acquires exclusive ownership. This operation will block until all threads with sharable ownership release it. Throws: An exception derived from interprocess_exception on error.

    17. -
      bool try_unlock_upgradable_and_lock();
      +
      bool try_unlock_upgradable_and_lock();

      Precondition: The thread must have upgradable ownership of the mutex. Effects: The thread atomically releases upgradable ownership and tries to acquire exclusive ownership. This operation will fail if there are threads with sharable ownership, but it will maintain upgradable ownership. Returns: If acquires exclusive ownership, returns true. Otherwise returns false. Throws: An exception derived from interprocess_exception on error.

    18. -
      bool timed_unlock_upgradable_and_lock(const boost::posix_time::ptime & abs_time);
      +
      bool timed_unlock_upgradable_and_lock(const boost::posix_time::ptime & abs_time);

      Precondition: The thread must have upgradable ownership of the mutex. Effects: The thread atomically releases upgradable ownership and tries to acquire exclusive ownership, waiting if necessary until abs_time. This operation will fail if there are threads with sharable ownership or timeout reaches, but it will maintain upgradable ownership. Returns: If acquires exclusive ownership, returns true. Otherwise returns false. Throws: An exception derived from interprocess_exception on error.

    19. -
      bool try_unlock_sharable_and_lock();
      +
      bool try_unlock_sharable_and_lock();

      Precondition: The thread must have sharable ownership of the mutex. Effects: The thread atomically releases sharable ownership and tries to acquire exclusive ownership. This operation will fail if there are threads with sharable or upgradable ownership, but it will maintain sharable ownership. Returns: If acquires exclusive ownership, returns true. Otherwise returns false. Throws: An exception derived from interprocess_exception on error.

    20. -
      bool try_unlock_sharable_and_lock_upgradable();
      +
      bool try_unlock_sharable_and_lock_upgradable();

      Precondition: The thread must have sharable ownership of the mutex. Effects: The thread atomically releases sharable ownership and tries to acquire upgradable ownership. This operation will fail if there are threads with sharable or upgradable ownership, but it will maintain sharable ownership. Returns: If acquires upgradable ownership, returns true. Otherwise returns false. Throws: An exception derived from interprocess_exception on error.

    -named_upgradable_mutex public static functions

    +named_upgradable_mutex public static functions
    1. -
      static bool remove(const char * name);
      +
      static bool remove(const char * name);

      Erases a named upgradable mutex from the system. Returns false on error. Never throws.

    diff --git a/doc/html/boost/interprocess/node_allocator.html b/doc/html/boost/interprocess/node_allocator.html index c640d492b8..34b75da1c3 100644 --- a/doc/html/boost/interprocess/node_allocator.html +++ b/doc/html/boost/interprocess/node_allocator.html @@ -7,7 +7,7 @@ - + @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -54,39 +54,39 @@ }; // construct/copy/destruct - node_allocator(segment_manager *); - node_allocator(const node_allocator &); + node_allocator(segment_manager *); + node_allocator(const node_allocator &); template<typename T2> - node_allocator(const node_allocator< T2, SegmentManager, NodesPerBlock > &); + node_allocator(const node_allocator< T2, SegmentManager, NodesPerBlock > &); template<typename T2, typename SegmentManager2, std::size_t N2> node_allocator & - operator=(const node_allocator< T2, SegmentManager2, N2 > &); - ~node_allocator(); + operator=(const node_allocator< T2, SegmentManager2, N2 > &); + ~node_allocator(); - // public member functions - void * get_node_pool() const; - segment_manager * get_segment_manager() const; - size_type max_size() const; - pointer allocate(size_type, cvoid_pointer = 0); - void deallocate(const pointer &, size_type); - void deallocate_free_blocks(); - pointer address(reference) const; - const_pointer address(const_reference) const; - void construct(const pointer &, const_reference); - void destroy(const pointer &); - size_type size(const pointer &) const; - pointer allocation_command(boost::interprocess::allocation_type, size_type, + // public member functions + void * get_node_pool() const; + segment_manager * get_segment_manager() const; + size_type max_size() const; + pointer allocate(size_type, cvoid_pointer = 0); + void deallocate(const pointer &, size_type); + void deallocate_free_blocks(); + pointer address(reference) const; + const_pointer address(const_reference) const; + void construct(const pointer &, const_reference); + void destroy(const pointer &); + size_type size(const pointer &) const; + pointer allocation_command(boost::interprocess::allocation_type, size_type, size_type &, pointer &); - void allocate_many(size_type, size_type, multiallocation_chain &); - void allocate_many(const size_type *, size_type, multiallocation_chain &); - void deallocate_many(multiallocation_chain &); - pointer allocate_one(); - void allocate_individual(size_type, multiallocation_chain &); - void deallocate_one(const pointer &); - void deallocate_individual(multiallocation_chain &); + void allocate_many(size_type, size_type, multiallocation_chain &); + void allocate_many(const size_type *, size_type, multiallocation_chain &); + void deallocate_many(multiallocation_chain &); + pointer allocate_one(); + void allocate_individual(size_type, multiallocation_chain &); + void deallocate_one(const pointer &); + void deallocate_individual(multiallocation_chain &); - // friend functions - friend void swap(self_t &, self_t &); + // friend functions + friend void swap(self_t &, self_t &); };

    Description

    @@ -98,120 +98,120 @@ construct/copy/destruct
    1. -
      node_allocator(segment_manager * segment_mngr);
      +
      node_allocator(segment_manager * segment_mngr);

      Not assignable from other node_allocator Constructor from a segment manager. If not present, constructs a node pool. Increments the reference count of the associated node pool. Can throw boost::interprocess::bad_alloc

    2. -
      node_allocator(const node_allocator & other);
      +
      node_allocator(const node_allocator & other);

      Copy constructor from other node_allocator. Increments the reference count of the associated node pool. Never throws 

    3. template<typename T2> 
-  node_allocator(const node_allocator< T2, SegmentManager, NodesPerBlock > & other);
      + node_allocator(const node_allocator< T2, SegmentManager, NodesPerBlock > & other);

      Copy constructor from related node_allocator. If not present, constructs a node pool. Increments the reference count of the associated node pool. Can throw boost::interprocess::bad_alloc 

    4. template<typename T2, typename SegmentManager2, std::size_t N2> 
   node_allocator & 
-  operator=(const node_allocator< T2, SegmentManager2, N2 > &);
      + operator=(const node_allocator< T2, SegmentManager2, N2 > &);

      Not assignable from related node_allocator

    5. -
      ~node_allocator();
      +
      ~node_allocator();

      Destructor, removes node_pool_t from memory if its reference count reaches to zero. Never throws

    -node_allocator public member functions

    +node_allocator public member functions
    1. -
      void * get_node_pool() const;
      +
      void * get_node_pool() const;

      Returns a pointer to the node pool. Never throws

    2. -
      segment_manager * get_segment_manager() const;
      +
      segment_manager * get_segment_manager() const;

      Returns the segment manager. Never throws

    3. -
      size_type max_size() const;
      +
      size_type max_size() const;

      Returns the number of elements that could be allocated. Never throws

    4. -
      pointer allocate(size_type count, cvoid_pointer hint = 0);
      +
      pointer allocate(size_type count, cvoid_pointer hint = 0);

      Allocate memory for an array of count elements. Throws boost::interprocess::bad_alloc if there is no enough memory

    5. -
      void deallocate(const pointer & ptr, size_type count);
      +
      void deallocate(const pointer & ptr, size_type count);

      Deallocate allocated memory. Never throws

    6. -
      void deallocate_free_blocks();
      +
      void deallocate_free_blocks();

      Deallocates all free blocks of the pool

    7. -
      pointer address(reference value) const;
      +
      pointer address(reference value) const;

      Returns address of mutable object. Never throws

    8. -
      const_pointer address(const_reference value) const;
      +
      const_pointer address(const_reference value) const;

      Returns address of non mutable object. Never throws

    9. -
      void construct(const pointer & ptr, const_reference v);
      +
      void construct(const pointer & ptr, const_reference v);

      Copy construct an object. Throws if T's copy constructor throws

    10. -
      void destroy(const pointer & ptr);
      +
      void destroy(const pointer & ptr);

      Destroys object. Throws if object's destructor throws

    11. -
      size_type size(const pointer & p) const;
      +
      size_type size(const pointer & p) const;

      Returns maximum the number of objects the previously allocated memory pointed by p can hold. This size only works for memory allocated with allocate, allocation_command and allocate_many.

      12. -
    12. pointer allocation_command(boost::interprocess::allocation_type command, 
+
    13. pointer allocation_command(boost::interprocess::allocation_type command, 
                            size_type limit_size, 
                            size_type & prefer_in_recvd_out_size, 
                            pointer & reuse);
      14. 
 
    14. 
-
      void allocate_many(size_type elem_size, size_type num_elements, 
+
      void allocate_many(size_type elem_size, size_type num_elements, 
                    multiallocation_chain & chain);
      
 
      Allocates many elements of size elem_size in a contiguous block of memory. The minimum number to be allocated is min_elements, the preferred and maximum number is preferred_elements. The number of actually allocated elements is will be assigned to received_size. The elements must be deallocated with deallocate(...) 
      
 
      15. 
 
    15. 
-
      void allocate_many(const size_type * elem_sizes, size_type n_elements, 
+
      void allocate_many(const size_type * elem_sizes, size_type n_elements, 
                    multiallocation_chain & chain);
      
 
      Allocates n_elements elements, each one of size elem_sizes[i]in a contiguous block of memory. The elements must be deallocated 
      
 
      16. 
 
    16. 
-
      void deallocate_many(multiallocation_chain & chain);
      
+
      void deallocate_many(multiallocation_chain & chain);
      
 
      Allocates many elements of size elem_size in a contiguous block of memory. The minimum number to be allocated is min_elements, the preferred and maximum number is preferred_elements. The number of actually allocated elements is will be assigned to received_size. The elements must be deallocated with deallocate(...) 
      
 
      17. 
 
    17. 
-
      pointer allocate_one();
      
+
      pointer allocate_one();
      
 
      Allocates just one object. Memory allocated with this function must be deallocated only with deallocate_one(). Throws boost::interprocess::bad_alloc if there is no enough memory 
      
 
      18. 
 
    18. 
-
      void allocate_individual(size_type num_elements, 
+
      void allocate_individual(size_type num_elements, 
                          multiallocation_chain & chain);
      
 
      Allocates many elements of size == 1 in a contiguous block of memory. The minimum number to be allocated is min_elements, the preferred and maximum number is preferred_elements. The number of actually allocated elements is will be assigned to received_size. Memory allocated with this function must be deallocated only with deallocate_one(). 
      
 
      19. 
 
    19. 
-
      void deallocate_one(const pointer & p);
      
+
      void deallocate_one(const pointer & p);
      
 
      Deallocates memory previously allocated with allocate_one(). You should never use deallocate_one to deallocate memory allocated with other functions different from allocate_one(). Never throws 
      
 
      20. 
 
    20. 
-
      void deallocate_individual(multiallocation_chain & chain);
      
+
      void deallocate_individual(multiallocation_chain & chain);
      
 
      Allocates many elements of size == 1 in a contiguous block of memory. The minimum number to be allocated is min_elements, the preferred and maximum number is preferred_elements. The number of actually allocated elements is will be assigned to received_size. Memory allocated with this function must be deallocated only with deallocate_one(). 
      
 
      21.

    -node_allocator friend functions

    +node_allocator friend functions
    1. -
      friend void swap(self_t & alloc1, self_t & alloc2);
      +
      friend void swap(self_t & alloc1, self_t & alloc2);

      Swaps allocators. Does not throw. If each allocator is placed in a different memory segment, the result is undefined.

    @@ -227,7 +227,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/interprocess/node_allocator/rebind.html b/doc/html/boost/interprocess/node_allocator/rebind.html index 4490109d19..af82924f44 100644 --- a/doc/html/boost/interprocess/node_allocator/rebind.html +++ b/doc/html/boost/interprocess/node_allocator/rebind.html @@ -8,7 +8,7 @@ - + @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -53,7 +53,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/interprocess/null_index.html b/doc/html/boost/interprocess/null_index.html index 43717c9203..a6bbe667de 100644 --- a/doc/html/boost/interprocess/null_index.html +++ b/doc/html/boost/interprocess/null_index.html @@ -40,13 +40,13 @@ typedef const int * const_iterator; // construct/copy/destruct - null_index(segment_manager_base *); + null_index(segment_manager_base *); - // public member functions - const_iterator begin() const; - iterator begin(); - const_iterator end() const; - iterator end(); + // public member functions + const_iterator begin() const; + iterator begin(); + const_iterator end() const; + iterator end(); };

    Description

    @@ -57,26 +57,26 @@ public construct/copy/destruct
    1. -
      null_index(segment_manager_base *);
      Empty constructor.
    +
    null_index(segment_manager_base *);
    Empty constructor.

    -null_index public member functions

    +null_index public member functions
    1. -
      const_iterator begin() const;
      +
      const_iterator begin() const;

      begin() is equal to end()

    2. -
      iterator begin();
      +
      iterator begin();

      begin() is equal to end()

    3. -
      const_iterator end() const;
      +
      const_iterator end() const;

      begin() is equal to end()

    4. -
      iterator end();
      +
      iterator end();

      begin() is equal to end()

    diff --git a/doc/html/boost/interprocess/null_mutex.html b/doc/html/boost/interprocess/null_mutex.html index f7e28aa6d2..7de7c59c28 100644 --- a/doc/html/boost/interprocess/null_mutex.html +++ b/doc/html/boost/interprocess/null_mutex.html @@ -36,30 +36,30 @@ class null_mutex { public: // construct/copy/destruct - null_mutex(); - ~null_mutex(); + null_mutex(); + ~null_mutex(); - // public member functions - void lock(); - bool try_lock(); - bool timed_lock(const boost::posix_time::ptime &); - void unlock(); - void lock_sharable(); - bool try_lock_sharable(); - bool timed_lock_sharable(const boost::posix_time::ptime &); - void unlock_sharable(); - void lock_upgradable(); - bool try_lock_upgradable(); - bool timed_lock_upgradable(const boost::posix_time::ptime &); - void unlock_upgradable(); - void unlock_and_lock_upgradable(); - void unlock_and_lock_sharable(); - void unlock_upgradable_and_lock_sharable(); - void unlock_upgradable_and_lock(); - bool try_unlock_upgradable_and_lock(); - bool timed_unlock_upgradable_and_lock(const boost::posix_time::ptime &); - bool try_unlock_sharable_and_lock(); - bool try_unlock_sharable_and_lock_upgradable(); + // public member functions + void lock(); + bool try_lock(); + bool timed_lock(const boost::posix_time::ptime &); + void unlock(); + void lock_sharable(); + bool try_lock_sharable(); + bool timed_lock_sharable(const boost::posix_time::ptime &); + void unlock_sharable(); + void lock_upgradable(); + bool try_lock_upgradable(); + bool timed_lock_upgradable(const boost::posix_time::ptime &); + void unlock_upgradable(); + void unlock_and_lock_upgradable(); + void unlock_and_lock_sharable(); + void unlock_upgradable_and_lock_sharable(); + void unlock_upgradable_and_lock(); + bool try_unlock_upgradable_and_lock(); + bool timed_unlock_upgradable_and_lock(const boost::posix_time::ptime &); + bool try_unlock_sharable_and_lock(); + bool try_unlock_sharable_and_lock_upgradable(); };

    Description

    @@ -71,95 +71,95 @@ construct/copy/destruct
    1. -
      null_mutex();
      +
      null_mutex();

      Constructor. Empty.

    2. -
      ~null_mutex();
      +
      ~null_mutex();

      Destructor. Empty.

    -null_mutex public member functions

    +null_mutex public member functions
    1. -
      void lock();
      Simulates a mutex lock() operation. Empty function.
      2. +
      void lock();
      Simulates a mutex lock() operation. Empty function.
    2. -
      bool try_lock();
      +
      bool try_lock();

      Simulates a mutex try_lock() operation. Equivalent to "return true;"

    3. -
      bool timed_lock(const boost::posix_time::ptime &);
      +
      bool timed_lock(const boost::posix_time::ptime &);

      Simulates a mutex timed_lock() operation. Equivalent to "return true;"

    4. -
      void unlock();
      +
      void unlock();

      Simulates a mutex unlock() operation. Empty function.

    5. -
      void lock_sharable();
      +
      void lock_sharable();

      Simulates a mutex lock_sharable() operation. Empty function.

    6. -
      bool try_lock_sharable();
      +
      bool try_lock_sharable();

      Simulates a mutex try_lock_sharable() operation. Equivalent to "return true;"

    7. -
      bool timed_lock_sharable(const boost::posix_time::ptime &);
      +
      bool timed_lock_sharable(const boost::posix_time::ptime &);

      Simulates a mutex timed_lock_sharable() operation. Equivalent to "return true;"

    8. -
      void unlock_sharable();
      +
      void unlock_sharable();

      Simulates a mutex unlock_sharable() operation. Empty function.

    9. -
      void lock_upgradable();
      +
      void lock_upgradable();

      Simulates a mutex lock_upgradable() operation. Empty function.

    10. -
      bool try_lock_upgradable();
      +
      bool try_lock_upgradable();

      Simulates a mutex try_lock_upgradable() operation. Equivalent to "return true;"

    11. -
      bool timed_lock_upgradable(const boost::posix_time::ptime &);
      +
      bool timed_lock_upgradable(const boost::posix_time::ptime &);

      Simulates a mutex timed_lock_upgradable() operation. Equivalent to "return true;"

    12. -
      void unlock_upgradable();
      +
      void unlock_upgradable();

      Simulates a mutex unlock_upgradable() operation. Empty function.

    13. -
      void unlock_and_lock_upgradable();
      +
      void unlock_and_lock_upgradable();

      Simulates unlock_and_lock_upgradable(). Empty function.

    14. -
      void unlock_and_lock_sharable();
      +
      void unlock_and_lock_sharable();

      Simulates unlock_and_lock_sharable(). Empty function.

    15. -
      void unlock_upgradable_and_lock_sharable();
      +
      void unlock_upgradable_and_lock_sharable();

      Simulates unlock_upgradable_and_lock_sharable(). Empty function.

    16. -
      void unlock_upgradable_and_lock();
      +
      void unlock_upgradable_and_lock();

      Simulates unlock_upgradable_and_lock(). Empty function.

    17. -
      bool try_unlock_upgradable_and_lock();
      +
      bool try_unlock_upgradable_and_lock();

      Simulates try_unlock_upgradable_and_lock(). Equivalent to "return true;"

    18. -
      bool timed_unlock_upgradable_and_lock(const boost::posix_time::ptime &);
      +
      bool timed_unlock_upgradable_and_lock(const boost::posix_time::ptime &);

      Simulates timed_unlock_upgradable_and_lock(). Equivalent to "return true;"

    19. -
      bool try_unlock_sharable_and_lock();
      +
      bool try_unlock_sharable_and_lock();

      Simulates try_unlock_sharable_and_lock(). Equivalent to "return true;"

    20. -
      bool try_unlock_sharable_and_lock_upgradable();
      +
      bool try_unlock_sharable_and_lock_upgradable();

      Simulates try_unlock_sharable_and_lock_upgradable(). Equivalent to "return true;"

    diff --git a/doc/html/boost/interprocess/offset_ptr.html b/doc/html/boost/interprocess/offset_ptr.html index 9766380f25..eff61dafa3 100644 --- a/doc/html/boost/interprocess/offset_ptr.html +++ b/doc/html/boost/interprocess/offset_ptr.html @@ -8,7 +8,7 @@ - + @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -47,60 +47,60 @@ typedef offset_ptr< U, DifferenceType, OffsetType, OffsetAlignment > rebind; // construct/copy/destruct - offset_ptr() noexcept; - offset_ptr(pointer) noexcept; - template<typename T> offset_ptr(T *, unspecified = 0) noexcept; - offset_ptr(const offset_ptr &) noexcept; + offset_ptr() noexcept; + offset_ptr(pointer) noexcept; + template<typename T> offset_ptr(T *, unspecified = 0) noexcept; + offset_ptr(const offset_ptr &) noexcept; template<typename T2> - offset_ptr(const offset_ptr< T2, DifferenceType, OffsetType, OffsetAlignment > &) noexcept; + offset_ptr(const offset_ptr< T2, DifferenceType, OffsetType, OffsetAlignment > &) noexcept; template<typename T2> - explicit offset_ptr(const offset_ptr< T2, DifferenceType, OffsetType, OffsetAlignment > &) noexcept; + explicit offset_ptr(const offset_ptr< T2, DifferenceType, OffsetType, OffsetAlignment > &) noexcept; template<typename T2, typename P2, typename O2, std::size_t A2> - offset_ptr(const offset_ptr< T2, P2, O2, A2 > &, unspecified) noexcept; + offset_ptr(const offset_ptr< T2, P2, O2, A2 > &, unspecified) noexcept; template<typename T2, typename P2, typename O2, std::size_t A2> - offset_ptr(const offset_ptr< T2, P2, O2, A2 > &, unspecified) noexcept; + offset_ptr(const offset_ptr< T2, P2, O2, A2 > &, unspecified) noexcept; template<typename T2, typename P2, typename O2, std::size_t A2> - offset_ptr(const offset_ptr< T2, P2, O2, A2 > &, unspecified) noexcept; + offset_ptr(const offset_ptr< T2, P2, O2, A2 > &, unspecified) noexcept; template<typename T2, typename P2, typename O2, std::size_t A2> - offset_ptr(const offset_ptr< T2, P2, O2, A2 > &, unspecified) noexcept; - offset_ptr & operator=(pointer) noexcept; - offset_ptr & operator=(const offset_ptr &) noexcept; + offset_ptr(const offset_ptr< T2, P2, O2, A2 > &, unspecified) noexcept; + offset_ptr & operator=(pointer) noexcept; + offset_ptr & operator=(const offset_ptr &) noexcept; template<typename T2> offset_ptr & - operator=(const offset_ptr< T2, DifferenceType, OffsetType, OffsetAlignment > &) noexcept; + operator=(const offset_ptr< T2, DifferenceType, OffsetType, OffsetAlignment > &) noexcept; - // public member functions - pointer get() const noexcept; - offset_type get_offset() const noexcept; - pointer operator->() const noexcept; - reference operator*() const noexcept; - reference operator[](difference_type) const noexcept; - offset_ptr & operator+=(difference_type) noexcept; - offset_ptr & operator-=(difference_type) noexcept; - offset_ptr & operator++(void) noexcept; - offset_ptr operator++(int) noexcept; - offset_ptr & operator--(void) noexcept; - offset_ptr operator--(int) noexcept; - explicit operator bool() const noexcept; - bool operator!() const noexcept; + // public member functions + pointer get() const noexcept; + offset_type get_offset() const noexcept; + pointer operator->() const noexcept; + reference operator*() const noexcept; + reference operator[](difference_type) const noexcept; + offset_ptr & operator+=(difference_type) noexcept; + offset_ptr & operator-=(difference_type) noexcept; + offset_ptr & operator++(void) noexcept; + offset_ptr operator++(int) noexcept; + offset_ptr & operator--(void) noexcept; + offset_ptr operator--(int) noexcept; + explicit operator bool() const noexcept; + bool operator!() const noexcept; - // public static functions - static offset_ptr pointer_to(reference) noexcept; + // public static functions + static offset_ptr pointer_to(reference) noexcept; - // friend functions - friend offset_ptr operator+(difference_type, offset_ptr) noexcept; - friend offset_ptr operator+(offset_ptr, difference_type) noexcept; - friend offset_ptr operator-(offset_ptr, difference_type) noexcept; - friend offset_ptr operator-(difference_type, offset_ptr) noexcept; + // friend functions + friend offset_ptr operator+(difference_type, offset_ptr) noexcept; + friend offset_ptr operator+(offset_ptr, difference_type) noexcept; + friend offset_ptr operator-(offset_ptr, difference_type) noexcept; + friend offset_ptr operator-(difference_type, offset_ptr) noexcept; friend difference_type - operator-(const offset_ptr &, const offset_ptr &) noexcept; + operator-(const offset_ptr &, const offset_ptr &) noexcept; - // private member functions + // private member functions template<typename T2> - void assign(const offset_ptr< T2, DifferenceType, OffsetType, OffsetAlignment > &, + void assign(const offset_ptr< T2, DifferenceType, OffsetType, OffsetAlignment > &, unspecified) noexcept; template<typename T2> - void assign(const offset_ptr< T2, DifferenceType, OffsetType, OffsetAlignment > &, + void assign(const offset_ptr< T2, DifferenceType, OffsetType, OffsetAlignment > &, unspecified) noexcept; };
    @@ -153,166 +153,166 @@ b>Note:
    1. -
      offset_ptr() noexcept;
      +
      offset_ptr() noexcept;

      Default constructor (null pointer). Never throws.

    2. -
      offset_ptr(pointer ptr) noexcept;
      +
      offset_ptr(pointer ptr) noexcept;

      Constructor from raw pointer (allows "0" pointer conversion). Never throws.

    3. -
      template<typename T> offset_ptr(T * ptr, unspecified = 0) noexcept;
      +
      template<typename T> offset_ptr(T * ptr, unspecified = 0) noexcept;

      Constructor from other pointer. Never throws.

    4. -
      offset_ptr(const offset_ptr & ptr) noexcept;
      +
      offset_ptr(const offset_ptr & ptr) noexcept;

      Constructor from other offset_ptr Never throws. 

    5. template<typename T2> 
-  offset_ptr(const offset_ptr< T2, DifferenceType, OffsetType, OffsetAlignment > & ptr) noexcept;
      + offset_ptr(const offset_ptr< T2, DifferenceType, OffsetType, OffsetAlignment > & ptr) noexcept;

      Constructor from other offset_ptr. Only takes part in overload resolution if T2* is convertible to PointedType*. Never throws. 

    6. template<typename T2> 
-  explicit offset_ptr(const offset_ptr< T2, DifferenceType, OffsetType, OffsetAlignment > & ptr) noexcept;
      + explicit offset_ptr(const offset_ptr< T2, DifferenceType, OffsetType, OffsetAlignment > & ptr) noexcept;

      Constructor from other offset_ptr. Only takes part in overload resolution if PointedType* is constructible from T2* other than via a conversion (e.g. cast to a derived class). Never throws. 

    7. template<typename T2, typename P2, typename O2, std::size_t A2> 
-  offset_ptr(const offset_ptr< T2, P2, O2, A2 > & r, unspecified) noexcept;
      + offset_ptr(const offset_ptr< T2, P2, O2, A2 > & r, unspecified) noexcept;

      Emulates static_cast operator. Never throws. 

    8. template<typename T2, typename P2, typename O2, std::size_t A2> 
-  offset_ptr(const offset_ptr< T2, P2, O2, A2 > & r, unspecified) noexcept;
      + offset_ptr(const offset_ptr< T2, P2, O2, A2 > & r, unspecified) noexcept;

      Emulates const_cast operator. Never throws. 

    9. template<typename T2, typename P2, typename O2, std::size_t A2> 
-  offset_ptr(const offset_ptr< T2, P2, O2, A2 > & r, unspecified) noexcept;
      + offset_ptr(const offset_ptr< T2, P2, O2, A2 > & r, unspecified) noexcept;

      Emulates dynamic_cast operator. Never throws. 

    10. template<typename T2, typename P2, typename O2, std::size_t A2> 
-  offset_ptr(const offset_ptr< T2, P2, O2, A2 > & r, unspecified) noexcept;
      + offset_ptr(const offset_ptr< T2, P2, O2, A2 > & r, unspecified) noexcept;

      Emulates reinterpret_cast operator. Never throws.

    11. -
      offset_ptr & operator=(pointer from) noexcept;
      +
      offset_ptr & operator=(pointer from) noexcept;

      Assignment from pointer (saves extra conversion). Never throws.

    12. -
      offset_ptr & operator=(const offset_ptr & ptr) noexcept;
      +
      offset_ptr & operator=(const offset_ptr & ptr) noexcept;

      Assignment from other offset_ptr. Never throws. 

    13. template<typename T2> 
   offset_ptr & 
-  operator=(const offset_ptr< T2, DifferenceType, OffsetType, OffsetAlignment > & ptr) noexcept;
      + operator=(const offset_ptr< T2, DifferenceType, OffsetType, OffsetAlignment > & ptr) noexcept;

      Assignment from related offset_ptr. If pointers of pointee types are assignable, offset_ptrs will be assignable. Never throws.

    -offset_ptr public member functions

    +offset_ptr public member functions
    1. -
      pointer get() const noexcept;
      +
      pointer get() const noexcept;

      Obtains raw pointer from offset. Never throws.

      2. -
    2. offset_type get_offset() const noexcept;
      3. +
    3. offset_type get_offset() const noexcept;
    4. -
      pointer operator->() const noexcept;
      +
      pointer operator->() const noexcept;

      Pointer-like -> operator. It can return 0 pointer. Never throws.

    5. -
      reference operator*() const noexcept;
      +
      reference operator*() const noexcept;

      Dereferencing operator, if it is a null offset_ptr behavior is undefined. Never throws.

    6. -
      reference operator[](difference_type idx) const noexcept;
      +
      reference operator[](difference_type idx) const noexcept;

      Indexing operator. Never throws.

    7. -
      offset_ptr & operator+=(difference_type offset) noexcept;
      +
      offset_ptr & operator+=(difference_type offset) noexcept;

      offset_ptr += difference_type. Never throws.

    8. -
      offset_ptr & operator-=(difference_type offset) noexcept;
      +
      offset_ptr & operator-=(difference_type offset) noexcept;

      offset_ptr -= difference_type. Never throws.

    9. -
      offset_ptr & operator++(void) noexcept;
      +
      offset_ptr & operator++(void) noexcept;

      ++offset_ptr. Never throws.

    10. -
      offset_ptr operator++(int) noexcept;
      +
      offset_ptr operator++(int) noexcept;

      offset_ptr++. Never throws.

    11. -
      offset_ptr & operator--(void) noexcept;
      +
      offset_ptr & operator--(void) noexcept;

      –offset_ptr. Never throws.

    12. -
      offset_ptr operator--(int) noexcept;
      +
      offset_ptr operator--(int) noexcept;

      offset_ptr–. Never throws.

    13. -
      explicit operator bool() const noexcept;
      +
      explicit operator bool() const noexcept;

      safe bool conversion operator. Never throws.

    14. -
      bool operator!() const noexcept;
      +
      bool operator!() const noexcept;

      Not operator. Not needed in theory, but improves portability. Never throws

    -offset_ptr public static functions

    +offset_ptr public static functions
    1. -
      static offset_ptr pointer_to(reference r) noexcept;
      +
      static offset_ptr pointer_to(reference r) noexcept;

      Compatibility with pointer_traits

    -offset_ptr friend functions

    +offset_ptr friend functions
    1. -
      friend offset_ptr operator+(difference_type diff, offset_ptr right) noexcept;
      +
      friend offset_ptr operator+(difference_type diff, offset_ptr right) noexcept;

      difference_type + offset_ptr operation

    2. -
      friend offset_ptr operator+(offset_ptr left, difference_type diff) noexcept;
      +
      friend offset_ptr operator+(offset_ptr left, difference_type diff) noexcept;

      offset_ptr + difference_type operation

    3. -
      friend offset_ptr operator-(offset_ptr left, difference_type diff) noexcept;
      +
      friend offset_ptr operator-(offset_ptr left, difference_type diff) noexcept;

      offset_ptr - diff operation

    4. -
      friend offset_ptr operator-(difference_type diff, offset_ptr right) noexcept;
      +
      friend offset_ptr operator-(difference_type diff, offset_ptr right) noexcept;

      offset_ptr - diff operation 

    5. friend difference_type 
-operator-(const offset_ptr & pt, const offset_ptr & pt2) noexcept;
      +operator-(const offset_ptr & pt, const offset_ptr & pt2) noexcept;

      offset_ptr - offset_ptr operation

    -offset_ptr private member functions

    +offset_ptr private member functions 
    1. template<typename T2> 
-  void assign(const offset_ptr< T2, DifferenceType, OffsetType, OffsetAlignment > & ptr, 
+  void assign(const offset_ptr< T2, DifferenceType, OffsetType, OffsetAlignment > & ptr, 
               unspecified) noexcept;
    2. template<typename T2> 
-  void assign(const offset_ptr< T2, DifferenceType, OffsetType, OffsetAlignment > & ptr, 
+  void assign(const offset_ptr< T2, DifferenceType, OffsetType, OffsetAlignment > & ptr, 
               unspecified) noexcept;
    @@ -328,7 +328,7 @@ b>Note: -PrevUpHomeNext +PrevUpHomeNext diff --git a/doc/html/boost/interprocess/operator___idp38496176.html b/doc/html/boost/interprocess/operator___idp38496176.html new file mode 100644 index 0000000000..df946fd67f --- /dev/null +++ b/doc/html/boost/interprocess/operator___idp38496176.html @@ -0,0 +1,58 @@ + + + + +Function template operator== + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Function template operator==

    +

    boost::interprocess::operator==

    +
    +

    Synopsis

    +
    // In header: <boost/interprocess/allocators/adaptive_pool.hpp>
+
+
+template<typename T, typename S, std::size_t NodesPerBlock, std::size_t F, 
+         unsigned char OP> 
+  bool operator==(const adaptive_pool< T, S, NodesPerBlock, F, OP > & alloc1, 
+                  const adaptive_pool< T, S, NodesPerBlock, F, OP > & alloc2);
    +
    +

    Description

    +

    Equality test for same type of adaptive_pool

    +
    +
    + + + +
    Copyright © 2005-2015 Ion Gaztanaga

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/interprocess/operator___idp38504448.html b/doc/html/boost/interprocess/operator___idp38504448.html new file mode 100644 index 0000000000..03f7bee610 --- /dev/null +++ b/doc/html/boost/interprocess/operator___idp38504448.html @@ -0,0 +1,58 @@ + + + + +Function template operator!= + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Function template operator!=

    +

    boost::interprocess::operator!=

    +
    +

    Synopsis

    +
    // In header: <boost/interprocess/allocators/adaptive_pool.hpp>
+
+
+template<typename T, typename S, std::size_t NodesPerBlock, std::size_t F, 
+         unsigned char OP> 
+  bool operator!=(const adaptive_pool< T, S, NodesPerBlock, F, OP > & alloc1, 
+                  const adaptive_pool< T, S, NodesPerBlock, F, OP > & alloc2);
    +
    +

    Description

    +

    Inequality test for same type of adaptive_pool

    +
    +
    + + + +
    Copyright © 2005-2015 Ion Gaztanaga

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/interprocess/operator___idp38584608.html b/doc/html/boost/interprocess/operator___idp38584608.html new file mode 100644 index 0000000000..701f7ee875 --- /dev/null +++ b/doc/html/boost/interprocess/operator___idp38584608.html @@ -0,0 +1,57 @@ + + + + +Function template operator== + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Function template operator==

    +

    boost::interprocess::operator==

    +
    +

    Synopsis

    +
    // In header: <boost/interprocess/allocators/allocator.hpp>
+
+
+template<typename T, typename SegmentManager> 
+  bool operator==(const allocator< T, SegmentManager > & alloc1, 
+                  const allocator< T, SegmentManager > & alloc2);
    +
    +

    Description

    +

    Equality test for same type of allocator

    +
    +
    + + + +
    Copyright © 2005-2015 Ion Gaztanaga

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/interprocess/operator___idp38589584.html b/doc/html/boost/interprocess/operator___idp38589584.html new file mode 100644 index 0000000000..12418cd2d4 --- /dev/null +++ b/doc/html/boost/interprocess/operator___idp38589584.html @@ -0,0 +1,57 @@ + + + + +Function template operator!= + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Function template operator!=

    +

    boost::interprocess::operator!=

    +
    +

    Synopsis

    +
    // In header: <boost/interprocess/allocators/allocator.hpp>
+
+
+template<typename T, typename SegmentManager> 
+  bool operator!=(const allocator< T, SegmentManager > & alloc1, 
+                  const allocator< T, SegmentManager > & alloc2);
    +
    +

    Description

    +

    Inequality test for same type of allocator

    +
    +
    + + + +
    Copyright © 2005-2015 Ion Gaztanaga

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/interprocess/operator___idp38691552.html b/doc/html/boost/interprocess/operator___idp38691552.html new file mode 100644 index 0000000000..0904433195 --- /dev/null +++ b/doc/html/boost/interprocess/operator___idp38691552.html @@ -0,0 +1,58 @@ + + + + +Function template operator== + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Function template operator==

    +

    boost::interprocess::operator==

    +
    +

    Synopsis

    +
    // In header: <boost/interprocess/allocators/cached_adaptive_pool.hpp>
+
+
+template<typename T, typename S, std::size_t NodesPerBlock, std::size_t F, 
+         std::size_t OP> 
+  bool operator==(const cached_adaptive_pool< T, S, NodesPerBlock, F, OP > & alloc1, 
+                  const cached_adaptive_pool< T, S, NodesPerBlock, F, OP > & alloc2);
    +
    +

    Description

    +

    Equality test for same type of cached_adaptive_pool

    +
    +
    + + + +
    Copyright © 2005-2015 Ion Gaztanaga

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/interprocess/operator___idp38699840.html b/doc/html/boost/interprocess/operator___idp38699840.html new file mode 100644 index 0000000000..1b80f2e46e --- /dev/null +++ b/doc/html/boost/interprocess/operator___idp38699840.html @@ -0,0 +1,58 @@ + + + + +Function template operator!= + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Function template operator!=

    +

    boost::interprocess::operator!=

    +
    +

    Synopsis

    +
    // In header: <boost/interprocess/allocators/cached_adaptive_pool.hpp>
+
+
+template<typename T, typename S, std::size_t NodesPerBlock, std::size_t F, 
+         std::size_t OP> 
+  bool operator!=(const cached_adaptive_pool< T, S, NodesPerBlock, F, OP > & alloc1, 
+                  const cached_adaptive_pool< T, S, NodesPerBlock, F, OP > & alloc2);
    +
    +

    Description

    +

    Inequality test for same type of cached_adaptive_pool

    +
    +
    + + + +
    Copyright © 2005-2015 Ion Gaztanaga

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/interprocess/operator___idp38798784.html b/doc/html/boost/interprocess/operator___idp38798784.html new file mode 100644 index 0000000000..ec0173c58a --- /dev/null +++ b/doc/html/boost/interprocess/operator___idp38798784.html @@ -0,0 +1,57 @@ + + + + +Function template operator== + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Function template operator==

    +

    boost::interprocess::operator==

    +
    +

    Synopsis

    +
    // In header: <boost/interprocess/allocators/cached_node_allocator.hpp>
+
+
+template<typename T, typename S, std::size_t NPC> 
+  bool operator==(const cached_node_allocator< T, S, NPC > & alloc1, 
+                  const cached_node_allocator< T, S, NPC > & alloc2);
    +
    +

    Description

    +

    Equality test for same type of cached_node_allocator

    +
    +
    + + + +
    Copyright © 2005-2015 Ion Gaztanaga

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/interprocess/operator___idp38805344.html b/doc/html/boost/interprocess/operator___idp38805344.html new file mode 100644 index 0000000000..98165b8de6 --- /dev/null +++ b/doc/html/boost/interprocess/operator___idp38805344.html @@ -0,0 +1,57 @@ + + + + +Function template operator!= + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Function template operator!=

    +

    boost::interprocess::operator!=

    +
    +

    Synopsis

    +
    // In header: <boost/interprocess/allocators/cached_node_allocator.hpp>
+
+
+template<typename T, typename S, std::size_t NPC> 
+  bool operator!=(const cached_node_allocator< T, S, NPC > & alloc1, 
+                  const cached_node_allocator< T, S, NPC > & alloc2);
    +
    +

    Description

    +

    Inequality test for same type of cached_node_allocator

    +
    +
    + + + +
    Copyright © 2005-2015 Ion Gaztanaga

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/interprocess/operator___idp38898704.html b/doc/html/boost/interprocess/operator___idp38898704.html new file mode 100644 index 0000000000..e02e75fedc --- /dev/null +++ b/doc/html/boost/interprocess/operator___idp38898704.html @@ -0,0 +1,57 @@ + + + + +Function template operator== + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Function template operator==

    +

    boost::interprocess::operator==

    +
    +

    Synopsis

    +
    // In header: <boost/interprocess/allocators/node_allocator.hpp>
+
+
+template<typename T, typename S, std::size_t NPC> 
+  bool operator==(const node_allocator< T, S, NPC > & alloc1, 
+                  const node_allocator< T, S, NPC > & alloc2);
    +
    +

    Description

    +

    Equality test for same type of node_allocator

    +
    +
    + + + +
    Copyright © 2005-2015 Ion Gaztanaga

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/interprocess/operator___idp38905248.html b/doc/html/boost/interprocess/operator___idp38905248.html new file mode 100644 index 0000000000..baf3aa9e18 --- /dev/null +++ b/doc/html/boost/interprocess/operator___idp38905248.html @@ -0,0 +1,57 @@ + + + + +Function template operator!= + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Function template operator!=

    +

    boost::interprocess::operator!=

    +
    +

    Synopsis

    +
    // In header: <boost/interprocess/allocators/node_allocator.hpp>
+
+
+template<typename T, typename S, std::size_t NPC> 
+  bool operator!=(const node_allocator< T, S, NPC > & alloc1, 
+                  const node_allocator< T, S, NPC > & alloc2);
    +
    +

    Description

    +

    Inequality test for same type of node_allocator

    +
    +
    + + + +
    Copyright © 2005-2015 Ion Gaztanaga

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/interprocess/operator___idp39004656.html b/doc/html/boost/interprocess/operator___idp39004656.html new file mode 100644 index 0000000000..95d91c9780 --- /dev/null +++ b/doc/html/boost/interprocess/operator___idp39004656.html @@ -0,0 +1,58 @@ + + + + +Function template operator== + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Function template operator==

    +

    boost::interprocess::operator==

    +
    +

    Synopsis

    +
    // In header: <boost/interprocess/allocators/private_adaptive_pool.hpp>
+
+
+template<typename T, typename S, std::size_t NodesPerBlock, std::size_t F, 
+         unsigned char OP> 
+  bool operator==(const private_adaptive_pool< T, S, NodesPerBlock, F, OP > & alloc1, 
+                  const private_adaptive_pool< T, S, NodesPerBlock, F, OP > & alloc2);
    +
    +

    Description

    +

    Equality test for same type of private_adaptive_pool

    +
    +
    + + + +
    Copyright © 2005-2015 Ion Gaztanaga

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/interprocess/operator___idp39012944.html b/doc/html/boost/interprocess/operator___idp39012944.html new file mode 100644 index 0000000000..7ab29fd99c --- /dev/null +++ b/doc/html/boost/interprocess/operator___idp39012944.html @@ -0,0 +1,58 @@ + + + + +Function template operator!= + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Function template operator!=

    +

    boost::interprocess::operator!=

    +
    +

    Synopsis

    +
    // In header: <boost/interprocess/allocators/private_adaptive_pool.hpp>
+
+
+template<typename T, typename S, std::size_t NodesPerBlock, std::size_t F, 
+         unsigned char OP> 
+  bool operator!=(const private_adaptive_pool< T, S, NodesPerBlock, F, OP > & alloc1, 
+                  const private_adaptive_pool< T, S, NodesPerBlock, F, OP > & alloc2);
    +
    +

    Description

    +

    Inequality test for same type of private_adaptive_pool

    +
    +
    + + + +
    Copyright © 2005-2015 Ion Gaztanaga

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/interprocess/operator___idp39109776.html b/doc/html/boost/interprocess/operator___idp39109776.html new file mode 100644 index 0000000000..0030ccc3fe --- /dev/null +++ b/doc/html/boost/interprocess/operator___idp39109776.html @@ -0,0 +1,58 @@ + + + + +Function template operator== + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Function template operator==

    +

    boost::interprocess::operator==

    +
    +

    Synopsis

    +
    // In header: <boost/interprocess/allocators/private_node_allocator.hpp>
+
+
+template<typename T, typename S, std::size_t NodesPerBlock, std::size_t F, 
+         unsigned char OP> 
+  bool operator==(const private_node_allocator< T, S, NodesPerBlock, F, OP > & alloc1, 
+                  const private_node_allocator< T, S, NodesPerBlock, F, OP > & alloc2);
    +
    +

    Description

    +

    Equality test for same type of private_node_allocator

    +
    +
    + + + +
    Copyright © 2005-2015 Ion Gaztanaga

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/interprocess/operator___idp39118064.html b/doc/html/boost/interprocess/operator___idp39118064.html new file mode 100644 index 0000000000..dc999263ee --- /dev/null +++ b/doc/html/boost/interprocess/operator___idp39118064.html @@ -0,0 +1,58 @@ + + + + +Function template operator!= + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Function template operator!=

    +

    boost::interprocess::operator!=

    +
    +

    Synopsis

    +
    // In header: <boost/interprocess/allocators/private_node_allocator.hpp>
+
+
+template<typename T, typename S, std::size_t NodesPerBlock, std::size_t F, 
+         unsigned char OP> 
+  bool operator!=(const private_node_allocator< T, S, NodesPerBlock, F, OP > & alloc1, 
+                  const private_node_allocator< T, S, NodesPerBlock, F, OP > & alloc2);
    +
    +

    Description

    +

    Inequality test for same type of private_node_allocator

    +
    +
    + + + +
    Copyright © 2005-2015 Ion Gaztanaga

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/interprocess/operator___idp40278064.html b/doc/html/boost/interprocess/operator___idp40278064.html new file mode 100644 index 0000000000..a8c421639b --- /dev/null +++ b/doc/html/boost/interprocess/operator___idp40278064.html @@ -0,0 +1,57 @@ + + + + +Function template operator== + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Function template operator==

    +

    boost::interprocess::operator==

    +
    +

    Synopsis

    +
    // In header: <boost/interprocess/smart_ptr/intrusive_ptr.hpp>
+
+
+template<typename T, typename U, typename VP> 
+  bool operator==(intrusive_ptr< T, VP > const & a, 
+                  intrusive_ptr< U, VP > const & b);
    +
    +

    Description

    +

    Returns a.get() == b.get(). Does not throw

    +
    +
    + + + +
    Copyright © 2005-2015 Ion Gaztanaga

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/interprocess/operator___idp40283280.html b/doc/html/boost/interprocess/operator___idp40283280.html new file mode 100644 index 0000000000..bbb4239738 --- /dev/null +++ b/doc/html/boost/interprocess/operator___idp40283280.html @@ -0,0 +1,57 @@ + + + + +Function template operator!= + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Function template operator!=

    +

    boost::interprocess::operator!=

    +
    +

    Synopsis

    +
    // In header: <boost/interprocess/smart_ptr/intrusive_ptr.hpp>
+
+
+template<typename T, typename U, typename VP> 
+  bool operator!=(intrusive_ptr< T, VP > const & a, 
+                  intrusive_ptr< U, VP > const & b);
    +
    +

    Description

    +

    Returns a.get() != b.get(). Does not throw

    +
    +
    + + + +
    Copyright © 2005-2015 Ion Gaztanaga

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/interprocess/operator___idp40288496.html b/doc/html/boost/interprocess/operator___idp40288496.html new file mode 100644 index 0000000000..a947f153ba --- /dev/null +++ b/doc/html/boost/interprocess/operator___idp40288496.html @@ -0,0 +1,57 @@ + + + + +Function template operator== + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Function template operator==

    +

    boost::interprocess::operator==

    +
    +

    Synopsis

    +
    // In header: <boost/interprocess/smart_ptr/intrusive_ptr.hpp>
+
+
+template<typename T, typename VP> 
+  bool operator==(intrusive_ptr< T, VP > const & a, 
+                  const typename intrusive_ptr< T, VP >::pointer & b);
    +
    +

    Description

    +

    Returns a.get() == b. Does not throw

    +
    +
    + + + +
    Copyright © 2005-2015 Ion Gaztanaga

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/interprocess/operator___idp40293296.html b/doc/html/boost/interprocess/operator___idp40293296.html new file mode 100644 index 0000000000..aa5fda1576 --- /dev/null +++ b/doc/html/boost/interprocess/operator___idp40293296.html @@ -0,0 +1,57 @@ + + + + +Function template operator!= + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Function template operator!=

    +

    boost::interprocess::operator!=

    +
    +

    Synopsis

    +
    // In header: <boost/interprocess/smart_ptr/intrusive_ptr.hpp>
+
+
+template<typename T, typename VP> 
+  bool operator!=(intrusive_ptr< T, VP > const & a, 
+                  const typename intrusive_ptr< T, VP >::pointer & b);
    +
    +

    Description

    +

    Returns a.get() != b. Does not throw

    +
    +
    + + + +
    Copyright © 2005-2015 Ion Gaztanaga

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/interprocess/operator___idp40298096.html b/doc/html/boost/interprocess/operator___idp40298096.html new file mode 100644 index 0000000000..8ce2513440 --- /dev/null +++ b/doc/html/boost/interprocess/operator___idp40298096.html @@ -0,0 +1,57 @@ + + + + +Function template operator== + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Function template operator==

    +

    boost::interprocess::operator==

    +
    +

    Synopsis

    +
    // In header: <boost/interprocess/smart_ptr/intrusive_ptr.hpp>
+
+
+template<typename T, typename VP> 
+  bool operator==(const typename intrusive_ptr< T, VP >::pointer & a, 
+                  intrusive_ptr< T, VP > const & b);
    +
    +

    Description

    +

    Returns a == b.get(). Does not throw

    +
    +
    + + + +
    Copyright © 2005-2015 Ion Gaztanaga

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/interprocess/operator___idp40302896.html b/doc/html/boost/interprocess/operator___idp40302896.html new file mode 100644 index 0000000000..30b4f643c7 --- /dev/null +++ b/doc/html/boost/interprocess/operator___idp40302896.html @@ -0,0 +1,57 @@ + + + + +Function template operator!= + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Function template operator!=

    +

    boost::interprocess::operator!=

    +
    +

    Synopsis

    +
    // In header: <boost/interprocess/smart_ptr/intrusive_ptr.hpp>
+
+
+template<typename T, typename VP> 
+  bool operator!=(const typename intrusive_ptr< T, VP >::pointer & a, 
+                  intrusive_ptr< T, VP > const & b);
    +
    +

    Description

    +

    Returns a != b.get(). Does not throw

    +
    +
    + + + +
    Copyright © 2005-2015 Ion Gaztanaga

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/interprocess/operator___idp54401248.html b/doc/html/boost/interprocess/operator___idp54401248.html deleted file mode 100644 index f1629810ce..0000000000 --- a/doc/html/boost/interprocess/operator___idp54401248.html +++ /dev/null @@ -1,58 +0,0 @@ - - - - -Function template operator== - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Function template operator==

    -

    boost::interprocess::operator==

    -
    -

    Synopsis

    -
    // In header: <boost/interprocess/allocators/adaptive_pool.hpp>
-
-
-template<typename T, typename S, std::size_t NodesPerBlock, std::size_t F, 
-         unsigned char OP> 
-  bool operator==(const adaptive_pool< T, S, NodesPerBlock, F, OP > & alloc1, 
-                  const adaptive_pool< T, S, NodesPerBlock, F, OP > & alloc2);
    -
    -

    Description

    -

    Equality test for same type of adaptive_pool

    -
    -
    - - - -
    Copyright © 2005-2015 Ion Gaztanaga

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/interprocess/operator___idp54409520.html b/doc/html/boost/interprocess/operator___idp54409520.html deleted file mode 100644 index 1e0f0b88f3..0000000000 --- a/doc/html/boost/interprocess/operator___idp54409520.html +++ /dev/null @@ -1,58 +0,0 @@ - - - - -Function template operator!= - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Function template operator!=

    -

    boost::interprocess::operator!=

    -
    -

    Synopsis

    -
    // In header: <boost/interprocess/allocators/adaptive_pool.hpp>
-
-
-template<typename T, typename S, std::size_t NodesPerBlock, std::size_t F, 
-         unsigned char OP> 
-  bool operator!=(const adaptive_pool< T, S, NodesPerBlock, F, OP > & alloc1, 
-                  const adaptive_pool< T, S, NodesPerBlock, F, OP > & alloc2);
    -
    -

    Description

    -

    Inequality test for same type of adaptive_pool

    -
    -
    - - - -
    Copyright © 2005-2015 Ion Gaztanaga

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/interprocess/operator___idp54489968.html b/doc/html/boost/interprocess/operator___idp54489968.html deleted file mode 100644 index 6002fa00ae..0000000000 --- a/doc/html/boost/interprocess/operator___idp54489968.html +++ /dev/null @@ -1,57 +0,0 @@ - - - - -Function template operator== - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Function template operator==

    -

    boost::interprocess::operator==

    -
    -

    Synopsis

    -
    // In header: <boost/interprocess/allocators/allocator.hpp>
-
-
-template<typename T, typename SegmentManager> 
-  bool operator==(const allocator< T, SegmentManager > & alloc1, 
-                  const allocator< T, SegmentManager > & alloc2);
    -
    -

    Description

    -

    Equality test for same type of allocator

    -
    -
    - - - -
    Copyright © 2005-2015 Ion Gaztanaga

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/interprocess/operator___idp54494944.html b/doc/html/boost/interprocess/operator___idp54494944.html deleted file mode 100644 index 72e38e0b2c..0000000000 --- a/doc/html/boost/interprocess/operator___idp54494944.html +++ /dev/null @@ -1,57 +0,0 @@ - - - - -Function template operator!= - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Function template operator!=

    -

    boost::interprocess::operator!=

    -
    -

    Synopsis

    -
    // In header: <boost/interprocess/allocators/allocator.hpp>
-
-
-template<typename T, typename SegmentManager> 
-  bool operator!=(const allocator< T, SegmentManager > & alloc1, 
-                  const allocator< T, SegmentManager > & alloc2);
    -
    -

    Description

    -

    Inequality test for same type of allocator

    -
    -
    - - - -
    Copyright © 2005-2015 Ion Gaztanaga

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/interprocess/operator___idp54596912.html b/doc/html/boost/interprocess/operator___idp54596912.html deleted file mode 100644 index 1651e6624e..0000000000 --- a/doc/html/boost/interprocess/operator___idp54596912.html +++ /dev/null @@ -1,58 +0,0 @@ - - - - -Function template operator== - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Function template operator==

    -

    boost::interprocess::operator==

    -
    -

    Synopsis

    -
    // In header: <boost/interprocess/allocators/cached_adaptive_pool.hpp>
-
-
-template<typename T, typename S, std::size_t NodesPerBlock, std::size_t F, 
-         std::size_t OP> 
-  bool operator==(const cached_adaptive_pool< T, S, NodesPerBlock, F, OP > & alloc1, 
-                  const cached_adaptive_pool< T, S, NodesPerBlock, F, OP > & alloc2);
    -
    -

    Description

    -

    Equality test for same type of cached_adaptive_pool

    -
    -
    - - - -
    Copyright © 2005-2015 Ion Gaztanaga

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/interprocess/operator___idp54605200.html b/doc/html/boost/interprocess/operator___idp54605200.html deleted file mode 100644 index c620f6bc75..0000000000 --- a/doc/html/boost/interprocess/operator___idp54605200.html +++ /dev/null @@ -1,58 +0,0 @@ - - - - -Function template operator!= - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Function template operator!=

    -

    boost::interprocess::operator!=

    -
    -

    Synopsis

    -
    // In header: <boost/interprocess/allocators/cached_adaptive_pool.hpp>
-
-
-template<typename T, typename S, std::size_t NodesPerBlock, std::size_t F, 
-         std::size_t OP> 
-  bool operator!=(const cached_adaptive_pool< T, S, NodesPerBlock, F, OP > & alloc1, 
-                  const cached_adaptive_pool< T, S, NodesPerBlock, F, OP > & alloc2);
    -
    -

    Description

    -

    Inequality test for same type of cached_adaptive_pool

    -
    -
    - - - -
    Copyright © 2005-2015 Ion Gaztanaga

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/interprocess/operator___idp54704144.html b/doc/html/boost/interprocess/operator___idp54704144.html deleted file mode 100644 index 7477e065cb..0000000000 --- a/doc/html/boost/interprocess/operator___idp54704144.html +++ /dev/null @@ -1,57 +0,0 @@ - - - - -Function template operator== - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Function template operator==

    -

    boost::interprocess::operator==

    -
    -

    Synopsis

    -
    // In header: <boost/interprocess/allocators/cached_node_allocator.hpp>
-
-
-template<typename T, typename S, std::size_t NPC> 
-  bool operator==(const cached_node_allocator< T, S, NPC > & alloc1, 
-                  const cached_node_allocator< T, S, NPC > & alloc2);
    -
    -

    Description

    -

    Equality test for same type of cached_node_allocator

    -
    -
    - - - -
    Copyright © 2005-2015 Ion Gaztanaga

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/interprocess/operator___idp54710704.html b/doc/html/boost/interprocess/operator___idp54710704.html deleted file mode 100644 index 845bdb9ed2..0000000000 --- a/doc/html/boost/interprocess/operator___idp54710704.html +++ /dev/null @@ -1,57 +0,0 @@ - - - - -Function template operator!= - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Function template operator!=

    -

    boost::interprocess::operator!=

    -
    -

    Synopsis

    -
    // In header: <boost/interprocess/allocators/cached_node_allocator.hpp>
-
-
-template<typename T, typename S, std::size_t NPC> 
-  bool operator!=(const cached_node_allocator< T, S, NPC > & alloc1, 
-                  const cached_node_allocator< T, S, NPC > & alloc2);
    -
    -

    Description

    -

    Inequality test for same type of cached_node_allocator

    -
    -
    - - - -
    Copyright © 2005-2015 Ion Gaztanaga

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/interprocess/operator___idp54804064.html b/doc/html/boost/interprocess/operator___idp54804064.html deleted file mode 100644 index 5ded591928..0000000000 --- a/doc/html/boost/interprocess/operator___idp54804064.html +++ /dev/null @@ -1,57 +0,0 @@ - - - - -Function template operator== - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Function template operator==

    -

    boost::interprocess::operator==

    -
    -

    Synopsis

    -
    // In header: <boost/interprocess/allocators/node_allocator.hpp>
-
-
-template<typename T, typename S, std::size_t NPC> 
-  bool operator==(const node_allocator< T, S, NPC > & alloc1, 
-                  const node_allocator< T, S, NPC > & alloc2);
    -
    -

    Description

    -

    Equality test for same type of node_allocator

    -
    -
    - - - -
    Copyright © 2005-2015 Ion Gaztanaga

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/interprocess/operator___idp54810608.html b/doc/html/boost/interprocess/operator___idp54810608.html deleted file mode 100644 index 641a5b6235..0000000000 --- a/doc/html/boost/interprocess/operator___idp54810608.html +++ /dev/null @@ -1,57 +0,0 @@ - - - - -Function template operator!= - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Function template operator!=

    -

    boost::interprocess::operator!=

    -
    -

    Synopsis

    -
    // In header: <boost/interprocess/allocators/node_allocator.hpp>
-
-
-template<typename T, typename S, std::size_t NPC> 
-  bool operator!=(const node_allocator< T, S, NPC > & alloc1, 
-                  const node_allocator< T, S, NPC > & alloc2);
    -
    -

    Description

    -

    Inequality test for same type of node_allocator

    -
    -
    - - - -
    Copyright © 2005-2015 Ion Gaztanaga

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/interprocess/operator___idp54910016.html b/doc/html/boost/interprocess/operator___idp54910016.html deleted file mode 100644 index ceb22c73a0..0000000000 --- a/doc/html/boost/interprocess/operator___idp54910016.html +++ /dev/null @@ -1,58 +0,0 @@ - - - - -Function template operator== - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Function template operator==

    -

    boost::interprocess::operator==

    -
    -

    Synopsis

    -
    // In header: <boost/interprocess/allocators/private_adaptive_pool.hpp>
-
-
-template<typename T, typename S, std::size_t NodesPerBlock, std::size_t F, 
-         unsigned char OP> 
-  bool operator==(const private_adaptive_pool< T, S, NodesPerBlock, F, OP > & alloc1, 
-                  const private_adaptive_pool< T, S, NodesPerBlock, F, OP > & alloc2);
    -
    -

    Description

    -

    Equality test for same type of private_adaptive_pool

    -
    -
    - - - -
    Copyright © 2005-2015 Ion Gaztanaga

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/interprocess/operator___idp54918304.html b/doc/html/boost/interprocess/operator___idp54918304.html deleted file mode 100644 index fb509876f1..0000000000 --- a/doc/html/boost/interprocess/operator___idp54918304.html +++ /dev/null @@ -1,58 +0,0 @@ - - - - -Function template operator!= - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Function template operator!=

    -

    boost::interprocess::operator!=

    -
    -

    Synopsis

    -
    // In header: <boost/interprocess/allocators/private_adaptive_pool.hpp>
-
-
-template<typename T, typename S, std::size_t NodesPerBlock, std::size_t F, 
-         unsigned char OP> 
-  bool operator!=(const private_adaptive_pool< T, S, NodesPerBlock, F, OP > & alloc1, 
-                  const private_adaptive_pool< T, S, NodesPerBlock, F, OP > & alloc2);
    -
    -

    Description

    -

    Inequality test for same type of private_adaptive_pool

    -
    -
    - - - -
    Copyright © 2005-2015 Ion Gaztanaga

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/interprocess/operator___idp55015136.html b/doc/html/boost/interprocess/operator___idp55015136.html deleted file mode 100644 index 9fab0afeea..0000000000 --- a/doc/html/boost/interprocess/operator___idp55015136.html +++ /dev/null @@ -1,58 +0,0 @@ - - - - -Function template operator== - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Function template operator==

    -

    boost::interprocess::operator==

    -
    -

    Synopsis

    -
    // In header: <boost/interprocess/allocators/private_node_allocator.hpp>
-
-
-template<typename T, typename S, std::size_t NodesPerBlock, std::size_t F, 
-         unsigned char OP> 
-  bool operator==(const private_node_allocator< T, S, NodesPerBlock, F, OP > & alloc1, 
-                  const private_node_allocator< T, S, NodesPerBlock, F, OP > & alloc2);
    -
    -

    Description

    -

    Equality test for same type of private_node_allocator

    -
    -
    - - - -
    Copyright © 2005-2015 Ion Gaztanaga

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/interprocess/operator___idp55023424.html b/doc/html/boost/interprocess/operator___idp55023424.html deleted file mode 100644 index 2eb5448be8..0000000000 --- a/doc/html/boost/interprocess/operator___idp55023424.html +++ /dev/null @@ -1,58 +0,0 @@ - - - - -Function template operator!= - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Function template operator!=

    -

    boost::interprocess::operator!=

    -
    -

    Synopsis

    -
    // In header: <boost/interprocess/allocators/private_node_allocator.hpp>
-
-
-template<typename T, typename S, std::size_t NodesPerBlock, std::size_t F, 
-         unsigned char OP> 
-  bool operator!=(const private_node_allocator< T, S, NodesPerBlock, F, OP > & alloc1, 
-                  const private_node_allocator< T, S, NodesPerBlock, F, OP > & alloc2);
    -
    -

    Description

    -

    Inequality test for same type of private_node_allocator

    -
    -
    - - - -
    Copyright © 2005-2015 Ion Gaztanaga

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/interprocess/operator___idp56174768.html b/doc/html/boost/interprocess/operator___idp56174768.html deleted file mode 100644 index 7ff0425b46..0000000000 --- a/doc/html/boost/interprocess/operator___idp56174768.html +++ /dev/null @@ -1,57 +0,0 @@ - - - - -Function template operator== - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Function template operator==

    -

    boost::interprocess::operator==

    -
    -

    Synopsis

    -
    // In header: <boost/interprocess/smart_ptr/intrusive_ptr.hpp>
-
-
-template<typename T, typename U, typename VP> 
-  bool operator==(intrusive_ptr< T, VP > const & a, 
-                  intrusive_ptr< U, VP > const & b);
    -
    -

    Description

    -

    Returns a.get() == b.get(). Does not throw

    -
    -
    - - - -
    Copyright © 2005-2015 Ion Gaztanaga

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/interprocess/operator___idp56179984.html b/doc/html/boost/interprocess/operator___idp56179984.html deleted file mode 100644 index e030568a55..0000000000 --- a/doc/html/boost/interprocess/operator___idp56179984.html +++ /dev/null @@ -1,57 +0,0 @@ - - - - -Function template operator!= - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Function template operator!=

    -

    boost::interprocess::operator!=

    -
    -

    Synopsis

    -
    // In header: <boost/interprocess/smart_ptr/intrusive_ptr.hpp>
-
-
-template<typename T, typename U, typename VP> 
-  bool operator!=(intrusive_ptr< T, VP > const & a, 
-                  intrusive_ptr< U, VP > const & b);
    -
    -

    Description

    -

    Returns a.get() != b.get(). Does not throw

    -
    -
    - - - -
    Copyright © 2005-2015 Ion Gaztanaga

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/interprocess/operator___idp56185200.html b/doc/html/boost/interprocess/operator___idp56185200.html deleted file mode 100644 index b6f4f41435..0000000000 --- a/doc/html/boost/interprocess/operator___idp56185200.html +++ /dev/null @@ -1,57 +0,0 @@ - - - - -Function template operator== - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Function template operator==

    -

    boost::interprocess::operator==

    -
    -

    Synopsis

    -
    // In header: <boost/interprocess/smart_ptr/intrusive_ptr.hpp>
-
-
-template<typename T, typename VP> 
-  bool operator==(intrusive_ptr< T, VP > const & a, 
-                  const typename intrusive_ptr< T, VP >::pointer & b);
    -
    -

    Description

    -

    Returns a.get() == b. Does not throw

    -
    -
    - - - -
    Copyright © 2005-2015 Ion Gaztanaga

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/interprocess/operator___idp56190000.html b/doc/html/boost/interprocess/operator___idp56190000.html deleted file mode 100644 index b6dbd000b6..0000000000 --- a/doc/html/boost/interprocess/operator___idp56190000.html +++ /dev/null @@ -1,57 +0,0 @@ - - - - -Function template operator!= - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Function template operator!=

    -

    boost::interprocess::operator!=

    -
    -

    Synopsis

    -
    // In header: <boost/interprocess/smart_ptr/intrusive_ptr.hpp>
-
-
-template<typename T, typename VP> 
-  bool operator!=(intrusive_ptr< T, VP > const & a, 
-                  const typename intrusive_ptr< T, VP >::pointer & b);
    -
    -

    Description

    -

    Returns a.get() != b. Does not throw

    -
    -
    - - - -
    Copyright © 2005-2015 Ion Gaztanaga

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/interprocess/operator___idp56194800.html b/doc/html/boost/interprocess/operator___idp56194800.html deleted file mode 100644 index 08383b3afe..0000000000 --- a/doc/html/boost/interprocess/operator___idp56194800.html +++ /dev/null @@ -1,57 +0,0 @@ - - - - -Function template operator== - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Function template operator==

    -

    boost::interprocess::operator==

    -
    -

    Synopsis

    -
    // In header: <boost/interprocess/smart_ptr/intrusive_ptr.hpp>
-
-
-template<typename T, typename VP> 
-  bool operator==(const typename intrusive_ptr< T, VP >::pointer & a, 
-                  intrusive_ptr< T, VP > const & b);
    -
    -

    Description

    -

    Returns a == b.get(). Does not throw

    -
    -
    - - - -
    Copyright © 2005-2015 Ion Gaztanaga

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/interprocess/operator___idp56199600.html b/doc/html/boost/interprocess/operator___idp56199600.html deleted file mode 100644 index 2f44a50d02..0000000000 --- a/doc/html/boost/interprocess/operator___idp56199600.html +++ /dev/null @@ -1,57 +0,0 @@ - - - - -Function template operator!= - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Function template operator!=

    -

    boost::interprocess::operator!=

    -
    -

    Synopsis

    -
    // In header: <boost/interprocess/smart_ptr/intrusive_ptr.hpp>
-
-
-template<typename T, typename VP> 
-  bool operator!=(const typename intrusive_ptr< T, VP >::pointer & a, 
-                  intrusive_ptr< T, VP > const & b);
    -
    -

    Description

    -

    Returns a != b.get(). Does not throw

    -
    -
    - - - -
    Copyright © 2005-2015 Ion Gaztanaga

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/interprocess/operator_idp39971568.html b/doc/html/boost/interprocess/operator_idp39971568.html new file mode 100644 index 0000000000..427c15eebe --- /dev/null +++ b/doc/html/boost/interprocess/operator_idp39971568.html @@ -0,0 +1,59 @@ + + + + +Function template operator<< + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Function template operator<<

    +

    boost::interprocess::operator<<

    +
    +

    Synopsis

    +
    // In header: <boost/interprocess/offset_ptr.hpp>
+
+
+template<typename E, typename T, typename W, typename X, typename Y, 
+         std::size_t Z> 
+  std::basic_ostream< E, T > & 
+  operator<<(std::basic_ostream< E, T > & os, 
+             offset_ptr< W, X, Y, Z > const & p);
    +
    +

    Description

    +

    operator<< for offset ptr

    +
    +
    + + + +
    Copyright © 2005-2015 Ion Gaztanaga

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/interprocess/operator_idp39978480.html b/doc/html/boost/interprocess/operator_idp39978480.html new file mode 100644 index 0000000000..4eb8fad0de --- /dev/null +++ b/doc/html/boost/interprocess/operator_idp39978480.html @@ -0,0 +1,58 @@ + + + + +Function template operator>> + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Function template operator>>

    +

    boost::interprocess::operator>>

    +
    +

    Synopsis

    +
    // In header: <boost/interprocess/offset_ptr.hpp>
+
+
+template<typename E, typename T, typename W, typename X, typename Y, 
+         std::size_t Z> 
+  std::basic_istream< E, T > & 
+  operator>>(std::basic_istream< E, T > & is, offset_ptr< W, X, Y, Z > & p);
    +
    +

    Description

    +

    operator>> for offset ptr

    +
    +
    + + + +
    Copyright © 2005-2015 Ion Gaztanaga

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/interprocess/operator_idp40307696.html b/doc/html/boost/interprocess/operator_idp40307696.html new file mode 100644 index 0000000000..6dd1f7cab7 --- /dev/null +++ b/doc/html/boost/interprocess/operator_idp40307696.html @@ -0,0 +1,57 @@ + + + + +Function template operator< + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Function template operator<

    +

    boost::interprocess::operator<

    +
    +

    Synopsis

    +
    // In header: <boost/interprocess/smart_ptr/intrusive_ptr.hpp>
+
+
+template<typename T, typename VP> 
+  bool operator<(intrusive_ptr< T, VP > const & a, 
+                 intrusive_ptr< T, VP > const & b);
    +
    +

    Description

    +

    Returns a.get() < b.get(). Does not throw

    +
    +
    + + + +
    Copyright © 2005-2015 Ion Gaztanaga

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/interprocess/operator_idp55877088.html b/doc/html/boost/interprocess/operator_idp55877088.html deleted file mode 100644 index f473e4d90b..0000000000 --- a/doc/html/boost/interprocess/operator_idp55877088.html +++ /dev/null @@ -1,59 +0,0 @@ - - - - -Function template operator<< - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Function template operator<<

    -

    boost::interprocess::operator<<

    -
    -

    Synopsis

    -
    // In header: <boost/interprocess/offset_ptr.hpp>
-
-
-template<typename E, typename T, typename W, typename X, typename Y, 
-         std::size_t Z> 
-  std::basic_ostream< E, T > & 
-  operator<<(std::basic_ostream< E, T > & os, 
-             offset_ptr< W, X, Y, Z > const & p);
    -
    -

    Description

    -

    operator<< for offset ptr

    -
    -
    - - - -
    Copyright © 2005-2015 Ion Gaztanaga

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/interprocess/operator_idp55884000.html b/doc/html/boost/interprocess/operator_idp55884000.html deleted file mode 100644 index 7cf4b8d880..0000000000 --- a/doc/html/boost/interprocess/operator_idp55884000.html +++ /dev/null @@ -1,58 +0,0 @@ - - - - -Function template operator>> - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Function template operator>>

    -

    boost::interprocess::operator>>

    -
    -

    Synopsis

    -
    // In header: <boost/interprocess/offset_ptr.hpp>
-
-
-template<typename E, typename T, typename W, typename X, typename Y, 
-         std::size_t Z> 
-  std::basic_istream< E, T > & 
-  operator>>(std::basic_istream< E, T > & is, offset_ptr< W, X, Y, Z > & p);
    -
    -

    Description

    -

    operator>> for offset ptr

    -
    -
    - - - -
    Copyright © 2005-2015 Ion Gaztanaga

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/interprocess/operator_idp56204400.html b/doc/html/boost/interprocess/operator_idp56204400.html deleted file mode 100644 index 8624345409..0000000000 --- a/doc/html/boost/interprocess/operator_idp56204400.html +++ /dev/null @@ -1,57 +0,0 @@ - - - - -Function template operator< - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Function template operator<

    -

    boost::interprocess::operator<

    -
    -

    Synopsis

    -
    // In header: <boost/interprocess/smart_ptr/intrusive_ptr.hpp>
-
-
-template<typename T, typename VP> 
-  bool operator<(intrusive_ptr< T, VP > const & a, 
-                 intrusive_ptr< T, VP > const & b);
    -
    -

    Description

    -

    Returns a.get() < b.get(). Does not throw

    -
    -
    - - - -
    Copyright © 2005-2015 Ion Gaztanaga

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/interprocess/permissions.html b/doc/html/boost/interprocess/permissions.html index c9d735cbe5..ab5bde4e9b 100644 --- a/doc/html/boost/interprocess/permissions.html +++ b/doc/html/boost/interprocess/permissions.html @@ -7,7 +7,7 @@ - + @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -36,14 +36,14 @@ class permissions { public: // construct/copy/destruct - permissions(os_permissions_type); - permissions(); + permissions(os_permissions_type); + permissions(); - // public member functions - void set_default(); - void set_unrestricted(); - void set_permissions(os_permissions_type); - os_permissions_type get_permissions() const; + // public member functions + void set_default(); + void set_unrestricted(); + void set_permissions(os_permissions_type); + os_permissions_type get_permissions() const; };

    Description

    @@ -55,33 +55,33 @@ construct/copy/destruct
    1. -
      permissions(os_permissions_type type);
      +
      permissions(os_permissions_type type);

      Constructs a permissions object from a user provided os-dependent permissions.

    2. -
      permissions();
      +
      permissions();

      Constructs a default permissions object: A null security attributes pointer for windows or 0644 for UNIX.

    -permissions public member functions

    +permissions public member functions
    1. -
      void set_default();
      +
      void set_default();

      Sets permissions to default values: A null security attributes pointer for windows or 0644 for UNIX.

    2. -
      void set_unrestricted();
      +
      void set_unrestricted();

      Sets permissions to unrestricted access: A null DACL for windows or 0666 for UNIX.

    3. -
      void set_permissions(os_permissions_type perm);
      +
      void set_permissions(os_permissions_type perm);

      Sets permissions from a user provided os-dependent permissions.

    4. -
      os_permissions_type get_permissions() const;
      +
      os_permissions_type get_permissions() const;

      Returns stored os-dependent permissions

    @@ -98,7 +98,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/interprocess/private_adaptive_pool.html b/doc/html/boost/interprocess/private_adaptive_pool.html index 838d6539c3..ffb97b4222 100644 --- a/doc/html/boost/interprocess/private_adaptive_pool.html +++ b/doc/html/boost/interprocess/private_adaptive_pool.html @@ -7,7 +7,7 @@ - + @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -55,41 +55,41 @@ }; // construct/copy/destruct - private_adaptive_pool(segment_manager *); - private_adaptive_pool(const private_adaptive_pool &); + private_adaptive_pool(segment_manager *); + private_adaptive_pool(const private_adaptive_pool &); template<typename T2> - private_adaptive_pool(const private_adaptive_pool< T2, SegmentManager, NodesPerBlock, MaxFreeBlocks, OverheadPercent > &); + private_adaptive_pool(const private_adaptive_pool< T2, SegmentManager, NodesPerBlock, MaxFreeBlocks, OverheadPercent > &); template<typename T2, typename SegmentManager2, std::size_t N2, std::size_t F2, unsigned char OP2> private_adaptive_pool & - operator=(const private_adaptive_pool< T2, SegmentManager2, N2, F2 > &); - private_adaptive_pool & operator=(const private_adaptive_pool &); - ~private_adaptive_pool(); + operator=(const private_adaptive_pool< T2, SegmentManager2, N2, F2 > &); + private_adaptive_pool & operator=(const private_adaptive_pool &); + ~private_adaptive_pool(); - // public member functions - node_pool_t * get_node_pool() const; - segment_manager * get_segment_manager() const; - size_type max_size() const; - pointer allocate(size_type, cvoid_pointer = 0); - void deallocate(const pointer &, size_type); - void deallocate_free_blocks(); - pointer address(reference) const; - const_pointer address(const_reference) const; - void construct(const pointer &, const_reference); - void destroy(const pointer &); - size_type size(const pointer &) const; - pointer allocation_command(boost::interprocess::allocation_type, size_type, + // public member functions + node_pool_t * get_node_pool() const; + segment_manager * get_segment_manager() const; + size_type max_size() const; + pointer allocate(size_type, cvoid_pointer = 0); + void deallocate(const pointer &, size_type); + void deallocate_free_blocks(); + pointer address(reference) const; + const_pointer address(const_reference) const; + void construct(const pointer &, const_reference); + void destroy(const pointer &); + size_type size(const pointer &) const; + pointer allocation_command(boost::interprocess::allocation_type, size_type, size_type &, pointer &); - void allocate_many(size_type, size_type, multiallocation_chain &); - void allocate_many(const size_type *, size_type, multiallocation_chain &); - void deallocate_many(multiallocation_chain &); - pointer allocate_one(); - void allocate_individual(size_type, multiallocation_chain &); - void deallocate_one(const pointer &); - void deallocate_individual(multiallocation_chain &); + void allocate_many(size_type, size_type, multiallocation_chain &); + void allocate_many(const size_type *, size_type, multiallocation_chain &); + void deallocate_many(multiallocation_chain &); + pointer allocate_one(); + void allocate_individual(size_type, multiallocation_chain &); + void deallocate_one(const pointer &); + void deallocate_individual(multiallocation_chain &); - // friend functions - friend void swap(self_t &, self_t &); + // friend functions + friend void swap(self_t &, self_t &); };

    Description

    @@ -103,125 +103,125 @@ construct/copy/destruct
    1. -
      private_adaptive_pool(segment_manager * segment_mngr);
      +
      private_adaptive_pool(segment_manager * segment_mngr);

      Constructor from a segment manager. If not present, constructs a node pool. Increments the reference count of the associated node pool. Can throw boost::interprocess::bad_alloc

    2. -
      private_adaptive_pool(const private_adaptive_pool & other);
      +
      private_adaptive_pool(const private_adaptive_pool & other);

      Copy constructor from other private_adaptive_pool. Increments the reference count of the associated node pool. Never throws 

    3. template<typename T2> 
-  private_adaptive_pool(const private_adaptive_pool< T2, SegmentManager, NodesPerBlock, MaxFreeBlocks, OverheadPercent > & other);
      + private_adaptive_pool(const private_adaptive_pool< T2, SegmentManager, NodesPerBlock, MaxFreeBlocks, OverheadPercent > & other);

      Copy constructor from related private_adaptive_pool. If not present, constructs a node pool. Increments the reference count of the associated node pool. Can throw boost::interprocess::bad_alloc 

    4. template<typename T2, typename SegmentManager2, std::size_t N2, 
          std::size_t F2, unsigned char OP2> 
   private_adaptive_pool & 
-  operator=(const private_adaptive_pool< T2, SegmentManager2, N2, F2 > &);
      + operator=(const private_adaptive_pool< T2, SegmentManager2, N2, F2 > &);

      Not assignable from related private_adaptive_pool

    5. -
      private_adaptive_pool & operator=(const private_adaptive_pool &);
      +
      private_adaptive_pool & operator=(const private_adaptive_pool &);

      Not assignable from other private_adaptive_pool

    6. -
      ~private_adaptive_pool();
      +
      ~private_adaptive_pool();

      Destructor, removes node_pool_t from memory if its reference count reaches to zero. Never throws

    -private_adaptive_pool public member functions

    +private_adaptive_pool public member functions
    1. -
      node_pool_t * get_node_pool() const;
      +
      node_pool_t * get_node_pool() const;

      Returns a pointer to the node pool. Never throws

    2. -
      segment_manager * get_segment_manager() const;
      +
      segment_manager * get_segment_manager() const;

      Returns the segment manager. Never throws

    3. -
      size_type max_size() const;
      +
      size_type max_size() const;

      Returns the number of elements that could be allocated. Never throws

    4. -
      pointer allocate(size_type count, cvoid_pointer hint = 0);
      +
      pointer allocate(size_type count, cvoid_pointer hint = 0);

      Allocate memory for an array of count elements. Throws boost::interprocess::bad_alloc if there is no enough memory

    5. -
      void deallocate(const pointer & ptr, size_type count);
      +
      void deallocate(const pointer & ptr, size_type count);

      Deallocate allocated memory. Never throws

    6. -
      void deallocate_free_blocks();
      +
      void deallocate_free_blocks();

      Deallocates all free blocks of the pool

    7. -
      pointer address(reference value) const;
      +
      pointer address(reference value) const;

      Returns address of mutable object. Never throws

    8. -
      const_pointer address(const_reference value) const;
      +
      const_pointer address(const_reference value) const;

      Returns address of non mutable object. Never throws

    9. -
      void construct(const pointer & ptr, const_reference v);
      +
      void construct(const pointer & ptr, const_reference v);

      Copy construct an object. Throws if T's copy constructor throws

    10. -
      void destroy(const pointer & ptr);
      +
      void destroy(const pointer & ptr);

      Destroys object. Throws if object's destructor throws

    11. -
      size_type size(const pointer & p) const;
      +
      size_type size(const pointer & p) const;

      Returns maximum the number of objects the previously allocated memory pointed by p can hold. This size only works for memory allocated with allocate, allocation_command and allocate_many.

      12. -
    12. pointer allocation_command(boost::interprocess::allocation_type command, 
+
    13. pointer allocation_command(boost::interprocess::allocation_type command, 
                            size_type limit_size, 
                            size_type & prefer_in_recvd_out_size, 
                            pointer & reuse);
      14. 
 
    14. 
-
      void allocate_many(size_type elem_size, size_type num_elements, 
+
      void allocate_many(size_type elem_size, size_type num_elements, 
                    multiallocation_chain & chain);
      
 
      Allocates many elements of size elem_size in a contiguous block of memory. The minimum number to be allocated is min_elements, the preferred and maximum number is preferred_elements. The number of actually allocated elements is will be assigned to received_size. The elements must be deallocated with deallocate(...) 
      
 
      15. 
 
    15. 
-
      void allocate_many(const size_type * elem_sizes, size_type n_elements, 
+
      void allocate_many(const size_type * elem_sizes, size_type n_elements, 
                    multiallocation_chain & chain);
      
 
      Allocates n_elements elements, each one of size elem_sizes[i]in a contiguous block of memory. The elements must be deallocated 
      
 
      16. 
 
    16. 
-
      void deallocate_many(multiallocation_chain & chain);
      
+
      void deallocate_many(multiallocation_chain & chain);
      
 
      Allocates many elements of size elem_size in a contiguous block of memory. The minimum number to be allocated is min_elements, the preferred and maximum number is preferred_elements. The number of actually allocated elements is will be assigned to received_size. The elements must be deallocated with deallocate(...) 
      
 
      17. 
 
    17. 
-
      pointer allocate_one();
      
+
      pointer allocate_one();
      
 
      Allocates just one object. Memory allocated with this function must be deallocated only with deallocate_one(). Throws boost::interprocess::bad_alloc if there is no enough memory 
      
 
      18. 
 
    18. 
-
      void allocate_individual(size_type num_elements, 
+
      void allocate_individual(size_type num_elements, 
                          multiallocation_chain & chain);
      
 
      Allocates many elements of size == 1 in a contiguous block of memory. The minimum number to be allocated is min_elements, the preferred and maximum number is preferred_elements. The number of actually allocated elements is will be assigned to received_size. Memory allocated with this function must be deallocated only with deallocate_one(). 
      
 
      19. 
 
    19. 
-
      void deallocate_one(const pointer & p);
      
+
      void deallocate_one(const pointer & p);
      
 
      Deallocates memory previously allocated with allocate_one(). You should never use deallocate_one to deallocate memory allocated with other functions different from allocate_one(). Never throws 
      
 
      20. 
 
    20. 
-
      void deallocate_individual(multiallocation_chain & chain);
      
+
      void deallocate_individual(multiallocation_chain & chain);
      
 
      Allocates many elements of size == 1 in a contiguous block of memory. The minimum number to be allocated is min_elements, the preferred and maximum number is preferred_elements. The number of actually allocated elements is will be assigned to received_size. Memory allocated with this function must be deallocated only with deallocate_one(). 
      
 
      21.

    -private_adaptive_pool friend functions

    +private_adaptive_pool friend functions
    1. -
      friend void swap(self_t & alloc1, self_t & alloc2);
      +
      friend void swap(self_t & alloc1, self_t & alloc2);

      Swaps allocators. Does not throw. If each allocator is placed in a different memory segment, the result is undefined.

    @@ -237,7 +237,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/interprocess/private_adaptive_pool/rebind.html b/doc/html/boost/interprocess/private_adaptive_pool/rebind.html index 0b9ee8bbd2..4f73713c72 100644 --- a/doc/html/boost/interprocess/private_adaptive_pool/rebind.html +++ b/doc/html/boost/interprocess/private_adaptive_pool/rebind.html @@ -8,7 +8,7 @@ - + @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -53,7 +53,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/interprocess/private_node_allocator.html b/doc/html/boost/interprocess/private_node_allocator.html index 37f22b8f2d..bf9ff446ec 100644 --- a/doc/html/boost/interprocess/private_node_allocator.html +++ b/doc/html/boost/interprocess/private_node_allocator.html @@ -7,7 +7,7 @@ - + @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -54,40 +54,40 @@ }; // construct/copy/destruct - private_node_allocator(segment_manager *); - private_node_allocator(const private_node_allocator &); + private_node_allocator(segment_manager *); + private_node_allocator(const private_node_allocator &); template<typename T2> - private_node_allocator(const private_node_allocator< T2, SegmentManager, NodesPerBlock > &); + private_node_allocator(const private_node_allocator< T2, SegmentManager, NodesPerBlock > &); template<typename T2, typename SegmentManager2, std::size_t N2> private_node_allocator & - operator=(const private_node_allocator< T2, SegmentManager2, N2 > &); - private_node_allocator & operator=(const private_node_allocator &); - ~private_node_allocator(); + operator=(const private_node_allocator< T2, SegmentManager2, N2 > &); + private_node_allocator & operator=(const private_node_allocator &); + ~private_node_allocator(); - // public member functions - node_pool_t * get_node_pool() const; - segment_manager * get_segment_manager() const; - size_type max_size() const; - pointer allocate(size_type, cvoid_pointer = 0); - void deallocate(const pointer &, size_type); - void deallocate_free_blocks(); - pointer address(reference) const; - const_pointer address(const_reference) const; - void construct(const pointer &, const_reference); - void destroy(const pointer &); - size_type size(const pointer &) const; - pointer allocation_command(boost::interprocess::allocation_type, size_type, + // public member functions + node_pool_t * get_node_pool() const; + segment_manager * get_segment_manager() const; + size_type max_size() const; + pointer allocate(size_type, cvoid_pointer = 0); + void deallocate(const pointer &, size_type); + void deallocate_free_blocks(); + pointer address(reference) const; + const_pointer address(const_reference) const; + void construct(const pointer &, const_reference); + void destroy(const pointer &); + size_type size(const pointer &) const; + pointer allocation_command(boost::interprocess::allocation_type, size_type, size_type &, pointer &); - void allocate_many(size_type, size_type, multiallocation_chain &); - void allocate_many(const size_type *, size_type, multiallocation_chain &); - void deallocate_many(multiallocation_chain &); - pointer allocate_one(); - void allocate_individual(size_type, multiallocation_chain &); - void deallocate_one(const pointer &); - void deallocate_individual(multiallocation_chain &); + void allocate_many(size_type, size_type, multiallocation_chain &); + void allocate_many(const size_type *, size_type, multiallocation_chain &); + void deallocate_many(multiallocation_chain &); + pointer allocate_one(); + void allocate_individual(size_type, multiallocation_chain &); + void deallocate_one(const pointer &); + void deallocate_individual(multiallocation_chain &); - // friend functions - friend void swap(self_t &, self_t &); + // friend functions + friend void swap(self_t &, self_t &); };

    Description

    @@ -99,124 +99,124 @@ construct/copy/destruct
    1. -
      private_node_allocator(segment_manager * segment_mngr);
      +
      private_node_allocator(segment_manager * segment_mngr);

      Constructor from a segment manager. If not present, constructs a node pool. Increments the reference count of the associated node pool. Can throw boost::interprocess::bad_alloc

    2. -
      private_node_allocator(const private_node_allocator & other);
      +
      private_node_allocator(const private_node_allocator & other);

      Copy constructor from other private_node_allocator. Increments the reference count of the associated node pool. Never throws 

    3. template<typename T2> 
-  private_node_allocator(const private_node_allocator< T2, SegmentManager, NodesPerBlock > & other);
      + private_node_allocator(const private_node_allocator< T2, SegmentManager, NodesPerBlock > & other);

      Copy constructor from related private_node_allocator. If not present, constructs a node pool. Increments the reference count of the associated node pool. Can throw boost::interprocess::bad_alloc 

    4. template<typename T2, typename SegmentManager2, std::size_t N2> 
   private_node_allocator & 
-  operator=(const private_node_allocator< T2, SegmentManager2, N2 > &);
      + operator=(const private_node_allocator< T2, SegmentManager2, N2 > &);

      Not assignable from related private_node_allocator

    5. -
      private_node_allocator & operator=(const private_node_allocator &);
      +
      private_node_allocator & operator=(const private_node_allocator &);

      Not assignable from other private_node_allocator

    6. -
      ~private_node_allocator();
      +
      ~private_node_allocator();

      Destructor, removes node_pool_t from memory if its reference count reaches to zero. Never throws

    -private_node_allocator public member functions

    +private_node_allocator public member functions
    1. -
      node_pool_t * get_node_pool() const;
      +
      node_pool_t * get_node_pool() const;

      Returns a pointer to the node pool. Never throws

    2. -
      segment_manager * get_segment_manager() const;
      +
      segment_manager * get_segment_manager() const;

      Returns the segment manager. Never throws

    3. -
      size_type max_size() const;
      +
      size_type max_size() const;

      Returns the number of elements that could be allocated. Never throws

    4. -
      pointer allocate(size_type count, cvoid_pointer hint = 0);
      +
      pointer allocate(size_type count, cvoid_pointer hint = 0);

      Allocate memory for an array of count elements. Throws boost::interprocess::bad_alloc if there is no enough memory

    5. -
      void deallocate(const pointer & ptr, size_type count);
      +
      void deallocate(const pointer & ptr, size_type count);

      Deallocate allocated memory. Never throws

    6. -
      void deallocate_free_blocks();
      +
      void deallocate_free_blocks();

      Deallocates all free blocks of the pool

    7. -
      pointer address(reference value) const;
      +
      pointer address(reference value) const;

      Returns address of mutable object. Never throws

    8. -
      const_pointer address(const_reference value) const;
      +
      const_pointer address(const_reference value) const;

      Returns address of non mutable object. Never throws

    9. -
      void construct(const pointer & ptr, const_reference v);
      +
      void construct(const pointer & ptr, const_reference v);

      Copy construct an object. Throws if T's copy constructor throws

    10. -
      void destroy(const pointer & ptr);
      +
      void destroy(const pointer & ptr);

      Destroys object. Throws if object's destructor throws

    11. -
      size_type size(const pointer & p) const;
      +
      size_type size(const pointer & p) const;

      Returns maximum the number of objects the previously allocated memory pointed by p can hold. This size only works for memory allocated with allocate, allocation_command and allocate_many.

      12. -
    12. pointer allocation_command(boost::interprocess::allocation_type command, 
+
    13. pointer allocation_command(boost::interprocess::allocation_type command, 
                            size_type limit_size, 
                            size_type & prefer_in_recvd_out_size, 
                            pointer & reuse);
      14. 
 
    14. 
-
      void allocate_many(size_type elem_size, size_type num_elements, 
+
      void allocate_many(size_type elem_size, size_type num_elements, 
                    multiallocation_chain & chain);
      
 
      Allocates many elements of size elem_size in a contiguous block of memory. The minimum number to be allocated is min_elements, the preferred and maximum number is preferred_elements. The number of actually allocated elements is will be assigned to received_size. The elements must be deallocated with deallocate(...) 
      
 
      15. 
 
    15. 
-
      void allocate_many(const size_type * elem_sizes, size_type n_elements, 
+
      void allocate_many(const size_type * elem_sizes, size_type n_elements, 
                    multiallocation_chain & chain);
      
 
      Allocates n_elements elements, each one of size elem_sizes[i]in a contiguous block of memory. The elements must be deallocated 
      
 
      16. 
 
    16. 
-
      void deallocate_many(multiallocation_chain & chain);
      
+
      void deallocate_many(multiallocation_chain & chain);
      
 
      Allocates many elements of size elem_size in a contiguous block of memory. The minimum number to be allocated is min_elements, the preferred and maximum number is preferred_elements. The number of actually allocated elements is will be assigned to received_size. The elements must be deallocated with deallocate(...) 
      
 
      17. 
 
    17. 
-
      pointer allocate_one();
      
+
      pointer allocate_one();
      
 
      Allocates just one object. Memory allocated with this function must be deallocated only with deallocate_one(). Throws boost::interprocess::bad_alloc if there is no enough memory 
      
 
      18. 
 
    18. 
-
      void allocate_individual(size_type num_elements, 
+
      void allocate_individual(size_type num_elements, 
                          multiallocation_chain & chain);
      
 
      Allocates many elements of size == 1 in a contiguous block of memory. The minimum number to be allocated is min_elements, the preferred and maximum number is preferred_elements. The number of actually allocated elements is will be assigned to received_size. Memory allocated with this function must be deallocated only with deallocate_one(). 
      
 
      19. 
 
    19. 
-
      void deallocate_one(const pointer & p);
      
+
      void deallocate_one(const pointer & p);
      
 
      Deallocates memory previously allocated with allocate_one(). You should never use deallocate_one to deallocate memory allocated with other functions different from allocate_one(). Never throws 
      
 
      20. 
 
    20. 
-
      void deallocate_individual(multiallocation_chain & chain);
      
+
      void deallocate_individual(multiallocation_chain & chain);
      
 
      Allocates many elements of size == 1 in a contiguous block of memory. The minimum number to be allocated is min_elements, the preferred and maximum number is preferred_elements. The number of actually allocated elements is will be assigned to received_size. Memory allocated with this function must be deallocated only with deallocate_one(). 
      
 
      21.

    -private_node_allocator friend functions

    +private_node_allocator friend functions
    1. -
      friend void swap(self_t & alloc1, self_t & alloc2);
      +
      friend void swap(self_t & alloc1, self_t & alloc2);

      Swaps allocators. Does not throw. If each allocator is placed in a different memory segment, the result is undefined.

    @@ -232,7 +232,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/interprocess/private_node_allocator/rebind.html b/doc/html/boost/interprocess/private_node_allocator/rebind.html index f16bb1faf2..452794b47e 100644 --- a/doc/html/boost/interprocess/private_node_allocator/rebind.html +++ b/doc/html/boost/interprocess/private_node_allocator/rebind.html @@ -8,7 +8,7 @@ - + @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -53,7 +53,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/interprocess/rbtree_best_fit.html b/doc/html/boost/interprocess/rbtree_best_fit.html index 61d9ee40b0..3be84c92a1 100644 --- a/doc/html/boost/interprocess/rbtree_best_fit.html +++ b/doc/html/boost/interprocess/rbtree_best_fit.html @@ -40,33 +40,33 @@ typedef VoidPointer void_pointer; // Pointer type to be used with the rest of the Interprocess framework. typedef unspecified multiallocation_chain; typedef boost::intrusive::pointer_traits< char_ptr >::difference_type difference_type; - typedef unspecified size_type; + typedef boost::container::dtl::make_unsigned< difference_type >::type size_type; // construct/copy/destruct - rbtree_best_fit(size_type, size_type); - ~rbtree_best_fit(); + rbtree_best_fit(size_type, size_type); + ~rbtree_best_fit(); - // public member functions - void * allocate(size_type); - void deallocate(void *); - size_type get_size() const; - size_type get_free_memory() const; - void zero_free_memory(); - void grow(size_type); - void shrink_to_fit(); - bool all_memory_deallocated(); - bool check_sanity(); + // public member functions + void * allocate(size_type); + void deallocate(void *); + size_type get_size() const; + size_type get_free_memory() const; + void zero_free_memory(); + void grow(size_type); + void shrink_to_fit(); + bool all_memory_deallocated(); + bool check_sanity(); template<typename T> - T * allocation_command(boost::interprocess::allocation_type, size_type, + T * allocation_command(boost::interprocess::allocation_type, size_type, size_type &, T *&); - void * raw_allocation_command(boost::interprocess::allocation_type, + void * raw_allocation_command(boost::interprocess::allocation_type, size_type, size_type &, void *&, size_type = 1); - size_type size(const void *) const; - void * allocate_aligned(size_type, size_type); + size_type size(const void *) const; + void * allocate_aligned(size_type, size_type); - // public static functions - static size_type get_min_size(size_type); + // public static functions + static size_type get_min_size(size_type); // public data members static const size_type PayloadPerAllocation; @@ -81,62 +81,62 @@ construct/copy/destruct
    1. -
      rbtree_best_fit(size_type size, size_type extra_hdr_bytes);
      +
      rbtree_best_fit(size_type size, size_type extra_hdr_bytes);

      Constructor. "size" is the total size of the managed memory segment, "extra_hdr_bytes" indicates the extra bytes beginning in the sizeof(rbtree_best_fit) offset that the allocator should not use at all.

    2. -
      ~rbtree_best_fit();
      Destructor.
      3. +
      ~rbtree_best_fit();
      Destructor.

    -rbtree_best_fit public member functions

    +rbtree_best_fit public member functions
    1. -
      void * allocate(size_type nbytes);
      Allocates bytes, returns 0 if there is not more memory.
      2. +
      void * allocate(size_type nbytes);
      Allocates bytes, returns 0 if there is not more memory.
    2. -
      void deallocate(void * addr);
      Deallocates previously allocated bytes.
      3. +
      void deallocate(void * addr);
      Deallocates previously allocated bytes.
    3. -
      size_type get_size() const;
      Returns the size of the memory segment.
      4. +
      size_type get_size() const;
      Returns the size of the memory segment.
    4. -
      size_type get_free_memory() const;
      Returns the number of free bytes of the segment.
      5. +
      size_type get_free_memory() const;
      Returns the number of free bytes of the segment.
    5. -
      void zero_free_memory();
      +
      void zero_free_memory();

      Initializes to zero all the memory that's not in use. This function is normally used for security reasons.

    6. -
      void grow(size_type extra_size);
      +
      void grow(size_type extra_size);

      Increases managed memory in extra_size bytes more

    7. -
      void shrink_to_fit();
      Decreases managed memory as much as possible.
      8. +
      void shrink_to_fit();
      Decreases managed memory as much as possible.
    8. -
      bool all_memory_deallocated();
      Returns true if all allocated memory has been deallocated.
      9. +
      bool all_memory_deallocated();
      Returns true if all allocated memory has been deallocated.
    9. -
      bool check_sanity();
      +
      bool check_sanity();

      Makes an internal sanity check and returns true if success 

    10. template<typename T> 
-  T * allocation_command(boost::interprocess::allocation_type command, 
+  T * allocation_command(boost::interprocess::allocation_type command, 
                          size_type limit_size, 
                          size_type & prefer_in_recvd_out_size, T *& reuse);
      11. -
    11. void * raw_allocation_command(boost::interprocess::allocation_type command, 
+
    12. void * raw_allocation_command(boost::interprocess::allocation_type command, 
                               size_type limit_object, 
                               size_type & prefer_in_recvd_out_size, 
                               void *& reuse_ptr, size_type sizeof_object = 1);
      13. 
 
    13. 
-
      size_type size(const void * ptr) const;
      Returns the size of the buffer previously allocated pointed by ptr. 
      14. 
+
      size_type size(const void * ptr) const;
      Returns the size of the buffer previously allocated pointed by ptr.
    14. -
      void * allocate_aligned(size_type nbytes, size_type alignment);
      +
      void * allocate_aligned(size_type nbytes, size_type alignment);

      Allocates aligned bytes, returns 0 if there is not more memory. Alignment must be power of 2

    -rbtree_best_fit public static functions

    +rbtree_best_fit public static functions
    1. -
      static size_type get_min_size(size_type extra_hdr_bytes);
      Obtains the minimum size needed by the algorithm.
    +
    static size_type get_min_size(size_type extra_hdr_bytes);
    Obtains the minimum size needed by the algorithm.
    diff --git a/doc/html/boost/interprocess/scoped_lock.html b/doc/html/boost/interprocess/scoped_lock.html index 64c4d243ef..7183706e9f 100644 --- a/doc/html/boost/interprocess/scoped_lock.html +++ b/doc/html/boost/interprocess/scoped_lock.html @@ -39,35 +39,35 @@ typedef Mutex mutex_type; // construct/copy/destruct - scoped_lock(); - explicit scoped_lock(mutex_type &); - scoped_lock(mutex_type &, defer_lock_type); - scoped_lock(mutex_type &, accept_ownership_type); - scoped_lock(mutex_type &, try_to_lock_type); - scoped_lock(mutex_type &, const boost::posix_time::ptime &); - scoped_lock(scoped_lock &&); + scoped_lock(); + explicit scoped_lock(mutex_type &); + scoped_lock(mutex_type &, defer_lock_type); + scoped_lock(mutex_type &, accept_ownership_type); + scoped_lock(mutex_type &, try_to_lock_type); + scoped_lock(mutex_type &, const boost::posix_time::ptime &); + scoped_lock(scoped_lock &&); template<typename T> - explicit scoped_lock(upgradable_lock< T > &&, unspecified = 0); + explicit scoped_lock(upgradable_lock< T > &&, unspecified = 0); template<typename T> - scoped_lock(upgradable_lock< T > &&, try_to_lock_type, unspecified = 0); + scoped_lock(upgradable_lock< T > &&, try_to_lock_type, unspecified = 0); template<typename T> - scoped_lock(upgradable_lock< T > &&, boost::posix_time::ptime &, + scoped_lock(upgradable_lock< T > &&, boost::posix_time::ptime &, unspecified = 0); template<typename T> - scoped_lock(sharable_lock< T > &&, try_to_lock_type, unspecified = 0); - scoped_lock & operator=(scoped_lock &&); - ~scoped_lock(); + scoped_lock(sharable_lock< T > &&, try_to_lock_type, unspecified = 0); + scoped_lock & operator=(scoped_lock &&); + ~scoped_lock(); - // public member functions - void lock(); - *bool try_lock(); - *bool timed_lock(const boost::posix_time::ptime &); - *void unlock(); - bool owns() const; - operator unspecified_bool_type() const; - mutex_type * mutex() const; - mutex_type * release(); - void swap(scoped_lock< mutex_type > &); + // public member functions + void lock(); + *bool try_lock(); + *bool timed_lock(const boost::posix_time::ptime &); + *void unlock(); + bool owns() const; + operator unspecified_bool_type() const; + mutex_type * mutex() const; + mutex_type * release(); + void swap(scoped_lock< mutex_type > &); };

    Description

    @@ -79,102 +79,102 @@ construct/copy/destruct
    1. -
      scoped_lock();
      +
      scoped_lock();

      Effects: Default constructs a scoped_lock. Postconditions: owns() == false and mutex() == 0.

    2. -
      explicit scoped_lock(mutex_type & m);
      +
      explicit scoped_lock(mutex_type & m);

      Effects: m.lock(). Postconditions: owns() == true and mutex() == &m. Notes: The constructor will take ownership of the mutex. If another thread already owns the mutex, this thread will block until the mutex is released. Whether or not this constructor handles recursive locking depends upon the mutex.

    3. -
      scoped_lock(mutex_type & m, defer_lock_type);
      +
      scoped_lock(mutex_type & m, defer_lock_type);

      Postconditions: owns() == false, and mutex() == &m. Notes: The constructor will not take ownership of the mutex. There is no effect required on the referenced mutex.

    4. -
      scoped_lock(mutex_type & m, accept_ownership_type);
      +
      scoped_lock(mutex_type & m, accept_ownership_type);

      Postconditions: owns() == true, and mutex() == &m. Notes: The constructor will suppose that the mutex is already locked. There is no effect required on the referenced mutex.

    5. -
      scoped_lock(mutex_type & m, try_to_lock_type);
      +
      scoped_lock(mutex_type & m, try_to_lock_type);

      Effects: m.try_lock(). Postconditions: mutex() == &m. owns() == the return value of the m.try_lock() executed within the constructor. Notes: The constructor will take ownership of the mutex if it can do so without waiting. Whether or not this constructor handles recursive locking depends upon the mutex. If the mutex_type does not support try_lock, this constructor will fail at compile time if instantiated, but otherwise have no effect.

    6. -
      scoped_lock(mutex_type & m, const boost::posix_time::ptime & abs_time);
      +
      scoped_lock(mutex_type & m, const boost::posix_time::ptime & abs_time);

      Effects: m.timed_lock(abs_time). Postconditions: mutex() == &m. owns() == the return value of the m.timed_lock(abs_time) executed within the constructor. Notes: The constructor will take ownership of the mutex if it can do it until abs_time is reached. Whether or not this constructor handles recursive locking depends upon the mutex. If the mutex_type does not support try_lock, this constructor will fail at compile time if instantiated, but otherwise have no effect.

    7. -
      scoped_lock(scoped_lock && scop);
      +
      scoped_lock(scoped_lock && scop);

      Postconditions: mutex() == the value scop.mutex() had before the constructor executes. s1.mutex() == 0. owns() == the value of scop.owns() before the constructor executes. scop.owns(). Notes: If the scop scoped_lock owns the mutex, ownership is moved to thisscoped_lock with no blocking. If the scop scoped_lock does not own the mutex, then neither will this scoped_lock. Only a moved scoped_lock's will match this signature. An non-moved scoped_lock can be moved with the expression: "boost::move(lock);". This constructor does not alter the state of the mutex, only potentially who owns it. 

    8. template<typename T> 
-  explicit scoped_lock(upgradable_lock< T > && upgr, unspecified = 0);
      + explicit scoped_lock(upgradable_lock< T > && upgr, unspecified = 0);

      Effects: If upgr.owns() then calls unlock_upgradable_and_lock() on the referenced mutex. upgr.release() is called. Postconditions: mutex() == the value upgr.mutex() had before the construction. upgr.mutex() == 0. owns() == upgr.owns() before the construction. upgr.owns() == false after the construction. Notes: If upgr is locked, this constructor will lock this scoped_lock while unlocking upgr. If upgr is unlocked, then this scoped_lock will be unlocked as well. Only a moved upgradable_lock's will match this signature. An non-moved upgradable_lock can be moved with the expression: "boost::move(lock);" This constructor may block if other threads hold a sharable_lock on this mutex (sharable_lock's can share ownership with an upgradable_lock). 

    9. template<typename T> 
-  scoped_lock(upgradable_lock< T > && upgr, try_to_lock_type, unspecified = 0);
      + scoped_lock(upgradable_lock< T > && upgr, try_to_lock_type, unspecified = 0);

      Effects: If upgr.owns() then calls try_unlock_upgradable_and_lock() on the referenced mutex: a)if try_unlock_upgradable_and_lock() returns true then mutex() obtains the value from upgr.release() and owns() is set to true. b)if try_unlock_upgradable_and_lock() returns false then upgr is unaffected and this scoped_lock construction as the same effects as a default construction. c)Else upgr.owns() is false. mutex() obtains the value from upgr.release() and owns() is set to false Notes: This construction will not block. It will try to obtain mutex ownership from upgr immediately, while changing the lock type from a "read lock" to a "write lock". If the "read lock" isn't held in the first place, the mutex merely changes type to an unlocked "write lock". If the "read lock" is held, then mutex transfer occurs only if it can do so in a non-blocking manner. 

    10. template<typename T> 
-  scoped_lock(upgradable_lock< T > && upgr, 
+  scoped_lock(upgradable_lock< T > && upgr, 
               boost::posix_time::ptime & abs_time, unspecified = 0);

      Effects: If upgr.owns() then calls timed_unlock_upgradable_and_lock(abs_time) on the referenced mutex: a)if timed_unlock_upgradable_and_lock(abs_time) returns true then mutex() obtains the value from upgr.release() and owns() is set to true. b)if timed_unlock_upgradable_and_lock(abs_time) returns false then upgr is unaffected and this scoped_lock construction as the same effects as a default construction. c)Else upgr.owns() is false. mutex() obtains the value from upgr.release() and owns() is set to false Notes: This construction will not block. It will try to obtain mutex ownership from upgr immediately, while changing the lock type from a "read lock" to a "write lock". If the "read lock" isn't held in the first place, the mutex merely changes type to an unlocked "write lock". If the "read lock" is held, then mutex transfer occurs only if it can do so in a non-blocking manner. 

    11. template<typename T> 
-  scoped_lock(sharable_lock< T > && shar, try_to_lock_type, unspecified = 0);
      + scoped_lock(sharable_lock< T > && shar, try_to_lock_type, unspecified = 0);

      Effects: If shar.owns() then calls try_unlock_sharable_and_lock() on the referenced mutex. a)if try_unlock_sharable_and_lock() returns true then mutex() obtains the value from shar.release() and owns() is set to true. b)if try_unlock_sharable_and_lock() returns false then shar is unaffected and this scoped_lock construction has the same effects as a default construction. c)Else shar.owns() is false. mutex() obtains the value from shar.release() and owns() is set to false Notes: This construction will not block. It will try to obtain mutex ownership from shar immediately, while changing the lock type from a "read lock" to a "write lock". If the "read lock" isn't held in the first place, the mutex merely changes type to an unlocked "write lock". If the "read lock" is held, then mutex transfer occurs only if it can do so in a non-blocking manner.

    12. -
      scoped_lock & operator=(scoped_lock && scop);
      +
      scoped_lock & operator=(scoped_lock && scop);

      Effects: If owns() before the call, then unlock() is called on mutex(). *this gets the state of scop and scop gets set to a default constructed state. Notes: With a recursive mutex it is possible that both this and scop own the same mutex before the assignment. In this case, this will own the mutex after the assignment (and scop will not), but the mutex's lock count will be decremented by one.

    13. -
      ~scoped_lock();
      +
      ~scoped_lock();

      Effects: if (owns()) mp_mutex->unlock(). Notes: The destructor behavior ensures that the mutex lock is not leaked.

    -scoped_lock public member functions

    +scoped_lock public member functions
    1. -
      void lock();
      +
      void lock();

      Effects: If mutex() == 0 or if already locked, throws a lock_exception() exception. Calls lock() on the referenced mutex. Postconditions: owns() == true. Notes: The scoped_lock changes from a state of not owning the mutex, to owning the mutex, blocking if necessary.

    2. -
      *bool try_lock();
      +
      *bool try_lock();

      Effects: If mutex() == 0 or if already locked, throws a lock_exception() exception. Calls try_lock() on the referenced mutex. Postconditions: owns() == the value returned from mutex()->try_lock(). Notes: The scoped_lock changes from a state of not owning the mutex, to owning the mutex, but only if blocking was not required. If the mutex_type does not support try_lock(), this function will fail at compile time if instantiated, but otherwise have no effect.

    3. -
      *bool timed_lock(const boost::posix_time::ptime & abs_time);
      +
      *bool timed_lock(const boost::posix_time::ptime & abs_time);

      Effects: If mutex() == 0 or if already locked, throws a lock_exception() exception. Calls timed_lock(abs_time) on the referenced mutex. Postconditions: owns() == the value returned from mutex()-> timed_lock(abs_time). Notes: The scoped_lock changes from a state of not owning the mutex, to owning the mutex, but only if it can obtain ownership by the specified time. If the mutex_type does not support timed_lock (), this function will fail at compile time if instantiated, but otherwise have no effect.

    4. -
      *void unlock();
      +
      *void unlock();

      Effects: If mutex() == 0 or if not locked, throws a lock_exception() exception. Calls unlock() on the referenced mutex. Postconditions: owns() == false. Notes: The scoped_lock changes from a state of owning the mutex, to not owning the mutex.

    5. -
      bool owns() const;
      +
      bool owns() const;

      Effects: Returns true if this scoped_lock has acquired the referenced mutex.

    6. -
      operator unspecified_bool_type() const;
      +
      operator unspecified_bool_type() const;

      Conversion to bool. Returns owns().

    7. -
      mutex_type * mutex() const;
      +
      mutex_type * mutex() const;

      Effects: Returns a pointer to the referenced mutex, or 0 if there is no mutex to reference.

    8. -
      mutex_type * release();
      +
      mutex_type * release();

      Effects: Returns a pointer to the referenced mutex, or 0 if there is no mutex to reference. Postconditions: mutex() == 0 and owns() == false.

    9. -
      void swap(scoped_lock< mutex_type > & other);
      +
      void swap(scoped_lock< mutex_type > & other);

      Effects: Swaps state with moved lock. Throws: Nothing.

    diff --git a/doc/html/boost/interprocess/scoped_ptr.html b/doc/html/boost/interprocess/scoped_ptr.html index d67772284a..4475f2d14f 100644 --- a/doc/html/boost/interprocess/scoped_ptr.html +++ b/doc/html/boost/interprocess/scoped_ptr.html @@ -7,8 +7,8 @@ - - + + @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -42,21 +42,21 @@ typedef pointer this_type::* unspecified_bool_type; // construct/copy/destruct - explicit scoped_ptr(const pointer & = 0, const Deleter & = Deleter()); - ~scoped_ptr(); + explicit scoped_ptr(const pointer & = 0, const Deleter & = Deleter()); + ~scoped_ptr(); - // public member functions - void reset(const pointer & = 0); - void reset(const pointer &, const Deleter &); - pointer release(); - reference operator*() const; - pointer & operator->(); - const pointer & operator->() const; - pointer & get(); - const pointer & get() const; - operator unspecified_bool_type() const; - bool operator!() const; - void swap(scoped_ptr &); + // public member functions + void reset(const pointer & = 0); + void reset(const pointer &, const Deleter &); + pointer release(); + reference operator*() const; + pointer & operator->(); + const pointer & operator->() const; + pointer & get(); + const pointer & get() const; + operator unspecified_bool_type() const; + bool operator!() const; + void swap(scoped_ptr &); };

    Description

    @@ -68,61 +68,61 @@ construct/copy/destruct
    1. -
      explicit scoped_ptr(const pointer & p = 0, const Deleter & d = Deleter());
      +
      explicit scoped_ptr(const pointer & p = 0, const Deleter & d = Deleter());

      Constructs a scoped_ptr, storing a copy of p(which can be 0) and d. Does not throw.

    2. -
      ~scoped_ptr();
      +
      ~scoped_ptr();

      If the stored pointer is not 0, destroys the object pointed to by the stored pointer. calling the operator() of the stored deleter. Never throws

    -scoped_ptr public member functions

    +scoped_ptr public member functions
    1. -
      void reset(const pointer & p = 0);
      +
      void reset(const pointer & p = 0);

      Deletes the object pointed to by the stored pointer and then stores a copy of p. Never throws

    2. -
      void reset(const pointer & p, const Deleter & d);
      +
      void reset(const pointer & p, const Deleter & d);

      Deletes the object pointed to by the stored pointer and then stores a copy of p and a copy of d.

    3. -
      pointer release();
      +
      pointer release();

      Assigns internal pointer as 0 and returns previous pointer. This will avoid deletion on destructor

    4. -
      reference operator*() const;
      +
      reference operator*() const;

      Returns a reference to the object pointed to by the stored pointer. Never throws.

    5. -
      pointer & operator->();
      +
      pointer & operator->();

      Returns the internal stored pointer. Never throws.

    6. -
      const pointer & operator->() const;
      +
      const pointer & operator->() const;

      Returns the internal stored pointer. Never throws.

    7. -
      pointer & get();
      +
      pointer & get();

      Returns the stored pointer. Never throws.

    8. -
      const pointer & get() const;
      +
      const pointer & get() const;

      Returns the stored pointer. Never throws.

    9. -
      operator unspecified_bool_type() const;
      +
      operator unspecified_bool_type() const;

      Conversion to bool Never throws

    10. -
      bool operator!() const;
      +
      bool operator!() const;

      Returns true if the stored pointer is 0. Never throws.

    11. -
      void swap(scoped_ptr & b);
      +
      void swap(scoped_ptr & b);

      Exchanges the internal pointer and deleter with other scoped_ptr Never throws.

    @@ -139,7 +139,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/interprocess/segment_manager.html b/doc/html/boost/interprocess/segment_manager.html index b243dd9f61..9bf08b852a 100644 --- a/doc/html/boost/interprocess/segment_manager.html +++ b/doc/html/boost/interprocess/segment_manager.html @@ -62,52 +62,52 @@ }; // construct/copy/destruct - explicit segment_manager(size_type); + explicit segment_manager(size_type); - // public member functions - template<typename T> std::pair< T *, size_type > find(char_ptr_holder_t); + // public member functions + template<typename T> std::pair< T *, size_type > find(char_ptr_holder_t); template<typename T> - std::pair< T *, size_type > find_no_lock(char_ptr_holder_t); - template<typename T> construct_proxy< T >::type construct(char_ptr_holder_t); + std::pair< T *, size_type > find_no_lock(char_ptr_holder_t); + template<typename T> construct_proxy< T >::type construct(char_ptr_holder_t); template<typename T> - construct_proxy< T >::type find_or_construct(char_ptr_holder_t); + construct_proxy< T >::type find_or_construct(char_ptr_holder_t); template<typename T> construct_proxy< T >::type - construct(char_ptr_holder_t, const std::nothrow_t &); + construct(char_ptr_holder_t, const std::nothrow_t &); template<typename T> construct_proxy< T >::type - find_or_construct(char_ptr_holder_t, const std::nothrow_t &); + find_or_construct(char_ptr_holder_t, const std::nothrow_t &); template<typename T> - construct_iter_proxy< T >::type construct_it(char_ptr_holder_t); + construct_iter_proxy< T >::type construct_it(char_ptr_holder_t); template<typename T> - construct_iter_proxy< T >::type find_or_construct_it(char_ptr_holder_t); + construct_iter_proxy< T >::type find_or_construct_it(char_ptr_holder_t); template<typename T> construct_iter_proxy< T >::type - construct_it(char_ptr_holder_t, const std::nothrow_t &); + construct_it(char_ptr_holder_t, const std::nothrow_t &); template<typename T> construct_iter_proxy< T >::type - find_or_construct_it(char_ptr_holder_t, const std::nothrow_t &); - template<typename Func> void atomic_func(Func &); - template<typename Func> bool try_atomic_func(Func &); - template<typename T> bool destroy(char_ptr_holder_t); - template<typename T> void destroy_ptr(const T *); - void reserve_named_objects(size_type); - void reserve_unique_objects(size_type); - void shrink_to_fit_indexes(); - size_type get_num_named_objects(); - size_type get_num_unique_objects(); - const_named_iterator named_begin() const; - const_named_iterator named_end() const; - const_unique_iterator unique_begin() const; - const_unique_iterator unique_end() const; - template<typename T> allocator< T >::type get_allocator(); - template<typename T> deleter< T >::type get_deleter(); + find_or_construct_it(char_ptr_holder_t, const std::nothrow_t &); + template<typename Func> void atomic_func(Func &); + template<typename Func> bool try_atomic_func(Func &); + template<typename T> bool destroy(char_ptr_holder_t); + template<typename T> void destroy_ptr(const T *); + void reserve_named_objects(size_type); + void reserve_unique_objects(size_type); + void shrink_to_fit_indexes(); + size_type get_num_named_objects(); + size_type get_num_unique_objects(); + const_named_iterator named_begin() const; + const_named_iterator named_end() const; + const_unique_iterator unique_begin() const; + const_unique_iterator unique_end() const; + template<typename T> allocator< T >::type get_allocator(); + template<typename T> deleter< T >::type get_deleter(); - // public static functions - template<typename T> static const CharType * get_instance_name(const T *); - template<typename T> static size_type get_instance_length(const T *); - template<typename T> static instance_type get_instance_type(const T *); - static size_type get_min_size(); + // public static functions + template<typename T> static const CharType * get_instance_name(const T *); + template<typename T> static size_type get_instance_length(const T *); + template<typename T> static instance_type get_instance_type(const T *); + static size_type get_min_size(); // public data members static const size_type PayloadPerAllocation; @@ -124,145 +124,145 @@ public construct/copy/destruct
    1. -
      explicit segment_manager(size_type segment_size);
      +
      explicit segment_manager(size_type segment_size);

      Constructor of the segment manager "size" is the size of the memory segment where the segment manager is being constructed. Can throw

    -segment_manager public member functions

    +segment_manager public member functions
    1. -
      template<typename T> std::pair< T *, size_type > find(char_ptr_holder_t name);
      +
      template<typename T> std::pair< T *, size_type > find(char_ptr_holder_t name);

      Tries to find a previous named/unique allocation. Returns the address and the object count. On failure the first member of the returned pair is 0. 

    2. template<typename T> 
-  std::pair< T *, size_type > find_no_lock(char_ptr_holder_t name);
      + std::pair< T *, size_type > find_no_lock(char_ptr_holder_t name);

      Tries to find a previous named/unique allocation. Returns the address and the object count. On failure the first member of the returned pair is 0. This search is not mutex-protected! Use it only inside atomic_func() calls, where the internal mutex is guaranteed to be locked. 

    3. template<typename T> 
-  construct_proxy< T >::type construct(char_ptr_holder_t name);
      + construct_proxy< T >::type construct(char_ptr_holder_t name);

      Returns throwing "construct" proxy object 

    4. template<typename T> 
-  construct_proxy< T >::type find_or_construct(char_ptr_holder_t name);
      + construct_proxy< T >::type find_or_construct(char_ptr_holder_t name);

      Returns throwing "search or construct" proxy object 

    5. template<typename T> 
   construct_proxy< T >::type 
-  construct(char_ptr_holder_t name, const std::nothrow_t &);
      + construct(char_ptr_holder_t name, const std::nothrow_t &);

      Returns no throwing "construct" proxy object 

    6. template<typename T> 
   construct_proxy< T >::type 
-  find_or_construct(char_ptr_holder_t name, const std::nothrow_t &);
      + find_or_construct(char_ptr_holder_t name, const std::nothrow_t &);

      Returns no throwing "search or construct" proxy object 

    7. template<typename T> 
-  construct_iter_proxy< T >::type construct_it(char_ptr_holder_t name);
      Returns throwing "construct from iterators" proxy object.
      8. + construct_iter_proxy< T >::type construct_it(char_ptr_holder_t name);Returns throwing "construct from iterators" proxy object. 
    8. template<typename T> 
-  construct_iter_proxy< T >::type find_or_construct_it(char_ptr_holder_t name);
      + construct_iter_proxy< T >::type find_or_construct_it(char_ptr_holder_t name);

      Returns throwing "search or construct from iterators" proxy object 

    9. template<typename T> 
   construct_iter_proxy< T >::type 
-  construct_it(char_ptr_holder_t name, const std::nothrow_t &);
      + construct_it(char_ptr_holder_t name, const std::nothrow_t &);

      Returns no throwing "construct from iterators" proxy object 

    10. template<typename T> 
   construct_iter_proxy< T >::type 
-  find_or_construct_it(char_ptr_holder_t name, const std::nothrow_t &);
      + find_or_construct_it(char_ptr_holder_t name, const std::nothrow_t &);

      Returns no throwing "search or construct from iterators" proxy object

    11. -
      template<typename Func> void atomic_func(Func & f);
      +
      template<typename Func> void atomic_func(Func & f);

      Calls object function blocking recursive interprocess_mutex and guarantees that no new named_alloc or destroy will be executed by any process while executing the object function call

    12. -
      template<typename Func> bool try_atomic_func(Func & f);
      +
      template<typename Func> bool try_atomic_func(Func & f);

      Tries to calls a functor guaranteeing that no new construction, search or destruction will be executed by any process while executing the object function call. If the atomic function can't be immediatelly executed because the internal mutex is already locked, returns false. If the functor throws, this function throws.

    13. -
      template<typename T> bool destroy(char_ptr_holder_t name);
      +
      template<typename T> bool destroy(char_ptr_holder_t name);

      Destroys a previously created named/unique instance. Returns false if the object was not present.

    14. -
      template<typename T> void destroy_ptr(const T * p);
      +
      template<typename T> void destroy_ptr(const T * p);

      Destroys an anonymous, unique or named object using its address

    15. -
      void reserve_named_objects(size_type num);
      +
      void reserve_named_objects(size_type num);

      Preallocates needed index resources to optimize the creation of "num" named objects in the managed memory segment. Can throw boost::interprocess::bad_alloc if there is no enough memory.

    16. -
      void reserve_unique_objects(size_type num);
      +
      void reserve_unique_objects(size_type num);

      Preallocates needed index resources to optimize the creation of "num" unique objects in the managed memory segment. Can throw boost::interprocess::bad_alloc if there is no enough memory.

    17. -
      void shrink_to_fit_indexes();
      +
      void shrink_to_fit_indexes();

      Calls shrink_to_fit in both named and unique object indexes to try to free unused memory from those indexes.

    18. -
      size_type get_num_named_objects();
      +
      size_type get_num_named_objects();

      Returns the number of named objects stored in the segment.

    19. -
      size_type get_num_unique_objects();
      +
      size_type get_num_unique_objects();

      Returns the number of unique objects stored in the segment.

    20. -
      const_named_iterator named_begin() const;
      +
      const_named_iterator named_begin() const;

      Returns a constant iterator to the beginning of the information about the named allocations performed in this segment manager

    21. -
      const_named_iterator named_end() const;
      +
      const_named_iterator named_end() const;

      Returns a constant iterator to the end of the information about the named allocations performed in this segment manager

    22. -
      const_unique_iterator unique_begin() const;
      +
      const_unique_iterator unique_begin() const;

      Returns a constant iterator to the beginning of the information about the unique allocations performed in this segment manager

    23. -
      const_unique_iterator unique_end() const;
      +
      const_unique_iterator unique_end() const;

      Returns a constant iterator to the end of the information about the unique allocations performed in this segment manager

    24. -
      template<typename T> allocator< T >::type get_allocator();
      +
      template<typename T> allocator< T >::type get_allocator();

      Returns an instance of the default allocator for type T initialized that allocates memory from this segment manager.

    25. -
      template<typename T> deleter< T >::type get_deleter();
      +
      template<typename T> deleter< T >::type get_deleter();

      Returns an instance of the default deleter for type T that will delete an object constructed in this segment manager.

    -segment_manager public static functions

    +segment_manager public static functions
    1. -
      template<typename T> static const CharType * get_instance_name(const T * ptr);
      +
      template<typename T> static const CharType * get_instance_name(const T * ptr);

      Returns the name of an object created with construct/find_or_construct functions. Does not throw

    2. -
      template<typename T> static size_type get_instance_length(const T * ptr);
      +
      template<typename T> static size_type get_instance_length(const T * ptr);

      Returns the length of an object created with construct/find_or_construct functions. Does not throw.

    3. -
      template<typename T> static instance_type get_instance_type(const T * ptr);
      +
      template<typename T> static instance_type get_instance_type(const T * ptr);

      Returns is the the name of an object created with construct/find_or_construct functions. Does not throw

    4. -
      static size_type get_min_size();
      +
      static size_type get_min_size();

      Obtains the minimum size needed by the segment manager

    diff --git a/doc/html/boost/interprocess/segment_manager_base.html b/doc/html/boost/interprocess/segment_manager_base.html index 3472f6f382..6f644d0104 100644 --- a/doc/html/boost/interprocess/segment_manager_base.html +++ b/doc/html/boost/interprocess/segment_manager_base.html @@ -42,25 +42,25 @@ typedef MemoryAlgorithm memory_algorithm; // construct/copy/destruct - segment_manager_base(size_type, size_type); + segment_manager_base(size_type, size_type); - // public member functions - size_type get_size() const; - size_type get_free_memory() const; - void * allocate(size_type, const std::nothrow_t &); - void * allocate(size_type); - void * allocate_aligned(size_type, size_type, const std::nothrow_t &); - void * allocate_aligned(size_type, size_type); - void deallocate(void *); - void grow(size_type); - void shrink_to_fit(); - bool all_memory_deallocated(); - bool check_sanity(); - void zero_free_memory(); - size_type size(const void *) const; + // public member functions + size_type get_size() const; + size_type get_free_memory() const; + void * allocate(size_type, const std::nothrow_t &); + void * allocate(size_type); + void * allocate_aligned(size_type, size_type, const std::nothrow_t &); + void * allocate_aligned(size_type, size_type); + void deallocate(void *); + void grow(size_type); + void shrink_to_fit(); + bool all_memory_deallocated(); + bool check_sanity(); + void zero_free_memory(); + size_type size(const void *) const; - // public static functions - static size_type get_min_size(size_type); + // public static functions + static size_type get_min_size(size_type); // public data members static const size_type PayloadPerAllocation; @@ -75,7 +75,7 @@ public construct/copy/destruct
    1. -
      segment_manager_base(size_type sz, size_type reserved_bytes);
      +
      segment_manager_base(size_type sz, size_type reserved_bytes);

      Constructor of the segment_manager_base

      "size" is the size of the memory segment where the basic segment manager is being constructed.

      "reserved_bytes" is the number of bytes after the end of the memory algorithm object itself that the memory algorithm will exclude from dynamic allocation

      @@ -84,66 +84,66 @@

    -segment_manager_base public member functions

    +segment_manager_base public member functions
    1. -
      size_type get_size() const;
      +
      size_type get_size() const;

      Returns the size of the memory segment

    2. -
      size_type get_free_memory() const;
      +
      size_type get_free_memory() const;

      Returns the number of free bytes of the memory segment

    3. -
      void * allocate(size_type nbytes, const std::nothrow_t &);
      +
      void * allocate(size_type nbytes, const std::nothrow_t &);

      Allocates nbytes bytes. This function is only used in single-segment management. Never throws

    4. -
      void * allocate(size_type nbytes);
      +
      void * allocate(size_type nbytes);

      Allocates nbytes bytes. Throws boost::interprocess::bad_alloc on failure

    5. -
      void * allocate_aligned(size_type nbytes, size_type alignment, 
+
      void * allocate_aligned(size_type nbytes, size_type alignment, 
                         const std::nothrow_t &);
      
 
      Allocates nbytes bytes. This function is only used in single-segment management. Never throws
    6. -
      void * allocate_aligned(size_type nbytes, size_type alignment);
      +
      void * allocate_aligned(size_type nbytes, size_type alignment);

      Allocates nbytes bytes. This function is only used in single-segment management. Throws bad_alloc when fails

    7. -
      void deallocate(void * addr);
      +
      void deallocate(void * addr);

      Deallocates the bytes allocated with allocate/allocate_many() pointed by addr

    8. -
      void grow(size_type extra_size);
      +
      void grow(size_type extra_size);

      Increases managed memory in extra_size bytes more. This only works with single-segment management.

    9. -
      void shrink_to_fit();
      +
      void shrink_to_fit();

      Decreases managed memory to the minimum. This only works with single-segment management.

    10. -
      bool all_memory_deallocated();
      +
      bool all_memory_deallocated();

      Returns the result of "all_memory_deallocated()" function of the used memory algorithm

    11. -
      bool check_sanity();
      +
      bool check_sanity();

      Returns the result of "check_sanity()" function of the used memory algorithm

    12. -
      void zero_free_memory();
      +
      void zero_free_memory();

      Writes to zero free memory (memory not yet allocated) of the memory algorithm

    13. -
      size_type size(const void * ptr) const;
      Returns the size of the buffer previously allocated pointed by ptr.
      14. +
      size_type size(const void * ptr) const;
      Returns the size of the buffer previously allocated pointed by ptr.

    -segment_manager_base public static functions

    +segment_manager_base public static functions
    1. -
      static size_type get_min_size(size_type size);
      +
      static size_type get_min_size(size_type size);

      Obtains the minimum size needed by the segment manager

    diff --git a/doc/html/boost/interprocess/sharable_lock.html b/doc/html/boost/interprocess/sharable_lock.html index af43160c9c..ce22d534a9 100644 --- a/doc/html/boost/interprocess/sharable_lock.html +++ b/doc/html/boost/interprocess/sharable_lock.html @@ -39,28 +39,28 @@ typedef SharableMutex mutex_type; // construct/copy/destruct - sharable_lock(); - explicit sharable_lock(mutex_type &); - sharable_lock(mutex_type &, defer_lock_type); - sharable_lock(mutex_type &, accept_ownership_type); - sharable_lock(mutex_type &, try_to_lock_type); - sharable_lock(mutex_type &, const boost::posix_time::ptime &); - sharable_lock(sharable_lock< mutex_type > &&); - template<typename T> sharable_lock(upgradable_lock< T > &&, unspecified = 0); - template<typename T> sharable_lock(scoped_lock< T > &&, unspecified = 0); - sharable_lock & operator=(sharable_lock< mutex_type > &&); - ~sharable_lock(); + sharable_lock(); + explicit sharable_lock(mutex_type &); + sharable_lock(mutex_type &, defer_lock_type); + sharable_lock(mutex_type &, accept_ownership_type); + sharable_lock(mutex_type &, try_to_lock_type); + sharable_lock(mutex_type &, const boost::posix_time::ptime &); + sharable_lock(sharable_lock< mutex_type > &&); + template<typename T> sharable_lock(upgradable_lock< T > &&, unspecified = 0); + template<typename T> sharable_lock(scoped_lock< T > &&, unspecified = 0); + sharable_lock & operator=(sharable_lock< mutex_type > &&); + ~sharable_lock(); - // public member functions - void lock(); - bool try_lock(); - bool timed_lock(const boost::posix_time::ptime &); - void unlock(); - bool owns() const; - operator unspecified_bool_type() const; - mutex_type * mutex() const; - mutex_type * release(); - void swap(sharable_lock< mutex_type > &); + // public member functions + void lock(); + bool try_lock(); + bool timed_lock(const boost::posix_time::ptime &); + void unlock(); + bool owns() const; + operator unspecified_bool_type() const; + mutex_type * mutex() const; + mutex_type * release(); + void swap(sharable_lock< mutex_type > &); };

    Description

    @@ -72,90 +72,90 @@ construct/copy/destruct
    1. -
      sharable_lock();
      +
      sharable_lock();

      Effects: Default constructs a sharable_lock. Postconditions: owns() == false and mutex() == 0.

    2. -
      explicit sharable_lock(mutex_type & m);
      +
      explicit sharable_lock(mutex_type & m);

      Effects: m.lock_sharable(). Postconditions: owns() == true and mutex() == &m. Notes: The constructor will take sharable-ownership of the mutex. If another thread already owns the mutex with exclusive ownership (scoped_lock), this thread will block until the mutex is released. If another thread owns the mutex with sharable or upgradable ownership, then no blocking will occur. Whether or not this constructor handles recursive locking depends upon the mutex.

    3. -
      sharable_lock(mutex_type & m, defer_lock_type);
      +
      sharable_lock(mutex_type & m, defer_lock_type);

      Postconditions: owns() == false, and mutex() == &m. Notes: The constructor will not take ownership of the mutex. There is no effect required on the referenced mutex.

    4. -
      sharable_lock(mutex_type & m, accept_ownership_type);
      +
      sharable_lock(mutex_type & m, accept_ownership_type);

      Postconditions: owns() == true, and mutex() == &m. Notes: The constructor will suppose that the mutex is already sharable locked. There is no effect required on the referenced mutex.

    5. -
      sharable_lock(mutex_type & m, try_to_lock_type);
      +
      sharable_lock(mutex_type & m, try_to_lock_type);

      Effects: m.try_lock_sharable() Postconditions: mutex() == &m. owns() == the return value of the m.try_lock_sharable() executed within the constructor. Notes: The constructor will take sharable-ownership of the mutex if it can do so without waiting. Whether or not this constructor handles recursive locking depends upon the mutex. If the mutex_type does not support try_lock_sharable, this constructor will fail at compile time if instantiated, but otherwise have no effect.

    6. -
      sharable_lock(mutex_type & m, const boost::posix_time::ptime & abs_time);
      +
      sharable_lock(mutex_type & m, const boost::posix_time::ptime & abs_time);

      Effects: m.timed_lock_sharable(abs_time) Postconditions: mutex() == &m. owns() == the return value of the m.timed_lock_sharable() executed within the constructor. Notes: The constructor will take sharable-ownership of the mutex if it can do so within the time specified. Whether or not this constructor handles recursive locking depends upon the mutex. If the mutex_type does not support timed_lock_sharable, this constructor will fail at compile time if instantiated, but otherwise have no effect.

    7. -
      sharable_lock(sharable_lock< mutex_type > && upgr);
      +
      sharable_lock(sharable_lock< mutex_type > && upgr);

      Postconditions: mutex() == upgr.mutex(). owns() == the value of upgr.owns() before the construction. upgr.owns() == false after the construction. Notes: If the upgr sharable_lock owns the mutex, ownership is moved to this sharable_lock with no blocking. If the upgr sharable_lock does not own the mutex, then neither will this sharable_lock. Only a moved sharable_lock's will match this signature. An non-moved sharable_lock can be moved with the expression: "boost::move(lock);". This constructor does not alter the state of the mutex, only potentially who owns it. 

    8. template<typename T> 
-  sharable_lock(upgradable_lock< T > && upgr, unspecified = 0);
      + sharable_lock(upgradable_lock< T > && upgr, unspecified = 0);

      Effects: If upgr.owns() then calls unlock_upgradable_and_lock_sharable() on the referenced mutex. Postconditions: mutex() == the value upgr.mutex() had before the construction. upgr.mutex() == 0 owns() == the value of upgr.owns() before construction. upgr.owns() == false after the construction. Notes: If upgr is locked, this constructor will lock this sharable_lock while unlocking upgr. Only a moved sharable_lock's will match this signature. An non-moved upgradable_lock can be moved with the expression: "boost::move(lock);".

    9. -
      template<typename T> sharable_lock(scoped_lock< T > && scop, unspecified = 0);
      +
      template<typename T> sharable_lock(scoped_lock< T > && scop, unspecified = 0);

      Effects: If scop.owns() then calls unlock_and_lock_sharable() on the referenced mutex. Postconditions: mutex() == the value scop.mutex() had before the construction. scop.mutex() == 0 owns() == scop.owns() before the constructor. After the construction, scop.owns() == false. Notes: If scop is locked, this constructor will transfer the exclusive ownership to a sharable-ownership of this sharable_lock. Only a moved scoped_lock's will match this signature. An non-moved scoped_lock can be moved with the expression: "boost::move(lock);".

    10. -
      sharable_lock & operator=(sharable_lock< mutex_type > && upgr);
      +
      sharable_lock & operator=(sharable_lock< mutex_type > && upgr);

      Effects: If owns() before the call, then unlock_sharable() is called on mutex(). *this gets the state of upgr and upgr gets set to a default constructed state. Notes: With a recursive mutex it is possible that both this and upgr own the mutex before the assignment. In this case, this will own the mutex after the assignment (and upgr will not), but the mutex's lock count will be decremented by one.

    11. -
      ~sharable_lock();
      +
      ~sharable_lock();

      Effects: if (owns()) mp_mutex->unlock_sharable(). Notes: The destructor behavior ensures that the mutex lock is not leaked.

    -sharable_lock public member functions

    +sharable_lock public member functions
    1. -
      void lock();
      +
      void lock();

      Effects: If mutex() == 0 or already locked, throws a lock_exception() exception. Calls lock_sharable() on the referenced mutex. Postconditions: owns() == true. Notes: The sharable_lock changes from a state of not owning the mutex, to owning the mutex, blocking if necessary.

    2. -
      bool try_lock();
      +
      bool try_lock();

      Effects: If mutex() == 0 or already locked, throws a lock_exception() exception. Calls try_lock_sharable() on the referenced mutex. Postconditions: owns() == the value returned from mutex()->try_lock_sharable(). Notes: The sharable_lock changes from a state of not owning the mutex, to owning the mutex, but only if blocking was not required. If the mutex_type does not support try_lock_sharable(), this function will fail at compile time if instantiated, but otherwise have no effect.

    3. -
      bool timed_lock(const boost::posix_time::ptime & abs_time);
      +
      bool timed_lock(const boost::posix_time::ptime & abs_time);

      Effects: If mutex() == 0 or already locked, throws a lock_exception() exception. Calls timed_lock_sharable(abs_time) on the referenced mutex. Postconditions: owns() == the value returned from mutex()->timed_lock_sharable(elps_time). Notes: The sharable_lock changes from a state of not owning the mutex, to owning the mutex, but only if it can obtain ownership within the specified time interval. If the mutex_type does not support timed_lock_sharable(), this function will fail at compile time if instantiated, but otherwise have no effect.

    4. -
      void unlock();
      +
      void unlock();

      Effects: If mutex() == 0 or not locked, throws a lock_exception() exception. Calls unlock_sharable() on the referenced mutex. Postconditions: owns() == false. Notes: The sharable_lock changes from a state of owning the mutex, to not owning the mutex.

    5. -
      bool owns() const;
      +
      bool owns() const;

      Effects: Returns true if this scoped_lock has acquired the referenced mutex.

    6. -
      operator unspecified_bool_type() const;
      +
      operator unspecified_bool_type() const;

      Conversion to bool. Returns owns().

    7. -
      mutex_type * mutex() const;
      +
      mutex_type * mutex() const;

      Effects: Returns a pointer to the referenced mutex, or 0 if there is no mutex to reference.

    8. -
      mutex_type * release();
      +
      mutex_type * release();

      Effects: Returns a pointer to the referenced mutex, or 0 if there is no mutex to reference. Postconditions: mutex() == 0 and owns() == false.

    9. -
      void swap(sharable_lock< mutex_type > & other);
      +
      void swap(sharable_lock< mutex_type > & other);

      Effects: Swaps state with moved lock. Throws: Nothing.

    diff --git a/doc/html/boost/interprocess/shared_memory_object.html b/doc/html/boost/interprocess/shared_memory_object.html index 19a224faea..5d218c1d11 100644 --- a/doc/html/boost/interprocess/shared_memory_object.html +++ b/doc/html/boost/interprocess/shared_memory_object.html @@ -36,26 +36,26 @@ class shared_memory_object { public: // construct/copy/destruct - shared_memory_object(); - shared_memory_object(create_only_t, const char *, mode_t, + shared_memory_object(); + shared_memory_object(create_only_t, const char *, mode_t, const permissions & = permissions()); - shared_memory_object(open_or_create_t, const char *, mode_t, + shared_memory_object(open_or_create_t, const char *, mode_t, const permissions & = permissions()); - shared_memory_object(open_only_t, const char *, mode_t); - shared_memory_object(shared_memory_object &&); - shared_memory_object & operator=(shared_memory_object &&); - ~shared_memory_object(); + shared_memory_object(open_only_t, const char *, mode_t); + shared_memory_object(shared_memory_object &&); + shared_memory_object & operator=(shared_memory_object &&); + ~shared_memory_object(); - // public member functions - void swap(shared_memory_object &); - void truncate(offset_t); - const char * get_name() const; - bool get_size(offset_t &) const; - mode_t get_mode() const; - mapping_handle_t get_mapping_handle() const; + // public member functions + void swap(shared_memory_object &); + void truncate(offset_t); + const char * get_name() const; + bool get_size(offset_t &) const; + mode_t get_mode() const; + mapping_handle_t get_mapping_handle() const; - // public static functions - static bool remove(const char *); + // public static functions + static bool remove(const char *); };

    Description

    @@ -67,60 +67,60 @@ construct/copy/destruct
    1. -
      shared_memory_object();
      Default constructor. Represents an empty shared_memory_object.
      2. +
      shared_memory_object();
      Default constructor. Represents an empty shared_memory_object.
    2. -
      shared_memory_object(create_only_t, const char * name, mode_t mode, 
+
      shared_memory_object(create_only_t, const char * name, mode_t mode, 
                      const permissions & perm = permissions());
      
 
      Creates a shared memory object with name "name" and mode "mode", with the access mode "mode" If the file previously exists, throws an error.
    3. -
      shared_memory_object(open_or_create_t, const char * name, mode_t mode, 
+
      shared_memory_object(open_or_create_t, const char * name, mode_t mode, 
                      const permissions & perm = permissions());
      
 
      Tries to create a shared memory object with name "name" and mode "mode", with the access mode "mode". If the file previously exists, it tries to open it with mode "mode". Otherwise throws an error.
    4. -
      shared_memory_object(open_only_t, const char * name, mode_t mode);
      +
      shared_memory_object(open_only_t, const char * name, mode_t mode);

      Tries to open a shared memory object with name "name", with the access mode "mode". If the file does not previously exist, it throws an error.

    5. -
      shared_memory_object(shared_memory_object && moved);
      +
      shared_memory_object(shared_memory_object && moved);

      Moves the ownership of "moved"'s shared memory object to *this. After the call, "moved" does not represent any shared memory object. Does not throw

    6. -
      shared_memory_object & operator=(shared_memory_object && moved);
      +
      shared_memory_object & operator=(shared_memory_object && moved);

      Moves the ownership of "moved"'s shared memory to *this. After the call, "moved" does not represent any shared memory. Does not throw

    7. -
      ~shared_memory_object();
      +
      ~shared_memory_object();

      Destroys *this and indicates that the calling process is finished using the resource. All mapped regions are still valid after destruction. The destructor function will deallocate any system resources allocated by the system for use by this process for this resource. The resource can still be opened again calling the open constructor overload. To erase the resource from the system use remove().

    -shared_memory_object public member functions

    +shared_memory_object public member functions
    1. -
      void swap(shared_memory_object & moved);
      Swaps the shared_memory_objects. Does not throw.
      2. +
      void swap(shared_memory_object & moved);
      Swaps the shared_memory_objects. Does not throw.
    2. -
      void truncate(offset_t length);
      Sets the size of the shared memory mapping.
      3. +
      void truncate(offset_t length);
      Sets the size of the shared memory mapping.
    3. -
      const char * get_name() const;
      Returns the name of the shared memory object.
      4. +
      const char * get_name() const;
      Returns the name of the shared memory object.
    4. -
      bool get_size(offset_t & size) const;
      +
      bool get_size(offset_t & size) const;

      Returns true if the size of the shared memory object can be obtained and writes the size in the passed reference

    5. -
      mode_t get_mode() const;
      Returns access mode.
      6. +
      mode_t get_mode() const;
      Returns access mode.
    6. -
      mapping_handle_t get_mapping_handle() const;
      Returns mapping handle. Never throws.
      7. +
      mapping_handle_t get_mapping_handle() const;
      Returns mapping handle. Never throws.

    -shared_memory_object public static functions

    +shared_memory_object public static functions
    1. -
      static bool remove(const char * name);
      +
      static bool remove(const char * name);

      Erases a shared memory object from the system. Returns false on error. Never throws

    diff --git a/doc/html/boost/interprocess/shared_ptr.html b/doc/html/boost/interprocess/shared_ptr.html index f46061419b..6420013961 100644 --- a/doc/html/boost/interprocess/shared_ptr.html +++ b/doc/html/boost/interprocess/shared_ptr.html @@ -45,37 +45,37 @@ typedef boost::intrusive::pointer_traits< typename VoidAllocator::pointer >::template rebind_pointer< const VoidAllocator >::type const_allocator_pointer; // construct/copy/destruct - shared_ptr(); - explicit shared_ptr(const pointer &, + shared_ptr(); + explicit shared_ptr(const pointer &, const VoidAllocator & = VoidAllocator(), const Deleter & = Deleter()); - shared_ptr(const shared_ptr &); - shared_ptr(const shared_ptr &, const pointer &); + shared_ptr(const shared_ptr &); + shared_ptr(const shared_ptr &, const pointer &); template<typename Y> - shared_ptr(shared_ptr< Y, VoidAllocator, Deleter > const &); + shared_ptr(shared_ptr< Y, VoidAllocator, Deleter > const &); template<typename Y> - explicit shared_ptr(weak_ptr< Y, VoidAllocator, Deleter > const &); - explicit shared_ptr(shared_ptr &&); + explicit shared_ptr(weak_ptr< Y, VoidAllocator, Deleter > const &); + explicit shared_ptr(shared_ptr &&); template<typename Y> - shared_ptr & operator=(shared_ptr< Y, VoidAllocator, Deleter > const &); - shared_ptr & operator=(BOOST_COPY_ASSIGN_REF(shared_ptr)); - shared_ptr & operator=(shared_ptr &&); + shared_ptr & operator=(shared_ptr< Y, VoidAllocator, Deleter > const &); + shared_ptr & operator=(BOOST_COPY_ASSIGN_REF(shared_ptr)); + shared_ptr & operator=(shared_ptr &&); - // public member functions - void reset(); + // public member functions + void reset(); template<typename Pointer> - void reset(const Pointer &, const VoidAllocator & = VoidAllocator(), + void reset(const Pointer &, const VoidAllocator & = VoidAllocator(), const Deleter & = Deleter()); template<typename Y> - void reset(shared_ptr< Y, VoidAllocator, Deleter > const &, + void reset(shared_ptr< Y, VoidAllocator, Deleter > const &, const pointer &); - reference operator*() const; - pointer operator->() const; - pointer get() const; - bool operator!() const; - bool unique() const; - long use_count() const; - void swap(shared_ptr< T, VoidAllocator, Deleter > &); + reference operator*() const; + pointer operator->() const; + pointer get() const; + bool operator!() const; + bool unique() const; + long use_count() const; + void swap(shared_ptr< T, VoidAllocator, Deleter > &); };

    Description

    @@ -90,95 +90,95 @@ construct/copy/destruct
    1. -
      shared_ptr();
      +
      shared_ptr();

      Constructs an empty shared_ptr. Use_count() == 0 && get()== 0.

    2. -
      explicit shared_ptr(const pointer & p, 
+
      explicit shared_ptr(const pointer & p, 
                     const VoidAllocator & a = VoidAllocator(), 
                     const Deleter & d = Deleter());
      
 
      Constructs a shared_ptr that owns the pointer p. Auxiliary data will be allocated with a copy of a and the object will be deleted with a copy of d. Requirements: Deleter and A's copy constructor must not throw.
    3. -
      shared_ptr(const shared_ptr & r);
      +
      shared_ptr(const shared_ptr & r);

      Copy constructs a shared_ptr. If r is empty, constructs an empty shared_ptr. Otherwise, constructs a shared_ptr that shares ownership with r. Never throws.

    4. -
      shared_ptr(const shared_ptr & other, const pointer & p);
      +
      shared_ptr(const shared_ptr & other, const pointer & p);

      Constructs a shared_ptr that shares ownership with other and stores p. Postconditions: get() == p && use_count() == r.use_count(). Throws: nothing. 

    5. template<typename Y> 
-  shared_ptr(shared_ptr< Y, VoidAllocator, Deleter > const & r);
      + shared_ptr(shared_ptr< Y, VoidAllocator, Deleter > const & r);

      If r is empty, constructs an empty shared_ptr. Otherwise, constructs a shared_ptr that shares ownership with r. Never throws. 

    6. template<typename Y> 
-  explicit shared_ptr(weak_ptr< Y, VoidAllocator, Deleter > const & r);
      + explicit shared_ptr(weak_ptr< Y, VoidAllocator, Deleter > const & r);

      Constructs a shared_ptr that shares ownership with r and stores a copy of the pointer stored in r.

    7. -
      explicit shared_ptr(shared_ptr && other);
      +
      explicit shared_ptr(shared_ptr && other);

      Move-Constructs a shared_ptr that takes ownership of other resource and other is put in default-constructed state. Throws: nothing. 

    8. template<typename Y> 
-  shared_ptr & operator=(shared_ptr< Y, VoidAllocator, Deleter > const & r);
      + shared_ptr & operator=(shared_ptr< Y, VoidAllocator, Deleter > const & r);

      Equivalent to shared_ptr(r).swap(*this). Never throws

    9. -
      shared_ptr & operator=(BOOST_COPY_ASSIGN_REF(shared_ptr) r);
      +
      shared_ptr & operator=(BOOST_COPY_ASSIGN_REF(shared_ptr) r);

      Equivalent to shared_ptr(r).swap(*this). Never throws

    10. -
      shared_ptr & operator=(shared_ptr && other);
      +
      shared_ptr & operator=(shared_ptr && other);

      Move-assignment. Equivalent to shared_ptr(other).swap(*this). Never throws

    -shared_ptr public member functions

    +shared_ptr public member functions
    1. -
      void reset();
      +
      void reset();

      This is equivalent to: this_type().swap(*this); 

    2. template<typename Pointer> 
-  void reset(const Pointer & p, const VoidAllocator & a = VoidAllocator(), 
+  void reset(const Pointer & p, const VoidAllocator & a = VoidAllocator(), 
              const Deleter & d = Deleter());

      This is equivalent to: this_type(p, a, d).swap(*this); 

    3. template<typename Y> 
-  void reset(shared_ptr< Y, VoidAllocator, Deleter > const & r, 
+  void reset(shared_ptr< Y, VoidAllocator, Deleter > const & r, 
              const pointer & p);
    4. -
      reference operator*() const;
      +
      reference operator*() const;

      Returns a reference to the pointed type

    5. -
      pointer operator->() const;
      +
      pointer operator->() const;

      Returns the pointer pointing to the owned object

    6. -
      pointer get() const;
      +
      pointer get() const;

      Returns the pointer pointing to the owned object

    7. -
      bool operator!() const;
      +
      bool operator!() const;

      Not operator. Returns true if this->get() != 0, false otherwise

    8. -
      bool unique() const;
      +
      bool unique() const;

      Returns use_count() == 1. unique() might be faster than use_count()

    9. -
      long use_count() const;
      +
      long use_count() const;

      Returns the number of shared_ptr objects, *this included, that share ownership with *this, or an unspecified nonnegative value when *this is empty. use_count() is not necessarily efficient. Use only for debugging and testing purposes, not for production code.

    10. -
      void swap(shared_ptr< T, VoidAllocator, Deleter > & other);
      +
      void swap(shared_ptr< T, VoidAllocator, Deleter > & other);

      Exchanges the contents of the two smart pointers.

    diff --git a/doc/html/boost/interprocess/simple_seq_fit.html b/doc/html/boost/interprocess/simple_seq_fit.html index 408b774d00..88849fd54c 100644 --- a/doc/html/boost/interprocess/simple_seq_fit.html +++ b/doc/html/boost/interprocess/simple_seq_fit.html @@ -39,7 +39,7 @@ typedef base_t::size_type size_type; // construct/copy/destruct - simple_seq_fit(size_type, size_type); + simple_seq_fit(size_type, size_type); };

    Description

    @@ -50,7 +50,7 @@ public construct/copy/destruct
    1. -
      simple_seq_fit(size_type segment_size, size_type extra_hdr_bytes);
      +
      simple_seq_fit(size_type segment_size, size_type extra_hdr_bytes);

      Constructor. "size" is the total size of the managed memory segment, "extra_hdr_bytes" indicates the extra bytes beginning in the sizeof(simple_seq_fit) offset that the allocator should not use at all.

    diff --git a/doc/html/boost/interprocess/swap_idp40312352.html b/doc/html/boost/interprocess/swap_idp40312352.html new file mode 100644 index 0000000000..9dbcb39ad5 --- /dev/null +++ b/doc/html/boost/interprocess/swap_idp40312352.html @@ -0,0 +1,56 @@ + + + + +Function template swap + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Function template swap

    +

    boost::interprocess::swap

    +
    +

    Synopsis

    +
    // In header: <boost/interprocess/smart_ptr/intrusive_ptr.hpp>
+
+
+template<typename T, typename VP> 
+  void swap(intrusive_ptr< T, VP > & lhs, intrusive_ptr< T, VP > & rhs);
    +
    +

    Description

    +

    Exchanges the contents of the two intrusive_ptrs. Does not throw

    +
    +
    + + + +
    Copyright © 2005-2015 Ion Gaztanaga

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/interprocess/swap_idp40362672.html b/doc/html/boost/interprocess/swap_idp40362672.html new file mode 100644 index 0000000000..27e1f45086 --- /dev/null +++ b/doc/html/boost/interprocess/swap_idp40362672.html @@ -0,0 +1,56 @@ + + + + +Function template swap + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Function template swap

    +

    boost::interprocess::swap

    +
    +

    Synopsis

    +
    // In header: <boost/interprocess/smart_ptr/scoped_ptr.hpp>
+
+
+template<typename T, typename D> 
+  void swap(scoped_ptr< T, D > & a, scoped_ptr< T, D > & b);
    +
    +

    Description

    +

    Exchanges the internal pointer and deleter with other scoped_ptr Never throws.

    +
    +
    + + + +
    Copyright © 2005-2015 Ion Gaztanaga

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/interprocess/swap_idp56209056.html b/doc/html/boost/interprocess/swap_idp56209056.html deleted file mode 100644 index 5ad60f0b87..0000000000 --- a/doc/html/boost/interprocess/swap_idp56209056.html +++ /dev/null @@ -1,56 +0,0 @@ - - - - -Function template swap - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Function template swap

    -

    boost::interprocess::swap

    -
    -

    Synopsis

    -
    // In header: <boost/interprocess/smart_ptr/intrusive_ptr.hpp>
-
-
-template<typename T, typename VP> 
-  void swap(intrusive_ptr< T, VP > & lhs, intrusive_ptr< T, VP > & rhs);
    -
    -

    Description

    -

    Exchanges the contents of the two intrusive_ptrs. Does not throw

    -
    -
    - - - -
    Copyright © 2005-2015 Ion Gaztanaga

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/interprocess/swap_idp56259376.html b/doc/html/boost/interprocess/swap_idp56259376.html deleted file mode 100644 index 0462de1072..0000000000 --- a/doc/html/boost/interprocess/swap_idp56259376.html +++ /dev/null @@ -1,56 +0,0 @@ - - - - -Function template swap - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Function template swap

    -

    boost::interprocess::swap

    -
    -

    Synopsis

    -
    // In header: <boost/interprocess/smart_ptr/scoped_ptr.hpp>
-
-
-template<typename T, typename D> 
-  void swap(scoped_ptr< T, D > & a, scoped_ptr< T, D > & b);
    -
    -

    Description

    -

    Exchanges the internal pointer and deleter with other scoped_ptr Never throws.

    -
    -
    - - - -
    Copyright © 2005-2015 Ion Gaztanaga

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/interprocess/to_raw_pointer_idp40322096.html b/doc/html/boost/interprocess/to_raw_pointer_idp40322096.html new file mode 100644 index 0000000000..56b0d77c23 --- /dev/null +++ b/doc/html/boost/interprocess/to_raw_pointer_idp40322096.html @@ -0,0 +1,57 @@ + + + + +Function template to_raw_pointer + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Function template to_raw_pointer

    +

    boost::interprocess::to_raw_pointer

    +
    +

    Synopsis

    +
    // In header: <boost/interprocess/smart_ptr/intrusive_ptr.hpp>
+
+
+template<typename T, typename VP> 
+  boost::interprocess::intrusive_ptr< T, VP >::pointer 
+  to_raw_pointer(intrusive_ptr< T, VP > p);
    +
    +

    Description

    +

    Returns p.get(). Does not throw

    +
    +
    + + + +
    Copyright © 2005-2015 Ion Gaztanaga

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/interprocess/to_raw_pointer_idp40368064.html b/doc/html/boost/interprocess/to_raw_pointer_idp40368064.html new file mode 100644 index 0000000000..f949771950 --- /dev/null +++ b/doc/html/boost/interprocess/to_raw_pointer_idp40368064.html @@ -0,0 +1,56 @@ + + + + +Function template to_raw_pointer + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Function template to_raw_pointer

    +

    boost::interprocess::to_raw_pointer

    +
    +

    Synopsis

    +
    // In header: <boost/interprocess/smart_ptr/scoped_ptr.hpp>
+
+
+template<typename T, typename D> 
+  scoped_ptr< T, D >::pointer to_raw_pointer(scoped_ptr< T, D > const & p);
    +
    +

    Description

    +

    Returns a copy of the stored pointer Never throws

    +
    +
    + + + +
    Copyright © 2005-2015 Ion Gaztanaga

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/interprocess/to_raw_pointer_idp56218800.html b/doc/html/boost/interprocess/to_raw_pointer_idp56218800.html deleted file mode 100644 index 523ae600f6..0000000000 --- a/doc/html/boost/interprocess/to_raw_pointer_idp56218800.html +++ /dev/null @@ -1,57 +0,0 @@ - - - - -Function template to_raw_pointer - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Function template to_raw_pointer

    -

    boost::interprocess::to_raw_pointer

    -
    -

    Synopsis

    -
    // In header: <boost/interprocess/smart_ptr/intrusive_ptr.hpp>
-
-
-template<typename T, typename VP> 
-  boost::interprocess::intrusive_ptr< T, VP >::pointer 
-  to_raw_pointer(intrusive_ptr< T, VP > p);
    -
    -

    Description

    -

    Returns p.get(). Does not throw

    -
    -
    - - - -
    Copyright © 2005-2015 Ion Gaztanaga

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/interprocess/to_raw_pointer_idp56264768.html b/doc/html/boost/interprocess/to_raw_pointer_idp56264768.html deleted file mode 100644 index ba425d755c..0000000000 --- a/doc/html/boost/interprocess/to_raw_pointer_idp56264768.html +++ /dev/null @@ -1,56 +0,0 @@ - - - - -Function template to_raw_pointer - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Function template to_raw_pointer

    -

    boost::interprocess::to_raw_pointer

    -
    -

    Synopsis

    -
    // In header: <boost/interprocess/smart_ptr/scoped_ptr.hpp>
-
-
-template<typename T, typename D> 
-  scoped_ptr< T, D >::pointer to_raw_pointer(scoped_ptr< T, D > const & p);
    -
    -

    Description

    -

    Returns a copy of the stored pointer Never throws

    -
    -
    - - - -
    Copyright © 2005-2015 Ion Gaztanaga

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/interprocess/unordered_map_index.html b/doc/html/boost/interprocess/unordered_map_index.html index a0465288cc..96c7aa2a79 100644 --- a/doc/html/boost/interprocess/unordered_map_index.html +++ b/doc/html/boost/interprocess/unordered_map_index.html @@ -38,11 +38,11 @@ { public: // construct/copy/destruct - unordered_map_index(segment_manager_base *); + unordered_map_index(segment_manager_base *); - // public member functions - void reserve(typename segment_manager_base::size_type); - void shrink_to_fit(); + // public member functions + void reserve(typename segment_manager_base::size_type); + void shrink_to_fit(); };

    Description

    @@ -53,20 +53,20 @@ public construct/copy/destruct
    1. -
      unordered_map_index(segment_manager_base * segment_mngr);
      +
      unordered_map_index(segment_manager_base * segment_mngr);

      Constructor. Takes a pointer to the segment manager. Can throw

    -unordered_map_index public member functions

    +unordered_map_index public member functions
    1. -
      void reserve(typename segment_manager_base::size_type n);
      +
      void reserve(typename segment_manager_base::size_type n);

      This reserves memory to optimize the insertion of n elements in the index

    2. -
      void shrink_to_fit();
      +
      void shrink_to_fit();

      This tries to free previously allocate unused memory.

    diff --git a/doc/html/boost/interprocess/upgradable_lock.html b/doc/html/boost/interprocess/upgradable_lock.html index 2b08b7cd9e..c0ec7b69bc 100644 --- a/doc/html/boost/interprocess/upgradable_lock.html +++ b/doc/html/boost/interprocess/upgradable_lock.html @@ -39,29 +39,29 @@ typedef UpgradableMutex mutex_type; // construct/copy/destruct - upgradable_lock(); - explicit upgradable_lock(mutex_type &); - upgradable_lock(mutex_type &, defer_lock_type); - upgradable_lock(mutex_type &, accept_ownership_type); - upgradable_lock(mutex_type &, try_to_lock_type); - upgradable_lock(mutex_type &, const boost::posix_time::ptime &); - upgradable_lock(upgradable_lock< mutex_type > &&); - template<typename T> upgradable_lock(scoped_lock< T > &&, unspecified = 0); + upgradable_lock(); + explicit upgradable_lock(mutex_type &); + upgradable_lock(mutex_type &, defer_lock_type); + upgradable_lock(mutex_type &, accept_ownership_type); + upgradable_lock(mutex_type &, try_to_lock_type); + upgradable_lock(mutex_type &, const boost::posix_time::ptime &); + upgradable_lock(upgradable_lock< mutex_type > &&); + template<typename T> upgradable_lock(scoped_lock< T > &&, unspecified = 0); template<typename T> - upgradable_lock(sharable_lock< T > &&, try_to_lock_type, unspecified = 0); - upgradable_lock & operator=(upgradable_lock &&); - ~upgradable_lock(); + upgradable_lock(sharable_lock< T > &&, try_to_lock_type, unspecified = 0); + upgradable_lock & operator=(upgradable_lock &&); + ~upgradable_lock(); - // public member functions - void lock(); - bool try_lock(); - bool timed_lock(const boost::posix_time::ptime &); - void unlock(); - bool owns() const; - operator unspecified_bool_type() const; - mutex_type * mutex() const; - mutex_type * release(); - void swap(upgradable_lock< mutex_type > &); + // public member functions + void lock(); + bool try_lock(); + bool timed_lock(const boost::posix_time::ptime &); + void unlock(); + bool owns() const; + operator unspecified_bool_type() const; + mutex_type * mutex() const; + mutex_type * release(); + void swap(upgradable_lock< mutex_type > &); };

    Description

    @@ -73,89 +73,89 @@ construct/copy/destruct
    1. -
      upgradable_lock();
      +
      upgradable_lock();

      Effects: Default constructs a upgradable_lock. Postconditions: owns() == false and mutex() == 0.

      2. -
    2. explicit upgradable_lock(mutex_type & m);
      3. +
    3. explicit upgradable_lock(mutex_type & m);
    4. -
      upgradable_lock(mutex_type & m, defer_lock_type);
      +
      upgradable_lock(mutex_type & m, defer_lock_type);

      Postconditions: owns() == false, and mutex() == &m. Notes: The constructor will not take ownership of the mutex. There is no effect required on the referenced mutex.

    5. -
      upgradable_lock(mutex_type & m, accept_ownership_type);
      +
      upgradable_lock(mutex_type & m, accept_ownership_type);

      Postconditions: owns() == true, and mutex() == &m. Notes: The constructor will suppose that the mutex is already upgradable locked. There is no effect required on the referenced mutex.

    6. -
      upgradable_lock(mutex_type & m, try_to_lock_type);
      +
      upgradable_lock(mutex_type & m, try_to_lock_type);

      Effects: m.try_lock_upgradable(). Postconditions: mutex() == &m. owns() == the return value of the m.try_lock_upgradable() executed within the constructor. Notes: The constructor will take upgradable-ownership of the mutex if it can do so without waiting. Whether or not this constructor handles recursive locking depends upon the mutex. If the mutex_type does not support try_lock_upgradable, this constructor will fail at compile time if instantiated, but otherwise have no effect.

    7. -
      upgradable_lock(mutex_type & m, const boost::posix_time::ptime & abs_time);
      +
      upgradable_lock(mutex_type & m, const boost::posix_time::ptime & abs_time);

      Effects: m.timed_lock_upgradable(abs_time) Postconditions: mutex() == &m. owns() == the return value of the m.timed_lock_upgradable() executed within the constructor. Notes: The constructor will take upgradable-ownership of the mutex if it can do so within the time specified. Whether or not this constructor handles recursive locking depends upon the mutex. If the mutex_type does not support timed_lock_upgradable, this constructor will fail at compile time if instantiated, but otherwise have no effect.

    8. -
      upgradable_lock(upgradable_lock< mutex_type > && upgr);
      +
      upgradable_lock(upgradable_lock< mutex_type > && upgr);

      Effects: No effects on the underlying mutex. Postconditions: mutex() == the value upgr.mutex() had before the construction. upgr.mutex() == 0. owns() == upgr.owns() before the construction. upgr.owns() == false. Notes: If upgr is locked, this constructor will lock this upgradable_lock while unlocking upgr. If upgr is unlocked, then this upgradable_lock will be unlocked as well. Only a moved upgradable_lock's will match this signature. An non-moved upgradable_lock can be moved with the expression: "boost::move(lock);". This constructor does not alter the state of the mutex, only potentially who owns it. 

    9. template<typename T> 
-  upgradable_lock(scoped_lock< T > && scop, unspecified = 0);
      + upgradable_lock(scoped_lock< T > && scop, unspecified = 0);

      Effects: If scop.owns(), m_.unlock_and_lock_upgradable(). Postconditions: mutex() == the value scop.mutex() had before the construction. scop.mutex() == 0. owns() == scop.owns() before the constructor. After the construction, scop.owns() == false. Notes: If scop is locked, this constructor will transfer the exclusive-ownership to an upgradable-ownership of this upgradable_lock. Only a moved sharable_lock's will match this signature. An non-moved sharable_lock can be moved with the expression: "boost::move(lock);". 

    10. template<typename T> 
-  upgradable_lock(sharable_lock< T > && shar, try_to_lock_type, 
+  upgradable_lock(sharable_lock< T > && shar, try_to_lock_type, 
                   unspecified = 0);

      Effects: If shar.owns() then calls try_unlock_sharable_and_lock_upgradable() on the referenced mutex. a)if try_unlock_sharable_and_lock_upgradable() returns true then mutex() obtains the value from shar.release() and owns() is set to true. b)if try_unlock_sharable_and_lock_upgradable() returns false then shar is unaffected and this upgradable_lock construction has the same effects as a default construction. c)Else shar.owns() is false. mutex() obtains the value from shar.release() and owns() is set to false. Notes: This construction will not block. It will try to obtain mutex ownership from shar immediately, while changing the lock type from a "read lock" to an "upgradable lock". If the "read lock" isn't held in the first place, the mutex merely changes type to an unlocked "upgradable lock". If the "read lock" is held, then mutex transfer occurs only if it can do so in a non-blocking manner.

    11. -
      upgradable_lock & operator=(upgradable_lock && upgr);
      +
      upgradable_lock & operator=(upgradable_lock && upgr);

      Effects: If owns(), then unlock_upgradable() is called on mutex(). *this gets the state of upgr and upgr gets set to a default constructed state. Notes: With a recursive mutex it is possible that both this and upgr own the mutex before the assignment. In this case, this will own the mutex after the assignment (and upgr will not), but the mutex's upgradable lock count will be decremented by one.

    12. -
      ~upgradable_lock();
      +
      ~upgradable_lock();

      Effects: if (owns()) m_->unlock_upgradable(). Notes: The destructor behavior ensures that the mutex lock is not leaked.

    -upgradable_lock public member functions

    +upgradable_lock public member functions
    1. -
      void lock();
      +
      void lock();

      Effects: If mutex() == 0 or if already locked, throws a lock_exception() exception. Calls lock_upgradable() on the referenced mutex. Postconditions: owns() == true. Notes: The sharable_lock changes from a state of not owning the mutex, to owning the mutex, blocking if necessary.

    2. -
      bool try_lock();
      +
      bool try_lock();

      Effects: If mutex() == 0 or if already locked, throws a lock_exception() exception. Calls try_lock_upgradable() on the referenced mutex. Postconditions: owns() == the value returned from mutex()->try_lock_upgradable(). Notes: The upgradable_lock changes from a state of not owning the mutex, to owning the mutex, but only if blocking was not required. If the mutex_type does not support try_lock_upgradable(), this function will fail at compile time if instantiated, but otherwise have no effect.

    3. -
      bool timed_lock(const boost::posix_time::ptime & abs_time);
      +
      bool timed_lock(const boost::posix_time::ptime & abs_time);

      Effects: If mutex() == 0 or if already locked, throws a lock_exception() exception. Calls timed_lock_upgradable(abs_time) on the referenced mutex. Postconditions: owns() == the value returned from mutex()->timed_lock_upgradable(abs_time). Notes: The upgradable_lock changes from a state of not owning the mutex, to owning the mutex, but only if it can obtain ownership within the specified time. If the mutex_type does not support timed_lock_upgradable(abs_time), this function will fail at compile time if instantiated, but otherwise have no effect.

    4. -
      void unlock();
      +
      void unlock();

      Effects: If mutex() == 0 or if not locked, throws a lock_exception() exception. Calls unlock_upgradable() on the referenced mutex. Postconditions: owns() == false. Notes: The upgradable_lock changes from a state of owning the mutex, to not owning the mutex.

    5. -
      bool owns() const;
      +
      bool owns() const;

      Effects: Returns true if this scoped_lock has acquired the referenced mutex.

    6. -
      operator unspecified_bool_type() const;
      +
      operator unspecified_bool_type() const;

      Conversion to bool. Returns owns().

    7. -
      mutex_type * mutex() const;
      +
      mutex_type * mutex() const;

      Effects: Returns a pointer to the referenced mutex, or 0 if there is no mutex to reference.

    8. -
      mutex_type * release();
      +
      mutex_type * release();

      Effects: Returns a pointer to the referenced mutex, or 0 if there is no mutex to reference. Postconditions: mutex() == 0 and owns() == false.

    9. -
      void swap(upgradable_lock< mutex_type > & other);
      +
      void swap(upgradable_lock< mutex_type > & other);

      Effects: Swaps state with moved lock. Throws: Nothing.

    diff --git a/doc/html/boost/interprocess/weak_ptr.html b/doc/html/boost/interprocess/weak_ptr.html index edfd7df5b8..5c7c4f0954 100644 --- a/doc/html/boost/interprocess/weak_ptr.html +++ b/doc/html/boost/interprocess/weak_ptr.html @@ -40,18 +40,18 @@ typedef T value_type; // construct/copy/destruct - weak_ptr(); - template<typename Y> weak_ptr(weak_ptr< Y, A, D > const &); - template<typename Y> weak_ptr(shared_ptr< Y, A, D > const &); - template<typename Y> weak_ptr & operator=(weak_ptr< Y, A, D > const &); - template<typename Y> weak_ptr & operator=(shared_ptr< Y, A, D > const &); + weak_ptr(); + template<typename Y> weak_ptr(weak_ptr< Y, A, D > const &); + template<typename Y> weak_ptr(shared_ptr< Y, A, D > const &); + template<typename Y> weak_ptr & operator=(weak_ptr< Y, A, D > const &); + template<typename Y> weak_ptr & operator=(shared_ptr< Y, A, D > const &); - // public member functions - shared_ptr< T, A, D > lock() const; - long use_count() const; - bool expired() const; - void reset(); - void swap(this_type &); + // public member functions + shared_ptr< T, A, D > lock() const; + long use_count() const; + bool expired() const; + void reset(); + void swap(this_type &); };

    Description

    @@ -66,29 +66,29 @@ construct/copy/destruct
    1. -
      weak_ptr();
      +
      weak_ptr();

      Effects: Constructs an empty weak_ptr. Postconditions: use_count() == 0.

    2. -
      template<typename Y> weak_ptr(weak_ptr< Y, A, D > const & r);
      +
      template<typename Y> weak_ptr(weak_ptr< Y, A, D > const & r);

      Effects: If r is empty, constructs an empty weak_ptr; otherwise, constructs a weak_ptr that shares ownership with r as if by storing a copy of the pointer stored in r.

      Postconditions: use_count() == r.use_count().

      Throws: nothing.

    3. -
      template<typename Y> weak_ptr(shared_ptr< Y, A, D > const & r);
      +
      template<typename Y> weak_ptr(shared_ptr< Y, A, D > const & r);

      Effects: If r is empty, constructs an empty weak_ptr; otherwise, constructs a weak_ptr that shares ownership with r as if by storing a copy of the pointer stored in r.

      Postconditions: use_count() == r.use_count().

      Throws: nothing.

    4. -
      template<typename Y> weak_ptr & operator=(weak_ptr< Y, A, D > const & r);
      +
      template<typename Y> weak_ptr & operator=(weak_ptr< Y, A, D > const & r);

      Effects: Equivalent to weak_ptr(r).swap(*this).

      Throws: nothing.

      Notes: The implementation is free to meet the effects (and the implied guarantees) via different means, without creating a temporary.

    5. -
      template<typename Y> weak_ptr & operator=(shared_ptr< Y, A, D > const & r);
      +
      template<typename Y> weak_ptr & operator=(shared_ptr< Y, A, D > const & r);

      Effects: Equivalent to weak_ptr(r).swap(*this).

      Throws: nothing.

      Notes: The implementation is free to meet the effects (and the implied guarantees) via different means, without creating a temporary.

      @@ -97,31 +97,31 @@

    -weak_ptr public member functions

    +weak_ptr public member functions
    1. -
      shared_ptr< T, A, D > lock() const;
      +
      shared_ptr< T, A, D > lock() const;

      Returns: expired()? shared_ptr<T>(): shared_ptr<T>(*this).

      Throws: nothing.

    2. -
      long use_count() const;
      +
      long use_count() const;

      Returns: 0 if *this is empty; otherwise, the number of shared_ptr objects that share ownership with *this.

      Throws: nothing.

      Notes: use_count() is not necessarily efficient. Use only for debugging and testing purposes, not for production code.

    3. -
      bool expired() const;
      +
      bool expired() const;

      Returns: Returns: use_count() == 0.

      Throws: nothing.

      Notes: expired() may be faster than use_count().

    4. -
      void reset();
      +
      void reset();

      Effects: Equivalent to: weak_ptr().swap(*this).

    5. -
      void swap(this_type & other);
      +
      void swap(this_type & other);

      Effects: Exchanges the contents of the two smart pointers.

      Throws: nothing.

      6. diff --git a/doc/html/boost/interprocess/wfixed_managed_idp39634704.html b/doc/html/boost/interprocess/wfixed_managed_idp39634704.html new file mode 100644 index 0000000000..d48ea27996 --- /dev/null +++ b/doc/html/boost/interprocess/wfixed_managed_idp39634704.html @@ -0,0 +1,55 @@ + + + + +Type definition wfixed_managed_shared_memory + + + + + + + + + + + + + + + +
      Boost C++ LibrariesHomeLibrariesPeopleFAQMore
      +
      +
      +PrevUpHomeNext +
      +
      +
      +
      +

      Type definition wfixed_managed_shared_memory

      +

      wfixed_managed_shared_memory

      +
      +

      Synopsis

      +
      // In header: <boost/interprocess/managed_shared_memory.hpp>
+
+
+typedef basic_managed_shared_memory< wchar_t,rbtree_best_fit< mutex_family, void * >,iset_index > wfixed_managed_shared_memory;
      +
      +

      Description

      +

      Typedef for a default basic_managed_shared_memory of narrow characters to be placed in a fixed address

      +
      +
      + + + +
      Copyright © 2005-2015 Ion Gaztanaga

      + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

      +
      +
      +
      +PrevUpHomeNext +
      + + diff --git a/doc/html/boost/interprocess/wfixed_managed_idp55540144.html b/doc/html/boost/interprocess/wfixed_managed_idp55540144.html deleted file mode 100644 index e5d60509fb..0000000000 --- a/doc/html/boost/interprocess/wfixed_managed_idp55540144.html +++ /dev/null @@ -1,55 +0,0 @@ - - - - -Type definition wfixed_managed_shared_memory - - - - - - - - - - - - - - - -
      Boost C++ LibrariesHomeLibrariesPeopleFAQMore
      -
      -
      -PrevUpHomeNext -
      -
      -
      -
      -

      Type definition wfixed_managed_shared_memory

      -

      wfixed_managed_shared_memory

      -
      -

      Synopsis

      -
      // In header: <boost/interprocess/managed_shared_memory.hpp>
-
-
-typedef basic_managed_shared_memory< wchar_t,rbtree_best_fit< mutex_family, void * >,iset_index > wfixed_managed_shared_memory;
      -
      -

      Description

      -

      Typedef for a default basic_managed_shared_memory of narrow characters to be placed in a fixed address

      -
      -
      - - - -
      Copyright © 2005-2015 Ion Gaztanaga

      - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

      -
      -
      -
      -PrevUpHomeNext -
      - - diff --git a/doc/html/boost/interprocess/windows_shared_memory.html b/doc/html/boost/interprocess/windows_shared_memory.html index 14b1b139d1..02761f0711 100644 --- a/doc/html/boost/interprocess/windows_shared_memory.html +++ b/doc/html/boost/interprocess/windows_shared_memory.html @@ -36,22 +36,22 @@ class windows_shared_memory { public: // construct/copy/destruct - windows_shared_memory(); - windows_shared_memory(create_only_t, const char *, mode_t, std::size_t, + windows_shared_memory(); + windows_shared_memory(create_only_t, const char *, mode_t, std::size_t, const permissions & = permissions()); - windows_shared_memory(open_or_create_t, const char *, mode_t, std::size_t, + windows_shared_memory(open_or_create_t, const char *, mode_t, std::size_t, const permissions & = permissions()); - windows_shared_memory(open_only_t, const char *, mode_t); - windows_shared_memory(windows_shared_memory &&); - windows_shared_memory & operator=(windows_shared_memory &&); - ~windows_shared_memory(); + windows_shared_memory(open_only_t, const char *, mode_t); + windows_shared_memory(windows_shared_memory &&); + windows_shared_memory & operator=(windows_shared_memory &&); + ~windows_shared_memory(); - // public member functions - void swap(windows_shared_memory &); - const char * get_name() const; - mode_t get_mode() const; - mapping_handle_t get_mapping_handle() const; - offset_t get_size() const; + // public member functions + void swap(windows_shared_memory &); + const char * get_name() const; + mode_t get_mode() const; + mapping_handle_t get_mapping_handle() const; + offset_t get_size() const; };

    Description

    @@ -64,53 +64,53 @@ construct/copy/destruct
    1. -
      windows_shared_memory();
      +
      windows_shared_memory();

      Default constructor. Represents an empty windows_shared_memory.

    2. -
      windows_shared_memory(create_only_t, const char * name, mode_t mode, 
+
      windows_shared_memory(create_only_t, const char * name, mode_t mode, 
                       std::size_t size, 
                       const permissions & perm = permissions());
      
 
      Creates a new native shared memory with name "name" and at least size "size", with the access mode "mode". If the file previously exists, throws an error.
    3. -
      windows_shared_memory(open_or_create_t, const char * name, mode_t mode, 
+
      windows_shared_memory(open_or_create_t, const char * name, mode_t mode, 
                       std::size_t size, 
                       const permissions & perm = permissions());
      
 
      Tries to create a shared memory object with name "name" and at least size "size", with the access mode "mode". If the file previously exists, it tries to open it with mode "mode". Otherwise throws an error.
    4. -
      windows_shared_memory(open_only_t, const char * name, mode_t mode);
      +
      windows_shared_memory(open_only_t, const char * name, mode_t mode);

      Tries to open a shared memory object with name "name", with the access mode "mode". If the file does not previously exist, it throws an error.

    5. -
      windows_shared_memory(windows_shared_memory && moved);
      +
      windows_shared_memory(windows_shared_memory && moved);

      Moves the ownership of "moved"'s shared memory object to *this. After the call, "moved" does not represent any shared memory object. Does not throw

    6. -
      windows_shared_memory & operator=(windows_shared_memory && moved);
      +
      windows_shared_memory & operator=(windows_shared_memory && moved);

      Moves the ownership of "moved"'s shared memory to *this. After the call, "moved" does not represent any shared memory. Does not throw

    7. -
      ~windows_shared_memory();
      +
      ~windows_shared_memory();

      Destroys *this. All mapped regions are still valid after destruction. When all mapped regions and windows_shared_memory objects referring the shared memory are destroyed, the operating system will destroy the shared memory.

    -windows_shared_memory public member functions

    +windows_shared_memory public member functions
    1. -
      void swap(windows_shared_memory & other);
      Swaps to shared_memory_objects. Does not throw.
      2. +
      void swap(windows_shared_memory & other);
      Swaps to shared_memory_objects. Does not throw.
    2. -
      const char * get_name() const;
      Returns the name of the shared memory.
      3. +
      const char * get_name() const;
      Returns the name of the shared memory.
    3. -
      mode_t get_mode() const;
      Returns access mode.
      4. +
      mode_t get_mode() const;
      Returns access mode.
    4. -
      mapping_handle_t get_mapping_handle() const;
      Returns the mapping handle. Never throws.
      5. +
      mapping_handle_t get_mapping_handle() const;
      Returns the mapping handle. Never throws.
    5. -
      offset_t get_size() const;
      +
      offset_t get_size() const;

      Returns the size of the windows shared memory. It will be a 4K rounded size of the "size" passed in the constructor.

    diff --git a/doc/html/boost/interprocess/wmanaged_external_buffer.html b/doc/html/boost/interprocess/wmanaged_external_buffer.html index d4bca2fdc1..868fdf74ae 100644 --- a/doc/html/boost/interprocess/wmanaged_external_buffer.html +++ b/doc/html/boost/interprocess/wmanaged_external_buffer.html @@ -33,10 +33,10 @@ 
    // In header: <boost/interprocess/managed_external_buffer.hpp>
 
 
-typedef basic_managed_external_buffer< wchar_t,rbtree_best_fit< null_mutex_family >,iset_index > wmanaged_external_buffer;
    +typedef basic_managed_external_buffer< wchar_t,rbtree_best_fit< null_mutex_family >,iset_index > wmanaged_external_buffer;

    Description

    -

    Typedef for a default basic_managed_external_buffer of wide characters

    +

    Typedef for a default basic_managed_external_buffer of wide characters

    diff --git a/doc/html/boost/interprocess/wmanaged_mapped_file.html b/doc/html/boost/interprocess/wmanaged_mapped_file.html index 2eb6917652..88a78e08bb 100644 --- a/doc/html/boost/interprocess/wmanaged_mapped_file.html +++ b/doc/html/boost/interprocess/wmanaged_mapped_file.html @@ -8,7 +8,7 @@ - +
    @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -49,7 +49,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/interprocess/wmanaged_shared_memory.html b/doc/html/boost/interprocess/wmanaged_shared_memory.html index e8d7727674..cf71305318 100644 --- a/doc/html/boost/interprocess/wmanaged_shared_memory.html +++ b/doc/html/boost/interprocess/wmanaged_shared_memory.html @@ -8,7 +8,7 @@ - + @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -33,10 +33,10 @@ 
    // In header: <boost/interprocess/managed_shared_memory.hpp>
 
 
-typedef basic_managed_shared_memory< wchar_t,rbtree_best_fit< mutex_family >,iset_index > wmanaged_shared_memory;
    +typedef basic_managed_shared_memory< wchar_t,rbtree_best_fit< mutex_family >,iset_index > wmanaged_shared_memory;

    Description

    -

    Typedef for a default basic_managed_shared_memory of wide characters

    +

    Typedef for a default basic_managed_shared_memory of wide characters

    @@ -49,7 +49,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/interprocess/wmanaged_windo_idp39683440.html b/doc/html/boost/interprocess/wmanaged_windo_idp39683440.html new file mode 100644 index 0000000000..08f29ea4ed --- /dev/null +++ b/doc/html/boost/interprocess/wmanaged_windo_idp39683440.html @@ -0,0 +1,55 @@ + + + + +Type definition wmanaged_windows_shared_memory + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Type definition wmanaged_windows_shared_memory

    +

    wmanaged_windows_shared_memory

    +
    +

    Synopsis

    +
    // In header: <boost/interprocess/managed_windows_shared_memory.hpp>
+
+
+typedef basic_managed_windows_shared_memory< wchar_t,rbtree_best_fit< mutex_family >,iset_index > wmanaged_windows_shared_memory;
    +
    +

    Description

    +

    Typedef for a default basic_managed_windows_shared_memory of wide characters

    +
    +
    + + + +
    Copyright © 2005-2015 Ion Gaztanaga

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/interprocess/wmanaged_windo_idp55588880.html b/doc/html/boost/interprocess/wmanaged_windo_idp55588880.html deleted file mode 100644 index 0defbffd2d..0000000000 --- a/doc/html/boost/interprocess/wmanaged_windo_idp55588880.html +++ /dev/null @@ -1,55 +0,0 @@ - - - - -Type definition wmanaged_windows_shared_memory - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Type definition wmanaged_windows_shared_memory

    -

    wmanaged_windows_shared_memory

    -
    -

    Synopsis

    -
    // In header: <boost/interprocess/managed_windows_shared_memory.hpp>
-
-
-typedef basic_managed_windows_shared_memory< wchar_t,rbtree_best_fit< mutex_family >,iset_index > wmanaged_windows_shared_memory;
    -
    -

    Description

    -

    Typedef for a default basic_managed_windows_shared_memory of wide characters

    -
    -
    - - - -
    Copyright © 2005-2015 Ion Gaztanaga

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/interprocess/wmanaged_xsi_shared_memory.html b/doc/html/boost/interprocess/wmanaged_xsi_shared_memory.html index 6ad349c278..64fb9b38a6 100644 --- a/doc/html/boost/interprocess/wmanaged_xsi_shared_memory.html +++ b/doc/html/boost/interprocess/wmanaged_xsi_shared_memory.html @@ -33,10 +33,10 @@ 
    // In header: <boost/interprocess/managed_xsi_shared_memory.hpp>
 
 
-typedef basic_managed_xsi_shared_memory< wchar_t,rbtree_best_fit< mutex_family >,iset_index > wmanaged_xsi_shared_memory;
    +typedef basic_managed_xsi_shared_memory< wchar_t,rbtree_best_fit< mutex_family >,iset_index > wmanaged_xsi_shared_memory;

    Description

    -

    Typedef for a default basic_managed_xsi_shared_memory of wide characters

    +

    Typedef for a default basic_managed_xsi_shared_memory of wide characters

    diff --git a/doc/html/boost/interprocess/xsi_key.html b/doc/html/boost/interprocess/xsi_key.html index 1ec165546a..491ec35f5f 100644 --- a/doc/html/boost/interprocess/xsi_key.html +++ b/doc/html/boost/interprocess/xsi_key.html @@ -36,12 +36,12 @@ classxsi_key{public:// construct/copy/destruct - xsi_key(); - explicitxsi_key(key_t); - xsi_key(constchar*,boost::uint8_t); + xsi_key(); + explicitxsi_key(key_t); + xsi_key(constchar*,boost::uint8_t); - // public member functions - key_tget_key()const; + // public member functions + key_tget_key()const;};

    Description

    @@ -53,22 +53,22 @@ construct/copy/destruct
    1. -
      xsi_key();
      +
      xsi_key();

      Default constructor. Represents a private xsi_key.

    2. -
      explicit xsi_key(key_t key);
      Creates a new XSI key using a specified value. Constructor is explicit to avoid ambiguity with shmid.
      3. +
      explicit xsi_key(key_t key);
      Creates a new XSI key using a specified value. Constructor is explicit to avoid ambiguity with shmid.
    3. -
      xsi_key(const char * path, boost::uint8_t id);
      +
      xsi_key(const char * path, boost::uint8_t id);

      Creates a new XSI shared memory with a key obtained from a call to ftok (with path "path" and id "id"), of size "size" and permissions "perm". If the shared memory previously exists, throws an error.

    -xsi_key public member functions

    +xsi_key public member functions
    1. -
      key_t get_key() const;
      Returns the internal key_t value.
    +
    key_t get_key() const;
    Returns the internal key_t value.
    diff --git a/doc/html/boost/interprocess/xsi_shared_memory.html b/doc/html/boost/interprocess/xsi_shared_memory.html index 2e5f7c1a74..aeed2d8ab8 100644 --- a/doc/html/boost/interprocess/xsi_shared_memory.html +++ b/doc/html/boost/interprocess/xsi_shared_memory.html @@ -36,24 +36,24 @@ classxsi_shared_memory{public:// construct/copy/destruct - xsi_shared_memory(); - xsi_shared_memory(open_only_t,int); - xsi_shared_memory(create_only_t,constxsi_key&,std::size_t, + xsi_shared_memory(); + xsi_shared_memory(open_only_t,int); + xsi_shared_memory(create_only_t,constxsi_key&,std::size_t,constpermissions&=permissions()); - xsi_shared_memory(open_or_create_t,constxsi_key&,std::size_t, + xsi_shared_memory(open_or_create_t,constxsi_key&,std::size_t,constpermissions&=permissions()); - xsi_shared_memory(open_only_t,constxsi_key&); - xsi_shared_memory(xsi_shared_memory&&); - xsi_shared_memory&operator=(xsi_shared_memory&&); - ~xsi_shared_memory(); + xsi_shared_memory(open_only_t,constxsi_key&); + xsi_shared_memory(xsi_shared_memory&&); + xsi_shared_memory&operator=(xsi_shared_memory&&); + ~xsi_shared_memory(); - // public member functions - voidswap(xsi_shared_memory&); - intget_shmid()const; - mapping_handle_tget_mapping_handle()const; + // public member functions + voidswap(xsi_shared_memory&); + intget_shmid()const; + mapping_handle_tget_mapping_handle()const; - // public static functions - staticboolremove(int); + // public static functions + staticboolremove(int);};

    Description

    @@ -66,62 +66,62 @@ construct/copy/destruct
    1. -
      xsi_shared_memory();
      +
      xsi_shared_memory();

      Default constructor. Represents an empty xsi_shared_memory.

    2. -
      xsi_shared_memory(open_only_t, int shmid);
      +
      xsi_shared_memory(open_only_t, int shmid);

      Initializes *this with a shmid previously obtained (possibly from another process) This lower-level initializer allows shared memory mapping without having a key.

    3. -
      xsi_shared_memory(create_only_t, const xsi_key & key, std::size_t size, 
+
      xsi_shared_memory(create_only_t, const xsi_key & key, std::size_t size, 
                   const permissions & perm = permissions());
      
 
      Creates a new XSI shared memory from 'key', with size "size" and permissions "perm". If the shared memory previously exists, throws an error.
    4. -
      xsi_shared_memory(open_or_create_t, const xsi_key & key, std::size_t size, 
+
      xsi_shared_memory(open_or_create_t, const xsi_key & key, std::size_t size, 
                   const permissions & perm = permissions());
      
 
      Opens an existing shared memory with identifier 'key' or creates a new XSI shared memory from identifier 'key', with size "size" and permissions "perm".
    5. -
      xsi_shared_memory(open_only_t, const xsi_key & key);
      +
      xsi_shared_memory(open_only_t, const xsi_key & key);

      Tries to open a XSI shared memory with identifier 'key' If the shared memory does not previously exist, it throws an error.

    6. -
      xsi_shared_memory(xsi_shared_memory && moved);
      +
      xsi_shared_memory(xsi_shared_memory && moved);

      Moves the ownership of "moved"'s shared memory object to *this. After the call, "moved" does not represent any shared memory object. Does not throw

    7. -
      xsi_shared_memory & operator=(xsi_shared_memory && moved);
      +
      xsi_shared_memory & operator=(xsi_shared_memory && moved);

      Moves the ownership of "moved"'s shared memory to *this. After the call, "moved" does not represent any shared memory. Does not throw

    8. -
      ~xsi_shared_memory();
      +
      ~xsi_shared_memory();

      Destroys *this. The shared memory won't be destroyed, just this connection to it. Use remove() to destroy the shared memory.

    -xsi_shared_memory public member functions

    +xsi_shared_memory public member functions
    1. -
      void swap(xsi_shared_memory & other);
      Swaps two xsi_shared_memorys. Does not throw.
      2. +
      void swap(xsi_shared_memory & other);
      Swaps two xsi_shared_memorys. Does not throw.
    2. -
      int get_shmid() const;
      +
      int get_shmid() const;

      Returns the shared memory ID that identifies the shared memory

    3. -
      mapping_handle_t get_mapping_handle() const;
      +
      mapping_handle_t get_mapping_handle() const;

      Returns the mapping handle. Never throws

    -xsi_shared_memory public static functions

    +xsi_shared_memory public static functions
    1. -
      static bool remove(int shmid);
      +
      static bool remove(int shmid);

      Erases the XSI shared memory object identified by shmid from the system. Returns false on error. Never throws

    diff --git a/doc/html/boost/intrusive/any_base_hook.html b/doc/html/boost/intrusive/any_base_hook.html index 1941ed1a1b..78b4511c88 100644 --- a/doc/html/boost/intrusive/any_base_hook.html +++ b/doc/html/boost/intrusive/any_base_hook.html @@ -36,13 +36,13 @@ classany_base_hook:publicmake_any_base_hook::type<O1,O2,O3>{public:// construct/copy/destruct - any_base_hook(); - any_base_hook(constany_base_hook&); - any_base_hook&operator=(constany_base_hook&); - ~any_base_hook(); + any_base_hook(); + any_base_hook(constany_base_hook&); + any_base_hook&operator=(constany_base_hook&); + ~any_base_hook(); - // public member functions - boolis_linked()const; + // public member functions + boolis_linked()const;};

    Description

    @@ -58,24 +58,24 @@ construct/copy/destruct
    1. -
      any_base_hook();
      +
      any_base_hook();

      Effects: If link_mode is or safe_link initializes the node to an unlinked state.

      Throws: Nothing.

    2. -
      any_base_hook(const any_base_hook &);
      +
      any_base_hook(const any_base_hook &);

      Effects: If link_mode is or safe_link initializes the node to an unlinked state. The argument is ignored.

      Throws: Nothing.

      Rationale: Providing a copy-constructor makes classes using the hook STL-compliant without forcing the user to do some additional work. swap can be used to emulate move-semantics.

    3. -
      any_base_hook & operator=(const any_base_hook &);
      +
      any_base_hook & operator=(const any_base_hook &);

      Effects: Empty function. The argument is ignored.

      Throws: Nothing.

      Rationale: Providing an assignment operator makes classes using the hook STL-compliant without forcing the user to do some additional work. swap can be used to emulate move-semantics.

    4. -
      ~any_base_hook();
      +
      ~any_base_hook();

      Effects: If link_mode is normal_link, the destructor does nothing (ie. no code is generated). If link_mode is safe_link and the object is stored in a container an assertion is raised.

      Throws: Nothing.

      5. @@ -83,9 +83,9 @@

    -any_base_hook public member functions

    +any_base_hook public member functions
    1. -
      bool is_linked() const;
      +
      bool is_linked() const;

      Precondition: link_mode must be safe_link.

      Returns: true, if the node belongs to a container, false otherwise. This function can be used to test whether container::iterator_to will return a valid iterator.

      Complexity: Constant

      diff --git a/doc/html/boost/intrusive/any_member_hook.html b/doc/html/boost/intrusive/any_member_hook.html index 6600f96620..06aa61c446 100644 --- a/doc/html/boost/intrusive/any_member_hook.html +++ b/doc/html/boost/intrusive/any_member_hook.html @@ -36,13 +36,13 @@ class any_member_hook : public make_any_member_hook::type< O1, O2, O3 > { public: // construct/copy/destruct - any_member_hook(); - any_member_hook(const any_member_hook &); - any_member_hook & operator=(const any_member_hook &); - ~any_member_hook(); + any_member_hook(); + any_member_hook(const any_member_hook &); + any_member_hook & operator=(const any_member_hook &); + ~any_member_hook(); - // public member functions - bool is_linked() const; + // public member functions + bool is_linked() const; };

    Description

    @@ -57,24 +57,24 @@ construct/copy/destruct
    1. -
      any_member_hook();
      +
      any_member_hook();

      Effects: If link_mode is or safe_link initializes the node to an unlinked state.

      Throws: Nothing.

    2. -
      any_member_hook(const any_member_hook &);
      +
      any_member_hook(const any_member_hook &);

      Effects: If link_mode is or safe_link initializes the node to an unlinked state. The argument is ignored.

      Throws: Nothing.

      Rationale: Providing a copy-constructor makes classes using the hook STL-compliant without forcing the user to do some additional work. swap can be used to emulate move-semantics.

    3. -
      any_member_hook & operator=(const any_member_hook &);
      +
      any_member_hook & operator=(const any_member_hook &);

      Effects: Empty function. The argument is ignored.

      Throws: Nothing.

      Rationale: Providing an assignment operator makes classes using the hook STL-compliant without forcing the user to do some additional work. swap can be used to emulate move-semantics.

    4. -
      ~any_member_hook();
      +
      ~any_member_hook();

      Effects: If link_mode is normal_link, the destructor does nothing (ie. no code is generated). If link_mode is safe_link and the object is stored in a container an assertion is raised.

      Throws: Nothing.

      5. @@ -82,9 +82,9 @@

    -any_member_hook public member functions

    +any_member_hook public member functions
    1. -
      bool is_linked() const;
      +
      bool is_linked() const;

      Precondition: link_mode must be safe_link.

      Returns: true, if the node belongs to a container, false otherwise. This function can be used to test whether container::iterator_to will return a valid iterator.

      Complexity: Constant

      diff --git a/doc/html/boost/intrusive/avl_multiset.html b/doc/html/boost/intrusive/avl_multiset.html index 88da11f11c..9930aca259 100644 --- a/doc/html/boost/intrusive/avl_multiset.html +++ b/doc/html/boost/intrusive/avl_multiset.html @@ -60,120 +60,120 @@ typedef implementation_defined::node_algorithms node_algorithms; // construct/copy/destruct - avl_multiset(); - explicit avl_multiset(const key_compare &, + avl_multiset(); + explicit avl_multiset(const key_compare &, const value_traits & = value_traits()); template<typename Iterator> - avl_multiset(Iterator, Iterator, const key_compare & = key_compare(), + avl_multiset(Iterator, Iterator, const key_compare & = key_compare(), const value_traits & = value_traits()); - avl_multiset(avl_multiset &&); - avl_multiset & operator=(avl_multiset &&); - ~avl_multiset(); + avl_multiset(avl_multiset &&); + avl_multiset & operator=(avl_multiset &&); + ~avl_multiset(); - // public member functions - iterator begin(); - const_iterator begin() const; - const_iterator cbegin() const; - iterator end(); - const_iterator end() const; - const_iterator cend() const; - reverse_iterator rbegin(); - const_reverse_iterator rbegin() const; - const_reverse_iterator crbegin() const; - reverse_iterator rend(); - const_reverse_iterator rend() const; - const_reverse_iterator crend() const; - iterator root(); - const_iterator root() const; - const_iterator croot() const; - key_compare key_comp() const; - value_compare value_comp() const; - bool empty() const; - size_type size() const; - void swap(avl_multiset &); + // public member functions + iterator begin(); + const_iterator begin() const; + const_iterator cbegin() const; + iterator end(); + const_iterator end() const; + const_iterator cend() const; + reverse_iterator rbegin(); + const_reverse_iterator rbegin() const; + const_reverse_iterator crbegin() const; + reverse_iterator rend(); + const_reverse_iterator rend() const; + const_reverse_iterator crend() const; + iterator root(); + const_iterator root() const; + const_iterator croot() const; + key_compare key_comp() const; + value_compare value_comp() const; + bool empty() const; + size_type size() const; + void swap(avl_multiset &); template<typename Cloner, typename Disposer> - void clone_from(const avl_multiset &, Cloner, Disposer); + void clone_from(const avl_multiset &, Cloner, Disposer); template<typename Cloner, typename Disposer> - void clone_from(avl_multiset &&, Cloner, Disposer); - iterator insert(reference); - iterator insert(const_iterator, reference); - template<typename Iterator> void insert(Iterator, Iterator); - iterator insert_before(const_iterator, reference); - void push_back(reference); - void push_front(reference); - iterator erase(const_iterator); - iterator erase(const_iterator, const_iterator); - size_type erase(const key_type &); + void clone_from(avl_multiset &&, Cloner, Disposer); + iterator insert(reference); + iterator insert(const_iterator, reference); + template<typename Iterator> void insert(Iterator, Iterator); + iterator insert_before(const_iterator, reference); + void push_back(reference); + void push_front(reference); + iterator erase(const_iterator); + iterator erase(const_iterator, const_iterator); + size_type erase(const key_type &); template<typename KeyType, typename KeyTypeKeyCompare> - size_type erase(const KeyType &, KeyTypeKeyCompare); + size_type erase(const KeyType &, KeyTypeKeyCompare); template<typename Disposer> - iterator erase_and_dispose(const_iterator, Disposer); + iterator erase_and_dispose(const_iterator, Disposer); template<typename Disposer> - iterator erase_and_dispose(const_iterator, const_iterator, Disposer); + iterator erase_and_dispose(const_iterator, const_iterator, Disposer); template<typename Disposer> - size_type erase_and_dispose(const key_type &, Disposer); + size_type erase_and_dispose(const key_type &, Disposer); template<typename KeyType, typename KeyTypeKeyCompare, typename Disposer> - size_type erase_and_dispose(const KeyType &, KeyTypeKeyCompare, Disposer); - void clear(); - template<typename Disposer> void clear_and_dispose(Disposer); - size_type count(const key_type &) const; + size_type erase_and_dispose(const KeyType &, KeyTypeKeyCompare, Disposer); + void clear(); + template<typename Disposer> void clear_and_dispose(Disposer); + size_type count(const key_type &) const; template<typename KeyType, typename KeyTypeKeyCompare> - size_type count(const KeyType &, KeyTypeKeyCompare) const; - iterator lower_bound(const key_type &); + size_type count(const KeyType &, KeyTypeKeyCompare) const; + iterator lower_bound(const key_type &); template<typename KeyType, typename KeyTypeKeyCompare> - iterator lower_bound(const KeyType &, KeyTypeKeyCompare); - const_iterator lower_bound(const key_type &) const; + iterator lower_bound(const KeyType &, KeyTypeKeyCompare); + const_iterator lower_bound(const key_type &) const; template<typename KeyType, typename KeyTypeKeyCompare> - const_iterator lower_bound(const KeyType &, KeyTypeKeyCompare) const; - iterator upper_bound(const key_type &); + const_iterator lower_bound(const KeyType &, KeyTypeKeyCompare) const; + iterator upper_bound(const key_type &); template<typename KeyType, typename KeyTypeKeyCompare> - iterator upper_bound(const KeyType &, KeyTypeKeyCompare); - const_iterator upper_bound(const key_type &) const; + iterator upper_bound(const KeyType &, KeyTypeKeyCompare); + const_iterator upper_bound(const key_type &) const; template<typename KeyType, typename KeyTypeKeyCompare> - const_iterator upper_bound(const KeyType &, KeyTypeKeyCompare) const; - iterator find(const key_type &); + const_iterator upper_bound(const KeyType &, KeyTypeKeyCompare) const; + iterator find(const key_type &); template<typename KeyType, typename KeyTypeKeyCompare> - iterator find(const KeyType &, KeyTypeKeyCompare); - const_iterator find(const key_type &) const; + iterator find(const KeyType &, KeyTypeKeyCompare); + const_iterator find(const key_type &) const; template<typename KeyType, typename KeyTypeKeyCompare> - const_iterator find(const KeyType &, KeyTypeKeyCompare) const; - std::pair< iterator, iterator > equal_range(const key_type &); + const_iterator find(const KeyType &, KeyTypeKeyCompare) const; + std::pair< iterator, iterator > equal_range(const key_type &); template<typename KeyType, typename KeyTypeKeyCompare> std::pair< iterator, iterator > - equal_range(const KeyType &, KeyTypeKeyCompare); + equal_range(const KeyType &, KeyTypeKeyCompare); std::pair< const_iterator, const_iterator > - equal_range(const key_type &) const; + equal_range(const key_type &) const; template<typename KeyType, typename KeyTypeKeyCompare> std::pair< const_iterator, const_iterator > - equal_range(const KeyType &, KeyTypeKeyCompare) const; + equal_range(const KeyType &, KeyTypeKeyCompare) const; std::pair< iterator, iterator > - bounded_range(const key_type &, const key_type &, bool, bool); + bounded_range(const key_type &, const key_type &, bool, bool); template<typename KeyType, typename KeyTypeKeyCompare> std::pair< iterator, iterator > - bounded_range(const KeyType &, const KeyType &, KeyTypeKeyCompare, bool, + bounded_range(const KeyType &, const KeyType &, KeyTypeKeyCompare, bool, bool); std::pair< const_iterator, const_iterator > - bounded_range(const key_type &, const key_type &key, bool, bool) const; + bounded_range(const key_type &, const key_type &key, bool, bool) const; template<typename KeyType, typename KeyTypeKeyCompare> std::pair< const_iterator, const_iterator > - bounded_range(const KeyType &, const KeyType &, KeyTypeKeyCompare, bool, + bounded_range(const KeyType &, const KeyType &, KeyTypeKeyCompare, bool, bool) const; - iterator iterator_to(reference); - const_iterator iterator_to(const_reference) const; - pointer unlink_leftmost_without_rebalance(); - void replace_node(iterator, reference); - void remove_node(reference); - template<class... Options2> void merge(avl_multiset< T, Options2...> &); - template<class... Options2> void merge(avl_set< T, Options2...> &); + iterator iterator_to(reference); + const_iterator iterator_to(const_reference) const; + pointer unlink_leftmost_without_rebalance(); + void replace_node(iterator, reference); + void remove_node(reference); + template<class... Options2> void merge(avl_multiset< T, Options2...> &); + template<class... Options2> void merge(avl_set< T, Options2...> &); - // public static functions - static avl_multiset & container_from_end_iterator(iterator); - static const avl_multiset & container_from_end_iterator(const_iterator); - static avl_multiset & container_from_iterator(iterator); - static const avl_multiset & container_from_iterator(const_iterator); - static iterator s_iterator_to(reference); - static const_iterator s_iterator_to(const_reference); - static void init_node(reference); + // public static functions + static avl_multiset & container_from_end_iterator(iterator); + static const avl_multiset & container_from_end_iterator(const_iterator); + static avl_multiset & container_from_iterator(iterator); + static const avl_multiset & container_from_iterator(const_iterator); + static iterator s_iterator_to(reference); + static const_iterator s_iterator_to(const_reference); + static void init_node(reference); // public data members static const bool constant_time_size; @@ -190,13 +190,13 @@ construct/copy/destruct
      1. -
        avl_multiset();
        +
        avl_multiset();

        Effects: Constructs an empty container.

        Complexity: Constant.

        Throws: If value_traits::node_traits::node constructor throws (this does not happen with predefined Boost.Intrusive hooks) or the copy constructor of the key_compare object throws. Basic guarantee.

      2. -
        explicit avl_multiset(const key_compare & cmp, 
+
        explicit avl_multiset(const key_compare & cmp, 
                       const value_traits & v_traits = value_traits());
        
 
        Effects: Constructs an empty container with given comparison and traits.
        
 
        Complexity: Constant.
        
@@ -204,7 +204,7 @@
 
      3. template<typename Iterator> 
-  avl_multiset(Iterator b, Iterator e, 
+  avl_multiset(Iterator b, Iterator e, 
                const key_compare & cmp = key_compare(), 
                const value_traits & v_traits = value_traits());

        Requires: Dereferencing iterator must yield an lvalue of type value_type. cmp must be a comparison function that induces a strict weak ordering.

        @@ -213,17 +213,17 @@

        Throws: If value_traits::node_traits::node constructor throws (this does not happen with predefined Boost.Intrusive hooks) or the copy constructor/operator() of the key_compare object throws. Basic guarantee.

      4. -
        avl_multiset(avl_multiset && x);
        +
        avl_multiset(avl_multiset && x);

        Effects: Constructs a container moving resources from another container. Internal comparison object and value traits are move constructed and nodes belonging to x (except the node representing the "end") are linked to *this.

        Complexity: Constant.

        Throws: If value_traits::node_traits::node's move constructor throws (this does not happen with predefined Boost.Intrusive hooks) or the move constructor of the comparison objet throws.

      5. -
        avl_multiset & operator=(avl_multiset && x);
        +
        avl_multiset & operator=(avl_multiset && x);

        Effects: Equivalent to swap

      6. -
        ~avl_multiset();
        +
        ~avl_multiset();

        Effects: Detaches all elements from this. The objects in the set are not deleted (i.e. no destructors are called), but the nodes according to the value_traits template parameter are reinitialized and thus can be reused.

        Complexity: Linear to elements contained in *this.

        Throws: Nothing.

        @@ -232,131 +232,131 @@

      -avl_multiset public member functions

      +avl_multiset public member functions
      1. -
        iterator begin();
        +
        iterator begin();

        Effects: Returns an iterator pointing to the beginning of the container.

        Complexity: Constant.

        Throws: Nothing.

      2. -
        const_iterator begin() const;
        +
        const_iterator begin() const;

        Effects: Returns a const_iterator pointing to the beginning of the container.

        Complexity: Constant.

        Throws: Nothing.

      3. -
        const_iterator cbegin() const;
        +
        const_iterator cbegin() const;

        Effects: Returns a const_iterator pointing to the beginning of the container.

        Complexity: Constant.

        Throws: Nothing.

      4. -
        iterator end();
        +
        iterator end();

        Effects: Returns an iterator pointing to the end of the container.

        Complexity: Constant.

        Throws: Nothing.

      5. -
        const_iterator end() const;
        +
        const_iterator end() const;

        Effects: Returns a const_iterator pointing to the end of the container.

        Complexity: Constant.

        Throws: Nothing.

      6. -
        const_iterator cend() const;
        +
        const_iterator cend() const;

        Effects: Returns a const_iterator pointing to the end of the container.

        Complexity: Constant.

        Throws: Nothing.

      7. -
        reverse_iterator rbegin();
        +
        reverse_iterator rbegin();

        Effects: Returns a reverse_iterator pointing to the beginning of the reversed container.

        Complexity: Constant.

        Throws: Nothing.

      8. -
        const_reverse_iterator rbegin() const;
        +
        const_reverse_iterator rbegin() const;

        Effects: Returns a const_reverse_iterator pointing to the beginning of the reversed container.

        Complexity: Constant.

        Throws: Nothing.

      9. -
        const_reverse_iterator crbegin() const;
        +
        const_reverse_iterator crbegin() const;

        Effects: Returns a const_reverse_iterator pointing to the beginning of the reversed container.

        Complexity: Constant.

        Throws: Nothing.

      10. -
        reverse_iterator rend();
        +
        reverse_iterator rend();

        Effects: Returns a reverse_iterator pointing to the end of the reversed container.

        Complexity: Constant.

        Throws: Nothing.

      11. -
        const_reverse_iterator rend() const;
        +
        const_reverse_iterator rend() const;

        Effects: Returns a const_reverse_iterator pointing to the end of the reversed container.

        Complexity: Constant.

        Throws: Nothing.

      12. -
        const_reverse_iterator crend() const;
        +
        const_reverse_iterator crend() const;

        Effects: Returns a const_reverse_iterator pointing to the end of the reversed container.

        Complexity: Constant.

        Throws: Nothing.

      13. -
        iterator root();
        +
        iterator root();

        Effects: Returns a iterator pointing to the root node of the container or end() if not present.

        Complexity: Constant.

        Throws: Nothing.

      14. -
        const_iterator root() const;
        +
        const_iterator root() const;

        Effects: Returns a const_iterator pointing to the root node of the container or cend() if not present.

        Complexity: Constant.

        Throws: Nothing.

      15. -
        const_iterator croot() const;
        +
        const_iterator croot() const;

        Effects: Returns a const_iterator pointing to the root node of the container or cend() if not present.

        Complexity: Constant.

        Throws: Nothing.

      16. -
        key_compare key_comp() const;
        +
        key_compare key_comp() const;

        Effects: Returns the key_compare object used by the container.

        Complexity: Constant.

        Throws: If key_compare copy-constructor throws.

      17. -
        value_compare value_comp() const;
        +
        value_compare value_comp() const;

        Effects: Returns the value_compare object used by the container.

        Complexity: Constant.

        Throws: If value_compare copy-constructor throws.

      18. -
        bool empty() const;
        +
        bool empty() const;

        Effects: Returns true if the container is empty.

        Complexity: Constant.

        Throws: Nothing.

      19. -
        size_type size() const;
        +
        size_type size() const;

        Effects: Returns the number of elements stored in the container.

        Complexity: Linear to elements contained in *this if constant-time size option is disabled. Constant time otherwise.

        Throws: Nothing.

      20. -
        void swap(avl_multiset & other);
        +
        void swap(avl_multiset & other);

        Effects: Swaps the contents of two containers.

        Complexity: Constant.

        Throws: If the comparison functor's swap call throws. 

      21. template<typename Cloner, typename Disposer> 
-  void clone_from(const avl_multiset & src, Cloner cloner, Disposer disposer);
        + void clone_from(const avl_multiset & src, Cloner cloner, Disposer disposer);

        Requires: Disposer::operator()(pointer) shouldn't throw. Cloner should yield to nodes equivalent to the original nodes.

        Effects: Erases all the elements from *this calling Disposer::operator()(pointer), clones all the elements from src calling Cloner::operator()(const_reference ) and inserts them on *this. Copies the predicate from the source container.

        If cloner throws, all cloned elements are unlinked and disposed calling Disposer::operator()(pointer).

        @@ -365,7 +365,7 @@ 
      22. template<typename Cloner, typename Disposer> 
-  void clone_from(avl_multiset && src, Cloner cloner, Disposer disposer);
        + void clone_from(avl_multiset && src, Cloner cloner, Disposer disposer);

        Requires: Disposer::operator()(pointer) shouldn't throw. Cloner should yield to nodes equivalent to the original nodes.

        Effects: Erases all the elements from *this calling Disposer::operator()(pointer), clones all the elements from src calling Cloner::operator()(reference) and inserts them on *this. Copies the predicate from the source container.

        If cloner throws, all cloned elements are unlinked and disposed calling Disposer::operator()(pointer).

        @@ -374,7 +374,7 @@

        Note: This version can modify the source container, useful to implement move semantics.

      23. -
        iterator insert(reference value);
        +
        iterator insert(reference value);

        Requires: value must be an lvalue

        Effects: Inserts value into the container before the upper bound.

        Complexity: Average complexity for insert element is at most logarithmic.

        @@ -382,7 +382,7 @@

        Note: Does not affect the validity of iterators and references. No copy-constructors are called.

      24. -
        iterator insert(const_iterator hint, reference value);
        +
        iterator insert(const_iterator hint, reference value);

        Requires: value must be an lvalue, and "hint" must be a valid iterator.

        Effects: Inserts x into the container, using "hint" as a hint to where it will be inserted. If "hint" is the upper_bound the insertion takes constant time (two comparisons in the worst case)

        Complexity: Logarithmic in general, but it is amortized constant time if t is inserted immediately before hint.

        @@ -390,7 +390,7 @@

        Note: Does not affect the validity of iterators and references. No copy-constructors are called.

      25. -
        template<typename Iterator> void insert(Iterator b, Iterator e);
        +
        template<typename Iterator> void insert(Iterator b, Iterator e);

        Requires: Dereferencing iterator must yield an lvalue of type value_type.

        Effects: Inserts a each element of a range into the container before the upper bound of the key of each element.

        Complexity: Insert range is in general O(N * log(N)), where N is the size of the range. However, it is linear in N if the range is already sorted by value_comp().

        @@ -398,7 +398,7 @@

        Note: Does not affect the validity of iterators and references. No copy-constructors are called.

      26. -
        iterator insert_before(const_iterator pos, reference value);
        +
        iterator insert_before(const_iterator pos, reference value);

        Requires: value must be an lvalue, "pos" must be a valid iterator (or end) and must be the succesor of value once inserted according to the predicate

        Effects: Inserts x into the container before "pos".

        Complexity: Constant time.

        @@ -406,7 +406,7 @@

        Note: This function does not check preconditions so if "pos" is not the successor of "value" container ordering invariant will be broken. This is a low-level function to be used only for performance reasons by advanced users.

      27. -
        void push_back(reference value);
        +
        void push_back(reference value);

        Requires: value must be an lvalue, and it must be no less than the greatest inserted key

        Effects: Inserts x into the container in the last position.

        Complexity: Constant time.

        @@ -414,7 +414,7 @@

        Note: This function does not check preconditions so if value is less than the greatest inserted key container ordering invariant will be broken. This function is slightly more efficient than using "insert_before". This is a low-level function to be used only for performance reasons by advanced users.

      28. -
        void push_front(reference value);
        +
        void push_front(reference value);

        Requires: value must be an lvalue, and it must be no greater than the minimum inserted key

        Effects: Inserts x into the container in the first position.

        Complexity: Constant time.

        @@ -422,21 +422,21 @@

        Note: This function does not check preconditions so if value is greater than the minimum inserted key container ordering invariant will be broken. This function is slightly more efficient than using "insert_before". This is a low-level function to be used only for performance reasons by advanced users.

      29. -
        iterator erase(const_iterator i);
        +
        iterator erase(const_iterator i);

        Effects: Erases the element pointed to by i.

        Complexity: Average complexity for erase element is constant time.

        Throws: Nothing.

        Note: Invalidates the iterators (but not the references) to the erased elements. No destructors are called.

      30. -
        iterator erase(const_iterator b, const_iterator e);
        +
        iterator erase(const_iterator b, const_iterator e);

        Effects: Erases the range pointed to by b end e.

        Complexity: Average complexity for erase range is at most O(log(size() + N)), where N is the number of elements in the range.

        Throws: Nothing.

        Note: Invalidates the iterators (but not the references) to the erased elements. No destructors are called.

      31. -
        size_type erase(const key_type & key);
        +
        size_type erase(const key_type & key);

        Effects: Erases all the elements with the given value.

        Returns: The number of erased elements.

        Complexity: O(log(size() + N).

        @@ -445,7 +445,7 @@ 
      32. template<typename KeyType, typename KeyTypeKeyCompare> 
-  size_type erase(const KeyType & key, KeyTypeKeyCompare comp);
        + size_type erase(const KeyType & key, KeyTypeKeyCompare comp);

        Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk), with nk the key_type of a value_type inserted into *this.

        Effects: Erases all the elements with the given key. according to the comparison functor "comp".

        Returns: The number of erased elements.

        @@ -455,7 +455,7 @@ 
      33. template<typename Disposer> 
-  iterator erase_and_dispose(const_iterator i, Disposer disposer);
        + iterator erase_and_dispose(const_iterator i, Disposer disposer);

        Requires: Disposer::operator()(pointer) shouldn't throw.

        Effects: Erases the element pointed to by i. Disposer::operator()(pointer) is called for the removed element.

        Complexity: Average complexity for erase element is constant time.

        @@ -464,7 +464,7 @@ 
      34. template<typename Disposer> 
-  iterator erase_and_dispose(const_iterator b, const_iterator e, 
+  iterator erase_and_dispose(const_iterator b, const_iterator e, 
                              Disposer disposer);

        Requires: Disposer::operator()(pointer) shouldn't throw.

        Effects: Erases the range pointed to by b end e. Disposer::operator()(pointer) is called for the removed elements.

        @@ -474,7 +474,7 @@ 
      35. template<typename Disposer> 
-  size_type erase_and_dispose(const key_type & key, Disposer disposer);
        + size_type erase_and_dispose(const key_type & key, Disposer disposer);

        Requires: Disposer::operator()(pointer) shouldn't throw.

        Effects: Erases all the elements with the given value. Disposer::operator()(pointer) is called for the removed elements.

        Returns: The number of erased elements.

        @@ -484,7 +484,7 @@ 
      36. template<typename KeyType, typename KeyTypeKeyCompare, typename Disposer> 
-  size_type erase_and_dispose(const KeyType & key, KeyTypeKeyCompare comp, 
+  size_type erase_and_dispose(const KeyType & key, KeyTypeKeyCompare comp, 
                               Disposer disposer);

        Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk) and nk the key_type of a value_type inserted into *this.

        Requires: Disposer::operator()(pointer) shouldn't throw.

        @@ -495,47 +495,47 @@

        Note: Invalidates the iterators to the erased elements.

      37. -
        void clear();
        +
        void clear();

        Effects: Erases all of the elements.

        Complexity: Linear to the number of elements on the container. if it's a safe-mode or auto-unlink value_type. Constant time otherwise.

        Throws: Nothing.

        Note: Invalidates the iterators (but not the references) to the erased elements. No destructors are called.

      38. -
        template<typename Disposer> void clear_and_dispose(Disposer disposer);
        +
        template<typename Disposer> void clear_and_dispose(Disposer disposer);

        Effects: Erases all of the elements calling disposer(p) for each node to be erased. Complexity: Average complexity for is at most O(log(size() + N)), where N is the number of elements in the container.

        Throws: Nothing.

        Note: Invalidates the iterators (but not the references) to the erased elements. Calls N times to disposer functor.

      39. -
        size_type count(const key_type & key) const;
        +
        size_type count(const key_type & key) const;

        Effects: Returns the number of contained elements with the given value

        Complexity: Logarithmic to the number of elements contained plus lineal to number of objects with the given value.

        Throws: If key_compare throws. 

      40. template<typename KeyType, typename KeyTypeKeyCompare> 
-  size_type count(const KeyType & key, KeyTypeKeyCompare comp) const;
        + size_type count(const KeyType & key, KeyTypeKeyCompare comp) const;

        Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk), and nk the key_type of a value_type inserted into *this.

        Effects: Returns the number of contained elements with the given key

        Complexity: Logarithmic to the number of elements contained plus lineal to number of objects with the given key.

        Throws: If comp throws.

      41. -
        iterator lower_bound(const key_type & key);
        +
        iterator lower_bound(const key_type & key);

        Effects: Returns an iterator to the first element whose key is not less than k or end() if that element does not exist.

        Complexity: Logarithmic.

        Throws: If key_compare throws. 

      42. template<typename KeyType, typename KeyTypeKeyCompare> 
-  iterator lower_bound(const KeyType & key, KeyTypeKeyCompare comp);
        + iterator lower_bound(const KeyType & key, KeyTypeKeyCompare comp);

        Effects: Returns an iterator to the first element whose key is not less than k or end() if that element does not exist.

        Complexity: Logarithmic.

        Throws: If key_compare throws.

      43. -
        const_iterator lower_bound(const key_type & key) const;
        +
        const_iterator lower_bound(const key_type & key) const;

        Effects: Returns an iterator to the first element whose key is not less than k or end() if that element does not exist.

        Complexity: Logarithmic.

        Throws: If key_compare throws.

        @@ -543,27 +543,27 @@ 
      44. template<typename KeyType, typename KeyTypeKeyCompare> 
   const_iterator 
-  lower_bound(const KeyType & key, KeyTypeKeyCompare comp) const;
        + lower_bound(const KeyType & key, KeyTypeKeyCompare comp) const;

        Effects: Returns an iterator to the first element whose key is not less than k or end() if that element does not exist.

        Complexity: Logarithmic.

        Throws: If key_compare throws.

      45. -
        iterator upper_bound(const key_type & key);
        +
        iterator upper_bound(const key_type & key);

        Effects: Returns an iterator to the first element whose key is greater than k or end() if that element does not exist.

        Complexity: Logarithmic.

        Throws: If key_compare throws. 

      46. template<typename KeyType, typename KeyTypeKeyCompare> 
-  iterator upper_bound(const KeyType & key, KeyTypeKeyCompare comp);
        + iterator upper_bound(const KeyType & key, KeyTypeKeyCompare comp);

        Requires: key is a value such that *this is partitioned with respect to !comp(key, nk), with nk the key_type of a value_type inserted into *this.

        Effects: Returns an iterator to the first element whose key is greater than k according to comp or end() if that element does not exist.

        Complexity: Logarithmic.

        Throws: If comp throws.

      47. -
        const_iterator upper_bound(const key_type & key) const;
        +
        const_iterator upper_bound(const key_type & key) const;

        Effects: Returns an iterator to the first element whose key is greater than k or end() if that element does not exist.

        Complexity: Logarithmic.

        Throws: If key_compare throws.

        @@ -571,42 +571,42 @@ 
      48. template<typename KeyType, typename KeyTypeKeyCompare> 
   const_iterator 
-  upper_bound(const KeyType & key, KeyTypeKeyCompare comp) const;
        + upper_bound(const KeyType & key, KeyTypeKeyCompare comp) const;

        Requires: key is a value such that *this is partitioned with respect to !comp(key, nk), with nk the key_type of a value_type inserted into *this.

        Effects: Returns an iterator to the first element whose key is greater than k according to comp or end() if that element does not exist.

        Complexity: Logarithmic.

        Throws: If comp throws.

      49. -
        iterator find(const key_type & key);
        +
        iterator find(const key_type & key);

        Effects: Finds an iterator to the first element whose key is k or end() if that element does not exist.

        Complexity: Logarithmic.

        Throws: If key_compare throws. 

      50. template<typename KeyType, typename KeyTypeKeyCompare> 
-  iterator find(const KeyType & key, KeyTypeKeyCompare comp);
        + iterator find(const KeyType & key, KeyTypeKeyCompare comp);

        Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk), and nk the key_type of a value_type inserted into *this.

        Effects: Finds an iterator to the first element whose key is k or end() if that element does not exist.

        Complexity: Logarithmic.

        Throws: If comp throws.

      51. -
        const_iterator find(const key_type & key) const;
        +
        const_iterator find(const key_type & key) const;

        Effects: Finds an iterator to the first element whose key is k or end() if that element does not exist.

        Complexity: Logarithmic.

        Throws: If key_compare throws. 

      52. template<typename KeyType, typename KeyTypeKeyCompare> 
-  const_iterator find(const KeyType & key, KeyTypeKeyCompare comp) const;
        + const_iterator find(const KeyType & key, KeyTypeKeyCompare comp) const;

        Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk), and nk the key_type of a value_type inserted into *this.

        Effects: Finds an iterator to the first element whose key is k or end() if that element does not exist.

        Complexity: Logarithmic.

        Throws: If comp throws.

      53. -
        std::pair< iterator, iterator > equal_range(const key_type & key);
        +
        std::pair< iterator, iterator > equal_range(const key_type & key);

        Effects: Finds a range containing all elements whose key is k or an empty range that indicates the position where those elements would be if they there is no elements with key k.

        Complexity: Logarithmic.

        Throws: If key_compare throws.

        @@ -614,7 +614,7 @@ 
      54. template<typename KeyType, typename KeyTypeKeyCompare> 
   std::pair< iterator, iterator > 
-  equal_range(const KeyType & key, KeyTypeKeyCompare comp);
        + equal_range(const KeyType & key, KeyTypeKeyCompare comp);

        Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk), with nk the key_type of a value_type inserted into *this.

        Effects: Finds a range containing all elements whose key is k or an empty range that indicates the position where those elements would be if they there is no elements with key k.

        Complexity: Logarithmic.

        @@ -622,7 +622,7 @@ 
      55. std::pair< const_iterator, const_iterator > 
-equal_range(const key_type & key) const;
        +equal_range(const key_type & key) const;

        Effects: Finds a range containing all elements whose key is k or an empty range that indicates the position where those elements would be if they there is no elements with key k.

        Complexity: Logarithmic.

        Throws: If key_compare throws.

        @@ -630,7 +630,7 @@ 
      56. template<typename KeyType, typename KeyTypeKeyCompare> 
   std::pair< const_iterator, const_iterator > 
-  equal_range(const KeyType & key, KeyTypeKeyCompare comp) const;
        + equal_range(const KeyType & key, KeyTypeKeyCompare comp) const;

        Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk), with nk the key_type of a value_type inserted into *this.

        Effects: Finds a range containing all elements whose key is k or an empty range that indicates the position where those elements would be if they there is no elements with key k.

        Complexity: Logarithmic.

        @@ -638,7 +638,7 @@ 
      57. std::pair< iterator, iterator > 
-bounded_range(const key_type & lower_key, const key_type & upper_key, 
+bounded_range(const key_type & lower_key, const key_type & upper_key, 
               bool left_closed, bool right_closed);

        Requires: upper_key shall not precede lower_key according to key_compare. [key_comp()(upper_key, lower_key) shall be false]

        If lower_key is equivalent to upper_key [!key_comp()(upper_key, lower_key) && !key_comp()(lower_key, upper_key)] then ('left_closed' || 'right_closed') must be false.

        @@ -653,7 +653,7 @@ 
      58. template<typename KeyType, typename KeyTypeKeyCompare> 
   std::pair< iterator, iterator > 
-  bounded_range(const KeyType & lower_key, const KeyType & upper_key, 
+  bounded_range(const KeyType & lower_key, const KeyType & upper_key, 
                 KeyTypeKeyCompare comp, bool left_closed, bool right_closed);

        Requires: lower_key is a value such that *this is partitioned with respect to comp(nk, lower_key) if left_closed is true, with respect to !comp(lower_key, nk) otherwise.

        upper_key is a value such that *this is partitioned with respect to !comp(upper_key, nk) if right_closed is true, with respect to comp(nk, upper_key) otherwise.

        @@ -669,7 +669,7 @@ 
      59. std::pair< const_iterator, const_iterator > 
-bounded_range(const key_type & lower_key, const key_type &key upper_key, 
+bounded_range(const key_type & lower_key, const key_type &key upper_key, 
               bool left_closed, bool right_closed) const;

        Requires: upper_key shall not precede lower_key according to key_compare. [key_comp()(upper_key, lower_key) shall be false]

        If lower_key is equivalent to upper_key [!key_comp()(upper_key, lower_key) && !key_comp()(lower_key, upper_key)] then ('left_closed' || 'right_closed') must be false.

        @@ -684,7 +684,7 @@ 
      60. template<typename KeyType, typename KeyTypeKeyCompare> 
   std::pair< const_iterator, const_iterator > 
-  bounded_range(const KeyType & lower_key, const KeyType & upper_key, 
+  bounded_range(const KeyType & lower_key, const KeyType & upper_key, 
                 KeyTypeKeyCompare comp, bool left_closed, bool right_closed) const;

        Requires: lower_key is a value such that *this is partitioned with respect to comp(nk, lower_key) if left_closed is true, with respect to !comp(lower_key, nk) otherwise.

        upper_key is a value such that *this is partitioned with respect to !comp(upper_key, nk) if right_closed is true, with respect to comp(nk, upper_key) otherwise.

        @@ -699,28 +699,28 @@

        Note: Experimental function, the interface might change in future releases.

      61. -
        iterator iterator_to(reference value);
        +
        iterator iterator_to(reference value);

        Requires: value must be an lvalue and shall be in a set of appropriate type. Otherwise the behavior is undefined.

        Effects: Returns: a valid iterator i belonging to the set that points to the value

        Complexity: Constant.

        Throws: Nothing.

      62. -
        const_iterator iterator_to(const_reference value) const;
        +
        const_iterator iterator_to(const_reference value) const;

        Requires: value must be an lvalue and shall be in a set of appropriate type. Otherwise the behavior is undefined.

        Effects: Returns: a valid const_iterator i belonging to the set that points to the value

        Complexity: Constant.

        Throws: Nothing.

      63. -
        pointer unlink_leftmost_without_rebalance();
        +
        pointer unlink_leftmost_without_rebalance();

        Effects: Unlinks the leftmost node from the container.

        Complexity: Average complexity is constant time.

        Throws: Nothing.

        Notes: This function breaks the container and the container can only be used for more unlink_leftmost_without_rebalance calls. This function is normally used to achieve a step by step controlled destruction of the container.

      64. -
        void replace_node(iterator replace_this, reference with_this);
        +
        void replace_node(iterator replace_this, reference with_this);

        Requires: replace_this must be a valid iterator of *this and with_this must not be inserted in any container.

        Effects: Replaces replace_this in its position in the container with with_this. The container does not need to be rebalanced.

        Complexity: Constant.

        @@ -728,7 +728,7 @@

        Note: This function will break container ordering invariants if with_this is not equivalent to *replace_this according to the ordering rules. This function is faster than erasing and inserting the node, since no rebalancing or comparison is needed.

      65. -
        void remove_node(reference value);
        +
        void remove_node(reference value);

        Effects: removes "value" from the container.

        Throws: Nothing.

        Complexity: Logarithmic time.

        @@ -736,7 +736,7 @@

        If the user calls this function with a constant time size container or stateful comparison functor a compilation error will be issued.

      66. -
        template<class... Options2> void merge(avl_multiset< T, Options2...> & source);
        +
        template<class... Options2> void merge(avl_multiset< T, Options2...> & source);

        Requires: "source" container's Options can only can differ in the comparison function from *this.

        Effects: Extracts each element in source and insert it into a using the comparison object of *this.

        Postcondition: Pointers and references to the transferred elements of source refer to those same elements but as members of *this. Iterators referring to the transferred elements will continue to refer to their elements, but they now behave as iterators into *this, not into source.

        @@ -744,7 +744,7 @@

        Complexity: N log(a.size() + N) (N has the value source.size())

      67. -
        template<class... Options2> void merge(avl_set< T, Options2...> & source);
        +
        template<class... Options2> void merge(avl_set< T, Options2...> & source);

        Requires: "source" container's Options can only can differ in the comparison function from *this.

        Effects: Extracts each element in source and insert it into a using the comparison object of *this.

        Postcondition: Pointers and references to the transferred elements of source refer to those same elements but as members of *this. Iterators referring to the transferred elements will continue to refer to their elements, but they now behave as iterators into *this, not into source.

        @@ -755,10 +755,10 @@

      -avl_multiset public static functions

      +avl_multiset public static functions
      1. -
        static avl_multiset & container_from_end_iterator(iterator end_iterator);
        +
        static avl_multiset & container_from_end_iterator(iterator end_iterator);

        Precondition: end_iterator must be a valid end iterator of the container.

        Effects: Returns a const reference to the container associated to the end iterator

        Throws: Nothing.

        @@ -766,28 +766,28 @@ 
      2. static const avl_multiset & 
-container_from_end_iterator(const_iterator end_iterator);
        +container_from_end_iterator(const_iterator end_iterator);

        Precondition: end_iterator must be a valid end iterator of the container.

        Effects: Returns a const reference to the container associated to the end iterator

        Throws: Nothing.

        Complexity: Constant.

      3. -
        static avl_multiset & container_from_iterator(iterator it);
        +
        static avl_multiset & container_from_iterator(iterator it);

        Precondition: it must be a valid iterator of the container.

        Effects: Returns a const reference to the container associated to the iterator

        Throws: Nothing.

        Complexity: Logarithmic.

      4. -
        static const avl_multiset & container_from_iterator(const_iterator it);
        +
        static const avl_multiset & container_from_iterator(const_iterator it);

        Precondition: it must be a valid iterator of the container.

        Effects: Returns a const reference to the container associated to the iterator

        Throws: Nothing.

        Complexity: Logarithmic.

      5. -
        static iterator s_iterator_to(reference value);
        +
        static iterator s_iterator_to(reference value);

        Requires: value must be an lvalue and shall be in a set of appropriate type. Otherwise the behavior is undefined.

        Effects: Returns: a valid iterator i belonging to the set that points to the value

        Complexity: Constant.

        @@ -795,7 +795,7 @@

        Note: This static function is available only if the value traits is stateless.

      6. -
        static const_iterator s_iterator_to(const_reference value);
        +
        static const_iterator s_iterator_to(const_reference value);

        Requires: value must be an lvalue and shall be in a set of appropriate type. Otherwise the behavior is undefined.

        Effects: Returns: a valid iterator i belonging to the set that points to the value

        Complexity: Constant.

        @@ -803,7 +803,7 @@

        Note: This static function is available only if the value traits is stateless.

      7. -
        static void init_node(reference value);
        +
        static void init_node(reference value);

        Requires: value shall not be in a container.

        Effects: init_node puts the hook of a value in a well-known default state.

        Throws: Nothing.

        diff --git a/doc/html/boost/intrusive/avl_set.html b/doc/html/boost/intrusive/avl_set.html index f0dded9d8d..ce58eaba08 100644 --- a/doc/html/boost/intrusive/avl_set.html +++ b/doc/html/boost/intrusive/avl_set.html @@ -60,131 +60,131 @@ typedef implementation_defined::node_algorithms node_algorithms; // construct/copy/destruct - avl_set(); - explicit avl_set(const key_compare &, const value_traits & = value_traits()); + avl_set(); + explicit avl_set(const key_compare &, const value_traits & = value_traits()); template<typename Iterator> - avl_set(Iterator, Iterator, const key_compare & = key_compare(), + avl_set(Iterator, Iterator, const key_compare & = key_compare(), const value_traits & = value_traits()); - avl_set(avl_set &&); - avl_set & operator=(avl_set &&); - ~avl_set(); + avl_set(avl_set &&); + avl_set & operator=(avl_set &&); + ~avl_set(); - // public member functions - iterator begin(); - const_iterator begin() const; - const_iterator cbegin() const; - iterator end(); - const_iterator end() const; - const_iterator cend() const; - reverse_iterator avlegin(); - const_reverse_iterator avlegin() const; - const_reverse_iterator crbegin() const; - reverse_iterator rend(); - const_reverse_iterator rend() const; - const_reverse_iterator crend() const; - iterator root(); - const_iterator root() const; - const_iterator croot() const; - key_compare key_comp() const; - value_compare value_comp() const; - bool empty() const; - size_type size() const; - void swap(avl_set &); + // public member functions + iterator begin(); + const_iterator begin() const; + const_iterator cbegin() const; + iterator end(); + const_iterator end() const; + const_iterator cend() const; + reverse_iterator avlegin(); + const_reverse_iterator avlegin() const; + const_reverse_iterator crbegin() const; + reverse_iterator rend(); + const_reverse_iterator rend() const; + const_reverse_iterator crend() const; + iterator root(); + const_iterator root() const; + const_iterator croot() const; + key_compare key_comp() const; + value_compare value_comp() const; + bool empty() const; + size_type size() const; + void swap(avl_set &); template<typename Cloner, typename Disposer> - void clone_from(const avl_set &, Cloner, Disposer); + void clone_from(const avl_set &, Cloner, Disposer); template<typename Cloner, typename Disposer> - void clone_from(avl_set &&, Cloner, Disposer); - std::pair< iterator, bool > insert(reference); - iterator insert(const_iterator, reference); + void clone_from(avl_set &&, Cloner, Disposer); + std::pair< iterator, bool > insert(reference); + iterator insert(const_iterator, reference); std::pair< iterator, bool > - insert_check(const key_type &, insert_commit_data &); + insert_check(const key_type &, insert_commit_data &); std::pair< iterator, bool > - insert_check(const_iterator, const key_type &, insert_commit_data &); + insert_check(const_iterator, const key_type &, insert_commit_data &); template<typename KeyType, typename KeyTypeKeyCompare> std::pair< iterator, bool > - insert_check(const KeyType &, KeyTypeKeyCompare, insert_commit_data &); + insert_check(const KeyType &, KeyTypeKeyCompare, insert_commit_data &); template<typename KeyType, typename KeyTypeKeyCompare> std::pair< iterator, bool > - insert_check(const_iterator, const KeyType &, KeyTypeKeyCompare, + insert_check(const_iterator, const KeyType &, KeyTypeKeyCompare, insert_commit_data &); - template<typename Iterator> void insert(Iterator, Iterator); - iterator insert_commit(reference, const insert_commit_data &); - iterator insert_before(const_iterator, reference); - void push_back(reference); - void push_front(reference); - iterator erase(const_iterator); - iterator erase(const_iterator, const_iterator); - size_type erase(const key_type &); + template<typename Iterator> void insert(Iterator, Iterator); + iterator insert_commit(reference, const insert_commit_data &); + iterator insert_before(const_iterator, reference); + void push_back(reference); + void push_front(reference); + iterator erase(const_iterator); + iterator erase(const_iterator, const_iterator); + size_type erase(const key_type &); template<typename KeyType, typename KeyTypeKeyCompare> - size_type erase(const KeyType &, KeyTypeKeyCompare); + size_type erase(const KeyType &, KeyTypeKeyCompare); template<typename Disposer> - iterator erase_and_dispose(const_iterator, Disposer); + iterator erase_and_dispose(const_iterator, Disposer); template<typename Disposer> - iterator erase_and_dispose(const_iterator, const_iterator, Disposer); + iterator erase_and_dispose(const_iterator, const_iterator, Disposer); template<typename Disposer> - size_type erase_and_dispose(const key_type &, Disposer); + size_type erase_and_dispose(const key_type &, Disposer); template<typename KeyType, typename KeyTypeKeyCompare, typename Disposer> - size_type erase_and_dispose(const KeyType &, KeyTypeKeyCompare, Disposer); - void clear(); - template<typename Disposer> void clear_and_dispose(Disposer); - size_type count(const key_type &) const; + size_type erase_and_dispose(const KeyType &, KeyTypeKeyCompare, Disposer); + void clear(); + template<typename Disposer> void clear_and_dispose(Disposer); + size_type count(const key_type &) const; template<typename KeyType, typename KeyTypeKeyCompare> - size_type count(const KeyType &, KeyTypeKeyCompare) const; - iterator lower_bound(const key_type &); + size_type count(const KeyType &, KeyTypeKeyCompare) const; + iterator lower_bound(const key_type &); template<typename KeyType, typename KeyTypeKeyCompare> - iterator lower_bound(const KeyType &, KeyTypeKeyCompare); - const_iterator lower_bound(const key_type &) const; + iterator lower_bound(const KeyType &, KeyTypeKeyCompare); + const_iterator lower_bound(const key_type &) const; template<typename KeyType, typename KeyTypeKeyCompare> - const_iterator lower_bound(const KeyType &, KeyTypeKeyCompare) const; - iterator upper_bound(const key_type &); + const_iterator lower_bound(const KeyType &, KeyTypeKeyCompare) const; + iterator upper_bound(const key_type &); template<typename KeyType, typename KeyTypeKeyCompare> - iterator upper_bound(const KeyType &, KeyTypeKeyCompare); - const_iterator upper_bound(const key_type &) const; + iterator upper_bound(const KeyType &, KeyTypeKeyCompare); + const_iterator upper_bound(const key_type &) const; template<typename KeyType, typename KeyTypeKeyCompare> - const_iterator upper_bound(const KeyType &, KeyTypeKeyCompare) const; - iterator find(const key_type &); + const_iterator upper_bound(const KeyType &, KeyTypeKeyCompare) const; + iterator find(const key_type &); template<typename KeyType, typename KeyTypeKeyCompare> - iterator find(const KeyType &, KeyTypeKeyCompare); - const_iterator find(const key_type &) const; + iterator find(const KeyType &, KeyTypeKeyCompare); + const_iterator find(const key_type &) const; template<typename KeyType, typename KeyTypeKeyCompare> - const_iterator find(const KeyType &, KeyTypeKeyCompare) const; - std::pair< iterator, iterator > equal_range(const key_type &); + const_iterator find(const KeyType &, KeyTypeKeyCompare) const; + std::pair< iterator, iterator > equal_range(const key_type &); template<typename KeyType, typename KeyTypeKeyCompare> std::pair< iterator, iterator > - equal_range(const KeyType &, KeyTypeKeyCompare); + equal_range(const KeyType &, KeyTypeKeyCompare); std::pair< const_iterator, const_iterator > - equal_range(const key_type &) const; + equal_range(const key_type &) const; template<typename KeyType, typename KeyTypeKeyCompare> std::pair< const_iterator, const_iterator > - equal_range(const KeyType &, KeyTypeKeyCompare) const; + equal_range(const KeyType &, KeyTypeKeyCompare) const; std::pair< iterator, iterator > - bounded_range(const key_type &, const key_type &, bool, bool); + bounded_range(const key_type &, const key_type &, bool, bool); template<typename KeyType, typename KeyTypeKeyCompare> std::pair< iterator, iterator > - bounded_range(const KeyType &, const KeyType &, KeyTypeKeyCompare, bool, + bounded_range(const KeyType &, const KeyType &, KeyTypeKeyCompare, bool, bool); std::pair< const_iterator, const_iterator > - bounded_range(const key_type &, const key_type &, bool, bool) const; + bounded_range(const key_type &, const key_type &, bool, bool) const; template<typename KeyType, typename KeyTypeKeyCompare> std::pair< const_iterator, const_iterator > - bounded_range(const KeyType &, const KeyType &, KeyTypeKeyCompare, bool, + bounded_range(const KeyType &, const KeyType &, KeyTypeKeyCompare, bool, bool) const; - iterator iterator_to(reference); - const_iterator iterator_to(const_reference) const; - pointer unlink_leftmost_without_rebalance(); - void replace_node(iterator, reference); - void remove_node(reference); - template<class... Options2> void merge(avl_set< T, Options2...> &); - template<class... Options2> void merge(avl_multiset< T, Options2...> &); + iterator iterator_to(reference); + const_iterator iterator_to(const_reference) const; + pointer unlink_leftmost_without_rebalance(); + void replace_node(iterator, reference); + void remove_node(reference); + template<class... Options2> void merge(avl_set< T, Options2...> &); + template<class... Options2> void merge(avl_multiset< T, Options2...> &); - // public static functions - static avl_set & container_from_end_iterator(iterator); - static const avl_set & container_from_end_iterator(const_iterator); - static avl_set & container_from_iterator(iterator); - static const avl_set & container_from_iterator(const_iterator); - static iterator s_iterator_to(reference); - static const_iterator s_iterator_to(const_reference); - static void init_node(reference); + // public static functions + static avl_set & container_from_end_iterator(iterator); + static const avl_set & container_from_end_iterator(const_iterator); + static avl_set & container_from_iterator(iterator); + static const avl_set & container_from_iterator(const_iterator); + static iterator s_iterator_to(reference); + static const_iterator s_iterator_to(const_reference); + static void init_node(reference); // public data members static const bool constant_time_size; @@ -201,13 +201,13 @@ construct/copy/destruct
        1. -
          avl_set();
          +
          avl_set();

          Effects: Constructs an empty container.

          Complexity: Constant.

          Throws: If value_traits::node_traits::node constructor throws (this does not happen with predefined Boost.Intrusive hooks) or the copy constructor of the key_compare object throws. Basic guarantee.

        2. -
          explicit avl_set(const key_compare & cmp, 
+
          explicit avl_set(const key_compare & cmp, 
                  const value_traits & v_traits = value_traits());
          
 
          Effects: Constructs an empty container with given comparison and traits.
          
 
          Complexity: Constant.
          
@@ -215,7 +215,7 @@
 
        3. template<typename Iterator> 
-  avl_set(Iterator b, Iterator e, const key_compare & cmp = key_compare(), 
+  avl_set(Iterator b, Iterator e, const key_compare & cmp = key_compare(), 
           const value_traits & v_traits = value_traits());

          Requires: Dereferencing iterator must yield an lvalue of type value_type. cmp must be a comparison function that induces a strict weak ordering.

          Effects: Constructs an empty container and inserts elements from [b, e).

          @@ -223,17 +223,17 @@

          Throws: If value_traits::node_traits::node constructor throws (this does not happen with predefined Boost.Intrusive hooks) or the copy constructor/operator() of the key_compare object throws. Basic guarantee.

        4. -
          avl_set(avl_set && x);
          +
          avl_set(avl_set && x);

          Effects: Constructs a container moving resources from another container. Internal comparison object and value traits are move constructed and nodes belonging to x (except the node representing the "end") are linked to *this.

          Complexity: Constant.

          Throws: If value_traits::node_traits::node's move constructor throws (this does not happen with predefined Boost.Intrusive hooks) or the move constructor of the comparison objet throws.

        5. -
          avl_set & operator=(avl_set && x);
          +
          avl_set & operator=(avl_set && x);

          Effects: Equivalent to swap

        6. -
          ~avl_set();
          +
          ~avl_set();

          Effects: Detaches all elements from this. The objects in the set are not deleted (i.e. no destructors are called), but the nodes according to the value_traits template parameter are reinitialized and thus can be reused.

          Complexity: Linear to elements contained in *this.

          Throws: Nothing.

          @@ -242,131 +242,131 @@

        -avl_set public member functions

        +avl_set public member functions
        1. -
          iterator begin();
          +
          iterator begin();

          Effects: Returns an iterator pointing to the beginning of the container.

          Complexity: Constant.

          Throws: Nothing.

        2. -
          const_iterator begin() const;
          +
          const_iterator begin() const;

          Effects: Returns a const_iterator pointing to the beginning of the container.

          Complexity: Constant.

          Throws: Nothing.

        3. -
          const_iterator cbegin() const;
          +
          const_iterator cbegin() const;

          Effects: Returns a const_iterator pointing to the beginning of the container.

          Complexity: Constant.

          Throws: Nothing.

        4. -
          iterator end();
          +
          iterator end();

          Effects: Returns an iterator pointing to the end of the container.

          Complexity: Constant.

          Throws: Nothing.

        5. -
          const_iterator end() const;
          +
          const_iterator end() const;

          Effects: Returns a const_iterator pointing to the end of the container.

          Complexity: Constant.

          Throws: Nothing.

        6. -
          const_iterator cend() const;
          +
          const_iterator cend() const;

          Effects: Returns a const_iterator pointing to the end of the container.

          Complexity: Constant.

          Throws: Nothing.

        7. -
          reverse_iterator avlegin();
          +
          reverse_iterator avlegin();

          Effects: Returns an iterator pointing to the beginning of the container.

          Complexity: Constant.

          Throws: Nothing.

        8. -
          const_reverse_iterator avlegin() const;
          +
          const_reverse_iterator avlegin() const;

          Effects: Returns a const_iterator pointing to the beginning of the container.

          Complexity: Constant.

          Throws: Nothing.

        9. -
          const_reverse_iterator crbegin() const;
          +
          const_reverse_iterator crbegin() const;

          Effects: Returns a const_reverse_iterator pointing to the beginning of the reversed container.

          Complexity: Constant.

          Throws: Nothing.

        10. -
          reverse_iterator rend();
          +
          reverse_iterator rend();

          Effects: Returns a reverse_iterator pointing to the end of the reversed container.

          Complexity: Constant.

          Throws: Nothing.

        11. -
          const_reverse_iterator rend() const;
          +
          const_reverse_iterator rend() const;

          Effects: Returns a const_reverse_iterator pointing to the end of the reversed container.

          Complexity: Constant.

          Throws: Nothing.

        12. -
          const_reverse_iterator crend() const;
          +
          const_reverse_iterator crend() const;

          Effects: Returns a const_reverse_iterator pointing to the end of the reversed container.

          Complexity: Constant.

          Throws: Nothing.

        13. -
          iterator root();
          +
          iterator root();

          Effects: Returns a iterator pointing to the root node of the container or end() if not present.

          Complexity: Constant.

          Throws: Nothing.

        14. -
          const_iterator root() const;
          +
          const_iterator root() const;

          Effects: Returns a const_iterator pointing to the root node of the container or cend() if not present.

          Complexity: Constant.

          Throws: Nothing.

        15. -
          const_iterator croot() const;
          +
          const_iterator croot() const;

          Effects: Returns a const_iterator pointing to the root node of the container or cend() if not present.

          Complexity: Constant.

          Throws: Nothing.

        16. -
          key_compare key_comp() const;
          +
          key_compare key_comp() const;

          Effects: Returns the key_compare object used by the container.

          Complexity: Constant.

          Throws: If key_compare copy-constructor throws.

        17. -
          value_compare value_comp() const;
          +
          value_compare value_comp() const;

          Effects: Returns the value_compare object used by the container.

          Complexity: Constant.

          Throws: If value_compare copy-constructor throws.

        18. -
          bool empty() const;
          +
          bool empty() const;

          Effects: Returns true if the container is empty.

          Complexity: Constant.

          Throws: Nothing.

        19. -
          size_type size() const;
          +
          size_type size() const;

          Effects: Returns the number of elements stored in the container.

          Complexity: Linear to elements contained in *this if constant-time size option is disabled. Constant time otherwise.

          Throws: Nothing.

        20. -
          void swap(avl_set & other);
          +
          void swap(avl_set & other);

          Effects: Swaps the contents of two containers.

          Complexity: Constant.

          Throws: If the comparison functor's swap call throws. 

        21. template<typename Cloner, typename Disposer> 
-  void clone_from(const avl_set & src, Cloner cloner, Disposer disposer);
          + void clone_from(const avl_set & src, Cloner cloner, Disposer disposer);

          Requires: Disposer::operator()(pointer) shouldn't throw. Cloner should yield to nodes equivalent to the original nodes.

          Effects: Erases all the elements from *this calling Disposer::operator()(pointer), clones all the elements from src calling Cloner::operator()(const_reference ) and inserts them on *this. Copies the predicate from the source container.

          If cloner throws, all cloned elements are unlinked and disposed calling Disposer::operator()(pointer).

          @@ -375,7 +375,7 @@ 
        22. template<typename Cloner, typename Disposer> 
-  void clone_from(avl_set && src, Cloner cloner, Disposer disposer);
          + void clone_from(avl_set && src, Cloner cloner, Disposer disposer);

          Requires: Disposer::operator()(pointer) shouldn't throw. Cloner should yield to nodes equivalent to the original nodes.

          Effects: Erases all the elements from *this calling Disposer::operator()(pointer), clones all the elements from src calling Cloner::operator()(reference) and inserts them on *this. Copies the predicate from the source container.

          If cloner throws, all cloned elements are unlinked and disposed calling Disposer::operator()(pointer).

          @@ -384,7 +384,7 @@

          Note: This version can modify the source container, useful to implement move semantics.

        23. -
          std::pair< iterator, bool > insert(reference value);
          +
          std::pair< iterator, bool > insert(reference value);

          Requires: value must be an lvalue

          Effects: Inserts value into the container if the value is not already present.

          Complexity: Average complexity for insert element is at most logarithmic.

          @@ -392,7 +392,7 @@

          Note: Does not affect the validity of iterators and references. No copy-constructors are called.

        24. -
          iterator insert(const_iterator hint, reference value);
          +
          iterator insert(const_iterator hint, reference value);

          Requires: value must be an lvalue, and "hint" must be a valid iterator

          Effects: Tries to insert x into the container, using "hint" as a hint to where it will be inserted.

          Complexity: Logarithmic in general, but it is amortized constant time (two comparisons in the worst case) if t is inserted immediately before hint.

          @@ -401,7 +401,7 @@ 
        25. std::pair< iterator, bool > 
-insert_check(const key_type & key, insert_commit_data & commit_data);
          +insert_check(const key_type & key, insert_commit_data & commit_data);

          Effects: Checks if a value can be inserted in the container, using a user provided key instead of the value itself.

          Returns: If there is an equivalent value returns a pair containing an iterator to the already present value and false. If the value can be inserted returns true in the returned pair boolean and fills "commit_data" that is meant to be used with the "insert_commit" function.

          Complexity: Average complexity is at most logarithmic.

          @@ -409,7 +409,7 @@ 
        26. std::pair< iterator, bool > 
-insert_check(const_iterator hint, const key_type & key, 
+insert_check(const_iterator hint, const key_type & key, 
              insert_commit_data & commit_data);

          Effects: Checks if a value can be inserted in the container, using a user provided key instead of the value itself, using "hint" as a hint to where it will be inserted.

          Returns: If there is an equivalent value returns a pair containing an iterator to the already present value and false. If the value can be inserted returns true in the returned pair boolean and fills "commit_data" that is meant to be used with the "insert_commit" function.

          @@ -419,7 +419,7 @@ 
        27. template<typename KeyType, typename KeyTypeKeyCompare> 
   std::pair< iterator, bool > 
-  insert_check(const KeyType & key, KeyTypeKeyCompare comp, 
+  insert_check(const KeyType & key, KeyTypeKeyCompare comp, 
                insert_commit_data & commit_data);

          Requires: comp must be a comparison function that induces the same strict weak ordering as key_compare. The difference is that comp compares an arbitrary key with the contained values.

          Effects: Checks if a value can be inserted in the container, using a user provided key instead of the value itself.

          @@ -433,7 +433,7 @@ 
        28. template<typename KeyType, typename KeyTypeKeyCompare> 
   std::pair< iterator, bool > 
-  insert_check(const_iterator hint, const KeyType & key, 
+  insert_check(const_iterator hint, const KeyType & key, 
                KeyTypeKeyCompare comp, insert_commit_data & commit_data);

          Requires: comp must be a comparison function that induces the same strict weak ordering as key_compare. The difference is that comp compares an arbitrary key with the contained values.

          Effects: Checks if a value can be inserted in the container, using a user provided key instead of the value itself, using "hint" as a hint to where it will be inserted.

          @@ -445,7 +445,7 @@

          "commit_data" remains valid for a subsequent "insert_commit" only if no more objects are inserted or erased from the container.

        29. -
          template<typename Iterator> void insert(Iterator b, Iterator e);
          +
          template<typename Iterator> void insert(Iterator b, Iterator e);

          Requires: Dereferencing iterator must yield an lvalue of type value_type.

          Effects: Tries to insert each element of a range into the container.

          Complexity: Insert range is in general O(N * log(N)), where N is the size of the range. However, it is linear in N if the range is already sorted by value_comp().

          @@ -453,7 +453,7 @@

          Note: Does not affect the validity of iterators and references. No copy-constructors are called.

        30. -
          iterator insert_commit(reference value, 
+
          iterator insert_commit(reference value, 
                        const insert_commit_data & commit_data);
          
 
          Requires: value must be an lvalue of type value_type. commit_data must have been obtained from a previous call to "insert_check". No objects should have been inserted or erased from the container between the "insert_check" that filled "commit_data" and the call to "insert_commit".
          
 
          Effects: Inserts the value in the container using the information obtained from the "commit_data" that a previous "insert_check" filled.
          
@@ -463,7 +463,7 @@
 
          Notes: This function has only sense if a "insert_check" has been previously executed to fill "commit_data". No value should be inserted or erased between the "insert_check" and "insert_commit" calls.
        31. -
          iterator insert_before(const_iterator pos, reference value);
          +
          iterator insert_before(const_iterator pos, reference value);

          Requires: value must be an lvalue, "pos" must be a valid iterator (or end) and must be the succesor of value once inserted according to the predicate

          Effects: Inserts x into the container before "pos".

          Complexity: Constant time.

          @@ -471,7 +471,7 @@

          Note: This function does not check preconditions so if "pos" is not the successor of "value" container ordering invariant will be broken. This is a low-level function to be used only for performance reasons by advanced users.

        32. -
          void push_back(reference value);
          +
          void push_back(reference value);

          Requires: value must be an lvalue, and it must be no less than the greatest inserted key

          Effects: Inserts x into the container in the last position.

          Complexity: Constant time.

          @@ -479,7 +479,7 @@

          Note: This function does not check preconditions so if value is less than the greatest inserted key container ordering invariant will be broken. This function is slightly more efficient than using "insert_before". This is a low-level function to be used only for performance reasons by advanced users.

        33. -
          void push_front(reference value);
          +
          void push_front(reference value);

          Requires: value must be an lvalue, and it must be no greater than the minimum inserted key

          Effects: Inserts x into the container in the first position.

          Complexity: Constant time.

          @@ -487,21 +487,21 @@

          Note: This function does not check preconditions so if value is greater than the minimum inserted key container ordering invariant will be broken. This function is slightly more efficient than using "insert_before". This is a low-level function to be used only for performance reasons by advanced users.

        34. -
          iterator erase(const_iterator i);
          +
          iterator erase(const_iterator i);

          Effects: Erases the element pointed to by i.

          Complexity: Average complexity for erase element is constant time.

          Throws: Nothing.

          Note: Invalidates the iterators (but not the references) to the erased elements. No destructors are called.

        35. -
          iterator erase(const_iterator b, const_iterator e);
          +
          iterator erase(const_iterator b, const_iterator e);

          Effects: Erases the range pointed to by b end e.

          Complexity: Average complexity for erase range is at most O(log(size() + N)), where N is the number of elements in the range.

          Throws: Nothing.

          Note: Invalidates the iterators (but not the references) to the erased elements. No destructors are called.

        36. -
          size_type erase(const key_type & key);
          +
          size_type erase(const key_type & key);

          Effects: Erases all the elements with the given value.

          Returns: The number of erased elements.

          Complexity: O(log(size() + N).

          @@ -510,7 +510,7 @@ 
        37. template<typename KeyType, typename KeyTypeKeyCompare> 
-  size_type erase(const KeyType & key, KeyTypeKeyCompare comp);
          + size_type erase(const KeyType & key, KeyTypeKeyCompare comp);

          Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk), with nk the key_type of a value_type inserted into *this.

          Effects: Erases all the elements with the given key. according to the comparison functor "comp".

          Returns: The number of erased elements.

          @@ -520,7 +520,7 @@ 
        38. template<typename Disposer> 
-  iterator erase_and_dispose(const_iterator i, Disposer disposer);
          + iterator erase_and_dispose(const_iterator i, Disposer disposer);

          Requires: Disposer::operator()(pointer) shouldn't throw.

          Effects: Erases the element pointed to by i. Disposer::operator()(pointer) is called for the removed element.

          Complexity: Average complexity for erase element is constant time.

          @@ -529,7 +529,7 @@ 
        39. template<typename Disposer> 
-  iterator erase_and_dispose(const_iterator b, const_iterator e, 
+  iterator erase_and_dispose(const_iterator b, const_iterator e, 
                              Disposer disposer);

          Requires: Disposer::operator()(pointer) shouldn't throw.

          Effects: Erases the range pointed to by b end e. Disposer::operator()(pointer) is called for the removed elements.

          @@ -539,7 +539,7 @@ 
        40. template<typename Disposer> 
-  size_type erase_and_dispose(const key_type & key, Disposer disposer);
          + size_type erase_and_dispose(const key_type & key, Disposer disposer);

          Requires: Disposer::operator()(pointer) shouldn't throw.

          Effects: Erases all the elements with the given value. Disposer::operator()(pointer) is called for the removed elements.

          Returns: The number of erased elements.

          @@ -549,7 +549,7 @@ 
        41. template<typename KeyType, typename KeyTypeKeyCompare, typename Disposer> 
-  size_type erase_and_dispose(const KeyType & key, KeyTypeKeyCompare comp, 
+  size_type erase_and_dispose(const KeyType & key, KeyTypeKeyCompare comp, 
                               Disposer disposer);

          Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk) and nk the key_type of a value_type inserted into *this.

          Requires: Disposer::operator()(pointer) shouldn't throw.

          @@ -560,47 +560,47 @@

          Note: Invalidates the iterators to the erased elements.

        42. -
          void clear();
          +
          void clear();

          Effects: Erases all of the elements.

          Complexity: Linear to the number of elements on the container. if it's a safe-mode or auto-unlink value_type. Constant time otherwise.

          Throws: Nothing.

          Note: Invalidates the iterators (but not the references) to the erased elements. No destructors are called.

        43. -
          template<typename Disposer> void clear_and_dispose(Disposer disposer);
          +
          template<typename Disposer> void clear_and_dispose(Disposer disposer);

          Effects: Erases all of the elements calling disposer(p) for each node to be erased. Complexity: Average complexity for is at most O(log(size() + N)), where N is the number of elements in the container.

          Throws: Nothing.

          Note: Invalidates the iterators (but not the references) to the erased elements. Calls N times to disposer functor.

        44. -
          size_type count(const key_type & key) const;
          +
          size_type count(const key_type & key) const;

          Effects: Returns the number of contained elements with the given value

          Complexity: Logarithmic to the number of elements contained plus lineal to number of objects with the given value.

          Throws: If key_compare throws. 

        45. template<typename KeyType, typename KeyTypeKeyCompare> 
-  size_type count(const KeyType & key, KeyTypeKeyCompare comp) const;
          + size_type count(const KeyType & key, KeyTypeKeyCompare comp) const;

          Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk), and nk the key_type of a value_type inserted into *this.

          Effects: Returns the number of contained elements with the given key

          Complexity: Logarithmic to the number of elements contained plus lineal to number of objects with the given key.

          Throws: If comp throws.

        46. -
          iterator lower_bound(const key_type & key);
          +
          iterator lower_bound(const key_type & key);

          Effects: Returns an iterator to the first element whose key is not less than k or end() if that element does not exist.

          Complexity: Logarithmic.

          Throws: If key_compare throws. 

        47. template<typename KeyType, typename KeyTypeKeyCompare> 
-  iterator lower_bound(const KeyType & key, KeyTypeKeyCompare comp);
          + iterator lower_bound(const KeyType & key, KeyTypeKeyCompare comp);

          Effects: Returns an iterator to the first element whose key is not less than k or end() if that element does not exist.

          Complexity: Logarithmic.

          Throws: If key_compare throws.

        48. -
          const_iterator lower_bound(const key_type & key) const;
          +
          const_iterator lower_bound(const key_type & key) const;

          Effects: Returns an iterator to the first element whose key is not less than k or end() if that element does not exist.

          Complexity: Logarithmic.

          Throws: If key_compare throws.

          @@ -608,27 +608,27 @@ 
        49. template<typename KeyType, typename KeyTypeKeyCompare> 
   const_iterator 
-  lower_bound(const KeyType & key, KeyTypeKeyCompare comp) const;
          + lower_bound(const KeyType & key, KeyTypeKeyCompare comp) const;

          Effects: Returns an iterator to the first element whose key is not less than k or end() if that element does not exist.

          Complexity: Logarithmic.

          Throws: If key_compare throws.

        50. -
          iterator upper_bound(const key_type & key);
          +
          iterator upper_bound(const key_type & key);

          Effects: Returns an iterator to the first element whose key is greater than k or end() if that element does not exist.

          Complexity: Logarithmic.

          Throws: If key_compare throws. 

        51. template<typename KeyType, typename KeyTypeKeyCompare> 
-  iterator upper_bound(const KeyType & key, KeyTypeKeyCompare comp);
          + iterator upper_bound(const KeyType & key, KeyTypeKeyCompare comp);

          Requires: key is a value such that *this is partitioned with respect to !comp(key, nk), with nk the key_type of a value_type inserted into *this.

          Effects: Returns an iterator to the first element whose key is greater than k according to comp or end() if that element does not exist.

          Complexity: Logarithmic.

          Throws: If comp throws.

        52. -
          const_iterator upper_bound(const key_type & key) const;
          +
          const_iterator upper_bound(const key_type & key) const;

          Effects: Returns an iterator to the first element whose key is greater than k or end() if that element does not exist.

          Complexity: Logarithmic.

          Throws: If key_compare throws.

          @@ -636,42 +636,42 @@ 
        53. template<typename KeyType, typename KeyTypeKeyCompare> 
   const_iterator 
-  upper_bound(const KeyType & key, KeyTypeKeyCompare comp) const;
          + upper_bound(const KeyType & key, KeyTypeKeyCompare comp) const;

          Requires: key is a value such that *this is partitioned with respect to !comp(key, nk), with nk the key_type of a value_type inserted into *this.

          Effects: Returns an iterator to the first element whose key is greater than k according to comp or end() if that element does not exist.

          Complexity: Logarithmic.

          Throws: If comp throws.

        54. -
          iterator find(const key_type & key);
          +
          iterator find(const key_type & key);

          Effects: Finds an iterator to the first element whose key is k or end() if that element does not exist.

          Complexity: Logarithmic.

          Throws: If key_compare throws. 

        55. template<typename KeyType, typename KeyTypeKeyCompare> 
-  iterator find(const KeyType & key, KeyTypeKeyCompare comp);
          + iterator find(const KeyType & key, KeyTypeKeyCompare comp);

          Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk), and nk the key_type of a value_type inserted into *this.

          Effects: Finds an iterator to the first element whose key is k or end() if that element does not exist.

          Complexity: Logarithmic.

          Throws: If comp throws.

        56. -
          const_iterator find(const key_type & key) const;
          +
          const_iterator find(const key_type & key) const;

          Effects: Finds an iterator to the first element whose key is k or end() if that element does not exist.

          Complexity: Logarithmic.

          Throws: If key_compare throws. 

        57. template<typename KeyType, typename KeyTypeKeyCompare> 
-  const_iterator find(const KeyType & key, KeyTypeKeyCompare comp) const;
          + const_iterator find(const KeyType & key, KeyTypeKeyCompare comp) const;

          Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk), and nk the key_type of a value_type inserted into *this.

          Effects: Finds an iterator to the first element whose key is k or end() if that element does not exist.

          Complexity: Logarithmic.

          Throws: If comp throws.

        58. -
          std::pair< iterator, iterator > equal_range(const key_type & key);
          +
          std::pair< iterator, iterator > equal_range(const key_type & key);

          Effects: Finds a range containing all elements whose key is k or an empty range that indicates the position where those elements would be if they there is no elements with key k.

          Complexity: Logarithmic.

          Throws: If key_compare throws.

          @@ -679,7 +679,7 @@ 
        59. template<typename KeyType, typename KeyTypeKeyCompare> 
   std::pair< iterator, iterator > 
-  equal_range(const KeyType & key, KeyTypeKeyCompare comp);
          + equal_range(const KeyType & key, KeyTypeKeyCompare comp);

          Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk), with nk the key_type of a value_type inserted into *this.

          Effects: Finds a range containing all elements whose key is k or an empty range that indicates the position where those elements would be if they there is no elements with key k.

          Complexity: Logarithmic.

          @@ -687,7 +687,7 @@ 
        60. std::pair< const_iterator, const_iterator > 
-equal_range(const key_type & key) const;
          +equal_range(const key_type & key) const;

          Effects: Finds a range containing all elements whose key is k or an empty range that indicates the position where those elements would be if they there is no elements with key k.

          Complexity: Logarithmic.

          Throws: If key_compare throws.

          @@ -695,7 +695,7 @@ 
        61. template<typename KeyType, typename KeyTypeKeyCompare> 
   std::pair< const_iterator, const_iterator > 
-  equal_range(const KeyType & key, KeyTypeKeyCompare comp) const;
          + equal_range(const KeyType & key, KeyTypeKeyCompare comp) const;

          Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk), with nk the key_type of a value_type inserted into *this.

          Effects: Finds a range containing all elements whose key is k or an empty range that indicates the position where those elements would be if they there is no elements with key k.

          Complexity: Logarithmic.

          @@ -703,7 +703,7 @@ 
        62. std::pair< iterator, iterator > 
-bounded_range(const key_type & lower_key, const key_type & upper_key, 
+bounded_range(const key_type & lower_key, const key_type & upper_key, 
               bool left_closed, bool right_closed);

          Requires: upper_key shall not precede lower_key according to key_compare. [key_comp()(upper_key, lower_key) shall be false]

          If lower_key is equivalent to upper_key [!key_comp()(upper_key, lower_key) && !key_comp()(lower_key, upper_key)] then ('left_closed' || 'right_closed') must be false.

          @@ -718,7 +718,7 @@ 
        63. template<typename KeyType, typename KeyTypeKeyCompare> 
   std::pair< iterator, iterator > 
-  bounded_range(const KeyType & lower_key, const KeyType & upper_key, 
+  bounded_range(const KeyType & lower_key, const KeyType & upper_key, 
                 KeyTypeKeyCompare comp, bool left_closed, bool right_closed);

          Requires: lower_key is a value such that *this is partitioned with respect to comp(nk, lower_key) if left_closed is true, with respect to !comp(lower_key, nk) otherwise.

          upper_key is a value such that *this is partitioned with respect to !comp(upper_key, nk) if right_closed is true, with respect to comp(nk, upper_key) otherwise.

          @@ -734,7 +734,7 @@ 
        64. std::pair< const_iterator, const_iterator > 
-bounded_range(const key_type & lower_key, const key_type & upper_key, 
+bounded_range(const key_type & lower_key, const key_type & upper_key, 
               bool left_closed, bool right_closed) const;

          Requires: upper_key shall not precede lower_key according to key_compare. [key_comp()(upper_key, lower_key) shall be false]

          If lower_key is equivalent to upper_key [!key_comp()(upper_key, lower_key) && !key_comp()(lower_key, upper_key)] then ('left_closed' || 'right_closed') must be false.

          @@ -749,7 +749,7 @@ 
        65. template<typename KeyType, typename KeyTypeKeyCompare> 
   std::pair< const_iterator, const_iterator > 
-  bounded_range(const KeyType & lower_key, const KeyType & upper_key, 
+  bounded_range(const KeyType & lower_key, const KeyType & upper_key, 
                 KeyTypeKeyCompare comp, bool left_closed, bool right_closed) const;

          Requires: lower_key is a value such that *this is partitioned with respect to comp(nk, lower_key) if left_closed is true, with respect to !comp(lower_key, nk) otherwise.

          upper_key is a value such that *this is partitioned with respect to !comp(upper_key, nk) if right_closed is true, with respect to comp(nk, upper_key) otherwise.

          @@ -764,28 +764,28 @@

          Note: Experimental function, the interface might change in future releases.

        66. -
          iterator iterator_to(reference value);
          +
          iterator iterator_to(reference value);

          Requires: value must be an lvalue and shall be in a set of appropriate type. Otherwise the behavior is undefined.

          Effects: Returns: a valid iterator i belonging to the set that points to the value

          Complexity: Constant.

          Throws: Nothing.

        67. -
          const_iterator iterator_to(const_reference value) const;
          +
          const_iterator iterator_to(const_reference value) const;

          Requires: value must be an lvalue and shall be in a set of appropriate type. Otherwise the behavior is undefined.

          Effects: Returns: a valid const_iterator i belonging to the set that points to the value

          Complexity: Constant.

          Throws: Nothing.

        68. -
          pointer unlink_leftmost_without_rebalance();
          +
          pointer unlink_leftmost_without_rebalance();

          Effects: Unlinks the leftmost node from the container.

          Complexity: Average complexity is constant time.

          Throws: Nothing.

          Notes: This function breaks the container and the container can only be used for more unlink_leftmost_without_rebalance calls. This function is normally used to achieve a step by step controlled destruction of the container.

        69. -
          void replace_node(iterator replace_this, reference with_this);
          +
          void replace_node(iterator replace_this, reference with_this);

          Requires: replace_this must be a valid iterator of *this and with_this must not be inserted in any container.

          Effects: Replaces replace_this in its position in the container with with_this. The container does not need to be rebalanced.

          Complexity: Constant.

          @@ -793,7 +793,7 @@

          Note: This function will break container ordering invariants if with_this is not equivalent to *replace_this according to the ordering rules. This function is faster than erasing and inserting the node, since no rebalancing or comparison is needed.

        70. -
          void remove_node(reference value);
          +
          void remove_node(reference value);

          Effects: removes "value" from the container.

          Throws: Nothing.

          Complexity: Logarithmic time.

          @@ -801,7 +801,7 @@

          If the user calls this function with a constant time size container or stateful comparison functor a compilation error will be issued.

        71. -
          template<class... Options2> void merge(avl_set< T, Options2...> & source);
          +
          template<class... Options2> void merge(avl_set< T, Options2...> & source);

          Requires: "source" container's Options can only can differ in the comparison function from *this.

          Effects: Attempts to extract each element in source and insert it into a using the comparison object of *this. If there is an element in a with key equivalent to the key of an element from source, then that element is not extracted from source.

          Postcondition: Pointers and references to the transferred elements of source refer to those same elements but as members of *this. Iterators referring to the transferred elements will continue to refer to their elements, but they now behave as iterators into *this, not into source.

          @@ -809,7 +809,7 @@

          Complexity: N log(a.size() + N) (N has the value source.size())

        72. -
          template<class... Options2> void merge(avl_multiset< T, Options2...> & source);
          +
          template<class... Options2> void merge(avl_multiset< T, Options2...> & source);

          Requires: "source" container's Options can only can differ in the comparison function from *this.

          Effects: Attempts to extract each element in source and insert it into a using the comparison object of *this. If there is an element in a with key equivalent to the key of an element from source, then that element is not extracted from source.

          Postcondition: Pointers and references to the transferred elements of source refer to those same elements but as members of *this. Iterators referring to the transferred elements will continue to refer to their elements, but they now behave as iterators into *this, not into source.

          @@ -820,10 +820,10 @@

        -avl_set public static functions

        +avl_set public static functions
        1. -
          static avl_set & container_from_end_iterator(iterator end_iterator);
          +
          static avl_set & container_from_end_iterator(iterator end_iterator);

          Precondition: end_iterator must be a valid end iterator of the container.

          Effects: Returns a const reference to the container associated to the end iterator

          Throws: Nothing.

          @@ -831,28 +831,28 @@ 
        2. static const avl_set & 
-container_from_end_iterator(const_iterator end_iterator);
          +container_from_end_iterator(const_iterator end_iterator);

          Precondition: end_iterator must be a valid end iterator of the container.

          Effects: Returns a const reference to the container associated to the end iterator

          Throws: Nothing.

          Complexity: Constant.

        3. -
          static avl_set & container_from_iterator(iterator it);
          +
          static avl_set & container_from_iterator(iterator it);

          Precondition: it must be a valid iterator of the container.

          Effects: Returns a const reference to the container associated to the iterator

          Throws: Nothing.

          Complexity: Logarithmic.

        4. -
          static const avl_set & container_from_iterator(const_iterator it);
          +
          static const avl_set & container_from_iterator(const_iterator it);

          Precondition: it must be a valid iterator of the container.

          Effects: Returns a const reference to the container associated to the iterator

          Throws: Nothing.

          Complexity: Logarithmic.

        5. -
          static iterator s_iterator_to(reference value);
          +
          static iterator s_iterator_to(reference value);

          Requires: value must be an lvalue and shall be in a set of appropriate type. Otherwise the behavior is undefined.

          Effects: Returns: a valid iterator i belonging to the set that points to the value

          Complexity: Constant.

          @@ -860,7 +860,7 @@

          Note: This static function is available only if the value traits is stateless.

        6. -
          static const_iterator s_iterator_to(const_reference value);
          +
          static const_iterator s_iterator_to(const_reference value);

          Requires: value must be an lvalue and shall be in a set of appropriate type. Otherwise the behavior is undefined.

          Effects: Returns: a valid iterator i belonging to the set that points to the value

          Complexity: Constant.

          @@ -868,7 +868,7 @@

          Note: This static function is available only if the value traits is stateless.

        7. -
          static void init_node(reference value);
          +
          static void init_node(reference value);

          Requires: value shall not be in a container.

          Effects: init_node puts the hook of a value in a well-known default state.

          Throws: Nothing.

          diff --git a/doc/html/boost/intrusive/avl_set_base_hook.html b/doc/html/boost/intrusive/avl_set_base_hook.html index 596aef7560..3d2b76ad93 100644 --- a/doc/html/boost/intrusive/avl_set_base_hook.html +++ b/doc/html/boost/intrusive/avl_set_base_hook.html @@ -38,15 +38,15 @@ { public: // construct/copy/destruct - avl_set_base_hook(); - avl_set_base_hook(const avl_set_base_hook &); - avl_set_base_hook & operator=(const avl_set_base_hook &); - ~avl_set_base_hook(); + avl_set_base_hook(); + avl_set_base_hook(const avl_set_base_hook &); + avl_set_base_hook & operator=(const avl_set_base_hook &); + ~avl_set_base_hook(); - // public member functions - void swap_nodes(avl_set_base_hook &); - bool is_linked() const; - void unlink(); + // public member functions + void swap_nodes(avl_set_base_hook &); + bool is_linked() const; + void unlink(); };

        Description

        @@ -63,24 +63,24 @@ construct/copy/destruct
        1. -
          avl_set_base_hook();
          +
          avl_set_base_hook();

          Effects: If link_mode is auto_unlink or safe_link initializes the node to an unlinked state.

          Throws: Nothing.

        2. -
          avl_set_base_hook(const avl_set_base_hook &);
          +
          avl_set_base_hook(const avl_set_base_hook &);

          Effects: If link_mode is auto_unlink or safe_link initializes the node to an unlinked state. The argument is ignored.

          Throws: Nothing.

          Rationale: Providing a copy-constructor makes classes using the hook STL-compliant without forcing the user to do some additional work. swap can be used to emulate move-semantics.

        3. -
          avl_set_base_hook & operator=(const avl_set_base_hook &);
          +
          avl_set_base_hook & operator=(const avl_set_base_hook &);

          Effects: Empty function. The argument is ignored.

          Throws: Nothing.

          Rationale: Providing an assignment operator makes classes using the hook STL-compliant without forcing the user to do some additional work. swap can be used to emulate move-semantics.

        4. -
          ~avl_set_base_hook();
          +
          ~avl_set_base_hook();

          Effects: If link_mode is normal_link, the destructor does nothing (ie. no code is generated). If link_mode is safe_link and the object is stored in a set an assertion is raised. If link_mode is auto_unlink and is_linked() is true, the node is unlinked.

          Throws: Nothing.

          5. @@ -88,22 +88,22 @@

        -avl_set_base_hook public member functions

        +avl_set_base_hook public member functions
        1. -
          void swap_nodes(avl_set_base_hook & other);
          +
          void swap_nodes(avl_set_base_hook & other);

          Effects: Swapping two nodes swaps the position of the elements related to those nodes in one or two containers. That is, if the node this is part of the element e1, the node x is part of the element e2 and both elements are included in the containers s1 and s2, then after the swap-operation e1 is in s2 at the position of e2 and e2 is in s1 at the position of e1. If one element is not in a container, then after the swap-operation the other element is not in a container. Iterators to e1 and e2 related to those nodes are invalidated.

          Complexity: Constant

          Throws: Nothing.

        2. -
          bool is_linked() const;
          +
          bool is_linked() const;

          Precondition: link_mode must be safe_link or auto_unlink.

          Returns: true, if the node belongs to a container, false otherwise. This function can be used to test whether set::iterator_to will return a valid iterator.

          Complexity: Constant

        3. -
          void unlink();
          +
          void unlink();

          Effects: Removes the node if it's inserted in a container. This function is only allowed if link_mode is auto_unlink.

          Throws: Nothing.

          4. diff --git a/doc/html/boost/intrusive/avl_set_member_hook.html b/doc/html/boost/intrusive/avl_set_member_hook.html index 9ab7ef8f1e..d1584b4cf9 100644 --- a/doc/html/boost/intrusive/avl_set_member_hook.html +++ b/doc/html/boost/intrusive/avl_set_member_hook.html @@ -38,15 +38,15 @@ { public: // construct/copy/destruct - avl_set_member_hook(); - avl_set_member_hook(const avl_set_member_hook &); - avl_set_member_hook & operator=(const avl_set_member_hook &); - ~avl_set_member_hook(); + avl_set_member_hook(); + avl_set_member_hook(const avl_set_member_hook &); + avl_set_member_hook & operator=(const avl_set_member_hook &); + ~avl_set_member_hook(); - // public member functions - void swap_nodes(avl_set_member_hook &); - bool is_linked() const; - void unlink(); + // public member functions + void swap_nodes(avl_set_member_hook &); + bool is_linked() const; + void unlink(); };

        Description

        @@ -62,24 +62,24 @@ construct/copy/destruct
        1. -
          avl_set_member_hook();
          +
          avl_set_member_hook();

          Effects: If link_mode is auto_unlink or safe_link initializes the node to an unlinked state.

          Throws: Nothing.

        2. -
          avl_set_member_hook(const avl_set_member_hook &);
          +
          avl_set_member_hook(const avl_set_member_hook &);

          Effects: If link_mode is auto_unlink or safe_link initializes the node to an unlinked state. The argument is ignored.

          Throws: Nothing.

          Rationale: Providing a copy-constructor makes classes using the hook STL-compliant without forcing the user to do some additional work. swap can be used to emulate move-semantics.

        3. -
          avl_set_member_hook & operator=(const avl_set_member_hook &);
          +
          avl_set_member_hook & operator=(const avl_set_member_hook &);

          Effects: Empty function. The argument is ignored.

          Throws: Nothing.

          Rationale: Providing an assignment operator makes classes using the hook STL-compliant without forcing the user to do some additional work. swap can be used to emulate move-semantics.

        4. -
          ~avl_set_member_hook();
          +
          ~avl_set_member_hook();

          Effects: If link_mode is normal_link, the destructor does nothing (ie. no code is generated). If link_mode is safe_link and the object is stored in a set an assertion is raised. If link_mode is auto_unlink and is_linked() is true, the node is unlinked.

          Throws: Nothing.

          5. @@ -87,22 +87,22 @@

        -avl_set_member_hook public member functions

        +avl_set_member_hook public member functions
        1. -
          void swap_nodes(avl_set_member_hook & other);
          +
          void swap_nodes(avl_set_member_hook & other);

          Effects: Swapping two nodes swaps the position of the elements related to those nodes in one or two containers. That is, if the node this is part of the element e1, the node x is part of the element e2 and both elements are included in the containers s1 and s2, then after the swap-operation e1 is in s2 at the position of e2 and e2 is in s1 at the position of e1. If one element is not in a container, then after the swap-operation the other element is not in a container. Iterators to e1 and e2 related to those nodes are invalidated.

          Complexity: Constant

          Throws: Nothing.

        2. -
          bool is_linked() const;
          +
          bool is_linked() const;

          Precondition: link_mode must be safe_link or auto_unlink.

          Returns: true, if the node belongs to a container, false otherwise. This function can be used to test whether set::iterator_to will return a valid iterator.

          Complexity: Constant

        3. -
          void unlink();
          +
          void unlink();

          Effects: Removes the node if it's inserted in a container. This function is only allowed if link_mode is auto_unlink.

          Throws: Nothing.

          4. diff --git a/doc/html/boost/intrusive/avltree.html b/doc/html/boost/intrusive/avltree.html index c5a16bb0bc..065c590b1e 100644 --- a/doc/html/boost/intrusive/avltree.html +++ b/doc/html/boost/intrusive/avltree.html @@ -60,137 +60,137 @@ typedef implementation_defined::insert_commit_data insert_commit_data; // construct/copy/destruct - avltree(); - explicit avltree(const key_compare &, const value_traits & = value_traits()); + avltree(); + explicit avltree(const key_compare &, const value_traits & = value_traits()); template<typename Iterator> - avltree(bool, Iterator, Iterator, const key_compare & = key_compare(), + avltree(bool, Iterator, Iterator, const key_compare & = key_compare(), const value_traits & = value_traits()); - avltree(avltree &&); - avltree & operator=(avltree &&); - ~avltree(); + avltree(avltree &&); + avltree & operator=(avltree &&); + ~avltree(); - // public member functions - iterator begin(); - const_iterator begin() const; - const_iterator cbegin() const; - iterator end(); - const_iterator end() const; - const_iterator cend() const; - reverse_iterator rbegin(); - const_reverse_iterator rbegin() const; - const_reverse_iterator crbegin() const; - reverse_iterator rend(); - const_reverse_iterator rend() const; - const_reverse_iterator crend() const; - iterator root(); - const_iterator root() const; - const_iterator croot() const; - key_compare key_comp() const; - value_compare value_comp() const; - bool empty() const; - size_type size() const; - void swap(avltree &); + // public member functions + iterator begin(); + const_iterator begin() const; + const_iterator cbegin() const; + iterator end(); + const_iterator end() const; + const_iterator cend() const; + reverse_iterator rbegin(); + const_reverse_iterator rbegin() const; + const_reverse_iterator crbegin() const; + reverse_iterator rend(); + const_reverse_iterator rend() const; + const_reverse_iterator crend() const; + iterator root(); + const_iterator root() const; + const_iterator croot() const; + key_compare key_comp() const; + value_compare value_comp() const; + bool empty() const; + size_type size() const; + void swap(avltree &); template<typename Cloner, typename Disposer> - void clone_from(const avltree &, Cloner, Disposer); + void clone_from(const avltree &, Cloner, Disposer); template<typename Cloner, typename Disposer> - void clone_from(avltree &&, Cloner, Disposer); - iterator insert_equal(reference); - iterator insert_equal(const_iterator, reference); - template<typename Iterator> void insert_equal(Iterator, Iterator); - std::pair< iterator, bool > insert_unique(reference); - iterator insert_unique(const_iterator, reference); + void clone_from(avltree &&, Cloner, Disposer); + iterator insert_equal(reference); + iterator insert_equal(const_iterator, reference); + template<typename Iterator> void insert_equal(Iterator, Iterator); + std::pair< iterator, bool > insert_unique(reference); + iterator insert_unique(const_iterator, reference); template<typename KeyType, typename KeyTypeKeyCompare> std::pair< iterator, bool > - insert_unique_check(const KeyType &, KeyTypeKeyCompare, + insert_unique_check(const KeyType &, KeyTypeKeyCompare, insert_commit_data &); template<typename KeyType, typename KeyTypeKeyCompare> std::pair< iterator, bool > - insert_unique_check(const_iterator, const KeyType &, KeyTypeKeyCompare, + insert_unique_check(const_iterator, const KeyType &, KeyTypeKeyCompare, insert_commit_data &); std::pair< iterator, bool > - insert_unique_check(const key_type &, insert_commit_data &); + insert_unique_check(const key_type &, insert_commit_data &); std::pair< iterator, bool > - insert_unique_check(const_iterator, const key_type &, insert_commit_data &); - iterator insert_unique_commit(reference, const insert_commit_data &); - template<typename Iterator> void insert_unique(Iterator, Iterator); - iterator insert_before(const_iterator, reference); - void push_back(reference); - void push_front(reference); - iterator erase(const_iterator); - iterator erase(const_iterator, const_iterator); - size_type erase(const key_type &); + insert_unique_check(const_iterator, const key_type &, insert_commit_data &); + iterator insert_unique_commit(reference, const insert_commit_data &); + template<typename Iterator> void insert_unique(Iterator, Iterator); + iterator insert_before(const_iterator, reference); + void push_back(reference); + void push_front(reference); + iterator erase(const_iterator); + iterator erase(const_iterator, const_iterator); + size_type erase(const key_type &); template<typename KeyType, typename KeyTypeKeyCompare> - size_type erase(const KeyType &, KeyTypeKeyCompare); + size_type erase(const KeyType &, KeyTypeKeyCompare); template<typename Disposer> - iterator erase_and_dispose(const_iterator, Disposer); + iterator erase_and_dispose(const_iterator, Disposer); template<typename Disposer> - iterator erase_and_dispose(const_iterator, const_iterator, Disposer); + iterator erase_and_dispose(const_iterator, const_iterator, Disposer); template<typename Disposer> - size_type erase_and_dispose(const key_type &, Disposer); + size_type erase_and_dispose(const key_type &, Disposer); template<typename KeyType, typename KeyTypeKeyCompare, typename Disposer> - size_type erase_and_dispose(const KeyType &, KeyTypeKeyCompare, Disposer); - void clear(); - template<typename Disposer> void clear_and_dispose(Disposer); - size_type count(const key_type &) const; + size_type erase_and_dispose(const KeyType &, KeyTypeKeyCompare, Disposer); + void clear(); + template<typename Disposer> void clear_and_dispose(Disposer); + size_type count(const key_type &) const; template<typename KeyType, typename KeyTypeKeyCompare> - size_type count(const KeyType &, KeyTypeKeyCompare) const; - iterator lower_bound(const key_type &); + size_type count(const KeyType &, KeyTypeKeyCompare) const; + iterator lower_bound(const key_type &); template<typename KeyType, typename KeyTypeKeyCompare> - iterator lower_bound(const KeyType &, KeyTypeKeyCompare); - const_iterator lower_bound(const key_type &) const; + iterator lower_bound(const KeyType &, KeyTypeKeyCompare); + const_iterator lower_bound(const key_type &) const; template<typename KeyType, typename KeyTypeKeyCompare> - const_iterator lower_bound(const KeyType &, KeyTypeKeyCompare) const; - iterator upper_bound(const key_type &); + const_iterator lower_bound(const KeyType &, KeyTypeKeyCompare) const; + iterator upper_bound(const key_type &); template<typename KeyType, typename KeyTypeKeyCompare> - iterator upper_bound(const KeyType &, KeyTypeKeyCompare); - const_iterator upper_bound(const key_type &) const; + iterator upper_bound(const KeyType &, KeyTypeKeyCompare); + const_iterator upper_bound(const key_type &) const; template<typename KeyType, typename KeyTypeKeyCompare> - const_iterator upper_bound(const KeyType &, KeyTypeKeyCompare) const; - iterator find(const key_type &); + const_iterator upper_bound(const KeyType &, KeyTypeKeyCompare) const; + iterator find(const key_type &); template<typename KeyType, typename KeyTypeKeyCompare> - iterator find(const KeyType &, KeyTypeKeyCompare); - const_iterator find(const key_type &) const; + iterator find(const KeyType &, KeyTypeKeyCompare); + const_iterator find(const key_type &) const; template<typename KeyType, typename KeyTypeKeyCompare> - const_iterator find(const KeyType &, KeyTypeKeyCompare) const; - std::pair< iterator, iterator > equal_range(const key_type &); + const_iterator find(const KeyType &, KeyTypeKeyCompare) const; + std::pair< iterator, iterator > equal_range(const key_type &); template<typename KeyType, typename KeyTypeKeyCompare> std::pair< iterator, iterator > - equal_range(const KeyType &, KeyTypeKeyCompare); + equal_range(const KeyType &, KeyTypeKeyCompare); std::pair< const_iterator, const_iterator > - equal_range(const key_type &) const; + equal_range(const key_type &) const; template<typename KeyType, typename KeyTypeKeyCompare> std::pair< const_iterator, const_iterator > - equal_range(const KeyType &, KeyTypeKeyCompare) const; + equal_range(const KeyType &, KeyTypeKeyCompare) const; std::pair< iterator, iterator > - bounded_range(const key_type &, const key_type &, bool, bool); + bounded_range(const key_type &, const key_type &, bool, bool); template<typename KeyType, typename KeyTypeKeyCompare> std::pair< iterator, iterator > - bounded_range(const KeyType &, const KeyType &, KeyTypeKeyCompare, bool, + bounded_range(const KeyType &, const KeyType &, KeyTypeKeyCompare, bool, bool); std::pair< const_iterator, const_iterator > - bounded_range(const key_type &, const key_type &, bool, bool) const; + bounded_range(const key_type &, const key_type &, bool, bool) const; template<typename KeyType, typename KeyTypeKeyCompare> std::pair< const_iterator, const_iterator > - bounded_range(const KeyType &, const KeyType &, KeyTypeKeyCompare, bool, + bounded_range(const KeyType &, const KeyType &, KeyTypeKeyCompare, bool, bool) const; - iterator iterator_to(reference); - const_iterator iterator_to(const_reference) const; - pointer unlink_leftmost_without_rebalance(); - void replace_node(iterator, reference); - void remove_node(reference); + iterator iterator_to(reference); + const_iterator iterator_to(const_reference) const; + pointer unlink_leftmost_without_rebalance(); + void replace_node(iterator, reference); + void remove_node(reference); template<typename T, class... Options2> - void merge_unique(avltree< T, Options2...> &); + void merge_unique(avltree< T, Options2...> &); template<typename T, class... Options2> - void merge_equal(avltree< T, Options2...> &); + void merge_equal(avltree< T, Options2...> &); - // public static functions - static avltree & container_from_end_iterator(iterator); - static const avltree & container_from_end_iterator(const_iterator); - static avltree & container_from_iterator(iterator); - static const avltree & container_from_iterator(const_iterator); - static iterator s_iterator_to(reference); - static const_iterator s_iterator_to(const_reference); - static void init_node(reference); + // public static functions + static avltree & container_from_end_iterator(iterator); + static const avltree & container_from_end_iterator(const_iterator); + static avltree & container_from_iterator(iterator); + static const avltree & container_from_iterator(const_iterator); + static iterator s_iterator_to(reference); + static const_iterator s_iterator_to(const_reference); + static void init_node(reference); // public data members static const bool constant_time_size; @@ -207,13 +207,13 @@ construct/copy/destruct
          1. -
            avltree();
            +
            avltree();

            Effects: Constructs an empty container.

            Complexity: Constant.

            Throws: If value_traits::node_traits::node constructor throws (this does not happen with predefined Boost.Intrusive hooks) or the copy constructor of the key_compare object throws. Basic guarantee.

          2. -
            explicit avltree(const key_compare & cmp, 
+
            explicit avltree(const key_compare & cmp, 
                  const value_traits & v_traits = value_traits());
            
 
            Effects: Constructs an empty container with given comparison and traits.
            
 
            Complexity: Constant.
            
@@ -221,7 +221,7 @@
 
          3. template<typename Iterator> 
-  avltree(bool unique, Iterator b, Iterator e, 
+  avltree(bool unique, Iterator b, Iterator e, 
           const key_compare & cmp = key_compare(), 
           const value_traits & v_traits = value_traits());

            Requires: Dereferencing iterator must yield an lvalue of type value_type. cmp must be a comparison function that induces a strict weak ordering.

            @@ -230,17 +230,17 @@

            Throws: If value_traits::node_traits::node constructor throws (this does not happen with predefined Boost.Intrusive hooks) or the copy constructor/operator() of the key_compare object throws. Basic guarantee.

          4. -
            avltree(avltree && x);
            +
            avltree(avltree && x);

            Effects: Constructs a container moving resources from another container. Internal comparison object and value traits are move constructed and nodes belonging to x (except the node representing the "end") are linked to *this.

            Complexity: Constant.

            Throws: If value_traits::node_traits::node's move constructor throws (this does not happen with predefined Boost.Intrusive hooks) or the move constructor of the comparison objet throws.

          5. -
            avltree & operator=(avltree && x);
            +
            avltree & operator=(avltree && x);

            Effects: Equivalent to swap

          6. -
            ~avltree();
            +
            ~avltree();

            Effects: Detaches all elements from this. The objects in the set are not deleted (i.e. no destructors are called), but the nodes according to the value_traits template parameter are reinitialized and thus can be reused.

            Complexity: Linear to elements contained in *this.

            Throws: Nothing.

            @@ -249,131 +249,131 @@

          -avltree public member functions

          +avltree public member functions
          1. -
            iterator begin();
            +
            iterator begin();

            Effects: Returns an iterator pointing to the beginning of the container.

            Complexity: Constant.

            Throws: Nothing.

          2. -
            const_iterator begin() const;
            +
            const_iterator begin() const;

            Effects: Returns a const_iterator pointing to the beginning of the container.

            Complexity: Constant.

            Throws: Nothing.

          3. -
            const_iterator cbegin() const;
            +
            const_iterator cbegin() const;

            Effects: Returns a const_iterator pointing to the beginning of the container.

            Complexity: Constant.

            Throws: Nothing.

          4. -
            iterator end();
            +
            iterator end();

            Effects: Returns an iterator pointing to the end of the container.

            Complexity: Constant.

            Throws: Nothing.

          5. -
            const_iterator end() const;
            +
            const_iterator end() const;

            Effects: Returns a const_iterator pointing to the end of the container.

            Complexity: Constant.

            Throws: Nothing.

          6. -
            const_iterator cend() const;
            +
            const_iterator cend() const;

            Effects: Returns a const_iterator pointing to the end of the container.

            Complexity: Constant.

            Throws: Nothing.

          7. -
            reverse_iterator rbegin();
            +
            reverse_iterator rbegin();

            Effects: Returns a reverse_iterator pointing to the beginning of the reversed container.

            Complexity: Constant.

            Throws: Nothing.

          8. -
            const_reverse_iterator rbegin() const;
            +
            const_reverse_iterator rbegin() const;

            Effects: Returns a const_reverse_iterator pointing to the beginning of the reversed container.

            Complexity: Constant.

            Throws: Nothing.

          9. -
            const_reverse_iterator crbegin() const;
            +
            const_reverse_iterator crbegin() const;

            Effects: Returns a const_reverse_iterator pointing to the beginning of the reversed container.

            Complexity: Constant.

            Throws: Nothing.

          10. -
            reverse_iterator rend();
            +
            reverse_iterator rend();

            Effects: Returns a reverse_iterator pointing to the end of the reversed container.

            Complexity: Constant.

            Throws: Nothing.

          11. -
            const_reverse_iterator rend() const;
            +
            const_reverse_iterator rend() const;

            Effects: Returns a const_reverse_iterator pointing to the end of the reversed container.

            Complexity: Constant.

            Throws: Nothing.

          12. -
            const_reverse_iterator crend() const;
            +
            const_reverse_iterator crend() const;

            Effects: Returns a const_reverse_iterator pointing to the end of the reversed container.

            Complexity: Constant.

            Throws: Nothing.

          13. -
            iterator root();
            +
            iterator root();

            Effects: Returns a iterator pointing to the root node of the container or end() if not present.

            Complexity: Constant.

            Throws: Nothing.

          14. -
            const_iterator root() const;
            +
            const_iterator root() const;

            Effects: Returns a const_iterator pointing to the root node of the container or cend() if not present.

            Complexity: Constant.

            Throws: Nothing.

          15. -
            const_iterator croot() const;
            +
            const_iterator croot() const;

            Effects: Returns a const_iterator pointing to the root node of the container or cend() if not present.

            Complexity: Constant.

            Throws: Nothing.

          16. -
            key_compare key_comp() const;
            +
            key_compare key_comp() const;

            Effects: Returns the key_compare object used by the container.

            Complexity: Constant.

            Throws: If key_compare copy-constructor throws.

          17. -
            value_compare value_comp() const;
            +
            value_compare value_comp() const;

            Effects: Returns the value_compare object used by the container.

            Complexity: Constant.

            Throws: If value_compare copy-constructor throws.

          18. -
            bool empty() const;
            +
            bool empty() const;

            Effects: Returns true if the container is empty.

            Complexity: Constant.

            Throws: Nothing.

          19. -
            size_type size() const;
            +
            size_type size() const;

            Effects: Returns the number of elements stored in the container.

            Complexity: Linear to elements contained in *this if constant-time size option is disabled. Constant time otherwise.

            Throws: Nothing.

          20. -
            void swap(avltree & other);
            +
            void swap(avltree & other);

            Effects: Swaps the contents of two containers.

            Complexity: Constant.

            Throws: If the comparison functor's swap call throws. 

          21. template<typename Cloner, typename Disposer> 
-  void clone_from(const avltree & src, Cloner cloner, Disposer disposer);
            + void clone_from(const avltree & src, Cloner cloner, Disposer disposer);

            Requires: Disposer::operator()(pointer) shouldn't throw. Cloner should yield to nodes equivalent to the original nodes.

            Effects: Erases all the elements from *this calling Disposer::operator()(pointer), clones all the elements from src calling Cloner::operator()(const_reference ) and inserts them on *this. Copies the predicate from the source container.

            If cloner throws, all cloned elements are unlinked and disposed calling Disposer::operator()(pointer).

            @@ -382,7 +382,7 @@ 
          22. template<typename Cloner, typename Disposer> 
-  void clone_from(avltree && src, Cloner cloner, Disposer disposer);
            + void clone_from(avltree && src, Cloner cloner, Disposer disposer);

            Requires: Disposer::operator()(pointer) shouldn't throw. Cloner should yield to nodes equivalent to the original nodes.

            Effects: Erases all the elements from *this calling Disposer::operator()(pointer), clones all the elements from src calling Cloner::operator()(reference) and inserts them on *this. Copies the predicate from the source container.

            If cloner throws, all cloned elements are unlinked and disposed calling Disposer::operator()(pointer).

            @@ -391,7 +391,7 @@

            Note: This version can modify the source container, useful to implement move semantics.

          23. -
            iterator insert_equal(reference value);
            +
            iterator insert_equal(reference value);

            Requires: value must be an lvalue

            Effects: Inserts value into the container before the upper bound.

            Complexity: Average complexity for insert element is at most logarithmic.

            @@ -399,7 +399,7 @@

            Note: Does not affect the validity of iterators and references. No copy-constructors are called.

          24. -
            iterator insert_equal(const_iterator hint, reference value);
            +
            iterator insert_equal(const_iterator hint, reference value);

            Requires: value must be an lvalue, and "hint" must be a valid iterator.

            Effects: Inserts x into the container, using "hint" as a hint to where it will be inserted. If "hint" is the upper_bound the insertion takes constant time (two comparisons in the worst case)

            Complexity: Logarithmic in general, but it is amortized constant time if t is inserted immediately before hint.

            @@ -407,7 +407,7 @@

            Note: Does not affect the validity of iterators and references. No copy-constructors are called.

          25. -
            template<typename Iterator> void insert_equal(Iterator b, Iterator e);
            +
            template<typename Iterator> void insert_equal(Iterator b, Iterator e);

            Requires: Dereferencing iterator must yield an lvalue of type value_type.

            Effects: Inserts a each element of a range into the container before the upper bound of the key of each element.

            Complexity: Insert range is in general O(N * log(N)), where N is the size of the range. However, it is linear in N if the range is already sorted by value_comp().

            @@ -415,7 +415,7 @@

            Note: Does not affect the validity of iterators and references. No copy-constructors are called.

          26. -
            std::pair< iterator, bool > insert_unique(reference value);
            +
            std::pair< iterator, bool > insert_unique(reference value);

            Requires: value must be an lvalue

            Effects: Inserts value into the container if the value is not already present.

            Complexity: Average complexity for insert element is at most logarithmic.

            @@ -423,7 +423,7 @@

            Note: Does not affect the validity of iterators and references. No copy-constructors are called.

          27. -
            iterator insert_unique(const_iterator hint, reference value);
            +
            iterator insert_unique(const_iterator hint, reference value);

            Requires: value must be an lvalue, and "hint" must be a valid iterator

            Effects: Tries to insert x into the container, using "hint" as a hint to where it will be inserted.

            Complexity: Logarithmic in general, but it is amortized constant time (two comparisons in the worst case) if t is inserted immediately before hint.

            @@ -433,7 +433,7 @@ 
          28. template<typename KeyType, typename KeyTypeKeyCompare> 
   std::pair< iterator, bool > 
-  insert_unique_check(const KeyType & key, KeyTypeKeyCompare comp, 
+  insert_unique_check(const KeyType & key, KeyTypeKeyCompare comp, 
                       insert_commit_data & commit_data);

            Requires: comp must be a comparison function that induces the same strict weak ordering as key_compare. The difference is that comp compares an arbitrary key with the contained values.

            Effects: Checks if a value can be inserted in the container, using a user provided key instead of the value itself.

            @@ -447,7 +447,7 @@ 
          29. template<typename KeyType, typename KeyTypeKeyCompare> 
   std::pair< iterator, bool > 
-  insert_unique_check(const_iterator hint, const KeyType & key, 
+  insert_unique_check(const_iterator hint, const KeyType & key, 
                       KeyTypeKeyCompare comp, 
                       insert_commit_data & commit_data);

            Requires: comp must be a comparison function that induces the same strict weak ordering as key_compare. The difference is that comp compares an arbitrary key with the contained values.

            @@ -461,7 +461,7 @@ 
          30. std::pair< iterator, bool > 
-insert_unique_check(const key_type & key, insert_commit_data & commit_data);
            +insert_unique_check(const key_type & key, insert_commit_data & commit_data);

            Effects: Checks if a value can be inserted in the container, using a user provided key instead of the value itself.

            Returns: If there is an equivalent value returns a pair containing an iterator to the already present value and false. If the value can be inserted returns true in the returned pair boolean and fills "commit_data" that is meant to be used with the "insert_commit" function.

            Complexity: Average complexity is at most logarithmic.

            @@ -469,7 +469,7 @@ 
          31. std::pair< iterator, bool > 
-insert_unique_check(const_iterator hint, const key_type & key, 
+insert_unique_check(const_iterator hint, const key_type & key, 
                     insert_commit_data & commit_data);

            Effects: Checks if a value can be inserted in the container, using a user provided key instead of the value itself, using "hint" as a hint to where it will be inserted.

            Returns: If there is an equivalent value returns a pair containing an iterator to the already present value and false. If the value can be inserted returns true in the returned pair boolean and fills "commit_data" that is meant to be used with the "insert_commit" function.

            @@ -477,7 +477,7 @@

            Throws: If the comp ordering function throws. Strong guarantee.

          32. -
            iterator insert_unique_commit(reference value, 
+
            iterator insert_unique_commit(reference value, 
                               const insert_commit_data & commit_data);
            
 
            Requires: value must be an lvalue of type value_type. commit_data must have been obtained from a previous call to "insert_check". No objects should have been inserted or erased from the container between the "insert_check" that filled "commit_data" and the call to "insert_commit".
            
 
            Effects: Inserts the value in the container using the information obtained from the "commit_data" that a previous "insert_check" filled.
            
@@ -487,7 +487,7 @@
 
            Notes: This function has only sense if a "insert_check" has been previously executed to fill "commit_data". No value should be inserted or erased between the "insert_check" and "insert_commit" calls.
          33. -
            template<typename Iterator> void insert_unique(Iterator b, Iterator e);
            +
            template<typename Iterator> void insert_unique(Iterator b, Iterator e);

            Requires: Dereferencing iterator must yield an lvalue of type value_type.

            Effects: Tries to insert each element of a range into the container.

            Complexity: Insert range is in general O(N * log(N)), where N is the size of the range. However, it is linear in N if the range is already sorted by value_comp().

            @@ -495,7 +495,7 @@

            Note: Does not affect the validity of iterators and references. No copy-constructors are called.

          34. -
            iterator insert_before(const_iterator pos, reference value);
            +
            iterator insert_before(const_iterator pos, reference value);

            Requires: value must be an lvalue, "pos" must be a valid iterator (or end) and must be the succesor of value once inserted according to the predicate

            Effects: Inserts x into the container before "pos".

            Complexity: Constant time.

            @@ -503,7 +503,7 @@

            Note: This function does not check preconditions so if "pos" is not the successor of "value" container ordering invariant will be broken. This is a low-level function to be used only for performance reasons by advanced users.

          35. -
            void push_back(reference value);
            +
            void push_back(reference value);

            Requires: value must be an lvalue, and it must be no less than the greatest inserted key

            Effects: Inserts x into the container in the last position.

            Complexity: Constant time.

            @@ -511,7 +511,7 @@

            Note: This function does not check preconditions so if value is less than the greatest inserted key container ordering invariant will be broken. This function is slightly more efficient than using "insert_before". This is a low-level function to be used only for performance reasons by advanced users.

          36. -
            void push_front(reference value);
            +
            void push_front(reference value);

            Requires: value must be an lvalue, and it must be no greater than the minimum inserted key

            Effects: Inserts x into the container in the first position.

            Complexity: Constant time.

            @@ -519,21 +519,21 @@

            Note: This function does not check preconditions so if value is greater than the minimum inserted key container ordering invariant will be broken. This function is slightly more efficient than using "insert_before". This is a low-level function to be used only for performance reasons by advanced users.

          37. -
            iterator erase(const_iterator i);
            +
            iterator erase(const_iterator i);

            Effects: Erases the element pointed to by i.

            Complexity: Average complexity for erase element is constant time.

            Throws: Nothing.

            Note: Invalidates the iterators (but not the references) to the erased elements. No destructors are called.

          38. -
            iterator erase(const_iterator b, const_iterator e);
            +
            iterator erase(const_iterator b, const_iterator e);

            Effects: Erases the range pointed to by b end e.

            Complexity: Average complexity for erase range is at most O(log(size() + N)), where N is the number of elements in the range.

            Throws: Nothing.

            Note: Invalidates the iterators (but not the references) to the erased elements. No destructors are called.

          39. -
            size_type erase(const key_type & key);
            +
            size_type erase(const key_type & key);

            Effects: Erases all the elements with the given value.

            Returns: The number of erased elements.

            Complexity: O(log(size() + N).

            @@ -542,7 +542,7 @@ 
          40. template<typename KeyType, typename KeyTypeKeyCompare> 
-  size_type erase(const KeyType & key, KeyTypeKeyCompare comp);
            + size_type erase(const KeyType & key, KeyTypeKeyCompare comp);

            Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk), with nk the key_type of a value_type inserted into *this.

            Effects: Erases all the elements with the given key. according to the comparison functor "comp".

            Returns: The number of erased elements.

            @@ -552,7 +552,7 @@ 
          41. template<typename Disposer> 
-  iterator erase_and_dispose(const_iterator i, Disposer disposer);
            + iterator erase_and_dispose(const_iterator i, Disposer disposer);

            Requires: Disposer::operator()(pointer) shouldn't throw.

            Effects: Erases the element pointed to by i. Disposer::operator()(pointer) is called for the removed element.

            Complexity: Average complexity for erase element is constant time.

            @@ -561,7 +561,7 @@ 
          42. template<typename Disposer> 
-  iterator erase_and_dispose(const_iterator b, const_iterator e, 
+  iterator erase_and_dispose(const_iterator b, const_iterator e, 
                              Disposer disposer);

            Requires: Disposer::operator()(pointer) shouldn't throw.

            Effects: Erases the range pointed to by b end e. Disposer::operator()(pointer) is called for the removed elements.

            @@ -571,7 +571,7 @@ 
          43. template<typename Disposer> 
-  size_type erase_and_dispose(const key_type & key, Disposer disposer);
            + size_type erase_and_dispose(const key_type & key, Disposer disposer);

            Requires: Disposer::operator()(pointer) shouldn't throw.

            Effects: Erases all the elements with the given value. Disposer::operator()(pointer) is called for the removed elements.

            Returns: The number of erased elements.

            @@ -581,7 +581,7 @@ 
          44. template<typename KeyType, typename KeyTypeKeyCompare, typename Disposer> 
-  size_type erase_and_dispose(const KeyType & key, KeyTypeKeyCompare comp, 
+  size_type erase_and_dispose(const KeyType & key, KeyTypeKeyCompare comp, 
                               Disposer disposer);

            Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk) and nk the key_type of a value_type inserted into *this.

            Requires: Disposer::operator()(pointer) shouldn't throw.

            @@ -592,47 +592,47 @@

            Note: Invalidates the iterators to the erased elements.

          45. -
            void clear();
            +
            void clear();

            Effects: Erases all of the elements.

            Complexity: Linear to the number of elements on the container. if it's a safe-mode or auto-unlink value_type. Constant time otherwise.

            Throws: Nothing.

            Note: Invalidates the iterators (but not the references) to the erased elements. No destructors are called.

          46. -
            template<typename Disposer> void clear_and_dispose(Disposer disposer);
            +
            template<typename Disposer> void clear_and_dispose(Disposer disposer);

            Effects: Erases all of the elements calling disposer(p) for each node to be erased. Complexity: Average complexity for is at most O(log(size() + N)), where N is the number of elements in the container.

            Throws: Nothing.

            Note: Invalidates the iterators (but not the references) to the erased elements. Calls N times to disposer functor.

          47. -
            size_type count(const key_type & key) const;
            +
            size_type count(const key_type & key) const;

            Effects: Returns the number of contained elements with the given value

            Complexity: Logarithmic to the number of elements contained plus lineal to number of objects with the given value.

            Throws: If key_compare throws. 

          48. template<typename KeyType, typename KeyTypeKeyCompare> 
-  size_type count(const KeyType & key, KeyTypeKeyCompare comp) const;
            + size_type count(const KeyType & key, KeyTypeKeyCompare comp) const;

            Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk), and nk the key_type of a value_type inserted into *this.

            Effects: Returns the number of contained elements with the given key

            Complexity: Logarithmic to the number of elements contained plus lineal to number of objects with the given key.

            Throws: If comp throws.

          49. -
            iterator lower_bound(const key_type & key);
            +
            iterator lower_bound(const key_type & key);

            Effects: Returns an iterator to the first element whose key is not less than k or end() if that element does not exist.

            Complexity: Logarithmic.

            Throws: If key_compare throws. 

          50. template<typename KeyType, typename KeyTypeKeyCompare> 
-  iterator lower_bound(const KeyType & key, KeyTypeKeyCompare comp);
            + iterator lower_bound(const KeyType & key, KeyTypeKeyCompare comp);

            Effects: Returns an iterator to the first element whose key is not less than k or end() if that element does not exist.

            Complexity: Logarithmic.

            Throws: If key_compare throws.

          51. -
            const_iterator lower_bound(const key_type & key) const;
            +
            const_iterator lower_bound(const key_type & key) const;

            Effects: Returns an iterator to the first element whose key is not less than k or end() if that element does not exist.

            Complexity: Logarithmic.

            Throws: If key_compare throws.

            @@ -640,27 +640,27 @@ 
          52. template<typename KeyType, typename KeyTypeKeyCompare> 
   const_iterator 
-  lower_bound(const KeyType & key, KeyTypeKeyCompare comp) const;
            + lower_bound(const KeyType & key, KeyTypeKeyCompare comp) const;

            Effects: Returns an iterator to the first element whose key is not less than k or end() if that element does not exist.

            Complexity: Logarithmic.

            Throws: If key_compare throws.

          53. -
            iterator upper_bound(const key_type & key);
            +
            iterator upper_bound(const key_type & key);

            Effects: Returns an iterator to the first element whose key is greater than k or end() if that element does not exist.

            Complexity: Logarithmic.

            Throws: If key_compare throws. 

          54. template<typename KeyType, typename KeyTypeKeyCompare> 
-  iterator upper_bound(const KeyType & key, KeyTypeKeyCompare comp);
            + iterator upper_bound(const KeyType & key, KeyTypeKeyCompare comp);

            Requires: key is a value such that *this is partitioned with respect to !comp(key, nk), with nk the key_type of a value_type inserted into *this.

            Effects: Returns an iterator to the first element whose key is greater than k according to comp or end() if that element does not exist.

            Complexity: Logarithmic.

            Throws: If comp throws.

          55. -
            const_iterator upper_bound(const key_type & key) const;
            +
            const_iterator upper_bound(const key_type & key) const;

            Effects: Returns an iterator to the first element whose key is greater than k or end() if that element does not exist.

            Complexity: Logarithmic.

            Throws: If key_compare throws.

            @@ -668,42 +668,42 @@ 
          56. template<typename KeyType, typename KeyTypeKeyCompare> 
   const_iterator 
-  upper_bound(const KeyType & key, KeyTypeKeyCompare comp) const;
            + upper_bound(const KeyType & key, KeyTypeKeyCompare comp) const;

            Requires: key is a value such that *this is partitioned with respect to !comp(key, nk), with nk the key_type of a value_type inserted into *this.

            Effects: Returns an iterator to the first element whose key is greater than k according to comp or end() if that element does not exist.

            Complexity: Logarithmic.

            Throws: If comp throws.

          57. -
            iterator find(const key_type & key);
            +
            iterator find(const key_type & key);

            Effects: Finds an iterator to the first element whose key is k or end() if that element does not exist.

            Complexity: Logarithmic.

            Throws: If key_compare throws. 

          58. template<typename KeyType, typename KeyTypeKeyCompare> 
-  iterator find(const KeyType & key, KeyTypeKeyCompare comp);
            + iterator find(const KeyType & key, KeyTypeKeyCompare comp);

            Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk), and nk the key_type of a value_type inserted into *this.

            Effects: Finds an iterator to the first element whose key is k or end() if that element does not exist.

            Complexity: Logarithmic.

            Throws: If comp throws.

          59. -
            const_iterator find(const key_type & key) const;
            +
            const_iterator find(const key_type & key) const;

            Effects: Finds an iterator to the first element whose key is k or end() if that element does not exist.

            Complexity: Logarithmic.

            Throws: If key_compare throws. 

          60. template<typename KeyType, typename KeyTypeKeyCompare> 
-  const_iterator find(const KeyType & key, KeyTypeKeyCompare comp) const;
            + const_iterator find(const KeyType & key, KeyTypeKeyCompare comp) const;

            Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk), and nk the key_type of a value_type inserted into *this.

            Effects: Finds an iterator to the first element whose key is k or end() if that element does not exist.

            Complexity: Logarithmic.

            Throws: If comp throws.

          61. -
            std::pair< iterator, iterator > equal_range(const key_type & key);
            +
            std::pair< iterator, iterator > equal_range(const key_type & key);

            Effects: Finds a range containing all elements whose key is k or an empty range that indicates the position where those elements would be if they there is no elements with key k.

            Complexity: Logarithmic.

            Throws: If key_compare throws.

            @@ -711,7 +711,7 @@ 
          62. template<typename KeyType, typename KeyTypeKeyCompare> 
   std::pair< iterator, iterator > 
-  equal_range(const KeyType & key, KeyTypeKeyCompare comp);
            + equal_range(const KeyType & key, KeyTypeKeyCompare comp);

            Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk), with nk the key_type of a value_type inserted into *this.

            Effects: Finds a range containing all elements whose key is k or an empty range that indicates the position where those elements would be if they there is no elements with key k.

            Complexity: Logarithmic.

            @@ -719,7 +719,7 @@ 
          63. std::pair< const_iterator, const_iterator > 
-equal_range(const key_type & key) const;
            +equal_range(const key_type & key) const;

            Effects: Finds a range containing all elements whose key is k or an empty range that indicates the position where those elements would be if they there is no elements with key k.

            Complexity: Logarithmic.

            Throws: If key_compare throws.

            @@ -727,7 +727,7 @@ 
          64. template<typename KeyType, typename KeyTypeKeyCompare> 
   std::pair< const_iterator, const_iterator > 
-  equal_range(const KeyType & key, KeyTypeKeyCompare comp) const;
            + equal_range(const KeyType & key, KeyTypeKeyCompare comp) const;

            Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk), with nk the key_type of a value_type inserted into *this.

            Effects: Finds a range containing all elements whose key is k or an empty range that indicates the position where those elements would be if they there is no elements with key k.

            Complexity: Logarithmic.

            @@ -735,7 +735,7 @@ 
          65. std::pair< iterator, iterator > 
-bounded_range(const key_type & lower, const key_type & upper_key, 
+bounded_range(const key_type & lower, const key_type & upper_key, 
               bool left_closed, bool right_closed);

            Requires: upper_key shall not precede lower_key according to key_compare. [key_comp()(upper_key, lower_key) shall be false]

            If lower_key is equivalent to upper_key [!key_comp()(upper_key, lower_key) && !key_comp()(lower_key, upper_key)] then ('left_closed' || 'right_closed') must be false.

            @@ -750,7 +750,7 @@ 
          66. template<typename KeyType, typename KeyTypeKeyCompare> 
   std::pair< iterator, iterator > 
-  bounded_range(const KeyType & lower_key, const KeyType & upper_key, 
+  bounded_range(const KeyType & lower_key, const KeyType & upper_key, 
                 KeyTypeKeyCompare comp, bool left_closed, bool right_closed);

            Requires: lower_key is a value such that *this is partitioned with respect to comp(nk, lower_key) if left_closed is true, with respect to !comp(lower_key, nk) otherwise.

            upper_key is a value such that *this is partitioned with respect to !comp(upper_key, nk) if right_closed is true, with respect to comp(nk, upper_key) otherwise.

            @@ -766,7 +766,7 @@ 
          67. std::pair< const_iterator, const_iterator > 
-bounded_range(const key_type & lower_key, const key_type & upper_key, 
+bounded_range(const key_type & lower_key, const key_type & upper_key, 
               bool left_closed, bool right_closed) const;

            Requires: upper_key shall not precede lower_key according to key_compare. [key_comp()(upper_key, lower_key) shall be false]

            If lower_key is equivalent to upper_key [!key_comp()(upper_key, lower_key) && !key_comp()(lower_key, upper_key)] then ('left_closed' || 'right_closed') must be false.

            @@ -781,7 +781,7 @@ 
          68. template<typename KeyType, typename KeyTypeKeyCompare> 
   std::pair< const_iterator, const_iterator > 
-  bounded_range(const KeyType & lower_key, const KeyType & upper_key, 
+  bounded_range(const KeyType & lower_key, const KeyType & upper_key, 
                 KeyTypeKeyCompare comp, bool left_closed, bool right_closed) const;

            Requires: lower_key is a value such that *this is partitioned with respect to comp(nk, lower_key) if left_closed is true, with respect to !comp(lower_key, nk) otherwise.

            upper_key is a value such that *this is partitioned with respect to !comp(upper_key, nk) if right_closed is true, with respect to comp(nk, upper_key) otherwise.

            @@ -796,28 +796,28 @@

            Note: Experimental function, the interface might change in future releases.

          69. -
            iterator iterator_to(reference value);
            +
            iterator iterator_to(reference value);

            Requires: value must be an lvalue and shall be in a set of appropriate type. Otherwise the behavior is undefined.

            Effects: Returns: a valid iterator i belonging to the set that points to the value

            Complexity: Constant.

            Throws: Nothing.

          70. -
            const_iterator iterator_to(const_reference value) const;
            +
            const_iterator iterator_to(const_reference value) const;

            Requires: value must be an lvalue and shall be in a set of appropriate type. Otherwise the behavior is undefined.

            Effects: Returns: a valid const_iterator i belonging to the set that points to the value

            Complexity: Constant.

            Throws: Nothing.

          71. -
            pointer unlink_leftmost_without_rebalance();
            +
            pointer unlink_leftmost_without_rebalance();

            Effects: Unlinks the leftmost node from the container.

            Complexity: Average complexity is constant time.

            Throws: Nothing.

            Notes: This function breaks the container and the container can only be used for more unlink_leftmost_without_rebalance calls. This function is normally used to achieve a step by step controlled destruction of the container.

          72. -
            void replace_node(iterator replace_this, reference with_this);
            +
            void replace_node(iterator replace_this, reference with_this);

            Requires: replace_this must be a valid iterator of *this and with_this must not be inserted in any container.

            Effects: Replaces replace_this in its position in the container with with_this. The container does not need to be rebalanced.

            Complexity: Constant.

            @@ -825,7 +825,7 @@

            Note: This function will break container ordering invariants if with_this is not equivalent to *replace_this according to the ordering rules. This function is faster than erasing and inserting the node, since no rebalancing or comparison is needed.

          73. -
            void remove_node(reference value);
            +
            void remove_node(reference value);

            Effects: removes "value" from the container.

            Throws: Nothing.

            Complexity: Logarithmic time.

            @@ -834,7 +834,7 @@ 
          74. template<typename T, class... Options2> 
-  void merge_unique(avltree< T, Options2...> &);
            + void merge_unique(avltree< T, Options2...> &);

            Requires: "source" container's Options can only can differ in the comparison function from *this.

            Effects: Attempts to extract each element in source and insert it into a using the comparison object of *this. If there is an element in a with key equivalent to the key of an element from source, then that element is not extracted from source.

            Postcondition: Pointers and references to the transferred elements of source refer to those same elements but as members of *this. Iterators referring to the transferred elements will continue to refer to their elements, but they now behave as iterators into *this, not into source.

            @@ -843,7 +843,7 @@ 
          75. template<typename T, class... Options2> 
-  void merge_equal(avltree< T, Options2...> &);
            + void merge_equal(avltree< T, Options2...> &);

            Requires: "source" container's Options can only can differ in the comparison function from *this.

            Effects: Extracts each element in source and insert it into a using the comparison object of *this.

            Postcondition: Pointers and references to the transferred elements of source refer to those same elements but as members of *this. Iterators referring to the transferred elements will continue to refer to their elements, but they now behave as iterators into *this, not into source.

            @@ -854,10 +854,10 @@

          -avltree public static functions

          +avltree public static functions
          1. -
            static avltree & container_from_end_iterator(iterator end_iterator);
            +
            static avltree & container_from_end_iterator(iterator end_iterator);

            Precondition: end_iterator must be a valid end iterator of the container.

            Effects: Returns a const reference to the container associated to the end iterator

            Throws: Nothing.

            @@ -865,28 +865,28 @@ 
          2. static const avltree & 
-container_from_end_iterator(const_iterator end_iterator);
            +container_from_end_iterator(const_iterator end_iterator);

            Precondition: end_iterator must be a valid end iterator of the container.

            Effects: Returns a const reference to the container associated to the end iterator

            Throws: Nothing.

            Complexity: Constant.

          3. -
            static avltree & container_from_iterator(iterator it);
            +
            static avltree & container_from_iterator(iterator it);

            Precondition: it must be a valid iterator of the container.

            Effects: Returns a const reference to the container associated to the iterator

            Throws: Nothing.

            Complexity: Logarithmic.

          4. -
            static const avltree & container_from_iterator(const_iterator it);
            +
            static const avltree & container_from_iterator(const_iterator it);

            Precondition: it must be a valid iterator of the container.

            Effects: Returns a const reference to the container associated to the iterator

            Throws: Nothing.

            Complexity: Logarithmic.

          5. -
            static iterator s_iterator_to(reference value);
            +
            static iterator s_iterator_to(reference value);

            Requires: value must be an lvalue and shall be in a set of appropriate type. Otherwise the behavior is undefined.

            Effects: Returns: a valid iterator i belonging to the set that points to the value

            Complexity: Constant.

            @@ -894,7 +894,7 @@

            Note: This static function is available only if the value traits is stateless.

          6. -
            static const_iterator s_iterator_to(const_reference value);
            +
            static const_iterator s_iterator_to(const_reference value);

            Requires: value must be an lvalue and shall be in a set of appropriate type. Otherwise the behavior is undefined.

            Effects: Returns: a valid iterator i belonging to the set that points to the value

            Complexity: Constant.

            @@ -902,7 +902,7 @@

            Note: This static function is available only if the value traits is stateless.

          7. -
            static void init_node(reference value);
            +
            static void init_node(reference value);

            Requires: value shall not be in a container.

            Effects: init_node puts the hook of a value in a well-known default state.

            Throws: Nothing.

            diff --git a/doc/html/boost/intrusive/avltree_algorithms.html b/doc/html/boost/intrusive/avltree_algorithms.html index 049bf02b3a..a083dd5b21 100644 --- a/doc/html/boost/intrusive/avltree_algorithms.html +++ b/doc/html/boost/intrusive/avltree_algorithms.html @@ -43,84 +43,84 @@ typedef NodeTraits::balance balance; typedef bstree_algo::insert_commit_data insert_commit_data; - // public static functions - static node_ptr get_header(const const_node_ptr &); - static node_ptr begin_node(const const_node_ptr &); - static node_ptr end_node(const const_node_ptr &); - static void swap_tree(const node_ptr &, const node_ptr &); - static void swap_nodes(const node_ptr &, const node_ptr &); - static void swap_nodes(const node_ptr &, const node_ptr &, const node_ptr &, + // public static functions + static node_ptr get_header(const const_node_ptr &); + static node_ptr begin_node(const const_node_ptr &); + static node_ptr end_node(const const_node_ptr &); + static void swap_tree(const node_ptr &, const node_ptr &); + static void swap_nodes(const node_ptr &, const node_ptr &); + static void swap_nodes(const node_ptr &, const node_ptr &, const node_ptr &, const node_ptr &); - static void replace_node(const node_ptr &, const node_ptr &); - static void replace_node(const node_ptr &, const node_ptr &, + static void replace_node(const node_ptr &, const node_ptr &); + static void replace_node(const node_ptr &, const node_ptr &, const node_ptr &); - static void unlink(const node_ptr &); - static node_ptr unlink_leftmost_without_rebalance(const node_ptr &); - static bool unique(const const_node_ptr &); - static std::size_t size(const const_node_ptr &); - static node_ptr next_node(const node_ptr &); - static node_ptr prev_node(const node_ptr &); - static void init(const node_ptr &); - static void init_header(const node_ptr &); - static node_ptr erase(const node_ptr &, const node_ptr &); + static void unlink(const node_ptr &); + static node_ptr unlink_leftmost_without_rebalance(const node_ptr &); + static bool unique(const const_node_ptr &); + static std::size_t size(const const_node_ptr &); + static node_ptr next_node(const node_ptr &); + static node_ptr prev_node(const node_ptr &); + static void init(const node_ptr &); + static void init_header(const node_ptr &); + static node_ptr erase(const node_ptr &, const node_ptr &); template<typename NodePtrCompare> - static bool transfer_unique(const node_ptr &, NodePtrCompare, + static bool transfer_unique(const node_ptr &, NodePtrCompare, const node_ptr &, const node_ptr &); template<typename NodePtrCompare> - static void transfer_equal(const node_ptr &, NodePtrCompare, + static void transfer_equal(const node_ptr &, NodePtrCompare, const node_ptr &, const node_ptr &); template<typename Cloner, typename Disposer> - static void clone(const const_node_ptr &, const node_ptr &, Cloner, + static void clone(const const_node_ptr &, const node_ptr &, Cloner, Disposer); template<typename Disposer> - static void clear_and_dispose(const node_ptr &, Disposer); + static void clear_and_dispose(const node_ptr &, Disposer); template<typename KeyType, typename KeyNodePtrCompare> static node_ptr - lower_bound(const const_node_ptr &, const KeyType &, KeyNodePtrCompare); + lower_bound(const const_node_ptr &, const KeyType &, KeyNodePtrCompare); template<typename KeyType, typename KeyNodePtrCompare> static node_ptr - upper_bound(const const_node_ptr &, const KeyType &, KeyNodePtrCompare); + upper_bound(const const_node_ptr &, const KeyType &, KeyNodePtrCompare); template<typename KeyType, typename KeyNodePtrCompare> static node_ptr - find(const const_node_ptr &, const KeyType &, KeyNodePtrCompare); + find(const const_node_ptr &, const KeyType &, KeyNodePtrCompare); template<typename KeyType, typename KeyNodePtrCompare> static std::pair< node_ptr, node_ptr > - equal_range(const const_node_ptr &, const KeyType &, KeyNodePtrCompare); + equal_range(const const_node_ptr &, const KeyType &, KeyNodePtrCompare); template<typename KeyType, typename KeyNodePtrCompare> static std::pair< node_ptr, node_ptr > - bounded_range(const const_node_ptr &, const KeyType &, const KeyType &, + bounded_range(const const_node_ptr &, const KeyType &, const KeyType &, KeyNodePtrCompare, bool, bool); template<typename KeyType, typename KeyNodePtrCompare> static std::size_t - count(const const_node_ptr &, const KeyType &, KeyNodePtrCompare); + count(const const_node_ptr &, const KeyType &, KeyNodePtrCompare); template<typename NodePtrCompare> static node_ptr - insert_equal_upper_bound(const node_ptr &, const node_ptr &, + insert_equal_upper_bound(const node_ptr &, const node_ptr &, NodePtrCompare); template<typename NodePtrCompare> static node_ptr - insert_equal_lower_bound(const node_ptr &, const node_ptr &, + insert_equal_lower_bound(const node_ptr &, const node_ptr &, NodePtrCompare); template<typename NodePtrCompare> static node_ptr - insert_equal(const node_ptr &, const node_ptr &, const node_ptr &, + insert_equal(const node_ptr &, const node_ptr &, const node_ptr &, NodePtrCompare); static node_ptr - insert_before(const node_ptr &, const node_ptr &, const node_ptr &); - static void push_back(const node_ptr &, const node_ptr &); - static void push_front(const node_ptr &, const node_ptr &); + insert_before(const node_ptr &, const node_ptr &, const node_ptr &); + static void push_back(const node_ptr &, const node_ptr &); + static void push_front(const node_ptr &, const node_ptr &); template<typename KeyType, typename KeyNodePtrCompare> static std::pair< node_ptr, bool > - insert_unique_check(const const_node_ptr &, const KeyType &, + insert_unique_check(const const_node_ptr &, const KeyType &, KeyNodePtrCompare, insert_commit_data &); template<typename KeyType, typename KeyNodePtrCompare> static std::pair< node_ptr, bool > - insert_unique_check(const const_node_ptr &, const node_ptr &, + insert_unique_check(const const_node_ptr &, const node_ptr &, const KeyType &, KeyNodePtrCompare, insert_commit_data &); - static void insert_unique_commit(const node_ptr &, const node_ptr &, + static void insert_unique_commit(const node_ptr &, const node_ptr &, const insert_commit_data &); - static bool is_header(const const_node_ptr &); + static bool is_header(const const_node_ptr &); };

          Description

          @@ -155,38 +155,38 @@

          -avltree_algorithms public static functions

          +avltree_algorithms public static functions
          1. -
            static node_ptr get_header(const const_node_ptr & n);
            +
            static node_ptr get_header(const const_node_ptr & n);

            Requires: 'node' is a node of the tree or a header node.

            Effects: Returns the header of the tree.

            Complexity: Logarithmic.

            Throws: Nothing.

          2. -
            static node_ptr begin_node(const const_node_ptr & header);
            +
            static node_ptr begin_node(const const_node_ptr & header);

            Requires: 'header' is the header node of a tree.

            Effects: Returns the first node of the tree, the header if the tree is empty.

            Complexity: Constant time.

            Throws: Nothing.

          3. -
            static node_ptr end_node(const const_node_ptr & header);
            +
            static node_ptr end_node(const const_node_ptr & header);

            Requires: 'header' is the header node of a tree.

            Effects: Returns the header of the tree.

            Complexity: Constant time.

            Throws: Nothing.

          4. -
            static void swap_tree(const node_ptr & header1, const node_ptr & header2);
            +
            static void swap_tree(const node_ptr & header1, const node_ptr & header2);

            Requires: header1 and header2 must be the header nodes of two trees.

            Effects: Swaps two trees. After the function header1 will contain links to the second tree and header2 will have links to the first tree.

            Complexity: Constant.

            Throws: Nothing.

          5. -
            static void swap_nodes(const node_ptr & node1, const node_ptr & node2);
            +
            static void swap_nodes(const node_ptr & node1, const node_ptr & node2);

            Requires: node1 and node2 can't be header nodes of two trees.

            Effects: Swaps two nodes. After the function node1 will be inserted in the position node2 before the function. node2 will be inserted in the position node1 had before the function.

            Complexity: Logarithmic.

            @@ -195,7 +195,7 @@

            Experimental function

          6. -
            static void swap_nodes(const node_ptr & node1, const node_ptr & header1, 
+
            static void swap_nodes(const node_ptr & node1, const node_ptr & header1, 
                        const node_ptr & node2, const node_ptr & header2);
            
 
            Requires: node1 and node2 can't be header nodes of two trees with header header1 and header2.
            
 
            Effects: Swaps two nodes. After the function node1 will be inserted in the position node2 before the function. node2 will be inserted in the position node1 had before the function.
            
@@ -205,7 +205,7 @@
 
            Experimental function
          7. -
            static void replace_node(const node_ptr & node_to_be_replaced, 
+
            static void replace_node(const node_ptr & node_to_be_replaced, 
                          const node_ptr & new_node);
            
 
            Requires: node_to_be_replaced must be inserted in a tree and new_node must not be inserted in a tree.
            
 
            Effects: Replaces node_to_be_replaced in its position in the tree with new_node. The tree does not need to be rebalanced
            
@@ -214,7 +214,7 @@
 
            Note: This function will break container ordering invariants if new_node is not equivalent to node_to_be_replaced according to the ordering rules. This function is faster than erasing and inserting the node, since no rebalancing and comparison is needed. Experimental function
          8. -
            static void replace_node(const node_ptr & node_to_be_replaced, 
+
            static void replace_node(const node_ptr & node_to_be_replaced, 
                          const node_ptr & header, const node_ptr & new_node);
            
 
            Requires: node_to_be_replaced must be inserted in a tree with header "header" and new_node must not be inserted in a tree.
            
 
            Effects: Replaces node_to_be_replaced in its position in the tree with new_node. The tree does not need to be rebalanced
            
@@ -223,14 +223,14 @@
 
            Note: This function will break container ordering invariants if new_node is not equivalent to node_to_be_replaced according to the ordering rules. This function is faster than erasing and inserting the node, since no rebalancing or comparison is needed. Experimental function
          9. -
            static void unlink(const node_ptr & node);
            +
            static void unlink(const node_ptr & node);

            Requires: node is a tree node but not the header.

            Effects: Unlinks the node and rebalances the tree.

            Complexity: Average complexity is constant time.

            Throws: Nothing.

          10. -
            static node_ptr unlink_leftmost_without_rebalance(const node_ptr & header);
            +
            static node_ptr unlink_leftmost_without_rebalance(const node_ptr & header);

            Requires: header is the header of a tree.

            Effects: Unlinks the leftmost node from the tree, and updates the header link to the new leftmost node.

            Complexity: Average complexity is constant time.

            @@ -238,35 +238,35 @@

            Notes: This function breaks the tree and the tree can only be used for more unlink_leftmost_without_rebalance calls. This function is normally used to achieve a step by step controlled destruction of the tree.

          11. -
            static bool unique(const const_node_ptr & node);
            +
            static bool unique(const const_node_ptr & node);

            Requires: 'node' is a node of the tree or a node initialized by init(...) or init_node.

            Effects: Returns true if the node is initialized by init() or init_node().

            Complexity: Constant time.

            Throws: Nothing.

          12. -
            static std::size_t size(const const_node_ptr & header);
            +
            static std::size_t size(const const_node_ptr & header);

            Requires: node is a node of the tree but it's not the header.

            Effects: Returns the number of nodes of the subtree.

            Complexity: Linear time.

            Throws: Nothing.

          13. -
            static node_ptr next_node(const node_ptr & node);
            +
            static node_ptr next_node(const node_ptr & node);

            Requires: 'node' is a node from the tree except the header.

            Effects: Returns the next node of the tree.

            Complexity: Average constant time.

            Throws: Nothing.

          14. -
            static node_ptr prev_node(const node_ptr & node);
            +
            static node_ptr prev_node(const node_ptr & node);

            Requires: 'node' is a node from the tree except the leftmost node.

            Effects: Returns the previous node of the tree.

            Complexity: Average constant time.

            Throws: Nothing.

          15. -
            static void init(const node_ptr & node);
            +
            static void init(const node_ptr & node);

            Requires: 'node' must not be part of any tree.

            Effects: After the function unique(node) == true.

            Complexity: Constant.

            @@ -274,7 +274,7 @@

            Nodes: If node is inserted in a tree, this function corrupts the tree.

          16. -
            static void init_header(const node_ptr & header);
            +
            static void init_header(const node_ptr & header);

            Requires: node must not be part of any tree.

            Effects: Initializes the header to represent an empty tree. unique(header) == true.

            Complexity: Constant.

            @@ -282,7 +282,7 @@

            Nodes: If node is inserted in a tree, this function corrupts the tree.

          17. -
            static node_ptr erase(const node_ptr & header, const node_ptr & z);
            +
            static node_ptr erase(const node_ptr & header, const node_ptr & z);

            Requires: header must be the header of a tree, z a node of that tree and z != header.

            Effects: Erases node "z" from the tree with header "header".

            Complexity: Amortized constant time.

            @@ -290,7 +290,7 @@ 
          18. template<typename NodePtrCompare> 
-  static bool transfer_unique(const node_ptr & header1, NodePtrCompare comp, 
+  static bool transfer_unique(const node_ptr & header1, NodePtrCompare comp, 
                               const node_ptr & header2, const node_ptr & z);

            Requires: header1 and header2 must be the headers of trees tree1 and tree2 respectively, z a non-header node of tree1. NodePtrCompare is the comparison function of tree1..

            Effects: Transfers node "z" from tree1 to tree2 if tree1 does not contain a node that is equivalent to z.

            @@ -300,7 +300,7 @@ 
          19. template<typename NodePtrCompare> 
-  static void transfer_equal(const node_ptr & header1, NodePtrCompare comp, 
+  static void transfer_equal(const node_ptr & header1, NodePtrCompare comp, 
                              const node_ptr & header2, const node_ptr & z);

            Requires: header1 and header2 must be the headers of trees tree1 and tree2 respectively, z a non-header node of tree1. NodePtrCompare is the comparison function of tree1..

            Effects: Transfers node "z" from tree1 to tree2.

            @@ -309,7 +309,7 @@ 
          20. template<typename Cloner, typename Disposer> 
-  static void clone(const const_node_ptr & source_header, 
+  static void clone(const const_node_ptr & source_header, 
                     const node_ptr & target_header, Cloner cloner, 
                     Disposer disposer);

            Requires: "cloner" must be a function object taking a node_ptr and returning a new cloned node of it. "disposer" must take a node_ptr and shouldn't throw.

            @@ -320,7 +320,7 @@ 
          21. template<typename Disposer> 
-  static void clear_and_dispose(const node_ptr & header, Disposer disposer);
            + static void clear_and_dispose(const node_ptr & header, Disposer disposer);

            Requires: "disposer" must be an object function taking a node_ptr parameter and shouldn't throw.

            Effects: Empties the target tree calling void disposer::operator()(const node_ptr &) for every node of the tree except the header.

            Complexity: Linear to the number of element of the source tree plus the. number of elements of tree target tree when calling this function.

            @@ -329,7 +329,7 @@ 
          22. template<typename KeyType, typename KeyNodePtrCompare> 
   static node_ptr 
-  lower_bound(const const_node_ptr & header, const KeyType & key, 
+  lower_bound(const const_node_ptr & header, const KeyType & key, 
               KeyNodePtrCompare comp);

            Requires: "header" must be the header node of a tree. KeyNodePtrCompare is a function object that induces a strict weak ordering compatible with the strict weak ordering used to create the the tree. KeyNodePtrCompare can compare KeyType with tree's node_ptrs.

            Effects: Returns a node_ptr to the first element that is not less than "key" according to "comp" or "header" if that element does not exist.

            @@ -339,7 +339,7 @@ 
          23. template<typename KeyType, typename KeyNodePtrCompare> 
   static node_ptr 
-  upper_bound(const const_node_ptr & header, const KeyType & key, 
+  upper_bound(const const_node_ptr & header, const KeyType & key, 
               KeyNodePtrCompare comp);

            Requires: "header" must be the header node of a tree. KeyNodePtrCompare is a function object that induces a strict weak ordering compatible with the strict weak ordering used to create the the tree. KeyNodePtrCompare can compare KeyType with tree's node_ptrs.

            Effects: Returns a node_ptr to the first element that is greater than "key" according to "comp" or "header" if that element does not exist.

            @@ -349,7 +349,7 @@ 
          24. template<typename KeyType, typename KeyNodePtrCompare> 
   static node_ptr 
-  find(const const_node_ptr & header, const KeyType & key, 
+  find(const const_node_ptr & header, const KeyType & key, 
        KeyNodePtrCompare comp);

            Requires: "header" must be the header node of a tree. KeyNodePtrCompare is a function object that induces a strict weak ordering compatible with the strict weak ordering used to create the the tree. KeyNodePtrCompare can compare KeyType with tree's node_ptrs.

            Effects: Returns a node_ptr to the first element that is equivalent to "key" according to "comp" or "header" if that element does not exist.

            @@ -359,7 +359,7 @@ 
          25. template<typename KeyType, typename KeyNodePtrCompare> 
   static std::pair< node_ptr, node_ptr > 
-  equal_range(const const_node_ptr & header, const KeyType & key, 
+  equal_range(const const_node_ptr & header, const KeyType & key, 
               KeyNodePtrCompare comp);

            Requires: "header" must be the header node of a tree. KeyNodePtrCompare is a function object that induces a strict weak ordering compatible with the strict weak ordering used to create the the tree. KeyNodePtrCompare can compare KeyType with tree's node_ptrs.

            Effects: Returns an a pair of node_ptr delimiting a range containing all elements that are equivalent to "key" according to "comp" or an empty range that indicates the position where those elements would be if there are no equivalent elements.

            @@ -369,7 +369,7 @@ 
          26. template<typename KeyType, typename KeyNodePtrCompare> 
   static std::pair< node_ptr, node_ptr > 
-  bounded_range(const const_node_ptr & header, const KeyType & lower_key, 
+  bounded_range(const const_node_ptr & header, const KeyType & lower_key, 
                 const KeyType & upper_key, KeyNodePtrCompare comp, 
                 bool left_closed, bool right_closed);

            Requires: "header" must be the header node of a tree. KeyNodePtrCompare is a function object that induces a strict weak ordering compatible with the strict weak ordering used to create the the tree. KeyNodePtrCompare can compare KeyType with tree's node_ptrs. 'lower_key' must not be greater than 'upper_key' according to 'comp'. If 'lower_key' == 'upper_key', ('left_closed' || 'right_closed') must be true.

            @@ -384,7 +384,7 @@ 
          27. template<typename KeyType, typename KeyNodePtrCompare> 
   static std::size_t 
-  count(const const_node_ptr & header, const KeyType & key, 
+  count(const const_node_ptr & header, const KeyType & key, 
         KeyNodePtrCompare comp);

            Requires: "header" must be the header node of a tree. KeyNodePtrCompare is a function object that induces a strict weak ordering compatible with the strict weak ordering used to create the the tree. KeyNodePtrCompare can compare KeyType with tree's node_ptrs.

            Effects: Returns the number of elements with a key equivalent to "key" according to "comp".

            @@ -394,7 +394,7 @@ 
          28. template<typename NodePtrCompare> 
   static node_ptr 
-  insert_equal_upper_bound(const node_ptr & h, const node_ptr & new_node, 
+  insert_equal_upper_bound(const node_ptr & h, const node_ptr & new_node, 
                            NodePtrCompare comp);

            Requires: "h" must be the header node of a tree. NodePtrCompare is a function object that induces a strict weak ordering compatible with the strict weak ordering used to create the the tree. NodePtrCompare compares two node_ptrs.

            Effects: Inserts new_node into the tree before the upper bound according to "comp".

            @@ -404,7 +404,7 @@ 
          29. template<typename NodePtrCompare> 
   static node_ptr 
-  insert_equal_lower_bound(const node_ptr & h, const node_ptr & new_node, 
+  insert_equal_lower_bound(const node_ptr & h, const node_ptr & new_node, 
                            NodePtrCompare comp);

            Requires: "h" must be the header node of a tree. NodePtrCompare is a function object that induces a strict weak ordering compatible with the strict weak ordering used to create the the tree. NodePtrCompare compares two node_ptrs.

            Effects: Inserts new_node into the tree before the lower bound according to "comp".

            @@ -414,7 +414,7 @@ 
          30. template<typename NodePtrCompare> 
   static node_ptr 
-  insert_equal(const node_ptr & header, const node_ptr & hint, 
+  insert_equal(const node_ptr & header, const node_ptr & hint, 
                const node_ptr & new_node, NodePtrCompare comp);

            Requires: "header" must be the header node of a tree. NodePtrCompare is a function object that induces a strict weak ordering compatible with the strict weak ordering used to create the the tree. NodePtrCompare compares two node_ptrs. "hint" is node from the "header"'s tree.

            Effects: Inserts new_node into the tree, using "hint" as a hint to where it will be inserted. If "hint" is the upper_bound the insertion takes constant time (two comparisons in the worst case).

            @@ -423,7 +423,7 @@ 
          31. static node_ptr 
-insert_before(const node_ptr & header, const node_ptr & pos, 
+insert_before(const node_ptr & header, const node_ptr & pos, 
               const node_ptr & new_node);

            Requires: "header" must be the header node of a tree. "pos" must be a valid iterator or header (end) node. "pos" must be an iterator pointing to the successor to "new_node" once inserted according to the order of already inserted nodes. This function does not check "pos" and this precondition must be guaranteed by the caller.

            Effects: Inserts new_node into the tree before "pos".

            @@ -432,7 +432,7 @@

            Note: If "pos" is not the successor of the newly inserted "new_node" tree invariants might be broken.

          32. -
            static void push_back(const node_ptr & header, const node_ptr & new_node);
            +
            static void push_back(const node_ptr & header, const node_ptr & new_node);

            Requires: "header" must be the header node of a tree. "new_node" must be, according to the used ordering no less than the greatest inserted key.

            Effects: Inserts new_node into the tree before "pos".

            Complexity: Constant-time.

            @@ -440,7 +440,7 @@

            Note: If "new_node" is less than the greatest inserted key tree invariants are broken. This function is slightly faster than using "insert_before".

          33. -
            static void push_front(const node_ptr & header, const node_ptr & new_node);
            +
            static void push_front(const node_ptr & header, const node_ptr & new_node);

            Requires: "header" must be the header node of a tree. "new_node" must be, according to the used ordering, no greater than the lowest inserted key.

            Effects: Inserts new_node into the tree before "pos".

            Complexity: Constant-time.

            @@ -450,7 +450,7 @@ 
          34. template<typename KeyType, typename KeyNodePtrCompare> 
   static std::pair< node_ptr, bool > 
-  insert_unique_check(const const_node_ptr & header, const KeyType & key, 
+  insert_unique_check(const const_node_ptr & header, const KeyType & key, 
                       KeyNodePtrCompare comp, 
                       insert_commit_data & commit_data);

            Requires: "header" must be the header node of a tree. KeyNodePtrCompare is a function object that induces a strict weak ordering compatible with the strict weak ordering used to create the the tree. NodePtrCompare compares KeyType with a node_ptr.

            @@ -465,7 +465,7 @@ 
          35. template<typename KeyType, typename KeyNodePtrCompare> 
   static std::pair< node_ptr, bool > 
-  insert_unique_check(const const_node_ptr & header, const node_ptr & hint, 
+  insert_unique_check(const const_node_ptr & header, const node_ptr & hint, 
                       const KeyType & key, KeyNodePtrCompare comp, 
                       insert_commit_data & commit_data);

            Requires: "header" must be the header node of a tree. KeyNodePtrCompare is a function object that induces a strict weak ordering compatible with the strict weak ordering used to create the the tree. NodePtrCompare compares KeyType with a node_ptr. "hint" is node from the "header"'s tree.

            @@ -478,7 +478,7 @@

            "commit_data" remains valid for a subsequent "insert_unique_commit" only if no more objects are inserted or erased from the set.

          36. -
            static void insert_unique_commit(const node_ptr & header, 
+
            static void insert_unique_commit(const node_ptr & header, 
                                  const node_ptr & new_value, 
                                  const insert_commit_data & commit_data);
            
 
            Requires: "header" must be the header node of a tree. "commit_data" must have been obtained from a previous call to "insert_unique_check". No objects should have been inserted or erased from the set between the "insert_unique_check" that filled "commit_data" and the call to "insert_commit".
            
@@ -488,7 +488,7 @@
 
            Notes: This function has only sense if a "insert_unique_check" has been previously executed to fill "commit_data". No value should be inserted or erased between the "insert_check" and "insert_commit" calls.
          37. -
            static bool is_header(const const_node_ptr & p);
            +
            static bool is_header(const const_node_ptr & p);

            Requires: p is a node of a tree.

            Effects: Returns true if p is the header of the tree.

            Complexity: Constant.

            diff --git a/doc/html/boost/intrusive/bs_multiset.html b/doc/html/boost/intrusive/bs_multiset.html index 9bea4634d4..1f9b8c9219 100644 --- a/doc/html/boost/intrusive/bs_multiset.html +++ b/doc/html/boost/intrusive/bs_multiset.html @@ -59,120 +59,120 @@ typedef implementation_defined::node_algorithms node_algorithms; // construct/copy/destruct - bs_multiset(); - explicit bs_multiset(const key_compare &, + bs_multiset(); + explicit bs_multiset(const key_compare &, const value_traits & = value_traits()); template<typename Iterator> - bs_multiset(Iterator, Iterator, const key_compare & = key_compare(), + bs_multiset(Iterator, Iterator, const key_compare & = key_compare(), const value_traits & = value_traits()); - bs_multiset(bs_multiset &&); - bs_multiset & operator=(bs_multiset &&); - ~bs_multiset(); + bs_multiset(bs_multiset &&); + bs_multiset & operator=(bs_multiset &&); + ~bs_multiset(); - // public member functions - iterator begin(); - const_iterator begin() const; - const_iterator cbegin() const; - iterator end(); - const_iterator end() const; - const_iterator cend() const; - reverse_iterator rbegin(); - const_reverse_iterator rbegin() const; - const_reverse_iterator crbegin() const; - reverse_iterator rend(); - const_reverse_iterator rend() const; - const_reverse_iterator crend() const; - iterator root(); - const_iterator root() const; - const_iterator croot() const; - key_compare key_comp() const; - value_compare value_comp() const; - bool empty() const; - size_type size() const; - void swap(bs_multiset &); + // public member functions + iterator begin(); + const_iterator begin() const; + const_iterator cbegin() const; + iterator end(); + const_iterator end() const; + const_iterator cend() const; + reverse_iterator rbegin(); + const_reverse_iterator rbegin() const; + const_reverse_iterator crbegin() const; + reverse_iterator rend(); + const_reverse_iterator rend() const; + const_reverse_iterator crend() const; + iterator root(); + const_iterator root() const; + const_iterator croot() const; + key_compare key_comp() const; + value_compare value_comp() const; + bool empty() const; + size_type size() const; + void swap(bs_multiset &); template<typename Cloner, typename Disposer> - void clone_from(const bs_multiset &, Cloner, Disposer); + void clone_from(const bs_multiset &, Cloner, Disposer); template<typename Cloner, typename Disposer> - void clone_from(bs_multiset &&, Cloner, Disposer); - iterator insert(reference); - iterator insert(const_iterator, reference); - template<typename Iterator> void insert(Iterator, Iterator); - iterator insert_before(const_iterator, reference); - void push_back(reference); - void push_front(reference); - iterator erase(const_iterator); - iterator erase(const_iterator, const_iterator); - size_type erase(const key_type &); + void clone_from(bs_multiset &&, Cloner, Disposer); + iterator insert(reference); + iterator insert(const_iterator, reference); + template<typename Iterator> void insert(Iterator, Iterator); + iterator insert_before(const_iterator, reference); + void push_back(reference); + void push_front(reference); + iterator erase(const_iterator); + iterator erase(const_iterator, const_iterator); + size_type erase(const key_type &); template<typename KeyType, typename KeyTypeKeyCompare> - size_type erase(const KeyType &, KeyTypeKeyCompare); + size_type erase(const KeyType &, KeyTypeKeyCompare); template<typename Disposer> - iterator erase_and_dispose(const_iterator, Disposer); + iterator erase_and_dispose(const_iterator, Disposer); template<typename Disposer> - iterator erase_and_dispose(const_iterator, const_iterator, Disposer); + iterator erase_and_dispose(const_iterator, const_iterator, Disposer); template<typename Disposer> - size_type erase_and_dispose(const key_type &, Disposer); + size_type erase_and_dispose(const key_type &, Disposer); template<typename KeyType, typename KeyTypeKeyCompare, typename Disposer> - size_type erase_and_dispose(const KeyType &, KeyTypeKeyCompare, Disposer); - void clear(); - template<typename Disposer> void clear_and_dispose(Disposer); - size_type count(const key_type &) const; + size_type erase_and_dispose(const KeyType &, KeyTypeKeyCompare, Disposer); + void clear(); + template<typename Disposer> void clear_and_dispose(Disposer); + size_type count(const key_type &) const; template<typename KeyType, typename KeyTypeKeyCompare> - size_type count(const KeyType &, KeyTypeKeyCompare) const; - iterator lower_bound(const key_type &); + size_type count(const KeyType &, KeyTypeKeyCompare) const; + iterator lower_bound(const key_type &); template<typename KeyType, typename KeyTypeKeyCompare> - iterator lower_bound(const KeyType &, KeyTypeKeyCompare); - const_iterator lower_bound(const key_type &) const; + iterator lower_bound(const KeyType &, KeyTypeKeyCompare); + const_iterator lower_bound(const key_type &) const; template<typename KeyType, typename KeyTypeKeyCompare> - const_iterator lower_bound(const KeyType &, KeyTypeKeyCompare) const; - iterator upper_bound(const key_type &); + const_iterator lower_bound(const KeyType &, KeyTypeKeyCompare) const; + iterator upper_bound(const key_type &); template<typename KeyType, typename KeyTypeKeyCompare> - iterator upper_bound(const KeyType &, KeyTypeKeyCompare); - const_iterator upper_bound(const key_type &) const; + iterator upper_bound(const KeyType &, KeyTypeKeyCompare); + const_iterator upper_bound(const key_type &) const; template<typename KeyType, typename KeyTypeKeyCompare> - const_iterator upper_bound(const KeyType &, KeyTypeKeyCompare) const; - iterator find(const key_type &); + const_iterator upper_bound(const KeyType &, KeyTypeKeyCompare) const; + iterator find(const key_type &); template<typename KeyType, typename KeyTypeKeyCompare> - iterator find(const KeyType &, KeyTypeKeyCompare); - const_iterator find(const key_type &) const; + iterator find(const KeyType &, KeyTypeKeyCompare); + const_iterator find(const key_type &) const; template<typename KeyType, typename KeyTypeKeyCompare> - const_iterator find(const KeyType &, KeyTypeKeyCompare) const; - std::pair< iterator, iterator > equal_range(const key_type &); + const_iterator find(const KeyType &, KeyTypeKeyCompare) const; + std::pair< iterator, iterator > equal_range(const key_type &); template<typename KeyType, typename KeyTypeKeyCompare> std::pair< iterator, iterator > - equal_range(const KeyType &, KeyTypeKeyCompare); + equal_range(const KeyType &, KeyTypeKeyCompare); std::pair< const_iterator, const_iterator > - equal_range(const key_type &) const; + equal_range(const key_type &) const; template<typename KeyType, typename KeyTypeKeyCompare> std::pair< const_iterator, const_iterator > - equal_range(const KeyType &, KeyTypeKeyCompare) const; + equal_range(const KeyType &, KeyTypeKeyCompare) const; std::pair< iterator, iterator > - bounded_range(const key_type &, const key_type &, bool, bool); + bounded_range(const key_type &, const key_type &, bool, bool); template<typename KeyType, typename KeyTypeKeyCompare> std::pair< iterator, iterator > - bounded_range(const KeyType &, const KeyType &, KeyTypeKeyCompare, bool, + bounded_range(const KeyType &, const KeyType &, KeyTypeKeyCompare, bool, bool); std::pair< const_iterator, const_iterator > - bounded_range(const key_type &, const key_type &, bool, bool) const; + bounded_range(const key_type &, const key_type &, bool, bool) const; template<typename KeyType, typename KeyTypeKeyCompare> std::pair< const_iterator, const_iterator > - bounded_range(const KeyType &, const KeyType &, KeyTypeKeyCompare, bool, + bounded_range(const KeyType &, const KeyType &, KeyTypeKeyCompare, bool, bool) const; - iterator iterator_to(reference); - const_iterator iterator_to(const_reference) const; - pointer unlink_leftmost_without_rebalance(); - void replace_node(iterator, reference); - void remove_node(reference); - template<class... Options2> void merge(bs_multiset< T, Options2...> &); - template<class... Options2> void merge(bs_set< T, Options2...> &); + iterator iterator_to(reference); + const_iterator iterator_to(const_reference) const; + pointer unlink_leftmost_without_rebalance(); + void replace_node(iterator, reference); + void remove_node(reference); + template<class... Options2> void merge(bs_multiset< T, Options2...> &); + template<class... Options2> void merge(bs_set< T, Options2...> &); - // public static functions - static bs_multiset & container_from_end_iterator(iterator); - static const bs_multiset & container_from_end_iterator(const_iterator); - static bs_multiset & container_from_iterator(iterator); - static const bs_multiset & container_from_iterator(const_iterator); - static iterator s_iterator_to(reference); - static const_iterator s_iterator_to(const_reference); - static void init_node(reference); + // public static functions + static bs_multiset & container_from_end_iterator(iterator); + static const bs_multiset & container_from_end_iterator(const_iterator); + static bs_multiset & container_from_iterator(iterator); + static const bs_multiset & container_from_iterator(const_iterator); + static iterator s_iterator_to(reference); + static const_iterator s_iterator_to(const_reference); + static void init_node(reference); // public data members static const bool constant_time_size; @@ -189,13 +189,13 @@ construct/copy/destruct
            1. -
              bs_multiset();
              +
              bs_multiset();

              Effects: Constructs an empty container.

              Complexity: Constant.

              Throws: If value_traits::node_traits::node constructor throws (this does not happen with predefined Boost.Intrusive hooks) or the copy constructor of the key_compare object throws. Basic guarantee.

            2. -
              explicit bs_multiset(const key_compare & cmp, 
+
              explicit bs_multiset(const key_compare & cmp, 
                      const value_traits & v_traits = value_traits());
              
 
              Effects: Constructs an empty container with given comparison and traits.
              
 
              Complexity: Constant.
              
@@ -203,7 +203,7 @@
 
            3. template<typename Iterator> 
-  bs_multiset(Iterator b, Iterator e, const key_compare & cmp = key_compare(), 
+  bs_multiset(Iterator b, Iterator e, const key_compare & cmp = key_compare(), 
               const value_traits & v_traits = value_traits());

              Requires: Dereferencing iterator must yield an lvalue of type value_type. cmp must be a comparison function that induces a strict weak ordering.

              Effects: Constructs an empty container and inserts elements from [b, e).

              @@ -211,17 +211,17 @@

              Throws: If value_traits::node_traits::node constructor throws (this does not happen with predefined Boost.Intrusive hooks) or the copy constructor/operator() of the key_compare object throws. Basic guarantee.

            4. -
              bs_multiset(bs_multiset && x);
              +
              bs_multiset(bs_multiset && x);

              Effects: Constructs a container moving resources from another container. Internal comparison object and value traits are move constructed and nodes belonging to x (except the node representing the "end") are linked to *this.

              Complexity: Constant.

              Throws: If value_traits::node_traits::node's move constructor throws (this does not happen with predefined Boost.Intrusive hooks) or the move constructor of the comparison objet throws.

            5. -
              bs_multiset & operator=(bs_multiset && x);
              +
              bs_multiset & operator=(bs_multiset && x);

              Effects: Equivalent to swap

            6. -
              ~bs_multiset();
              +
              ~bs_multiset();

              Effects: Detaches all elements from this. The objects in the set are not deleted (i.e. no destructors are called), but the nodes according to the value_traits template parameter are reinitialized and thus can be reused.

              Complexity: Linear to elements contained in *this.

              Throws: Nothing.

              @@ -230,131 +230,131 @@

            -bs_multiset public member functions

            +bs_multiset public member functions
            1. -
              iterator begin();
              +
              iterator begin();

              Effects: Returns an iterator pointing to the beginning of the container.

              Complexity: Constant.

              Throws: Nothing.

            2. -
              const_iterator begin() const;
              +
              const_iterator begin() const;

              Effects: Returns a const_iterator pointing to the beginning of the container.

              Complexity: Constant.

              Throws: Nothing.

            3. -
              const_iterator cbegin() const;
              +
              const_iterator cbegin() const;

              Effects: Returns a const_iterator pointing to the beginning of the container.

              Complexity: Constant.

              Throws: Nothing.

            4. -
              iterator end();
              +
              iterator end();

              Effects: Returns an iterator pointing to the end of the container.

              Complexity: Constant.

              Throws: Nothing.

            5. -
              const_iterator end() const;
              +
              const_iterator end() const;

              Effects: Returns a const_iterator pointing to the end of the container.

              Complexity: Constant.

              Throws: Nothing.

            6. -
              const_iterator cend() const;
              +
              const_iterator cend() const;

              Effects: Returns a const_iterator pointing to the end of the container.

              Complexity: Constant.

              Throws: Nothing.

            7. -
              reverse_iterator rbegin();
              +
              reverse_iterator rbegin();

              Effects: Returns a reverse_iterator pointing to the beginning of the reversed container.

              Complexity: Constant.

              Throws: Nothing.

            8. -
              const_reverse_iterator rbegin() const;
              +
              const_reverse_iterator rbegin() const;

              Effects: Returns a const_reverse_iterator pointing to the beginning of the reversed container.

              Complexity: Constant.

              Throws: Nothing.

            9. -
              const_reverse_iterator crbegin() const;
              +
              const_reverse_iterator crbegin() const;

              Effects: Returns a const_reverse_iterator pointing to the beginning of the reversed container.

              Complexity: Constant.

              Throws: Nothing.

            10. -
              reverse_iterator rend();
              +
              reverse_iterator rend();

              Effects: Returns a reverse_iterator pointing to the end of the reversed container.

              Complexity: Constant.

              Throws: Nothing.

            11. -
              const_reverse_iterator rend() const;
              +
              const_reverse_iterator rend() const;

              Effects: Returns a const_reverse_iterator pointing to the end of the reversed container.

              Complexity: Constant.

              Throws: Nothing.

            12. -
              const_reverse_iterator crend() const;
              +
              const_reverse_iterator crend() const;

              Effects: Returns a const_reverse_iterator pointing to the end of the reversed container.

              Complexity: Constant.

              Throws: Nothing.

            13. -
              iterator root();
              +
              iterator root();

              Effects: Returns a iterator pointing to the root node of the container or end() if not present.

              Complexity: Constant.

              Throws: Nothing.

            14. -
              const_iterator root() const;
              +
              const_iterator root() const;

              Effects: Returns a const_iterator pointing to the root node of the container or cend() if not present.

              Complexity: Constant.

              Throws: Nothing.

            15. -
              const_iterator croot() const;
              +
              const_iterator croot() const;

              Effects: Returns a const_iterator pointing to the root node of the container or cend() if not present.

              Complexity: Constant.

              Throws: Nothing.

            16. -
              key_compare key_comp() const;
              +
              key_compare key_comp() const;

              Effects: Returns the key_compare object used by the container.

              Complexity: Constant.

              Throws: If key_compare copy-constructor throws.

            17. -
              value_compare value_comp() const;
              +
              value_compare value_comp() const;

              Effects: Returns the value_compare object used by the container.

              Complexity: Constant.

              Throws: If value_compare copy-constructor throws.

            18. -
              bool empty() const;
              +
              bool empty() const;

              Effects: Returns true if the container is empty.

              Complexity: Constant.

              Throws: Nothing.

            19. -
              size_type size() const;
              +
              size_type size() const;

              Effects: Returns the number of elements stored in the container.

              Complexity: Linear to elements contained in *this if constant-time size option is disabled. Constant time otherwise.

              Throws: Nothing.

            20. -
              void swap(bs_multiset & other);
              +
              void swap(bs_multiset & other);

              Effects: Swaps the contents of two containers.

              Complexity: Constant.

              Throws: If the comparison functor's swap call throws. 

            21. template<typename Cloner, typename Disposer> 
-  void clone_from(const bs_multiset & src, Cloner cloner, Disposer disposer);
              + void clone_from(const bs_multiset & src, Cloner cloner, Disposer disposer);

              Requires: Disposer::operator()(pointer) shouldn't throw. Cloner should yield to nodes equivalent to the original nodes.

              Effects: Erases all the elements from *this calling Disposer::operator()(pointer), clones all the elements from src calling Cloner::operator()(const_reference ) and inserts them on *this. Copies the predicate from the source container.

              If cloner throws, all cloned elements are unlinked and disposed calling Disposer::operator()(pointer).

              @@ -363,7 +363,7 @@ 
            22. template<typename Cloner, typename Disposer> 
-  void clone_from(bs_multiset && src, Cloner cloner, Disposer disposer);
              + void clone_from(bs_multiset && src, Cloner cloner, Disposer disposer);

              Requires: Disposer::operator()(pointer) shouldn't throw. Cloner should yield to nodes equivalent to the original nodes.

              Effects: Erases all the elements from *this calling Disposer::operator()(pointer), clones all the elements from src calling Cloner::operator()(reference) and inserts them on *this. Copies the predicate from the source container.

              If cloner throws, all cloned elements are unlinked and disposed calling Disposer::operator()(pointer).

              @@ -372,7 +372,7 @@

              Note: This version can modify the source container, useful to implement move semantics.

            23. -
              iterator insert(reference value);
              +
              iterator insert(reference value);

              Requires: value must be an lvalue

              Effects: Inserts value into the container before the upper bound.

              Complexity: Average complexity for insert element is at most logarithmic.

              @@ -380,7 +380,7 @@

              Note: Does not affect the validity of iterators and references. No copy-constructors are called.

            24. -
              iterator insert(const_iterator hint, reference value);
              +
              iterator insert(const_iterator hint, reference value);

              Requires: value must be an lvalue, and "hint" must be a valid iterator.

              Effects: Inserts x into the container, using "hint" as a hint to where it will be inserted. If "hint" is the upper_bound the insertion takes constant time (two comparisons in the worst case)

              Complexity: Logarithmic in general, but it is amortized constant time if t is inserted immediately before hint.

              @@ -388,7 +388,7 @@

              Note: Does not affect the validity of iterators and references. No copy-constructors are called.

            25. -
              template<typename Iterator> void insert(Iterator b, Iterator e);
              +
              template<typename Iterator> void insert(Iterator b, Iterator e);

              Requires: Dereferencing iterator must yield an lvalue of type value_type.

              Effects: Inserts a each element of a range into the container before the upper bound of the key of each element.

              Complexity: Insert range is in general O(N * log(N)), where N is the size of the range. However, it is linear in N if the range is already sorted by value_comp().

              @@ -396,7 +396,7 @@

              Note: Does not affect the validity of iterators and references. No copy-constructors are called.

            26. -
              iterator insert_before(const_iterator pos, reference value);
              +
              iterator insert_before(const_iterator pos, reference value);

              Requires: value must be an lvalue, "pos" must be a valid iterator (or end) and must be the succesor of value once inserted according to the predicate

              Effects: Inserts x into the container before "pos".

              Complexity: Constant time.

              @@ -404,7 +404,7 @@

              Note: This function does not check preconditions so if "pos" is not the successor of "value" container ordering invariant will be broken. This is a low-level function to be used only for performance reasons by advanced users.

            27. -
              void push_back(reference value);
              +
              void push_back(reference value);

              Requires: value must be an lvalue, and it must be no less than the greatest inserted key

              Effects: Inserts x into the container in the last position.

              Complexity: Constant time.

              @@ -412,7 +412,7 @@

              Note: This function does not check preconditions so if value is less than the greatest inserted key container ordering invariant will be broken. This function is slightly more efficient than using "insert_before". This is a low-level function to be used only for performance reasons by advanced users.

            28. -
              void push_front(reference value);
              +
              void push_front(reference value);

              Requires: value must be an lvalue, and it must be no greater than the minimum inserted key

              Effects: Inserts x into the container in the first position.

              Complexity: Constant time.

              @@ -420,21 +420,21 @@

              Note: This function does not check preconditions so if value is greater than the minimum inserted key container ordering invariant will be broken. This function is slightly more efficient than using "insert_before". This is a low-level function to be used only for performance reasons by advanced users.

            29. -
              iterator erase(const_iterator i);
              +
              iterator erase(const_iterator i);

              Effects: Erases the element pointed to by i.

              Complexity: Average complexity for erase element is constant time.

              Throws: Nothing.

              Note: Invalidates the iterators (but not the references) to the erased elements. No destructors are called.

            30. -
              iterator erase(const_iterator b, const_iterator e);
              +
              iterator erase(const_iterator b, const_iterator e);

              Effects: Erases the range pointed to by b end e.

              Complexity: Average complexity for erase range is at most O(log(size() + N)), where N is the number of elements in the range.

              Throws: Nothing.

              Note: Invalidates the iterators (but not the references) to the erased elements. No destructors are called.

            31. -
              size_type erase(const key_type & key);
              +
              size_type erase(const key_type & key);

              Effects: Erases all the elements with the given value.

              Returns: The number of erased elements.

              Complexity: O(log(size() + N).

              @@ -443,7 +443,7 @@ 
            32. template<typename KeyType, typename KeyTypeKeyCompare> 
-  size_type erase(const KeyType & key, KeyTypeKeyCompare comp);
              + size_type erase(const KeyType & key, KeyTypeKeyCompare comp);

              Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk), with nk the key_type of a value_type inserted into *this.

              Effects: Erases all the elements with the given key. according to the comparison functor "comp".

              Returns: The number of erased elements.

              @@ -453,7 +453,7 @@ 
            33. template<typename Disposer> 
-  iterator erase_and_dispose(const_iterator i, Disposer disposer);
              + iterator erase_and_dispose(const_iterator i, Disposer disposer);

              Requires: Disposer::operator()(pointer) shouldn't throw.

              Effects: Erases the element pointed to by i. Disposer::operator()(pointer) is called for the removed element.

              Complexity: Average complexity for erase element is constant time.

              @@ -462,7 +462,7 @@ 
            34. template<typename Disposer> 
-  iterator erase_and_dispose(const_iterator b, const_iterator e, 
+  iterator erase_and_dispose(const_iterator b, const_iterator e, 
                              Disposer disposer);

              Requires: Disposer::operator()(pointer) shouldn't throw.

              Effects: Erases the range pointed to by b end e. Disposer::operator()(pointer) is called for the removed elements.

              @@ -472,7 +472,7 @@ 
            35. template<typename Disposer> 
-  size_type erase_and_dispose(const key_type & key, Disposer disposer);
              + size_type erase_and_dispose(const key_type & key, Disposer disposer);

              Requires: Disposer::operator()(pointer) shouldn't throw.

              Effects: Erases all the elements with the given value. Disposer::operator()(pointer) is called for the removed elements.

              Returns: The number of erased elements.

              @@ -482,7 +482,7 @@ 
            36. template<typename KeyType, typename KeyTypeKeyCompare, typename Disposer> 
-  size_type erase_and_dispose(const KeyType & key, KeyTypeKeyCompare comp, 
+  size_type erase_and_dispose(const KeyType & key, KeyTypeKeyCompare comp, 
                               Disposer disposer);

              Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk) and nk the key_type of a value_type inserted into *this.

              Requires: Disposer::operator()(pointer) shouldn't throw.

              @@ -493,47 +493,47 @@

              Note: Invalidates the iterators to the erased elements.

            37. -
              void clear();
              +
              void clear();

              Effects: Erases all of the elements.

              Complexity: Linear to the number of elements on the container. if it's a safe-mode or auto-unlink value_type. Constant time otherwise.

              Throws: Nothing.

              Note: Invalidates the iterators (but not the references) to the erased elements. No destructors are called.

            38. -
              template<typename Disposer> void clear_and_dispose(Disposer disposer);
              +
              template<typename Disposer> void clear_and_dispose(Disposer disposer);

              Effects: Erases all of the elements calling disposer(p) for each node to be erased. Complexity: Average complexity for is at most O(log(size() + N)), where N is the number of elements in the container.

              Throws: Nothing.

              Note: Invalidates the iterators (but not the references) to the erased elements. Calls N times to disposer functor.

            39. -
              size_type count(const key_type & key) const;
              +
              size_type count(const key_type & key) const;

              Effects: Returns the number of contained elements with the given value

              Complexity: Logarithmic to the number of elements contained plus lineal to number of objects with the given value.

              Throws: If key_compare throws. 

            40. template<typename KeyType, typename KeyTypeKeyCompare> 
-  size_type count(const KeyType & key, KeyTypeKeyCompare comp) const;
              + size_type count(const KeyType & key, KeyTypeKeyCompare comp) const;

              Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk), and nk the key_type of a value_type inserted into *this.

              Effects: Returns the number of contained elements with the given key

              Complexity: Logarithmic to the number of elements contained plus lineal to number of objects with the given key.

              Throws: If comp throws.

            41. -
              iterator lower_bound(const key_type & key);
              +
              iterator lower_bound(const key_type & key);

              Effects: Returns an iterator to the first element whose key is not less than k or end() if that element does not exist.

              Complexity: Logarithmic.

              Throws: If key_compare throws. 

            42. template<typename KeyType, typename KeyTypeKeyCompare> 
-  iterator lower_bound(const KeyType & key, KeyTypeKeyCompare comp);
              + iterator lower_bound(const KeyType & key, KeyTypeKeyCompare comp);

              Effects: Returns an iterator to the first element whose key is not less than k or end() if that element does not exist.

              Complexity: Logarithmic.

              Throws: If key_compare throws.

            43. -
              const_iterator lower_bound(const key_type & key) const;
              +
              const_iterator lower_bound(const key_type & key) const;

              Effects: Returns an iterator to the first element whose key is not less than k or end() if that element does not exist.

              Complexity: Logarithmic.

              Throws: If key_compare throws.

              @@ -541,27 +541,27 @@ 
            44. template<typename KeyType, typename KeyTypeKeyCompare> 
   const_iterator 
-  lower_bound(const KeyType & key, KeyTypeKeyCompare comp) const;
              + lower_bound(const KeyType & key, KeyTypeKeyCompare comp) const;

              Effects: Returns an iterator to the first element whose key is not less than k or end() if that element does not exist.

              Complexity: Logarithmic.

              Throws: If key_compare throws.

            45. -
              iterator upper_bound(const key_type & key);
              +
              iterator upper_bound(const key_type & key);

              Effects: Returns an iterator to the first element whose key is greater than k or end() if that element does not exist.

              Complexity: Logarithmic.

              Throws: If key_compare throws. 

            46. template<typename KeyType, typename KeyTypeKeyCompare> 
-  iterator upper_bound(const KeyType & key, KeyTypeKeyCompare comp);
              + iterator upper_bound(const KeyType & key, KeyTypeKeyCompare comp);

              Requires: key is a value such that *this is partitioned with respect to !comp(key, nk), with nk the key_type of a value_type inserted into *this.

              Effects: Returns an iterator to the first element whose key is greater than k according to comp or end() if that element does not exist.

              Complexity: Logarithmic.

              Throws: If comp throws.

            47. -
              const_iterator upper_bound(const key_type & key) const;
              +
              const_iterator upper_bound(const key_type & key) const;

              Effects: Returns an iterator to the first element whose key is greater than k or end() if that element does not exist.

              Complexity: Logarithmic.

              Throws: If key_compare throws.

              @@ -569,42 +569,42 @@ 
            48. template<typename KeyType, typename KeyTypeKeyCompare> 
   const_iterator 
-  upper_bound(const KeyType & key, KeyTypeKeyCompare comp) const;
              + upper_bound(const KeyType & key, KeyTypeKeyCompare comp) const;

              Requires: key is a value such that *this is partitioned with respect to !comp(key, nk), with nk the key_type of a value_type inserted into *this.

              Effects: Returns an iterator to the first element whose key is greater than k according to comp or end() if that element does not exist.

              Complexity: Logarithmic.

              Throws: If comp throws.

            49. -
              iterator find(const key_type & key);
              +
              iterator find(const key_type & key);

              Effects: Finds an iterator to the first element whose key is k or end() if that element does not exist.

              Complexity: Logarithmic.

              Throws: If key_compare throws. 

            50. template<typename KeyType, typename KeyTypeKeyCompare> 
-  iterator find(const KeyType & key, KeyTypeKeyCompare comp);
              + iterator find(const KeyType & key, KeyTypeKeyCompare comp);

              Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk), and nk the key_type of a value_type inserted into *this.

              Effects: Finds an iterator to the first element whose key is k or end() if that element does not exist.

              Complexity: Logarithmic.

              Throws: If comp throws.

            51. -
              const_iterator find(const key_type & key) const;
              +
              const_iterator find(const key_type & key) const;

              Effects: Finds an iterator to the first element whose key is k or end() if that element does not exist.

              Complexity: Logarithmic.

              Throws: If key_compare throws. 

            52. template<typename KeyType, typename KeyTypeKeyCompare> 
-  const_iterator find(const KeyType & key, KeyTypeKeyCompare comp) const;
              + const_iterator find(const KeyType & key, KeyTypeKeyCompare comp) const;

              Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk), and nk the key_type of a value_type inserted into *this.

              Effects: Finds an iterator to the first element whose key is k or end() if that element does not exist.

              Complexity: Logarithmic.

              Throws: If comp throws.

            53. -
              std::pair< iterator, iterator > equal_range(const key_type & key);
              +
              std::pair< iterator, iterator > equal_range(const key_type & key);

              Effects: Finds a range containing all elements whose key is k or an empty range that indicates the position where those elements would be if they there is no elements with key k.

              Complexity: Logarithmic.

              Throws: If key_compare throws.

              @@ -612,7 +612,7 @@ 
            54. template<typename KeyType, typename KeyTypeKeyCompare> 
   std::pair< iterator, iterator > 
-  equal_range(const KeyType & key, KeyTypeKeyCompare comp);
              + equal_range(const KeyType & key, KeyTypeKeyCompare comp);

              Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk), with nk the key_type of a value_type inserted into *this.

              Effects: Finds a range containing all elements whose key is k or an empty range that indicates the position where those elements would be if they there is no elements with key k.

              Complexity: Logarithmic.

              @@ -620,7 +620,7 @@ 
            55. std::pair< const_iterator, const_iterator > 
-equal_range(const key_type & key) const;
              +equal_range(const key_type & key) const;

              Effects: Finds a range containing all elements whose key is k or an empty range that indicates the position where those elements would be if they there is no elements with key k.

              Complexity: Logarithmic.

              Throws: If key_compare throws.

              @@ -628,7 +628,7 @@ 
            56. template<typename KeyType, typename KeyTypeKeyCompare> 
   std::pair< const_iterator, const_iterator > 
-  equal_range(const KeyType & key, KeyTypeKeyCompare comp) const;
              + equal_range(const KeyType & key, KeyTypeKeyCompare comp) const;

              Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk), with nk the key_type of a value_type inserted into *this.

              Effects: Finds a range containing all elements whose key is k or an empty range that indicates the position where those elements would be if they there is no elements with key k.

              Complexity: Logarithmic.

              @@ -636,7 +636,7 @@ 
            57. std::pair< iterator, iterator > 
-bounded_range(const key_type & lower_key, const key_type & upper_key, 
+bounded_range(const key_type & lower_key, const key_type & upper_key, 
               bool left_closed, bool right_closed);

              Requires: upper_key shall not precede lower_key according to key_compare. [key_comp()(upper_key, lower_key) shall be false]

              If lower_key is equivalent to upper_key [!key_comp()(upper_key, lower_key) && !key_comp()(lower_key, upper_key)] then ('left_closed' || 'right_closed') must be false.

              @@ -651,7 +651,7 @@ 
            58. template<typename KeyType, typename KeyTypeKeyCompare> 
   std::pair< iterator, iterator > 
-  bounded_range(const KeyType & lower_key, const KeyType & upper_key, 
+  bounded_range(const KeyType & lower_key, const KeyType & upper_key, 
                 KeyTypeKeyCompare comp, bool left_closed, bool right_closed);

              Requires: lower_key is a value such that *this is partitioned with respect to comp(nk, lower_key) if left_closed is true, with respect to !comp(lower_key, nk) otherwise.

              upper_key is a value such that *this is partitioned with respect to !comp(upper_key, nk) if right_closed is true, with respect to comp(nk, upper_key) otherwise.

              @@ -667,7 +667,7 @@ 
            59. std::pair< const_iterator, const_iterator > 
-bounded_range(const key_type & lower_key, const key_type & upper_key, 
+bounded_range(const key_type & lower_key, const key_type & upper_key, 
               bool left_closed, bool right_closed) const;

              Requires: upper_key shall not precede lower_key according to key_compare. [key_comp()(upper_key, lower_key) shall be false]

              If lower_key is equivalent to upper_key [!key_comp()(upper_key, lower_key) && !key_comp()(lower_key, upper_key)] then ('left_closed' || 'right_closed') must be false.

              @@ -682,7 +682,7 @@ 
            60. template<typename KeyType, typename KeyTypeKeyCompare> 
   std::pair< const_iterator, const_iterator > 
-  bounded_range(const KeyType & lower_key, const KeyType & upper_key, 
+  bounded_range(const KeyType & lower_key, const KeyType & upper_key, 
                 KeyTypeKeyCompare comp, bool left_closed, bool right_closed) const;

              Requires: lower_key is a value such that *this is partitioned with respect to comp(nk, lower_key) if left_closed is true, with respect to !comp(lower_key, nk) otherwise.

              upper_key is a value such that *this is partitioned with respect to !comp(upper_key, nk) if right_closed is true, with respect to comp(nk, upper_key) otherwise.

              @@ -697,28 +697,28 @@

              Note: Experimental function, the interface might change in future releases.

            61. -
              iterator iterator_to(reference value);
              +
              iterator iterator_to(reference value);

              Requires: value must be an lvalue and shall be in a set of appropriate type. Otherwise the behavior is undefined.

              Effects: Returns: a valid iterator i belonging to the set that points to the value

              Complexity: Constant.

              Throws: Nothing.

            62. -
              const_iterator iterator_to(const_reference value) const;
              +
              const_iterator iterator_to(const_reference value) const;

              Requires: value must be an lvalue and shall be in a set of appropriate type. Otherwise the behavior is undefined.

              Effects: Returns: a valid const_iterator i belonging to the set that points to the value

              Complexity: Constant.

              Throws: Nothing.

            63. -
              pointer unlink_leftmost_without_rebalance();
              +
              pointer unlink_leftmost_without_rebalance();

              Effects: Unlinks the leftmost node from the container.

              Complexity: Average complexity is constant time.

              Throws: Nothing.

              Notes: This function breaks the container and the container can only be used for more unlink_leftmost_without_rebalance calls. This function is normally used to achieve a step by step controlled destruction of the container.

            64. -
              void replace_node(iterator replace_this, reference with_this);
              +
              void replace_node(iterator replace_this, reference with_this);

              Requires: replace_this must be a valid iterator of *this and with_this must not be inserted in any container.

              Effects: Replaces replace_this in its position in the container with with_this. The container does not need to be rebalanced.

              Complexity: Constant.

              @@ -726,7 +726,7 @@

              Note: This function will break container ordering invariants if with_this is not equivalent to *replace_this according to the ordering rules. This function is faster than erasing and inserting the node, since no rebalancing or comparison is needed.

            65. -
              void remove_node(reference value);
              +
              void remove_node(reference value);

              Effects: removes "value" from the container.

              Throws: Nothing.

              Complexity: Logarithmic time.

              @@ -734,7 +734,7 @@

              If the user calls this function with a constant time size container or stateful comparison functor a compilation error will be issued.

            66. -
              template<class... Options2> void merge(bs_multiset< T, Options2...> & source);
              +
              template<class... Options2> void merge(bs_multiset< T, Options2...> & source);

              Requires: "source" container's Options can only can differ in the comparison function from *this.

              Effects: Extracts each element in source and insert it into a using the comparison object of *this.

              Postcondition: Pointers and references to the transferred elements of source refer to those same elements but as members of *this. Iterators referring to the transferred elements will continue to refer to their elements, but they now behave as iterators into *this, not into source.

              @@ -742,7 +742,7 @@

              Complexity: N log(a.size() + N) (N has the value source.size())

            67. -
              template<class... Options2> void merge(bs_set< T, Options2...> & source);
              +
              template<class... Options2> void merge(bs_set< T, Options2...> & source);

              Requires: "source" container's Options can only can differ in the comparison function from *this.

              Effects: Extracts each element in source and insert it into a using the comparison object of *this.

              Postcondition: Pointers and references to the transferred elements of source refer to those same elements but as members of *this. Iterators referring to the transferred elements will continue to refer to their elements, but they now behave as iterators into *this, not into source.

              @@ -753,10 +753,10 @@

            -bs_multiset public static functions

            +bs_multiset public static functions
            1. -
              static bs_multiset & container_from_end_iterator(iterator end_iterator);
              +
              static bs_multiset & container_from_end_iterator(iterator end_iterator);

              Precondition: end_iterator must be a valid end iterator of the container.

              Effects: Returns a const reference to the container associated to the end iterator

              Throws: Nothing.

              @@ -764,28 +764,28 @@ 
            2. static const bs_multiset & 
-container_from_end_iterator(const_iterator end_iterator);
              +container_from_end_iterator(const_iterator end_iterator);

              Precondition: end_iterator must be a valid end iterator of the container.

              Effects: Returns a const reference to the container associated to the end iterator

              Throws: Nothing.

              Complexity: Constant.

            3. -
              static bs_multiset & container_from_iterator(iterator it);
              +
              static bs_multiset & container_from_iterator(iterator it);

              Precondition: it must be a valid iterator of the container.

              Effects: Returns a const reference to the container associated to the iterator

              Throws: Nothing.

              Complexity: Logarithmic.

            4. -
              static const bs_multiset & container_from_iterator(const_iterator it);
              +
              static const bs_multiset & container_from_iterator(const_iterator it);

              Precondition: it must be a valid iterator of the container.

              Effects: Returns a const reference to the container associated to the iterator

              Throws: Nothing.

              Complexity: Logarithmic.

            5. -
              static iterator s_iterator_to(reference value);
              +
              static iterator s_iterator_to(reference value);

              Requires: value must be an lvalue and shall be in a set of appropriate type. Otherwise the behavior is undefined.

              Effects: Returns: a valid iterator i belonging to the set that points to the value

              Complexity: Constant.

              @@ -793,7 +793,7 @@

              Note: This static function is available only if the value traits is stateless.

            6. -
              static const_iterator s_iterator_to(const_reference value);
              +
              static const_iterator s_iterator_to(const_reference value);

              Requires: value must be an lvalue and shall be in a set of appropriate type. Otherwise the behavior is undefined.

              Effects: Returns: a valid iterator i belonging to the set that points to the value

              Complexity: Constant.

              @@ -801,7 +801,7 @@

              Note: This static function is available only if the value traits is stateless.

            7. -
              static void init_node(reference value);
              +
              static void init_node(reference value);

              Requires: value shall not be in a container.

              Effects: init_node puts the hook of a value in a well-known default state.

              Throws: Nothing.

              diff --git a/doc/html/boost/intrusive/bs_set.html b/doc/html/boost/intrusive/bs_set.html index 13a9f5890f..ca4f31a39b 100644 --- a/doc/html/boost/intrusive/bs_set.html +++ b/doc/html/boost/intrusive/bs_set.html @@ -59,131 +59,131 @@ typedef implementation_defined::node_algorithms node_algorithms; // construct/copy/destruct - bs_set(); - explicit bs_set(const key_compare &, const value_traits & = value_traits()); + bs_set(); + explicit bs_set(const key_compare &, const value_traits & = value_traits()); template<typename Iterator> - bs_set(Iterator, Iterator, const key_compare & = key_compare(), + bs_set(Iterator, Iterator, const key_compare & = key_compare(), const value_traits & = value_traits()); - bs_set(bs_set &&); - bs_set & operator=(bs_set &&); - ~bs_set(); + bs_set(bs_set &&); + bs_set & operator=(bs_set &&); + ~bs_set(); - // public member functions - iterator begin(); - const_iterator begin() const; - const_iterator cbegin() const; - iterator end(); - const_iterator end() const; - const_iterator cend() const; - reverse_iterator rbegin(); - const_reverse_iterator rbegin() const; - const_reverse_iterator crbegin() const; - reverse_iterator rend(); - const_reverse_iterator rend() const; - const_reverse_iterator crend() const; - iterator root(); - const_iterator root() const; - const_iterator croot() const; - key_compare key_comp() const; - value_compare value_comp() const; - bool empty() const; - size_type size() const; - void swap(bs_set &); + // public member functions + iterator begin(); + const_iterator begin() const; + const_iterator cbegin() const; + iterator end(); + const_iterator end() const; + const_iterator cend() const; + reverse_iterator rbegin(); + const_reverse_iterator rbegin() const; + const_reverse_iterator crbegin() const; + reverse_iterator rend(); + const_reverse_iterator rend() const; + const_reverse_iterator crend() const; + iterator root(); + const_iterator root() const; + const_iterator croot() const; + key_compare key_comp() const; + value_compare value_comp() const; + bool empty() const; + size_type size() const; + void swap(bs_set &); template<typename Cloner, typename Disposer> - void clone_from(const bs_set &, Cloner, Disposer); + void clone_from(const bs_set &, Cloner, Disposer); template<typename Cloner, typename Disposer> - void clone_from(bs_set &&, Cloner, Disposer); - std::pair< iterator, bool > insert(reference); - iterator insert(const_iterator, reference); + void clone_from(bs_set &&, Cloner, Disposer); + std::pair< iterator, bool > insert(reference); + iterator insert(const_iterator, reference); std::pair< iterator, bool > - insert_check(const key_type &, insert_commit_data &); + insert_check(const key_type &, insert_commit_data &); std::pair< iterator, bool > - insert_check(const_iterator, const key_type &, insert_commit_data &); + insert_check(const_iterator, const key_type &, insert_commit_data &); template<typename KeyType, typename KeyTypeKeyCompare> std::pair< iterator, bool > - insert_check(const KeyType &, KeyTypeKeyCompare, insert_commit_data &); + insert_check(const KeyType &, KeyTypeKeyCompare, insert_commit_data &); template<typename KeyType, typename KeyTypeKeyCompare> std::pair< iterator, bool > - insert_check(const_iterator, const KeyType &, KeyTypeKeyCompare, + insert_check(const_iterator, const KeyType &, KeyTypeKeyCompare, insert_commit_data &); - template<typename Iterator> void insert(Iterator, Iterator); - iterator insert_commit(reference, const insert_commit_data &); - iterator insert_before(const_iterator, reference); - void push_back(reference); - void push_front(reference); - iterator erase(const_iterator); - iterator erase(const_iterator, const_iterator); - size_type erase(const key_type &); + template<typename Iterator> void insert(Iterator, Iterator); + iterator insert_commit(reference, const insert_commit_data &); + iterator insert_before(const_iterator, reference); + void push_back(reference); + void push_front(reference); + iterator erase(const_iterator); + iterator erase(const_iterator, const_iterator); + size_type erase(const key_type &); template<typename KeyType, typename KeyTypeKeyCompare> - size_type erase(const KeyType &, KeyTypeKeyCompare); + size_type erase(const KeyType &, KeyTypeKeyCompare); template<typename Disposer> - iterator erase_and_dispose(const_iterator, Disposer); + iterator erase_and_dispose(const_iterator, Disposer); template<typename Disposer> - iterator erase_and_dispose(const_iterator, const_iterator, Disposer); + iterator erase_and_dispose(const_iterator, const_iterator, Disposer); template<typename Disposer> - size_type erase_and_dispose(const key_type &, Disposer); + size_type erase_and_dispose(const key_type &, Disposer); template<typename KeyType, typename KeyTypeKeyCompare, typename Disposer> - size_type erase_and_dispose(const KeyType &, KeyTypeKeyCompare, Disposer); - void clear(); - template<typename Disposer> void clear_and_dispose(Disposer); - size_type count(const key_type &) const; + size_type erase_and_dispose(const KeyType &, KeyTypeKeyCompare, Disposer); + void clear(); + template<typename Disposer> void clear_and_dispose(Disposer); + size_type count(const key_type &) const; template<typename KeyType, typename KeyTypeKeyCompare> - size_type count(const KeyType &, KeyTypeKeyCompare) const; - iterator lower_bound(const key_type &); + size_type count(const KeyType &, KeyTypeKeyCompare) const; + iterator lower_bound(const key_type &); template<typename KeyType, typename KeyTypeKeyCompare> - iterator lower_bound(const KeyType &, KeyTypeKeyCompare); - const_iterator lower_bound(const key_type &) const; + iterator lower_bound(const KeyType &, KeyTypeKeyCompare); + const_iterator lower_bound(const key_type &) const; template<typename KeyType, typename KeyTypeKeyCompare> - const_iterator lower_bound(const KeyType &, KeyTypeKeyCompare) const; - iterator upper_bound(const key_type &); + const_iterator lower_bound(const KeyType &, KeyTypeKeyCompare) const; + iterator upper_bound(const key_type &); template<typename KeyType, typename KeyTypeKeyCompare> - iterator upper_bound(const KeyType &, KeyTypeKeyCompare); - const_iterator upper_bound(const key_type &) const; + iterator upper_bound(const KeyType &, KeyTypeKeyCompare); + const_iterator upper_bound(const key_type &) const; template<typename KeyType, typename KeyTypeKeyCompare> - const_iterator upper_bound(const KeyType &, KeyTypeKeyCompare) const; - iterator find(const key_type &); + const_iterator upper_bound(const KeyType &, KeyTypeKeyCompare) const; + iterator find(const key_type &); template<typename KeyType, typename KeyTypeKeyCompare> - iterator find(const KeyType &, KeyTypeKeyCompare); - const_iterator find(const key_type &) const; + iterator find(const KeyType &, KeyTypeKeyCompare); + const_iterator find(const key_type &) const; template<typename KeyType, typename KeyTypeKeyCompare> - const_iterator find(const KeyType &, KeyTypeKeyCompare) const; - std::pair< iterator, iterator > equal_range(const key_type &); + const_iterator find(const KeyType &, KeyTypeKeyCompare) const; + std::pair< iterator, iterator > equal_range(const key_type &); template<typename KeyType, typename KeyTypeKeyCompare> std::pair< iterator, iterator > - equal_range(const KeyType &, KeyTypeKeyCompare); + equal_range(const KeyType &, KeyTypeKeyCompare); std::pair< const_iterator, const_iterator > - equal_range(const key_type &) const; + equal_range(const key_type &) const; template<typename KeyType, typename KeyTypeKeyCompare> std::pair< const_iterator, const_iterator > - equal_range(const KeyType &, KeyTypeKeyCompare) const; + equal_range(const KeyType &, KeyTypeKeyCompare) const; std::pair< iterator, iterator > - bounded_range(const key_type &, const key_type &, bool, bool); + bounded_range(const key_type &, const key_type &, bool, bool); template<typename KeyType, typename KeyTypeKeyCompare> std::pair< iterator, iterator > - bounded_range(const KeyType &, const KeyType &, KeyTypeKeyCompare, bool, + bounded_range(const KeyType &, const KeyType &, KeyTypeKeyCompare, bool, bool); std::pair< const_iterator, const_iterator > - bounded_range(const key_type &, const key_type &, bool, bool) const; + bounded_range(const key_type &, const key_type &, bool, bool) const; template<typename KeyType, typename KeyTypeKeyCompare> std::pair< const_iterator, const_iterator > - bounded_range(const KeyType &, const KeyType &, KeyTypeKeyCompare, bool, + bounded_range(const KeyType &, const KeyType &, KeyTypeKeyCompare, bool, bool) const; - iterator iterator_to(reference); - const_iterator iterator_to(const_reference) const; - pointer unlink_leftmost_without_rebalance(); - void replace_node(iterator, reference); - void remove_node(reference); - template<class... Options2> void merge(bs_set< T, Options2...> &); - template<class... Options2> void merge(bs_multiset< T, Options2...> &); + iterator iterator_to(reference); + const_iterator iterator_to(const_reference) const; + pointer unlink_leftmost_without_rebalance(); + void replace_node(iterator, reference); + void remove_node(reference); + template<class... Options2> void merge(bs_set< T, Options2...> &); + template<class... Options2> void merge(bs_multiset< T, Options2...> &); - // public static functions - static bs_set & container_from_end_iterator(iterator); - static const bs_set & container_from_end_iterator(const_iterator); - static bs_set & container_from_iterator(iterator); - static const bs_set & container_from_iterator(const_iterator); - static iterator s_iterator_to(reference); - static const_iterator s_iterator_to(const_reference); - static void init_node(reference); + // public static functions + static bs_set & container_from_end_iterator(iterator); + static const bs_set & container_from_end_iterator(const_iterator); + static bs_set & container_from_iterator(iterator); + static const bs_set & container_from_iterator(const_iterator); + static iterator s_iterator_to(reference); + static const_iterator s_iterator_to(const_reference); + static void init_node(reference); // public data members static const bool constant_time_size; @@ -200,13 +200,13 @@ construct/copy/destruct
              1. -
                bs_set();
                +
                bs_set();

                Effects: Constructs an empty container.

                Complexity: Constant.

                Throws: If value_traits::node_traits::node constructor throws (this does not happen with predefined Boost.Intrusive hooks) or the copy constructor of the key_compare object throws. Basic guarantee.

              2. -
                explicit bs_set(const key_compare & cmp, 
+
                explicit bs_set(const key_compare & cmp, 
                 const value_traits & v_traits = value_traits());
                
 
                Effects: Constructs an empty container with given comparison and traits.
                
 
                Complexity: Constant.
                
@@ -214,7 +214,7 @@
 
              3. template<typename Iterator> 
-  bs_set(Iterator b, Iterator e, const key_compare & cmp = key_compare(), 
+  bs_set(Iterator b, Iterator e, const key_compare & cmp = key_compare(), 
          const value_traits & v_traits = value_traits());

                Requires: Dereferencing iterator must yield an lvalue of type value_type. cmp must be a comparison function that induces a strict weak ordering.

                Effects: Constructs an empty container and inserts elements from [b, e).

                @@ -222,17 +222,17 @@

                Throws: If value_traits::node_traits::node constructor throws (this does not happen with predefined Boost.Intrusive hooks) or the copy constructor/operator() of the key_compare object throws. Basic guarantee.

              4. -
                bs_set(bs_set && x);
                +
                bs_set(bs_set && x);

                Effects: Constructs a container moving resources from another container. Internal comparison object and value traits are move constructed and nodes belonging to x (except the node representing the "end") are linked to *this.

                Complexity: Constant.

                Throws: If value_traits::node_traits::node's move constructor throws (this does not happen with predefined Boost.Intrusive hooks) or the move constructor of the comparison objet throws.

              5. -
                bs_set & operator=(bs_set && x);
                +
                bs_set & operator=(bs_set && x);

                Effects: Equivalent to swap

              6. -
                ~bs_set();
                +
                ~bs_set();

                Effects: Detaches all elements from this. The objects in the set are not deleted (i.e. no destructors are called), but the nodes according to the value_traits template parameter are reinitialized and thus can be reused.

                Complexity: Linear to elements contained in *this.

                Throws: Nothing.

                @@ -241,131 +241,131 @@

              -bs_set public member functions

              +bs_set public member functions
              1. -
                iterator begin();
                +
                iterator begin();

                Effects: Returns an iterator pointing to the beginning of the container.

                Complexity: Constant.

                Throws: Nothing.

              2. -
                const_iterator begin() const;
                +
                const_iterator begin() const;

                Effects: Returns a const_iterator pointing to the beginning of the container.

                Complexity: Constant.

                Throws: Nothing.

              3. -
                const_iterator cbegin() const;
                +
                const_iterator cbegin() const;

                Effects: Returns a const_iterator pointing to the beginning of the container.

                Complexity: Constant.

                Throws: Nothing.

              4. -
                iterator end();
                +
                iterator end();

                Effects: Returns an iterator pointing to the end of the container.

                Complexity: Constant.

                Throws: Nothing.

              5. -
                const_iterator end() const;
                +
                const_iterator end() const;

                Effects: Returns a const_iterator pointing to the end of the container.

                Complexity: Constant.

                Throws: Nothing.

              6. -
                const_iterator cend() const;
                +
                const_iterator cend() const;

                Effects: Returns a const_iterator pointing to the end of the container.

                Complexity: Constant.

                Throws: Nothing.

              7. -
                reverse_iterator rbegin();
                +
                reverse_iterator rbegin();

                Effects: Returns a reverse_iterator pointing to the beginning of the reversed container.

                Complexity: Constant.

                Throws: Nothing.

              8. -
                const_reverse_iterator rbegin() const;
                +
                const_reverse_iterator rbegin() const;

                Effects: Returns a const_reverse_iterator pointing to the beginning of the reversed container.

                Complexity: Constant.

                Throws: Nothing.

              9. -
                const_reverse_iterator crbegin() const;
                +
                const_reverse_iterator crbegin() const;

                Effects: Returns a const_reverse_iterator pointing to the beginning of the reversed container.

                Complexity: Constant.

                Throws: Nothing.

              10. -
                reverse_iterator rend();
                +
                reverse_iterator rend();

                Effects: Returns a reverse_iterator pointing to the end of the reversed container.

                Complexity: Constant.

                Throws: Nothing.

              11. -
                const_reverse_iterator rend() const;
                +
                const_reverse_iterator rend() const;

                Effects: Returns a const_reverse_iterator pointing to the end of the reversed container.

                Complexity: Constant.

                Throws: Nothing.

              12. -
                const_reverse_iterator crend() const;
                +
                const_reverse_iterator crend() const;

                Effects: Returns a const_reverse_iterator pointing to the end of the reversed container.

                Complexity: Constant.

                Throws: Nothing.

              13. -
                iterator root();
                +
                iterator root();

                Effects: Returns a iterator pointing to the root node of the container or end() if not present.

                Complexity: Constant.

                Throws: Nothing.

              14. -
                const_iterator root() const;
                +
                const_iterator root() const;

                Effects: Returns a const_iterator pointing to the root node of the container or cend() if not present.

                Complexity: Constant.

                Throws: Nothing.

              15. -
                const_iterator croot() const;
                +
                const_iterator croot() const;

                Effects: Returns a const_iterator pointing to the root node of the container or cend() if not present.

                Complexity: Constant.

                Throws: Nothing.

              16. -
                key_compare key_comp() const;
                +
                key_compare key_comp() const;

                Effects: Returns the key_compare object used by the container.

                Complexity: Constant.

                Throws: If key_compare copy-constructor throws.

              17. -
                value_compare value_comp() const;
                +
                value_compare value_comp() const;

                Effects: Returns the value_compare object used by the container.

                Complexity: Constant.

                Throws: If value_compare copy-constructor throws.

              18. -
                bool empty() const;
                +
                bool empty() const;

                Effects: Returns true if the container is empty.

                Complexity: Constant.

                Throws: Nothing.

              19. -
                size_type size() const;
                +
                size_type size() const;

                Effects: Returns the number of elements stored in the container.

                Complexity: Linear to elements contained in *this if constant-time size option is disabled. Constant time otherwise.

                Throws: Nothing.

              20. -
                void swap(bs_set & other);
                +
                void swap(bs_set & other);

                Effects: Swaps the contents of two containers.

                Complexity: Constant.

                Throws: If the comparison functor's swap call throws. 

              21. template<typename Cloner, typename Disposer> 
-  void clone_from(const bs_set & src, Cloner cloner, Disposer disposer);
                + void clone_from(const bs_set & src, Cloner cloner, Disposer disposer);

                Requires: Disposer::operator()(pointer) shouldn't throw. Cloner should yield to nodes equivalent to the original nodes.

                Effects: Erases all the elements from *this calling Disposer::operator()(pointer), clones all the elements from src calling Cloner::operator()(const_reference ) and inserts them on *this. Copies the predicate from the source container.

                If cloner throws, all cloned elements are unlinked and disposed calling Disposer::operator()(pointer).

                @@ -374,7 +374,7 @@ 
              22. template<typename Cloner, typename Disposer> 
-  void clone_from(bs_set && src, Cloner cloner, Disposer disposer);
                + void clone_from(bs_set && src, Cloner cloner, Disposer disposer);

                Requires: Disposer::operator()(pointer) shouldn't throw. Cloner should yield to nodes equivalent to the original nodes.

                Effects: Erases all the elements from *this calling Disposer::operator()(pointer), clones all the elements from src calling Cloner::operator()(reference) and inserts them on *this. Copies the predicate from the source container.

                If cloner throws, all cloned elements are unlinked and disposed calling Disposer::operator()(pointer).

                @@ -383,7 +383,7 @@

                Note: This version can modify the source container, useful to implement move semantics.

              23. -
                std::pair< iterator, bool > insert(reference value);
                +
                std::pair< iterator, bool > insert(reference value);

                Requires: value must be an lvalue

                Effects: Inserts value into the container if the value is not already present.

                Complexity: Average complexity for insert element is at most logarithmic.

                @@ -391,7 +391,7 @@

                Note: Does not affect the validity of iterators and references. No copy-constructors are called.

              24. -
                iterator insert(const_iterator hint, reference value);
                +
                iterator insert(const_iterator hint, reference value);

                Requires: value must be an lvalue, and "hint" must be a valid iterator

                Effects: Tries to insert x into the container, using "hint" as a hint to where it will be inserted.

                Complexity: Logarithmic in general, but it is amortized constant time (two comparisons in the worst case) if t is inserted immediately before hint.

                @@ -400,7 +400,7 @@ 
              25. std::pair< iterator, bool > 
-insert_check(const key_type & key, insert_commit_data & commit_data);
                +insert_check(const key_type & key, insert_commit_data & commit_data);

                Effects: Checks if a value can be inserted in the container, using a user provided key instead of the value itself.

                Returns: If there is an equivalent value returns a pair containing an iterator to the already present value and false. If the value can be inserted returns true in the returned pair boolean and fills "commit_data" that is meant to be used with the "insert_commit" function.

                Complexity: Average complexity is at most logarithmic.

                @@ -408,7 +408,7 @@ 
              26. std::pair< iterator, bool > 
-insert_check(const_iterator hint, const key_type & key, 
+insert_check(const_iterator hint, const key_type & key, 
              insert_commit_data & commit_data);

                Effects: Checks if a value can be inserted in the container, using a user provided key instead of the value itself, using "hint" as a hint to where it will be inserted.

                Returns: If there is an equivalent value returns a pair containing an iterator to the already present value and false. If the value can be inserted returns true in the returned pair boolean and fills "commit_data" that is meant to be used with the "insert_commit" function.

                @@ -418,7 +418,7 @@ 
              27. template<typename KeyType, typename KeyTypeKeyCompare> 
   std::pair< iterator, bool > 
-  insert_check(const KeyType & key, KeyTypeKeyCompare comp, 
+  insert_check(const KeyType & key, KeyTypeKeyCompare comp, 
                insert_commit_data & commit_data);

                Requires: comp must be a comparison function that induces the same strict weak ordering as key_compare. The difference is that comp compares an arbitrary key with the contained values.

                Effects: Checks if a value can be inserted in the container, using a user provided key instead of the value itself.

                @@ -432,7 +432,7 @@ 
              28. template<typename KeyType, typename KeyTypeKeyCompare> 
   std::pair< iterator, bool > 
-  insert_check(const_iterator hint, const KeyType & key, 
+  insert_check(const_iterator hint, const KeyType & key, 
                KeyTypeKeyCompare comp, insert_commit_data & commit_data);

                Requires: comp must be a comparison function that induces the same strict weak ordering as key_compare. The difference is that comp compares an arbitrary key with the contained values.

                Effects: Checks if a value can be inserted in the container, using a user provided key instead of the value itself, using "hint" as a hint to where it will be inserted.

                @@ -444,7 +444,7 @@

                "commit_data" remains valid for a subsequent "insert_commit" only if no more objects are inserted or erased from the container.

              29. -
                template<typename Iterator> void insert(Iterator b, Iterator e);
                +
                template<typename Iterator> void insert(Iterator b, Iterator e);

                Requires: Dereferencing iterator must yield an lvalue of type value_type.

                Effects: Tries to insert each element of a range into the container.

                Complexity: Insert range is in general O(N * log(N)), where N is the size of the range. However, it is linear in N if the range is already sorted by value_comp().

                @@ -452,7 +452,7 @@

                Note: Does not affect the validity of iterators and references. No copy-constructors are called.

              30. -
                iterator insert_commit(reference value, 
+
                iterator insert_commit(reference value, 
                        const insert_commit_data & commit_data);
                
 
                Requires: value must be an lvalue of type value_type. commit_data must have been obtained from a previous call to "insert_check". No objects should have been inserted or erased from the container between the "insert_check" that filled "commit_data" and the call to "insert_commit".
                
 
                Effects: Inserts the value in the container using the information obtained from the "commit_data" that a previous "insert_check" filled.
                
@@ -462,7 +462,7 @@
 
                Notes: This function has only sense if a "insert_check" has been previously executed to fill "commit_data". No value should be inserted or erased between the "insert_check" and "insert_commit" calls.
              31. -
                iterator insert_before(const_iterator pos, reference value);
                +
                iterator insert_before(const_iterator pos, reference value);

                Requires: value must be an lvalue, "pos" must be a valid iterator (or end) and must be the succesor of value once inserted according to the predicate

                Effects: Inserts x into the container before "pos".

                Complexity: Constant time.

                @@ -470,7 +470,7 @@

                Note: This function does not check preconditions so if "pos" is not the successor of "value" container ordering invariant will be broken. This is a low-level function to be used only for performance reasons by advanced users.

              32. -
                void push_back(reference value);
                +
                void push_back(reference value);

                Requires: value must be an lvalue, and it must be no less than the greatest inserted key

                Effects: Inserts x into the container in the last position.

                Complexity: Constant time.

                @@ -478,7 +478,7 @@

                Note: This function does not check preconditions so if value is less than the greatest inserted key container ordering invariant will be broken. This function is slightly more efficient than using "insert_before". This is a low-level function to be used only for performance reasons by advanced users.

              33. -
                void push_front(reference value);
                +
                void push_front(reference value);

                Requires: value must be an lvalue, and it must be no greater than the minimum inserted key

                Effects: Inserts x into the container in the first position.

                Complexity: Constant time.

                @@ -486,21 +486,21 @@

                Note: This function does not check preconditions so if value is greater than the minimum inserted key container ordering invariant will be broken. This function is slightly more efficient than using "insert_before". This is a low-level function to be used only for performance reasons by advanced users.

              34. -
                iterator erase(const_iterator i);
                +
                iterator erase(const_iterator i);

                Effects: Erases the element pointed to by i.

                Complexity: Average complexity for erase element is constant time.

                Throws: Nothing.

                Note: Invalidates the iterators (but not the references) to the erased elements. No destructors are called.

              35. -
                iterator erase(const_iterator b, const_iterator e);
                +
                iterator erase(const_iterator b, const_iterator e);

                Effects: Erases the range pointed to by b end e.

                Complexity: Average complexity for erase range is at most O(log(size() + N)), where N is the number of elements in the range.

                Throws: Nothing.

                Note: Invalidates the iterators (but not the references) to the erased elements. No destructors are called.

              36. -
                size_type erase(const key_type & key);
                +
                size_type erase(const key_type & key);

                Effects: Erases all the elements with the given value.

                Returns: The number of erased elements.

                Complexity: O(log(size() + N).

                @@ -509,7 +509,7 @@ 
              37. template<typename KeyType, typename KeyTypeKeyCompare> 
-  size_type erase(const KeyType & key, KeyTypeKeyCompare comp);
                + size_type erase(const KeyType & key, KeyTypeKeyCompare comp);

                Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk), with nk the key_type of a value_type inserted into *this.

                Effects: Erases all the elements with the given key. according to the comparison functor "comp".

                Returns: The number of erased elements.

                @@ -519,7 +519,7 @@ 
              38. template<typename Disposer> 
-  iterator erase_and_dispose(const_iterator i, Disposer disposer);
                + iterator erase_and_dispose(const_iterator i, Disposer disposer);

                Requires: Disposer::operator()(pointer) shouldn't throw.

                Effects: Erases the element pointed to by i. Disposer::operator()(pointer) is called for the removed element.

                Complexity: Average complexity for erase element is constant time.

                @@ -528,7 +528,7 @@ 
              39. template<typename Disposer> 
-  iterator erase_and_dispose(const_iterator b, const_iterator e, 
+  iterator erase_and_dispose(const_iterator b, const_iterator e, 
                              Disposer disposer);

                Requires: Disposer::operator()(pointer) shouldn't throw.

                Effects: Erases the range pointed to by b end e. Disposer::operator()(pointer) is called for the removed elements.

                @@ -538,7 +538,7 @@ 
              40. template<typename Disposer> 
-  size_type erase_and_dispose(const key_type & key, Disposer disposer);
                + size_type erase_and_dispose(const key_type & key, Disposer disposer);

                Requires: Disposer::operator()(pointer) shouldn't throw.

                Effects: Erases all the elements with the given value. Disposer::operator()(pointer) is called for the removed elements.

                Returns: The number of erased elements.

                @@ -548,7 +548,7 @@ 
              41. template<typename KeyType, typename KeyTypeKeyCompare, typename Disposer> 
-  size_type erase_and_dispose(const KeyType & key, KeyTypeKeyCompare comp, 
+  size_type erase_and_dispose(const KeyType & key, KeyTypeKeyCompare comp, 
                               Disposer disposer);

                Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk) and nk the key_type of a value_type inserted into *this.

                Requires: Disposer::operator()(pointer) shouldn't throw.

                @@ -559,47 +559,47 @@

                Note: Invalidates the iterators to the erased elements.

              42. -
                void clear();
                +
                void clear();

                Effects: Erases all of the elements.

                Complexity: Linear to the number of elements on the container. if it's a safe-mode or auto-unlink value_type. Constant time otherwise.

                Throws: Nothing.

                Note: Invalidates the iterators (but not the references) to the erased elements. No destructors are called.

              43. -
                template<typename Disposer> void clear_and_dispose(Disposer disposer);
                +
                template<typename Disposer> void clear_and_dispose(Disposer disposer);

                Effects: Erases all of the elements calling disposer(p) for each node to be erased. Complexity: Average complexity for is at most O(log(size() + N)), where N is the number of elements in the container.

                Throws: Nothing.

                Note: Invalidates the iterators (but not the references) to the erased elements. Calls N times to disposer functor.

              44. -
                size_type count(const key_type & key) const;
                +
                size_type count(const key_type & key) const;

                Effects: Returns the number of contained elements with the given value

                Complexity: Logarithmic to the number of elements contained plus lineal to number of objects with the given value.

                Throws: If key_compare throws. 

              45. template<typename KeyType, typename KeyTypeKeyCompare> 
-  size_type count(const KeyType & key, KeyTypeKeyCompare comp) const;
                + size_type count(const KeyType & key, KeyTypeKeyCompare comp) const;

                Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk), and nk the key_type of a value_type inserted into *this.

                Effects: Returns the number of contained elements with the given key

                Complexity: Logarithmic to the number of elements contained plus lineal to number of objects with the given key.

                Throws: If comp throws.

              46. -
                iterator lower_bound(const key_type &);
                +
                iterator lower_bound(const key_type &);

                Effects: Returns an iterator to the first element whose key is not less than k or end() if that element does not exist.

                Complexity: Logarithmic.

                Throws: If key_compare throws. 

              47. template<typename KeyType, typename KeyTypeKeyCompare> 
-  iterator lower_bound(const KeyType & key, KeyTypeKeyCompare comp);
                + iterator lower_bound(const KeyType & key, KeyTypeKeyCompare comp);

                Effects: Returns an iterator to the first element whose key is not less than k or end() if that element does not exist.

                Complexity: Logarithmic.

                Throws: If key_compare throws.

              48. -
                const_iterator lower_bound(const key_type & key) const;
                +
                const_iterator lower_bound(const key_type & key) const;

                Effects: Returns an iterator to the first element whose key is not less than k or end() if that element does not exist.

                Complexity: Logarithmic.

                Throws: If key_compare throws.

                @@ -607,27 +607,27 @@ 
              49. template<typename KeyType, typename KeyTypeKeyCompare> 
   const_iterator 
-  lower_bound(const KeyType & key, KeyTypeKeyCompare comp) const;
                + lower_bound(const KeyType & key, KeyTypeKeyCompare comp) const;

                Effects: Returns an iterator to the first element whose key is not less than k or end() if that element does not exist.

                Complexity: Logarithmic.

                Throws: If key_compare throws.

              50. -
                iterator upper_bound(const key_type & key);
                +
                iterator upper_bound(const key_type & key);

                Effects: Returns an iterator to the first element whose key is greater than k or end() if that element does not exist.

                Complexity: Logarithmic.

                Throws: If key_compare throws. 

              51. template<typename KeyType, typename KeyTypeKeyCompare> 
-  iterator upper_bound(const KeyType & key, KeyTypeKeyCompare comp);
                + iterator upper_bound(const KeyType & key, KeyTypeKeyCompare comp);

                Requires: key is a value such that *this is partitioned with respect to !comp(key, nk), with nk the key_type of a value_type inserted into *this.

                Effects: Returns an iterator to the first element whose key is greater than k according to comp or end() if that element does not exist.

                Complexity: Logarithmic.

                Throws: If comp throws.

              52. -
                const_iterator upper_bound(const key_type & key) const;
                +
                const_iterator upper_bound(const key_type & key) const;

                Effects: Returns an iterator to the first element whose key is greater than k or end() if that element does not exist.

                Complexity: Logarithmic.

                Throws: If key_compare throws.

                @@ -635,42 +635,42 @@ 
              53. template<typename KeyType, typename KeyTypeKeyCompare> 
   const_iterator 
-  upper_bound(const KeyType & key, KeyTypeKeyCompare comp) const;
                + upper_bound(const KeyType & key, KeyTypeKeyCompare comp) const;

                Requires: key is a value such that *this is partitioned with respect to !comp(key, nk), with nk the key_type of a value_type inserted into *this.

                Effects: Returns an iterator to the first element whose key is greater than k according to comp or end() if that element does not exist.

                Complexity: Logarithmic.

                Throws: If comp throws.

              54. -
                iterator find(const key_type & key);
                +
                iterator find(const key_type & key);

                Effects: Finds an iterator to the first element whose key is k or end() if that element does not exist.

                Complexity: Logarithmic.

                Throws: If key_compare throws. 

              55. template<typename KeyType, typename KeyTypeKeyCompare> 
-  iterator find(const KeyType & key, KeyTypeKeyCompare comp);
                + iterator find(const KeyType & key, KeyTypeKeyCompare comp);

                Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk), and nk the key_type of a value_type inserted into *this.

                Effects: Finds an iterator to the first element whose key is k or end() if that element does not exist.

                Complexity: Logarithmic.

                Throws: If comp throws.

              56. -
                const_iterator find(const key_type & key) const;
                +
                const_iterator find(const key_type & key) const;

                Effects: Finds an iterator to the first element whose key is k or end() if that element does not exist.

                Complexity: Logarithmic.

                Throws: If key_compare throws. 

              57. template<typename KeyType, typename KeyTypeKeyCompare> 
-  const_iterator find(const KeyType & key, KeyTypeKeyCompare comp) const;
                + const_iterator find(const KeyType & key, KeyTypeKeyCompare comp) const;

                Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk), and nk the key_type of a value_type inserted into *this.

                Effects: Finds an iterator to the first element whose key is k or end() if that element does not exist.

                Complexity: Logarithmic.

                Throws: If comp throws.

              58. -
                std::pair< iterator, iterator > equal_range(const key_type & key);
                +
                std::pair< iterator, iterator > equal_range(const key_type & key);

                Effects: Finds a range containing all elements whose key is k or an empty range that indicates the position where those elements would be if they there is no elements with key k.

                Complexity: Logarithmic.

                Throws: If key_compare throws.

                @@ -678,7 +678,7 @@ 
              59. template<typename KeyType, typename KeyTypeKeyCompare> 
   std::pair< iterator, iterator > 
-  equal_range(const KeyType & key, KeyTypeKeyCompare comp);
                + equal_range(const KeyType & key, KeyTypeKeyCompare comp);

                Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk), with nk the key_type of a value_type inserted into *this.

                Effects: Finds a range containing all elements whose key is k or an empty range that indicates the position where those elements would be if they there is no elements with key k.

                Complexity: Logarithmic.

                @@ -686,7 +686,7 @@ 
              60. std::pair< const_iterator, const_iterator > 
-equal_range(const key_type & key) const;
                +equal_range(const key_type & key) const;

                Effects: Finds a range containing all elements whose key is k or an empty range that indicates the position where those elements would be if they there is no elements with key k.

                Complexity: Logarithmic.

                Throws: If key_compare throws.

                @@ -694,7 +694,7 @@ 
              61. template<typename KeyType, typename KeyTypeKeyCompare> 
   std::pair< const_iterator, const_iterator > 
-  equal_range(const KeyType & key, KeyTypeKeyCompare comp) const;
                + equal_range(const KeyType & key, KeyTypeKeyCompare comp) const;

                Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk), with nk the key_type of a value_type inserted into *this.

                Effects: Finds a range containing all elements whose key is k or an empty range that indicates the position where those elements would be if they there is no elements with key k.

                Complexity: Logarithmic.

                @@ -702,7 +702,7 @@ 
              62. std::pair< iterator, iterator > 
-bounded_range(const key_type & lower_key, const key_type & upper_key, 
+bounded_range(const key_type & lower_key, const key_type & upper_key, 
               bool left_closed, bool right_closed);

                Requires: upper_key shall not precede lower_key according to key_compare. [key_comp()(upper_key, lower_key) shall be false]

                If lower_key is equivalent to upper_key [!key_comp()(upper_key, lower_key) && !key_comp()(lower_key, upper_key)] then ('left_closed' || 'right_closed') must be false.

                @@ -717,7 +717,7 @@ 
              63. template<typename KeyType, typename KeyTypeKeyCompare> 
   std::pair< iterator, iterator > 
-  bounded_range(const KeyType & lower_key, const KeyType & upper_key, 
+  bounded_range(const KeyType & lower_key, const KeyType & upper_key, 
                 KeyTypeKeyCompare comp, bool left_closed, bool right_closed);

                Requires: lower_key is a value such that *this is partitioned with respect to comp(nk, lower_key) if left_closed is true, with respect to !comp(lower_key, nk) otherwise.

                upper_key is a value such that *this is partitioned with respect to !comp(upper_key, nk) if right_closed is true, with respect to comp(nk, upper_key) otherwise.

                @@ -733,7 +733,7 @@ 
              64. std::pair< const_iterator, const_iterator > 
-bounded_range(const key_type & lower_key, const key_type & upper_key, 
+bounded_range(const key_type & lower_key, const key_type & upper_key, 
               bool left_closed, bool right_closed) const;

                Requires: upper_key shall not precede lower_key according to key_compare. [key_comp()(upper_key, lower_key) shall be false]

                If lower_key is equivalent to upper_key [!key_comp()(upper_key, lower_key) && !key_comp()(lower_key, upper_key)] then ('left_closed' || 'right_closed') must be false.

                @@ -748,7 +748,7 @@ 
              65. template<typename KeyType, typename KeyTypeKeyCompare> 
   std::pair< const_iterator, const_iterator > 
-  bounded_range(const KeyType & lower_key, const KeyType & upper_key, 
+  bounded_range(const KeyType & lower_key, const KeyType & upper_key, 
                 KeyTypeKeyCompare comp, bool left_closed, bool right_closed) const;

                Requires: lower_key is a value such that *this is partitioned with respect to comp(nk, lower_key) if left_closed is true, with respect to !comp(lower_key, nk) otherwise.

                upper_key is a value such that *this is partitioned with respect to !comp(upper_key, nk) if right_closed is true, with respect to comp(nk, upper_key) otherwise.

                @@ -763,28 +763,28 @@

                Note: Experimental function, the interface might change in future releases.

              66. -
                iterator iterator_to(reference value);
                +
                iterator iterator_to(reference value);

                Requires: value must be an lvalue and shall be in a set of appropriate type. Otherwise the behavior is undefined.

                Effects: Returns: a valid iterator i belonging to the set that points to the value

                Complexity: Constant.

                Throws: Nothing.

              67. -
                const_iterator iterator_to(const_reference value) const;
                +
                const_iterator iterator_to(const_reference value) const;

                Requires: value must be an lvalue and shall be in a set of appropriate type. Otherwise the behavior is undefined.

                Effects: Returns: a valid const_iterator i belonging to the set that points to the value

                Complexity: Constant.

                Throws: Nothing.

              68. -
                pointer unlink_leftmost_without_rebalance();
                +
                pointer unlink_leftmost_without_rebalance();

                Effects: Unlinks the leftmost node from the container.

                Complexity: Average complexity is constant time.

                Throws: Nothing.

                Notes: This function breaks the container and the container can only be used for more unlink_leftmost_without_rebalance calls. This function is normally used to achieve a step by step controlled destruction of the container.

              69. -
                void replace_node(iterator replace_this, reference with_this);
                +
                void replace_node(iterator replace_this, reference with_this);

                Requires: replace_this must be a valid iterator of *this and with_this must not be inserted in any container.

                Effects: Replaces replace_this in its position in the container with with_this. The container does not need to be rebalanced.

                Complexity: Constant.

                @@ -792,7 +792,7 @@

                Note: This function will break container ordering invariants if with_this is not equivalent to *replace_this according to the ordering rules. This function is faster than erasing and inserting the node, since no rebalancing or comparison is needed.

              70. -
                void remove_node(reference value);
                +
                void remove_node(reference value);

                Effects: removes "value" from the container.

                Throws: Nothing.

                Complexity: Logarithmic time.

                @@ -800,7 +800,7 @@

                If the user calls this function with a constant time size container or stateful comparison functor a compilation error will be issued.

              71. -
                template<class... Options2> void merge(bs_set< T, Options2...> & source);
                +
                template<class... Options2> void merge(bs_set< T, Options2...> & source);

                Requires: "source" container's Options can only can differ in the comparison function from *this.

                Effects: Attempts to extract each element in source and insert it into a using the comparison object of *this. If there is an element in a with key equivalent to the key of an element from source, then that element is not extracted from source.

                Postcondition: Pointers and references to the transferred elements of source refer to those same elements but as members of *this. Iterators referring to the transferred elements will continue to refer to their elements, but they now behave as iterators into *this, not into source.

                @@ -808,7 +808,7 @@

                Complexity: N log(a.size() + N) (N has the value source.size())

              72. -
                template<class... Options2> void merge(bs_multiset< T, Options2...> & source);
                +
                template<class... Options2> void merge(bs_multiset< T, Options2...> & source);

                Requires: "source" container's Options can only can differ in the comparison function from *this.

                Effects: Attempts to extract each element in source and insert it into a using the comparison object of *this. If there is an element in a with key equivalent to the key of an element from source, then that element is not extracted from source.

                Postcondition: Pointers and references to the transferred elements of source refer to those same elements but as members of *this. Iterators referring to the transferred elements will continue to refer to their elements, but they now behave as iterators into *this, not into source.

                @@ -819,38 +819,38 @@

              -bs_set public static functions

              +bs_set public static functions
              1. -
                static bs_set & container_from_end_iterator(iterator end_iterator);
                +
                static bs_set & container_from_end_iterator(iterator end_iterator);

                Precondition: end_iterator must be a valid end iterator of the container.

                Effects: Returns a const reference to the container associated to the end iterator

                Throws: Nothing.

                Complexity: Constant.

              2. -
                static const bs_set & container_from_end_iterator(const_iterator end_iterator);
                +
                static const bs_set & container_from_end_iterator(const_iterator end_iterator);

                Precondition: end_iterator must be a valid end iterator of the container.

                Effects: Returns a const reference to the container associated to the end iterator

                Throws: Nothing.

                Complexity: Constant.

              3. -
                static bs_set & container_from_iterator(iterator it);
                +
                static bs_set & container_from_iterator(iterator it);

                Precondition: it must be a valid iterator of the container.

                Effects: Returns a const reference to the container associated to the iterator

                Throws: Nothing.

                Complexity: Logarithmic.

              4. -
                static const bs_set & container_from_iterator(const_iterator it);
                +
                static const bs_set & container_from_iterator(const_iterator it);

                Precondition: it must be a valid iterator of the container.

                Effects: Returns a const reference to the container associated to the iterator

                Throws: Nothing.

                Complexity: Logarithmic.

              5. -
                static iterator s_iterator_to(reference value);
                +
                static iterator s_iterator_to(reference value);

                Requires: value must be an lvalue and shall be in a set of appropriate type. Otherwise the behavior is undefined.

                Effects: Returns: a valid iterator i belonging to the set that points to the value

                Complexity: Constant.

                @@ -858,7 +858,7 @@

                Note: This static function is available only if the value traits is stateless.

              6. -
                static const_iterator s_iterator_to(const_reference value);
                +
                static const_iterator s_iterator_to(const_reference value);

                Requires: value must be an lvalue and shall be in a set of appropriate type. Otherwise the behavior is undefined.

                Effects: Returns: a valid iterator i belonging to the set that points to the value

                Complexity: Constant.

                @@ -866,7 +866,7 @@

                Note: This static function is available only if the value traits is stateless.

              7. -
                static void init_node(reference value);
                +
                static void init_node(reference value);

                Requires: value shall not be in a container.

                Effects: init_node puts the hook of a value in a well-known default state.

                Throws: Nothing.

                diff --git a/doc/html/boost/intrusive/bs_set_base_hook.html b/doc/html/boost/intrusive/bs_set_base_hook.html index ce9a5d860d..56d8d1730e 100644 --- a/doc/html/boost/intrusive/bs_set_base_hook.html +++ b/doc/html/boost/intrusive/bs_set_base_hook.html @@ -36,15 +36,15 @@ class bs_set_base_hook : public make_bs_set_base_hook::type< O1, O2, O3 > { public: // construct/copy/destruct - bs_set_base_hook(); - bs_set_base_hook(const bs_set_base_hook &); - bs_set_base_hook & operator=(const bs_set_base_hook &); - ~bs_set_base_hook(); + bs_set_base_hook(); + bs_set_base_hook(const bs_set_base_hook &); + bs_set_base_hook & operator=(const bs_set_base_hook &); + ~bs_set_base_hook(); - // public member functions - void swap_nodes(bs_set_base_hook &); - bool is_linked() const; - void unlink(); + // public member functions + void swap_nodes(bs_set_base_hook &); + bool is_linked() const; + void unlink(); };

              Description

              @@ -60,24 +60,24 @@ construct/copy/destruct
              1. -
                bs_set_base_hook();
                +
                bs_set_base_hook();

                Effects: If link_mode is auto_unlink or safe_link initializes the node to an unlinked state.

                Throws: Nothing.

              2. -
                bs_set_base_hook(const bs_set_base_hook &);
                +
                bs_set_base_hook(const bs_set_base_hook &);

                Effects: If link_mode is auto_unlink or safe_link initializes the node to an unlinked state. The argument is ignored.

                Throws: Nothing.

                Rationale: Providing a copy-constructor makes classes using the hook STL-compliant without forcing the user to do some additional work. swap can be used to emulate move-semantics.

              3. -
                bs_set_base_hook & operator=(const bs_set_base_hook &);
                +
                bs_set_base_hook & operator=(const bs_set_base_hook &);

                Effects: Empty function. The argument is ignored.

                Throws: Nothing.

                Rationale: Providing an assignment operator makes classes using the hook STL-compliant without forcing the user to do some additional work. swap can be used to emulate move-semantics.

              4. -
                ~bs_set_base_hook();
                +
                ~bs_set_base_hook();

                Effects: If link_mode is normal_link, the destructor does nothing (ie. no code is generated). If link_mode is safe_link and the object is stored in a set an assertion is raised. If link_mode is auto_unlink and is_linked() is true, the node is unlinked.

                Throws: Nothing.

                5. @@ -85,22 +85,22 @@

              -bs_set_base_hook public member functions

              +bs_set_base_hook public member functions
              1. -
                void swap_nodes(bs_set_base_hook & other);
                +
                void swap_nodes(bs_set_base_hook & other);

                Effects: Swapping two nodes swaps the position of the elements related to those nodes in one or two containers. That is, if the node this is part of the element e1, the node x is part of the element e2 and both elements are included in the containers s1 and s2, then after the swap-operation e1 is in s2 at the position of e2 and e2 is in s1 at the position of e1. If one element is not in a container, then after the swap-operation the other element is not in a container. Iterators to e1 and e2 related to those nodes are invalidated.

                Complexity: Constant

                Throws: Nothing.

              2. -
                bool is_linked() const;
                +
                bool is_linked() const;

                Precondition: link_mode must be safe_link or auto_unlink.

                Returns: true, if the node belongs to a container, false otherwise. This function can be used to test whether set::iterator_to will return a valid iterator.

                Complexity: Constant

              3. -
                void unlink();
                +
                void unlink();

                Effects: Removes the node if it's inserted in a container. This function is only allowed if link_mode is auto_unlink.

                Throws: Nothing.

                4. diff --git a/doc/html/boost/intrusive/bs_set_member_hook.html b/doc/html/boost/intrusive/bs_set_member_hook.html index bb4427f176..125f9b96be 100644 --- a/doc/html/boost/intrusive/bs_set_member_hook.html +++ b/doc/html/boost/intrusive/bs_set_member_hook.html @@ -36,15 +36,15 @@ class bs_set_member_hook : public make_bs_set_member_hook::type< O1, O2, O3 > { public: // construct/copy/destruct - bs_set_member_hook(); - bs_set_member_hook(const bs_set_member_hook &); - bs_set_member_hook & operator=(const bs_set_member_hook &); - ~bs_set_member_hook(); + bs_set_member_hook(); + bs_set_member_hook(const bs_set_member_hook &); + bs_set_member_hook & operator=(const bs_set_member_hook &); + ~bs_set_member_hook(); - // public member functions - void swap_nodes(bs_set_member_hook &); - bool is_linked() const; - void unlink(); + // public member functions + void swap_nodes(bs_set_member_hook &); + bool is_linked() const; + void unlink(); };

              Description

              @@ -59,24 +59,24 @@ construct/copy/destruct
              1. -
                bs_set_member_hook();
                +
                bs_set_member_hook();

                Effects: If link_mode is auto_unlink or safe_link initializes the node to an unlinked state.

                Throws: Nothing.

              2. -
                bs_set_member_hook(const bs_set_member_hook &);
                +
                bs_set_member_hook(const bs_set_member_hook &);

                Effects: If link_mode is auto_unlink or safe_link initializes the node to an unlinked state. The argument is ignored.

                Throws: Nothing.

                Rationale: Providing a copy-constructor makes classes using the hook STL-compliant without forcing the user to do some additional work. swap can be used to emulate move-semantics.

              3. -
                bs_set_member_hook & operator=(const bs_set_member_hook &);
                +
                bs_set_member_hook & operator=(const bs_set_member_hook &);

                Effects: Empty function. The argument is ignored.

                Throws: Nothing.

                Rationale: Providing an assignment operator makes classes using the hook STL-compliant without forcing the user to do some additional work. swap can be used to emulate move-semantics.

              4. -
                ~bs_set_member_hook();
                +
                ~bs_set_member_hook();

                Effects: If link_mode is normal_link, the destructor does nothing (ie. no code is generated). If link_mode is safe_link and the object is stored in a set an assertion is raised. If link_mode is auto_unlink and is_linked() is true, the node is unlinked.

                Throws: Nothing.

                5. @@ -84,22 +84,22 @@

              -bs_set_member_hook public member functions

              +bs_set_member_hook public member functions
              1. -
                void swap_nodes(bs_set_member_hook & other);
                +
                void swap_nodes(bs_set_member_hook & other);

                Effects: Swapping two nodes swaps the position of the elements related to those nodes in one or two containers. That is, if the node this is part of the element e1, the node x is part of the element e2 and both elements are included in the containers s1 and s2, then after the swap-operation e1 is in s2 at the position of e2 and e2 is in s1 at the position of e1. If one element is not in a container, then after the swap-operation the other element is not in a container. Iterators to e1 and e2 related to those nodes are invalidated.

                Complexity: Constant

                Throws: Nothing.

              2. -
                bool is_linked() const;
                +
                bool is_linked() const;

                Precondition: link_mode must be safe_link or auto_unlink.

                Returns: true, if the node belongs to a container, false otherwise. This function can be used to test whether set::iterator_to will return a valid iterator.

                Complexity: Constant

              3. -
                void unlink();
                +
                void unlink();

                Effects: Removes the node if it's inserted in a container. This function is only allowed if link_mode is auto_unlink.

                Throws: Nothing.

                4. diff --git a/doc/html/boost/intrusive/bstree.html b/doc/html/boost/intrusive/bstree.html index 6caf023272..c8eb10c242 100644 --- a/doc/html/boost/intrusive/bstree.html +++ b/doc/html/boost/intrusive/bstree.html @@ -61,143 +61,143 @@ typedef node_algorithms::insert_commit_data insert_commit_data; // construct/copy/destruct - bstree(); - explicit bstree(const key_compare &, const value_traits & = value_traits()); + bstree(); + explicit bstree(const key_compare &, const value_traits & = value_traits()); template<typename Iterator> - bstree(bool, Iterator, Iterator, const key_compare & = key_compare(), + bstree(bool, Iterator, Iterator, const key_compare & = key_compare(), const value_traits & = value_traits()); - bstree(bstree &&); - bstree & operator=(bstree &&); - ~bstree(); + bstree(bstree &&); + bstree & operator=(bstree &&); + ~bstree(); - // public member functions - iterator begin(); - const_iterator begin() const; - const_iterator cbegin() const; - iterator end(); - const_iterator end() const; - const_iterator cend() const; - reverse_iterator rbegin(); - const_reverse_iterator rbegin() const; - const_reverse_iterator crbegin() const; - reverse_iterator rend(); - const_reverse_iterator rend() const; - const_reverse_iterator crend() const; - iterator root(); - const_iterator root() const; - const_iterator croot() const; - key_compare key_comp() const; - value_compare value_comp() const; - bool empty() const; - size_type size() const; - void swap(bstree &); + // public member functions + iterator begin(); + const_iterator begin() const; + const_iterator cbegin() const; + iterator end(); + const_iterator end() const; + const_iterator cend() const; + reverse_iterator rbegin(); + const_reverse_iterator rbegin() const; + const_reverse_iterator crbegin() const; + reverse_iterator rend(); + const_reverse_iterator rend() const; + const_reverse_iterator crend() const; + iterator root(); + const_iterator root() const; + const_iterator croot() const; + key_compare key_comp() const; + value_compare value_comp() const; + bool empty() const; + size_type size() const; + void swap(bstree &); template<typename Cloner, typename Disposer> - void clone_from(const bstree &, Cloner, Disposer); + void clone_from(const bstree &, Cloner, Disposer); template<typename Cloner, typename Disposer> - void clone_from(bstree &&, Cloner, Disposer); - iterator insert_equal(reference); - iterator insert_equal(const_iterator, reference); - template<typename Iterator> void insert_equal(Iterator, Iterator); - std::pair< iterator, bool > insert_unique(reference); - iterator insert_unique(const_iterator, reference); - template<typename Iterator> void insert_unique(Iterator, Iterator); + void clone_from(bstree &&, Cloner, Disposer); + iterator insert_equal(reference); + iterator insert_equal(const_iterator, reference); + template<typename Iterator> void insert_equal(Iterator, Iterator); + std::pair< iterator, bool > insert_unique(reference); + iterator insert_unique(const_iterator, reference); + template<typename Iterator> void insert_unique(Iterator, Iterator); std::pair< iterator, bool > - insert_unique_check(const key_type &, insert_commit_data &); + insert_unique_check(const key_type &, insert_commit_data &); std::pair< iterator, bool > - insert_unique_check(const_iterator, const key_type &, insert_commit_data &); + insert_unique_check(const_iterator, const key_type &, insert_commit_data &); template<typename KeyType, typename KeyTypeKeyCompare> std::pair< iterator, bool > - insert_unique_check(const KeyType &, KeyTypeKeyCompare, + insert_unique_check(const KeyType &, KeyTypeKeyCompare, insert_commit_data &); template<typename KeyType, typename KeyTypeKeyCompare> std::pair< iterator, bool > - insert_unique_check(const_iterator, const KeyType &, KeyTypeKeyCompare, + insert_unique_check(const_iterator, const KeyType &, KeyTypeKeyCompare, insert_commit_data &); - iterator insert_unique_commit(reference, const insert_commit_data &); - iterator insert_before(const_iterator, reference); - void push_back(reference); - void push_front(reference); - iterator erase(const_iterator); - iterator erase(const_iterator, const_iterator); - size_type erase(const key_type &); + iterator insert_unique_commit(reference, const insert_commit_data &); + iterator insert_before(const_iterator, reference); + void push_back(reference); + void push_front(reference); + iterator erase(const_iterator); + iterator erase(const_iterator, const_iterator); + size_type erase(const key_type &); template<typename KeyType, typename KeyTypeKeyCompare> - size_type erase(const KeyType &, KeyTypeKeyCompare); + size_type erase(const KeyType &, KeyTypeKeyCompare); template<typename Disposer> - iterator erase_and_dispose(const_iterator, Disposer); + iterator erase_and_dispose(const_iterator, Disposer); template<typename Disposer> - size_type erase_and_dispose(const key_type &, Disposer); + size_type erase_and_dispose(const key_type &, Disposer); template<typename Disposer> - iterator erase_and_dispose(const_iterator, const_iterator, Disposer); + iterator erase_and_dispose(const_iterator, const_iterator, Disposer); template<typename KeyType, typename KeyTypeKeyCompare, typename Disposer> - size_type erase_and_dispose(const KeyType &, KeyTypeKeyCompare, Disposer); - void clear(); - template<typename Disposer> void clear_and_dispose(Disposer); - size_type count(const key_type &) const; + size_type erase_and_dispose(const KeyType &, KeyTypeKeyCompare, Disposer); + void clear(); + template<typename Disposer> void clear_and_dispose(Disposer); + size_type count(const key_type &) const; template<typename KeyType, typename KeyTypeKeyCompare> - size_type count(const KeyType &, KeyTypeKeyCompare) const; - iterator lower_bound(const key_type &); - const_iterator lower_bound(const key_type &) const; + size_type count(const KeyType &, KeyTypeKeyCompare) const; + iterator lower_bound(const key_type &); + const_iterator lower_bound(const key_type &) const; template<typename KeyType, typename KeyTypeKeyCompare> - iterator lower_bound(const KeyType &, KeyTypeKeyCompare); + iterator lower_bound(const KeyType &, KeyTypeKeyCompare); template<typename KeyType, typename KeyTypeKeyCompare> - const_iterator lower_bound(const KeyType &, KeyTypeKeyCompare) const; - iterator upper_bound(const key_type &); + const_iterator lower_bound(const KeyType &, KeyTypeKeyCompare) const; + iterator upper_bound(const key_type &); template<typename KeyType, typename KeyTypeKeyCompare> - iterator upper_bound(const KeyType &, KeyTypeKeyCompare); - const_iterator upper_bound(const key_type &) const; + iterator upper_bound(const KeyType &, KeyTypeKeyCompare); + const_iterator upper_bound(const key_type &) const; template<typename KeyType, typename KeyTypeKeyCompare> - const_iterator upper_bound(const KeyType &, KeyTypeKeyCompare) const; - iterator find(const key_type &); + const_iterator upper_bound(const KeyType &, KeyTypeKeyCompare) const; + iterator find(const key_type &); template<typename KeyType, typename KeyTypeKeyCompare> - iterator find(const KeyType &, KeyTypeKeyCompare); - const_iterator find(const key_type &) const; + iterator find(const KeyType &, KeyTypeKeyCompare); + const_iterator find(const key_type &) const; template<typename KeyType, typename KeyTypeKeyCompare> - const_iterator find(const KeyType &, KeyTypeKeyCompare) const; - std::pair< iterator, iterator > equal_range(const key_type &); + const_iterator find(const KeyType &, KeyTypeKeyCompare) const; + std::pair< iterator, iterator > equal_range(const key_type &); template<typename KeyType, typename KeyTypeKeyCompare> std::pair< iterator, iterator > - equal_range(const KeyType &, KeyTypeKeyCompare); + equal_range(const KeyType &, KeyTypeKeyCompare); std::pair< const_iterator, const_iterator > - equal_range(const key_type &) const; + equal_range(const key_type &) const; template<typename KeyType, typename KeyTypeKeyCompare> std::pair< const_iterator, const_iterator > - equal_range(const KeyType &, KeyTypeKeyCompare) const; + equal_range(const KeyType &, KeyTypeKeyCompare) const; std::pair< iterator, iterator > - bounded_range(const key_type &, const key_type &, bool, bool); + bounded_range(const key_type &, const key_type &, bool, bool); template<typename KeyType, typename KeyTypeKeyCompare> std::pair< iterator, iterator > - bounded_range(const KeyType &, const KeyType &, KeyTypeKeyCompare, bool, + bounded_range(const KeyType &, const KeyType &, KeyTypeKeyCompare, bool, bool); std::pair< const_iterator, const_iterator > - bounded_range(const key_type &, const key_type &, bool, bool) const; + bounded_range(const key_type &, const key_type &, bool, bool) const; template<typename KeyType, typename KeyTypeKeyCompare> std::pair< const_iterator, const_iterator > - bounded_range(const KeyType &, const KeyType &, KeyTypeKeyCompare, bool, + bounded_range(const KeyType &, const KeyType &, KeyTypeKeyCompare, bool, bool) const; - iterator iterator_to(reference); - const_iterator iterator_to(const_reference) const; - pointer unlink_leftmost_without_rebalance(); - void replace_node(iterator, reference); - void rebalance(); - iterator rebalance_subtree(iterator); + iterator iterator_to(reference); + const_iterator iterator_to(const_reference) const; + pointer unlink_leftmost_without_rebalance(); + void replace_node(iterator, reference); + void rebalance(); + iterator rebalance_subtree(iterator); template<typename T, class... Options2> - void merge_unique(bstree< T, Options2...> &); - while(it! = itend); + void merge_unique(bstree< T, Options2...> &); + while(it! = itend); template<typename T, class... Options2> - void merge_equal(bstree< T, Options2...> &); - while(it! = itend); - template<typename ExtraChecker> void check(ExtraChecker) const; - void check() const; + void merge_equal(bstree< T, Options2...> &); + while(it! = itend); + template<typename ExtraChecker> void check(ExtraChecker) const; + void check() const; - // public static functions - static bstree & container_from_end_iterator(iterator); - static const bstree & container_from_end_iterator(const_iterator); - static bstree & container_from_iterator(iterator); - static const bstree & container_from_iterator(const_iterator); - static iterator s_iterator_to(reference); - static const_iterator s_iterator_to(const_reference); - static void init_node(reference); - static void remove_node(reference); + // public static functions + static bstree & container_from_end_iterator(iterator); + static const bstree & container_from_end_iterator(const_iterator); + static bstree & container_from_iterator(iterator); + static const bstree & container_from_iterator(const_iterator); + static iterator s_iterator_to(reference); + static const_iterator s_iterator_to(const_reference); + static void init_node(reference); + static void remove_node(reference); // public data members static const bool constant_time_size; @@ -216,13 +216,13 @@ construct/copy/destruct
                1. -
                  bstree();
                  +
                  bstree();

                  Effects: Constructs an empty container.

                  Complexity: Constant.

                  Throws: If value_traits::node_traits::node constructor throws (this does not happen with predefined Boost.Intrusive hooks) or the copy constructor of the key_compare object throws. Basic guarantee.

                2. -
                  explicit bstree(const key_compare & cmp, 
+
                  explicit bstree(const key_compare & cmp, 
                 const value_traits & v_traits = value_traits());
                  
 
                  Effects: Constructs an empty container with given comparison and traits.
                  
 
                  Complexity: Constant.
                  
@@ -230,7 +230,7 @@
 
                3. template<typename Iterator> 
-  bstree(bool unique, Iterator b, Iterator e, 
+  bstree(bool unique, Iterator b, Iterator e, 
          const key_compare & cmp = key_compare(), 
          const value_traits & v_traits = value_traits());

                  Requires: Dereferencing iterator must yield an lvalue of type value_type. cmp must be a comparison function that induces a strict weak ordering.

                  @@ -239,17 +239,17 @@

                  Throws: If value_traits::node_traits::node constructor throws (this does not happen with predefined Boost.Intrusive hooks) or the copy constructor/operator() of the key_compare object throws. Basic guarantee.

                4. -
                  bstree(bstree && x);
                  +
                  bstree(bstree && x);

                  Effects: Constructs a container moving resources from another container. Internal comparison object and value traits are move constructed and nodes belonging to x (except the node representing the "end") are linked to *this.

                  Complexity: Constant.

                  Throws: If value_traits::node_traits::node's move constructor throws (this does not happen with predefined Boost.Intrusive hooks) or the move constructor of the comparison objet throws.

                5. -
                  bstree & operator=(bstree && x);
                  +
                  bstree & operator=(bstree && x);

                  Effects: Equivalent to swap

                6. -
                  ~bstree();
                  +
                  ~bstree();

                  Effects: Detaches all elements from this. The objects in the set are not deleted (i.e. no destructors are called), but the nodes according to the value_traits template parameter are reinitialized and thus can be reused.

                  Complexity: Linear to elements contained in *this.

                  Throws: Nothing.

                  @@ -258,131 +258,131 @@

                -bstree public member functions

                +bstree public member functions
                1. -
                  iterator begin();
                  +
                  iterator begin();

                  Effects: Returns an iterator pointing to the beginning of the container.

                  Complexity: Constant.

                  Throws: Nothing.

                2. -
                  const_iterator begin() const;
                  +
                  const_iterator begin() const;

                  Effects: Returns a const_iterator pointing to the beginning of the container.

                  Complexity: Constant.

                  Throws: Nothing.

                3. -
                  const_iterator cbegin() const;
                  +
                  const_iterator cbegin() const;

                  Effects: Returns a const_iterator pointing to the beginning of the container.

                  Complexity: Constant.

                  Throws: Nothing.

                4. -
                  iterator end();
                  +
                  iterator end();

                  Effects: Returns an iterator pointing to the end of the container.

                  Complexity: Constant.

                  Throws: Nothing.

                5. -
                  const_iterator end() const;
                  +
                  const_iterator end() const;

                  Effects: Returns a const_iterator pointing to the end of the container.

                  Complexity: Constant.

                  Throws: Nothing.

                6. -
                  const_iterator cend() const;
                  +
                  const_iterator cend() const;

                  Effects: Returns a const_iterator pointing to the end of the container.

                  Complexity: Constant.

                  Throws: Nothing.

                7. -
                  reverse_iterator rbegin();
                  +
                  reverse_iterator rbegin();

                  Effects: Returns a reverse_iterator pointing to the beginning of the reversed container.

                  Complexity: Constant.

                  Throws: Nothing.

                8. -
                  const_reverse_iterator rbegin() const;
                  +
                  const_reverse_iterator rbegin() const;

                  Effects: Returns a const_reverse_iterator pointing to the beginning of the reversed container.

                  Complexity: Constant.

                  Throws: Nothing.

                9. -
                  const_reverse_iterator crbegin() const;
                  +
                  const_reverse_iterator crbegin() const;

                  Effects: Returns a const_reverse_iterator pointing to the beginning of the reversed container.

                  Complexity: Constant.

                  Throws: Nothing.

                10. -
                  reverse_iterator rend();
                  +
                  reverse_iterator rend();

                  Effects: Returns a reverse_iterator pointing to the end of the reversed container.

                  Complexity: Constant.

                  Throws: Nothing.

                11. -
                  const_reverse_iterator rend() const;
                  +
                  const_reverse_iterator rend() const;

                  Effects: Returns a const_reverse_iterator pointing to the end of the reversed container.

                  Complexity: Constant.

                  Throws: Nothing.

                12. -
                  const_reverse_iterator crend() const;
                  +
                  const_reverse_iterator crend() const;

                  Effects: Returns a const_reverse_iterator pointing to the end of the reversed container.

                  Complexity: Constant.

                  Throws: Nothing.

                13. -
                  iterator root();
                  +
                  iterator root();

                  Effects: Returns a iterator pointing to the root node of the container or end() if not present.

                  Complexity: Constant.

                  Throws: Nothing.

                14. -
                  const_iterator root() const;
                  +
                  const_iterator root() const;

                  Effects: Returns a const_iterator pointing to the root node of the container or cend() if not present.

                  Complexity: Constant.

                  Throws: Nothing.

                15. -
                  const_iterator croot() const;
                  +
                  const_iterator croot() const;

                  Effects: Returns a const_iterator pointing to the root node of the container or cend() if not present.

                  Complexity: Constant.

                  Throws: Nothing.

                16. -
                  key_compare key_comp() const;
                  +
                  key_compare key_comp() const;

                  Effects: Returns the key_compare object used by the container.

                  Complexity: Constant.

                  Throws: If key_compare copy-constructor throws.

                17. -
                  value_compare value_comp() const;
                  +
                  value_compare value_comp() const;

                  Effects: Returns the value_compare object used by the container.

                  Complexity: Constant.

                  Throws: If value_compare copy-constructor throws.

                18. -
                  bool empty() const;
                  +
                  bool empty() const;

                  Effects: Returns true if the container is empty.

                  Complexity: Constant.

                  Throws: Nothing.

                19. -
                  size_type size() const;
                  +
                  size_type size() const;

                  Effects: Returns the number of elements stored in the container.

                  Complexity: Linear to elements contained in *this if constant-time size option is disabled. Constant time otherwise.

                  Throws: Nothing.

                20. -
                  void swap(bstree & other);
                  +
                  void swap(bstree & other);

                  Effects: Swaps the contents of two containers.

                  Complexity: Constant.

                  Throws: If the comparison functor's swap call throws. 

                21. template<typename Cloner, typename Disposer> 
-  void clone_from(const bstree & src, Cloner cloner, Disposer disposer);
                  + void clone_from(const bstree & src, Cloner cloner, Disposer disposer);

                  Requires: Disposer::operator()(pointer) shouldn't throw. Cloner should yield to nodes equivalent to the original nodes.

                  Effects: Erases all the elements from *this calling Disposer::operator()(pointer), clones all the elements from src calling Cloner::operator()(const_reference ) and inserts them on *this. Copies the predicate from the source container.

                  If cloner throws, all cloned elements are unlinked and disposed calling Disposer::operator()(pointer).

                  @@ -391,7 +391,7 @@ 
                22. template<typename Cloner, typename Disposer> 
-  void clone_from(bstree && src, Cloner cloner, Disposer disposer);
                  + void clone_from(bstree && src, Cloner cloner, Disposer disposer);

                  Requires: Disposer::operator()(pointer) shouldn't throw. Cloner should yield to nodes equivalent to the original nodes.

                  Effects: Erases all the elements from *this calling Disposer::operator()(pointer), clones all the elements from src calling Cloner::operator()(reference) and inserts them on *this. Copies the predicate from the source container.

                  If cloner throws, all cloned elements are unlinked and disposed calling Disposer::operator()(pointer).

                  @@ -400,7 +400,7 @@

                  Note: This version can modify the source container, useful to implement move semantics.

                23. -
                  iterator insert_equal(reference value);
                  +
                  iterator insert_equal(reference value);

                  Requires: value must be an lvalue

                  Effects: Inserts value into the container before the upper bound.

                  Complexity: Average complexity for insert element is at most logarithmic.

                  @@ -408,7 +408,7 @@

                  Note: Does not affect the validity of iterators and references. No copy-constructors are called.

                24. -
                  iterator insert_equal(const_iterator hint, reference value);
                  +
                  iterator insert_equal(const_iterator hint, reference value);

                  Requires: value must be an lvalue, and "hint" must be a valid iterator.

                  Effects: Inserts x into the container, using "hint" as a hint to where it will be inserted. If "hint" is the upper_bound the insertion takes constant time (two comparisons in the worst case)

                  Complexity: Logarithmic in general, but it is amortized constant time if t is inserted immediately before hint.

                  @@ -416,7 +416,7 @@

                  Note: Does not affect the validity of iterators and references. No copy-constructors are called.

                25. -
                  template<typename Iterator> void insert_equal(Iterator b, Iterator e);
                  +
                  template<typename Iterator> void insert_equal(Iterator b, Iterator e);

                  Requires: Dereferencing iterator must yield an lvalue of type value_type.

                  Effects: Inserts a each element of a range into the container before the upper bound of the key of each element.

                  Complexity: Insert range is in general O(N * log(N)), where N is the size of the range. However, it is linear in N if the range is already sorted by value_comp().

                  @@ -424,7 +424,7 @@

                  Note: Does not affect the validity of iterators and references. No copy-constructors are called.

                26. -
                  std::pair< iterator, bool > insert_unique(reference value);
                  +
                  std::pair< iterator, bool > insert_unique(reference value);

                  Requires: value must be an lvalue

                  Effects: Inserts value into the container if the value is not already present.

                  Complexity: Average complexity for insert element is at most logarithmic.

                  @@ -432,7 +432,7 @@

                  Note: Does not affect the validity of iterators and references. No copy-constructors are called.

                27. -
                  iterator insert_unique(const_iterator hint, reference value);
                  +
                  iterator insert_unique(const_iterator hint, reference value);

                  Requires: value must be an lvalue, and "hint" must be a valid iterator

                  Effects: Tries to insert x into the container, using "hint" as a hint to where it will be inserted.

                  Complexity: Logarithmic in general, but it is amortized constant time (two comparisons in the worst case) if t is inserted immediately before hint.

                  @@ -440,7 +440,7 @@

                  Note: Does not affect the validity of iterators and references. No copy-constructors are called.

                28. -
                  template<typename Iterator> void insert_unique(Iterator b, Iterator e);
                  +
                  template<typename Iterator> void insert_unique(Iterator b, Iterator e);

                  Requires: Dereferencing iterator must yield an lvalue of type value_type.

                  Effects: Tries to insert each element of a range into the container.

                  Complexity: Insert range is in general O(N * log(N)), where N is the size of the range. However, it is linear in N if the range is already sorted by value_comp().

                  @@ -449,7 +449,7 @@ 
                29. std::pair< iterator, bool > 
-insert_unique_check(const key_type & key, insert_commit_data & commit_data);
                  +insert_unique_check(const key_type & key, insert_commit_data & commit_data);

                  Effects: Checks if a value can be inserted in the container, using a user provided key instead of the value itself.

                  Returns: If there is an equivalent value returns a pair containing an iterator to the already present value and false. If the value can be inserted returns true in the returned pair boolean and fills "commit_data" that is meant to be used with the "insert_commit" function.

                  Complexity: Average complexity is at most logarithmic.

                  @@ -457,7 +457,7 @@ 
                30. std::pair< iterator, bool > 
-insert_unique_check(const_iterator hint, const key_type & key, 
+insert_unique_check(const_iterator hint, const key_type & key, 
                     insert_commit_data & commit_data);

                  Effects: Checks if a value can be inserted in the container, using a user provided key instead of the value itself, using "hint" as a hint to where it will be inserted.

                  Returns: If there is an equivalent value returns a pair containing an iterator to the already present value and false. If the value can be inserted returns true in the returned pair boolean and fills "commit_data" that is meant to be used with the "insert_commit" function.

                  @@ -467,7 +467,7 @@ 
                31. template<typename KeyType, typename KeyTypeKeyCompare> 
   std::pair< iterator, bool > 
-  insert_unique_check(const KeyType & key, KeyTypeKeyCompare comp, 
+  insert_unique_check(const KeyType & key, KeyTypeKeyCompare comp, 
                       insert_commit_data & commit_data);

                  Requires: comp must be a comparison function that induces the same strict weak ordering as key_compare. The difference is that comp compares an arbitrary key with the contained values.

                  Effects: Checks if a value can be inserted in the container, using a user provided key instead of the value itself.

                  @@ -481,7 +481,7 @@ 
                32. template<typename KeyType, typename KeyTypeKeyCompare> 
   std::pair< iterator, bool > 
-  insert_unique_check(const_iterator hint, const KeyType & key, 
+  insert_unique_check(const_iterator hint, const KeyType & key, 
                       KeyTypeKeyCompare comp, 
                       insert_commit_data & commit_data);

                  Requires: comp must be a comparison function that induces the same strict weak ordering as key_compare. The difference is that comp compares an arbitrary key with the contained values.

                  @@ -494,7 +494,7 @@

                  "commit_data" remains valid for a subsequent "insert_commit" only if no more objects are inserted or erased from the container.

                33. -
                  iterator insert_unique_commit(reference value, 
+
                  iterator insert_unique_commit(reference value, 
                               const insert_commit_data & commit_data);
                  
 
                  Requires: value must be an lvalue of type value_type. commit_data must have been obtained from a previous call to "insert_check". No objects should have been inserted or erased from the container between the "insert_check" that filled "commit_data" and the call to "insert_commit".
                  
 
                  Effects: Inserts the value in the container using the information obtained from the "commit_data" that a previous "insert_check" filled.
                  
@@ -504,7 +504,7 @@
 
                  Notes: This function has only sense if a "insert_check" has been previously executed to fill "commit_data". No value should be inserted or erased between the "insert_check" and "insert_commit" calls.
                34. -
                  iterator insert_before(const_iterator pos, reference value);
                  +
                  iterator insert_before(const_iterator pos, reference value);

                  Requires: value must be an lvalue, "pos" must be a valid iterator (or end) and must be the succesor of value once inserted according to the predicate

                  Effects: Inserts x into the container before "pos".

                  Complexity: Constant time.

                  @@ -512,7 +512,7 @@

                  Note: This function does not check preconditions so if "pos" is not the successor of "value" container ordering invariant will be broken. This is a low-level function to be used only for performance reasons by advanced users.

                35. -
                  void push_back(reference value);
                  +
                  void push_back(reference value);

                  Requires: value must be an lvalue, and it must be no less than the greatest inserted key

                  Effects: Inserts x into the container in the last position.

                  Complexity: Constant time.

                  @@ -520,7 +520,7 @@

                  Note: This function does not check preconditions so if value is less than the greatest inserted key container ordering invariant will be broken. This function is slightly more efficient than using "insert_before". This is a low-level function to be used only for performance reasons by advanced users.

                36. -
                  void push_front(reference value);
                  +
                  void push_front(reference value);

                  Requires: value must be an lvalue, and it must be no greater than the minimum inserted key

                  Effects: Inserts x into the container in the first position.

                  Complexity: Constant time.

                  @@ -528,21 +528,21 @@

                  Note: This function does not check preconditions so if value is greater than the minimum inserted key container ordering invariant will be broken. This function is slightly more efficient than using "insert_before". This is a low-level function to be used only for performance reasons by advanced users.

                37. -
                  iterator erase(const_iterator i);
                  +
                  iterator erase(const_iterator i);

                  Effects: Erases the element pointed to by i.

                  Complexity: Average complexity for erase element is constant time.

                  Throws: Nothing.

                  Note: Invalidates the iterators (but not the references) to the erased elements. No destructors are called.

                38. -
                  iterator erase(const_iterator b, const_iterator e);
                  +
                  iterator erase(const_iterator b, const_iterator e);

                  Effects: Erases the range pointed to by b end e.

                  Complexity: Average complexity for erase range is at most O(log(size() + N)), where N is the number of elements in the range.

                  Throws: Nothing.

                  Note: Invalidates the iterators (but not the references) to the erased elements. No destructors are called.

                39. -
                  size_type erase(const key_type & key);
                  +
                  size_type erase(const key_type & key);

                  Effects: Erases all the elements with the given value.

                  Returns: The number of erased elements.

                  Complexity: O(log(size() + N).

                  @@ -551,7 +551,7 @@ 
                40. template<typename KeyType, typename KeyTypeKeyCompare> 
-  size_type erase(const KeyType & key, KeyTypeKeyCompare comp);
                  + size_type erase(const KeyType & key, KeyTypeKeyCompare comp);

                  Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk), with nk the key_type of a value_type inserted into *this.

                  Effects: Erases all the elements with the given key. according to the comparison functor "comp".

                  Returns: The number of erased elements.

                  @@ -561,7 +561,7 @@ 
                41. template<typename Disposer> 
-  iterator erase_and_dispose(const_iterator i, Disposer disposer);
                  + iterator erase_and_dispose(const_iterator i, Disposer disposer);

                  Requires: Disposer::operator()(pointer) shouldn't throw.

                  Effects: Erases the element pointed to by i. Disposer::operator()(pointer) is called for the removed element.

                  Complexity: Average complexity for erase element is constant time.

                  @@ -570,7 +570,7 @@ 
                42. template<typename Disposer> 
-  size_type erase_and_dispose(const key_type & key, Disposer disposer);
                  + size_type erase_and_dispose(const key_type & key, Disposer disposer);

                  Requires: Disposer::operator()(pointer) shouldn't throw.

                  Effects: Erases all the elements with the given value. Disposer::operator()(pointer) is called for the removed elements.

                  Returns: The number of erased elements.

                  @@ -580,7 +580,7 @@ 
                43. template<typename Disposer> 
-  iterator erase_and_dispose(const_iterator b, const_iterator e, 
+  iterator erase_and_dispose(const_iterator b, const_iterator e, 
                              Disposer disposer);

                  Requires: Disposer::operator()(pointer) shouldn't throw.

                  Effects: Erases the range pointed to by b end e. Disposer::operator()(pointer) is called for the removed elements.

                  @@ -590,7 +590,7 @@ 
                44. template<typename KeyType, typename KeyTypeKeyCompare, typename Disposer> 
-  size_type erase_and_dispose(const KeyType & key, KeyTypeKeyCompare comp, 
+  size_type erase_and_dispose(const KeyType & key, KeyTypeKeyCompare comp, 
                               Disposer disposer);

                  Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk) and nk the key_type of a value_type inserted into *this.

                  Requires: Disposer::operator()(pointer) shouldn't throw.

                  @@ -601,47 +601,47 @@

                  Note: Invalidates the iterators to the erased elements.

                45. -
                  void clear();
                  +
                  void clear();

                  Effects: Erases all of the elements.

                  Complexity: Linear to the number of elements on the container. if it's a safe-mode or auto-unlink value_type. Constant time otherwise.

                  Throws: Nothing.

                  Note: Invalidates the iterators (but not the references) to the erased elements. No destructors are called.

                46. -
                  template<typename Disposer> void clear_and_dispose(Disposer disposer);
                  +
                  template<typename Disposer> void clear_and_dispose(Disposer disposer);

                  Effects: Erases all of the elements calling disposer(p) for each node to be erased. Complexity: Average complexity for is at most O(log(size() + N)), where N is the number of elements in the container.

                  Throws: Nothing.

                  Note: Invalidates the iterators (but not the references) to the erased elements. Calls N times to disposer functor.

                47. -
                  size_type count(const key_type & key) const;
                  +
                  size_type count(const key_type & key) const;

                  Effects: Returns the number of contained elements with the given value

                  Complexity: Logarithmic to the number of elements contained plus lineal to number of objects with the given value.

                  Throws: If key_compare throws. 

                48. template<typename KeyType, typename KeyTypeKeyCompare> 
-  size_type count(const KeyType & key, KeyTypeKeyCompare comp) const;
                  + size_type count(const KeyType & key, KeyTypeKeyCompare comp) const;

                  Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk), and nk the key_type of a value_type inserted into *this.

                  Effects: Returns the number of contained elements with the given key

                  Complexity: Logarithmic to the number of elements contained plus lineal to number of objects with the given key.

                  Throws: If comp throws.

                49. -
                  iterator lower_bound(const key_type & key);
                  +
                  iterator lower_bound(const key_type & key);

                  Effects: Returns an iterator to the first element whose key is not less than k or end() if that element does not exist.

                  Complexity: Logarithmic.

                  Throws: If key_compare throws.

                50. -
                  const_iterator lower_bound(const key_type & key) const;
                  +
                  const_iterator lower_bound(const key_type & key) const;

                  Effects: Returns an iterator to the first element whose key is not less than k or end() if that element does not exist.

                  Complexity: Logarithmic.

                  Throws: If key_compare throws. 

                51. template<typename KeyType, typename KeyTypeKeyCompare> 
-  iterator lower_bound(const KeyType & key, KeyTypeKeyCompare comp);
                  + iterator lower_bound(const KeyType & key, KeyTypeKeyCompare comp);

                  Effects: Returns an iterator to the first element whose key is not less than k or end() if that element does not exist.

                  Complexity: Logarithmic.

                  Throws: If key_compare throws.

                  @@ -649,27 +649,27 @@ 
                52. template<typename KeyType, typename KeyTypeKeyCompare> 
   const_iterator 
-  lower_bound(const KeyType & key, KeyTypeKeyCompare comp) const;
                  + lower_bound(const KeyType & key, KeyTypeKeyCompare comp) const;

                  Effects: Returns an iterator to the first element whose key is not less than k or end() if that element does not exist.

                  Complexity: Logarithmic.

                  Throws: If key_compare throws.

                53. -
                  iterator upper_bound(const key_type & key);
                  +
                  iterator upper_bound(const key_type & key);

                  Effects: Returns an iterator to the first element whose key is greater than k or end() if that element does not exist.

                  Complexity: Logarithmic.

                  Throws: If key_compare throws. 

                54. template<typename KeyType, typename KeyTypeKeyCompare> 
-  iterator upper_bound(const KeyType & key, KeyTypeKeyCompare comp);
                  + iterator upper_bound(const KeyType & key, KeyTypeKeyCompare comp);

                  Requires: key is a value such that *this is partitioned with respect to !comp(key, nk), with nk the key_type of a value_type inserted into *this.

                  Effects: Returns an iterator to the first element whose key is greater than k according to comp or end() if that element does not exist.

                  Complexity: Logarithmic.

                  Throws: If comp throws.

                55. -
                  const_iterator upper_bound(const key_type & key) const;
                  +
                  const_iterator upper_bound(const key_type & key) const;

                  Effects: Returns an iterator to the first element whose key is greater than k or end() if that element does not exist.

                  Complexity: Logarithmic.

                  Throws: If key_compare throws.

                  @@ -677,42 +677,42 @@ 
                56. template<typename KeyType, typename KeyTypeKeyCompare> 
   const_iterator 
-  upper_bound(const KeyType & key, KeyTypeKeyCompare comp) const;
                  + upper_bound(const KeyType & key, KeyTypeKeyCompare comp) const;

                  Requires: key is a value such that *this is partitioned with respect to !comp(key, nk), with nk the key_type of a value_type inserted into *this.

                  Effects: Returns an iterator to the first element whose key is greater than k according to comp or end() if that element does not exist.

                  Complexity: Logarithmic.

                  Throws: If comp throws.

                57. -
                  iterator find(const key_type & key);
                  +
                  iterator find(const key_type & key);

                  Effects: Finds an iterator to the first element whose key is k or end() if that element does not exist.

                  Complexity: Logarithmic.

                  Throws: If key_compare throws. 

                58. template<typename KeyType, typename KeyTypeKeyCompare> 
-  iterator find(const KeyType & key, KeyTypeKeyCompare comp);
                  + iterator find(const KeyType & key, KeyTypeKeyCompare comp);

                  Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk), and nk the key_type of a value_type inserted into *this.

                  Effects: Finds an iterator to the first element whose key is k or end() if that element does not exist.

                  Complexity: Logarithmic.

                  Throws: If comp throws.

                59. -
                  const_iterator find(const key_type & key) const;
                  +
                  const_iterator find(const key_type & key) const;

                  Effects: Finds an iterator to the first element whose key is k or end() if that element does not exist.

                  Complexity: Logarithmic.

                  Throws: If key_compare throws. 

                60. template<typename KeyType, typename KeyTypeKeyCompare> 
-  const_iterator find(const KeyType & key, KeyTypeKeyCompare comp) const;
                  + const_iterator find(const KeyType & key, KeyTypeKeyCompare comp) const;

                  Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk), and nk the key_type of a value_type inserted into *this.

                  Effects: Finds an iterator to the first element whose key is k or end() if that element does not exist.

                  Complexity: Logarithmic.

                  Throws: If comp throws.

                61. -
                  std::pair< iterator, iterator > equal_range(const key_type & key);
                  +
                  std::pair< iterator, iterator > equal_range(const key_type & key);

                  Effects: Finds a range containing all elements whose key is k or an empty range that indicates the position where those elements would be if they there is no elements with key k.

                  Complexity: Logarithmic.

                  Throws: If key_compare throws.

                  @@ -720,7 +720,7 @@ 
                62. template<typename KeyType, typename KeyTypeKeyCompare> 
   std::pair< iterator, iterator > 
-  equal_range(const KeyType & key, KeyTypeKeyCompare comp);
                  + equal_range(const KeyType & key, KeyTypeKeyCompare comp);

                  Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk), with nk the key_type of a value_type inserted into *this.

                  Effects: Finds a range containing all elements whose key is k or an empty range that indicates the position where those elements would be if they there is no elements with key k.

                  Complexity: Logarithmic.

                  @@ -728,7 +728,7 @@ 
                63. std::pair< const_iterator, const_iterator > 
-equal_range(const key_type & key) const;
                  +equal_range(const key_type & key) const;

                  Effects: Finds a range containing all elements whose key is k or an empty range that indicates the position where those elements would be if they there is no elements with key k.

                  Complexity: Logarithmic.

                  Throws: If key_compare throws.

                  @@ -736,7 +736,7 @@ 
                64. template<typename KeyType, typename KeyTypeKeyCompare> 
   std::pair< const_iterator, const_iterator > 
-  equal_range(const KeyType & key, KeyTypeKeyCompare comp) const;
                  + equal_range(const KeyType & key, KeyTypeKeyCompare comp) const;

                  Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk), with nk the key_type of a value_type inserted into *this.

                  Effects: Finds a range containing all elements whose key is k or an empty range that indicates the position where those elements would be if they there is no elements with key k.

                  Complexity: Logarithmic.

                  @@ -744,7 +744,7 @@ 
                65. std::pair< iterator, iterator > 
-bounded_range(const key_type & lower_key, const key_type & upper_value, 
+bounded_range(const key_type & lower_key, const key_type & upper_value, 
               bool left_closed, bool right_closed);

                  Requires: upper_key shall not precede lower_key according to key_compare. [key_comp()(upper_key, lower_key) shall be false]

                  If lower_key is equivalent to upper_key [!key_comp()(upper_key, lower_key) && !key_comp()(lower_key, upper_key)] then ('left_closed' || 'right_closed') must be false.

                  @@ -759,7 +759,7 @@ 
                66. template<typename KeyType, typename KeyTypeKeyCompare> 
   std::pair< iterator, iterator > 
-  bounded_range(const KeyType & lower_key, const KeyType & upper_key, 
+  bounded_range(const KeyType & lower_key, const KeyType & upper_key, 
                 KeyTypeKeyCompare comp, bool left_closed, bool right_closed);

                  Requires: lower_key is a value such that *this is partitioned with respect to comp(nk, lower_key) if left_closed is true, with respect to !comp(lower_key, nk) otherwise.

                  upper_key is a value such that *this is partitioned with respect to !comp(upper_key, nk) if right_closed is true, with respect to comp(nk, upper_key) otherwise.

                  @@ -775,7 +775,7 @@ 
                67. std::pair< const_iterator, const_iterator > 
-bounded_range(const key_type & lower_key, const key_type & upper_key, 
+bounded_range(const key_type & lower_key, const key_type & upper_key, 
               bool left_closed, bool right_closed) const;

                  Requires: upper_key shall not precede lower_key according to key_compare. [key_comp()(upper_key, lower_key) shall be false]

                  If lower_key is equivalent to upper_key [!key_comp()(upper_key, lower_key) && !key_comp()(lower_key, upper_key)] then ('left_closed' || 'right_closed') must be false.

                  @@ -790,7 +790,7 @@ 
                68. template<typename KeyType, typename KeyTypeKeyCompare> 
   std::pair< const_iterator, const_iterator > 
-  bounded_range(const KeyType & lower_key, const KeyType & upper_key, 
+  bounded_range(const KeyType & lower_key, const KeyType & upper_key, 
                 KeyTypeKeyCompare comp, bool left_closed, bool right_closed) const;

                  Requires: lower_key is a value such that *this is partitioned with respect to comp(nk, lower_key) if left_closed is true, with respect to !comp(lower_key, nk) otherwise.

                  upper_key is a value such that *this is partitioned with respect to !comp(upper_key, nk) if right_closed is true, with respect to comp(nk, upper_key) otherwise.

                  @@ -805,28 +805,28 @@

                  Note: Experimental function, the interface might change in future releases.

                69. -
                  iterator iterator_to(reference value);
                  +
                  iterator iterator_to(reference value);

                  Requires: value must be an lvalue and shall be in a set of appropriate type. Otherwise the behavior is undefined.

                  Effects: Returns: a valid iterator i belonging to the set that points to the value

                  Complexity: Constant.

                  Throws: Nothing.

                70. -
                  const_iterator iterator_to(const_reference value) const;
                  +
                  const_iterator iterator_to(const_reference value) const;

                  Requires: value must be an lvalue and shall be in a set of appropriate type. Otherwise the behavior is undefined.

                  Effects: Returns: a valid const_iterator i belonging to the set that points to the value

                  Complexity: Constant.

                  Throws: Nothing.

                71. -
                  pointer unlink_leftmost_without_rebalance();
                  +
                  pointer unlink_leftmost_without_rebalance();

                  Effects: Unlinks the leftmost node from the container.

                  Complexity: Average complexity is constant time.

                  Throws: Nothing.

                  Notes: This function breaks the container and the container can only be used for more unlink_leftmost_without_rebalance calls. This function is normally used to achieve a step by step controlled destruction of the container.

                72. -
                  void replace_node(iterator replace_this, reference with_this);
                  +
                  void replace_node(iterator replace_this, reference with_this);

                  Requires: replace_this must be a valid iterator of *this and with_this must not be inserted in any container.

                  Effects: Replaces replace_this in its position in the container with with_this. The container does not need to be rebalanced.

                  Complexity: Constant.

                  @@ -834,13 +834,13 @@

                  Note: This function will break container ordering invariants if with_this is not equivalent to *replace_this according to the ordering rules. This function is faster than erasing and inserting the node, since no rebalancing or comparison is needed.

                73. -
                  void rebalance();
                  +
                  void rebalance();

                  Effects: Rebalances the tree.

                  Throws: Nothing.

                  Complexity: Linear.

                74. -
                  iterator rebalance_subtree(iterator root);
                  +
                  iterator rebalance_subtree(iterator root);

                  Requires: old_root is a node of a tree.

                  Effects: Rebalances the subtree rooted at old_root.

                  Returns: The new root of the subtree.

                  @@ -849,32 +849,32 @@ 
                75. template<typename T, class... Options2> 
-  void merge_unique(bstree< T, Options2...> &);
                  + void merge_unique(bstree< T, Options2...> &);

                  Requires: "source" container's Options can only can differ in the comparison function from *this.

                  Effects: Attempts to extract each element in source and insert it into a using the comparison object of *this. If there is an element in a with key equivalent to the key of an element from source, then that element is not extracted from source.

                  Postcondition: Pointers and references to the transferred elements of source refer to those same elements but as members of *this. Iterators referring to the transferred elements will continue to refer to their elements, but they now behave as iterators into *this, not into source.

                  Throws: Nothing unless the comparison object throws.

                  Complexity: N log(a.size() + N) (N has the value source.size())

                  76. -
                76.  while(it! = itend);
                  77. +
                77.  while(it! = itend);
                78. template<typename T, class... Options2> 
-  void merge_equal(bstree< T, Options2...> &);
                  + void merge_equal(bstree< T, Options2...> &);

                  Requires: "source" container's Options can only can differ in the comparison function from *this.

                  Effects: Extracts each element in source and insert it into a using the comparison object of *this.

                  Postcondition: Pointers and references to the transferred elements of source refer to those same elements but as members of *this. Iterators referring to the transferred elements will continue to refer to their elements, but they now behave as iterators into *this, not into source.

                  Throws: Nothing unless the comparison object throws.

                  Complexity: N log(a.size() + N) (N has the value source.size())

                  79. -
                79.  while(it! = itend);
                  80. +
                80.  while(it! = itend);
                81. -
                  template<typename ExtraChecker> void check(ExtraChecker extra_checker) const;
                  +
                  template<typename ExtraChecker> void check(ExtraChecker extra_checker) const;

                  Effects: Asserts the integrity of the container with additional checks provided by the user.

                  Complexity: Linear time.

                  Note: The method might not have effect when asserts are turned off (e.g., with NDEBUG). Experimental function, interface might change in future versions.

                82. -
                  void check() const;
                  +
                  void check() const;

                  Effects: Asserts the integrity of the container.

                  Complexity: Linear time.

                  Note: The method has no effect when asserts are turned off (e.g., with NDEBUG). Experimental function, interface might change in future versions.

                  @@ -883,38 +883,38 @@

                -bstree public static functions

                +bstree public static functions
                1. -
                  static bstree & container_from_end_iterator(iterator end_iterator);
                  +
                  static bstree & container_from_end_iterator(iterator end_iterator);

                  Precondition: end_iterator must be a valid end iterator of the container.

                  Effects: Returns a const reference to the container associated to the end iterator

                  Throws: Nothing.

                  Complexity: Constant.

                2. -
                  static const bstree & container_from_end_iterator(const_iterator end_iterator);
                  +
                  static const bstree & container_from_end_iterator(const_iterator end_iterator);

                  Precondition: end_iterator must be a valid end const_iterator of the container.

                  Effects: Returns a const reference to the container associated to the iterator

                  Throws: Nothing.

                  Complexity: Constant.

                3. -
                  static bstree & container_from_iterator(iterator it);
                  +
                  static bstree & container_from_iterator(iterator it);

                  Precondition: it must be a valid iterator of the container.

                  Effects: Returns a const reference to the container associated to the iterator

                  Throws: Nothing.

                  Complexity: Logarithmic.

                4. -
                  static const bstree & container_from_iterator(const_iterator it);
                  +
                  static const bstree & container_from_iterator(const_iterator it);

                  Precondition: it must be a valid end const_iterator of container.

                  Effects: Returns a const reference to the container associated to the end iterator

                  Throws: Nothing.

                  Complexity: Logarithmic.

                5. -
                  static iterator s_iterator_to(reference value);
                  +
                  static iterator s_iterator_to(reference value);

                  Requires: value must be an lvalue and shall be in a set of appropriate type. Otherwise the behavior is undefined.

                  Effects: Returns: a valid iterator i belonging to the set that points to the value

                  Complexity: Constant.

                  @@ -922,7 +922,7 @@

                  Note: This static function is available only if the value traits is stateless.

                6. -
                  static const_iterator s_iterator_to(const_reference value);
                  +
                  static const_iterator s_iterator_to(const_reference value);

                  Requires: value must be an lvalue and shall be in a set of appropriate type. Otherwise the behavior is undefined.

                  Effects: Returns: a valid const_iterator i belonging to the set that points to the value

                  Complexity: Constant.

                  @@ -930,7 +930,7 @@

                  Note: This static function is available only if the value traits is stateless.

                7. -
                  static void init_node(reference value);
                  +
                  static void init_node(reference value);

                  Requires: value shall not be in a container.

                  Effects: init_node puts the hook of a value in a well-known default state.

                  Throws: Nothing.

                  @@ -938,7 +938,7 @@

                  Note: This function puts the hook in the well-known default state used by auto_unlink and safe hooks.

                8. -
                  static void remove_node(reference value);
                  +
                  static void remove_node(reference value);

                  Effects: removes "value" from the container.

                  Throws: Nothing.

                  Complexity: Logarithmic time.

                  diff --git a/doc/html/boost/intrusive/bstree_algorithms.html b/doc/html/boost/intrusive/bstree_algorithms.html index 806f2ce852..6a126ab670 100644 --- a/doc/html/boost/intrusive/bstree_algorithms.html +++ b/doc/html/boost/intrusive/bstree_algorithms.html @@ -43,161 +43,161 @@ typedef insert_commit_data_t< node_ptr > insert_commit_data; typedef data_for_rebalance_t< node_ptr > data_for_rebalance; - // public static functions - static node_ptr begin_node(const const_node_ptr &); - static node_ptr end_node(const const_node_ptr &); - static node_ptr root_node(const const_node_ptr &); - static bool unique(const const_node_ptr &); - static node_ptr get_header(const const_node_ptr &); - static void swap_nodes(const node_ptr &, const node_ptr &); - static void swap_nodes(const node_ptr &, const node_ptr &, const node_ptr &, + // public static functions + static node_ptr begin_node(const const_node_ptr &); + static node_ptr end_node(const const_node_ptr &); + static node_ptr root_node(const const_node_ptr &); + static bool unique(const const_node_ptr &); + static node_ptr get_header(const const_node_ptr &); + static void swap_nodes(const node_ptr &, const node_ptr &); + static void swap_nodes(const node_ptr &, const node_ptr &, const node_ptr &, const node_ptr &); - static void replace_node(const node_ptr &, const node_ptr &); - static void replace_node(const node_ptr &, const node_ptr &, + static void replace_node(const node_ptr &, const node_ptr &); + static void replace_node(const node_ptr &, const node_ptr &, const node_ptr &); - static node_ptr next_node(const node_ptr &); - static node_ptr prev_node(const node_ptr &); - static node_ptr minimum(node_ptr); - static node_ptr maximum(node_ptr); - static void init(const node_ptr &); - static bool inited(const const_node_ptr &); - static void init_header(const node_ptr &); + static node_ptr next_node(const node_ptr &); + static node_ptr prev_node(const node_ptr &); + static node_ptr minimum(node_ptr); + static node_ptr maximum(node_ptr); + static void init(const node_ptr &); + static bool inited(const const_node_ptr &); + static void init_header(const node_ptr &); template<typename Disposer> - static void clear_and_dispose(const node_ptr &, Disposer); - static node_ptr unlink_leftmost_without_rebalance(const node_ptr &); - static std::size_t size(const const_node_ptr &); - static void swap_tree(const node_ptr &, const node_ptr &); - static bool is_header(const const_node_ptr &); + static void clear_and_dispose(const node_ptr &, Disposer); + static node_ptr unlink_leftmost_without_rebalance(const node_ptr &); + static std::size_t size(const const_node_ptr &); + static void swap_tree(const node_ptr &, const node_ptr &); + static bool is_header(const const_node_ptr &); template<typename KeyType, typename KeyNodePtrCompare> static node_ptr - find(const const_node_ptr &, const KeyType &, KeyNodePtrCompare); + find(const const_node_ptr &, const KeyType &, KeyNodePtrCompare); template<typename KeyType, typename KeyNodePtrCompare> static std::pair< node_ptr, node_ptr > - bounded_range(const const_node_ptr &, const KeyType &, const KeyType &, + bounded_range(const const_node_ptr &, const KeyType &, const KeyType &, KeyNodePtrCompare, bool, bool); template<typename KeyType, typename KeyNodePtrCompare> static std::size_t - count(const const_node_ptr &, const KeyType &, KeyNodePtrCompare); + count(const const_node_ptr &, const KeyType &, KeyNodePtrCompare); template<typename KeyType, typename KeyNodePtrCompare> static std::pair< node_ptr, node_ptr > - equal_range(const const_node_ptr &, const KeyType &, KeyNodePtrCompare); + equal_range(const const_node_ptr &, const KeyType &, KeyNodePtrCompare); template<typename KeyType, typename KeyNodePtrCompare> static std::pair< node_ptr, node_ptr > - lower_bound_range(const const_node_ptr &, const KeyType &, + lower_bound_range(const const_node_ptr &, const KeyType &, KeyNodePtrCompare); template<typename KeyType, typename KeyNodePtrCompare> static node_ptr - lower_bound(const const_node_ptr &, const KeyType &, KeyNodePtrCompare); + lower_bound(const const_node_ptr &, const KeyType &, KeyNodePtrCompare); template<typename KeyType, typename KeyNodePtrCompare> static node_ptr - upper_bound(const const_node_ptr &, const KeyType &, KeyNodePtrCompare); - static void insert_unique_commit(const node_ptr &, const node_ptr &, + upper_bound(const const_node_ptr &, const KeyType &, KeyNodePtrCompare); + static void insert_unique_commit(const node_ptr &, const node_ptr &, const insert_commit_data &); template<typename KeyType, typename KeyNodePtrCompare> static std::pair< node_ptr, bool > - insert_unique_check(const const_node_ptr &, const KeyType &, + insert_unique_check(const const_node_ptr &, const KeyType &, KeyNodePtrCompare, insert_commit_data &); template<typename KeyType, typename KeyNodePtrCompare> static std::pair< node_ptr, bool > - insert_unique_check(const const_node_ptr &, const node_ptr &, + insert_unique_check(const const_node_ptr &, const node_ptr &, const KeyType &, KeyNodePtrCompare, insert_commit_data &); template<typename NodePtrCompare> static node_ptr - insert_equal(const node_ptr &, const node_ptr &, const node_ptr &, + insert_equal(const node_ptr &, const node_ptr &, const node_ptr &, NodePtrCompare); template<typename NodePtrCompare> static node_ptr - insert_equal_upper_bound(const node_ptr &, const node_ptr &, + insert_equal_upper_bound(const node_ptr &, const node_ptr &, NodePtrCompare); template<typename NodePtrCompare> static node_ptr - insert_equal_lower_bound(const node_ptr &, const node_ptr &, + insert_equal_lower_bound(const node_ptr &, const node_ptr &, NodePtrCompare); static node_ptr - insert_before(const node_ptr &, const node_ptr &, const node_ptr &); - static void push_back(const node_ptr &, const node_ptr &); - static void push_front(const node_ptr &, const node_ptr &); - static std::size_t depth(const_node_ptr); + insert_before(const node_ptr &, const node_ptr &, const node_ptr &); + static void push_back(const node_ptr &, const node_ptr &); + static void push_front(const node_ptr &, const node_ptr &); + static std::size_t depth(const_node_ptr); template<typename Cloner, typename Disposer> - static void clone(const const_node_ptr &, const node_ptr &, Cloner, + static void clone(const const_node_ptr &, const node_ptr &, Cloner, Disposer); - static void erase(const node_ptr &, const node_ptr &); + static void erase(const node_ptr &, const node_ptr &); template<typename NodePtrCompare> - static bool transfer_unique(const node_ptr &, NodePtrCompare, + static bool transfer_unique(const node_ptr &, NodePtrCompare, const node_ptr &, const node_ptr &); template<typename NodePtrCompare> - static void transfer_equal(const node_ptr &, NodePtrCompare, + static void transfer_equal(const node_ptr &, NodePtrCompare, const node_ptr &, const node_ptr &); - static void unlink(const node_ptr &); - static void rebalance(const node_ptr &); - static node_ptr rebalance_subtree(const node_ptr &); + static void unlink(const node_ptr &); + static void rebalance(const node_ptr &); + static node_ptr rebalance_subtree(const node_ptr &); template<typename Checker> - static void check(const const_node_ptr &, Checker, + static void check(const const_node_ptr &, Checker, typename Checker::return_type &); - // protected static functions + // protected static functions template<typename NodePtrCompare> - static bool transfer_unique(const node_ptr &, NodePtrCompare, + static bool transfer_unique(const node_ptr &, NodePtrCompare, const node_ptr &, const node_ptr &, data_for_rebalance &); template<typename NodePtrCompare> - static void transfer_equal(const node_ptr &, NodePtrCompare, + static void transfer_equal(const node_ptr &, NodePtrCompare, const node_ptr &, const node_ptr &, data_for_rebalance &); - static void erase(const node_ptr &, const node_ptr &, data_for_rebalance &); - static std::size_t subtree_size(const const_node_ptr &); - static bool is_left_child(const node_ptr &); - static bool is_right_child(const node_ptr &); - static void insert_before_check(const node_ptr &, const node_ptr &, + static void erase(const node_ptr &, const node_ptr &, data_for_rebalance &); + static std::size_t subtree_size(const const_node_ptr &); + static bool is_left_child(const node_ptr &); + static bool is_right_child(const node_ptr &); + static void insert_before_check(const node_ptr &, const node_ptr &, insert_commit_data &); - static void push_back_check(const node_ptr &, insert_commit_data &); - static void push_front_check(const node_ptr &, insert_commit_data &); + static void push_back_check(const node_ptr &, insert_commit_data &); + static void push_front_check(const node_ptr &, insert_commit_data &); template<typename NodePtrCompare> - static void insert_equal_check(const node_ptr &, const node_ptr &, + static void insert_equal_check(const node_ptr &, const node_ptr &, const node_ptr &, NodePtrCompare, insert_commit_data &); template<typename NodePtrCompare> - static void insert_equal_upper_bound_check(const node_ptr &, + static void insert_equal_upper_bound_check(const node_ptr &, const node_ptr &, NodePtrCompare, insert_commit_data &, std::size_t * = 0); template<typename NodePtrCompare> - static void insert_equal_lower_bound_check(const node_ptr &, + static void insert_equal_lower_bound_check(const node_ptr &, const node_ptr &, NodePtrCompare, insert_commit_data &, std::size_t * = 0); - static void insert_commit(const node_ptr &, const node_ptr &, + static void insert_commit(const node_ptr &, const node_ptr &, const insert_commit_data &); - static void set_child(const node_ptr &, const node_ptr &, const node_ptr &, + static void set_child(const node_ptr &, const node_ptr &, const node_ptr &, const bool); - static void rotate_left_no_parent_fix(const node_ptr &, const node_ptr &); - static void rotate_left(const node_ptr &, const node_ptr &, + static void rotate_left_no_parent_fix(const node_ptr &, const node_ptr &); + static void rotate_left(const node_ptr &, const node_ptr &, const node_ptr &, const node_ptr &); - static void rotate_right_no_parent_fix(const node_ptr &, const node_ptr &); - static void rotate_right(const node_ptr &, const node_ptr &, + static void rotate_right_no_parent_fix(const node_ptr &, const node_ptr &); + static void rotate_right(const node_ptr &, const node_ptr &, const node_ptr &, const node_ptr &); - // private static functions - static void subtree_to_vine(node_ptr, std::size_t &); - static void compress_subtree(node_ptr, std::size_t); - static void vine_to_subtree(const node_ptr &, std::size_t); - static node_ptr get_root(const node_ptr &); + // private static functions + static void subtree_to_vine(node_ptr, std::size_t &); + static void compress_subtree(node_ptr, std::size_t); + static void vine_to_subtree(const node_ptr &, std::size_t); + static node_ptr get_root(const node_ptr &); template<typename Cloner, typename Disposer> static node_ptr - clone_subtree(const const_node_ptr &, const node_ptr &, Cloner, Disposer, + clone_subtree(const const_node_ptr &, const node_ptr &, Cloner, Disposer, node_ptr &, node_ptr &); - template<typename Disposer> static void dispose_subtree(node_ptr, Disposer); + template<typename Disposer> static void dispose_subtree(node_ptr, Disposer); template<typename KeyType, typename KeyNodePtrCompare> static node_ptr - lower_bound_loop(node_ptr, node_ptr, const KeyType &, KeyNodePtrCompare); + lower_bound_loop(node_ptr, node_ptr, const KeyType &, KeyNodePtrCompare); template<typename KeyType, typename KeyNodePtrCompare> static node_ptr - upper_bound_loop(node_ptr, node_ptr, const KeyType &, KeyNodePtrCompare); + upper_bound_loop(node_ptr, node_ptr, const KeyType &, KeyNodePtrCompare); template<typename Checker> - static void check_subtree(const const_node_ptr &, Checker, + static void check_subtree(const const_node_ptr &, Checker, typename Checker::return_type &); };
                @@ -285,45 +285,45 @@ header------------------------------>| |

                static void set_right(node_ptr n, node_ptr right);

                -bstree_algorithms public static functions

                +bstree_algorithms public static functions
                1. -
                  static node_ptr begin_node(const const_node_ptr & header);
                  +
                  static node_ptr begin_node(const const_node_ptr & header);

                  Requires: 'header' is the header node of a tree.

                  Effects: Returns the first node of the tree, the header if the tree is empty.

                  Complexity: Constant time.

                  Throws: Nothing.

                2. -
                  static node_ptr end_node(const const_node_ptr & header);
                  +
                  static node_ptr end_node(const const_node_ptr & header);

                  Requires: 'header' is the header node of a tree.

                  Effects: Returns the header of the tree.

                  Complexity: Constant time.

                  Throws: Nothing.

                3. -
                  static node_ptr root_node(const const_node_ptr & header);
                  +
                  static node_ptr root_node(const const_node_ptr & header);

                  Requires: 'header' is the header node of a tree.

                  Effects: Returns the root of the tree if any, header otherwise

                  Complexity: Constant time.

                  Throws: Nothing.

                4. -
                  static bool unique(const const_node_ptr & node);
                  +
                  static bool unique(const const_node_ptr & node);

                  Requires: 'node' is a node of the tree or a node initialized by init(...) or init_node.

                  Effects: Returns true if the node is initialized by init() or init_node().

                  Complexity: Constant time.

                  Throws: Nothing.

                5. -
                  static node_ptr get_header(const const_node_ptr & node);
                  +
                  static node_ptr get_header(const const_node_ptr & node);

                  Requires: 'node' is a node of the tree or a header node.

                  Effects: Returns the header of the tree.

                  Complexity: Logarithmic.

                  Throws: Nothing.

                6. -
                  static void swap_nodes(const node_ptr & node1, const node_ptr & node2);
                  +
                  static void swap_nodes(const node_ptr & node1, const node_ptr & node2);

                  Requires: node1 and node2 can't be header nodes of two trees.

                  Effects: Swaps two nodes. After the function node1 will be inserted in the position node2 before the function. node2 will be inserted in the position node1 had before the function.

                  Complexity: Logarithmic.

                  @@ -332,7 +332,7 @@ header------------------------------>| |

                  Experimental function

                7. -
                  static void swap_nodes(const node_ptr & node1, const node_ptr & header1, 
+
                  static void swap_nodes(const node_ptr & node1, const node_ptr & header1, 
                        const node_ptr & node2, const node_ptr & header2);
                  
 
                  Requires: node1 and node2 can't be header nodes of two trees with header header1 and header2.
                  
 
                  Effects: Swaps two nodes. After the function node1 will be inserted in the position node2 before the function. node2 will be inserted in the position node1 had before the function.
                  
@@ -342,7 +342,7 @@ header------------------------------>|         |
 
                  Experimental function
                8. -
                  static void replace_node(const node_ptr & node_to_be_replaced, 
+
                  static void replace_node(const node_ptr & node_to_be_replaced, 
                          const node_ptr & new_node);
                  
 
                  Requires: node_to_be_replaced must be inserted in a tree and new_node must not be inserted in a tree.
                  
 
                  Effects: Replaces node_to_be_replaced in its position in the tree with new_node. The tree does not need to be rebalanced
                  
@@ -351,7 +351,7 @@ header------------------------------>|         |
 
                  Note: This function will break container ordering invariants if new_node is not equivalent to node_to_be_replaced according to the ordering rules. This function is faster than erasing and inserting the node, since no rebalancing and comparison is needed. Experimental function
                9. -
                  static void replace_node(const node_ptr & node_to_be_replaced, 
+
                  static void replace_node(const node_ptr & node_to_be_replaced, 
                          const node_ptr & header, const node_ptr & new_node);
                  
 
                  Requires: node_to_be_replaced must be inserted in a tree with header "header" and new_node must not be inserted in a tree.
                  
 
                  Effects: Replaces node_to_be_replaced in its position in the tree with new_node. The tree does not need to be rebalanced
                  
@@ -360,35 +360,35 @@ header------------------------------>|         |
 
                  Note: This function will break container ordering invariants if new_node is not equivalent to node_to_be_replaced according to the ordering rules. This function is faster than erasing and inserting the node, since no rebalancing or comparison is needed. Experimental function
                10. -
                  static node_ptr next_node(const node_ptr & node);
                  +
                  static node_ptr next_node(const node_ptr & node);

                  Requires: 'node' is a node from the tree except the header.

                  Effects: Returns the next node of the tree.

                  Complexity: Average constant time.

                  Throws: Nothing.

                11. -
                  static node_ptr prev_node(const node_ptr & node);
                  +
                  static node_ptr prev_node(const node_ptr & node);

                  Requires: 'node' is a node from the tree except the leftmost node.

                  Effects: Returns the previous node of the tree.

                  Complexity: Average constant time.

                  Throws: Nothing.

                12. -
                  static node_ptr minimum(node_ptr node);
                  +
                  static node_ptr minimum(node_ptr node);

                  Requires: 'node' is a node of a tree but not the header.

                  Effects: Returns the minimum node of the subtree starting at p.

                  Complexity: Logarithmic to the size of the subtree.

                  Throws: Nothing.

                13. -
                  static node_ptr maximum(node_ptr node);
                  +
                  static node_ptr maximum(node_ptr node);

                  Requires: 'node' is a node of a tree but not the header.

                  Effects: Returns the maximum node of the subtree starting at p.

                  Complexity: Logarithmic to the size of the subtree.

                  Throws: Nothing.

                14. -
                  static void init(const node_ptr & node);
                  +
                  static void init(const node_ptr & node);

                  Requires: 'node' must not be part of any tree.

                  Effects: After the function unique(node) == true.

                  Complexity: Constant.

                  @@ -396,13 +396,13 @@ header------------------------------>| |

                  Nodes: If node is inserted in a tree, this function corrupts the tree.

                15. -
                  static bool inited(const const_node_ptr & node);
                  +
                  static bool inited(const const_node_ptr & node);

                  Effects: Returns true if node is in the same state as if called init(node)

                  Complexity: Constant.

                  Throws: Nothing.

                16. -
                  static void init_header(const node_ptr & header);
                  +
                  static void init_header(const node_ptr & header);

                  Requires: node must not be part of any tree.

                  Effects: Initializes the header to represent an empty tree. unique(header) == true.

                  Complexity: Constant.

                  @@ -411,14 +411,14 @@ header------------------------------>| | 
                17. template<typename Disposer> 
-  static void clear_and_dispose(const node_ptr & header, Disposer disposer);
                  + static void clear_and_dispose(const node_ptr & header, Disposer disposer);

                  Requires: "disposer" must be an object function taking a node_ptr parameter and shouldn't throw.

                  Effects: Empties the target tree calling void disposer::operator()(const node_ptr &) for every node of the tree except the header.

                  Complexity: Linear to the number of element of the source tree plus the. number of elements of tree target tree when calling this function.

                  Throws: If cloner functor throws. If this happens target nodes are disposed.

                18. -
                  static node_ptr unlink_leftmost_without_rebalance(const node_ptr & header);
                  +
                  static node_ptr unlink_leftmost_without_rebalance(const node_ptr & header);

                  Requires: header is the header of a tree.

                  Effects: Unlinks the leftmost node from the tree, and updates the header link to the new leftmost node.

                  Complexity: Average complexity is constant time.

                  @@ -426,21 +426,21 @@ header------------------------------>| |

                  Notes: This function breaks the tree and the tree can only be used for more unlink_leftmost_without_rebalance calls. This function is normally used to achieve a step by step controlled destruction of the tree.

                19. -
                  static std::size_t size(const const_node_ptr & header);
                  +
                  static std::size_t size(const const_node_ptr & header);

                  Requires: node is a node of the tree but it's not the header.

                  Effects: Returns the number of nodes of the subtree.

                  Complexity: Linear time.

                  Throws: Nothing.

                20. -
                  static void swap_tree(const node_ptr & header1, const node_ptr & header2);
                  +
                  static void swap_tree(const node_ptr & header1, const node_ptr & header2);

                  Requires: header1 and header2 must be the header nodes of two trees.

                  Effects: Swaps two trees. After the function header1 will contain links to the second tree and header2 will have links to the first tree.

                  Complexity: Constant.

                  Throws: Nothing.

                21. -
                  static bool is_header(const const_node_ptr & p);
                  +
                  static bool is_header(const const_node_ptr & p);

                  Requires: p is a node of a tree.

                  Effects: Returns true if p is the header of the tree.

                  Complexity: Constant.

                  @@ -449,7 +449,7 @@ header------------------------------>| | 
                22. template<typename KeyType, typename KeyNodePtrCompare> 
   static node_ptr 
-  find(const const_node_ptr & header, const KeyType & key, 
+  find(const const_node_ptr & header, const KeyType & key, 
        KeyNodePtrCompare comp);

                  Requires: "header" must be the header node of a tree. KeyNodePtrCompare is a function object that induces a strict weak ordering compatible with the strict weak ordering used to create the the tree. KeyNodePtrCompare can compare KeyType with tree's node_ptrs.

                  Effects: Returns a node_ptr to the first element that is equivalent to "key" according to "comp" or "header" if that element does not exist.

                  @@ -459,7 +459,7 @@ header------------------------------>| | 
                23. template<typename KeyType, typename KeyNodePtrCompare> 
   static std::pair< node_ptr, node_ptr > 
-  bounded_range(const const_node_ptr & header, const KeyType & lower_key, 
+  bounded_range(const const_node_ptr & header, const KeyType & lower_key, 
                 const KeyType & upper_key, KeyNodePtrCompare comp, 
                 bool left_closed, bool right_closed);

                  Requires: "header" must be the header node of a tree. KeyNodePtrCompare is a function object that induces a strict weak ordering compatible with the strict weak ordering used to create the the tree. KeyNodePtrCompare can compare KeyType with tree's node_ptrs. 'lower_key' must not be greater than 'upper_key' according to 'comp'. If 'lower_key' == 'upper_key', ('left_closed' || 'right_closed') must be true.

                  @@ -474,7 +474,7 @@ header------------------------------>| | 
                24. template<typename KeyType, typename KeyNodePtrCompare> 
   static std::size_t 
-  count(const const_node_ptr & header, const KeyType & key, 
+  count(const const_node_ptr & header, const KeyType & key, 
         KeyNodePtrCompare comp);

                  Requires: "header" must be the header node of a tree. KeyNodePtrCompare is a function object that induces a strict weak ordering compatible with the strict weak ordering used to create the the tree. KeyNodePtrCompare can compare KeyType with tree's node_ptrs.

                  Effects: Returns the number of elements with a key equivalent to "key" according to "comp".

                  @@ -484,7 +484,7 @@ header------------------------------>| | 
                25. template<typename KeyType, typename KeyNodePtrCompare> 
   static std::pair< node_ptr, node_ptr > 
-  equal_range(const const_node_ptr & header, const KeyType & key, 
+  equal_range(const const_node_ptr & header, const KeyType & key, 
               KeyNodePtrCompare comp);

                  Requires: "header" must be the header node of a tree. KeyNodePtrCompare is a function object that induces a strict weak ordering compatible with the strict weak ordering used to create the the tree. KeyNodePtrCompare can compare KeyType with tree's node_ptrs.

                  Effects: Returns an a pair of node_ptr delimiting a range containing all elements that are equivalent to "key" according to "comp" or an empty range that indicates the position where those elements would be if there are no equivalent elements.

                  @@ -494,7 +494,7 @@ header------------------------------>| | 
                26. template<typename KeyType, typename KeyNodePtrCompare> 
   static std::pair< node_ptr, node_ptr > 
-  lower_bound_range(const const_node_ptr & header, const KeyType & key, 
+  lower_bound_range(const const_node_ptr & header, const KeyType & key, 
                     KeyNodePtrCompare comp);

                  Requires: "header" must be the header node of a tree. KeyNodePtrCompare is a function object that induces a strict weak ordering compatible with the strict weak ordering used to create the the tree. KeyNodePtrCompare can compare KeyType with tree's node_ptrs.

                  Effects: Returns an a pair of node_ptr delimiting a range containing the first element that is equivalent to "key" according to "comp" or an empty range that indicates the position where that element would be if there are no equivalent elements.

                  @@ -504,7 +504,7 @@ header------------------------------>| | 
                27. template<typename KeyType, typename KeyNodePtrCompare> 
   static node_ptr 
-  lower_bound(const const_node_ptr & header, const KeyType & key, 
+  lower_bound(const const_node_ptr & header, const KeyType & key, 
               KeyNodePtrCompare comp);

                  Requires: "header" must be the header node of a tree. KeyNodePtrCompare is a function object that induces a strict weak ordering compatible with the strict weak ordering used to create the the tree. KeyNodePtrCompare can compare KeyType with tree's node_ptrs.

                  Effects: Returns a node_ptr to the first element that is not less than "key" according to "comp" or "header" if that element does not exist.

                  @@ -514,7 +514,7 @@ header------------------------------>| | 
                28. template<typename KeyType, typename KeyNodePtrCompare> 
   static node_ptr 
-  upper_bound(const const_node_ptr & header, const KeyType & key, 
+  upper_bound(const const_node_ptr & header, const KeyType & key, 
               KeyNodePtrCompare comp);

                  Requires: "header" must be the header node of a tree. KeyNodePtrCompare is a function object that induces a strict weak ordering compatible with the strict weak ordering used to create the the tree. KeyNodePtrCompare can compare KeyType with tree's node_ptrs.

                  Effects: Returns a node_ptr to the first element that is greater than "key" according to "comp" or "header" if that element does not exist.

                  @@ -522,7 +522,7 @@ header------------------------------>| |

                  Throws: If "comp" throws.

                29. -
                  static void insert_unique_commit(const node_ptr & header, 
+
                  static void insert_unique_commit(const node_ptr & header, 
                                  const node_ptr & new_value, 
                                  const insert_commit_data & commit_data);
                  
 
                  Requires: "header" must be the header node of a tree. "commit_data" must have been obtained from a previous call to "insert_unique_check". No objects should have been inserted or erased from the set between the "insert_unique_check" that filled "commit_data" and the call to "insert_commit".
                  
@@ -534,7 +534,7 @@ header------------------------------>|         |
 
                30. 
 
                  template<typename KeyType, typename KeyNodePtrCompare> 
   static std::pair< node_ptr, bool > 
-  insert_unique_check(const const_node_ptr & header, const KeyType & key, 
+  insert_unique_check(const const_node_ptr & header, const KeyType & key, 
                       KeyNodePtrCompare comp, 
                       insert_commit_data & commit_data);
                  
 
                  Requires: "header" must be the header node of a tree. KeyNodePtrCompare is a function object that induces a strict weak ordering compatible with the strict weak ordering used to create the the tree. NodePtrCompare compares KeyType with a node_ptr.
                  
@@ -549,7 +549,7 @@ header------------------------------>|         |
 
                31. 
 
                  template<typename KeyType, typename KeyNodePtrCompare> 
   static std::pair< node_ptr, bool > 
-  insert_unique_check(const const_node_ptr & header, const node_ptr & hint, 
+  insert_unique_check(const const_node_ptr & header, const node_ptr & hint, 
                       const KeyType & key, KeyNodePtrCompare comp, 
                       insert_commit_data & commit_data);
                  
 
                  Requires: "header" must be the header node of a tree. KeyNodePtrCompare is a function object that induces a strict weak ordering compatible with the strict weak ordering used to create the the tree. NodePtrCompare compares KeyType with a node_ptr. "hint" is node from the "header"'s tree.
                  
@@ -564,7 +564,7 @@ header------------------------------>|         |
 
                32. 
 
                  template<typename NodePtrCompare> 
   static node_ptr 
-  insert_equal(const node_ptr & h, const node_ptr & hint, 
+  insert_equal(const node_ptr & h, const node_ptr & hint, 
                const node_ptr & new_node, NodePtrCompare comp);
                  
 
                  Requires: "header" must be the header node of a tree. NodePtrCompare is a function object that induces a strict weak ordering compatible with the strict weak ordering used to create the the tree. NodePtrCompare compares two node_ptrs. "hint" is node from the "header"'s tree.
                  
 
                  Effects: Inserts new_node into the tree, using "hint" as a hint to where it will be inserted. If "hint" is the upper_bound the insertion takes constant time (two comparisons in the worst case).
                  
@@ -574,7 +574,7 @@ header------------------------------>|         |
 
                33. 
 
                  template<typename NodePtrCompare> 
   static node_ptr 
-  insert_equal_upper_bound(const node_ptr & h, const node_ptr & new_node, 
+  insert_equal_upper_bound(const node_ptr & h, const node_ptr & new_node, 
                            NodePtrCompare comp);
                  
 
                  Requires: "h" must be the header node of a tree. NodePtrCompare is a function object that induces a strict weak ordering compatible with the strict weak ordering used to create the the tree. NodePtrCompare compares two node_ptrs.
                  
 
                  Effects: Inserts new_node into the tree before the upper bound according to "comp".
                  
@@ -584,7 +584,7 @@ header------------------------------>|         |
 
                34. 
 
                  template<typename NodePtrCompare> 
   static node_ptr 
-  insert_equal_lower_bound(const node_ptr & h, const node_ptr & new_node, 
+  insert_equal_lower_bound(const node_ptr & h, const node_ptr & new_node, 
                            NodePtrCompare comp);
                  
 
                  Requires: "h" must be the header node of a tree. NodePtrCompare is a function object that induces a strict weak ordering compatible with the strict weak ordering used to create the the tree. NodePtrCompare compares two node_ptrs.
                  
 
                  Effects: Inserts new_node into the tree before the lower bound according to "comp".
                  
@@ -593,7 +593,7 @@ header------------------------------>|         |
 
                  35. 
 
                35. 
 
                  static node_ptr 
-insert_before(const node_ptr & header, const node_ptr & pos, 
+insert_before(const node_ptr & header, const node_ptr & pos, 
               const node_ptr & new_node);
                  
 
                  Requires: "header" must be the header node of a tree. "pos" must be a valid iterator or header (end) node. "pos" must be an iterator pointing to the successor to "new_node" once inserted according to the order of already inserted nodes. This function does not check "pos" and this precondition must be guaranteed by the caller.
                  
 
                  Effects: Inserts new_node into the tree before "pos".
                  
@@ -602,7 +602,7 @@ header------------------------------>|         |
 
                  Note: If "pos" is not the successor of the newly inserted "new_node" tree invariants might be broken. 
                  
 
                  36. 
 
                36. 
-
                  static void push_back(const node_ptr & header, const node_ptr & new_node);
                  
+
                  static void push_back(const node_ptr & header, const node_ptr & new_node);
                  
 
                  Requires: "header" must be the header node of a tree. "new_node" must be, according to the used ordering no less than the greatest inserted key.
                  
 
                  Effects: Inserts new_node into the tree before "pos".
                  
 
                  Complexity: Constant-time.
                  
@@ -610,7 +610,7 @@ header------------------------------>|         |
 
                  Note: If "new_node" is less than the greatest inserted key tree invariants are broken. This function is slightly faster than using "insert_before". 
                  
 
                  37. 
 
                37. 
-
                  static void push_front(const node_ptr & header, const node_ptr & new_node);
                  
+
                  static void push_front(const node_ptr & header, const node_ptr & new_node);
                  
 
                  Requires: "header" must be the header node of a tree. "new_node" must be, according to the used ordering, no greater than the lowest inserted key.
                  
 
                  Effects: Inserts new_node into the tree before "pos".
                  
 
                  Complexity: Constant-time.
                  
@@ -618,7 +618,7 @@ header------------------------------>|         |
 
                  Note: If "new_node" is greater than the lowest inserted key tree invariants are broken. This function is slightly faster than using "insert_before". 
                  
 
                  38. 
 
                38. 
-
                  static std::size_t depth(const_node_ptr node);
                  
+
                  static std::size_t depth(const_node_ptr node);
                  
 
                  Requires: 'node' can't be a header node.
                  
 
                  Effects: Calculates the depth of a node: the depth of a node is the length (number of edges) of the path from the root to that node. (The root node is at depth 0.)
                  
 
                  Complexity: Logarithmic to the number of nodes in the tree.
                  
@@ -626,7 +626,7 @@ header------------------------------>|         |
 
                  39. 
 
                39. 
 
                  template<typename Cloner, typename Disposer> 
-  static void clone(const const_node_ptr & source_header, 
+  static void clone(const const_node_ptr & source_header, 
                     const node_ptr & target_header, Cloner cloner, 
                     Disposer disposer);
                  
 
                  Requires: "cloner" must be a function object taking a node_ptr and returning a new cloned node of it. "disposer" must take a node_ptr and shouldn't throw.
                  
@@ -636,7 +636,7 @@ header------------------------------>|         |
 
                  Throws: If cloner functor throws. If this happens target nodes are disposed. 
                  
 
                  40. 
 
                40. 
-
                  static void erase(const node_ptr & header, const node_ptr & z);
                  
+
                  static void erase(const node_ptr & header, const node_ptr & z);
                  
 
                  Requires: header must be the header of a tree, z a node of that tree and z != header.
                  
 
                  Effects: Erases node "z" from the tree with header "header".
                  
 
                  Complexity: Amortized constant time.
                  
@@ -644,7 +644,7 @@ header------------------------------>|         |
 
                  41. 
 
                41. 
 
                  template<typename NodePtrCompare> 
-  static bool transfer_unique(const node_ptr & header1, NodePtrCompare comp, 
+  static bool transfer_unique(const node_ptr & header1, NodePtrCompare comp, 
                               const node_ptr & header2, const node_ptr & z);
                  
 
                  Requires: header1 and header2 must be the headers of trees tree1 and tree2 respectively, z a non-header node of tree1. NodePtrCompare is the comparison function of tree1..
                  
 
                  Effects: Transfers node "z" from tree1 to tree2 if tree1 does not contain a node that is equivalent to z.
                  
@@ -654,7 +654,7 @@ header------------------------------>|         |
 
                  42. 
 
                42. 
 
                  template<typename NodePtrCompare> 
-  static void transfer_equal(const node_ptr & header1, NodePtrCompare comp, 
+  static void transfer_equal(const node_ptr & header1, NodePtrCompare comp, 
                              const node_ptr & header2, const node_ptr & z);
                  
 
                  Requires: header1 and header2 must be the headers of trees tree1 and tree2 respectively, z a non-header node of tree1. NodePtrCompare is the comparison function of tree1..
                  
 
                  Effects: Transfers node "z" from tree1 to tree2.
                  
@@ -662,21 +662,21 @@ header------------------------------>|         |
 
                  Throws: If the comparison throws. 
                  
 
                  43. 
 
                43. 
-
                  static void unlink(const node_ptr & node);
                  
+
                  static void unlink(const node_ptr & node);
                  
 
                  Requires: node is a tree node but not the header.
                  
 
                  Effects: Unlinks the node and rebalances the tree.
                  
 
                  Complexity: Average complexity is constant time.
                  
 
                  Throws: Nothing. 
                  
 
                  44. 
 
                44. 
-
                  static void rebalance(const node_ptr & header);
                  
+
                  static void rebalance(const node_ptr & header);
                  
 
                  Requires: header must be the header of a tree.
                  
 
                  Effects: Rebalances the tree.
                  
 
                  Throws: Nothing.
                  
 
                  Complexity: Linear. 
                  
 
                  45. 
 
                45. 
-
                  static node_ptr rebalance_subtree(const node_ptr & old_root);
                  
+
                  static node_ptr rebalance_subtree(const node_ptr & old_root);
                  
 
                  Requires: old_root is a node of a tree. It shall not be null.
                  
 
                  Effects: Rebalances the subtree rooted at old_root.
                  
 
                  Returns: The new root of the subtree.
                  
@@ -685,7 +685,7 @@ header------------------------------>|         |
 
                  46. 
 
                46. 
 
                  template<typename Checker> 
-  static void check(const const_node_ptr & header, Checker checker, 
+  static void check(const const_node_ptr & header, Checker checker, 
                     typename Checker::return_type & checker_return);
                  
 
                  Effects: Asserts the integrity of the container with additional checks provided by the user.
                  
 
                  Requires: header must be the header of a tree.
                  
@@ -696,86 +696,86 @@ header------------------------------>|         |

                -bstree_algorithms protected static functions

                +bstree_algorithms protected static functions 
                1. template<typename NodePtrCompare> 
-  static bool transfer_unique(const node_ptr & header1, NodePtrCompare comp, 
+  static bool transfer_unique(const node_ptr & header1, NodePtrCompare comp, 
                               const node_ptr & header2, const node_ptr & z, 
                               data_for_rebalance & info);
                2. template<typename NodePtrCompare> 
-  static void transfer_equal(const node_ptr & header1, NodePtrCompare comp, 
+  static void transfer_equal(const node_ptr & header1, NodePtrCompare comp, 
                              const node_ptr & header2, const node_ptr & z, 
                              data_for_rebalance & info);
                  3. -
                3. static void erase(const node_ptr & header, const node_ptr & z, 
+
                4. static void erase(const node_ptr & header, const node_ptr & z, 
                   data_for_rebalance & info);
                  5. 
 
                5. 
-
                  static std::size_t subtree_size(const const_node_ptr & subtree);
                  
+
                  static std::size_t subtree_size(const const_node_ptr & subtree);
                  
 
                  Requires: node is a node of the tree but it's not the header.
                  
 
                  Effects: Returns the number of nodes of the subtree.
                  
 
                  Complexity: Linear time.
                  
 
                  Throws: Nothing. 
                  
 
                  6. 
 
                6. 
-
                  static bool is_left_child(const node_ptr & p);
                  
+
                  static bool is_left_child(const node_ptr & p);
                  
 
                  Requires: p is a node of a tree.
                  
 
                  Effects: Returns true if p is a left child.
                  
 
                  Complexity: Constant.
                  
 
                  Throws: Nothing. 
                  
 
                  7. 
 
                7. 
-
                  static bool is_right_child(const node_ptr & p);
                  
+
                  static bool is_right_child(const node_ptr & p);
                  
 
                  Requires: p is a node of a tree.
                  
 
                  Effects: Returns true if p is a right child.
                  
 
                  Complexity: Constant.
                  
 
                  Throws: Nothing. 
                  
 
                  8. 
-
                8. static void insert_before_check(const node_ptr & header, const node_ptr & pos, 
+
                9. static void insert_before_check(const node_ptr & header, const node_ptr & pos, 
                                 insert_commit_data & commit_data);
                  10. 
-
                10. static void push_back_check(const node_ptr & header, 
+
                11. static void push_back_check(const node_ptr & header, 
                             insert_commit_data & commit_data);
                  12. 
-
                12. static void push_front_check(const node_ptr & header, 
+
                13. static void push_front_check(const node_ptr & header, 
                              insert_commit_data & commit_data);
                  14. 
 
                14. template<typename NodePtrCompare> 
-  static void insert_equal_check(const node_ptr & header, 
+  static void insert_equal_check(const node_ptr & header, 
                                  const node_ptr & hint, 
                                  const node_ptr & new_node, 
                                  NodePtrCompare comp, 
                                  insert_commit_data & commit_data);
                  15. 
 
                15. template<typename NodePtrCompare> 
-  static void insert_equal_upper_bound_check(const node_ptr & h, 
+  static void insert_equal_upper_bound_check(const node_ptr & h, 
                                              const node_ptr & new_node, 
                                              NodePtrCompare comp, 
                                              insert_commit_data & commit_data, 
                                              std::size_t * pdepth = 0);
                  16. 
 
                16. template<typename NodePtrCompare> 
-  static void insert_equal_lower_bound_check(const node_ptr & h, 
+  static void insert_equal_lower_bound_check(const node_ptr & h, 
                                              const node_ptr & new_node, 
                                              NodePtrCompare comp, 
                                              insert_commit_data & commit_data, 
                                              std::size_t * pdepth = 0);
                  17. 
-
                17. static void insert_commit(const node_ptr & header, const node_ptr & new_node, 
+
                18. static void insert_commit(const node_ptr & header, const node_ptr & new_node, 
                           const insert_commit_data & commit_data);
                  19. 
-
                19. static void set_child(const node_ptr & header, const node_ptr & new_child, 
+
                20. static void set_child(const node_ptr & header, const node_ptr & new_child, 
                       const node_ptr & new_parent, const bool link_left);
                  21. 
-
                21. static void rotate_left_no_parent_fix(const node_ptr & p, 
+
                22. static void rotate_left_no_parent_fix(const node_ptr & p, 
                                       const node_ptr & p_right);
                  23. 
-
                23. static void rotate_left(const node_ptr & p, const node_ptr & p_right, 
+
                24. static void rotate_left(const node_ptr & p, const node_ptr & p_right, 
                         const node_ptr & p_parent, const node_ptr & header);
                  25. 
-
                25. static void rotate_right_no_parent_fix(const node_ptr & p, 
+
                26. static void rotate_right_no_parent_fix(const node_ptr & p, 
                                        const node_ptr & p_left);
                  27. 
-
                27. static void rotate_right(const node_ptr & p, const node_ptr & p_left, 
+
                28. static void rotate_right(const node_ptr & p, const node_ptr & p_left, 
                          const node_ptr & p_parent, const node_ptr & header);
                  29.

                -bstree_algorithms private static functions

                +bstree_algorithms private static functions
                  -
                1. static void subtree_to_vine(node_ptr vine_tail, std::size_t & size);
                  2. -
                2. static void compress_subtree(node_ptr scanner, std::size_t count);
                  3. -
                3. static void vine_to_subtree(const node_ptr & super_root, std::size_t count);
                  4. +
                4. static void subtree_to_vine(node_ptr vine_tail, std::size_t & size);
                  5. +
                5. static void compress_subtree(node_ptr scanner, std::size_t count);
                  6. +
                6. static void vine_to_subtree(const node_ptr & super_root, std::size_t count);
                7. -
                  static node_ptr get_root(const node_ptr & node);
                  +
                  static node_ptr get_root(const node_ptr & node);

                  Requires: "n" must be a node inserted in a tree.

                  Effects: Returns a pointer to the header node of the tree.

                  Complexity: Logarithmic.

                  @@ -783,22 +783,22 @@ header------------------------------>| | 
                8. template<typename Cloner, typename Disposer> 
   static node_ptr 
-  clone_subtree(const const_node_ptr & source_parent, 
+  clone_subtree(const const_node_ptr & source_parent, 
                 const node_ptr & target_parent, Cloner cloner, 
                 Disposer disposer, node_ptr & leftmost_out, 
                 node_ptr & rightmost_out);
                9. template<typename Disposer> 
-  static void dispose_subtree(node_ptr x, Disposer disposer);
                  10. + static void dispose_subtree(node_ptr x, Disposer disposer); 
                10. template<typename KeyType, typename KeyNodePtrCompare> 
   static node_ptr 
-  lower_bound_loop(node_ptr x, node_ptr y, const KeyType & key, 
+  lower_bound_loop(node_ptr x, node_ptr y, const KeyType & key, 
                    KeyNodePtrCompare comp);
                11. template<typename KeyType, typename KeyNodePtrCompare> 
   static node_ptr 
-  upper_bound_loop(node_ptr x, node_ptr y, const KeyType & key, 
+  upper_bound_loop(node_ptr x, node_ptr y, const KeyType & key, 
                    KeyNodePtrCompare comp);
                12. template<typename Checker> 
-  static void check_subtree(const const_node_ptr & node, Checker checker, 
+  static void check_subtree(const const_node_ptr & node, Checker checker, 
                             typename Checker::return_type & check_return);
                diff --git a/doc/html/boost/intrusive/circular_list_algorithms.html b/doc/html/boost/intrusive/circular_list_algorithms.html index 8c7937ffa4..2190d365e2 100644 --- a/doc/html/boost/intrusive/circular_list_algorithms.html +++ b/doc/html/boost/intrusive/circular_list_algorithms.html @@ -51,30 +51,30 @@ node_ptr beg_2st_partition; }; - // public static functions - static void init(const node_ptr &); - static bool inited(const const_node_ptr &); - static void init_header(const node_ptr &); - static bool unique(const const_node_ptr &); - static std::size_t count(const const_node_ptr &); - static node_ptr unlink(const node_ptr &); - static void unlink(const node_ptr &, const node_ptr &); - static void link_before(const node_ptr &, const node_ptr &); - static void link_after(const node_ptr &, const node_ptr &); - static void swap_nodes(const node_ptr &, const node_ptr &); - static void transfer(const node_ptr &, const node_ptr &, const node_ptr &); - static void transfer(const node_ptr &, const node_ptr &); - static void reverse(const node_ptr &); - static void move_backwards(const node_ptr &, std::size_t); - static void move_forward(const node_ptr &, std::size_t); - static std::size_t distance(const const_node_ptr &, const const_node_ptr &); + // public static functions + static void init(const node_ptr &); + static bool inited(const const_node_ptr &); + static void init_header(const node_ptr &); + static bool unique(const const_node_ptr &); + static std::size_t count(const const_node_ptr &); + static node_ptr unlink(const node_ptr &); + static void unlink(const node_ptr &, const node_ptr &); + static void link_before(const node_ptr &, const node_ptr &); + static void link_after(const node_ptr &, const node_ptr &); + static void swap_nodes(const node_ptr &, const node_ptr &); + static void transfer(const node_ptr &, const node_ptr &, const node_ptr &); + static void transfer(const node_ptr &, const node_ptr &); + static void reverse(const node_ptr &); + static void move_backwards(const node_ptr &, std::size_t); + static void move_forward(const node_ptr &, std::size_t); + static std::size_t distance(const const_node_ptr &, const const_node_ptr &); template<typename Pred> - static void stable_partition(node_ptr, const node_ptr &, Pred, + static void stable_partition(node_ptr, const node_ptr &, Pred, stable_partition_info &); - // private static functions - static void swap_prev(const node_ptr &, const node_ptr &); - static void swap_next(const node_ptr &, const node_ptr &); + // private static functions + static void swap_prev(const node_ptr &, const node_ptr &); + static void swap_next(const node_ptr &, const node_ptr &); };

                Description

                @@ -91,70 +91,70 @@

                static void set_next(node_ptr n, node_ptr next);

                -circular_list_algorithms public static functions

                +circular_list_algorithms public static functions
                1. -
                  static void init(const node_ptr & this_node);
                  +
                  static void init(const node_ptr & this_node);

                  Effects: Constructs an non-used list element, so that inited(this_node) == true

                  Complexity: Constant

                  Throws: Nothing.

                2. -
                  static bool inited(const const_node_ptr & this_node);
                  +
                  static bool inited(const const_node_ptr & this_node);

                  Effects: Returns true is "this_node" is in a non-used state as if it was initialized by the "init" function.

                  Complexity: Constant

                  Throws: Nothing.

                3. -
                  static void init_header(const node_ptr & this_node);
                  +
                  static void init_header(const node_ptr & this_node);

                  Effects: Constructs an empty list, making this_node the only node of the circular list: NodeTraits::get_next(this_node) == NodeTraits::get_previous(this_node) == this_node.

                  Complexity: Constant

                  Throws: Nothing.

                4. -
                  static bool unique(const const_node_ptr & this_node);
                  +
                  static bool unique(const const_node_ptr & this_node);

                  Requires: this_node must be in a circular list or be an empty circular list.

                  Effects: Returns true is "this_node" is the only node of a circular list: return NodeTraits::get_next(this_node) == this_node

                  Complexity: Constant

                  Throws: Nothing.

                5. -
                  static std::size_t count(const const_node_ptr & this_node);
                  +
                  static std::size_t count(const const_node_ptr & this_node);

                  Requires: this_node must be in a circular list or be an empty circular list.

                  Effects: Returns the number of nodes in a circular list. If the circular list is empty, returns 1.

                  Complexity: Linear

                  Throws: Nothing.

                6. -
                  static node_ptr unlink(const node_ptr & this_node);
                  +
                  static node_ptr unlink(const node_ptr & this_node);

                  Requires: this_node must be in a circular list or be an empty circular list.

                  Effects: Unlinks the node from the circular list.

                  Complexity: Constant

                  Throws: Nothing.

                7. -
                  static void unlink(const node_ptr & b, const node_ptr & e);
                  +
                  static void unlink(const node_ptr & b, const node_ptr & e);

                  Requires: b and e must be nodes of the same circular list or an empty range.

                  Effects: Unlinks the node [b, e) from the circular list.

                  Complexity: Constant

                  Throws: Nothing.

                8. -
                  static void link_before(const node_ptr & nxt_node, const node_ptr & this_node);
                  +
                  static void link_before(const node_ptr & nxt_node, const node_ptr & this_node);

                  Requires: nxt_node must be a node of a circular list.

                  Effects: Links this_node before nxt_node in the circular list.

                  Complexity: Constant

                  Throws: Nothing.

                9. -
                  static void link_after(const node_ptr & prev_node, const node_ptr & this_node);
                  +
                  static void link_after(const node_ptr & prev_node, const node_ptr & this_node);

                  Requires: prev_node must be a node of a circular list.

                  Effects: Links this_node after prev_node in the circular list.

                  Complexity: Constant

                  Throws: Nothing.

                10. -
                  static void swap_nodes(const node_ptr & this_node, 
+
                  static void swap_nodes(const node_ptr & this_node, 
                        const node_ptr & other_node);
                  
 
                  Requires: this_node and other_node must be nodes inserted in circular lists or be empty circular lists.
                  
 
                  Effects: Swaps the position of the nodes: this_node is inserted in other_nodes position in the second circular list and the other_node is inserted in this_node's position in the first circular list.
                  
@@ -162,56 +162,56 @@
 
                  Throws: Nothing.
                11. -
                  static void transfer(const node_ptr & p, const node_ptr & b, 
+
                  static void transfer(const node_ptr & p, const node_ptr & b, 
                      const node_ptr & e);
                  
 
                  Requires: b and e must be nodes of the same circular list or an empty range. and p must be a node of a different circular list or may not be an iterator in Effects: Removes the nodes from [b, e) range from their circular list and inserts them before p in p's circular list.
                  
 
                  Complexity: Constant
                  
 
                  Throws: Nothing.
                12. -
                  static void transfer(const node_ptr & p, const node_ptr & i);
                  +
                  static void transfer(const node_ptr & p, const node_ptr & i);

                  Requires: i must a node of a circular list and p must be a node of a different circular list.

                  Effects: Removes the node i from its circular list and inserts it before p in p's circular list. If p == i or p == NodeTraits::get_next(i), this function is a null operation.

                  Complexity: Constant

                  Throws: Nothing.

                13. -
                  static void reverse(const node_ptr & p);
                  +
                  static void reverse(const node_ptr & p);

                  Effects: Reverses the order of elements in the list.

                  Throws: Nothing.

                  Complexity: This function is linear time.

                14. -
                  static void move_backwards(const node_ptr & p, std::size_t n);
                  +
                  static void move_backwards(const node_ptr & p, std::size_t n);

                  Effects: Moves the node p n positions towards the end of the list.

                  Throws: Nothing.

                  Complexity: Linear to the number of moved positions.

                15. -
                  static void move_forward(const node_ptr & p, std::size_t n);
                  +
                  static void move_forward(const node_ptr & p, std::size_t n);

                  Effects: Moves the node p n positions towards the beginning of the list.

                  Throws: Nothing.

                  Complexity: Linear to the number of moved positions. 

                16. static std::size_t 
-distance(const const_node_ptr & f, const const_node_ptr & l);
                  +distance(const const_node_ptr & f, const const_node_ptr & l);

                  Requires: f and l must be in a circular list.

                  Effects: Returns the number of nodes in the range [f, l).

                  Complexity: Linear

                  Throws: Nothing. 

                17. template<typename Pred> 
-  static void stable_partition(node_ptr beg, const node_ptr & end, Pred pred, 
+  static void stable_partition(node_ptr beg, const node_ptr & end, Pred pred, 
                                stable_partition_info & info);

                -circular_list_algorithms private static functions

                +circular_list_algorithms private static functions
                  -
                1. static void swap_prev(const node_ptr & this_node, const node_ptr & other_node);
                  2. -
                2. static void swap_next(const node_ptr & this_node, const node_ptr & other_node);
                  3. +
                3. static void swap_prev(const node_ptr & this_node, const node_ptr & other_node);
                  4. +
                4. static void swap_next(const node_ptr & this_node, const node_ptr & other_node);
                diff --git a/doc/html/boost/intrusive/circular_slist_algorithms.html b/doc/html/boost/intrusive/circular_slist_algorithms.html index 687afe303b..057858a53d 100644 --- a/doc/html/boost/intrusive/circular_slist_algorithms.html +++ b/doc/html/boost/intrusive/circular_slist_algorithms.html @@ -41,26 +41,26 @@ typedef NodeTraits::const_node_ptr const_node_ptr; typedef NodeTraits node_traits; - // public static functions - static void init(node_ptr); - static bool unique(const_node_ptr); - static bool inited(const_node_ptr); - static void unlink_after(node_ptr); - static void unlink_after(node_ptr, node_ptr); - static void link_after(node_ptr, node_ptr); - static void transfer_after(node_ptr, node_ptr, node_ptr); - static void init_header(const node_ptr &); - static node_ptr get_previous_node(const node_ptr &, const node_ptr &); - static node_ptr get_previous_node(const node_ptr &); - static node_ptr get_previous_previous_node(const node_ptr &); - static node_ptr get_previous_previous_node(node_ptr, const node_ptr &); - static std::size_t count(const const_node_ptr &); - static void unlink(const node_ptr &); - static void link_before(const node_ptr &, const node_ptr &); - static void swap_nodes(const node_ptr &, const node_ptr &); - static void reverse(const node_ptr &); - static node_ptr move_backwards(const node_ptr &, std::size_t); - static node_ptr move_forward(const node_ptr &, std::size_t); + // public static functions + static void init(node_ptr); + static bool unique(const_node_ptr); + static bool inited(const_node_ptr); + static void unlink_after(node_ptr); + static void unlink_after(node_ptr, node_ptr); + static void link_after(node_ptr, node_ptr); + static void transfer_after(node_ptr, node_ptr, node_ptr); + static void init_header(const node_ptr &); + static node_ptr get_previous_node(const node_ptr &, const node_ptr &); + static node_ptr get_previous_node(const node_ptr &); + static node_ptr get_previous_previous_node(const node_ptr &); + static node_ptr get_previous_previous_node(node_ptr, const node_ptr &); + static std::size_t count(const const_node_ptr &); + static void unlink(const node_ptr &); + static void link_before(const node_ptr &, const node_ptr &); + static void swap_nodes(const node_ptr &, const node_ptr &); + static void reverse(const node_ptr &); + static node_ptr move_backwards(const node_ptr &, std::size_t); + static node_ptr move_forward(const node_ptr &, std::size_t); };

                Description

                @@ -75,78 +75,78 @@

                static void set_next(node_ptr n, node_ptr next);

                -circular_slist_algorithms public static functions

                +circular_slist_algorithms public static functions
                1. -
                  static void init(node_ptr this_node);
                  +
                  static void init(node_ptr this_node);

                  Effects: Constructs an non-used list element, putting the next pointer to null: NodeTraits::get_next(this_node) == node_ptr()

                  Complexity: Constant

                  Throws: Nothing.

                2. -
                  static bool unique(const_node_ptr this_node);
                  +
                  static bool unique(const_node_ptr this_node);

                  Requires: this_node must be in a circular list or be an empty circular list.

                  Effects: Returns true is "this_node" is the only node of a circular list: or it's a not inserted node: return node_ptr() == NodeTraits::get_next(this_node) || NodeTraits::get_next(this_node) == this_node

                  Complexity: Constant

                  Throws: Nothing.

                3. -
                  static bool inited(const_node_ptr this_node);
                  +
                  static bool inited(const_node_ptr this_node);

                  Effects: Returns true is "this_node" has the same state as if it was inited using "init(node_ptr)"

                  Complexity: Constant

                  Throws: Nothing.

                4. -
                  static void unlink_after(node_ptr prev_node);
                  +
                  static void unlink_after(node_ptr prev_node);

                  Requires: prev_node must be in a circular list or be an empty circular list.

                  Effects: Unlinks the next node of prev_node from the circular list.

                  Complexity: Constant

                  Throws: Nothing.

                5. -
                  static void unlink_after(node_ptr prev_node, node_ptr last_node);
                  +
                  static void unlink_after(node_ptr prev_node, node_ptr last_node);

                  Requires: prev_node and last_node must be in a circular list or be an empty circular list.

                  Effects: Unlinks the range (prev_node, last_node) from the circular list.

                  Complexity: Constant

                  Throws: Nothing.

                6. -
                  static void link_after(node_ptr prev_node, node_ptr this_node);
                  +
                  static void link_after(node_ptr prev_node, node_ptr this_node);

                  Requires: prev_node must be a node of a circular list.

                  Effects: Links this_node after prev_node in the circular list.

                  Complexity: Constant

                  Throws: Nothing.

                7. -
                  static void transfer_after(node_ptr p, node_ptr b, node_ptr e);
                  +
                  static void transfer_after(node_ptr p, node_ptr b, node_ptr e);

                  Requires: b and e must be nodes of the same circular list or an empty range. and p must be a node of a different circular list.

                  Effects: Removes the nodes from (b, e] range from their circular list and inserts them after p in p's circular list.

                  Complexity: Constant

                  Throws: Nothing.

                8. -
                  static void init_header(const node_ptr & this_node);
                  +
                  static void init_header(const node_ptr & this_node);

                  Effects: Constructs an empty list, making this_node the only node of the circular list: NodeTraits::get_next(this_node) == this_node.

                  Complexity: Constant

                  Throws: Nothing. 

                9. static node_ptr 
-get_previous_node(const node_ptr & prev_init_node, const node_ptr & this_node);
                  +get_previous_node(const node_ptr & prev_init_node, const node_ptr & this_node);

                  Requires: this_node and prev_init_node must be in the same circular list.

                  Effects: Returns the previous node of this_node in the circular list starting. the search from prev_init_node. The first node checked for equality is NodeTraits::get_next(prev_init_node).

                  Complexity: Linear to the number of elements between prev_init_node and this_node.

                  Throws: Nothing.

                10. -
                  static node_ptr get_previous_node(const node_ptr & this_node);
                  +
                  static node_ptr get_previous_node(const node_ptr & this_node);

                  Requires: this_node must be in a circular list or be an empty circular list.

                  Effects: Returns the previous node of this_node in the circular list.

                  Complexity: Linear to the number of elements in the circular list.

                  Throws: Nothing.

                11. -
                  static node_ptr get_previous_previous_node(const node_ptr & this_node);
                  +
                  static node_ptr get_previous_previous_node(const node_ptr & this_node);

                  Requires: this_node must be in a circular list or be an empty circular list.

                  Effects: Returns the previous node of the previous node of this_node in the circular list.

                  Complexity: Linear to the number of elements in the circular list.

                  @@ -154,35 +154,35 @@ 
                12. static node_ptr 
-get_previous_previous_node(node_ptr p, const node_ptr & this_node);
                  +get_previous_previous_node(node_ptr p, const node_ptr & this_node);

                  Requires: this_node and p must be in the same circular list.

                  Effects: Returns the previous node of the previous node of this_node in the circular list starting. the search from p. The first node checked for equality is NodeTraits::get_next((NodeTraits::get_next(p)).

                  Complexity: Linear to the number of elements in the circular list.

                  Throws: Nothing.

                13. -
                  static std::size_t count(const const_node_ptr & this_node);
                  +
                  static std::size_t count(const const_node_ptr & this_node);

                  Requires: this_node must be in a circular list or be an empty circular list.

                  Effects: Returns the number of nodes in a circular list. If the circular list is empty, returns 1.

                  Complexity: Linear

                  Throws: Nothing.

                14. -
                  static void unlink(const node_ptr & this_node);
                  +
                  static void unlink(const node_ptr & this_node);

                  Requires: this_node must be in a circular list, be an empty circular list or be inited.

                  Effects: Unlinks the node from the circular list.

                  Complexity: Linear to the number of elements in the circular list

                  Throws: Nothing.

                15. -
                  static void link_before(const node_ptr & nxt_node, const node_ptr & this_node);
                  +
                  static void link_before(const node_ptr & nxt_node, const node_ptr & this_node);

                  Requires: nxt_node must be a node of a circular list.

                  Effects: Links this_node before nxt_node in the circular list.

                  Complexity: Linear to the number of elements in the circular list.

                  Throws: Nothing.

                16. -
                  static void swap_nodes(const node_ptr & this_node, 
+
                  static void swap_nodes(const node_ptr & this_node, 
                        const node_ptr & other_node);
                  
 
                  Requires: this_node and other_node must be nodes inserted in circular lists or be empty circular lists.
                  
 
                  Effects: Swaps the position of the nodes: this_node is inserted in other_nodes position in the second circular list and the other_node is inserted in this_node's position in the first circular list.
                  
@@ -190,20 +190,20 @@
 
                  Throws: Nothing.
                17. -
                  static void reverse(const node_ptr & p);
                  +
                  static void reverse(const node_ptr & p);

                  Effects: Reverses the order of elements in the list.

                  Throws: Nothing.

                  Complexity: This function is linear to the contained elements.

                18. -
                  static node_ptr move_backwards(const node_ptr & p, std::size_t n);
                  +
                  static node_ptr move_backwards(const node_ptr & p, std::size_t n);

                  Effects: Moves the node p n positions towards the end of the list.

                  Returns: The previous node of p after the function if there has been any movement, Null if n leads to no movement.

                  Throws: Nothing.

                  Complexity: Linear to the number of elements plus the number moved positions.

                19. -
                  static node_ptr move_forward(const node_ptr & p, std::size_t n);
                  +
                  static node_ptr move_forward(const node_ptr & p, std::size_t n);

                  Effects: Moves the node p n positions towards the beginning of the list.

                  Returns: The previous node of p after the function if there has been any movement, Null if n leads equals to no movement.

                  Throws: Nothing.

                  diff --git a/doc/html/boost/intrusive/derivation_value_traits.html b/doc/html/boost/intrusive/derivation_value_traits.html index ac523cf8ef..e36ce860ff 100644 --- a/doc/html/boost/intrusive/derivation_value_traits.html +++ b/doc/html/boost/intrusive/derivation_value_traits.html @@ -45,11 +45,11 @@ typedef boost::intrusive::pointer_traits< pointer >::reference reference; typedef boost::intrusive::pointer_traits< const_pointer >::reference const_reference; - // public static functions - static node_ptr to_node_ptr(reference); - static const_node_ptr to_node_ptr(const_reference); - static pointer to_value_ptr(const node_ptr &); - static const_pointer to_value_ptr(const const_node_ptr &); + // public static functions + static node_ptr to_node_ptr(reference); + static const_node_ptr to_node_ptr(const_reference); + static pointer to_value_ptr(const node_ptr &); + static const_pointer to_value_ptr(const const_node_ptr &); // public data members static const link_mode_type link_mode; @@ -59,12 +59,12 @@

                  This value traits template is used to create value traits from user defined node traits where value_traits::value_type will derive from node_traits::node

                  -derivation_value_traits public static functions

                  +derivation_value_traits public static functions
                    -
                  1. static node_ptr to_node_ptr(reference value);
                    2. -
                  2. static const_node_ptr to_node_ptr(const_reference value);
                    3. -
                  3. static pointer to_value_ptr(const node_ptr & n);
                    4. -
                  4. static const_pointer to_value_ptr(const const_node_ptr & n);
                    5. +
                  5. static node_ptr to_node_ptr(reference value);
                    6. +
                  6. static const_node_ptr to_node_ptr(const_reference value);
                    7. +
                  7. static pointer to_value_ptr(const node_ptr & n);
                    8. +
                  8. static const_pointer to_value_ptr(const const_node_ptr & n);
                diff --git a/doc/html/boost/intrusive/get_parent_fro_idp55114128.html b/doc/html/boost/intrusive/get_parent_fro_idp55114128.html deleted file mode 100644 index 2ea489edd0..0000000000 --- a/doc/html/boost/intrusive/get_parent_fro_idp55114128.html +++ /dev/null @@ -1,57 +0,0 @@ - - - - -Function template get_parent_from_member - - - - - - - - -
    - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Function template get_parent_from_member

    -

    boost::intrusive::get_parent_from_member

    -
    -

    Synopsis

    -
    // In header: <boost/intrusive/parent_from_member.hpp>
-
-
-template<typename Parent, typename Member> 
-  Parent * get_parent_from_member(Member * member, 
-                                  const Member Parent::* ptr_to_member);
    -
    -

    Description

    -

    Given a pointer to a member and its corresponding pointer to data member, this function returns the pointer of the parent containing that member. Note: this function does not work with pointer to members that rely on virtual inheritance.

    -
    -
    - - - -
    Copyright © 2005 Olaf Krzikalla
    Copyright © 2006-2015 Ion Gaztanaga

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/intrusive/get_parent_fro_idp55118400.html b/doc/html/boost/intrusive/get_parent_fro_idp55118400.html deleted file mode 100644 index a67b4341c3..0000000000 --- a/doc/html/boost/intrusive/get_parent_fro_idp55118400.html +++ /dev/null @@ -1,58 +0,0 @@ - - - - -Function template get_parent_from_member - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Function template get_parent_from_member

    -

    boost::intrusive::get_parent_from_member

    -
    -

    Synopsis

    -
    // In header: <boost/intrusive/parent_from_member.hpp>
-
-
-template<typename Parent, typename Member> 
-  const Parent * 
-  get_parent_from_member(const Member * member, 
-                         const Member Parent::* ptr_to_member);
    -
    -

    Description

    -

    Given a const pointer to a member and its corresponding const pointer to data member, this function returns the const pointer of the parent containing that member. Note: this function does not work with pointer to members that rely on virtual inheritance.

    -
    -
    - - - -
    Copyright © 2005 Olaf Krzikalla
    Copyright © 2006-2015 Ion Gaztanaga

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/intrusive/get_parent_fro_idp55894848.html b/doc/html/boost/intrusive/get_parent_fro_idp55894848.html new file mode 100644 index 0000000000..df9a53189e --- /dev/null +++ b/doc/html/boost/intrusive/get_parent_fro_idp55894848.html @@ -0,0 +1,57 @@ + + + + +Function template get_parent_from_member + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Function template get_parent_from_member

    +

    boost::intrusive::get_parent_from_member

    +
    +

    Synopsis

    +
    // In header: <boost/intrusive/parent_from_member.hpp>
+
+
+template<typename Parent, typename Member> 
+  Parent * get_parent_from_member(Member * member, 
+                                  const Member Parent::* ptr_to_member);
    +
    +

    Description

    +

    Given a pointer to a member and its corresponding pointer to data member, this function returns the pointer of the parent containing that member. Note: this function does not work with pointer to members that rely on virtual inheritance.

    +
    +
    + + + +
    Copyright © 2005 Olaf Krzikalla
    Copyright © 2006-2015 Ion Gaztanaga

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/intrusive/get_parent_fro_idp55899120.html b/doc/html/boost/intrusive/get_parent_fro_idp55899120.html new file mode 100644 index 0000000000..110694d499 --- /dev/null +++ b/doc/html/boost/intrusive/get_parent_fro_idp55899120.html @@ -0,0 +1,58 @@ + + + + +Function template get_parent_from_member + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Function template get_parent_from_member

    +

    boost::intrusive::get_parent_from_member

    +
    +

    Synopsis

    +
    // In header: <boost/intrusive/parent_from_member.hpp>
+
+
+template<typename Parent, typename Member> 
+  const Parent * 
+  get_parent_from_member(const Member * member, 
+                         const Member Parent::* ptr_to_member);
    +
    +

    Description

    +

    Given a const pointer to a member and its corresponding const pointer to data member, this function returns the const pointer of the parent containing that member. Note: this function does not work with pointer to members that rely on virtual inheritance.

    +
    +
    + + + +
    Copyright © 2005 Olaf Krzikalla
    Copyright © 2006-2015 Ion Gaztanaga

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/intrusive/hashtable.html b/doc/html/boost/intrusive/hashtable.html index efde303c26..d2aaf4481d 100644 --- a/doc/html/boost/intrusive/hashtable.html +++ b/doc/html/boost/intrusive/hashtable.html @@ -67,105 +67,105 @@ typedef unspecified insert_commit_data; // construct/copy/destruct - explicit hashtable(const bucket_traits &, const hasher & = hasher(), + explicit hashtable(const bucket_traits &, const hasher & = hasher(), const key_equal & = key_equal(), const value_traits & = value_traits()); template<typename Iterator> - hashtable(bool, Iterator, Iterator, const bucket_traits &, + hashtable(bool, Iterator, Iterator, const bucket_traits &, const hasher & = hasher(), const key_equal & = key_equal(), const value_traits & = value_traits()); - hashtable(hashtable &&); - hashtable & operator=(hashtable &&); - ~hashtable(); + hashtable(hashtable &&); + hashtable & operator=(hashtable &&); + ~hashtable(); - // public member functions - iterator begin(); - const_iterator begin() const; - const_iterator cbegin() const; - iterator end(); - const_iterator end() const; - const_iterator cend() const; - hasher hash_function() const; - key_equal key_eq() const; - bool empty() const; - size_type size() const; - void swap(hashtable &); + // public member functions + iterator begin(); + const_iterator begin() const; + const_iterator cbegin() const; + iterator end(); + const_iterator end() const; + const_iterator cend() const; + hasher hash_function() const; + key_equal key_eq() const; + bool empty() const; + size_type size() const; + void swap(hashtable &); template<typename Cloner, typename Disposer> - void clone_from(const hashtable &, Cloner, Disposer); + void clone_from(const hashtable &, Cloner, Disposer); template<typename Cloner, typename Disposer> - void clone_from(hashtable &&, Cloner, Disposer); - iterator insert_equal(reference); - template<typename Iterator> void insert_equal(Iterator, Iterator); - std::pair< iterator, bool > insert_unique(reference); - template<typename Iterator> void insert_unique(Iterator, Iterator); + void clone_from(hashtable &&, Cloner, Disposer); + iterator insert_equal(reference); + template<typename Iterator> void insert_equal(Iterator, Iterator); + std::pair< iterator, bool > insert_unique(reference); + template<typename Iterator> void insert_unique(Iterator, Iterator); template<typename KeyType, typename KeyHasher, typename KeyEqual> std::pair< iterator, bool > - insert_unique_check(const KeyType &, KeyHasher, KeyEqual, + insert_unique_check(const KeyType &, KeyHasher, KeyEqual, insert_commit_data &); std::pair< iterator, bool > - insert_unique_check(const key_type &, insert_commit_data &); - iterator insert_unique_commit(reference, const insert_commit_data &); - void erase(const_iterator); - void erase(const_iterator, const_iterator); - size_type erase(const key_type &); + insert_unique_check(const key_type &, insert_commit_data &); + iterator insert_unique_commit(reference, const insert_commit_data &); + void erase(const_iterator); + void erase(const_iterator, const_iterator); + size_type erase(const key_type &); template<typename KeyType, typename KeyHasher, typename KeyEqual> - size_type erase(const KeyType &, KeyHasher, KeyEqual); - template<typename Disposer> void erase_and_dispose(const_iterator, Disposer); + size_type erase(const KeyType &, KeyHasher, KeyEqual); + template<typename Disposer> void erase_and_dispose(const_iterator, Disposer); template<typename Disposer> - void erase_and_dispose(const_iterator, const_iterator, Disposer); + void erase_and_dispose(const_iterator, const_iterator, Disposer); template<typename Disposer> - size_type erase_and_dispose(const key_type &, Disposer); + size_type erase_and_dispose(const key_type &, Disposer); template<typename KeyType, typename KeyHasher, typename KeyEqual, typename Disposer> - size_type erase_and_dispose(const KeyType &, KeyHasher, KeyEqual, + size_type erase_and_dispose(const KeyType &, KeyHasher, KeyEqual, Disposer); - void clear(); - template<typename Disposer> void clear_and_dispose(Disposer); - size_type count(const key_type &) const; + void clear(); + template<typename Disposer> void clear_and_dispose(Disposer); + size_type count(const key_type &) const; template<typename KeyType, typename KeyHasher, typename KeyEqual> - size_type count(const KeyType &, KeyHasher, KeyEqual) const; - iterator find(const key_type &); + size_type count(const KeyType &, KeyHasher, KeyEqual) const; + iterator find(const key_type &); template<typename KeyType, typename KeyHasher, typename KeyEqual> - iterator find(const KeyType &, KeyHasher, KeyEqual); - const_iterator find(const key_type &) const; + iterator find(const KeyType &, KeyHasher, KeyEqual); + const_iterator find(const key_type &) const; template<typename KeyType, typename KeyHasher, typename KeyEqual> - const_iterator find(const KeyType &, KeyHasher, KeyEqual) const; - std::pair< iterator, iterator > equal_range(const key_type &); + const_iterator find(const KeyType &, KeyHasher, KeyEqual) const; + std::pair< iterator, iterator > equal_range(const key_type &); template<typename KeyType, typename KeyHasher, typename KeyEqual> std::pair< iterator, iterator > - equal_range(const KeyType &, KeyHasher, KeyEqual); + equal_range(const KeyType &, KeyHasher, KeyEqual); std::pair< const_iterator, const_iterator > - equal_range(const key_type &) const; + equal_range(const key_type &) const; template<typename KeyType, typename KeyHasher, typename KeyEqual> std::pair< const_iterator, const_iterator > - equal_range(const KeyType &, KeyHasher, KeyEqual) const; - iterator iterator_to(reference); - const_iterator iterator_to(const_reference) const; - local_iterator local_iterator_to(reference); - const_local_iterator local_iterator_to(const_reference) const; - size_type bucket_count() const; - size_type bucket_size(size_type) const; - size_type bucket(const key_type &) const; + equal_range(const KeyType &, KeyHasher, KeyEqual) const; + iterator iterator_to(reference); + const_iterator iterator_to(const_reference) const; + local_iterator local_iterator_to(reference); + const_local_iterator local_iterator_to(const_reference) const; + size_type bucket_count() const; + size_type bucket_size(size_type) const; + size_type bucket(const key_type &) const; template<typename KeyType, typename KeyHasher> - size_type bucket(const KeyType &, KeyHasher) const; - bucket_ptr bucket_pointer() const; - local_iterator begin(size_type); - const_local_iterator begin(size_type) const; - const_local_iterator cbegin(size_type) const; - local_iterator end(size_type); - const_local_iterator end(size_type) const; - const_local_iterator cend(size_type) const; - void rehash(const bucket_traits &); - void full_rehash(); - bool incremental_rehash(bool = true); - bool incremental_rehash(const bucket_traits &); - size_type split_count() const; + size_type bucket(const KeyType &, KeyHasher) const; + bucket_ptr bucket_pointer() const; + local_iterator begin(size_type); + const_local_iterator begin(size_type) const; + const_local_iterator cbegin(size_type) const; + local_iterator end(size_type); + const_local_iterator end(size_type) const; + const_local_iterator cend(size_type) const; + void rehash(const bucket_traits &); + void full_rehash(); + bool incremental_rehash(bool = true); + bool incremental_rehash(const bucket_traits &); + size_type split_count() const; - // public static functions - static local_iterator s_local_iterator_to(reference); - static const_local_iterator s_local_iterator_to(const_reference); - static size_type suggested_upper_bucket_count(size_type); - static size_type suggested_lower_bucket_count(size_type); + // public static functions + static local_iterator s_local_iterator_to(reference); + static const_local_iterator s_local_iterator_to(const_reference); + static size_type suggested_upper_bucket_count(size_type); + static size_type suggested_lower_bucket_count(size_type); // public data members static const bool stateful_value_traits; @@ -195,7 +195,7 @@ construct/copy/destruct
    1. -
      explicit hashtable(const bucket_traits & b_traits, 
+
      explicit hashtable(const bucket_traits & b_traits, 
                    const hasher & hash_func = hasher(), 
                    const key_equal & equal_func = key_equal(), 
                    const value_traits & v_traits = value_traits());
      
@@ -207,7 +207,7 @@
 
    2. template<typename Iterator> 
-  hashtable(bool unique, Iterator b, Iterator e, 
+  hashtable(bool unique, Iterator b, Iterator e, 
             const bucket_traits & b_traits, 
             const hasher & hash_func = hasher(), 
             const key_equal & equal_func = key_equal(), 
@@ -219,17 +219,17 @@
 
      Notes: buckets array must be disposed only after *this is disposed.
    3. -
      hashtable(hashtable && x);
      +
      hashtable(hashtable && x);

      Effects: Constructs a container moving resources from another container. Internal value traits, bucket traits, hasher and comparison are move constructed and nodes belonging to x are linked to *this.

      Complexity: Constant.

      Throws: If value_traits::node_traits::node's move constructor throws (this does not happen with predefined Boost.Intrusive hooks) or the move constructor of value traits, bucket traits, hasher or comparison throws.

    4. -
      hashtable & operator=(hashtable && x);
      +
      hashtable & operator=(hashtable && x);

      Effects: Equivalent to swap.

    5. -
      ~hashtable();
      +
      ~hashtable();

      Effects: Detaches all elements from this. The objects in the unordered_set are not deleted (i.e. no destructors are called).

      Complexity: Linear to the number of elements in the unordered_set, if it's a safe-mode or auto-unlink value. Otherwise constant.

      Throws: Nothing.

      @@ -238,70 +238,70 @@

    -hashtable public member functions

    +hashtable public member functions
    1. -
      iterator begin();
      +
      iterator begin();

      Effects: Returns an iterator pointing to the beginning of the unordered_set.

      Complexity: Amortized constant time. Worst case (empty unordered_set): O(this->bucket_count())

      Throws: Nothing.

    2. -
      const_iterator begin() const;
      +
      const_iterator begin() const;

      Effects: Returns a const_iterator pointing to the beginning of the unordered_set.

      Complexity: Amortized constant time. Worst case (empty unordered_set): O(this->bucket_count())

      Throws: Nothing.

    3. -
      const_iterator cbegin() const;
      +
      const_iterator cbegin() const;

      Effects: Returns a const_iterator pointing to the beginning of the unordered_set.

      Complexity: Amortized constant time. Worst case (empty unordered_set): O(this->bucket_count())

      Throws: Nothing.

    4. -
      iterator end();
      +
      iterator end();

      Effects: Returns an iterator pointing to the end of the unordered_set.

      Complexity: Constant.

      Throws: Nothing.

    5. -
      const_iterator end() const;
      +
      const_iterator end() const;

      Effects: Returns a const_iterator pointing to the end of the unordered_set.

      Complexity: Constant.

      Throws: Nothing.

    6. -
      const_iterator cend() const;
      +
      const_iterator cend() const;

      Effects: Returns a const_iterator pointing to the end of the unordered_set.

      Complexity: Constant.

      Throws: Nothing.

    7. -
      hasher hash_function() const;
      +
      hasher hash_function() const;

      Effects: Returns the hasher object used by the unordered_set.

      Complexity: Constant.

      Throws: If hasher copy-constructor throws.

    8. -
      key_equal key_eq() const;
      +
      key_equal key_eq() const;

      Effects: Returns the key_equal object used by the unordered_set.

      Complexity: Constant.

      Throws: If key_equal copy-constructor throws.

    9. -
      bool empty() const;
      +
      bool empty() const;

      Effects: Returns true if the container is empty.

      Complexity: if constant-time size and cache_begin options are disabled, average constant time (worst case, with empty() == true: O(this->bucket_count()). Otherwise constant.

      Throws: Nothing.

    10. -
      size_type size() const;
      +
      size_type size() const;

      Effects: Returns the number of elements stored in the unordered_set.

      Complexity: Linear to elements contained in *this if constant_time_size is false. Constant-time otherwise.

      Throws: Nothing.

    11. -
      void swap(hashtable & other);
      +
      void swap(hashtable & other);

      Requires: the hasher and the equality function unqualified swap call should not throw.

      Effects: Swaps the contents of two unordered_sets. Swaps also the contained bucket array and equality and hasher functors.

      Complexity: Constant.

      @@ -309,7 +309,7 @@ 
    12. template<typename Cloner, typename Disposer> 
-  void clone_from(const hashtable & src, Cloner cloner, Disposer disposer);
      + void clone_from(const hashtable & src, Cloner cloner, Disposer disposer);

      Requires: Disposer::operator()(pointer) shouldn't throw Cloner should yield to nodes that compare equal and produce the same hash than the original node.

      Effects: Erases all the elements from *this calling Disposer::operator()(pointer), clones all the elements from src calling Cloner::operator()(const_reference ) and inserts them on *this. The hash function and the equality predicate are copied from the source.

      If store_hash option is true, this method does not use the hash function.

      @@ -319,7 +319,7 @@ 
    13. template<typename Cloner, typename Disposer> 
-  void clone_from(hashtable && src, Cloner cloner, Disposer disposer);
      + void clone_from(hashtable && src, Cloner cloner, Disposer disposer);

      Requires: Disposer::operator()(pointer) shouldn't throw Cloner should yield to nodes that compare equal and produce the same hash than the original node.

      Effects: Erases all the elements from *this calling Disposer::operator()(pointer), clones all the elements from src calling Cloner::operator()(reference) and inserts them on *this. The hash function and the equality predicate are copied from the source.

      If store_hash option is true, this method does not use the hash function.

      @@ -328,7 +328,7 @@

      Throws: If cloner or hasher throw or hash or equality predicate copying throws. Basic guarantee.

    14. -
      iterator insert_equal(reference value);
      +
      iterator insert_equal(reference value);

      Requires: value must be an lvalue

      Effects: Inserts the value into the unordered_set.

      Returns: An iterator to the inserted value.

      @@ -337,7 +337,7 @@

      Note: Does not affect the validity of iterators and references. No copy-constructors are called.

    15. -
      template<typename Iterator> void insert_equal(Iterator b, Iterator e);
      +
      template<typename Iterator> void insert_equal(Iterator b, Iterator e);

      Requires: Dereferencing iterator must yield an lvalue of type value_type.

      Effects: Equivalent to this->insert_equal(t) for each element in [b, e).

      Complexity: Average case O(N), where N is distance(b, e). Worst case O(N*this->size()).

      @@ -345,7 +345,7 @@

      Note: Does not affect the validity of iterators and references. No copy-constructors are called.

    16. -
      std::pair< iterator, bool > insert_unique(reference value);
      +
      std::pair< iterator, bool > insert_unique(reference value);

      Requires: value must be an lvalue

      Effects: Tries to inserts value into the unordered_set.

      Returns: If the value is not already present inserts it and returns a pair containing the iterator to the new value and true. If there is an equivalent value returns a pair containing an iterator to the already present value and false.

      @@ -354,7 +354,7 @@

      Note: Does not affect the validity of iterators and references. No copy-constructors are called.

    17. -
      template<typename Iterator> void insert_unique(Iterator b, Iterator e);
      +
      template<typename Iterator> void insert_unique(Iterator b, Iterator e);

      Requires: Dereferencing iterator must yield an lvalue of type value_type.

      Effects: Equivalent to this->insert_unique(t) for each element in [b, e).

      Complexity: Average case O(N), where N is distance(b, e). Worst case O(N*this->size()).

      @@ -364,7 +364,7 @@ 
    18. template<typename KeyType, typename KeyHasher, typename KeyEqual> 
   std::pair< iterator, bool > 
-  insert_unique_check(const KeyType & key, KeyHasher hash_func, 
+  insert_unique_check(const KeyType & key, KeyHasher hash_func, 
                       KeyEqual equal_func, insert_commit_data & commit_data);

      Requires: "hash_func" must be a hash function that induces the same hash values as the stored hasher. The difference is that "hash_func" hashes the given key instead of the value_type.

      "equal_func" must be a equality function that induces the same equality as key_equal. The difference is that "equal_func" compares an arbitrary key with the contained values.

      @@ -379,7 +379,7 @@ 
    19. std::pair< iterator, bool > 
-insert_unique_check(const key_type & key, insert_commit_data & commit_data);
      +insert_unique_check(const key_type & key, insert_commit_data & commit_data);

      Effects: Checks if a value can be inserted in the unordered_set, using a user provided key instead of the value itself.

      Returns: If there is an equivalent value returns a pair containing an iterator to the already present value and false. If the value can be inserted returns true in the returned pair boolean and fills "commit_data" that is meant to be used with the "insert_commit" function.

      Complexity: Average case O(1), worst case O(this->size()).

      @@ -390,7 +390,7 @@

      After a successful rehashing insert_commit_data remains valid.

    20. -
      iterator insert_unique_commit(reference value, 
+
      iterator insert_unique_commit(reference value, 
                               const insert_commit_data & commit_data);
      
 
      Requires: value must be an lvalue of type value_type. commit_data must have been obtained from a previous call to "insert_check". No objects should have been inserted or erased from the unordered_set between the "insert_check" that filled "commit_data" and the call to "insert_commit".
      
 
      Effects: Inserts the value in the unordered_set using the information obtained from the "commit_data" that a previous "insert_check" filled.
      
@@ -401,21 +401,21 @@
 
      After a successful rehashing insert_commit_data remains valid.
    21. -
      void erase(const_iterator i);
      +
      void erase(const_iterator i);

      Effects: Erases the element pointed to by i.

      Complexity: Average case O(1), worst case O(this->size()).

      Throws: Nothing.

      Note: Invalidates the iterators (but not the references) to the erased element. No destructors are called.

    22. -
      void erase(const_iterator b, const_iterator e);
      +
      void erase(const_iterator b, const_iterator e);

      Effects: Erases the range pointed to by b end e.

      Complexity: Average case O(distance(b, e)), worst case O(this->size()).

      Throws: Nothing.

      Note: Invalidates the iterators (but not the references) to the erased elements. No destructors are called.

    23. -
      size_type erase(const key_type & key);
      +
      size_type erase(const key_type & key);

      Effects: Erases all the elements with the given value.

      Returns: The number of erased elements.

      Complexity: Average case O(this->count(value)). Worst case O(this->size()).

      @@ -424,7 +424,7 @@ 
    24. template<typename KeyType, typename KeyHasher, typename KeyEqual> 
-  size_type erase(const KeyType & key, KeyHasher hash_func, 
+  size_type erase(const KeyType & key, KeyHasher hash_func, 
                   KeyEqual equal_func);

      Requires: "hash_func" must be a hash function that induces the same hash values as the stored hasher. The difference is that "hash_func" hashes the given key instead of the value_type.

      "equal_func" must be a equality function that induces the same equality as key_equal. The difference is that "equal_func" compares an arbitrary key with the contained values.

      @@ -436,7 +436,7 @@ 
    25. template<typename Disposer> 
-  void erase_and_dispose(const_iterator i, Disposer disposer);
      + void erase_and_dispose(const_iterator i, Disposer disposer);

      Requires: Disposer::operator()(pointer) shouldn't throw.

      Effects: Erases the element pointed to by i. Disposer::operator()(pointer) is called for the removed element.

      Complexity: Average case O(1), worst case O(this->size()).

      @@ -445,7 +445,7 @@ 
    26. template<typename Disposer> 
-  void erase_and_dispose(const_iterator b, const_iterator e, 
+  void erase_and_dispose(const_iterator b, const_iterator e, 
                          Disposer disposer);

      Requires: Disposer::operator()(pointer) shouldn't throw.

      Effects: Erases the range pointed to by b end e. Disposer::operator()(pointer) is called for the removed elements.

      @@ -455,7 +455,7 @@ 
    27. template<typename Disposer> 
-  size_type erase_and_dispose(const key_type & key, Disposer disposer);
      + size_type erase_and_dispose(const key_type & key, Disposer disposer);

      Requires: Disposer::operator()(pointer) shouldn't throw.

      Effects: Erases all the elements with the given value. Disposer::operator()(pointer) is called for the removed elements.

      Returns: The number of erased elements.

      @@ -466,7 +466,7 @@ 
    28. template<typename KeyType, typename KeyHasher, typename KeyEqual, 
          typename Disposer> 
-  size_type erase_and_dispose(const KeyType & key, KeyHasher hash_func, 
+  size_type erase_and_dispose(const KeyType & key, KeyHasher hash_func, 
                               KeyEqual equal_func, Disposer disposer);

      Requires: Disposer::operator()(pointer) shouldn't throw.

      Effects: Erases all the elements with the given key. according to the comparison functor "equal_func". Disposer::operator()(pointer) is called for the removed elements.

      @@ -476,14 +476,14 @@

      Note: Invalidates the iterators to the erased elements.

    29. -
      void clear();
      +
      void clear();

      Effects: Erases all of the elements.

      Complexity: Linear to the number of elements on the container. if it's a safe-mode or auto-unlink value_type. Constant time otherwise.

      Throws: Nothing.

      Note: Invalidates the iterators (but not the references) to the erased elements. No destructors are called.

    30. -
      template<typename Disposer> void clear_and_dispose(Disposer disposer);
      +
      template<typename Disposer> void clear_and_dispose(Disposer disposer);

      Requires: Disposer::operator()(pointer) shouldn't throw.

      Effects: Erases all of the elements.

      Complexity: Linear to the number of elements on the container. Disposer::operator()(pointer) is called for the removed elements.

      @@ -491,14 +491,14 @@

      Note: Invalidates the iterators (but not the references) to the erased elements. No destructors are called.

    31. -
      size_type count(const key_type & key) const;
      +
      size_type count(const key_type & key) const;

      Effects: Returns the number of contained elements with the given value

      Complexity: Average case O(1), worst case O(this->size()).

      Throws: If the internal hasher or the equality functor throws. 

    32. template<typename KeyType, typename KeyHasher, typename KeyEqual> 
-  size_type count(const KeyType & key, KeyHasher hash_func, 
+  size_type count(const KeyType & key, KeyHasher hash_func, 
                   KeyEqual equal_func) const;

      Requires: "hash_func" must be a hash function that induces the same hash values as the stored hasher. The difference is that "hash_func" hashes the given key instead of the value_type.

      "equal_func" must be a equality function that induces the same equality as key_equal. The difference is that "equal_func" compares an arbitrary key with the contained values.

      @@ -507,14 +507,14 @@

      Throws: If hash_func or equal throw.

    33. -
      iterator find(const key_type & key);
      +
      iterator find(const key_type & key);

      Effects: Finds an iterator to the first element is equal to "value" or end() if that element does not exist.

      Complexity: Average case O(1), worst case O(this->size()).

      Throws: If the internal hasher or the equality functor throws. 

    34. template<typename KeyType, typename KeyHasher, typename KeyEqual> 
-  iterator find(const KeyType & key, KeyHasher hash_func, KeyEqual equal_func);
      + iterator find(const KeyType & key, KeyHasher hash_func, KeyEqual equal_func);

      Requires: "hash_func" must be a hash function that induces the same hash values as the stored hasher. The difference is that "hash_func" hashes the given key instead of the value_type.

      "equal_func" must be a equality function that induces the same equality as key_equal. The difference is that "equal_func" compares an arbitrary key with the contained values.

      Effects: Finds an iterator to the first element whose key is "key" according to the given hash and equality functor or end() if that element does not exist.

      @@ -523,7 +523,7 @@

      Note: This function is used when constructing a value_type is expensive and the value_type can be compared with a cheaper key type. Usually this key is part of the value_type.

    35. -
      const_iterator find(const key_type & key) const;
      +
      const_iterator find(const key_type & key) const;

      Effects: Finds a const_iterator to the first element whose key is "key" or end() if that element does not exist.

      Complexity: Average case O(1), worst case O(this->size()).

      Throws: If the internal hasher or the equality functor throws.

      @@ -531,7 +531,7 @@ 
    36. template<typename KeyType, typename KeyHasher, typename KeyEqual> 
   const_iterator 
-  find(const KeyType & key, KeyHasher hash_func, KeyEqual equal_func) const;
      + find(const KeyType & key, KeyHasher hash_func, KeyEqual equal_func) const;

      Requires: "hash_func" must be a hash function that induces the same hash values as the stored hasher. The difference is that "hash_func" hashes the given key instead of the value_type.

      "equal_func" must be a equality function that induces the same equality as key_equal. The difference is that "equal_func" compares an arbitrary key with the contained values.

      Effects: Finds an iterator to the first element whose key is "key" according to the given hasher and equality functor or end() if that element does not exist.

      @@ -540,7 +540,7 @@

      Note: This function is used when constructing a value_type is expensive and the value_type can be compared with a cheaper key type. Usually this key is part of the value_type.

    37. -
      std::pair< iterator, iterator > equal_range(const key_type & key);
      +
      std::pair< iterator, iterator > equal_range(const key_type & key);

      Effects: Returns a range containing all elements with values equivalent to value. Returns std::make_pair(this->end(), this->end()) if no such elements exist.

      Complexity: Average case O(this->count(value)). Worst case O(this->size()).

      Throws: If the internal hasher or the equality functor throws.

      @@ -548,7 +548,7 @@ 
    38. template<typename KeyType, typename KeyHasher, typename KeyEqual> 
   std::pair< iterator, iterator > 
-  equal_range(const KeyType & key, KeyHasher hash_func, KeyEqual equal_func);
      + equal_range(const KeyType & key, KeyHasher hash_func, KeyEqual equal_func);

      Requires: "hash_func" must be a hash function that induces the same hash values as the stored hasher. The difference is that "hash_func" hashes the given key instead of the value_type.

      "equal_func" must be a equality function that induces the same equality as key_equal. The difference is that "equal_func" compares an arbitrary key with the contained values.

      Effects: Returns a range containing all elements with equivalent keys. Returns std::make_pair(this->end(), this->end()) if no such elements exist.

      @@ -558,7 +558,7 @@ 
    39. std::pair< const_iterator, const_iterator > 
-equal_range(const key_type & key) const;
      +equal_range(const key_type & key) const;

      Effects: Returns a range containing all elements with values equivalent to value. Returns std::make_pair(this->end(), this->end()) if no such elements exist.

      Complexity: Average case O(this->count(value)). Worst case O(this->size()).

      Throws: If the internal hasher or the equality functor throws.

      @@ -566,7 +566,7 @@ 
    40. template<typename KeyType, typename KeyHasher, typename KeyEqual> 
   std::pair< const_iterator, const_iterator > 
-  equal_range(const KeyType & key, KeyHasher hash_func, KeyEqual equal_func) const;
      + equal_range(const KeyType & key, KeyHasher hash_func, KeyEqual equal_func) const;

      Requires: "hash_func" must be a hash function that induces the same hash values as the stored hasher. The difference is that "hash_func" hashes the given key instead of the value_type.

      "equal_func" must be a equality function that induces the same equality as key_equal. The difference is that "equal_func" compares an arbitrary key with the contained values.

      Effects: Returns a range containing all elements with equivalent keys. Returns std::make_pair(this->end(), this->end()) if no such elements exist.

      @@ -575,48 +575,48 @@

      Note: This function is used when constructing a value_type is expensive and the value_type can be compared with a cheaper key type. Usually this key is part of the value_type.

    41. -
      iterator iterator_to(reference value);
      +
      iterator iterator_to(reference value);

      Requires: value must be an lvalue and shall be in a unordered_set of appropriate type. Otherwise the behavior is undefined.

      Effects: Returns: a valid iterator belonging to the unordered_set that points to the value

      Complexity: Constant.

      Throws: If the internal hash function throws.

    42. -
      const_iterator iterator_to(const_reference value) const;
      +
      const_iterator iterator_to(const_reference value) const;

      Requires: value must be an lvalue and shall be in a unordered_set of appropriate type. Otherwise the behavior is undefined.

      Effects: Returns: a valid const_iterator belonging to the unordered_set that points to the value

      Complexity: Constant.

      Throws: If the internal hash function throws.

    43. -
      local_iterator local_iterator_to(reference value);
      +
      local_iterator local_iterator_to(reference value);

      Requires: value must be an lvalue and shall be in a unordered_set of appropriate type. Otherwise the behavior is undefined.

      Effects: Returns: a valid local_iterator belonging to the unordered_set that points to the value

      Complexity: Constant.

      Throws: Nothing.

    44. -
      const_local_iterator local_iterator_to(const_reference value) const;
      +
      const_local_iterator local_iterator_to(const_reference value) const;

      Requires: value must be an lvalue and shall be in a unordered_set of appropriate type. Otherwise the behavior is undefined.

      Effects: Returns: a valid const_local_iterator belonging to the unordered_set that points to the value

      Complexity: Constant.

      Throws: Nothing.

    45. -
      size_type bucket_count() const;
      +
      size_type bucket_count() const;

      Effects: Returns the number of buckets passed in the constructor or the last rehash function.

      Complexity: Constant.

      Throws: Nothing.

    46. -
      size_type bucket_size(size_type n) const;
      +
      size_type bucket_size(size_type n) const;

      Requires: n is in the range [0, this->bucket_count()).

      Effects: Returns the number of elements in the nth bucket.

      Complexity: Constant.

      Throws: Nothing.

    47. -
      size_type bucket(const key_type & k) const;
      +
      size_type bucket(const key_type & k) const;

      Effects: Returns the index of the bucket in which elements with keys equivalent to k would be found, if any such element existed.

      Complexity: Constant.

      Throws: If the hash functor throws.

      @@ -624,7 +624,7 @@ 
    48. template<typename KeyType, typename KeyHasher> 
-  size_type bucket(const KeyType & k, KeyHasher hash_func) const;
      + size_type bucket(const KeyType & k, KeyHasher hash_func) const;

      Requires: "hash_func" must be a hash function that induces the same hash values as the stored hasher. The difference is that "hash_func" hashes the given key instead of the value_type.

      Effects: Returns the index of the bucket in which elements with keys equivalent to k would be found, if any such element existed.

      Complexity: Constant.

      @@ -632,13 +632,13 @@

      Note: the return value is in the range [0, this->bucket_count()).

    49. -
      bucket_ptr bucket_pointer() const;
      +
      bucket_ptr bucket_pointer() const;

      Effects: Returns the bucket array pointer passed in the constructor or the last rehash function.

      Complexity: Constant.

      Throws: Nothing.

    50. -
      local_iterator begin(size_type n);
      +
      local_iterator begin(size_type n);

      Requires: n is in the range [0, this->bucket_count()).

      Effects: Returns a local_iterator pointing to the beginning of the sequence stored in the bucket n.

      Complexity: Constant.

      @@ -646,7 +646,7 @@

      Note: [this->begin(n), this->end(n)) is a valid range containing all of the elements in the nth bucket.

    51. -
      const_local_iterator begin(size_type n) const;
      +
      const_local_iterator begin(size_type n) const;

      Requires: n is in the range [0, this->bucket_count()).

      Effects: Returns a const_local_iterator pointing to the beginning of the sequence stored in the bucket n.

      Complexity: Constant.

      @@ -654,7 +654,7 @@

      Note: [this->begin(n), this->end(n)) is a valid range containing all of the elements in the nth bucket.

    52. -
      const_local_iterator cbegin(size_type n) const;
      +
      const_local_iterator cbegin(size_type n) const;

      Requires: n is in the range [0, this->bucket_count()).

      Effects: Returns a const_local_iterator pointing to the beginning of the sequence stored in the bucket n.

      Complexity: Constant.

      @@ -662,7 +662,7 @@

      Note: [this->begin(n), this->end(n)) is a valid range containing all of the elements in the nth bucket.

    53. -
      local_iterator end(size_type n);
      +
      local_iterator end(size_type n);

      Requires: n is in the range [0, this->bucket_count()).

      Effects: Returns a local_iterator pointing to the end of the sequence stored in the bucket n.

      Complexity: Constant.

      @@ -670,7 +670,7 @@

      Note: [this->begin(n), this->end(n)) is a valid range containing all of the elements in the nth bucket.

    54. -
      const_local_iterator end(size_type n) const;
      +
      const_local_iterator end(size_type n) const;

      Requires: n is in the range [0, this->bucket_count()).

      Effects: Returns a const_local_iterator pointing to the end of the sequence stored in the bucket n.

      Complexity: Constant.

      @@ -678,7 +678,7 @@

      Note: [this->begin(n), this->end(n)) is a valid range containing all of the elements in the nth bucket.

    55. -
      const_local_iterator cend(size_type n) const;
      +
      const_local_iterator cend(size_type n) const;

      Requires: n is in the range [0, this->bucket_count()).

      Effects: Returns a const_local_iterator pointing to the end of the sequence stored in the bucket n.

      Complexity: Constant.

      @@ -686,7 +686,7 @@

      Note: [this->begin(n), this->end(n)) is a valid range containing all of the elements in the nth bucket.

    56. -
      void rehash(const bucket_traits & new_bucket_traits);
      +
      void rehash(const bucket_traits & new_bucket_traits);

      Requires: new_bucket_traits can hold a pointer to a new bucket array or the same as the old bucket array with a different length. new_size is the length of the the array pointed by new_buckets. If new_bucket_traits.bucket_begin() == this->bucket_pointer() new_bucket_traits.bucket_count() can be bigger or smaller than this->bucket_count(). 'new_bucket_traits' copy constructor should not throw.

      Effects: If new_bucket_traits.bucket_begin() == this->bucket_pointer() is false, unlinks values from the old bucket and inserts then in the new one according to the hash value of values.

      If new_bucket_traits.bucket_begin() == this->bucket_pointer() is true, the implementations avoids moving values as much as possible.

      @@ -697,7 +697,7 @@

      Throws: If the hasher functor throws. Basic guarantee.

    57. -
      void full_rehash();
      +
      void full_rehash();

      Note: This function is used when keys from inserted elements are changed (e.g. a language change when key is a string) but uniqueness and hash properties are preserved so a fast full rehash recovers invariants for *this without extracting and reinserting all elements again.

      Requires: Calls produced to the hash function should not alter the value uniqueness properties of already inserted elements. If hasher(key1) == hasher(key2) was true when elements were inserted, it shall be true during calls produced in the execution of this function.

      key_equal is not called inside this function so it is assumed that key_equal(value1, value2) should produce the same results as before for inserted elements.

      @@ -707,7 +707,7 @@

      Throws: If the hasher functor throws. Basic guarantee.

    58. -
      bool incremental_rehash(bool grow = true);
      +
      bool incremental_rehash(bool grow = true);

      Requires:

      Effects:

      Complexity:

      @@ -716,7 +716,7 @@

      grow

    59. -
      bool incremental_rehash(const bucket_traits & new_bucket_traits);
      +
      bool incremental_rehash(const bucket_traits & new_bucket_traits);

      Effects: If new_bucket_traits.bucket_count() is not this->bucket_count()/2 or this->bucket_count()*2, or this->split_bucket() != new_bucket_traits.bucket_count() returns false and does nothing.

      Otherwise, copy assigns new_bucket_traits to the internal bucket_traits and transfers all the objects from old buckets to the new ones.

      Complexity: Linear to size().

      @@ -724,7 +724,7 @@

      Note: this method is only available if incremental<true> option is activated.

    60. -
      size_type split_count() const;
      +
      size_type split_count() const;

      Requires: incremental<> option must be set

      Effects: returns the current split count

      Complexity: Constant

      @@ -734,10 +734,10 @@

    -hashtable public static functions

    +hashtable public static functions
    1. -
      static local_iterator s_local_iterator_to(reference value);
      +
      static local_iterator s_local_iterator_to(reference value);

      Requires: value must be an lvalue and shall be in a unordered_set of appropriate type. Otherwise the behavior is undefined.

      Effects: Returns: a valid local_iterator belonging to the unordered_set that points to the value

      Complexity: Constant.

      @@ -745,7 +745,7 @@

      Note: This static function is available only if the value traits is stateless.

    2. -
      static const_local_iterator s_local_iterator_to(const_reference value);
      +
      static const_local_iterator s_local_iterator_to(const_reference value);

      Requires: value must be an lvalue and shall be in a unordered_set of appropriate type. Otherwise the behavior is undefined.

      Effects: Returns: a valid const_local_iterator belonging to the unordered_set that points to the value

      Complexity: Constant.

      @@ -753,13 +753,13 @@

      Note: This static function is available only if the value traits is stateless.

    3. -
      static size_type suggested_upper_bucket_count(size_type n);
      +
      static size_type suggested_upper_bucket_count(size_type n);

      Effects: Returns the nearest new bucket count optimized for the container that is bigger or equal than n. This suggestion can be used to create bucket arrays with a size that will usually improve container's performance. If such value does not exist, the higher possible value is returned.

      Complexity: Amortized constant time.

      Throws: Nothing.

    4. -
      static size_type suggested_lower_bucket_count(size_type n);
      +
      static size_type suggested_lower_bucket_count(size_type n);

      Effects: Returns the nearest new bucket count optimized for the container that is smaller or equal than n. This suggestion can be used to create bucket arrays with a size that will usually improve container's performance. If such value does not exist, the lowest possible value is returned.

      Complexity: Amortized constant time.

      Throws: Nothing.

      diff --git a/doc/html/boost/intrusive/linear_slist_algorithms.html b/doc/html/boost/intrusive/linear_slist_algorithms.html index a3ecbc1eba..a247b61dc0 100644 --- a/doc/html/boost/intrusive/linear_slist_algorithms.html +++ b/doc/html/boost/intrusive/linear_slist_algorithms.html @@ -41,24 +41,24 @@ typedef NodeTraits::const_node_ptr const_node_ptr; typedef NodeTraits node_traits; - // public static functions - static void init(const node_ptr &); - static bool unique(const_node_ptr); - static bool inited(const_node_ptr); - static void unlink_after(const node_ptr &); - static void unlink_after(const node_ptr &, const node_ptr &); - static void link_after(const node_ptr &, const node_ptr &); - static void transfer_after(const node_ptr &, const node_ptr &, + // public static functions + static void init(const node_ptr &); + static bool unique(const_node_ptr); + static bool inited(const_node_ptr); + static void unlink_after(const node_ptr &); + static void unlink_after(const node_ptr &, const node_ptr &); + static void link_after(const node_ptr &, const node_ptr &); + static void transfer_after(const node_ptr &, const node_ptr &, const node_ptr &); - static void init_header(const node_ptr &); - static node_ptr get_previous_node(const node_ptr &, const node_ptr &); - static std::size_t count(const const_node_ptr &); - static void swap_trailing_nodes(const node_ptr &, const node_ptr &); - static node_ptr reverse(const node_ptr &); + static void init_header(const node_ptr &); + static node_ptr get_previous_node(const node_ptr &, const node_ptr &); + static std::size_t count(const const_node_ptr &); + static void swap_trailing_nodes(const node_ptr &, const node_ptr &); + static node_ptr reverse(const node_ptr &); static std::pair< node_ptr, node_ptr > - move_first_n_backwards(const node_ptr &, std::size_t); + move_first_n_backwards(const node_ptr &, std::size_t); static std::pair< node_ptr, node_ptr > - move_first_n_forward(const node_ptr &, std::size_t); + move_first_n_forward(const node_ptr &, std::size_t); };

    Description

    @@ -73,36 +73,36 @@

    static void set_next(node_ptr n, node_ptr next);

    -linear_slist_algorithms public static functions

    +linear_slist_algorithms public static functions
    1. -
      static void init(const node_ptr & this_node);
      +
      static void init(const node_ptr & this_node);

      Effects: Constructs an non-used list element, putting the next pointer to null: NodeTraits::get_next(this_node) == node_ptr()

      Complexity: Constant

      Throws: Nothing.

    2. -
      static bool unique(const_node_ptr this_node);
      +
      static bool unique(const_node_ptr this_node);

      Requires: this_node must be in a circular list or be an empty circular list.

      Effects: Returns true is "this_node" is the only node of a circular list: or it's a not inserted node: return node_ptr() == NodeTraits::get_next(this_node) || NodeTraits::get_next(this_node) == this_node

      Complexity: Constant

      Throws: Nothing.

    3. -
      static bool inited(const_node_ptr this_node);
      +
      static bool inited(const_node_ptr this_node);

      Effects: Returns true is "this_node" has the same state as if it was inited using "init(node_ptr)"

      Complexity: Constant

      Throws: Nothing.

    4. -
      static void unlink_after(const node_ptr & prev_node);
      +
      static void unlink_after(const node_ptr & prev_node);

      Requires: prev_node must be in a circular list or be an empty circular list.

      Effects: Unlinks the next node of prev_node from the circular list.

      Complexity: Constant

      Throws: Nothing.

    5. -
      static void unlink_after(const node_ptr & prev_node, 
+
      static void unlink_after(const node_ptr & prev_node, 
                          const node_ptr & last_node);
      
 
      Requires: prev_node and last_node must be in a circular list or be an empty circular list.
      
 
      Effects: Unlinks the range (prev_node, last_node) from the linear list.
      
@@ -110,14 +110,14 @@
 
      Throws: Nothing.
    6. -
      static void link_after(const node_ptr & prev_node, const node_ptr & this_node);
      +
      static void link_after(const node_ptr & prev_node, const node_ptr & this_node);

      Requires: prev_node must be a node of a linear list.

      Effects: Links this_node after prev_node in the linear list.

      Complexity: Constant

      Throws: Nothing.

    7. -
      static void transfer_after(const node_ptr & p, const node_ptr & b, 
+
      static void transfer_after(const node_ptr & p, const node_ptr & b, 
                            const node_ptr & e);
      
 
      Requires: b and e must be nodes of the same linear list or an empty range. and p must be a node of a different linear list.
      
 
      Effects: Removes the nodes from (b, e] range from their linear list and inserts them after p in p's linear list.
      
@@ -125,28 +125,28 @@
 
      Throws: Nothing.
    8. -
      static void init_header(const node_ptr & this_node);
      +
      static void init_header(const node_ptr & this_node);

      Effects: Constructs an empty list, making this_node the only node of the circular list: NodeTraits::get_next(this_node) == this_node.

      Complexity: Constant

      Throws: Nothing. 

    9. static node_ptr 
-get_previous_node(const node_ptr & prev_init_node, const node_ptr & this_node);
      +get_previous_node(const node_ptr & prev_init_node, const node_ptr & this_node);

      Requires: this_node and prev_init_node must be in the same linear list.

      Effects: Returns the previous node of this_node in the linear list starting. the search from prev_init_node. The first node checked for equality is NodeTraits::get_next(prev_init_node).

      Complexity: Linear to the number of elements between prev_init_node and this_node.

      Throws: Nothing.

    10. -
      static std::size_t count(const const_node_ptr & this_node);
      +
      static std::size_t count(const const_node_ptr & this_node);

      Requires: this_node must be in a linear list or be an empty linear list.

      Effects: Returns the number of nodes in a linear list. If the linear list is empty, returns 1.

      Complexity: Linear

      Throws: Nothing.

    11. -
      static void swap_trailing_nodes(const node_ptr & this_node, 
+
      static void swap_trailing_nodes(const node_ptr & this_node, 
                                 const node_ptr & other_node);
      
 
      Requires: this_node and other_node must be nodes inserted in linear lists or be empty linear lists.
      
 
      Effects: Moves all the nodes previously chained after this_node after other_node and vice-versa.
      
@@ -154,7 +154,7 @@
 
      Throws: Nothing.
    12. -
      static node_ptr reverse(const node_ptr & p);
      +
      static node_ptr reverse(const node_ptr & p);

      Effects: Reverses the order of elements in the list.

      Returns: The new first node of the list.

      Throws: Nothing.

      @@ -162,7 +162,7 @@ 
    13. static std::pair< node_ptr, node_ptr > 
-move_first_n_backwards(const node_ptr & p, std::size_t n);
      +move_first_n_backwards(const node_ptr & p, std::size_t n);

      Effects: Moves the first n nodes starting at p to the end of the list.

      Returns: A pair containing the new first and last node of the list or if there has been any movement, a null pair if n leads to no movement.

      Throws: Nothing.

      @@ -170,7 +170,7 @@ 
    14. static std::pair< node_ptr, node_ptr > 
-move_first_n_forward(const node_ptr & p, std::size_t n);
      +move_first_n_forward(const node_ptr & p, std::size_t n);

      Effects: Moves the first n nodes starting at p to the beginning of the list.

      Returns: A pair containing the new first and last node of the list or if there has been any movement, a null pair if n leads to no movement.

      Throws: Nothing.

      diff --git a/doc/html/boost/intrusive/list.html b/doc/html/boost/intrusive/list.html index b8c735c97a..853aa5abe3 100644 --- a/doc/html/boost/intrusive/list.html +++ b/doc/html/boost/intrusive/list.html @@ -56,90 +56,90 @@ typedef unspecified header_holder_type; // construct/copy/destruct - list(); - explicit list(const value_traits &); + list(); + explicit list(const value_traits &); template<typename Iterator> - list(Iterator, Iterator, const value_traits & = value_traits()); - list(list &&); - list & operator=(list &&); - ~list(); + list(Iterator, Iterator, const value_traits & = value_traits()); + list(list &&); + list & operator=(list &&); + ~list(); - // public member functions - void push_back(reference); - void push_front(reference); - void pop_back(); - template<typename Disposer> void pop_back_and_dispose(Disposer); - void pop_front(); - template<typename Disposer> void pop_front_and_dispose(Disposer); - reference front(); - const_reference front() const; - reference back(); - const_reference back() const; - iterator begin(); - const_iterator begin() const; - const_iterator cbegin() const; - iterator end(); - const_iterator end() const; - const_iterator cend() const; - reverse_iterator rbegin(); - const_reverse_iterator rbegin() const; - const_reverse_iterator crbegin() const; - reverse_iterator rend(); - const_reverse_iterator rend() const; - const_reverse_iterator crend() const; - size_type size() const; - bool empty() const; - void swap(list &); - void shift_backwards(size_type = 1); - void shift_forward(size_type = 1); - iterator erase(const_iterator); - iterator erase(const_iterator, const_iterator); - iterator erase(const_iterator, const_iterator, size_type); + // public member functions + void push_back(reference); + void push_front(reference); + void pop_back(); + template<typename Disposer> void pop_back_and_dispose(Disposer); + void pop_front(); + template<typename Disposer> void pop_front_and_dispose(Disposer); + reference front(); + const_reference front() const; + reference back(); + const_reference back() const; + iterator begin(); + const_iterator begin() const; + const_iterator cbegin() const; + iterator end(); + const_iterator end() const; + const_iterator cend() const; + reverse_iterator rbegin(); + const_reverse_iterator rbegin() const; + const_reverse_iterator crbegin() const; + reverse_iterator rend(); + const_reverse_iterator rend() const; + const_reverse_iterator crend() const; + size_type size() const; + bool empty() const; + void swap(list &); + void shift_backwards(size_type = 1); + void shift_forward(size_type = 1); + iterator erase(const_iterator); + iterator erase(const_iterator, const_iterator); + iterator erase(const_iterator, const_iterator, size_type); template<typename Disposer> - iterator erase_and_dispose(const_iterator, Disposer); + iterator erase_and_dispose(const_iterator, Disposer); template<typename Disposer> - iterator erase_and_dispose(const_iterator, const_iterator, Disposer); - void clear(); - template<typename Disposer> void clear_and_dispose(Disposer); + iterator erase_and_dispose(const_iterator, const_iterator, Disposer); + void clear(); + template<typename Disposer> void clear_and_dispose(Disposer); template<typename Cloner, typename Disposer> - void clone_from(const list &, Cloner, Disposer); + void clone_from(const list &, Cloner, Disposer); template<typename Cloner, typename Disposer> - void clone_from(list &&, Cloner, Disposer); - iterator insert(const_iterator, reference); - template<typename Iterator> void insert(const_iterator, Iterator, Iterator); - template<typename Iterator> void assign(Iterator, Iterator); + void clone_from(list &&, Cloner, Disposer); + iterator insert(const_iterator, reference); + template<typename Iterator> void insert(const_iterator, Iterator, Iterator); + template<typename Iterator> void assign(Iterator, Iterator); template<typename Iterator, typename Disposer> - void dispose_and_assign(Disposer, Iterator, Iterator); - void splice(const_iterator, list &); - void splice(const_iterator, list &, const_iterator); - void splice(const_iterator, list &, const_iterator, const_iterator); - void splice(const_iterator, list &, const_iterator, const_iterator, + void dispose_and_assign(Disposer, Iterator, Iterator); + void splice(const_iterator, list &); + void splice(const_iterator, list &, const_iterator); + void splice(const_iterator, list &, const_iterator, const_iterator); + void splice(const_iterator, list &, const_iterator, const_iterator, size_type); - void sort(); - template<typename Predicate> void sort(Predicate); - void merge(list &); - template<typename Predicate> void merge(list &, Predicate); - void reverse(); - void remove(const_reference); + void sort(); + template<typename Predicate> void sort(Predicate); + void merge(list &); + template<typename Predicate> void merge(list &, Predicate); + void reverse(); + void remove(const_reference); template<typename Disposer> - void remove_and_dispose(const_reference, Disposer); - template<typename Pred> void remove_if(Pred); + void remove_and_dispose(const_reference, Disposer); + template<typename Pred> void remove_if(Pred); template<typename Pred, typename Disposer> - void remove_and_dispose_if(Pred, Disposer); - void unique(); - template<typename BinaryPredicate> void unique(BinaryPredicate); - template<typename Disposer> void unique_and_dispose(Disposer); + void remove_and_dispose_if(Pred, Disposer); + void unique(); + template<typename BinaryPredicate> void unique(BinaryPredicate); + template<typename Disposer> void unique_and_dispose(Disposer); template<typename BinaryPredicate, typename Disposer> - void unique_and_dispose(BinaryPredicate, Disposer); - iterator iterator_to(reference); - const_iterator iterator_to(const_reference) const; - void check() const; + void unique_and_dispose(BinaryPredicate, Disposer); + iterator iterator_to(reference); + const_iterator iterator_to(const_reference) const; + void check() const; - // public static functions - static list & container_from_end_iterator(iterator); - static const list & container_from_end_iterator(const_iterator); - static iterator s_iterator_to(reference); - static const_iterator s_iterator_to(const_reference); + // public static functions + static list & container_from_end_iterator(iterator); + static const list & container_from_end_iterator(const_iterator); + static iterator s_iterator_to(reference); + static const_iterator s_iterator_to(const_reference); // public data members static const bool constant_time_size; @@ -158,37 +158,37 @@ construct/copy/destruct
      1. -
        list();
        +
        list();

        Effects: constructs an empty list.

        Complexity: Constant

        Throws: If value_traits::node_traits::node constructor throws (this does not happen with predefined Boost.Intrusive hooks).

      2. -
        explicit list(const value_traits & v_traits);
        +
        explicit list(const value_traits & v_traits);

        Effects: constructs an empty list.

        Complexity: Constant

        Throws: If value_traits::node_traits::node constructor throws (this does not happen with predefined Boost.Intrusive hooks). 

      3. template<typename Iterator> 
-  list(Iterator b, Iterator e, const value_traits & v_traits = value_traits());
        + list(Iterator b, Iterator e, const value_traits & v_traits = value_traits());

        Requires: Dereferencing iterator must yield an lvalue of type value_type.

        Effects: Constructs a list equal to the range [first,last).

        Complexity: Linear in distance(b, e). No copy constructors are called.

        Throws: If value_traits::node_traits::node constructor throws (this does not happen with predefined Boost.Intrusive hooks).

      4. -
        list(list && x);
        +
        list(list && x);

        Effects: Constructs a container moving resources from another container. Internal value traits are move constructed and nodes belonging to x (except the node representing the "end") are linked to *this.

        Complexity: Constant.

        Throws: If value_traits::node_traits::node's move constructor throws (this does not happen with predefined Boost.Intrusive hooks) or the move constructor of value traits throws.

      5. -
        list & operator=(list && x);
        +
        list & operator=(list && x);

        Effects: Equivalent to swap

      6. -
        ~list();
        +
        ~list();

        Effects: If it's not a safe-mode or an auto-unlink value_type the destructor does nothing (ie. no code is generated). Otherwise it detaches all elements from this. In this case the objects in the list are not deleted (i.e. no destructors are called), but the hooks according to the ValueTraits template parameter are set to their default value.

        Complexity: Linear to the number of elements in the list, if it's a safe-mode or auto-unlink value . Otherwise constant.

        7. @@ -196,10 +196,10 @@

      -list public member functions

      +list public member functions
      1. -
        void push_back(reference value);
        +
        void push_back(reference value);

        Requires: value must be an lvalue.

        Effects: Inserts the value in the back of the list. No copy constructors are called.

        Throws: Nothing.

        @@ -207,7 +207,7 @@

        Note: Does not affect the validity of iterators and references.

      2. -
        void push_front(reference value);
        +
        void push_front(reference value);

        Requires: value must be an lvalue.

        Effects: Inserts the value in the front of the list. No copy constructors are called.

        Throws: Nothing.

        @@ -215,14 +215,14 @@

        Note: Does not affect the validity of iterators and references.

      3. -
        void pop_back();
        +
        void pop_back();

        Effects: Erases the last element of the list. No destructors are called.

        Throws: Nothing.

        Complexity: Constant.

        Note: Invalidates the iterators (but not the references) to the erased element.

      4. -
        template<typename Disposer> void pop_back_and_dispose(Disposer disposer);
        +
        template<typename Disposer> void pop_back_and_dispose(Disposer disposer);

        Requires: Disposer::operator()(pointer) shouldn't throw.

        Effects: Erases the last element of the list. No destructors are called. Disposer::operator()(pointer) is called for the removed element.

        Throws: Nothing.

        @@ -230,14 +230,14 @@

        Note: Invalidates the iterators to the erased element.

      5. -
        void pop_front();
        +
        void pop_front();

        Effects: Erases the first element of the list. No destructors are called.

        Throws: Nothing.

        Complexity: Constant.

        Note: Invalidates the iterators (but not the references) to the erased element.

      6. -
        template<typename Disposer> void pop_front_and_dispose(Disposer disposer);
        +
        template<typename Disposer> void pop_front_and_dispose(Disposer disposer);

        Requires: Disposer::operator()(pointer) shouldn't throw.

        Effects: Erases the first element of the list. No destructors are called. Disposer::operator()(pointer) is called for the removed element.

        Throws: Nothing.

        @@ -245,138 +245,138 @@

        Note: Invalidates the iterators to the erased element.

      7. -
        reference front();
        +
        reference front();

        Effects: Returns a reference to the first element of the list.

        Throws: Nothing.

        Complexity: Constant.

      8. -
        const_reference front() const;
        +
        const_reference front() const;

        Effects: Returns a const_reference to the first element of the list.

        Throws: Nothing.

        Complexity: Constant.

      9. -
        reference back();
        +
        reference back();

        Effects: Returns a reference to the last element of the list.

        Throws: Nothing.

        Complexity: Constant.

      10. -
        const_reference back() const;
        +
        const_reference back() const;

        Effects: Returns a const_reference to the last element of the list.

        Throws: Nothing.

        Complexity: Constant.

      11. -
        iterator begin();
        +
        iterator begin();

        Effects: Returns an iterator to the first element contained in the list.

        Throws: Nothing.

        Complexity: Constant.

      12. -
        const_iterator begin() const;
        +
        const_iterator begin() const;

        Effects: Returns a const_iterator to the first element contained in the list.

        Throws: Nothing.

        Complexity: Constant.

      13. -
        const_iterator cbegin() const;
        +
        const_iterator cbegin() const;

        Effects: Returns a const_iterator to the first element contained in the list.

        Throws: Nothing.

        Complexity: Constant.

      14. -
        iterator end();
        +
        iterator end();

        Effects: Returns an iterator to the end of the list.

        Throws: Nothing.

        Complexity: Constant.

      15. -
        const_iterator end() const;
        +
        const_iterator end() const;

        Effects: Returns a const_iterator to the end of the list.

        Throws: Nothing.

        Complexity: Constant.

      16. -
        const_iterator cend() const;
        +
        const_iterator cend() const;

        Effects: Returns a constant iterator to the end of the list.

        Throws: Nothing.

        Complexity: Constant.

      17. -
        reverse_iterator rbegin();
        +
        reverse_iterator rbegin();

        Effects: Returns a reverse_iterator pointing to the beginning of the reversed list.

        Throws: Nothing.

        Complexity: Constant.

      18. -
        const_reverse_iterator rbegin() const;
        +
        const_reverse_iterator rbegin() const;

        Effects: Returns a const_reverse_iterator pointing to the beginning of the reversed list.

        Throws: Nothing.

        Complexity: Constant.

      19. -
        const_reverse_iterator crbegin() const;
        +
        const_reverse_iterator crbegin() const;

        Effects: Returns a const_reverse_iterator pointing to the beginning of the reversed list.

        Throws: Nothing.

        Complexity: Constant.

      20. -
        reverse_iterator rend();
        +
        reverse_iterator rend();

        Effects: Returns a reverse_iterator pointing to the end of the reversed list.

        Throws: Nothing.

        Complexity: Constant.

      21. -
        const_reverse_iterator rend() const;
        +
        const_reverse_iterator rend() const;

        Effects: Returns a const_reverse_iterator pointing to the end of the reversed list.

        Throws: Nothing.

        Complexity: Constant.

      22. -
        const_reverse_iterator crend() const;
        +
        const_reverse_iterator crend() const;

        Effects: Returns a const_reverse_iterator pointing to the end of the reversed list.

        Throws: Nothing.

        Complexity: Constant.

      23. -
        size_type size() const;
        +
        size_type size() const;

        Effects: Returns the number of the elements contained in the list.

        Throws: Nothing.

        Complexity: Linear to the number of elements contained in the list. if constant-time size option is disabled. Constant time otherwise.

        Note: Does not affect the validity of iterators and references.

      24. -
        bool empty() const;
        +
        bool empty() const;

        Effects: Returns true if the list contains no elements.

        Throws: Nothing.

        Complexity: Constant.

        Note: Does not affect the validity of iterators and references.

      25. -
        void swap(list & other);
        +
        void swap(list & other);

        Effects: Swaps the elements of x and *this.

        Throws: Nothing.

        Complexity: Constant.

        Note: Does not affect the validity of iterators and references.

      26. -
        void shift_backwards(size_type n = 1);
        +
        void shift_backwards(size_type n = 1);

        Effects: Moves backwards all the elements, so that the first element becomes the second, the second becomes the third... the last element becomes the first one.

        Throws: Nothing.

        Complexity: Linear to the number of shifts.

        Note: Does not affect the validity of iterators and references.

      27. -
        void shift_forward(size_type n = 1);
        +
        void shift_forward(size_type n = 1);

        Effects: Moves forward all the elements, so that the second element becomes the first, the third becomes the second... the first element becomes the last one.

        Throws: Nothing.

        Complexity: Linear to the number of shifts.

        Note: Does not affect the validity of iterators and references.

      28. -
        iterator erase(const_iterator i);
        +
        iterator erase(const_iterator i);

        Effects: Erases the element pointed by i of the list. No destructors are called.

        Returns: the first element remaining beyond the removed element, or end() if no such element exists.

        Throws: Nothing.

        @@ -384,7 +384,7 @@

        Note: Invalidates the iterators (but not the references) to the erased element.

      29. -
        iterator erase(const_iterator b, const_iterator e);
        +
        iterator erase(const_iterator b, const_iterator e);

        Requires: b and e must be valid iterators to elements in *this.

        Effects: Erases the element range pointed by b and e No destructors are called.

        Returns: the first element remaining beyond the removed elements, or end() if no such element exists.

        @@ -393,7 +393,7 @@

        Note: Invalidates the iterators (but not the references) to the erased elements.

      30. -
        iterator erase(const_iterator b, const_iterator e, size_type n);
        +
        iterator erase(const_iterator b, const_iterator e, size_type n);

        Requires: b and e must be valid iterators to elements in *this. n must be distance(b, e).

        Effects: Erases the element range pointed by b and e No destructors are called.

        Returns: the first element remaining beyond the removed elements, or end() if no such element exists.

        @@ -403,7 +403,7 @@ 
      31. template<typename Disposer> 
-  iterator erase_and_dispose(const_iterator i, Disposer disposer);
        + iterator erase_and_dispose(const_iterator i, Disposer disposer);

        Requires: Disposer::operator()(pointer) shouldn't throw.

        Effects: Erases the element pointed by i of the list. No destructors are called. Disposer::operator()(pointer) is called for the removed element.

        Returns: the first element remaining beyond the removed element, or end() if no such element exists.

        @@ -413,7 +413,7 @@ 
      32. template<typename Disposer> 
-  iterator erase_and_dispose(const_iterator b, const_iterator e, 
+  iterator erase_and_dispose(const_iterator b, const_iterator e, 
                              Disposer disposer);

        Requires: Disposer::operator()(pointer) shouldn't throw.

        Effects: Erases the element range pointed by b and e No destructors are called. Disposer::operator()(pointer) is called for the removed elements.

        @@ -423,14 +423,14 @@

        Note: Invalidates the iterators to the erased elements.

      33. -
        void clear();
        +
        void clear();

        Effects: Erases all the elements of the container. No destructors are called.

        Throws: Nothing.

        Complexity: Linear to the number of elements of the list. if it's a safe-mode or auto-unlink value_type. Constant time otherwise.

        Note: Invalidates the iterators (but not the references) to the erased elements.

      34. -
        template<typename Disposer> void clear_and_dispose(Disposer disposer);
        +
        template<typename Disposer> void clear_and_dispose(Disposer disposer);

        Requires: Disposer::operator()(pointer) shouldn't throw.

        Effects: Erases all the elements of the container. No destructors are called. Disposer::operator()(pointer) is called for the removed elements.

        Throws: Nothing.

        @@ -439,7 +439,7 @@ 
      35. template<typename Cloner, typename Disposer> 
-  void clone_from(const list & src, Cloner cloner, Disposer disposer);
        + void clone_from(const list & src, Cloner cloner, Disposer disposer);

        Requires: Disposer::operator()(pointer) shouldn't throw. Cloner should yield to nodes equivalent to the original nodes.

        Effects: Erases all the elements from *this calling Disposer::operator()(pointer), clones all the elements from src calling Cloner::operator()(const_reference ) and inserts them on *this.

        If cloner throws, all cloned elements are unlinked and disposed calling Disposer::operator()(pointer).

        @@ -448,7 +448,7 @@ 
      36. template<typename Cloner, typename Disposer> 
-  void clone_from(list && src, Cloner cloner, Disposer disposer);
        + void clone_from(list && src, Cloner cloner, Disposer disposer);

        Requires: Disposer::operator()(pointer) shouldn't throw. Cloner should yield to nodes equivalent to the original nodes.

        Effects: Erases all the elements from *this calling Disposer::operator()(pointer), clones all the elements from src calling Cloner::operator()(reference) and inserts them on *this.

        If cloner throws, all cloned elements are unlinked and disposed calling Disposer::operator()(pointer).

        @@ -456,7 +456,7 @@

        Throws: If cloner throws. Basic guarantee.

      37. -
        iterator insert(const_iterator p, reference value);
        +
        iterator insert(const_iterator p, reference value);

        Requires: value must be an lvalue and p must be a valid iterator of *this.

        Effects: Inserts the value before the position pointed by p.

        Returns: An iterator to the inserted element.

        @@ -466,7 +466,7 @@ 
      38. template<typename Iterator> 
-  void insert(const_iterator p, Iterator b, Iterator e);
        + void insert(const_iterator p, Iterator b, Iterator e);

        Requires: Dereferencing iterator must yield an lvalue of type value_type and p must be a valid iterator of *this.

        Effects: Inserts the range pointed by b and e before the position p. No copy constructors are called.

        Throws: Nothing.

        @@ -474,7 +474,7 @@

        Note: Does not affect the validity of iterators and references.

      39. -
        template<typename Iterator> void assign(Iterator b, Iterator e);
        +
        template<typename Iterator> void assign(Iterator b, Iterator e);

        Requires: Dereferencing iterator must yield an lvalue of type value_type.

        Effects: Clears the list and inserts the range pointed by b and e. No destructors or copy constructors are called.

        Throws: Nothing.

        @@ -483,7 +483,7 @@ 
      40. template<typename Iterator, typename Disposer> 
-  void dispose_and_assign(Disposer disposer, Iterator b, Iterator e);
        + void dispose_and_assign(Disposer disposer, Iterator b, Iterator e);

        Requires: Disposer::operator()(pointer) shouldn't throw.

        Requires: Dereferencing iterator must yield an lvalue of type value_type.

        Effects: Clears the list and inserts the range pointed by b and e. No destructors or copy constructors are called. Disposer::operator()(pointer) is called for the removed elements.

        @@ -492,7 +492,7 @@

        Note: Invalidates the iterators (but not the references) to the erased elements.

      41. -
        void splice(const_iterator p, list & x);
        +
        void splice(const_iterator p, list & x);

        Requires: p must be a valid iterator of *this.

        Effects: Transfers all the elements of list x to this list, before the the element pointed by p. No destructors or copy constructors are called.

        Throws: Nothing.

        @@ -500,7 +500,7 @@

        Note: Iterators of values obtained from list x now point to elements of this list. Iterators of this list and all the references are not invalidated.

      42. -
        void splice(const_iterator p, list & x, const_iterator new_ele);
        +
        void splice(const_iterator p, list & x, const_iterator new_ele);

        Requires: p must be a valid iterator of *this. new_ele must point to an element contained in list x.

        Effects: Transfers the value pointed by new_ele, from list x to this list, before the element pointed by p. No destructors or copy constructors are called. If p == new_ele or p == ++new_ele, this function is a null operation.

        Throws: Nothing.

        @@ -508,7 +508,7 @@

        Note: Iterators of values obtained from list x now point to elements of this list. Iterators of this list and all the references are not invalidated.

      43. -
        void splice(const_iterator p, list & x, const_iterator f, const_iterator e);
        +
        void splice(const_iterator p, list & x, const_iterator f, const_iterator e);

        Requires: p must be a valid iterator of *this. f and e must point to elements contained in list x.

        Effects: Transfers the range pointed by f and e from list x to this list, before the element pointed by p. No destructors or copy constructors are called.

        Throws: Nothing.

        @@ -516,7 +516,7 @@

        Note: Iterators of values obtained from list x now point to elements of this list. Iterators of this list and all the references are not invalidated.

      44. -
        void splice(const_iterator p, list & x, const_iterator f, const_iterator e, 
+
        void splice(const_iterator p, list & x, const_iterator f, const_iterator e, 
             size_type n);
        
 
        Requires: p must be a valid iterator of *this. f and e must point to elements contained in list x. n == distance(f, e)
        
 
        Effects: Transfers the range pointed by f and e from list x to this list, before the element pointed by p. No destructors or copy constructors are called.
        
@@ -525,14 +525,14 @@
 
        Note: Iterators of values obtained from list x now point to elements of this list. Iterators of this list and all the references are not invalidated.
      45. -
        void sort();
        +
        void sort();

        Effects: This function sorts the list *this according to std::less<value_type>. The sort is stable, that is, the relative order of equivalent elements is preserved.

        Throws: If value_traits::node_traits::node constructor throws (this does not happen with predefined Boost.Intrusive hooks) or std::less<value_type> throws. Basic guarantee.

        Notes: Iterators and references are not invalidated.

        Complexity: The number of comparisons is approximately N log N, where N is the list's size.

      46. -
        template<typename Predicate> void sort(Predicate p);
        +
        template<typename Predicate> void sort(Predicate p);

        Requires: p must be a comparison function that induces a strict weak ordering

        Effects: This function sorts the list *this according to p. The sort is stable, that is, the relative order of equivalent elements is preserved.

        Throws: If value_traits::node_traits::node constructor throws (this does not happen with predefined Boost.Intrusive hooks) or the predicate throws. Basic guarantee.

        @@ -540,14 +540,14 @@

        Complexity: The number of comparisons is approximately N log N, where N is the list's size.

      47. -
        void merge(list & x);
        +
        void merge(list & x);

        Effects: This function removes all of x's elements and inserts them in order into *this according to std::less<value_type>. The merge is stable; that is, if an element from *this is equivalent to one from x, then the element from *this will precede the one from x.

        Throws: If std::less<value_type> throws. Basic guarantee.

        Complexity: This function is linear time: it performs at most size() + x.size() - 1 comparisons.

        Note: Iterators and references are not invalidated

      48. -
        template<typename Predicate> void merge(list & x, Predicate p);
        +
        template<typename Predicate> void merge(list & x, Predicate p);

        Requires: p must be a comparison function that induces a strict weak ordering and both *this and x must be sorted according to that ordering The lists x and *this must be distinct.

        Effects: This function removes all of x's elements and inserts them in order into *this. The merge is stable; that is, if an element from *this is equivalent to one from x, then the element from *this will precede the one from x.

        Throws: If the predicate throws. Basic guarantee.

        @@ -555,14 +555,14 @@

        Note: Iterators and references are not invalidated.

      49. -
        void reverse();
        +
        void reverse();

        Effects: Reverses the order of elements in the list.

        Throws: Nothing.

        Complexity: This function is linear time.

        Note: Iterators and references are not invalidated

      50. -
        void remove(const_reference value);
        +
        void remove(const_reference value);

        Effects: Removes all the elements that compare equal to value. No destructors are called.

        Throws: If std::equal_to<value_type> throws. Basic guarantee.

        Complexity: Linear time. It performs exactly size() comparisons for equality.

        @@ -570,7 +570,7 @@ 
      51. template<typename Disposer> 
-  void remove_and_dispose(const_reference value, Disposer disposer);
        + void remove_and_dispose(const_reference value, Disposer disposer);

        Requires: Disposer::operator()(pointer) shouldn't throw.

        Effects: Removes all the elements that compare equal to value. Disposer::operator()(pointer) is called for every removed element.

        Throws: If std::equal_to<value_type> throws. Basic guarantee.

        @@ -578,7 +578,7 @@

        Note: The relative order of elements that are not removed is unchanged, and iterators to elements that are not removed remain valid.

      52. -
        template<typename Pred> void remove_if(Pred pred);
        +
        template<typename Pred> void remove_if(Pred pred);

        Effects: Removes all the elements for which a specified predicate is satisfied. No destructors are called.

        Throws: If pred throws. Basic guarantee.

        Complexity: Linear time. It performs exactly size() calls to the predicate.

        @@ -586,7 +586,7 @@ 
      53. template<typename Pred, typename Disposer> 
-  void remove_and_dispose_if(Pred pred, Disposer disposer);
        + void remove_and_dispose_if(Pred pred, Disposer disposer);

        Requires: Disposer::operator()(pointer) shouldn't throw.

        Effects: Removes all the elements for which a specified predicate is satisfied. Disposer::operator()(pointer) is called for every removed element.

        Throws: If pred throws. Basic guarantee.

        @@ -594,21 +594,21 @@

        Note: The relative order of elements that are not removed is unchanged, and iterators to elements that are not removed remain valid.

      54. -
        void unique();
        +
        void unique();

        Effects: Removes adjacent duplicate elements or adjacent elements that are equal from the list. No destructors are called.

        Throws: If std::equal_to<value_type throws. Basic guarantee.

        Complexity: Linear time (size()-1 comparisons calls to pred()).

        Note: The relative order of elements that are not removed is unchanged, and iterators to elements that are not removed remain valid.

      55. -
        template<typename BinaryPredicate> void unique(BinaryPredicate pred);
        +
        template<typename BinaryPredicate> void unique(BinaryPredicate pred);

        Effects: Removes adjacent duplicate elements or adjacent elements that satisfy some binary predicate from the list. No destructors are called.

        Throws: If pred throws. Basic guarantee.

        Complexity: Linear time (size()-1 comparisons equality comparisons).

        Note: The relative order of elements that are not removed is unchanged, and iterators to elements that are not removed remain valid.

      56. -
        template<typename Disposer> void unique_and_dispose(Disposer disposer);
        +
        template<typename Disposer> void unique_and_dispose(Disposer disposer);

        Requires: Disposer::operator()(pointer) shouldn't throw.

        Effects: Removes adjacent duplicate elements or adjacent elements that are equal from the list. Disposer::operator()(pointer) is called for every removed element.

        Throws: If std::equal_to<value_type throws. Basic guarantee.

        @@ -617,7 +617,7 @@ 
      57. template<typename BinaryPredicate, typename Disposer> 
-  void unique_and_dispose(BinaryPredicate pred, Disposer disposer);
        + void unique_and_dispose(BinaryPredicate pred, Disposer disposer);

        Requires: Disposer::operator()(pointer) shouldn't throw.

        Effects: Removes adjacent duplicate elements or adjacent elements that satisfy some binary predicate from the list. Disposer::operator()(pointer) is called for every removed element.

        Throws: If pred throws. Basic guarantee.

        @@ -625,7 +625,7 @@

        Note: The relative order of elements that are not removed is unchanged, and iterators to elements that are not removed remain valid.

      58. -
        iterator iterator_to(reference value);
        +
        iterator iterator_to(reference value);

        Requires: value must be a reference to a value inserted in a list.

        Effects: This function returns a const_iterator pointing to the element

        Throws: Nothing.

        @@ -633,7 +633,7 @@

        Note: Iterators and references are not invalidated.

      59. -
        const_iterator iterator_to(const_reference value) const;
        +
        const_iterator iterator_to(const_reference value) const;

        Requires: value must be a const reference to a value inserted in a list.

        Effects: This function returns an iterator pointing to the element.

        Throws: Nothing.

        @@ -641,7 +641,7 @@

        Note: Iterators and references are not invalidated.

      60. -
        void check() const;
        +
        void check() const;

        Effects: Asserts the integrity of the container.

        Complexity: Linear time.

        Note: The method has no effect when asserts are turned off (e.g., with NDEBUG). Experimental function, interface might change in future versions.

        @@ -650,24 +650,24 @@

      -list public static functions

      +list public static functions
      1. -
        static list & container_from_end_iterator(iterator end_iterator);
        +
        static list & container_from_end_iterator(iterator end_iterator);

        Precondition: end_iterator must be a valid end iterator of list.

        Effects: Returns a const reference to the list associated to the end iterator

        Throws: Nothing.

        Complexity: Constant.

      2. -
        static const list & container_from_end_iterator(const_iterator end_iterator);
        +
        static const list & container_from_end_iterator(const_iterator end_iterator);

        Precondition: end_iterator must be a valid end const_iterator of list.

        Effects: Returns a const reference to the list associated to the end iterator

        Throws: Nothing.

        Complexity: Constant.

      3. -
        static iterator s_iterator_to(reference value);
        +
        static iterator s_iterator_to(reference value);

        Requires: value must be a reference to a value inserted in a list.

        Effects: This function returns a const_iterator pointing to the element

        Throws: Nothing.

        @@ -675,7 +675,7 @@

        Note: Iterators and references are not invalidated. This static function is available only if the value traits is stateless.

      4. -
        static const_iterator s_iterator_to(const_reference value);
        +
        static const_iterator s_iterator_to(const_reference value);

        Requires: value must be a const reference to a value inserted in a list.

        Effects: This function returns an iterator pointing to the element.

        Throws: Nothing.

        diff --git a/doc/html/boost/intrusive/list_base_hook.html b/doc/html/boost/intrusive/list_base_hook.html index 0965a20f08..523304a57f 100644 --- a/doc/html/boost/intrusive/list_base_hook.html +++ b/doc/html/boost/intrusive/list_base_hook.html @@ -36,15 +36,15 @@ class list_base_hook : public make_list_base_hook::type< O1, O2, O3 > { public: // construct/copy/destruct - list_base_hook(); - list_base_hook(const list_base_hook &); - list_base_hook & operator=(const list_base_hook &); - ~list_base_hook(); + list_base_hook(); + list_base_hook(const list_base_hook &); + list_base_hook & operator=(const list_base_hook &); + ~list_base_hook(); - // public member functions - void swap_nodes(list_base_hook &); - bool is_linked() const; - void unlink(); + // public member functions + void swap_nodes(list_base_hook &); + bool is_linked() const; + void unlink(); };

      Description

      @@ -60,24 +60,24 @@ construct/copy/destruct
      1. -
        list_base_hook();
        +
        list_base_hook();

        Effects: If link_mode is auto_unlink or safe_link initializes the node to an unlinked state.

        Throws: Nothing.

      2. -
        list_base_hook(const list_base_hook &);
        +
        list_base_hook(const list_base_hook &);

        Effects: If link_mode is auto_unlink or safe_link initializes the node to an unlinked state. The argument is ignored.

        Throws: Nothing.

        Rationale: Providing a copy-constructor makes classes using the hook STL-compliant without forcing the user to do some additional work. swap can be used to emulate move-semantics.

      3. -
        list_base_hook & operator=(const list_base_hook &);
        +
        list_base_hook & operator=(const list_base_hook &);

        Effects: Empty function. The argument is ignored.

        Throws: Nothing.

        Rationale: Providing an assignment operator makes classes using the hook STL-compliant without forcing the user to do some additional work. swap can be used to emulate move-semantics.

      4. -
        ~list_base_hook();
        +
        ~list_base_hook();

        Effects: If link_mode is normal_link, the destructor does nothing (ie. no code is generated). If link_mode is safe_link and the object is stored in an list an assertion is raised. If link_mode is auto_unlink and is_linked() is true, the node is unlinked.

        Throws: Nothing.

        5. @@ -85,22 +85,22 @@

      -list_base_hook public member functions

      +list_base_hook public member functions
      1. -
        void swap_nodes(list_base_hook & other);
        +
        void swap_nodes(list_base_hook & other);

        Effects: Swapping two nodes swaps the position of the elements related to those nodes in one or two containers. That is, if the node this is part of the element e1, the node x is part of the element e2 and both elements are included in the containers s1 and s2, then after the swap-operation e1 is in s2 at the position of e2 and e2 is in s1 at the position of e1. If one element is not in a container, then after the swap-operation the other element is not in a container. Iterators to e1 and e2 related to those nodes are invalidated.

        Complexity: Constant

        Throws: Nothing.

      2. -
        bool is_linked() const;
        +
        bool is_linked() const;

        Precondition: link_mode must be safe_link or auto_unlink.

        Returns: true, if the node belongs to a container, false otherwise. This function can be used to test whether list::iterator_to will return a valid iterator.

        Complexity: Constant

      3. -
        void unlink();
        +
        void unlink();

        Effects: Removes the node if it's inserted in a container. This function is only allowed if link_mode is auto_unlink.

        Throws: Nothing.

        4. diff --git a/doc/html/boost/intrusive/list_member_hook.html b/doc/html/boost/intrusive/list_member_hook.html index 2a2dcba123..0018ddacaf 100644 --- a/doc/html/boost/intrusive/list_member_hook.html +++ b/doc/html/boost/intrusive/list_member_hook.html @@ -36,15 +36,15 @@ class list_member_hook : public make_list_member_hook::type< O1, O2, O3 > { public: // construct/copy/destruct - list_member_hook(); - list_member_hook(const list_member_hook &); - list_member_hook & operator=(const list_member_hook &); - ~list_member_hook(); + list_member_hook(); + list_member_hook(const list_member_hook &); + list_member_hook & operator=(const list_member_hook &); + ~list_member_hook(); - // public member functions - void swap_nodes(list_member_hook &); - bool is_linked() const; - void unlink(); + // public member functions + void swap_nodes(list_member_hook &); + bool is_linked() const; + void unlink(); };

      Description

      @@ -59,24 +59,24 @@ construct/copy/destruct
      1. -
        list_member_hook();
        +
        list_member_hook();

        Effects: If link_mode is auto_unlink or safe_link initializes the node to an unlinked state.

        Throws: Nothing.

      2. -
        list_member_hook(const list_member_hook &);
        +
        list_member_hook(const list_member_hook &);

        Effects: If link_mode is auto_unlink or safe_link initializes the node to an unlinked state. The argument is ignored.

        Throws: Nothing.

        Rationale: Providing a copy-constructor makes classes using the hook STL-compliant without forcing the user to do some additional work. swap can be used to emulate move-semantics.

      3. -
        list_member_hook & operator=(const list_member_hook &);
        +
        list_member_hook & operator=(const list_member_hook &);

        Effects: Empty function. The argument is ignored.

        Throws: Nothing.

        Rationale: Providing an assignment operator makes classes using the hook STL-compliant without forcing the user to do some additional work. swap can be used to emulate move-semantics.

      4. -
        ~list_member_hook();
        +
        ~list_member_hook();

        Effects: If link_mode is normal_link, the destructor does nothing (ie. no code is generated). If link_mode is safe_link and the object is stored in an list an assertion is raised. If link_mode is auto_unlink and is_linked() is true, the node is unlinked.

        Throws: Nothing.

        5. @@ -84,22 +84,22 @@

      -list_member_hook public member functions

      +list_member_hook public member functions
      1. -
        void swap_nodes(list_member_hook & other);
        +
        void swap_nodes(list_member_hook & other);

        Effects: Swapping two nodes swaps the position of the elements related to those nodes in one or two containers. That is, if the node this is part of the element e1, the node x is part of the element e2 and both elements are included in the containers s1 and s2, then after the swap-operation e1 is in s2 at the position of e2 and e2 is in s1 at the position of e1. If one element is not in a container, then after the swap-operation the other element is not in a container. Iterators to e1 and e2 related to those nodes are invalidated.

        Complexity: Constant

        Throws: Nothing.

      2. -
        bool is_linked() const;
        +
        bool is_linked() const;

        Precondition: link_mode must be safe_link or auto_unlink.

        Returns: true, if the node belongs to a container, false otherwise. This function can be used to test whether list::iterator_to will return a valid iterator.

        Complexity: Constant

      3. -
        void unlink();
        +
        void unlink();

        Effects: Removes the node if it's inserted in a container. This function is only allowed if link_mode is auto_unlink.

        Throws: Nothing.

        4. diff --git a/doc/html/boost/intrusive/make_unordered_idp65807072.html b/doc/html/boost/intrusive/make_unordered_idp65807072.html deleted file mode 100644 index dd4856dc58..0000000000 --- a/doc/html/boost/intrusive/make_unordered_idp65807072.html +++ /dev/null @@ -1,58 +0,0 @@ - - - - -Struct template make_unordered_set_base_hook - - - - - - - - - - - - - - - -
        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
        -
        -
        -PrevUpHomeNext -
        -
        -
        -
        -

        Struct template make_unordered_set_base_hook

        -

        boost::intrusive::make_unordered_set_base_hook

        -
        -

        Synopsis

        -
        // In header: <boost/intrusive/unordered_set_hook.hpp>
-
-template<class... Options> 
-struct make_unordered_set_base_hook {
-  // types
-  typedef implementation_defined type;
-};
        -
        -

        Description

        -

        Helper metafunction to define a unordered_set_base_hook that yields to the same type when the same options (either explicitly or implicitly) are used.

        -
        -
        - - - -
        Copyright © 2005 Olaf Krzikalla
        Copyright © 2006-2015 Ion Gaztanaga

        - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

        -
        -
        -
        -PrevUpHomeNext -
        - - diff --git a/doc/html/boost/intrusive/make_unordered_idp65862816.html b/doc/html/boost/intrusive/make_unordered_idp65862816.html deleted file mode 100644 index 60453e2092..0000000000 --- a/doc/html/boost/intrusive/make_unordered_idp65862816.html +++ /dev/null @@ -1,58 +0,0 @@ - - - - -Struct template make_unordered_set_member_hook - - - - - - - - - - - - - - - -
        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
        -
        -
        -PrevUpHomeNext -
        -
        -
        -
        -

        Struct template make_unordered_set_member_hook

        -

        boost::intrusive::make_unordered_set_member_hook

        -
        -

        Synopsis

        -
        // In header: <boost/intrusive/unordered_set_hook.hpp>
-
-template<class... Options> 
-struct make_unordered_set_member_hook {
-  // types
-  typedef implementation_defined type;
-};
        -
        -

        Description

        -

        Helper metafunction to define a unordered_set_member_hook that yields to the same type when the same options (either explicitly or implicitly) are used.

        -
        -
        - - - -
        Copyright © 2005 Olaf Krzikalla
        Copyright © 2006-2015 Ion Gaztanaga

        - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

        -
        -
        -
        -PrevUpHomeNext -
        - - diff --git a/doc/html/boost/intrusive/make_unordered_idp66587792.html b/doc/html/boost/intrusive/make_unordered_idp66587792.html new file mode 100644 index 0000000000..2dc837cb57 --- /dev/null +++ b/doc/html/boost/intrusive/make_unordered_idp66587792.html @@ -0,0 +1,58 @@ + + + + +Struct template make_unordered_set_base_hook + + + + + + + + + + + + + + + +
        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
        +
        +
        +PrevUpHomeNext +
        +
        +
        +
        +

        Struct template make_unordered_set_base_hook

        +

        boost::intrusive::make_unordered_set_base_hook

        +
        +

        Synopsis

        +
        // In header: <boost/intrusive/unordered_set_hook.hpp>
+
+template<class... Options> 
+struct make_unordered_set_base_hook {
+  // types
+  typedef implementation_defined type;
+};
        +
        +

        Description

        +

        Helper metafunction to define a unordered_set_base_hook that yields to the same type when the same options (either explicitly or implicitly) are used.

        +
        +
        + + + +
        Copyright © 2005 Olaf Krzikalla
        Copyright © 2006-2015 Ion Gaztanaga

        + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

        +
        +
        +
        +PrevUpHomeNext +
        + + diff --git a/doc/html/boost/intrusive/make_unordered_idp66643536.html b/doc/html/boost/intrusive/make_unordered_idp66643536.html new file mode 100644 index 0000000000..332d66b2f7 --- /dev/null +++ b/doc/html/boost/intrusive/make_unordered_idp66643536.html @@ -0,0 +1,58 @@ + + + + +Struct template make_unordered_set_member_hook + + + + + + + + + + + + + + + +
        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
        +
        +
        +PrevUpHomeNext +
        +
        +
        +
        +

        Struct template make_unordered_set_member_hook

        +

        boost::intrusive::make_unordered_set_member_hook

        +
        +

        Synopsis

        +
        // In header: <boost/intrusive/unordered_set_hook.hpp>
+
+template<class... Options> 
+struct make_unordered_set_member_hook {
+  // types
+  typedef implementation_defined type;
+};
        +
        +

        Description

        +

        Helper metafunction to define a unordered_set_member_hook that yields to the same type when the same options (either explicitly or implicitly) are used.

        +
        +
        + + + +
        Copyright © 2005 Olaf Krzikalla
        Copyright © 2006-2015 Ion Gaztanaga

        + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

        +
        +
        +
        +PrevUpHomeNext +
        + + diff --git a/doc/html/boost/intrusive/make_unordered_multiset.html b/doc/html/boost/intrusive/make_unordered_multiset.html index e5a7bdd1b3..9e3ee54597 100644 --- a/doc/html/boost/intrusive/make_unordered_multiset.html +++ b/doc/html/boost/intrusive/make_unordered_multiset.html @@ -8,7 +8,7 @@ - + @@ -21,7 +21,7 @@
        -PrevUpHomeNext +PrevUpHomeNext
        @@ -52,7 +52,7 @@
        -PrevUpHomeNext +PrevUpHomeNext
        diff --git a/doc/html/boost/intrusive/max_pointer_pl_idp55128640.html b/doc/html/boost/intrusive/max_pointer_pl_idp55128640.html deleted file mode 100644 index 6d56af7813..0000000000 --- a/doc/html/boost/intrusive/max_pointer_pl_idp55128640.html +++ /dev/null @@ -1,59 +0,0 @@ - - - - -Struct template max_pointer_plus_bits<void *, Alignment> - - - - - - - - - - - - - - - -
        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
        -
        -
        -PrevUpHomeNext -
        -
        -
        -
        -

        Struct template max_pointer_plus_bits<void *, Alignment>

        -

        boost::intrusive::max_pointer_plus_bits<void *, Alignment>

        -
        -

        Synopsis

        -
        // In header: <boost/intrusive/pointer_plus_bits.hpp>
-
-template<std::size_t Alignment> 
-struct max_pointer_plus_bits<void *, Alignment> {
-
-  // public data members
-  static const std::size_t value;
-};
        -
        -

        Description

        -

        This is a specialization for raw pointers. Raw pointers can embed extra bits in the lower bits if the alignment is multiple of 2pow(NumBits).

        -
        -
        - - - -
        Copyright © 2005 Olaf Krzikalla
        Copyright © 2006-2015 Ion Gaztanaga

        - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

        -
        -
        -
        -PrevUpHomeNext -
        - - diff --git a/doc/html/boost/intrusive/max_pointer_pl_idp55909360.html b/doc/html/boost/intrusive/max_pointer_pl_idp55909360.html new file mode 100644 index 0000000000..a10652ccb2 --- /dev/null +++ b/doc/html/boost/intrusive/max_pointer_pl_idp55909360.html @@ -0,0 +1,59 @@ + + + + +Struct template max_pointer_plus_bits<void *, Alignment> + + + + + + + + + + + + + + + +
        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
        +
        +
        +PrevUpHomeNext +
        +
        +
        +
        +

        Struct template max_pointer_plus_bits<void *, Alignment>

        +

        boost::intrusive::max_pointer_plus_bits<void *, Alignment>

        +
        +

        Synopsis

        +
        // In header: <boost/intrusive/pointer_plus_bits.hpp>
+
+template<std::size_t Alignment> 
+struct max_pointer_plus_bits<void *, Alignment> {
+
+  // public data members
+  static const std::size_t value;
+};
        +
        +

        Description

        +

        This is a specialization for raw pointers. Raw pointers can embed extra bits in the lower bits if the alignment is multiple of 2pow(NumBits).

        +
        +
        + + + +
        Copyright © 2005 Olaf Krzikalla
        Copyright © 2006-2015 Ion Gaztanaga

        + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

        +
        +
        +
        +PrevUpHomeNext +
        + + diff --git a/doc/html/boost/intrusive/max_pointer_plus_bits.html b/doc/html/boost/intrusive/max_pointer_plus_bits.html index abf1f532b7..d266f3d667 100644 --- a/doc/html/boost/intrusive/max_pointer_plus_bits.html +++ b/doc/html/boost/intrusive/max_pointer_plus_bits.html @@ -7,8 +7,8 @@ - - + + @@ -21,7 +21,7 @@
        -PrevUpHomeNext +PrevUpHomeNext
        @@ -53,7 +53,7 @@
        -PrevUpHomeNext +PrevUpHomeNext
        diff --git a/doc/html/boost/intrusive/member_value_traits.html b/doc/html/boost/intrusive/member_value_traits.html index 4cdadf4b67..caab53702b 100644 --- a/doc/html/boost/intrusive/member_value_traits.html +++ b/doc/html/boost/intrusive/member_value_traits.html @@ -48,11 +48,11 @@ typedef value_type & reference; typedef const value_type & const_reference; - // public static functions - static node_ptr to_node_ptr(reference); - static const_node_ptr to_node_ptr(const_reference); - static pointer to_value_ptr(const node_ptr &); - static const_pointer to_value_ptr(const const_node_ptr &); + // public static functions + static node_ptr to_node_ptr(reference); + static const_node_ptr to_node_ptr(const_reference); + static pointer to_value_ptr(const node_ptr &); + static const_pointer to_value_ptr(const const_node_ptr &); // public data members static const link_mode_type link_mode; @@ -62,12 +62,12 @@

        This value traits template is used to create value traits from user defined node traits where value_traits::value_type will store a node_traits::node

        -member_value_traits public static functions

        +member_value_traits public static functions
          -
        1. static node_ptr to_node_ptr(reference value);
          2. -
        2. static const_node_ptr to_node_ptr(const_reference value);
          3. -
        3. static pointer to_value_ptr(const node_ptr & n);
          4. -
        4. static const_pointer to_value_ptr(const const_node_ptr & n);
          5. +
        5. static node_ptr to_node_ptr(reference value);
          6. +
        6. static const_node_ptr to_node_ptr(const_reference value);
          7. +
        7. static pointer to_value_ptr(const node_ptr & n);
          8. +
        8. static const_pointer to_value_ptr(const const_node_ptr & n);
        diff --git a/doc/html/boost/intrusive/multiset.html b/doc/html/boost/intrusive/multiset.html index 7071be84e8..be7e4ba0ef 100644 --- a/doc/html/boost/intrusive/multiset.html +++ b/doc/html/boost/intrusive/multiset.html @@ -60,120 +60,120 @@ typedef implementation_defined::node_algorithms node_algorithms; // construct/copy/destruct - multiset(); - explicit multiset(const key_compare &, + multiset(); + explicit multiset(const key_compare &, const value_traits & = value_traits()); template<typename Iterator> - multiset(Iterator, Iterator, const key_compare & = key_compare(), + multiset(Iterator, Iterator, const key_compare & = key_compare(), const value_traits & = value_traits()); - multiset(multiset &&); - multiset & operator=(multiset &&); - ~multiset(); + multiset(multiset &&); + multiset & operator=(multiset &&); + ~multiset(); - // public member functions - iterator begin(); - const_iterator begin() const; - const_iterator cbegin() const; - iterator end(); - const_iterator end() const; - const_iterator cend() const; - reverse_iterator rbegin(); - const_reverse_iterator rbegin() const; - const_reverse_iterator crbegin() const; - reverse_iterator rend(); - const_reverse_iterator rend() const; - const_reverse_iterator crend() const; - iterator root(); - const_iterator root() const; - const_iterator croot() const; - key_compare key_comp() const; - value_compare value_comp() const; - bool empty() const; - size_type size() const; - void swap(multiset &); + // public member functions + iterator begin(); + const_iterator begin() const; + const_iterator cbegin() const; + iterator end(); + const_iterator end() const; + const_iterator cend() const; + reverse_iterator rbegin(); + const_reverse_iterator rbegin() const; + const_reverse_iterator crbegin() const; + reverse_iterator rend(); + const_reverse_iterator rend() const; + const_reverse_iterator crend() const; + iterator root(); + const_iterator root() const; + const_iterator croot() const; + key_compare key_comp() const; + value_compare value_comp() const; + bool empty() const; + size_type size() const; + void swap(multiset &); template<typename Cloner, typename Disposer> - void clone_from(const multiset &, Cloner, Disposer); + void clone_from(const multiset &, Cloner, Disposer); template<typename Cloner, typename Disposer> - void clone_from(multiset &&, Cloner, Disposer); - iterator insert(reference); - iterator insert(const_iterator, reference); - template<typename Iterator> void insert(Iterator, Iterator); - iterator insert_before(const_iterator, reference); - void push_back(reference); - void push_front(reference); - iterator erase(const_iterator); - iterator erase(const_iterator, const_iterator); - size_type erase(const key_type &); + void clone_from(multiset &&, Cloner, Disposer); + iterator insert(reference); + iterator insert(const_iterator, reference); + template<typename Iterator> void insert(Iterator, Iterator); + iterator insert_before(const_iterator, reference); + void push_back(reference); + void push_front(reference); + iterator erase(const_iterator); + iterator erase(const_iterator, const_iterator); + size_type erase(const key_type &); template<typename KeyType, typename KeyTypeKeyCompare> - size_type erase(const KeyType &, KeyTypeKeyCompare); + size_type erase(const KeyType &, KeyTypeKeyCompare); template<typename Disposer> - iterator erase_and_dispose(const_iterator, Disposer); + iterator erase_and_dispose(const_iterator, Disposer); template<typename Disposer> - iterator erase_and_dispose(const_iterator, const_iterator, Disposer); + iterator erase_and_dispose(const_iterator, const_iterator, Disposer); template<typename Disposer> - size_type erase_and_dispose(const key_type &, Disposer); + size_type erase_and_dispose(const key_type &, Disposer); template<typename KeyType, typename KeyTypeKeyCompare, typename Disposer> - size_type erase_and_dispose(const KeyType &, KeyTypeKeyCompare, Disposer); - void clear(); - template<typename Disposer> void clear_and_dispose(Disposer); - size_type count(const key_type &) const; + size_type erase_and_dispose(const KeyType &, KeyTypeKeyCompare, Disposer); + void clear(); + template<typename Disposer> void clear_and_dispose(Disposer); + size_type count(const key_type &) const; template<typename KeyType, typename KeyTypeKeyCompare> - size_type count(const KeyType &, KeyTypeKeyCompare) const; - iterator lower_bound(const key_type &); + size_type count(const KeyType &, KeyTypeKeyCompare) const; + iterator lower_bound(const key_type &); template<typename KeyType, typename KeyTypeKeyCompare> - iterator lower_bound(const KeyType &, KeyTypeKeyCompare); - const_iterator lower_bound(const key_type &) const; + iterator lower_bound(const KeyType &, KeyTypeKeyCompare); + const_iterator lower_bound(const key_type &) const; template<typename KeyType, typename KeyTypeKeyCompare> - const_iterator lower_bound(const KeyType &, KeyTypeKeyCompare) const; - iterator upper_bound(const key_type &); + const_iterator lower_bound(const KeyType &, KeyTypeKeyCompare) const; + iterator upper_bound(const key_type &); template<typename KeyType, typename KeyTypeKeyCompare> - iterator upper_bound(const KeyType &, KeyTypeKeyCompare); - const_iterator upper_bound(const key_type &) const; + iterator upper_bound(const KeyType &, KeyTypeKeyCompare); + const_iterator upper_bound(const key_type &) const; template<typename KeyType, typename KeyTypeKeyCompare> - const_iterator upper_bound(const KeyType &, KeyTypeKeyCompare) const; - iterator find(const key_type &); + const_iterator upper_bound(const KeyType &, KeyTypeKeyCompare) const; + iterator find(const key_type &); template<typename KeyType, typename KeyTypeKeyCompare> - iterator find(const KeyType &, KeyTypeKeyCompare); - const_iterator find(const key_type &) const; + iterator find(const KeyType &, KeyTypeKeyCompare); + const_iterator find(const key_type &) const; template<typename KeyType, typename KeyTypeKeyCompare> - const_iterator find(const KeyType &, KeyTypeKeyCompare) const; - std::pair< iterator, iterator > equal_range(const key_type &); + const_iterator find(const KeyType &, KeyTypeKeyCompare) const; + std::pair< iterator, iterator > equal_range(const key_type &); template<typename KeyType, typename KeyTypeKeyCompare> std::pair< iterator, iterator > - equal_range(const KeyType &, KeyTypeKeyCompare); + equal_range(const KeyType &, KeyTypeKeyCompare); std::pair< const_iterator, const_iterator > - equal_range(const key_type &) const; + equal_range(const key_type &) const; template<typename KeyType, typename KeyTypeKeyCompare> std::pair< const_iterator, const_iterator > - equal_range(const KeyType &, KeyTypeKeyCompare) const; + equal_range(const KeyType &, KeyTypeKeyCompare) const; std::pair< iterator, iterator > - bounded_range(const key_type &, const key_type &, bool, bool); + bounded_range(const key_type &, const key_type &, bool, bool); template<typename KeyType, typename KeyTypeKeyCompare> std::pair< iterator, iterator > - bounded_range(const KeyType &, const KeyType &, KeyTypeKeyCompare, bool, + bounded_range(const KeyType &, const KeyType &, KeyTypeKeyCompare, bool, bool); std::pair< const_iterator, const_iterator > - bounded_range(const key_type &, const key_type &, bool, bool) const; + bounded_range(const key_type &, const key_type &, bool, bool) const; template<typename KeyType, typename KeyTypeKeyCompare> std::pair< const_iterator, const_iterator > - bounded_range(const KeyType &, const KeyType &, KeyTypeKeyCompare, bool, + bounded_range(const KeyType &, const KeyType &, KeyTypeKeyCompare, bool, bool) const; - iterator iterator_to(reference); - const_iterator iterator_to(const_reference) const; - pointer unlink_leftmost_without_rebalance(); - void replace_node(iterator, reference); - void remove_node(reference); - template<class... Options2> void merge(multiset< T, Options2...> &); - template<class... Options2> void merge(set< T, Options2...> &); + iterator iterator_to(reference); + const_iterator iterator_to(const_reference) const; + pointer unlink_leftmost_without_rebalance(); + void replace_node(iterator, reference); + void remove_node(reference); + template<class... Options2> void merge(multiset< T, Options2...> &); + template<class... Options2> void merge(set< T, Options2...> &); - // public static functions - static multiset & container_from_end_iterator(iterator); - static const multiset & container_from_end_iterator(const_iterator); - static multiset & container_from_iterator(iterator); - static const multiset & container_from_iterator(const_iterator); - static iterator s_iterator_to(reference); - static const_iterator s_iterator_to(const_reference); - static void init_node(reference); + // public static functions + static multiset & container_from_end_iterator(iterator); + static const multiset & container_from_end_iterator(const_iterator); + static multiset & container_from_iterator(iterator); + static const multiset & container_from_iterator(const_iterator); + static iterator s_iterator_to(reference); + static const_iterator s_iterator_to(const_reference); + static void init_node(reference); // public data members static const bool constant_time_size; @@ -190,13 +190,13 @@ construct/copy/destruct
        1. -
          multiset();
          +
          multiset();

          Effects: Constructs an empty container.

          Complexity: Constant.

          Throws: If value_traits::node_traits::node constructor throws (this does not happen with predefined Boost.Intrusive hooks) or the copy constructor of the key_compare object throws. Basic guarantee.

        2. -
          explicit multiset(const key_compare & cmp, 
+
          explicit multiset(const key_compare & cmp, 
                   const value_traits & v_traits = value_traits());
          
 
          Effects: Constructs an empty container with given comparison and traits.
          
 
          Complexity: Constant.
          
@@ -204,7 +204,7 @@
 
        3. template<typename Iterator> 
-  multiset(Iterator b, Iterator e, const key_compare & cmp = key_compare(), 
+  multiset(Iterator b, Iterator e, const key_compare & cmp = key_compare(), 
            const value_traits & v_traits = value_traits());

          Requires: Dereferencing iterator must yield an lvalue of type value_type. cmp must be a comparison function that induces a strict weak ordering.

          Effects: Constructs an empty container and inserts elements from [b, e).

          @@ -212,17 +212,17 @@

          Throws: If value_traits::node_traits::node constructor throws (this does not happen with predefined Boost.Intrusive hooks) or the copy constructor/operator() of the key_compare object throws. Basic guarantee.

        4. -
          multiset(multiset && x);
          +
          multiset(multiset && x);

          Effects: Constructs a container moving resources from another container. Internal comparison object and value traits are move constructed and nodes belonging to x (except the node representing the "end") are linked to *this.

          Complexity: Constant.

          Throws: If value_traits::node_traits::node's move constructor throws (this does not happen with predefined Boost.Intrusive hooks) or the move constructor of the comparison objet throws.

        5. -
          multiset & operator=(multiset && x);
          +
          multiset & operator=(multiset && x);

          Effects: Equivalent to swap

        6. -
          ~multiset();
          +
          ~multiset();

          Effects: Detaches all elements from this. The objects in the set are not deleted (i.e. no destructors are called), but the nodes according to the value_traits template parameter are reinitialized and thus can be reused.

          Complexity: Linear to elements contained in *this.

          Throws: Nothing.

          @@ -231,131 +231,131 @@

        -multiset public member functions

        +multiset public member functions
        1. -
          iterator begin();
          +
          iterator begin();

          Effects: Returns an iterator pointing to the beginning of the container.

          Complexity: Constant.

          Throws: Nothing.

        2. -
          const_iterator begin() const;
          +
          const_iterator begin() const;

          Effects: Returns a const_iterator pointing to the beginning of the container.

          Complexity: Constant.

          Throws: Nothing.

        3. -
          const_iterator cbegin() const;
          +
          const_iterator cbegin() const;

          Effects: Returns a const_iterator pointing to the beginning of the container.

          Complexity: Constant.

          Throws: Nothing.

        4. -
          iterator end();
          +
          iterator end();

          Effects: Returns an iterator pointing to the end of the container.

          Complexity: Constant.

          Throws: Nothing.

        5. -
          const_iterator end() const;
          +
          const_iterator end() const;

          Effects: Returns a const_iterator pointing to the end of the container.

          Complexity: Constant.

          Throws: Nothing.

        6. -
          const_iterator cend() const;
          +
          const_iterator cend() const;

          Effects: Returns a const_iterator pointing to the end of the container.

          Complexity: Constant.

          Throws: Nothing.

        7. -
          reverse_iterator rbegin();
          +
          reverse_iterator rbegin();

          Effects: Returns a reverse_iterator pointing to the beginning of the reversed container.

          Complexity: Constant.

          Throws: Nothing.

        8. -
          const_reverse_iterator rbegin() const;
          +
          const_reverse_iterator rbegin() const;

          Effects: Returns a const_reverse_iterator pointing to the beginning of the reversed container.

          Complexity: Constant.

          Throws: Nothing.

        9. -
          const_reverse_iterator crbegin() const;
          +
          const_reverse_iterator crbegin() const;

          Effects: Returns a const_reverse_iterator pointing to the beginning of the reversed container.

          Complexity: Constant.

          Throws: Nothing.

        10. -
          reverse_iterator rend();
          +
          reverse_iterator rend();

          Effects: Returns a reverse_iterator pointing to the end of the reversed container.

          Complexity: Constant.

          Throws: Nothing.

        11. -
          const_reverse_iterator rend() const;
          +
          const_reverse_iterator rend() const;

          Effects: Returns a const_reverse_iterator pointing to the end of the reversed container.

          Complexity: Constant.

          Throws: Nothing.

        12. -
          const_reverse_iterator crend() const;
          +
          const_reverse_iterator crend() const;

          Effects: Returns a const_reverse_iterator pointing to the end of the reversed container.

          Complexity: Constant.

          Throws: Nothing.

        13. -
          iterator root();
          +
          iterator root();

          Effects: Returns a iterator pointing to the root node of the container or end() if not present.

          Complexity: Constant.

          Throws: Nothing.

        14. -
          const_iterator root() const;
          +
          const_iterator root() const;

          Effects: Returns a const_iterator pointing to the root node of the container or cend() if not present.

          Complexity: Constant.

          Throws: Nothing.

        15. -
          const_iterator croot() const;
          +
          const_iterator croot() const;

          Effects: Returns a const_iterator pointing to the root node of the container or cend() if not present.

          Complexity: Constant.

          Throws: Nothing.

        16. -
          key_compare key_comp() const;
          +
          key_compare key_comp() const;

          Effects: Returns the key_compare object used by the container.

          Complexity: Constant.

          Throws: If key_compare copy-constructor throws.

        17. -
          value_compare value_comp() const;
          +
          value_compare value_comp() const;

          Effects: Returns the value_compare object used by the container.

          Complexity: Constant.

          Throws: If value_compare copy-constructor throws.

        18. -
          bool empty() const;
          +
          bool empty() const;

          Effects: Returns true if the container is empty.

          Complexity: Constant.

          Throws: Nothing.

        19. -
          size_type size() const;
          +
          size_type size() const;

          Effects: Returns the number of elements stored in the container.

          Complexity: Linear to elements contained in *this if constant-time size option is disabled. Constant time otherwise.

          Throws: Nothing.

        20. -
          void swap(multiset & other);
          +
          void swap(multiset & other);

          Effects: Swaps the contents of two containers.

          Complexity: Constant.

          Throws: If the comparison functor's swap call throws. 

        21. template<typename Cloner, typename Disposer> 
-  void clone_from(const multiset & src, Cloner cloner, Disposer disposer);
          + void clone_from(const multiset & src, Cloner cloner, Disposer disposer);

          Requires: Disposer::operator()(pointer) shouldn't throw. Cloner should yield to nodes equivalent to the original nodes.

          Effects: Erases all the elements from *this calling Disposer::operator()(pointer), clones all the elements from src calling Cloner::operator()(const_reference ) and inserts them on *this. Copies the predicate from the source container.

          If cloner throws, all cloned elements are unlinked and disposed calling Disposer::operator()(pointer).

          @@ -364,7 +364,7 @@ 
        22. template<typename Cloner, typename Disposer> 
-  void clone_from(multiset && src, Cloner cloner, Disposer disposer);
          + void clone_from(multiset && src, Cloner cloner, Disposer disposer);

          Requires: Disposer::operator()(pointer) shouldn't throw. Cloner should yield to nodes equivalent to the original nodes.

          Effects: Erases all the elements from *this calling Disposer::operator()(pointer), clones all the elements from src calling Cloner::operator()(reference) and inserts them on *this. Copies the predicate from the source container.

          If cloner throws, all cloned elements are unlinked and disposed calling Disposer::operator()(pointer).

          @@ -373,7 +373,7 @@

          Note: This version can modify the source container, useful to implement move semantics.

        23. -
          iterator insert(reference value);
          +
          iterator insert(reference value);

          Requires: value must be an lvalue

          Effects: Inserts value into the container before the upper bound.

          Complexity: Average complexity for insert element is at most logarithmic.

          @@ -381,7 +381,7 @@

          Note: Does not affect the validity of iterators and references. No copy-constructors are called.

        24. -
          iterator insert(const_iterator hint, reference value);
          +
          iterator insert(const_iterator hint, reference value);

          Requires: value must be an lvalue, and "hint" must be a valid iterator.

          Effects: Inserts x into the container, using "hint" as a hint to where it will be inserted. If "hint" is the upper_bound the insertion takes constant time (two comparisons in the worst case)

          Complexity: Logarithmic in general, but it is amortized constant time if t is inserted immediately before hint.

          @@ -389,7 +389,7 @@

          Note: Does not affect the validity of iterators and references. No copy-constructors are called.

        25. -
          template<typename Iterator> void insert(Iterator b, Iterator e);
          +
          template<typename Iterator> void insert(Iterator b, Iterator e);

          Requires: Dereferencing iterator must yield an lvalue of type value_type.

          Effects: Inserts a each element of a range into the container before the upper bound of the key of each element.

          Complexity: Insert range is in general O(N * log(N)), where N is the size of the range. However, it is linear in N if the range is already sorted by value_comp().

          @@ -397,7 +397,7 @@

          Note: Does not affect the validity of iterators and references. No copy-constructors are called.

        26. -
          iterator insert_before(const_iterator pos, reference value);
          +
          iterator insert_before(const_iterator pos, reference value);

          Requires: value must be an lvalue, "pos" must be a valid iterator (or end) and must be the succesor of value once inserted according to the predicate

          Effects: Inserts x into the container before "pos".

          Complexity: Constant time.

          @@ -405,7 +405,7 @@

          Note: This function does not check preconditions so if "pos" is not the successor of "value" container ordering invariant will be broken. This is a low-level function to be used only for performance reasons by advanced users.

        27. -
          void push_back(reference value);
          +
          void push_back(reference value);

          Requires: value must be an lvalue, and it must be no less than the greatest inserted key

          Effects: Inserts x into the container in the last position.

          Complexity: Constant time.

          @@ -413,7 +413,7 @@

          Note: This function does not check preconditions so if value is less than the greatest inserted key container ordering invariant will be broken. This function is slightly more efficient than using "insert_before". This is a low-level function to be used only for performance reasons by advanced users.

        28. -
          void push_front(reference value);
          +
          void push_front(reference value);

          Requires: value must be an lvalue, and it must be no greater than the minimum inserted key

          Effects: Inserts x into the container in the first position.

          Complexity: Constant time.

          @@ -421,21 +421,21 @@

          Note: This function does not check preconditions so if value is greater than the minimum inserted key container ordering invariant will be broken. This function is slightly more efficient than using "insert_before". This is a low-level function to be used only for performance reasons by advanced users.

        29. -
          iterator erase(const_iterator i);
          +
          iterator erase(const_iterator i);

          Effects: Erases the element pointed to by i.

          Complexity: Average complexity for erase element is constant time.

          Throws: Nothing.

          Note: Invalidates the iterators (but not the references) to the erased elements. No destructors are called.

        30. -
          iterator erase(const_iterator b, const_iterator e);
          +
          iterator erase(const_iterator b, const_iterator e);

          Effects: Erases the range pointed to by b end e.

          Complexity: Average complexity for erase range is at most O(log(size() + N)), where N is the number of elements in the range.

          Throws: Nothing.

          Note: Invalidates the iterators (but not the references) to the erased elements. No destructors are called.

        31. -
          size_type erase(const key_type & key);
          +
          size_type erase(const key_type & key);

          Effects: Erases all the elements with the given value.

          Returns: The number of erased elements.

          Complexity: O(log(size() + N).

          @@ -444,7 +444,7 @@ 
        32. template<typename KeyType, typename KeyTypeKeyCompare> 
-  size_type erase(const KeyType & key, KeyTypeKeyCompare comp);
          + size_type erase(const KeyType & key, KeyTypeKeyCompare comp);

          Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk), with nk the key_type of a value_type inserted into *this.

          Effects: Erases all the elements with the given key. according to the comparison functor "comp".

          Returns: The number of erased elements.

          @@ -454,7 +454,7 @@ 
        33. template<typename Disposer> 
-  iterator erase_and_dispose(const_iterator i, Disposer disposer);
          + iterator erase_and_dispose(const_iterator i, Disposer disposer);

          Requires: Disposer::operator()(pointer) shouldn't throw.

          Effects: Erases the element pointed to by i. Disposer::operator()(pointer) is called for the removed element.

          Complexity: Average complexity for erase element is constant time.

          @@ -463,7 +463,7 @@ 
        34. template<typename Disposer> 
-  iterator erase_and_dispose(const_iterator b, const_iterator e, 
+  iterator erase_and_dispose(const_iterator b, const_iterator e, 
                              Disposer disposer);

          Requires: Disposer::operator()(pointer) shouldn't throw.

          Effects: Erases the range pointed to by b end e. Disposer::operator()(pointer) is called for the removed elements.

          @@ -473,7 +473,7 @@ 
        35. template<typename Disposer> 
-  size_type erase_and_dispose(const key_type & key, Disposer disposer);
          + size_type erase_and_dispose(const key_type & key, Disposer disposer);

          Requires: Disposer::operator()(pointer) shouldn't throw.

          Effects: Erases all the elements with the given value. Disposer::operator()(pointer) is called for the removed elements.

          Returns: The number of erased elements.

          @@ -483,7 +483,7 @@ 
        36. template<typename KeyType, typename KeyTypeKeyCompare, typename Disposer> 
-  size_type erase_and_dispose(const KeyType & key, KeyTypeKeyCompare comp, 
+  size_type erase_and_dispose(const KeyType & key, KeyTypeKeyCompare comp, 
                               Disposer disposer);

          Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk) and nk the key_type of a value_type inserted into *this.

          Requires: Disposer::operator()(pointer) shouldn't throw.

          @@ -494,47 +494,47 @@

          Note: Invalidates the iterators to the erased elements.

        37. -
          void clear();
          +
          void clear();

          Effects: Erases all of the elements.

          Complexity: Linear to the number of elements on the container. if it's a safe-mode or auto-unlink value_type. Constant time otherwise.

          Throws: Nothing.

          Note: Invalidates the iterators (but not the references) to the erased elements. No destructors are called.

        38. -
          template<typename Disposer> void clear_and_dispose(Disposer disposer);
          +
          template<typename Disposer> void clear_and_dispose(Disposer disposer);

          Effects: Erases all of the elements calling disposer(p) for each node to be erased. Complexity: Average complexity for is at most O(log(size() + N)), where N is the number of elements in the container.

          Throws: Nothing.

          Note: Invalidates the iterators (but not the references) to the erased elements. Calls N times to disposer functor.

        39. -
          size_type count(const key_type & key) const;
          +
          size_type count(const key_type & key) const;

          Effects: Returns the number of contained elements with the given value

          Complexity: Logarithmic to the number of elements contained plus lineal to number of objects with the given value.

          Throws: If key_compare throws. 

        40. template<typename KeyType, typename KeyTypeKeyCompare> 
-  size_type count(const KeyType & key, KeyTypeKeyCompare comp) const;
          + size_type count(const KeyType & key, KeyTypeKeyCompare comp) const;

          Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk), and nk the key_type of a value_type inserted into *this.

          Effects: Returns the number of contained elements with the given key

          Complexity: Logarithmic to the number of elements contained plus lineal to number of objects with the given key.

          Throws: If comp throws.

        41. -
          iterator lower_bound(const key_type & key);
          +
          iterator lower_bound(const key_type & key);

          Effects: Returns an iterator to the first element whose key is not less than k or end() if that element does not exist.

          Complexity: Logarithmic.

          Throws: If key_compare throws. 

        42. template<typename KeyType, typename KeyTypeKeyCompare> 
-  iterator lower_bound(const KeyType & key, KeyTypeKeyCompare comp);
          + iterator lower_bound(const KeyType & key, KeyTypeKeyCompare comp);

          Effects: Returns an iterator to the first element whose key is not less than k or end() if that element does not exist.

          Complexity: Logarithmic.

          Throws: If key_compare throws.

        43. -
          const_iterator lower_bound(const key_type & key) const;
          +
          const_iterator lower_bound(const key_type & key) const;

          Effects: Returns an iterator to the first element whose key is not less than k or end() if that element does not exist.

          Complexity: Logarithmic.

          Throws: If key_compare throws.

          @@ -542,27 +542,27 @@ 
        44. template<typename KeyType, typename KeyTypeKeyCompare> 
   const_iterator 
-  lower_bound(const KeyType & key, KeyTypeKeyCompare comp) const;
          + lower_bound(const KeyType & key, KeyTypeKeyCompare comp) const;

          Effects: Returns an iterator to the first element whose key is not less than k or end() if that element does not exist.

          Complexity: Logarithmic.

          Throws: If key_compare throws.

        45. -
          iterator upper_bound(const key_type & key);
          +
          iterator upper_bound(const key_type & key);

          Effects: Returns an iterator to the first element whose key is greater than k or end() if that element does not exist.

          Complexity: Logarithmic.

          Throws: If key_compare throws. 

        46. template<typename KeyType, typename KeyTypeKeyCompare> 
-  iterator upper_bound(const KeyType & key, KeyTypeKeyCompare comp);
          + iterator upper_bound(const KeyType & key, KeyTypeKeyCompare comp);

          Requires: key is a value such that *this is partitioned with respect to !comp(key, nk), with nk the key_type of a value_type inserted into *this.

          Effects: Returns an iterator to the first element whose key is greater than k according to comp or end() if that element does not exist.

          Complexity: Logarithmic.

          Throws: If comp throws.

        47. -
          const_iterator upper_bound(const key_type & key) const;
          +
          const_iterator upper_bound(const key_type & key) const;

          Effects: Returns an iterator to the first element whose key is greater than k or end() if that element does not exist.

          Complexity: Logarithmic.

          Throws: If key_compare throws.

          @@ -570,42 +570,42 @@ 
        48. template<typename KeyType, typename KeyTypeKeyCompare> 
   const_iterator 
-  upper_bound(const KeyType & key, KeyTypeKeyCompare comp) const;
          + upper_bound(const KeyType & key, KeyTypeKeyCompare comp) const;

          Requires: key is a value such that *this is partitioned with respect to !comp(key, nk), with nk the key_type of a value_type inserted into *this.

          Effects: Returns an iterator to the first element whose key is greater than k according to comp or end() if that element does not exist.

          Complexity: Logarithmic.

          Throws: If comp throws.

        49. -
          iterator find(const key_type & key);
          +
          iterator find(const key_type & key);

          Effects: Finds an iterator to the first element whose key is k or end() if that element does not exist.

          Complexity: Logarithmic.

          Throws: If key_compare throws. 

        50. template<typename KeyType, typename KeyTypeKeyCompare> 
-  iterator find(const KeyType & key, KeyTypeKeyCompare comp);
          + iterator find(const KeyType & key, KeyTypeKeyCompare comp);

          Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk), and nk the key_type of a value_type inserted into *this.

          Effects: Finds an iterator to the first element whose key is k or end() if that element does not exist.

          Complexity: Logarithmic.

          Throws: If comp throws.

        51. -
          const_iterator find(const key_type & key) const;
          +
          const_iterator find(const key_type & key) const;

          Effects: Finds an iterator to the first element whose key is k or end() if that element does not exist.

          Complexity: Logarithmic.

          Throws: If key_compare throws. 

        52. template<typename KeyType, typename KeyTypeKeyCompare> 
-  const_iterator find(const KeyType & key, KeyTypeKeyCompare comp) const;
          + const_iterator find(const KeyType & key, KeyTypeKeyCompare comp) const;

          Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk), and nk the key_type of a value_type inserted into *this.

          Effects: Finds an iterator to the first element whose key is k or end() if that element does not exist.

          Complexity: Logarithmic.

          Throws: If comp throws.

        53. -
          std::pair< iterator, iterator > equal_range(const key_type & key);
          +
          std::pair< iterator, iterator > equal_range(const key_type & key);

          Effects: Finds a range containing all elements whose key is k or an empty range that indicates the position where those elements would be if they there is no elements with key k.

          Complexity: Logarithmic.

          Throws: If key_compare throws.

          @@ -613,7 +613,7 @@ 
        54. template<typename KeyType, typename KeyTypeKeyCompare> 
   std::pair< iterator, iterator > 
-  equal_range(const KeyType & key, KeyTypeKeyCompare comp);
          + equal_range(const KeyType & key, KeyTypeKeyCompare comp);

          Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk), with nk the key_type of a value_type inserted into *this.

          Effects: Finds a range containing all elements whose key is k or an empty range that indicates the position where those elements would be if they there is no elements with key k.

          Complexity: Logarithmic.

          @@ -621,7 +621,7 @@ 
        55. std::pair< const_iterator, const_iterator > 
-equal_range(const key_type & key) const;
          +equal_range(const key_type & key) const;

          Effects: Finds a range containing all elements whose key is k or an empty range that indicates the position where those elements would be if they there is no elements with key k.

          Complexity: Logarithmic.

          Throws: If key_compare throws.

          @@ -629,7 +629,7 @@ 
        56. template<typename KeyType, typename KeyTypeKeyCompare> 
   std::pair< const_iterator, const_iterator > 
-  equal_range(const KeyType & key, KeyTypeKeyCompare comp) const;
          + equal_range(const KeyType & key, KeyTypeKeyCompare comp) const;

          Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk), with nk the key_type of a value_type inserted into *this.

          Effects: Finds a range containing all elements whose key is k or an empty range that indicates the position where those elements would be if they there is no elements with key k.

          Complexity: Logarithmic.

          @@ -637,7 +637,7 @@ 
        57. std::pair< iterator, iterator > 
-bounded_range(const key_type & lower_key, const key_type & upper_key, 
+bounded_range(const key_type & lower_key, const key_type & upper_key, 
               bool left_closed, bool right_closed);

          Requires: upper_key shall not precede lower_key according to key_compare. [key_comp()(upper_key, lower_key) shall be false]

          If lower_key is equivalent to upper_key [!key_comp()(upper_key, lower_key) && !key_comp()(lower_key, upper_key)] then ('left_closed' || 'right_closed') must be false.

          @@ -652,7 +652,7 @@ 
        58. template<typename KeyType, typename KeyTypeKeyCompare> 
   std::pair< iterator, iterator > 
-  bounded_range(const KeyType & lower_key, const KeyType & upper_key, 
+  bounded_range(const KeyType & lower_key, const KeyType & upper_key, 
                 KeyTypeKeyCompare comp, bool left_closed, bool right_closed);

          Requires: lower_key is a value such that *this is partitioned with respect to comp(nk, lower_key) if left_closed is true, with respect to !comp(lower_key, nk) otherwise.

          upper_key is a value such that *this is partitioned with respect to !comp(upper_key, nk) if right_closed is true, with respect to comp(nk, upper_key) otherwise.

          @@ -668,7 +668,7 @@ 
        59. std::pair< const_iterator, const_iterator > 
-bounded_range(const key_type & lower_key, const key_type & upper_key, 
+bounded_range(const key_type & lower_key, const key_type & upper_key, 
               bool left_closed, bool right_closed) const;

          Requires: upper_key shall not precede lower_key according to key_compare. [key_comp()(upper_key, lower_key) shall be false]

          If lower_key is equivalent to upper_key [!key_comp()(upper_key, lower_key) && !key_comp()(lower_key, upper_key)] then ('left_closed' || 'right_closed') must be false.

          @@ -683,7 +683,7 @@ 
        60. template<typename KeyType, typename KeyTypeKeyCompare> 
   std::pair< const_iterator, const_iterator > 
-  bounded_range(const KeyType & lower_key, const KeyType & upper_key, 
+  bounded_range(const KeyType & lower_key, const KeyType & upper_key, 
                 KeyTypeKeyCompare comp, bool left_closed, bool right_closed) const;

          Requires: lower_key is a value such that *this is partitioned with respect to comp(nk, lower_key) if left_closed is true, with respect to !comp(lower_key, nk) otherwise.

          upper_key is a value such that *this is partitioned with respect to !comp(upper_key, nk) if right_closed is true, with respect to comp(nk, upper_key) otherwise.

          @@ -698,28 +698,28 @@

          Note: Experimental function, the interface might change in future releases.

        61. -
          iterator iterator_to(reference value);
          +
          iterator iterator_to(reference value);

          Requires: value must be an lvalue and shall be in a set of appropriate type. Otherwise the behavior is undefined.

          Effects: Returns: a valid iterator i belonging to the set that points to the value

          Complexity: Constant.

          Throws: Nothing.

        62. -
          const_iterator iterator_to(const_reference value) const;
          +
          const_iterator iterator_to(const_reference value) const;

          Requires: value must be an lvalue and shall be in a set of appropriate type. Otherwise the behavior is undefined.

          Effects: Returns: a valid const_iterator i belonging to the set that points to the value

          Complexity: Constant.

          Throws: Nothing.

        63. -
          pointer unlink_leftmost_without_rebalance();
          +
          pointer unlink_leftmost_without_rebalance();

          Effects: Unlinks the leftmost node from the container.

          Complexity: Average complexity is constant time.

          Throws: Nothing.

          Notes: This function breaks the container and the container can only be used for more unlink_leftmost_without_rebalance calls. This function is normally used to achieve a step by step controlled destruction of the container.

        64. -
          void replace_node(iterator replace_this, reference with_this);
          +
          void replace_node(iterator replace_this, reference with_this);

          Requires: replace_this must be a valid iterator of *this and with_this must not be inserted in any container.

          Effects: Replaces replace_this in its position in the container with with_this. The container does not need to be rebalanced.

          Complexity: Constant.

          @@ -727,7 +727,7 @@

          Note: This function will break container ordering invariants if with_this is not equivalent to *replace_this according to the ordering rules. This function is faster than erasing and inserting the node, since no rebalancing or comparison is needed.

        65. -
          void remove_node(reference value);
          +
          void remove_node(reference value);

          Effects: removes "value" from the container.

          Throws: Nothing.

          Complexity: Logarithmic time.

          @@ -735,7 +735,7 @@

          If the user calls this function with a constant time size container or stateful comparison functor a compilation error will be issued.

        66. -
          template<class... Options2> void merge(multiset< T, Options2...> & source);
          +
          template<class... Options2> void merge(multiset< T, Options2...> & source);

          Requires: "source" container's Options can only can differ in the comparison function from *this.

          Effects: Extracts each element in source and insert it into a using the comparison object of *this.

          Postcondition: Pointers and references to the transferred elements of source refer to those same elements but as members of *this. Iterators referring to the transferred elements will continue to refer to their elements, but they now behave as iterators into *this, not into source.

          @@ -743,7 +743,7 @@

          Complexity: N log(a.size() + N) (N has the value source.size())

        67. -
          template<class... Options2> void merge(set< T, Options2...> & source);
          +
          template<class... Options2> void merge(set< T, Options2...> & source);

          Requires: "source" container's Options can only can differ in the comparison function from *this.

          Effects: Extracts each element in source and insert it into a using the comparison object of *this.

          Postcondition: Pointers and references to the transferred elements of source refer to those same elements but as members of *this. Iterators referring to the transferred elements will continue to refer to their elements, but they now behave as iterators into *this, not into source.

          @@ -754,10 +754,10 @@

        -multiset public static functions

        +multiset public static functions
        1. -
          static multiset & container_from_end_iterator(iterator end_iterator);
          +
          static multiset & container_from_end_iterator(iterator end_iterator);

          Precondition: end_iterator must be a valid end iterator of the container.

          Effects: Returns a const reference to the container associated to the end iterator

          Throws: Nothing.

          @@ -765,28 +765,28 @@ 
        2. static const multiset & 
-container_from_end_iterator(const_iterator end_iterator);
          +container_from_end_iterator(const_iterator end_iterator);

          Precondition: end_iterator must be a valid end iterator of the container.

          Effects: Returns a const reference to the container associated to the end iterator

          Throws: Nothing.

          Complexity: Constant.

        3. -
          static multiset & container_from_iterator(iterator it);
          +
          static multiset & container_from_iterator(iterator it);

          Precondition: it must be a valid iterator of the container.

          Effects: Returns a const reference to the container associated to the iterator

          Throws: Nothing.

          Complexity: Logarithmic.

        4. -
          static const multiset & container_from_iterator(const_iterator it);
          +
          static const multiset & container_from_iterator(const_iterator it);

          Precondition: it must be a valid iterator of the container.

          Effects: Returns a const reference to the container associated to the iterator

          Throws: Nothing.

          Complexity: Logarithmic.

        5. -
          static iterator s_iterator_to(reference value);
          +
          static iterator s_iterator_to(reference value);

          Requires: value must be an lvalue and shall be in a set of appropriate type. Otherwise the behavior is undefined.

          Effects: Returns: a valid iterator i belonging to the set that points to the value

          Complexity: Constant.

          @@ -794,7 +794,7 @@

          Note: This static function is available only if the value traits is stateless.

        6. -
          static const_iterator s_iterator_to(const_reference value);
          +
          static const_iterator s_iterator_to(const_reference value);

          Requires: value must be an lvalue and shall be in a set of appropriate type. Otherwise the behavior is undefined.

          Effects: Returns: a valid iterator i belonging to the set that points to the value

          Complexity: Constant.

          @@ -802,7 +802,7 @@

          Note: This static function is available only if the value traits is stateless.

        7. -
          static void init_node(reference value);
          +
          static void init_node(reference value);

          Requires: value shall not be in a container.

          Effects: init_node puts the hook of a value in a well-known default state.

          Throws: Nothing.

          diff --git a/doc/html/boost/intrusive/pack_options.html b/doc/html/boost/intrusive/pack_options.html index dc87a0280b..2c563e0572 100644 --- a/doc/html/boost/intrusive/pack_options.html +++ b/doc/html/boost/intrusive/pack_options.html @@ -8,7 +8,7 @@ - + @@ -21,7 +21,7 @@
          -PrevUpHomeNext +PrevUpHomeNext
          @@ -84,7 +84,7 @@
          -PrevUpHomeNext +PrevUpHomeNext
          diff --git a/doc/html/boost/intrusive/pointer_has_rebind.html b/doc/html/boost/intrusive/pointer_has_rebind.html index 9026dd9b6e..62eca9e3b1 100644 --- a/doc/html/boost/intrusive/pointer_has_rebind.html +++ b/doc/html/boost/intrusive/pointer_has_rebind.html @@ -7,7 +7,7 @@ - + @@ -21,7 +21,7 @@
          -PrevUpHomeNext +PrevUpHomeNext
          @@ -38,13 +38,13 @@ template<typename V> struct any { // construct/copy/destruct - any(const V &); + any(const V &); }; - // public static functions + // public static functions template<typename X> - static char test(int, typename X::template rebind< U > *); - template<typename X> static int test(any< int >, void *); + static char test(int, typename X::template rebind< U > *); + template<typename X> static int test(any< int >, void *); // public data members static const bool value; @@ -53,10 +53,10 @@

          Description

          -pointer_has_rebind public static functions

          +pointer_has_rebind public static functions
            -
          1. template<typename X> static char test(int, typename X::template rebind< U > *);
            2. -
          2. template<typename X> static int test(any< int >, void *);
            3. +
          3. template<typename X> static char test(int, typename X::template rebind< U > *);
            4. +
          4. template<typename X> static int test(any< int >, void *);
          @@ -71,7 +71,7 @@
          -PrevUpHomeNext +PrevUpHomeNext
          diff --git a/doc/html/boost/intrusive/pointer_has_rebind/any.html b/doc/html/boost/intrusive/pointer_has_rebind/any.html index 9d54f00cf4..1bf07c5d5c 100644 --- a/doc/html/boost/intrusive/pointer_has_rebind/any.html +++ b/doc/html/boost/intrusive/pointer_has_rebind/any.html @@ -36,7 +36,7 @@ template<typename V> struct any { // construct/copy/destruct - any(const V &); + any(const V &); };

          Description

          @@ -45,7 +45,7 @@ any public construct/copy/destruct -
          1. any(const V &);
          +
          1. any(const V &);
        diff --git a/doc/html/boost/intrusive/pointer_has_rebind_other.html b/doc/html/boost/intrusive/pointer_has_rebind_other.html index 7309456e3a..3fa9a9d3d7 100644 --- a/doc/html/boost/intrusive/pointer_has_rebind_other.html +++ b/doc/html/boost/intrusive/pointer_has_rebind_other.html @@ -38,13 +38,13 @@ template<typename V> struct any { // construct/copy/destruct - any(const V &); + any(const V &); }; - // public static functions + // public static functions template<typename X> - static char test(int, typename X::template rebind< U >::other *); - template<typename X> static int test(any< int >, void *); + static char test(int, typename X::template rebind< U >::other *); + template<typename X> static int test(any< int >, void *); // public data members static const bool value; @@ -53,11 +53,11 @@

        Description

        -pointer_has_rebind_other public static functions

        +pointer_has_rebind_other public static functions 
        1. template<typename X> 
-  static char test(int, typename X::template rebind< U >::other *);
          2. -
        2. template<typename X> static int test(any< int >, void *);
          3. + static char test(int, typename X::template rebind< U >::other *); +
        3. template<typename X> static int test(any< int >, void *);
        diff --git a/doc/html/boost/intrusive/pointer_has_rebind_other/any.html b/doc/html/boost/intrusive/pointer_has_rebind_other/any.html index b97ae55f50..cae8e6943b 100644 --- a/doc/html/boost/intrusive/pointer_has_rebind_other/any.html +++ b/doc/html/boost/intrusive/pointer_has_rebind_other/any.html @@ -36,7 +36,7 @@ template<typename V> struct any { // construct/copy/destruct - any(const V &); + any(const V &); };

        Description

        @@ -45,7 +45,7 @@ any public construct/copy/destruct -
        1. any(const V &);
        +
        1. any(const V &);
      diff --git a/doc/html/boost/intrusive/pointer_plus_b_idp55135712.html b/doc/html/boost/intrusive/pointer_plus_b_idp55135712.html deleted file mode 100644 index 4f3682dd1c..0000000000 --- a/doc/html/boost/intrusive/pointer_plus_b_idp55135712.html +++ /dev/null @@ -1,77 +0,0 @@ - - - - -Struct template pointer_plus_bits<T *, NumBits> - - - - - - - - - - - - - - - -
      Boost C++ LibrariesHomeLibrariesPeopleFAQMore
      -
      -
      -PrevUpHomeNext -
      -
      -
      -
      -

      Struct template pointer_plus_bits<T *, NumBits>

      -

      boost::intrusive::pointer_plus_bits<T *, NumBits>

      -
      -

      Synopsis

      -
      // In header: <boost/intrusive/pointer_plus_bits.hpp>
-
-template<typename T, std::size_t NumBits> 
-struct pointer_plus_bits<T *, NumBits> {
-  // types
-  typedef T * pointer;
-
-  // public static functions
-  static pointer get_pointer(pointer);
-  static void set_pointer(pointer &, pointer);
-  static std::size_t get_bits(pointer);
-  static void set_bits(pointer &, std::size_t);
-
-  // public data members
-  static const uintptr_t Mask;
-};
      -
      -

      Description

      -

      This is the specialization to embed extra bits of information in a raw pointer. The extra bits are stored in the lower bits of the pointer.

      -
      -

      -pointer_plus_bits public static functions

      -
        -
      1. static pointer get_pointer(pointer n);
        2. -
      2. static void set_pointer(pointer & n, pointer p);
        3. -
      3. static std::size_t get_bits(pointer n);
        4. -
      4. static void set_bits(pointer & n, std::size_t c);
        5. -
      -
      -
      -
      - - - -
      Copyright © 2005 Olaf Krzikalla
      Copyright © 2006-2015 Ion Gaztanaga

      - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

      -
      -
      -
      -PrevUpHomeNext -
      - - diff --git a/doc/html/boost/intrusive/pointer_plus_b_idp55916432.html b/doc/html/boost/intrusive/pointer_plus_b_idp55916432.html new file mode 100644 index 0000000000..9ddf485e7d --- /dev/null +++ b/doc/html/boost/intrusive/pointer_plus_b_idp55916432.html @@ -0,0 +1,77 @@ + + + + +Struct template pointer_plus_bits<T *, NumBits> + + + + + + + + + + + + + + + +
      Boost C++ LibrariesHomeLibrariesPeopleFAQMore
      +
      +
      +PrevUpHomeNext +
      +
      +
      +
      +

      Struct template pointer_plus_bits<T *, NumBits>

      +

      boost::intrusive::pointer_plus_bits<T *, NumBits>

      +
      +

      Synopsis

      +
      // In header: <boost/intrusive/pointer_plus_bits.hpp>
+
+template<typename T, std::size_t NumBits> 
+struct pointer_plus_bits<T *, NumBits> {
+  // types
+  typedef T * pointer;
+
+  // public static functions
+  static pointer get_pointer(pointer);
+  static void set_pointer(pointer &, pointer);
+  static std::size_t get_bits(pointer);
+  static void set_bits(pointer &, std::size_t);
+
+  // public data members
+  static const uintptr_t Mask;
+};
      +
      +

      Description

      +

      This is the specialization to embed extra bits of information in a raw pointer. The extra bits are stored in the lower bits of the pointer.

      +
      +

      +pointer_plus_bits public static functions

      +
        +
      1. static pointer get_pointer(pointer n);
        2. +
      2. static void set_pointer(pointer & n, pointer p);
        3. +
      3. static std::size_t get_bits(pointer n);
        4. +
      4. static void set_bits(pointer & n, std::size_t c);
        5. +
      +
      +
      +
      + + + +
      Copyright © 2005 Olaf Krzikalla
      Copyright © 2006-2015 Ion Gaztanaga

      + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

      +
      +
      +
      +PrevUpHomeNext +
      + + diff --git a/doc/html/boost/intrusive/pointer_plus_bits.html b/doc/html/boost/intrusive/pointer_plus_bits.html index 8dae508a3e..074940e2fc 100644 --- a/doc/html/boost/intrusive/pointer_plus_bits.html +++ b/doc/html/boost/intrusive/pointer_plus_bits.html @@ -7,8 +7,8 @@ - - + + @@ -21,7 +21,7 @@
      -PrevUpHomeNext +PrevUpHomeNext
      @@ -51,7 +51,7 @@
      -PrevUpHomeNext +PrevUpHomeNext
      diff --git a/doc/html/boost/intrusive/pointer_rebind.html b/doc/html/boost/intrusive/pointer_rebind.html index fff73af73d..9976cdf804 100644 --- a/doc/html/boost/intrusive/pointer_rebind.html +++ b/doc/html/boost/intrusive/pointer_rebind.html @@ -7,8 +7,8 @@ - - + + @@ -21,7 +21,7 @@
      -PrevUpHomeNext +PrevUpHomeNext
      @@ -47,7 +47,7 @@
      -PrevUpHomeNext +PrevUpHomeNext
      diff --git a/doc/html/boost/intrusive/pointer_rebind_idp55187168.html b/doc/html/boost/intrusive/pointer_rebind_idp55187168.html deleted file mode 100644 index 63e3fd2ba6..0000000000 --- a/doc/html/boost/intrusive/pointer_rebind_idp55187168.html +++ /dev/null @@ -1,54 +0,0 @@ - - - - -Struct template pointer_rebinder<Ptr, U, 2u> - - - - - - - - - - - - - - - -
      Boost C++ LibrariesHomeLibrariesPeopleFAQMore
      -
      -
      -PrevUpHomeNext -
      -
      -
      -
      -

      Struct template pointer_rebinder<Ptr, U, 2u>

      -

      boost::intrusive::pointer_rebinder<Ptr, U, 2u>

      -
      -

      Synopsis

      -
      // In header: <boost/intrusive/pointer_rebind.hpp>
-
-template<typename Ptr, typename U> 
-struct pointer_rebinder<Ptr, U, 2u> {
-  // types
-  typedef Ptr::template rebind< U >::other type;
-};
      -
      - - - -
      Copyright © 2005 Olaf Krzikalla
      Copyright © 2006-2015 Ion Gaztanaga

      - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

      -
      -
      -
      -PrevUpHomeNext -
      - - diff --git a/doc/html/boost/intrusive/pointer_rebind_idp55190832.html b/doc/html/boost/intrusive/pointer_rebind_idp55190832.html deleted file mode 100644 index 8b12fd412c..0000000000 --- a/doc/html/boost/intrusive/pointer_rebind_idp55190832.html +++ /dev/null @@ -1,54 +0,0 @@ - - - - -Struct template pointer_rebinder<Ptr, U, 1u> - - - - - - - - - - - - - - - -
      Boost C++ LibrariesHomeLibrariesPeopleFAQMore
      -
      -
      -PrevUpHomeNext -
      -
      -
      -
      -

      Struct template pointer_rebinder<Ptr, U, 1u>

      -

      boost::intrusive::pointer_rebinder<Ptr, U, 1u>

      -
      -

      Synopsis

      -
      // In header: <boost/intrusive/pointer_rebind.hpp>
-
-template<typename Ptr, typename U> 
-struct pointer_rebinder<Ptr, U, 1u> {
-  // types
-  typedef Ptr::template rebind< U > type;
-};
      -
      - - - -
      Copyright © 2005 Olaf Krzikalla
      Copyright © 2006-2015 Ion Gaztanaga

      - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

      -
      -
      -
      -PrevUpHomeNext -
      - - diff --git a/doc/html/boost/intrusive/pointer_rebind_idp55194496.html b/doc/html/boost/intrusive/pointer_rebind_idp55194496.html deleted file mode 100644 index 9c4bc43f60..0000000000 --- a/doc/html/boost/intrusive/pointer_rebind_idp55194496.html +++ /dev/null @@ -1,55 +0,0 @@ - - - - -Struct template pointer_rebinder<Ptr< A, An...>, U, 0u> - - - - - - - - - - - - - - - -
      Boost C++ LibrariesHomeLibrariesPeopleFAQMore
      -
      -
      -PrevUpHomeNext -
      -
      -
      -
      -

      Struct template pointer_rebinder<Ptr< A, An...>, U, 0u>

      -

      boost::intrusive::pointer_rebinder<Ptr< A, An...>, U, 0u>

      -
      -

      Synopsis

      -
      // In header: <boost/intrusive/pointer_rebind.hpp>
-
-template<template< class, class...> class Ptr, typename A, class... An, 
-         typename U> 
-struct pointer_rebinder<Ptr< A, An...>, U, 0u> {
-  // types
-  typedef Ptr< U, An...> type;
-};
      -
      - - - -
      Copyright © 2005 Olaf Krzikalla
      Copyright © 2006-2015 Ion Gaztanaga

      - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

      -
      -
      -
      -PrevUpHomeNext -
      - - diff --git a/doc/html/boost/intrusive/pointer_rebind_idp55200144.html b/doc/html/boost/intrusive/pointer_rebind_idp55200144.html deleted file mode 100644 index 17ceb275da..0000000000 --- a/doc/html/boost/intrusive/pointer_rebind_idp55200144.html +++ /dev/null @@ -1,54 +0,0 @@ - - - - -Struct template pointer_rebinder<Ptr< A >, U, 0u> - - - - - - - - - - - - - - - -
      Boost C++ LibrariesHomeLibrariesPeopleFAQMore
      -
      -
      -PrevUpHomeNext -
      -
      -
      -
      -

      Struct template pointer_rebinder<Ptr< A >, U, 0u>

      -

      boost::intrusive::pointer_rebinder<Ptr< A >, U, 0u>

      -
      -

      Synopsis

      -
      // In header: <boost/intrusive/pointer_rebind.hpp>
-
-template<template< class > class Ptr, typename A, typename U> 
-struct pointer_rebinder<Ptr< A >, U, 0u> {
-  // types
-  typedef Ptr< U > type;
-};
      -
      - - - -
      Copyright © 2005 Olaf Krzikalla
      Copyright © 2006-2015 Ion Gaztanaga

      - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

      -
      -
      -
      -PrevUpHomeNext -
      - - diff --git a/doc/html/boost/intrusive/pointer_rebind_idp55207392.html b/doc/html/boost/intrusive/pointer_rebind_idp55207392.html deleted file mode 100644 index 0e7cd33ca9..0000000000 --- a/doc/html/boost/intrusive/pointer_rebind_idp55207392.html +++ /dev/null @@ -1,54 +0,0 @@ - - - - -Struct template pointer_rebind<T *, U> - - - - - - - - - - - - - - - -
      Boost C++ LibrariesHomeLibrariesPeopleFAQMore
      -
      -
      -PrevUpHomeNext -
      -
      -
      -
      -

      Struct template pointer_rebind<T *, U>

      -

      boost::intrusive::pointer_rebind<T *, U>

      -
      -

      Synopsis

      -
      // In header: <boost/intrusive/pointer_rebind.hpp>
-
-template<typename T, typename U> 
-struct pointer_rebind<T *, U> {
-  // types
-  typedef U * type;
-};
      -
      - - - -
      Copyright © 2005 Olaf Krzikalla
      Copyright © 2006-2015 Ion Gaztanaga

      - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

      -
      -
      -
      -PrevUpHomeNext -
      - - diff --git a/doc/html/boost/intrusive/pointer_rebind_idp55967888.html b/doc/html/boost/intrusive/pointer_rebind_idp55967888.html new file mode 100644 index 0000000000..b86c956ad3 --- /dev/null +++ b/doc/html/boost/intrusive/pointer_rebind_idp55967888.html @@ -0,0 +1,54 @@ + + + + +Struct template pointer_rebinder<Ptr, U, 2u> + + + + + + + + + + + + + + + +
      Boost C++ LibrariesHomeLibrariesPeopleFAQMore
      +
      +
      +PrevUpHomeNext +
      +
      +
      +
      +

      Struct template pointer_rebinder<Ptr, U, 2u>

      +

      boost::intrusive::pointer_rebinder<Ptr, U, 2u>

      +
      +

      Synopsis

      +
      // In header: <boost/intrusive/pointer_rebind.hpp>
+
+template<typename Ptr, typename U> 
+struct pointer_rebinder<Ptr, U, 2u> {
+  // types
+  typedef Ptr::template rebind< U >::other type;
+};
      +
      + + + +
      Copyright © 2005 Olaf Krzikalla
      Copyright © 2006-2015 Ion Gaztanaga

      + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

      +
      +
      +
      +PrevUpHomeNext +
      + + diff --git a/doc/html/boost/intrusive/pointer_rebind_idp55971552.html b/doc/html/boost/intrusive/pointer_rebind_idp55971552.html new file mode 100644 index 0000000000..ef38c56bf0 --- /dev/null +++ b/doc/html/boost/intrusive/pointer_rebind_idp55971552.html @@ -0,0 +1,54 @@ + + + + +Struct template pointer_rebinder<Ptr, U, 1u> + + + + + + + + + + + + + + + +
      Boost C++ LibrariesHomeLibrariesPeopleFAQMore
      +
      +
      +PrevUpHomeNext +
      +
      +
      +
      +

      Struct template pointer_rebinder<Ptr, U, 1u>

      +

      boost::intrusive::pointer_rebinder<Ptr, U, 1u>

      +
      +

      Synopsis

      +
      // In header: <boost/intrusive/pointer_rebind.hpp>
+
+template<typename Ptr, typename U> 
+struct pointer_rebinder<Ptr, U, 1u> {
+  // types
+  typedef Ptr::template rebind< U > type;
+};
      +
      + + + +
      Copyright © 2005 Olaf Krzikalla
      Copyright © 2006-2015 Ion Gaztanaga

      + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

      +
      +
      +
      +PrevUpHomeNext +
      + + diff --git a/doc/html/boost/intrusive/pointer_rebind_idp55975216.html b/doc/html/boost/intrusive/pointer_rebind_idp55975216.html new file mode 100644 index 0000000000..c1011ab157 --- /dev/null +++ b/doc/html/boost/intrusive/pointer_rebind_idp55975216.html @@ -0,0 +1,55 @@ + + + + +Struct template pointer_rebinder<Ptr< A, An...>, U, 0u> + + + + + + + + + + + + + + + +
      Boost C++ LibrariesHomeLibrariesPeopleFAQMore
      +
      +
      +PrevUpHomeNext +
      +
      +
      +
      +

      Struct template pointer_rebinder<Ptr< A, An...>, U, 0u>

      +

      boost::intrusive::pointer_rebinder<Ptr< A, An...>, U, 0u>

      +
      +

      Synopsis

      +
      // In header: <boost/intrusive/pointer_rebind.hpp>
+
+template<template< class, class...> class Ptr, typename A, class... An, 
+         typename U> 
+struct pointer_rebinder<Ptr< A, An...>, U, 0u> {
+  // types
+  typedef Ptr< U, An...> type;
+};
      +
      + + + +
      Copyright © 2005 Olaf Krzikalla
      Copyright © 2006-2015 Ion Gaztanaga

      + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

      +
      +
      +
      +PrevUpHomeNext +
      + + diff --git a/doc/html/boost/intrusive/pointer_rebind_idp55980864.html b/doc/html/boost/intrusive/pointer_rebind_idp55980864.html new file mode 100644 index 0000000000..d9911b3294 --- /dev/null +++ b/doc/html/boost/intrusive/pointer_rebind_idp55980864.html @@ -0,0 +1,54 @@ + + + + +Struct template pointer_rebinder<Ptr< A >, U, 0u> + + + + + + + + + + + + + + + +
      Boost C++ LibrariesHomeLibrariesPeopleFAQMore
      +
      +
      +PrevUpHomeNext +
      +
      +
      +
      +

      Struct template pointer_rebinder<Ptr< A >, U, 0u>

      +

      boost::intrusive::pointer_rebinder<Ptr< A >, U, 0u>

      +
      +

      Synopsis

      +
      // In header: <boost/intrusive/pointer_rebind.hpp>
+
+template<template< class > class Ptr, typename A, typename U> 
+struct pointer_rebinder<Ptr< A >, U, 0u> {
+  // types
+  typedef Ptr< U > type;
+};
      +
      + + + +
      Copyright © 2005 Olaf Krzikalla
      Copyright © 2006-2015 Ion Gaztanaga

      + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

      +
      +
      +
      +PrevUpHomeNext +
      + + diff --git a/doc/html/boost/intrusive/pointer_rebind_idp55988112.html b/doc/html/boost/intrusive/pointer_rebind_idp55988112.html new file mode 100644 index 0000000000..6d916a8d35 --- /dev/null +++ b/doc/html/boost/intrusive/pointer_rebind_idp55988112.html @@ -0,0 +1,54 @@ + + + + +Struct template pointer_rebind<T *, U> + + + + + + + + + + + + + + + +
      Boost C++ LibrariesHomeLibrariesPeopleFAQMore
      +
      +
      +PrevUpHomeNext +
      +
      +
      +
      +

      Struct template pointer_rebind<T *, U>

      +

      boost::intrusive::pointer_rebind<T *, U>

      +
      +

      Synopsis

      +
      // In header: <boost/intrusive/pointer_rebind.hpp>
+
+template<typename T, typename U> 
+struct pointer_rebind<T *, U> {
+  // types
+  typedef U * type;
+};
      +
      + + + +
      Copyright © 2005 Olaf Krzikalla
      Copyright © 2006-2015 Ion Gaztanaga

      + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

      +
      +
      +
      +PrevUpHomeNext +
      + + diff --git a/doc/html/boost/intrusive/pointer_rebinder.html b/doc/html/boost/intrusive/pointer_rebinder.html index a841326f07..a6a097eed6 100644 --- a/doc/html/boost/intrusive/pointer_rebinder.html +++ b/doc/html/boost/intrusive/pointer_rebinder.html @@ -8,7 +8,7 @@ - + @@ -21,7 +21,7 @@
      -PrevUpHomeNext +PrevUpHomeNext
      @@ -46,7 +46,7 @@
      -PrevUpHomeNext +PrevUpHomeNext
      diff --git a/doc/html/boost/intrusive/pointer_traits.html b/doc/html/boost/intrusive/pointer_traits.html index d6d0471b13..9b5bf778cc 100644 --- a/doc/html/boost/intrusive/pointer_traits.html +++ b/doc/html/boost/intrusive/pointer_traits.html @@ -7,8 +7,8 @@ - - + + @@ -21,7 +21,7 @@
      -PrevUpHomeNext +PrevUpHomeNext
      @@ -41,11 +41,11 @@ typedef unspecified rebind; typedef unspecified_type reference; - // public static functions - static pointer pointer_to(reference); - template<typename UPtr> static pointer static_cast_from(const UPtr &); - template<typename UPtr> static pointer const_cast_from(const UPtr &); - template<typename UPtr> static pointer dynamic_cast_from(const UPtr &); + // public static functions + static pointer pointer_to(reference); + template<typename UPtr> static pointer static_cast_from(const UPtr &); + template<typename UPtr> static pointer const_cast_from(const UPtr &); + template<typename UPtr> static pointer dynamic_cast_from(const UPtr &); };

      Description

      @@ -88,28 +88,28 @@

      -pointer_traits public static functions

      +pointer_traits public static functions
      1. -
        static pointer pointer_to(reference r);
        +
        static pointer pointer_to(reference r);

        Remark: If element_type is (possibly cv-qualified) void, r type is unspecified; otherwise, it is element_type &.

        Returns: A dereferenceable pointer to r obtained by calling Ptr::pointer_to(reference). Non-standard extension: If such function does not exist, returns pointer(addressof(r));

        Note: For non-conforming compilers only the existence of a member function called pointer_to is checked.

      2. -
        template<typename UPtr> static pointer static_cast_from(const UPtr & uptr);
        +
        template<typename UPtr> static pointer static_cast_from(const UPtr & uptr);

        Remark: Non-standard extension.

        Returns: A dereferenceable pointer to r obtained by calling the static template function Ptr::static_cast_from(UPpr/const UPpr &). If such function does not exist, returns pointer_to(static_cast<element_type&>(*uptr))

        Note: For non-conforming compilers only the existence of a member function called static_cast_from is checked.

      3. -
        template<typename UPtr> static pointer const_cast_from(const UPtr & uptr);
        +
        template<typename UPtr> static pointer const_cast_from(const UPtr & uptr);

        Remark: Non-standard extension.

        Returns: A dereferenceable pointer to r obtained by calling the static template function Ptr::const_cast_from<UPtr>(UPpr/const UPpr &). If such function does not exist, returns pointer_to(const_cast<element_type&>(*uptr))

        Note: For non-conforming compilers only the existence of a member function called const_cast_from is checked.

      4. -
        template<typename UPtr> static pointer dynamic_cast_from(const UPtr & uptr);
        +
        template<typename UPtr> static pointer dynamic_cast_from(const UPtr & uptr);

        Remark: Non-standard extension.

        Returns: A dereferenceable pointer to r obtained by calling the static template function Ptr::dynamic_cast_from<UPtr>(UPpr/const UPpr &). If such function does not exist, returns pointer_to(dynamic_cast<element_type>(&*uptr))

        Note: For non-conforming compilers only the existence of a member function called dynamic_cast_from is checked.

        @@ -128,7 +128,7 @@
        -PrevUpHomeNext +PrevUpHomeNext
        diff --git a/doc/html/boost/intrusive/pointer_traits_idp55252544.html b/doc/html/boost/intrusive/pointer_traits_idp55252544.html deleted file mode 100644 index 977a75a8d6..0000000000 --- a/doc/html/boost/intrusive/pointer_traits_idp55252544.html +++ /dev/null @@ -1,110 +0,0 @@ - - - - -Struct template pointer_traits<T *> - - - - - - - - - - - - - - - -
        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
        -
        -
        -PrevUpHomeNext -
        -
        -
        -
        -

        Struct template pointer_traits<T *>

        -

        boost::intrusive::pointer_traits<T *>

        -
        -

        Synopsis

        -
        // In header: <boost/intrusive/pointer_traits.hpp>
-
-template<typename T> 
-struct pointer_traits<T *> {
-  // types
-  typedef T              element_type;   
-  typedef T *            pointer;        
-  typedef std::ptrdiff_t difference_type;
-  typedef T &            reference;      
-  typedef U *            rebind;         
-
-  // member classes/structs/unions
-  template<typename U> 
-  struct rebind_pointer {
-    // types
-    typedef U * type;
-  };
-
-  // public static functions
-  static pointer pointer_to(reference);
-  template<typename U> static pointer static_cast_from(U *);
-  template<typename U> static pointer const_cast_from(U *);
-  template<typename U> static pointer dynamic_cast_from(U *);
-};
        -
        -

        Description

        -

        Specialization of pointer_traits for raw pointers

        -
        -

        -pointer_traits - public - types

        -
        1. -

          -typedef U * rebind;

          -
          U *
-
-typename rebind_pointer<U>::type
          -
        -
        -
        -

        -pointer_traits public static functions

        -
          -
        1. -
          static pointer pointer_to(reference r);
          -

          Returns: addressof(r)

          -
          2. -
        2. -
          template<typename U> static pointer static_cast_from(U * uptr);
          -

          Returns: static_cast<pointer>(uptr)

          -
          3. -
        3. -
          template<typename U> static pointer const_cast_from(U * uptr);
          -

          Returns: const_cast<pointer>(uptr)

          -
          4. -
        4. -
          template<typename U> static pointer dynamic_cast_from(U * uptr);
          -

          Returns: dynamic_cast<pointer>(uptr)

          -
          5. -
        -
        -
        -
        - - - -
        Copyright © 2005 Olaf Krzikalla
        Copyright © 2006-2015 Ion Gaztanaga

        - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

        -
        -
        -
        -PrevUpHomeNext -
        - - diff --git a/doc/html/boost/intrusive/pointer_traits_idp55252544/rebind_pointer.html b/doc/html/boost/intrusive/pointer_traits_idp55252544/rebind_pointer.html deleted file mode 100644 index 7346e1daa8..0000000000 --- a/doc/html/boost/intrusive/pointer_traits_idp55252544/rebind_pointer.html +++ /dev/null @@ -1,55 +0,0 @@ - - - - -Struct template rebind_pointer - - - - - - - - - - - - - - - -
        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
        -
        -
        -PrevUpHomeNext -
        -
        -
        -
        -

        Struct template rebind_pointer

        -

        boost::intrusive::pointer_traits<T *>::rebind_pointer

        -
        -

        Synopsis

        -
        // In header: <boost/intrusive/pointer_traits.hpp>
-
-
-template<typename U> 
-struct rebind_pointer {
-  // types
-  typedef U * type;
-};
        -
        - - - -
        Copyright © 2005 Olaf Krzikalla
        Copyright © 2006-2015 Ion Gaztanaga

        - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

        -
        -
        -
        -PrevUpHomeNext -
        - - diff --git a/doc/html/boost/intrusive/pointer_traits_idp56033264.html b/doc/html/boost/intrusive/pointer_traits_idp56033264.html new file mode 100644 index 0000000000..76fd1f9741 --- /dev/null +++ b/doc/html/boost/intrusive/pointer_traits_idp56033264.html @@ -0,0 +1,110 @@ + + + + +Struct template pointer_traits<T *> + + + + + + + + + + + + + + + +
        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
        +
        +
        +PrevUpHomeNext +
        +
        +
        +
        +

        Struct template pointer_traits<T *>

        +

        boost::intrusive::pointer_traits<T *>

        +
        +

        Synopsis

        +
        // In header: <boost/intrusive/pointer_traits.hpp>
+
+template<typename T> 
+struct pointer_traits<T *> {
+  // types
+  typedef T              element_type;   
+  typedef T *            pointer;        
+  typedef std::ptrdiff_t difference_type;
+  typedef T &            reference;      
+  typedef U *            rebind;         
+
+  // member classes/structs/unions
+  template<typename U> 
+  struct rebind_pointer {
+    // types
+    typedef U * type;
+  };
+
+  // public static functions
+  static pointer pointer_to(reference);
+  template<typename U> static pointer static_cast_from(U *);
+  template<typename U> static pointer const_cast_from(U *);
+  template<typename U> static pointer dynamic_cast_from(U *);
+};
        +
        +

        Description

        +

        Specialization of pointer_traits for raw pointers

        +
        +

        +pointer_traits + public + types

        +
        1. +

          +typedef U * rebind;

          +
          U *
+
+typename rebind_pointer<U>::type
          +
        +
        +
        +

        +pointer_traits public static functions

        +
          +
        1. +
          static pointer pointer_to(reference r);
          +

          Returns: addressof(r)

          +
          2. +
        2. +
          template<typename U> static pointer static_cast_from(U * uptr);
          +

          Returns: static_cast<pointer>(uptr)

          +
          3. +
        3. +
          template<typename U> static pointer const_cast_from(U * uptr);
          +

          Returns: const_cast<pointer>(uptr)

          +
          4. +
        4. +
          template<typename U> static pointer dynamic_cast_from(U * uptr);
          +

          Returns: dynamic_cast<pointer>(uptr)

          +
          5. +
        +
        +
        +
        + + + +
        Copyright © 2005 Olaf Krzikalla
        Copyright © 2006-2015 Ion Gaztanaga

        + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

        +
        +
        +
        +PrevUpHomeNext +
        + + diff --git a/doc/html/boost/intrusive/pointer_traits_idp56033264/rebind_pointer.html b/doc/html/boost/intrusive/pointer_traits_idp56033264/rebind_pointer.html new file mode 100644 index 0000000000..8403254c10 --- /dev/null +++ b/doc/html/boost/intrusive/pointer_traits_idp56033264/rebind_pointer.html @@ -0,0 +1,55 @@ + + + + +Struct template rebind_pointer + + + + + + + + + + + + + + + +
        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
        +
        +
        +PrevUpHomeNext +
        +
        +
        +
        +

        Struct template rebind_pointer

        +

        boost::intrusive::pointer_traits<T *>::rebind_pointer

        +
        +

        Synopsis

        +
        // In header: <boost/intrusive/pointer_traits.hpp>
+
+
+template<typename U> 
+struct rebind_pointer {
+  // types
+  typedef U * type;
+};
        +
        + + + +
        Copyright © 2005 Olaf Krzikalla
        Copyright © 2006-2015 Ion Gaztanaga

        + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

        +
        +
        +
        +PrevUpHomeNext +
        + + diff --git a/doc/html/boost/intrusive/priority_compa_idp55286240.html b/doc/html/boost/intrusive/priority_compa_idp55286240.html deleted file mode 100644 index 4ac6d4e224..0000000000 --- a/doc/html/boost/intrusive/priority_compa_idp55286240.html +++ /dev/null @@ -1,64 +0,0 @@ - - - - -Struct priority_compare<void> - - - - - - - - - - - - - - - -
        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
        -
        -
        -PrevUpHomeNext -
        -
        -
        -
        -

        Struct priority_compare<void>

        -

        boost::intrusive::priority_compare<void>

        -
        -

        Synopsis

        -
        // In header: <boost/intrusive/priority_compare.hpp>
-
-
-struct priority_compare<void> {
-
-  // public member functions
-  template<typename T, typename U> bool operator()(const T &, const U &) const;
-};
        -
        -

        Description

        -
        -

        -priority_compare public member functions

        -
        1. template<typename T, typename U> 
-  bool operator()(const T & t, const U & u) const;
        -
        -
        -
        - - - -
        Copyright © 2005 Olaf Krzikalla
        Copyright © 2006-2015 Ion Gaztanaga

        - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

        -
        -
        -
        -PrevUpHomeNext -
        - - diff --git a/doc/html/boost/intrusive/priority_compa_idp56066960.html b/doc/html/boost/intrusive/priority_compa_idp56066960.html new file mode 100644 index 0000000000..570f15ed40 --- /dev/null +++ b/doc/html/boost/intrusive/priority_compa_idp56066960.html @@ -0,0 +1,64 @@ + + + + +Struct priority_compare<void> + + + + + + + + + + + + + + + +
        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
        +
        +
        +PrevUpHomeNext +
        +
        +
        +
        +

        Struct priority_compare<void>

        +

        boost::intrusive::priority_compare<void>

        +
        +

        Synopsis

        +
        // In header: <boost/intrusive/priority_compare.hpp>
+
+
+struct priority_compare<void> {
+
+  // public member functions
+  template<typename T, typename U> bool operator()(const T &, const U &) const;
+};
        +
        +

        Description

        +
        +

        +priority_compare public member functions

        +
        1. template<typename T, typename U> 
+  bool operator()(const T & t, const U & u) const;
        +
        +
        +
        + + + +
        Copyright © 2005 Olaf Krzikalla
        Copyright © 2006-2015 Ion Gaztanaga

        + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

        +
        +
        +
        +PrevUpHomeNext +
        + + diff --git a/doc/html/boost/intrusive/priority_compare.html b/doc/html/boost/intrusive/priority_compare.html index f8fad4b7cf..10e48d237c 100644 --- a/doc/html/boost/intrusive/priority_compare.html +++ b/doc/html/boost/intrusive/priority_compare.html @@ -7,8 +7,8 @@ - - + + @@ -21,7 +21,7 @@
        -PrevUpHomeNext +PrevUpHomeNext
        @@ -39,15 +39,15 @@ typedef T second_argument_type; typedef bool result_type; - // public member functions - bool operator()(const T &, const T &) const; + // public member functions + bool operator()(const T &, const T &) const; };

        Description

        -priority_compare public member functions

        -
        1. bool operator()(const T & val, const T & val2) const;
        +priority_compare public member functions +
        1. bool operator()(const T & val, const T & val2) const;
      @@ -61,7 +61,7 @@
      -PrevUpHomeNext +PrevUpHomeNext
      diff --git a/doc/html/boost/intrusive/rbtree.html b/doc/html/boost/intrusive/rbtree.html index f6552cfacc..2267b7ea70 100644 --- a/doc/html/boost/intrusive/rbtree.html +++ b/doc/html/boost/intrusive/rbtree.html @@ -7,7 +7,7 @@ - + @@ -21,7 +21,7 @@
      -PrevUpHomeNext +PrevUpHomeNext
      @@ -60,139 +60,139 @@ typedef implementation_defined::insert_commit_data insert_commit_data; // construct/copy/destruct - rbtree(); - explicit rbtree(const key_compare &, const value_traits & = value_traits()); + rbtree(); + explicit rbtree(const key_compare &, const value_traits & = value_traits()); template<typename Iterator> - rbtree(bool, Iterator, Iterator, const key_compare & = key_compare(), + rbtree(bool, Iterator, Iterator, const key_compare & = key_compare(), const value_traits & = value_traits()); - rbtree(rbtree &&); - rbtree & operator=(rbtree &&); - ~rbtree(); + rbtree(rbtree &&); + rbtree & operator=(rbtree &&); + ~rbtree(); - // public member functions - iterator begin(); - const_iterator begin() const; - const_iterator cbegin() const; - iterator end(); - const_iterator end() const; - const_iterator cend() const; - reverse_iterator rbegin(); - const_reverse_iterator rbegin() const; - const_reverse_iterator crbegin() const; - reverse_iterator rend(); - const_reverse_iterator rend() const; - const_reverse_iterator crend() const; - iterator root(); - const_iterator root() const; - const_iterator croot() const; - key_compare key_comp() const; - value_compare value_comp() const; - bool empty() const; - size_type size() const; - void swap(rbtree &); + // public member functions + iterator begin(); + const_iterator begin() const; + const_iterator cbegin() const; + iterator end(); + const_iterator end() const; + const_iterator cend() const; + reverse_iterator rbegin(); + const_reverse_iterator rbegin() const; + const_reverse_iterator crbegin() const; + reverse_iterator rend(); + const_reverse_iterator rend() const; + const_reverse_iterator crend() const; + iterator root(); + const_iterator root() const; + const_iterator croot() const; + key_compare key_comp() const; + value_compare value_comp() const; + bool empty() const; + size_type size() const; + void swap(rbtree &); template<typename Cloner, typename Disposer> - void clone_from(const rbtree &, Cloner, Disposer); + void clone_from(const rbtree &, Cloner, Disposer); template<typename Cloner, typename Disposer> - void clone_from(rbtree &&, Cloner, Disposer); + void clone_from(rbtree &&, Cloner, Disposer); template<typename Cloner, typename Disposer> - void clone_from(rbtree &&, Cloner, Disposer); - iterator insert_equal(reference); - iterator insert_equal(const_iterator, reference); - template<typename Iterator> void insert_equal(Iterator, Iterator); - std::pair< iterator, bool > insert_unique(reference); - iterator insert_unique(const_iterator, reference); + void clone_from(rbtree &&, Cloner, Disposer); + iterator insert_equal(reference); + iterator insert_equal(const_iterator, reference); + template<typename Iterator> void insert_equal(Iterator, Iterator); + std::pair< iterator, bool > insert_unique(reference); + iterator insert_unique(const_iterator, reference); template<typename KeyType, typename KeyTypeKeyCompare> std::pair< iterator, bool > - insert_unique_check(const KeyType &, KeyTypeKeyCompare, + insert_unique_check(const KeyType &, KeyTypeKeyCompare, insert_commit_data &); template<typename KeyType, typename KeyTypeKeyCompare> std::pair< iterator, bool > - insert_unique_check(const_iterator, const KeyType &, KeyTypeKeyCompare, + insert_unique_check(const_iterator, const KeyType &, KeyTypeKeyCompare, insert_commit_data &); std::pair< iterator, bool > - insert_unique_check(const key_type &, insert_commit_data &); + insert_unique_check(const key_type &, insert_commit_data &); std::pair< iterator, bool > - insert_unique_check(const_iterator, const key_type &, insert_commit_data &); - iterator insert_unique_commit(reference, const insert_commit_data &); - template<typename Iterator> void insert_unique(Iterator, Iterator); - iterator insert_before(const_iterator, reference); - void push_back(reference); - void push_front(reference); - iterator erase(const_iterator); - iterator erase(const_iterator, const_iterator); - size_type erase(const key_type &); + insert_unique_check(const_iterator, const key_type &, insert_commit_data &); + iterator insert_unique_commit(reference, const insert_commit_data &); + template<typename Iterator> void insert_unique(Iterator, Iterator); + iterator insert_before(const_iterator, reference); + void push_back(reference); + void push_front(reference); + iterator erase(const_iterator); + iterator erase(const_iterator, const_iterator); + size_type erase(const key_type &); template<typename KeyType, typename KeyTypeKeyCompare> - size_type erase(const KeyType &, KeyTypeKeyCompare); + size_type erase(const KeyType &, KeyTypeKeyCompare); template<typename Disposer> - iterator erase_and_dispose(const_iterator, Disposer); + iterator erase_and_dispose(const_iterator, Disposer); template<typename Disposer> - iterator erase_and_dispose(const_iterator, const_iterator, Disposer); + iterator erase_and_dispose(const_iterator, const_iterator, Disposer); template<typename Disposer> - size_type erase_and_dispose(const key_type &, Disposer); + size_type erase_and_dispose(const key_type &, Disposer); template<typename KeyType, typename KeyTypeKeyCompare, typename Disposer> - size_type erase_and_dispose(const KeyType &, KeyTypeKeyCompare, Disposer); - void clear(); - template<typename Disposer> void clear_and_dispose(Disposer); - size_type count(const key_type &) const; + size_type erase_and_dispose(const KeyType &, KeyTypeKeyCompare, Disposer); + void clear(); + template<typename Disposer> void clear_and_dispose(Disposer); + size_type count(const key_type &) const; template<typename KeyType, typename KeyTypeKeyCompare> - size_type count(const KeyType &, KeyTypeKeyCompare) const; - iterator lower_bound(const key_type &); + size_type count(const KeyType &, KeyTypeKeyCompare) const; + iterator lower_bound(const key_type &); template<typename KeyType, typename KeyTypeKeyCompare> - iterator lower_bound(const KeyType &, KeyTypeKeyCompare); - const_iterator lower_bound(const key_type &) const; + iterator lower_bound(const KeyType &, KeyTypeKeyCompare); + const_iterator lower_bound(const key_type &) const; template<typename KeyType, typename KeyTypeKeyCompare> - const_iterator lower_bound(const KeyType &, KeyTypeKeyCompare) const; - iterator upper_bound(const key_type &); + const_iterator lower_bound(const KeyType &, KeyTypeKeyCompare) const; + iterator upper_bound(const key_type &); template<typename KeyType, typename KeyTypeKeyCompare> - iterator upper_bound(const KeyType &, KeyTypeKeyCompare); - const_iterator upper_bound(const key_type &) const; + iterator upper_bound(const KeyType &, KeyTypeKeyCompare); + const_iterator upper_bound(const key_type &) const; template<typename KeyType, typename KeyTypeKeyCompare> - const_iterator upper_bound(const KeyType &, KeyTypeKeyCompare) const; - iterator find(const key_type &); + const_iterator upper_bound(const KeyType &, KeyTypeKeyCompare) const; + iterator find(const key_type &); template<typename KeyType, typename KeyTypeKeyCompare> - iterator find(const KeyType &, KeyTypeKeyCompare); - const_iterator find(const key_type &) const; + iterator find(const KeyType &, KeyTypeKeyCompare); + const_iterator find(const key_type &) const; template<typename KeyType, typename KeyTypeKeyCompare> - const_iterator find(const KeyType &, KeyTypeKeyCompare) const; - std::pair< iterator, iterator > equal_range(const key_type &); + const_iterator find(const KeyType &, KeyTypeKeyCompare) const; + std::pair< iterator, iterator > equal_range(const key_type &); template<typename KeyType, typename KeyTypeKeyCompare> std::pair< iterator, iterator > - equal_range(const KeyType &, KeyTypeKeyCompare); + equal_range(const KeyType &, KeyTypeKeyCompare); std::pair< const_iterator, const_iterator > - equal_range(const key_type &) const; + equal_range(const key_type &) const; template<typename KeyType, typename KeyTypeKeyCompare> std::pair< const_iterator, const_iterator > - equal_range(const KeyType &, KeyTypeKeyCompare) const; + equal_range(const KeyType &, KeyTypeKeyCompare) const; std::pair< iterator, iterator > - bounded_range(const key_type &, const key_type &, bool, bool); + bounded_range(const key_type &, const key_type &, bool, bool); template<typename KeyType, typename KeyTypeKeyCompare> std::pair< iterator, iterator > - bounded_range(const KeyType &, const KeyType &, KeyTypeKeyCompare, bool, + bounded_range(const KeyType &, const KeyType &, KeyTypeKeyCompare, bool, bool); std::pair< const_iterator, const_iterator > - bounded_range(const key_type &, const key_type &, bool, bool) const; + bounded_range(const key_type &, const key_type &, bool, bool) const; template<typename KeyType, typename KeyTypeKeyCompare> std::pair< const_iterator, const_iterator > - bounded_range(const KeyType &, const KeyType &, KeyTypeKeyCompare, bool, + bounded_range(const KeyType &, const KeyType &, KeyTypeKeyCompare, bool, bool) const; - iterator iterator_to(reference); - const_iterator iterator_to(const_reference) const; - pointer unlink_leftmost_without_rebalance(); - void replace_node(iterator, reference); - void remove_node(reference); + iterator iterator_to(reference); + const_iterator iterator_to(const_reference) const; + pointer unlink_leftmost_without_rebalance(); + void replace_node(iterator, reference); + void remove_node(reference); template<typename T, class... Options2> - void merge_unique(rbtree< T, Options2...> &); + void merge_unique(rbtree< T, Options2...> &); template<typename T, class... Options2> - void merge_equal(rbtree< T, Options2...> &); + void merge_equal(rbtree< T, Options2...> &); - // public static functions - static rbtree & container_from_end_iterator(iterator); - static const rbtree & container_from_end_iterator(const_iterator); - static rbtree & container_from_iterator(iterator); - static const rbtree & container_from_iterator(const_iterator); - static iterator s_iterator_to(reference); - static const_iterator s_iterator_to(const_reference); - static void init_node(reference); + // public static functions + static rbtree & container_from_end_iterator(iterator); + static const rbtree & container_from_end_iterator(const_iterator); + static rbtree & container_from_iterator(iterator); + static const rbtree & container_from_iterator(const_iterator); + static iterator s_iterator_to(reference); + static const_iterator s_iterator_to(const_reference); + static void init_node(reference); // public data members static const bool constant_time_size; @@ -209,13 +209,13 @@ construct/copy/destruct
      1. -
        rbtree();
        +
        rbtree();

        Effects: Constructs an empty container.

        Complexity: Constant.

        Throws: If value_traits::node_traits::node constructor throws (this does not happen with predefined Boost.Intrusive hooks) or the copy constructor of the key_compare object throws. Basic guarantee.

      2. -
        explicit rbtree(const key_compare & cmp, 
+
        explicit rbtree(const key_compare & cmp, 
                 const value_traits & v_traits = value_traits());
        
 
        Effects: Constructs an empty container with given comparison and traits.
        
 
        Complexity: Constant.
        
@@ -223,7 +223,7 @@
 
      3. template<typename Iterator> 
-  rbtree(bool unique, Iterator b, Iterator e, 
+  rbtree(bool unique, Iterator b, Iterator e, 
          const key_compare & cmp = key_compare(), 
          const value_traits & v_traits = value_traits());

        Requires: Dereferencing iterator must yield an lvalue of type value_type. cmp must be a comparison function that induces a strict weak ordering.

        @@ -232,17 +232,17 @@

        Throws: If value_traits::node_traits::node constructor throws (this does not happen with predefined Boost.Intrusive hooks) or the copy constructor/operator() of the key_compare object throws. Basic guarantee.

      4. -
        rbtree(rbtree && x);
        +
        rbtree(rbtree && x);

        Effects: Constructs a container moving resources from another container. Internal comparison object and value traits are move constructed and nodes belonging to x (except the node representing the "end") are linked to *this.

        Complexity: Constant.

        Throws: If value_traits::node_traits::node's move constructor throws (this does not happen with predefined Boost.Intrusive hooks) or the move constructor of the comparison objet throws.

      5. -
        rbtree & operator=(rbtree && x);
        +
        rbtree & operator=(rbtree && x);

        Effects: Equivalent to swap

      6. -
        ~rbtree();
        +
        ~rbtree();

        Effects: Detaches all elements from this. The objects in the set are not deleted (i.e. no destructors are called), but the nodes according to the value_traits template parameter are reinitialized and thus can be reused.

        Complexity: Linear to elements contained in *this.

        Throws: Nothing.

        @@ -251,131 +251,131 @@

      -rbtree public member functions

      +rbtree public member functions
      1. -
        iterator begin();
        +
        iterator begin();

        Effects: Returns an iterator pointing to the beginning of the container.

        Complexity: Constant.

        Throws: Nothing.

      2. -
        const_iterator begin() const;
        +
        const_iterator begin() const;

        Effects: Returns a const_iterator pointing to the beginning of the container.

        Complexity: Constant.

        Throws: Nothing.

      3. -
        const_iterator cbegin() const;
        +
        const_iterator cbegin() const;

        Effects: Returns a const_iterator pointing to the beginning of the container.

        Complexity: Constant.

        Throws: Nothing.

      4. -
        iterator end();
        +
        iterator end();

        Effects: Returns an iterator pointing to the end of the container.

        Complexity: Constant.

        Throws: Nothing.

      5. -
        const_iterator end() const;
        +
        const_iterator end() const;

        Effects: Returns a const_iterator pointing to the end of the container.

        Complexity: Constant.

        Throws: Nothing.

      6. -
        const_iterator cend() const;
        +
        const_iterator cend() const;

        Effects: Returns a const_iterator pointing to the end of the container.

        Complexity: Constant.

        Throws: Nothing.

      7. -
        reverse_iterator rbegin();
        +
        reverse_iterator rbegin();

        Effects: Returns a reverse_iterator pointing to the beginning of the reversed container.

        Complexity: Constant.

        Throws: Nothing.

      8. -
        const_reverse_iterator rbegin() const;
        +
        const_reverse_iterator rbegin() const;

        Effects: Returns a const_reverse_iterator pointing to the beginning of the reversed container.

        Complexity: Constant.

        Throws: Nothing.

      9. -
        const_reverse_iterator crbegin() const;
        +
        const_reverse_iterator crbegin() const;

        Effects: Returns a const_reverse_iterator pointing to the beginning of the reversed container.

        Complexity: Constant.

        Throws: Nothing.

      10. -
        reverse_iterator rend();
        +
        reverse_iterator rend();

        Effects: Returns a reverse_iterator pointing to the end of the reversed container.

        Complexity: Constant.

        Throws: Nothing.

      11. -
        const_reverse_iterator rend() const;
        +
        const_reverse_iterator rend() const;

        Effects: Returns a const_reverse_iterator pointing to the end of the reversed container.

        Complexity: Constant.

        Throws: Nothing.

      12. -
        const_reverse_iterator crend() const;
        +
        const_reverse_iterator crend() const;

        Effects: Returns a const_reverse_iterator pointing to the end of the reversed container.

        Complexity: Constant.

        Throws: Nothing.

      13. -
        iterator root();
        +
        iterator root();

        Effects: Returns a iterator pointing to the root node of the container or end() if not present.

        Complexity: Constant.

        Throws: Nothing.

      14. -
        const_iterator root() const;
        +
        const_iterator root() const;

        Effects: Returns a const_iterator pointing to the root node of the container or cend() if not present.

        Complexity: Constant.

        Throws: Nothing.

      15. -
        const_iterator croot() const;
        +
        const_iterator croot() const;

        Effects: Returns a const_iterator pointing to the root node of the container or cend() if not present.

        Complexity: Constant.

        Throws: Nothing.

      16. -
        key_compare key_comp() const;
        +
        key_compare key_comp() const;

        Effects: Returns the key_compare object used by the container.

        Complexity: Constant.

        Throws: If key_compare copy-constructor throws.

      17. -
        value_compare value_comp() const;
        +
        value_compare value_comp() const;

        Effects: Returns the value_compare object used by the container.

        Complexity: Constant.

        Throws: If value_compare copy-constructor throws.

      18. -
        bool empty() const;
        +
        bool empty() const;

        Effects: Returns true if the container is empty.

        Complexity: Constant.

        Throws: Nothing.

      19. -
        size_type size() const;
        +
        size_type size() const;

        Effects: Returns the number of elements stored in the container.

        Complexity: Linear to elements contained in *this if constant-time size option is disabled. Constant time otherwise.

        Throws: Nothing.

      20. -
        void swap(rbtree & other);
        +
        void swap(rbtree & other);

        Effects: Swaps the contents of two containers.

        Complexity: Constant.

        Throws: If the comparison functor's swap call throws. 

      21. template<typename Cloner, typename Disposer> 
-  void clone_from(const rbtree & src, Cloner cloner, Disposer disposer);
        + void clone_from(const rbtree & src, Cloner cloner, Disposer disposer);

        Requires: Disposer::operator()(pointer) shouldn't throw. Cloner should yield to nodes equivalent to the original nodes.

        Effects: Erases all the elements from *this calling Disposer::operator()(pointer), clones all the elements from src calling Cloner::operator()(const_reference ) and inserts them on *this. Copies the predicate from the source container.

        If cloner throws, all cloned elements are unlinked and disposed calling Disposer::operator()(pointer).

        @@ -384,7 +384,7 @@ 
      22. template<typename Cloner, typename Disposer> 
-  void clone_from(rbtree && src, Cloner cloner, Disposer disposer);
        + void clone_from(rbtree && src, Cloner cloner, Disposer disposer);

        Requires: Disposer::operator()(pointer) shouldn't throw. Cloner should yield to nodes equivalent to the original nodes.

        Effects: Erases all the elements from *this calling Disposer::operator()(pointer), clones all the elements from src calling Cloner::operator()(reference) and inserts them on *this. Copies the predicate from the source container.

        If cloner throws, all cloned elements are unlinked and disposed calling Disposer::operator()(pointer).

        @@ -394,7 +394,7 @@ 
      23. template<typename Cloner, typename Disposer> 
-  void clone_from(rbtree && src, Cloner cloner, Disposer disposer);
        + void clone_from(rbtree && src, Cloner cloner, Disposer disposer);

        Requires: Disposer::operator()(pointer) shouldn't throw. Cloner should yield to nodes equivalent to the original nodes.

        Effects: Erases all the elements from *this calling Disposer::operator()(pointer), clones all the elements from src calling Cloner::operator()(reference) and inserts them on *this. Copies the predicate from the source container.

        If cloner throws, all cloned elements are unlinked and disposed calling Disposer::operator()(pointer).

        @@ -403,7 +403,7 @@

        Note: This version can modify the source container, useful to implement move semantics.

      24. -
        iterator insert_equal(reference value);
        +
        iterator insert_equal(reference value);

        Requires: value must be an lvalue

        Effects: Inserts value into the container before the upper bound.

        Complexity: Average complexity for insert element is at most logarithmic.

        @@ -411,7 +411,7 @@

        Note: Does not affect the validity of iterators and references. No copy-constructors are called.

      25. -
        iterator insert_equal(const_iterator hint, reference value);
        +
        iterator insert_equal(const_iterator hint, reference value);

        Requires: value must be an lvalue, and "hint" must be a valid iterator.

        Effects: Inserts x into the container, using "hint" as a hint to where it will be inserted. If "hint" is the upper_bound the insertion takes constant time (two comparisons in the worst case)

        Complexity: Logarithmic in general, but it is amortized constant time if t is inserted immediately before hint.

        @@ -419,7 +419,7 @@

        Note: Does not affect the validity of iterators and references. No copy-constructors are called.

      26. -
        template<typename Iterator> void insert_equal(Iterator b, Iterator e);
        +
        template<typename Iterator> void insert_equal(Iterator b, Iterator e);

        Requires: Dereferencing iterator must yield an lvalue of type value_type.

        Effects: Inserts a each element of a range into the container before the upper bound of the key of each element.

        Complexity: Insert range is in general O(N * log(N)), where N is the size of the range. However, it is linear in N if the range is already sorted by value_comp().

        @@ -427,7 +427,7 @@

        Note: Does not affect the validity of iterators and references. No copy-constructors are called.

      27. -
        std::pair< iterator, bool > insert_unique(reference value);
        +
        std::pair< iterator, bool > insert_unique(reference value);

        Requires: value must be an lvalue

        Effects: Inserts value into the container if the value is not already present.

        Complexity: Average complexity for insert element is at most logarithmic.

        @@ -435,7 +435,7 @@

        Note: Does not affect the validity of iterators and references. No copy-constructors are called.

      28. -
        iterator insert_unique(const_iterator hint, reference value);
        +
        iterator insert_unique(const_iterator hint, reference value);

        Requires: value must be an lvalue, and "hint" must be a valid iterator

        Effects: Tries to insert x into the container, using "hint" as a hint to where it will be inserted.

        Complexity: Logarithmic in general, but it is amortized constant time (two comparisons in the worst case) if t is inserted immediately before hint.

        @@ -445,7 +445,7 @@ 
      29. template<typename KeyType, typename KeyTypeKeyCompare> 
   std::pair< iterator, bool > 
-  insert_unique_check(const KeyType & key, KeyTypeKeyCompare comp, 
+  insert_unique_check(const KeyType & key, KeyTypeKeyCompare comp, 
                       insert_commit_data & commit_data);

        Requires: comp must be a comparison function that induces the same strict weak ordering as key_compare. The difference is that comp compares an arbitrary key with the contained values.

        Effects: Checks if a value can be inserted in the container, using a user provided key instead of the value itself.

        @@ -459,7 +459,7 @@ 
      30. template<typename KeyType, typename KeyTypeKeyCompare> 
   std::pair< iterator, bool > 
-  insert_unique_check(const_iterator hint, const KeyType & key, 
+  insert_unique_check(const_iterator hint, const KeyType & key, 
                       KeyTypeKeyCompare comp, 
                       insert_commit_data & commit_data);

        Requires: comp must be a comparison function that induces the same strict weak ordering as key_compare. The difference is that comp compares an arbitrary key with the contained values.

        @@ -473,7 +473,7 @@ 
      31. std::pair< iterator, bool > 
-insert_unique_check(const key_type & key, insert_commit_data & commit_data);
        +insert_unique_check(const key_type & key, insert_commit_data & commit_data);

        Effects: Checks if a value can be inserted in the container, using a user provided key instead of the value itself.

        Returns: If there is an equivalent value returns a pair containing an iterator to the already present value and false. If the value can be inserted returns true in the returned pair boolean and fills "commit_data" that is meant to be used with the "insert_commit" function.

        Complexity: Average complexity is at most logarithmic.

        @@ -481,7 +481,7 @@ 
      32. std::pair< iterator, bool > 
-insert_unique_check(const_iterator hint, const key_type & key, 
+insert_unique_check(const_iterator hint, const key_type & key, 
                     insert_commit_data & commit_data);

        Effects: Checks if a value can be inserted in the container, using a user provided key instead of the value itself, using "hint" as a hint to where it will be inserted.

        Returns: If there is an equivalent value returns a pair containing an iterator to the already present value and false. If the value can be inserted returns true in the returned pair boolean and fills "commit_data" that is meant to be used with the "insert_commit" function.

        @@ -489,7 +489,7 @@

        Throws: If the comp ordering function throws. Strong guarantee.

      33. -
        iterator insert_unique_commit(reference value, 
+
        iterator insert_unique_commit(reference value, 
                               const insert_commit_data & commit_data);
        
 
        Requires: value must be an lvalue of type value_type. commit_data must have been obtained from a previous call to "insert_check". No objects should have been inserted or erased from the container between the "insert_check" that filled "commit_data" and the call to "insert_commit".
        
 
        Effects: Inserts the value in the container using the information obtained from the "commit_data" that a previous "insert_check" filled.
        
@@ -499,7 +499,7 @@
 
        Notes: This function has only sense if a "insert_check" has been previously executed to fill "commit_data". No value should be inserted or erased between the "insert_check" and "insert_commit" calls.
      34. -
        template<typename Iterator> void insert_unique(Iterator b, Iterator e);
        +
        template<typename Iterator> void insert_unique(Iterator b, Iterator e);

        Requires: Dereferencing iterator must yield an lvalue of type value_type.

        Effects: Tries to insert each element of a range into the container.

        Complexity: Insert range is in general O(N * log(N)), where N is the size of the range. However, it is linear in N if the range is already sorted by value_comp().

        @@ -507,7 +507,7 @@

        Note: Does not affect the validity of iterators and references. No copy-constructors are called.

      35. -
        iterator insert_before(const_iterator pos, reference value);
        +
        iterator insert_before(const_iterator pos, reference value);

        Requires: value must be an lvalue, "pos" must be a valid iterator (or end) and must be the succesor of value once inserted according to the predicate

        Effects: Inserts x into the container before "pos".

        Complexity: Constant time.

        @@ -515,7 +515,7 @@

        Note: This function does not check preconditions so if "pos" is not the successor of "value" container ordering invariant will be broken. This is a low-level function to be used only for performance reasons by advanced users.

      36. -
        void push_back(reference value);
        +
        void push_back(reference value);

        Requires: value must be an lvalue, and it must be no less than the greatest inserted key

        Effects: Inserts x into the container in the last position.

        Complexity: Constant time.

        @@ -523,7 +523,7 @@

        Note: This function does not check preconditions so if value is less than the greatest inserted key container ordering invariant will be broken. This function is slightly more efficient than using "insert_before". This is a low-level function to be used only for performance reasons by advanced users.

      37. -
        void push_front(reference value);
        +
        void push_front(reference value);

        Requires: value must be an lvalue, and it must be no greater than the minimum inserted key

        Effects: Inserts x into the container in the first position.

        Complexity: Constant time.

        @@ -531,21 +531,21 @@

        Note: This function does not check preconditions so if value is greater than the minimum inserted key container ordering invariant will be broken. This function is slightly more efficient than using "insert_before". This is a low-level function to be used only for performance reasons by advanced users.

      38. -
        iterator erase(const_iterator i);
        +
        iterator erase(const_iterator i);

        Effects: Erases the element pointed to by i.

        Complexity: Average complexity for erase element is constant time.

        Throws: Nothing.

        Note: Invalidates the iterators (but not the references) to the erased elements. No destructors are called.

      39. -
        iterator erase(const_iterator b, const_iterator e);
        +
        iterator erase(const_iterator b, const_iterator e);

        Effects: Erases the range pointed to by b end e.

        Complexity: Average complexity for erase range is at most O(log(size() + N)), where N is the number of elements in the range.

        Throws: Nothing.

        Note: Invalidates the iterators (but not the references) to the erased elements. No destructors are called.

      40. -
        size_type erase(const key_type & key);
        +
        size_type erase(const key_type & key);

        Effects: Erases all the elements with the given value.

        Returns: The number of erased elements.

        Complexity: O(log(size() + N).

        @@ -554,7 +554,7 @@ 
      41. template<typename KeyType, typename KeyTypeKeyCompare> 
-  size_type erase(const KeyType & key, KeyTypeKeyCompare comp);
        + size_type erase(const KeyType & key, KeyTypeKeyCompare comp);

        Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk), with nk the key_type of a value_type inserted into *this.

        Effects: Erases all the elements with the given key. according to the comparison functor "comp".

        Returns: The number of erased elements.

        @@ -564,7 +564,7 @@ 
      42. template<typename Disposer> 
-  iterator erase_and_dispose(const_iterator i, Disposer disposer);
        + iterator erase_and_dispose(const_iterator i, Disposer disposer);

        Requires: Disposer::operator()(pointer) shouldn't throw.

        Effects: Erases the element pointed to by i. Disposer::operator()(pointer) is called for the removed element.

        Complexity: Average complexity for erase element is constant time.

        @@ -573,7 +573,7 @@ 
      43. template<typename Disposer> 
-  iterator erase_and_dispose(const_iterator b, const_iterator e, 
+  iterator erase_and_dispose(const_iterator b, const_iterator e, 
                              Disposer disposer);

        Requires: Disposer::operator()(pointer) shouldn't throw.

        Effects: Erases the range pointed to by b end e. Disposer::operator()(pointer) is called for the removed elements.

        @@ -583,7 +583,7 @@ 
      44. template<typename Disposer> 
-  size_type erase_and_dispose(const key_type & key, Disposer disposer);
        + size_type erase_and_dispose(const key_type & key, Disposer disposer);

        Requires: Disposer::operator()(pointer) shouldn't throw.

        Effects: Erases all the elements with the given value. Disposer::operator()(pointer) is called for the removed elements.

        Returns: The number of erased elements.

        @@ -593,7 +593,7 @@ 
      45. template<typename KeyType, typename KeyTypeKeyCompare, typename Disposer> 
-  size_type erase_and_dispose(const KeyType & key, KeyTypeKeyCompare comp, 
+  size_type erase_and_dispose(const KeyType & key, KeyTypeKeyCompare comp, 
                               Disposer disposer);

        Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk) and nk the key_type of a value_type inserted into *this.

        Requires: Disposer::operator()(pointer) shouldn't throw.

        @@ -604,47 +604,47 @@

        Note: Invalidates the iterators to the erased elements.

      46. -
        void clear();
        +
        void clear();

        Effects: Erases all of the elements.

        Complexity: Linear to the number of elements on the container. if it's a safe-mode or auto-unlink value_type. Constant time otherwise.

        Throws: Nothing.

        Note: Invalidates the iterators (but not the references) to the erased elements. No destructors are called.

      47. -
        template<typename Disposer> void clear_and_dispose(Disposer disposer);
        +
        template<typename Disposer> void clear_and_dispose(Disposer disposer);

        Effects: Erases all of the elements calling disposer(p) for each node to be erased. Complexity: Average complexity for is at most O(log(size() + N)), where N is the number of elements in the container.

        Throws: Nothing.

        Note: Invalidates the iterators (but not the references) to the erased elements. Calls N times to disposer functor.

      48. -
        size_type count(const key_type & key) const;
        +
        size_type count(const key_type & key) const;

        Effects: Returns the number of contained elements with the given value

        Complexity: Logarithmic to the number of elements contained plus lineal to number of objects with the given value.

        Throws: If key_compare throws. 

      49. template<typename KeyType, typename KeyTypeKeyCompare> 
-  size_type count(const KeyType & key, KeyTypeKeyCompare comp) const;
        + size_type count(const KeyType & key, KeyTypeKeyCompare comp) const;

        Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk), and nk the key_type of a value_type inserted into *this.

        Effects: Returns the number of contained elements with the given key

        Complexity: Logarithmic to the number of elements contained plus lineal to number of objects with the given key.

        Throws: If comp throws.

      50. -
        iterator lower_bound(const key_type & key);
        +
        iterator lower_bound(const key_type & key);

        Effects: Returns an iterator to the first element whose key is not less than k or end() if that element does not exist.

        Complexity: Logarithmic.

        Throws: If key_compare throws. 

      51. template<typename KeyType, typename KeyTypeKeyCompare> 
-  iterator lower_bound(const KeyType & key, KeyTypeKeyCompare comp);
        + iterator lower_bound(const KeyType & key, KeyTypeKeyCompare comp);

        Effects: Returns an iterator to the first element whose key is not less than k or end() if that element does not exist.

        Complexity: Logarithmic.

        Throws: If key_compare throws.

      52. -
        const_iterator lower_bound(const key_type & key) const;
        +
        const_iterator lower_bound(const key_type & key) const;

        Effects: Returns an iterator to the first element whose key is not less than k or end() if that element does not exist.

        Complexity: Logarithmic.

        Throws: If key_compare throws.

        @@ -652,27 +652,27 @@ 
      53. template<typename KeyType, typename KeyTypeKeyCompare> 
   const_iterator 
-  lower_bound(const KeyType & key, KeyTypeKeyCompare comp) const;
        + lower_bound(const KeyType & key, KeyTypeKeyCompare comp) const;

        Effects: Returns an iterator to the first element whose key is not less than k or end() if that element does not exist.

        Complexity: Logarithmic.

        Throws: If key_compare throws.

      54. -
        iterator upper_bound(const key_type & key);
        +
        iterator upper_bound(const key_type & key);

        Effects: Returns an iterator to the first element whose key is greater than k or end() if that element does not exist.

        Complexity: Logarithmic.

        Throws: If key_compare throws. 

      55. template<typename KeyType, typename KeyTypeKeyCompare> 
-  iterator upper_bound(const KeyType & key, KeyTypeKeyCompare comp);
        + iterator upper_bound(const KeyType & key, KeyTypeKeyCompare comp);

        Requires: key is a value such that *this is partitioned with respect to !comp(key, nk), with nk the key_type of a value_type inserted into *this.

        Effects: Returns an iterator to the first element whose key is greater than k according to comp or end() if that element does not exist.

        Complexity: Logarithmic.

        Throws: If comp throws.

      56. -
        const_iterator upper_bound(const key_type & key) const;
        +
        const_iterator upper_bound(const key_type & key) const;

        Effects: Returns an iterator to the first element whose key is greater than k or end() if that element does not exist.

        Complexity: Logarithmic.

        Throws: If key_compare throws.

        @@ -680,42 +680,42 @@ 
      57. template<typename KeyType, typename KeyTypeKeyCompare> 
   const_iterator 
-  upper_bound(const KeyType & key, KeyTypeKeyCompare comp) const;
        + upper_bound(const KeyType & key, KeyTypeKeyCompare comp) const;

        Requires: key is a value such that *this is partitioned with respect to !comp(key, nk), with nk the key_type of a value_type inserted into *this.

        Effects: Returns an iterator to the first element whose key is greater than k according to comp or end() if that element does not exist.

        Complexity: Logarithmic.

        Throws: If comp throws.

      58. -
        iterator find(const key_type & key);
        +
        iterator find(const key_type & key);

        Effects: Finds an iterator to the first element whose key is k or end() if that element does not exist.

        Complexity: Logarithmic.

        Throws: If key_compare throws. 

      59. template<typename KeyType, typename KeyTypeKeyCompare> 
-  iterator find(const KeyType & key, KeyTypeKeyCompare comp);
        + iterator find(const KeyType & key, KeyTypeKeyCompare comp);

        Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk), and nk the key_type of a value_type inserted into *this.

        Effects: Finds an iterator to the first element whose key is k or end() if that element does not exist.

        Complexity: Logarithmic.

        Throws: If comp throws.

      60. -
        const_iterator find(const key_type & key) const;
        +
        const_iterator find(const key_type & key) const;

        Effects: Finds an iterator to the first element whose key is k or end() if that element does not exist.

        Complexity: Logarithmic.

        Throws: If key_compare throws. 

      61. template<typename KeyType, typename KeyTypeKeyCompare> 
-  const_iterator find(const KeyType & key, KeyTypeKeyCompare comp) const;
        + const_iterator find(const KeyType & key, KeyTypeKeyCompare comp) const;

        Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk), and nk the key_type of a value_type inserted into *this.

        Effects: Finds an iterator to the first element whose key is k or end() if that element does not exist.

        Complexity: Logarithmic.

        Throws: If comp throws.

      62. -
        std::pair< iterator, iterator > equal_range(const key_type & key);
        +
        std::pair< iterator, iterator > equal_range(const key_type & key);

        Effects: Finds a range containing all elements whose key is k or an empty range that indicates the position where those elements would be if they there is no elements with key k.

        Complexity: Logarithmic.

        Throws: If key_compare throws.

        @@ -723,7 +723,7 @@ 
      63. template<typename KeyType, typename KeyTypeKeyCompare> 
   std::pair< iterator, iterator > 
-  equal_range(const KeyType & key, KeyTypeKeyCompare comp);
        + equal_range(const KeyType & key, KeyTypeKeyCompare comp);

        Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk), with nk the key_type of a value_type inserted into *this.

        Effects: Finds a range containing all elements whose key is k or an empty range that indicates the position where those elements would be if they there is no elements with key k.

        Complexity: Logarithmic.

        @@ -731,7 +731,7 @@ 
      64. std::pair< const_iterator, const_iterator > 
-equal_range(const key_type & key) const;
        +equal_range(const key_type & key) const;

        Effects: Finds a range containing all elements whose key is k or an empty range that indicates the position where those elements would be if they there is no elements with key k.

        Complexity: Logarithmic.

        Throws: If key_compare throws.

        @@ -739,7 +739,7 @@ 
      65. template<typename KeyType, typename KeyTypeKeyCompare> 
   std::pair< const_iterator, const_iterator > 
-  equal_range(const KeyType & key, KeyTypeKeyCompare comp) const;
        + equal_range(const KeyType & key, KeyTypeKeyCompare comp) const;

        Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk), with nk the key_type of a value_type inserted into *this.

        Effects: Finds a range containing all elements whose key is k or an empty range that indicates the position where those elements would be if they there is no elements with key k.

        Complexity: Logarithmic.

        @@ -747,7 +747,7 @@ 
      66. std::pair< iterator, iterator > 
-bounded_range(const key_type & lower, const key_type & upper_key, 
+bounded_range(const key_type & lower, const key_type & upper_key, 
               bool left_closed, bool right_closed);

        Requires: upper_key shall not precede lower_key according to key_compare. [key_comp()(upper_key, lower_key) shall be false]

        If lower_key is equivalent to upper_key [!key_comp()(upper_key, lower_key) && !key_comp()(lower_key, upper_key)] then ('left_closed' || 'right_closed') must be false.

        @@ -762,7 +762,7 @@ 
      67. template<typename KeyType, typename KeyTypeKeyCompare> 
   std::pair< iterator, iterator > 
-  bounded_range(const KeyType & lower_key, const KeyType & upper_key, 
+  bounded_range(const KeyType & lower_key, const KeyType & upper_key, 
                 KeyTypeKeyCompare comp, bool left_closed, bool right_closed);

        Requires: lower_key is a value such that *this is partitioned with respect to comp(nk, lower_key) if left_closed is true, with respect to !comp(lower_key, nk) otherwise.

        upper_key is a value such that *this is partitioned with respect to !comp(upper_key, nk) if right_closed is true, with respect to comp(nk, upper_key) otherwise.

        @@ -778,7 +778,7 @@ 
      68. std::pair< const_iterator, const_iterator > 
-bounded_range(const key_type & lower_key, const key_type & upper_key, 
+bounded_range(const key_type & lower_key, const key_type & upper_key, 
               bool left_closed, bool right_closed) const;

        Requires: upper_key shall not precede lower_key according to key_compare. [key_comp()(upper_key, lower_key) shall be false]

        If lower_key is equivalent to upper_key [!key_comp()(upper_key, lower_key) && !key_comp()(lower_key, upper_key)] then ('left_closed' || 'right_closed') must be false.

        @@ -793,7 +793,7 @@ 
      69. template<typename KeyType, typename KeyTypeKeyCompare> 
   std::pair< const_iterator, const_iterator > 
-  bounded_range(const KeyType & lower_key, const KeyType & upper_key, 
+  bounded_range(const KeyType & lower_key, const KeyType & upper_key, 
                 KeyTypeKeyCompare comp, bool left_closed, bool right_closed) const;

        Requires: lower_key is a value such that *this is partitioned with respect to comp(nk, lower_key) if left_closed is true, with respect to !comp(lower_key, nk) otherwise.

        upper_key is a value such that *this is partitioned with respect to !comp(upper_key, nk) if right_closed is true, with respect to comp(nk, upper_key) otherwise.

        @@ -808,28 +808,28 @@

        Note: Experimental function, the interface might change in future releases.

      70. -
        iterator iterator_to(reference value);
        +
        iterator iterator_to(reference value);

        Requires: value must be an lvalue and shall be in a set of appropriate type. Otherwise the behavior is undefined.

        Effects: Returns: a valid iterator i belonging to the set that points to the value

        Complexity: Constant.

        Throws: Nothing.

      71. -
        const_iterator iterator_to(const_reference value) const;
        +
        const_iterator iterator_to(const_reference value) const;

        Requires: value must be an lvalue and shall be in a set of appropriate type. Otherwise the behavior is undefined.

        Effects: Returns: a valid const_iterator i belonging to the set that points to the value

        Complexity: Constant.

        Throws: Nothing.

      72. -
        pointer unlink_leftmost_without_rebalance();
        +
        pointer unlink_leftmost_without_rebalance();

        Effects: Unlinks the leftmost node from the container.

        Complexity: Average complexity is constant time.

        Throws: Nothing.

        Notes: This function breaks the container and the container can only be used for more unlink_leftmost_without_rebalance calls. This function is normally used to achieve a step by step controlled destruction of the container.

      73. -
        void replace_node(iterator replace_this, reference with_this);
        +
        void replace_node(iterator replace_this, reference with_this);

        Requires: replace_this must be a valid iterator of *this and with_this must not be inserted in any container.

        Effects: Replaces replace_this in its position in the container with with_this. The container does not need to be rebalanced.

        Complexity: Constant.

        @@ -837,7 +837,7 @@

        Note: This function will break container ordering invariants if with_this is not equivalent to *replace_this according to the ordering rules. This function is faster than erasing and inserting the node, since no rebalancing or comparison is needed.

      74. -
        void remove_node(reference value);
        +
        void remove_node(reference value);

        Effects: removes "value" from the container.

        Throws: Nothing.

        Complexity: Logarithmic time.

        @@ -846,7 +846,7 @@ 
      75. template<typename T, class... Options2> 
-  void merge_unique(rbtree< T, Options2...> &);
        + void merge_unique(rbtree< T, Options2...> &);

        Requires: "source" container's Options can only can differ in the comparison function from *this.

        Effects: Attempts to extract each element in source and insert it into a using the comparison object of *this. If there is an element in a with key equivalent to the key of an element from source, then that element is not extracted from source.

        Postcondition: Pointers and references to the transferred elements of source refer to those same elements but as members of *this. Iterators referring to the transferred elements will continue to refer to their elements, but they now behave as iterators into *this, not into source.

        @@ -855,7 +855,7 @@ 
      76. template<typename T, class... Options2> 
-  void merge_equal(rbtree< T, Options2...> &);
        + void merge_equal(rbtree< T, Options2...> &);

        Requires: "source" container's Options can only can differ in the comparison function from *this.

        Effects: Extracts each element in source and insert it into a using the comparison object of *this.

        Postcondition: Pointers and references to the transferred elements of source refer to those same elements but as members of *this. Iterators referring to the transferred elements will continue to refer to their elements, but they now behave as iterators into *this, not into source.

        @@ -866,38 +866,38 @@

      -rbtree public static functions

      +rbtree public static functions
      1. -
        static rbtree & container_from_end_iterator(iterator end_iterator);
        +
        static rbtree & container_from_end_iterator(iterator end_iterator);

        Precondition: end_iterator must be a valid end iterator of the container.

        Effects: Returns a const reference to the container associated to the end iterator

        Throws: Nothing.

        Complexity: Constant.

      2. -
        static const rbtree & container_from_end_iterator(const_iterator end_iterator);
        +
        static const rbtree & container_from_end_iterator(const_iterator end_iterator);

        Precondition: end_iterator must be a valid end iterator of the container.

        Effects: Returns a const reference to the container associated to the end iterator

        Throws: Nothing.

        Complexity: Constant.

      3. -
        static rbtree & container_from_iterator(iterator it);
        +
        static rbtree & container_from_iterator(iterator it);

        Precondition: it must be a valid iterator of the container.

        Effects: Returns a const reference to the container associated to the iterator

        Throws: Nothing.

        Complexity: Logarithmic.

      4. -
        static const rbtree & container_from_iterator(const_iterator it);
        +
        static const rbtree & container_from_iterator(const_iterator it);

        Precondition: it must be a valid iterator of the container.

        Effects: Returns a const reference to the container associated to the iterator

        Throws: Nothing.

        Complexity: Logarithmic.

      5. -
        static iterator s_iterator_to(reference value);
        +
        static iterator s_iterator_to(reference value);

        Requires: value must be an lvalue and shall be in a set of appropriate type. Otherwise the behavior is undefined.

        Effects: Returns: a valid iterator i belonging to the set that points to the value

        Complexity: Constant.

        @@ -905,7 +905,7 @@

        Note: This static function is available only if the value traits is stateless.

      6. -
        static const_iterator s_iterator_to(const_reference value);
        +
        static const_iterator s_iterator_to(const_reference value);

        Requires: value must be an lvalue and shall be in a set of appropriate type. Otherwise the behavior is undefined.

        Effects: Returns: a valid iterator i belonging to the set that points to the value

        Complexity: Constant.

        @@ -913,7 +913,7 @@

        Note: This static function is available only if the value traits is stateless.

      7. -
        static void init_node(reference value);
        +
        static void init_node(reference value);

        Requires: value shall not be in a container.

        Effects: init_node puts the hook of a value in a well-known default state.

        Throws: Nothing.

        @@ -934,7 +934,7 @@
        -PrevUpHomeNext +PrevUpHomeNext
        diff --git a/doc/html/boost/intrusive/rbtree_algorithms.html b/doc/html/boost/intrusive/rbtree_algorithms.html index e9ac51a631..09aa787bc9 100644 --- a/doc/html/boost/intrusive/rbtree_algorithms.html +++ b/doc/html/boost/intrusive/rbtree_algorithms.html @@ -43,84 +43,84 @@ typedef NodeTraits::color color; typedef bstree_algo::insert_commit_data insert_commit_data; - // public static functions - static node_ptr get_header(const const_node_ptr &); - static node_ptr begin_node(const const_node_ptr &); - static node_ptr end_node(const const_node_ptr &); - static void swap_tree(const node_ptr &, const node_ptr &); - static void swap_nodes(const node_ptr &, const node_ptr &); - static void swap_nodes(const node_ptr &, const node_ptr &, const node_ptr &, + // public static functions + static node_ptr get_header(const const_node_ptr &); + static node_ptr begin_node(const const_node_ptr &); + static node_ptr end_node(const const_node_ptr &); + static void swap_tree(const node_ptr &, const node_ptr &); + static void swap_nodes(const node_ptr &, const node_ptr &); + static void swap_nodes(const node_ptr &, const node_ptr &, const node_ptr &, const node_ptr &); - static void replace_node(const node_ptr &, const node_ptr &); - static void replace_node(const node_ptr &, const node_ptr &, + static void replace_node(const node_ptr &, const node_ptr &); + static void replace_node(const node_ptr &, const node_ptr &, const node_ptr &); - static void unlink(const node_ptr &); - static node_ptr unlink_leftmost_without_rebalance(const node_ptr &); - static bool unique(const const_node_ptr &); - static std::size_t size(const const_node_ptr &); - static node_ptr next_node(const node_ptr &); - static node_ptr prev_node(const node_ptr &); - static void init(const node_ptr &); - static void init_header(const node_ptr &); - static node_ptr erase(const node_ptr &, const node_ptr &); + static void unlink(const node_ptr &); + static node_ptr unlink_leftmost_without_rebalance(const node_ptr &); + static bool unique(const const_node_ptr &); + static std::size_t size(const const_node_ptr &); + static node_ptr next_node(const node_ptr &); + static node_ptr prev_node(const node_ptr &); + static void init(const node_ptr &); + static void init_header(const node_ptr &); + static node_ptr erase(const node_ptr &, const node_ptr &); template<typename NodePtrCompare> - static bool transfer_unique(const node_ptr &, NodePtrCompare, + static bool transfer_unique(const node_ptr &, NodePtrCompare, const node_ptr &, const node_ptr &); template<typename NodePtrCompare> - static void transfer_equal(const node_ptr &, NodePtrCompare, + static void transfer_equal(const node_ptr &, NodePtrCompare, const node_ptr &, const node_ptr &); template<typename Cloner, typename Disposer> - static void clone(const const_node_ptr &, const node_ptr &, Cloner, + static void clone(const const_node_ptr &, const node_ptr &, Cloner, Disposer); template<typename Disposer> - static void clear_and_dispose(const node_ptr &, Disposer); + static void clear_and_dispose(const node_ptr &, Disposer); template<typename KeyType, typename KeyNodePtrCompare> static node_ptr - lower_bound(const const_node_ptr &, const KeyType &, KeyNodePtrCompare); + lower_bound(const const_node_ptr &, const KeyType &, KeyNodePtrCompare); template<typename KeyType, typename KeyNodePtrCompare> static node_ptr - upper_bound(const const_node_ptr &, const KeyType &, KeyNodePtrCompare); + upper_bound(const const_node_ptr &, const KeyType &, KeyNodePtrCompare); template<typename KeyType, typename KeyNodePtrCompare> static node_ptr - find(const const_node_ptr &, const KeyType &, KeyNodePtrCompare); + find(const const_node_ptr &, const KeyType &, KeyNodePtrCompare); template<typename KeyType, typename KeyNodePtrCompare> static std::pair< node_ptr, node_ptr > - equal_range(const const_node_ptr &, const KeyType &, KeyNodePtrCompare); + equal_range(const const_node_ptr &, const KeyType &, KeyNodePtrCompare); template<typename KeyType, typename KeyNodePtrCompare> static std::pair< node_ptr, node_ptr > - bounded_range(const const_node_ptr &, const KeyType &, const KeyType &, + bounded_range(const const_node_ptr &, const KeyType &, const KeyType &, KeyNodePtrCompare, bool, bool); template<typename KeyType, typename KeyNodePtrCompare> static std::size_t - count(const const_node_ptr &, const KeyType &, KeyNodePtrCompare); + count(const const_node_ptr &, const KeyType &, KeyNodePtrCompare); template<typename NodePtrCompare> static node_ptr - insert_equal_upper_bound(const node_ptr &, const node_ptr &, + insert_equal_upper_bound(const node_ptr &, const node_ptr &, NodePtrCompare); template<typename NodePtrCompare> static node_ptr - insert_equal_lower_bound(const node_ptr &, const node_ptr &, + insert_equal_lower_bound(const node_ptr &, const node_ptr &, NodePtrCompare); template<typename NodePtrCompare> static node_ptr - insert_equal(const node_ptr &, const node_ptr &, const node_ptr &, + insert_equal(const node_ptr &, const node_ptr &, const node_ptr &, NodePtrCompare); static node_ptr - insert_before(const node_ptr &, const node_ptr &, const node_ptr &); - static void push_back(const node_ptr &, const node_ptr &); - static void push_front(const node_ptr &, const node_ptr &); + insert_before(const node_ptr &, const node_ptr &, const node_ptr &); + static void push_back(const node_ptr &, const node_ptr &); + static void push_front(const node_ptr &, const node_ptr &); template<typename KeyType, typename KeyNodePtrCompare> static std::pair< node_ptr, bool > - insert_unique_check(const const_node_ptr &, const KeyType &, + insert_unique_check(const const_node_ptr &, const KeyType &, KeyNodePtrCompare, insert_commit_data &); template<typename KeyType, typename KeyNodePtrCompare> static std::pair< node_ptr, bool > - insert_unique_check(const const_node_ptr &, const node_ptr &, + insert_unique_check(const const_node_ptr &, const node_ptr &, const KeyType &, KeyNodePtrCompare, insert_commit_data &); - static void insert_unique_commit(const node_ptr &, const node_ptr &, + static void insert_unique_commit(const node_ptr &, const node_ptr &, const insert_commit_data &); - static bool is_header(const const_node_ptr &); + static bool is_header(const const_node_ptr &); };

      Description

      @@ -157,38 +157,38 @@

      -rbtree_algorithms public static functions

      +rbtree_algorithms public static functions
      1. -
        static node_ptr get_header(const const_node_ptr & n);
        +
        static node_ptr get_header(const const_node_ptr & n);

        Requires: 'node' is a node of the tree or a header node.

        Effects: Returns the header of the tree.

        Complexity: Logarithmic.

        Throws: Nothing.

      2. -
        static node_ptr begin_node(const const_node_ptr & header);
        +
        static node_ptr begin_node(const const_node_ptr & header);

        Requires: 'header' is the header node of a tree.

        Effects: Returns the first node of the tree, the header if the tree is empty.

        Complexity: Constant time.

        Throws: Nothing.

      3. -
        static node_ptr end_node(const const_node_ptr & header);
        +
        static node_ptr end_node(const const_node_ptr & header);

        Requires: 'header' is the header node of a tree.

        Effects: Returns the header of the tree.

        Complexity: Constant time.

        Throws: Nothing.

      4. -
        static void swap_tree(const node_ptr & header1, const node_ptr & header2);
        +
        static void swap_tree(const node_ptr & header1, const node_ptr & header2);

        Requires: header1 and header2 must be the header nodes of two trees.

        Effects: Swaps two trees. After the function header1 will contain links to the second tree and header2 will have links to the first tree.

        Complexity: Constant.

        Throws: Nothing.

      5. -
        static void swap_nodes(const node_ptr & node1, const node_ptr & node2);
        +
        static void swap_nodes(const node_ptr & node1, const node_ptr & node2);

        Requires: node1 and node2 can't be header nodes of two trees.

        Effects: Swaps two nodes. After the function node1 will be inserted in the position node2 before the function. node2 will be inserted in the position node1 had before the function.

        Complexity: Logarithmic.

        @@ -197,7 +197,7 @@

        Experimental function

      6. -
        static void swap_nodes(const node_ptr & node1, const node_ptr & header1, 
+
        static void swap_nodes(const node_ptr & node1, const node_ptr & header1, 
                        const node_ptr & node2, const node_ptr & header2);
        
 
        Requires: node1 and node2 can't be header nodes of two trees with header header1 and header2.
        
 
        Effects: Swaps two nodes. After the function node1 will be inserted in the position node2 before the function. node2 will be inserted in the position node1 had before the function.
        
@@ -207,7 +207,7 @@
 
        Experimental function
      7. -
        static void replace_node(const node_ptr & node_to_be_replaced, 
+
        static void replace_node(const node_ptr & node_to_be_replaced, 
                          const node_ptr & new_node);
        
 
        Requires: node_to_be_replaced must be inserted in a tree and new_node must not be inserted in a tree.
        
 
        Effects: Replaces node_to_be_replaced in its position in the tree with new_node. The tree does not need to be rebalanced
        
@@ -216,7 +216,7 @@
 
        Note: This function will break container ordering invariants if new_node is not equivalent to node_to_be_replaced according to the ordering rules. This function is faster than erasing and inserting the node, since no rebalancing and comparison is needed. Experimental function
      8. -
        static void replace_node(const node_ptr & node_to_be_replaced, 
+
        static void replace_node(const node_ptr & node_to_be_replaced, 
                          const node_ptr & header, const node_ptr & new_node);
        
 
        Requires: node_to_be_replaced must be inserted in a tree with header "header" and new_node must not be inserted in a tree.
        
 
        Effects: Replaces node_to_be_replaced in its position in the tree with new_node. The tree does not need to be rebalanced
        
@@ -225,14 +225,14 @@
 
        Note: This function will break container ordering invariants if new_node is not equivalent to node_to_be_replaced according to the ordering rules. This function is faster than erasing and inserting the node, since no rebalancing or comparison is needed. Experimental function
      9. -
        static void unlink(const node_ptr & node);
        +
        static void unlink(const node_ptr & node);

        Requires: node is a tree node but not the header.

        Effects: Unlinks the node and rebalances the tree.

        Complexity: Average complexity is constant time.

        Throws: Nothing.

      10. -
        static node_ptr unlink_leftmost_without_rebalance(const node_ptr & header);
        +
        static node_ptr unlink_leftmost_without_rebalance(const node_ptr & header);

        Requires: header is the header of a tree.

        Effects: Unlinks the leftmost node from the tree, and updates the header link to the new leftmost node.

        Complexity: Average complexity is constant time.

        @@ -240,35 +240,35 @@

        Notes: This function breaks the tree and the tree can only be used for more unlink_leftmost_without_rebalance calls. This function is normally used to achieve a step by step controlled destruction of the tree.

      11. -
        static bool unique(const const_node_ptr & node);
        +
        static bool unique(const const_node_ptr & node);

        Requires: 'node' is a node of the tree or a node initialized by init(...) or init_node.

        Effects: Returns true if the node is initialized by init() or init_node().

        Complexity: Constant time.

        Throws: Nothing.

      12. -
        static std::size_t size(const const_node_ptr & header);
        +
        static std::size_t size(const const_node_ptr & header);

        Requires: node is a node of the tree but it's not the header.

        Effects: Returns the number of nodes of the subtree.

        Complexity: Linear time.

        Throws: Nothing.

      13. -
        static node_ptr next_node(const node_ptr & node);
        +
        static node_ptr next_node(const node_ptr & node);

        Requires: 'node' is a node from the tree except the header.

        Effects: Returns the next node of the tree.

        Complexity: Average constant time.

        Throws: Nothing.

      14. -
        static node_ptr prev_node(const node_ptr & node);
        +
        static node_ptr prev_node(const node_ptr & node);

        Requires: 'node' is a node from the tree except the leftmost node.

        Effects: Returns the previous node of the tree.

        Complexity: Average constant time.

        Throws: Nothing.

      15. -
        static void init(const node_ptr & node);
        +
        static void init(const node_ptr & node);

        Requires: 'node' must not be part of any tree.

        Effects: After the function unique(node) == true.

        Complexity: Constant.

        @@ -276,7 +276,7 @@

        Nodes: If node is inserted in a tree, this function corrupts the tree.

      16. -
        static void init_header(const node_ptr & header);
        +
        static void init_header(const node_ptr & header);

        Requires: node must not be part of any tree.

        Effects: Initializes the header to represent an empty tree. unique(header) == true.

        Complexity: Constant.

        @@ -284,7 +284,7 @@

        Nodes: If node is inserted in a tree, this function corrupts the tree.

      17. -
        static node_ptr erase(const node_ptr & header, const node_ptr & z);
        +
        static node_ptr erase(const node_ptr & header, const node_ptr & z);

        Requires: header must be the header of a tree, z a node of that tree and z != header.

        Effects: Erases node "z" from the tree with header "header".

        Complexity: Amortized constant time.

        @@ -292,7 +292,7 @@ 
      18. template<typename NodePtrCompare> 
-  static bool transfer_unique(const node_ptr & header1, NodePtrCompare comp, 
+  static bool transfer_unique(const node_ptr & header1, NodePtrCompare comp, 
                               const node_ptr & header2, const node_ptr & z);

        Requires: header1 and header2 must be the headers of trees tree1 and tree2 respectively, z a non-header node of tree1. NodePtrCompare is the comparison function of tree1..

        Effects: Transfers node "z" from tree1 to tree2 if tree1 does not contain a node that is equivalent to z.

        @@ -302,7 +302,7 @@ 
      19. template<typename NodePtrCompare> 
-  static void transfer_equal(const node_ptr & header1, NodePtrCompare comp, 
+  static void transfer_equal(const node_ptr & header1, NodePtrCompare comp, 
                              const node_ptr & header2, const node_ptr & z);

        Requires: header1 and header2 must be the headers of trees tree1 and tree2 respectively, z a non-header node of tree1. NodePtrCompare is the comparison function of tree1..

        Effects: Transfers node "z" from tree1 to tree2.

        @@ -311,7 +311,7 @@ 
      20. template<typename Cloner, typename Disposer> 
-  static void clone(const const_node_ptr & source_header, 
+  static void clone(const const_node_ptr & source_header, 
                     const node_ptr & target_header, Cloner cloner, 
                     Disposer disposer);

        Requires: "cloner" must be a function object taking a node_ptr and returning a new cloned node of it. "disposer" must take a node_ptr and shouldn't throw.

        @@ -322,7 +322,7 @@ 
      21. template<typename Disposer> 
-  static void clear_and_dispose(const node_ptr & header, Disposer disposer);
        + static void clear_and_dispose(const node_ptr & header, Disposer disposer);

        Requires: "disposer" must be an object function taking a node_ptr parameter and shouldn't throw.

        Effects: Empties the target tree calling void disposer::operator()(const node_ptr &) for every node of the tree except the header.

        Complexity: Linear to the number of element of the source tree plus the. number of elements of tree target tree when calling this function.

        @@ -331,7 +331,7 @@ 
      22. template<typename KeyType, typename KeyNodePtrCompare> 
   static node_ptr 
-  lower_bound(const const_node_ptr & header, const KeyType & key, 
+  lower_bound(const const_node_ptr & header, const KeyType & key, 
               KeyNodePtrCompare comp);

        Requires: "header" must be the header node of a tree. KeyNodePtrCompare is a function object that induces a strict weak ordering compatible with the strict weak ordering used to create the the tree. KeyNodePtrCompare can compare KeyType with tree's node_ptrs.

        Effects: Returns a node_ptr to the first element that is not less than "key" according to "comp" or "header" if that element does not exist.

        @@ -341,7 +341,7 @@ 
      23. template<typename KeyType, typename KeyNodePtrCompare> 
   static node_ptr 
-  upper_bound(const const_node_ptr & header, const KeyType & key, 
+  upper_bound(const const_node_ptr & header, const KeyType & key, 
               KeyNodePtrCompare comp);

        Requires: "header" must be the header node of a tree. KeyNodePtrCompare is a function object that induces a strict weak ordering compatible with the strict weak ordering used to create the the tree. KeyNodePtrCompare can compare KeyType with tree's node_ptrs.

        Effects: Returns a node_ptr to the first element that is greater than "key" according to "comp" or "header" if that element does not exist.

        @@ -351,7 +351,7 @@ 
      24. template<typename KeyType, typename KeyNodePtrCompare> 
   static node_ptr 
-  find(const const_node_ptr & header, const KeyType & key, 
+  find(const const_node_ptr & header, const KeyType & key, 
        KeyNodePtrCompare comp);

        Requires: "header" must be the header node of a tree. KeyNodePtrCompare is a function object that induces a strict weak ordering compatible with the strict weak ordering used to create the the tree. KeyNodePtrCompare can compare KeyType with tree's node_ptrs.

        Effects: Returns a node_ptr to the first element that is equivalent to "key" according to "comp" or "header" if that element does not exist.

        @@ -361,7 +361,7 @@ 
      25. template<typename KeyType, typename KeyNodePtrCompare> 
   static std::pair< node_ptr, node_ptr > 
-  equal_range(const const_node_ptr & header, const KeyType & key, 
+  equal_range(const const_node_ptr & header, const KeyType & key, 
               KeyNodePtrCompare comp);

        Requires: "header" must be the header node of a tree. KeyNodePtrCompare is a function object that induces a strict weak ordering compatible with the strict weak ordering used to create the the tree. KeyNodePtrCompare can compare KeyType with tree's node_ptrs.

        Effects: Returns an a pair of node_ptr delimiting a range containing all elements that are equivalent to "key" according to "comp" or an empty range that indicates the position where those elements would be if there are no equivalent elements.

        @@ -371,7 +371,7 @@ 
      26. template<typename KeyType, typename KeyNodePtrCompare> 
   static std::pair< node_ptr, node_ptr > 
-  bounded_range(const const_node_ptr & header, const KeyType & lower_key, 
+  bounded_range(const const_node_ptr & header, const KeyType & lower_key, 
                 const KeyType & upper_key, KeyNodePtrCompare comp, 
                 bool left_closed, bool right_closed);

        Requires: "header" must be the header node of a tree. KeyNodePtrCompare is a function object that induces a strict weak ordering compatible with the strict weak ordering used to create the the tree. KeyNodePtrCompare can compare KeyType with tree's node_ptrs. 'lower_key' must not be greater than 'upper_key' according to 'comp'. If 'lower_key' == 'upper_key', ('left_closed' || 'right_closed') must be true.

        @@ -386,7 +386,7 @@ 
      27. template<typename KeyType, typename KeyNodePtrCompare> 
   static std::size_t 
-  count(const const_node_ptr & header, const KeyType & key, 
+  count(const const_node_ptr & header, const KeyType & key, 
         KeyNodePtrCompare comp);

        Requires: "header" must be the header node of a tree. KeyNodePtrCompare is a function object that induces a strict weak ordering compatible with the strict weak ordering used to create the the tree. KeyNodePtrCompare can compare KeyType with tree's node_ptrs.

        Effects: Returns the number of elements with a key equivalent to "key" according to "comp".

        @@ -396,7 +396,7 @@ 
      28. template<typename NodePtrCompare> 
   static node_ptr 
-  insert_equal_upper_bound(const node_ptr & h, const node_ptr & new_node, 
+  insert_equal_upper_bound(const node_ptr & h, const node_ptr & new_node, 
                            NodePtrCompare comp);

        Requires: "h" must be the header node of a tree. NodePtrCompare is a function object that induces a strict weak ordering compatible with the strict weak ordering used to create the the tree. NodePtrCompare compares two node_ptrs.

        Effects: Inserts new_node into the tree before the upper bound according to "comp".

        @@ -406,7 +406,7 @@ 
      29. template<typename NodePtrCompare> 
   static node_ptr 
-  insert_equal_lower_bound(const node_ptr & h, const node_ptr & new_node, 
+  insert_equal_lower_bound(const node_ptr & h, const node_ptr & new_node, 
                            NodePtrCompare comp);

        Requires: "h" must be the header node of a tree. NodePtrCompare is a function object that induces a strict weak ordering compatible with the strict weak ordering used to create the the tree. NodePtrCompare compares two node_ptrs.

        Effects: Inserts new_node into the tree before the lower bound according to "comp".

        @@ -416,7 +416,7 @@ 
      30. template<typename NodePtrCompare> 
   static node_ptr 
-  insert_equal(const node_ptr & header, const node_ptr & hint, 
+  insert_equal(const node_ptr & header, const node_ptr & hint, 
                const node_ptr & new_node, NodePtrCompare comp);

        Requires: "header" must be the header node of a tree. NodePtrCompare is a function object that induces a strict weak ordering compatible with the strict weak ordering used to create the the tree. NodePtrCompare compares two node_ptrs. "hint" is node from the "header"'s tree.

        Effects: Inserts new_node into the tree, using "hint" as a hint to where it will be inserted. If "hint" is the upper_bound the insertion takes constant time (two comparisons in the worst case).

        @@ -425,7 +425,7 @@ 
      31. static node_ptr 
-insert_before(const node_ptr & header, const node_ptr & pos, 
+insert_before(const node_ptr & header, const node_ptr & pos, 
               const node_ptr & new_node);

        Requires: "header" must be the header node of a tree. "pos" must be a valid iterator or header (end) node. "pos" must be an iterator pointing to the successor to "new_node" once inserted according to the order of already inserted nodes. This function does not check "pos" and this precondition must be guaranteed by the caller.

        Effects: Inserts new_node into the tree before "pos".

        @@ -434,7 +434,7 @@

        Note: If "pos" is not the successor of the newly inserted "new_node" tree invariants might be broken.

      32. -
        static void push_back(const node_ptr & header, const node_ptr & new_node);
        +
        static void push_back(const node_ptr & header, const node_ptr & new_node);

        Requires: "header" must be the header node of a tree. "new_node" must be, according to the used ordering no less than the greatest inserted key.

        Effects: Inserts new_node into the tree before "pos".

        Complexity: Constant-time.

        @@ -442,7 +442,7 @@

        Note: If "new_node" is less than the greatest inserted key tree invariants are broken. This function is slightly faster than using "insert_before".

      33. -
        static void push_front(const node_ptr & header, const node_ptr & new_node);
        +
        static void push_front(const node_ptr & header, const node_ptr & new_node);

        Requires: "header" must be the header node of a tree. "new_node" must be, according to the used ordering, no greater than the lowest inserted key.

        Effects: Inserts new_node into the tree before "pos".

        Complexity: Constant-time.

        @@ -452,7 +452,7 @@ 
      34. template<typename KeyType, typename KeyNodePtrCompare> 
   static std::pair< node_ptr, bool > 
-  insert_unique_check(const const_node_ptr & header, const KeyType & key, 
+  insert_unique_check(const const_node_ptr & header, const KeyType & key, 
                       KeyNodePtrCompare comp, 
                       insert_commit_data & commit_data);

        Requires: "header" must be the header node of a tree. KeyNodePtrCompare is a function object that induces a strict weak ordering compatible with the strict weak ordering used to create the the tree. NodePtrCompare compares KeyType with a node_ptr.

        @@ -467,7 +467,7 @@ 
      35. template<typename KeyType, typename KeyNodePtrCompare> 
   static std::pair< node_ptr, bool > 
-  insert_unique_check(const const_node_ptr & header, const node_ptr & hint, 
+  insert_unique_check(const const_node_ptr & header, const node_ptr & hint, 
                       const KeyType & key, KeyNodePtrCompare comp, 
                       insert_commit_data & commit_data);

        Requires: "header" must be the header node of a tree. KeyNodePtrCompare is a function object that induces a strict weak ordering compatible with the strict weak ordering used to create the the tree. NodePtrCompare compares KeyType with a node_ptr. "hint" is node from the "header"'s tree.

        @@ -480,7 +480,7 @@

        "commit_data" remains valid for a subsequent "insert_unique_commit" only if no more objects are inserted or erased from the set.

      36. -
        static void insert_unique_commit(const node_ptr & header, 
+
        static void insert_unique_commit(const node_ptr & header, 
                                  const node_ptr & new_value, 
                                  const insert_commit_data & commit_data);
        
 
        Requires: "header" must be the header node of a tree. "commit_data" must have been obtained from a previous call to "insert_unique_check". No objects should have been inserted or erased from the set between the "insert_unique_check" that filled "commit_data" and the call to "insert_commit".
        
@@ -490,7 +490,7 @@
 
        Notes: This function has only sense if a "insert_unique_check" has been previously executed to fill "commit_data". No value should be inserted or erased between the "insert_check" and "insert_commit" calls.
      37. -
        static bool is_header(const const_node_ptr & p);
        +
        static bool is_header(const const_node_ptr & p);

        Requires: p is a node of a tree.

        Effects: Returns true if p is the header of the tree.

        Complexity: Constant.

        diff --git a/doc/html/boost/intrusive/set.html b/doc/html/boost/intrusive/set.html index 460e72f49f..df255a37fc 100644 --- a/doc/html/boost/intrusive/set.html +++ b/doc/html/boost/intrusive/set.html @@ -60,131 +60,131 @@ typedef implementation_defined::node_algorithms node_algorithms; // construct/copy/destruct - set(); - explicit set(const key_compare &, const value_traits & = value_traits()); + set(); + explicit set(const key_compare &, const value_traits & = value_traits()); template<typename Iterator> - set(Iterator, Iterator, const key_compare & = key_compare(), + set(Iterator, Iterator, const key_compare & = key_compare(), const value_traits & = value_traits()); - set(set &&); - set & operator=(set &&); - ~set(); + set(set &&); + set & operator=(set &&); + ~set(); - // public member functions - iterator begin(); - const_iterator begin() const; - const_iterator cbegin() const; - iterator end(); - const_iterator end() const; - const_iterator cend() const; - reverse_iterator rbegin(); - const_reverse_iterator rbegin() const; - const_reverse_iterator crbegin() const; - reverse_iterator rend(); - const_reverse_iterator rend() const; - const_reverse_iterator crend() const; - iterator root(); - const_iterator root() const; - const_iterator croot() const; - key_compare key_comp() const; - value_compare value_comp() const; - bool empty() const; - size_type size() const; - void swap(set &); + // public member functions + iterator begin(); + const_iterator begin() const; + const_iterator cbegin() const; + iterator end(); + const_iterator end() const; + const_iterator cend() const; + reverse_iterator rbegin(); + const_reverse_iterator rbegin() const; + const_reverse_iterator crbegin() const; + reverse_iterator rend(); + const_reverse_iterator rend() const; + const_reverse_iterator crend() const; + iterator root(); + const_iterator root() const; + const_iterator croot() const; + key_compare key_comp() const; + value_compare value_comp() const; + bool empty() const; + size_type size() const; + void swap(set &); template<typename Cloner, typename Disposer> - void clone_from(const set &, Cloner, Disposer); + void clone_from(const set &, Cloner, Disposer); template<typename Cloner, typename Disposer> - void clone_from(set &&, Cloner, Disposer); - std::pair< iterator, bool > insert(reference); - iterator insert(const_iterator, reference); + void clone_from(set &&, Cloner, Disposer); + std::pair< iterator, bool > insert(reference); + iterator insert(const_iterator, reference); std::pair< iterator, bool > - insert_check(const key_type &, insert_commit_data &); + insert_check(const key_type &, insert_commit_data &); std::pair< iterator, bool > - insert_check(const_iterator, const key_type &, insert_commit_data &); + insert_check(const_iterator, const key_type &, insert_commit_data &); template<typename KeyType, typename KeyTypeKeyCompare> std::pair< iterator, bool > - insert_check(const KeyType &, KeyTypeKeyCompare, insert_commit_data &); + insert_check(const KeyType &, KeyTypeKeyCompare, insert_commit_data &); template<typename KeyType, typename KeyTypeKeyCompare> std::pair< iterator, bool > - insert_check(const_iterator, const KeyType &, KeyTypeKeyCompare, + insert_check(const_iterator, const KeyType &, KeyTypeKeyCompare, insert_commit_data &); - template<typename Iterator> void insert(Iterator, Iterator); - iterator insert_commit(reference, const insert_commit_data &); - iterator insert_before(const_iterator, reference); - void push_back(reference); - void push_front(reference); - iterator erase(const_iterator); - iterator erase(const_iterator, const_iterator); - size_type erase(const key_type &); + template<typename Iterator> void insert(Iterator, Iterator); + iterator insert_commit(reference, const insert_commit_data &); + iterator insert_before(const_iterator, reference); + void push_back(reference); + void push_front(reference); + iterator erase(const_iterator); + iterator erase(const_iterator, const_iterator); + size_type erase(const key_type &); template<typename KeyType, typename KeyTypeKeyCompare> - size_type erase(const KeyType &, KeyTypeKeyCompare); + size_type erase(const KeyType &, KeyTypeKeyCompare); template<typename Disposer> - iterator erase_and_dispose(const_iterator, Disposer); + iterator erase_and_dispose(const_iterator, Disposer); template<typename Disposer> - iterator erase_and_dispose(const_iterator, const_iterator, Disposer); + iterator erase_and_dispose(const_iterator, const_iterator, Disposer); template<typename Disposer> - size_type erase_and_dispose(const key_type &, Disposer); + size_type erase_and_dispose(const key_type &, Disposer); template<typename KeyType, typename KeyTypeKeyCompare, typename Disposer> - size_type erase_and_dispose(const KeyType &, KeyTypeKeyCompare, Disposer); - void clear(); - template<typename Disposer> void clear_and_dispose(Disposer); - size_type count(const key_type &) const; + size_type erase_and_dispose(const KeyType &, KeyTypeKeyCompare, Disposer); + void clear(); + template<typename Disposer> void clear_and_dispose(Disposer); + size_type count(const key_type &) const; template<typename KeyType, typename KeyTypeKeyCompare> - size_type count(const KeyType &, KeyTypeKeyCompare) const; - iterator lower_bound(const key_type &); + size_type count(const KeyType &, KeyTypeKeyCompare) const; + iterator lower_bound(const key_type &); template<typename KeyType, typename KeyTypeKeyCompare> - iterator lower_bound(const KeyType &, KeyTypeKeyCompare); - const_iterator lower_bound(const key_type &) const; + iterator lower_bound(const KeyType &, KeyTypeKeyCompare); + const_iterator lower_bound(const key_type &) const; template<typename KeyType, typename KeyTypeKeyCompare> - const_iterator lower_bound(const KeyType &, KeyTypeKeyCompare) const; - iterator upper_bound(const key_type &); + const_iterator lower_bound(const KeyType &, KeyTypeKeyCompare) const; + iterator upper_bound(const key_type &); template<typename KeyType, typename KeyTypeKeyCompare> - iterator upper_bound(const KeyType &, KeyTypeKeyCompare); - const_iterator upper_bound(const key_type &) const; + iterator upper_bound(const KeyType &, KeyTypeKeyCompare); + const_iterator upper_bound(const key_type &) const; template<typename KeyType, typename KeyTypeKeyCompare> - const_iterator upper_bound(const KeyType &, KeyTypeKeyCompare) const; - iterator find(const key_type &); + const_iterator upper_bound(const KeyType &, KeyTypeKeyCompare) const; + iterator find(const key_type &); template<typename KeyType, typename KeyTypeKeyCompare> - iterator find(const KeyType &, KeyTypeKeyCompare); - const_iterator find(const key_type &) const; + iterator find(const KeyType &, KeyTypeKeyCompare); + const_iterator find(const key_type &) const; template<typename KeyType, typename KeyTypeKeyCompare> - const_iterator find(const KeyType &, KeyTypeKeyCompare) const; - std::pair< iterator, iterator > equal_range(const key_type &); + const_iterator find(const KeyType &, KeyTypeKeyCompare) const; + std::pair< iterator, iterator > equal_range(const key_type &); template<typename KeyType, typename KeyTypeKeyCompare> std::pair< iterator, iterator > - equal_range(const KeyType &, KeyTypeKeyCompare); + equal_range(const KeyType &, KeyTypeKeyCompare); std::pair< const_iterator, const_iterator > - equal_range(const key_type &) const; + equal_range(const key_type &) const; template<typename KeyType, typename KeyTypeKeyCompare> std::pair< const_iterator, const_iterator > - equal_range(const KeyType &, KeyTypeKeyCompare) const; + equal_range(const KeyType &, KeyTypeKeyCompare) const; std::pair< iterator, iterator > - bounded_range(const key_type &, const key_type &, bool, bool); + bounded_range(const key_type &, const key_type &, bool, bool); template<typename KeyType, typename KeyTypeKeyCompare> std::pair< iterator, iterator > - bounded_range(const KeyType &, const KeyType &, KeyTypeKeyCompare, bool, + bounded_range(const KeyType &, const KeyType &, KeyTypeKeyCompare, bool, bool); std::pair< const_iterator, const_iterator > - bounded_range(const key_type &, const key_type &, bool, bool) const; + bounded_range(const key_type &, const key_type &, bool, bool) const; template<typename KeyType, typename KeyTypeKeyCompare> std::pair< const_iterator, const_iterator > - bounded_range(const KeyType &, const KeyType &, KeyTypeKeyCompare, bool, + bounded_range(const KeyType &, const KeyType &, KeyTypeKeyCompare, bool, bool) const; - iterator iterator_to(reference); - const_iterator iterator_to(const_reference) const; - pointer unlink_leftmost_without_rebalance(); - void replace_node(iterator, reference); - void remove_node(reference); - template<class... Options2> void merge(set< T, Options2...> &); - template<class... Options2> void merge(multiset< T, Options2...> &); + iterator iterator_to(reference); + const_iterator iterator_to(const_reference) const; + pointer unlink_leftmost_without_rebalance(); + void replace_node(iterator, reference); + void remove_node(reference); + template<class... Options2> void merge(set< T, Options2...> &); + template<class... Options2> void merge(multiset< T, Options2...> &); - // public static functions - static set & container_from_end_iterator(iterator); - static const set & container_from_end_iterator(const_iterator); - static set & container_from_iterator(iterator); - static const set & container_from_iterator(const_iterator); - static iterator s_iterator_to(reference); - static const_iterator s_iterator_to(const_reference); - static void init_node(reference); + // public static functions + static set & container_from_end_iterator(iterator); + static const set & container_from_end_iterator(const_iterator); + static set & container_from_iterator(iterator); + static const set & container_from_iterator(const_iterator); + static iterator s_iterator_to(reference); + static const_iterator s_iterator_to(const_reference); + static void init_node(reference); // public data members static const bool constant_time_size; @@ -201,13 +201,13 @@ construct/copy/destruct
        1. -
          set();
          +
          set();

          Effects: Constructs an empty container.

          Complexity: Constant.

          Throws: If value_traits::node_traits::node constructor throws (this does not happen with predefined Boost.Intrusive hooks) or the copy constructor of the key_compare object throws. Basic guarantee.

        2. -
          explicit set(const key_compare & cmp, 
+
          explicit set(const key_compare & cmp, 
              const value_traits & v_traits = value_traits());
          
 
          Effects: Constructs an empty container with given comparison and traits.
          
 
          Complexity: Constant.
          
@@ -215,7 +215,7 @@
 
        3. template<typename Iterator> 
-  set(Iterator b, Iterator e, const key_compare & cmp = key_compare(), 
+  set(Iterator b, Iterator e, const key_compare & cmp = key_compare(), 
       const value_traits & v_traits = value_traits());

          Requires: Dereferencing iterator must yield an lvalue of type value_type. cmp must be a comparison function that induces a strict weak ordering.

          Effects: Constructs an empty container and inserts elements from [b, e).

          @@ -223,17 +223,17 @@

          Throws: If value_traits::node_traits::node constructor throws (this does not happen with predefined Boost.Intrusive hooks) or the copy constructor/operator() of the key_compare object throws. Basic guarantee.

        4. -
          set(set && x);
          +
          set(set && x);

          Effects: Constructs a container moving resources from another container. Internal comparison object and value traits are move constructed and nodes belonging to x (except the node representing the "end") are linked to *this.

          Complexity: Constant.

          Throws: If value_traits::node_traits::node's move constructor throws (this does not happen with predefined Boost.Intrusive hooks) or the move constructor of the comparison objet throws.

        5. -
          set & operator=(set && x);
          +
          set & operator=(set && x);

          Effects: Equivalent to swap

        6. -
          ~set();
          +
          ~set();

          Effects: Detaches all elements from this. The objects in the set are not deleted (i.e. no destructors are called), but the nodes according to the value_traits template parameter are reinitialized and thus can be reused.

          Complexity: Linear to elements contained in *this.

          Throws: Nothing.

          @@ -242,131 +242,131 @@

        -set public member functions

        +set public member functions
        1. -
          iterator begin();
          +
          iterator begin();

          Effects: Returns an iterator pointing to the beginning of the container.

          Complexity: Constant.

          Throws: Nothing.

        2. -
          const_iterator begin() const;
          +
          const_iterator begin() const;

          Effects: Returns a const_iterator pointing to the beginning of the container.

          Complexity: Constant.

          Throws: Nothing.

        3. -
          const_iterator cbegin() const;
          +
          const_iterator cbegin() const;

          Effects: Returns a const_iterator pointing to the beginning of the container.

          Complexity: Constant.

          Throws: Nothing.

        4. -
          iterator end();
          +
          iterator end();

          Effects: Returns an iterator pointing to the end of the container.

          Complexity: Constant.

          Throws: Nothing.

        5. -
          const_iterator end() const;
          +
          const_iterator end() const;

          Effects: Returns a const_iterator pointing to the end of the container.

          Complexity: Constant.

          Throws: Nothing.

        6. -
          const_iterator cend() const;
          +
          const_iterator cend() const;

          Effects: Returns a const_iterator pointing to the end of the container.

          Complexity: Constant.

          Throws: Nothing.

        7. -
          reverse_iterator rbegin();
          +
          reverse_iterator rbegin();

          Effects: Returns a reverse_iterator pointing to the beginning of the reversed container.

          Complexity: Constant.

          Throws: Nothing.

        8. -
          const_reverse_iterator rbegin() const;
          +
          const_reverse_iterator rbegin() const;

          Effects: Returns a const_reverse_iterator pointing to the beginning of the reversed container.

          Complexity: Constant.

          Throws: Nothing.

        9. -
          const_reverse_iterator crbegin() const;
          +
          const_reverse_iterator crbegin() const;

          Effects: Returns a const_reverse_iterator pointing to the beginning of the reversed container.

          Complexity: Constant.

          Throws: Nothing.

        10. -
          reverse_iterator rend();
          +
          reverse_iterator rend();

          Effects: Returns a reverse_iterator pointing to the end of the reversed container.

          Complexity: Constant.

          Throws: Nothing.

        11. -
          const_reverse_iterator rend() const;
          +
          const_reverse_iterator rend() const;

          Effects: Returns a const_reverse_iterator pointing to the end of the reversed container.

          Complexity: Constant.

          Throws: Nothing.

        12. -
          const_reverse_iterator crend() const;
          +
          const_reverse_iterator crend() const;

          Effects: Returns a const_reverse_iterator pointing to the end of the reversed container.

          Complexity: Constant.

          Throws: Nothing.

        13. -
          iterator root();
          +
          iterator root();

          Effects: Returns a iterator pointing to the root node of the container or end() if not present.

          Complexity: Constant.

          Throws: Nothing.

        14. -
          const_iterator root() const;
          +
          const_iterator root() const;

          Effects: Returns a const_iterator pointing to the root node of the container or cend() if not present.

          Complexity: Constant.

          Throws: Nothing.

        15. -
          const_iterator croot() const;
          +
          const_iterator croot() const;

          Effects: Returns a const_iterator pointing to the root node of the container or cend() if not present.

          Complexity: Constant.

          Throws: Nothing.

        16. -
          key_compare key_comp() const;
          +
          key_compare key_comp() const;

          Effects: Returns the key_compare object used by the container.

          Complexity: Constant.

          Throws: If key_compare copy-constructor throws.

        17. -
          value_compare value_comp() const;
          +
          value_compare value_comp() const;

          Effects: Returns the value_compare object used by the container.

          Complexity: Constant.

          Throws: If value_compare copy-constructor throws.

        18. -
          bool empty() const;
          +
          bool empty() const;

          Effects: Returns true if the container is empty.

          Complexity: Constant.

          Throws: Nothing.

        19. -
          size_type size() const;
          +
          size_type size() const;

          Effects: Returns the number of elements stored in the container.

          Complexity: Linear to elements contained in *this if constant-time size option is disabled. Constant time otherwise.

          Throws: Nothing.

        20. -
          void swap(set & other);
          +
          void swap(set & other);

          Effects: Swaps the contents of two containers.

          Complexity: Constant.

          Throws: If the comparison functor's swap call throws. 

        21. template<typename Cloner, typename Disposer> 
-  void clone_from(const set & src, Cloner cloner, Disposer disposer);
          + void clone_from(const set & src, Cloner cloner, Disposer disposer);

          Requires: Disposer::operator()(pointer) shouldn't throw. Cloner should yield to nodes equivalent to the original nodes.

          Effects: Erases all the elements from *this calling Disposer::operator()(pointer), clones all the elements from src calling Cloner::operator()(const_reference ) and inserts them on *this. Copies the predicate from the source container.

          If cloner throws, all cloned elements are unlinked and disposed calling Disposer::operator()(pointer).

          @@ -375,7 +375,7 @@ 
        22. template<typename Cloner, typename Disposer> 
-  void clone_from(set && src, Cloner cloner, Disposer disposer);
          + void clone_from(set && src, Cloner cloner, Disposer disposer);

          Requires: Disposer::operator()(pointer) shouldn't throw. Cloner should yield to nodes equivalent to the original nodes.

          Effects: Erases all the elements from *this calling Disposer::operator()(pointer), clones all the elements from src calling Cloner::operator()(reference) and inserts them on *this. Copies the predicate from the source container.

          If cloner throws, all cloned elements are unlinked and disposed calling Disposer::operator()(pointer).

          @@ -384,7 +384,7 @@

          Note: This version can modify the source container, useful to implement move semantics.

        23. -
          std::pair< iterator, bool > insert(reference value);
          +
          std::pair< iterator, bool > insert(reference value);

          Requires: value must be an lvalue

          Effects: Inserts value into the container if the value is not already present.

          Complexity: Average complexity for insert element is at most logarithmic.

          @@ -392,7 +392,7 @@

          Note: Does not affect the validity of iterators and references. No copy-constructors are called.

        24. -
          iterator insert(const_iterator hint, reference value);
          +
          iterator insert(const_iterator hint, reference value);

          Requires: value must be an lvalue, and "hint" must be a valid iterator

          Effects: Tries to insert x into the container, using "hint" as a hint to where it will be inserted.

          Complexity: Logarithmic in general, but it is amortized constant time (two comparisons in the worst case) if t is inserted immediately before hint.

          @@ -401,7 +401,7 @@ 
        25. std::pair< iterator, bool > 
-insert_check(const key_type & key, insert_commit_data & commit_data);
          +insert_check(const key_type & key, insert_commit_data & commit_data);

          Effects: Checks if a value can be inserted in the container, using a user provided key instead of the value itself.

          Returns: If there is an equivalent value returns a pair containing an iterator to the already present value and false. If the value can be inserted returns true in the returned pair boolean and fills "commit_data" that is meant to be used with the "insert_commit" function.

          Complexity: Average complexity is at most logarithmic.

          @@ -409,7 +409,7 @@ 
        26. std::pair< iterator, bool > 
-insert_check(const_iterator hint, const key_type & key, 
+insert_check(const_iterator hint, const key_type & key, 
              insert_commit_data & commit_data);

          Effects: Checks if a value can be inserted in the container, using a user provided key instead of the value itself, using "hint" as a hint to where it will be inserted.

          Returns: If there is an equivalent value returns a pair containing an iterator to the already present value and false. If the value can be inserted returns true in the returned pair boolean and fills "commit_data" that is meant to be used with the "insert_commit" function.

          @@ -419,7 +419,7 @@ 
        27. template<typename KeyType, typename KeyTypeKeyCompare> 
   std::pair< iterator, bool > 
-  insert_check(const KeyType & key, KeyTypeKeyCompare comp, 
+  insert_check(const KeyType & key, KeyTypeKeyCompare comp, 
                insert_commit_data & commit_data);

          Requires: comp must be a comparison function that induces the same strict weak ordering as key_compare. The difference is that comp compares an arbitrary key with the contained values.

          Effects: Checks if a value can be inserted in the container, using a user provided key instead of the value itself.

          @@ -433,7 +433,7 @@ 
        28. template<typename KeyType, typename KeyTypeKeyCompare> 
   std::pair< iterator, bool > 
-  insert_check(const_iterator hint, const KeyType & key, 
+  insert_check(const_iterator hint, const KeyType & key, 
                KeyTypeKeyCompare comp, insert_commit_data & commit_data);

          Requires: comp must be a comparison function that induces the same strict weak ordering as key_compare. The difference is that comp compares an arbitrary key with the contained values.

          Effects: Checks if a value can be inserted in the container, using a user provided key instead of the value itself, using "hint" as a hint to where it will be inserted.

          @@ -445,7 +445,7 @@

          "commit_data" remains valid for a subsequent "insert_commit" only if no more objects are inserted or erased from the container.

        29. -
          template<typename Iterator> void insert(Iterator b, Iterator e);
          +
          template<typename Iterator> void insert(Iterator b, Iterator e);

          Requires: Dereferencing iterator must yield an lvalue of type value_type.

          Effects: Tries to insert each element of a range into the container.

          Complexity: Insert range is in general O(N * log(N)), where N is the size of the range. However, it is linear in N if the range is already sorted by value_comp().

          @@ -453,7 +453,7 @@

          Note: Does not affect the validity of iterators and references. No copy-constructors are called.

        30. -
          iterator insert_commit(reference value, 
+
          iterator insert_commit(reference value, 
                        const insert_commit_data & commit_data);
          
 
          Requires: value must be an lvalue of type value_type. commit_data must have been obtained from a previous call to "insert_check". No objects should have been inserted or erased from the container between the "insert_check" that filled "commit_data" and the call to "insert_commit".
          
 
          Effects: Inserts the value in the container using the information obtained from the "commit_data" that a previous "insert_check" filled.
          
@@ -463,7 +463,7 @@
 
          Notes: This function has only sense if a "insert_check" has been previously executed to fill "commit_data". No value should be inserted or erased between the "insert_check" and "insert_commit" calls.
        31. -
          iterator insert_before(const_iterator pos, reference value);
          +
          iterator insert_before(const_iterator pos, reference value);

          Requires: value must be an lvalue, "pos" must be a valid iterator (or end) and must be the succesor of value once inserted according to the predicate

          Effects: Inserts x into the container before "pos".

          Complexity: Constant time.

          @@ -471,7 +471,7 @@

          Note: This function does not check preconditions so if "pos" is not the successor of "value" container ordering invariant will be broken. This is a low-level function to be used only for performance reasons by advanced users.

        32. -
          void push_back(reference value);
          +
          void push_back(reference value);

          Requires: value must be an lvalue, and it must be no less than the greatest inserted key

          Effects: Inserts x into the container in the last position.

          Complexity: Constant time.

          @@ -479,7 +479,7 @@

          Note: This function does not check preconditions so if value is less than the greatest inserted key container ordering invariant will be broken. This function is slightly more efficient than using "insert_before". This is a low-level function to be used only for performance reasons by advanced users.

        33. -
          void push_front(reference value);
          +
          void push_front(reference value);

          Requires: value must be an lvalue, and it must be no greater than the minimum inserted key

          Effects: Inserts x into the container in the first position.

          Complexity: Constant time.

          @@ -487,21 +487,21 @@

          Note: This function does not check preconditions so if value is greater than the minimum inserted key container ordering invariant will be broken. This function is slightly more efficient than using "insert_before". This is a low-level function to be used only for performance reasons by advanced users.

        34. -
          iterator erase(const_iterator i);
          +
          iterator erase(const_iterator i);

          Effects: Erases the element pointed to by i.

          Complexity: Average complexity for erase element is constant time.

          Throws: Nothing.

          Note: Invalidates the iterators (but not the references) to the erased elements. No destructors are called.

        35. -
          iterator erase(const_iterator b, const_iterator e);
          +
          iterator erase(const_iterator b, const_iterator e);

          Effects: Erases the range pointed to by b end e.

          Complexity: Average complexity for erase range is at most O(log(size() + N)), where N is the number of elements in the range.

          Throws: Nothing.

          Note: Invalidates the iterators (but not the references) to the erased elements. No destructors are called.

        36. -
          size_type erase(const key_type & key);
          +
          size_type erase(const key_type & key);

          Effects: Erases all the elements with the given value.

          Returns: The number of erased elements.

          Complexity: O(log(size() + N).

          @@ -510,7 +510,7 @@ 
        37. template<typename KeyType, typename KeyTypeKeyCompare> 
-  size_type erase(const KeyType & key, KeyTypeKeyCompare comp);
          + size_type erase(const KeyType & key, KeyTypeKeyCompare comp);

          Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk), with nk the key_type of a value_type inserted into *this.

          Effects: Erases all the elements with the given key. according to the comparison functor "comp".

          Returns: The number of erased elements.

          @@ -520,7 +520,7 @@ 
        38. template<typename Disposer> 
-  iterator erase_and_dispose(const_iterator i, Disposer disposer);
          + iterator erase_and_dispose(const_iterator i, Disposer disposer);

          Requires: Disposer::operator()(pointer) shouldn't throw.

          Effects: Erases the element pointed to by i. Disposer::operator()(pointer) is called for the removed element.

          Complexity: Average complexity for erase element is constant time.

          @@ -529,7 +529,7 @@ 
        39. template<typename Disposer> 
-  iterator erase_and_dispose(const_iterator b, const_iterator e, 
+  iterator erase_and_dispose(const_iterator b, const_iterator e, 
                              Disposer disposer);

          Requires: Disposer::operator()(pointer) shouldn't throw.

          Effects: Erases the range pointed to by b end e. Disposer::operator()(pointer) is called for the removed elements.

          @@ -539,7 +539,7 @@ 
        40. template<typename Disposer> 
-  size_type erase_and_dispose(const key_type & key, Disposer disposer);
          + size_type erase_and_dispose(const key_type & key, Disposer disposer);

          Requires: Disposer::operator()(pointer) shouldn't throw.

          Effects: Erases all the elements with the given value. Disposer::operator()(pointer) is called for the removed elements.

          Returns: The number of erased elements.

          @@ -549,7 +549,7 @@ 
        41. template<typename KeyType, typename KeyTypeKeyCompare, typename Disposer> 
-  size_type erase_and_dispose(const KeyType & key, KeyTypeKeyCompare comp, 
+  size_type erase_and_dispose(const KeyType & key, KeyTypeKeyCompare comp, 
                               Disposer disposer);

          Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk) and nk the key_type of a value_type inserted into *this.

          Requires: Disposer::operator()(pointer) shouldn't throw.

          @@ -560,47 +560,47 @@

          Note: Invalidates the iterators to the erased elements.

        42. -
          void clear();
          +
          void clear();

          Effects: Erases all of the elements.

          Complexity: Linear to the number of elements on the container. if it's a safe-mode or auto-unlink value_type. Constant time otherwise.

          Throws: Nothing.

          Note: Invalidates the iterators (but not the references) to the erased elements. No destructors are called.

        43. -
          template<typename Disposer> void clear_and_dispose(Disposer disposer);
          +
          template<typename Disposer> void clear_and_dispose(Disposer disposer);

          Effects: Erases all of the elements calling disposer(p) for each node to be erased. Complexity: Average complexity for is at most O(log(size() + N)), where N is the number of elements in the container.

          Throws: Nothing.

          Note: Invalidates the iterators (but not the references) to the erased elements. Calls N times to disposer functor.

        44. -
          size_type count(const key_type & key) const;
          +
          size_type count(const key_type & key) const;

          Effects: Returns the number of contained elements with the given value

          Complexity: Logarithmic to the number of elements contained plus lineal to number of objects with the given value.

          Throws: If key_compare throws. 

        45. template<typename KeyType, typename KeyTypeKeyCompare> 
-  size_type count(const KeyType & key, KeyTypeKeyCompare comp) const;
          + size_type count(const KeyType & key, KeyTypeKeyCompare comp) const;

          Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk), and nk the key_type of a value_type inserted into *this.

          Effects: Returns the number of contained elements with the given key

          Complexity: Logarithmic to the number of elements contained plus lineal to number of objects with the given key.

          Throws: If comp throws.

        46. -
          iterator lower_bound(const key_type & key);
          +
          iterator lower_bound(const key_type & key);

          Effects: Returns an iterator to the first element whose key is not less than k or end() if that element does not exist.

          Complexity: Logarithmic.

          Throws: If key_compare throws. 

        47. template<typename KeyType, typename KeyTypeKeyCompare> 
-  iterator lower_bound(const KeyType & key, KeyTypeKeyCompare comp);
          + iterator lower_bound(const KeyType & key, KeyTypeKeyCompare comp);

          Effects: Returns an iterator to the first element whose key is not less than k or end() if that element does not exist.

          Complexity: Logarithmic.

          Throws: If key_compare throws.

        48. -
          const_iterator lower_bound(const key_type & key) const;
          +
          const_iterator lower_bound(const key_type & key) const;

          Effects: Returns an iterator to the first element whose key is not less than k or end() if that element does not exist.

          Complexity: Logarithmic.

          Throws: If key_compare throws.

          @@ -608,27 +608,27 @@ 
        49. template<typename KeyType, typename KeyTypeKeyCompare> 
   const_iterator 
-  lower_bound(const KeyType & key, KeyTypeKeyCompare comp) const;
          + lower_bound(const KeyType & key, KeyTypeKeyCompare comp) const;

          Effects: Returns an iterator to the first element whose key is not less than k or end() if that element does not exist.

          Complexity: Logarithmic.

          Throws: If key_compare throws.

        50. -
          iterator upper_bound(const key_type & key);
          +
          iterator upper_bound(const key_type & key);

          Effects: Returns an iterator to the first element whose key is greater than k or end() if that element does not exist.

          Complexity: Logarithmic.

          Throws: If key_compare throws. 

        51. template<typename KeyType, typename KeyTypeKeyCompare> 
-  iterator upper_bound(const KeyType & key, KeyTypeKeyCompare comp);
          + iterator upper_bound(const KeyType & key, KeyTypeKeyCompare comp);

          Requires: key is a value such that *this is partitioned with respect to !comp(key, nk), with nk the key_type of a value_type inserted into *this.

          Effects: Returns an iterator to the first element whose key is greater than k according to comp or end() if that element does not exist.

          Complexity: Logarithmic.

          Throws: If comp throws.

        52. -
          const_iterator upper_bound(const key_type & key) const;
          +
          const_iterator upper_bound(const key_type & key) const;

          Effects: Returns an iterator to the first element whose key is greater than k or end() if that element does not exist.

          Complexity: Logarithmic.

          Throws: If key_compare throws.

          @@ -636,42 +636,42 @@ 
        53. template<typename KeyType, typename KeyTypeKeyCompare> 
   const_iterator 
-  upper_bound(const KeyType & key, KeyTypeKeyCompare comp) const;
          + upper_bound(const KeyType & key, KeyTypeKeyCompare comp) const;

          Requires: key is a value such that *this is partitioned with respect to !comp(key, nk), with nk the key_type of a value_type inserted into *this.

          Effects: Returns an iterator to the first element whose key is greater than k according to comp or end() if that element does not exist.

          Complexity: Logarithmic.

          Throws: If comp throws.

        54. -
          iterator find(const key_type & key);
          +
          iterator find(const key_type & key);

          Effects: Finds an iterator to the first element whose key is k or end() if that element does not exist.

          Complexity: Logarithmic.

          Throws: If key_compare throws. 

        55. template<typename KeyType, typename KeyTypeKeyCompare> 
-  iterator find(const KeyType & key, KeyTypeKeyCompare comp);
          + iterator find(const KeyType & key, KeyTypeKeyCompare comp);

          Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk), and nk the key_type of a value_type inserted into *this.

          Effects: Finds an iterator to the first element whose key is k or end() if that element does not exist.

          Complexity: Logarithmic.

          Throws: If comp throws.

        56. -
          const_iterator find(const key_type & key) const;
          +
          const_iterator find(const key_type & key) const;

          Effects: Finds an iterator to the first element whose key is k or end() if that element does not exist.

          Complexity: Logarithmic.

          Throws: If key_compare throws. 

        57. template<typename KeyType, typename KeyTypeKeyCompare> 
-  const_iterator find(const KeyType & key, KeyTypeKeyCompare comp) const;
          + const_iterator find(const KeyType & key, KeyTypeKeyCompare comp) const;

          Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk), and nk the key_type of a value_type inserted into *this.

          Effects: Finds an iterator to the first element whose key is k or end() if that element does not exist.

          Complexity: Logarithmic.

          Throws: If comp throws.

        58. -
          std::pair< iterator, iterator > equal_range(const key_type & key);
          +
          std::pair< iterator, iterator > equal_range(const key_type & key);

          Effects: Finds a range containing all elements whose key is k or an empty range that indicates the position where those elements would be if they there is no elements with key k.

          Complexity: Logarithmic.

          Throws: If key_compare throws.

          @@ -679,7 +679,7 @@ 
        59. template<typename KeyType, typename KeyTypeKeyCompare> 
   std::pair< iterator, iterator > 
-  equal_range(const KeyType & key, KeyTypeKeyCompare comp);
          + equal_range(const KeyType & key, KeyTypeKeyCompare comp);

          Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk), with nk the key_type of a value_type inserted into *this.

          Effects: Finds a range containing all elements whose key is k or an empty range that indicates the position where those elements would be if they there is no elements with key k.

          Complexity: Logarithmic.

          @@ -687,7 +687,7 @@ 
        60. std::pair< const_iterator, const_iterator > 
-equal_range(const key_type & key) const;
          +equal_range(const key_type & key) const;

          Effects: Finds a range containing all elements whose key is k or an empty range that indicates the position where those elements would be if they there is no elements with key k.

          Complexity: Logarithmic.

          Throws: If key_compare throws.

          @@ -695,7 +695,7 @@ 
        61. template<typename KeyType, typename KeyTypeKeyCompare> 
   std::pair< const_iterator, const_iterator > 
-  equal_range(const KeyType & key, KeyTypeKeyCompare comp) const;
          + equal_range(const KeyType & key, KeyTypeKeyCompare comp) const;

          Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk), with nk the key_type of a value_type inserted into *this.

          Effects: Finds a range containing all elements whose key is k or an empty range that indicates the position where those elements would be if they there is no elements with key k.

          Complexity: Logarithmic.

          @@ -703,7 +703,7 @@ 
        62. std::pair< iterator, iterator > 
-bounded_range(const key_type & lower_key, const key_type & upper_key, 
+bounded_range(const key_type & lower_key, const key_type & upper_key, 
               bool left_closed, bool right_closed);

          Requires: upper_key shall not precede lower_key according to key_compare. [key_comp()(upper_key, lower_key) shall be false]

          If lower_key is equivalent to upper_key [!key_comp()(upper_key, lower_key) && !key_comp()(lower_key, upper_key)] then ('left_closed' || 'right_closed') must be false.

          @@ -718,7 +718,7 @@ 
        63. template<typename KeyType, typename KeyTypeKeyCompare> 
   std::pair< iterator, iterator > 
-  bounded_range(const KeyType & lower_key, const KeyType & upper_key, 
+  bounded_range(const KeyType & lower_key, const KeyType & upper_key, 
                 KeyTypeKeyCompare comp, bool left_closed, bool right_closed);

          Requires: lower_key is a value such that *this is partitioned with respect to comp(nk, lower_key) if left_closed is true, with respect to !comp(lower_key, nk) otherwise.

          upper_key is a value such that *this is partitioned with respect to !comp(upper_key, nk) if right_closed is true, with respect to comp(nk, upper_key) otherwise.

          @@ -734,7 +734,7 @@ 
        64. std::pair< const_iterator, const_iterator > 
-bounded_range(const key_type & lower_key, const key_type & upper_key, 
+bounded_range(const key_type & lower_key, const key_type & upper_key, 
               bool left_closed, bool right_closed) const;

          Requires: upper_key shall not precede lower_key according to key_compare. [key_comp()(upper_key, lower_key) shall be false]

          If lower_key is equivalent to upper_key [!key_comp()(upper_key, lower_key) && !key_comp()(lower_key, upper_key)] then ('left_closed' || 'right_closed') must be false.

          @@ -749,7 +749,7 @@ 
        65. template<typename KeyType, typename KeyTypeKeyCompare> 
   std::pair< const_iterator, const_iterator > 
-  bounded_range(const KeyType & lower_key, const KeyType & upper_key, 
+  bounded_range(const KeyType & lower_key, const KeyType & upper_key, 
                 KeyTypeKeyCompare comp, bool left_closed, bool right_closed) const;

          Requires: lower_key is a value such that *this is partitioned with respect to comp(nk, lower_key) if left_closed is true, with respect to !comp(lower_key, nk) otherwise.

          upper_key is a value such that *this is partitioned with respect to !comp(upper_key, nk) if right_closed is true, with respect to comp(nk, upper_key) otherwise.

          @@ -764,28 +764,28 @@

          Note: Experimental function, the interface might change in future releases.

        66. -
          iterator iterator_to(reference value);
          +
          iterator iterator_to(reference value);

          Requires: value must be an lvalue and shall be in a set of appropriate type. Otherwise the behavior is undefined.

          Effects: Returns: a valid iterator i belonging to the set that points to the value

          Complexity: Constant.

          Throws: Nothing.

        67. -
          const_iterator iterator_to(const_reference value) const;
          +
          const_iterator iterator_to(const_reference value) const;

          Requires: value must be an lvalue and shall be in a set of appropriate type. Otherwise the behavior is undefined.

          Effects: Returns: a valid const_iterator i belonging to the set that points to the value

          Complexity: Constant.

          Throws: Nothing.

        68. -
          pointer unlink_leftmost_without_rebalance();
          +
          pointer unlink_leftmost_without_rebalance();

          Effects: Unlinks the leftmost node from the container.

          Complexity: Average complexity is constant time.

          Throws: Nothing.

          Notes: This function breaks the container and the container can only be used for more unlink_leftmost_without_rebalance calls. This function is normally used to achieve a step by step controlled destruction of the container.

        69. -
          void replace_node(iterator replace_this, reference with_this);
          +
          void replace_node(iterator replace_this, reference with_this);

          Requires: replace_this must be a valid iterator of *this and with_this must not be inserted in any container.

          Effects: Replaces replace_this in its position in the container with with_this. The container does not need to be rebalanced.

          Complexity: Constant.

          @@ -793,7 +793,7 @@

          Note: This function will break container ordering invariants if with_this is not equivalent to *replace_this according to the ordering rules. This function is faster than erasing and inserting the node, since no rebalancing or comparison is needed.

        70. -
          void remove_node(reference value);
          +
          void remove_node(reference value);

          Effects: removes "value" from the container.

          Throws: Nothing.

          Complexity: Logarithmic time.

          @@ -801,7 +801,7 @@

          If the user calls this function with a constant time size container or stateful comparison functor a compilation error will be issued.

        71. -
          template<class... Options2> void merge(set< T, Options2...> & source);
          +
          template<class... Options2> void merge(set< T, Options2...> & source);

          Requires: "source" container's Options can only can differ in the comparison function from *this.

          Effects: Attempts to extract each element in source and insert it into a using the comparison object of *this. If there is an element in a with key equivalent to the key of an element from source, then that element is not extracted from source.

          Postcondition: Pointers and references to the transferred elements of source refer to those same elements but as members of *this. Iterators referring to the transferred elements will continue to refer to their elements, but they now behave as iterators into *this, not into source.

          @@ -809,7 +809,7 @@

          Complexity: N log(a.size() + N) (N has the value source.size())

        72. -
          template<class... Options2> void merge(multiset< T, Options2...> & source);
          +
          template<class... Options2> void merge(multiset< T, Options2...> & source);

          Requires: "source" container's Options can only can differ in the comparison function from *this.

          Effects: Attempts to extract each element in source and insert it into a using the comparison object of *this. If there is an element in a with key equivalent to the key of an element from source, then that element is not extracted from source.

          Postcondition: Pointers and references to the transferred elements of source refer to those same elements but as members of *this. Iterators referring to the transferred elements will continue to refer to their elements, but they now behave as iterators into *this, not into source.

          @@ -820,38 +820,38 @@

        -set public static functions

        +set public static functions
        1. -
          static set & container_from_end_iterator(iterator end_iterator);
          +
          static set & container_from_end_iterator(iterator end_iterator);

          Precondition: end_iterator must be a valid end iterator of the container.

          Effects: Returns a const reference to the container associated to the end iterator

          Throws: Nothing.

          Complexity: Constant.

        2. -
          static const set & container_from_end_iterator(const_iterator end_iterator);
          +
          static const set & container_from_end_iterator(const_iterator end_iterator);

          Precondition: end_iterator must be a valid end iterator of the container.

          Effects: Returns a const reference to the container associated to the end iterator

          Throws: Nothing.

          Complexity: Constant.

        3. -
          static set & container_from_iterator(iterator it);
          +
          static set & container_from_iterator(iterator it);

          Precondition: it must be a valid iterator of the container.

          Effects: Returns a const reference to the container associated to the iterator

          Throws: Nothing.

          Complexity: Logarithmic.

        4. -
          static const set & container_from_iterator(const_iterator it);
          +
          static const set & container_from_iterator(const_iterator it);

          Precondition: it must be a valid iterator of the container.

          Effects: Returns a const reference to the container associated to the iterator

          Throws: Nothing.

          Complexity: Logarithmic.

        5. -
          static iterator s_iterator_to(reference value);
          +
          static iterator s_iterator_to(reference value);

          Requires: value must be an lvalue and shall be in a set of appropriate type. Otherwise the behavior is undefined.

          Effects: Returns: a valid iterator i belonging to the set that points to the value

          Complexity: Constant.

          @@ -859,7 +859,7 @@

          Note: This static function is available only if the value traits is stateless.

        6. -
          static const_iterator s_iterator_to(const_reference value);
          +
          static const_iterator s_iterator_to(const_reference value);

          Requires: value must be an lvalue and shall be in a set of appropriate type. Otherwise the behavior is undefined.

          Effects: Returns: a valid iterator i belonging to the set that points to the value

          Complexity: Constant.

          @@ -867,7 +867,7 @@

          Note: This static function is available only if the value traits is stateless.

        7. -
          static void init_node(reference value);
          +
          static void init_node(reference value);

          Requires: value shall not be in a container.

          Effects: init_node puts the hook of a value in a well-known default state.

          Throws: Nothing.

          diff --git a/doc/html/boost/intrusive/set_base_hook.html b/doc/html/boost/intrusive/set_base_hook.html index 6e7991e838..d053b72140 100644 --- a/doc/html/boost/intrusive/set_base_hook.html +++ b/doc/html/boost/intrusive/set_base_hook.html @@ -36,15 +36,15 @@ class set_base_hook : public make_set_base_hook::type< O1, O2, O3, O4 > { public: // construct/copy/destruct - set_base_hook(); - set_base_hook(const set_base_hook &); - set_base_hook & operator=(const set_base_hook &); - ~set_base_hook(); + set_base_hook(); + set_base_hook(const set_base_hook &); + set_base_hook & operator=(const set_base_hook &); + ~set_base_hook(); - // public member functions - void swap_nodes(set_base_hook &); - bool is_linked() const; - void unlink(); + // public member functions + void swap_nodes(set_base_hook &); + bool is_linked() const; + void unlink(); };

        Description

        @@ -61,24 +61,24 @@ construct/copy/destruct
        1. -
          set_base_hook();
          +
          set_base_hook();

          Effects: If link_mode is auto_unlink or safe_link initializes the node to an unlinked state.

          Throws: Nothing.

        2. -
          set_base_hook(const set_base_hook &);
          +
          set_base_hook(const set_base_hook &);

          Effects: If link_mode is auto_unlink or safe_link initializes the node to an unlinked state. The argument is ignored.

          Throws: Nothing.

          Rationale: Providing a copy-constructor makes classes using the hook STL-compliant without forcing the user to do some additional work. swap can be used to emulate move-semantics.

        3. -
          set_base_hook & operator=(const set_base_hook &);
          +
          set_base_hook & operator=(const set_base_hook &);

          Effects: Empty function. The argument is ignored.

          Throws: Nothing.

          Rationale: Providing an assignment operator makes classes using the hook STL-compliant without forcing the user to do some additional work. swap can be used to emulate move-semantics.

        4. -
          ~set_base_hook();
          +
          ~set_base_hook();

          Effects: If link_mode is normal_link, the destructor does nothing (ie. no code is generated). If link_mode is safe_link and the object is stored in a set an assertion is raised. If link_mode is auto_unlink and is_linked() is true, the node is unlinked.

          Throws: Nothing.

          5. @@ -86,22 +86,22 @@

        -set_base_hook public member functions

        +set_base_hook public member functions
        1. -
          void swap_nodes(set_base_hook & other);
          +
          void swap_nodes(set_base_hook & other);

          Effects: Swapping two nodes swaps the position of the elements related to those nodes in one or two containers. That is, if the node this is part of the element e1, the node x is part of the element e2 and both elements are included in the containers s1 and s2, then after the swap-operation e1 is in s2 at the position of e2 and e2 is in s1 at the position of e1. If one element is not in a container, then after the swap-operation the other element is not in a container. Iterators to e1 and e2 related to those nodes are invalidated.

          Complexity: Constant

          Throws: Nothing.

        2. -
          bool is_linked() const;
          +
          bool is_linked() const;

          Precondition: link_mode must be safe_link or auto_unlink.

          Returns: true, if the node belongs to a container, false otherwise. This function can be used to test whether set::iterator_to will return a valid iterator.

          Complexity: Constant

        3. -
          void unlink();
          +
          void unlink();

          Effects: Removes the node if it's inserted in a container. This function is only allowed if link_mode is auto_unlink.

          Throws: Nothing.

          4. diff --git a/doc/html/boost/intrusive/set_member_hook.html b/doc/html/boost/intrusive/set_member_hook.html index 82aab17a66..6a31c6907d 100644 --- a/doc/html/boost/intrusive/set_member_hook.html +++ b/doc/html/boost/intrusive/set_member_hook.html @@ -36,15 +36,15 @@ class set_member_hook : public make_set_member_hook::type< O1, O2, O3, O4 > { public: // construct/copy/destruct - set_member_hook(); - set_member_hook(const set_member_hook &); - set_member_hook & operator=(const set_member_hook &); - ~set_member_hook(); + set_member_hook(); + set_member_hook(const set_member_hook &); + set_member_hook & operator=(const set_member_hook &); + ~set_member_hook(); - // public member functions - void swap_nodes(set_member_hook &); - bool is_linked() const; - void unlink(); + // public member functions + void swap_nodes(set_member_hook &); + bool is_linked() const; + void unlink(); };

        Description

        @@ -60,24 +60,24 @@ construct/copy/destruct
        1. -
          set_member_hook();
          +
          set_member_hook();

          Effects: If link_mode is auto_unlink or safe_link initializes the node to an unlinked state.

          Throws: Nothing.

        2. -
          set_member_hook(const set_member_hook &);
          +
          set_member_hook(const set_member_hook &);

          Effects: If link_mode is auto_unlink or safe_link initializes the node to an unlinked state. The argument is ignored.

          Throws: Nothing.

          Rationale: Providing a copy-constructor makes classes using the hook STL-compliant without forcing the user to do some additional work. swap can be used to emulate move-semantics.

        3. -
          set_member_hook & operator=(const set_member_hook &);
          +
          set_member_hook & operator=(const set_member_hook &);

          Effects: Empty function. The argument is ignored.

          Throws: Nothing.

          Rationale: Providing an assignment operator makes classes using the hook STL-compliant without forcing the user to do some additional work. swap can be used to emulate move-semantics.

        4. -
          ~set_member_hook();
          +
          ~set_member_hook();

          Effects: If link_mode is normal_link, the destructor does nothing (ie. no code is generated). If link_mode is safe_link and the object is stored in a set an assertion is raised. If link_mode is auto_unlink and is_linked() is true, the node is unlinked.

          Throws: Nothing.

          5. @@ -85,22 +85,22 @@

        -set_member_hook public member functions

        +set_member_hook public member functions
        1. -
          void swap_nodes(set_member_hook & other);
          +
          void swap_nodes(set_member_hook & other);

          Effects: Swapping two nodes swaps the position of the elements related to those nodes in one or two containers. That is, if the node this is part of the element e1, the node x is part of the element e2 and both elements are included in the containers s1 and s2, then after the swap-operation e1 is in s2 at the position of e2 and e2 is in s1 at the position of e1. If one element is not in a container, then after the swap-operation the other element is not in a container. Iterators to e1 and e2 related to those nodes are invalidated.

          Complexity: Constant

          Throws: Nothing.

        2. -
          bool is_linked() const;
          +
          bool is_linked() const;

          Precondition: link_mode must be safe_link or auto_unlink.

          Returns: true, if the node belongs to a container, false otherwise. This function can be used to test whether set::iterator_to will return a valid iterator.

          Complexity: Constant

        3. -
          void unlink();
          +
          void unlink();

          Effects: Removes the node if it's inserted in a container. This function is only allowed if link_mode is auto_unlink.

          Throws: Nothing.

          4. diff --git a/doc/html/boost/intrusive/sg_multiset.html b/doc/html/boost/intrusive/sg_multiset.html index 7b2f2cff6c..18f8fe070e 100644 --- a/doc/html/boost/intrusive/sg_multiset.html +++ b/doc/html/boost/intrusive/sg_multiset.html @@ -60,124 +60,124 @@ typedef implementation_defined::node_algorithms node_algorithms; // construct/copy/destruct - sg_multiset(); - explicit sg_multiset(const key_compare &, + sg_multiset(); + explicit sg_multiset(const key_compare &, const value_traits & = value_traits()); template<typename Iterator> - sg_multiset(Iterator, Iterator, const key_compare & = key_compare(), + sg_multiset(Iterator, Iterator, const key_compare & = key_compare(), const value_traits & = value_traits()); - sg_multiset(sg_multiset &&); - sg_multiset & operator=(sg_multiset &&); - ~sg_multiset(); + sg_multiset(sg_multiset &&); + sg_multiset & operator=(sg_multiset &&); + ~sg_multiset(); - // public member functions - iterator begin(); - const_iterator begin() const; - const_iterator cbegin() const; - iterator end(); - const_iterator end() const; - const_iterator cend() const; - reverse_iterator rbegin(); - const_reverse_iterator rbegin() const; - const_reverse_iterator crbegin() const; - reverse_iterator rend(); - const_reverse_iterator rend() const; - const_reverse_iterator crend() const; - iterator root(); - const_iterator root() const; - const_iterator croot() const; - key_compare key_comp() const; - value_compare value_comp() const; - bool empty() const; - size_type size() const; - void swap(sg_multiset &); + // public member functions + iterator begin(); + const_iterator begin() const; + const_iterator cbegin() const; + iterator end(); + const_iterator end() const; + const_iterator cend() const; + reverse_iterator rbegin(); + const_reverse_iterator rbegin() const; + const_reverse_iterator crbegin() const; + reverse_iterator rend(); + const_reverse_iterator rend() const; + const_reverse_iterator crend() const; + iterator root(); + const_iterator root() const; + const_iterator croot() const; + key_compare key_comp() const; + value_compare value_comp() const; + bool empty() const; + size_type size() const; + void swap(sg_multiset &); template<typename Cloner, typename Disposer> - void clone_from(const sg_multiset &, Cloner, Disposer); + void clone_from(const sg_multiset &, Cloner, Disposer); template<typename Cloner, typename Disposer> - void clone_from(sg_multiset &&, Cloner, Disposer); - iterator insert(reference); - iterator insert(const_iterator, reference); - template<typename Iterator> void insert(Iterator, Iterator); - iterator insert_before(const_iterator, reference); - void push_back(reference); - void push_front(reference); - iterator erase(const_iterator); - iterator erase(const_iterator, const_iterator); - size_type erase(const key_type &); + void clone_from(sg_multiset &&, Cloner, Disposer); + iterator insert(reference); + iterator insert(const_iterator, reference); + template<typename Iterator> void insert(Iterator, Iterator); + iterator insert_before(const_iterator, reference); + void push_back(reference); + void push_front(reference); + iterator erase(const_iterator); + iterator erase(const_iterator, const_iterator); + size_type erase(const key_type &); template<typename KeyType, typename KeyTypeKeyCompare> - size_type erase(const KeyType &, KeyTypeKeyCompare); + size_type erase(const KeyType &, KeyTypeKeyCompare); template<typename Disposer> - iterator erase_and_dispose(const_iterator, Disposer); + iterator erase_and_dispose(const_iterator, Disposer); template<typename Disposer> - iterator erase_and_dispose(const_iterator, const_iterator, Disposer); + iterator erase_and_dispose(const_iterator, const_iterator, Disposer); template<typename Disposer> - size_type erase_and_dispose(const key_type &, Disposer); + size_type erase_and_dispose(const key_type &, Disposer); template<typename KeyType, typename KeyTypeKeyCompare, typename Disposer> - size_type erase_and_dispose(const KeyType &, KeyTypeKeyCompare, Disposer); - void clear(); - template<typename Disposer> void clear_and_dispose(Disposer); - size_type count(const key_type &) const; + size_type erase_and_dispose(const KeyType &, KeyTypeKeyCompare, Disposer); + void clear(); + template<typename Disposer> void clear_and_dispose(Disposer); + size_type count(const key_type &) const; template<typename KeyType, typename KeyTypeKeyCompare> - size_type count(const KeyType &, KeyTypeKeyCompare) const; - iterator lower_bound(const key_type &); + size_type count(const KeyType &, KeyTypeKeyCompare) const; + iterator lower_bound(const key_type &); template<typename KeyType, typename KeyTypeKeyCompare> - iterator lower_bound(const KeyType &, KeyTypeKeyCompare); - const_iterator lower_bound(const key_type &) const; + iterator lower_bound(const KeyType &, KeyTypeKeyCompare); + const_iterator lower_bound(const key_type &) const; template<typename KeyType, typename KeyTypeKeyCompare> - const_iterator lower_bound(const KeyType &, KeyTypeKeyCompare) const; - iterator upper_bound(const key_type &); + const_iterator lower_bound(const KeyType &, KeyTypeKeyCompare) const; + iterator upper_bound(const key_type &); template<typename KeyType, typename KeyTypeKeyCompare> - iterator upper_bound(const KeyType &, KeyTypeKeyCompare); - const_iterator upper_bound(const key_type &) const; + iterator upper_bound(const KeyType &, KeyTypeKeyCompare); + const_iterator upper_bound(const key_type &) const; template<typename KeyType, typename KeyTypeKeyCompare> - const_iterator upper_bound(const KeyType &, KeyTypeKeyCompare) const; - iterator find(const key_type &); + const_iterator upper_bound(const KeyType &, KeyTypeKeyCompare) const; + iterator find(const key_type &); template<typename KeyType, typename KeyTypeKeyCompare> - iterator find(const KeyType &, KeyTypeKeyCompare); - const_iterator find(const key_type &) const; + iterator find(const KeyType &, KeyTypeKeyCompare); + const_iterator find(const key_type &) const; template<typename KeyType, typename KeyTypeKeyCompare> - const_iterator find(const KeyType &, KeyTypeKeyCompare) const; - std::pair< iterator, iterator > equal_range(const key_type &); + const_iterator find(const KeyType &, KeyTypeKeyCompare) const; + std::pair< iterator, iterator > equal_range(const key_type &); template<typename KeyType, typename KeyTypeKeyCompare> std::pair< iterator, iterator > - equal_range(const KeyType &, KeyTypeKeyCompare); + equal_range(const KeyType &, KeyTypeKeyCompare); std::pair< const_iterator, const_iterator > - equal_range(const key_type &) const; + equal_range(const key_type &) const; template<typename KeyType, typename KeyTypeKeyCompare> std::pair< const_iterator, const_iterator > - equal_range(const KeyType &, KeyTypeKeyCompare) const; + equal_range(const KeyType &, KeyTypeKeyCompare) const; std::pair< iterator, iterator > - bounded_range(const key_type &, const key_type &, bool, bool); + bounded_range(const key_type &, const key_type &, bool, bool); template<typename KeyType, typename KeyTypeKeyCompare> std::pair< iterator, iterator > - bounded_range(const KeyType &, const KeyType &, KeyTypeKeyCompare, bool, + bounded_range(const KeyType &, const KeyType &, KeyTypeKeyCompare, bool, bool); std::pair< const_iterator, const_iterator > - bounded_range(const key_type &, const key_type &, bool, bool) const; + bounded_range(const key_type &, const key_type &, bool, bool) const; template<typename KeyType, typename KeyTypeKeyCompare> std::pair< const_iterator, const_iterator > - bounded_range(const KeyType &, const KeyType &, KeyTypeKeyCompare, bool, + bounded_range(const KeyType &, const KeyType &, KeyTypeKeyCompare, bool, bool) const; - iterator iterator_to(reference); - const_iterator iterator_to(const_reference) const; - pointer unlink_leftmost_without_rebalance(); - void replace_node(iterator, reference); - void remove_node(reference); - void rebalance(); - iterator rebalance_subtree(iterator); - float balance_factor() const; - void balance_factor(float); - template<class... Options2> void merge(sg_multiset< T, Options2...> &); - template<class... Options2> void merge(sg_set< T, Options2...> &); + iterator iterator_to(reference); + const_iterator iterator_to(const_reference) const; + pointer unlink_leftmost_without_rebalance(); + void replace_node(iterator, reference); + void remove_node(reference); + void rebalance(); + iterator rebalance_subtree(iterator); + float balance_factor() const; + void balance_factor(float); + template<class... Options2> void merge(sg_multiset< T, Options2...> &); + template<class... Options2> void merge(sg_set< T, Options2...> &); - // public static functions - static sg_multiset & container_from_end_iterator(iterator); - static const sg_multiset & container_from_end_iterator(const_iterator); - static sg_multiset & container_from_iterator(iterator); - static const sg_multiset & container_from_iterator(const_iterator); - static iterator s_iterator_to(reference); - static const_iterator s_iterator_to(const_reference); - static void init_node(reference); + // public static functions + static sg_multiset & container_from_end_iterator(iterator); + static const sg_multiset & container_from_end_iterator(const_iterator); + static sg_multiset & container_from_iterator(iterator); + static const sg_multiset & container_from_iterator(const_iterator); + static iterator s_iterator_to(reference); + static const_iterator s_iterator_to(const_reference); + static void init_node(reference); // public data members static const bool constant_time_size; @@ -194,13 +194,13 @@ construct/copy/destruct
          1. -
            sg_multiset();
            +
            sg_multiset();

            Effects: Constructs an empty container.

            Complexity: Constant.

            Throws: If value_traits::node_traits::node constructor throws (this does not happen with predefined Boost.Intrusive hooks) or the copy constructor of the key_compare object throws. Basic guarantee.

          2. -
            explicit sg_multiset(const key_compare & cmp, 
+
            explicit sg_multiset(const key_compare & cmp, 
                      const value_traits & v_traits = value_traits());
            
 
            Effects: Constructs an empty container with given comparison and traits.
            
 
            Complexity: Constant.
            
@@ -208,7 +208,7 @@
 
          3. template<typename Iterator> 
-  sg_multiset(Iterator b, Iterator e, const key_compare & cmp = key_compare(), 
+  sg_multiset(Iterator b, Iterator e, const key_compare & cmp = key_compare(), 
               const value_traits & v_traits = value_traits());

            Requires: Dereferencing iterator must yield an lvalue of type value_type. cmp must be a comparison function that induces a strict weak ordering.

            Effects: Constructs an empty container and inserts elements from [b, e).

            @@ -216,17 +216,17 @@

            Throws: If value_traits::node_traits::node constructor throws (this does not happen with predefined Boost.Intrusive hooks) or the copy constructor/operator() of the key_compare object throws. Basic guarantee.

          4. -
            sg_multiset(sg_multiset && x);
            +
            sg_multiset(sg_multiset && x);

            Effects: Constructs a container moving resources from another container. Internal comparison object and value traits are move constructed and nodes belonging to x (except the node representing the "end") are linked to *this.

            Complexity: Constant.

            Throws: If value_traits::node_traits::node's move constructor throws (this does not happen with predefined Boost.Intrusive hooks) or the move constructor of the comparison objet throws.

          5. -
            sg_multiset & operator=(sg_multiset && x);
            +
            sg_multiset & operator=(sg_multiset && x);

            Effects: Equivalent to swap

          6. -
            ~sg_multiset();
            +
            ~sg_multiset();

            Effects: Detaches all elements from this. The objects in the set are not deleted (i.e. no destructors are called), but the nodes according to the value_traits template parameter are reinitialized and thus can be reused.

            Complexity: Linear to elements contained in *this.

            Throws: Nothing.

            @@ -235,131 +235,131 @@

          -sg_multiset public member functions

          +sg_multiset public member functions
          1. -
            iterator begin();
            +
            iterator begin();

            Effects: Returns an iterator pointing to the beginning of the container.

            Complexity: Constant.

            Throws: Nothing.

          2. -
            const_iterator begin() const;
            +
            const_iterator begin() const;

            Effects: Returns a const_iterator pointing to the beginning of the container.

            Complexity: Constant.

            Throws: Nothing.

          3. -
            const_iterator cbegin() const;
            +
            const_iterator cbegin() const;

            Effects: Returns a const_iterator pointing to the beginning of the container.

            Complexity: Constant.

            Throws: Nothing.

          4. -
            iterator end();
            +
            iterator end();

            Effects: Returns an iterator pointing to the end of the container.

            Complexity: Constant.

            Throws: Nothing.

          5. -
            const_iterator end() const;
            +
            const_iterator end() const;

            Effects: Returns a const_iterator pointing to the end of the container.

            Complexity: Constant.

            Throws: Nothing.

          6. -
            const_iterator cend() const;
            +
            const_iterator cend() const;

            Effects: Returns a const_iterator pointing to the end of the container.

            Complexity: Constant.

            Throws: Nothing.

          7. -
            reverse_iterator rbegin();
            +
            reverse_iterator rbegin();

            Effects: Returns a reverse_iterator pointing to the beginning of the reversed container.

            Complexity: Constant.

            Throws: Nothing.

          8. -
            const_reverse_iterator rbegin() const;
            +
            const_reverse_iterator rbegin() const;

            Effects: Returns a const_reverse_iterator pointing to the beginning of the reversed container.

            Complexity: Constant.

            Throws: Nothing.

          9. -
            const_reverse_iterator crbegin() const;
            +
            const_reverse_iterator crbegin() const;

            Effects: Returns a const_reverse_iterator pointing to the beginning of the reversed container.

            Complexity: Constant.

            Throws: Nothing.

          10. -
            reverse_iterator rend();
            +
            reverse_iterator rend();

            Effects: Returns a reverse_iterator pointing to the end of the reversed container.

            Complexity: Constant.

            Throws: Nothing.

          11. -
            const_reverse_iterator rend() const;
            +
            const_reverse_iterator rend() const;

            Effects: Returns a const_reverse_iterator pointing to the end of the reversed container.

            Complexity: Constant.

            Throws: Nothing.

          12. -
            const_reverse_iterator crend() const;
            +
            const_reverse_iterator crend() const;

            Effects: Returns a const_reverse_iterator pointing to the end of the reversed container.

            Complexity: Constant.

            Throws: Nothing.

          13. -
            iterator root();
            +
            iterator root();

            Effects: Returns a iterator pointing to the root node of the container or end() if not present.

            Complexity: Constant.

            Throws: Nothing.

          14. -
            const_iterator root() const;
            +
            const_iterator root() const;

            Effects: Returns a const_iterator pointing to the root node of the container or cend() if not present.

            Complexity: Constant.

            Throws: Nothing.

          15. -
            const_iterator croot() const;
            +
            const_iterator croot() const;

            Effects: Returns a const_iterator pointing to the root node of the container or cend() if not present.

            Complexity: Constant.

            Throws: Nothing.

          16. -
            key_compare key_comp() const;
            +
            key_compare key_comp() const;

            Effects: Returns the key_compare object used by the container.

            Complexity: Constant.

            Throws: If key_compare copy-constructor throws.

          17. -
            value_compare value_comp() const;
            +
            value_compare value_comp() const;

            Effects: Returns the value_compare object used by the container.

            Complexity: Constant.

            Throws: If value_compare copy-constructor throws.

          18. -
            bool empty() const;
            +
            bool empty() const;

            Effects: Returns true if the container is empty.

            Complexity: Constant.

            Throws: Nothing.

          19. -
            size_type size() const;
            +
            size_type size() const;

            Effects: Returns the number of elements stored in the container.

            Complexity: Linear to elements contained in *this if constant-time size option is disabled. Constant time otherwise.

            Throws: Nothing.

          20. -
            void swap(sg_multiset & other);
            +
            void swap(sg_multiset & other);

            Effects: Swaps the contents of two containers.

            Complexity: Constant.

            Throws: If the comparison functor's swap call throws. 

          21. template<typename Cloner, typename Disposer> 
-  void clone_from(const sg_multiset & src, Cloner cloner, Disposer disposer);
            + void clone_from(const sg_multiset & src, Cloner cloner, Disposer disposer);

            Requires: Disposer::operator()(pointer) shouldn't throw. Cloner should yield to nodes equivalent to the original nodes.

            Effects: Erases all the elements from *this calling Disposer::operator()(pointer), clones all the elements from src calling Cloner::operator()(const_reference ) and inserts them on *this. Copies the predicate from the source container.

            If cloner throws, all cloned elements are unlinked and disposed calling Disposer::operator()(pointer).

            @@ -368,7 +368,7 @@ 
          22. template<typename Cloner, typename Disposer> 
-  void clone_from(sg_multiset && src, Cloner cloner, Disposer disposer);
            + void clone_from(sg_multiset && src, Cloner cloner, Disposer disposer);

            Requires: Disposer::operator()(pointer) shouldn't throw. Cloner should yield to nodes equivalent to the original nodes.

            Effects: Erases all the elements from *this calling Disposer::operator()(pointer), clones all the elements from src calling Cloner::operator()(reference) and inserts them on *this. Copies the predicate from the source container.

            If cloner throws, all cloned elements are unlinked and disposed calling Disposer::operator()(pointer).

            @@ -377,7 +377,7 @@

            Note: This version can modify the source container, useful to implement move semantics. Additional notes: it also copies the alpha factor from the source container.

          23. -
            iterator insert(reference value);
            +
            iterator insert(reference value);

            Requires: value must be an lvalue

            Effects: Inserts value into the container before the upper bound.

            Complexity: Average complexity for insert element is at most logarithmic.

            @@ -385,7 +385,7 @@

            Note: Does not affect the validity of iterators and references. No copy-constructors are called.

          24. -
            iterator insert(const_iterator hint, reference value);
            +
            iterator insert(const_iterator hint, reference value);

            Requires: value must be an lvalue, and "hint" must be a valid iterator.

            Effects: Inserts x into the container, using "hint" as a hint to where it will be inserted. If "hint" is the upper_bound the insertion takes constant time (two comparisons in the worst case)

            Complexity: Logarithmic in general, but it is amortized constant time if t is inserted immediately before hint.

            @@ -393,7 +393,7 @@

            Note: Does not affect the validity of iterators and references. No copy-constructors are called.

          25. -
            template<typename Iterator> void insert(Iterator b, Iterator e);
            +
            template<typename Iterator> void insert(Iterator b, Iterator e);

            Requires: Dereferencing iterator must yield an lvalue of type value_type.

            Effects: Inserts a each element of a range into the container before the upper bound of the key of each element.

            Complexity: Insert range is in general O(N * log(N)), where N is the size of the range. However, it is linear in N if the range is already sorted by value_comp().

            @@ -401,7 +401,7 @@

            Note: Does not affect the validity of iterators and references. No copy-constructors are called.

          26. -
            iterator insert_before(const_iterator pos, reference value);
            +
            iterator insert_before(const_iterator pos, reference value);

            Requires: value must be an lvalue, "pos" must be a valid iterator (or end) and must be the succesor of value once inserted according to the predicate

            Effects: Inserts x into the container before "pos".

            Complexity: Constant time.

            @@ -409,7 +409,7 @@

            Note: This function does not check preconditions so if "pos" is not the successor of "value" container ordering invariant will be broken. This is a low-level function to be used only for performance reasons by advanced users.

          27. -
            void push_back(reference value);
            +
            void push_back(reference value);

            Requires: value must be an lvalue, and it must be no less than the greatest inserted key

            Effects: Inserts x into the container in the last position.

            Complexity: Constant time.

            @@ -417,7 +417,7 @@

            Note: This function does not check preconditions so if value is less than the greatest inserted key container ordering invariant will be broken. This function is slightly more efficient than using "insert_before". This is a low-level function to be used only for performance reasons by advanced users.

          28. -
            void push_front(reference value);
            +
            void push_front(reference value);

            Requires: value must be an lvalue, and it must be no greater than the minimum inserted key

            Effects: Inserts x into the container in the first position.

            Complexity: Constant time.

            @@ -425,21 +425,21 @@

            Note: This function does not check preconditions so if value is greater than the minimum inserted key container ordering invariant will be broken. This function is slightly more efficient than using "insert_before". This is a low-level function to be used only for performance reasons by advanced users.

          29. -
            iterator erase(const_iterator i);
            +
            iterator erase(const_iterator i);

            Effects: Erases the element pointed to by i.

            Complexity: Average complexity for erase element is constant time.

            Throws: Nothing.

            Note: Invalidates the iterators (but not the references) to the erased elements. No destructors are called.

          30. -
            iterator erase(const_iterator b, const_iterator e);
            +
            iterator erase(const_iterator b, const_iterator e);

            Effects: Erases the range pointed to by b end e.

            Complexity: Average complexity for erase range is at most O(log(size() + N)), where N is the number of elements in the range.

            Throws: Nothing.

            Note: Invalidates the iterators (but not the references) to the erased elements. No destructors are called.

          31. -
            size_type erase(const key_type & key);
            +
            size_type erase(const key_type & key);

            Effects: Erases all the elements with the given value.

            Returns: The number of erased elements.

            Complexity: O(log(size() + N).

            @@ -448,7 +448,7 @@ 
          32. template<typename KeyType, typename KeyTypeKeyCompare> 
-  size_type erase(const KeyType & key, KeyTypeKeyCompare comp);
            + size_type erase(const KeyType & key, KeyTypeKeyCompare comp);

            Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk), with nk the key_type of a value_type inserted into *this.

            Effects: Erases all the elements with the given key. according to the comparison functor "comp".

            Returns: The number of erased elements.

            @@ -458,7 +458,7 @@ 
          33. template<typename Disposer> 
-  iterator erase_and_dispose(const_iterator i, Disposer disposer);
            + iterator erase_and_dispose(const_iterator i, Disposer disposer);

            Requires: Disposer::operator()(pointer) shouldn't throw.

            Effects: Erases the element pointed to by i. Disposer::operator()(pointer) is called for the removed element.

            Complexity: Average complexity for erase element is constant time.

            @@ -467,7 +467,7 @@ 
          34. template<typename Disposer> 
-  iterator erase_and_dispose(const_iterator b, const_iterator e, 
+  iterator erase_and_dispose(const_iterator b, const_iterator e, 
                              Disposer disposer);

            Requires: Disposer::operator()(pointer) shouldn't throw.

            Effects: Erases the range pointed to by b end e. Disposer::operator()(pointer) is called for the removed elements.

            @@ -477,7 +477,7 @@ 
          35. template<typename Disposer> 
-  size_type erase_and_dispose(const key_type & key, Disposer disposer);
            + size_type erase_and_dispose(const key_type & key, Disposer disposer);

            Requires: Disposer::operator()(pointer) shouldn't throw.

            Effects: Erases all the elements with the given value. Disposer::operator()(pointer) is called for the removed elements.

            Returns: The number of erased elements.

            @@ -487,7 +487,7 @@ 
          36. template<typename KeyType, typename KeyTypeKeyCompare, typename Disposer> 
-  size_type erase_and_dispose(const KeyType & key, KeyTypeKeyCompare comp, 
+  size_type erase_and_dispose(const KeyType & key, KeyTypeKeyCompare comp, 
                               Disposer disposer);

            Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk) and nk the key_type of a value_type inserted into *this.

            Requires: Disposer::operator()(pointer) shouldn't throw.

            @@ -498,47 +498,47 @@

            Note: Invalidates the iterators to the erased elements.

          37. -
            void clear();
            +
            void clear();

            Effects: Erases all of the elements.

            Complexity: Linear to the number of elements on the container. if it's a safe-mode or auto-unlink value_type. Constant time otherwise.

            Throws: Nothing.

            Note: Invalidates the iterators (but not the references) to the erased elements. No destructors are called.

          38. -
            template<typename Disposer> void clear_and_dispose(Disposer disposer);
            +
            template<typename Disposer> void clear_and_dispose(Disposer disposer);

            Effects: Erases all of the elements calling disposer(p) for each node to be erased. Complexity: Average complexity for is at most O(log(size() + N)), where N is the number of elements in the container.

            Throws: Nothing.

            Note: Invalidates the iterators (but not the references) to the erased elements. Calls N times to disposer functor.

          39. -
            size_type count(const key_type & key) const;
            +
            size_type count(const key_type & key) const;

            Effects: Returns the number of contained elements with the given value

            Complexity: Logarithmic to the number of elements contained plus lineal to number of objects with the given value.

            Throws: If key_compare throws. 

          40. template<typename KeyType, typename KeyTypeKeyCompare> 
-  size_type count(const KeyType & key, KeyTypeKeyCompare comp) const;
            + size_type count(const KeyType & key, KeyTypeKeyCompare comp) const;

            Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk), and nk the key_type of a value_type inserted into *this.

            Effects: Returns the number of contained elements with the given key

            Complexity: Logarithmic to the number of elements contained plus lineal to number of objects with the given key.

            Throws: If comp throws.

          41. -
            iterator lower_bound(const key_type & key);
            +
            iterator lower_bound(const key_type & key);

            Effects: Returns an iterator to the first element whose key is not less than k or end() if that element does not exist.

            Complexity: Logarithmic.

            Throws: If key_compare throws. 

          42. template<typename KeyType, typename KeyTypeKeyCompare> 
-  iterator lower_bound(const KeyType & key, KeyTypeKeyCompare comp);
            + iterator lower_bound(const KeyType & key, KeyTypeKeyCompare comp);

            Effects: Returns an iterator to the first element whose key is not less than k or end() if that element does not exist.

            Complexity: Logarithmic.

            Throws: If key_compare throws.

          43. -
            const_iterator lower_bound(const key_type & key) const;
            +
            const_iterator lower_bound(const key_type & key) const;

            Effects: Returns an iterator to the first element whose key is not less than k or end() if that element does not exist.

            Complexity: Logarithmic.

            Throws: If key_compare throws.

            @@ -546,27 +546,27 @@ 
          44. template<typename KeyType, typename KeyTypeKeyCompare> 
   const_iterator 
-  lower_bound(const KeyType & key, KeyTypeKeyCompare comp) const;
            + lower_bound(const KeyType & key, KeyTypeKeyCompare comp) const;

            Effects: Returns an iterator to the first element whose key is not less than k or end() if that element does not exist.

            Complexity: Logarithmic.

            Throws: If key_compare throws.

          45. -
            iterator upper_bound(const key_type & key);
            +
            iterator upper_bound(const key_type & key);

            Effects: Returns an iterator to the first element whose key is greater than k or end() if that element does not exist.

            Complexity: Logarithmic.

            Throws: If key_compare throws. 

          46. template<typename KeyType, typename KeyTypeKeyCompare> 
-  iterator upper_bound(const KeyType & key, KeyTypeKeyCompare comp);
            + iterator upper_bound(const KeyType & key, KeyTypeKeyCompare comp);

            Requires: key is a value such that *this is partitioned with respect to !comp(key, nk), with nk the key_type of a value_type inserted into *this.

            Effects: Returns an iterator to the first element whose key is greater than k according to comp or end() if that element does not exist.

            Complexity: Logarithmic.

            Throws: If comp throws.

          47. -
            const_iterator upper_bound(const key_type & key) const;
            +
            const_iterator upper_bound(const key_type & key) const;

            Effects: Returns an iterator to the first element whose key is greater than k or end() if that element does not exist.

            Complexity: Logarithmic.

            Throws: If key_compare throws.

            @@ -574,42 +574,42 @@ 
          48. template<typename KeyType, typename KeyTypeKeyCompare> 
   const_iterator 
-  upper_bound(const KeyType & key, KeyTypeKeyCompare comp) const;
            + upper_bound(const KeyType & key, KeyTypeKeyCompare comp) const;

            Requires: key is a value such that *this is partitioned with respect to !comp(key, nk), with nk the key_type of a value_type inserted into *this.

            Effects: Returns an iterator to the first element whose key is greater than k according to comp or end() if that element does not exist.

            Complexity: Logarithmic.

            Throws: If comp throws.

          49. -
            iterator find(const key_type & key);
            +
            iterator find(const key_type & key);

            Effects: Finds an iterator to the first element whose key is k or end() if that element does not exist.

            Complexity: Logarithmic.

            Throws: If key_compare throws. 

          50. template<typename KeyType, typename KeyTypeKeyCompare> 
-  iterator find(const KeyType & key, KeyTypeKeyCompare comp);
            + iterator find(const KeyType & key, KeyTypeKeyCompare comp);

            Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk), and nk the key_type of a value_type inserted into *this.

            Effects: Finds an iterator to the first element whose key is k or end() if that element does not exist.

            Complexity: Logarithmic.

            Throws: If comp throws.

          51. -
            const_iterator find(const key_type & key) const;
            +
            const_iterator find(const key_type & key) const;

            Effects: Finds an iterator to the first element whose key is k or end() if that element does not exist.

            Complexity: Logarithmic.

            Throws: If key_compare throws. 

          52. template<typename KeyType, typename KeyTypeKeyCompare> 
-  const_iterator find(const KeyType & key, KeyTypeKeyCompare comp) const;
            + const_iterator find(const KeyType & key, KeyTypeKeyCompare comp) const;

            Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk), and nk the key_type of a value_type inserted into *this.

            Effects: Finds an iterator to the first element whose key is k or end() if that element does not exist.

            Complexity: Logarithmic.

            Throws: If comp throws.

          53. -
            std::pair< iterator, iterator > equal_range(const key_type & key);
            +
            std::pair< iterator, iterator > equal_range(const key_type & key);

            Effects: Finds a range containing all elements whose key is k or an empty range that indicates the position where those elements would be if they there is no elements with key k.

            Complexity: Logarithmic.

            Throws: If key_compare throws.

            @@ -617,7 +617,7 @@ 
          54. template<typename KeyType, typename KeyTypeKeyCompare> 
   std::pair< iterator, iterator > 
-  equal_range(const KeyType & key, KeyTypeKeyCompare comp);
            + equal_range(const KeyType & key, KeyTypeKeyCompare comp);

            Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk), with nk the key_type of a value_type inserted into *this.

            Effects: Finds a range containing all elements whose key is k or an empty range that indicates the position where those elements would be if they there is no elements with key k.

            Complexity: Logarithmic.

            @@ -625,7 +625,7 @@ 
          55. std::pair< const_iterator, const_iterator > 
-equal_range(const key_type & key) const;
            +equal_range(const key_type & key) const;

            Effects: Finds a range containing all elements whose key is k or an empty range that indicates the position where those elements would be if they there is no elements with key k.

            Complexity: Logarithmic.

            Throws: If key_compare throws.

            @@ -633,7 +633,7 @@ 
          56. template<typename KeyType, typename KeyTypeKeyCompare> 
   std::pair< const_iterator, const_iterator > 
-  equal_range(const KeyType & key, KeyTypeKeyCompare comp) const;
            + equal_range(const KeyType & key, KeyTypeKeyCompare comp) const;

            Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk), with nk the key_type of a value_type inserted into *this.

            Effects: Finds a range containing all elements whose key is k or an empty range that indicates the position where those elements would be if they there is no elements with key k.

            Complexity: Logarithmic.

            @@ -641,7 +641,7 @@ 
          57. std::pair< iterator, iterator > 
-bounded_range(const key_type & lower_key, const key_type & upper_key, 
+bounded_range(const key_type & lower_key, const key_type & upper_key, 
               bool left_closed, bool right_closed);

            Requires: upper_key shall not precede lower_key according to key_compare. [key_comp()(upper_key, lower_key) shall be false]

            If lower_key is equivalent to upper_key [!key_comp()(upper_key, lower_key) && !key_comp()(lower_key, upper_key)] then ('left_closed' || 'right_closed') must be false.

            @@ -656,7 +656,7 @@ 
          58. template<typename KeyType, typename KeyTypeKeyCompare> 
   std::pair< iterator, iterator > 
-  bounded_range(const KeyType & lower_key, const KeyType & upper_key, 
+  bounded_range(const KeyType & lower_key, const KeyType & upper_key, 
                 KeyTypeKeyCompare comp, bool left_closed, bool right_closed);

            Requires: lower_key is a value such that *this is partitioned with respect to comp(nk, lower_key) if left_closed is true, with respect to !comp(lower_key, nk) otherwise.

            upper_key is a value such that *this is partitioned with respect to !comp(upper_key, nk) if right_closed is true, with respect to comp(nk, upper_key) otherwise.

            @@ -672,7 +672,7 @@ 
          59. std::pair< const_iterator, const_iterator > 
-bounded_range(const key_type & lower_key, const key_type & upper_key, 
+bounded_range(const key_type & lower_key, const key_type & upper_key, 
               bool left_closed, bool right_closed) const;

            Requires: upper_key shall not precede lower_key according to key_compare. [key_comp()(upper_key, lower_key) shall be false]

            If lower_key is equivalent to upper_key [!key_comp()(upper_key, lower_key) && !key_comp()(lower_key, upper_key)] then ('left_closed' || 'right_closed') must be false.

            @@ -687,7 +687,7 @@ 
          60. template<typename KeyType, typename KeyTypeKeyCompare> 
   std::pair< const_iterator, const_iterator > 
-  bounded_range(const KeyType & lower_key, const KeyType & upper_key, 
+  bounded_range(const KeyType & lower_key, const KeyType & upper_key, 
                 KeyTypeKeyCompare comp, bool left_closed, bool right_closed) const;

            Requires: lower_key is a value such that *this is partitioned with respect to comp(nk, lower_key) if left_closed is true, with respect to !comp(lower_key, nk) otherwise.

            upper_key is a value such that *this is partitioned with respect to !comp(upper_key, nk) if right_closed is true, with respect to comp(nk, upper_key) otherwise.

            @@ -702,28 +702,28 @@

            Note: Experimental function, the interface might change in future releases.

          61. -
            iterator iterator_to(reference value);
            +
            iterator iterator_to(reference value);

            Requires: value must be an lvalue and shall be in a set of appropriate type. Otherwise the behavior is undefined.

            Effects: Returns: a valid iterator i belonging to the set that points to the value

            Complexity: Constant.

            Throws: Nothing.

          62. -
            const_iterator iterator_to(const_reference value) const;
            +
            const_iterator iterator_to(const_reference value) const;

            Requires: value must be an lvalue and shall be in a set of appropriate type. Otherwise the behavior is undefined.

            Effects: Returns: a valid const_iterator i belonging to the set that points to the value

            Complexity: Constant.

            Throws: Nothing.

          63. -
            pointer unlink_leftmost_without_rebalance();
            +
            pointer unlink_leftmost_without_rebalance();

            Effects: Unlinks the leftmost node from the container.

            Complexity: Average complexity is constant time.

            Throws: Nothing.

            Notes: This function breaks the container and the container can only be used for more unlink_leftmost_without_rebalance calls. This function is normally used to achieve a step by step controlled destruction of the container.

          64. -
            void replace_node(iterator replace_this, reference with_this);
            +
            void replace_node(iterator replace_this, reference with_this);

            Requires: replace_this must be a valid iterator of *this and with_this must not be inserted in any container.

            Effects: Replaces replace_this in its position in the container with with_this. The container does not need to be rebalanced.

            Complexity: Constant.

            @@ -731,7 +731,7 @@

            Note: This function will break container ordering invariants if with_this is not equivalent to *replace_this according to the ordering rules. This function is faster than erasing and inserting the node, since no rebalancing or comparison is needed.

          65. -
            void remove_node(reference value);
            +
            void remove_node(reference value);

            Effects: removes "value" from the container.

            Throws: Nothing.

            Complexity: Logarithmic time.

            @@ -739,13 +739,13 @@

            If the user calls this function with a constant time size container or stateful comparison functor a compilation error will be issued.

          66. -
            void rebalance();
            +
            void rebalance();

            Effects: Rebalances the tree.

            Throws: Nothing.

            Complexity: Linear.

          67. -
            iterator rebalance_subtree(iterator root);
            +
            iterator rebalance_subtree(iterator root);

            Requires: old_root is a node of a tree.

            Effects: Rebalances the subtree rooted at old_root.

            Returns: The new root of the subtree.

            @@ -753,20 +753,20 @@

            Complexity: Linear to the elements in the subtree.

          68. -
            float balance_factor() const;
            +
            float balance_factor() const;

            Returns: The balance factor (alpha) used in this tree

            Throws: Nothing.

            Complexity: Constant.

          69. -
            void balance_factor(float new_alpha);
            +
            void balance_factor(float new_alpha);

            Requires: new_alpha must be a value between 0.5 and 1.0

            Effects: Establishes a new balance factor (alpha) and rebalances the tree if the new balance factor is stricter (less) than the old factor.

            Throws: Nothing.

            Complexity: Linear to the elements in the subtree.

          70. -
            template<class... Options2> void merge(sg_multiset< T, Options2...> & source);
            +
            template<class... Options2> void merge(sg_multiset< T, Options2...> & source);

            Requires: "source" container's Options can only can differ in the comparison function from *this.

            Effects: Attempts to extract each element in source and insert it into a using the comparison object of *this. If there is an element in a with key equivalent to the key of an element from source, then that element is not extracted from source.

            Postcondition: Pointers and references to the transferred elements of source refer to those same elements but as members of *this. Iterators referring to the transferred elements will continue to refer to their elements, but they now behave as iterators into *this, not into source.

            @@ -774,7 +774,7 @@

            Complexity: N log(a.size() + N) (N has the value source.size())

          71. -
            template<class... Options2> void merge(sg_set< T, Options2...> & source);
            +
            template<class... Options2> void merge(sg_set< T, Options2...> & source);

            Requires: "source" container's Options can only can differ in the comparison function from *this.

            Effects: Attempts to extract each element in source and insert it into a using the comparison object of *this. If there is an element in a with key equivalent to the key of an element from source, then that element is not extracted from source.

            Postcondition: Pointers and references to the transferred elements of source refer to those same elements but as members of *this. Iterators referring to the transferred elements will continue to refer to their elements, but they now behave as iterators into *this, not into source.

            @@ -785,10 +785,10 @@

          -sg_multiset public static functions

          +sg_multiset public static functions
          1. -
            static sg_multiset & container_from_end_iterator(iterator end_iterator);
            +
            static sg_multiset & container_from_end_iterator(iterator end_iterator);

            Precondition: end_iterator must be a valid end iterator of the container.

            Effects: Returns a const reference to the container associated to the end iterator

            Throws: Nothing.

            @@ -796,28 +796,28 @@ 
          2. static const sg_multiset & 
-container_from_end_iterator(const_iterator end_iterator);
            +container_from_end_iterator(const_iterator end_iterator);

            Precondition: end_iterator must be a valid end iterator of the container.

            Effects: Returns a const reference to the container associated to the end iterator

            Throws: Nothing.

            Complexity: Constant.

          3. -
            static sg_multiset & container_from_iterator(iterator it);
            +
            static sg_multiset & container_from_iterator(iterator it);

            Precondition: it must be a valid iterator of the container.

            Effects: Returns a const reference to the container associated to the iterator

            Throws: Nothing.

            Complexity: Logarithmic.

          4. -
            static const sg_multiset & container_from_iterator(const_iterator it);
            +
            static const sg_multiset & container_from_iterator(const_iterator it);

            Precondition: it must be a valid iterator of the container.

            Effects: Returns a const reference to the container associated to the iterator

            Throws: Nothing.

            Complexity: Logarithmic.

          5. -
            static iterator s_iterator_to(reference value);
            +
            static iterator s_iterator_to(reference value);

            Requires: value must be an lvalue and shall be in a set of appropriate type. Otherwise the behavior is undefined.

            Effects: Returns: a valid iterator i belonging to the set that points to the value

            Complexity: Constant.

            @@ -825,7 +825,7 @@

            Note: This static function is available only if the value traits is stateless.

          6. -
            static const_iterator s_iterator_to(const_reference value);
            +
            static const_iterator s_iterator_to(const_reference value);

            Requires: value must be an lvalue and shall be in a set of appropriate type. Otherwise the behavior is undefined.

            Effects: Returns: a valid iterator i belonging to the set that points to the value

            Complexity: Constant.

            @@ -833,7 +833,7 @@

            Note: This static function is available only if the value traits is stateless.

          7. -
            static void init_node(reference value);
            +
            static void init_node(reference value);

            Requires: value shall not be in a container.

            Effects: init_node puts the hook of a value in a well-known default state.

            Throws: Nothing.

            diff --git a/doc/html/boost/intrusive/sg_set.html b/doc/html/boost/intrusive/sg_set.html index 6d8b945326..64c3935a2a 100644 --- a/doc/html/boost/intrusive/sg_set.html +++ b/doc/html/boost/intrusive/sg_set.html @@ -60,135 +60,135 @@ typedef implementation_defined::node_algorithms node_algorithms; // construct/copy/destruct - sg_set(); - explicit sg_set(const key_compare &, const value_traits & = value_traits()); + sg_set(); + explicit sg_set(const key_compare &, const value_traits & = value_traits()); template<typename Iterator> - sg_set(Iterator, Iterator, const key_compare & = key_compare(), + sg_set(Iterator, Iterator, const key_compare & = key_compare(), const value_traits & = value_traits()); - sg_set(sg_set &&); - sg_set & operator=(sg_set &&); - ~sg_set(); + sg_set(sg_set &&); + sg_set & operator=(sg_set &&); + ~sg_set(); - // public member functions - iterator begin(); - const_iterator begin() const; - const_iterator cbegin() const; - iterator end(); - const_iterator end() const; - const_iterator cend() const; - reverse_iterator rbegin(); - const_reverse_iterator rbegin() const; - const_reverse_iterator crbegin() const; - reverse_iterator rend(); - const_reverse_iterator rend() const; - const_reverse_iterator crend() const; - iterator root(); - const_iterator root() const; - const_iterator croot() const; - key_compare key_comp() const; - value_compare value_comp() const; - bool empty() const; - size_type size() const; - void swap(sg_set &); + // public member functions + iterator begin(); + const_iterator begin() const; + const_iterator cbegin() const; + iterator end(); + const_iterator end() const; + const_iterator cend() const; + reverse_iterator rbegin(); + const_reverse_iterator rbegin() const; + const_reverse_iterator crbegin() const; + reverse_iterator rend(); + const_reverse_iterator rend() const; + const_reverse_iterator crend() const; + iterator root(); + const_iterator root() const; + const_iterator croot() const; + key_compare key_comp() const; + value_compare value_comp() const; + bool empty() const; + size_type size() const; + void swap(sg_set &); template<typename Cloner, typename Disposer> - void clone_from(const sg_set &, Cloner, Disposer); + void clone_from(const sg_set &, Cloner, Disposer); template<typename Cloner, typename Disposer> - void clone_from(sg_set &&, Cloner, Disposer); - std::pair< iterator, bool > insert(reference); - iterator insert(const_iterator, reference); + void clone_from(sg_set &&, Cloner, Disposer); + std::pair< iterator, bool > insert(reference); + iterator insert(const_iterator, reference); std::pair< iterator, bool > - insert_check(const key_type &, insert_commit_data &); + insert_check(const key_type &, insert_commit_data &); std::pair< iterator, bool > - insert_check(const_iterator, const key_type &, insert_commit_data &); + insert_check(const_iterator, const key_type &, insert_commit_data &); template<typename KeyType, typename KeyTypeKeyCompare> std::pair< iterator, bool > - insert_check(const KeyType &, KeyTypeKeyCompare, insert_commit_data &); + insert_check(const KeyType &, KeyTypeKeyCompare, insert_commit_data &); template<typename KeyType, typename KeyTypeKeyCompare> std::pair< iterator, bool > - insert_check(const_iterator, const KeyType &, KeyTypeKeyCompare, + insert_check(const_iterator, const KeyType &, KeyTypeKeyCompare, insert_commit_data &); - template<typename Iterator> void insert(Iterator, Iterator); - iterator insert_commit(reference, const insert_commit_data &); - iterator insert_before(const_iterator, reference); - void push_back(reference); - void push_front(reference); - iterator erase(const_iterator); - iterator erase(const_iterator, const_iterator); - size_type erase(const key_type &); + template<typename Iterator> void insert(Iterator, Iterator); + iterator insert_commit(reference, const insert_commit_data &); + iterator insert_before(const_iterator, reference); + void push_back(reference); + void push_front(reference); + iterator erase(const_iterator); + iterator erase(const_iterator, const_iterator); + size_type erase(const key_type &); template<typename KeyType, typename KeyTypeKeyCompare> - size_type erase(const KeyType &, KeyTypeKeyCompare); + size_type erase(const KeyType &, KeyTypeKeyCompare); template<typename Disposer> - iterator erase_and_dispose(const_iterator, Disposer); + iterator erase_and_dispose(const_iterator, Disposer); template<typename Disposer> - iterator erase_and_dispose(const_iterator, const_iterator, Disposer); + iterator erase_and_dispose(const_iterator, const_iterator, Disposer); template<typename Disposer> - size_type erase_and_dispose(const key_type &, Disposer); + size_type erase_and_dispose(const key_type &, Disposer); template<typename KeyType, typename KeyTypeKeyCompare, typename Disposer> - size_type erase_and_dispose(const KeyType &, KeyTypeKeyCompare, Disposer); - void clear(); - template<typename Disposer> void clear_and_dispose(Disposer); - size_type count(const key_type &) const; + size_type erase_and_dispose(const KeyType &, KeyTypeKeyCompare, Disposer); + void clear(); + template<typename Disposer> void clear_and_dispose(Disposer); + size_type count(const key_type &) const; template<typename KeyType, typename KeyTypeKeyCompare> - size_type count(const KeyType &, KeyTypeKeyCompare) const; - iterator lower_bound(const key_type &); + size_type count(const KeyType &, KeyTypeKeyCompare) const; + iterator lower_bound(const key_type &); template<typename KeyType, typename KeyTypeKeyCompare> - iterator lower_bound(const KeyType &, KeyTypeKeyCompare); - const_iterator lower_bound(const key_type &) const; + iterator lower_bound(const KeyType &, KeyTypeKeyCompare); + const_iterator lower_bound(const key_type &) const; template<typename KeyType, typename KeyTypeKeyCompare> - const_iterator lower_bound(const KeyType &, KeyTypeKeyCompare) const; - iterator upper_bound(const key_type &); + const_iterator lower_bound(const KeyType &, KeyTypeKeyCompare) const; + iterator upper_bound(const key_type &); template<typename KeyType, typename KeyTypeKeyCompare> - iterator upper_bound(const KeyType &, KeyTypeKeyCompare); - const_iterator upper_bound(const key_type &) const; + iterator upper_bound(const KeyType &, KeyTypeKeyCompare); + const_iterator upper_bound(const key_type &) const; template<typename KeyType, typename KeyTypeKeyCompare> - const_iterator upper_bound(const KeyType &, KeyTypeKeyCompare) const; - iterator find(const key_type &); + const_iterator upper_bound(const KeyType &, KeyTypeKeyCompare) const; + iterator find(const key_type &); template<typename KeyType, typename KeyTypeKeyCompare> - iterator find(const KeyType &, KeyTypeKeyCompare); - const_iterator find(const key_type &) const; + iterator find(const KeyType &, KeyTypeKeyCompare); + const_iterator find(const key_type &) const; template<typename KeyType, typename KeyTypeKeyCompare> - const_iterator find(const KeyType &, KeyTypeKeyCompare) const; - std::pair< iterator, iterator > equal_range(const key_type &); + const_iterator find(const KeyType &, KeyTypeKeyCompare) const; + std::pair< iterator, iterator > equal_range(const key_type &); template<typename KeyType, typename KeyTypeKeyCompare> std::pair< iterator, iterator > - equal_range(const KeyType &, KeyTypeKeyCompare); + equal_range(const KeyType &, KeyTypeKeyCompare); std::pair< const_iterator, const_iterator > - equal_range(const key_type &) const; + equal_range(const key_type &) const; template<typename KeyType, typename KeyTypeKeyCompare> std::pair< const_iterator, const_iterator > - equal_range(const KeyType &, KeyTypeKeyCompare) const; + equal_range(const KeyType &, KeyTypeKeyCompare) const; std::pair< iterator, iterator > - bounded_range(const key_type &, const key_type &, bool, bool); + bounded_range(const key_type &, const key_type &, bool, bool); template<typename KeyType, typename KeyTypeKeyCompare> std::pair< iterator, iterator > - bounded_range(const KeyType &, const KeyType &, KeyTypeKeyCompare, bool, + bounded_range(const KeyType &, const KeyType &, KeyTypeKeyCompare, bool, bool); std::pair< const_iterator, const_iterator > - bounded_range(const key_type &, const key_type &, bool, bool) const; + bounded_range(const key_type &, const key_type &, bool, bool) const; template<typename KeyType, typename KeyTypeKeyCompare> std::pair< const_iterator, const_iterator > - bounded_range(const KeyType &, const KeyType &, KeyTypeKeyCompare, bool, + bounded_range(const KeyType &, const KeyType &, KeyTypeKeyCompare, bool, bool) const; - iterator iterator_to(reference); - const_iterator iterator_to(const_reference) const; - pointer unlink_leftmost_without_rebalance(); - void replace_node(iterator, reference); - void remove_node(reference); - void rebalance(); - iterator rebalance_subtree(iterator); - float balance_factor() const; - void balance_factor(float); - template<class... Options2> void merge(sg_set< T, Options2...> &); - template<class... Options2> void merge(sg_multiset< T, Options2...> &); + iterator iterator_to(reference); + const_iterator iterator_to(const_reference) const; + pointer unlink_leftmost_without_rebalance(); + void replace_node(iterator, reference); + void remove_node(reference); + void rebalance(); + iterator rebalance_subtree(iterator); + float balance_factor() const; + void balance_factor(float); + template<class... Options2> void merge(sg_set< T, Options2...> &); + template<class... Options2> void merge(sg_multiset< T, Options2...> &); - // public static functions - static sg_set & container_from_end_iterator(iterator); - static const sg_set & container_from_end_iterator(const_iterator); - static sg_set & container_from_iterator(iterator); - static const sg_set & container_from_iterator(const_iterator); - static iterator s_iterator_to(reference); - static const_iterator s_iterator_to(const_reference); - static void init_node(reference); + // public static functions + static sg_set & container_from_end_iterator(iterator); + static const sg_set & container_from_end_iterator(const_iterator); + static sg_set & container_from_iterator(iterator); + static const sg_set & container_from_iterator(const_iterator); + static iterator s_iterator_to(reference); + static const_iterator s_iterator_to(const_reference); + static void init_node(reference); // public data members static const bool constant_time_size; @@ -205,13 +205,13 @@ construct/copy/destruct
            1. -
              sg_set();
              +
              sg_set();

              Effects: Constructs an empty container.

              Complexity: Constant.

              Throws: If value_traits::node_traits::node constructor throws (this does not happen with predefined Boost.Intrusive hooks) or the copy constructor of the key_compare object throws. Basic guarantee.

            2. -
              explicit sg_set(const key_compare & cmp, 
+
              explicit sg_set(const key_compare & cmp, 
                 const value_traits & v_traits = value_traits());
              
 
              Effects: Constructs an empty container with given comparison and traits.
              
 
              Complexity: Constant.
              
@@ -219,7 +219,7 @@
 
            3. template<typename Iterator> 
-  sg_set(Iterator b, Iterator e, const key_compare & cmp = key_compare(), 
+  sg_set(Iterator b, Iterator e, const key_compare & cmp = key_compare(), 
          const value_traits & v_traits = value_traits());

              Requires: Dereferencing iterator must yield an lvalue of type value_type. cmp must be a comparison function that induces a strict weak ordering.

              Effects: Constructs an empty container and inserts elements from [b, e).

              @@ -227,17 +227,17 @@

              Throws: If value_traits::node_traits::node constructor throws (this does not happen with predefined Boost.Intrusive hooks) or the copy constructor/operator() of the key_compare object throws. Basic guarantee.

            4. -
              sg_set(sg_set && x);
              +
              sg_set(sg_set && x);

              Effects: Constructs a container moving resources from another container. Internal comparison object and value traits are move constructed and nodes belonging to x (except the node representing the "end") are linked to *this.

              Complexity: Constant.

              Throws: If value_traits::node_traits::node's move constructor throws (this does not happen with predefined Boost.Intrusive hooks) or the move constructor of the comparison objet throws.

            5. -
              sg_set & operator=(sg_set && x);
              +
              sg_set & operator=(sg_set && x);

              Effects: Equivalent to swap

            6. -
              ~sg_set();
              +
              ~sg_set();

              Effects: Detaches all elements from this. The objects in the set are not deleted (i.e. no destructors are called), but the nodes according to the value_traits template parameter are reinitialized and thus can be reused.

              Complexity: Linear to elements contained in *this.

              Throws: Nothing.

              @@ -246,131 +246,131 @@

            -sg_set public member functions

            +sg_set public member functions
            1. -
              iterator begin();
              +
              iterator begin();

              Effects: Returns an iterator pointing to the beginning of the container.

              Complexity: Constant.

              Throws: Nothing.

            2. -
              const_iterator begin() const;
              +
              const_iterator begin() const;

              Effects: Returns a const_iterator pointing to the beginning of the container.

              Complexity: Constant.

              Throws: Nothing.

            3. -
              const_iterator cbegin() const;
              +
              const_iterator cbegin() const;

              Effects: Returns a const_iterator pointing to the beginning of the container.

              Complexity: Constant.

              Throws: Nothing.

            4. -
              iterator end();
              +
              iterator end();

              Effects: Returns an iterator pointing to the end of the container.

              Complexity: Constant.

              Throws: Nothing.

            5. -
              const_iterator end() const;
              +
              const_iterator end() const;

              Effects: Returns a const_iterator pointing to the end of the container.

              Complexity: Constant.

              Throws: Nothing.

            6. -
              const_iterator cend() const;
              +
              const_iterator cend() const;

              Effects: Returns a const_iterator pointing to the end of the container.

              Complexity: Constant.

              Throws: Nothing.

            7. -
              reverse_iterator rbegin();
              +
              reverse_iterator rbegin();

              Effects: Returns a reverse_iterator pointing to the beginning of the reversed container.

              Complexity: Constant.

              Throws: Nothing.

            8. -
              const_reverse_iterator rbegin() const;
              +
              const_reverse_iterator rbegin() const;

              Effects: Returns a const_reverse_iterator pointing to the beginning of the reversed container.

              Complexity: Constant.

              Throws: Nothing.

            9. -
              const_reverse_iterator crbegin() const;
              +
              const_reverse_iterator crbegin() const;

              Effects: Returns a const_reverse_iterator pointing to the beginning of the reversed container.

              Complexity: Constant.

              Throws: Nothing.

            10. -
              reverse_iterator rend();
              +
              reverse_iterator rend();

              Effects: Returns a reverse_iterator pointing to the end of the reversed container.

              Complexity: Constant.

              Throws: Nothing.

            11. -
              const_reverse_iterator rend() const;
              +
              const_reverse_iterator rend() const;

              Effects: Returns a const_reverse_iterator pointing to the end of the reversed container.

              Complexity: Constant.

              Throws: Nothing.

            12. -
              const_reverse_iterator crend() const;
              +
              const_reverse_iterator crend() const;

              Effects: Returns a const_reverse_iterator pointing to the end of the reversed container.

              Complexity: Constant.

              Throws: Nothing.

            13. -
              iterator root();
              +
              iterator root();

              Effects: Returns a iterator pointing to the root node of the container or end() if not present.

              Complexity: Constant.

              Throws: Nothing.

            14. -
              const_iterator root() const;
              +
              const_iterator root() const;

              Effects: Returns a const_iterator pointing to the root node of the container or cend() if not present.

              Complexity: Constant.

              Throws: Nothing.

            15. -
              const_iterator croot() const;
              +
              const_iterator croot() const;

              Effects: Returns a const_iterator pointing to the root node of the container or cend() if not present.

              Complexity: Constant.

              Throws: Nothing.

            16. -
              key_compare key_comp() const;
              +
              key_compare key_comp() const;

              Effects: Returns the key_compare object used by the container.

              Complexity: Constant.

              Throws: If key_compare copy-constructor throws.

            17. -
              value_compare value_comp() const;
              +
              value_compare value_comp() const;

              Effects: Returns the value_compare object used by the container.

              Complexity: Constant.

              Throws: If value_compare copy-constructor throws.

            18. -
              bool empty() const;
              +
              bool empty() const;

              Effects: Returns true if the container is empty.

              Complexity: Constant.

              Throws: Nothing.

            19. -
              size_type size() const;
              +
              size_type size() const;

              Effects: Returns the number of elements stored in the container.

              Complexity: Linear to elements contained in *this if constant-time size option is disabled. Constant time otherwise.

              Throws: Nothing.

            20. -
              void swap(sg_set & other);
              +
              void swap(sg_set & other);

              Effects: Swaps the contents of two containers.

              Complexity: Constant.

              Throws: If the comparison functor's swap call throws. 

            21. template<typename Cloner, typename Disposer> 
-  void clone_from(const sg_set & src, Cloner cloner, Disposer disposer);
              + void clone_from(const sg_set & src, Cloner cloner, Disposer disposer);

              Requires: Disposer::operator()(pointer) shouldn't throw. Cloner should yield to nodes equivalent to the original nodes.

              Effects: Erases all the elements from *this calling Disposer::operator()(pointer), clones all the elements from src calling Cloner::operator()(const_reference ) and inserts them on *this. Copies the predicate from the source container.

              If cloner throws, all cloned elements are unlinked and disposed calling Disposer::operator()(pointer).

              @@ -379,7 +379,7 @@ 
            22. template<typename Cloner, typename Disposer> 
-  void clone_from(sg_set && src, Cloner cloner, Disposer disposer);
              + void clone_from(sg_set && src, Cloner cloner, Disposer disposer);

              Requires: Disposer::operator()(pointer) shouldn't throw. Cloner should yield to nodes equivalent to the original nodes.

              Effects: Erases all the elements from *this calling Disposer::operator()(pointer), clones all the elements from src calling Cloner::operator()(reference) and inserts them on *this. Copies the predicate from the source container.

              If cloner throws, all cloned elements are unlinked and disposed calling Disposer::operator()(pointer).

              @@ -388,7 +388,7 @@

              Note: This version can modify the source container, useful to implement move semantics. Additional notes: it also copies the alpha factor from the source container.

            23. -
              std::pair< iterator, bool > insert(reference value);
              +
              std::pair< iterator, bool > insert(reference value);

              Requires: value must be an lvalue

              Effects: Inserts value into the container if the value is not already present.

              Complexity: Average complexity for insert element is at most logarithmic.

              @@ -396,7 +396,7 @@

              Note: Does not affect the validity of iterators and references. No copy-constructors are called.

            24. -
              iterator insert(const_iterator hint, reference value);
              +
              iterator insert(const_iterator hint, reference value);

              Requires: value must be an lvalue, and "hint" must be a valid iterator

              Effects: Tries to insert x into the container, using "hint" as a hint to where it will be inserted.

              Complexity: Logarithmic in general, but it is amortized constant time (two comparisons in the worst case) if t is inserted immediately before hint.

              @@ -405,7 +405,7 @@ 
            25. std::pair< iterator, bool > 
-insert_check(const key_type & key, insert_commit_data & commit_data);
              +insert_check(const key_type & key, insert_commit_data & commit_data);

              Effects: Checks if a value can be inserted in the container, using a user provided key instead of the value itself.

              Returns: If there is an equivalent value returns a pair containing an iterator to the already present value and false. If the value can be inserted returns true in the returned pair boolean and fills "commit_data" that is meant to be used with the "insert_commit" function.

              Complexity: Average complexity is at most logarithmic.

              @@ -413,7 +413,7 @@ 
            26. std::pair< iterator, bool > 
-insert_check(const_iterator hint, const key_type & key, 
+insert_check(const_iterator hint, const key_type & key, 
              insert_commit_data & commit_data);

              Effects: Checks if a value can be inserted in the container, using a user provided key instead of the value itself, using "hint" as a hint to where it will be inserted.

              Returns: If there is an equivalent value returns a pair containing an iterator to the already present value and false. If the value can be inserted returns true in the returned pair boolean and fills "commit_data" that is meant to be used with the "insert_commit" function.

              @@ -423,7 +423,7 @@ 
            27. template<typename KeyType, typename KeyTypeKeyCompare> 
   std::pair< iterator, bool > 
-  insert_check(const KeyType & key, KeyTypeKeyCompare comp, 
+  insert_check(const KeyType & key, KeyTypeKeyCompare comp, 
                insert_commit_data & commit_data);

              Requires: comp must be a comparison function that induces the same strict weak ordering as key_compare. The difference is that comp compares an arbitrary key with the contained values.

              Effects: Checks if a value can be inserted in the container, using a user provided key instead of the value itself.

              @@ -437,7 +437,7 @@ 
            28. template<typename KeyType, typename KeyTypeKeyCompare> 
   std::pair< iterator, bool > 
-  insert_check(const_iterator hint, const KeyType & key, 
+  insert_check(const_iterator hint, const KeyType & key, 
                KeyTypeKeyCompare comp, insert_commit_data & commit_data);

              Requires: comp must be a comparison function that induces the same strict weak ordering as key_compare. The difference is that comp compares an arbitrary key with the contained values.

              Effects: Checks if a value can be inserted in the container, using a user provided key instead of the value itself, using "hint" as a hint to where it will be inserted.

              @@ -449,7 +449,7 @@

              "commit_data" remains valid for a subsequent "insert_commit" only if no more objects are inserted or erased from the container.

            29. -
              template<typename Iterator> void insert(Iterator b, Iterator e);
              +
              template<typename Iterator> void insert(Iterator b, Iterator e);

              Requires: Dereferencing iterator must yield an lvalue of type value_type.

              Effects: Tries to insert each element of a range into the container.

              Complexity: Insert range is in general O(N * log(N)), where N is the size of the range. However, it is linear in N if the range is already sorted by value_comp().

              @@ -457,7 +457,7 @@

              Note: Does not affect the validity of iterators and references. No copy-constructors are called.

            30. -
              iterator insert_commit(reference value, 
+
              iterator insert_commit(reference value, 
                        const insert_commit_data & commit_data);
              
 
              Requires: value must be an lvalue of type value_type. commit_data must have been obtained from a previous call to "insert_check". No objects should have been inserted or erased from the container between the "insert_check" that filled "commit_data" and the call to "insert_commit".
              
 
              Effects: Inserts the value in the container using the information obtained from the "commit_data" that a previous "insert_check" filled.
              
@@ -467,7 +467,7 @@
 
              Notes: This function has only sense if a "insert_check" has been previously executed to fill "commit_data". No value should be inserted or erased between the "insert_check" and "insert_commit" calls.
            31. -
              iterator insert_before(const_iterator pos, reference value);
              +
              iterator insert_before(const_iterator pos, reference value);

              Requires: value must be an lvalue, "pos" must be a valid iterator (or end) and must be the succesor of value once inserted according to the predicate

              Effects: Inserts x into the container before "pos".

              Complexity: Constant time.

              @@ -475,7 +475,7 @@

              Note: This function does not check preconditions so if "pos" is not the successor of "value" container ordering invariant will be broken. This is a low-level function to be used only for performance reasons by advanced users.

            32. -
              void push_back(reference value);
              +
              void push_back(reference value);

              Requires: value must be an lvalue, and it must be no less than the greatest inserted key

              Effects: Inserts x into the container in the last position.

              Complexity: Constant time.

              @@ -483,7 +483,7 @@

              Note: This function does not check preconditions so if value is less than the greatest inserted key container ordering invariant will be broken. This function is slightly more efficient than using "insert_before". This is a low-level function to be used only for performance reasons by advanced users.

            33. -
              void push_front(reference value);
              +
              void push_front(reference value);

              Requires: value must be an lvalue, and it must be no greater than the minimum inserted key

              Effects: Inserts x into the container in the first position.

              Complexity: Constant time.

              @@ -491,21 +491,21 @@

              Note: This function does not check preconditions so if value is greater than the minimum inserted key container ordering invariant will be broken. This function is slightly more efficient than using "insert_before". This is a low-level function to be used only for performance reasons by advanced users.

            34. -
              iterator erase(const_iterator i);
              +
              iterator erase(const_iterator i);

              Effects: Erases the element pointed to by i.

              Complexity: Average complexity for erase element is constant time.

              Throws: Nothing.

              Note: Invalidates the iterators (but not the references) to the erased elements. No destructors are called.

            35. -
              iterator erase(const_iterator b, const_iterator e);
              +
              iterator erase(const_iterator b, const_iterator e);

              Effects: Erases the range pointed to by b end e.

              Complexity: Average complexity for erase range is at most O(log(size() + N)), where N is the number of elements in the range.

              Throws: Nothing.

              Note: Invalidates the iterators (but not the references) to the erased elements. No destructors are called.

            36. -
              size_type erase(const key_type & key);
              +
              size_type erase(const key_type & key);

              Effects: Erases all the elements with the given value.

              Returns: The number of erased elements.

              Complexity: O(log(size() + N).

              @@ -514,7 +514,7 @@ 
            37. template<typename KeyType, typename KeyTypeKeyCompare> 
-  size_type erase(const KeyType & key, KeyTypeKeyCompare comp);
              + size_type erase(const KeyType & key, KeyTypeKeyCompare comp);

              Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk), with nk the key_type of a value_type inserted into *this.

              Effects: Erases all the elements with the given key. according to the comparison functor "comp".

              Returns: The number of erased elements.

              @@ -524,7 +524,7 @@ 
            38. template<typename Disposer> 
-  iterator erase_and_dispose(const_iterator i, Disposer disposer);
              + iterator erase_and_dispose(const_iterator i, Disposer disposer);

              Requires: Disposer::operator()(pointer) shouldn't throw.

              Effects: Erases the element pointed to by i. Disposer::operator()(pointer) is called for the removed element.

              Complexity: Average complexity for erase element is constant time.

              @@ -533,7 +533,7 @@ 
            39. template<typename Disposer> 
-  iterator erase_and_dispose(const_iterator b, const_iterator e, 
+  iterator erase_and_dispose(const_iterator b, const_iterator e, 
                              Disposer disposer);

              Requires: Disposer::operator()(pointer) shouldn't throw.

              Effects: Erases the range pointed to by b end e. Disposer::operator()(pointer) is called for the removed elements.

              @@ -543,7 +543,7 @@ 
            40. template<typename Disposer> 
-  size_type erase_and_dispose(const key_type & key, Disposer disposer);
              + size_type erase_and_dispose(const key_type & key, Disposer disposer);

              Requires: Disposer::operator()(pointer) shouldn't throw.

              Effects: Erases all the elements with the given value. Disposer::operator()(pointer) is called for the removed elements.

              Returns: The number of erased elements.

              @@ -553,7 +553,7 @@ 
            41. template<typename KeyType, typename KeyTypeKeyCompare, typename Disposer> 
-  size_type erase_and_dispose(const KeyType & key, KeyTypeKeyCompare comp, 
+  size_type erase_and_dispose(const KeyType & key, KeyTypeKeyCompare comp, 
                               Disposer disposer);

              Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk) and nk the key_type of a value_type inserted into *this.

              Requires: Disposer::operator()(pointer) shouldn't throw.

              @@ -564,47 +564,47 @@

              Note: Invalidates the iterators to the erased elements.

            42. -
              void clear();
              +
              void clear();

              Effects: Erases all of the elements.

              Complexity: Linear to the number of elements on the container. if it's a safe-mode or auto-unlink value_type. Constant time otherwise.

              Throws: Nothing.

              Note: Invalidates the iterators (but not the references) to the erased elements. No destructors are called.

            43. -
              template<typename Disposer> void clear_and_dispose(Disposer disposer);
              +
              template<typename Disposer> void clear_and_dispose(Disposer disposer);

              Effects: Erases all of the elements calling disposer(p) for each node to be erased. Complexity: Average complexity for is at most O(log(size() + N)), where N is the number of elements in the container.

              Throws: Nothing.

              Note: Invalidates the iterators (but not the references) to the erased elements. Calls N times to disposer functor.

            44. -
              size_type count(const key_type & key) const;
              +
              size_type count(const key_type & key) const;

              Effects: Returns the number of contained elements with the given value

              Complexity: Logarithmic to the number of elements contained plus lineal to number of objects with the given value.

              Throws: If key_compare throws. 

            45. template<typename KeyType, typename KeyTypeKeyCompare> 
-  size_type count(const KeyType & key, KeyTypeKeyCompare comp) const;
              + size_type count(const KeyType & key, KeyTypeKeyCompare comp) const;

              Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk), and nk the key_type of a value_type inserted into *this.

              Effects: Returns the number of contained elements with the given key

              Complexity: Logarithmic to the number of elements contained plus lineal to number of objects with the given key.

              Throws: If comp throws.

            46. -
              iterator lower_bound(const key_type & key);
              +
              iterator lower_bound(const key_type & key);

              Effects: Returns an iterator to the first element whose key is not less than k or end() if that element does not exist.

              Complexity: Logarithmic.

              Throws: If key_compare throws. 

            47. template<typename KeyType, typename KeyTypeKeyCompare> 
-  iterator lower_bound(const KeyType & key, KeyTypeKeyCompare comp);
              + iterator lower_bound(const KeyType & key, KeyTypeKeyCompare comp);

              Effects: Returns an iterator to the first element whose key is not less than k or end() if that element does not exist.

              Complexity: Logarithmic.

              Throws: If key_compare throws.

            48. -
              const_iterator lower_bound(const key_type & key) const;
              +
              const_iterator lower_bound(const key_type & key) const;

              Effects: Returns an iterator to the first element whose key is not less than k or end() if that element does not exist.

              Complexity: Logarithmic.

              Throws: If key_compare throws.

              @@ -612,27 +612,27 @@ 
            49. template<typename KeyType, typename KeyTypeKeyCompare> 
   const_iterator 
-  lower_bound(const KeyType & key, KeyTypeKeyCompare comp) const;
              + lower_bound(const KeyType & key, KeyTypeKeyCompare comp) const;

              Effects: Returns an iterator to the first element whose key is not less than k or end() if that element does not exist.

              Complexity: Logarithmic.

              Throws: If key_compare throws.

            50. -
              iterator upper_bound(const key_type & key);
              +
              iterator upper_bound(const key_type & key);

              Effects: Returns an iterator to the first element whose key is greater than k or end() if that element does not exist.

              Complexity: Logarithmic.

              Throws: If key_compare throws. 

            51. template<typename KeyType, typename KeyTypeKeyCompare> 
-  iterator upper_bound(const KeyType & key, KeyTypeKeyCompare comp);
              + iterator upper_bound(const KeyType & key, KeyTypeKeyCompare comp);

              Requires: key is a value such that *this is partitioned with respect to !comp(key, nk), with nk the key_type of a value_type inserted into *this.

              Effects: Returns an iterator to the first element whose key is greater than k according to comp or end() if that element does not exist.

              Complexity: Logarithmic.

              Throws: If comp throws.

            52. -
              const_iterator upper_bound(const key_type & key) const;
              +
              const_iterator upper_bound(const key_type & key) const;

              Effects: Returns an iterator to the first element whose key is greater than k or end() if that element does not exist.

              Complexity: Logarithmic.

              Throws: If key_compare throws.

              @@ -640,42 +640,42 @@ 
            53. template<typename KeyType, typename KeyTypeKeyCompare> 
   const_iterator 
-  upper_bound(const KeyType & key, KeyTypeKeyCompare comp) const;
              + upper_bound(const KeyType & key, KeyTypeKeyCompare comp) const;

              Requires: key is a value such that *this is partitioned with respect to !comp(key, nk), with nk the key_type of a value_type inserted into *this.

              Effects: Returns an iterator to the first element whose key is greater than k according to comp or end() if that element does not exist.

              Complexity: Logarithmic.

              Throws: If comp throws.

            54. -
              iterator find(const key_type & key);
              +
              iterator find(const key_type & key);

              Effects: Finds an iterator to the first element whose key is k or end() if that element does not exist.

              Complexity: Logarithmic.

              Throws: If key_compare throws. 

            55. template<typename KeyType, typename KeyTypeKeyCompare> 
-  iterator find(const KeyType & key, KeyTypeKeyCompare comp);
              + iterator find(const KeyType & key, KeyTypeKeyCompare comp);

              Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk), and nk the key_type of a value_type inserted into *this.

              Effects: Finds an iterator to the first element whose key is k or end() if that element does not exist.

              Complexity: Logarithmic.

              Throws: If comp throws.

            56. -
              const_iterator find(const key_type & key) const;
              +
              const_iterator find(const key_type & key) const;

              Effects: Finds an iterator to the first element whose key is k or end() if that element does not exist.

              Complexity: Logarithmic.

              Throws: If key_compare throws. 

            57. template<typename KeyType, typename KeyTypeKeyCompare> 
-  const_iterator find(const KeyType & key, KeyTypeKeyCompare comp) const;
              + const_iterator find(const KeyType & key, KeyTypeKeyCompare comp) const;

              Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk), and nk the key_type of a value_type inserted into *this.

              Effects: Finds an iterator to the first element whose key is k or end() if that element does not exist.

              Complexity: Logarithmic.

              Throws: If comp throws.

            58. -
              std::pair< iterator, iterator > equal_range(const key_type & key);
              +
              std::pair< iterator, iterator > equal_range(const key_type & key);

              Effects: Finds a range containing all elements whose key is k or an empty range that indicates the position where those elements would be if they there is no elements with key k.

              Complexity: Logarithmic.

              Throws: If key_compare throws.

              @@ -683,7 +683,7 @@ 
            59. template<typename KeyType, typename KeyTypeKeyCompare> 
   std::pair< iterator, iterator > 
-  equal_range(const KeyType & key, KeyTypeKeyCompare comp);
              + equal_range(const KeyType & key, KeyTypeKeyCompare comp);

              Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk), with nk the key_type of a value_type inserted into *this.

              Effects: Finds a range containing all elements whose key is k or an empty range that indicates the position where those elements would be if they there is no elements with key k.

              Complexity: Logarithmic.

              @@ -691,7 +691,7 @@ 
            60. std::pair< const_iterator, const_iterator > 
-equal_range(const key_type & key) const;
              +equal_range(const key_type & key) const;

              Effects: Finds a range containing all elements whose key is k or an empty range that indicates the position where those elements would be if they there is no elements with key k.

              Complexity: Logarithmic.

              Throws: If key_compare throws.

              @@ -699,7 +699,7 @@ 
            61. template<typename KeyType, typename KeyTypeKeyCompare> 
   std::pair< const_iterator, const_iterator > 
-  equal_range(const KeyType & key, KeyTypeKeyCompare comp) const;
              + equal_range(const KeyType & key, KeyTypeKeyCompare comp) const;

              Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk), with nk the key_type of a value_type inserted into *this.

              Effects: Finds a range containing all elements whose key is k or an empty range that indicates the position where those elements would be if they there is no elements with key k.

              Complexity: Logarithmic.

              @@ -707,7 +707,7 @@ 
            62. std::pair< iterator, iterator > 
-bounded_range(const key_type & lower_key, const key_type & upper_key, 
+bounded_range(const key_type & lower_key, const key_type & upper_key, 
               bool left_closed, bool right_closed);

              Requires: upper_key shall not precede lower_key according to key_compare. [key_comp()(upper_key, lower_key) shall be false]

              If lower_key is equivalent to upper_key [!key_comp()(upper_key, lower_key) && !key_comp()(lower_key, upper_key)] then ('left_closed' || 'right_closed') must be false.

              @@ -722,7 +722,7 @@ 
            63. template<typename KeyType, typename KeyTypeKeyCompare> 
   std::pair< iterator, iterator > 
-  bounded_range(const KeyType & lower_key, const KeyType & upper_key, 
+  bounded_range(const KeyType & lower_key, const KeyType & upper_key, 
                 KeyTypeKeyCompare comp, bool left_closed, bool right_closed);

              Requires: lower_key is a value such that *this is partitioned with respect to comp(nk, lower_key) if left_closed is true, with respect to !comp(lower_key, nk) otherwise.

              upper_key is a value such that *this is partitioned with respect to !comp(upper_key, nk) if right_closed is true, with respect to comp(nk, upper_key) otherwise.

              @@ -738,7 +738,7 @@ 
            64. std::pair< const_iterator, const_iterator > 
-bounded_range(const key_type & lower_key, const key_type & upper_key, 
+bounded_range(const key_type & lower_key, const key_type & upper_key, 
               bool left_closed, bool right_closed) const;

              Requires: upper_key shall not precede lower_key according to key_compare. [key_comp()(upper_key, lower_key) shall be false]

              If lower_key is equivalent to upper_key [!key_comp()(upper_key, lower_key) && !key_comp()(lower_key, upper_key)] then ('left_closed' || 'right_closed') must be false.

              @@ -753,7 +753,7 @@ 
            65. template<typename KeyType, typename KeyTypeKeyCompare> 
   std::pair< const_iterator, const_iterator > 
-  bounded_range(const KeyType & lower_key, const KeyType & upper_key, 
+  bounded_range(const KeyType & lower_key, const KeyType & upper_key, 
                 KeyTypeKeyCompare comp, bool left_closed, bool right_closed) const;

              Requires: lower_key is a value such that *this is partitioned with respect to comp(nk, lower_key) if left_closed is true, with respect to !comp(lower_key, nk) otherwise.

              upper_key is a value such that *this is partitioned with respect to !comp(upper_key, nk) if right_closed is true, with respect to comp(nk, upper_key) otherwise.

              @@ -768,28 +768,28 @@

              Note: Experimental function, the interface might change in future releases.

            66. -
              iterator iterator_to(reference value);
              +
              iterator iterator_to(reference value);

              Requires: value must be an lvalue and shall be in a set of appropriate type. Otherwise the behavior is undefined.

              Effects: Returns: a valid iterator i belonging to the set that points to the value

              Complexity: Constant.

              Throws: Nothing.

            67. -
              const_iterator iterator_to(const_reference value) const;
              +
              const_iterator iterator_to(const_reference value) const;

              Requires: value must be an lvalue and shall be in a set of appropriate type. Otherwise the behavior is undefined.

              Effects: Returns: a valid const_iterator i belonging to the set that points to the value

              Complexity: Constant.

              Throws: Nothing.

            68. -
              pointer unlink_leftmost_without_rebalance();
              +
              pointer unlink_leftmost_without_rebalance();

              Effects: Unlinks the leftmost node from the container.

              Complexity: Average complexity is constant time.

              Throws: Nothing.

              Notes: This function breaks the container and the container can only be used for more unlink_leftmost_without_rebalance calls. This function is normally used to achieve a step by step controlled destruction of the container.

            69. -
              void replace_node(iterator replace_this, reference with_this);
              +
              void replace_node(iterator replace_this, reference with_this);

              Requires: replace_this must be a valid iterator of *this and with_this must not be inserted in any container.

              Effects: Replaces replace_this in its position in the container with with_this. The container does not need to be rebalanced.

              Complexity: Constant.

              @@ -797,7 +797,7 @@

              Note: This function will break container ordering invariants if with_this is not equivalent to *replace_this according to the ordering rules. This function is faster than erasing and inserting the node, since no rebalancing or comparison is needed.

            70. -
              void remove_node(reference value);
              +
              void remove_node(reference value);

              Effects: removes "value" from the container.

              Throws: Nothing.

              Complexity: Logarithmic time.

              @@ -805,13 +805,13 @@

              If the user calls this function with a constant time size container or stateful comparison functor a compilation error will be issued.

            71. -
              void rebalance();
              +
              void rebalance();

              Effects: Rebalances the tree.

              Throws: Nothing.

              Complexity: Linear.

            72. -
              iterator rebalance_subtree(iterator root);
              +
              iterator rebalance_subtree(iterator root);

              Requires: old_root is a node of a tree.

              Effects: Rebalances the subtree rooted at old_root.

              Returns: The new root of the subtree.

              @@ -819,20 +819,20 @@

              Complexity: Linear to the elements in the subtree.

            73. -
              float balance_factor() const;
              +
              float balance_factor() const;

              Returns: The balance factor (alpha) used in this tree

              Throws: Nothing.

              Complexity: Constant.

            74. -
              void balance_factor(float new_alpha);
              +
              void balance_factor(float new_alpha);

              Requires: new_alpha must be a value between 0.5 and 1.0

              Effects: Establishes a new balance factor (alpha) and rebalances the tree if the new balance factor is stricter (less) than the old factor.

              Throws: Nothing.

              Complexity: Linear to the elements in the subtree.

            75. -
              template<class... Options2> void merge(sg_set< T, Options2...> & source);
              +
              template<class... Options2> void merge(sg_set< T, Options2...> & source);

              Requires: "source" container's Options can only can differ in the comparison function from *this.

              Effects: Attempts to extract each element in source and insert it into a using the comparison object of *this. If there is an element in a with key equivalent to the key of an element from source, then that element is not extracted from source.

              Postcondition: Pointers and references to the transferred elements of source refer to those same elements but as members of *this. Iterators referring to the transferred elements will continue to refer to their elements, but they now behave as iterators into *this, not into source.

              @@ -840,7 +840,7 @@

              Complexity: N log(a.size() + N) (N has the value source.size())

            76. -
              template<class... Options2> void merge(sg_multiset< T, Options2...> & source);
              +
              template<class... Options2> void merge(sg_multiset< T, Options2...> & source);

              Requires: "source" container's Options can only can differ in the comparison function from *this.

              Effects: Attempts to extract each element in source and insert it into a using the comparison object of *this. If there is an element in a with key equivalent to the key of an element from source, then that element is not extracted from source.

              Postcondition: Pointers and references to the transferred elements of source refer to those same elements but as members of *this. Iterators referring to the transferred elements will continue to refer to their elements, but they now behave as iterators into *this, not into source.

              @@ -851,38 +851,38 @@

            -sg_set public static functions

            +sg_set public static functions
            1. -
              static sg_set & container_from_end_iterator(iterator end_iterator);
              +
              static sg_set & container_from_end_iterator(iterator end_iterator);

              Precondition: end_iterator must be a valid end iterator of the container.

              Effects: Returns a const reference to the container associated to the end iterator

              Throws: Nothing.

              Complexity: Constant.

            2. -
              static const sg_set & container_from_end_iterator(const_iterator end_iterator);
              +
              static const sg_set & container_from_end_iterator(const_iterator end_iterator);

              Precondition: end_iterator must be a valid end iterator of the container.

              Effects: Returns a const reference to the container associated to the end iterator

              Throws: Nothing.

              Complexity: Constant.

            3. -
              static sg_set & container_from_iterator(iterator it);
              +
              static sg_set & container_from_iterator(iterator it);

              Precondition: it must be a valid iterator of the container.

              Effects: Returns a const reference to the container associated to the iterator

              Throws: Nothing.

              Complexity: Logarithmic.

            4. -
              static const sg_set & container_from_iterator(const_iterator it);
              +
              static const sg_set & container_from_iterator(const_iterator it);

              Precondition: it must be a valid iterator of the container.

              Effects: Returns a const reference to the container associated to the iterator

              Throws: Nothing.

              Complexity: Logarithmic.

            5. -
              static iterator s_iterator_to(reference value);
              +
              static iterator s_iterator_to(reference value);

              Requires: value must be an lvalue and shall be in a set of appropriate type. Otherwise the behavior is undefined.

              Effects: Returns: a valid iterator i belonging to the set that points to the value

              Complexity: Constant.

              @@ -890,7 +890,7 @@

              Note: This static function is available only if the value traits is stateless.

            6. -
              static const_iterator s_iterator_to(const_reference value);
              +
              static const_iterator s_iterator_to(const_reference value);

              Requires: value must be an lvalue and shall be in a set of appropriate type. Otherwise the behavior is undefined.

              Effects: Returns: a valid iterator i belonging to the set that points to the value

              Complexity: Constant.

              @@ -898,7 +898,7 @@

              Note: This static function is available only if the value traits is stateless.

            7. -
              static void init_node(reference value);
              +
              static void init_node(reference value);

              Requires: value shall not be in a container.

              Effects: init_node puts the hook of a value in a well-known default state.

              Throws: Nothing.

              diff --git a/doc/html/boost/intrusive/sgtree.html b/doc/html/boost/intrusive/sgtree.html index 9e4cdabd88..4a675c49f0 100644 --- a/doc/html/boost/intrusive/sgtree.html +++ b/doc/html/boost/intrusive/sgtree.html @@ -60,143 +60,143 @@ typedef implementation_defined insert_commit_data; // construct/copy/destruct - sgtree(); - explicit sgtree(const key_compare &, const value_traits & = value_traits()); + sgtree(); + explicit sgtree(const key_compare &, const value_traits & = value_traits()); template<typename Iterator> - sgtree(bool, Iterator, Iterator, const key_compare & = key_compare(), + sgtree(bool, Iterator, Iterator, const key_compare & = key_compare(), const value_traits & = value_traits()); - sgtree(sgtree &&); - sgtree & operator=(sgtree &&); - ~sgtree(); + sgtree(sgtree &&); + sgtree & operator=(sgtree &&); + ~sgtree(); - // public member functions - iterator begin(); - const_iterator begin() const; - const_iterator cbegin() const; - iterator end(); - const_iterator end() const; - const_iterator cend() const; - reverse_iterator rbegin(); - const_reverse_iterator rbegin() const; - const_reverse_iterator crbegin() const; - reverse_iterator rend(); - const_reverse_iterator rend() const; - const_reverse_iterator crend() const; - iterator root(); - const_iterator root() const; - const_iterator croot() const; - key_compare key_comp() const; - value_compare value_comp() const; - bool empty() const; - size_type size() const; - void swap(sgtree &); + // public member functions + iterator begin(); + const_iterator begin() const; + const_iterator cbegin() const; + iterator end(); + const_iterator end() const; + const_iterator cend() const; + reverse_iterator rbegin(); + const_reverse_iterator rbegin() const; + const_reverse_iterator crbegin() const; + reverse_iterator rend(); + const_reverse_iterator rend() const; + const_reverse_iterator crend() const; + iterator root(); + const_iterator root() const; + const_iterator croot() const; + key_compare key_comp() const; + value_compare value_comp() const; + bool empty() const; + size_type size() const; + void swap(sgtree &); template<typename Cloner, typename Disposer> - void clone_from(const sgtree &, Cloner, Disposer); + void clone_from(const sgtree &, Cloner, Disposer); template<typename Cloner, typename Disposer> - void clone_from(sgtree &&, Cloner, Disposer); - iterator insert_equal(reference); - iterator insert_equal(const_iterator, reference); - template<typename Iterator> void insert_equal(Iterator, Iterator); - std::pair< iterator, bool > insert_unique(reference); - iterator insert_unique(const_iterator, reference); + void clone_from(sgtree &&, Cloner, Disposer); + iterator insert_equal(reference); + iterator insert_equal(const_iterator, reference); + template<typename Iterator> void insert_equal(Iterator, Iterator); + std::pair< iterator, bool > insert_unique(reference); + iterator insert_unique(const_iterator, reference); template<typename KeyType, typename KeyTypeKeyCompare> std::pair< iterator BOOST_INTRUSIVE_I bool > - insert_unique_check(const KeyType &, KeyTypeKeyCompare, + insert_unique_check(const KeyType &, KeyTypeKeyCompare, insert_commit_data &); template<typename KeyType, typename KeyTypeKeyCompare> std::pair< iterator, bool > - insert_unique_check(const_iterator, const KeyType &, KeyTypeKeyCompare, + insert_unique_check(const_iterator, const KeyType &, KeyTypeKeyCompare, insert_commit_data &); std::pair< iterator, bool > - insert_unique_check(const key_type &, insert_commit_data &); + insert_unique_check(const key_type &, insert_commit_data &); std::pair< iterator, bool > - insert_unique_check(const_iterator, const key_type &, insert_commit_data &); - iterator insert_unique_commit(reference, const insert_commit_data &); - template<typename Iterator> void insert_unique(Iterator, Iterator); - iterator insert_before(const_iterator, reference); - void push_back(reference); - void push_front(reference); - iterator erase(const_iterator); - iterator erase(const_iterator, const_iterator); - size_type erase(const key_type &); + insert_unique_check(const_iterator, const key_type &, insert_commit_data &); + iterator insert_unique_commit(reference, const insert_commit_data &); + template<typename Iterator> void insert_unique(Iterator, Iterator); + iterator insert_before(const_iterator, reference); + void push_back(reference); + void push_front(reference); + iterator erase(const_iterator); + iterator erase(const_iterator, const_iterator); + size_type erase(const key_type &); template<typename KeyType, typename KeyTypeKeyCompare> - size_type erase(const KeyType &, KeyTypeKeyCompare); + size_type erase(const KeyType &, KeyTypeKeyCompare); template<typename Disposer> - iterator erase_and_dispose(const_iterator, Disposer); + iterator erase_and_dispose(const_iterator, Disposer); template<typename Disposer> - iterator erase_and_dispose(const_iterator, const_iterator, Disposer); + iterator erase_and_dispose(const_iterator, const_iterator, Disposer); template<typename Disposer> - size_type erase_and_dispose(const key_type &, Disposer); + size_type erase_and_dispose(const key_type &, Disposer); template<typename KeyType, typename KeyTypeKeyCompare, typename Disposer> - size_type erase_and_dispose(const KeyType &, KeyTypeKeyCompare, Disposer); - void clear(); - template<typename Disposer> void clear_and_dispose(Disposer); + size_type erase_and_dispose(const KeyType &, KeyTypeKeyCompare, Disposer); + void clear(); + template<typename Disposer> void clear_and_dispose(Disposer); template<typename T, class... Options2> - void merge_unique(sgtree< T, Options2...> &); - while(it! = itend); + void merge_unique(sgtree< T, Options2...> &); + while(it! = itend); template<typename T, class... Options2> - void merge_equal(sgtree< T, Options2...> &); - while(it! = itend); - size_type count(const key_type &) const; + void merge_equal(sgtree< T, Options2...> &); + while(it! = itend); + size_type count(const key_type &) const; template<typename KeyType, typename KeyTypeKeyCompare> - size_type count(const KeyType &, KeyTypeKeyCompare) const; - iterator lower_bound(const key_type &); + size_type count(const KeyType &, KeyTypeKeyCompare) const; + iterator lower_bound(const key_type &); template<typename KeyType, typename KeyTypeKeyCompare> - iterator lower_bound(const KeyType &, KeyTypeKeyCompare); - const_iterator lower_bound(const key_type &) const; + iterator lower_bound(const KeyType &, KeyTypeKeyCompare); + const_iterator lower_bound(const key_type &) const; template<typename KeyType, typename KeyTypeKeyCompare> - const_iterator lower_bound(const KeyType &, KeyTypeKeyCompare) const; - iterator upper_bound(const key_type &); + const_iterator lower_bound(const KeyType &, KeyTypeKeyCompare) const; + iterator upper_bound(const key_type &); template<typename KeyType, typename KeyTypeKeyCompare> - iterator upper_bound(const KeyType &, KeyTypeKeyCompare); - const_iterator upper_bound(const key_type &) const; + iterator upper_bound(const KeyType &, KeyTypeKeyCompare); + const_iterator upper_bound(const key_type &) const; template<typename KeyType, typename KeyTypeKeyCompare> - const_iterator upper_bound(const KeyType &, KeyTypeKeyCompare) const; - iterator find(const key_type &); + const_iterator upper_bound(const KeyType &, KeyTypeKeyCompare) const; + iterator find(const key_type &); template<typename KeyType, typename KeyTypeKeyCompare> - iterator find(const KeyType &, KeyTypeKeyCompare); - const_iterator find(const key_type &) const; + iterator find(const KeyType &, KeyTypeKeyCompare); + const_iterator find(const key_type &) const; template<typename KeyType, typename KeyTypeKeyCompare> - const_iterator find(const KeyType &, KeyTypeKeyCompare) const; - std::pair< iterator, iterator > equal_range(const key_type &); + const_iterator find(const KeyType &, KeyTypeKeyCompare) const; + std::pair< iterator, iterator > equal_range(const key_type &); template<typename KeyType, typename KeyTypeKeyCompare> std::pair< iterator, iterator > - equal_range(const KeyType &, KeyTypeKeyCompare); + equal_range(const KeyType &, KeyTypeKeyCompare); std::pair< const_iterator, const_iterator > - equal_range(const key_type &) const; + equal_range(const key_type &) const; template<typename KeyType, typename KeyTypeKeyCompare> std::pair< const_iterator, const_iterator > - equal_range(const KeyType &, KeyTypeKeyCompare) const; + equal_range(const KeyType &, KeyTypeKeyCompare) const; std::pair< iterator, iterator > - bounded_range(const key_type &, const key_type &, bool, bool); + bounded_range(const key_type &, const key_type &, bool, bool); template<typename KeyType, typename KeyTypeKeyCompare> std::pair< iterator, iterator > - bounded_range(const KeyType &, const KeyType &, KeyTypeKeyCompare, bool, + bounded_range(const KeyType &, const KeyType &, KeyTypeKeyCompare, bool, bool); std::pair< const_iterator, const_iterator > - bounded_range(const key_type &, const key_type &, bool, bool) const; + bounded_range(const key_type &, const key_type &, bool, bool) const; template<typename KeyType, typename KeyTypeKeyCompare> std::pair< const_iterator, const_iterator > - bounded_range(const KeyType &, const KeyType &, KeyTypeKeyCompare, bool, + bounded_range(const KeyType &, const KeyType &, KeyTypeKeyCompare, bool, bool) const; - iterator iterator_to(reference); - const_iterator iterator_to(const_reference) const; - pointer unlink_leftmost_without_rebalance(); - void replace_node(iterator, reference); - void remove_node(reference); - void rebalance(); - iterator rebalance_subtree(iterator); - float balance_factor() const; - void balance_factor(float); + iterator iterator_to(reference); + const_iterator iterator_to(const_reference) const; + pointer unlink_leftmost_without_rebalance(); + void replace_node(iterator, reference); + void remove_node(reference); + void rebalance(); + iterator rebalance_subtree(iterator); + float balance_factor() const; + void balance_factor(float); - // public static functions - static sgtree & container_from_end_iterator(iterator); - static const sgtree & container_from_end_iterator(const_iterator); - static sgtree & container_from_iterator(iterator); - static const sgtree & container_from_iterator(const_iterator); - static iterator s_iterator_to(reference); - static const_iterator s_iterator_to(const_reference); - static void init_node(reference); + // public static functions + static sgtree & container_from_end_iterator(iterator); + static const sgtree & container_from_end_iterator(const_iterator); + static sgtree & container_from_iterator(iterator); + static const sgtree & container_from_iterator(const_iterator); + static iterator s_iterator_to(reference); + static const_iterator s_iterator_to(const_reference); + static void init_node(reference); // public data members static const bool constant_time_size; @@ -215,13 +215,13 @@ construct/copy/destruct
              1. -
                sgtree();
                +
                sgtree();

                Effects: Constructs an empty container.

                Complexity: Constant.

                Throws: If value_traits::node_traits::node constructor throws (this does not happen with predefined Boost.Intrusive hooks) or the copy constructor of the key_compare object throws. Basic guarantee.

              2. -
                explicit sgtree(const key_compare & cmp, 
+
                explicit sgtree(const key_compare & cmp, 
                 const value_traits & v_traits = value_traits());
                
 
                Effects: Constructs an empty container with given comparison and traits.
                
 
                Complexity: Constant.
                
@@ -229,7 +229,7 @@
 
              3. template<typename Iterator> 
-  sgtree(bool unique, Iterator b, Iterator e, 
+  sgtree(bool unique, Iterator b, Iterator e, 
          const key_compare & cmp = key_compare(), 
          const value_traits & v_traits = value_traits());

                Requires: Dereferencing iterator must yield an lvalue of type value_type. cmp must be a comparison function that induces a strict weak ordering.

                @@ -238,17 +238,17 @@

                Throws: If value_traits::node_traits::node constructor throws (this does not happen with predefined Boost.Intrusive hooks) or the copy constructor/operator() of the key_compare object throws. Basic guarantee.

              4. -
                sgtree(sgtree && x);
                +
                sgtree(sgtree && x);

                Effects: Constructs a container moving resources from another container. Internal comparison object and value traits are move constructed and nodes belonging to x (except the node representing the "end") are linked to *this.

                Complexity: Constant.

                Throws: If value_traits::node_traits::node's move constructor throws (this does not happen with predefined Boost.Intrusive hooks) or the move constructor of the comparison objet throws.

              5. -
                sgtree & operator=(sgtree && x);
                +
                sgtree & operator=(sgtree && x);

                Effects: Equivalent to swap

              6. -
                ~sgtree();
                +
                ~sgtree();

                Effects: Detaches all elements from this. The objects in the set are not deleted (i.e. no destructors are called), but the nodes according to the value_traits template parameter are reinitialized and thus can be reused.

                Complexity: Linear to elements contained in *this.

                Throws: Nothing.

                @@ -257,131 +257,131 @@

              -sgtree public member functions

              +sgtree public member functions
              1. -
                iterator begin();
                +
                iterator begin();

                Effects: Returns an iterator pointing to the beginning of the container.

                Complexity: Constant.

                Throws: Nothing.

              2. -
                const_iterator begin() const;
                +
                const_iterator begin() const;

                Effects: Returns a const_iterator pointing to the beginning of the container.

                Complexity: Constant.

                Throws: Nothing.

              3. -
                const_iterator cbegin() const;
                +
                const_iterator cbegin() const;

                Effects: Returns a const_iterator pointing to the beginning of the container.

                Complexity: Constant.

                Throws: Nothing.

              4. -
                iterator end();
                +
                iterator end();

                Effects: Returns an iterator pointing to the end of the container.

                Complexity: Constant.

                Throws: Nothing.

              5. -
                const_iterator end() const;
                +
                const_iterator end() const;

                Effects: Returns a const_iterator pointing to the end of the container.

                Complexity: Constant.

                Throws: Nothing.

              6. -
                const_iterator cend() const;
                +
                const_iterator cend() const;

                Effects: Returns a const_iterator pointing to the end of the container.

                Complexity: Constant.

                Throws: Nothing.

              7. -
                reverse_iterator rbegin();
                +
                reverse_iterator rbegin();

                Effects: Returns a reverse_iterator pointing to the beginning of the reversed container.

                Complexity: Constant.

                Throws: Nothing.

              8. -
                const_reverse_iterator rbegin() const;
                +
                const_reverse_iterator rbegin() const;

                Effects: Returns a const_reverse_iterator pointing to the beginning of the reversed container.

                Complexity: Constant.

                Throws: Nothing.

              9. -
                const_reverse_iterator crbegin() const;
                +
                const_reverse_iterator crbegin() const;

                Effects: Returns a const_reverse_iterator pointing to the beginning of the reversed container.

                Complexity: Constant.

                Throws: Nothing.

              10. -
                reverse_iterator rend();
                +
                reverse_iterator rend();

                Effects: Returns a reverse_iterator pointing to the end of the reversed container.

                Complexity: Constant.

                Throws: Nothing.

              11. -
                const_reverse_iterator rend() const;
                +
                const_reverse_iterator rend() const;

                Effects: Returns a const_reverse_iterator pointing to the end of the reversed container.

                Complexity: Constant.

                Throws: Nothing.

              12. -
                const_reverse_iterator crend() const;
                +
                const_reverse_iterator crend() const;

                Effects: Returns a const_reverse_iterator pointing to the end of the reversed container.

                Complexity: Constant.

                Throws: Nothing.

              13. -
                iterator root();
                +
                iterator root();

                Effects: Returns a iterator pointing to the root node of the container or end() if not present.

                Complexity: Constant.

                Throws: Nothing.

              14. -
                const_iterator root() const;
                +
                const_iterator root() const;

                Effects: Returns a const_iterator pointing to the root node of the container or cend() if not present.

                Complexity: Constant.

                Throws: Nothing.

              15. -
                const_iterator croot() const;
                +
                const_iterator croot() const;

                Effects: Returns a const_iterator pointing to the root node of the container or cend() if not present.

                Complexity: Constant.

                Throws: Nothing.

              16. -
                key_compare key_comp() const;
                +
                key_compare key_comp() const;

                Effects: Returns the key_compare object used by the container.

                Complexity: Constant.

                Throws: If key_compare copy-constructor throws.

              17. -
                value_compare value_comp() const;
                +
                value_compare value_comp() const;

                Effects: Returns the value_compare object used by the container.

                Complexity: Constant.

                Throws: If value_compare copy-constructor throws.

              18. -
                bool empty() const;
                +
                bool empty() const;

                Effects: Returns true if the container is empty.

                Complexity: Constant.

                Throws: Nothing.

              19. -
                size_type size() const;
                +
                size_type size() const;

                Effects: Returns the number of elements stored in the container.

                Complexity: Linear to elements contained in *this if constant-time size option is disabled. Constant time otherwise.

                Throws: Nothing.

              20. -
                void swap(sgtree & other);
                +
                void swap(sgtree & other);

                Effects: Swaps the contents of two containers.

                Complexity: Constant.

                Throws: If the comparison functor's swap call throws. 

              21. template<typename Cloner, typename Disposer> 
-  void clone_from(const sgtree & src, Cloner cloner, Disposer disposer);
                + void clone_from(const sgtree & src, Cloner cloner, Disposer disposer);

                Requires: Disposer::operator()(pointer) shouldn't throw. Cloner should yield to nodes equivalent to the original nodes.

                Effects: Erases all the elements from *this calling Disposer::operator()(pointer), clones all the elements from src calling Cloner::operator()(const_reference ) and inserts them on *this. Copies the predicate from the source container.

                If cloner throws, all cloned elements are unlinked and disposed calling Disposer::operator()(pointer).

                @@ -390,7 +390,7 @@ 
              22. template<typename Cloner, typename Disposer> 
-  void clone_from(sgtree && src, Cloner cloner, Disposer disposer);
                + void clone_from(sgtree && src, Cloner cloner, Disposer disposer);

                Requires: Disposer::operator()(pointer) shouldn't throw. Cloner should yield to nodes equivalent to the original nodes.

                Effects: Erases all the elements from *this calling Disposer::operator()(pointer), clones all the elements from src calling Cloner::operator()(reference) and inserts them on *this. Copies the predicate from the source container.

                If cloner throws, all cloned elements are unlinked and disposed calling Disposer::operator()(pointer).

                @@ -399,7 +399,7 @@

                Note: This version can modify the source container, useful to implement move semantics. Additional notes: it also copies the alpha factor from the source container.

              23. -
                iterator insert_equal(reference value);
                +
                iterator insert_equal(reference value);

                Requires: value must be an lvalue

                Effects: Inserts value into the container before the upper bound.

                Complexity: Average complexity for insert element is at most logarithmic.

                @@ -407,7 +407,7 @@

                Note: Does not affect the validity of iterators and references. No copy-constructors are called.

              24. -
                iterator insert_equal(const_iterator hint, reference value);
                +
                iterator insert_equal(const_iterator hint, reference value);

                Requires: value must be an lvalue, and "hint" must be a valid iterator.

                Effects: Inserts x into the container, using "hint" as a hint to where it will be inserted. If "hint" is the upper_bound the insertion takes constant time (two comparisons in the worst case)

                Complexity: Logarithmic in general, but it is amortized constant time if t is inserted immediately before hint.

                @@ -415,7 +415,7 @@

                Note: Does not affect the validity of iterators and references. No copy-constructors are called.

              25. -
                template<typename Iterator> void insert_equal(Iterator b, Iterator e);
                +
                template<typename Iterator> void insert_equal(Iterator b, Iterator e);

                Requires: Dereferencing iterator must yield an lvalue of type value_type.

                Effects: Inserts a each element of a range into the container before the upper bound of the key of each element.

                Complexity: Insert range is in general O(N * log(N)), where N is the size of the range. However, it is linear in N if the range is already sorted by value_comp().

                @@ -423,7 +423,7 @@

                Note: Does not affect the validity of iterators and references. No copy-constructors are called.

              26. -
                std::pair< iterator, bool > insert_unique(reference value);
                +
                std::pair< iterator, bool > insert_unique(reference value);

                Requires: value must be an lvalue

                Effects: Inserts value into the container if the value is not already present.

                Complexity: Average complexity for insert element is at most logarithmic.

                @@ -431,7 +431,7 @@

                Note: Does not affect the validity of iterators and references. No copy-constructors are called.

              27. -
                iterator insert_unique(const_iterator hint, reference value);
                +
                iterator insert_unique(const_iterator hint, reference value);

                Requires: value must be an lvalue, and "hint" must be a valid iterator

                Effects: Tries to insert x into the container, using "hint" as a hint to where it will be inserted.

                Complexity: Logarithmic in general, but it is amortized constant time (two comparisons in the worst case) if t is inserted immediately before hint.

                @@ -441,7 +441,7 @@ 
              28. template<typename KeyType, typename KeyTypeKeyCompare> 
   std::pair< iterator BOOST_INTRUSIVE_I bool > 
-  insert_unique_check(const KeyType & key, KeyTypeKeyCompare comp, 
+  insert_unique_check(const KeyType & key, KeyTypeKeyCompare comp, 
                       insert_commit_data & commit_data);

                Requires: comp must be a comparison function that induces the same strict weak ordering as key_compare. The difference is that comp compares an arbitrary key with the contained values.

                Effects: Checks if a value can be inserted in the container, using a user provided key instead of the value itself.

                @@ -455,7 +455,7 @@ 
              29. template<typename KeyType, typename KeyTypeKeyCompare> 
   std::pair< iterator, bool > 
-  insert_unique_check(const_iterator hint, const KeyType & key, 
+  insert_unique_check(const_iterator hint, const KeyType & key, 
                       KeyTypeKeyCompare comp, 
                       insert_commit_data & commit_data);

                Requires: comp must be a comparison function that induces the same strict weak ordering as key_compare. The difference is that comp compares an arbitrary key with the contained values.

                @@ -469,7 +469,7 @@ 
              30. std::pair< iterator, bool > 
-insert_unique_check(const key_type & key, insert_commit_data & commit_data);
                +insert_unique_check(const key_type & key, insert_commit_data & commit_data);

                Effects: Checks if a value can be inserted in the container, using a user provided key instead of the value itself.

                Returns: If there is an equivalent value returns a pair containing an iterator to the already present value and false. If the value can be inserted returns true in the returned pair boolean and fills "commit_data" that is meant to be used with the "insert_commit" function.

                Complexity: Average complexity is at most logarithmic.

                @@ -477,7 +477,7 @@ 
              31. std::pair< iterator, bool > 
-insert_unique_check(const_iterator hint, const key_type & key, 
+insert_unique_check(const_iterator hint, const key_type & key, 
                     insert_commit_data & commit_data);

                Effects: Checks if a value can be inserted in the container, using a user provided key instead of the value itself, using "hint" as a hint to where it will be inserted.

                Returns: If there is an equivalent value returns a pair containing an iterator to the already present value and false. If the value can be inserted returns true in the returned pair boolean and fills "commit_data" that is meant to be used with the "insert_commit" function.

                @@ -485,7 +485,7 @@

                Throws: If the comp ordering function throws. Strong guarantee.

              32. -
                iterator insert_unique_commit(reference value, 
+
                iterator insert_unique_commit(reference value, 
                               const insert_commit_data & commit_data);
                
 
                Requires: value must be an lvalue of type value_type. commit_data must have been obtained from a previous call to "insert_check". No objects should have been inserted or erased from the container between the "insert_check" that filled "commit_data" and the call to "insert_commit".
                
 
                Effects: Inserts the value in the container using the information obtained from the "commit_data" that a previous "insert_check" filled.
                
@@ -495,7 +495,7 @@
 
                Notes: This function has only sense if a "insert_check" has been previously executed to fill "commit_data". No value should be inserted or erased between the "insert_check" and "insert_commit" calls.
              33. -
                template<typename Iterator> void insert_unique(Iterator b, Iterator e);
                +
                template<typename Iterator> void insert_unique(Iterator b, Iterator e);

                Requires: Dereferencing iterator must yield an lvalue of type value_type.

                Effects: Tries to insert each element of a range into the container.

                Complexity: Insert range is in general O(N * log(N)), where N is the size of the range. However, it is linear in N if the range is already sorted by value_comp().

                @@ -503,7 +503,7 @@

                Note: Does not affect the validity of iterators and references. No copy-constructors are called.

              34. -
                iterator insert_before(const_iterator pos, reference value);
                +
                iterator insert_before(const_iterator pos, reference value);

                Requires: value must be an lvalue, "pos" must be a valid iterator (or end) and must be the succesor of value once inserted according to the predicate

                Effects: Inserts x into the container before "pos".

                Complexity: Constant time.

                @@ -511,7 +511,7 @@

                Note: This function does not check preconditions so if "pos" is not the successor of "value" container ordering invariant will be broken. This is a low-level function to be used only for performance reasons by advanced users.

              35. -
                void push_back(reference value);
                +
                void push_back(reference value);

                Requires: value must be an lvalue, and it must be no less than the greatest inserted key

                Effects: Inserts x into the container in the last position.

                Complexity: Constant time.

                @@ -519,7 +519,7 @@

                Note: This function does not check preconditions so if value is less than the greatest inserted key container ordering invariant will be broken. This function is slightly more efficient than using "insert_before". This is a low-level function to be used only for performance reasons by advanced users.

              36. -
                void push_front(reference value);
                +
                void push_front(reference value);

                Requires: value must be an lvalue, and it must be no greater than the minimum inserted key

                Effects: Inserts x into the container in the first position.

                Complexity: Constant time.

                @@ -527,21 +527,21 @@

                Note: This function does not check preconditions so if value is greater than the minimum inserted key container ordering invariant will be broken. This function is slightly more efficient than using "insert_before". This is a low-level function to be used only for performance reasons by advanced users.

              37. -
                iterator erase(const_iterator i);
                +
                iterator erase(const_iterator i);

                Effects: Erases the element pointed to by i.

                Complexity: Average complexity for erase element is constant time.

                Throws: Nothing.

                Note: Invalidates the iterators (but not the references) to the erased elements. No destructors are called.

              38. -
                iterator erase(const_iterator b, const_iterator e);
                +
                iterator erase(const_iterator b, const_iterator e);

                Effects: Erases the range pointed to by b end e.

                Complexity: Average complexity for erase range is at most O(log(size() + N)), where N is the number of elements in the range.

                Throws: Nothing.

                Note: Invalidates the iterators (but not the references) to the erased elements. No destructors are called.

              39. -
                size_type erase(const key_type & key);
                +
                size_type erase(const key_type & key);

                Effects: Erases all the elements with the given value.

                Returns: The number of erased elements.

                Complexity: O(log(size() + N).

                @@ -550,7 +550,7 @@ 
              40. template<typename KeyType, typename KeyTypeKeyCompare> 
-  size_type erase(const KeyType & key, KeyTypeKeyCompare comp);
                + size_type erase(const KeyType & key, KeyTypeKeyCompare comp);

                Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk), with nk the key_type of a value_type inserted into *this.

                Effects: Erases all the elements with the given key. according to the comparison functor "comp".

                Returns: The number of erased elements.

                @@ -560,7 +560,7 @@ 
              41. template<typename Disposer> 
-  iterator erase_and_dispose(const_iterator i, Disposer disposer);
                + iterator erase_and_dispose(const_iterator i, Disposer disposer);

                Requires: Disposer::operator()(pointer) shouldn't throw.

                Effects: Erases the element pointed to by i. Disposer::operator()(pointer) is called for the removed element.

                Complexity: Average complexity for erase element is constant time.

                @@ -569,7 +569,7 @@ 
              42. template<typename Disposer> 
-  iterator erase_and_dispose(const_iterator b, const_iterator e, 
+  iterator erase_and_dispose(const_iterator b, const_iterator e, 
                              Disposer disposer);

                Requires: Disposer::operator()(pointer) shouldn't throw.

                Effects: Erases the range pointed to by b end e. Disposer::operator()(pointer) is called for the removed elements.

                @@ -579,7 +579,7 @@ 
              43. template<typename Disposer> 
-  size_type erase_and_dispose(const key_type & key, Disposer disposer);
                + size_type erase_and_dispose(const key_type & key, Disposer disposer);

                Requires: Disposer::operator()(pointer) shouldn't throw.

                Effects: Erases all the elements with the given value. Disposer::operator()(pointer) is called for the removed elements.

                Returns: The number of erased elements.

                @@ -589,7 +589,7 @@ 
              44. template<typename KeyType, typename KeyTypeKeyCompare, typename Disposer> 
-  size_type erase_and_dispose(const KeyType & key, KeyTypeKeyCompare comp, 
+  size_type erase_and_dispose(const KeyType & key, KeyTypeKeyCompare comp, 
                               Disposer disposer);

                Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk) and nk the key_type of a value_type inserted into *this.

                Requires: Disposer::operator()(pointer) shouldn't throw.

                @@ -600,67 +600,67 @@

                Note: Invalidates the iterators to the erased elements.

              45. -
                void clear();
                +
                void clear();

                Effects: Erases all of the elements.

                Complexity: Linear to the number of elements on the container. if it's a safe-mode or auto-unlink value_type. Constant time otherwise.

                Throws: Nothing.

                Note: Invalidates the iterators (but not the references) to the erased elements. No destructors are called.

              46. -
                template<typename Disposer> void clear_and_dispose(Disposer disposer);
                +
                template<typename Disposer> void clear_and_dispose(Disposer disposer);

                Effects: Erases all of the elements calling disposer(p) for each node to be erased. Complexity: Average complexity for is at most O(log(size() + N)), where N is the number of elements in the container.

                Throws: Nothing.

                Note: Invalidates the iterators (but not the references) to the erased elements. Calls N times to disposer functor. 

              47. template<typename T, class... Options2> 
-  void merge_unique(sgtree< T, Options2...> &);
                + void merge_unique(sgtree< T, Options2...> &);

                Requires: "source" container's Options can only can differ in the comparison function from *this.

                Effects: Attempts to extract each element in source and insert it into a using the comparison object of *this. If there is an element in a with key equivalent to the key of an element from source, then that element is not extracted from source.

                Postcondition: Pointers and references to the transferred elements of source refer to those same elements but as members of *this. Iterators referring to the transferred elements will continue to refer to their elements, but they now behave as iterators into *this, not into source.

                Throws: Nothing unless the comparison object throws.

                Complexity: N log(a.size() + N) (N has the value source.size())

                48. -
              48.  while(it! = itend);
                49. +
              49.  while(it! = itend);
              50. template<typename T, class... Options2> 
-  void merge_equal(sgtree< T, Options2...> &);
                + void merge_equal(sgtree< T, Options2...> &);

                Requires: "source" container's Options can only can differ in the comparison function from *this.

                Effects: Extracts each element in source and insert it into a using the comparison object of *this.

                Postcondition: Pointers and references to the transferred elements of source refer to those same elements but as members of *this. Iterators referring to the transferred elements will continue to refer to their elements, but they now behave as iterators into *this, not into source.

                Throws: Nothing unless the comparison object throws.

                Complexity: N log(a.size() + N) (N has the value source.size())

                51. -
              51.  while(it! = itend);
                52. +
              52.  while(it! = itend);
              53. -
                size_type count(const key_type & key) const;
                +
                size_type count(const key_type & key) const;

                Effects: Returns the number of contained elements with the given value

                Complexity: Logarithmic to the number of elements contained plus lineal to number of objects with the given value.

                Throws: If key_compare throws. 

              54. template<typename KeyType, typename KeyTypeKeyCompare> 
-  size_type count(const KeyType & key, KeyTypeKeyCompare comp) const;
                + size_type count(const KeyType & key, KeyTypeKeyCompare comp) const;

                Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk), and nk the key_type of a value_type inserted into *this.

                Effects: Returns the number of contained elements with the given key

                Complexity: Logarithmic to the number of elements contained plus lineal to number of objects with the given key.

                Throws: If comp throws.

              55. -
                iterator lower_bound(const key_type & key);
                +
                iterator lower_bound(const key_type & key);

                Effects: Returns an iterator to the first element whose key is not less than k or end() if that element does not exist.

                Complexity: Logarithmic.

                Throws: If key_compare throws. 

              56. template<typename KeyType, typename KeyTypeKeyCompare> 
-  iterator lower_bound(const KeyType & key, KeyTypeKeyCompare comp);
                + iterator lower_bound(const KeyType & key, KeyTypeKeyCompare comp);

                Effects: Returns an iterator to the first element whose key is not less than k or end() if that element does not exist.

                Complexity: Logarithmic.

                Throws: If key_compare throws.

              57. -
                const_iterator lower_bound(const key_type & key) const;
                +
                const_iterator lower_bound(const key_type & key) const;

                Effects: Returns an iterator to the first element whose key is not less than k or end() if that element does not exist.

                Complexity: Logarithmic.

                Throws: If key_compare throws.

                @@ -668,27 +668,27 @@ 
              58. template<typename KeyType, typename KeyTypeKeyCompare> 
   const_iterator 
-  lower_bound(const KeyType & key, KeyTypeKeyCompare comp) const;
                + lower_bound(const KeyType & key, KeyTypeKeyCompare comp) const;

                Effects: Returns an iterator to the first element whose key is not less than k or end() if that element does not exist.

                Complexity: Logarithmic.

                Throws: If key_compare throws.

              59. -
                iterator upper_bound(const key_type & key);
                +
                iterator upper_bound(const key_type & key);

                Effects: Returns an iterator to the first element whose key is greater than k or end() if that element does not exist.

                Complexity: Logarithmic.

                Throws: If key_compare throws. 

              60. template<typename KeyType, typename KeyTypeKeyCompare> 
-  iterator upper_bound(const KeyType & key, KeyTypeKeyCompare comp);
                + iterator upper_bound(const KeyType & key, KeyTypeKeyCompare comp);

                Requires: key is a value such that *this is partitioned with respect to !comp(key, nk), with nk the key_type of a value_type inserted into *this.

                Effects: Returns an iterator to the first element whose key is greater than k according to comp or end() if that element does not exist.

                Complexity: Logarithmic.

                Throws: If comp throws.

              61. -
                const_iterator upper_bound(const key_type & key) const;
                +
                const_iterator upper_bound(const key_type & key) const;

                Effects: Returns an iterator to the first element whose key is greater than k or end() if that element does not exist.

                Complexity: Logarithmic.

                Throws: If key_compare throws.

                @@ -696,42 +696,42 @@ 
              62. template<typename KeyType, typename KeyTypeKeyCompare> 
   const_iterator 
-  upper_bound(const KeyType & key, KeyTypeKeyCompare comp) const;
                + upper_bound(const KeyType & key, KeyTypeKeyCompare comp) const;

                Requires: key is a value such that *this is partitioned with respect to !comp(key, nk), with nk the key_type of a value_type inserted into *this.

                Effects: Returns an iterator to the first element whose key is greater than k according to comp or end() if that element does not exist.

                Complexity: Logarithmic.

                Throws: If comp throws.

              63. -
                iterator find(const key_type & key);
                +
                iterator find(const key_type & key);

                Effects: Finds an iterator to the first element whose key is k or end() if that element does not exist.

                Complexity: Logarithmic.

                Throws: If key_compare throws. 

              64. template<typename KeyType, typename KeyTypeKeyCompare> 
-  iterator find(const KeyType & key, KeyTypeKeyCompare comp);
                + iterator find(const KeyType & key, KeyTypeKeyCompare comp);

                Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk), and nk the key_type of a value_type inserted into *this.

                Effects: Finds an iterator to the first element whose key is k or end() if that element does not exist.

                Complexity: Logarithmic.

                Throws: If comp throws.

              65. -
                const_iterator find(const key_type & key) const;
                +
                const_iterator find(const key_type & key) const;

                Effects: Finds an iterator to the first element whose key is k or end() if that element does not exist.

                Complexity: Logarithmic.

                Throws: If key_compare throws. 

              66. template<typename KeyType, typename KeyTypeKeyCompare> 
-  const_iterator find(const KeyType & key, KeyTypeKeyCompare comp) const;
                + const_iterator find(const KeyType & key, KeyTypeKeyCompare comp) const;

                Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk), and nk the key_type of a value_type inserted into *this.

                Effects: Finds an iterator to the first element whose key is k or end() if that element does not exist.

                Complexity: Logarithmic.

                Throws: If comp throws.

              67. -
                std::pair< iterator, iterator > equal_range(const key_type & key);
                +
                std::pair< iterator, iterator > equal_range(const key_type & key);

                Effects: Finds a range containing all elements whose key is k or an empty range that indicates the position where those elements would be if they there is no elements with key k.

                Complexity: Logarithmic.

                Throws: If key_compare throws.

                @@ -739,7 +739,7 @@ 
              68. template<typename KeyType, typename KeyTypeKeyCompare> 
   std::pair< iterator, iterator > 
-  equal_range(const KeyType & key, KeyTypeKeyCompare comp);
                + equal_range(const KeyType & key, KeyTypeKeyCompare comp);

                Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk), with nk the key_type of a value_type inserted into *this.

                Effects: Finds a range containing all elements whose key is k or an empty range that indicates the position where those elements would be if they there is no elements with key k.

                Complexity: Logarithmic.

                @@ -747,7 +747,7 @@ 
              69. std::pair< const_iterator, const_iterator > 
-equal_range(const key_type & key) const;
                +equal_range(const key_type & key) const;

                Effects: Finds a range containing all elements whose key is k or an empty range that indicates the position where those elements would be if they there is no elements with key k.

                Complexity: Logarithmic.

                Throws: If key_compare throws.

                @@ -755,7 +755,7 @@ 
              70. template<typename KeyType, typename KeyTypeKeyCompare> 
   std::pair< const_iterator, const_iterator > 
-  equal_range(const KeyType & key, KeyTypeKeyCompare comp) const;
                + equal_range(const KeyType & key, KeyTypeKeyCompare comp) const;

                Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk), with nk the key_type of a value_type inserted into *this.

                Effects: Finds a range containing all elements whose key is k or an empty range that indicates the position where those elements would be if they there is no elements with key k.

                Complexity: Logarithmic.

                @@ -763,7 +763,7 @@ 
              71. std::pair< iterator, iterator > 
-bounded_range(const key_type & lower_key, const key_type & upper_key, 
+bounded_range(const key_type & lower_key, const key_type & upper_key, 
               bool left_closed, bool right_closed);

                Requires: upper_key shall not precede lower_key according to key_compare. [key_comp()(upper_key, lower_key) shall be false]

                If lower_key is equivalent to upper_key [!key_comp()(upper_key, lower_key) && !key_comp()(lower_key, upper_key)] then ('left_closed' || 'right_closed') must be false.

                @@ -778,7 +778,7 @@ 
              72. template<typename KeyType, typename KeyTypeKeyCompare> 
   std::pair< iterator, iterator > 
-  bounded_range(const KeyType & lower_key, const KeyType & upper_key, 
+  bounded_range(const KeyType & lower_key, const KeyType & upper_key, 
                 KeyTypeKeyCompare comp, bool left_closed, bool right_closed);

                Requires: lower_key is a value such that *this is partitioned with respect to comp(nk, lower_key) if left_closed is true, with respect to !comp(lower_key, nk) otherwise.

                upper_key is a value such that *this is partitioned with respect to !comp(upper_key, nk) if right_closed is true, with respect to comp(nk, upper_key) otherwise.

                @@ -794,7 +794,7 @@ 
              73. std::pair< const_iterator, const_iterator > 
-bounded_range(const key_type & lower_key, const key_type & upper_key, 
+bounded_range(const key_type & lower_key, const key_type & upper_key, 
               bool left_closed, bool right_closed) const;

                Requires: upper_key shall not precede lower_key according to key_compare. [key_comp()(upper_key, lower_key) shall be false]

                If lower_key is equivalent to upper_key [!key_comp()(upper_key, lower_key) && !key_comp()(lower_key, upper_key)] then ('left_closed' || 'right_closed') must be false.

                @@ -809,7 +809,7 @@ 
              74. template<typename KeyType, typename KeyTypeKeyCompare> 
   std::pair< const_iterator, const_iterator > 
-  bounded_range(const KeyType & lower_key, const KeyType & upper_key, 
+  bounded_range(const KeyType & lower_key, const KeyType & upper_key, 
                 KeyTypeKeyCompare comp, bool left_closed, bool right_closed) const;

                Requires: lower_key is a value such that *this is partitioned with respect to comp(nk, lower_key) if left_closed is true, with respect to !comp(lower_key, nk) otherwise.

                upper_key is a value such that *this is partitioned with respect to !comp(upper_key, nk) if right_closed is true, with respect to comp(nk, upper_key) otherwise.

                @@ -824,28 +824,28 @@

                Note: Experimental function, the interface might change in future releases.

              75. -
                iterator iterator_to(reference value);
                +
                iterator iterator_to(reference value);

                Requires: value must be an lvalue and shall be in a set of appropriate type. Otherwise the behavior is undefined.

                Effects: Returns: a valid iterator i belonging to the set that points to the value

                Complexity: Constant.

                Throws: Nothing.

              76. -
                const_iterator iterator_to(const_reference value) const;
                +
                const_iterator iterator_to(const_reference value) const;

                Requires: value must be an lvalue and shall be in a set of appropriate type. Otherwise the behavior is undefined.

                Effects: Returns: a valid const_iterator i belonging to the set that points to the value

                Complexity: Constant.

                Throws: Nothing.

              77. -
                pointer unlink_leftmost_without_rebalance();
                +
                pointer unlink_leftmost_without_rebalance();

                Effects: Unlinks the leftmost node from the container.

                Complexity: Average complexity is constant time.

                Throws: Nothing.

                Notes: This function breaks the container and the container can only be used for more unlink_leftmost_without_rebalance calls. This function is normally used to achieve a step by step controlled destruction of the container.

              78. -
                void replace_node(iterator replace_this, reference with_this);
                +
                void replace_node(iterator replace_this, reference with_this);

                Requires: replace_this must be a valid iterator of *this and with_this must not be inserted in any container.

                Effects: Replaces replace_this in its position in the container with with_this. The container does not need to be rebalanced.

                Complexity: Constant.

                @@ -853,7 +853,7 @@

                Note: This function will break container ordering invariants if with_this is not equivalent to *replace_this according to the ordering rules. This function is faster than erasing and inserting the node, since no rebalancing or comparison is needed.

              79. -
                void remove_node(reference value);
                +
                void remove_node(reference value);

                Effects: removes "value" from the container.

                Throws: Nothing.

                Complexity: Logarithmic time.

                @@ -861,13 +861,13 @@

                If the user calls this function with a constant time size container or stateful comparison functor a compilation error will be issued.

              80. -
                void rebalance();
                +
                void rebalance();

                Effects: Rebalances the tree.

                Throws: Nothing.

                Complexity: Linear.

              81. -
                iterator rebalance_subtree(iterator root);
                +
                iterator rebalance_subtree(iterator root);

                Requires: old_root is a node of a tree.

                Effects: Rebalances the subtree rooted at old_root.

                Returns: The new root of the subtree.

                @@ -875,13 +875,13 @@

                Complexity: Linear to the elements in the subtree.

              82. -
                float balance_factor() const;
                +
                float balance_factor() const;

                Returns: The balance factor (alpha) used in this tree

                Throws: Nothing.

                Complexity: Constant.

              83. -
                void balance_factor(float new_alpha);
                +
                void balance_factor(float new_alpha);

                Requires: new_alpha must be a value between 0.5 and 1.0

                Effects: Establishes a new balance factor (alpha) and rebalances the tree if the new balance factor is stricter (less) than the old factor.

                Throws: Nothing.

                @@ -891,38 +891,38 @@

              -sgtree public static functions

              +sgtree public static functions
              1. -
                static sgtree & container_from_end_iterator(iterator end_iterator);
                +
                static sgtree & container_from_end_iterator(iterator end_iterator);

                Precondition: end_iterator must be a valid end iterator of the container.

                Effects: Returns a const reference to the container associated to the end iterator

                Throws: Nothing.

                Complexity: Constant.

              2. -
                static const sgtree & container_from_end_iterator(const_iterator end_iterator);
                +
                static const sgtree & container_from_end_iterator(const_iterator end_iterator);

                Precondition: end_iterator must be a valid end iterator of the container.

                Effects: Returns a const reference to the container associated to the end iterator

                Throws: Nothing.

                Complexity: Constant.

              3. -
                static sgtree & container_from_iterator(iterator it);
                +
                static sgtree & container_from_iterator(iterator it);

                Precondition: it must be a valid iterator of the container.

                Effects: Returns a const reference to the container associated to the iterator

                Throws: Nothing.

                Complexity: Logarithmic.

              4. -
                static const sgtree & container_from_iterator(const_iterator it);
                +
                static const sgtree & container_from_iterator(const_iterator it);

                Precondition: it must be a valid iterator of the container.

                Effects: Returns a const reference to the container associated to the iterator

                Throws: Nothing.

                Complexity: Logarithmic.

              5. -
                static iterator s_iterator_to(reference value);
                +
                static iterator s_iterator_to(reference value);

                Requires: value must be an lvalue and shall be in a set of appropriate type. Otherwise the behavior is undefined.

                Effects: Returns: a valid iterator i belonging to the set that points to the value

                Complexity: Constant.

                @@ -930,7 +930,7 @@

                Note: This static function is available only if the value traits is stateless.

              6. -
                static const_iterator s_iterator_to(const_reference value);
                +
                static const_iterator s_iterator_to(const_reference value);

                Requires: value must be an lvalue and shall be in a set of appropriate type. Otherwise the behavior is undefined.

                Effects: Returns: a valid iterator i belonging to the set that points to the value

                Complexity: Constant.

                @@ -938,7 +938,7 @@

                Note: This static function is available only if the value traits is stateless.

              7. -
                static void init_node(reference value);
                +
                static void init_node(reference value);

                Requires: value shall not be in a container.

                Effects: init_node puts the hook of a value in a well-known default state.

                Throws: Nothing.

                diff --git a/doc/html/boost/intrusive/sgtree_algorithms.html b/doc/html/boost/intrusive/sgtree_algorithms.html index b9c137211f..98f7e6515e 100644 --- a/doc/html/boost/intrusive/sgtree_algorithms.html +++ b/doc/html/boost/intrusive/sgtree_algorithms.html @@ -49,101 +49,101 @@ std::size_t depth; }; - // public static functions - static node_ptr get_header(const const_node_ptr &); - static node_ptr begin_node(const const_node_ptr &); - static node_ptr end_node(const const_node_ptr &); - static void swap_tree(const node_ptr &, const node_ptr &); - static void swap_nodes(const node_ptr &, const node_ptr &); - static void swap_nodes(const node_ptr &, const node_ptr &, const node_ptr &, + // public static functions + static node_ptr get_header(const const_node_ptr &); + static node_ptr begin_node(const const_node_ptr &); + static node_ptr end_node(const const_node_ptr &); + static void swap_tree(const node_ptr &, const node_ptr &); + static void swap_nodes(const node_ptr &, const node_ptr &); + static void swap_nodes(const node_ptr &, const node_ptr &, const node_ptr &, const node_ptr &); - static void replace_node(const node_ptr &, const node_ptr &); - static void replace_node(const node_ptr &, const node_ptr &, + static void replace_node(const node_ptr &, const node_ptr &); + static void replace_node(const node_ptr &, const node_ptr &, const node_ptr &); - static node_ptr unlink_leftmost_without_rebalance(const node_ptr &); - static bool unique(const const_node_ptr &); - static std::size_t size(const const_node_ptr &); - static node_ptr next_node(const node_ptr &); - static node_ptr prev_node(const node_ptr &); - static void init(const node_ptr &); - static void init_header(const node_ptr &); + static node_ptr unlink_leftmost_without_rebalance(const node_ptr &); + static bool unique(const const_node_ptr &); + static std::size_t size(const const_node_ptr &); + static node_ptr next_node(const node_ptr &); + static node_ptr prev_node(const node_ptr &); + static void init(const node_ptr &); + static void init_header(const node_ptr &); template<typename AlphaByMaxSize> static node_ptr - erase(const node_ptr &, const node_ptr &, std::size_t, std::size_t &, + erase(const node_ptr &, const node_ptr &, std::size_t, std::size_t &, AlphaByMaxSize); template<typename Cloner, typename Disposer> - static void clone(const const_node_ptr &, const node_ptr &, Cloner, + static void clone(const const_node_ptr &, const node_ptr &, Cloner, Disposer); template<typename Disposer> - static void clear_and_dispose(const node_ptr &, Disposer); + static void clear_and_dispose(const node_ptr &, Disposer); template<typename KeyType, typename KeyNodePtrCompare> static node_ptr - lower_bound(const const_node_ptr &, const KeyType &, KeyNodePtrCompare); + lower_bound(const const_node_ptr &, const KeyType &, KeyNodePtrCompare); template<typename KeyType, typename KeyNodePtrCompare> static node_ptr - upper_bound(const const_node_ptr &, const KeyType &, KeyNodePtrCompare); + upper_bound(const const_node_ptr &, const KeyType &, KeyNodePtrCompare); template<typename KeyType, typename KeyNodePtrCompare> static node_ptr - find(const const_node_ptr &, const KeyType &, KeyNodePtrCompare); + find(const const_node_ptr &, const KeyType &, KeyNodePtrCompare); template<typename KeyType, typename KeyNodePtrCompare> static std::pair< node_ptr, node_ptr > - equal_range(const const_node_ptr &, const KeyType &, KeyNodePtrCompare); + equal_range(const const_node_ptr &, const KeyType &, KeyNodePtrCompare); template<typename KeyType, typename KeyNodePtrCompare> static std::pair< node_ptr, node_ptr > - bounded_range(const const_node_ptr &, const KeyType &, const KeyType &, + bounded_range(const const_node_ptr &, const KeyType &, const KeyType &, KeyNodePtrCompare, bool, bool); template<typename KeyType, typename KeyNodePtrCompare> static std::size_t - count(const const_node_ptr &, const KeyType &, KeyNodePtrCompare); + count(const const_node_ptr &, const KeyType &, KeyNodePtrCompare); template<typename NodePtrCompare, typename H_Alpha> static node_ptr - insert_equal_upper_bound(const node_ptr &, const node_ptr &, + insert_equal_upper_bound(const node_ptr &, const node_ptr &, NodePtrCompare, std::size_t, H_Alpha, std::size_t &); template<typename NodePtrCompare, typename H_Alpha> static node_ptr - insert_equal_lower_bound(const node_ptr &, const node_ptr &, + insert_equal_lower_bound(const node_ptr &, const node_ptr &, NodePtrCompare, std::size_t, H_Alpha, std::size_t &); template<typename NodePtrCompare, typename H_Alpha> static node_ptr - insert_equal(const node_ptr &, const node_ptr &, const node_ptr &, + insert_equal(const node_ptr &, const node_ptr &, const node_ptr &, NodePtrCompare, std::size_t, H_Alpha, std::size_t &); template<typename H_Alpha> static node_ptr - insert_before(const node_ptr &, const node_ptr &, const node_ptr &, + insert_before(const node_ptr &, const node_ptr &, const node_ptr &, std::size_t, H_Alpha, std::size_t &); template<typename H_Alpha> - static void push_back(const node_ptr &, const node_ptr &, std::size_t, + static void push_back(const node_ptr &, const node_ptr &, std::size_t, H_Alpha, std::size_t &); template<typename H_Alpha> - static void push_front(const node_ptr &, const node_ptr &, std::size_t, + static void push_front(const node_ptr &, const node_ptr &, std::size_t, H_Alpha, std::size_t &); template<typename KeyType, typename KeyNodePtrCompare> static std::pair< node_ptr, bool > - insert_unique_check(const const_node_ptr &, const KeyType &, + insert_unique_check(const const_node_ptr &, const KeyType &, KeyNodePtrCompare, insert_commit_data &); template<typename KeyType, typename KeyNodePtrCompare> static std::pair< node_ptr, bool > - insert_unique_check(const const_node_ptr &, const node_ptr &, + insert_unique_check(const const_node_ptr &, const node_ptr &, const KeyType &, KeyNodePtrCompare, insert_commit_data &); template<typename H_Alpha> - static void insert_unique_commit(const node_ptr &, const node_ptr &, + static void insert_unique_commit(const node_ptr &, const node_ptr &, const insert_commit_data &, std::size_t, H_Alpha, std::size_t &); template<typename NodePtrCompare, typename H_Alpha, typename AlphaByMaxSize> - static bool transfer_unique(const node_ptr &, NodePtrCompare, std::size_t, + static bool transfer_unique(const node_ptr &, NodePtrCompare, std::size_t, std::size_t &, const node_ptr &, const node_ptr &, std::size_t, std::size_t &, H_Alpha, AlphaByMaxSize); template<typename NodePtrCompare, typename H_Alpha, typename AlphaByMaxSize> - static void transfer_equal(const node_ptr &, NodePtrCompare, std::size_t, + static void transfer_equal(const node_ptr &, NodePtrCompare, std::size_t, std::size_t &, const node_ptr &, const node_ptr &, std::size_t, std::size_t &, H_Alpha, AlphaByMaxSize); - static bool is_header(const const_node_ptr &); - static void rebalance(const node_ptr &); + static bool is_header(const const_node_ptr &); + static void rebalance(const node_ptr &); };

              Description

              @@ -161,38 +161,38 @@

              static void set_right(node_ptr n, node_ptr right);

              -sgtree_algorithms public static functions

              +sgtree_algorithms public static functions
              1. -
                static node_ptr get_header(const const_node_ptr & n);
                +
                static node_ptr get_header(const const_node_ptr & n);

                Requires: 'node' is a node of the tree or a header node.

                Effects: Returns the header of the tree.

                Complexity: Logarithmic.

                Throws: Nothing.

              2. -
                static node_ptr begin_node(const const_node_ptr & header);
                +
                static node_ptr begin_node(const const_node_ptr & header);

                Requires: 'header' is the header node of a tree.

                Effects: Returns the first node of the tree, the header if the tree is empty.

                Complexity: Constant time.

                Throws: Nothing.

              3. -
                static node_ptr end_node(const const_node_ptr & header);
                +
                static node_ptr end_node(const const_node_ptr & header);

                Requires: 'header' is the header node of a tree.

                Effects: Returns the header of the tree.

                Complexity: Constant time.

                Throws: Nothing.

              4. -
                static void swap_tree(const node_ptr & header1, const node_ptr & header2);
                +
                static void swap_tree(const node_ptr & header1, const node_ptr & header2);

                Requires: header1 and header2 must be the header nodes of two trees.

                Effects: Swaps two trees. After the function header1 will contain links to the second tree and header2 will have links to the first tree.

                Complexity: Constant.

                Throws: Nothing.

              5. -
                static void swap_nodes(const node_ptr & node1, const node_ptr & node2);
                +
                static void swap_nodes(const node_ptr & node1, const node_ptr & node2);

                Requires: node1 and node2 can't be header nodes of two trees.

                Effects: Swaps two nodes. After the function node1 will be inserted in the position node2 before the function. node2 will be inserted in the position node1 had before the function.

                Complexity: Logarithmic.

                @@ -201,7 +201,7 @@

                Experimental function

              6. -
                static void swap_nodes(const node_ptr & node1, const node_ptr & header1, 
+
                static void swap_nodes(const node_ptr & node1, const node_ptr & header1, 
                        const node_ptr & node2, const node_ptr & header2);
                
 
                Requires: node1 and node2 can't be header nodes of two trees with header header1 and header2.
                
 
                Effects: Swaps two nodes. After the function node1 will be inserted in the position node2 before the function. node2 will be inserted in the position node1 had before the function.
                
@@ -211,7 +211,7 @@
 
                Experimental function
              7. -
                static void replace_node(const node_ptr & node_to_be_replaced, 
+
                static void replace_node(const node_ptr & node_to_be_replaced, 
                          const node_ptr & new_node);
                
 
                Requires: node_to_be_replaced must be inserted in a tree and new_node must not be inserted in a tree.
                
 
                Effects: Replaces node_to_be_replaced in its position in the tree with new_node. The tree does not need to be rebalanced
                
@@ -220,7 +220,7 @@
 
                Note: This function will break container ordering invariants if new_node is not equivalent to node_to_be_replaced according to the ordering rules. This function is faster than erasing and inserting the node, since no rebalancing and comparison is needed. Experimental function
              8. -
                static void replace_node(const node_ptr & node_to_be_replaced, 
+
                static void replace_node(const node_ptr & node_to_be_replaced, 
                          const node_ptr & header, const node_ptr & new_node);
                
 
                Requires: node_to_be_replaced must be inserted in a tree with header "header" and new_node must not be inserted in a tree.
                
 
                Effects: Replaces node_to_be_replaced in its position in the tree with new_node. The tree does not need to be rebalanced
                
@@ -229,42 +229,42 @@
 
                Note: This function will break container ordering invariants if new_node is not equivalent to node_to_be_replaced according to the ordering rules. This function is faster than erasing and inserting the node, since no rebalancing or comparison is needed. Experimental function
              9. -
                static node_ptr unlink_leftmost_without_rebalance(const node_ptr & header);
                static void unlink(const node_ptr & node);

                Requires: header is the header of a tree.

                +
                static node_ptr unlink_leftmost_without_rebalance(const node_ptr & header);
                static void unlink(const node_ptr & node);

                Requires: header is the header of a tree.

                Effects: Unlinks the leftmost node from the tree, and updates the header link to the new leftmost node.

                Complexity: Average complexity is constant time.

                Throws: Nothing.

                Notes: This function breaks the tree and the tree can only be used for more unlink_leftmost_without_rebalance calls. This function is normally used to achieve a step by step controlled destruction of the tree.

              10. -
                static bool unique(const const_node_ptr & node);
                +
                static bool unique(const const_node_ptr & node);

                Requires: 'node' is a node of the tree or a node initialized by init(...) or init_node.

                Effects: Returns true if the node is initialized by init() or init_node().

                Complexity: Constant time.

                Throws: Nothing.

              11. -
                static std::size_t size(const const_node_ptr & header);
                +
                static std::size_t size(const const_node_ptr & header);

                Requires: node is a node of the tree but it's not the header.

                Effects: Returns the number of nodes of the subtree.

                Complexity: Linear time.

                Throws: Nothing.

              12. -
                static node_ptr next_node(const node_ptr & node);
                +
                static node_ptr next_node(const node_ptr & node);

                Requires: 'node' is a node from the tree except the header.

                Effects: Returns the next node of the tree.

                Complexity: Average constant time.

                Throws: Nothing.

              13. -
                static node_ptr prev_node(const node_ptr & node);
                +
                static node_ptr prev_node(const node_ptr & node);

                Requires: 'node' is a node from the tree except the leftmost node.

                Effects: Returns the previous node of the tree.

                Complexity: Average constant time.

                Throws: Nothing.

              14. -
                static void init(const node_ptr & node);
                +
                static void init(const node_ptr & node);

                Requires: 'node' must not be part of any tree.

                Effects: After the function unique(node) == true.

                Complexity: Constant.

                @@ -272,7 +272,7 @@

                Nodes: If node is inserted in a tree, this function corrupts the tree.

              15. -
                static void init_header(const node_ptr & header);
                +
                static void init_header(const node_ptr & header);

                Requires: node must not be part of any tree.

                Effects: Initializes the header to represent an empty tree. unique(header) == true.

                Complexity: Constant.

                @@ -282,7 +282,7 @@ 
              16. template<typename AlphaByMaxSize> 
   static node_ptr 
-  erase(const node_ptr & header, const node_ptr & z, std::size_t tree_size, 
+  erase(const node_ptr & header, const node_ptr & z, std::size_t tree_size, 
         std::size_t & max_tree_size, AlphaByMaxSize alpha_by_maxsize);

                Requires: header must be the header of a tree, z a node of that tree and z != header.

                Effects: Erases node "z" from the tree with header "header".

                @@ -291,7 +291,7 @@ 
              17. template<typename Cloner, typename Disposer> 
-  static void clone(const const_node_ptr & source_header, 
+  static void clone(const const_node_ptr & source_header, 
                     const node_ptr & target_header, Cloner cloner, 
                     Disposer disposer);

                Requires: "cloner" must be a function object taking a node_ptr and returning a new cloned node of it. "disposer" must take a node_ptr and shouldn't throw.

                @@ -302,7 +302,7 @@ 
              18. template<typename Disposer> 
-  static void clear_and_dispose(const node_ptr & header, Disposer disposer);
                + static void clear_and_dispose(const node_ptr & header, Disposer disposer);

                Requires: "disposer" must be an object function taking a node_ptr parameter and shouldn't throw.

                Effects: Empties the target tree calling void disposer::operator()(const node_ptr &) for every node of the tree except the header.

                Complexity: Linear to the number of element of the source tree plus the. number of elements of tree target tree when calling this function.

                @@ -311,7 +311,7 @@ 
              19. template<typename KeyType, typename KeyNodePtrCompare> 
   static node_ptr 
-  lower_bound(const const_node_ptr & header, const KeyType & key, 
+  lower_bound(const const_node_ptr & header, const KeyType & key, 
               KeyNodePtrCompare comp);

                Requires: "header" must be the header node of a tree. KeyNodePtrCompare is a function object that induces a strict weak ordering compatible with the strict weak ordering used to create the the tree. KeyNodePtrCompare can compare KeyType with tree's node_ptrs.

                Effects: Returns a node_ptr to the first element that is not less than "key" according to "comp" or "header" if that element does not exist.

                @@ -321,7 +321,7 @@ 
              20. template<typename KeyType, typename KeyNodePtrCompare> 
   static node_ptr 
-  upper_bound(const const_node_ptr & header, const KeyType & key, 
+  upper_bound(const const_node_ptr & header, const KeyType & key, 
               KeyNodePtrCompare comp);

                Requires: "header" must be the header node of a tree. KeyNodePtrCompare is a function object that induces a strict weak ordering compatible with the strict weak ordering used to create the the tree. KeyNodePtrCompare can compare KeyType with tree's node_ptrs.

                Effects: Returns a node_ptr to the first element that is greater than "key" according to "comp" or "header" if that element does not exist.

                @@ -331,7 +331,7 @@ 
              21. template<typename KeyType, typename KeyNodePtrCompare> 
   static node_ptr 
-  find(const const_node_ptr & header, const KeyType & key, 
+  find(const const_node_ptr & header, const KeyType & key, 
        KeyNodePtrCompare comp);

                Requires: "header" must be the header node of a tree. KeyNodePtrCompare is a function object that induces a strict weak ordering compatible with the strict weak ordering used to create the the tree. KeyNodePtrCompare can compare KeyType with tree's node_ptrs.

                Effects: Returns a node_ptr to the first element that is equivalent to "key" according to "comp" or "header" if that element does not exist.

                @@ -341,7 +341,7 @@ 
              22. template<typename KeyType, typename KeyNodePtrCompare> 
   static std::pair< node_ptr, node_ptr > 
-  equal_range(const const_node_ptr & header, const KeyType & key, 
+  equal_range(const const_node_ptr & header, const KeyType & key, 
               KeyNodePtrCompare comp);

                Requires: "header" must be the header node of a tree. KeyNodePtrCompare is a function object that induces a strict weak ordering compatible with the strict weak ordering used to create the the tree. KeyNodePtrCompare can compare KeyType with tree's node_ptrs.

                Effects: Returns an a pair of node_ptr delimiting a range containing all elements that are equivalent to "key" according to "comp" or an empty range that indicates the position where those elements would be if there are no equivalent elements.

                @@ -351,7 +351,7 @@ 
              23. template<typename KeyType, typename KeyNodePtrCompare> 
   static std::pair< node_ptr, node_ptr > 
-  bounded_range(const const_node_ptr & header, const KeyType & lower_key, 
+  bounded_range(const const_node_ptr & header, const KeyType & lower_key, 
                 const KeyType & upper_key, KeyNodePtrCompare comp, 
                 bool left_closed, bool right_closed);

                Requires: "header" must be the header node of a tree. KeyNodePtrCompare is a function object that induces a strict weak ordering compatible with the strict weak ordering used to create the the tree. KeyNodePtrCompare can compare KeyType with tree's node_ptrs. 'lower_key' must not be greater than 'upper_key' according to 'comp'. If 'lower_key' == 'upper_key', ('left_closed' || 'right_closed') must be true.

                @@ -366,7 +366,7 @@ 
              24. template<typename KeyType, typename KeyNodePtrCompare> 
   static std::size_t 
-  count(const const_node_ptr & header, const KeyType & key, 
+  count(const const_node_ptr & header, const KeyType & key, 
         KeyNodePtrCompare comp);

                Requires: "header" must be the header node of a tree. KeyNodePtrCompare is a function object that induces a strict weak ordering compatible with the strict weak ordering used to create the the tree. KeyNodePtrCompare can compare KeyType with tree's node_ptrs.

                Effects: Returns the number of elements with a key equivalent to "key" according to "comp".

                @@ -376,7 +376,7 @@ 
              25. template<typename NodePtrCompare, typename H_Alpha> 
   static node_ptr 
-  insert_equal_upper_bound(const node_ptr & h, const node_ptr & new_node, 
+  insert_equal_upper_bound(const node_ptr & h, const node_ptr & new_node, 
                            NodePtrCompare comp, std::size_t tree_size, 
                            H_Alpha h_alpha, std::size_t & max_tree_size);

                Requires: "h" must be the header node of a tree. NodePtrCompare is a function object that induces a strict weak ordering compatible with the strict weak ordering used to create the the tree. NodePtrCompare compares two node_ptrs.

                @@ -387,7 +387,7 @@ 
              26. template<typename NodePtrCompare, typename H_Alpha> 
   static node_ptr 
-  insert_equal_lower_bound(const node_ptr & h, const node_ptr & new_node, 
+  insert_equal_lower_bound(const node_ptr & h, const node_ptr & new_node, 
                            NodePtrCompare comp, std::size_t tree_size, 
                            H_Alpha h_alpha, std::size_t & max_tree_size);

                Requires: "h" must be the header node of a tree. NodePtrCompare is a function object that induces a strict weak ordering compatible with the strict weak ordering used to create the the tree. NodePtrCompare compares two node_ptrs.

                @@ -398,7 +398,7 @@ 
              27. template<typename NodePtrCompare, typename H_Alpha> 
   static node_ptr 
-  insert_equal(const node_ptr & header, const node_ptr & hint, 
+  insert_equal(const node_ptr & header, const node_ptr & hint, 
                const node_ptr & new_node, NodePtrCompare comp, 
                std::size_t tree_size, H_Alpha h_alpha, 
                std::size_t & max_tree_size);
                @@ -410,7 +410,7 @@ 
              28. template<typename H_Alpha> 
   static node_ptr 
-  insert_before(const node_ptr & header, const node_ptr & pos, 
+  insert_before(const node_ptr & header, const node_ptr & pos, 
                 const node_ptr & new_node, std::size_t tree_size, 
                 H_Alpha h_alpha, std::size_t & max_tree_size);

                Requires: "header" must be the header node of a tree. "pos" must be a valid iterator or header (end) node. "pos" must be an iterator pointing to the successor to "new_node" once inserted according to the order of already inserted nodes. This function does not check "pos" and this precondition must be guaranteed by the caller.

                @@ -421,7 +421,7 @@ 
              29. template<typename H_Alpha> 
-  static void push_back(const node_ptr & header, const node_ptr & new_node, 
+  static void push_back(const node_ptr & header, const node_ptr & new_node, 
                         std::size_t tree_size, H_Alpha h_alpha, 
                         std::size_t & max_tree_size);

                Requires: "header" must be the header node of a tree. "new_node" must be, according to the used ordering no less than the greatest inserted key.

                @@ -432,7 +432,7 @@ 
              30. template<typename H_Alpha> 
-  static void push_front(const node_ptr & header, const node_ptr & new_node, 
+  static void push_front(const node_ptr & header, const node_ptr & new_node, 
                          std::size_t tree_size, H_Alpha h_alpha, 
                          std::size_t & max_tree_size);

                Requires: "header" must be the header node of a tree. "new_node" must be, according to the used ordering, no greater than the lowest inserted key.

                @@ -444,7 +444,7 @@ 
              31. template<typename KeyType, typename KeyNodePtrCompare> 
   static std::pair< node_ptr, bool > 
-  insert_unique_check(const const_node_ptr & header, const KeyType & key, 
+  insert_unique_check(const const_node_ptr & header, const KeyType & key, 
                       KeyNodePtrCompare comp, 
                       insert_commit_data & commit_data);

                Requires: "header" must be the header node of a tree. KeyNodePtrCompare is a function object that induces a strict weak ordering compatible with the strict weak ordering used to create the the tree. NodePtrCompare compares KeyType with a node_ptr.

                @@ -459,7 +459,7 @@ 
              32. template<typename KeyType, typename KeyNodePtrCompare> 
   static std::pair< node_ptr, bool > 
-  insert_unique_check(const const_node_ptr & header, const node_ptr & hint, 
+  insert_unique_check(const const_node_ptr & header, const node_ptr & hint, 
                       const KeyType & key, KeyNodePtrCompare comp, 
                       insert_commit_data & commit_data);

                Requires: "header" must be the header node of a tree. KeyNodePtrCompare is a function object that induces a strict weak ordering compatible with the strict weak ordering used to create the the tree. NodePtrCompare compares KeyType with a node_ptr. "hint" is node from the "header"'s tree.

                @@ -473,7 +473,7 @@ 
              33. template<typename H_Alpha> 
-  static void insert_unique_commit(const node_ptr & header, 
+  static void insert_unique_commit(const node_ptr & header, 
                                    const node_ptr & new_value, 
                                    const insert_commit_data & commit_data, 
                                    std::size_t tree_size, H_Alpha h_alpha, 
@@ -486,7 +486,7 @@
 
              34. template<typename NodePtrCompare, typename H_Alpha, typename AlphaByMaxSize> 
-  static bool transfer_unique(const node_ptr & header1, NodePtrCompare comp, 
+  static bool transfer_unique(const node_ptr & header1, NodePtrCompare comp, 
                               std::size_t tree1_size, 
                               std::size_t & max_tree1_size, 
                               const node_ptr & header2, const node_ptr & z, 
@@ -501,7 +501,7 @@
 
              35. template<typename NodePtrCompare, typename H_Alpha, typename AlphaByMaxSize> 
-  static void transfer_equal(const node_ptr & header1, NodePtrCompare comp, 
+  static void transfer_equal(const node_ptr & header1, NodePtrCompare comp, 
                              std::size_t tree1_size, 
                              std::size_t & max_tree1_size, 
                              const node_ptr & header2, const node_ptr & z, 
@@ -514,14 +514,14 @@
 
                Throws: If the comparison throws.
              36. -
                static bool is_header(const const_node_ptr & p);
                +
                static bool is_header(const const_node_ptr & p);

                Requires: p is a node of a tree.

                Effects: Returns true if p is the header of the tree.

                Complexity: Constant.

                Throws: Nothing.

              37. -
                static void rebalance(const node_ptr & header);
                +
                static void rebalance(const node_ptr & header);

                Requires: p is a node of a tree.

                Effects: Returns true if p is the header of the tree.

                Complexity: Constant.

                diff --git a/doc/html/boost/intrusive/slist.html b/doc/html/boost/intrusive/slist.html index fdd8240294..a03a98e405 100644 --- a/doc/html/boost/intrusive/slist.html +++ b/doc/html/boost/intrusive/slist.html @@ -54,126 +54,126 @@ typedef unspecified node_algorithms; // construct/copy/destruct - slist(); - explicit slist(const value_traits &); + slist(); + explicit slist(const value_traits &); template<typename Iterator> - slist(Iterator, Iterator, const value_traits & = value_traits()); - slist(slist &&); - slist & operator=(slist &&); - ~slist(); + slist(Iterator, Iterator, const value_traits & = value_traits()); + slist(slist &&); + slist & operator=(slist &&); + ~slist(); - // public member functions - void clear(); - template<typename Disposer> void clear_and_dispose(Disposer); - void push_front(reference); - void push_back(reference); - void pop_front(); - template<typename Disposer> void pop_front_and_dispose(Disposer); - reference front(); - const_reference front() const; - reference back(); - const_reference back() const; - iterator begin(); - const_iterator begin() const; - const_iterator cbegin() const; - iterator end(); - const_iterator end() const; - const_iterator cend() const; - iterator before_begin(); - const_iterator before_begin() const; - const_iterator cbefore_begin() const; - iterator last(); - const_iterator last() const; - const_iterator clast() const; - size_type size() const; - bool empty() const; - void swap(slist &); - void shift_backwards(size_type = 1); - void shift_forward(size_type = 1); + // public member functions + void clear(); + template<typename Disposer> void clear_and_dispose(Disposer); + void push_front(reference); + void push_back(reference); + void pop_front(); + template<typename Disposer> void pop_front_and_dispose(Disposer); + reference front(); + const_reference front() const; + reference back(); + const_reference back() const; + iterator begin(); + const_iterator begin() const; + const_iterator cbegin() const; + iterator end(); + const_iterator end() const; + const_iterator cend() const; + iterator before_begin(); + const_iterator before_begin() const; + const_iterator cbefore_begin() const; + iterator last(); + const_iterator last() const; + const_iterator clast() const; + size_type size() const; + bool empty() const; + void swap(slist &); + void shift_backwards(size_type = 1); + void shift_forward(size_type = 1); template<typename Cloner, typename Disposer> - void clone_from(const slist &, Cloner, Disposer); + void clone_from(const slist &, Cloner, Disposer); template<typename Cloner, typename Disposer> - void clone_from(slist &&, Cloner, Disposer); - iterator insert_after(const_iterator, reference); + void clone_from(slist &&, Cloner, Disposer); + iterator insert_after(const_iterator, reference); template<typename Iterator> - void insert_after(const_iterator, Iterator, Iterator); - iterator insert(const_iterator, reference); - template<typename Iterator> void insert(const_iterator, Iterator, Iterator); - iterator erase_after(const_iterator); - iterator erase_after(const_iterator, const_iterator); - iterator erase_after(const_iterator, const_iterator, size_type); - iterator erase(const_iterator); - iterator erase(const_iterator, const_iterator); - iterator erase(const_iterator, const_iterator, size_type); + void insert_after(const_iterator, Iterator, Iterator); + iterator insert(const_iterator, reference); + template<typename Iterator> void insert(const_iterator, Iterator, Iterator); + iterator erase_after(const_iterator); + iterator erase_after(const_iterator, const_iterator); + iterator erase_after(const_iterator, const_iterator, size_type); + iterator erase(const_iterator); + iterator erase(const_iterator, const_iterator); + iterator erase(const_iterator, const_iterator, size_type); template<typename Disposer> - iterator erase_after_and_dispose(const_iterator, Disposer); + iterator erase_after_and_dispose(const_iterator, Disposer); template<typename Disposer> - iterator erase_after_and_dispose(const_iterator, const_iterator, Disposer); + iterator erase_after_and_dispose(const_iterator, const_iterator, Disposer); template<typename Disposer> - iterator erase_and_dispose(const_iterator, Disposer); + iterator erase_and_dispose(const_iterator, Disposer); template<typename Disposer> - iterator erase_and_dispose(const_iterator, const_iterator, Disposer); - template<typename Iterator> void assign(Iterator, Iterator); + iterator erase_and_dispose(const_iterator, const_iterator, Disposer); + template<typename Iterator> void assign(Iterator, Iterator); template<typename Iterator, typename Disposer> - void dispose_and_assign(Disposer, Iterator, Iterator); - void splice_after(const_iterator, slist &, const_iterator * = 0); - void splice_after(const_iterator, slist &, const_iterator); - void splice_after(const_iterator, slist &, const_iterator, const_iterator); - void splice_after(const_iterator, slist &, const_iterator, const_iterator, + void dispose_and_assign(Disposer, Iterator, Iterator); + void splice_after(const_iterator, slist &, const_iterator * = 0); + void splice_after(const_iterator, slist &, const_iterator); + void splice_after(const_iterator, slist &, const_iterator, const_iterator); + void splice_after(const_iterator, slist &, const_iterator, const_iterator, size_type); - void splice(const_iterator, slist &, const_iterator * = 0); - void splice(const_iterator, slist &, const_iterator); - void splice(const_iterator, slist &, const_iterator, const_iterator); - void splice(const_iterator, slist &, const_iterator, const_iterator, + void splice(const_iterator, slist &, const_iterator * = 0); + void splice(const_iterator, slist &, const_iterator); + void splice(const_iterator, slist &, const_iterator, const_iterator); + void splice(const_iterator, slist &, const_iterator, const_iterator, size_type); - template<typename Predicate> void sort(Predicate); - void sort(); + template<typename Predicate> void sort(Predicate); + void sort(); template<typename Predicate> - void merge(slist &, Predicate, const_iterator * = 0); - void merge(slist &); - void reverse(); - void remove(const_reference); + void merge(slist &, Predicate, const_iterator * = 0); + void merge(slist &); + void reverse(); + void remove(const_reference); template<typename Disposer> - void remove_and_dispose(const_reference, Disposer); - template<typename Pred> void remove_if(Pred); + void remove_and_dispose(const_reference, Disposer); + template<typename Pred> void remove_if(Pred); template<typename Pred, typename Disposer> - void remove_and_dispose_if(Pred, Disposer); - void unique(); - template<typename BinaryPredicate> void unique(BinaryPredicate); - template<typename Disposer> void unique_and_dispose(Disposer); + void remove_and_dispose_if(Pred, Disposer); + void unique(); + template<typename BinaryPredicate> void unique(BinaryPredicate); + template<typename Disposer> void unique_and_dispose(Disposer); template<typename BinaryPredicate, typename Disposer> - void unique_and_dispose(BinaryPredicate, Disposer); - iterator iterator_to(reference); - const_iterator iterator_to(const_reference) const; - iterator previous(iterator); - const_iterator previous(const_iterator) const; - iterator previous(const_iterator, iterator); - const_iterator previous(const_iterator, const_iterator) const; - void check() const; + void unique_and_dispose(BinaryPredicate, Disposer); + iterator iterator_to(reference); + const_iterator iterator_to(const_reference) const; + iterator previous(iterator); + const_iterator previous(const_iterator) const; + iterator previous(const_iterator, iterator); + const_iterator previous(const_iterator, const_iterator) const; + void check() const; - // public static functions - static slist & container_from_end_iterator(iterator); - static const slist & container_from_end_iterator(const_iterator); - static iterator s_iterator_to(reference); - static const_iterator s_iterator_to(const_reference); + // public static functions + static slist & container_from_end_iterator(iterator); + static const slist & container_from_end_iterator(const_iterator); + static iterator s_iterator_to(reference); + static const_iterator s_iterator_to(const_reference); - // private member functions - void priv_splice_after(const node_ptr &, slist &, const node_ptr &, + // private member functions + void priv_splice_after(const node_ptr &, slist &, const node_ptr &, const node_ptr &); - void priv_incorporate_after(const node_ptr &, const node_ptr &, + void priv_incorporate_after(const node_ptr &, const node_ptr &, const node_ptr &); - void priv_reverse(unspecified); - void priv_reverse(unspecified); - void priv_shift_backwards(size_type, unspecified); - void priv_shift_backwards(size_type, unspecified); - void priv_shift_forward(size_type, unspecified); - void priv_shift_forward(size_type, unspecified); + void priv_reverse(unspecified); + void priv_reverse(unspecified); + void priv_shift_backwards(size_type, unspecified); + void priv_shift_backwards(size_type, unspecified); + void priv_shift_forward(size_type, unspecified); + void priv_shift_forward(size_type, unspecified); - // private static functions - static void priv_swap_cache_last(slist *, slist *); - static void priv_swap_lists(const node_ptr &, const node_ptr &, unspecified); - static void priv_swap_lists(const node_ptr &, const node_ptr &, unspecified); - static slist & priv_container_from_end_iterator(const const_iterator &); + // private static functions + static void priv_swap_cache_last(slist *, slist *); + static void priv_swap_lists(const node_ptr &, const node_ptr &, unspecified); + static void priv_swap_lists(const node_ptr &, const node_ptr &, unspecified); + static slist & priv_container_from_end_iterator(const const_iterator &); // public data members static const bool constant_time_size; @@ -195,20 +195,20 @@ construct/copy/destruct
                1. -
                  slist();
                  +
                  slist();

                  Effects: constructs an empty list.

                  Complexity: Constant

                  Throws: If value_traits::node_traits::node constructor throws (this does not happen with predefined Boost.Intrusive hooks).

                2. -
                  explicit slist(const value_traits & v_traits);
                  +
                  explicit slist(const value_traits & v_traits);

                  Effects: constructs an empty list.

                  Complexity: Constant

                  Throws: If value_traits::node_traits::node constructor throws (this does not happen with predefined Boost.Intrusive hooks). 

                3. template<typename Iterator> 
-  slist(Iterator b, Iterator e, 
+  slist(Iterator b, Iterator e, 
         const value_traits & v_traits = value_traits());

                  Requires: Dereferencing iterator must yield an lvalue of type value_type.

                  Effects: Constructs a list equal to [b ,e).

                  @@ -216,17 +216,17 @@

                  Throws: If value_traits::node_traits::node constructor throws (this does not happen with predefined Boost.Intrusive hooks).

                4. -
                  slist(slist && x);
                  +
                  slist(slist && x);

                  Effects: Constructs a container moving resources from another container. Internal value traits are move constructed and nodes belonging to x (except the node representing the "end") are linked to *this.

                  Complexity: Constant.

                  Throws: If value_traits::node_traits::node's move constructor throws (this does not happen with predefined Boost.Intrusive hooks) or the move constructor of value traits throws.

                5. -
                  slist & operator=(slist && x);
                  +
                  slist & operator=(slist && x);

                  Effects: Equivalent to swap

                6. -
                  ~slist();
                  +
                  ~slist();

                  Effects: If it's a safe-mode or auto-unlink value, the destructor does nothing (ie. no code is generated). Otherwise it detaches all elements from this. In this case the objects in the list are not deleted (i.e. no destructors are called), but the hooks according to the value_traits template parameter are set to their default value.

                  Complexity: Linear to the number of elements in the list, if it's a safe-mode or auto-unlink value. Otherwise constant.

                  7. @@ -234,17 +234,17 @@

                -slist public member functions

                +slist public member functions
                1. -
                  void clear();
                  +
                  void clear();

                  Effects: Erases all the elements of the container.

                  Throws: Nothing.

                  Complexity: Linear to the number of elements of the list. if it's a safe-mode or auto-unlink value_type. Constant time otherwise.

                  Note: Invalidates the iterators (but not the references) to the erased elements.

                2. -
                  template<typename Disposer> void clear_and_dispose(Disposer disposer);
                  +
                  template<typename Disposer> void clear_and_dispose(Disposer disposer);

                  Requires: Disposer::operator()(pointer) shouldn't throw.

                  Effects: Erases all the elements of the container Disposer::operator()(pointer) is called for the removed elements.

                  Throws: Nothing.

                  @@ -252,7 +252,7 @@

                  Note: Invalidates the iterators to the erased elements.

                3. -
                  void push_front(reference value);
                  +
                  void push_front(reference value);

                  Requires: value must be an lvalue.

                  Effects: Inserts the value in the front of the list. No copy constructors are called.

                  Throws: Nothing.

                  @@ -260,7 +260,7 @@

                  Note: Does not affect the validity of iterators and references.

                4. -
                  void push_back(reference value);
                  +
                  void push_back(reference value);

                  Requires: value must be an lvalue.

                  Effects: Inserts the value in the back of the list. No copy constructors are called.

                  Throws: Nothing.

                  @@ -268,14 +268,14 @@

                  Note: Does not affect the validity of iterators and references. This function is only available is cache_last<> is true.

                5. -
                  void pop_front();
                  +
                  void pop_front();

                  Effects: Erases the first element of the list. No destructors are called.

                  Throws: Nothing.

                  Complexity: Constant.

                  Note: Invalidates the iterators (but not the references) to the erased element.

                6. -
                  template<typename Disposer> void pop_front_and_dispose(Disposer disposer);
                  +
                  template<typename Disposer> void pop_front_and_dispose(Disposer disposer);

                  Requires: Disposer::operator()(pointer) shouldn't throw.

                  Effects: Erases the first element of the list. Disposer::operator()(pointer) is called for the removed element.

                  Throws: Nothing.

                  @@ -283,136 +283,136 @@

                  Note: Invalidates the iterators to the erased element.

                7. -
                  reference front();
                  +
                  reference front();

                  Effects: Returns a reference to the first element of the list.

                  Throws: Nothing.

                  Complexity: Constant.

                8. -
                  const_reference front() const;
                  +
                  const_reference front() const;

                  Effects: Returns a const_reference to the first element of the list.

                  Throws: Nothing.

                  Complexity: Constant.

                9. -
                  reference back();
                  +
                  reference back();

                  Effects: Returns a reference to the last element of the list.

                  Throws: Nothing.

                  Complexity: Constant.

                  Note: Does not affect the validity of iterators and references. This function is only available is cache_last<> is true.

                10. -
                  const_reference back() const;
                  +
                  const_reference back() const;

                  Effects: Returns a const_reference to the last element of the list.

                  Throws: Nothing.

                  Complexity: Constant.

                  Note: Does not affect the validity of iterators and references. This function is only available is cache_last<> is true.

                11. -
                  iterator begin();
                  +
                  iterator begin();

                  Effects: Returns an iterator to the first element contained in the list.

                  Throws: Nothing.

                  Complexity: Constant.

                12. -
                  const_iterator begin() const;
                  +
                  const_iterator begin() const;

                  Effects: Returns a const_iterator to the first element contained in the list.

                  Throws: Nothing.

                  Complexity: Constant.

                13. -
                  const_iterator cbegin() const;
                  +
                  const_iterator cbegin() const;

                  Effects: Returns a const_iterator to the first element contained in the list.

                  Throws: Nothing.

                  Complexity: Constant.

                14. -
                  iterator end();
                  +
                  iterator end();

                  Effects: Returns an iterator to the end of the list.

                  Throws: Nothing.

                  Complexity: Constant.

                15. -
                  const_iterator end() const;
                  +
                  const_iterator end() const;

                  Effects: Returns a const_iterator to the end of the list.

                  Throws: Nothing.

                  Complexity: Constant.

                16. -
                  const_iterator cend() const;
                  +
                  const_iterator cend() const;

                  Effects: Returns a const_iterator to the end of the list.

                  Throws: Nothing.

                  Complexity: Constant.

                17. -
                  iterator before_begin();
                  +
                  iterator before_begin();

                  Effects: Returns an iterator that points to a position before the first element. Equivalent to "end()"

                  Throws: Nothing.

                  Complexity: Constant.

                18. -
                  const_iterator before_begin() const;
                  +
                  const_iterator before_begin() const;

                  Effects: Returns an iterator that points to a position before the first element. Equivalent to "end()"

                  Throws: Nothing.

                  Complexity: Constant.

                19. -
                  const_iterator cbefore_begin() const;
                  +
                  const_iterator cbefore_begin() const;

                  Effects: Returns an iterator that points to a position before the first element. Equivalent to "end()"

                  Throws: Nothing.

                  Complexity: Constant.

                20. -
                  iterator last();
                  +
                  iterator last();

                  Effects: Returns an iterator to the last element contained in the list.

                  Throws: Nothing.

                  Complexity: Constant.

                  Note: This function is present only if cached_last<> option is true.

                21. -
                  const_iterator last() const;
                  +
                  const_iterator last() const;

                  Effects: Returns a const_iterator to the last element contained in the list.

                  Throws: Nothing.

                  Complexity: Constant.

                  Note: This function is present only if cached_last<> option is true.

                22. -
                  const_iterator clast() const;
                  +
                  const_iterator clast() const;

                  Effects: Returns a const_iterator to the last element contained in the list.

                  Throws: Nothing.

                  Complexity: Constant.

                  Note: This function is present only if cached_last<> option is true.

                23. -
                  size_type size() const;
                  +
                  size_type size() const;

                  Effects: Returns the number of the elements contained in the list.

                  Throws: Nothing.

                  Complexity: Linear to the number of elements contained in the list. if constant_time_size is false. Constant time otherwise.

                  Note: Does not affect the validity of iterators and references.

                24. -
                  bool empty() const;
                  +
                  bool empty() const;

                  Effects: Returns true if the list contains no elements.

                  Throws: Nothing.

                  Complexity: Constant.

                  Note: Does not affect the validity of iterators and references.

                25. -
                  void swap(slist & other);
                  +
                  void swap(slist & other);

                  Effects: Swaps the elements of x and *this.

                  Throws: Nothing.

                  Complexity: Linear to the number of elements of both lists. Constant-time if linear<> and/or cache_last<> options are used.

                  Note: Does not affect the validity of iterators and references.

                26. -
                  void shift_backwards(size_type n = 1);
                  +
                  void shift_backwards(size_type n = 1);

                  Effects: Moves backwards all the elements, so that the first element becomes the second, the second becomes the third... the last element becomes the first one.

                  Throws: Nothing.

                  Complexity: Linear to the number of elements plus the number shifts.

                  Note: Iterators Does not affect the validity of iterators and references.

                27. -
                  void shift_forward(size_type n = 1);
                  +
                  void shift_forward(size_type n = 1);

                  Effects: Moves forward all the elements, so that the second element becomes the first, the third becomes the second... the first element becomes the last one.

                  Throws: Nothing.

                  Complexity: Linear to the number of elements plus the number shifts.

                  @@ -420,7 +420,7 @@ 
                28. template<typename Cloner, typename Disposer> 
-  void clone_from(const slist & src, Cloner cloner, Disposer disposer);
                  + void clone_from(const slist & src, Cloner cloner, Disposer disposer);

                  Requires: Disposer::operator()(pointer) shouldn't throw. Cloner should yield to nodes equivalent to the original nodes.

                  Effects: Erases all the elements from *this calling Disposer::operator()(pointer), clones all the elements from src calling Cloner::operator()(const_reference ) and inserts them on *this.

                  If cloner throws, all cloned elements are unlinked and disposed calling Disposer::operator()(pointer).

                  @@ -429,7 +429,7 @@ 
                29. template<typename Cloner, typename Disposer> 
-  void clone_from(slist && src, Cloner cloner, Disposer disposer);
                  + void clone_from(slist && src, Cloner cloner, Disposer disposer);

                  Requires: Disposer::operator()(pointer) shouldn't throw. Cloner should yield to nodes equivalent to the original nodes.

                  Effects: Erases all the elements from *this calling Disposer::operator()(pointer), clones all the elements from src calling Cloner::operator()(reference) and inserts them on *this.

                  If cloner throws, all cloned elements are unlinked and disposed calling Disposer::operator()(pointer).

                  @@ -437,7 +437,7 @@

                  Throws: If cloner throws.

                30. -
                  iterator insert_after(const_iterator prev_p, reference value);
                  +
                  iterator insert_after(const_iterator prev_p, reference value);

                  Requires: value must be an lvalue and prev_p must point to an element contained by the list or to end().

                  Effects: Inserts the value after the position pointed by prev_p. No copy constructor is called.

                  Returns: An iterator to the inserted element.

                  @@ -447,7 +447,7 @@ 
                31. template<typename Iterator> 
-  void insert_after(const_iterator prev_p, Iterator f, Iterator l);
                  + void insert_after(const_iterator prev_p, Iterator f, Iterator l);

                  Requires: Dereferencing iterator must yield an lvalue of type value_type and prev_p must point to an element contained by the list or to the end node.

                  Effects: Inserts the [f, l) after the position prev_p.

                  Throws: Nothing.

                  @@ -455,7 +455,7 @@

                  Note: Does not affect the validity of iterators and references.

                32. -
                  iterator insert(const_iterator p, reference value);
                  +
                  iterator insert(const_iterator p, reference value);

                  Requires: value must be an lvalue and p must point to an element contained by the list or to end().

                  Effects: Inserts the value before the position pointed by p. No copy constructor is called.

                  Throws: Nothing.

                  @@ -464,7 +464,7 @@ 
                33. template<typename Iterator> 
-  void insert(const_iterator p, Iterator b, Iterator e);
                  + void insert(const_iterator p, Iterator b, Iterator e);

                  Requires: Dereferencing iterator must yield an lvalue of type value_type and p must point to an element contained by the list or to the end node.

                  Effects: Inserts the pointed by b and e before the position p. No copy constructors are called.

                  Throws: Nothing.

                  @@ -472,7 +472,7 @@

                  Note: Does not affect the validity of iterators and references.

                34. -
                  iterator erase_after(const_iterator prev);
                  +
                  iterator erase_after(const_iterator prev);

                  Effects: Erases the element after the element pointed by prev of the list. No destructors are called.

                  Returns: the first element remaining beyond the removed elements, or end() if no such element exists.

                  Throws: Nothing.

                  @@ -480,7 +480,7 @@

                  Note: Invalidates the iterators (but not the references) to the erased element.

                35. -
                  iterator erase_after(const_iterator before_f, const_iterator l);
                  +
                  iterator erase_after(const_iterator before_f, const_iterator l);

                  Effects: Erases the range (before_f, l) from the list. No destructors are called.

                  Returns: the first element remaining beyond the removed elements, or end() if no such element exists.

                  Throws: Nothing.

                  @@ -488,7 +488,7 @@

                  Note: Invalidates the iterators (but not the references) to the erased element.

                36. -
                  iterator erase_after(const_iterator before_f, const_iterator l, size_type n);
                  +
                  iterator erase_after(const_iterator before_f, const_iterator l, size_type n);

                  Effects: Erases the range (before_f, l) from the list. n must be distance(before_f, l) - 1. No destructors are called.

                  Returns: the first element remaining beyond the removed elements, or end() if no such element exists.

                  Throws: Nothing.

                  @@ -496,7 +496,7 @@

                  Note: Invalidates the iterators (but not the references) to the erased element.

                37. -
                  iterator erase(const_iterator i);
                  +
                  iterator erase(const_iterator i);

                  Effects: Erases the element pointed by i of the list. No destructors are called.

                  Returns: the first element remaining beyond the removed element, or end() if no such element exists.

                  Throws: Nothing.

                  @@ -504,7 +504,7 @@

                  Note: Invalidates the iterators (but not the references) to the erased element.

                38. -
                  iterator erase(const_iterator f, const_iterator l);
                  +
                  iterator erase(const_iterator f, const_iterator l);

                  Requires: f and l must be valid iterator to elements in *this.

                  Effects: Erases the range pointed by b and e. No destructors are called.

                  Returns: the first element remaining beyond the removed elements, or end() if no such element exists.

                  @@ -513,7 +513,7 @@

                  Note: Invalidates the iterators (but not the references) to the erased elements.

                39. -
                  iterator erase(const_iterator f, const_iterator l, size_type n);
                  +
                  iterator erase(const_iterator f, const_iterator l, size_type n);

                  Effects: Erases the range [f, l) from the list. n must be distance(f, l). No destructors are called.

                  Returns: the first element remaining beyond the removed elements, or end() if no such element exists.

                  Throws: Nothing.

                  @@ -522,7 +522,7 @@ 
                40. template<typename Disposer> 
-  iterator erase_after_and_dispose(const_iterator prev, Disposer disposer);
                  + iterator erase_after_and_dispose(const_iterator prev, Disposer disposer);

                  Requires: Disposer::operator()(pointer) shouldn't throw.

                  Effects: Erases the element after the element pointed by prev of the list. Disposer::operator()(pointer) is called for the removed element.

                  Returns: the first element remaining beyond the removed elements, or end() if no such element exists.

                  @@ -532,7 +532,7 @@ 
                41. template<typename Disposer> 
-  iterator erase_after_and_dispose(const_iterator before_f, const_iterator l, 
+  iterator erase_after_and_dispose(const_iterator before_f, const_iterator l, 
                                    Disposer disposer);

                  Requires: Disposer::operator()(pointer) shouldn't throw.

                  Effects: Erases the range (before_f, l) from the list. Disposer::operator()(pointer) is called for the removed elements.

                  @@ -543,7 +543,7 @@ 
                42. template<typename Disposer> 
-  iterator erase_and_dispose(const_iterator i, Disposer disposer);
                  + iterator erase_and_dispose(const_iterator i, Disposer disposer);

                  Requires: Disposer::operator()(pointer) shouldn't throw.

                  Effects: Erases the element pointed by i of the list. No destructors are called. Disposer::operator()(pointer) is called for the removed element.

                  Returns: the first element remaining beyond the removed element, or end() if no such element exists.

                  @@ -553,7 +553,7 @@ 
                43. template<typename Disposer> 
-  iterator erase_and_dispose(const_iterator f, const_iterator l, 
+  iterator erase_and_dispose(const_iterator f, const_iterator l, 
                              Disposer disposer);

                  Requires: f and l must be valid iterator to elements in *this. Disposer::operator()(pointer) shouldn't throw.

                  Effects: Erases the range pointed by b and e. No destructors are called. Disposer::operator()(pointer) is called for the removed elements.

                  @@ -563,7 +563,7 @@

                  Note: Invalidates the iterators (but not the references) to the erased elements.

                44. -
                  template<typename Iterator> void assign(Iterator b, Iterator e);
                  +
                  template<typename Iterator> void assign(Iterator b, Iterator e);

                  Requires: Dereferencing iterator must yield an lvalue of type value_type.

                  Effects: Clears the list and inserts the range pointed by b and e. No destructors or copy constructors are called.

                  Throws: Nothing.

                  @@ -572,7 +572,7 @@ 
                45. template<typename Iterator, typename Disposer> 
-  void dispose_and_assign(Disposer disposer, Iterator b, Iterator e);
                  + void dispose_and_assign(Disposer disposer, Iterator b, Iterator e);

                  Requires: Disposer::operator()(pointer) shouldn't throw.

                  Requires: Dereferencing iterator must yield an lvalue of type value_type.

                  Effects: Clears the list and inserts the range pointed by b and e. No destructors or copy constructors are called. Disposer::operator()(pointer) is called for the removed elements.

                  @@ -581,7 +581,7 @@

                  Note: Invalidates the iterators (but not the references) to the erased elements.

                46. -
                  void splice_after(const_iterator prev, slist & x, const_iterator * l = 0);
                  +
                  void splice_after(const_iterator prev, slist & x, const_iterator * l = 0);

                  Requires: prev must point to an element contained by this list or to the before_begin() element

                  Effects: Transfers all the elements of list x to this list, after the the element pointed by prev. No destructors or copy constructors are called.

                  Returns: Nothing.

                  @@ -591,7 +591,7 @@

                  Additional note: If the optional parameter "l" is provided, it will be assigned to the last spliced element or prev if x is empty. This iterator can be used as new "prev" iterator for a new splice_after call. that will splice new values after the previously spliced values.

                47. -
                  void splice_after(const_iterator prev_pos, slist & x, const_iterator prev_ele);
                  +
                  void splice_after(const_iterator prev_pos, slist & x, const_iterator prev_ele);

                  Requires: prev must point to an element contained by this list or to the before_begin() element. prev_ele must point to an element contained in list x or must be x.before_begin().

                  Effects: Transfers the element after prev_ele, from list x to this list, after the element pointed by prev. No destructors or copy constructors are called.

                  Throws: Nothing.

                  @@ -599,7 +599,7 @@

                  Note: Iterators of values obtained from list x now point to elements of this list. Iterators of this list and all the references are not invalidated.

                48. -
                  void splice_after(const_iterator prev_pos, slist & x, const_iterator before_f, 
+
                  void splice_after(const_iterator prev_pos, slist & x, const_iterator before_f, 
                   const_iterator before_l);
                  
 
                  Requires: prev_pos must be a dereferenceable iterator in *this or be before_begin(), and before_f and before_l belong to x and ++before_f != x.end() && before_l != x.end().
                  
 
                  Effects: Transfers the range (before_f, before_l] from list x to this list, after the element pointed by prev_pos. No destructors or copy constructors are called.
                  
@@ -608,7 +608,7 @@
 
                  Note: Iterators of values obtained from list x now point to elements of this list. Iterators of this list and all the references are not invalidated.
                49. -
                  void splice_after(const_iterator prev_pos, slist & x, const_iterator before_f, 
+
                  void splice_after(const_iterator prev_pos, slist & x, const_iterator before_f, 
                   const_iterator before_l, size_type n);
                  
 
                  Requires: prev_pos must be a dereferenceable iterator in *this or be before_begin(), and before_f and before_l belong to x and ++before_f != x.end() && before_l != x.end() and n == distance(before_f, before_l).
                  
 
                  Effects: Transfers the range (before_f, before_l] from list x to this list, after the element pointed by p. No destructors or copy constructors are called.
                  
@@ -617,7 +617,7 @@
 
                  Note: Iterators of values obtained from list x now point to elements of this list. Iterators of this list and all the references are not invalidated.
                50. -
                  void splice(const_iterator it, slist & x, const_iterator * l = 0);
                  +
                  void splice(const_iterator it, slist & x, const_iterator * l = 0);

                  Requires: it is an iterator to an element in *this.

                  Effects: Transfers all the elements of list x to this list, before the the element pointed by it. No destructors or copy constructors are called.

                  Returns: Nothing.

                  @@ -627,7 +627,7 @@

                  Additional note: If the optional parameter "l" is provided, it will be assigned to the last spliced element or prev if x is empty. This iterator can be used as new "prev" iterator for a new splice_after call. that will splice new values after the previously spliced values.

                51. -
                  void splice(const_iterator pos, slist & x, const_iterator elem);
                  +
                  void splice(const_iterator pos, slist & x, const_iterator elem);

                  Requires: it p must be a valid iterator of *this. elem must point to an element contained in list x.

                  Effects: Transfers the element elem, from list x to this list, before the element pointed by pos. No destructors or copy constructors are called.

                  Throws: Nothing.

                  @@ -635,7 +635,7 @@

                  Note: Iterators of values obtained from list x now point to elements of this list. Iterators of this list and all the references are not invalidated.

                52. -
                  void splice(const_iterator pos, slist & x, const_iterator f, const_iterator l);
                  +
                  void splice(const_iterator pos, slist & x, const_iterator f, const_iterator l);

                  Requires: pos must be a dereferenceable iterator in *this and f and f belong to x and f and f a valid range on x.

                  Effects: Transfers the range [f, l) from list x to this list, before the element pointed by pos. No destructors or copy constructors are called.

                  Throws: Nothing.

                  @@ -643,7 +643,7 @@

                  Note: Iterators of values obtained from list x now point to elements of this list. Iterators of this list and all the references are not invalidated.

                53. -
                  void splice(const_iterator pos, slist & x, const_iterator f, const_iterator l, 
+
                  void splice(const_iterator pos, slist & x, const_iterator f, const_iterator l, 
             size_type n);
                  
 
                  Requires: pos must be a dereferenceable iterator in *this and f and l belong to x and f and l a valid range on x. n == distance(f, l).
                  
 
                  Effects: Transfers the range [f, l) from list x to this list, before the element pointed by pos. No destructors or copy constructors are called.
                  
@@ -652,14 +652,14 @@
 
                  Note: Iterators of values obtained from list x now point to elements of this list. Iterators of this list and all the references are not invalidated.
                54. -
                  template<typename Predicate> void sort(Predicate p);
                  +
                  template<typename Predicate> void sort(Predicate p);

                  Effects: This function sorts the list *this according to std::less<value_type>. The sort is stable, that is, the relative order of equivalent elements is preserved.

                  Throws: If value_traits::node_traits::node constructor throws (this does not happen with predefined Boost.Intrusive hooks) or the predicate throws. Basic guarantee.

                  Complexity: The number of comparisons is approximately N log N, where N is the list's size.

                  Note: Iterators and references are not invalidated

                55. -
                  void sort();
                  +
                  void sort();

                  Requires: p must be a comparison function that induces a strict weak ordering and both *this and x must be sorted according to that ordering The lists x and *this must be distinct.

                  Effects: This function removes all of x's elements and inserts them in order into *this. The merge is stable; that is, if an element from *this is equivalent to one from x, then the element from *this will precede the one from x.

                  Throws: If value_traits::node_traits::node constructor throws (this does not happen with predefined Boost.Intrusive hooks) or std::less<value_type> throws. Basic guarantee.

                  @@ -668,7 +668,7 @@ 
                56. template<typename Predicate> 
-  void merge(slist & x, Predicate p, const_iterator * l = 0);
                  + void merge(slist & x, Predicate p, const_iterator * l = 0);

                  Requires: p must be a comparison function that induces a strict weak ordering and both *this and x must be sorted according to that ordering The lists x and *this must be distinct.

                  Effects: This function removes all of x's elements and inserts them in order into *this. The merge is stable; that is, if an element from *this is equivalent to one from x, then the element from *this will precede the one from x.

                  Returns: Nothing.

                  @@ -678,21 +678,21 @@

                  Additional note: If optional "l" argument is passed, it is assigned to an iterator to the last transferred value or end() is x is empty.

                57. -
                  void merge(slist & x);
                  +
                  void merge(slist & x);

                  Effects: This function removes all of x's elements and inserts them in order into *this according to std::less<value_type>. The merge is stable; that is, if an element from *this is equivalent to one from x, then the element from *this will precede the one from x.

                  Throws: if std::less<value_type> throws. Basic guarantee.

                  Complexity: This function is linear time: it performs at most size() + x.size() - 1 comparisons.

                  Note: Iterators and references are not invalidated

                58. -
                  void reverse();
                  +
                  void reverse();

                  Effects: Reverses the order of elements in the list.

                  Throws: Nothing.

                  Complexity: This function is linear to the contained elements.

                  Note: Iterators and references are not invalidated

                59. -
                  void remove(const_reference value);
                  +
                  void remove(const_reference value);

                  Effects: Removes all the elements that compare equal to value. No destructors are called.

                  Throws: If std::equal_to<value_type> throws. Basic guarantee.

                  Complexity: Linear time. It performs exactly size() comparisons for equality.

                  @@ -700,7 +700,7 @@ 
                60. template<typename Disposer> 
-  void remove_and_dispose(const_reference value, Disposer disposer);
                  + void remove_and_dispose(const_reference value, Disposer disposer);

                  Requires: Disposer::operator()(pointer) shouldn't throw.

                  Effects: Removes all the elements that compare equal to value. Disposer::operator()(pointer) is called for every removed element.

                  Throws: If std::equal_to<value_type> throws. Basic guarantee.

                  @@ -708,7 +708,7 @@

                  Note: The relative order of elements that are not removed is unchanged, and iterators to elements that are not removed remain valid.

                61. -
                  template<typename Pred> void remove_if(Pred pred);
                  +
                  template<typename Pred> void remove_if(Pred pred);

                  Effects: Removes all the elements for which a specified predicate is satisfied. No destructors are called.

                  Throws: If pred throws. Basic guarantee.

                  Complexity: Linear time. It performs exactly size() calls to the predicate.

                  @@ -716,7 +716,7 @@ 
                62. template<typename Pred, typename Disposer> 
-  void remove_and_dispose_if(Pred pred, Disposer disposer);
                  + void remove_and_dispose_if(Pred pred, Disposer disposer);

                  Requires: Disposer::operator()(pointer) shouldn't throw.

                  Effects: Removes all the elements for which a specified predicate is satisfied. Disposer::operator()(pointer) is called for every removed element.

                  Throws: If pred throws. Basic guarantee.

                  @@ -724,21 +724,21 @@

                  Note: The relative order of elements that are not removed is unchanged, and iterators to elements that are not removed remain valid.

                63. -
                  void unique();
                  +
                  void unique();

                  Effects: Removes adjacent duplicate elements or adjacent elements that are equal from the list. No destructors are called.

                  Throws: If std::equal_to<value_type> throws. Basic guarantee.

                  Complexity: Linear time (size()-1) comparisons calls to pred()).

                  Note: The relative order of elements that are not removed is unchanged, and iterators to elements that are not removed remain valid.

                64. -
                  template<typename BinaryPredicate> void unique(BinaryPredicate pred);
                  +
                  template<typename BinaryPredicate> void unique(BinaryPredicate pred);

                  Effects: Removes adjacent duplicate elements or adjacent elements that satisfy some binary predicate from the list. No destructors are called.

                  Throws: If the predicate throws. Basic guarantee.

                  Complexity: Linear time (size()-1) comparisons equality comparisons.

                  Note: The relative order of elements that are not removed is unchanged, and iterators to elements that are not removed remain valid.

                65. -
                  template<typename Disposer> void unique_and_dispose(Disposer disposer);
                  +
                  template<typename Disposer> void unique_and_dispose(Disposer disposer);

                  Requires: Disposer::operator()(pointer) shouldn't throw.

                  Effects: Removes adjacent duplicate elements or adjacent elements that satisfy some binary predicate from the list. Disposer::operator()(pointer) is called for every removed element.

                  Throws: If std::equal_to<value_type> throws. Basic guarantee.

                  @@ -747,7 +747,7 @@ 
                66. template<typename BinaryPredicate, typename Disposer> 
-  void unique_and_dispose(BinaryPredicate pred, Disposer disposer);
                  + void unique_and_dispose(BinaryPredicate pred, Disposer disposer);

                  Requires: Disposer::operator()(pointer) shouldn't throw.

                  Effects: Removes adjacent duplicate elements or adjacent elements that satisfy some binary predicate from the list. Disposer::operator()(pointer) is called for every removed element.

                  Throws: If the predicate throws. Basic guarantee.

                  @@ -755,7 +755,7 @@

                  Note: The relative order of elements that are not removed is unchanged, and iterators to elements that are not removed remain valid.

                67. -
                  iterator iterator_to(reference value);
                  +
                  iterator iterator_to(reference value);

                  Requires: value must be a reference to a value inserted in a list.

                  Effects: This function returns a const_iterator pointing to the element

                  Throws: Nothing.

                  @@ -763,7 +763,7 @@

                  Note: Iterators and references are not invalidated.

                68. -
                  const_iterator iterator_to(const_reference value) const;
                  +
                  const_iterator iterator_to(const_reference value) const;

                  Requires: value must be a const reference to a value inserted in a list.

                  Effects: This function returns an iterator pointing to the element.

                  Throws: Nothing.

                  @@ -771,31 +771,31 @@

                  Note: Iterators and references are not invalidated.

                69. -
                  iterator previous(iterator i);
                  +
                  iterator previous(iterator i);

                  Returns: The iterator to the element before i in the list. Returns the end-iterator, if either i is the begin-iterator or the list is empty.

                  Throws: Nothing.

                  Complexity: Linear to the number of elements before i. Constant if cache_last<> is true and i == end().

                70. -
                  const_iterator previous(const_iterator i) const;
                  +
                  const_iterator previous(const_iterator i) const;

                  Returns: The const_iterator to the element before i in the list. Returns the end-const_iterator, if either i is the begin-const_iterator or the list is empty.

                  Throws: Nothing.

                  Complexity: Linear to the number of elements before i. Constant if cache_last<> is true and i == end().

                71. -
                  iterator previous(const_iterator prev_from, iterator i);
                  +
                  iterator previous(const_iterator prev_from, iterator i);

                  Returns: The iterator to the element before i in the list, starting the search on element after prev_from. Returns the end-iterator, if either i is the begin-iterator or the list is empty.

                  Throws: Nothing.

                  Complexity: Linear to the number of elements before i. Constant if cache_last<> is true and i == end().

                72. -
                  const_iterator previous(const_iterator prev_from, const_iterator i) const;
                  +
                  const_iterator previous(const_iterator prev_from, const_iterator i) const;

                  Returns: The const_iterator to the element before i in the list, starting the search on element after prev_from. Returns the end-const_iterator, if either i is the begin-const_iterator or the list is empty.

                  Throws: Nothing.

                  Complexity: Linear to the number of elements before i. Constant if cache_last<> is true and i == end().

                73. -
                  void check() const;
                  +
                  void check() const;

                  Effects: Asserts the integrity of the container.

                  Complexity: Linear time.

                  Note: The method has no effect when asserts are turned off (e.g., with NDEBUG). Experimental function, interface might change in future versions.

                  @@ -804,24 +804,24 @@

                -slist public static functions

                +slist public static functions
                1. -
                  static slist & container_from_end_iterator(iterator end_iterator);
                  +
                  static slist & container_from_end_iterator(iterator end_iterator);

                  Precondition: end_iterator must be a valid end iterator of slist.

                  Effects: Returns a const reference to the slist associated to the end iterator

                  Throws: Nothing.

                  Complexity: Constant.

                2. -
                  static const slist & container_from_end_iterator(const_iterator end_iterator);
                  +
                  static const slist & container_from_end_iterator(const_iterator end_iterator);

                  Precondition: end_iterator must be a valid end const_iterator of slist.

                  Effects: Returns a const reference to the slist associated to the end iterator

                  Throws: Nothing.

                  Complexity: Constant.

                3. -
                  static iterator s_iterator_to(reference value);
                  +
                  static iterator s_iterator_to(reference value);

                  Requires: value must be a reference to a value inserted in a list.

                  Effects: This function returns a const_iterator pointing to the element

                  Throws: Nothing.

                  @@ -829,7 +829,7 @@

                  Note: Iterators and references are not invalidated. This static function is available only if the value traits is stateless.

                4. -
                  static const_iterator s_iterator_to(const_reference value);
                  +
                  static const_iterator s_iterator_to(const_reference value);

                  Requires: value must be a const reference to a value inserted in a list.

                  Effects: This function returns an iterator pointing to the element.

                  Throws: Nothing.

                  @@ -840,33 +840,33 @@

                -slist private member functions

                +slist private member functions
                  -
                1. void priv_splice_after(const node_ptr & prev_pos_n, slist & x, 
+
                2. void priv_splice_after(const node_ptr & prev_pos_n, slist & x, 
                        const node_ptr & before_f_n, 
                        const node_ptr & before_l_n);
                  3. 
-
                3. void priv_incorporate_after(const node_ptr & prev_pos_n, 
+
                4. void priv_incorporate_after(const node_ptr & prev_pos_n, 
                             const node_ptr & first_n, 
                             const node_ptr & before_l_n);
                  5. 
-
                5. void priv_reverse(unspecified);
                  6. 
-
                6. void priv_reverse(unspecified);
                  7. 
-
                7. void priv_shift_backwards(size_type n, unspecified);
                  8. 
-
                8. void priv_shift_backwards(size_type n, unspecified);
                  9. 
-
                9. void priv_shift_forward(size_type n, unspecified);
                  10. 
-
                10. void priv_shift_forward(size_type n, unspecified);
                  11. 
+
                11. void priv_reverse(unspecified);
                  12. 
+
                12. void priv_reverse(unspecified);
                  13. 
+
                13. void priv_shift_backwards(size_type n, unspecified);
                  14. 
+
                14. void priv_shift_backwards(size_type n, unspecified);
                  15. 
+
                15. void priv_shift_forward(size_type n, unspecified);
                  16. 
+
                16. void priv_shift_forward(size_type n, unspecified);
                  17.

                -slist private static functions

                +slist private static functions
                  -
                1. static void priv_swap_cache_last(slist * this_impl, slist * other_impl);
                  2. -
                2. static void priv_swap_lists(const node_ptr & this_node, 
+
                3. static void priv_swap_cache_last(slist * this_impl, slist * other_impl);
                  4. 
+
                4. static void priv_swap_lists(const node_ptr & this_node, 
                             const node_ptr & other_node, unspecified);
                  5. 
-
                5. static void priv_swap_lists(const node_ptr & this_node, 
+
                6. static void priv_swap_lists(const node_ptr & this_node, 
                             const node_ptr & other_node, unspecified);
                  7. 
 
                7. static slist & 
-priv_container_from_end_iterator(const const_iterator & end_iterator);
                  8. 
+priv_container_from_end_iterator(const const_iterator & end_iterator);
                  8.
                diff --git a/doc/html/boost/intrusive/slist_base_hook.html b/doc/html/boost/intrusive/slist_base_hook.html index e3e335214c..5ff65f4a11 100644 --- a/doc/html/boost/intrusive/slist_base_hook.html +++ b/doc/html/boost/intrusive/slist_base_hook.html @@ -36,15 +36,15 @@ class slist_base_hook : public make_slist_base_hook::type< O1, O2, O3 > { public: // construct/copy/destruct - slist_base_hook(); - slist_base_hook(const slist_base_hook &); - slist_base_hook & operator=(const slist_base_hook &); - ~slist_base_hook(); + slist_base_hook(); + slist_base_hook(const slist_base_hook &); + slist_base_hook & operator=(const slist_base_hook &); + ~slist_base_hook(); - // public member functions - void swap_nodes(slist_base_hook &); - bool is_linked() const; - void unlink(); + // public member functions + void swap_nodes(slist_base_hook &); + bool is_linked() const; + void unlink(); };

                Description

                @@ -60,24 +60,24 @@ construct/copy/destruct
                1. -
                  slist_base_hook();
                  +
                  slist_base_hook();

                  Effects: If link_mode is auto_unlink or safe_link initializes the node to an unlinked state.

                  Throws: Nothing.

                2. -
                  slist_base_hook(const slist_base_hook &);
                  +
                  slist_base_hook(const slist_base_hook &);

                  Effects: If link_mode is auto_unlink or safe_link initializes the node to an unlinked state. The argument is ignored.

                  Throws: Nothing.

                  Rationale: Providing a copy-constructor makes classes using the hook STL-compliant without forcing the user to do some additional work. swap can be used to emulate move-semantics.

                3. -
                  slist_base_hook & operator=(const slist_base_hook &);
                  +
                  slist_base_hook & operator=(const slist_base_hook &);

                  Effects: Empty function. The argument is ignored.

                  Throws: Nothing.

                  Rationale: Providing an assignment operator makes classes using the hook STL-compliant without forcing the user to do some additional work. swap can be used to emulate move-semantics.

                4. -
                  ~slist_base_hook();
                  +
                  ~slist_base_hook();

                  Effects: If link_mode is normal_link, the destructor does nothing (ie. no code is generated). If link_mode is safe_link and the object is stored in an slist an assertion is raised. If link_mode is auto_unlink and is_linked() is true, the node is unlinked.

                  Throws: Nothing.

                  5. @@ -85,22 +85,22 @@

                -slist_base_hook public member functions

                +slist_base_hook public member functions
                1. -
                  void swap_nodes(slist_base_hook & other);
                  +
                  void swap_nodes(slist_base_hook & other);

                  Effects: Swapping two nodes swaps the position of the elements related to those nodes in one or two containers. That is, if the node this is part of the element e1, the node x is part of the element e2 and both elements are included in the containers s1 and s2, then after the swap-operation e1 is in s2 at the position of e2 and e2 is in s1 at the position of e1. If one element is not in a container, then after the swap-operation the other element is not in a container. Iterators to e1 and e2 related to those nodes are invalidated.

                  Complexity: Constant

                  Throws: Nothing.

                2. -
                  bool is_linked() const;
                  +
                  bool is_linked() const;

                  Precondition: link_mode must be safe_link or auto_unlink.

                  Returns: true, if the node belongs to a container, false otherwise. This function can be used to test whether slist::iterator_to will return a valid iterator.

                  Complexity: Constant

                3. -
                  void unlink();
                  +
                  void unlink();

                  Effects: Removes the node if it's inserted in a container. This function is only allowed if link_mode is auto_unlink.

                  Throws: Nothing.

                  4. diff --git a/doc/html/boost/intrusive/slist_member_hook.html b/doc/html/boost/intrusive/slist_member_hook.html index 85e5a282a5..cbc7cd4ef8 100644 --- a/doc/html/boost/intrusive/slist_member_hook.html +++ b/doc/html/boost/intrusive/slist_member_hook.html @@ -36,15 +36,15 @@ class slist_member_hook : public make_slist_member_hook::type< O1, O2, O3 > { public: // construct/copy/destruct - slist_member_hook(); - slist_member_hook(const slist_member_hook &); - slist_member_hook & operator=(const slist_member_hook &); - ~slist_member_hook(); + slist_member_hook(); + slist_member_hook(const slist_member_hook &); + slist_member_hook & operator=(const slist_member_hook &); + ~slist_member_hook(); - // public member functions - void swap_nodes(slist_member_hook &); - bool is_linked() const; - void unlink(); + // public member functions + void swap_nodes(slist_member_hook &); + bool is_linked() const; + void unlink(); };

                Description

                @@ -59,24 +59,24 @@ construct/copy/destruct
                1. -
                  slist_member_hook();
                  +
                  slist_member_hook();

                  Effects: If link_mode is auto_unlink or safe_link initializes the node to an unlinked state.

                  Throws: Nothing.

                2. -
                  slist_member_hook(const slist_member_hook &);
                  +
                  slist_member_hook(const slist_member_hook &);

                  Effects: If link_mode is auto_unlink or safe_link initializes the node to an unlinked state. The argument is ignored.

                  Throws: Nothing.

                  Rationale: Providing a copy-constructor makes classes using the hook STL-compliant without forcing the user to do some additional work. swap can be used to emulate move-semantics.

                3. -
                  slist_member_hook & operator=(const slist_member_hook &);
                  +
                  slist_member_hook & operator=(const slist_member_hook &);

                  Effects: Empty function. The argument is ignored.

                  Throws: Nothing.

                  Rationale: Providing an assignment operator makes classes using the hook STL-compliant without forcing the user to do some additional work. swap can be used to emulate move-semantics.

                4. -
                  ~slist_member_hook();
                  +
                  ~slist_member_hook();

                  Effects: If link_mode is normal_link, the destructor does nothing (ie. no code is generated). If link_mode is safe_link and the object is stored in an slist an assertion is raised. If link_mode is auto_unlink and is_linked() is true, the node is unlinked.

                  Throws: Nothing.

                  5. @@ -84,23 +84,23 @@

                -slist_member_hook public member functions

                +slist_member_hook public member functions
                1. -
                  void swap_nodes(slist_member_hook & other);
                  +
                  void swap_nodes(slist_member_hook & other);

                  Effects: Swapping two nodes swaps the position of the elements related to those nodes in one or two containers. That is, if the node this is part of the element e1, the node x is part of the element e2 and both elements are included in the containers s1 and s2, then after the swap-operation e1 is in s2 at the position of e2 and e2 is in s1 at the position of e1. If one element is not in a container, then after the swap-operation the other element is not in a container. Iterators to e1 and e2 related to those nodes are invalidated.

                  Complexity: Constant

                  Throws: Nothing.

                2. -
                  bool is_linked() const;
                  +
                  bool is_linked() const;

                  Precondition: link_mode must be safe_link or auto_unlink.

                  Returns: true, if the node belongs to a container, false otherwise. This function can be used to test whether slist::iterator_to will return a valid iterator.

                  Note: If this member is called when the value is inserted in a slist with the option linear<true>, this function will return "false" for the last element, as it is not linked to anything (the next element is null), so use with care.

                  Complexity: Constant

                3. -
                  void unlink();
                  +
                  void unlink();

                  Effects: Removes the node if it's inserted in a container. This function is only allowed if link_mode is auto_unlink.

                  Throws: Nothing.

                  4. diff --git a/doc/html/boost/intrusive/splay_multiset.html b/doc/html/boost/intrusive/splay_multiset.html index 54b6c7cd6f..8097eac674 100644 --- a/doc/html/boost/intrusive/splay_multiset.html +++ b/doc/html/boost/intrusive/splay_multiset.html @@ -60,126 +60,126 @@ typedef implementation_defined::node_algorithms node_algorithms; // construct/copy/destruct - splay_multiset(); - explicit splay_multiset(const key_compare &, + splay_multiset(); + explicit splay_multiset(const key_compare &, const value_traits & = value_traits()); template<typename Iterator> - splay_multiset(Iterator, Iterator, const key_compare & = key_compare(), + splay_multiset(Iterator, Iterator, const key_compare & = key_compare(), const value_traits & = value_traits()); - splay_multiset(splay_multiset &&); - splay_multiset & operator=(splay_multiset &&); - ~splay_multiset(); + splay_multiset(splay_multiset &&); + splay_multiset & operator=(splay_multiset &&); + ~splay_multiset(); - // public member functions - iterator begin(); - const_iterator begin() const; - const_iterator cbegin() const; - iterator end(); - const_iterator end() const; - const_iterator cend() const; - reverse_iterator rbegin(); - const_reverse_iterator rbegin() const; - const_reverse_iterator crbegin() const; - reverse_iterator rend(); - const_reverse_iterator rend() const; - const_reverse_iterator crend() const; - iterator root(); - const_iterator root() const; - const_iterator croot() const; - key_compare key_comp() const; - value_compare value_comp() const; - bool empty() const; - size_type size() const; - void swap(splay_multiset &); + // public member functions + iterator begin(); + const_iterator begin() const; + const_iterator cbegin() const; + iterator end(); + const_iterator end() const; + const_iterator cend() const; + reverse_iterator rbegin(); + const_reverse_iterator rbegin() const; + const_reverse_iterator crbegin() const; + reverse_iterator rend(); + const_reverse_iterator rend() const; + const_reverse_iterator crend() const; + iterator root(); + const_iterator root() const; + const_iterator croot() const; + key_compare key_comp() const; + value_compare value_comp() const; + bool empty() const; + size_type size() const; + void swap(splay_multiset &); template<typename Cloner, typename Disposer> - void clone_from(const splay_multiset &, Cloner, Disposer); + void clone_from(const splay_multiset &, Cloner, Disposer); template<typename Cloner, typename Disposer> - void clone_from(splay_multiset &&, Cloner, Disposer); - iterator insert(reference); - iterator insert(const_iterator, reference); - template<typename Iterator> void insert(Iterator, Iterator); - iterator insert_before(const_iterator, reference); - void push_back(reference); - void push_front(reference); - iterator erase(const_iterator); - iterator erase(const_iterator, const_iterator); - size_type erase(const key_type &); + void clone_from(splay_multiset &&, Cloner, Disposer); + iterator insert(reference); + iterator insert(const_iterator, reference); + template<typename Iterator> void insert(Iterator, Iterator); + iterator insert_before(const_iterator, reference); + void push_back(reference); + void push_front(reference); + iterator erase(const_iterator); + iterator erase(const_iterator, const_iterator); + size_type erase(const key_type &); template<typename KeyType, typename KeyTypeKeyCompare> - size_type erase(const KeyType &, KeyTypeKeyCompare); + size_type erase(const KeyType &, KeyTypeKeyCompare); template<typename Disposer> - iterator erase_and_dispose(const_iterator, Disposer); + iterator erase_and_dispose(const_iterator, Disposer); template<typename Disposer> - iterator erase_and_dispose(const_iterator, const_iterator, Disposer); + iterator erase_and_dispose(const_iterator, const_iterator, Disposer); template<typename Disposer> - size_type erase_and_dispose(const key_type &, Disposer); + size_type erase_and_dispose(const key_type &, Disposer); template<typename KeyType, typename KeyTypeKeyCompare, typename Disposer> - size_type erase_and_dispose(const KeyType &, KeyTypeKeyCompare, Disposer); - void clear(); - template<typename Disposer> void clear_and_dispose(Disposer); - size_type count(const key_type &); + size_type erase_and_dispose(const KeyType &, KeyTypeKeyCompare, Disposer); + void clear(); + template<typename Disposer> void clear_and_dispose(Disposer); + size_type count(const key_type &); template<typename KeyType, typename KeyTypeKeyCompare> - size_type count(const KeyType &, KeyTypeKeyCompare); - iterator lower_bound(const key_type &); + size_type count(const KeyType &, KeyTypeKeyCompare); + iterator lower_bound(const key_type &); template<typename KeyType, typename KeyTypeKeyCompare> - iterator lower_bound(const KeyType &, KeyTypeKeyCompare); - const_iterator lower_bound(const key_type &) const; + iterator lower_bound(const KeyType &, KeyTypeKeyCompare); + const_iterator lower_bound(const key_type &) const; template<typename KeyType, typename KeyTypeKeyCompare> - const_iterator lower_bound(const KeyType &, KeyTypeKeyCompare) const; - iterator upper_bound(const key_type &); + const_iterator lower_bound(const KeyType &, KeyTypeKeyCompare) const; + iterator upper_bound(const key_type &); template<typename KeyType, typename KeyTypeKeyCompare> - iterator upper_bound(const KeyType &, KeyTypeKeyCompare); - const_iterator upper_bound(const key_type &) const; + iterator upper_bound(const KeyType &, KeyTypeKeyCompare); + const_iterator upper_bound(const key_type &) const; template<typename KeyType, typename KeyTypeKeyCompare> - const_iterator upper_bound(const KeyType &, KeyTypeKeyCompare) const; - iterator find(const key_type &); + const_iterator upper_bound(const KeyType &, KeyTypeKeyCompare) const; + iterator find(const key_type &); template<typename KeyType, typename KeyTypeKeyCompare> - iterator find(const KeyType &, KeyTypeKeyCompare); - const_iterator find(const key_type &) const; + iterator find(const KeyType &, KeyTypeKeyCompare); + const_iterator find(const key_type &) const; template<typename KeyType, typename KeyTypeKeyCompare> - const_iterator find(const KeyType &, KeyTypeKeyCompare) const; - std::pair< iterator, iterator > equal_range(const key_type &); + const_iterator find(const KeyType &, KeyTypeKeyCompare) const; + std::pair< iterator, iterator > equal_range(const key_type &); template<typename KeyType, typename KeyTypeKeyCompare> std::pair< iterator, iterator > - equal_range(const KeyType &, KeyTypeKeyCompare); + equal_range(const KeyType &, KeyTypeKeyCompare); std::pair< const_iterator, const_iterator > - equal_range(const key_type &) const; + equal_range(const key_type &) const; template<typename KeyType, typename KeyTypeKeyCompare> std::pair< const_iterator, const_iterator > - equal_range(const KeyType &, KeyTypeKeyCompare) const; + equal_range(const KeyType &, KeyTypeKeyCompare) const; std::pair< iterator, iterator > - bounded_range(const_reference, const_reference, bool, bool); + bounded_range(const_reference, const_reference, bool, bool); template<typename KeyType, typename KeyTypeKeyCompare> std::pair< iterator, iterator > - bounded_range(const KeyType &, const KeyType &, KeyTypeKeyCompare, bool, + bounded_range(const KeyType &, const KeyType &, KeyTypeKeyCompare, bool, bool); std::pair< const_iterator, const_iterator > - bounded_range(const_reference, const_reference, bool, bool) const; + bounded_range(const_reference, const_reference, bool, bool) const; template<typename KeyType, typename KeyTypeKeyCompare> std::pair< const_iterator, const_iterator > - bounded_range(const KeyType &, const KeyType &, KeyTypeKeyCompare, bool, + bounded_range(const KeyType &, const KeyType &, KeyTypeKeyCompare, bool, bool) const; - iterator iterator_to(reference); - const_iterator iterator_to(const_reference) const; - pointer unlink_leftmost_without_rebalance(); - void replace_node(iterator, reference); - void remove_node(reference); - void splay_up(iterator); + iterator iterator_to(reference); + const_iterator iterator_to(const_reference) const; + pointer unlink_leftmost_without_rebalance(); + void replace_node(iterator, reference); + void remove_node(reference); + void splay_up(iterator); template<typename KeyType, typename KeyTypeKeyCompare> - iterator splay_down(const KeyType &, KeyTypeKeyCompare); - iterator splay_down(const key_type &); - void rebalance(); - iterator rebalance_subtree(iterator); - template<class... Options2> void merge(splay_multiset< T, Options2...> &); - template<class... Options2> void merge(splay_set< T, Options2...> &); + iterator splay_down(const KeyType &, KeyTypeKeyCompare); + iterator splay_down(const key_type &); + void rebalance(); + iterator rebalance_subtree(iterator); + template<class... Options2> void merge(splay_multiset< T, Options2...> &); + template<class... Options2> void merge(splay_set< T, Options2...> &); - // public static functions - static splay_multiset & container_from_end_iterator(iterator); - static const splay_multiset & container_from_end_iterator(const_iterator); - static splay_multiset & container_from_iterator(iterator); - static const splay_multiset & container_from_iterator(const_iterator); - static iterator s_iterator_to(reference); - static const_iterator s_iterator_to(const_reference); - static void init_node(reference); + // public static functions + static splay_multiset & container_from_end_iterator(iterator); + static const splay_multiset & container_from_end_iterator(const_iterator); + static splay_multiset & container_from_iterator(iterator); + static const splay_multiset & container_from_iterator(const_iterator); + static iterator s_iterator_to(reference); + static const_iterator s_iterator_to(const_reference); + static void init_node(reference); // public data members static const bool constant_time_size; @@ -196,13 +196,13 @@ construct/copy/destruct
                  1. -
                    splay_multiset();
                    +
                    splay_multiset();

                    Effects: Constructs an empty container.

                    Complexity: Constant.

                    Throws: If value_traits::node_traits::node constructor throws (this does not happen with predefined Boost.Intrusive hooks) or the copy constructor of the key_compare object throws. Basic guarantee.

                  2. -
                    explicit splay_multiset(const key_compare & cmp, 
+
                    explicit splay_multiset(const key_compare & cmp, 
                         const value_traits & v_traits = value_traits());
                    
 
                    Effects: Constructs an empty container with given comparison and traits.
                    
 
                    Complexity: Constant.
                    
@@ -210,7 +210,7 @@
 
                  3. template<typename Iterator> 
-  splay_multiset(Iterator b, Iterator e, 
+  splay_multiset(Iterator b, Iterator e, 
                  const key_compare & cmp = key_compare(), 
                  const value_traits & v_traits = value_traits());

                    Requires: Dereferencing iterator must yield an lvalue of type value_type. cmp must be a comparison function that induces a strict weak ordering.

                    @@ -219,17 +219,17 @@

                    Throws: If value_traits::node_traits::node constructor throws (this does not happen with predefined Boost.Intrusive hooks) or the copy constructor/operator() of the key_compare object throws. Basic guarantee.

                  4. -
                    splay_multiset(splay_multiset && x);
                    +
                    splay_multiset(splay_multiset && x);

                    Effects: Constructs a container moving resources from another container. Internal comparison object and value traits are move constructed and nodes belonging to x (except the node representing the "end") are linked to *this.

                    Complexity: Constant.

                    Throws: If value_traits::node_traits::node's move constructor throws (this does not happen with predefined Boost.Intrusive hooks) or the move constructor of the comparison objet throws.

                  5. -
                    splay_multiset & operator=(splay_multiset && x);
                    +
                    splay_multiset & operator=(splay_multiset && x);

                    Effects: Equivalent to swap

                  6. -
                    ~splay_multiset();
                    +
                    ~splay_multiset();

                    Effects: Detaches all elements from this. The objects in the set are not deleted (i.e. no destructors are called), but the nodes according to the value_traits template parameter are reinitialized and thus can be reused.

                    Complexity: Linear to elements contained in *this.

                    Throws: Nothing.

                    @@ -238,131 +238,131 @@

                  -splay_multiset public member functions

                  +splay_multiset public member functions
                  1. -
                    iterator begin();
                    +
                    iterator begin();

                    Effects: Returns an iterator pointing to the beginning of the container.

                    Complexity: Constant.

                    Throws: Nothing.

                  2. -
                    const_iterator begin() const;
                    +
                    const_iterator begin() const;

                    Effects: Returns a const_iterator pointing to the beginning of the container.

                    Complexity: Constant.

                    Throws: Nothing.

                  3. -
                    const_iterator cbegin() const;
                    +
                    const_iterator cbegin() const;

                    Effects: Returns a const_iterator pointing to the beginning of the container.

                    Complexity: Constant.

                    Throws: Nothing.

                  4. -
                    iterator end();
                    +
                    iterator end();

                    Effects: Returns an iterator pointing to the end of the container.

                    Complexity: Constant.

                    Throws: Nothing.

                  5. -
                    const_iterator end() const;
                    +
                    const_iterator end() const;

                    Effects: Returns a const_iterator pointing to the end of the container.

                    Complexity: Constant.

                    Throws: Nothing.

                  6. -
                    const_iterator cend() const;
                    +
                    const_iterator cend() const;

                    Effects: Returns a const_iterator pointing to the end of the container.

                    Complexity: Constant.

                    Throws: Nothing.

                  7. -
                    reverse_iterator rbegin();
                    +
                    reverse_iterator rbegin();

                    Effects: Returns a reverse_iterator pointing to the beginning of the reversed container.

                    Complexity: Constant.

                    Throws: Nothing.

                  8. -
                    const_reverse_iterator rbegin() const;
                    +
                    const_reverse_iterator rbegin() const;

                    Effects: Returns a const_reverse_iterator pointing to the beginning of the reversed container.

                    Complexity: Constant.

                    Throws: Nothing.

                  9. -
                    const_reverse_iterator crbegin() const;
                    +
                    const_reverse_iterator crbegin() const;

                    Effects: Returns a const_reverse_iterator pointing to the beginning of the reversed container.

                    Complexity: Constant.

                    Throws: Nothing.

                  10. -
                    reverse_iterator rend();
                    +
                    reverse_iterator rend();

                    Effects: Returns a reverse_iterator pointing to the end of the reversed container.

                    Complexity: Constant.

                    Throws: Nothing.

                  11. -
                    const_reverse_iterator rend() const;
                    +
                    const_reverse_iterator rend() const;

                    Effects: Returns a const_reverse_iterator pointing to the end of the reversed container.

                    Complexity: Constant.

                    Throws: Nothing.

                  12. -
                    const_reverse_iterator crend() const;
                    +
                    const_reverse_iterator crend() const;

                    Effects: Returns a const_reverse_iterator pointing to the end of the reversed container.

                    Complexity: Constant.

                    Throws: Nothing.

                  13. -
                    iterator root();
                    +
                    iterator root();

                    Effects: Returns a iterator pointing to the root node of the container or end() if not present.

                    Complexity: Constant.

                    Throws: Nothing.

                  14. -
                    const_iterator root() const;
                    +
                    const_iterator root() const;

                    Effects: Returns a const_iterator pointing to the root node of the container or cend() if not present.

                    Complexity: Constant.

                    Throws: Nothing.

                  15. -
                    const_iterator croot() const;
                    +
                    const_iterator croot() const;

                    Effects: Returns a const_iterator pointing to the root node of the container or cend() if not present.

                    Complexity: Constant.

                    Throws: Nothing.

                  16. -
                    key_compare key_comp() const;
                    +
                    key_compare key_comp() const;

                    Effects: Returns the key_compare object used by the container.

                    Complexity: Constant.

                    Throws: If key_compare copy-constructor throws.

                  17. -
                    value_compare value_comp() const;
                    +
                    value_compare value_comp() const;

                    Effects: Returns the value_compare object used by the container.

                    Complexity: Constant.

                    Throws: If value_compare copy-constructor throws.

                  18. -
                    bool empty() const;
                    +
                    bool empty() const;

                    Effects: Returns true if the container is empty.

                    Complexity: Constant.

                    Throws: Nothing.

                  19. -
                    size_type size() const;
                    +
                    size_type size() const;

                    Effects: Returns the number of elements stored in the container.

                    Complexity: Linear to elements contained in *this if constant-time size option is disabled. Constant time otherwise.

                    Throws: Nothing.

                  20. -
                    void swap(splay_multiset & other);
                    +
                    void swap(splay_multiset & other);

                    Effects: Swaps the contents of two containers.

                    Complexity: Constant.

                    Throws: If the comparison functor's swap call throws. 

                  21. template<typename Cloner, typename Disposer> 
-  void clone_from(const splay_multiset & src, Cloner cloner, 
+  void clone_from(const splay_multiset & src, Cloner cloner, 
                   Disposer disposer);

                    Requires: Disposer::operator()(pointer) shouldn't throw. Cloner should yield to nodes equivalent to the original nodes.

                    Effects: Erases all the elements from *this calling Disposer::operator()(pointer), clones all the elements from src calling Cloner::operator()(const_reference ) and inserts them on *this. Copies the predicate from the source container.

                    @@ -372,7 +372,7 @@ 
                  22. template<typename Cloner, typename Disposer> 
-  void clone_from(splay_multiset && src, Cloner cloner, Disposer disposer);
                    + void clone_from(splay_multiset && src, Cloner cloner, Disposer disposer);

                    Requires: Disposer::operator()(pointer) shouldn't throw. Cloner should yield to nodes equivalent to the original nodes.

                    Effects: Erases all the elements from *this calling Disposer::operator()(pointer), clones all the elements from src calling Cloner::operator()(reference) and inserts them on *this. Copies the predicate from the source container.

                    If cloner throws, all cloned elements are unlinked and disposed calling Disposer::operator()(pointer).

                    @@ -381,7 +381,7 @@

                    Note: This version can modify the source container, useful to implement move semantics.

                  23. -
                    iterator insert(reference value);
                    +
                    iterator insert(reference value);

                    Requires: value must be an lvalue

                    Effects: Inserts value into the container before the upper bound.

                    Complexity: Average complexity for insert element is at most logarithmic.

                    @@ -389,7 +389,7 @@

                    Note: Does not affect the validity of iterators and references. No copy-constructors are called.

                  24. -
                    iterator insert(const_iterator hint, reference value);
                    +
                    iterator insert(const_iterator hint, reference value);

                    Requires: value must be an lvalue, and "hint" must be a valid iterator.

                    Effects: Inserts x into the container, using "hint" as a hint to where it will be inserted. If "hint" is the upper_bound the insertion takes constant time (two comparisons in the worst case)

                    Complexity: Logarithmic in general, but it is amortized constant time if t is inserted immediately before hint.

                    @@ -397,7 +397,7 @@

                    Note: Does not affect the validity of iterators and references. No copy-constructors are called.

                  25. -
                    template<typename Iterator> void insert(Iterator b, Iterator e);
                    +
                    template<typename Iterator> void insert(Iterator b, Iterator e);

                    Requires: Dereferencing iterator must yield an lvalue of type value_type.

                    Effects: Inserts a each element of a range into the container before the upper bound of the key of each element.

                    Complexity: Insert range is in general O(N * log(N)), where N is the size of the range. However, it is linear in N if the range is already sorted by value_comp().

                    @@ -405,7 +405,7 @@

                    Note: Does not affect the validity of iterators and references. No copy-constructors are called.

                  26. -
                    iterator insert_before(const_iterator pos, reference value);
                    +
                    iterator insert_before(const_iterator pos, reference value);

                    Requires: value must be an lvalue, "pos" must be a valid iterator (or end) and must be the succesor of value once inserted according to the predicate

                    Effects: Inserts x into the container before "pos".

                    Complexity: Constant time.

                    @@ -413,7 +413,7 @@

                    Note: This function does not check preconditions so if "pos" is not the successor of "value" container ordering invariant will be broken. This is a low-level function to be used only for performance reasons by advanced users.

                  27. -
                    void push_back(reference value);
                    +
                    void push_back(reference value);

                    Requires: value must be an lvalue, and it must be no less than the greatest inserted key

                    Effects: Inserts x into the container in the last position.

                    Complexity: Constant time.

                    @@ -421,7 +421,7 @@

                    Note: This function does not check preconditions so if value is less than the greatest inserted key container ordering invariant will be broken. This function is slightly more efficient than using "insert_before". This is a low-level function to be used only for performance reasons by advanced users.

                  28. -
                    void push_front(reference value);
                    +
                    void push_front(reference value);

                    Requires: value must be an lvalue, and it must be no greater than the minimum inserted key

                    Effects: Inserts x into the container in the first position.

                    Complexity: Constant time.

                    @@ -429,21 +429,21 @@

                    Note: This function does not check preconditions so if value is greater than the minimum inserted key container ordering invariant will be broken. This function is slightly more efficient than using "insert_before". This is a low-level function to be used only for performance reasons by advanced users.

                  29. -
                    iterator erase(const_iterator i);
                    +
                    iterator erase(const_iterator i);

                    Effects: Erases the element pointed to by i.

                    Complexity: Average complexity for erase element is constant time.

                    Throws: Nothing.

                    Note: Invalidates the iterators (but not the references) to the erased elements. No destructors are called.

                  30. -
                    iterator erase(const_iterator b, const_iterator e);
                    +
                    iterator erase(const_iterator b, const_iterator e);

                    Effects: Erases the range pointed to by b end e.

                    Complexity: Average complexity for erase range is at most O(log(size() + N)), where N is the number of elements in the range.

                    Throws: Nothing.

                    Note: Invalidates the iterators (but not the references) to the erased elements. No destructors are called.

                  31. -
                    size_type erase(const key_type & key);
                    +
                    size_type erase(const key_type & key);

                    Effects: Erases all the elements with the given value.

                    Returns: The number of erased elements.

                    Complexity: O(log(size() + N).

                    @@ -452,7 +452,7 @@ 
                  32. template<typename KeyType, typename KeyTypeKeyCompare> 
-  size_type erase(const KeyType & key, KeyTypeKeyCompare comp);
                    + size_type erase(const KeyType & key, KeyTypeKeyCompare comp);

                    Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk), with nk the key_type of a value_type inserted into *this.

                    Effects: Erases all the elements with the given key. according to the comparison functor "comp".

                    Returns: The number of erased elements.

                    @@ -462,7 +462,7 @@ 
                  33. template<typename Disposer> 
-  iterator erase_and_dispose(const_iterator i, Disposer disposer);
                    + iterator erase_and_dispose(const_iterator i, Disposer disposer);

                    Requires: Disposer::operator()(pointer) shouldn't throw.

                    Effects: Erases the element pointed to by i. Disposer::operator()(pointer) is called for the removed element.

                    Complexity: Average complexity for erase element is constant time.

                    @@ -471,7 +471,7 @@ 
                  34. template<typename Disposer> 
-  iterator erase_and_dispose(const_iterator b, const_iterator e, 
+  iterator erase_and_dispose(const_iterator b, const_iterator e, 
                              Disposer disposer);

                    Requires: Disposer::operator()(pointer) shouldn't throw.

                    Effects: Erases the range pointed to by b end e. Disposer::operator()(pointer) is called for the removed elements.

                    @@ -481,7 +481,7 @@ 
                  35. template<typename Disposer> 
-  size_type erase_and_dispose(const key_type & key, Disposer disposer);
                    + size_type erase_and_dispose(const key_type & key, Disposer disposer);

                    Requires: Disposer::operator()(pointer) shouldn't throw.

                    Effects: Erases all the elements with the given value. Disposer::operator()(pointer) is called for the removed elements.

                    Returns: The number of erased elements.

                    @@ -491,7 +491,7 @@ 
                  36. template<typename KeyType, typename KeyTypeKeyCompare, typename Disposer> 
-  size_type erase_and_dispose(const KeyType & key, KeyTypeKeyCompare comp, 
+  size_type erase_and_dispose(const KeyType & key, KeyTypeKeyCompare comp, 
                               Disposer disposer);

                    Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk) and nk the key_type of a value_type inserted into *this.

                    Requires: Disposer::operator()(pointer) shouldn't throw.

                    @@ -502,47 +502,47 @@

                    Note: Invalidates the iterators to the erased elements.

                  37. -
                    void clear();
                    +
                    void clear();

                    Effects: Erases all of the elements.

                    Complexity: Linear to the number of elements on the container. if it's a safe-mode or auto-unlink value_type. Constant time otherwise.

                    Throws: Nothing.

                    Note: Invalidates the iterators (but not the references) to the erased elements. No destructors are called.

                  38. -
                    template<typename Disposer> void clear_and_dispose(Disposer disposer);
                    +
                    template<typename Disposer> void clear_and_dispose(Disposer disposer);

                    Effects: Erases all of the elements calling disposer(p) for each node to be erased. Complexity: Average complexity for is at most O(log(size() + N)), where N is the number of elements in the container.

                    Throws: Nothing.

                    Note: Invalidates the iterators (but not the references) to the erased elements. Calls N times to disposer functor.

                  39. -
                    size_type count(const key_type &);
                    +
                    size_type count(const key_type &);

                    Effects: Returns the number of contained elements with the given value

                    Complexity: Logarithmic to the number of elements contained plus lineal to number of objects with the given value.

                    Throws: If key_compare throws. Additional note: non-const function, splaying is performed. 

                  40. template<typename KeyType, typename KeyTypeKeyCompare> 
-  size_type count(const KeyType & key, KeyTypeKeyCompare comp);
                    + size_type count(const KeyType & key, KeyTypeKeyCompare comp);

                    Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk), and nk the key_type of a value_type inserted into *this.

                    Effects: Returns the number of contained elements with the given key

                    Complexity: Logarithmic to the number of elements contained plus lineal to number of objects with the given key.

                    Throws: If comp throws. Additional note: const function, no splaying is performed

                  41. -
                    iterator lower_bound(const key_type & key);
                    +
                    iterator lower_bound(const key_type & key);

                    Effects: Returns an iterator to the first element whose key is not less than k or end() if that element does not exist.

                    Complexity: Logarithmic.

                    Throws: If key_compare throws. Additional note: non-const function, splaying is performed. 

                  42. template<typename KeyType, typename KeyTypeKeyCompare> 
-  iterator lower_bound(const KeyType & key, KeyTypeKeyCompare comp);
                    + iterator lower_bound(const KeyType & key, KeyTypeKeyCompare comp);

                    Effects: Returns an iterator to the first element whose key is not less than k or end() if that element does not exist.

                    Complexity: Logarithmic.

                    Throws: If key_compare throws. Additional note: non-const function, splaying is performed for the first element of the equal range of "key"

                  43. -
                    const_iterator lower_bound(const key_type & key) const;
                    +
                    const_iterator lower_bound(const key_type & key) const;

                    Effects: Returns an iterator to the first element whose key is not less than k or end() if that element does not exist.

                    Complexity: Logarithmic.

                    Throws: If key_compare throws. Additional note: const function, no splaying is performed

                    @@ -550,27 +550,27 @@ 
                  44. template<typename KeyType, typename KeyTypeKeyCompare> 
   const_iterator 
-  lower_bound(const KeyType & key, KeyTypeKeyCompare comp) const;
                    + lower_bound(const KeyType & key, KeyTypeKeyCompare comp) const;

                    Effects: Returns an iterator to the first element whose key is not less than k or end() if that element does not exist.

                    Complexity: Logarithmic.

                    Throws: If key_compare throws. Additional note: const function, no splaying is performed

                  45. -
                    iterator upper_bound(const key_type & key);
                    +
                    iterator upper_bound(const key_type & key);

                    Effects: Returns an iterator to the first element whose key is greater than k or end() if that element does not exist.

                    Complexity: Logarithmic.

                    Throws: If key_compare throws. Additional note: non-const function, splaying is performed for the first element of the equal range of "value" 

                  46. template<typename KeyType, typename KeyTypeKeyCompare> 
-  iterator upper_bound(const KeyType & key, KeyTypeKeyCompare comp);
                    + iterator upper_bound(const KeyType & key, KeyTypeKeyCompare comp);

                    Requires: key is a value such that *this is partitioned with respect to !comp(key, nk), with nk the key_type of a value_type inserted into *this.

                    Effects: Returns an iterator to the first element whose key is greater than k according to comp or end() if that element does not exist.

                    Complexity: Logarithmic.

                    Throws: If comp throws. Additional note: non-const function, splaying is performed for the first element of the equal range of "key"

                  47. -
                    const_iterator upper_bound(const key_type & key) const;
                    +
                    const_iterator upper_bound(const key_type & key) const;

                    Effects: Returns an iterator to the first element whose key is greater than k or end() if that element does not exist.

                    Complexity: Logarithmic.

                    Throws: If key_compare throws. Additional note: const function, no splaying is performed

                    @@ -578,42 +578,42 @@ 
                  48. template<typename KeyType, typename KeyTypeKeyCompare> 
   const_iterator 
-  upper_bound(const KeyType & key, KeyTypeKeyCompare comp) const;
                    + upper_bound(const KeyType & key, KeyTypeKeyCompare comp) const;

                    Requires: key is a value such that *this is partitioned with respect to !comp(key, nk), with nk the key_type of a value_type inserted into *this.

                    Effects: Returns an iterator to the first element whose key is greater than k according to comp or end() if that element does not exist.

                    Complexity: Logarithmic.

                    Throws: If comp throws. Additional note: const function, no splaying is performed

                  49. -
                    iterator find(const key_type & key);
                    +
                    iterator find(const key_type & key);

                    Effects: Finds an iterator to the first element whose key is k or end() if that element does not exist.

                    Complexity: Logarithmic.

                    Throws: If key_compare throws. Additional note: non-const function, splaying is performed for the first element of the equal range of "value" 

                  50. template<typename KeyType, typename KeyTypeKeyCompare> 
-  iterator find(const KeyType & key, KeyTypeKeyCompare comp);
                    + iterator find(const KeyType & key, KeyTypeKeyCompare comp);

                    Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk), and nk the key_type of a value_type inserted into *this.

                    Effects: Finds an iterator to the first element whose key is k or end() if that element does not exist.

                    Complexity: Logarithmic.

                    Throws: If comp throws. Additional note: non-const function, splaying is performed for the first element of the equal range of "key"

                  51. -
                    const_iterator find(const key_type & key) const;
                    +
                    const_iterator find(const key_type & key) const;

                    Effects: Finds an iterator to the first element whose key is k or end() if that element does not exist.

                    Complexity: Logarithmic.

                    Throws: If key_compare throws. Additional note: const function, no splaying is performed 

                  52. template<typename KeyType, typename KeyTypeKeyCompare> 
-  const_iterator find(const KeyType & key, KeyTypeKeyCompare comp) const;
                    + const_iterator find(const KeyType & key, KeyTypeKeyCompare comp) const;

                    Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk), and nk the key_type of a value_type inserted into *this.

                    Effects: Finds an iterator to the first element whose key is k or end() if that element does not exist.

                    Complexity: Logarithmic.

                    Throws: If comp throws. Additional note: const function, no splaying is performed

                  53. -
                    std::pair< iterator, iterator > equal_range(const key_type & key);
                    +
                    std::pair< iterator, iterator > equal_range(const key_type & key);

                    Effects: Finds a range containing all elements whose key is k or an empty range that indicates the position where those elements would be if they there is no elements with key k.

                    Complexity: Logarithmic.

                    Throws: If key_compare throws. Additional note: non-const function, splaying is performed for the first element of the equal range of "value"

                    @@ -621,7 +621,7 @@ 
                  54. template<typename KeyType, typename KeyTypeKeyCompare> 
   std::pair< iterator, iterator > 
-  equal_range(const KeyType & key, KeyTypeKeyCompare comp);
                    + equal_range(const KeyType & key, KeyTypeKeyCompare comp);

                    Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk), with nk the key_type of a value_type inserted into *this.

                    Effects: Finds a range containing all elements whose key is k or an empty range that indicates the position where those elements would be if they there is no elements with key k.

                    Complexity: Logarithmic.

                    @@ -629,7 +629,7 @@ 
                  55. std::pair< const_iterator, const_iterator > 
-equal_range(const key_type & key) const;
                    +equal_range(const key_type & key) const;

                    Effects: Finds a range containing all elements whose key is k or an empty range that indicates the position where those elements would be if they there is no elements with key k.

                    Complexity: Logarithmic.

                    Throws: If key_compare throws. Additional note: const function, no splaying is performed

                    @@ -637,7 +637,7 @@ 
                  56. template<typename KeyType, typename KeyTypeKeyCompare> 
   std::pair< const_iterator, const_iterator > 
-  equal_range(const KeyType & key, KeyTypeKeyCompare comp) const;
                    + equal_range(const KeyType & key, KeyTypeKeyCompare comp) const;

                    Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk), with nk the key_type of a value_type inserted into *this.

                    Effects: Finds a range containing all elements whose key is k or an empty range that indicates the position where those elements would be if they there is no elements with key k.

                    Complexity: Logarithmic.

                    @@ -645,7 +645,7 @@ 
                  57. std::pair< iterator, iterator > 
-bounded_range(const_reference lower_value, const_reference upper_value, 
+bounded_range(const_reference lower_value, const_reference upper_value, 
               bool left_closed, bool right_closed);

                    Requires: upper_key shall not precede lower_key according to key_compare. [key_comp()(upper_key, lower_key) shall be false]

                    If lower_key is equivalent to upper_key [!key_comp()(upper_key, lower_key) && !key_comp()(lower_key, upper_key)] then ('left_closed' || 'right_closed') must be false.

                    @@ -660,7 +660,7 @@ 
                  58. template<typename KeyType, typename KeyTypeKeyCompare> 
   std::pair< iterator, iterator > 
-  bounded_range(const KeyType & lower_key, const KeyType & upper_key, 
+  bounded_range(const KeyType & lower_key, const KeyType & upper_key, 
                 KeyTypeKeyCompare comp, bool left_closed, bool right_closed);

                    Requires: lower_key is a value such that *this is partitioned with respect to comp(nk, lower_key) if left_closed is true, with respect to !comp(lower_key, nk) otherwise.

                    upper_key is a value such that *this is partitioned with respect to !comp(upper_key, nk) if right_closed is true, with respect to comp(nk, upper_key) otherwise.

                    @@ -676,7 +676,7 @@ 
                  59. std::pair< const_iterator, const_iterator > 
-bounded_range(const_reference lower_value, const_reference upper_value, 
+bounded_range(const_reference lower_value, const_reference upper_value, 
               bool left_closed, bool right_closed) const;

                    Requires: upper_key shall not precede lower_key according to key_compare. [key_comp()(upper_key, lower_key) shall be false]

                    If lower_key is equivalent to upper_key [!key_comp()(upper_key, lower_key) && !key_comp()(lower_key, upper_key)] then ('left_closed' || 'right_closed') must be false.

                    @@ -691,7 +691,7 @@ 
                  60. template<typename KeyType, typename KeyTypeKeyCompare> 
   std::pair< const_iterator, const_iterator > 
-  bounded_range(const KeyType & lower_key, const KeyType & upper_key, 
+  bounded_range(const KeyType & lower_key, const KeyType & upper_key, 
                 KeyTypeKeyCompare comp, bool left_closed, bool right_closed) const;

                    Requires: lower_key is a value such that *this is partitioned with respect to comp(nk, lower_key) if left_closed is true, with respect to !comp(lower_key, nk) otherwise.

                    upper_key is a value such that *this is partitioned with respect to !comp(upper_key, nk) if right_closed is true, with respect to comp(nk, upper_key) otherwise.

                    @@ -706,28 +706,28 @@

                    Note: Experimental function, the interface might change in future releases.

                  61. -
                    iterator iterator_to(reference value);
                    +
                    iterator iterator_to(reference value);

                    Requires: value must be an lvalue and shall be in a set of appropriate type. Otherwise the behavior is undefined.

                    Effects: Returns: a valid iterator i belonging to the set that points to the value

                    Complexity: Constant.

                    Throws: Nothing.

                  62. -
                    const_iterator iterator_to(const_reference value) const;
                    +
                    const_iterator iterator_to(const_reference value) const;

                    Requires: value must be an lvalue and shall be in a set of appropriate type. Otherwise the behavior is undefined.

                    Effects: Returns: a valid const_iterator i belonging to the set that points to the value

                    Complexity: Constant.

                    Throws: Nothing.

                  63. -
                    pointer unlink_leftmost_without_rebalance();
                    +
                    pointer unlink_leftmost_without_rebalance();

                    Effects: Unlinks the leftmost node from the container.

                    Complexity: Average complexity is constant time.

                    Throws: Nothing.

                    Notes: This function breaks the container and the container can only be used for more unlink_leftmost_without_rebalance calls. This function is normally used to achieve a step by step controlled destruction of the container.

                  64. -
                    void replace_node(iterator replace_this, reference with_this);
                    +
                    void replace_node(iterator replace_this, reference with_this);

                    Requires: replace_this must be a valid iterator of *this and with_this must not be inserted in any container.

                    Effects: Replaces replace_this in its position in the container with with_this. The container does not need to be rebalanced.

                    Complexity: Constant.

                    @@ -735,7 +735,7 @@

                    Note: This function will break container ordering invariants if with_this is not equivalent to *replace_this according to the ordering rules. This function is faster than erasing and inserting the node, since no rebalancing or comparison is needed.

                  65. -
                    void remove_node(reference value);
                    +
                    void remove_node(reference value);

                    Effects: removes "value" from the container.

                    Throws: Nothing.

                    Complexity: Logarithmic time.

                    @@ -743,7 +743,7 @@

                    If the user calls this function with a constant time size container or stateful comparison functor a compilation error will be issued.

                  66. -
                    void splay_up(iterator i);
                    +
                    void splay_up(iterator i);

                    Requires: i must be a valid iterator of *this.

                    Effects: Rearranges the container so that the element pointed by i is placed as the root of the tree, improving future searches of this value.

                    Complexity: Amortized logarithmic.

                    @@ -751,27 +751,27 @@ 
                  67. template<typename KeyType, typename KeyTypeKeyCompare> 
-  iterator splay_down(const KeyType & key, KeyTypeKeyCompare comp);
                    + iterator splay_down(const KeyType & key, KeyTypeKeyCompare comp);

                    Effects: Rearranges the container so that if *this stores an element with a key equivalent to value the element is placed as the root of the tree. If the element is not present returns the last node compared with the key. If the tree is empty, end() is returned.

                    Complexity: Amortized logarithmic.

                    Returns: An iterator to the new root of the tree, end() if the tree is empty.

                    Throws: If the comparison functor throws.

                  68. -
                    iterator splay_down(const key_type & key);
                    +
                    iterator splay_down(const key_type & key);

                    Effects: Rearranges the container so that if *this stores an element with a key equivalent to value the element is placed as the root of the tree.

                    Complexity: Amortized logarithmic.

                    Returns: An iterator to the new root of the tree, end() if the tree is empty.

                    Throws: If the predicate throws.

                  69. -
                    void rebalance();
                    +
                    void rebalance();

                    Effects: Rebalances the tree.

                    Throws: Nothing.

                    Complexity: Linear.

                  70. -
                    iterator rebalance_subtree(iterator root);
                    +
                    iterator rebalance_subtree(iterator root);

                    Requires: old_root is a node of a tree.

                    Effects: Rebalances the subtree rooted at old_root.

                    Returns: The new root of the subtree.

                    @@ -780,7 +780,7 @@ 
                  71. template<class... Options2> 
-  void merge(splay_multiset< T, Options2...> & source);
                    + void merge(splay_multiset< T, Options2...> & source);

                    Requires: "source" container's Options can only can differ in the comparison function from *this.

                    Effects: Extracts each element in source and insert it into a using the comparison object of *this.

                    Postcondition: Pointers and references to the transferred elements of source refer to those same elements but as members of *this. Iterators referring to the transferred elements will continue to refer to their elements, but they now behave as iterators into *this, not into source.

                    @@ -788,7 +788,7 @@

                    Complexity: N log(a.size() + N) (N has the value source.size())

                  72. -
                    template<class... Options2> void merge(splay_set< T, Options2...> & source);
                    +
                    template<class... Options2> void merge(splay_set< T, Options2...> & source);

                    Requires: "source" container's Options can only can differ in the comparison function from *this.

                    Effects: Extracts each element in source and insert it into a using the comparison object of *this.

                    Postcondition: Pointers and references to the transferred elements of source refer to those same elements but as members of *this. Iterators referring to the transferred elements will continue to refer to their elements, but they now behave as iterators into *this, not into source.

                    @@ -799,10 +799,10 @@

                  -splay_multiset public static functions

                  +splay_multiset public static functions
                  1. -
                    static splay_multiset & container_from_end_iterator(iterator end_iterator);
                    +
                    static splay_multiset & container_from_end_iterator(iterator end_iterator);

                    Precondition: end_iterator must be a valid end iterator of the container.

                    Effects: Returns a const reference to the container associated to the end iterator

                    Throws: Nothing.

                    @@ -810,28 +810,28 @@ 
                  2. static const splay_multiset & 
-container_from_end_iterator(const_iterator end_iterator);
                    +container_from_end_iterator(const_iterator end_iterator);

                    Precondition: end_iterator must be a valid end iterator of the container.

                    Effects: Returns a const reference to the container associated to the end iterator

                    Throws: Nothing.

                    Complexity: Constant.

                  3. -
                    static splay_multiset & container_from_iterator(iterator it);
                    +
                    static splay_multiset & container_from_iterator(iterator it);

                    Precondition: it must be a valid iterator of the container.

                    Effects: Returns a const reference to the container associated to the iterator

                    Throws: Nothing.

                    Complexity: Logarithmic.

                  4. -
                    static const splay_multiset & container_from_iterator(const_iterator it);
                    +
                    static const splay_multiset & container_from_iterator(const_iterator it);

                    Precondition: it must be a valid iterator of the container.

                    Effects: Returns a const reference to the container associated to the iterator

                    Throws: Nothing.

                    Complexity: Logarithmic.

                  5. -
                    static iterator s_iterator_to(reference value);
                    +
                    static iterator s_iterator_to(reference value);

                    Requires: value must be an lvalue and shall be in a set of appropriate type. Otherwise the behavior is undefined.

                    Effects: Returns: a valid iterator i belonging to the set that points to the value

                    Complexity: Constant.

                    @@ -839,7 +839,7 @@

                    Note: This static function is available only if the value traits is stateless.

                  6. -
                    static const_iterator s_iterator_to(const_reference value);
                    +
                    static const_iterator s_iterator_to(const_reference value);

                    Requires: value must be an lvalue and shall be in a set of appropriate type. Otherwise the behavior is undefined.

                    Effects: Returns: a valid iterator i belonging to the set that points to the value

                    Complexity: Constant.

                    @@ -847,7 +847,7 @@

                    Note: This static function is available only if the value traits is stateless.

                  7. -
                    static void init_node(reference value);
                    +
                    static void init_node(reference value);

                    Requires: value shall not be in a container.

                    Effects: init_node puts the hook of a value in a well-known default state.

                    Throws: Nothing.

                    diff --git a/doc/html/boost/intrusive/splay_set.html b/doc/html/boost/intrusive/splay_set.html index 3483f83524..bcee721a44 100644 --- a/doc/html/boost/intrusive/splay_set.html +++ b/doc/html/boost/intrusive/splay_set.html @@ -60,141 +60,141 @@ typedef implementation_defined::node_algorithms node_algorithms; // construct/copy/destruct - splay_set(); - explicit splay_set(const key_compare &, + splay_set(); + explicit splay_set(const key_compare &, const value_traits & = value_traits()); template<typename Iterator> - splay_set(Iterator, Iterator, const key_compare & = key_compare(), + splay_set(Iterator, Iterator, const key_compare & = key_compare(), const value_traits & = value_traits()); - splay_set(splay_set &&); - splay_set & operator=(splay_set &&); - ~splay_set(); + splay_set(splay_set &&); + splay_set & operator=(splay_set &&); + ~splay_set(); - // public member functions - iterator begin(); - const_iterator begin() const; - const_iterator cbegin() const; - iterator end(); - const_iterator end() const; - const_iterator cend() const; - reverse_iterator rbegin(); - const_reverse_iterator rbegin() const; - const_reverse_iterator crbegin() const; - reverse_iterator rend(); - const_reverse_iterator rend() const; - const_reverse_iterator crend() const; - iterator root(); - const_iterator root() const; - const_iterator croot() const; - key_compare key_comp() const; - value_compare value_comp() const; - bool empty() const; - size_type size() const; - void swap(splay_set &); + // public member functions + iterator begin(); + const_iterator begin() const; + const_iterator cbegin() const; + iterator end(); + const_iterator end() const; + const_iterator cend() const; + reverse_iterator rbegin(); + const_reverse_iterator rbegin() const; + const_reverse_iterator crbegin() const; + reverse_iterator rend(); + const_reverse_iterator rend() const; + const_reverse_iterator crend() const; + iterator root(); + const_iterator root() const; + const_iterator croot() const; + key_compare key_comp() const; + value_compare value_comp() const; + bool empty() const; + size_type size() const; + void swap(splay_set &); template<typename Cloner, typename Disposer> - void clone_from(const splay_set &, Cloner, Disposer); + void clone_from(const splay_set &, Cloner, Disposer); template<typename Cloner, typename Disposer> - void clone_from(splay_set &&, Cloner, Disposer); - std::pair< iterator, bool > insert(reference); - iterator insert(const_iterator, reference); + void clone_from(splay_set &&, Cloner, Disposer); + std::pair< iterator, bool > insert(reference); + iterator insert(const_iterator, reference); std::pair< iterator, bool > - insert_check(const key_type &, insert_commit_data &); + insert_check(const key_type &, insert_commit_data &); std::pair< iterator, bool > - insert_check(const_iterator, const key_type &, insert_commit_data &); + insert_check(const_iterator, const key_type &, insert_commit_data &); template<typename KeyType, typename KeyTypeKeyCompare> std::pair< iterator, bool > - insert_check(const KeyType &, KeyTypeKeyCompare, insert_commit_data &); + insert_check(const KeyType &, KeyTypeKeyCompare, insert_commit_data &); template<typename KeyType, typename KeyTypeKeyCompare> std::pair< iterator, bool > - insert_check(const_iterator, const KeyType &, KeyTypeKeyCompare, + insert_check(const_iterator, const KeyType &, KeyTypeKeyCompare, insert_commit_data &); - template<typename Iterator> void insert(Iterator, Iterator); - iterator insert_commit(reference, const insert_commit_data &); - iterator insert_before(const_iterator, reference); - void push_back(reference); - void push_front(reference); - iterator erase(const_iterator); - iterator erase(const_iterator, const_iterator); - size_type erase(const key_type &); + template<typename Iterator> void insert(Iterator, Iterator); + iterator insert_commit(reference, const insert_commit_data &); + iterator insert_before(const_iterator, reference); + void push_back(reference); + void push_front(reference); + iterator erase(const_iterator); + iterator erase(const_iterator, const_iterator); + size_type erase(const key_type &); template<typename KeyType, typename KeyTypeKeyCompare> - size_type erase(const KeyType &, KeyTypeKeyCompare); + size_type erase(const KeyType &, KeyTypeKeyCompare); template<typename Disposer> - iterator erase_and_dispose(const_iterator, Disposer); + iterator erase_and_dispose(const_iterator, Disposer); template<typename Disposer> - iterator erase_and_dispose(const_iterator, const_iterator, Disposer); + iterator erase_and_dispose(const_iterator, const_iterator, Disposer); template<typename Disposer> - size_type erase_and_dispose(const key_type &, Disposer); + size_type erase_and_dispose(const key_type &, Disposer); template<typename KeyType, typename KeyTypeKeyCompare, typename Disposer> - size_type erase_and_dispose(const KeyType &, KeyTypeKeyCompare, Disposer); - void clear(); - template<typename Disposer> void clear_and_dispose(Disposer); - size_type count(const key_type &) const; + size_type erase_and_dispose(const KeyType &, KeyTypeKeyCompare, Disposer); + void clear(); + template<typename Disposer> void clear_and_dispose(Disposer); + size_type count(const key_type &) const; template<typename KeyType, typename KeyTypeKeyCompare> - size_type count(const KeyType &, KeyTypeKeyCompare) const; - size_type count(const key_type &) const; + size_type count(const KeyType &, KeyTypeKeyCompare) const; + size_type count(const key_type &) const; template<typename KeyType, typename KeyTypeKeyCompare> - size_type count(const KeyType &, KeyTypeKeyCompare) const; - iterator lower_bound(const key_type &); + size_type count(const KeyType &, KeyTypeKeyCompare) const; + iterator lower_bound(const key_type &); template<typename KeyType, typename KeyTypeKeyCompare> - iterator lower_bound(const KeyType &, KeyTypeKeyCompare); - const_iterator lower_bound(const key_type &) const; + iterator lower_bound(const KeyType &, KeyTypeKeyCompare); + const_iterator lower_bound(const key_type &) const; template<typename KeyType, typename KeyTypeKeyCompare> - const_iterator lower_bound(const KeyType &, KeyTypeKeyCompare) const; - iterator upper_bound(const key_type &); + const_iterator lower_bound(const KeyType &, KeyTypeKeyCompare) const; + iterator upper_bound(const key_type &); template<typename KeyType, typename KeyTypeKeyCompare> - iterator upper_bound(const KeyType &, KeyTypeKeyCompare); - const_iterator upper_bound(const key_type &) const; + iterator upper_bound(const KeyType &, KeyTypeKeyCompare); + const_iterator upper_bound(const key_type &) const; template<typename KeyType, typename KeyTypeKeyCompare> - const_iterator upper_bound(const KeyType &, KeyTypeKeyCompare) const; - iterator find(const key_type &); + const_iterator upper_bound(const KeyType &, KeyTypeKeyCompare) const; + iterator find(const key_type &); template<typename KeyType, typename KeyTypeKeyCompare> - iterator find(const KeyType &, KeyTypeKeyCompare); - const_iterator find(const key_type &) const; + iterator find(const KeyType &, KeyTypeKeyCompare); + const_iterator find(const key_type &) const; template<typename KeyType, typename KeyTypeKeyCompare> - const_iterator find(const KeyType &, KeyTypeKeyCompare) const; - std::pair< iterator, iterator > equal_range(const key_type &); + const_iterator find(const KeyType &, KeyTypeKeyCompare) const; + std::pair< iterator, iterator > equal_range(const key_type &); template<typename KeyType, typename KeyTypeKeyCompare> std::pair< iterator, iterator > - equal_range(const KeyType &, KeyTypeKeyCompare); + equal_range(const KeyType &, KeyTypeKeyCompare); std::pair< const_iterator, const_iterator > - equal_range(const key_type &) const; + equal_range(const key_type &) const; template<typename KeyType, typename KeyTypeKeyCompare> std::pair< const_iterator, const_iterator > - equal_range(const KeyType &, KeyTypeKeyCompare) const; + equal_range(const KeyType &, KeyTypeKeyCompare) const; std::pair< iterator, iterator > - bounded_range(const key_type &, const key_type &, bool, bool); + bounded_range(const key_type &, const key_type &, bool, bool); template<typename KeyType, typename KeyTypeKeyCompare> std::pair< iterator, iterator > - bounded_range(const KeyType &, const KeyType &, KeyTypeKeyCompare, bool, + bounded_range(const KeyType &, const KeyType &, KeyTypeKeyCompare, bool, bool); std::pair< const_iterator, const_iterator > - bounded_range(const key_type &, const key_type &, bool, bool) const; + bounded_range(const key_type &, const key_type &, bool, bool) const; template<typename KeyType, typename KeyTypeKeyCompare> std::pair< const_iterator, const_iterator > - bounded_range(const KeyType &, const KeyType &, KeyTypeKeyCompare, bool, + bounded_range(const KeyType &, const KeyType &, KeyTypeKeyCompare, bool, bool) const; - iterator iterator_to(reference); - const_iterator iterator_to(const_reference) const; - pointer unlink_leftmost_without_rebalance(); - void replace_node(iterator, reference); - void remove_node(reference); - void splay_up(iterator); + iterator iterator_to(reference); + const_iterator iterator_to(const_reference) const; + pointer unlink_leftmost_without_rebalance(); + void replace_node(iterator, reference); + void remove_node(reference); + void splay_up(iterator); template<typename KeyType, typename KeyTypeKeyCompare> - iterator splay_down(const KeyType &, KeyTypeKeyCompare); - iterator splay_down(const key_type &); - void rebalance(); - iterator rebalance_subtree(iterator); - template<class... Options2> void merge(splay_set< T, Options2...> &); - template<class... Options2> void merge(splay_multiset< T, Options2...> &); + iterator splay_down(const KeyType &, KeyTypeKeyCompare); + iterator splay_down(const key_type &); + void rebalance(); + iterator rebalance_subtree(iterator); + template<class... Options2> void merge(splay_set< T, Options2...> &); + template<class... Options2> void merge(splay_multiset< T, Options2...> &); - // public static functions - static splay_set & container_from_end_iterator(iterator); - static const splay_set & container_from_end_iterator(const_iterator); - static splay_set & container_from_iterator(iterator); - static const splay_set & container_from_iterator(const_iterator); - static iterator s_iterator_to(reference); - static const_iterator s_iterator_to(const_reference); - static void init_node(reference); + // public static functions + static splay_set & container_from_end_iterator(iterator); + static const splay_set & container_from_end_iterator(const_iterator); + static splay_set & container_from_iterator(iterator); + static const splay_set & container_from_iterator(const_iterator); + static iterator s_iterator_to(reference); + static const_iterator s_iterator_to(const_reference); + static void init_node(reference); // public data members static const bool constant_time_size; @@ -211,13 +211,13 @@ construct/copy/destruct
                    1. -
                      splay_set();
                      +
                      splay_set();

                      Effects: Constructs an empty container.

                      Complexity: Constant.

                      Throws: If value_traits::node_traits::node constructor throws (this does not happen with predefined Boost.Intrusive hooks) or the copy constructor of the key_compare object throws. Basic guarantee.

                    2. -
                      explicit splay_set(const key_compare & cmp, 
+
                      explicit splay_set(const key_compare & cmp, 
                    const value_traits & v_traits = value_traits());
                      
 
                      Effects: Constructs an empty container with given comparison and traits.
                      
 
                      Complexity: Constant.
                      
@@ -225,7 +225,7 @@
 
                    3. template<typename Iterator> 
-  splay_set(Iterator b, Iterator e, const key_compare & cmp = key_compare(), 
+  splay_set(Iterator b, Iterator e, const key_compare & cmp = key_compare(), 
             const value_traits & v_traits = value_traits());

                      Requires: Dereferencing iterator must yield an lvalue of type value_type. cmp must be a comparison function that induces a strict weak ordering.

                      Effects: Constructs an empty container and inserts elements from [b, e).

                      @@ -233,17 +233,17 @@

                      Throws: If value_traits::node_traits::node constructor throws (this does not happen with predefined Boost.Intrusive hooks) or the copy constructor/operator() of the key_compare object throws. Basic guarantee.

                    4. -
                      splay_set(splay_set && x);
                      +
                      splay_set(splay_set && x);

                      Effects: Constructs a container moving resources from another container. Internal comparison object and value traits are move constructed and nodes belonging to x (except the node representing the "end") are linked to *this.

                      Complexity: Constant.

                      Throws: If value_traits::node_traits::node's move constructor throws (this does not happen with predefined Boost.Intrusive hooks) or the move constructor of the comparison objet throws.

                    5. -
                      splay_set & operator=(splay_set && x);
                      +
                      splay_set & operator=(splay_set && x);

                      Effects: Equivalent to swap

                    6. -
                      ~splay_set();
                      +
                      ~splay_set();

                      Effects: Detaches all elements from this. The objects in the set are not deleted (i.e. no destructors are called), but the nodes according to the value_traits template parameter are reinitialized and thus can be reused.

                      Complexity: Linear to elements contained in *this.

                      Throws: Nothing.

                      @@ -252,131 +252,131 @@

                    -splay_set public member functions

                    +splay_set public member functions
                    1. -
                      iterator begin();
                      +
                      iterator begin();

                      Effects: Returns an iterator pointing to the beginning of the container.

                      Complexity: Constant.

                      Throws: Nothing.

                    2. -
                      const_iterator begin() const;
                      +
                      const_iterator begin() const;

                      Effects: Returns a const_iterator pointing to the beginning of the container.

                      Complexity: Constant.

                      Throws: Nothing.

                    3. -
                      const_iterator cbegin() const;
                      +
                      const_iterator cbegin() const;

                      Effects: Returns a const_iterator pointing to the beginning of the container.

                      Complexity: Constant.

                      Throws: Nothing.

                    4. -
                      iterator end();
                      +
                      iterator end();

                      Effects: Returns an iterator pointing to the end of the container.

                      Complexity: Constant.

                      Throws: Nothing.

                    5. -
                      const_iterator end() const;
                      +
                      const_iterator end() const;

                      Effects: Returns a const_iterator pointing to the end of the container.

                      Complexity: Constant.

                      Throws: Nothing.

                    6. -
                      const_iterator cend() const;
                      +
                      const_iterator cend() const;

                      Effects: Returns a const_iterator pointing to the end of the container.

                      Complexity: Constant.

                      Throws: Nothing.

                    7. -
                      reverse_iterator rbegin();
                      +
                      reverse_iterator rbegin();

                      Effects: Returns a reverse_iterator pointing to the beginning of the reversed container.

                      Complexity: Constant.

                      Throws: Nothing.

                    8. -
                      const_reverse_iterator rbegin() const;
                      +
                      const_reverse_iterator rbegin() const;

                      Effects: Returns a const_reverse_iterator pointing to the beginning of the reversed container.

                      Complexity: Constant.

                      Throws: Nothing.

                    9. -
                      const_reverse_iterator crbegin() const;
                      +
                      const_reverse_iterator crbegin() const;

                      Effects: Returns a const_reverse_iterator pointing to the beginning of the reversed container.

                      Complexity: Constant.

                      Throws: Nothing.

                    10. -
                      reverse_iterator rend();
                      +
                      reverse_iterator rend();

                      Effects: Returns a reverse_iterator pointing to the end of the reversed container.

                      Complexity: Constant.

                      Throws: Nothing.

                    11. -
                      const_reverse_iterator rend() const;
                      +
                      const_reverse_iterator rend() const;

                      Effects: Returns a const_reverse_iterator pointing to the end of the reversed container.

                      Complexity: Constant.

                      Throws: Nothing.

                    12. -
                      const_reverse_iterator crend() const;
                      +
                      const_reverse_iterator crend() const;

                      Effects: Returns a const_reverse_iterator pointing to the end of the reversed container.

                      Complexity: Constant.

                      Throws: Nothing.

                    13. -
                      iterator root();
                      +
                      iterator root();

                      Effects: Returns a iterator pointing to the root node of the container or end() if not present.

                      Complexity: Constant.

                      Throws: Nothing.

                    14. -
                      const_iterator root() const;
                      +
                      const_iterator root() const;

                      Effects: Returns a const_iterator pointing to the root node of the container or cend() if not present.

                      Complexity: Constant.

                      Throws: Nothing.

                    15. -
                      const_iterator croot() const;
                      +
                      const_iterator croot() const;

                      Effects: Returns a const_iterator pointing to the root node of the container or cend() if not present.

                      Complexity: Constant.

                      Throws: Nothing.

                    16. -
                      key_compare key_comp() const;
                      +
                      key_compare key_comp() const;

                      Effects: Returns the key_compare object used by the container.

                      Complexity: Constant.

                      Throws: If key_compare copy-constructor throws.

                    17. -
                      value_compare value_comp() const;
                      +
                      value_compare value_comp() const;

                      Effects: Returns the value_compare object used by the container.

                      Complexity: Constant.

                      Throws: If value_compare copy-constructor throws.

                    18. -
                      bool empty() const;
                      +
                      bool empty() const;

                      Effects: Returns true if the container is empty.

                      Complexity: Constant.

                      Throws: Nothing.

                    19. -
                      size_type size() const;
                      +
                      size_type size() const;

                      Effects: Returns the number of elements stored in the container.

                      Complexity: Linear to elements contained in *this if constant-time size option is disabled. Constant time otherwise.

                      Throws: Nothing.

                    20. -
                      void swap(splay_set & other);
                      +
                      void swap(splay_set & other);

                      Effects: Swaps the contents of two containers.

                      Complexity: Constant.

                      Throws: If the comparison functor's swap call throws. 

                    21. template<typename Cloner, typename Disposer> 
-  void clone_from(const splay_set & src, Cloner cloner, Disposer disposer);
                      + void clone_from(const splay_set & src, Cloner cloner, Disposer disposer);

                      Requires: Disposer::operator()(pointer) shouldn't throw. Cloner should yield to nodes equivalent to the original nodes.

                      Effects: Erases all the elements from *this calling Disposer::operator()(pointer), clones all the elements from src calling Cloner::operator()(const_reference ) and inserts them on *this. Copies the predicate from the source container.

                      If cloner throws, all cloned elements are unlinked and disposed calling Disposer::operator()(pointer).

                      @@ -385,7 +385,7 @@ 
                    22. template<typename Cloner, typename Disposer> 
-  void clone_from(splay_set && src, Cloner cloner, Disposer disposer);
                      + void clone_from(splay_set && src, Cloner cloner, Disposer disposer);

                      Requires: Disposer::operator()(pointer) shouldn't throw. Cloner should yield to nodes equivalent to the original nodes.

                      Effects: Erases all the elements from *this calling Disposer::operator()(pointer), clones all the elements from src calling Cloner::operator()(reference) and inserts them on *this. Copies the predicate from the source container.

                      If cloner throws, all cloned elements are unlinked and disposed calling Disposer::operator()(pointer).

                      @@ -394,7 +394,7 @@

                      Note: This version can modify the source container, useful to implement move semantics.

                    23. -
                      std::pair< iterator, bool > insert(reference value);
                      +
                      std::pair< iterator, bool > insert(reference value);

                      Requires: value must be an lvalue

                      Effects: Inserts value into the container if the value is not already present.

                      Complexity: Average complexity for insert element is at most logarithmic.

                      @@ -402,7 +402,7 @@

                      Note: Does not affect the validity of iterators and references. No copy-constructors are called.

                    24. -
                      iterator insert(const_iterator hint, reference value);
                      +
                      iterator insert(const_iterator hint, reference value);

                      Requires: value must be an lvalue, and "hint" must be a valid iterator

                      Effects: Tries to insert x into the container, using "hint" as a hint to where it will be inserted.

                      Complexity: Logarithmic in general, but it is amortized constant time (two comparisons in the worst case) if t is inserted immediately before hint.

                      @@ -411,7 +411,7 @@ 
                    25. std::pair< iterator, bool > 
-insert_check(const key_type & key, insert_commit_data & commit_data);
                      +insert_check(const key_type & key, insert_commit_data & commit_data);

                      Effects: Checks if a value can be inserted in the container, using a user provided key instead of the value itself.

                      Returns: If there is an equivalent value returns a pair containing an iterator to the already present value and false. If the value can be inserted returns true in the returned pair boolean and fills "commit_data" that is meant to be used with the "insert_commit" function.

                      Complexity: Average complexity is at most logarithmic.

                      @@ -419,7 +419,7 @@ 
                    26. std::pair< iterator, bool > 
-insert_check(const_iterator hint, const key_type & key, 
+insert_check(const_iterator hint, const key_type & key, 
              insert_commit_data & commit_data);

                      Effects: Checks if a value can be inserted in the container, using a user provided key instead of the value itself, using "hint" as a hint to where it will be inserted.

                      Returns: If there is an equivalent value returns a pair containing an iterator to the already present value and false. If the value can be inserted returns true in the returned pair boolean and fills "commit_data" that is meant to be used with the "insert_commit" function.

                      @@ -429,7 +429,7 @@ 
                    27. template<typename KeyType, typename KeyTypeKeyCompare> 
   std::pair< iterator, bool > 
-  insert_check(const KeyType & key, KeyTypeKeyCompare comp, 
+  insert_check(const KeyType & key, KeyTypeKeyCompare comp, 
                insert_commit_data & commit_data);

                      Requires: comp must be a comparison function that induces the same strict weak ordering as key_compare. The difference is that comp compares an arbitrary key with the contained values.

                      Effects: Checks if a value can be inserted in the container, using a user provided key instead of the value itself.

                      @@ -443,7 +443,7 @@ 
                    28. template<typename KeyType, typename KeyTypeKeyCompare> 
   std::pair< iterator, bool > 
-  insert_check(const_iterator hint, const KeyType & key, 
+  insert_check(const_iterator hint, const KeyType & key, 
                KeyTypeKeyCompare comp, insert_commit_data & commit_data);

                      Requires: comp must be a comparison function that induces the same strict weak ordering as key_compare. The difference is that comp compares an arbitrary key with the contained values.

                      Effects: Checks if a value can be inserted in the container, using a user provided key instead of the value itself, using "hint" as a hint to where it will be inserted.

                      @@ -455,7 +455,7 @@

                      "commit_data" remains valid for a subsequent "insert_commit" only if no more objects are inserted or erased from the container.

                    29. -
                      template<typename Iterator> void insert(Iterator b, Iterator e);
                      +
                      template<typename Iterator> void insert(Iterator b, Iterator e);

                      Requires: Dereferencing iterator must yield an lvalue of type value_type.

                      Effects: Tries to insert each element of a range into the container.

                      Complexity: Insert range is in general O(N * log(N)), where N is the size of the range. However, it is linear in N if the range is already sorted by value_comp().

                      @@ -463,7 +463,7 @@

                      Note: Does not affect the validity of iterators and references. No copy-constructors are called.

                    30. -
                      iterator insert_commit(reference value, 
+
                      iterator insert_commit(reference value, 
                        const insert_commit_data & commit_data);
                      
 
                      Requires: value must be an lvalue of type value_type. commit_data must have been obtained from a previous call to "insert_check". No objects should have been inserted or erased from the container between the "insert_check" that filled "commit_data" and the call to "insert_commit".
                      
 
                      Effects: Inserts the value in the container using the information obtained from the "commit_data" that a previous "insert_check" filled.
                      
@@ -473,7 +473,7 @@
 
                      Notes: This function has only sense if a "insert_check" has been previously executed to fill "commit_data". No value should be inserted or erased between the "insert_check" and "insert_commit" calls.
                    31. -
                      iterator insert_before(const_iterator pos, reference value);
                      +
                      iterator insert_before(const_iterator pos, reference value);

                      Requires: value must be an lvalue, "pos" must be a valid iterator (or end) and must be the succesor of value once inserted according to the predicate

                      Effects: Inserts x into the container before "pos".

                      Complexity: Constant time.

                      @@ -481,7 +481,7 @@

                      Note: This function does not check preconditions so if "pos" is not the successor of "value" container ordering invariant will be broken. This is a low-level function to be used only for performance reasons by advanced users.

                    32. -
                      void push_back(reference value);
                      +
                      void push_back(reference value);

                      Requires: value must be an lvalue, and it must be no less than the greatest inserted key

                      Effects: Inserts x into the container in the last position.

                      Complexity: Constant time.

                      @@ -489,7 +489,7 @@

                      Note: This function does not check preconditions so if value is less than the greatest inserted key container ordering invariant will be broken. This function is slightly more efficient than using "insert_before". This is a low-level function to be used only for performance reasons by advanced users.

                    33. -
                      void push_front(reference value);
                      +
                      void push_front(reference value);

                      Requires: value must be an lvalue, and it must be no greater than the minimum inserted key

                      Effects: Inserts x into the container in the first position.

                      Complexity: Constant time.

                      @@ -497,21 +497,21 @@

                      Note: This function does not check preconditions so if value is greater than the minimum inserted key container ordering invariant will be broken. This function is slightly more efficient than using "insert_before". This is a low-level function to be used only for performance reasons by advanced users.

                    34. -
                      iterator erase(const_iterator i);
                      +
                      iterator erase(const_iterator i);

                      Effects: Erases the element pointed to by i.

                      Complexity: Average complexity for erase element is constant time.

                      Throws: Nothing.

                      Note: Invalidates the iterators (but not the references) to the erased elements. No destructors are called.

                    35. -
                      iterator erase(const_iterator b, const_iterator e);
                      +
                      iterator erase(const_iterator b, const_iterator e);

                      Effects: Erases the range pointed to by b end e.

                      Complexity: Average complexity for erase range is at most O(log(size() + N)), where N is the number of elements in the range.

                      Throws: Nothing.

                      Note: Invalidates the iterators (but not the references) to the erased elements. No destructors are called.

                    36. -
                      size_type erase(const key_type & key);
                      +
                      size_type erase(const key_type & key);

                      Effects: Erases all the elements with the given value.

                      Returns: The number of erased elements.

                      Complexity: O(log(size() + N).

                      @@ -520,7 +520,7 @@ 
                    37. template<typename KeyType, typename KeyTypeKeyCompare> 
-  size_type erase(const KeyType & key, KeyTypeKeyCompare comp);
                      + size_type erase(const KeyType & key, KeyTypeKeyCompare comp);

                      Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk), with nk the key_type of a value_type inserted into *this.

                      Effects: Erases all the elements with the given key. according to the comparison functor "comp".

                      Returns: The number of erased elements.

                      @@ -530,7 +530,7 @@ 
                    38. template<typename Disposer> 
-  iterator erase_and_dispose(const_iterator i, Disposer disposer);
                      + iterator erase_and_dispose(const_iterator i, Disposer disposer);

                      Requires: Disposer::operator()(pointer) shouldn't throw.

                      Effects: Erases the element pointed to by i. Disposer::operator()(pointer) is called for the removed element.

                      Complexity: Average complexity for erase element is constant time.

                      @@ -539,7 +539,7 @@ 
                    39. template<typename Disposer> 
-  iterator erase_and_dispose(const_iterator b, const_iterator e, 
+  iterator erase_and_dispose(const_iterator b, const_iterator e, 
                              Disposer disposer);

                      Requires: Disposer::operator()(pointer) shouldn't throw.

                      Effects: Erases the range pointed to by b end e. Disposer::operator()(pointer) is called for the removed elements.

                      @@ -549,7 +549,7 @@ 
                    40. template<typename Disposer> 
-  size_type erase_and_dispose(const key_type & key, Disposer disposer);
                      + size_type erase_and_dispose(const key_type & key, Disposer disposer);

                      Requires: Disposer::operator()(pointer) shouldn't throw.

                      Effects: Erases all the elements with the given value. Disposer::operator()(pointer) is called for the removed elements.

                      Returns: The number of erased elements.

                      @@ -559,7 +559,7 @@ 
                    41. template<typename KeyType, typename KeyTypeKeyCompare, typename Disposer> 
-  size_type erase_and_dispose(const KeyType & key, KeyTypeKeyCompare comp, 
+  size_type erase_and_dispose(const KeyType & key, KeyTypeKeyCompare comp, 
                               Disposer disposer);

                      Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk) and nk the key_type of a value_type inserted into *this.

                      Requires: Disposer::operator()(pointer) shouldn't throw.

                      @@ -570,61 +570,61 @@

                      Note: Invalidates the iterators to the erased elements.

                    42. -
                      void clear();
                      +
                      void clear();

                      Effects: Erases all of the elements.

                      Complexity: Linear to the number of elements on the container. if it's a safe-mode or auto-unlink value_type. Constant time otherwise.

                      Throws: Nothing.

                      Note: Invalidates the iterators (but not the references) to the erased elements. No destructors are called.

                    43. -
                      template<typename Disposer> void clear_and_dispose(Disposer disposer);
                      +
                      template<typename Disposer> void clear_and_dispose(Disposer disposer);

                      Effects: Erases all of the elements calling disposer(p) for each node to be erased. Complexity: Average complexity for is at most O(log(size() + N)), where N is the number of elements in the container.

                      Throws: Nothing.

                      Note: Invalidates the iterators (but not the references) to the erased elements. Calls N times to disposer functor.

                    44. -
                      size_type count(const key_type & key) const;
                      +
                      size_type count(const key_type & key) const;

                      Effects: Returns the number of contained elements with the given value

                      Complexity: Logarithmic to the number of elements contained plus lineal to number of objects with the given value.

                      Throws: If key_compare throws. Additional note: const function, no splaying is performed 

                    45. template<typename KeyType, typename KeyTypeKeyCompare> 
-  size_type count(const KeyType & key, KeyTypeKeyCompare comp) const;
                      + size_type count(const KeyType & key, KeyTypeKeyCompare comp) const;

                      Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk), and nk the key_type of a value_type inserted into *this.

                      Effects: Returns the number of contained elements with the given key

                      Complexity: Logarithmic to the number of elements contained plus lineal to number of objects with the given key.

                      Throws: If comp throws. Additional note: const function, no splaying is performed

                    46. -
                      size_type count(const key_type & key) const;
                      +
                      size_type count(const key_type & key) const;

                      Effects: Returns the number of contained elements with the given value

                      Complexity: Logarithmic to the number of elements contained plus lineal to number of objects with the given value.

                      Throws: If key_compare throws. Additional note: const function, no splaying is performed 

                    47. template<typename KeyType, typename KeyTypeKeyCompare> 
-  size_type count(const KeyType & key, KeyTypeKeyCompare comp) const;
                      + size_type count(const KeyType & key, KeyTypeKeyCompare comp) const;

                      Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk), and nk the key_type of a value_type inserted into *this.

                      Effects: Returns the number of contained elements with the given key

                      Complexity: Logarithmic to the number of elements contained plus lineal to number of objects with the given key.

                      Throws: If comp throws. Additional note: const function, no splaying is performed

                    48. -
                      iterator lower_bound(const key_type & key);
                      +
                      iterator lower_bound(const key_type & key);

                      Effects: Returns an iterator to the first element whose key is not less than k or end() if that element does not exist.

                      Complexity: Logarithmic.

                      Throws: If key_compare throws. Additional note: non-const function, splaying is performed. 

                    49. template<typename KeyType, typename KeyTypeKeyCompare> 
-  iterator lower_bound(const KeyType & key, KeyTypeKeyCompare comp);
                      + iterator lower_bound(const KeyType & key, KeyTypeKeyCompare comp);

                      Effects: Returns an iterator to the first element whose key is not less than k or end() if that element does not exist.

                      Complexity: Logarithmic.

                      Throws: If key_compare throws. Additional note: non-const function, splaying is performed for the first element of the equal range of "key"

                    50. -
                      const_iterator lower_bound(const key_type & key) const;
                      +
                      const_iterator lower_bound(const key_type & key) const;

                      Effects: Returns an iterator to the first element whose key is not less than k or end() if that element does not exist.

                      Complexity: Logarithmic.

                      Throws: If key_compare throws. Additional note: const function, no splaying is performed

                      @@ -632,27 +632,27 @@ 
                    51. template<typename KeyType, typename KeyTypeKeyCompare> 
   const_iterator 
-  lower_bound(const KeyType & key, KeyTypeKeyCompare comp) const;
                      + lower_bound(const KeyType & key, KeyTypeKeyCompare comp) const;

                      Effects: Returns an iterator to the first element whose key is not less than k or end() if that element does not exist.

                      Complexity: Logarithmic.

                      Throws: If key_compare throws. Additional note: const function, no splaying is performed

                    52. -
                      iterator upper_bound(const key_type & key);
                      +
                      iterator upper_bound(const key_type & key);

                      Effects: Returns an iterator to the first element whose key is greater than k or end() if that element does not exist.

                      Complexity: Logarithmic.

                      Throws: If key_compare throws. Additional note: non-const function, splaying is performed for the first element of the equal range of "value" 

                    53. template<typename KeyType, typename KeyTypeKeyCompare> 
-  iterator upper_bound(const KeyType & key, KeyTypeKeyCompare comp);
                      + iterator upper_bound(const KeyType & key, KeyTypeKeyCompare comp);

                      Requires: key is a value such that *this is partitioned with respect to !comp(key, nk), with nk the key_type of a value_type inserted into *this.

                      Effects: Returns an iterator to the first element whose key is greater than k according to comp or end() if that element does not exist.

                      Complexity: Logarithmic.

                      Throws: If comp throws. Additional note: non-const function, splaying is performed for the first element of the equal range of "key"

                    54. -
                      const_iterator upper_bound(const key_type & key) const;
                      +
                      const_iterator upper_bound(const key_type & key) const;

                      Effects: Returns an iterator to the first element whose key is greater than k or end() if that element does not exist.

                      Complexity: Logarithmic.

                      Throws: If key_compare throws. Additional note: const function, no splaying is performed

                      @@ -660,42 +660,42 @@ 
                    55. template<typename KeyType, typename KeyTypeKeyCompare> 
   const_iterator 
-  upper_bound(const KeyType & key, KeyTypeKeyCompare comp) const;
                      + upper_bound(const KeyType & key, KeyTypeKeyCompare comp) const;

                      Requires: key is a value such that *this is partitioned with respect to !comp(key, nk), with nk the key_type of a value_type inserted into *this.

                      Effects: Returns an iterator to the first element whose key is greater than k according to comp or end() if that element does not exist.

                      Complexity: Logarithmic.

                      Throws: If comp throws. Additional note: const function, no splaying is performed

                    56. -
                      iterator find(const key_type & key);
                      +
                      iterator find(const key_type & key);

                      Effects: Finds an iterator to the first element whose key is k or end() if that element does not exist.

                      Complexity: Logarithmic.

                      Throws: If key_compare throws. Additional note: non-const function, splaying is performed for the first element of the equal range of "value" 

                    57. template<typename KeyType, typename KeyTypeKeyCompare> 
-  iterator find(const KeyType & key, KeyTypeKeyCompare comp);
                      + iterator find(const KeyType & key, KeyTypeKeyCompare comp);

                      Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk), and nk the key_type of a value_type inserted into *this.

                      Effects: Finds an iterator to the first element whose key is k or end() if that element does not exist.

                      Complexity: Logarithmic.

                      Throws: If comp throws. Additional note: non-const function, splaying is performed for the first element of the equal range of "key"

                    58. -
                      const_iterator find(const key_type & key) const;
                      +
                      const_iterator find(const key_type & key) const;

                      Effects: Finds an iterator to the first element whose key is k or end() if that element does not exist.

                      Complexity: Logarithmic.

                      Throws: If key_compare throws. Additional note: const function, no splaying is performed 

                    59. template<typename KeyType, typename KeyTypeKeyCompare> 
-  const_iterator find(const KeyType & key, KeyTypeKeyCompare comp) const;
                      + const_iterator find(const KeyType & key, KeyTypeKeyCompare comp) const;

                      Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk), and nk the key_type of a value_type inserted into *this.

                      Effects: Finds an iterator to the first element whose key is k or end() if that element does not exist.

                      Complexity: Logarithmic.

                      Throws: If comp throws. Additional note: const function, no splaying is performed

                    60. -
                      std::pair< iterator, iterator > equal_range(const key_type & key);
                      +
                      std::pair< iterator, iterator > equal_range(const key_type & key);

                      Effects: Finds a range containing all elements whose key is k or an empty range that indicates the position where those elements would be if they there is no elements with key k.

                      Complexity: Logarithmic.

                      Throws: If key_compare throws.

                      @@ -703,7 +703,7 @@ 
                    61. template<typename KeyType, typename KeyTypeKeyCompare> 
   std::pair< iterator, iterator > 
-  equal_range(const KeyType & key, KeyTypeKeyCompare comp);
                      + equal_range(const KeyType & key, KeyTypeKeyCompare comp);

                      Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk), with nk the key_type of a value_type inserted into *this.

                      Effects: Finds a range containing all elements whose key is k or an empty range that indicates the position where those elements would be if they there is no elements with key k.

                      Complexity: Logarithmic.

                      @@ -711,7 +711,7 @@ 
                    62. std::pair< const_iterator, const_iterator > 
-equal_range(const key_type & key) const;
                      +equal_range(const key_type & key) const;

                      Effects: Finds a range containing all elements whose key is k or an empty range that indicates the position where those elements would be if they there is no elements with key k.

                      Complexity: Logarithmic.

                      Throws: If key_compare throws.

                      @@ -719,7 +719,7 @@ 
                    63. template<typename KeyType, typename KeyTypeKeyCompare> 
   std::pair< const_iterator, const_iterator > 
-  equal_range(const KeyType & key, KeyTypeKeyCompare comp) const;
                      + equal_range(const KeyType & key, KeyTypeKeyCompare comp) const;

                      Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk), with nk the key_type of a value_type inserted into *this.

                      Effects: Finds a range containing all elements whose key is k or an empty range that indicates the position where those elements would be if they there is no elements with key k.

                      Complexity: Logarithmic.

                      @@ -727,7 +727,7 @@ 
                    64. std::pair< iterator, iterator > 
-bounded_range(const key_type & lower_key, const key_type & upper_key, 
+bounded_range(const key_type & lower_key, const key_type & upper_key, 
               bool left_closed, bool right_closed);

                      Requires: upper_key shall not precede lower_key according to key_compare. [key_comp()(upper_key, lower_key) shall be false]

                      If lower_key is equivalent to upper_key [!key_comp()(upper_key, lower_key) && !key_comp()(lower_key, upper_key)] then ('left_closed' || 'right_closed') must be false.

                      @@ -742,7 +742,7 @@ 
                    65. template<typename KeyType, typename KeyTypeKeyCompare> 
   std::pair< iterator, iterator > 
-  bounded_range(const KeyType & lower_key, const KeyType & upper_key, 
+  bounded_range(const KeyType & lower_key, const KeyType & upper_key, 
                 KeyTypeKeyCompare comp, bool left_closed, bool right_closed);

                      Requires: lower_key is a value such that *this is partitioned with respect to comp(nk, lower_key) if left_closed is true, with respect to !comp(lower_key, nk) otherwise.

                      upper_key is a value such that *this is partitioned with respect to !comp(upper_key, nk) if right_closed is true, with respect to comp(nk, upper_key) otherwise.

                      @@ -758,7 +758,7 @@ 
                    66. std::pair< const_iterator, const_iterator > 
-bounded_range(const key_type & lower_key, const key_type & upper_key, 
+bounded_range(const key_type & lower_key, const key_type & upper_key, 
               bool left_closed, bool right_closed) const;

                      Requires: upper_key shall not precede lower_key according to key_compare. [key_comp()(upper_key, lower_key) shall be false]

                      If lower_key is equivalent to upper_key [!key_comp()(upper_key, lower_key) && !key_comp()(lower_key, upper_key)] then ('left_closed' || 'right_closed') must be false.

                      @@ -773,7 +773,7 @@ 
                    67. template<typename KeyType, typename KeyTypeKeyCompare> 
   std::pair< const_iterator, const_iterator > 
-  bounded_range(const KeyType & lower_key, const KeyType & upper_key, 
+  bounded_range(const KeyType & lower_key, const KeyType & upper_key, 
                 KeyTypeKeyCompare comp, bool left_closed, bool right_closed) const;

                      Requires: lower_key is a value such that *this is partitioned with respect to comp(nk, lower_key) if left_closed is true, with respect to !comp(lower_key, nk) otherwise.

                      upper_key is a value such that *this is partitioned with respect to !comp(upper_key, nk) if right_closed is true, with respect to comp(nk, upper_key) otherwise.

                      @@ -788,28 +788,28 @@

                      Note: Experimental function, the interface might change in future releases.

                    68. -
                      iterator iterator_to(reference value);
                      +
                      iterator iterator_to(reference value);

                      Requires: value must be an lvalue and shall be in a set of appropriate type. Otherwise the behavior is undefined.

                      Effects: Returns: a valid iterator i belonging to the set that points to the value

                      Complexity: Constant.

                      Throws: Nothing.

                    69. -
                      const_iterator iterator_to(const_reference value) const;
                      +
                      const_iterator iterator_to(const_reference value) const;

                      Requires: value must be an lvalue and shall be in a set of appropriate type. Otherwise the behavior is undefined.

                      Effects: Returns: a valid const_iterator i belonging to the set that points to the value

                      Complexity: Constant.

                      Throws: Nothing.

                    70. -
                      pointer unlink_leftmost_without_rebalance();
                      +
                      pointer unlink_leftmost_without_rebalance();

                      Effects: Unlinks the leftmost node from the container.

                      Complexity: Average complexity is constant time.

                      Throws: Nothing.

                      Notes: This function breaks the container and the container can only be used for more unlink_leftmost_without_rebalance calls. This function is normally used to achieve a step by step controlled destruction of the container.

                    71. -
                      void replace_node(iterator replace_this, reference with_this);
                      +
                      void replace_node(iterator replace_this, reference with_this);

                      Requires: replace_this must be a valid iterator of *this and with_this must not be inserted in any container.

                      Effects: Replaces replace_this in its position in the container with with_this. The container does not need to be rebalanced.

                      Complexity: Constant.

                      @@ -817,7 +817,7 @@

                      Note: This function will break container ordering invariants if with_this is not equivalent to *replace_this according to the ordering rules. This function is faster than erasing and inserting the node, since no rebalancing or comparison is needed.

                    72. -
                      void remove_node(reference value);
                      +
                      void remove_node(reference value);

                      Effects: removes "value" from the container.

                      Throws: Nothing.

                      Complexity: Logarithmic time.

                      @@ -825,7 +825,7 @@

                      If the user calls this function with a constant time size container or stateful comparison functor a compilation error will be issued.

                    73. -
                      void splay_up(iterator i);
                      +
                      void splay_up(iterator i);

                      Requires: i must be a valid iterator of *this.

                      Effects: Rearranges the container so that the element pointed by i is placed as the root of the tree, improving future searches of this value.

                      Complexity: Amortized logarithmic.

                      @@ -833,27 +833,27 @@ 
                    74. template<typename KeyType, typename KeyTypeKeyCompare> 
-  iterator splay_down(const KeyType & key, KeyTypeKeyCompare comp);
                      + iterator splay_down(const KeyType & key, KeyTypeKeyCompare comp);

                      Effects: Rearranges the container so that if *this stores an element with a key equivalent to value the element is placed as the root of the tree. If the element is not present returns the last node compared with the key. If the tree is empty, end() is returned.

                      Complexity: Amortized logarithmic.

                      Returns: An iterator to the new root of the tree, end() if the tree is empty.

                      Throws: If the comparison functor throws.

                    75. -
                      iterator splay_down(const key_type & key);
                      +
                      iterator splay_down(const key_type & key);

                      Effects: Rearranges the container so that if *this stores an element with a key equivalent to value the element is placed as the root of the tree.

                      Complexity: Amortized logarithmic.

                      Returns: An iterator to the new root of the tree, end() if the tree is empty.

                      Throws: If the predicate throws.

                    76. -
                      void rebalance();
                      +
                      void rebalance();

                      Effects: Rebalances the tree.

                      Throws: Nothing.

                      Complexity: Linear.

                    77. -
                      iterator rebalance_subtree(iterator root);
                      +
                      iterator rebalance_subtree(iterator root);

                      Requires: old_root is a node of a tree.

                      Effects: Rebalances the subtree rooted at old_root.

                      Returns: The new root of the subtree.

                      @@ -861,7 +861,7 @@

                      Complexity: Linear to the elements in the subtree.

                    78. -
                      template<class... Options2> void merge(splay_set< T, Options2...> & source);
                      +
                      template<class... Options2> void merge(splay_set< T, Options2...> & source);

                      Requires: "source" container's Options can only can differ in the comparison function from *this.

                      Effects: Attempts to extract each element in source and insert it into a using the comparison object of *this. If there is an element in a with key equivalent to the key of an element from source, then that element is not extracted from source.

                      Postcondition: Pointers and references to the transferred elements of source refer to those same elements but as members of *this. Iterators referring to the transferred elements will continue to refer to their elements, but they now behave as iterators into *this, not into source.

                      @@ -870,7 +870,7 @@ 
                    79. template<class... Options2> 
-  void merge(splay_multiset< T, Options2...> & source);
                      + void merge(splay_multiset< T, Options2...> & source);

                      Requires: "source" container's Options can only can differ in the comparison function from *this.

                      Effects: Attempts to extract each element in source and insert it into a using the comparison object of *this. If there is an element in a with key equivalent to the key of an element from source, then that element is not extracted from source.

                      Postcondition: Pointers and references to the transferred elements of source refer to those same elements but as members of *this. Iterators referring to the transferred elements will continue to refer to their elements, but they now behave as iterators into *this, not into source.

                      @@ -881,10 +881,10 @@

                    -splay_set public static functions

                    +splay_set public static functions
                    1. -
                      static splay_set & container_from_end_iterator(iterator end_iterator);
                      +
                      static splay_set & container_from_end_iterator(iterator end_iterator);

                      Precondition: end_iterator must be a valid end iterator of the container.

                      Effects: Returns a const reference to the container associated to the end iterator

                      Throws: Nothing.

                      @@ -892,28 +892,28 @@ 
                    2. static const splay_set & 
-container_from_end_iterator(const_iterator end_iterator);
                      +container_from_end_iterator(const_iterator end_iterator);

                      Precondition: end_iterator must be a valid end iterator of the container.

                      Effects: Returns a const reference to the container associated to the end iterator

                      Throws: Nothing.

                      Complexity: Constant.

                    3. -
                      static splay_set & container_from_iterator(iterator it);
                      +
                      static splay_set & container_from_iterator(iterator it);

                      Precondition: it must be a valid iterator of the container.

                      Effects: Returns a const reference to the container associated to the iterator

                      Throws: Nothing.

                      Complexity: Logarithmic.

                    4. -
                      static const splay_set & container_from_iterator(const_iterator it);
                      +
                      static const splay_set & container_from_iterator(const_iterator it);

                      Precondition: it must be a valid iterator of the container.

                      Effects: Returns a const reference to the container associated to the iterator

                      Throws: Nothing.

                      Complexity: Logarithmic.

                    5. -
                      static iterator s_iterator_to(reference value);
                      +
                      static iterator s_iterator_to(reference value);

                      Requires: value must be an lvalue and shall be in a set of appropriate type. Otherwise the behavior is undefined.

                      Effects: Returns: a valid iterator i belonging to the set that points to the value

                      Complexity: Constant.

                      @@ -921,7 +921,7 @@

                      Note: This static function is available only if the value traits is stateless.

                    6. -
                      static const_iterator s_iterator_to(const_reference value);
                      +
                      static const_iterator s_iterator_to(const_reference value);

                      Requires: value must be an lvalue and shall be in a set of appropriate type. Otherwise the behavior is undefined.

                      Effects: Returns: a valid iterator i belonging to the set that points to the value

                      Complexity: Constant.

                      @@ -929,7 +929,7 @@

                      Note: This static function is available only if the value traits is stateless.

                    7. -
                      static void init_node(reference value);
                      +
                      static void init_node(reference value);

                      Requires: value shall not be in a container.

                      Effects: init_node puts the hook of a value in a well-known default state.

                      Throws: Nothing.

                      diff --git a/doc/html/boost/intrusive/splaytree.html b/doc/html/boost/intrusive/splaytree.html index d5c014874f..6b009801fa 100644 --- a/doc/html/boost/intrusive/splaytree.html +++ b/doc/html/boost/intrusive/splaytree.html @@ -60,147 +60,147 @@ typedef implementation_defined::insert_commit_data insert_commit_data; // construct/copy/destruct - splaytree(); - explicit splaytree(const key_compare &, + splaytree(); + explicit splaytree(const key_compare &, const value_traits & = value_traits()); template<typename Iterator> - splaytree(bool, Iterator, Iterator, const key_compare & = key_compare(), + splaytree(bool, Iterator, Iterator, const key_compare & = key_compare(), const value_traits & = value_traits()); - splaytree(splaytree &&); - splaytree & operator=(splaytree &&); - ~splaytree(); + splaytree(splaytree &&); + splaytree & operator=(splaytree &&); + ~splaytree(); - // public member functions - iterator begin(); - const_iterator begin() const; - const_iterator cbegin() const; - iterator end(); - const_iterator end() const; - const_iterator cend() const; - reverse_iterator rbegin(); - const_reverse_iterator rbegin() const; - const_reverse_iterator crbegin() const; - reverse_iterator rend(); - const_reverse_iterator rend() const; - const_reverse_iterator crend() const; - iterator root(); - const_iterator root() const; - const_iterator croot() const; - key_compare key_comp() const; - value_compare value_comp() const; - bool empty() const; - size_type size() const; - void swap(splaytree &); + // public member functions + iterator begin(); + const_iterator begin() const; + const_iterator cbegin() const; + iterator end(); + const_iterator end() const; + const_iterator cend() const; + reverse_iterator rbegin(); + const_reverse_iterator rbegin() const; + const_reverse_iterator crbegin() const; + reverse_iterator rend(); + const_reverse_iterator rend() const; + const_reverse_iterator crend() const; + iterator root(); + const_iterator root() const; + const_iterator croot() const; + key_compare key_comp() const; + value_compare value_comp() const; + bool empty() const; + size_type size() const; + void swap(splaytree &); template<typename Cloner, typename Disposer> - void clone_from(const splaytree &, Cloner, Disposer); + void clone_from(const splaytree &, Cloner, Disposer); template<typename Cloner, typename Disposer> - void clone_from(splaytree &&, Cloner, Disposer); - iterator insert_equal(reference); - iterator insert_equal(const_iterator, reference); - template<typename Iterator> void insert_equal(Iterator, Iterator); - std::pair< iterator, bool > insert_unique(reference); - iterator insert_unique(const_iterator, reference); + void clone_from(splaytree &&, Cloner, Disposer); + iterator insert_equal(reference); + iterator insert_equal(const_iterator, reference); + template<typename Iterator> void insert_equal(Iterator, Iterator); + std::pair< iterator, bool > insert_unique(reference); + iterator insert_unique(const_iterator, reference); std::pair< iterator, bool > - insert_unique_check(const key_type &, insert_commit_data &); + insert_unique_check(const key_type &, insert_commit_data &); std::pair< iterator, bool > - insert_unique_check(const_iterator, const key_type &, insert_commit_data &); + insert_unique_check(const_iterator, const key_type &, insert_commit_data &); template<typename KeyType, typename KeyTypeKeyCompare> std::pair< iterator, bool > - insert_unique_check(const KeyType &, KeyTypeKeyCompare, + insert_unique_check(const KeyType &, KeyTypeKeyCompare, insert_commit_data &); template<typename KeyType, typename KeyTypeKeyCompare> std::pair< iterator, bool > - insert_unique_check(const_iterator, const KeyType &, KeyTypeKeyCompare, + insert_unique_check(const_iterator, const KeyType &, KeyTypeKeyCompare, insert_commit_data &); - iterator insert_unique_commit(reference, const insert_commit_data &); - template<typename Iterator> void insert_unique(Iterator, Iterator); - iterator insert_before(const_iterator, reference); - void push_back(reference); - void push_front(reference); - iterator erase(const_iterator); - iterator erase(const_iterator, const_iterator); - size_type erase(const key_type &); + iterator insert_unique_commit(reference, const insert_commit_data &); + template<typename Iterator> void insert_unique(Iterator, Iterator); + iterator insert_before(const_iterator, reference); + void push_back(reference); + void push_front(reference); + iterator erase(const_iterator); + iterator erase(const_iterator, const_iterator); + size_type erase(const key_type &); template<typename KeyType, typename KeyTypeKeyCompare> - size_type erase(const KeyType &, KeyTypeKeyCompare); + size_type erase(const KeyType &, KeyTypeKeyCompare); template<typename Disposer> - iterator erase_and_dispose(const_iterator, Disposer); + iterator erase_and_dispose(const_iterator, Disposer); template<typename Disposer> - iterator erase_and_dispose(const_iterator, const_iterator, Disposer); + iterator erase_and_dispose(const_iterator, const_iterator, Disposer); template<typename Disposer> - size_type erase_and_dispose(const key_type &, Disposer); + size_type erase_and_dispose(const key_type &, Disposer); template<typename KeyType, typename KeyTypeKeyCompare, typename Disposer> - size_type erase_and_dispose(const KeyType &, KeyTypeKeyCompare, Disposer); - void clear(); - template<typename Disposer> void clear_and_dispose(Disposer); - size_type count(const key_type &); + size_type erase_and_dispose(const KeyType &, KeyTypeKeyCompare, Disposer); + void clear(); + template<typename Disposer> void clear_and_dispose(Disposer); + size_type count(const key_type &); template<typename KeyType, typename KeyTypeKeyCompare> - size_type count(const KeyType &, KeyTypeKeyCompare); - size_type count(const key_type &) const; + size_type count(const KeyType &, KeyTypeKeyCompare); + size_type count(const key_type &) const; template<typename KeyType, typename KeyTypeKeyCompare> - size_type count(const KeyType &, KeyTypeKeyCompare) const; - iterator lower_bound(const key_type &); - const_iterator lower_bound(const key_type &) const; + size_type count(const KeyType &, KeyTypeKeyCompare) const; + iterator lower_bound(const key_type &); + const_iterator lower_bound(const key_type &) const; template<typename KeyType, typename KeyTypeKeyCompare> - iterator lower_bound(const KeyType &, KeyTypeKeyCompare); + iterator lower_bound(const KeyType &, KeyTypeKeyCompare); template<typename KeyType, typename KeyTypeKeyCompare> - const_iterator lower_bound(const KeyType &, KeyTypeKeyCompare) const; - iterator upper_bound(const key_type &); - const_iterator upper_bound(const key_type &) const; + const_iterator lower_bound(const KeyType &, KeyTypeKeyCompare) const; + iterator upper_bound(const key_type &); + const_iterator upper_bound(const key_type &) const; template<typename KeyType, typename KeyTypeKeyCompare> - iterator upper_bound(const KeyType &, KeyTypeKeyCompare); + iterator upper_bound(const KeyType &, KeyTypeKeyCompare); template<typename KeyType, typename KeyTypeKeyCompare> - const_iterator upper_bound(const KeyType &, KeyTypeKeyCompare) const; - iterator find(const key_type &); - const_iterator find(const key_type &) const; + const_iterator upper_bound(const KeyType &, KeyTypeKeyCompare) const; + iterator find(const key_type &); + const_iterator find(const key_type &) const; template<typename KeyType, typename KeyTypeKeyCompare> - iterator find(const KeyType &, KeyTypeKeyCompare); + iterator find(const KeyType &, KeyTypeKeyCompare); template<typename KeyType, typename KeyTypeKeyCompare> - const_iterator find(const KeyType &, KeyTypeKeyCompare) const; - std::pair< iterator, iterator > equal_range(const key_type &); + const_iterator find(const KeyType &, KeyTypeKeyCompare) const; + std::pair< iterator, iterator > equal_range(const key_type &); std::pair< const_iterator, const_iterator > - equal_range(const key_type &) const; + equal_range(const key_type &) const; template<typename KeyType, typename KeyTypeKeyCompare> std::pair< iterator, iterator > - equal_range(const KeyType &, KeyTypeKeyCompare); + equal_range(const KeyType &, KeyTypeKeyCompare); template<typename KeyType, typename KeyTypeKeyCompare> std::pair< const_iterator, const_iterator > - equal_range(const KeyType &, KeyTypeKeyCompare) const; + equal_range(const KeyType &, KeyTypeKeyCompare) const; std::pair< iterator, iterator > - bounded_range(const key_type &, const key_type &, bool, bool); + bounded_range(const key_type &, const key_type &, bool, bool); template<typename KeyType, typename KeyTypeKeyCompare> std::pair< iterator, iterator > - bounded_range(const KeyType &, const KeyType &, KeyTypeKeyCompare, bool, + bounded_range(const KeyType &, const KeyType &, KeyTypeKeyCompare, bool, bool); std::pair< const_iterator, const_iterator > - bounded_range(const key_type &, const key_type &, bool, bool) const; + bounded_range(const key_type &, const key_type &, bool, bool) const; template<typename KeyType, typename KeyTypeKeyCompare> std::pair< const_iterator, const_iterator > - bounded_range(const KeyType &, const KeyType &, KeyTypeKeyCompare, bool, + bounded_range(const KeyType &, const KeyType &, KeyTypeKeyCompare, bool, bool) const; - iterator iterator_to(reference); - const_iterator iterator_to(const_reference) const; - pointer unlink_leftmost_without_rebalance(); - void replace_node(iterator, reference); - void remove_node(reference); + iterator iterator_to(reference); + const_iterator iterator_to(const_reference) const; + pointer unlink_leftmost_without_rebalance(); + void replace_node(iterator, reference); + void remove_node(reference); template<typename T, class... Options2> - void merge_unique(splaytree< T, Options2...> &); + void merge_unique(splaytree< T, Options2...> &); template<typename T, class... Options2> - void merge_equal(splaytree< T, Options2...> &); - void splay_up(iterator); + void merge_equal(splaytree< T, Options2...> &); + void splay_up(iterator); template<typename KeyType, typename KeyTypeKeyCompare> - iterator splay_down(const KeyType &, KeyTypeKeyCompare); - iterator splay_down(const key_type &); - void rebalance(); - iterator rebalance_subtree(iterator); + iterator splay_down(const KeyType &, KeyTypeKeyCompare); + iterator splay_down(const key_type &); + void rebalance(); + iterator rebalance_subtree(iterator); - // public static functions - static splaytree & container_from_end_iterator(iterator); - static const splaytree & container_from_end_iterator(const_iterator); - static splaytree & container_from_iterator(iterator); - static const splaytree & container_from_iterator(const_iterator); - static iterator s_iterator_to(reference); - static const_iterator s_iterator_to(const_reference); - static void init_node(reference); + // public static functions + static splaytree & container_from_end_iterator(iterator); + static const splaytree & container_from_end_iterator(const_iterator); + static splaytree & container_from_iterator(iterator); + static const splaytree & container_from_iterator(const_iterator); + static iterator s_iterator_to(reference); + static const_iterator s_iterator_to(const_reference); + static void init_node(reference); // public data members static const bool constant_time_size; @@ -217,13 +217,13 @@ construct/copy/destruct
                      1. -
                        splaytree();
                        +
                        splaytree();

                        Effects: Constructs an empty container.

                        Complexity: Constant.

                        Throws: If value_traits::node_traits::node constructor throws (this does not happen with predefined Boost.Intrusive hooks) or the copy constructor of the key_compare object throws. Basic guarantee.

                      2. -
                        explicit splaytree(const key_compare & cmp, 
+
                        explicit splaytree(const key_compare & cmp, 
                    const value_traits & v_traits = value_traits());
                        
 
                        Effects: Constructs an empty container with given comparison and traits.
                        
 
                        Complexity: Constant.
                        
@@ -231,7 +231,7 @@
 
                      3. template<typename Iterator> 
-  splaytree(bool unique, Iterator b, Iterator e, 
+  splaytree(bool unique, Iterator b, Iterator e, 
             const key_compare & cmp = key_compare(), 
             const value_traits & v_traits = value_traits());

                        Requires: Dereferencing iterator must yield an lvalue of type value_type. cmp must be a comparison function that induces a strict weak ordering.

                        @@ -240,17 +240,17 @@

                        Throws: If value_traits::node_traits::node constructor throws (this does not happen with predefined Boost.Intrusive hooks) or the copy constructor/operator() of the key_compare object throws. Basic guarantee.

                      4. -
                        splaytree(splaytree && x);
                        +
                        splaytree(splaytree && x);

                        Effects: Constructs a container moving resources from another container. Internal comparison object and value traits are move constructed and nodes belonging to x (except the node representing the "end") are linked to *this.

                        Complexity: Constant.

                        Throws: If value_traits::node_traits::node's move constructor throws (this does not happen with predefined Boost.Intrusive hooks) or the move constructor of the comparison objet throws.

                      5. -
                        splaytree & operator=(splaytree && x);
                        +
                        splaytree & operator=(splaytree && x);

                        Effects: Equivalent to swap

                      6. -
                        ~splaytree();
                        +
                        ~splaytree();

                        Effects: Detaches all elements from this. The objects in the set are not deleted (i.e. no destructors are called), but the nodes according to the value_traits template parameter are reinitialized and thus can be reused.

                        Complexity: Linear to elements contained in *this.

                        Throws: Nothing.

                        @@ -259,131 +259,131 @@

                      -splaytree public member functions

                      +splaytree public member functions
                      1. -
                        iterator begin();
                        +
                        iterator begin();

                        Effects: Returns an iterator pointing to the beginning of the container.

                        Complexity: Constant.

                        Throws: Nothing.

                      2. -
                        const_iterator begin() const;
                        +
                        const_iterator begin() const;

                        Effects: Returns a const_iterator pointing to the beginning of the container.

                        Complexity: Constant.

                        Throws: Nothing.

                      3. -
                        const_iterator cbegin() const;
                        +
                        const_iterator cbegin() const;

                        Effects: Returns a const_iterator pointing to the beginning of the container.

                        Complexity: Constant.

                        Throws: Nothing.

                      4. -
                        iterator end();
                        +
                        iterator end();

                        Effects: Returns an iterator pointing to the end of the container.

                        Complexity: Constant.

                        Throws: Nothing.

                      5. -
                        const_iterator end() const;
                        +
                        const_iterator end() const;

                        Effects: Returns a const_iterator pointing to the end of the container.

                        Complexity: Constant.

                        Throws: Nothing.

                      6. -
                        const_iterator cend() const;
                        +
                        const_iterator cend() const;

                        Effects: Returns a const_iterator pointing to the end of the container.

                        Complexity: Constant.

                        Throws: Nothing.

                      7. -
                        reverse_iterator rbegin();
                        +
                        reverse_iterator rbegin();

                        Effects: Returns a reverse_iterator pointing to the beginning of the reversed container.

                        Complexity: Constant.

                        Throws: Nothing.

                      8. -
                        const_reverse_iterator rbegin() const;
                        +
                        const_reverse_iterator rbegin() const;

                        Effects: Returns a const_reverse_iterator pointing to the beginning of the reversed container.

                        Complexity: Constant.

                        Throws: Nothing.

                      9. -
                        const_reverse_iterator crbegin() const;
                        +
                        const_reverse_iterator crbegin() const;

                        Effects: Returns a const_reverse_iterator pointing to the beginning of the reversed container.

                        Complexity: Constant.

                        Throws: Nothing.

                      10. -
                        reverse_iterator rend();
                        +
                        reverse_iterator rend();

                        Effects: Returns a reverse_iterator pointing to the end of the reversed container.

                        Complexity: Constant.

                        Throws: Nothing.

                      11. -
                        const_reverse_iterator rend() const;
                        +
                        const_reverse_iterator rend() const;

                        Effects: Returns a const_reverse_iterator pointing to the end of the reversed container.

                        Complexity: Constant.

                        Throws: Nothing.

                      12. -
                        const_reverse_iterator crend() const;
                        +
                        const_reverse_iterator crend() const;

                        Effects: Returns a const_reverse_iterator pointing to the end of the reversed container.

                        Complexity: Constant.

                        Throws: Nothing.

                      13. -
                        iterator root();
                        +
                        iterator root();

                        Effects: Returns a iterator pointing to the root node of the container or end() if not present.

                        Complexity: Constant.

                        Throws: Nothing.

                      14. -
                        const_iterator root() const;
                        +
                        const_iterator root() const;

                        Effects: Returns a const_iterator pointing to the root node of the container or cend() if not present.

                        Complexity: Constant.

                        Throws: Nothing.

                      15. -
                        const_iterator croot() const;
                        +
                        const_iterator croot() const;

                        Effects: Returns a const_iterator pointing to the root node of the container or cend() if not present.

                        Complexity: Constant.

                        Throws: Nothing.

                      16. -
                        key_compare key_comp() const;
                        +
                        key_compare key_comp() const;

                        Effects: Returns the key_compare object used by the container.

                        Complexity: Constant.

                        Throws: If key_compare copy-constructor throws.

                      17. -
                        value_compare value_comp() const;
                        +
                        value_compare value_comp() const;

                        Effects: Returns the value_compare object used by the container.

                        Complexity: Constant.

                        Throws: If value_compare copy-constructor throws.

                      18. -
                        bool empty() const;
                        +
                        bool empty() const;

                        Effects: Returns true if the container is empty.

                        Complexity: Constant.

                        Throws: Nothing.

                      19. -
                        size_type size() const;
                        +
                        size_type size() const;

                        Effects: Returns the number of elements stored in the container.

                        Complexity: Linear to elements contained in *this if constant-time size option is disabled. Constant time otherwise.

                        Throws: Nothing.

                      20. -
                        void swap(splaytree & other);
                        +
                        void swap(splaytree & other);

                        Effects: Swaps the contents of two containers.

                        Complexity: Constant.

                        Throws: If the comparison functor's swap call throws. 

                      21. template<typename Cloner, typename Disposer> 
-  void clone_from(const splaytree & src, Cloner cloner, Disposer disposer);
                        + void clone_from(const splaytree & src, Cloner cloner, Disposer disposer);

                        Requires: Disposer::operator()(pointer) shouldn't throw. Cloner should yield to nodes equivalent to the original nodes.

                        Effects: Erases all the elements from *this calling Disposer::operator()(pointer), clones all the elements from src calling Cloner::operator()(const_reference ) and inserts them on *this. Copies the predicate from the source container.

                        If cloner throws, all cloned elements are unlinked and disposed calling Disposer::operator()(pointer).

                        @@ -392,7 +392,7 @@ 
                      22. template<typename Cloner, typename Disposer> 
-  void clone_from(splaytree && src, Cloner cloner, Disposer disposer);
                        + void clone_from(splaytree && src, Cloner cloner, Disposer disposer);

                        Requires: Disposer::operator()(pointer) shouldn't throw. Cloner should yield to nodes equivalent to the original nodes.

                        Effects: Erases all the elements from *this calling Disposer::operator()(pointer), clones all the elements from src calling Cloner::operator()(reference) and inserts them on *this. Copies the predicate from the source container.

                        If cloner throws, all cloned elements are unlinked and disposed calling Disposer::operator()(pointer).

                        @@ -401,7 +401,7 @@

                        Note: This version can modify the source container, useful to implement move semantics.

                      23. -
                        iterator insert_equal(reference value);
                        +
                        iterator insert_equal(reference value);

                        Requires: value must be an lvalue

                        Effects: Inserts value into the container before the upper bound.

                        Complexity: Average complexity for insert element is at most logarithmic.

                        @@ -409,7 +409,7 @@

                        Note: Does not affect the validity of iterators and references. No copy-constructors are called.

                      24. -
                        iterator insert_equal(const_iterator hint, reference value);
                        +
                        iterator insert_equal(const_iterator hint, reference value);

                        Requires: value must be an lvalue, and "hint" must be a valid iterator.

                        Effects: Inserts x into the container, using "hint" as a hint to where it will be inserted. If "hint" is the upper_bound the insertion takes constant time (two comparisons in the worst case)

                        Complexity: Logarithmic in general, but it is amortized constant time if t is inserted immediately before hint.

                        @@ -417,7 +417,7 @@

                        Note: Does not affect the validity of iterators and references. No copy-constructors are called.

                      25. -
                        template<typename Iterator> void insert_equal(Iterator b, Iterator e);
                        +
                        template<typename Iterator> void insert_equal(Iterator b, Iterator e);

                        Requires: Dereferencing iterator must yield an lvalue of type value_type.

                        Effects: Inserts a each element of a range into the container before the upper bound of the key of each element.

                        Complexity: Insert range is in general O(N * log(N)), where N is the size of the range. However, it is linear in N if the range is already sorted by value_comp().

                        @@ -425,7 +425,7 @@

                        Note: Does not affect the validity of iterators and references. No copy-constructors are called.

                      26. -
                        std::pair< iterator, bool > insert_unique(reference value);
                        +
                        std::pair< iterator, bool > insert_unique(reference value);

                        Requires: value must be an lvalue

                        Effects: Inserts value into the container if the value is not already present.

                        Complexity: Average complexity for insert element is at most logarithmic.

                        @@ -433,7 +433,7 @@

                        Note: Does not affect the validity of iterators and references. No copy-constructors are called.

                      27. -
                        iterator insert_unique(const_iterator hint, reference value);
                        +
                        iterator insert_unique(const_iterator hint, reference value);

                        Requires: value must be an lvalue, and "hint" must be a valid iterator

                        Effects: Tries to insert x into the container, using "hint" as a hint to where it will be inserted.

                        Complexity: Logarithmic in general, but it is amortized constant time (two comparisons in the worst case) if t is inserted immediately before hint.

                        @@ -442,7 +442,7 @@ 
                      28. std::pair< iterator, bool > 
-insert_unique_check(const key_type & key, insert_commit_data & commit_data);
                        +insert_unique_check(const key_type & key, insert_commit_data & commit_data);

                        Effects: Checks if a value can be inserted in the container, using a user provided key instead of the value itself.

                        Returns: If there is an equivalent value returns a pair containing an iterator to the already present value and false. If the value can be inserted returns true in the returned pair boolean and fills "commit_data" that is meant to be used with the "insert_commit" function.

                        Complexity: Average complexity is at most logarithmic.

                        @@ -450,7 +450,7 @@ 
                      29. std::pair< iterator, bool > 
-insert_unique_check(const_iterator hint, const key_type & key, 
+insert_unique_check(const_iterator hint, const key_type & key, 
                     insert_commit_data & commit_data);

                        Effects: Checks if a value can be inserted in the container, using a user provided key instead of the value itself, using "hint" as a hint to where it will be inserted.

                        Returns: If there is an equivalent value returns a pair containing an iterator to the already present value and false. If the value can be inserted returns true in the returned pair boolean and fills "commit_data" that is meant to be used with the "insert_commit" function.

                        @@ -460,7 +460,7 @@ 
                      30. template<typename KeyType, typename KeyTypeKeyCompare> 
   std::pair< iterator, bool > 
-  insert_unique_check(const KeyType & key, KeyTypeKeyCompare comp, 
+  insert_unique_check(const KeyType & key, KeyTypeKeyCompare comp, 
                       insert_commit_data & commit_data);

                        Requires: comp must be a comparison function that induces the same strict weak ordering as key_compare. The difference is that comp compares an arbitrary key with the contained values.

                        Effects: Checks if a value can be inserted in the container, using a user provided key instead of the value itself.

                        @@ -474,7 +474,7 @@ 
                      31. template<typename KeyType, typename KeyTypeKeyCompare> 
   std::pair< iterator, bool > 
-  insert_unique_check(const_iterator hint, const KeyType & key, 
+  insert_unique_check(const_iterator hint, const KeyType & key, 
                       KeyTypeKeyCompare comp, 
                       insert_commit_data & commit_data);

                        Requires: comp must be a comparison function that induces the same strict weak ordering as key_compare. The difference is that comp compares an arbitrary key with the contained values.

                        @@ -487,7 +487,7 @@

                        "commit_data" remains valid for a subsequent "insert_commit" only if no more objects are inserted or erased from the container.

                      32. -
                        iterator insert_unique_commit(reference value, 
+
                        iterator insert_unique_commit(reference value, 
                               const insert_commit_data & commit_data);
                        
 
                        Requires: value must be an lvalue of type value_type. commit_data must have been obtained from a previous call to "insert_check". No objects should have been inserted or erased from the container between the "insert_check" that filled "commit_data" and the call to "insert_commit".
                        
 
                        Effects: Inserts the value in the container using the information obtained from the "commit_data" that a previous "insert_check" filled.
                        
@@ -497,7 +497,7 @@
 
                        Notes: This function has only sense if a "insert_check" has been previously executed to fill "commit_data". No value should be inserted or erased between the "insert_check" and "insert_commit" calls.
                      33. -
                        template<typename Iterator> void insert_unique(Iterator b, Iterator e);
                        +
                        template<typename Iterator> void insert_unique(Iterator b, Iterator e);

                        Requires: Dereferencing iterator must yield an lvalue of type value_type.

                        Effects: Tries to insert each element of a range into the container.

                        Complexity: Insert range is in general O(N * log(N)), where N is the size of the range. However, it is linear in N if the range is already sorted by value_comp().

                        @@ -505,7 +505,7 @@

                        Note: Does not affect the validity of iterators and references. No copy-constructors are called.

                      34. -
                        iterator insert_before(const_iterator pos, reference value);
                        +
                        iterator insert_before(const_iterator pos, reference value);

                        Requires: value must be an lvalue, "pos" must be a valid iterator (or end) and must be the succesor of value once inserted according to the predicate

                        Effects: Inserts x into the container before "pos".

                        Complexity: Constant time.

                        @@ -513,7 +513,7 @@

                        Note: This function does not check preconditions so if "pos" is not the successor of "value" container ordering invariant will be broken. This is a low-level function to be used only for performance reasons by advanced users.

                      35. -
                        void push_back(reference value);
                        +
                        void push_back(reference value);

                        Requires: value must be an lvalue, and it must be no less than the greatest inserted key

                        Effects: Inserts x into the container in the last position.

                        Complexity: Constant time.

                        @@ -521,7 +521,7 @@

                        Note: This function does not check preconditions so if value is less than the greatest inserted key container ordering invariant will be broken. This function is slightly more efficient than using "insert_before". This is a low-level function to be used only for performance reasons by advanced users.

                      36. -
                        void push_front(reference value);
                        +
                        void push_front(reference value);

                        Requires: value must be an lvalue, and it must be no greater than the minimum inserted key

                        Effects: Inserts x into the container in the first position.

                        Complexity: Constant time.

                        @@ -529,21 +529,21 @@

                        Note: This function does not check preconditions so if value is greater than the minimum inserted key container ordering invariant will be broken. This function is slightly more efficient than using "insert_before". This is a low-level function to be used only for performance reasons by advanced users.

                      37. -
                        iterator erase(const_iterator i);
                        +
                        iterator erase(const_iterator i);

                        Effects: Erases the element pointed to by i.

                        Complexity: Average complexity for erase element is constant time.

                        Throws: Nothing.

                        Note: Invalidates the iterators (but not the references) to the erased elements. No destructors are called.

                      38. -
                        iterator erase(const_iterator b, const_iterator e);
                        +
                        iterator erase(const_iterator b, const_iterator e);

                        Effects: Erases the range pointed to by b end e.

                        Complexity: Average complexity for erase range is at most O(log(size() + N)), where N is the number of elements in the range.

                        Throws: Nothing.

                        Note: Invalidates the iterators (but not the references) to the erased elements. No destructors are called.

                      39. -
                        size_type erase(const key_type & key);
                        +
                        size_type erase(const key_type & key);

                        Effects: Erases all the elements with the given value.

                        Returns: The number of erased elements.

                        Complexity: O(log(size() + N).

                        @@ -552,7 +552,7 @@ 
                      40. template<typename KeyType, typename KeyTypeKeyCompare> 
-  size_type erase(const KeyType & key, KeyTypeKeyCompare comp);
                        + size_type erase(const KeyType & key, KeyTypeKeyCompare comp);

                        Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk), with nk the key_type of a value_type inserted into *this.

                        Effects: Erases all the elements with the given key. according to the comparison functor "comp".

                        Returns: The number of erased elements.

                        @@ -562,7 +562,7 @@ 
                      41. template<typename Disposer> 
-  iterator erase_and_dispose(const_iterator i, Disposer disposer);
                        + iterator erase_and_dispose(const_iterator i, Disposer disposer);

                        Requires: Disposer::operator()(pointer) shouldn't throw.

                        Effects: Erases the element pointed to by i. Disposer::operator()(pointer) is called for the removed element.

                        Complexity: Average complexity for erase element is constant time.

                        @@ -571,7 +571,7 @@ 
                      42. template<typename Disposer> 
-  iterator erase_and_dispose(const_iterator b, const_iterator e, 
+  iterator erase_and_dispose(const_iterator b, const_iterator e, 
                              Disposer disposer);

                        Requires: Disposer::operator()(pointer) shouldn't throw.

                        Effects: Erases the range pointed to by b end e. Disposer::operator()(pointer) is called for the removed elements.

                        @@ -581,7 +581,7 @@ 
                      43. template<typename Disposer> 
-  size_type erase_and_dispose(const key_type & key, Disposer disposer);
                        + size_type erase_and_dispose(const key_type & key, Disposer disposer);

                        Requires: Disposer::operator()(pointer) shouldn't throw.

                        Effects: Erases all the elements with the given value. Disposer::operator()(pointer) is called for the removed elements.

                        Returns: The number of erased elements.

                        @@ -591,7 +591,7 @@ 
                      44. template<typename KeyType, typename KeyTypeKeyCompare, typename Disposer> 
-  size_type erase_and_dispose(const KeyType & key, KeyTypeKeyCompare comp, 
+  size_type erase_and_dispose(const KeyType & key, KeyTypeKeyCompare comp, 
                               Disposer disposer);

                        Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk) and nk the key_type of a value_type inserted into *this.

                        Requires: Disposer::operator()(pointer) shouldn't throw.

                        @@ -602,61 +602,61 @@

                        Note: Invalidates the iterators to the erased elements.

                      45. -
                        void clear();
                        +
                        void clear();

                        Effects: Erases all of the elements.

                        Complexity: Linear to the number of elements on the container. if it's a safe-mode or auto-unlink value_type. Constant time otherwise.

                        Throws: Nothing.

                        Note: Invalidates the iterators (but not the references) to the erased elements. No destructors are called.

                      46. -
                        template<typename Disposer> void clear_and_dispose(Disposer disposer);
                        +
                        template<typename Disposer> void clear_and_dispose(Disposer disposer);

                        Effects: Erases all of the elements calling disposer(p) for each node to be erased. Complexity: Average complexity for is at most O(log(size() + N)), where N is the number of elements in the container.

                        Throws: Nothing.

                        Note: Invalidates the iterators (but not the references) to the erased elements. Calls N times to disposer functor.

                      47. -
                        size_type count(const key_type & key);
                        +
                        size_type count(const key_type & key);

                        Effects: Returns the number of contained elements with the given value

                        Complexity: Logarithmic to the number of elements contained plus lineal to number of objects with the given value.

                        Throws: If key_compare throws. Additional note: non-const function, splaying is performed. 

                      48. template<typename KeyType, typename KeyTypeKeyCompare> 
-  size_type count(const KeyType & key, KeyTypeKeyCompare comp);
                        + size_type count(const KeyType & key, KeyTypeKeyCompare comp);

                        Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk), and nk the key_type of a value_type inserted into *this.

                        Effects: Returns the number of contained elements with the given key

                        Complexity: Logarithmic to the number of elements contained plus lineal to number of objects with the given key.

                        Throws: If comp throws. Additional note: non-const function, splaying is performed.

                      49. -
                        size_type count(const key_type & key) const;
                        +
                        size_type count(const key_type & key) const;

                        Effects: Returns the number of contained elements with the given value

                        Complexity: Logarithmic to the number of elements contained plus lineal to number of objects with the given value.

                        Throws: If key_compare throws. Additional note: const function, no splaying is performed 

                      50. template<typename KeyType, typename KeyTypeKeyCompare> 
-  size_type count(const KeyType & key, KeyTypeKeyCompare comp) const;
                        + size_type count(const KeyType & key, KeyTypeKeyCompare comp) const;

                        Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk), and nk the key_type of a value_type inserted into *this.

                        Effects: Returns the number of contained elements with the given key

                        Complexity: Logarithmic to the number of elements contained plus lineal to number of objects with the given key.

                        Throws: If comp throws. Additional note: const function, no splaying is performed

                      51. -
                        iterator lower_bound(const key_type & key);
                        +
                        iterator lower_bound(const key_type & key);

                        Effects: Returns an iterator to the first element whose key is not less than k or end() if that element does not exist.

                        Complexity: Logarithmic.

                        Throws: If key_compare throws. Additional note: non-const function, splaying is performed.

                      52. -
                        const_iterator lower_bound(const key_type & key) const;
                        +
                        const_iterator lower_bound(const key_type & key) const;

                        Effects: Returns an iterator to the first element whose key is not less than k or end() if that element does not exist.

                        Complexity: Logarithmic.

                        Throws: If key_compare throws. Additional note: const function, no splaying is performed 

                      53. template<typename KeyType, typename KeyTypeKeyCompare> 
-  iterator lower_bound(const KeyType & key, KeyTypeKeyCompare comp);
                        + iterator lower_bound(const KeyType & key, KeyTypeKeyCompare comp);

                        Effects: Returns an iterator to the first element whose key is not less than k or end() if that element does not exist.

                        Complexity: Logarithmic.

                        Throws: If key_compare throws. Additional note: non-const function, splaying is performed for the first element of the equal range of "key"

                        @@ -664,26 +664,26 @@ 
                      54. template<typename KeyType, typename KeyTypeKeyCompare> 
   const_iterator 
-  lower_bound(const KeyType & key, KeyTypeKeyCompare comp) const;
                        + lower_bound(const KeyType & key, KeyTypeKeyCompare comp) const;

                        Effects: Returns an iterator to the first element whose key is not less than k or end() if that element does not exist.

                        Complexity: Logarithmic.

                        Throws: If key_compare throws. Additional note: const function, no splaying is performed

                      55. -
                        iterator upper_bound(const key_type & key);
                        +
                        iterator upper_bound(const key_type & key);

                        Effects: Returns an iterator to the first element whose key is greater than k or end() if that element does not exist.

                        Complexity: Logarithmic.

                        Throws: If key_compare throws. Additional note: non-const function, splaying is performed for the first element of the equal range of "value"

                      56. -
                        const_iterator upper_bound(const key_type & key) const;
                        +
                        const_iterator upper_bound(const key_type & key) const;

                        Effects: Returns an iterator to the first element whose key is greater than k or end() if that element does not exist.

                        Complexity: Logarithmic.

                        Throws: If key_compare throws. Additional note: const function, no splaying is performed 

                      57. template<typename KeyType, typename KeyTypeKeyCompare> 
-  iterator upper_bound(const KeyType & key, KeyTypeKeyCompare comp);
                        + iterator upper_bound(const KeyType & key, KeyTypeKeyCompare comp);

                        Requires: key is a value such that *this is partitioned with respect to !comp(key, nk), with nk the key_type of a value_type inserted into *this.

                        Effects: Returns an iterator to the first element whose key is greater than k according to comp or end() if that element does not exist.

                        Complexity: Logarithmic.

                        @@ -692,27 +692,27 @@ 
                      58. template<typename KeyType, typename KeyTypeKeyCompare> 
   const_iterator 
-  upper_bound(const KeyType & key, KeyTypeKeyCompare comp) const;
                        + upper_bound(const KeyType & key, KeyTypeKeyCompare comp) const;

                        Requires: key is a value such that *this is partitioned with respect to !comp(key, nk), with nk the key_type of a value_type inserted into *this.

                        Effects: Returns an iterator to the first element whose key is greater than k according to comp or end() if that element does not exist.

                        Complexity: Logarithmic.

                        Throws: If comp throws. Additional note: const function, no splaying is performed

                      59. -
                        iterator find(const key_type & key);
                        +
                        iterator find(const key_type & key);

                        Effects: Finds an iterator to the first element whose key is k or end() if that element does not exist.

                        Complexity: Logarithmic.

                        Throws: If key_compare throws. Additional note: non-const function, splaying is performed for the first element of the equal range of "value"

                      60. -
                        const_iterator find(const key_type & key) const;
                        +
                        const_iterator find(const key_type & key) const;

                        Effects: Finds an iterator to the first element whose key is k or end() if that element does not exist.

                        Complexity: Logarithmic.

                        Throws: If key_compare throws. Additional note: const function, no splaying is performed 

                      61. template<typename KeyType, typename KeyTypeKeyCompare> 
-  iterator find(const KeyType & key, KeyTypeKeyCompare comp);
                        + iterator find(const KeyType & key, KeyTypeKeyCompare comp);

                        Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk), and nk the key_type of a value_type inserted into *this.

                        Effects: Finds an iterator to the first element whose key is k or end() if that element does not exist.

                        Complexity: Logarithmic.

                        @@ -720,21 +720,21 @@ 
                      62. template<typename KeyType, typename KeyTypeKeyCompare> 
-  const_iterator find(const KeyType & key, KeyTypeKeyCompare comp) const;
                        + const_iterator find(const KeyType & key, KeyTypeKeyCompare comp) const;

                        Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk), and nk the key_type of a value_type inserted into *this.

                        Effects: Finds an iterator to the first element whose key is k or end() if that element does not exist.

                        Complexity: Logarithmic.

                        Throws: If comp throws. Additional note: const function, no splaying is performed

                      63. -
                        std::pair< iterator, iterator > equal_range(const key_type & key);
                        +
                        std::pair< iterator, iterator > equal_range(const key_type & key);

                        Effects: Finds a range containing all elements whose key is k or an empty range that indicates the position where those elements would be if they there is no elements with key k.

                        Complexity: Logarithmic.

                        Throws: If key_compare throws. Additional note: non-const function, splaying is performed for the first element of the equal range of "value" 

                      64. std::pair< const_iterator, const_iterator > 
-equal_range(const key_type & key) const;
                        +equal_range(const key_type & key) const;

                        Effects: Finds a range containing all elements whose key is k or an empty range that indicates the position where those elements would be if they there is no elements with key k.

                        Complexity: Logarithmic.

                        Throws: If key_compare throws. Additional note: const function, no splaying is performed

                        @@ -742,7 +742,7 @@ 
                      65. template<typename KeyType, typename KeyTypeKeyCompare> 
   std::pair< iterator, iterator > 
-  equal_range(const KeyType & key, KeyTypeKeyCompare comp);
                        + equal_range(const KeyType & key, KeyTypeKeyCompare comp);

                        Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk), with nk the key_type of a value_type inserted into *this.

                        Effects: Finds a range containing all elements whose key is k or an empty range that indicates the position where those elements would be if they there is no elements with key k.

                        Complexity: Logarithmic.

                        @@ -751,7 +751,7 @@ 
                      66. template<typename KeyType, typename KeyTypeKeyCompare> 
   std::pair< const_iterator, const_iterator > 
-  equal_range(const KeyType & key, KeyTypeKeyCompare comp) const;
                        + equal_range(const KeyType & key, KeyTypeKeyCompare comp) const;

                        Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk), with nk the key_type of a value_type inserted into *this.

                        Effects: Finds a range containing all elements whose key is k or an empty range that indicates the position where those elements would be if they there is no elements with key k.

                        Complexity: Logarithmic.

                        @@ -759,7 +759,7 @@ 
                      67. std::pair< iterator, iterator > 
-bounded_range(const key_type & lower_key, const key_type & upper_key, 
+bounded_range(const key_type & lower_key, const key_type & upper_key, 
               bool left_closed, bool right_closed);

                        Requires: upper_key shall not precede lower_key according to key_compare. [key_comp()(upper_key, lower_key) shall be false]

                        If lower_key is equivalent to upper_key [!key_comp()(upper_key, lower_key) && !key_comp()(lower_key, upper_key)] then ('left_closed' || 'right_closed') must be false.

                        @@ -774,7 +774,7 @@ 
                      68. template<typename KeyType, typename KeyTypeKeyCompare> 
   std::pair< iterator, iterator > 
-  bounded_range(const KeyType & lower_key, const KeyType & upper_key, 
+  bounded_range(const KeyType & lower_key, const KeyType & upper_key, 
                 KeyTypeKeyCompare comp, bool left_closed, bool right_closed);

                        Requires: lower_key is a value such that *this is partitioned with respect to comp(nk, lower_key) if left_closed is true, with respect to !comp(lower_key, nk) otherwise.

                        upper_key is a value such that *this is partitioned with respect to !comp(upper_key, nk) if right_closed is true, with respect to comp(nk, upper_key) otherwise.

                        @@ -790,7 +790,7 @@ 
                      69. std::pair< const_iterator, const_iterator > 
-bounded_range(const key_type & lower_key, const key_type & upper_key, 
+bounded_range(const key_type & lower_key, const key_type & upper_key, 
               bool left_closed, bool right_closed) const;

                        Requires: upper_key shall not precede lower_key according to key_compare. [key_comp()(upper_key, lower_key) shall be false]

                        If lower_key is equivalent to upper_key [!key_comp()(upper_key, lower_key) && !key_comp()(lower_key, upper_key)] then ('left_closed' || 'right_closed') must be false.

                        @@ -805,7 +805,7 @@ 
                      70. template<typename KeyType, typename KeyTypeKeyCompare> 
   std::pair< const_iterator, const_iterator > 
-  bounded_range(const KeyType & lower_key, const KeyType & upper_key, 
+  bounded_range(const KeyType & lower_key, const KeyType & upper_key, 
                 KeyTypeKeyCompare comp, bool left_closed, bool right_closed) const;

                        Requires: lower_key is a value such that *this is partitioned with respect to comp(nk, lower_key) if left_closed is true, with respect to !comp(lower_key, nk) otherwise.

                        upper_key is a value such that *this is partitioned with respect to !comp(upper_key, nk) if right_closed is true, with respect to comp(nk, upper_key) otherwise.

                        @@ -820,28 +820,28 @@

                        Note: Experimental function, the interface might change in future releases.

                      71. -
                        iterator iterator_to(reference value);
                        +
                        iterator iterator_to(reference value);

                        Requires: value must be an lvalue and shall be in a set of appropriate type. Otherwise the behavior is undefined.

                        Effects: Returns: a valid iterator i belonging to the set that points to the value

                        Complexity: Constant.

                        Throws: Nothing.

                      72. -
                        const_iterator iterator_to(const_reference value) const;
                        +
                        const_iterator iterator_to(const_reference value) const;

                        Requires: value must be an lvalue and shall be in a set of appropriate type. Otherwise the behavior is undefined.

                        Effects: Returns: a valid const_iterator i belonging to the set that points to the value

                        Complexity: Constant.

                        Throws: Nothing.

                      73. -
                        pointer unlink_leftmost_without_rebalance();
                        +
                        pointer unlink_leftmost_without_rebalance();

                        Effects: Unlinks the leftmost node from the container.

                        Complexity: Average complexity is constant time.

                        Throws: Nothing.

                        Notes: This function breaks the container and the container can only be used for more unlink_leftmost_without_rebalance calls. This function is normally used to achieve a step by step controlled destruction of the container.

                      74. -
                        void replace_node(iterator replace_this, reference with_this);
                        +
                        void replace_node(iterator replace_this, reference with_this);

                        Requires: replace_this must be a valid iterator of *this and with_this must not be inserted in any container.

                        Effects: Replaces replace_this in its position in the container with with_this. The container does not need to be rebalanced.

                        Complexity: Constant.

                        @@ -849,7 +849,7 @@

                        Note: This function will break container ordering invariants if with_this is not equivalent to *replace_this according to the ordering rules. This function is faster than erasing and inserting the node, since no rebalancing or comparison is needed.

                      75. -
                        void remove_node(reference value);
                        +
                        void remove_node(reference value);

                        Effects: removes "value" from the container.

                        Throws: Nothing.

                        Complexity: Logarithmic time.

                        @@ -858,7 +858,7 @@ 
                      76. template<typename T, class... Options2> 
-  void merge_unique(splaytree< T, Options2...> &);
                        + void merge_unique(splaytree< T, Options2...> &);

                        Requires: "source" container's Options can only can differ in the comparison function from *this.

                        Effects: Attempts to extract each element in source and insert it into a using the comparison object of *this. If there is an element in a with key equivalent to the key of an element from source, then that element is not extracted from source.

                        Postcondition: Pointers and references to the transferred elements of source refer to those same elements but as members of *this. Iterators referring to the transferred elements will continue to refer to their elements, but they now behave as iterators into *this, not into source.

                        @@ -867,7 +867,7 @@ 
                      77. template<typename T, class... Options2> 
-  void merge_equal(splaytree< T, Options2...> &);
                        + void merge_equal(splaytree< T, Options2...> &);

                        Requires: "source" container's Options can only can differ in the comparison function from *this.

                        Effects: Extracts each element in source and insert it into a using the comparison object of *this.

                        Postcondition: Pointers and references to the transferred elements of source refer to those same elements but as members of *this. Iterators referring to the transferred elements will continue to refer to their elements, but they now behave as iterators into *this, not into source.

                        @@ -875,7 +875,7 @@

                        Complexity: N log(a.size() + N) (N has the value source.size())

                      78. -
                        void splay_up(iterator i);
                        +
                        void splay_up(iterator i);

                        Requires: i must be a valid iterator of *this.

                        Effects: Rearranges the container so that the element pointed by i is placed as the root of the tree, improving future searches of this value.

                        Complexity: Amortized logarithmic.

                        @@ -883,27 +883,27 @@ 
                      79. template<typename KeyType, typename KeyTypeKeyCompare> 
-  iterator splay_down(const KeyType & key, KeyTypeKeyCompare comp);
                        + iterator splay_down(const KeyType & key, KeyTypeKeyCompare comp);

                        Effects: Rearranges the container so that if *this stores an element with a key equivalent to value the element is placed as the root of the tree. If the element is not present returns the last node compared with the key. If the tree is empty, end() is returned.

                        Complexity: Amortized logarithmic.

                        Returns: An iterator to the new root of the tree, end() if the tree is empty.

                        Throws: If the comparison functor throws.

                      80. -
                        iterator splay_down(const key_type & key);
                        +
                        iterator splay_down(const key_type & key);

                        Effects: Rearranges the container so that if *this stores an element with a key equivalent to value the element is placed as the root of the tree.

                        Complexity: Amortized logarithmic.

                        Returns: An iterator to the new root of the tree, end() if the tree is empty.

                        Throws: If the predicate throws.

                      81. -
                        void rebalance();
                        +
                        void rebalance();

                        Effects: Rebalances the tree.

                        Throws: Nothing.

                        Complexity: Linear.

                      82. -
                        iterator rebalance_subtree(iterator root);
                        +
                        iterator rebalance_subtree(iterator root);

                        Requires: old_root is a node of a tree.

                        Effects: Rebalances the subtree rooted at old_root.

                        Returns: The new root of the subtree.

                        @@ -914,10 +914,10 @@

                      -splaytree public static functions

                      +splaytree public static functions
                      1. -
                        static splaytree & container_from_end_iterator(iterator end_iterator);
                        +
                        static splaytree & container_from_end_iterator(iterator end_iterator);

                        Precondition: end_iterator must be a valid end iterator of the container.

                        Effects: Returns a const reference to the container associated to the end iterator

                        Throws: Nothing.

                        @@ -925,28 +925,28 @@ 
                      2. static const splaytree & 
-container_from_end_iterator(const_iterator end_iterator);
                        +container_from_end_iterator(const_iterator end_iterator);

                        Precondition: end_iterator must be a valid end iterator of the container.

                        Effects: Returns a const reference to the container associated to the end iterator

                        Throws: Nothing.

                        Complexity: Constant.

                      3. -
                        static splaytree & container_from_iterator(iterator it);
                        +
                        static splaytree & container_from_iterator(iterator it);

                        Precondition: it must be a valid iterator of the container.

                        Effects: Returns a const reference to the container associated to the iterator

                        Throws: Nothing.

                        Complexity: Logarithmic.

                      4. -
                        static const splaytree & container_from_iterator(const_iterator it);
                        +
                        static const splaytree & container_from_iterator(const_iterator it);

                        Precondition: it must be a valid iterator of the container.

                        Effects: Returns a const reference to the container associated to the iterator

                        Throws: Nothing.

                        Complexity: Logarithmic.

                      5. -
                        static iterator s_iterator_to(reference value);
                        +
                        static iterator s_iterator_to(reference value);

                        Requires: value must be an lvalue and shall be in a set of appropriate type. Otherwise the behavior is undefined.

                        Effects: Returns: a valid iterator i belonging to the set that points to the value

                        Complexity: Constant.

                        @@ -954,7 +954,7 @@

                        Note: This static function is available only if the value traits is stateless.

                      6. -
                        static const_iterator s_iterator_to(const_reference value);
                        +
                        static const_iterator s_iterator_to(const_reference value);

                        Requires: value must be an lvalue and shall be in a set of appropriate type. Otherwise the behavior is undefined.

                        Effects: Returns: a valid iterator i belonging to the set that points to the value

                        Complexity: Constant.

                        @@ -962,7 +962,7 @@

                        Note: This static function is available only if the value traits is stateless.

                      7. -
                        static void init_node(reference value);
                        +
                        static void init_node(reference value);

                        Requires: value shall not be in a container.

                        Effects: init_node puts the hook of a value in a well-known default state.

                        Throws: Nothing.

                        diff --git a/doc/html/boost/intrusive/splaytree_algorithms.html b/doc/html/boost/intrusive/splaytree_algorithms.html index cf6e0a81b9..1580698976 100644 --- a/doc/html/boost/intrusive/splaytree_algorithms.html +++ b/doc/html/boost/intrusive/splaytree_algorithms.html @@ -42,114 +42,114 @@ typedef NodeTraits::const_node_ptr const_node_ptr; typedef bstree_algo::insert_commit_data insert_commit_data; - // public static functions - static node_ptr get_header(const const_node_ptr &); - static node_ptr begin_node(const const_node_ptr &); - static node_ptr end_node(const const_node_ptr &); - static void swap_tree(const node_ptr &, const node_ptr &); - static void swap_nodes(const node_ptr &, const node_ptr &); - static void swap_nodes(const node_ptr &, const node_ptr &, const node_ptr &, + // public static functions + static node_ptr get_header(const const_node_ptr &); + static node_ptr begin_node(const const_node_ptr &); + static node_ptr end_node(const const_node_ptr &); + static void swap_tree(const node_ptr &, const node_ptr &); + static void swap_nodes(const node_ptr &, const node_ptr &); + static void swap_nodes(const node_ptr &, const node_ptr &, const node_ptr &, const node_ptr &); - static void replace_node(const node_ptr &, const node_ptr &); - static void replace_node(const node_ptr &, const node_ptr &, + static void replace_node(const node_ptr &, const node_ptr &); + static void replace_node(const node_ptr &, const node_ptr &, const node_ptr &); - static void unlink(const node_ptr &); - static node_ptr unlink_leftmost_without_rebalance(const node_ptr &); - static bool unique(const const_node_ptr &); - static std::size_t size(const const_node_ptr &); - static node_ptr next_node(const node_ptr &); - static node_ptr prev_node(const node_ptr &); - static void init(const node_ptr &); - static void init_header(const node_ptr &); - static void erase(const node_ptr &, const node_ptr &); + static void unlink(const node_ptr &); + static node_ptr unlink_leftmost_without_rebalance(const node_ptr &); + static bool unique(const const_node_ptr &); + static std::size_t size(const const_node_ptr &); + static node_ptr next_node(const node_ptr &); + static node_ptr prev_node(const node_ptr &); + static void init(const node_ptr &); + static void init_header(const node_ptr &); + static void erase(const node_ptr &, const node_ptr &); template<typename NodePtrCompare> - static bool transfer_unique(const node_ptr &, NodePtrCompare, + static bool transfer_unique(const node_ptr &, NodePtrCompare, const node_ptr &, const node_ptr &); template<typename NodePtrCompare> - static void transfer_equal(const node_ptr &, NodePtrCompare, + static void transfer_equal(const node_ptr &, NodePtrCompare, const node_ptr &, const node_ptr &); template<typename Cloner, typename Disposer> - static void clone(const const_node_ptr &, const node_ptr &, Cloner, + static void clone(const const_node_ptr &, const node_ptr &, Cloner, Disposer); template<typename Disposer> - static void clear_and_dispose(const node_ptr &, Disposer); + static void clear_and_dispose(const node_ptr &, Disposer); template<typename KeyType, typename KeyNodePtrCompare> static std::size_t - count(const node_ptr &, const KeyType &, KeyNodePtrCompare); + count(const node_ptr &, const KeyType &, KeyNodePtrCompare); template<typename KeyType, typename KeyNodePtrCompare> static std::size_t - count(const const_node_ptr &, const KeyType &, KeyNodePtrCompare); + count(const const_node_ptr &, const KeyType &, KeyNodePtrCompare); template<typename KeyType, typename KeyNodePtrCompare> static node_ptr - lower_bound(const node_ptr &, const KeyType &, KeyNodePtrCompare); + lower_bound(const node_ptr &, const KeyType &, KeyNodePtrCompare); template<typename KeyType, typename KeyNodePtrCompare> static node_ptr - lower_bound(const const_node_ptr &, const KeyType &, KeyNodePtrCompare); + lower_bound(const const_node_ptr &, const KeyType &, KeyNodePtrCompare); template<typename KeyType, typename KeyNodePtrCompare> static node_ptr - upper_bound(const node_ptr &, const KeyType &, KeyNodePtrCompare); + upper_bound(const node_ptr &, const KeyType &, KeyNodePtrCompare); template<typename KeyType, typename KeyNodePtrCompare> static node_ptr - upper_bound(const const_node_ptr &, const KeyType &, KeyNodePtrCompare); + upper_bound(const const_node_ptr &, const KeyType &, KeyNodePtrCompare); template<typename KeyType, typename KeyNodePtrCompare> - static node_ptr find(const node_ptr &, const KeyType &, KeyNodePtrCompare); + static node_ptr find(const node_ptr &, const KeyType &, KeyNodePtrCompare); template<typename KeyType, typename KeyNodePtrCompare> static node_ptr - find(const const_node_ptr &, const KeyType &, KeyNodePtrCompare); + find(const const_node_ptr &, const KeyType &, KeyNodePtrCompare); template<typename KeyType, typename KeyNodePtrCompare> static std::pair< node_ptr, node_ptr > - equal_range(const node_ptr &, const KeyType &, KeyNodePtrCompare); + equal_range(const node_ptr &, const KeyType &, KeyNodePtrCompare); template<typename KeyType, typename KeyNodePtrCompare> static std::pair< node_ptr, node_ptr > - equal_range(const const_node_ptr &, const KeyType &, KeyNodePtrCompare); + equal_range(const const_node_ptr &, const KeyType &, KeyNodePtrCompare); template<typename KeyType, typename KeyNodePtrCompare> static std::pair< node_ptr, node_ptr > - lower_bound_range(const node_ptr &, const KeyType &, KeyNodePtrCompare); + lower_bound_range(const node_ptr &, const KeyType &, KeyNodePtrCompare); template<typename KeyType, typename KeyNodePtrCompare> static std::pair< node_ptr, node_ptr > - lower_bound_range(const const_node_ptr &, const KeyType &, + lower_bound_range(const const_node_ptr &, const KeyType &, KeyNodePtrCompare); template<typename KeyType, typename KeyNodePtrCompare> static std::pair< node_ptr, node_ptr > - bounded_range(const node_ptr &, const KeyType &, const KeyType &, + bounded_range(const node_ptr &, const KeyType &, const KeyType &, KeyNodePtrCompare, bool, bool); template<typename KeyType, typename KeyNodePtrCompare> static std::pair< node_ptr, node_ptr > - bounded_range(const const_node_ptr &, const KeyType &, const KeyType &, + bounded_range(const const_node_ptr &, const KeyType &, const KeyType &, KeyNodePtrCompare, bool, bool); template<typename NodePtrCompare> static node_ptr - insert_equal_upper_bound(const node_ptr &, const node_ptr &, + insert_equal_upper_bound(const node_ptr &, const node_ptr &, NodePtrCompare); template<typename NodePtrCompare> static node_ptr - insert_equal_lower_bound(const node_ptr &, const node_ptr &, + insert_equal_lower_bound(const node_ptr &, const node_ptr &, NodePtrCompare); template<typename NodePtrCompare> static node_ptr - insert_equal(const node_ptr &, const node_ptr &, const node_ptr &, + insert_equal(const node_ptr &, const node_ptr &, const node_ptr &, NodePtrCompare); static node_ptr - insert_before(const node_ptr &, const node_ptr &, const node_ptr &); - static void push_back(const node_ptr &, const node_ptr &); - static void push_front(const node_ptr &, const node_ptr &); + insert_before(const node_ptr &, const node_ptr &, const node_ptr &); + static void push_back(const node_ptr &, const node_ptr &); + static void push_front(const node_ptr &, const node_ptr &); template<typename KeyType, typename KeyNodePtrCompare> static std::pair< node_ptr, bool > - insert_unique_check(const node_ptr &, const KeyType &, KeyNodePtrCompare, + insert_unique_check(const node_ptr &, const KeyType &, KeyNodePtrCompare, insert_commit_data &); template<typename KeyType, typename KeyNodePtrCompare> static std::pair< node_ptr, bool > - insert_unique_check(const node_ptr &, const node_ptr &, const KeyType &, + insert_unique_check(const node_ptr &, const node_ptr &, const KeyType &, KeyNodePtrCompare, insert_commit_data &); - static void insert_unique_commit(const node_ptr &, const node_ptr &, + static void insert_unique_commit(const node_ptr &, const node_ptr &, const insert_commit_data &); - static bool is_header(const const_node_ptr &); - static void rebalance(const node_ptr &); - static node_ptr rebalance_subtree(const node_ptr &); - static void splay_up(const node_ptr &, const node_ptr &); + static bool is_header(const const_node_ptr &); + static void rebalance(const node_ptr &); + static node_ptr rebalance_subtree(const node_ptr &); + static void splay_up(const node_ptr &, const node_ptr &); template<typename KeyType, typename KeyNodePtrCompare> static node_ptr - splay_down(const node_ptr &, const KeyType &, KeyNodePtrCompare, + splay_down(const node_ptr &, const KeyType &, KeyNodePtrCompare, bool * = 0); };
                      @@ -181,38 +181,38 @@

                      -splaytree_algorithms public static functions

                      +splaytree_algorithms public static functions
                      1. -
                        static node_ptr get_header(const const_node_ptr & n);
                        +
                        static node_ptr get_header(const const_node_ptr & n);

                        Requires: 'node' is a node of the tree or a header node.

                        Effects: Returns the header of the tree.

                        Complexity: Logarithmic.

                        Throws: Nothing.

                      2. -
                        static node_ptr begin_node(const const_node_ptr & header);
                        +
                        static node_ptr begin_node(const const_node_ptr & header);

                        Requires: 'header' is the header node of a tree.

                        Effects: Returns the first node of the tree, the header if the tree is empty.

                        Complexity: Constant time.

                        Throws: Nothing.

                      3. -
                        static node_ptr end_node(const const_node_ptr & header);
                        +
                        static node_ptr end_node(const const_node_ptr & header);

                        Requires: 'header' is the header node of a tree.

                        Effects: Returns the header of the tree.

                        Complexity: Constant time.

                        Throws: Nothing.

                      4. -
                        static void swap_tree(const node_ptr & header1, const node_ptr & header2);
                        +
                        static void swap_tree(const node_ptr & header1, const node_ptr & header2);

                        Requires: header1 and header2 must be the header nodes of two trees.

                        Effects: Swaps two trees. After the function header1 will contain links to the second tree and header2 will have links to the first tree.

                        Complexity: Constant.

                        Throws: Nothing.

                      5. -
                        static void swap_nodes(const node_ptr & node1, const node_ptr & node2);
                        +
                        static void swap_nodes(const node_ptr & node1, const node_ptr & node2);

                        Requires: node1 and node2 can't be header nodes of two trees.

                        Effects: Swaps two nodes. After the function node1 will be inserted in the position node2 before the function. node2 will be inserted in the position node1 had before the function.

                        Complexity: Logarithmic.

                        @@ -221,7 +221,7 @@

                        Experimental function

                      6. -
                        static void swap_nodes(const node_ptr & node1, const node_ptr & header1, 
+
                        static void swap_nodes(const node_ptr & node1, const node_ptr & header1, 
                        const node_ptr & node2, const node_ptr & header2);
                        
 
                        Requires: node1 and node2 can't be header nodes of two trees with header header1 and header2.
                        
 
                        Effects: Swaps two nodes. After the function node1 will be inserted in the position node2 before the function. node2 will be inserted in the position node1 had before the function.
                        
@@ -231,7 +231,7 @@
 
                        Experimental function
                      7. -
                        static void replace_node(const node_ptr & node_to_be_replaced, 
+
                        static void replace_node(const node_ptr & node_to_be_replaced, 
                          const node_ptr & new_node);
                        
 
                        Requires: node_to_be_replaced must be inserted in a tree and new_node must not be inserted in a tree.
                        
 
                        Effects: Replaces node_to_be_replaced in its position in the tree with new_node. The tree does not need to be rebalanced
                        
@@ -240,7 +240,7 @@
 
                        Note: This function will break container ordering invariants if new_node is not equivalent to node_to_be_replaced according to the ordering rules. This function is faster than erasing and inserting the node, since no rebalancing and comparison is needed. Experimental function
                      8. -
                        static void replace_node(const node_ptr & node_to_be_replaced, 
+
                        static void replace_node(const node_ptr & node_to_be_replaced, 
                          const node_ptr & header, const node_ptr & new_node);
                        
 
                        Requires: node_to_be_replaced must be inserted in a tree with header "header" and new_node must not be inserted in a tree.
                        
 
                        Effects: Replaces node_to_be_replaced in its position in the tree with new_node. The tree does not need to be rebalanced
                        
@@ -249,14 +249,14 @@
 
                        Note: This function will break container ordering invariants if new_node is not equivalent to node_to_be_replaced according to the ordering rules. This function is faster than erasing and inserting the node, since no rebalancing or comparison is needed. Experimental function
                      9. -
                        static void unlink(const node_ptr & node);
                        +
                        static void unlink(const node_ptr & node);

                        Requires: node is a tree node but not the header.

                        Effects: Unlinks the node and rebalances the tree.

                        Complexity: Average complexity is constant time.

                        Throws: Nothing.

                      10. -
                        static node_ptr unlink_leftmost_without_rebalance(const node_ptr & header);
                        +
                        static node_ptr unlink_leftmost_without_rebalance(const node_ptr & header);

                        Requires: header is the header of a tree.

                        Effects: Unlinks the leftmost node from the tree, and updates the header link to the new leftmost node.

                        Complexity: Average complexity is constant time.

                        @@ -264,35 +264,35 @@

                        Notes: This function breaks the tree and the tree can only be used for more unlink_leftmost_without_rebalance calls. This function is normally used to achieve a step by step controlled destruction of the tree.

                      11. -
                        static bool unique(const const_node_ptr & node);
                        +
                        static bool unique(const const_node_ptr & node);

                        Requires: 'node' is a node of the tree or a node initialized by init(...) or init_node.

                        Effects: Returns true if the node is initialized by init() or init_node().

                        Complexity: Constant time.

                        Throws: Nothing.

                      12. -
                        static std::size_t size(const const_node_ptr & header);
                        +
                        static std::size_t size(const const_node_ptr & header);

                        Requires: node is a node of the tree but it's not the header.

                        Effects: Returns the number of nodes of the subtree.

                        Complexity: Linear time.

                        Throws: Nothing.

                      13. -
                        static node_ptr next_node(const node_ptr & node);
                        +
                        static node_ptr next_node(const node_ptr & node);

                        Requires: 'node' is a node from the tree except the header.

                        Effects: Returns the next node of the tree.

                        Complexity: Average constant time.

                        Throws: Nothing.

                      14. -
                        static node_ptr prev_node(const node_ptr & node);
                        +
                        static node_ptr prev_node(const node_ptr & node);

                        Requires: 'node' is a node from the tree except the leftmost node.

                        Effects: Returns the previous node of the tree.

                        Complexity: Average constant time.

                        Throws: Nothing.

                      15. -
                        static void init(const node_ptr & node);
                        +
                        static void init(const node_ptr & node);

                        Requires: 'node' must not be part of any tree.

                        Effects: After the function unique(node) == true.

                        Complexity: Constant.

                        @@ -300,7 +300,7 @@

                        Nodes: If node is inserted in a tree, this function corrupts the tree.

                      16. -
                        static void init_header(const node_ptr & header);
                        +
                        static void init_header(const node_ptr & header);

                        Requires: node must not be part of any tree.

                        Effects: Initializes the header to represent an empty tree. unique(header) == true.

                        Complexity: Constant.

                        @@ -308,7 +308,7 @@

                        Nodes: If node is inserted in a tree, this function corrupts the tree.

                      17. -
                        static void erase(const node_ptr & header, const node_ptr & z);
                        +
                        static void erase(const node_ptr & header, const node_ptr & z);

                        Requires: header must be the header of a tree, z a node of that tree and z != header.

                        Effects: Erases node "z" from the tree with header "header".

                        Complexity: Amortized constant time.

                        @@ -316,7 +316,7 @@ 
                      18. template<typename NodePtrCompare> 
-  static bool transfer_unique(const node_ptr & header1, NodePtrCompare comp, 
+  static bool transfer_unique(const node_ptr & header1, NodePtrCompare comp, 
                               const node_ptr & header2, const node_ptr & z);

                        Requires: header1 and header2 must be the headers of trees tree1 and tree2 respectively, z a non-header node of tree1. NodePtrCompare is the comparison function of tree1..

                        Effects: Transfers node "z" from tree1 to tree2 if tree1 does not contain a node that is equivalent to z.

                        @@ -326,7 +326,7 @@ 
                      19. template<typename NodePtrCompare> 
-  static void transfer_equal(const node_ptr & header1, NodePtrCompare comp, 
+  static void transfer_equal(const node_ptr & header1, NodePtrCompare comp, 
                              const node_ptr & header2, const node_ptr & z);

                        Requires: header1 and header2 must be the headers of trees tree1 and tree2 respectively, z a non-header node of tree1. NodePtrCompare is the comparison function of tree1..

                        Effects: Transfers node "z" from tree1 to tree2.

                        @@ -335,7 +335,7 @@ 
                      20. template<typename Cloner, typename Disposer> 
-  static void clone(const const_node_ptr & source_header, 
+  static void clone(const const_node_ptr & source_header, 
                     const node_ptr & target_header, Cloner cloner, 
                     Disposer disposer);

                        Requires: "cloner" must be a function object taking a node_ptr and returning a new cloned node of it. "disposer" must take a node_ptr and shouldn't throw.

                        @@ -346,7 +346,7 @@ 
                      21. template<typename Disposer> 
-  static void clear_and_dispose(const node_ptr & header, Disposer disposer);
                        + static void clear_and_dispose(const node_ptr & header, Disposer disposer);

                        Requires: "disposer" must be an object function taking a node_ptr parameter and shouldn't throw.

                        Effects: Empties the target tree calling void disposer::operator()(const node_ptr &) for every node of the tree except the header.

                        Complexity: Linear to the number of element of the source tree plus the. number of elements of tree target tree when calling this function.

                        @@ -355,7 +355,7 @@ 
                      22. template<typename KeyType, typename KeyNodePtrCompare> 
   static std::size_t 
-  count(const node_ptr & header, const KeyType & key, KeyNodePtrCompare comp);
                        + count(const node_ptr & header, const KeyType & key, KeyNodePtrCompare comp);

                        Requires: "header" must be the header node of a tree. KeyNodePtrCompare is a function object that induces a strict weak ordering compatible with the strict weak ordering used to create the the tree. KeyNodePtrCompare can compare KeyType with tree's node_ptrs.

                        Effects: Returns the number of elements with a key equivalent to "key" according to "comp".

                        Complexity: Logarithmic.

                        @@ -364,7 +364,7 @@ 
                      23. template<typename KeyType, typename KeyNodePtrCompare> 
   static std::size_t 
-  count(const const_node_ptr & header, const KeyType & key, 
+  count(const const_node_ptr & header, const KeyType & key, 
         KeyNodePtrCompare comp);

                        Requires: "header" must be the header node of a tree. KeyNodePtrCompare is a function object that induces a strict weak ordering compatible with the strict weak ordering used to create the the tree. KeyNodePtrCompare can compare KeyType with tree's node_ptrs.

                        Effects: Returns the number of elements with a key equivalent to "key" according to "comp".

                        @@ -374,7 +374,7 @@ 
                      24. template<typename KeyType, typename KeyNodePtrCompare> 
   static node_ptr 
-  lower_bound(const node_ptr & header, const KeyType & key, 
+  lower_bound(const node_ptr & header, const KeyType & key, 
               KeyNodePtrCompare comp);

                        Requires: "header" must be the header node of a tree. KeyNodePtrCompare is a function object that induces a strict weak ordering compatible with the strict weak ordering used to create the the tree. KeyNodePtrCompare can compare KeyType with tree's node_ptrs.

                        Effects: Returns a node_ptr to the first element that is not less than "key" according to "comp" or "header" if that element does not exist.

                        @@ -384,7 +384,7 @@ 
                      25. template<typename KeyType, typename KeyNodePtrCompare> 
   static node_ptr 
-  lower_bound(const const_node_ptr & header, const KeyType & key, 
+  lower_bound(const const_node_ptr & header, const KeyType & key, 
               KeyNodePtrCompare comp);

                        Requires: "header" must be the header node of a tree. KeyNodePtrCompare is a function object that induces a strict weak ordering compatible with the strict weak ordering used to create the the tree. KeyNodePtrCompare can compare KeyType with tree's node_ptrs.

                        Effects: Returns a node_ptr to the first element that is not less than "key" according to "comp" or "header" if that element does not exist.

                        @@ -394,7 +394,7 @@ 
                      26. template<typename KeyType, typename KeyNodePtrCompare> 
   static node_ptr 
-  upper_bound(const node_ptr & header, const KeyType & key, 
+  upper_bound(const node_ptr & header, const KeyType & key, 
               KeyNodePtrCompare comp);

                        Requires: "header" must be the header node of a tree. KeyNodePtrCompare is a function object that induces a strict weak ordering compatible with the strict weak ordering used to create the the tree. KeyNodePtrCompare can compare KeyType with tree's node_ptrs.

                        Effects: Returns a node_ptr to the first element that is greater than "key" according to "comp" or "header" if that element does not exist.

                        @@ -404,7 +404,7 @@ 
                      27. template<typename KeyType, typename KeyNodePtrCompare> 
   static node_ptr 
-  upper_bound(const const_node_ptr & header, const KeyType & key, 
+  upper_bound(const const_node_ptr & header, const KeyType & key, 
               KeyNodePtrCompare comp);

                        Requires: "header" must be the header node of a tree. KeyNodePtrCompare is a function object that induces a strict weak ordering compatible with the strict weak ordering used to create the the tree. KeyNodePtrCompare can compare KeyType with tree's node_ptrs.

                        Effects: Returns a node_ptr to the first element that is greater than "key" according to "comp" or "header" if that element does not exist.

                        @@ -414,7 +414,7 @@ 
                      28. template<typename KeyType, typename KeyNodePtrCompare> 
   static node_ptr 
-  find(const node_ptr & header, const KeyType & key, KeyNodePtrCompare comp);
                        + find(const node_ptr & header, const KeyType & key, KeyNodePtrCompare comp);

                        Requires: "header" must be the header node of a tree. KeyNodePtrCompare is a function object that induces a strict weak ordering compatible with the strict weak ordering used to create the the tree. KeyNodePtrCompare can compare KeyType with tree's node_ptrs.

                        Effects: Returns a node_ptr to the first element that is equivalent to "key" according to "comp" or "header" if that element does not exist.

                        Complexity: Logarithmic.

                        @@ -423,7 +423,7 @@ 
                      29. template<typename KeyType, typename KeyNodePtrCompare> 
   static node_ptr 
-  find(const const_node_ptr & header, const KeyType & key, 
+  find(const const_node_ptr & header, const KeyType & key, 
        KeyNodePtrCompare comp);

                        Requires: "header" must be the header node of a tree. KeyNodePtrCompare is a function object that induces a strict weak ordering compatible with the strict weak ordering used to create the the tree. KeyNodePtrCompare can compare KeyType with tree's node_ptrs.

                        Effects: Returns a node_ptr to the first element that is equivalent to "key" according to "comp" or "header" if that element does not exist.

                        @@ -433,7 +433,7 @@ 
                      30. template<typename KeyType, typename KeyNodePtrCompare> 
   static std::pair< node_ptr, node_ptr > 
-  equal_range(const node_ptr & header, const KeyType & key, 
+  equal_range(const node_ptr & header, const KeyType & key, 
               KeyNodePtrCompare comp);

                        Requires: "header" must be the header node of a tree. KeyNodePtrCompare is a function object that induces a strict weak ordering compatible with the strict weak ordering used to create the the tree. KeyNodePtrCompare can compare KeyType with tree's node_ptrs.

                        Effects: Returns an a pair of node_ptr delimiting a range containing all elements that are equivalent to "key" according to "comp" or an empty range that indicates the position where those elements would be if there are no equivalent elements.

                        @@ -443,7 +443,7 @@ 
                      31. template<typename KeyType, typename KeyNodePtrCompare> 
   static std::pair< node_ptr, node_ptr > 
-  equal_range(const const_node_ptr & header, const KeyType & key, 
+  equal_range(const const_node_ptr & header, const KeyType & key, 
               KeyNodePtrCompare comp);

                        Requires: "header" must be the header node of a tree. KeyNodePtrCompare is a function object that induces a strict weak ordering compatible with the strict weak ordering used to create the the tree. KeyNodePtrCompare can compare KeyType with tree's node_ptrs.

                        Effects: Returns an a pair of node_ptr delimiting a range containing all elements that are equivalent to "key" according to "comp" or an empty range that indicates the position where those elements would be if there are no equivalent elements.

                        @@ -453,7 +453,7 @@ 
                      32. template<typename KeyType, typename KeyNodePtrCompare> 
   static std::pair< node_ptr, node_ptr > 
-  lower_bound_range(const node_ptr & header, const KeyType & key, 
+  lower_bound_range(const node_ptr & header, const KeyType & key, 
                     KeyNodePtrCompare comp);

                        Requires: "header" must be the header node of a tree. KeyNodePtrCompare is a function object that induces a strict weak ordering compatible with the strict weak ordering used to create the the tree. KeyNodePtrCompare can compare KeyType with tree's node_ptrs.

                        Effects: Returns an a pair of node_ptr delimiting a range containing the first element that is equivalent to "key" according to "comp" or an empty range that indicates the position where that element would be if there are no equivalent elements.

                        @@ -463,7 +463,7 @@ 
                      33. template<typename KeyType, typename KeyNodePtrCompare> 
   static std::pair< node_ptr, node_ptr > 
-  lower_bound_range(const const_node_ptr & header, const KeyType & key, 
+  lower_bound_range(const const_node_ptr & header, const KeyType & key, 
                     KeyNodePtrCompare comp);

                        Requires: "header" must be the header node of a tree. KeyNodePtrCompare is a function object that induces a strict weak ordering compatible with the strict weak ordering used to create the the tree. KeyNodePtrCompare can compare KeyType with tree's node_ptrs.

                        Effects: Returns an a pair of node_ptr delimiting a range containing the first element that is equivalent to "key" according to "comp" or an empty range that indicates the position where that element would be if there are no equivalent elements.

                        @@ -473,7 +473,7 @@ 
                      34. template<typename KeyType, typename KeyNodePtrCompare> 
   static std::pair< node_ptr, node_ptr > 
-  bounded_range(const node_ptr & header, const KeyType & lower_key, 
+  bounded_range(const node_ptr & header, const KeyType & lower_key, 
                 const KeyType & upper_key, KeyNodePtrCompare comp, 
                 bool left_closed, bool right_closed);

                        Requires: "header" must be the header node of a tree. KeyNodePtrCompare is a function object that induces a strict weak ordering compatible with the strict weak ordering used to create the the tree. KeyNodePtrCompare can compare KeyType with tree's node_ptrs. 'lower_key' must not be greater than 'upper_key' according to 'comp'. If 'lower_key' == 'upper_key', ('left_closed' || 'right_closed') must be true.

                        @@ -488,7 +488,7 @@ 
                      35. template<typename KeyType, typename KeyNodePtrCompare> 
   static std::pair< node_ptr, node_ptr > 
-  bounded_range(const const_node_ptr & header, const KeyType & lower_key, 
+  bounded_range(const const_node_ptr & header, const KeyType & lower_key, 
                 const KeyType & upper_key, KeyNodePtrCompare comp, 
                 bool left_closed, bool right_closed);

                        Requires: "header" must be the header node of a tree. KeyNodePtrCompare is a function object that induces a strict weak ordering compatible with the strict weak ordering used to create the the tree. KeyNodePtrCompare can compare KeyType with tree's node_ptrs. 'lower_key' must not be greater than 'upper_key' according to 'comp'. If 'lower_key' == 'upper_key', ('left_closed' || 'right_closed') must be true.

                        @@ -503,7 +503,7 @@ 
                      36. template<typename NodePtrCompare> 
   static node_ptr 
-  insert_equal_upper_bound(const node_ptr & header, const node_ptr & new_node, 
+  insert_equal_upper_bound(const node_ptr & header, const node_ptr & new_node, 
                            NodePtrCompare comp);

                        Requires: "h" must be the header node of a tree. NodePtrCompare is a function object that induces a strict weak ordering compatible with the strict weak ordering used to create the the tree. NodePtrCompare compares two node_ptrs.

                        Effects: Inserts new_node into the tree before the upper bound according to "comp".

                        @@ -513,7 +513,7 @@ 
                      37. template<typename NodePtrCompare> 
   static node_ptr 
-  insert_equal_lower_bound(const node_ptr & header, const node_ptr & new_node, 
+  insert_equal_lower_bound(const node_ptr & header, const node_ptr & new_node, 
                            NodePtrCompare comp);

                        Requires: "h" must be the header node of a tree. NodePtrCompare is a function object that induces a strict weak ordering compatible with the strict weak ordering used to create the the tree. NodePtrCompare compares two node_ptrs.

                        Effects: Inserts new_node into the tree before the lower bound according to "comp".

                        @@ -523,7 +523,7 @@ 
                      38. template<typename NodePtrCompare> 
   static node_ptr 
-  insert_equal(const node_ptr & header, const node_ptr & hint, 
+  insert_equal(const node_ptr & header, const node_ptr & hint, 
                const node_ptr & new_node, NodePtrCompare comp);

                        Requires: "header" must be the header node of a tree. NodePtrCompare is a function object that induces a strict weak ordering compatible with the strict weak ordering used to create the the tree. NodePtrCompare compares two node_ptrs. "hint" is node from the "header"'s tree.

                        Effects: Inserts new_node into the tree, using "hint" as a hint to where it will be inserted. If "hint" is the upper_bound the insertion takes constant time (two comparisons in the worst case).

                        @@ -532,7 +532,7 @@ 
                      39. static node_ptr 
-insert_before(const node_ptr & header, const node_ptr & pos, 
+insert_before(const node_ptr & header, const node_ptr & pos, 
               const node_ptr & new_node);

                        Requires: "header" must be the header node of a tree. "pos" must be a valid iterator or header (end) node. "pos" must be an iterator pointing to the successor to "new_node" once inserted according to the order of already inserted nodes. This function does not check "pos" and this precondition must be guaranteed by the caller.

                        Effects: Inserts new_node into the tree before "pos".

                        @@ -541,7 +541,7 @@

                        Note: If "pos" is not the successor of the newly inserted "new_node" tree invariants might be broken. Additional note: the inserted node is splayed

                      40. -
                        static void push_back(const node_ptr & header, const node_ptr & new_node);
                        +
                        static void push_back(const node_ptr & header, const node_ptr & new_node);

                        Requires: "header" must be the header node of a tree. "new_node" must be, according to the used ordering no less than the greatest inserted key.

                        Effects: Inserts new_node into the tree before "pos".

                        Complexity: Constant-time.

                        @@ -549,7 +549,7 @@

                        Note: If "new_node" is less than the greatest inserted key tree invariants are broken. This function is slightly faster than using "insert_before". Additional note: the inserted node is splayed

                      41. -
                        static void push_front(const node_ptr & header, const node_ptr & new_node);
                        +
                        static void push_front(const node_ptr & header, const node_ptr & new_node);

                        Requires: "header" must be the header node of a tree. "new_node" must be, according to the used ordering, no greater than the lowest inserted key.

                        Effects: Inserts new_node into the tree before "pos".

                        Complexity: Constant-time.

                        @@ -559,7 +559,7 @@ 
                      42. template<typename KeyType, typename KeyNodePtrCompare> 
   static std::pair< node_ptr, bool > 
-  insert_unique_check(const node_ptr & header, const KeyType & key, 
+  insert_unique_check(const node_ptr & header, const KeyType & key, 
                       KeyNodePtrCompare comp, 
                       insert_commit_data & commit_data);

                        Requires: "header" must be the header node of a tree. KeyNodePtrCompare is a function object that induces a strict weak ordering compatible with the strict weak ordering used to create the the tree. NodePtrCompare compares KeyType with a node_ptr.

                        @@ -574,7 +574,7 @@ 
                      43. template<typename KeyType, typename KeyNodePtrCompare> 
   static std::pair< node_ptr, bool > 
-  insert_unique_check(const node_ptr & header, const node_ptr & hint, 
+  insert_unique_check(const node_ptr & header, const node_ptr & hint, 
                       const KeyType & key, KeyNodePtrCompare comp, 
                       insert_commit_data & commit_data);

                        Requires: "header" must be the header node of a tree. KeyNodePtrCompare is a function object that induces a strict weak ordering compatible with the strict weak ordering used to create the the tree. NodePtrCompare compares KeyType with a node_ptr. "hint" is node from the "header"'s tree.

                        @@ -587,7 +587,7 @@

                        "commit_data" remains valid for a subsequent "insert_unique_commit" only if no more objects are inserted or erased from the set. Additional note: nodes with the given key are splayed

                      44. -
                        static void insert_unique_commit(const node_ptr & header, 
+
                        static void insert_unique_commit(const node_ptr & header, 
                                  const node_ptr & new_value, 
                                  const insert_commit_data & commit_data);
                        
 
                        Requires: "header" must be the header node of a tree. "commit_data" must have been obtained from a previous call to "insert_unique_check". No objects should have been inserted or erased from the set between the "insert_unique_check" that filled "commit_data" and the call to "insert_commit".
                        
@@ -597,31 +597,31 @@
 
                        Notes: This function has only sense if a "insert_unique_check" has been previously executed to fill "commit_data". No value should be inserted or erased between the "insert_check" and "insert_commit" calls.
                      45. -
                        static bool is_header(const const_node_ptr & p);
                        +
                        static bool is_header(const const_node_ptr & p);

                        Requires: p is a node of a tree.

                        Effects: Returns true if p is the header of the tree.

                        Complexity: Constant.

                        Throws: Nothing.

                      46. -
                        static void rebalance(const node_ptr & header);
                        +
                        static void rebalance(const node_ptr & header);

                        Requires: header must be the header of a tree.

                        Effects: Rebalances the tree.

                        Throws: Nothing.

                        Complexity: Linear.

                      47. -
                        static node_ptr rebalance_subtree(const node_ptr & old_root);
                        +
                        static node_ptr rebalance_subtree(const node_ptr & old_root);

                        Requires: old_root is a node of a tree. It shall not be null.

                        Effects: Rebalances the subtree rooted at old_root.

                        Returns: The new root of the subtree.

                        Throws: Nothing.

                        Complexity: Linear.

                        48. -
                      48. static void splay_up(const node_ptr & node, const node_ptr & header);
                        49. +
                      49. static void splay_up(const node_ptr & node, const node_ptr & header);
                      50. template<typename KeyType, typename KeyNodePtrCompare> 
   static node_ptr 
-  splay_down(const node_ptr & header, const KeyType & key, 
+  splay_down(const node_ptr & header, const KeyType & key, 
              KeyNodePtrCompare comp, bool * pfound = 0);
                      diff --git a/doc/html/boost/intrusive/treap.html b/doc/html/boost/intrusive/treap.html index 0b25051ee7..1a7a487915 100644 --- a/doc/html/boost/intrusive/treap.html +++ b/doc/html/boost/intrusive/treap.html @@ -62,155 +62,155 @@ typedef node_algorithms::insert_commit_data insert_commit_data; // construct/copy/destruct - treap(); - explicit treap(const key_compare &, + treap(); + explicit treap(const key_compare &, const priority_compare & = priority_compare(), const value_traits & = value_traits()); template<typename Iterator> - treap(bool, Iterator, Iterator, const key_compare & = key_compare(), + treap(bool, Iterator, Iterator, const key_compare & = key_compare(), const priority_compare & = priority_compare(), const value_traits & = value_traits()); - treap(treap &&); - treap & operator=(treap &&); - ~treap(); + treap(treap &&); + treap & operator=(treap &&); + ~treap(); - // public member functions + // public member functions template<typename KeyPrioComp> - unspecified key_node_prio_comp(KeyPrioComp) const; - iterator begin(); - const_iterator begin() const; - const_iterator cbegin() const; - iterator end(); - const_iterator end() const; - const_iterator cend() const; - iterator top(); - const_iterator top() const; - const_iterator ctop() const; - reverse_iterator rbegin(); - const_reverse_iterator rbegin() const; - const_reverse_iterator crbegin() const; - reverse_iterator rend(); - const_reverse_iterator rend() const; - const_reverse_iterator crend() const; - iterator root(); - const_iterator root() const; - const_iterator croot() const; - reverse_iterator rtop(); - const_reverse_iterator rtop() const; - const_reverse_iterator crtop() const; - key_compare key_comp() const; - value_compare value_comp() const; - bool empty() const; - size_type size() const; - priority_compare priority_comp() const; - void swap(treap &); + unspecified key_node_prio_comp(KeyPrioComp) const; + iterator begin(); + const_iterator begin() const; + const_iterator cbegin() const; + iterator end(); + const_iterator end() const; + const_iterator cend() const; + iterator top(); + const_iterator top() const; + const_iterator ctop() const; + reverse_iterator rbegin(); + const_reverse_iterator rbegin() const; + const_reverse_iterator crbegin() const; + reverse_iterator rend(); + const_reverse_iterator rend() const; + const_reverse_iterator crend() const; + iterator root(); + const_iterator root() const; + const_iterator croot() const; + reverse_iterator rtop(); + const_reverse_iterator rtop() const; + const_reverse_iterator crtop() const; + key_compare key_comp() const; + value_compare value_comp() const; + bool empty() const; + size_type size() const; + priority_compare priority_comp() const; + void swap(treap &); template<typename Cloner, typename Disposer> - void clone_from(const treap &, Cloner, Disposer); + void clone_from(const treap &, Cloner, Disposer); template<typename Cloner, typename Disposer> - void clone_from(treap &&, Cloner, Disposer); - iterator insert_equal(reference); - iterator insert_equal(const_iterator, reference); - template<typename Iterator> void insert_equal(Iterator, Iterator); - std::pair< iterator, bool > insert_unique(reference); - iterator insert_unique(const_iterator, reference); - template<typename Iterator> void insert_unique(Iterator, Iterator); + void clone_from(treap &&, Cloner, Disposer); + iterator insert_equal(reference); + iterator insert_equal(const_iterator, reference); + template<typename Iterator> void insert_equal(Iterator, Iterator); + std::pair< iterator, bool > insert_unique(reference); + iterator insert_unique(const_iterator, reference); + template<typename Iterator> void insert_unique(Iterator, Iterator); std::pair< iterator, bool > - insert_unique_check(const key_type &, insert_commit_data &); + insert_unique_check(const key_type &, insert_commit_data &); std::pair< iterator, bool > - insert_unique_check(const_iterator, const key_type &, insert_commit_data &); + insert_unique_check(const_iterator, const key_type &, insert_commit_data &); template<typename KeyType, typename KeyTypeKeyCompare, typename KeyValuePrioCompare> std::pair< iterator BOOST_INTRUSIVE_I bool > - insert_unique_check(const KeyType &, KeyTypeKeyCompare, + insert_unique_check(const KeyType &, KeyTypeKeyCompare, KeyValuePrioCompare, insert_commit_data &); template<typename KeyType, typename KeyTypeKeyCompare, typename KeyValuePrioCompare> std::pair< iterator, bool > - insert_unique_check(const_iterator, const KeyType &, KeyTypeKeyCompare, + insert_unique_check(const_iterator, const KeyType &, KeyTypeKeyCompare, KeyValuePrioCompare, insert_commit_data &); - iterator insert_unique_commit(reference, const insert_commit_data &); - iterator insert_before(const_iterator, reference); - void push_back(reference); - void push_front(reference); - iterator erase(const_iterator); - iterator erase(const_iterator, const_iterator); - size_type erase(const key_type &); + iterator insert_unique_commit(reference, const insert_commit_data &); + iterator insert_before(const_iterator, reference); + void push_back(reference); + void push_front(reference); + iterator erase(const_iterator); + iterator erase(const_iterator, const_iterator); + size_type erase(const key_type &); template<typename KeyType, typename KeyTypeKeyCompare> - size_type erase(const KeyType &, KeyTypeKeyCompare); + size_type erase(const KeyType &, KeyTypeKeyCompare); template<typename Disposer> - iterator erase_and_dispose(const_iterator, Disposer); + iterator erase_and_dispose(const_iterator, Disposer); template<typename Disposer> - iterator erase_and_dispose(const_iterator, const_iterator, Disposer); + iterator erase_and_dispose(const_iterator, const_iterator, Disposer); template<typename Disposer> - size_type erase_and_dispose(const key_type &, Disposer); + size_type erase_and_dispose(const key_type &, Disposer); template<typename KeyType, typename KeyTypeKeyCompare, typename Disposer> - size_type erase_and_dispose(const KeyType &, KeyTypeKeyCompare, Disposer); - void clear(); - template<typename Disposer> void clear_and_dispose(Disposer); + size_type erase_and_dispose(const KeyType &, KeyTypeKeyCompare, Disposer); + void clear(); + template<typename Disposer> void clear_and_dispose(Disposer); template<typename T, class... Options2> - void merge_unique(sgtree< T, Options2...> &); - while(it! = itend); + void merge_unique(sgtree< T, Options2...> &); + while(it! = itend); template<typename T, class... Options2> - void merge_equal(sgtree< T, Options2...> &); - while(it! = itend); - template<typename ExtraChecker> void check(ExtraChecker) const; - void check() const; - size_type count(const key_type &) const; + void merge_equal(sgtree< T, Options2...> &); + while(it! = itend); + template<typename ExtraChecker> void check(ExtraChecker) const; + void check() const; + size_type count(const key_type &) const; template<typename KeyType, typename KeyTypeKeyCompare> - size_type count(const KeyType &, KeyTypeKeyCompare) const; - iterator lower_bound(const key_type &); + size_type count(const KeyType &, KeyTypeKeyCompare) const; + iterator lower_bound(const key_type &); template<typename KeyType, typename KeyTypeKeyCompare> - iterator lower_bound(const KeyType &, KeyTypeKeyCompare); - const_iterator lower_bound(const key_type &) const; + iterator lower_bound(const KeyType &, KeyTypeKeyCompare); + const_iterator lower_bound(const key_type &) const; template<typename KeyType, typename KeyTypeKeyCompare> - const_iterator lower_bound(const KeyType &, KeyTypeKeyCompare) const; - iterator upper_bound(const key_type &); + const_iterator lower_bound(const KeyType &, KeyTypeKeyCompare) const; + iterator upper_bound(const key_type &); template<typename KeyType, typename KeyTypeKeyCompare> - iterator upper_bound(const KeyType &, KeyTypeKeyCompare); - const_iterator upper_bound(const key_type &) const; + iterator upper_bound(const KeyType &, KeyTypeKeyCompare); + const_iterator upper_bound(const key_type &) const; template<typename KeyType, typename KeyTypeKeyCompare> - const_iterator upper_bound(const KeyType &, KeyTypeKeyCompare) const; - iterator find(const key_type &); + const_iterator upper_bound(const KeyType &, KeyTypeKeyCompare) const; + iterator find(const key_type &); template<typename KeyType, typename KeyTypeKeyCompare> - iterator find(const KeyType &, KeyTypeKeyCompare); - const_iterator find(const key_type &) const; + iterator find(const KeyType &, KeyTypeKeyCompare); + const_iterator find(const key_type &) const; template<typename KeyType, typename KeyTypeKeyCompare> - const_iterator find(const KeyType &, KeyTypeKeyCompare) const; - std::pair< iterator, iterator > equal_range(const key_type &); + const_iterator find(const KeyType &, KeyTypeKeyCompare) const; + std::pair< iterator, iterator > equal_range(const key_type &); template<typename KeyType, typename KeyTypeKeyCompare> std::pair< iterator, iterator > - equal_range(const KeyType &, KeyTypeKeyCompare); + equal_range(const KeyType &, KeyTypeKeyCompare); std::pair< const_iterator, const_iterator > - equal_range(const key_type &) const; + equal_range(const key_type &) const; template<typename KeyType, typename KeyTypeKeyCompare> std::pair< const_iterator, const_iterator > - equal_range(const KeyType &, KeyTypeKeyCompare) const; + equal_range(const KeyType &, KeyTypeKeyCompare) const; std::pair< iterator, iterator > - bounded_range(const key_type &, const key_type &, bool, bool); + bounded_range(const key_type &, const key_type &, bool, bool); template<typename KeyType, typename KeyTypeKeyCompare> std::pair< iterator, iterator > - bounded_range(const KeyType &, const KeyType &, KeyTypeKeyCompare, bool, + bounded_range(const KeyType &, const KeyType &, KeyTypeKeyCompare, bool, bool); std::pair< const_iterator, const_iterator > - bounded_range(const key_type &, const key_type &, bool, bool) const; + bounded_range(const key_type &, const key_type &, bool, bool) const; template<typename KeyType, typename KeyTypeKeyCompare> std::pair< const_iterator, const_iterator > - bounded_range(const KeyType &, const KeyType &, KeyTypeKeyCompare, bool, + bounded_range(const KeyType &, const KeyType &, KeyTypeKeyCompare, bool, bool) const; - iterator iterator_to(reference); - const_iterator iterator_to(const_reference) const; - pointer unlink_leftmost_without_rebalance(); - void replace_node(iterator, reference); - void remove_node(reference); + iterator iterator_to(reference); + const_iterator iterator_to(const_reference) const; + pointer unlink_leftmost_without_rebalance(); + void replace_node(iterator, reference); + void remove_node(reference); - // public static functions - static treap & container_from_end_iterator(iterator); - static const treap & container_from_end_iterator(const_iterator); - static treap & container_from_iterator(iterator); - static const treap & container_from_iterator(const_iterator); - static iterator s_iterator_to(reference); - static const_iterator s_iterator_to(const_reference); - static void init_node(reference); + // public static functions + static treap & container_from_end_iterator(iterator); + static const treap & container_from_end_iterator(const_iterator); + static treap & container_from_iterator(iterator); + static const treap & container_from_iterator(const_iterator); + static iterator s_iterator_to(reference); + static const_iterator s_iterator_to(const_reference); + static void init_node(reference); // public data members static const bool constant_time_size; @@ -229,13 +229,13 @@ construct/copy/destruct
                      1. -
                        treap();
                        +
                        treap();

                        Effects: Constructs an empty container.

                        Complexity: Constant.

                        Throws: If value_traits::node_traits::node constructor throws (this does not happen with predefined Boost.Intrusive hooks) or the copy constructor of the value_compare/priority_compare objects throw. Basic guarantee.

                      2. -
                        explicit treap(const key_compare & cmp, 
+
                        explicit treap(const key_compare & cmp, 
                const priority_compare & pcmp = priority_compare(), 
                const value_traits & v_traits = value_traits());
                        
 
                        Effects: Constructs an empty container.
                        
@@ -244,7 +244,7 @@
 
                      3. template<typename Iterator> 
-  treap(bool unique, Iterator b, Iterator e, 
+  treap(bool unique, Iterator b, Iterator e, 
         const key_compare & cmp = key_compare(), 
         const priority_compare & pcmp = priority_compare(), 
         const value_traits & v_traits = value_traits());
                        @@ -254,17 +254,17 @@

                        Throws: If value_traits::node_traits::node constructor throws (this does not happen with predefined Boost.Intrusive hooks) or the copy constructor/operator() of the key_compare/priority_compare objects throw. Basic guarantee.

                      4. -
                        treap(treap && x);
                        +
                        treap(treap && x);

                        Effects: Constructs a container moving resources from another container. Internal comparison object and value traits are move constructed and nodes belonging to x (except the node representing the "end") are linked to *this.

                        Complexity: Constant.

                        Throws: If value_traits::node_traits::node's move constructor throws (this does not happen with predefined Boost.Intrusive hooks) or the move constructor of the comparison objet throws.

                      5. -
                        treap & operator=(treap && x);
                        +
                        treap & operator=(treap && x);

                        Effects: Equivalent to swap

                      6. -
                        ~treap();
                        +
                        ~treap();

                        Effects: Detaches all elements from this. The objects in the set are not deleted (i.e. no destructors are called), but the nodes according to the value_traits template parameter are reinitialized and thus can be reused.

                        Complexity: Linear to elements contained in *this.

                        Throws: Nothing.

                        @@ -273,175 +273,175 @@

                      -treap public member functions

                      +treap public member functions 
                      1. template<typename KeyPrioComp> 
-  unspecified key_node_prio_comp(KeyPrioComp keypriocomp) const;
                        2. + unspecified key_node_prio_comp(KeyPrioComp keypriocomp) const;
                      2. -
                        iterator begin();
                        +
                        iterator begin();

                        Effects: Returns an iterator pointing to the beginning of the container.

                        Complexity: Constant.

                        Throws: Nothing.

                      3. -
                        const_iterator begin() const;
                        +
                        const_iterator begin() const;

                        Effects: Returns a const_iterator pointing to the beginning of the container.

                        Complexity: Constant.

                        Throws: Nothing.

                      4. -
                        const_iterator cbegin() const;
                        +
                        const_iterator cbegin() const;

                        Effects: Returns a const_iterator pointing to the beginning of the container.

                        Complexity: Constant.

                        Throws: Nothing.

                      5. -
                        iterator end();
                        +
                        iterator end();

                        Effects: Returns an iterator pointing to the end of the container.

                        Complexity: Constant.

                        Throws: Nothing.

                      6. -
                        const_iterator end() const;
                        +
                        const_iterator end() const;

                        Effects: Returns a const_iterator pointing to the end of the container.

                        Complexity: Constant.

                        Throws: Nothing.

                      7. -
                        const_iterator cend() const;
                        +
                        const_iterator cend() const;

                        Effects: Returns a const_iterator pointing to the end of the container.

                        Complexity: Constant.

                        Throws: Nothing.

                      8. -
                        iterator top();
                        +
                        iterator top();

                        Effects: Returns an iterator pointing to the highest priority object of the treap.

                        Complexity: Constant.

                        Throws: Nothing.

                      9. -
                        const_iterator top() const;
                        +
                        const_iterator top() const;

                        Effects: Returns a const_iterator pointing to the highest priority object of the treap..

                        Complexity: Constant.

                        Throws: Nothing.

                      10. -
                        const_iterator ctop() const;
                        +
                        const_iterator ctop() const;

                        Effects: Returns a const_iterator pointing to the highest priority object of the treap..

                        Complexity: Constant.

                        Throws: Nothing.

                      11. -
                        reverse_iterator rbegin();
                        +
                        reverse_iterator rbegin();

                        Effects: Returns a reverse_iterator pointing to the beginning of the reversed container.

                        Complexity: Constant.

                        Throws: Nothing.

                      12. -
                        const_reverse_iterator rbegin() const;
                        +
                        const_reverse_iterator rbegin() const;

                        Effects: Returns a const_reverse_iterator pointing to the beginning of the reversed container.

                        Complexity: Constant.

                        Throws: Nothing.

                      13. -
                        const_reverse_iterator crbegin() const;
                        +
                        const_reverse_iterator crbegin() const;

                        Effects: Returns a const_reverse_iterator pointing to the beginning of the reversed container.

                        Complexity: Constant.

                        Throws: Nothing.

                      14. -
                        reverse_iterator rend();
                        +
                        reverse_iterator rend();

                        Effects: Returns a reverse_iterator pointing to the end of the reversed container.

                        Complexity: Constant.

                        Throws: Nothing.

                      15. -
                        const_reverse_iterator rend() const;
                        +
                        const_reverse_iterator rend() const;

                        Effects: Returns a const_reverse_iterator pointing to the end of the reversed container.

                        Complexity: Constant.

                        Throws: Nothing.

                      16. -
                        const_reverse_iterator crend() const;
                        +
                        const_reverse_iterator crend() const;

                        Effects: Returns a const_reverse_iterator pointing to the end of the reversed container.

                        Complexity: Constant.

                        Throws: Nothing.

                      17. -
                        iterator root();
                        +
                        iterator root();

                        Effects: Returns a iterator pointing to the root node of the container or end() if not present.

                        Complexity: Constant.

                        Throws: Nothing.

                      18. -
                        const_iterator root() const;
                        +
                        const_iterator root() const;

                        Effects: Returns a const_iterator pointing to the root node of the container or cend() if not present.

                        Complexity: Constant.

                        Throws: Nothing.

                      19. -
                        const_iterator croot() const;
                        +
                        const_iterator croot() const;

                        Effects: Returns a const_iterator pointing to the root node of the container or cend() if not present.

                        Complexity: Constant.

                        Throws: Nothing.

                      20. -
                        reverse_iterator rtop();
                        +
                        reverse_iterator rtop();

                        Effects: Returns a reverse_iterator pointing to the highest priority object of the reversed treap.

                        Complexity: Constant.

                        Throws: Nothing.

                      21. -
                        const_reverse_iterator rtop() const;
                        +
                        const_reverse_iterator rtop() const;

                        Effects: Returns a const_reverse_iterator pointing to the highest priority objec of the reversed treap.

                        Complexity: Constant.

                        Throws: Nothing.

                      22. -
                        const_reverse_iterator crtop() const;
                        +
                        const_reverse_iterator crtop() const;

                        Effects: Returns a const_reverse_iterator pointing to the highest priority object of the reversed treap.

                        Complexity: Constant.

                        Throws: Nothing.

                      23. -
                        key_compare key_comp() const;
                        +
                        key_compare key_comp() const;

                        Effects: Returns the key_compare object used by the container.

                        Complexity: Constant.

                        Throws: If key_compare copy-constructor throws.

                      24. -
                        value_compare value_comp() const;
                        +
                        value_compare value_comp() const;

                        Effects: Returns the value_compare object used by the container.

                        Complexity: Constant.

                        Throws: If value_compare copy-constructor throws.

                      25. -
                        bool empty() const;
                        +
                        bool empty() const;

                        Effects: Returns true if the container is empty.

                        Complexity: Constant.

                        Throws: Nothing.

                      26. -
                        size_type size() const;
                        +
                        size_type size() const;

                        Effects: Returns the number of elements stored in the container.

                        Complexity: Linear to elements contained in *this if constant-time size option is disabled. Constant time otherwise.

                        Throws: Nothing.

                      27. -
                        priority_compare priority_comp() const;
                        +
                        priority_compare priority_comp() const;

                        Effects: Returns the priority_compare object used by the container.

                        Complexity: Constant.

                        Throws: If priority_compare copy-constructor throws.

                      28. -
                        void swap(treap & other);
                        +
                        void swap(treap & other);

                        Effects: Swaps the contents of two treaps.

                        Complexity: Constant.

                        Throws: If the comparison functor's swap call throws. 

                      29. template<typename Cloner, typename Disposer> 
-  void clone_from(const treap & src, Cloner cloner, Disposer disposer);
                        + void clone_from(const treap & src, Cloner cloner, Disposer disposer);

                        Requires: Disposer::operator()(pointer) shouldn't throw. Cloner should yield to nodes equivalent to the original nodes.

                        Effects: Erases all the elements from *this calling Disposer::operator()(pointer), clones all the elements from src calling Cloner::operator()(const_reference ) and inserts them on *this. Copies the predicate from the source container.

                        If cloner throws, all cloned elements are unlinked and disposed calling Disposer::operator()(pointer).

                        @@ -450,7 +450,7 @@ 
                      30. template<typename Cloner, typename Disposer> 
-  void clone_from(treap && src, Cloner cloner, Disposer disposer);
                        + void clone_from(treap && src, Cloner cloner, Disposer disposer);

                        Requires: Disposer::operator()(pointer) shouldn't throw. Cloner should yield to nodes equivalent to the original nodes.

                        Effects: Erases all the elements from *this calling Disposer::operator()(pointer), clones all the elements from src calling Cloner::operator()(reference) and inserts them on *this. Copies the predicate from the source container.

                        If cloner throws, all cloned elements are unlinked and disposed calling Disposer::operator()(pointer).

                        @@ -458,7 +458,7 @@

                        Throws: If cloner throws or predicate copy assignment throws. Basic guarantee.

                      31. -
                        iterator insert_equal(reference value);
                        +
                        iterator insert_equal(reference value);

                        Requires: value must be an lvalue

                        Effects: Inserts value into the container before the upper bound.

                        Complexity: Average complexity for insert element is at most logarithmic.

                        @@ -466,7 +466,7 @@

                        Note: Does not affect the validity of iterators and references. No copy-constructors are called.

                      32. -
                        iterator insert_equal(const_iterator hint, reference value);
                        +
                        iterator insert_equal(const_iterator hint, reference value);

                        Requires: value must be an lvalue, and "hint" must be a valid iterator.

                        Effects: Inserts x into the container, using "hint" as a hint to where it will be inserted. If "hint" is the upper_bound the insertion takes constant time (two comparisons in the worst case)

                        Complexity: Logarithmic in general, but it is amortized constant time if t is inserted immediately before hint.

                        @@ -474,7 +474,7 @@

                        Note: Does not affect the validity of iterators and references. No copy-constructors are called.

                      33. -
                        template<typename Iterator> void insert_equal(Iterator b, Iterator e);
                        +
                        template<typename Iterator> void insert_equal(Iterator b, Iterator e);

                        Requires: Dereferencing iterator must yield an lvalue of type value_type.

                        Effects: Inserts a each element of a range into the container before the upper bound of the key of each element.

                        Complexity: Insert range is in general O(N * log(N)), where N is the size of the range. However, it is linear in N if the range is already sorted by key_comp().

                        @@ -482,7 +482,7 @@

                        Note: Does not affect the validity of iterators and references. No copy-constructors are called.

                      34. -
                        std::pair< iterator, bool > insert_unique(reference value);
                        +
                        std::pair< iterator, bool > insert_unique(reference value);

                        Requires: value must be an lvalue

                        Effects: Inserts value into the container if the value is not already present.

                        Complexity: Average complexity for insert element is at most logarithmic.

                        @@ -490,7 +490,7 @@

                        Note: Does not affect the validity of iterators and references. No copy-constructors are called.

                      35. -
                        iterator insert_unique(const_iterator hint, reference value);
                        +
                        iterator insert_unique(const_iterator hint, reference value);

                        Requires: value must be an lvalue, and "hint" must be a valid iterator

                        Effects: Tries to insert x into the container, using "hint" as a hint to where it will be inserted.

                        Complexity: Logarithmic in general, but it is amortized constant time (two comparisons in the worst case) if t is inserted immediately before hint.

                        @@ -498,7 +498,7 @@

                        Note: Does not affect the validity of iterators and references. No copy-constructors are called.

                      36. -
                        template<typename Iterator> void insert_unique(Iterator b, Iterator e);
                        +
                        template<typename Iterator> void insert_unique(Iterator b, Iterator e);

                        Requires: Dereferencing iterator must yield an lvalue of type value_type.

                        Effects: Tries to insert each element of a range into the container.

                        Complexity: Insert range is in general O(N * log(N)), where N is the size of the range. However, it is linear in N if the range is already sorted by key_comp().

                        @@ -507,7 +507,7 @@ 
                      37. std::pair< iterator, bool > 
-insert_unique_check(const key_type & key, insert_commit_data & commit_data);
                        +insert_unique_check(const key_type & key, insert_commit_data & commit_data);

                        Effects: Checks if a value can be inserted in the container, using a user provided key instead of the value itself.

                        Returns: If there is an equivalent value returns a pair containing an iterator to the already present value and false. If the value can be inserted returns true in the returned pair boolean and fills "commit_data" that is meant to be used with the "insert_commit" function.

                        Complexity: Average complexity is at most logarithmic.

                        @@ -518,7 +518,7 @@ 
                      38. std::pair< iterator, bool > 
-insert_unique_check(const_iterator hint, const key_type & key, 
+insert_unique_check(const_iterator hint, const key_type & key, 
                     insert_commit_data & commit_data);

                        Effects: Checks if a value can be inserted in the container, using a user provided key instead of the value itself, using "hint" as a hint to where it will be inserted.

                        Returns: If there is an equivalent value returns a pair containing an iterator to the already present value and false. If the value can be inserted returns true in the returned pair boolean and fills "commit_data" that is meant to be used with the "insert_commit" function.

                        @@ -532,7 +532,7 @@ 
                        template<typename KeyType, typename KeyTypeKeyCompare, 
          typename KeyValuePrioCompare> 
   std::pair< iterator BOOST_INTRUSIVE_I bool > 
-  insert_unique_check(const KeyType & key, KeyTypeKeyCompare comp, 
+  insert_unique_check(const KeyType & key, KeyTypeKeyCompare comp, 
                       KeyValuePrioCompare key_value_pcomp, 
                       insert_commit_data & commit_data);

                        Requires: comp must be a comparison function that induces the same strict weak ordering as key_compare. key_value_pcomp must be a comparison function that induces the same strict weak ordering as priority_compare. The difference is that key_value_pcomp and comp compare an arbitrary key with the contained values.

                        @@ -548,7 +548,7 @@ 
                        template<typename KeyType, typename KeyTypeKeyCompare, 
          typename KeyValuePrioCompare> 
   std::pair< iterator, bool > 
-  insert_unique_check(const_iterator hint, const KeyType & key, 
+  insert_unique_check(const_iterator hint, const KeyType & key, 
                       KeyTypeKeyCompare comp, 
                       KeyValuePrioCompare key_value_pcomp, 
                       insert_commit_data & commit_data);
                        @@ -562,7 +562,7 @@

                        "commit_data" remains valid for a subsequent "insert_commit" only if no more objects are inserted or erased from the container.

                      39. -
                        iterator insert_unique_commit(reference value, 
+
                        iterator insert_unique_commit(reference value, 
                               const insert_commit_data & commit_data);
                        
 
                        Requires: value must be an lvalue of type value_type. commit_data must have been obtained from a previous call to "insert_check". No objects should have been inserted or erased from the container between the "insert_check" that filled "commit_data" and the call to "insert_commit".
                        
 
                        Effects: Inserts the value in the avl_set using the information obtained from the "commit_data" that a previous "insert_check" filled.
                        
@@ -572,7 +572,7 @@
 
                        Notes: This function has only sense if a "insert_check" has been previously executed to fill "commit_data". No value should be inserted or erased between the "insert_check" and "insert_commit" calls.
                      40. -
                        iterator insert_before(const_iterator pos, reference value);
                        +
                        iterator insert_before(const_iterator pos, reference value);

                        Requires: value must be an lvalue, "pos" must be a valid iterator (or end) and must be the succesor of value once inserted according to the predicate

                        Effects: Inserts x into the container before "pos".

                        Complexity: Constant time.

                        @@ -580,7 +580,7 @@

                        Note: This function does not check preconditions so if "pos" is not the successor of "value" container ordering invariant will be broken. This is a low-level function to be used only for performance reasons by advanced users.

                      41. -
                        void push_back(reference value);
                        +
                        void push_back(reference value);

                        Requires: value must be an lvalue, and it must be no less than the greatest inserted key

                        Effects: Inserts x into the container in the last position.

                        Complexity: Constant time.

                        @@ -588,7 +588,7 @@

                        Note: This function does not check preconditions so if value is less than the greatest inserted key container ordering invariant will be broken. This function is slightly more efficient than using "insert_before". This is a low-level function to be used only for performance reasons by advanced users.

                      42. -
                        void push_front(reference value);
                        +
                        void push_front(reference value);

                        Requires: value must be an lvalue, and it must be no greater than the minimum inserted key

                        Effects: Inserts x into the container in the first position.

                        Complexity: Constant time.

                        @@ -596,21 +596,21 @@

                        Note: This function does not check preconditions so if value is greater than the minimum inserted key container ordering invariant will be broken. This function is slightly more efficient than using "insert_before". This is a low-level function to be used only for performance reasons by advanced users.

                      43. -
                        iterator erase(const_iterator i);
                        +
                        iterator erase(const_iterator i);

                        Effects: Erases the element pointed to by i.

                        Complexity: Average complexity for erase element is constant time.

                        Throws: if the internal priority_compare function throws. Strong guarantee.

                        Note: Invalidates the iterators (but not the references) to the erased elements. No destructors are called.

                      44. -
                        iterator erase(const_iterator b, const_iterator e);
                        +
                        iterator erase(const_iterator b, const_iterator e);

                        Effects: Erases the range pointed to by b end e.

                        Complexity: Average complexity for erase range is at most O(log(size() + N)), where N is the number of elements in the range.

                        Throws: if the internal priority_compare function throws. Strong guarantee.

                        Note: Invalidates the iterators (but not the references) to the erased elements. No destructors are called.

                      45. -
                        size_type erase(const key_type & key);
                        +
                        size_type erase(const key_type & key);

                        Effects: Erases all the elements with the given value.

                        Returns: The number of erased elements.

                        Complexity: O(log(size() + N).

                        @@ -619,7 +619,7 @@ 
                      46. template<typename KeyType, typename KeyTypeKeyCompare> 
-  size_type erase(const KeyType & key, KeyTypeKeyCompare comp);
                        + size_type erase(const KeyType & key, KeyTypeKeyCompare comp);

                        Effects: Erases all the elements with the given key. according to the comparison functor "comp".

                        Returns: The number of erased elements.

                        Complexity: O(log(size() + N).

                        @@ -628,7 +628,7 @@ 
                      47. template<typename Disposer> 
-  iterator erase_and_dispose(const_iterator i, Disposer disposer);
                        + iterator erase_and_dispose(const_iterator i, Disposer disposer);

                        Requires: Disposer::operator()(pointer) shouldn't throw.

                        Effects: Erases the element pointed to by i. Disposer::operator()(pointer) is called for the removed element.

                        Complexity: Average complexity for erase element is constant time.

                        @@ -637,7 +637,7 @@ 
                      48. template<typename Disposer> 
-  iterator erase_and_dispose(const_iterator b, const_iterator e, 
+  iterator erase_and_dispose(const_iterator b, const_iterator e, 
                              Disposer disposer);

                        Requires: Disposer::operator()(pointer) shouldn't throw.

                        Effects: Erases the range pointed to by b end e. Disposer::operator()(pointer) is called for the removed elements.

                        @@ -647,7 +647,7 @@ 
                      49. template<typename Disposer> 
-  size_type erase_and_dispose(const key_type & key, Disposer disposer);
                        + size_type erase_and_dispose(const key_type & key, Disposer disposer);

                        Requires: Disposer::operator()(pointer) shouldn't throw.

                        Effects: Erases all the elements with the given value. Disposer::operator()(pointer) is called for the removed elements.

                        Returns: The number of erased elements.

                        @@ -657,7 +657,7 @@ 
                      50. template<typename KeyType, typename KeyTypeKeyCompare, typename Disposer> 
-  size_type erase_and_dispose(const KeyType & key, KeyTypeKeyCompare comp, 
+  size_type erase_and_dispose(const KeyType & key, KeyTypeKeyCompare comp, 
                               Disposer disposer);

                        Requires: Disposer::operator()(pointer) shouldn't throw.

                        Effects: Erases all the elements with the given key. according to the comparison functor "comp". Disposer::operator()(pointer) is called for the removed elements.

                        @@ -667,79 +667,79 @@

                        Note: Invalidates the iterators to the erased elements.

                      51. -
                        void clear();
                        +
                        void clear();

                        Effects: Erases all of the elements.

                        Complexity: Linear to the number of elements on the container. if it's a safe-mode or auto-unlink value_type. Constant time otherwise.

                        Throws: Nothing.

                        Note: Invalidates the iterators (but not the references) to the erased elements. No destructors are called.

                      52. -
                        template<typename Disposer> void clear_and_dispose(Disposer disposer);
                        +
                        template<typename Disposer> void clear_and_dispose(Disposer disposer);

                        Effects: Erases all of the elements calling disposer(p) for each node to be erased. Complexity: Average complexity for is at most O(log(size() + N)), where N is the number of elements in the container.

                        Throws: Nothing.

                        Note: Invalidates the iterators (but not the references) to the erased elements. Calls N times to disposer functor. 

                      53. template<typename T, class... Options2> 
-  void merge_unique(sgtree< T, Options2...> &);
                        + void merge_unique(sgtree< T, Options2...> &);

                        Requires: "source" container's Options can only can differ in the comparison function from *this.

                        Effects: Attempts to extract each element in source and insert it into a using the comparison object of *this. If there is an element in a with key equivalent to the key of an element from source, then that element is not extracted from source.

                        Postcondition: Pointers and references to the transferred elements of source refer to those same elements but as members of *this. Iterators referring to the transferred elements will continue to refer to their elements, but they now behave as iterators into *this, not into source.

                        Throws: Nothing unless the comparison object throws.

                        Complexity: N log(a.size() + N) (N has the value source.size())

                        54. -
                      54.  while(it! = itend);
                        55. +
                      55.  while(it! = itend);
                      56. template<typename T, class... Options2> 
-  void merge_equal(sgtree< T, Options2...> &);
                        + void merge_equal(sgtree< T, Options2...> &);

                        Requires: "source" container's Options can only can differ in the comparison function from *this.

                        Effects: Extracts each element in source and insert it into a using the comparison object of *this.

                        Postcondition: Pointers and references to the transferred elements of source refer to those same elements but as members of *this. Iterators referring to the transferred elements will continue to refer to their elements, but they now behave as iterators into *this, not into source.

                        Throws: Nothing unless the comparison object throws.

                        Complexity: N log(a.size() + N) (N has the value source.size())

                        57. -
                      57.  while(it! = itend);
                        58. +
                      58.  while(it! = itend);
                      59. -
                        template<typename ExtraChecker> void check(ExtraChecker extra_checker) const;
                        +
                        template<typename ExtraChecker> void check(ExtraChecker extra_checker) const;

                        Effects: Asserts the integrity of the container with additional checks provided by the user.

                        Complexity: Linear time.

                        Note: The method might not have effect when asserts are turned off (e.g., with NDEBUG). Experimental function, interface might change in future versions.

                      60. -
                        void check() const;
                        +
                        void check() const;

                        Effects: Asserts the integrity of the container.

                        Complexity: Linear time.

                        Note: The method has no effect when asserts are turned off (e.g., with NDEBUG). Experimental function, interface might change in future versions.

                      61. -
                        size_type count(const key_type & key) const;
                        +
                        size_type count(const key_type & key) const;

                        Effects: Returns the number of contained elements with the given value

                        Complexity: Logarithmic to the number of elements contained plus lineal to number of objects with the given value.

                        Throws: If key_compare throws. 

                      62. template<typename KeyType, typename KeyTypeKeyCompare> 
-  size_type count(const KeyType & key, KeyTypeKeyCompare comp) const;
                        + size_type count(const KeyType & key, KeyTypeKeyCompare comp) const;

                        Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk), and nk the key_type of a value_type inserted into *this.

                        Effects: Returns the number of contained elements with the given key

                        Complexity: Logarithmic to the number of elements contained plus lineal to number of objects with the given key.

                        Throws: If comp throws.

                      63. -
                        iterator lower_bound(const key_type & key);
                        +
                        iterator lower_bound(const key_type & key);

                        Effects: Returns an iterator to the first element whose key is not less than k or end() if that element does not exist.

                        Complexity: Logarithmic.

                        Throws: If key_compare throws. 

                      64. template<typename KeyType, typename KeyTypeKeyCompare> 
-  iterator lower_bound(const KeyType & key, KeyTypeKeyCompare comp);
                        + iterator lower_bound(const KeyType & key, KeyTypeKeyCompare comp);

                        Effects: Returns an iterator to the first element whose key is not less than k or end() if that element does not exist.

                        Complexity: Logarithmic.

                        Throws: If key_compare throws.

                      65. -
                        const_iterator lower_bound(const key_type & key) const;
                        +
                        const_iterator lower_bound(const key_type & key) const;

                        Effects: Returns an iterator to the first element whose key is not less than k or end() if that element does not exist.

                        Complexity: Logarithmic.

                        Throws: If key_compare throws.

                        @@ -747,27 +747,27 @@ 
                      66. template<typename KeyType, typename KeyTypeKeyCompare> 
   const_iterator 
-  lower_bound(const KeyType & key, KeyTypeKeyCompare comp) const;
                        + lower_bound(const KeyType & key, KeyTypeKeyCompare comp) const;

                        Effects: Returns an iterator to the first element whose key is not less than k or end() if that element does not exist.

                        Complexity: Logarithmic.

                        Throws: If key_compare throws.

                      67. -
                        iterator upper_bound(const key_type & key);
                        +
                        iterator upper_bound(const key_type & key);

                        Effects: Returns an iterator to the first element whose key is greater than k or end() if that element does not exist.

                        Complexity: Logarithmic.

                        Throws: If key_compare throws. 

                      68. template<typename KeyType, typename KeyTypeKeyCompare> 
-  iterator upper_bound(const KeyType & key, KeyTypeKeyCompare comp);
                        + iterator upper_bound(const KeyType & key, KeyTypeKeyCompare comp);

                        Requires: key is a value such that *this is partitioned with respect to !comp(key, nk), with nk the key_type of a value_type inserted into *this.

                        Effects: Returns an iterator to the first element whose key is greater than k according to comp or end() if that element does not exist.

                        Complexity: Logarithmic.

                        Throws: If comp throws.

                      69. -
                        const_iterator upper_bound(const key_type & key) const;
                        +
                        const_iterator upper_bound(const key_type & key) const;

                        Effects: Returns an iterator to the first element whose key is greater than k or end() if that element does not exist.

                        Complexity: Logarithmic.

                        Throws: If key_compare throws.

                        @@ -775,42 +775,42 @@ 
                      70. template<typename KeyType, typename KeyTypeKeyCompare> 
   const_iterator 
-  upper_bound(const KeyType & key, KeyTypeKeyCompare comp) const;
                        + upper_bound(const KeyType & key, KeyTypeKeyCompare comp) const;

                        Requires: key is a value such that *this is partitioned with respect to !comp(key, nk), with nk the key_type of a value_type inserted into *this.

                        Effects: Returns an iterator to the first element whose key is greater than k according to comp or end() if that element does not exist.

                        Complexity: Logarithmic.

                        Throws: If comp throws.

                      71. -
                        iterator find(const key_type & key);
                        +
                        iterator find(const key_type & key);

                        Effects: Finds an iterator to the first element whose key is k or end() if that element does not exist.

                        Complexity: Logarithmic.

                        Throws: If key_compare throws. 

                      72. template<typename KeyType, typename KeyTypeKeyCompare> 
-  iterator find(const KeyType & key, KeyTypeKeyCompare comp);
                        + iterator find(const KeyType & key, KeyTypeKeyCompare comp);

                        Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk), and nk the key_type of a value_type inserted into *this.

                        Effects: Finds an iterator to the first element whose key is k or end() if that element does not exist.

                        Complexity: Logarithmic.

                        Throws: If comp throws.

                      73. -
                        const_iterator find(const key_type & key) const;
                        +
                        const_iterator find(const key_type & key) const;

                        Effects: Finds an iterator to the first element whose key is k or end() if that element does not exist.

                        Complexity: Logarithmic.

                        Throws: If key_compare throws. 

                      74. template<typename KeyType, typename KeyTypeKeyCompare> 
-  const_iterator find(const KeyType & key, KeyTypeKeyCompare comp) const;
                        + const_iterator find(const KeyType & key, KeyTypeKeyCompare comp) const;

                        Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk), and nk the key_type of a value_type inserted into *this.

                        Effects: Finds an iterator to the first element whose key is k or end() if that element does not exist.

                        Complexity: Logarithmic.

                        Throws: If comp throws.

                      75. -
                        std::pair< iterator, iterator > equal_range(const key_type & key);
                        +
                        std::pair< iterator, iterator > equal_range(const key_type & key);

                        Effects: Finds a range containing all elements whose key is k or an empty range that indicates the position where those elements would be if they there is no elements with key k.

                        Complexity: Logarithmic.

                        Throws: If key_compare throws.

                        @@ -818,7 +818,7 @@ 
                      76. template<typename KeyType, typename KeyTypeKeyCompare> 
   std::pair< iterator, iterator > 
-  equal_range(const KeyType & key, KeyTypeKeyCompare comp);
                        + equal_range(const KeyType & key, KeyTypeKeyCompare comp);

                        Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk), with nk the key_type of a value_type inserted into *this.

                        Effects: Finds a range containing all elements whose key is k or an empty range that indicates the position where those elements would be if they there is no elements with key k.

                        Complexity: Logarithmic.

                        @@ -826,7 +826,7 @@ 
                      77. std::pair< const_iterator, const_iterator > 
-equal_range(const key_type & key) const;
                        +equal_range(const key_type & key) const;

                        Effects: Finds a range containing all elements whose key is k or an empty range that indicates the position where those elements would be if they there is no elements with key k.

                        Complexity: Logarithmic.

                        Throws: If key_compare throws.

                        @@ -834,7 +834,7 @@ 
                      78. template<typename KeyType, typename KeyTypeKeyCompare> 
   std::pair< const_iterator, const_iterator > 
-  equal_range(const KeyType & key, KeyTypeKeyCompare comp) const;
                        + equal_range(const KeyType & key, KeyTypeKeyCompare comp) const;

                        Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk), with nk the key_type of a value_type inserted into *this.

                        Effects: Finds a range containing all elements whose key is k or an empty range that indicates the position where those elements would be if they there is no elements with key k.

                        Complexity: Logarithmic.

                        @@ -842,7 +842,7 @@ 
                      79. std::pair< iterator, iterator > 
-bounded_range(const key_type & lower_key, const key_type & upper_key, 
+bounded_range(const key_type & lower_key, const key_type & upper_key, 
               bool left_closed, bool right_closed);

                        Requires: upper_key shall not precede lower_key according to key_compare. [key_comp()(upper_key, lower_key) shall be false]

                        If lower_key is equivalent to upper_key [!key_comp()(upper_key, lower_key) && !key_comp()(lower_key, upper_key)] then ('left_closed' || 'right_closed') must be false.

                        @@ -857,7 +857,7 @@ 
                      80. template<typename KeyType, typename KeyTypeKeyCompare> 
   std::pair< iterator, iterator > 
-  bounded_range(const KeyType & lower_key, const KeyType & upper_key, 
+  bounded_range(const KeyType & lower_key, const KeyType & upper_key, 
                 KeyTypeKeyCompare comp, bool left_closed, bool right_closed);

                        Requires: lower_key is a value such that *this is partitioned with respect to comp(nk, lower_key) if left_closed is true, with respect to !comp(lower_key, nk) otherwise.

                        upper_key is a value such that *this is partitioned with respect to !comp(upper_key, nk) if right_closed is true, with respect to comp(nk, upper_key) otherwise.

                        @@ -873,7 +873,7 @@ 
                      81. std::pair< const_iterator, const_iterator > 
-bounded_range(const key_type & lower_key, const key_type & upper_key, 
+bounded_range(const key_type & lower_key, const key_type & upper_key, 
               bool left_closed, bool right_closed) const;

                        Requires: upper_key shall not precede lower_key according to key_compare. [key_comp()(upper_key, lower_key) shall be false]

                        If lower_key is equivalent to upper_key [!key_comp()(upper_key, lower_key) && !key_comp()(lower_key, upper_key)] then ('left_closed' || 'right_closed') must be false.

                        @@ -888,7 +888,7 @@ 
                      82. template<typename KeyType, typename KeyTypeKeyCompare> 
   std::pair< const_iterator, const_iterator > 
-  bounded_range(const KeyType & lower_key, const KeyType & upper_key, 
+  bounded_range(const KeyType & lower_key, const KeyType & upper_key, 
                 KeyTypeKeyCompare comp, bool left_closed, bool right_closed) const;

                        Requires: lower_key is a value such that *this is partitioned with respect to comp(nk, lower_key) if left_closed is true, with respect to !comp(lower_key, nk) otherwise.

                        upper_key is a value such that *this is partitioned with respect to !comp(upper_key, nk) if right_closed is true, with respect to comp(nk, upper_key) otherwise.

                        @@ -903,28 +903,28 @@

                        Note: Experimental function, the interface might change in future releases.

                      83. -
                        iterator iterator_to(reference value);
                        +
                        iterator iterator_to(reference value);

                        Requires: value must be an lvalue and shall be in a set of appropriate type. Otherwise the behavior is undefined.

                        Effects: Returns: a valid iterator i belonging to the set that points to the value

                        Complexity: Constant.

                        Throws: Nothing.

                      84. -
                        const_iterator iterator_to(const_reference value) const;
                        +
                        const_iterator iterator_to(const_reference value) const;

                        Requires: value must be an lvalue and shall be in a set of appropriate type. Otherwise the behavior is undefined.

                        Effects: Returns: a valid const_iterator i belonging to the set that points to the value

                        Complexity: Constant.

                        Throws: Nothing.

                      85. -
                        pointer unlink_leftmost_without_rebalance();
                        +
                        pointer unlink_leftmost_without_rebalance();

                        Effects: Unlinks the leftmost node from the container.

                        Complexity: Average complexity is constant time.

                        Throws: Nothing.

                        Notes: This function breaks the container and the container can only be used for more unlink_leftmost_without_rebalance calls. This function is normally used to achieve a step by step controlled destruction of the container.

                      86. -
                        void replace_node(iterator replace_this, reference with_this);
                        +
                        void replace_node(iterator replace_this, reference with_this);

                        Requires: replace_this must be a valid iterator of *this and with_this must not be inserted in any container.

                        Effects: Replaces replace_this in its position in the container with with_this. The container does not need to be rebalanced.

                        Complexity: Constant.

                        @@ -932,7 +932,7 @@

                        Note: This function will break container ordering invariants if with_this is not equivalent to *replace_this according to the ordering rules. This function is faster than erasing and inserting the node, since no rebalancing or comparison is needed.

                      87. -
                        void remove_node(reference value);
                        +
                        void remove_node(reference value);

                        Effects: removes "value" from the container.

                        Throws: Nothing.

                        Complexity: Logarithmic time.

                        @@ -943,38 +943,38 @@

                      -treap public static functions

                      +treap public static functions
                      1. -
                        static treap & container_from_end_iterator(iterator end_iterator);
                        +
                        static treap & container_from_end_iterator(iterator end_iterator);

                        Precondition: end_iterator must be a valid end iterator of the container.

                        Effects: Returns a const reference to the container associated to the end iterator

                        Throws: Nothing.

                        Complexity: Constant.

                      2. -
                        static const treap & container_from_end_iterator(const_iterator end_iterator);
                        +
                        static const treap & container_from_end_iterator(const_iterator end_iterator);

                        Precondition: end_iterator must be a valid end iterator of the container.

                        Effects: Returns a const reference to the container associated to the end iterator

                        Throws: Nothing.

                        Complexity: Constant.

                      3. -
                        static treap & container_from_iterator(iterator it);
                        +
                        static treap & container_from_iterator(iterator it);

                        Precondition: it must be a valid iterator of the container.

                        Effects: Returns a const reference to the container associated to the iterator

                        Throws: Nothing.

                        Complexity: Logarithmic.

                      4. -
                        static const treap & container_from_iterator(const_iterator it);
                        +
                        static const treap & container_from_iterator(const_iterator it);

                        Precondition: it must be a valid iterator of the container.

                        Effects: Returns a const reference to the container associated to the iterator

                        Throws: Nothing.

                        Complexity: Logarithmic.

                      5. -
                        static iterator s_iterator_to(reference value);
                        +
                        static iterator s_iterator_to(reference value);

                        Requires: value must be an lvalue and shall be in a set of appropriate type. Otherwise the behavior is undefined.

                        Effects: Returns: a valid iterator i belonging to the set that points to the value

                        Complexity: Constant.

                        @@ -982,7 +982,7 @@

                        Note: This static function is available only if the value traits is stateless.

                      6. -
                        static const_iterator s_iterator_to(const_reference value);
                        +
                        static const_iterator s_iterator_to(const_reference value);

                        Requires: value must be an lvalue and shall be in a set of appropriate type. Otherwise the behavior is undefined.

                        Effects: Returns: a valid iterator i belonging to the set that points to the value

                        Complexity: Constant.

                        @@ -990,7 +990,7 @@

                        Note: This static function is available only if the value traits is stateless.

                      7. -
                        static void init_node(reference value);
                        +
                        static void init_node(reference value);

                        Requires: value shall not be in a container.

                        Effects: init_node puts the hook of a value in a well-known default state.

                        Throws: Nothing.

                        diff --git a/doc/html/boost/intrusive/treap_algorithms.html b/doc/html/boost/intrusive/treap_algorithms.html index 237a15b522..36cdb0db4a 100644 --- a/doc/html/boost/intrusive/treap_algorithms.html +++ b/doc/html/boost/intrusive/treap_algorithms.html @@ -46,98 +46,98 @@ struct insert_commit_data { }; - // public static functions - static node_ptr get_header(const const_node_ptr &); - static node_ptr begin_node(const const_node_ptr &); - static node_ptr end_node(const const_node_ptr &); - static void swap_tree(const node_ptr &, const node_ptr &); - static void swap_nodes(const node_ptr &, const node_ptr &); - static void swap_nodes(const node_ptr &, const node_ptr &, const node_ptr &, + // public static functions + static node_ptr get_header(const const_node_ptr &); + static node_ptr begin_node(const const_node_ptr &); + static node_ptr end_node(const const_node_ptr &); + static void swap_tree(const node_ptr &, const node_ptr &); + static void swap_nodes(const node_ptr &, const node_ptr &); + static void swap_nodes(const node_ptr &, const node_ptr &, const node_ptr &, const node_ptr &); - static void replace_node(const node_ptr &, const node_ptr &); - static void replace_node(const node_ptr &, const node_ptr &, + static void replace_node(const node_ptr &, const node_ptr &); + static void replace_node(const node_ptr &, const node_ptr &, const node_ptr &); template<typename NodePtrPriorityCompare> - static void unlink(const node_ptr &, NodePtrPriorityCompare); - static node_ptr unlink_leftmost_without_rebalance(const node_ptr &); - static bool unique(const const_node_ptr &); - static std::size_t size(const const_node_ptr &); - static node_ptr next_node(const node_ptr &); - static node_ptr prev_node(const node_ptr &); - static void init(const node_ptr &); - static void init_header(const node_ptr &); + static void unlink(const node_ptr &, NodePtrPriorityCompare); + static node_ptr unlink_leftmost_without_rebalance(const node_ptr &); + static bool unique(const const_node_ptr &); + static std::size_t size(const const_node_ptr &); + static node_ptr next_node(const node_ptr &); + static node_ptr prev_node(const node_ptr &); + static void init(const node_ptr &); + static void init_header(const node_ptr &); template<typename NodePtrPriorityCompare> static node_ptr - erase(const node_ptr &, const node_ptr &, NodePtrPriorityCompare); + erase(const node_ptr &, const node_ptr &, NodePtrPriorityCompare); template<typename Cloner, typename Disposer> - static void clone(const const_node_ptr &, const node_ptr &, Cloner, + static void clone(const const_node_ptr &, const node_ptr &, Cloner, Disposer); template<typename Disposer> - static void clear_and_dispose(const node_ptr &, Disposer); + static void clear_and_dispose(const node_ptr &, Disposer); template<typename KeyType, typename KeyNodePtrCompare> static node_ptr - lower_bound(const const_node_ptr &, const KeyType &, KeyNodePtrCompare); + lower_bound(const const_node_ptr &, const KeyType &, KeyNodePtrCompare); template<typename KeyType, typename KeyNodePtrCompare> static node_ptr - upper_bound(const const_node_ptr &, const KeyType &, KeyNodePtrCompare); + upper_bound(const const_node_ptr &, const KeyType &, KeyNodePtrCompare); template<typename KeyType, typename KeyNodePtrCompare> static node_ptr - find(const const_node_ptr &, const KeyType &, KeyNodePtrCompare); + find(const const_node_ptr &, const KeyType &, KeyNodePtrCompare); template<typename KeyType, typename KeyNodePtrCompare> static std::pair< node_ptr, node_ptr > - equal_range(const const_node_ptr &, const KeyType &, KeyNodePtrCompare); + equal_range(const const_node_ptr &, const KeyType &, KeyNodePtrCompare); template<typename KeyType, typename KeyNodePtrCompare> static std::pair< node_ptr, node_ptr > - bounded_range(const const_node_ptr &, const KeyType &, const KeyType &, + bounded_range(const const_node_ptr &, const KeyType &, const KeyType &, KeyNodePtrCompare, bool, bool); template<typename KeyType, typename KeyNodePtrCompare> static std::size_t - count(const const_node_ptr &, const KeyType &, KeyNodePtrCompare); + count(const const_node_ptr &, const KeyType &, KeyNodePtrCompare); template<typename NodePtrCompare, typename NodePtrPriorityCompare> static node_ptr - insert_equal_upper_bound(const node_ptr &, const node_ptr &, + insert_equal_upper_bound(const node_ptr &, const node_ptr &, NodePtrCompare, NodePtrPriorityCompare); template<typename NodePtrCompare, typename NodePtrPriorityCompare> static node_ptr - insert_equal_lower_bound(const node_ptr &, const node_ptr &, + insert_equal_lower_bound(const node_ptr &, const node_ptr &, NodePtrCompare, NodePtrPriorityCompare); template<typename NodePtrCompare, typename NodePtrPriorityCompare> static node_ptr - insert_equal(const node_ptr &, const node_ptr &, const node_ptr &, + insert_equal(const node_ptr &, const node_ptr &, const node_ptr &, NodePtrCompare, NodePtrPriorityCompare); template<typename NodePtrPriorityCompare> static node_ptr - insert_before(const node_ptr &, const node_ptr &, const node_ptr &, + insert_before(const node_ptr &, const node_ptr &, const node_ptr &, NodePtrPriorityCompare); template<typename NodePtrPriorityCompare> - static void push_back(const node_ptr &, const node_ptr &, + static void push_back(const node_ptr &, const node_ptr &, NodePtrPriorityCompare); template<typename NodePtrPriorityCompare> - static void push_front(const node_ptr &, const node_ptr &, + static void push_front(const node_ptr &, const node_ptr &, NodePtrPriorityCompare); template<typename KeyType, typename KeyNodePtrCompare, typename KeyNodePtrPrioCompare> static std::pair< node_ptr, bool > - insert_unique_check(const const_node_ptr &, const KeyType &, + insert_unique_check(const const_node_ptr &, const KeyType &, KeyNodePtrCompare, KeyNodePtrPrioCompare, insert_commit_data &); template<typename KeyType, typename KeyNodePtrCompare, typename KeyNodePtrPrioCompare> static std::pair< node_ptr, bool > - insert_unique_check(const const_node_ptr &, const node_ptr &, + insert_unique_check(const const_node_ptr &, const node_ptr &, const KeyType &, KeyNodePtrCompare, KeyNodePtrPrioCompare, insert_commit_data &); - static void insert_unique_commit(const node_ptr &, const node_ptr &, + static void insert_unique_commit(const node_ptr &, const node_ptr &, const insert_commit_data &); template<typename NodePtrCompare, typename KeyNodePtrPrioCompare> - static bool transfer_unique(const node_ptr &, NodePtrCompare, + static bool transfer_unique(const node_ptr &, NodePtrCompare, KeyNodePtrPrioCompare, const node_ptr &, const node_ptr &); template<typename NodePtrCompare, typename KeyNodePtrPrioCompare> - static void transfer_equal(const node_ptr &, NodePtrCompare, + static void transfer_equal(const node_ptr &, NodePtrCompare, KeyNodePtrPrioCompare, const node_ptr &, const node_ptr &); - static bool is_header(const const_node_ptr &); + static bool is_header(const const_node_ptr &); };

                      Description

                      @@ -158,38 +158,38 @@

                      static void set_right(node_ptr n, node_ptr right);

                      -treap_algorithms public static functions

                      +treap_algorithms public static functions
                      1. -
                        static node_ptr get_header(const const_node_ptr & n);
                        +
                        static node_ptr get_header(const const_node_ptr & n);

                        Requires: 'node' is a node of the tree or a header node.

                        Effects: Returns the header of the tree.

                        Complexity: Logarithmic.

                        Throws: Nothing.

                      2. -
                        static node_ptr begin_node(const const_node_ptr & header);
                        +
                        static node_ptr begin_node(const const_node_ptr & header);

                        Requires: 'header' is the header node of a tree.

                        Effects: Returns the first node of the tree, the header if the tree is empty.

                        Complexity: Constant time.

                        Throws: Nothing.

                      3. -
                        static node_ptr end_node(const const_node_ptr & header);
                        +
                        static node_ptr end_node(const const_node_ptr & header);

                        Requires: 'header' is the header node of a tree.

                        Effects: Returns the header of the tree.

                        Complexity: Constant time.

                        Throws: Nothing.

                      4. -
                        static void swap_tree(const node_ptr & header1, const node_ptr & header2);
                        +
                        static void swap_tree(const node_ptr & header1, const node_ptr & header2);

                        Requires: header1 and header2 must be the header nodes of two trees.

                        Effects: Swaps two trees. After the function header1 will contain links to the second tree and header2 will have links to the first tree.

                        Complexity: Constant.

                        Throws: Nothing.

                      5. -
                        static void swap_nodes(const node_ptr & node1, const node_ptr & node2);
                        +
                        static void swap_nodes(const node_ptr & node1, const node_ptr & node2);

                        Requires: node1 and node2 can't be header nodes of two trees.

                        Effects: Swaps two nodes. After the function node1 will be inserted in the position node2 before the function. node2 will be inserted in the position node1 had before the function.

                        Complexity: Logarithmic.

                        @@ -198,7 +198,7 @@

                        Experimental function

                      6. -
                        static void swap_nodes(const node_ptr & node1, const node_ptr & header1, 
+
                        static void swap_nodes(const node_ptr & node1, const node_ptr & header1, 
                        const node_ptr & node2, const node_ptr & header2);
                        
 
                        Requires: node1 and node2 can't be header nodes of two trees with header header1 and header2.
                        
 
                        Effects: Swaps two nodes. After the function node1 will be inserted in the position node2 before the function. node2 will be inserted in the position node1 had before the function.
                        
@@ -208,7 +208,7 @@
 
                        Experimental function
                      7. -
                        static void replace_node(const node_ptr & node_to_be_replaced, 
+
                        static void replace_node(const node_ptr & node_to_be_replaced, 
                          const node_ptr & new_node);
                        
 
                        Requires: node_to_be_replaced must be inserted in a tree and new_node must not be inserted in a tree.
                        
 
                        Effects: Replaces node_to_be_replaced in its position in the tree with new_node. The tree does not need to be rebalanced
                        
@@ -217,7 +217,7 @@
 
                        Note: This function will break container ordering invariants if new_node is not equivalent to node_to_be_replaced according to the ordering rules. This function is faster than erasing and inserting the node, since no rebalancing and comparison is needed. Experimental function
                      8. -
                        static void replace_node(const node_ptr & node_to_be_replaced, 
+
                        static void replace_node(const node_ptr & node_to_be_replaced, 
                          const node_ptr & header, const node_ptr & new_node);
                        
 
                        Requires: node_to_be_replaced must be inserted in a tree with header "header" and new_node must not be inserted in a tree.
                        
 
                        Effects: Replaces node_to_be_replaced in its position in the tree with new_node. The tree does not need to be rebalanced
                        
@@ -227,14 +227,14 @@
 
                      9. template<typename NodePtrPriorityCompare> 
-  static void unlink(const node_ptr & node, NodePtrPriorityCompare pcomp);
                        + static void unlink(const node_ptr & node, NodePtrPriorityCompare pcomp);

                        Requires: node is a tree node but not the header.

                        Effects: Unlinks the node and rebalances the tree.

                        Complexity: Average complexity is constant time.

                        Throws: Nothing.

                      10. -
                        static node_ptr unlink_leftmost_without_rebalance(const node_ptr & header);
                        +
                        static node_ptr unlink_leftmost_without_rebalance(const node_ptr & header);

                        Requires: header is the header of a tree.

                        Effects: Unlinks the leftmost node from the tree, and updates the header link to the new leftmost node.

                        Complexity: Average complexity is constant time.

                        @@ -242,35 +242,35 @@

                        Notes: This function breaks the tree and the tree can only be used for more unlink_leftmost_without_rebalance calls. This function is normally used to achieve a step by step controlled destruction of the tree.

                      11. -
                        static bool unique(const const_node_ptr & node);
                        +
                        static bool unique(const const_node_ptr & node);

                        Requires: 'node' is a node of the tree or a node initialized by init(...) or init_node.

                        Effects: Returns true if the node is initialized by init() or init_node().

                        Complexity: Constant time.

                        Throws: Nothing.

                      12. -
                        static std::size_t size(const const_node_ptr & header);
                        +
                        static std::size_t size(const const_node_ptr & header);

                        Requires: node is a node of the tree but it's not the header.

                        Effects: Returns the number of nodes of the subtree.

                        Complexity: Linear time.

                        Throws: Nothing.

                      13. -
                        static node_ptr next_node(const node_ptr & node);
                        +
                        static node_ptr next_node(const node_ptr & node);

                        Requires: 'node' is a node from the tree except the header.

                        Effects: Returns the next node of the tree.

                        Complexity: Average constant time.

                        Throws: Nothing.

                      14. -
                        static node_ptr prev_node(const node_ptr & node);
                        +
                        static node_ptr prev_node(const node_ptr & node);

                        Requires: 'node' is a node from the tree except the leftmost node.

                        Effects: Returns the previous node of the tree.

                        Complexity: Average constant time.

                        Throws: Nothing.

                      15. -
                        static void init(const node_ptr & node);
                        +
                        static void init(const node_ptr & node);

                        Requires: 'node' must not be part of any tree.

                        Effects: After the function unique(node) == true.

                        Complexity: Constant.

                        @@ -278,7 +278,7 @@

                        Nodes: If node is inserted in a tree, this function corrupts the tree.

                      16. -
                        static void init_header(const node_ptr & header);
                        +
                        static void init_header(const node_ptr & header);

                        Requires: node must not be part of any tree.

                        Effects: Initializes the header to represent an empty tree. unique(header) == true.

                        Complexity: Constant.

                        @@ -288,7 +288,7 @@ 
                      17. template<typename NodePtrPriorityCompare> 
   static node_ptr 
-  erase(const node_ptr & header, const node_ptr & z, 
+  erase(const node_ptr & header, const node_ptr & z, 
         NodePtrPriorityCompare pcomp);

                        Requires: header must be the header of a tree, z a node of that tree and z != header.

                        Effects: Erases node "z" from the tree with header "header".

                        @@ -297,7 +297,7 @@ 
                      18. template<typename Cloner, typename Disposer> 
-  static void clone(const const_node_ptr & source_header, 
+  static void clone(const const_node_ptr & source_header, 
                     const node_ptr & target_header, Cloner cloner, 
                     Disposer disposer);

                        Requires: "cloner" must be a function object taking a node_ptr and returning a new cloned node of it. "disposer" must take a node_ptr and shouldn't throw.

                        @@ -308,7 +308,7 @@ 
                      19. template<typename Disposer> 
-  static void clear_and_dispose(const node_ptr & header, Disposer disposer);
                        + static void clear_and_dispose(const node_ptr & header, Disposer disposer);

                        Requires: "disposer" must be an object function taking a node_ptr parameter and shouldn't throw.

                        Effects: Empties the target tree calling void disposer::operator()(const node_ptr &) for every node of the tree except the header.

                        Complexity: Linear to the number of element of the source tree plus the. number of elements of tree target tree when calling this function.

                        @@ -317,7 +317,7 @@ 
                      20. template<typename KeyType, typename KeyNodePtrCompare> 
   static node_ptr 
-  lower_bound(const const_node_ptr & header, const KeyType & key, 
+  lower_bound(const const_node_ptr & header, const KeyType & key, 
               KeyNodePtrCompare comp);

                        Requires: "header" must be the header node of a tree. KeyNodePtrCompare is a function object that induces a strict weak ordering compatible with the strict weak ordering used to create the the tree. KeyNodePtrCompare can compare KeyType with tree's node_ptrs.

                        Effects: Returns a node_ptr to the first element that is not less than "key" according to "comp" or "header" if that element does not exist.

                        @@ -327,7 +327,7 @@ 
                      21. template<typename KeyType, typename KeyNodePtrCompare> 
   static node_ptr 
-  upper_bound(const const_node_ptr & header, const KeyType & key, 
+  upper_bound(const const_node_ptr & header, const KeyType & key, 
               KeyNodePtrCompare comp);

                        Requires: "header" must be the header node of a tree. KeyNodePtrCompare is a function object that induces a strict weak ordering compatible with the strict weak ordering used to create the the tree. KeyNodePtrCompare can compare KeyType with tree's node_ptrs.

                        Effects: Returns a node_ptr to the first element that is greater than "key" according to "comp" or "header" if that element does not exist.

                        @@ -337,7 +337,7 @@ 
                      22. template<typename KeyType, typename KeyNodePtrCompare> 
   static node_ptr 
-  find(const const_node_ptr & header, const KeyType & key, 
+  find(const const_node_ptr & header, const KeyType & key, 
        KeyNodePtrCompare comp);

                        Requires: "header" must be the header node of a tree. KeyNodePtrCompare is a function object that induces a strict weak ordering compatible with the strict weak ordering used to create the the tree. KeyNodePtrCompare can compare KeyType with tree's node_ptrs.

                        Effects: Returns a node_ptr to the first element that is equivalent to "key" according to "comp" or "header" if that element does not exist.

                        @@ -347,7 +347,7 @@ 
                      23. template<typename KeyType, typename KeyNodePtrCompare> 
   static std::pair< node_ptr, node_ptr > 
-  equal_range(const const_node_ptr & header, const KeyType & key, 
+  equal_range(const const_node_ptr & header, const KeyType & key, 
               KeyNodePtrCompare comp);

                        Requires: "header" must be the header node of a tree. KeyNodePtrCompare is a function object that induces a strict weak ordering compatible with the strict weak ordering used to create the the tree. KeyNodePtrCompare can compare KeyType with tree's node_ptrs.

                        Effects: Returns an a pair of node_ptr delimiting a range containing all elements that are equivalent to "key" according to "comp" or an empty range that indicates the position where those elements would be if there are no equivalent elements.

                        @@ -357,7 +357,7 @@ 
                      24. template<typename KeyType, typename KeyNodePtrCompare> 
   static std::pair< node_ptr, node_ptr > 
-  bounded_range(const const_node_ptr & header, const KeyType & lower_key, 
+  bounded_range(const const_node_ptr & header, const KeyType & lower_key, 
                 const KeyType & upper_key, KeyNodePtrCompare comp, 
                 bool left_closed, bool right_closed);

                        Requires: "header" must be the header node of a tree. KeyNodePtrCompare is a function object that induces a strict weak ordering compatible with the strict weak ordering used to create the the tree. KeyNodePtrCompare can compare KeyType with tree's node_ptrs. 'lower_key' must not be greater than 'upper_key' according to 'comp'. If 'lower_key' == 'upper_key', ('left_closed' || 'right_closed') must be true.

                        @@ -372,7 +372,7 @@ 
                      25. template<typename KeyType, typename KeyNodePtrCompare> 
   static std::size_t 
-  count(const const_node_ptr & header, const KeyType & key, 
+  count(const const_node_ptr & header, const KeyType & key, 
         KeyNodePtrCompare comp);

                        Requires: "header" must be the header node of a tree. KeyNodePtrCompare is a function object that induces a strict weak ordering compatible with the strict weak ordering used to create the the tree. KeyNodePtrCompare can compare KeyType with tree's node_ptrs.

                        Effects: Returns the number of elements with a key equivalent to "key" according to "comp".

                        @@ -382,7 +382,7 @@ 
                      26. template<typename NodePtrCompare, typename NodePtrPriorityCompare> 
   static node_ptr 
-  insert_equal_upper_bound(const node_ptr & h, const node_ptr & new_node, 
+  insert_equal_upper_bound(const node_ptr & h, const node_ptr & new_node, 
                            NodePtrCompare comp, NodePtrPriorityCompare pcomp);

                        Requires: "h" must be the header node of a tree. NodePtrCompare is a function object that induces a strict weak ordering compatible with the strict weak ordering used to create the the tree. NodePtrCompare compares two node_ptrs. NodePtrPriorityCompare is a priority function object that induces a strict weak ordering compatible with the one used to create the the tree. NodePtrPriorityCompare compares two node_ptrs.

                        Effects: Inserts new_node into the tree before the upper bound according to "comp" and rotates the tree according to "pcomp".

                        @@ -392,7 +392,7 @@ 
                      27. template<typename NodePtrCompare, typename NodePtrPriorityCompare> 
   static node_ptr 
-  insert_equal_lower_bound(const node_ptr & h, const node_ptr & new_node, 
+  insert_equal_lower_bound(const node_ptr & h, const node_ptr & new_node, 
                            NodePtrCompare comp, NodePtrPriorityCompare pcomp);

                        Requires: "h" must be the header node of a tree. NodePtrCompare is a function object that induces a strict weak ordering compatible with the strict weak ordering used to create the the tree. NodePtrCompare compares two node_ptrs. NodePtrPriorityCompare is a priority function object that induces a strict weak ordering compatible with the one used to create the the tree. NodePtrPriorityCompare compares two node_ptrs.

                        Effects: Inserts new_node into the tree before the upper bound according to "comp" and rotates the tree according to "pcomp".

                        @@ -402,7 +402,7 @@ 
                      28. template<typename NodePtrCompare, typename NodePtrPriorityCompare> 
   static node_ptr 
-  insert_equal(const node_ptr & h, const node_ptr & hint, 
+  insert_equal(const node_ptr & h, const node_ptr & hint, 
                const node_ptr & new_node, NodePtrCompare comp, 
                NodePtrPriorityCompare pcomp);

                        Requires: "header" must be the header node of a tree. NodePtrCompare is a function object that induces a strict weak ordering compatible with the strict weak ordering used to create the the tree. NodePtrCompare compares two node_ptrs. "hint" is node from the "header"'s tree. NodePtrPriorityCompare is a priority function object that induces a strict weak ordering compatible with the one used to create the the tree. NodePtrPriorityCompare compares two node_ptrs.

                        @@ -413,7 +413,7 @@ 
                      29. template<typename NodePtrPriorityCompare> 
   static node_ptr 
-  insert_before(const node_ptr & header, const node_ptr & pos, 
+  insert_before(const node_ptr & header, const node_ptr & pos, 
                 const node_ptr & new_node, NodePtrPriorityCompare pcomp);

                        Requires: "header" must be the header node of a tree. "pos" must be a valid node of the tree (including header end) node. "pos" must be a node pointing to the successor to "new_node" once inserted according to the order of already inserted nodes. This function does not check "pos" and this precondition must be guaranteed by the caller. NodePtrPriorityCompare is a priority function object that induces a strict weak ordering compatible with the one used to create the the tree. NodePtrPriorityCompare compares two node_ptrs.

                        Effects: Inserts new_node into the tree before "pos" and rotates the tree according to "pcomp".

                        @@ -423,7 +423,7 @@ 
                      30. template<typename NodePtrPriorityCompare> 
-  static void push_back(const node_ptr & header, const node_ptr & new_node, 
+  static void push_back(const node_ptr & header, const node_ptr & new_node, 
                         NodePtrPriorityCompare pcomp);

                        Requires: "header" must be the header node of a tree. "new_node" must be, according to the used ordering no less than the greatest inserted key. NodePtrPriorityCompare is a priority function object that induces a strict weak ordering compatible with the one used to create the the tree. NodePtrPriorityCompare compares two node_ptrs.

                        Effects: Inserts x into the tree in the last position and rotates the tree according to "pcomp".

                        @@ -433,7 +433,7 @@ 
                      31. template<typename NodePtrPriorityCompare> 
-  static void push_front(const node_ptr & header, const node_ptr & new_node, 
+  static void push_front(const node_ptr & header, const node_ptr & new_node, 
                          NodePtrPriorityCompare pcomp);

                        Requires: "header" must be the header node of a tree. "new_node" must be, according to the used ordering, no greater than the lowest inserted key. NodePtrPriorityCompare is a priority function object that induces a strict weak ordering compatible with the one used to create the the tree. NodePtrPriorityCompare compares two node_ptrs.

                        Effects: Inserts x into the tree in the first position and rotates the tree according to "pcomp".

                        @@ -445,7 +445,7 @@ 
                        template<typename KeyType, typename KeyNodePtrCompare, 
          typename KeyNodePtrPrioCompare> 
   static std::pair< node_ptr, bool > 
-  insert_unique_check(const const_node_ptr & header, const KeyType & key, 
+  insert_unique_check(const const_node_ptr & header, const KeyType & key, 
                       KeyNodePtrCompare comp, KeyNodePtrPrioCompare pcomp, 
                       insert_commit_data & commit_data);

                        Requires: "header" must be the header node of a tree. KeyNodePtrCompare is a function object that induces a strict weak ordering compatible with the strict weak ordering used to create the the tree. NodePtrCompare compares KeyType with a node_ptr.

                        @@ -461,7 +461,7 @@ 
                        template<typename KeyType, typename KeyNodePtrCompare, 
          typename KeyNodePtrPrioCompare> 
   static std::pair< node_ptr, bool > 
-  insert_unique_check(const const_node_ptr & header, const node_ptr & hint, 
+  insert_unique_check(const const_node_ptr & header, const node_ptr & hint, 
                       const KeyType & key, KeyNodePtrCompare comp, 
                       KeyNodePtrPrioCompare pcomp, 
                       insert_commit_data & commit_data);
                        @@ -475,7 +475,7 @@

                        "commit_data" remains valid for a subsequent "insert_unique_commit" only if no more objects are inserted or erased from the set.

                      32. -
                        static void insert_unique_commit(const node_ptr & header, 
+
                        static void insert_unique_commit(const node_ptr & header, 
                                  const node_ptr & new_node, 
                                  const insert_commit_data & commit_data);
                        
 
                        Requires: "header" must be the header node of a tree. "commit_data" must have been obtained from a previous call to "insert_unique_check". No objects should have been inserted or erased from the set between the "insert_unique_check" that filled "commit_data" and the call to "insert_commit".
                        
@@ -486,7 +486,7 @@
 
                      33. template<typename NodePtrCompare, typename KeyNodePtrPrioCompare> 
-  static bool transfer_unique(const node_ptr & header1, NodePtrCompare comp, 
+  static bool transfer_unique(const node_ptr & header1, NodePtrCompare comp, 
                               KeyNodePtrPrioCompare pcomp, 
                               const node_ptr & header2, const node_ptr & z);

                        Requires: header1 and header2 must be the headers of trees tree1 and tree2 respectively, z a non-header node of tree1. NodePtrCompare is the comparison function of tree1..

                        @@ -497,7 +497,7 @@ 
                      34. template<typename NodePtrCompare, typename KeyNodePtrPrioCompare> 
-  static void transfer_equal(const node_ptr & header1, NodePtrCompare comp, 
+  static void transfer_equal(const node_ptr & header1, NodePtrCompare comp, 
                              KeyNodePtrPrioCompare pcomp, 
                              const node_ptr & header2, const node_ptr & z);

                        Requires: header1 and header2 must be the headers of trees tree1 and tree2 respectively, z a non-header node of tree1. NodePtrCompare is the comparison function of tree1..

                        @@ -506,7 +506,7 @@

                        Throws: If the comparison throws.

                      35. -
                        static bool is_header(const const_node_ptr & p);
                        +
                        static bool is_header(const const_node_ptr & p);

                        Requires: p is a node of a tree.

                        Effects: Returns true if p is the header of the tree.

                        Complexity: Constant.

                        diff --git a/doc/html/boost/intrusive/treap_multiset.html b/doc/html/boost/intrusive/treap_multiset.html index 3c44f0b751..940e828328 100644 --- a/doc/html/boost/intrusive/treap_multiset.html +++ b/doc/html/boost/intrusive/treap_multiset.html @@ -61,129 +61,129 @@ typedef implementation_defined::node_algorithms node_algorithms; // construct/copy/destruct - treap_multiset(); - explicit treap_multiset(const key_compare &, + treap_multiset(); + explicit treap_multiset(const key_compare &, const priority_compare & = priority_compare(), const value_traits & = value_traits()); template<typename Iterator> - treap_multiset(Iterator, Iterator, const key_compare & = key_compare(), + treap_multiset(Iterator, Iterator, const key_compare & = key_compare(), const priority_compare & = priority_compare(), const value_traits & = value_traits()); - treap_multiset(treap_multiset &&); - treap_multiset & operator=(treap_multiset &&); - ~treap_multiset(); + treap_multiset(treap_multiset &&); + treap_multiset & operator=(treap_multiset &&); + ~treap_multiset(); - // public member functions - iterator begin(); - const_iterator begin() const; - const_iterator cbegin() const; - iterator end(); - const_iterator end() const; - const_iterator cend() const; - reverse_iterator rbegin(); - const_reverse_iterator rbegin() const; - const_reverse_iterator crbegin() const; - reverse_iterator rend(); - const_reverse_iterator rend() const; - const_reverse_iterator crend() const; - iterator root(); - const_iterator root() const; - const_iterator croot() const; - key_compare key_comp() const; - value_compare value_comp() const; - bool empty() const; - size_type size() const; - void swap(treap_multiset &); + // public member functions + iterator begin(); + const_iterator begin() const; + const_iterator cbegin() const; + iterator end(); + const_iterator end() const; + const_iterator cend() const; + reverse_iterator rbegin(); + const_reverse_iterator rbegin() const; + const_reverse_iterator crbegin() const; + reverse_iterator rend(); + const_reverse_iterator rend() const; + const_reverse_iterator crend() const; + iterator root(); + const_iterator root() const; + const_iterator croot() const; + key_compare key_comp() const; + value_compare value_comp() const; + bool empty() const; + size_type size() const; + void swap(treap_multiset &); template<typename Cloner, typename Disposer> - void clone_from(const treap_multiset &, Cloner, Disposer); + void clone_from(const treap_multiset &, Cloner, Disposer); template<typename Cloner, typename Disposer> - void clone_from(treap_multiset &&, Cloner, Disposer); - iterator top(); - const_iterator top() const; - const_iterator ctop() const; - reverse_iterator rtop(); - const_reverse_iterator rtop() const; - const_reverse_iterator crtop() const; - priority_compare priority_comp() const; - iterator insert(reference); - iterator insert(const_iterator, reference); - template<typename Iterator> void insert(Iterator, Iterator); - iterator insert_before(const_iterator, reference); - void push_back(reference); - void push_front(reference); - iterator erase(const_iterator); - iterator erase(const_iterator, const_iterator); - size_type erase(const key_type &); + void clone_from(treap_multiset &&, Cloner, Disposer); + iterator top(); + const_iterator top() const; + const_iterator ctop() const; + reverse_iterator rtop(); + const_reverse_iterator rtop() const; + const_reverse_iterator crtop() const; + priority_compare priority_comp() const; + iterator insert(reference); + iterator insert(const_iterator, reference); + template<typename Iterator> void insert(Iterator, Iterator); + iterator insert_before(const_iterator, reference); + void push_back(reference); + void push_front(reference); + iterator erase(const_iterator); + iterator erase(const_iterator, const_iterator); + size_type erase(const key_type &); template<typename KeyType, typename KeyTypeKeyCompare> - size_type erase(const KeyType &, KeyTypeKeyCompare); + size_type erase(const KeyType &, KeyTypeKeyCompare); template<typename Disposer> - iterator erase_and_dispose(const_iterator, Disposer); + iterator erase_and_dispose(const_iterator, Disposer); template<typename Disposer> - iterator erase_and_dispose(const_iterator, const_iterator, Disposer); + iterator erase_and_dispose(const_iterator, const_iterator, Disposer); template<typename Disposer> - size_type erase_and_dispose(const key_type &, Disposer); + size_type erase_and_dispose(const key_type &, Disposer); template<typename KeyType, typename KeyTypeKeyCompare, typename Disposer> - size_type erase_and_dispose(const KeyType &, KeyTypeKeyCompare, Disposer); - void clear(); - template<typename Disposer> void clear_and_dispose(Disposer); - size_type count(const key_type &) const; + size_type erase_and_dispose(const KeyType &, KeyTypeKeyCompare, Disposer); + void clear(); + template<typename Disposer> void clear_and_dispose(Disposer); + size_type count(const key_type &) const; template<typename KeyType, typename KeyTypeKeyCompare> - size_type count(const KeyType &, KeyTypeKeyCompare) const; - iterator lower_bound(const key_type &); + size_type count(const KeyType &, KeyTypeKeyCompare) const; + iterator lower_bound(const key_type &); template<typename KeyType, typename KeyTypeKeyCompare> - iterator lower_bound(const KeyType &, KeyTypeKeyCompare); - const_iterator lower_bound(const key_type &) const; + iterator lower_bound(const KeyType &, KeyTypeKeyCompare); + const_iterator lower_bound(const key_type &) const; template<typename KeyType, typename KeyTypeKeyCompare> - const_iterator lower_bound(const KeyType &, KeyTypeKeyCompare) const; - iterator upper_bound(const key_type &); + const_iterator lower_bound(const KeyType &, KeyTypeKeyCompare) const; + iterator upper_bound(const key_type &); template<typename KeyType, typename KeyTypeKeyCompare> - iterator upper_bound(const KeyType &, KeyTypeKeyCompare); - const_iterator upper_bound(const key_type &) const; + iterator upper_bound(const KeyType &, KeyTypeKeyCompare); + const_iterator upper_bound(const key_type &) const; template<typename KeyType, typename KeyTypeKeyCompare> - const_iterator upper_bound(const KeyType &, KeyTypeKeyCompare) const; - iterator find(const key_type &); + const_iterator upper_bound(const KeyType &, KeyTypeKeyCompare) const; + iterator find(const key_type &); template<typename KeyType, typename KeyTypeKeyCompare> - iterator find(const KeyType &, KeyTypeKeyCompare); - const_iterator find(const key_type &) const; + iterator find(const KeyType &, KeyTypeKeyCompare); + const_iterator find(const key_type &) const; template<typename KeyType, typename KeyTypeKeyCompare> - const_iterator find(const KeyType &, KeyTypeKeyCompare) const; - std::pair< iterator, iterator > equal_range(const key_type &); + const_iterator find(const KeyType &, KeyTypeKeyCompare) const; + std::pair< iterator, iterator > equal_range(const key_type &); template<typename KeyType, typename KeyTypeKeyCompare> std::pair< iterator, iterator > - equal_range(const KeyType &, KeyTypeKeyCompare); + equal_range(const KeyType &, KeyTypeKeyCompare); std::pair< const_iterator, const_iterator > - equal_range(const key_type &) const; + equal_range(const key_type &) const; template<typename KeyType, typename KeyTypeKeyCompare> std::pair< const_iterator, const_iterator > - equal_range(const KeyType &, KeyTypeKeyCompare) const; + equal_range(const KeyType &, KeyTypeKeyCompare) const; std::pair< iterator, iterator > - bounded_range(const key_type &, const key_type &, bool, bool); + bounded_range(const key_type &, const key_type &, bool, bool); template<typename KeyType, typename KeyTypeKeyCompare> std::pair< iterator, iterator > - bounded_range(const KeyType &, const KeyType &, KeyTypeKeyCompare, bool, + bounded_range(const KeyType &, const KeyType &, KeyTypeKeyCompare, bool, bool); std::pair< const_iterator, const_iterator > - bounded_range(const key_type &, const key_type &, bool, bool) const; + bounded_range(const key_type &, const key_type &, bool, bool) const; template<typename KeyType, typename KeyTypeKeyCompare> std::pair< const_iterator, const_iterator > - bounded_range(const KeyType &, const KeyType &, KeyTypeKeyCompare, bool, + bounded_range(const KeyType &, const KeyType &, KeyTypeKeyCompare, bool, bool) const; - iterator iterator_to(reference); - const_iterator iterator_to(const_reference) const; - pointer unlink_leftmost_without_rebalance(); - void replace_node(iterator, reference); - void remove_node(reference); - template<class... Options2> void merge(treap_multiset< T, Options2...> &); - template<class... Options2> void merge(treap_set< T, Options2...> &); + iterator iterator_to(reference); + const_iterator iterator_to(const_reference) const; + pointer unlink_leftmost_without_rebalance(); + void replace_node(iterator, reference); + void remove_node(reference); + template<class... Options2> void merge(treap_multiset< T, Options2...> &); + template<class... Options2> void merge(treap_set< T, Options2...> &); - // public static functions - static treap_multiset & container_from_end_iterator(iterator); - static const treap_multiset & container_from_end_iterator(const_iterator); - static treap_multiset & container_from_iterator(iterator); - static const treap_multiset & container_from_iterator(const_iterator); - static iterator s_iterator_to(reference); - static const_iterator s_iterator_to(const_reference); - static void init_node(reference); + // public static functions + static treap_multiset & container_from_end_iterator(iterator); + static const treap_multiset & container_from_end_iterator(const_iterator); + static treap_multiset & container_from_iterator(iterator); + static const treap_multiset & container_from_iterator(const_iterator); + static iterator s_iterator_to(reference); + static const_iterator s_iterator_to(const_reference); + static void init_node(reference); // public data members static const bool constant_time_size; @@ -200,13 +200,13 @@ construct/copy/destruct
                        1. -
                          treap_multiset();
                          +
                          treap_multiset();

                          Effects: Constructs an empty container.

                          Complexity: Constant.

                          Throws: If value_traits::node_traits::node constructor throws (this does not happen with predefined Boost.Intrusive hooks) or the copy constructor of the value_compare/priority_compare objects throw. Basic guarantee.

                        2. -
                          explicit treap_multiset(const key_compare & cmp, 
+
                          explicit treap_multiset(const key_compare & cmp, 
                         const priority_compare & pcmp = priority_compare(), 
                         const value_traits & v_traits = value_traits());
                          
 
                          Effects: Constructs an empty container.
                          
@@ -215,7 +215,7 @@
 
                        3. template<typename Iterator> 
-  treap_multiset(Iterator b, Iterator e, 
+  treap_multiset(Iterator b, Iterator e, 
                  const key_compare & cmp = key_compare(), 
                  const priority_compare & pcmp = priority_compare(), 
                  const value_traits & v_traits = value_traits());
                          @@ -225,15 +225,15 @@

                          Throws: If value_traits::node_traits::node constructor throws (this does not happen with predefined Boost.Intrusive hooks) or the copy constructor/operator() of the key_compare/priority_compare objects throw. Basic guarantee.

                        4. -
                          treap_multiset(treap_multiset && x);
                          +
                          treap_multiset(treap_multiset && x);

                          Effects: to-do

                        5. -
                          treap_multiset & operator=(treap_multiset && x);
                          +
                          treap_multiset & operator=(treap_multiset && x);

                          Effects: to-do

                        6. -
                          ~treap_multiset();
                          +
                          ~treap_multiset();

                          Effects: Detaches all elements from this. The objects in the set are not deleted (i.e. no destructors are called), but the nodes according to the value_traits template parameter are reinitialized and thus can be reused.

                          Complexity: Linear to elements contained in *this.

                          Throws: Nothing.

                          @@ -242,131 +242,131 @@

                        -treap_multiset public member functions

                        +treap_multiset public member functions
                        1. -
                          iterator begin();
                          +
                          iterator begin();

                          Effects: Returns an iterator pointing to the beginning of the container.

                          Complexity: Constant.

                          Throws: Nothing.

                        2. -
                          const_iterator begin() const;
                          +
                          const_iterator begin() const;

                          Effects: Returns a const_iterator pointing to the beginning of the container.

                          Complexity: Constant.

                          Throws: Nothing.

                        3. -
                          const_iterator cbegin() const;
                          +
                          const_iterator cbegin() const;

                          Effects: Returns a const_iterator pointing to the beginning of the container.

                          Complexity: Constant.

                          Throws: Nothing.

                        4. -
                          iterator end();
                          +
                          iterator end();

                          Effects: Returns an iterator pointing to the end of the container.

                          Complexity: Constant.

                          Throws: Nothing.

                        5. -
                          const_iterator end() const;
                          +
                          const_iterator end() const;

                          Effects: Returns a const_iterator pointing to the end of the container.

                          Complexity: Constant.

                          Throws: Nothing.

                        6. -
                          const_iterator cend() const;
                          +
                          const_iterator cend() const;

                          Effects: Returns a const_iterator pointing to the end of the container.

                          Complexity: Constant.

                          Throws: Nothing.

                        7. -
                          reverse_iterator rbegin();
                          +
                          reverse_iterator rbegin();

                          Effects: Returns a reverse_iterator pointing to the beginning of the reversed container.

                          Complexity: Constant.

                          Throws: Nothing.

                        8. -
                          const_reverse_iterator rbegin() const;
                          +
                          const_reverse_iterator rbegin() const;

                          Effects: Returns a const_reverse_iterator pointing to the beginning of the reversed container.

                          Complexity: Constant.

                          Throws: Nothing.

                        9. -
                          const_reverse_iterator crbegin() const;
                          +
                          const_reverse_iterator crbegin() const;

                          Effects: Returns a const_reverse_iterator pointing to the beginning of the reversed container.

                          Complexity: Constant.

                          Throws: Nothing.

                        10. -
                          reverse_iterator rend();
                          +
                          reverse_iterator rend();

                          Effects: Returns a reverse_iterator pointing to the end of the reversed container.

                          Complexity: Constant.

                          Throws: Nothing.

                        11. -
                          const_reverse_iterator rend() const;
                          +
                          const_reverse_iterator rend() const;

                          Effects: Returns a const_reverse_iterator pointing to the end of the reversed container.

                          Complexity: Constant.

                          Throws: Nothing.

                        12. -
                          const_reverse_iterator crend() const;
                          +
                          const_reverse_iterator crend() const;

                          Effects: Returns a const_reverse_iterator pointing to the end of the reversed container.

                          Complexity: Constant.

                          Throws: Nothing.

                        13. -
                          iterator root();
                          +
                          iterator root();

                          Effects: Returns a iterator pointing to the root node of the container or end() if not present.

                          Complexity: Constant.

                          Throws: Nothing.

                        14. -
                          const_iterator root() const;
                          +
                          const_iterator root() const;

                          Effects: Returns a const_iterator pointing to the root node of the container or cend() if not present.

                          Complexity: Constant.

                          Throws: Nothing.

                        15. -
                          const_iterator croot() const;
                          +
                          const_iterator croot() const;

                          Effects: Returns a const_iterator pointing to the root node of the container or cend() if not present.

                          Complexity: Constant.

                          Throws: Nothing.

                        16. -
                          key_compare key_comp() const;
                          +
                          key_compare key_comp() const;

                          Effects: Returns the key_compare object used by the container.

                          Complexity: Constant.

                          Throws: If key_compare copy-constructor throws.

                        17. -
                          value_compare value_comp() const;
                          +
                          value_compare value_comp() const;

                          Effects: Returns the value_compare object used by the container.

                          Complexity: Constant.

                          Throws: If value_compare copy-constructor throws.

                        18. -
                          bool empty() const;
                          +
                          bool empty() const;

                          Effects: Returns true if the container is empty.

                          Complexity: Constant.

                          Throws: Nothing.

                        19. -
                          size_type size() const;
                          +
                          size_type size() const;

                          Effects: Returns the number of elements stored in the container.

                          Complexity: Linear to elements contained in *this if constant-time size option is disabled. Constant time otherwise.

                          Throws: Nothing.

                        20. -
                          void swap(treap_multiset & other);
                          +
                          void swap(treap_multiset & other);

                          Effects: Swaps the contents of two treaps.

                          Complexity: Constant.

                          Throws: If the comparison functor's swap call throws. 

                        21. template<typename Cloner, typename Disposer> 
-  void clone_from(const treap_multiset & src, Cloner cloner, 
+  void clone_from(const treap_multiset & src, Cloner cloner, 
                   Disposer disposer);

                          Requires: Disposer::operator()(pointer) shouldn't throw. Cloner should yield to nodes equivalent to the original nodes.

                          Effects: Erases all the elements from *this calling Disposer::operator()(pointer), clones all the elements from src calling Cloner::operator()(const_reference ) and inserts them on *this. Copies the predicate from the source container.

                          @@ -376,7 +376,7 @@ 
                        22. template<typename Cloner, typename Disposer> 
-  void clone_from(treap_multiset && src, Cloner cloner, Disposer disposer);
                          + void clone_from(treap_multiset && src, Cloner cloner, Disposer disposer);

                          Requires: Disposer::operator()(pointer) shouldn't throw. Cloner should yield to nodes equivalent to the original nodes.

                          Effects: Erases all the elements from *this calling Disposer::operator()(pointer), clones all the elements from src calling Cloner::operator()(reference) and inserts them on *this. Copies the predicate from the source container.

                          If cloner throws, all cloned elements are unlinked and disposed calling Disposer::operator()(pointer).

                          @@ -384,49 +384,49 @@

                          Throws: If cloner throws or predicate copy assignment throws. Basic guarantee.

                        23. -
                          iterator top();
                          +
                          iterator top();

                          Effects: Returns an iterator pointing to the highest priority object of the treap.

                          Complexity: Constant.

                          Throws: Nothing.

                        24. -
                          const_iterator top() const;
                          +
                          const_iterator top() const;

                          Effects: Returns a const_iterator pointing to the highest priority object of the treap..

                          Complexity: Constant.

                          Throws: Nothing.

                        25. -
                          const_iterator ctop() const;
                          +
                          const_iterator ctop() const;

                          Effects: Returns a const_iterator pointing to the highest priority object of the treap..

                          Complexity: Constant.

                          Throws: Nothing.

                        26. -
                          reverse_iterator rtop();
                          +
                          reverse_iterator rtop();

                          Effects: Returns a reverse_iterator pointing to the highest priority object of the reversed treap.

                          Complexity: Constant.

                          Throws: Nothing.

                        27. -
                          const_reverse_iterator rtop() const;
                          +
                          const_reverse_iterator rtop() const;

                          Effects: Returns a const_reverse_iterator pointing to the highest priority objec of the reversed treap.

                          Complexity: Constant.

                          Throws: Nothing.

                        28. -
                          const_reverse_iterator crtop() const;
                          +
                          const_reverse_iterator crtop() const;

                          Effects: Returns a const_reverse_iterator pointing to the highest priority object of the reversed treap.

                          Complexity: Constant.

                          Throws: Nothing.

                        29. -
                          priority_compare priority_comp() const;
                          +
                          priority_compare priority_comp() const;

                          Effects: Returns a const_reverse_iterator pointing to the highest priority object of the reversed treap.

                          Complexity: Constant.

                          Throws: Nothing.

                        30. -
                          iterator insert(reference value);
                          +
                          iterator insert(reference value);

                          Requires: value must be an lvalue

                          Effects: Inserts value into the container before the upper bound.

                          Complexity: Average complexity for insert element is at most logarithmic.

                          @@ -434,7 +434,7 @@

                          Note: Does not affect the validity of iterators and references. No copy-constructors are called.

                        31. -
                          iterator insert(const_iterator hint, reference value);
                          +
                          iterator insert(const_iterator hint, reference value);

                          Requires: value must be an lvalue, and "hint" must be a valid iterator.

                          Effects: Inserts x into the container, using "hint" as a hint to where it will be inserted. If "hint" is the upper_bound the insertion takes constant time (two comparisons in the worst case)

                          Complexity: Logarithmic in general, but it is amortized constant time if t is inserted immediately before hint.

                          @@ -442,7 +442,7 @@

                          Note: Does not affect the validity of iterators and references. No copy-constructors are called.

                        32. -
                          template<typename Iterator> void insert(Iterator b, Iterator e);
                          +
                          template<typename Iterator> void insert(Iterator b, Iterator e);

                          Requires: Dereferencing iterator must yield an lvalue of type value_type.

                          Effects: Inserts a each element of a range into the container before the upper bound of the key of each element.

                          Complexity: Insert range is in general O(N * log(N)), where N is the size of the range. However, it is linear in N if the range is already sorted by key_comp().

                          @@ -450,7 +450,7 @@

                          Note: Does not affect the validity of iterators and references. No copy-constructors are called.

                        33. -
                          iterator insert_before(const_iterator pos, reference value);
                          +
                          iterator insert_before(const_iterator pos, reference value);

                          Requires: value must be an lvalue, "pos" must be a valid iterator (or end) and must be the succesor of value once inserted according to the predicate

                          Effects: Inserts x into the container before "pos".

                          Complexity: Constant time.

                          @@ -458,7 +458,7 @@

                          Note: This function does not check preconditions so if "pos" is not the successor of "value" container ordering invariant will be broken. This is a low-level function to be used only for performance reasons by advanced users.

                        34. -
                          void push_back(reference value);
                          +
                          void push_back(reference value);

                          Requires: value must be an lvalue, and it must be no less than the greatest inserted key

                          Effects: Inserts x into the container in the last position.

                          Complexity: Constant time.

                          @@ -466,7 +466,7 @@

                          Note: This function does not check preconditions so if value is less than the greatest inserted key container ordering invariant will be broken. This function is slightly more efficient than using "insert_before". This is a low-level function to be used only for performance reasons by advanced users.

                        35. -
                          void push_front(reference value);
                          +
                          void push_front(reference value);

                          Requires: value must be an lvalue, and it must be no greater than the minimum inserted key

                          Effects: Inserts x into the container in the first position.

                          Complexity: Constant time.

                          @@ -474,21 +474,21 @@

                          Note: This function does not check preconditions so if value is greater than the minimum inserted key container ordering invariant will be broken. This function is slightly more efficient than using "insert_before". This is a low-level function to be used only for performance reasons by advanced users.

                        36. -
                          iterator erase(const_iterator i);
                          +
                          iterator erase(const_iterator i);

                          Effects: Erases the element pointed to by i.

                          Complexity: Average complexity for erase element is constant time.

                          Throws: if the internal priority_compare function throws. Strong guarantee.

                          Note: Invalidates the iterators (but not the references) to the erased elements. No destructors are called.

                        37. -
                          iterator erase(const_iterator b, const_iterator e);
                          +
                          iterator erase(const_iterator b, const_iterator e);

                          Effects: Erases the range pointed to by b end e.

                          Complexity: Average complexity for erase range is at most O(log(size() + N)), where N is the number of elements in the range.

                          Throws: if the internal priority_compare function throws. Strong guarantee.

                          Note: Invalidates the iterators (but not the references) to the erased elements. No destructors are called.

                        38. -
                          size_type erase(const key_type & key);
                          +
                          size_type erase(const key_type & key);

                          Effects: Erases all the elements with the given value.

                          Returns: The number of erased elements.

                          Complexity: O(log(size() + N).

                          @@ -497,7 +497,7 @@ 
                        39. template<typename KeyType, typename KeyTypeKeyCompare> 
-  size_type erase(const KeyType & key, KeyTypeKeyCompare comp);
                          + size_type erase(const KeyType & key, KeyTypeKeyCompare comp);

                          Effects: Erases all the elements with the given key. according to the comparison functor "comp".

                          Returns: The number of erased elements.

                          Complexity: O(log(size() + N).

                          @@ -506,7 +506,7 @@ 
                        40. template<typename Disposer> 
-  iterator erase_and_dispose(const_iterator i, Disposer disposer);
                          + iterator erase_and_dispose(const_iterator i, Disposer disposer);

                          Requires: Disposer::operator()(pointer) shouldn't throw.

                          Effects: Erases the element pointed to by i. Disposer::operator()(pointer) is called for the removed element.

                          Complexity: Average complexity for erase element is constant time.

                          @@ -515,7 +515,7 @@ 
                        41. template<typename Disposer> 
-  iterator erase_and_dispose(const_iterator b, const_iterator e, 
+  iterator erase_and_dispose(const_iterator b, const_iterator e, 
                              Disposer disposer);

                          Requires: Disposer::operator()(pointer) shouldn't throw.

                          Effects: Erases the range pointed to by b end e. Disposer::operator()(pointer) is called for the removed elements.

                          @@ -525,7 +525,7 @@ 
                        42. template<typename Disposer> 
-  size_type erase_and_dispose(const key_type & key, Disposer disposer);
                          + size_type erase_and_dispose(const key_type & key, Disposer disposer);

                          Requires: Disposer::operator()(pointer) shouldn't throw.

                          Effects: Erases all the elements with the given value. Disposer::operator()(pointer) is called for the removed elements.

                          Returns: The number of erased elements.

                          @@ -535,7 +535,7 @@ 
                        43. template<typename KeyType, typename KeyTypeKeyCompare, typename Disposer> 
-  size_type erase_and_dispose(const KeyType & key, KeyTypeKeyCompare comp, 
+  size_type erase_and_dispose(const KeyType & key, KeyTypeKeyCompare comp, 
                               Disposer disposer);

                          Requires: Disposer::operator()(pointer) shouldn't throw.

                          Effects: Erases all the elements with the given key. according to the comparison functor "comp". Disposer::operator()(pointer) is called for the removed elements.

                          @@ -545,47 +545,47 @@

                          Note: Invalidates the iterators to the erased elements.

                        44. -
                          void clear();
                          +
                          void clear();

                          Effects: Erases all of the elements.

                          Complexity: Linear to the number of elements on the container. if it's a safe-mode or auto-unlink value_type. Constant time otherwise.

                          Throws: Nothing.

                          Note: Invalidates the iterators (but not the references) to the erased elements. No destructors are called.

                        45. -
                          template<typename Disposer> void clear_and_dispose(Disposer disposer);
                          +
                          template<typename Disposer> void clear_and_dispose(Disposer disposer);

                          Effects: Erases all of the elements calling disposer(p) for each node to be erased. Complexity: Average complexity for is at most O(log(size() + N)), where N is the number of elements in the container.

                          Throws: Nothing.

                          Note: Invalidates the iterators (but not the references) to the erased elements. Calls N times to disposer functor.

                        46. -
                          size_type count(const key_type & key) const;
                          +
                          size_type count(const key_type & key) const;

                          Effects: Returns the number of contained elements with the given value

                          Complexity: Logarithmic to the number of elements contained plus lineal to number of objects with the given value.

                          Throws: If key_compare throws. 

                        47. template<typename KeyType, typename KeyTypeKeyCompare> 
-  size_type count(const KeyType & key, KeyTypeKeyCompare comp) const;
                          + size_type count(const KeyType & key, KeyTypeKeyCompare comp) const;

                          Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk), and nk the key_type of a value_type inserted into *this.

                          Effects: Returns the number of contained elements with the given key

                          Complexity: Logarithmic to the number of elements contained plus lineal to number of objects with the given key.

                          Throws: If comp throws.

                        48. -
                          iterator lower_bound(const key_type & key);
                          +
                          iterator lower_bound(const key_type & key);

                          Effects: Returns an iterator to the first element whose key is not less than k or end() if that element does not exist.

                          Complexity: Logarithmic.

                          Throws: If key_compare throws. 

                        49. template<typename KeyType, typename KeyTypeKeyCompare> 
-  iterator lower_bound(const KeyType & key, KeyTypeKeyCompare comp);
                          + iterator lower_bound(const KeyType & key, KeyTypeKeyCompare comp);

                          Effects: Returns an iterator to the first element whose key is not less than k or end() if that element does not exist.

                          Complexity: Logarithmic.

                          Throws: If key_compare throws.

                        50. -
                          const_iterator lower_bound(const key_type & key) const;
                          +
                          const_iterator lower_bound(const key_type & key) const;

                          Effects: Returns an iterator to the first element whose key is not less than k or end() if that element does not exist.

                          Complexity: Logarithmic.

                          Throws: If key_compare throws.

                          @@ -593,27 +593,27 @@ 
                        51. template<typename KeyType, typename KeyTypeKeyCompare> 
   const_iterator 
-  lower_bound(const KeyType & key, KeyTypeKeyCompare comp) const;
                          + lower_bound(const KeyType & key, KeyTypeKeyCompare comp) const;

                          Effects: Returns an iterator to the first element whose key is not less than k or end() if that element does not exist.

                          Complexity: Logarithmic.

                          Throws: If key_compare throws.

                        52. -
                          iterator upper_bound(const key_type & key);
                          +
                          iterator upper_bound(const key_type & key);

                          Effects: Returns an iterator to the first element whose key is greater than k or end() if that element does not exist.

                          Complexity: Logarithmic.

                          Throws: If key_compare throws. 

                        53. template<typename KeyType, typename KeyTypeKeyCompare> 
-  iterator upper_bound(const KeyType & key, KeyTypeKeyCompare comp);
                          + iterator upper_bound(const KeyType & key, KeyTypeKeyCompare comp);

                          Requires: key is a value such that *this is partitioned with respect to !comp(key, nk), with nk the key_type of a value_type inserted into *this.

                          Effects: Returns an iterator to the first element whose key is greater than k according to comp or end() if that element does not exist.

                          Complexity: Logarithmic.

                          Throws: If comp throws.

                        54. -
                          const_iterator upper_bound(const key_type & key) const;
                          +
                          const_iterator upper_bound(const key_type & key) const;

                          Effects: Returns an iterator to the first element whose key is greater than k or end() if that element does not exist.

                          Complexity: Logarithmic.

                          Throws: If key_compare throws.

                          @@ -621,42 +621,42 @@ 
                        55. template<typename KeyType, typename KeyTypeKeyCompare> 
   const_iterator 
-  upper_bound(const KeyType & key, KeyTypeKeyCompare comp) const;
                          + upper_bound(const KeyType & key, KeyTypeKeyCompare comp) const;

                          Requires: key is a value such that *this is partitioned with respect to !comp(key, nk), with nk the key_type of a value_type inserted into *this.

                          Effects: Returns an iterator to the first element whose key is greater than k according to comp or end() if that element does not exist.

                          Complexity: Logarithmic.

                          Throws: If comp throws.

                        56. -
                          iterator find(const key_type & key);
                          +
                          iterator find(const key_type & key);

                          Effects: Finds an iterator to the first element whose key is k or end() if that element does not exist.

                          Complexity: Logarithmic.

                          Throws: If key_compare throws. 

                        57. template<typename KeyType, typename KeyTypeKeyCompare> 
-  iterator find(const KeyType & key, KeyTypeKeyCompare comp);
                          + iterator find(const KeyType & key, KeyTypeKeyCompare comp);

                          Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk), and nk the key_type of a value_type inserted into *this.

                          Effects: Finds an iterator to the first element whose key is k or end() if that element does not exist.

                          Complexity: Logarithmic.

                          Throws: If comp throws.

                        58. -
                          const_iterator find(const key_type & key) const;
                          +
                          const_iterator find(const key_type & key) const;

                          Effects: Finds an iterator to the first element whose key is k or end() if that element does not exist.

                          Complexity: Logarithmic.

                          Throws: If key_compare throws. 

                        59. template<typename KeyType, typename KeyTypeKeyCompare> 
-  const_iterator find(const KeyType & key, KeyTypeKeyCompare comp) const;
                          + const_iterator find(const KeyType & key, KeyTypeKeyCompare comp) const;

                          Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk), and nk the key_type of a value_type inserted into *this.

                          Effects: Finds an iterator to the first element whose key is k or end() if that element does not exist.

                          Complexity: Logarithmic.

                          Throws: If comp throws.

                        60. -
                          std::pair< iterator, iterator > equal_range(const key_type & key);
                          +
                          std::pair< iterator, iterator > equal_range(const key_type & key);

                          Effects: Finds a range containing all elements whose key is k or an empty range that indicates the position where those elements would be if they there is no elements with key k.

                          Complexity: Logarithmic.

                          Throws: If key_compare throws.

                          @@ -664,7 +664,7 @@ 
                        61. template<typename KeyType, typename KeyTypeKeyCompare> 
   std::pair< iterator, iterator > 
-  equal_range(const KeyType & key, KeyTypeKeyCompare comp);
                          + equal_range(const KeyType & key, KeyTypeKeyCompare comp);

                          Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk), with nk the key_type of a value_type inserted into *this.

                          Effects: Finds a range containing all elements whose key is k or an empty range that indicates the position where those elements would be if they there is no elements with key k.

                          Complexity: Logarithmic.

                          @@ -672,7 +672,7 @@ 
                        62. std::pair< const_iterator, const_iterator > 
-equal_range(const key_type & key) const;
                          +equal_range(const key_type & key) const;

                          Effects: Finds a range containing all elements whose key is k or an empty range that indicates the position where those elements would be if they there is no elements with key k.

                          Complexity: Logarithmic.

                          Throws: If key_compare throws.

                          @@ -680,7 +680,7 @@ 
                        63. template<typename KeyType, typename KeyTypeKeyCompare> 
   std::pair< const_iterator, const_iterator > 
-  equal_range(const KeyType & key, KeyTypeKeyCompare comp) const;
                          + equal_range(const KeyType & key, KeyTypeKeyCompare comp) const;

                          Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk), with nk the key_type of a value_type inserted into *this.

                          Effects: Finds a range containing all elements whose key is k or an empty range that indicates the position where those elements would be if they there is no elements with key k.

                          Complexity: Logarithmic.

                          @@ -688,7 +688,7 @@ 
                        64. std::pair< iterator, iterator > 
-bounded_range(const key_type & lower_key, const key_type & upper_key, 
+bounded_range(const key_type & lower_key, const key_type & upper_key, 
               bool left_closed, bool right_closed);

                          Requires: upper_key shall not precede lower_key according to key_compare. [key_comp()(upper_key, lower_key) shall be false]

                          If lower_key is equivalent to upper_key [!key_comp()(upper_key, lower_key) && !key_comp()(lower_key, upper_key)] then ('left_closed' || 'right_closed') must be false.

                          @@ -703,7 +703,7 @@ 
                        65. template<typename KeyType, typename KeyTypeKeyCompare> 
   std::pair< iterator, iterator > 
-  bounded_range(const KeyType & lower_key, const KeyType & upper_key, 
+  bounded_range(const KeyType & lower_key, const KeyType & upper_key, 
                 KeyTypeKeyCompare comp, bool left_closed, bool right_closed);

                          Requires: lower_key is a value such that *this is partitioned with respect to comp(nk, lower_key) if left_closed is true, with respect to !comp(lower_key, nk) otherwise.

                          upper_key is a value such that *this is partitioned with respect to !comp(upper_key, nk) if right_closed is true, with respect to comp(nk, upper_key) otherwise.

                          @@ -719,7 +719,7 @@ 
                        66. std::pair< const_iterator, const_iterator > 
-bounded_range(const key_type & lower_key, const key_type & upper_key, 
+bounded_range(const key_type & lower_key, const key_type & upper_key, 
               bool left_closed, bool right_closed) const;

                          Requires: upper_key shall not precede lower_key according to key_compare. [key_comp()(upper_key, lower_key) shall be false]

                          If lower_key is equivalent to upper_key [!key_comp()(upper_key, lower_key) && !key_comp()(lower_key, upper_key)] then ('left_closed' || 'right_closed') must be false.

                          @@ -734,7 +734,7 @@ 
                        67. template<typename KeyType, typename KeyTypeKeyCompare> 
   std::pair< const_iterator, const_iterator > 
-  bounded_range(const KeyType & lower_key, const KeyType & upper_key, 
+  bounded_range(const KeyType & lower_key, const KeyType & upper_key, 
                 KeyTypeKeyCompare comp, bool left_closed, bool right_closed) const;

                          Requires: lower_key is a value such that *this is partitioned with respect to comp(nk, lower_key) if left_closed is true, with respect to !comp(lower_key, nk) otherwise.

                          upper_key is a value such that *this is partitioned with respect to !comp(upper_key, nk) if right_closed is true, with respect to comp(nk, upper_key) otherwise.

                          @@ -749,28 +749,28 @@

                          Note: Experimental function, the interface might change in future releases.

                        68. -
                          iterator iterator_to(reference value);
                          +
                          iterator iterator_to(reference value);

                          Requires: value must be an lvalue and shall be in a set of appropriate type. Otherwise the behavior is undefined.

                          Effects: Returns: a valid iterator i belonging to the set that points to the value

                          Complexity: Constant.

                          Throws: Nothing.

                        69. -
                          const_iterator iterator_to(const_reference value) const;
                          +
                          const_iterator iterator_to(const_reference value) const;

                          Requires: value must be an lvalue and shall be in a set of appropriate type. Otherwise the behavior is undefined.

                          Effects: Returns: a valid const_iterator i belonging to the set that points to the value

                          Complexity: Constant.

                          Throws: Nothing.

                        70. -
                          pointer unlink_leftmost_without_rebalance();
                          +
                          pointer unlink_leftmost_without_rebalance();

                          Effects: Unlinks the leftmost node from the container.

                          Complexity: Average complexity is constant time.

                          Throws: Nothing.

                          Notes: This function breaks the container and the container can only be used for more unlink_leftmost_without_rebalance calls. This function is normally used to achieve a step by step controlled destruction of the container.

                        71. -
                          void replace_node(iterator replace_this, reference with_this);
                          +
                          void replace_node(iterator replace_this, reference with_this);

                          Requires: replace_this must be a valid iterator of *this and with_this must not be inserted in any container.

                          Effects: Replaces replace_this in its position in the container with with_this. The container does not need to be rebalanced.

                          Complexity: Constant.

                          @@ -778,7 +778,7 @@

                          Note: This function will break container ordering invariants if with_this is not equivalent to *replace_this according to the ordering rules. This function is faster than erasing and inserting the node, since no rebalancing or comparison is needed.

                        72. -
                          void remove_node(reference value);
                          +
                          void remove_node(reference value);

                          Effects: removes "value" from the container.

                          Throws: Nothing.

                          Complexity: Logarithmic time.

                          @@ -787,7 +787,7 @@ 
                        73. template<class... Options2> 
-  void merge(treap_multiset< T, Options2...> & source);
                          + void merge(treap_multiset< T, Options2...> & source);

                          Requires: "source" container's Options can only can differ in the comparison function from *this.

                          Effects: Attempts to extract each element in source and insert it into a using the comparison object of *this. If there is an element in a with key equivalent to the key of an element from source, then that element is not extracted from source.

                          Postcondition: Pointers and references to the transferred elements of source refer to those same elements but as members of *this. Iterators referring to the transferred elements will continue to refer to their elements, but they now behave as iterators into *this, not into source.

                          @@ -795,7 +795,7 @@

                          Complexity: N log(a.size() + N) (N has the value source.size())

                        74. -
                          template<class... Options2> void merge(treap_set< T, Options2...> & source);
                          +
                          template<class... Options2> void merge(treap_set< T, Options2...> & source);

                          Requires: "source" container's Options can only can differ in the comparison function from *this.

                          Effects: Attempts to extract each element in source and insert it into a using the comparison object of *this. If there is an element in a with key equivalent to the key of an element from source, then that element is not extracted from source.

                          Postcondition: Pointers and references to the transferred elements of source refer to those same elements but as members of *this. Iterators referring to the transferred elements will continue to refer to their elements, but they now behave as iterators into *this, not into source.

                          @@ -806,10 +806,10 @@

                        -treap_multiset public static functions

                        +treap_multiset public static functions
                        1. -
                          static treap_multiset & container_from_end_iterator(iterator end_iterator);
                          +
                          static treap_multiset & container_from_end_iterator(iterator end_iterator);

                          Precondition: end_iterator must be a valid end iterator of the container.

                          Effects: Returns a const reference to the container associated to the end iterator

                          Throws: Nothing.

                          @@ -817,28 +817,28 @@ 
                        2. static const treap_multiset & 
-container_from_end_iterator(const_iterator end_iterator);
                          +container_from_end_iterator(const_iterator end_iterator);

                          Precondition: end_iterator must be a valid end iterator of the container.

                          Effects: Returns a const reference to the container associated to the end iterator

                          Throws: Nothing.

                          Complexity: Constant.

                        3. -
                          static treap_multiset & container_from_iterator(iterator it);
                          +
                          static treap_multiset & container_from_iterator(iterator it);

                          Precondition: it must be a valid iterator of the container.

                          Effects: Returns a const reference to the container associated to the iterator

                          Throws: Nothing.

                          Complexity: Logarithmic.

                        4. -
                          static const treap_multiset & container_from_iterator(const_iterator it);
                          +
                          static const treap_multiset & container_from_iterator(const_iterator it);

                          Precondition: it must be a valid iterator of the container.

                          Effects: Returns a const reference to the container associated to the iterator

                          Throws: Nothing.

                          Complexity: Logarithmic.

                        5. -
                          static iterator s_iterator_to(reference value);
                          +
                          static iterator s_iterator_to(reference value);

                          Requires: value must be an lvalue and shall be in a set of appropriate type. Otherwise the behavior is undefined.

                          Effects: Returns: a valid iterator i belonging to the set that points to the value

                          Complexity: Constant.

                          @@ -846,7 +846,7 @@

                          Note: This static function is available only if the value traits is stateless.

                        6. -
                          static const_iterator s_iterator_to(const_reference value);
                          +
                          static const_iterator s_iterator_to(const_reference value);

                          Requires: value must be an lvalue and shall be in a set of appropriate type. Otherwise the behavior is undefined.

                          Effects: Returns: a valid iterator i belonging to the set that points to the value

                          Complexity: Constant.

                          @@ -854,7 +854,7 @@

                          Note: This static function is available only if the value traits is stateless.

                        7. -
                          static void init_node(reference value);
                          +
                          static void init_node(reference value);

                          Requires: value shall not be in a container.

                          Effects: init_node puts the hook of a value in a well-known default state.

                          Throws: Nothing.

                          diff --git a/doc/html/boost/intrusive/treap_set.html b/doc/html/boost/intrusive/treap_set.html index 8b1517ba70..718ae888b6 100644 --- a/doc/html/boost/intrusive/treap_set.html +++ b/doc/html/boost/intrusive/treap_set.html @@ -61,144 +61,144 @@ typedef implementation_defined::node_algorithms node_algorithms; // construct/copy/destruct - treap_set(); - explicit treap_set(const key_compare &, + treap_set(); + explicit treap_set(const key_compare &, const priority_compare & = priority_compare(), const value_traits & = value_traits()); template<typename Iterator> - treap_set(Iterator, Iterator, const key_compare & = key_compare(), + treap_set(Iterator, Iterator, const key_compare & = key_compare(), const priority_compare & = priority_compare(), const value_traits & = value_traits()); - treap_set(treap_set &&); - treap_set & operator=(treap_set &&); - ~treap_set(); + treap_set(treap_set &&); + treap_set & operator=(treap_set &&); + ~treap_set(); - // public member functions - iterator begin(); - const_iterator begin() const; - const_iterator cbegin() const; - iterator end(); - const_iterator end() const; - const_iterator cend() const; - reverse_iterator rbegin(); - const_reverse_iterator rbegin() const; - const_reverse_iterator crbegin() const; - reverse_iterator rend(); - const_reverse_iterator rend() const; - const_reverse_iterator crend() const; - iterator root(); - const_iterator root() const; - const_iterator croot() const; - key_compare key_comp() const; - value_compare value_comp() const; - bool empty() const; - size_type size() const; - void swap(treap_set &); + // public member functions + iterator begin(); + const_iterator begin() const; + const_iterator cbegin() const; + iterator end(); + const_iterator end() const; + const_iterator cend() const; + reverse_iterator rbegin(); + const_reverse_iterator rbegin() const; + const_reverse_iterator crbegin() const; + reverse_iterator rend(); + const_reverse_iterator rend() const; + const_reverse_iterator crend() const; + iterator root(); + const_iterator root() const; + const_iterator croot() const; + key_compare key_comp() const; + value_compare value_comp() const; + bool empty() const; + size_type size() const; + void swap(treap_set &); template<typename Cloner, typename Disposer> - void clone_from(const treap_set &, Cloner, Disposer); + void clone_from(const treap_set &, Cloner, Disposer); template<typename Cloner, typename Disposer> - void clone_from(treap_set &&, Cloner, Disposer); - iterator top(); - const_iterator top() const; - const_iterator ctop() const; - reverse_iterator rtop(); - const_reverse_iterator rtop() const; - const_reverse_iterator crtop() const; - priority_compare priority_comp() const; - std::pair< iterator, bool > insert(reference); - iterator insert(const_iterator, reference); + void clone_from(treap_set &&, Cloner, Disposer); + iterator top(); + const_iterator top() const; + const_iterator ctop() const; + reverse_iterator rtop(); + const_reverse_iterator rtop() const; + const_reverse_iterator crtop() const; + priority_compare priority_comp() const; + std::pair< iterator, bool > insert(reference); + iterator insert(const_iterator, reference); std::pair< iterator, bool > - insert_check(const key_type &, insert_commit_data &); + insert_check(const key_type &, insert_commit_data &); std::pair< iterator, bool > - insert_check(const_iterator, const key_type &, insert_commit_data &); + insert_check(const_iterator, const key_type &, insert_commit_data &); template<typename KeyType, typename KeyTypeKeyCompare, typename KeyValuePrioCompare> std::pair< iterator, bool > - insert_check(const KeyType &, KeyTypeKeyCompare, KeyValuePrioCompare, + insert_check(const KeyType &, KeyTypeKeyCompare, KeyValuePrioCompare, insert_commit_data &); template<typename KeyType, typename KeyTypeKeyCompare, typename KeyValuePrioCompare> std::pair< iterator, bool > - insert_check(const_iterator, const KeyType &, KeyTypeKeyCompare, + insert_check(const_iterator, const KeyType &, KeyTypeKeyCompare, KeyValuePrioCompare, insert_commit_data &); - template<typename Iterator> void insert(Iterator, Iterator); - iterator insert_commit(reference, const insert_commit_data &); - iterator insert_before(const_iterator, reference); - void push_back(reference); - void push_front(reference); - iterator erase(const_iterator); - iterator erase(const_iterator, const_iterator); - size_type erase(const key_type &); + template<typename Iterator> void insert(Iterator, Iterator); + iterator insert_commit(reference, const insert_commit_data &); + iterator insert_before(const_iterator, reference); + void push_back(reference); + void push_front(reference); + iterator erase(const_iterator); + iterator erase(const_iterator, const_iterator); + size_type erase(const key_type &); template<typename KeyType, typename KeyTypeKeyCompare> - size_type erase(const KeyType &, KeyTypeKeyCompare); + size_type erase(const KeyType &, KeyTypeKeyCompare); template<typename Disposer> - iterator erase_and_dispose(const_iterator, Disposer); + iterator erase_and_dispose(const_iterator, Disposer); template<typename Disposer> - iterator erase_and_dispose(const_iterator, const_iterator, Disposer); + iterator erase_and_dispose(const_iterator, const_iterator, Disposer); template<typename Disposer> - size_type erase_and_dispose(const key_type &, Disposer); + size_type erase_and_dispose(const key_type &, Disposer); template<typename KeyType, typename KeyTypeKeyCompare, typename Disposer> - size_type erase_and_dispose(const KeyType &, KeyTypeKeyCompare, Disposer); - void clear(); - template<typename Disposer> void clear_and_dispose(Disposer); - size_type count(const key_type &) const; + size_type erase_and_dispose(const KeyType &, KeyTypeKeyCompare, Disposer); + void clear(); + template<typename Disposer> void clear_and_dispose(Disposer); + size_type count(const key_type &) const; template<typename KeyType, typename KeyTypeKeyCompare> - size_type count(const KeyType &, KeyTypeKeyCompare) const; - iterator lower_bound(const key_type &); + size_type count(const KeyType &, KeyTypeKeyCompare) const; + iterator lower_bound(const key_type &); template<typename KeyType, typename KeyTypeKeyCompare> - iterator lower_bound(const KeyType &, KeyTypeKeyCompare); - const_iterator lower_bound(const key_type &) const; + iterator lower_bound(const KeyType &, KeyTypeKeyCompare); + const_iterator lower_bound(const key_type &) const; template<typename KeyType, typename KeyTypeKeyCompare> - const_iterator lower_bound(const KeyType &, KeyTypeKeyCompare) const; - iterator upper_bound(const key_type &); + const_iterator lower_bound(const KeyType &, KeyTypeKeyCompare) const; + iterator upper_bound(const key_type &); template<typename KeyType, typename KeyTypeKeyCompare> - iterator upper_bound(const KeyType &, KeyTypeKeyCompare); - const_iterator upper_bound(const key_type &) const; + iterator upper_bound(const KeyType &, KeyTypeKeyCompare); + const_iterator upper_bound(const key_type &) const; template<typename KeyType, typename KeyTypeKeyCompare> - const_iterator upper_bound(const KeyType &, KeyTypeKeyCompare) const; - iterator find(const key_type &); + const_iterator upper_bound(const KeyType &, KeyTypeKeyCompare) const; + iterator find(const key_type &); template<typename KeyType, typename KeyTypeKeyCompare> - iterator find(const KeyType &, KeyTypeKeyCompare); - const_iterator find(const key_type &) const; + iterator find(const KeyType &, KeyTypeKeyCompare); + const_iterator find(const key_type &) const; template<typename KeyType, typename KeyTypeKeyCompare> - const_iterator find(const KeyType &, KeyTypeKeyCompare) const; - std::pair< iterator, iterator > equal_range(const key_type &); + const_iterator find(const KeyType &, KeyTypeKeyCompare) const; + std::pair< iterator, iterator > equal_range(const key_type &); template<typename KeyType, typename KeyTypeKeyCompare> std::pair< iterator, iterator > - equal_range(const KeyType &, KeyTypeKeyCompare); + equal_range(const KeyType &, KeyTypeKeyCompare); std::pair< const_iterator, const_iterator > - equal_range(const key_type &) const; + equal_range(const key_type &) const; template<typename KeyType, typename KeyTypeKeyCompare> std::pair< const_iterator, const_iterator > - equal_range(const KeyType &, KeyTypeKeyCompare) const; + equal_range(const KeyType &, KeyTypeKeyCompare) const; std::pair< iterator, iterator > - bounded_range(const key_type &, const key_type &, bool, bool); + bounded_range(const key_type &, const key_type &, bool, bool); template<typename KeyType, typename KeyTypeKeyCompare> std::pair< iterator, iterator > - bounded_range(const KeyType &, const KeyType &, KeyTypeKeyCompare, bool, + bounded_range(const KeyType &, const KeyType &, KeyTypeKeyCompare, bool, bool); std::pair< const_iterator, const_iterator > - bounded_range(const key_type &, const key_type &, bool, bool) const; + bounded_range(const key_type &, const key_type &, bool, bool) const; template<typename KeyType, typename KeyTypeKeyCompare> std::pair< const_iterator, const_iterator > - bounded_range(const KeyType &, const KeyType &, KeyTypeKeyCompare, bool, + bounded_range(const KeyType &, const KeyType &, KeyTypeKeyCompare, bool, bool) const; - iterator iterator_to(reference); - const_iterator iterator_to(const_reference) const; - pointer unlink_leftmost_without_rebalance(); - void replace_node(iterator, reference); - void remove_node(reference); - template<class... Options2> void merge(treap_set< T, Options2...> &); - template<class... Options2> void merge(treap_multiset< T, Options2...> &); + iterator iterator_to(reference); + const_iterator iterator_to(const_reference) const; + pointer unlink_leftmost_without_rebalance(); + void replace_node(iterator, reference); + void remove_node(reference); + template<class... Options2> void merge(treap_set< T, Options2...> &); + template<class... Options2> void merge(treap_multiset< T, Options2...> &); - // public static functions - static treap_set & container_from_end_iterator(iterator); - static const treap_set & container_from_end_iterator(const_iterator); - static treap_set & container_from_iterator(iterator); - static const treap_set & container_from_iterator(const_iterator); - static iterator s_iterator_to(reference); - static const_iterator s_iterator_to(const_reference); - static void init_node(reference); + // public static functions + static treap_set & container_from_end_iterator(iterator); + static const treap_set & container_from_end_iterator(const_iterator); + static treap_set & container_from_iterator(iterator); + static const treap_set & container_from_iterator(const_iterator); + static iterator s_iterator_to(reference); + static const_iterator s_iterator_to(const_reference); + static void init_node(reference); // public data members static const bool constant_time_size; @@ -215,13 +215,13 @@ construct/copy/destruct
                          1. -
                            treap_set();
                            +
                            treap_set();

                            Effects: Constructs an empty container.

                            Complexity: Constant.

                            Throws: If value_traits::node_traits::node constructor throws (this does not happen with predefined Boost.Intrusive hooks) or the copy constructor of the value_compare/priority_compare objects throw. Basic guarantee.

                          2. -
                            explicit treap_set(const key_compare & cmp, 
+
                            explicit treap_set(const key_compare & cmp, 
                    const priority_compare & pcmp = priority_compare(), 
                    const value_traits & v_traits = value_traits());
                            
 
                            Effects: Constructs an empty container.
                            
@@ -230,7 +230,7 @@
 
                          3. template<typename Iterator> 
-  treap_set(Iterator b, Iterator e, const key_compare & cmp = key_compare(), 
+  treap_set(Iterator b, Iterator e, const key_compare & cmp = key_compare(), 
             const priority_compare & pcmp = priority_compare(), 
             const value_traits & v_traits = value_traits());

                            Requires: Dereferencing iterator must yield an lvalue of type value_type. cmp must be a comparison function that induces a strict weak ordering.

                            @@ -239,15 +239,15 @@

                            Throws: If value_traits::node_traits::node constructor throws (this does not happen with predefined Boost.Intrusive hooks) or the copy constructor/operator() of the key_compare/priority_compare objects throw. Basic guarantee.

                          4. -
                            treap_set(treap_set && x);
                            +
                            treap_set(treap_set && x);

                            Effects: to-do

                          5. -
                            treap_set & operator=(treap_set && x);
                            +
                            treap_set & operator=(treap_set && x);

                            Effects: to-do

                          6. -
                            ~treap_set();
                            +
                            ~treap_set();

                            Effects: Detaches all elements from this. The objects in the set are not deleted (i.e. no destructors are called), but the nodes according to the value_traits template parameter are reinitialized and thus can be reused.

                            Complexity: Linear to elements contained in *this.

                            Throws: Nothing.

                            @@ -256,131 +256,131 @@

                          -treap_set public member functions

                          +treap_set public member functions
                          1. -
                            iterator begin();
                            +
                            iterator begin();

                            Effects: Returns an iterator pointing to the beginning of the container.

                            Complexity: Constant.

                            Throws: Nothing.

                          2. -
                            const_iterator begin() const;
                            +
                            const_iterator begin() const;

                            Effects: Returns a const_iterator pointing to the beginning of the container.

                            Complexity: Constant.

                            Throws: Nothing.

                          3. -
                            const_iterator cbegin() const;
                            +
                            const_iterator cbegin() const;

                            Effects: Returns a const_iterator pointing to the beginning of the container.

                            Complexity: Constant.

                            Throws: Nothing.

                          4. -
                            iterator end();
                            +
                            iterator end();

                            Effects: Returns an iterator pointing to the end of the container.

                            Complexity: Constant.

                            Throws: Nothing.

                          5. -
                            const_iterator end() const;
                            +
                            const_iterator end() const;

                            Effects: Returns a const_iterator pointing to the end of the container.

                            Complexity: Constant.

                            Throws: Nothing.

                          6. -
                            const_iterator cend() const;
                            +
                            const_iterator cend() const;

                            Effects: Returns a const_iterator pointing to the end of the container.

                            Complexity: Constant.

                            Throws: Nothing.

                          7. -
                            reverse_iterator rbegin();
                            +
                            reverse_iterator rbegin();

                            Effects: Returns a reverse_iterator pointing to the beginning of the reversed container.

                            Complexity: Constant.

                            Throws: Nothing.

                          8. -
                            const_reverse_iterator rbegin() const;
                            +
                            const_reverse_iterator rbegin() const;

                            Effects: Returns a const_reverse_iterator pointing to the beginning of the reversed container.

                            Complexity: Constant.

                            Throws: Nothing.

                          9. -
                            const_reverse_iterator crbegin() const;
                            +
                            const_reverse_iterator crbegin() const;

                            Effects: Returns a const_reverse_iterator pointing to the beginning of the reversed container.

                            Complexity: Constant.

                            Throws: Nothing.

                          10. -
                            reverse_iterator rend();
                            +
                            reverse_iterator rend();

                            Effects: Returns a reverse_iterator pointing to the end of the reversed container.

                            Complexity: Constant.

                            Throws: Nothing.

                          11. -
                            const_reverse_iterator rend() const;
                            +
                            const_reverse_iterator rend() const;

                            Effects: Returns a const_reverse_iterator pointing to the end of the reversed container.

                            Complexity: Constant.

                            Throws: Nothing.

                          12. -
                            const_reverse_iterator crend() const;
                            +
                            const_reverse_iterator crend() const;

                            Effects: Returns a const_reverse_iterator pointing to the end of the reversed container.

                            Complexity: Constant.

                            Throws: Nothing.

                          13. -
                            iterator root();
                            +
                            iterator root();

                            Effects: Returns a iterator pointing to the root node of the container or end() if not present.

                            Complexity: Constant.

                            Throws: Nothing.

                          14. -
                            const_iterator root() const;
                            +
                            const_iterator root() const;

                            Effects: Returns a const_iterator pointing to the root node of the container or cend() if not present.

                            Complexity: Constant.

                            Throws: Nothing.

                          15. -
                            const_iterator croot() const;
                            +
                            const_iterator croot() const;

                            Effects: Returns a const_iterator pointing to the root node of the container or cend() if not present.

                            Complexity: Constant.

                            Throws: Nothing.

                          16. -
                            key_compare key_comp() const;
                            +
                            key_compare key_comp() const;

                            Effects: Returns the key_compare object used by the container.

                            Complexity: Constant.

                            Throws: If key_compare copy-constructor throws.

                          17. -
                            value_compare value_comp() const;
                            +
                            value_compare value_comp() const;

                            Effects: Returns the value_compare object used by the container.

                            Complexity: Constant.

                            Throws: If value_compare copy-constructor throws.

                          18. -
                            bool empty() const;
                            +
                            bool empty() const;

                            Effects: Returns true if the container is empty.

                            Complexity: Constant.

                            Throws: Nothing.

                          19. -
                            size_type size() const;
                            +
                            size_type size() const;

                            Effects: Returns the number of elements stored in the container.

                            Complexity: Linear to elements contained in *this if constant-time size option is disabled. Constant time otherwise.

                            Throws: Nothing.

                          20. -
                            void swap(treap_set & other);
                            +
                            void swap(treap_set & other);

                            Effects: Swaps the contents of two treaps.

                            Complexity: Constant.

                            Throws: If the comparison functor's swap call throws. 

                          21. template<typename Cloner, typename Disposer> 
-  void clone_from(const treap_set & src, Cloner cloner, Disposer disposer);
                            + void clone_from(const treap_set & src, Cloner cloner, Disposer disposer);

                            Requires: Disposer::operator()(pointer) shouldn't throw. Cloner should yield to nodes equivalent to the original nodes.

                            Effects: Erases all the elements from *this calling Disposer::operator()(pointer), clones all the elements from src calling Cloner::operator()(const_reference ) and inserts them on *this. Copies the predicate from the source container.

                            If cloner throws, all cloned elements are unlinked and disposed calling Disposer::operator()(pointer).

                            @@ -389,7 +389,7 @@ 
                          22. template<typename Cloner, typename Disposer> 
-  void clone_from(treap_set && src, Cloner cloner, Disposer disposer);
                            + void clone_from(treap_set && src, Cloner cloner, Disposer disposer);

                            Requires: Disposer::operator()(pointer) shouldn't throw. Cloner should yield to nodes equivalent to the original nodes.

                            Effects: Erases all the elements from *this calling Disposer::operator()(pointer), clones all the elements from src calling Cloner::operator()(reference) and inserts them on *this. Copies the predicate from the source container.

                            If cloner throws, all cloned elements are unlinked and disposed calling Disposer::operator()(pointer).

                            @@ -397,49 +397,49 @@

                            Throws: If cloner throws or predicate copy assignment throws. Basic guarantee.

                          23. -
                            iterator top();
                            +
                            iterator top();

                            Effects: Returns an iterator pointing to the highest priority object of the treap.

                            Complexity: Constant.

                            Throws: Nothing.

                          24. -
                            const_iterator top() const;
                            +
                            const_iterator top() const;

                            Effects: Returns a const_iterator pointing to the highest priority object of the treap..

                            Complexity: Constant.

                            Throws: Nothing.

                          25. -
                            const_iterator ctop() const;
                            +
                            const_iterator ctop() const;

                            Effects: Returns a const_iterator pointing to the highest priority object of the treap..

                            Complexity: Constant.

                            Throws: Nothing.

                          26. -
                            reverse_iterator rtop();
                            +
                            reverse_iterator rtop();

                            Effects: Returns a reverse_iterator pointing to the highest priority object of the reversed treap.

                            Complexity: Constant.

                            Throws: Nothing.

                          27. -
                            const_reverse_iterator rtop() const;
                            +
                            const_reverse_iterator rtop() const;

                            Effects: Returns a const_reverse_iterator pointing to the highest priority objec of the reversed treap.

                            Complexity: Constant.

                            Throws: Nothing.

                          28. -
                            const_reverse_iterator crtop() const;
                            +
                            const_reverse_iterator crtop() const;

                            Effects: Returns a const_reverse_iterator pointing to the highest priority object of the reversed treap.

                            Complexity: Constant.

                            Throws: Nothing.

                          29. -
                            priority_compare priority_comp() const;
                            +
                            priority_compare priority_comp() const;

                            Effects: Returns a const_reverse_iterator pointing to the highest priority object of the reversed treap.

                            Complexity: Constant.

                            Throws: Nothing.

                          30. -
                            std::pair< iterator, bool > insert(reference value);
                            +
                            std::pair< iterator, bool > insert(reference value);

                            Requires: value must be an lvalue

                            Effects: Inserts value into the container if the value is not already present.

                            Complexity: Average complexity for insert element is at most logarithmic.

                            @@ -447,7 +447,7 @@

                            Note: Does not affect the validity of iterators and references. No copy-constructors are called.

                          31. -
                            iterator insert(const_iterator hint, reference value);
                            +
                            iterator insert(const_iterator hint, reference value);

                            Requires: value must be an lvalue, and "hint" must be a valid iterator

                            Effects: Tries to insert x into the container, using "hint" as a hint to where it will be inserted.

                            Complexity: Logarithmic in general, but it is amortized constant time (two comparisons in the worst case) if t is inserted immediately before hint.

                            @@ -456,7 +456,7 @@ 
                          32. std::pair< iterator, bool > 
-insert_check(const key_type & key, insert_commit_data & commit_data);
                            +insert_check(const key_type & key, insert_commit_data & commit_data);

                            Effects: Checks if a value can be inserted in the container, using a user provided key instead of the value itself.

                            Returns: If there is an equivalent value returns a pair containing an iterator to the already present value and false. If the value can be inserted returns true in the returned pair boolean and fills "commit_data" that is meant to be used with the "insert_commit" function.

                            Complexity: Average complexity is at most logarithmic.

                            @@ -467,7 +467,7 @@ 
                          33. std::pair< iterator, bool > 
-insert_check(const_iterator hint, const key_type & key, 
+insert_check(const_iterator hint, const key_type & key, 
              insert_commit_data & commit_data);

                            Effects: Checks if a value can be inserted in the container, using a user provided key instead of the value itself, using "hint" as a hint to where it will be inserted.

                            Returns: If there is an equivalent value returns a pair containing an iterator to the already present value and false. If the value can be inserted returns true in the returned pair boolean and fills "commit_data" that is meant to be used with the "insert_commit" function.

                            @@ -481,7 +481,7 @@ 
                            template<typename KeyType, typename KeyTypeKeyCompare, 
          typename KeyValuePrioCompare> 
   std::pair< iterator, bool > 
-  insert_check(const KeyType & key, KeyTypeKeyCompare comp, 
+  insert_check(const KeyType & key, KeyTypeKeyCompare comp, 
                KeyValuePrioCompare key_value_pcomp, 
                insert_commit_data & commit_data);

                            Requires: comp must be a comparison function that induces the same strict weak ordering as key_compare. key_value_pcomp must be a comparison function that induces the same strict weak ordering as priority_compare. The difference is that key_value_pcomp and comp compare an arbitrary key with the contained values.

                            @@ -497,7 +497,7 @@ 
                            template<typename KeyType, typename KeyTypeKeyCompare, 
          typename KeyValuePrioCompare> 
   std::pair< iterator, bool > 
-  insert_check(const_iterator hint, const KeyType & key, 
+  insert_check(const_iterator hint, const KeyType & key, 
                KeyTypeKeyCompare comp, KeyValuePrioCompare key_value_pcomp, 
                insert_commit_data & commit_data);

                            Requires: comp must be a comparison function that induces the same strict weak ordering as key_compare. key_value_pcomp must be a comparison function that induces the same strict weak ordering as priority_compare. The difference is that key_value_pcomp and comp compare an arbitrary key with the contained values.

                            @@ -510,7 +510,7 @@

                            "commit_data" remains valid for a subsequent "insert_commit" only if no more objects are inserted or erased from the container.

                          34. -
                            template<typename Iterator> void insert(Iterator b, Iterator e);
                            +
                            template<typename Iterator> void insert(Iterator b, Iterator e);

                            Requires: Dereferencing iterator must yield an lvalue of type value_type.

                            Effects: Tries to insert each element of a range into the container.

                            Complexity: Insert range is in general O(N * log(N)), where N is the size of the range. However, it is linear in N if the range is already sorted by key_comp().

                            @@ -518,7 +518,7 @@

                            Note: Does not affect the validity of iterators and references. No copy-constructors are called.

                          35. -
                            iterator insert_commit(reference value, 
+
                            iterator insert_commit(reference value, 
                        const insert_commit_data & commit_data);
                            
 
                            Requires: value must be an lvalue of type value_type. commit_data must have been obtained from a previous call to "insert_check". No objects should have been inserted or erased from the container between the "insert_check" that filled "commit_data" and the call to "insert_commit".
                            
 
                            Effects: Inserts the value in the avl_set using the information obtained from the "commit_data" that a previous "insert_check" filled.
                            
@@ -528,7 +528,7 @@
 
                            Notes: This function has only sense if a "insert_check" has been previously executed to fill "commit_data". No value should be inserted or erased between the "insert_check" and "insert_commit" calls.
                          36. -
                            iterator insert_before(const_iterator pos, reference value);
                            +
                            iterator insert_before(const_iterator pos, reference value);

                            Requires: value must be an lvalue, "pos" must be a valid iterator (or end) and must be the succesor of value once inserted according to the predicate

                            Effects: Inserts x into the container before "pos".

                            Complexity: Constant time.

                            @@ -536,7 +536,7 @@

                            Note: This function does not check preconditions so if "pos" is not the successor of "value" container ordering invariant will be broken. This is a low-level function to be used only for performance reasons by advanced users.

                          37. -
                            void push_back(reference value);
                            +
                            void push_back(reference value);

                            Requires: value must be an lvalue, and it must be no less than the greatest inserted key

                            Effects: Inserts x into the container in the last position.

                            Complexity: Constant time.

                            @@ -544,7 +544,7 @@

                            Note: This function does not check preconditions so if value is less than the greatest inserted key container ordering invariant will be broken. This function is slightly more efficient than using "insert_before". This is a low-level function to be used only for performance reasons by advanced users.

                          38. -
                            void push_front(reference value);
                            +
                            void push_front(reference value);

                            Requires: value must be an lvalue, and it must be no greater than the minimum inserted key

                            Effects: Inserts x into the container in the first position.

                            Complexity: Constant time.

                            @@ -552,21 +552,21 @@

                            Note: This function does not check preconditions so if value is greater than the minimum inserted key container ordering invariant will be broken. This function is slightly more efficient than using "insert_before". This is a low-level function to be used only for performance reasons by advanced users.

                          39. -
                            iterator erase(const_iterator i);
                            +
                            iterator erase(const_iterator i);

                            Effects: Erases the element pointed to by i.

                            Complexity: Average complexity for erase element is constant time.

                            Throws: if the internal priority_compare function throws. Strong guarantee.

                            Note: Invalidates the iterators (but not the references) to the erased elements. No destructors are called.

                          40. -
                            iterator erase(const_iterator b, const_iterator e);
                            +
                            iterator erase(const_iterator b, const_iterator e);

                            Effects: Erases the range pointed to by b end e.

                            Complexity: Average complexity for erase range is at most O(log(size() + N)), where N is the number of elements in the range.

                            Throws: if the internal priority_compare function throws. Strong guarantee.

                            Note: Invalidates the iterators (but not the references) to the erased elements. No destructors are called.

                          41. -
                            size_type erase(const key_type & key);
                            +
                            size_type erase(const key_type & key);

                            Effects: Erases all the elements with the given value.

                            Returns: The number of erased elements.

                            Complexity: O(log(size() + N).

                            @@ -575,7 +575,7 @@ 
                          42. template<typename KeyType, typename KeyTypeKeyCompare> 
-  size_type erase(const KeyType & key, KeyTypeKeyCompare comp);
                            + size_type erase(const KeyType & key, KeyTypeKeyCompare comp);

                            Effects: Erases all the elements with the given key. according to the comparison functor "comp".

                            Returns: The number of erased elements.

                            Complexity: O(log(size() + N).

                            @@ -584,7 +584,7 @@ 
                          43. template<typename Disposer> 
-  iterator erase_and_dispose(const_iterator i, Disposer disposer);
                            + iterator erase_and_dispose(const_iterator i, Disposer disposer);

                            Requires: Disposer::operator()(pointer) shouldn't throw.

                            Effects: Erases the element pointed to by i. Disposer::operator()(pointer) is called for the removed element.

                            Complexity: Average complexity for erase element is constant time.

                            @@ -593,7 +593,7 @@ 
                          44. template<typename Disposer> 
-  iterator erase_and_dispose(const_iterator b, const_iterator e, 
+  iterator erase_and_dispose(const_iterator b, const_iterator e, 
                              Disposer disposer);

                            Requires: Disposer::operator()(pointer) shouldn't throw.

                            Effects: Erases the range pointed to by b end e. Disposer::operator()(pointer) is called for the removed elements.

                            @@ -603,7 +603,7 @@ 
                          45. template<typename Disposer> 
-  size_type erase_and_dispose(const key_type & key, Disposer disposer);
                            + size_type erase_and_dispose(const key_type & key, Disposer disposer);

                            Requires: Disposer::operator()(pointer) shouldn't throw.

                            Effects: Erases all the elements with the given value. Disposer::operator()(pointer) is called for the removed elements.

                            Returns: The number of erased elements.

                            @@ -613,7 +613,7 @@ 
                          46. template<typename KeyType, typename KeyTypeKeyCompare, typename Disposer> 
-  size_type erase_and_dispose(const KeyType & key, KeyTypeKeyCompare comp, 
+  size_type erase_and_dispose(const KeyType & key, KeyTypeKeyCompare comp, 
                               Disposer disposer);

                            Requires: Disposer::operator()(pointer) shouldn't throw.

                            Effects: Erases all the elements with the given key. according to the comparison functor "comp". Disposer::operator()(pointer) is called for the removed elements.

                            @@ -623,47 +623,47 @@

                            Note: Invalidates the iterators to the erased elements.

                          47. -
                            void clear();
                            +
                            void clear();

                            Effects: Erases all of the elements.

                            Complexity: Linear to the number of elements on the container. if it's a safe-mode or auto-unlink value_type. Constant time otherwise.

                            Throws: Nothing.

                            Note: Invalidates the iterators (but not the references) to the erased elements. No destructors are called.

                          48. -
                            template<typename Disposer> void clear_and_dispose(Disposer disposer);
                            +
                            template<typename Disposer> void clear_and_dispose(Disposer disposer);

                            Effects: Erases all of the elements calling disposer(p) for each node to be erased. Complexity: Average complexity for is at most O(log(size() + N)), where N is the number of elements in the container.

                            Throws: Nothing.

                            Note: Invalidates the iterators (but not the references) to the erased elements. Calls N times to disposer functor.

                          49. -
                            size_type count(const key_type & key) const;
                            +
                            size_type count(const key_type & key) const;

                            Effects: Returns the number of contained elements with the given value

                            Complexity: Logarithmic to the number of elements contained plus lineal to number of objects with the given value.

                            Throws: If key_compare throws. 

                          50. template<typename KeyType, typename KeyTypeKeyCompare> 
-  size_type count(const KeyType & key, KeyTypeKeyCompare comp) const;
                            + size_type count(const KeyType & key, KeyTypeKeyCompare comp) const;

                            Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk), and nk the key_type of a value_type inserted into *this.

                            Effects: Returns the number of contained elements with the given key

                            Complexity: Logarithmic to the number of elements contained plus lineal to number of objects with the given key.

                            Throws: If comp throws.

                          51. -
                            iterator lower_bound(const key_type & key);
                            +
                            iterator lower_bound(const key_type & key);

                            Effects: Returns an iterator to the first element whose key is not less than k or end() if that element does not exist.

                            Complexity: Logarithmic.

                            Throws: If key_compare throws. 

                          52. template<typename KeyType, typename KeyTypeKeyCompare> 
-  iterator lower_bound(const KeyType & key, KeyTypeKeyCompare comp);
                            + iterator lower_bound(const KeyType & key, KeyTypeKeyCompare comp);

                            Effects: Returns an iterator to the first element whose key is not less than k or end() if that element does not exist.

                            Complexity: Logarithmic.

                            Throws: If key_compare throws.

                          53. -
                            const_iterator lower_bound(const key_type & key) const;
                            +
                            const_iterator lower_bound(const key_type & key) const;

                            Effects: Returns an iterator to the first element whose key is not less than k or end() if that element does not exist.

                            Complexity: Logarithmic.

                            Throws: If key_compare throws.

                            @@ -671,27 +671,27 @@ 
                          54. template<typename KeyType, typename KeyTypeKeyCompare> 
   const_iterator 
-  lower_bound(const KeyType & key, KeyTypeKeyCompare comp) const;
                            + lower_bound(const KeyType & key, KeyTypeKeyCompare comp) const;

                            Effects: Returns an iterator to the first element whose key is not less than k or end() if that element does not exist.

                            Complexity: Logarithmic.

                            Throws: If key_compare throws.

                          55. -
                            iterator upper_bound(const key_type & key);
                            +
                            iterator upper_bound(const key_type & key);

                            Effects: Returns an iterator to the first element whose key is greater than k or end() if that element does not exist.

                            Complexity: Logarithmic.

                            Throws: If key_compare throws. 

                          56. template<typename KeyType, typename KeyTypeKeyCompare> 
-  iterator upper_bound(const KeyType & key, KeyTypeKeyCompare comp);
                            + iterator upper_bound(const KeyType & key, KeyTypeKeyCompare comp);

                            Requires: key is a value such that *this is partitioned with respect to !comp(key, nk), with nk the key_type of a value_type inserted into *this.

                            Effects: Returns an iterator to the first element whose key is greater than k according to comp or end() if that element does not exist.

                            Complexity: Logarithmic.

                            Throws: If comp throws.

                          57. -
                            const_iterator upper_bound(const key_type & key) const;
                            +
                            const_iterator upper_bound(const key_type & key) const;

                            Effects: Returns an iterator to the first element whose key is greater than k or end() if that element does not exist.

                            Complexity: Logarithmic.

                            Throws: If key_compare throws.

                            @@ -699,42 +699,42 @@ 
                          58. template<typename KeyType, typename KeyTypeKeyCompare> 
   const_iterator 
-  upper_bound(const KeyType & key, KeyTypeKeyCompare comp) const;
                            + upper_bound(const KeyType & key, KeyTypeKeyCompare comp) const;

                            Requires: key is a value such that *this is partitioned with respect to !comp(key, nk), with nk the key_type of a value_type inserted into *this.

                            Effects: Returns an iterator to the first element whose key is greater than k according to comp or end() if that element does not exist.

                            Complexity: Logarithmic.

                            Throws: If comp throws.

                          59. -
                            iterator find(const key_type & key);
                            +
                            iterator find(const key_type & key);

                            Effects: Finds an iterator to the first element whose key is k or end() if that element does not exist.

                            Complexity: Logarithmic.

                            Throws: If key_compare throws. 

                          60. template<typename KeyType, typename KeyTypeKeyCompare> 
-  iterator find(const KeyType & key, KeyTypeKeyCompare comp);
                            + iterator find(const KeyType & key, KeyTypeKeyCompare comp);

                            Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk), and nk the key_type of a value_type inserted into *this.

                            Effects: Finds an iterator to the first element whose key is k or end() if that element does not exist.

                            Complexity: Logarithmic.

                            Throws: If comp throws.

                          61. -
                            const_iterator find(const key_type & key) const;
                            +
                            const_iterator find(const key_type & key) const;

                            Effects: Finds an iterator to the first element whose key is k or end() if that element does not exist.

                            Complexity: Logarithmic.

                            Throws: If key_compare throws. 

                          62. template<typename KeyType, typename KeyTypeKeyCompare> 
-  const_iterator find(const KeyType & key, KeyTypeKeyCompare comp) const;
                            + const_iterator find(const KeyType & key, KeyTypeKeyCompare comp) const;

                            Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk), and nk the key_type of a value_type inserted into *this.

                            Effects: Finds an iterator to the first element whose key is k or end() if that element does not exist.

                            Complexity: Logarithmic.

                            Throws: If comp throws.

                          63. -
                            std::pair< iterator, iterator > equal_range(const key_type & key);
                            +
                            std::pair< iterator, iterator > equal_range(const key_type & key);

                            Effects: Finds a range containing all elements whose key is k or an empty range that indicates the position where those elements would be if they there is no elements with key k.

                            Complexity: Logarithmic.

                            Throws: If key_compare throws.

                            @@ -742,7 +742,7 @@ 
                          64. template<typename KeyType, typename KeyTypeKeyCompare> 
   std::pair< iterator, iterator > 
-  equal_range(const KeyType & key, KeyTypeKeyCompare comp);
                            + equal_range(const KeyType & key, KeyTypeKeyCompare comp);

                            Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk), with nk the key_type of a value_type inserted into *this.

                            Effects: Finds a range containing all elements whose key is k or an empty range that indicates the position where those elements would be if they there is no elements with key k.

                            Complexity: Logarithmic.

                            @@ -750,7 +750,7 @@ 
                          65. std::pair< const_iterator, const_iterator > 
-equal_range(const key_type & key) const;
                            +equal_range(const key_type & key) const;

                            Effects: Finds a range containing all elements whose key is k or an empty range that indicates the position where those elements would be if they there is no elements with key k.

                            Complexity: Logarithmic.

                            Throws: If key_compare throws.

                            @@ -758,7 +758,7 @@ 
                          66. template<typename KeyType, typename KeyTypeKeyCompare> 
   std::pair< const_iterator, const_iterator > 
-  equal_range(const KeyType & key, KeyTypeKeyCompare comp) const;
                            + equal_range(const KeyType & key, KeyTypeKeyCompare comp) const;

                            Requires: key is a value such that *this is partitioned with respect to comp(nk, key) and !comp(key, nk), with comp(nk, key) implying !comp(key, nk), with nk the key_type of a value_type inserted into *this.

                            Effects: Finds a range containing all elements whose key is k or an empty range that indicates the position where those elements would be if they there is no elements with key k.

                            Complexity: Logarithmic.

                            @@ -766,7 +766,7 @@ 
                          67. std::pair< iterator, iterator > 
-bounded_range(const key_type & lower_key, const key_type & upper_key, 
+bounded_range(const key_type & lower_key, const key_type & upper_key, 
               bool left_closed, bool right_closed);

                            Requires: upper_key shall not precede lower_key according to key_compare. [key_comp()(upper_key, lower_key) shall be false]

                            If lower_key is equivalent to upper_key [!key_comp()(upper_key, lower_key) && !key_comp()(lower_key, upper_key)] then ('left_closed' || 'right_closed') must be false.

                            @@ -781,7 +781,7 @@ 
                          68. template<typename KeyType, typename KeyTypeKeyCompare> 
   std::pair< iterator, iterator > 
-  bounded_range(const KeyType & lower_key, const KeyType & upper_key, 
+  bounded_range(const KeyType & lower_key, const KeyType & upper_key, 
                 KeyTypeKeyCompare comp, bool left_closed, bool right_closed);

                            Requires: lower_key is a value such that *this is partitioned with respect to comp(nk, lower_key) if left_closed is true, with respect to !comp(lower_key, nk) otherwise.

                            upper_key is a value such that *this is partitioned with respect to !comp(upper_key, nk) if right_closed is true, with respect to comp(nk, upper_key) otherwise.

                            @@ -797,7 +797,7 @@ 
                          69. std::pair< const_iterator, const_iterator > 
-bounded_range(const key_type & lower_key, const key_type & upper_key, 
+bounded_range(const key_type & lower_key, const key_type & upper_key, 
               bool left_closed, bool right_closed) const;

                            Requires: upper_key shall not precede lower_key according to key_compare. [key_comp()(upper_key, lower_key) shall be false]

                            If lower_key is equivalent to upper_key [!key_comp()(upper_key, lower_key) && !key_comp()(lower_key, upper_key)] then ('left_closed' || 'right_closed') must be false.

                            @@ -812,7 +812,7 @@ 
                          70. template<typename KeyType, typename KeyTypeKeyCompare> 
   std::pair< const_iterator, const_iterator > 
-  bounded_range(const KeyType & lower_key, const KeyType & upper_key, 
+  bounded_range(const KeyType & lower_key, const KeyType & upper_key, 
                 KeyTypeKeyCompare comp, bool left_closed, bool right_closed) const;

                            Requires: lower_key is a value such that *this is partitioned with respect to comp(nk, lower_key) if left_closed is true, with respect to !comp(lower_key, nk) otherwise.

                            upper_key is a value such that *this is partitioned with respect to !comp(upper_key, nk) if right_closed is true, with respect to comp(nk, upper_key) otherwise.

                            @@ -827,28 +827,28 @@

                            Note: Experimental function, the interface might change in future releases.

                          71. -
                            iterator iterator_to(reference value);
                            +
                            iterator iterator_to(reference value);

                            Requires: value must be an lvalue and shall be in a set of appropriate type. Otherwise the behavior is undefined.

                            Effects: Returns: a valid iterator i belonging to the set that points to the value

                            Complexity: Constant.

                            Throws: Nothing.

                          72. -
                            const_iterator iterator_to(const_reference value) const;
                            +
                            const_iterator iterator_to(const_reference value) const;

                            Requires: value must be an lvalue and shall be in a set of appropriate type. Otherwise the behavior is undefined.

                            Effects: Returns: a valid const_iterator i belonging to the set that points to the value

                            Complexity: Constant.

                            Throws: Nothing.

                          73. -
                            pointer unlink_leftmost_without_rebalance();
                            +
                            pointer unlink_leftmost_without_rebalance();

                            Effects: Unlinks the leftmost node from the container.

                            Complexity: Average complexity is constant time.

                            Throws: Nothing.

                            Notes: This function breaks the container and the container can only be used for more unlink_leftmost_without_rebalance calls. This function is normally used to achieve a step by step controlled destruction of the container.

                          74. -
                            void replace_node(iterator replace_this, reference with_this);
                            +
                            void replace_node(iterator replace_this, reference with_this);

                            Requires: replace_this must be a valid iterator of *this and with_this must not be inserted in any container.

                            Effects: Replaces replace_this in its position in the container with with_this. The container does not need to be rebalanced.

                            Complexity: Constant.

                            @@ -856,7 +856,7 @@

                            Note: This function will break container ordering invariants if with_this is not equivalent to *replace_this according to the ordering rules. This function is faster than erasing and inserting the node, since no rebalancing or comparison is needed.

                          75. -
                            void remove_node(reference value);
                            +
                            void remove_node(reference value);

                            Effects: removes "value" from the container.

                            Throws: Nothing.

                            Complexity: Logarithmic time.

                            @@ -864,7 +864,7 @@

                            If the user calls this function with a constant time size container or stateful comparison functor a compilation error will be issued.

                          76. -
                            template<class... Options2> void merge(treap_set< T, Options2...> & source);
                            +
                            template<class... Options2> void merge(treap_set< T, Options2...> & source);

                            Requires: "source" container's Options can only can differ in the comparison function from *this.

                            Effects: Attempts to extract each element in source and insert it into a using the comparison object of *this. If there is an element in a with key equivalent to the key of an element from source, then that element is not extracted from source.

                            Postcondition: Pointers and references to the transferred elements of source refer to those same elements but as members of *this. Iterators referring to the transferred elements will continue to refer to their elements, but they now behave as iterators into *this, not into source.

                            @@ -873,7 +873,7 @@ 
                          77. template<class... Options2> 
-  void merge(treap_multiset< T, Options2...> & source);
                            + void merge(treap_multiset< T, Options2...> & source);

                            Requires: "source" container's Options can only can differ in the comparison function from *this.

                            Effects: Attempts to extract each element in source and insert it into a using the comparison object of *this. If there is an element in a with key equivalent to the key of an element from source, then that element is not extracted from source.

                            Postcondition: Pointers and references to the transferred elements of source refer to those same elements but as members of *this. Iterators referring to the transferred elements will continue to refer to their elements, but they now behave as iterators into *this, not into source.

                            @@ -884,10 +884,10 @@

                          -treap_set public static functions

                          +treap_set public static functions
                          1. -
                            static treap_set & container_from_end_iterator(iterator end_iterator);
                            +
                            static treap_set & container_from_end_iterator(iterator end_iterator);

                            Precondition: end_iterator must be a valid end iterator of the container.

                            Effects: Returns a const reference to the container associated to the end iterator

                            Throws: Nothing.

                            @@ -895,28 +895,28 @@ 
                          2. static const treap_set & 
-container_from_end_iterator(const_iterator end_iterator);
                            +container_from_end_iterator(const_iterator end_iterator);

                            Precondition: end_iterator must be a valid end iterator of the container.

                            Effects: Returns a const reference to the container associated to the end iterator

                            Throws: Nothing.

                            Complexity: Constant.

                          3. -
                            static treap_set & container_from_iterator(iterator it);
                            +
                            static treap_set & container_from_iterator(iterator it);

                            Precondition: it must be a valid iterator of the container.

                            Effects: Returns a const reference to the container associated to the iterator

                            Throws: Nothing.

                            Complexity: Logarithmic.

                          4. -
                            static const treap_set & container_from_iterator(const_iterator it);
                            +
                            static const treap_set & container_from_iterator(const_iterator it);

                            Precondition: it must be a valid iterator of the container.

                            Effects: Returns a const reference to the container associated to the iterator

                            Throws: Nothing.

                            Complexity: Logarithmic.

                          5. -
                            static iterator s_iterator_to(reference value);
                            +
                            static iterator s_iterator_to(reference value);

                            Requires: value must be an lvalue and shall be in a set of appropriate type. Otherwise the behavior is undefined.

                            Effects: Returns: a valid iterator i belonging to the set that points to the value

                            Complexity: Constant.

                            @@ -924,7 +924,7 @@

                            Note: This static function is available only if the value traits is stateless.

                          6. -
                            static const_iterator s_iterator_to(const_reference value);
                            +
                            static const_iterator s_iterator_to(const_reference value);

                            Requires: value must be an lvalue and shall be in a set of appropriate type. Otherwise the behavior is undefined.

                            Effects: Returns: a valid iterator i belonging to the set that points to the value

                            Complexity: Constant.

                            @@ -932,7 +932,7 @@

                            Note: This static function is available only if the value traits is stateless.

                          7. -
                            static void init_node(reference value);
                            +
                            static void init_node(reference value);

                            Requires: value shall not be in a container.

                            Effects: init_node puts the hook of a value in a well-known default state.

                            Throws: Nothing.

                            diff --git a/doc/html/boost/intrusive/trivial_value_traits.html b/doc/html/boost/intrusive/trivial_value_traits.html index b641e4442d..3978117562 100644 --- a/doc/html/boost/intrusive/trivial_value_traits.html +++ b/doc/html/boost/intrusive/trivial_value_traits.html @@ -42,11 +42,11 @@ typedef node_ptr pointer; typedef const_node_ptr const_pointer; - // public static functions - static node_ptr to_node_ptr(value_type &); - static const_node_ptr to_node_ptr(const value_type &); - static const pointer & to_value_ptr(const node_ptr &); - static const const_pointer & to_value_ptr(const const_node_ptr &); + // public static functions + static node_ptr to_node_ptr(value_type &); + static const_node_ptr to_node_ptr(const value_type &); + static const pointer & to_value_ptr(const node_ptr &); + static const const_pointer & to_value_ptr(const const_node_ptr &); // public data members static const link_mode_type link_mode; @@ -56,12 +56,12 @@

                            This value traits template is used to create value traits from user defined node traits where value_traits::value_type and node_traits::node should be equal

                            -trivial_value_traits public static functions

                            +trivial_value_traits public static functions
                              -
                            1. static node_ptr to_node_ptr(value_type & value);
                              2. -
                            2. static const_node_ptr to_node_ptr(const value_type & value);
                              3. -
                            3. static const pointer & to_value_ptr(const node_ptr & n);
                              4. -
                            4. static const const_pointer & to_value_ptr(const const_node_ptr & n);
                              5. +
                            5. static node_ptr to_node_ptr(value_type & value);
                              6. +
                            6. static const_node_ptr to_node_ptr(const value_type & value);
                              7. +
                            7. static const pointer & to_value_ptr(const node_ptr & n);
                              8. +
                            8. static const const_pointer & to_value_ptr(const const_node_ptr & n);
                          diff --git a/doc/html/boost/intrusive/unordered_multiset.html b/doc/html/boost/intrusive/unordered_multiset.html index 8c57894697..55485c6346 100644 --- a/doc/html/boost/intrusive/unordered_multiset.html +++ b/doc/html/boost/intrusive/unordered_multiset.html @@ -63,98 +63,98 @@ typedef implementation_defined::node_algorithms node_algorithms; // construct/copy/destruct - explicit unordered_multiset(const bucket_traits &, + explicit unordered_multiset(const bucket_traits &, const hasher & = hasher(), const key_equal & = key_equal(), const value_traits & = value_traits()); template<typename Iterator> - unordered_multiset(Iterator, Iterator, const bucket_traits &, + unordered_multiset(Iterator, Iterator, const bucket_traits &, const hasher & = hasher(), const key_equal & = key_equal(), const value_traits & = value_traits()); - unordered_multiset(unordered_multiset &&); - unordered_multiset & operator=(unordered_multiset &&); - ~unordered_multiset(); + unordered_multiset(unordered_multiset &&); + unordered_multiset & operator=(unordered_multiset &&); + ~unordered_multiset(); - // public member functions - iterator begin(); - const_iterator begin() const; - const_iterator cbegin() const; - iterator end(); - const_iterator end() const; - const_iterator cend() const; - hasher hash_function() const; - key_equal key_eq() const; - bool empty() const; - size_type size() const; - void swap(unordered_multiset &); + // public member functions + iterator begin(); + const_iterator begin() const; + const_iterator cbegin() const; + iterator end(); + const_iterator end() const; + const_iterator cend() const; + hasher hash_function() const; + key_equal key_eq() const; + bool empty() const; + size_type size() const; + void swap(unordered_multiset &); template<typename Cloner, typename Disposer> - void clone_from(const unordered_multiset &, Cloner, Disposer); + void clone_from(const unordered_multiset &, Cloner, Disposer); template<typename Cloner, typename Disposer> - void clone_from(unordered_multiset &&, Cloner, Disposer); - iterator insert(reference); - template<typename Iterator> void insert(Iterator, Iterator); - void erase(const_iterator); - void erase(const_iterator, const_iterator); - size_type erase(const key_type &); + void clone_from(unordered_multiset &&, Cloner, Disposer); + iterator insert(reference); + template<typename Iterator> void insert(Iterator, Iterator); + void erase(const_iterator); + void erase(const_iterator, const_iterator); + size_type erase(const key_type &); template<typename KeyType, typename KeyHasher, typename KeyEqual> - size_type erase(const KeyType &, KeyHasher, KeyEqual); - template<typename Disposer> void erase_and_dispose(const_iterator, Disposer); + size_type erase(const KeyType &, KeyHasher, KeyEqual); + template<typename Disposer> void erase_and_dispose(const_iterator, Disposer); template<typename Disposer> - void erase_and_dispose(const_iterator, const_iterator, Disposer); + void erase_and_dispose(const_iterator, const_iterator, Disposer); template<typename Disposer> - size_type erase_and_dispose(const key_type &, Disposer); + size_type erase_and_dispose(const key_type &, Disposer); template<typename KeyType, typename KeyHasher, typename KeyEqual, typename Disposer> - size_type erase_and_dispose(const KeyType &, KeyHasher, KeyEqual, + size_type erase_and_dispose(const KeyType &, KeyHasher, KeyEqual, Disposer); - void clear(); - template<typename Disposer> void clear_and_dispose(Disposer); - size_type count(const key_type &) const; + void clear(); + template<typename Disposer> void clear_and_dispose(Disposer); + size_type count(const key_type &) const; template<typename KeyType, typename KeyHasher, typename KeyEqual> - size_type count(const KeyType &, KeyHasher, KeyEqual) const; - iterator find(const key_type &); + size_type count(const KeyType &, KeyHasher, KeyEqual) const; + iterator find(const key_type &); template<typename KeyType, typename KeyHasher, typename KeyEqual> - iterator find(const KeyType &, KeyHasher, KeyEqual); - const_iterator find(const key_type &) const; + iterator find(const KeyType &, KeyHasher, KeyEqual); + const_iterator find(const key_type &) const; template<typename KeyType, typename KeyHasher, typename KeyEqual> - const_iterator find(const KeyType &, KeyHasher, KeyEqual) const; - std::pair< iterator, iterator > equal_range(const key_type &); + const_iterator find(const KeyType &, KeyHasher, KeyEqual) const; + std::pair< iterator, iterator > equal_range(const key_type &); template<typename KeyType, typename KeyHasher, typename KeyEqual> std::pair< iterator, iterator > - equal_range(const KeyType &, KeyHasher, KeyEqual); + equal_range(const KeyType &, KeyHasher, KeyEqual); std::pair< const_iterator, const_iterator > - equal_range(const key_type &) const; + equal_range(const key_type &) const; template<typename KeyType, typename KeyHasher, typename KeyEqual> std::pair< const_iterator, const_iterator > - equal_range(const KeyType &, KeyHasher, KeyEqual) const; - iterator iterator_to(reference); - const_iterator iterator_to(const_reference) const; - local_iterator local_iterator_to(reference); - const_local_iterator local_iterator_to(const_reference) const; - size_type bucket_count() const; - size_type bucket_size(size_type) const; - size_type bucket(const key_type &) const; + equal_range(const KeyType &, KeyHasher, KeyEqual) const; + iterator iterator_to(reference); + const_iterator iterator_to(const_reference) const; + local_iterator local_iterator_to(reference); + const_local_iterator local_iterator_to(const_reference) const; + size_type bucket_count() const; + size_type bucket_size(size_type) const; + size_type bucket(const key_type &) const; template<typename KeyType, typename KeyHasher> - size_type bucket(const KeyType &, KeyHasher) const; - bucket_ptr bucket_pointer() const; - local_iterator begin(size_type); - const_local_iterator begin(size_type) const; - const_local_iterator cbegin(size_type) const; - local_iterator end(size_type); - const_local_iterator end(size_type) const; - const_local_iterator cend(size_type) const; - void rehash(const bucket_traits &); - void full_rehash(); - bool incremental_rehash(bool = true); - bool incremental_rehash(const bucket_traits &); - size_type split_count() const; + size_type bucket(const KeyType &, KeyHasher) const; + bucket_ptr bucket_pointer() const; + local_iterator begin(size_type); + const_local_iterator begin(size_type) const; + const_local_iterator cbegin(size_type) const; + local_iterator end(size_type); + const_local_iterator end(size_type) const; + const_local_iterator cend(size_type) const; + void rehash(const bucket_traits &); + void full_rehash(); + bool incremental_rehash(bool = true); + bool incremental_rehash(const bucket_traits &); + size_type split_count() const; - // public static functions - static local_iterator s_local_iterator_to(reference); - static const_local_iterator s_local_iterator_to(const_reference); - static size_type suggested_upper_bucket_count(size_type); - static size_type suggested_lower_bucket_count(size_type); + // public static functions + static local_iterator s_local_iterator_to(reference); + static const_local_iterator s_local_iterator_to(const_reference); + static size_type suggested_upper_bucket_count(size_type); + static size_type suggested_lower_bucket_count(size_type); };

                          Description

                          @@ -173,7 +173,7 @@ construct/copy/destruct
                          1. -
                            explicit unordered_multiset(const bucket_traits & b_traits, 
+
                            explicit unordered_multiset(const bucket_traits & b_traits, 
                             const hasher & hash_func = hasher(), 
                             const key_equal & equal_func = key_equal(), 
                             const value_traits & v_traits = value_traits());
                            
@@ -185,7 +185,7 @@
 
                          2. template<typename Iterator> 
-  unordered_multiset(Iterator b, Iterator e, const bucket_traits & b_traits, 
+  unordered_multiset(Iterator b, Iterator e, const bucket_traits & b_traits, 
                      const hasher & hash_func = hasher(), 
                      const key_equal & equal_func = key_equal(), 
                      const value_traits & v_traits = value_traits());
                            @@ -196,15 +196,15 @@

                            Notes: buckets array must be disposed only after *this is disposed.

                          3. -
                            unordered_multiset(unordered_multiset && x);
                            +
                            unordered_multiset(unordered_multiset && x);

                            Effects: to-do

                          4. -
                            unordered_multiset & operator=(unordered_multiset && x);
                            +
                            unordered_multiset & operator=(unordered_multiset && x);

                            Effects: to-do

                          5. -
                            ~unordered_multiset();
                            +
                            ~unordered_multiset();

                            Effects: Detaches all elements from this. The objects in the unordered_set are not deleted (i.e. no destructors are called).

                            Complexity: Linear to the number of elements in the unordered_set, if it's a safe-mode or auto-unlink value. Otherwise constant.

                            Throws: Nothing.

                            @@ -213,70 +213,70 @@

                          -unordered_multiset public member functions

                          +unordered_multiset public member functions
                          1. -
                            iterator begin();
                            +
                            iterator begin();

                            Effects: Returns an iterator pointing to the beginning of the unordered_set.

                            Complexity: Amortized constant time. Worst case (empty unordered_set): O(this->bucket_count())

                            Throws: Nothing.

                          2. -
                            const_iterator begin() const;
                            +
                            const_iterator begin() const;

                            Effects: Returns a const_iterator pointing to the beginning of the unordered_set.

                            Complexity: Amortized constant time. Worst case (empty unordered_set): O(this->bucket_count())

                            Throws: Nothing.

                          3. -
                            const_iterator cbegin() const;
                            +
                            const_iterator cbegin() const;

                            Effects: Returns a const_iterator pointing to the beginning of the unordered_set.

                            Complexity: Amortized constant time. Worst case (empty unordered_set): O(this->bucket_count())

                            Throws: Nothing.

                          4. -
                            iterator end();
                            +
                            iterator end();

                            Effects: Returns an iterator pointing to the end of the unordered_set.

                            Complexity: Constant.

                            Throws: Nothing.

                          5. -
                            const_iterator end() const;
                            +
                            const_iterator end() const;

                            Effects: Returns a const_iterator pointing to the end of the unordered_set.

                            Complexity: Constant.

                            Throws: Nothing.

                          6. -
                            const_iterator cend() const;
                            +
                            const_iterator cend() const;

                            Effects: Returns a const_iterator pointing to the end of the unordered_set.

                            Complexity: Constant.

                            Throws: Nothing.

                          7. -
                            hasher hash_function() const;
                            +
                            hasher hash_function() const;

                            Effects: Returns the hasher object used by the unordered_set.

                            Complexity: Constant.

                            Throws: If hasher copy-constructor throws.

                          8. -
                            key_equal key_eq() const;
                            +
                            key_equal key_eq() const;

                            Effects: Returns the key_equal object used by the unordered_set.

                            Complexity: Constant.

                            Throws: If key_equal copy-constructor throws.

                          9. -
                            bool empty() const;
                            +
                            bool empty() const;

                            Effects: Returns true if the container is empty.

                            Complexity: if constant-time size and cache_begin options are disabled, average constant time (worst case, with empty() == true: O(this->bucket_count()). Otherwise constant.

                            Throws: Nothing.

                          10. -
                            size_type size() const;
                            +
                            size_type size() const;

                            Effects: Returns the number of elements stored in the unordered_set.

                            Complexity: Linear to elements contained in *this if constant_time_size is false. Constant-time otherwise.

                            Throws: Nothing.

                          11. -
                            void swap(unordered_multiset & other);
                            +
                            void swap(unordered_multiset & other);

                            Requires: buckets must not be being used by any other resource.

                            Effects: Constructs an empty unordered_set, storing a reference to the bucket array and copies of the key_hasher and equal_func functors.

                            Complexity: Constant.

                            @@ -285,7 +285,7 @@ 
                          12. template<typename Cloner, typename Disposer> 
-  void clone_from(const unordered_multiset & src, Cloner cloner, 
+  void clone_from(const unordered_multiset & src, Cloner cloner, 
                   Disposer disposer);

                            Requires: Disposer::operator()(pointer) shouldn't throw Cloner should yield to nodes that compare equal and produce the same hash than the original node.

                            Effects: Erases all the elements from *this calling Disposer::operator()(pointer), clones all the elements from src calling Cloner::operator()(const_reference ) and inserts them on *this. The hash function and the equality predicate are copied from the source.

                            @@ -296,7 +296,7 @@ 
                          13. template<typename Cloner, typename Disposer> 
-  void clone_from(unordered_multiset && src, Cloner cloner, Disposer disposer);
                            + void clone_from(unordered_multiset && src, Cloner cloner, Disposer disposer);

                            Requires: Disposer::operator()(pointer) shouldn't throw Cloner should yield to nodes that compare equal and produce the same hash than the original node.

                            Effects: Erases all the elements from *this calling Disposer::operator()(pointer), clones all the elements from src calling Cloner::operator()(reference) and inserts them on *this. The hash function and the equality predicate are copied from the source.

                            If store_hash option is true, this method does not use the hash function.

                            @@ -305,7 +305,7 @@

                            Throws: If cloner or hasher throw or hash or equality predicate copying throws. Basic guarantee.

                          14. -
                            iterator insert(reference value);
                            +
                            iterator insert(reference value);

                            Requires: value must be an lvalue

                            Effects: Inserts the value into the unordered_set.

                            Returns: An iterator to the inserted value.

                            @@ -314,7 +314,7 @@

                            Note: Does not affect the validity of iterators and references. No copy-constructors are called.

                          15. -
                            template<typename Iterator> void insert(Iterator b, Iterator e);
                            +
                            template<typename Iterator> void insert(Iterator b, Iterator e);

                            Requires: Dereferencing iterator must yield an lvalue of type value_type.

                            Effects: Equivalent to this->insert_equal(t) for each element in [b, e).

                            Complexity: Average case O(N), where N is distance(b, e). Worst case O(N*this->size()).

                            @@ -322,21 +322,21 @@

                            Note: Does not affect the validity of iterators and references. No copy-constructors are called.

                          16. -
                            void erase(const_iterator i);
                            +
                            void erase(const_iterator i);

                            Effects: Erases the element pointed to by i.

                            Complexity: Average case O(1), worst case O(this->size()).

                            Throws: Nothing.

                            Note: Invalidates the iterators (but not the references) to the erased element. No destructors are called.

                          17. -
                            void erase(const_iterator b, const_iterator e);
                            +
                            void erase(const_iterator b, const_iterator e);

                            Effects: Erases the range pointed to by b end e.

                            Complexity: Average case O(distance(b, e)), worst case O(this->size()).

                            Throws: Nothing.

                            Note: Invalidates the iterators (but not the references) to the erased elements. No destructors are called.

                          18. -
                            size_type erase(const key_type & key);
                            +
                            size_type erase(const key_type & key);

                            Effects: Erases all the elements with the given value.

                            Returns: The number of erased elements.

                            Complexity: Average case O(this->count(value)). Worst case O(this->size()).

                            @@ -345,7 +345,7 @@ 
                          19. template<typename KeyType, typename KeyHasher, typename KeyEqual> 
-  size_type erase(const KeyType & key, KeyHasher hash_func, 
+  size_type erase(const KeyType & key, KeyHasher hash_func, 
                   KeyEqual equal_func);

                            Requires: "hash_func" must be a hash function that induces the same hash values as the stored hasher. The difference is that "hash_func" hashes the given key instead of the value_type.

                            "equal_func" must be a equality function that induces the same equality as key_equal. The difference is that "equal_func" compares an arbitrary key with the contained values.

                            @@ -357,7 +357,7 @@ 
                          20. template<typename Disposer> 
-  void erase_and_dispose(const_iterator i, Disposer disposer);
                            + void erase_and_dispose(const_iterator i, Disposer disposer);

                            Requires: Disposer::operator()(pointer) shouldn't throw.

                            Effects: Erases the element pointed to by i. Disposer::operator()(pointer) is called for the removed element.

                            Complexity: Average case O(1), worst case O(this->size()).

                            @@ -366,7 +366,7 @@ 
                          21. template<typename Disposer> 
-  void erase_and_dispose(const_iterator b, const_iterator e, 
+  void erase_and_dispose(const_iterator b, const_iterator e, 
                          Disposer disposer);

                            Requires: Disposer::operator()(pointer) shouldn't throw.

                            Effects: Erases the range pointed to by b end e. Disposer::operator()(pointer) is called for the removed elements.

                            @@ -376,7 +376,7 @@ 
                          22. template<typename Disposer> 
-  size_type erase_and_dispose(const key_type & key, Disposer disposer);
                            + size_type erase_and_dispose(const key_type & key, Disposer disposer);

                            Requires: Disposer::operator()(pointer) shouldn't throw.

                            Effects: Erases all the elements with the given value. Disposer::operator()(pointer) is called for the removed elements.

                            Returns: The number of erased elements.

                            @@ -387,7 +387,7 @@ 
                          23. template<typename KeyType, typename KeyHasher, typename KeyEqual, 
          typename Disposer> 
-  size_type erase_and_dispose(const KeyType & key, KeyHasher hash_func, 
+  size_type erase_and_dispose(const KeyType & key, KeyHasher hash_func, 
                               KeyEqual equal_func, Disposer disposer);

                            Requires: Disposer::operator()(pointer) shouldn't throw.

                            Effects: Erases all the elements with the given key. according to the comparison functor "equal_func". Disposer::operator()(pointer) is called for the removed elements.

                            @@ -397,14 +397,14 @@

                            Note: Invalidates the iterators to the erased elements.

                          24. -
                            void clear();
                            +
                            void clear();

                            Effects: Erases all of the elements.

                            Complexity: Linear to the number of elements on the container. if it's a safe-mode or auto-unlink value_type. Constant time otherwise.

                            Throws: Nothing.

                            Note: Invalidates the iterators (but not the references) to the erased elements. No destructors are called.

                          25. -
                            template<typename Disposer> void clear_and_dispose(Disposer disposer);
                            +
                            template<typename Disposer> void clear_and_dispose(Disposer disposer);

                            Requires: Disposer::operator()(pointer) shouldn't throw.

                            Effects: Erases all of the elements.

                            Complexity: Linear to the number of elements on the container. Disposer::operator()(pointer) is called for the removed elements.

                            @@ -412,14 +412,14 @@

                            Note: Invalidates the iterators (but not the references) to the erased elements. No destructors are called.

                          26. -
                            size_type count(const key_type & key) const;
                            +
                            size_type count(const key_type & key) const;

                            Effects: Returns the number of contained elements with the given value

                            Complexity: Average case O(1), worst case O(this->size()).

                            Throws: If the internal hasher or the equality functor throws. 

                          27. template<typename KeyType, typename KeyHasher, typename KeyEqual> 
-  size_type count(const KeyType & key, KeyHasher hash_func, 
+  size_type count(const KeyType & key, KeyHasher hash_func, 
                   KeyEqual equal_func) const;

                            Requires: "hash_func" must be a hash function that induces the same hash values as the stored hasher. The difference is that "hash_func" hashes the given key instead of the value_type.

                            "equal_func" must be a equality function that induces the same equality as key_equal. The difference is that "equal_func" compares an arbitrary key with the contained values.

                            @@ -428,14 +428,14 @@

                            Throws: If hash_func or equal throw.

                          28. -
                            iterator find(const key_type & key);
                            +
                            iterator find(const key_type & key);

                            Effects: Finds an iterator to the first element is equal to "value" or end() if that element does not exist.

                            Complexity: Average case O(1), worst case O(this->size()).

                            Throws: If the internal hasher or the equality functor throws. 

                          29. template<typename KeyType, typename KeyHasher, typename KeyEqual> 
-  iterator find(const KeyType & key, KeyHasher hash_func, KeyEqual equal_func);
                            + iterator find(const KeyType & key, KeyHasher hash_func, KeyEqual equal_func);

                            Requires: "hash_func" must be a hash function that induces the same hash values as the stored hasher. The difference is that "hash_func" hashes the given key instead of the value_type.

                            "equal_func" must be a equality function that induces the same equality as key_equal. The difference is that "equal_func" compares an arbitrary key with the contained values.

                            Effects: Finds an iterator to the first element whose key is "key" according to the given hash and equality functor or end() if that element does not exist.

                            @@ -444,7 +444,7 @@

                            Note: This function is used when constructing a value_type is expensive and the value_type can be compared with a cheaper key type. Usually this key is part of the value_type.

                          30. -
                            const_iterator find(const key_type & key) const;
                            +
                            const_iterator find(const key_type & key) const;

                            Effects: Returns the number of contained elements with the given value

                            Complexity: Average case O(1), worst case O(this->size()).

                            Throws: If the internal hasher or the equality functor throws.

                            @@ -452,7 +452,7 @@ 
                          31. template<typename KeyType, typename KeyHasher, typename KeyEqual> 
   const_iterator 
-  find(const KeyType & key, KeyHasher hash_func, KeyEqual equal_func) const;
                            + find(const KeyType & key, KeyHasher hash_func, KeyEqual equal_func) const;

                            Requires: "hash_func" must be a hash function that induces the same hash values as the stored hasher. The difference is that "hash_func" hashes the given key instead of the value_type.

                            "equal_func" must be a equality function that induces the same equality as key_equal. The difference is that "equal_func" compares an arbitrary key with the contained values.

                            Effects: Finds an iterator to the first element whose key is "key" according to the given hasher and equality functor or end() if that element does not exist.

                            @@ -461,7 +461,7 @@

                            Note: This function is used when constructing a value_type is expensive and the value_type can be compared with a cheaper key type. Usually this key is part of the value_type.

                          32. -
                            std::pair< iterator, iterator > equal_range(const key_type & key);
                            +
                            std::pair< iterator, iterator > equal_range(const key_type & key);

                            Effects: Returns a range containing all elements with values equivalent to value. Returns std::make_pair(this->end(), this->end()) if no such elements exist.

                            Complexity: Average case O(this->count(value)). Worst case O(this->size()).

                            Throws: If the internal hasher or the equality functor throws.

                            @@ -469,7 +469,7 @@ 
                          33. template<typename KeyType, typename KeyHasher, typename KeyEqual> 
   std::pair< iterator, iterator > 
-  equal_range(const KeyType & key, KeyHasher hash_func, KeyEqual equal_func);
                            + equal_range(const KeyType & key, KeyHasher hash_func, KeyEqual equal_func);

                            Requires: "hash_func" must be a hash function that induces the same hash values as the stored hasher. The difference is that "hash_func" hashes the given key instead of the value_type.

                            "equal_func" must be a equality function that induces the same equality as key_equal. The difference is that "equal_func" compares an arbitrary key with the contained values.

                            Effects: Returns a range containing all elements with equivalent keys. Returns std::make_pair(this->end(), this->end()) if no such elements exist.

                            @@ -479,7 +479,7 @@ 
                          34. std::pair< const_iterator, const_iterator > 
-equal_range(const key_type & key) const;
                            +equal_range(const key_type & key) const;

                            Effects: Returns a range containing all elements with values equivalent to value. Returns std::make_pair(this->end(), this->end()) if no such elements exist.

                            Complexity: Average case O(this->count(value)). Worst case O(this->size()).

                            Throws: If the internal hasher or the equality functor throws.

                            @@ -487,7 +487,7 @@ 
                          35. template<typename KeyType, typename KeyHasher, typename KeyEqual> 
   std::pair< const_iterator, const_iterator > 
-  equal_range(const KeyType & key, KeyHasher hash_func, KeyEqual equal_func) const;
                            + equal_range(const KeyType & key, KeyHasher hash_func, KeyEqual equal_func) const;

                            Requires: "hash_func" must be a hash function that induces the same hash values as the stored hasher. The difference is that "hash_func" hashes the given key instead of the value_type.

                            "equal_func" must be a equality function that induces the same equality as key_equal. The difference is that "equal_func" compares an arbitrary key with the contained values.

                            Effects: Returns a range containing all elements with equivalent keys. Returns std::make_pair(this->end(), this->end()) if no such elements exist.

                            @@ -496,48 +496,48 @@

                            Note: This function is used when constructing a value_type is expensive and the value_type can be compared with a cheaper key type. Usually this key is part of the value_type.

                          36. -
                            iterator iterator_to(reference value);
                            +
                            iterator iterator_to(reference value);

                            Requires: value must be an lvalue and shall be in a unordered_set of appropriate type. Otherwise the behavior is undefined.

                            Effects: Returns: a valid iterator belonging to the unordered_set that points to the value

                            Complexity: Constant.

                            Throws: If the internal hash function throws.

                          37. -
                            const_iterator iterator_to(const_reference value) const;
                            +
                            const_iterator iterator_to(const_reference value) const;

                            Requires: value must be an lvalue and shall be in a unordered_set of appropriate type. Otherwise the behavior is undefined.

                            Effects: Returns: a valid const_iterator belonging to the unordered_set that points to the value

                            Complexity: Constant.

                            Throws: If the internal hash function throws.

                          38. -
                            local_iterator local_iterator_to(reference value);
                            +
                            local_iterator local_iterator_to(reference value);

                            Requires: value must be an lvalue and shall be in a unordered_set of appropriate type. Otherwise the behavior is undefined.

                            Effects: Returns: a valid local_iterator belonging to the unordered_set that points to the value

                            Complexity: Constant.

                            Throws: Nothing.

                          39. -
                            const_local_iterator local_iterator_to(const_reference value) const;
                            +
                            const_local_iterator local_iterator_to(const_reference value) const;

                            Requires: value must be an lvalue and shall be in a unordered_set of appropriate type. Otherwise the behavior is undefined.

                            Effects: Returns: a valid local_iterator belonging to the unordered_set that points to the value

                            Complexity: Constant.

                            Throws: Nothing.

                          40. -
                            size_type bucket_count() const;
                            +
                            size_type bucket_count() const;

                            Effects: Returns the number of buckets passed in the constructor or the last rehash function.

                            Complexity: Constant.

                            Throws: Nothing.

                          41. -
                            size_type bucket_size(size_type n) const;
                            +
                            size_type bucket_size(size_type n) const;

                            Requires: n is in the range [0, this->bucket_count()).

                            Effects: Returns the number of elements in the nth bucket.

                            Complexity: Constant.

                            Throws: Nothing.

                          42. -
                            size_type bucket(const key_type & k) const;
                            +
                            size_type bucket(const key_type & k) const;

                            Effects: Returns the index of the bucket in which elements with keys equivalent to k would be found, if any such element existed.

                            Complexity: Constant.

                            Throws: If the hash functor throws.

                            @@ -545,7 +545,7 @@ 
                          43. template<typename KeyType, typename KeyHasher> 
-  size_type bucket(const KeyType & k, KeyHasher hash_func) const;
                            + size_type bucket(const KeyType & k, KeyHasher hash_func) const;

                            Requires: "hash_func" must be a hash function that induces the same hash values as the stored hasher. The difference is that "hash_func" hashes the given key instead of the value_type.

                            Effects: Returns the index of the bucket in which elements with keys equivalent to k would be found, if any such element existed.

                            Complexity: Constant.

                            @@ -553,13 +553,13 @@

                            Note: the return value is in the range [0, this->bucket_count()).

                          44. -
                            bucket_ptr bucket_pointer() const;
                            +
                            bucket_ptr bucket_pointer() const;

                            Effects: Returns the bucket array pointer passed in the constructor or the last rehash function.

                            Complexity: Constant.

                            Throws: Nothing.

                          45. -
                            local_iterator begin(size_type n);
                            +
                            local_iterator begin(size_type n);

                            Requires: n is in the range [0, this->bucket_count()).

                            Effects: Returns a local_iterator pointing to the beginning of the sequence stored in the bucket n.

                            Complexity: Constant.

                            @@ -567,7 +567,7 @@

                            Note: [this->begin(n), this->end(n)) is a valid range containing all of the elements in the nth bucket.

                          46. -
                            const_local_iterator begin(size_type n) const;
                            +
                            const_local_iterator begin(size_type n) const;

                            Requires: n is in the range [0, this->bucket_count()).

                            Effects: Returns a const_local_iterator pointing to the beginning of the sequence stored in the bucket n.

                            Complexity: Constant.

                            @@ -575,7 +575,7 @@

                            Note: [this->begin(n), this->end(n)) is a valid range containing all of the elements in the nth bucket.

                          47. -
                            const_local_iterator cbegin(size_type n) const;
                            +
                            const_local_iterator cbegin(size_type n) const;

                            Requires: n is in the range [0, this->bucket_count()).

                            Effects: Returns a const_local_iterator pointing to the beginning of the sequence stored in the bucket n.

                            Complexity: Constant.

                            @@ -583,7 +583,7 @@

                            Note: [this->begin(n), this->end(n)) is a valid range containing all of the elements in the nth bucket.

                          48. -
                            local_iterator end(size_type n);
                            +
                            local_iterator end(size_type n);

                            Requires: n is in the range [0, this->bucket_count()).

                            Effects: Returns a local_iterator pointing to the end of the sequence stored in the bucket n.

                            Complexity: Constant.

                            @@ -591,7 +591,7 @@

                            Note: [this->begin(n), this->end(n)) is a valid range containing all of the elements in the nth bucket.

                          49. -
                            const_local_iterator end(size_type n) const;
                            +
                            const_local_iterator end(size_type n) const;

                            Requires: n is in the range [0, this->bucket_count()).

                            Effects: Returns a const_local_iterator pointing to the end of the sequence stored in the bucket n.

                            Complexity: Constant.

                            @@ -599,7 +599,7 @@

                            Note: [this->begin(n), this->end(n)) is a valid range containing all of the elements in the nth bucket.

                          50. -
                            const_local_iterator cend(size_type n) const;
                            +
                            const_local_iterator cend(size_type n) const;

                            Requires: n is in the range [0, this->bucket_count()).

                            Effects: Returns a const_local_iterator pointing to the end of the sequence stored in the bucket n.

                            Complexity: Constant.

                            @@ -607,7 +607,7 @@

                            Note: [this->begin(n), this->end(n)) is a valid range containing all of the elements in the nth bucket.

                          51. -
                            void rehash(const bucket_traits & new_bucket_traits);
                            +
                            void rehash(const bucket_traits & new_bucket_traits);

                            Requires: new_bucket_traits can hold a pointer to a new bucket array or the same as the old bucket array with a different length. new_size is the length of the the array pointed by new_buckets. If new_bucket_traits.bucket_begin() == this->bucket_pointer() new_bucket_traits.bucket_count() can be bigger or smaller than this->bucket_count(). 'new_bucket_traits' copy constructor should not throw.

                            Effects: If new_bucket_traits.bucket_begin() == this->bucket_pointer() is false, unlinks values from the old bucket and inserts then in the new one according to the hash value of values.

                            If new_bucket_traits.bucket_begin() == this->bucket_pointer() is true, the implementations avoids moving values as much as possible.

                            @@ -618,7 +618,7 @@

                            Throws: If the hasher functor throws. Basic guarantee.

                          52. -
                            void full_rehash();
                            +
                            void full_rehash();

                            Note: This function is used when keys from inserted elements are changed (e.g. a language change when key is a string) but uniqueness and hash properties are preserved so a fast full rehash recovers invariants for *this without extracting and reinserting all elements again.

                            Requires: Calls produced to the hash function should not alter the value uniqueness properties of already inserted elements. If hasher(key1) == hasher(key2) was true when elements were inserted, it shall be true during calls produced in the execution of this function.

                            key_equal is not called inside this function so it is assumed that key_equal(value1, value2) should produce the same results as before for inserted elements.

                            @@ -628,7 +628,7 @@

                            Throws: If the hasher functor throws. Basic guarantee.

                          53. -
                            bool incremental_rehash(bool grow = true);
                            +
                            bool incremental_rehash(bool grow = true);

                            Requires:

                            Effects:

                            Complexity:

                            @@ -636,7 +636,7 @@

                            Note: this method is only available if incremental<true> option is activated.

                          54. -
                            bool incremental_rehash(const bucket_traits & new_bucket_traits);
                            +
                            bool incremental_rehash(const bucket_traits & new_bucket_traits);

                            Effects: If new_bucket_traits.bucket_count() is not this->bucket_count()/2 or this->bucket_count()*2, or this->split_bucket() != new_bucket_traits.bucket_count() returns false and does nothing.

                            Otherwise, copy assigns new_bucket_traits to the internal bucket_traits and transfers all the objects from old buckets to the new ones.

                            Complexity: Linear to size().

                            @@ -644,7 +644,7 @@

                            Note: this method is only available if incremental<true> option is activated.

                          55. -
                            size_type split_count() const;
                            +
                            size_type split_count() const;

                            Requires: incremental<> option must be set

                            Effects: returns the current split count

                            Complexity: Constant

                            @@ -654,10 +654,10 @@

                          -unordered_multiset public static functions

                          +unordered_multiset public static functions
                          1. -
                            static local_iterator s_local_iterator_to(reference value);
                            +
                            static local_iterator s_local_iterator_to(reference value);

                            Requires: value must be an lvalue and shall be in a unordered_set of appropriate type. Otherwise the behavior is undefined.

                            Effects: Returns: a valid local_iterator belonging to the unordered_set that points to the value

                            Complexity: Constant.

                            @@ -665,7 +665,7 @@

                            Note: This static function is available only if the value traits is stateless.

                          2. -
                            static const_local_iterator s_local_iterator_to(const_reference value);
                            +
                            static const_local_iterator s_local_iterator_to(const_reference value);

                            Requires: value must be an lvalue and shall be in a unordered_set of appropriate type. Otherwise the behavior is undefined.

                            Effects: Returns: a valid local_iterator belonging to the unordered_set that points to the value

                            Complexity: Constant.

                            @@ -673,13 +673,13 @@

                            Note: This static function is available only if the value traits is stateless.

                          3. -
                            static size_type suggested_upper_bucket_count(size_type n);
                            +
                            static size_type suggested_upper_bucket_count(size_type n);

                            Effects: Returns the nearest new bucket count optimized for the container that is bigger or equal than n. This suggestion can be used to create bucket arrays with a size that will usually improve container's performance. If such value does not exist, the higher possible value is returned.

                            Complexity: Amortized constant time.

                            Throws: Nothing.

                          4. -
                            static size_type suggested_lower_bucket_count(size_type n);
                            +
                            static size_type suggested_lower_bucket_count(size_type n);

                            Effects: Returns the nearest new bucket count optimized for the container that is smaller or equal than n. This suggestion can be used to create bucket arrays with a size that will usually improve container's performance. If such value does not exist, the lowest possible value is returned.

                            Complexity: Amortized constant time.

                            Throws: Nothing.

                            diff --git a/doc/html/boost/intrusive/unordered_set.html b/doc/html/boost/intrusive/unordered_set.html index 3ee84869a4..3d735e8b25 100644 --- a/doc/html/boost/intrusive/unordered_set.html +++ b/doc/html/boost/intrusive/unordered_set.html @@ -64,102 +64,102 @@ typedef implementation_defined::node_algorithms node_algorithms; // construct/copy/destruct - explicit unordered_set(const bucket_traits &, const hasher & = hasher(), + explicit unordered_set(const bucket_traits &, const hasher & = hasher(), const key_equal & = key_equal(), const value_traits & = value_traits()); template<typename Iterator> - unordered_set(Iterator, Iterator, const bucket_traits &, + unordered_set(Iterator, Iterator, const bucket_traits &, const hasher & = hasher(), const key_equal & = key_equal(), const value_traits & = value_traits()); - unordered_set(unordered_set &&); - unordered_set & operator=(unordered_set &&); - ~unordered_set(); + unordered_set(unordered_set &&); + unordered_set & operator=(unordered_set &&); + ~unordered_set(); - // public member functions - iterator begin(); - const_iterator begin() const; - const_iterator cbegin() const; - iterator end(); - const_iterator end() const; - const_iterator cend() const; - hasher hash_function() const; - key_equal key_eq() const; - bool empty() const; - size_type size() const; - void swap(unordered_set &); + // public member functions + iterator begin(); + const_iterator begin() const; + const_iterator cbegin() const; + iterator end(); + const_iterator end() const; + const_iterator cend() const; + hasher hash_function() const; + key_equal key_eq() const; + bool empty() const; + size_type size() const; + void swap(unordered_set &); template<typename Cloner, typename Disposer> - void clone_from(const unordered_set &, Cloner, Disposer); + void clone_from(const unordered_set &, Cloner, Disposer); template<typename Cloner, typename Disposer> - void clone_from(unordered_set &&, Cloner, Disposer); - std::pair< iterator, bool > insert(reference); - template<typename Iterator> void insert(Iterator, Iterator); + void clone_from(unordered_set &&, Cloner, Disposer); + std::pair< iterator, bool > insert(reference); + template<typename Iterator> void insert(Iterator, Iterator); std::pair< iterator, bool > - insert_check(const key_type &, insert_commit_data &); + insert_check(const key_type &, insert_commit_data &); template<typename KeyType, typename KeyHasher, typename KeyEqual> std::pair< iterator, bool > - insert_check(const KeyType &, KeyHasher, KeyEqual, insert_commit_data &); - iterator insert_commit(reference, const insert_commit_data &); - void erase(const_iterator); - void erase(const_iterator, const_iterator); - size_type erase(const key_type &); + insert_check(const KeyType &, KeyHasher, KeyEqual, insert_commit_data &); + iterator insert_commit(reference, const insert_commit_data &); + void erase(const_iterator); + void erase(const_iterator, const_iterator); + size_type erase(const key_type &); template<typename KeyType, typename KeyHasher, typename KeyEqual> - size_type erase(const KeyType &, KeyHasher, KeyEqual); - template<typename Disposer> void erase_and_dispose(const_iterator, Disposer); + size_type erase(const KeyType &, KeyHasher, KeyEqual); + template<typename Disposer> void erase_and_dispose(const_iterator, Disposer); template<typename Disposer> - void erase_and_dispose(const_iterator, const_iterator, Disposer); + void erase_and_dispose(const_iterator, const_iterator, Disposer); template<typename Disposer> - size_type erase_and_dispose(const key_type &, Disposer); + size_type erase_and_dispose(const key_type &, Disposer); template<typename KeyType, typename KeyHasher, typename KeyEqual, typename Disposer> - size_type erase_and_dispose(const KeyType &, KeyHasher, KeyEqual, + size_type erase_and_dispose(const KeyType &, KeyHasher, KeyEqual, Disposer); - void clear(); - template<typename Disposer> void clear_and_dispose(Disposer); - size_type count(const key_type &) const; + void clear(); + template<typename Disposer> void clear_and_dispose(Disposer); + size_type count(const key_type &) const; template<typename KeyType, typename KeyHasher, typename KeyEqual> - size_type count(const KeyType &, KeyHasher, KeyEqual) const; - iterator find(const key_type &); + size_type count(const KeyType &, KeyHasher, KeyEqual) const; + iterator find(const key_type &); template<typename KeyType, typename KeyHasher, typename KeyEqual> - iterator find(const KeyType &, KeyHasher, KeyEqual); - const_iterator find(const key_type &) const; + iterator find(const KeyType &, KeyHasher, KeyEqual); + const_iterator find(const key_type &) const; template<typename KeyType, typename KeyHasher, typename KeyEqual> - const_iterator find(const KeyType &, KeyHasher, KeyEqual) const; - std::pair< iterator, iterator > equal_range(const key_type &); + const_iterator find(const KeyType &, KeyHasher, KeyEqual) const; + std::pair< iterator, iterator > equal_range(const key_type &); template<typename KeyType, typename KeyHasher, typename KeyEqual> std::pair< iterator, iterator > - equal_range(const KeyType &, KeyHasher, KeyEqual); + equal_range(const KeyType &, KeyHasher, KeyEqual); std::pair< const_iterator, const_iterator > - equal_range(const key_type &) const; + equal_range(const key_type &) const; template<typename KeyType, typename KeyHasher, typename KeyEqual> std::pair< const_iterator, const_iterator > - equal_range(const KeyType &, KeyHasher, KeyEqual) const; - iterator iterator_to(reference); - const_iterator iterator_to(const_reference) const; - local_iterator local_iterator_to(reference); - const_local_iterator local_iterator_to(const_reference) const; - size_type bucket_count() const; - size_type bucket_size(size_type) const; - size_type bucket(const key_type &) const; + equal_range(const KeyType &, KeyHasher, KeyEqual) const; + iterator iterator_to(reference); + const_iterator iterator_to(const_reference) const; + local_iterator local_iterator_to(reference); + const_local_iterator local_iterator_to(const_reference) const; + size_type bucket_count() const; + size_type bucket_size(size_type) const; + size_type bucket(const key_type &) const; template<typename KeyType, typename KeyHasher> - size_type bucket(const KeyType &, KeyHasher) const; - bucket_ptr bucket_pointer() const; - local_iterator begin(size_type); - const_local_iterator begin(size_type) const; - const_local_iterator cbegin(size_type) const; - local_iterator end(size_type); - const_local_iterator end(size_type) const; - const_local_iterator cend(size_type) const; - void rehash(const bucket_traits &); - void full_rehash(); - bool incremental_rehash(bool = true); - bool incremental_rehash(const bucket_traits &); - size_type split_count() const; + size_type bucket(const KeyType &, KeyHasher) const; + bucket_ptr bucket_pointer() const; + local_iterator begin(size_type); + const_local_iterator begin(size_type) const; + const_local_iterator cbegin(size_type) const; + local_iterator end(size_type); + const_local_iterator end(size_type) const; + const_local_iterator cend(size_type) const; + void rehash(const bucket_traits &); + void full_rehash(); + bool incremental_rehash(bool = true); + bool incremental_rehash(const bucket_traits &); + size_type split_count() const; - // public static functions - static local_iterator s_local_iterator_to(reference); - static const_local_iterator s_local_iterator_to(const_reference); - static size_type suggested_upper_bucket_count(size_type); - static size_type suggested_lower_bucket_count(size_type); + // public static functions + static local_iterator s_local_iterator_to(reference); + static const_local_iterator s_local_iterator_to(const_reference); + static size_type suggested_upper_bucket_count(size_type); + static size_type suggested_lower_bucket_count(size_type); };

                          Description

                          @@ -178,7 +178,7 @@ construct/copy/destruct
                          1. -
                            explicit unordered_set(const bucket_traits & b_traits, 
+
                            explicit unordered_set(const bucket_traits & b_traits, 
                        const hasher & hash_func = hasher(), 
                        const key_equal & equal_func = key_equal(), 
                        const value_traits & v_traits = value_traits());
                            
@@ -190,7 +190,7 @@
 
                          2. template<typename Iterator> 
-  unordered_set(Iterator b, Iterator e, const bucket_traits & b_traits, 
+  unordered_set(Iterator b, Iterator e, const bucket_traits & b_traits, 
                 const hasher & hash_func = hasher(), 
                 const key_equal & equal_func = key_equal(), 
                 const value_traits & v_traits = value_traits());
                            @@ -201,17 +201,17 @@

                            Notes: buckets array must be disposed only after *this is disposed.

                          3. -
                            unordered_set(unordered_set && x);
                            +
                            unordered_set(unordered_set && x);

                            Effects: Constructs a container moving resources from another container. Internal value traits, bucket traits, hasher and comparison are move constructed and nodes belonging to x are linked to *this.

                            Complexity: Constant.

                            Throws: If value_traits::node_traits::node's move constructor throws (this does not happen with predefined Boost.Intrusive hooks) or the move constructor of value traits, bucket traits, hasher or comparison throws.

                          4. -
                            unordered_set & operator=(unordered_set && x);
                            +
                            unordered_set & operator=(unordered_set && x);

                            Effects: Equivalent to swap.

                          5. -
                            ~unordered_set();
                            +
                            ~unordered_set();

                            Effects: Detaches all elements from this. The objects in the unordered_set are not deleted (i.e. no destructors are called).

                            Complexity: Linear to the number of elements in the unordered_set, if it's a safe-mode or auto-unlink value. Otherwise constant.

                            Throws: Nothing.

                            @@ -220,70 +220,70 @@

                          -unordered_set public member functions

                          +unordered_set public member functions
                          1. -
                            iterator begin();
                            +
                            iterator begin();

                            Effects: Returns an iterator pointing to the beginning of the unordered_set.

                            Complexity: Amortized constant time. Worst case (empty unordered_set): O(this->bucket_count())

                            Throws: Nothing.

                          2. -
                            const_iterator begin() const;
                            +
                            const_iterator begin() const;

                            Effects: Returns a const_iterator pointing to the beginning of the unordered_set.

                            Complexity: Amortized constant time. Worst case (empty unordered_set): O(this->bucket_count())

                            Throws: Nothing.

                          3. -
                            const_iterator cbegin() const;
                            +
                            const_iterator cbegin() const;

                            Effects: Returns a const_iterator pointing to the beginning of the unordered_set.

                            Complexity: Amortized constant time. Worst case (empty unordered_set): O(this->bucket_count())

                            Throws: Nothing.

                          4. -
                            iterator end();
                            +
                            iterator end();

                            Effects: Returns an iterator pointing to the end of the unordered_set.

                            Complexity: Constant.

                            Throws: Nothing.

                          5. -
                            const_iterator end() const;
                            +
                            const_iterator end() const;

                            Effects: Returns a const_iterator pointing to the end of the unordered_set.

                            Complexity: Constant.

                            Throws: Nothing.

                          6. -
                            const_iterator cend() const;
                            +
                            const_iterator cend() const;

                            Effects: Returns a const_iterator pointing to the end of the unordered_set.

                            Complexity: Constant.

                            Throws: Nothing.

                          7. -
                            hasher hash_function() const;
                            +
                            hasher hash_function() const;

                            Effects: Returns the hasher object used by the unordered_set.

                            Complexity: Constant.

                            Throws: If hasher copy-constructor throws.

                          8. -
                            key_equal key_eq() const;
                            +
                            key_equal key_eq() const;

                            Effects: Returns the key_equal object used by the unordered_set.

                            Complexity: Constant.

                            Throws: If key_equal copy-constructor throws.

                          9. -
                            bool empty() const;
                            +
                            bool empty() const;

                            Effects: Returns true if the container is empty.

                            Complexity: if constant-time size and cache_begin options are disabled, average constant time (worst case, with empty() == true: O(this->bucket_count()). Otherwise constant.

                            Throws: Nothing.

                          10. -
                            size_type size() const;
                            +
                            size_type size() const;

                            Effects: Returns the number of elements stored in the unordered_set.

                            Complexity: Linear to elements contained in *this if constant_time_size is false. Constant-time otherwise.

                            Throws: Nothing.

                          11. -
                            void swap(unordered_set & other);
                            +
                            void swap(unordered_set & other);

                            Requires: buckets must not be being used by any other resource.

                            Effects: Constructs an empty unordered_set, storing a reference to the bucket array and copies of the key_hasher and equal_func functors.

                            Complexity: Constant.

                            @@ -292,7 +292,7 @@ 
                          12. template<typename Cloner, typename Disposer> 
-  void clone_from(const unordered_set & src, Cloner cloner, Disposer disposer);
                            + void clone_from(const unordered_set & src, Cloner cloner, Disposer disposer);

                            Requires: Disposer::operator()(pointer) shouldn't throw Cloner should yield to nodes that compare equal and produce the same hash than the original node.

                            Effects: Erases all the elements from *this calling Disposer::operator()(pointer), clones all the elements from src calling Cloner::operator()(const_reference ) and inserts them on *this. The hash function and the equality predicate are copied from the source.

                            If store_hash option is true, this method does not use the hash function.

                            @@ -302,7 +302,7 @@ 
                          13. template<typename Cloner, typename Disposer> 
-  void clone_from(unordered_set && src, Cloner cloner, Disposer disposer);
                            + void clone_from(unordered_set && src, Cloner cloner, Disposer disposer);

                            Requires: Disposer::operator()(pointer) shouldn't throw Cloner should yield to nodes that compare equal and produce the same hash than the original node.

                            Effects: Erases all the elements from *this calling Disposer::operator()(pointer), clones all the elements from src calling Cloner::operator()(reference) and inserts them on *this. The hash function and the equality predicate are copied from the source.

                            If store_hash option is true, this method does not use the hash function.

                            @@ -311,7 +311,7 @@

                            Throws: If cloner or hasher throw or hash or equality predicate copying throws. Basic guarantee.

                          14. -
                            std::pair< iterator, bool > insert(reference value);
                            +
                            std::pair< iterator, bool > insert(reference value);

                            Requires: value must be an lvalue

                            Effects: Tries to inserts value into the unordered_set.

                            Returns: If the value is not already present inserts it and returns a pair containing the iterator to the new value and true. If there is an equivalent value returns a pair containing an iterator to the already present value and false.

                            @@ -320,7 +320,7 @@

                            Note: Does not affect the validity of iterators and references. No copy-constructors are called.

                          15. -
                            template<typename Iterator> void insert(Iterator b, Iterator e);
                            +
                            template<typename Iterator> void insert(Iterator b, Iterator e);

                            Requires: Dereferencing iterator must yield an lvalue of type value_type.

                            Effects: Equivalent to this->insert_unique(t) for each element in [b, e).

                            Complexity: Average case O(N), where N is distance(b, e). Worst case O(N*this->size()).

                            @@ -329,7 +329,7 @@ 
                          16. std::pair< iterator, bool > 
-insert_check(const key_type & key, insert_commit_data & commit_data);
                            +insert_check(const key_type & key, insert_commit_data & commit_data);

                            Effects: Checks if a value can be inserted in the unordered_set, using a user provided key instead of the value itself.

                            Returns: If there is an equivalent value returns a pair containing an iterator to the already present value and false. If the value can be inserted returns true in the returned pair boolean and fills "commit_data" that is meant to be used with the "insert_commit" function.

                            Complexity: Average case O(1), worst case O(this->size()).

                            @@ -342,7 +342,7 @@ 
                          17. template<typename KeyType, typename KeyHasher, typename KeyEqual> 
   std::pair< iterator, bool > 
-  insert_check(const KeyType & key, KeyHasher hasher, 
+  insert_check(const KeyType & key, KeyHasher hasher, 
                KeyEqual key_value_equal, insert_commit_data & commit_data);

                            Requires: "hash_func" must be a hash function that induces the same hash values as the stored hasher. The difference is that "hash_func" hashes the given key instead of the value_type.

                            "equal_func" must be a equality function that induces the same equality as key_equal. The difference is that "equal_func" compares an arbitrary key with the contained values.

                            @@ -356,7 +356,7 @@

                            After a successful rehashing insert_commit_data remains valid.

                          18. -
                            iterator insert_commit(reference value, 
+
                            iterator insert_commit(reference value, 
                        const insert_commit_data & commit_data);
                            
 
                            Requires: value must be an lvalue of type value_type. commit_data must have been obtained from a previous call to "insert_check". No objects should have been inserted or erased from the unordered_set between the "insert_check" that filled "commit_data" and the call to "insert_commit".
                            
 
                            Effects: Inserts the value in the unordered_set using the information obtained from the "commit_data" that a previous "insert_check" filled.
                            
@@ -367,21 +367,21 @@
 
                            After a successful rehashing insert_commit_data remains valid.
                          19. -
                            void erase(const_iterator i);
                            +
                            void erase(const_iterator i);

                            Effects: Erases the element pointed to by i.

                            Complexity: Average case O(1), worst case O(this->size()).

                            Throws: Nothing.

                            Note: Invalidates the iterators (but not the references) to the erased element. No destructors are called.

                          20. -
                            void erase(const_iterator b, const_iterator e);
                            +
                            void erase(const_iterator b, const_iterator e);

                            Effects: Erases the range pointed to by b end e.

                            Complexity: Average case O(distance(b, e)), worst case O(this->size()).

                            Throws: Nothing.

                            Note: Invalidates the iterators (but not the references) to the erased elements. No destructors are called.

                          21. -
                            size_type erase(const key_type & key);
                            +
                            size_type erase(const key_type & key);

                            Effects: Erases all the elements with the given value.

                            Returns: The number of erased elements.

                            Complexity: Average case O(this->count(value)). Worst case O(this->size()).

                            @@ -390,7 +390,7 @@ 
                          22. template<typename KeyType, typename KeyHasher, typename KeyEqual> 
-  size_type erase(const KeyType & key, KeyHasher hash_func, 
+  size_type erase(const KeyType & key, KeyHasher hash_func, 
                   KeyEqual equal_func);

                            Requires: "hash_func" must be a hash function that induces the same hash values as the stored hasher. The difference is that "hash_func" hashes the given key instead of the value_type.

                            "equal_func" must be a equality function that induces the same equality as key_equal. The difference is that "equal_func" compares an arbitrary key with the contained values.

                            @@ -402,7 +402,7 @@ 
                          23. template<typename Disposer> 
-  void erase_and_dispose(const_iterator i, Disposer disposer);
                            + void erase_and_dispose(const_iterator i, Disposer disposer);

                            Requires: Disposer::operator()(pointer) shouldn't throw.

                            Effects: Erases the element pointed to by i. Disposer::operator()(pointer) is called for the removed element.

                            Complexity: Average case O(1), worst case O(this->size()).

                            @@ -411,7 +411,7 @@ 
                          24. template<typename Disposer> 
-  void erase_and_dispose(const_iterator b, const_iterator e, 
+  void erase_and_dispose(const_iterator b, const_iterator e, 
                          Disposer disposer);

                            Requires: Disposer::operator()(pointer) shouldn't throw.

                            Effects: Erases the range pointed to by b end e. Disposer::operator()(pointer) is called for the removed elements.

                            @@ -421,7 +421,7 @@ 
                          25. template<typename Disposer> 
-  size_type erase_and_dispose(const key_type & key, Disposer disposer);
                            + size_type erase_and_dispose(const key_type & key, Disposer disposer);

                            Requires: Disposer::operator()(pointer) shouldn't throw.

                            Effects: Erases all the elements with the given value. Disposer::operator()(pointer) is called for the removed elements.

                            Returns: The number of erased elements.

                            @@ -432,7 +432,7 @@ 
                          26. template<typename KeyType, typename KeyHasher, typename KeyEqual, 
          typename Disposer> 
-  size_type erase_and_dispose(const KeyType & key, KeyHasher hash_func, 
+  size_type erase_and_dispose(const KeyType & key, KeyHasher hash_func, 
                               KeyEqual equal_func, Disposer disposer);

                            Requires: Disposer::operator()(pointer) shouldn't throw.

                            Effects: Erases all the elements with the given key. according to the comparison functor "equal_func". Disposer::operator()(pointer) is called for the removed elements.

                            @@ -442,14 +442,14 @@

                            Note: Invalidates the iterators to the erased elements.

                          27. -
                            void clear();
                            +
                            void clear();

                            Effects: Erases all of the elements.

                            Complexity: Linear to the number of elements on the container. if it's a safe-mode or auto-unlink value_type. Constant time otherwise.

                            Throws: Nothing.

                            Note: Invalidates the iterators (but not the references) to the erased elements. No destructors are called.

                          28. -
                            template<typename Disposer> void clear_and_dispose(Disposer disposer);
                            +
                            template<typename Disposer> void clear_and_dispose(Disposer disposer);

                            Requires: Disposer::operator()(pointer) shouldn't throw.

                            Effects: Erases all of the elements.

                            Complexity: Linear to the number of elements on the container. Disposer::operator()(pointer) is called for the removed elements.

                            @@ -457,14 +457,14 @@

                            Note: Invalidates the iterators (but not the references) to the erased elements. No destructors are called.

                          29. -
                            size_type count(const key_type & key) const;
                            +
                            size_type count(const key_type & key) const;

                            Effects: Returns the number of contained elements with the given value

                            Complexity: Average case O(1), worst case O(this->size()).

                            Throws: If the internal hasher or the equality functor throws. 

                          30. template<typename KeyType, typename KeyHasher, typename KeyEqual> 
-  size_type count(const KeyType & key, KeyHasher hash_func, 
+  size_type count(const KeyType & key, KeyHasher hash_func, 
                   KeyEqual equal_func) const;

                            Requires: "hash_func" must be a hash function that induces the same hash values as the stored hasher. The difference is that "hash_func" hashes the given key instead of the value_type.

                            "equal_func" must be a equality function that induces the same equality as key_equal. The difference is that "equal_func" compares an arbitrary key with the contained values.

                            @@ -473,14 +473,14 @@

                            Throws: If hash_func or equal throw.

                          31. -
                            iterator find(const key_type & key);
                            +
                            iterator find(const key_type & key);

                            Effects: Finds an iterator to the first element is equal to "value" or end() if that element does not exist.

                            Complexity: Average case O(1), worst case O(this->size()).

                            Throws: If the internal hasher or the equality functor throws. 

                          32. template<typename KeyType, typename KeyHasher, typename KeyEqual> 
-  iterator find(const KeyType & key, KeyHasher hash_func, KeyEqual equal_func);
                            + iterator find(const KeyType & key, KeyHasher hash_func, KeyEqual equal_func);

                            Requires: "hash_func" must be a hash function that induces the same hash values as the stored hasher. The difference is that "hash_func" hashes the given key instead of the value_type.

                            "equal_func" must be a equality function that induces the same equality as key_equal. The difference is that "equal_func" compares an arbitrary key with the contained values.

                            Effects: Finds an iterator to the first element whose key is "key" according to the given hash and equality functor or end() if that element does not exist.

                            @@ -489,7 +489,7 @@

                            Note: This function is used when constructing a value_type is expensive and the value_type can be compared with a cheaper key type. Usually this key is part of the value_type.

                          33. -
                            const_iterator find(const key_type & key) const;
                            +
                            const_iterator find(const key_type & key) const;

                            Effects: Returns the number of contained elements with the given value

                            Complexity: Average case O(1), worst case O(this->size()).

                            Throws: If the internal hasher or the equality functor throws.

                            @@ -497,7 +497,7 @@ 
                          34. template<typename KeyType, typename KeyHasher, typename KeyEqual> 
   const_iterator 
-  find(const KeyType & key, KeyHasher hash_func, KeyEqual equal_func) const;
                            + find(const KeyType & key, KeyHasher hash_func, KeyEqual equal_func) const;

                            Requires: "hash_func" must be a hash function that induces the same hash values as the stored hasher. The difference is that "hash_func" hashes the given key instead of the value_type.

                            "equal_func" must be a equality function that induces the same equality as key_equal. The difference is that "equal_func" compares an arbitrary key with the contained values.

                            Effects: Finds an iterator to the first element whose key is "key" according to the given hasher and equality functor or end() if that element does not exist.

                            @@ -506,7 +506,7 @@

                            Note: This function is used when constructing a value_type is expensive and the value_type can be compared with a cheaper key type. Usually this key is part of the value_type.

                          35. -
                            std::pair< iterator, iterator > equal_range(const key_type & key);
                            +
                            std::pair< iterator, iterator > equal_range(const key_type & key);

                            Effects: Returns a range containing all elements with values equivalent to value. Returns std::make_pair(this->end(), this->end()) if no such elements exist.

                            Complexity: Average case O(this->count(value)). Worst case O(this->size()).

                            Throws: If the internal hasher or the equality functor throws.

                            @@ -514,7 +514,7 @@ 
                          36. template<typename KeyType, typename KeyHasher, typename KeyEqual> 
   std::pair< iterator, iterator > 
-  equal_range(const KeyType & key, KeyHasher hash_func, KeyEqual equal_func);
                            + equal_range(const KeyType & key, KeyHasher hash_func, KeyEqual equal_func);

                            Requires: "hash_func" must be a hash function that induces the same hash values as the stored hasher. The difference is that "hash_func" hashes the given key instead of the value_type.

                            "equal_func" must be a equality function that induces the same equality as key_equal. The difference is that "equal_func" compares an arbitrary key with the contained values.

                            Effects: Returns a range containing all elements with equivalent keys. Returns std::make_pair(this->end(), this->end()) if no such elements exist.

                            @@ -524,7 +524,7 @@ 
                          37. std::pair< const_iterator, const_iterator > 
-equal_range(const key_type & key) const;
                            +equal_range(const key_type & key) const;

                            Effects: Returns a range containing all elements with values equivalent to value. Returns std::make_pair(this->end(), this->end()) if no such elements exist.

                            Complexity: Average case O(this->count(value)). Worst case O(this->size()).

                            Throws: If the internal hasher or the equality functor throws.

                            @@ -532,7 +532,7 @@ 
                          38. template<typename KeyType, typename KeyHasher, typename KeyEqual> 
   std::pair< const_iterator, const_iterator > 
-  equal_range(const KeyType & key, KeyHasher hash_func, KeyEqual equal_func) const;
                            + equal_range(const KeyType & key, KeyHasher hash_func, KeyEqual equal_func) const;

                            Requires: "hash_func" must be a hash function that induces the same hash values as the stored hasher. The difference is that "hash_func" hashes the given key instead of the value_type.

                            "equal_func" must be a equality function that induces the same equality as key_equal. The difference is that "equal_func" compares an arbitrary key with the contained values.

                            Effects: Returns a range containing all elements with equivalent keys. Returns std::make_pair(this->end(), this->end()) if no such elements exist.

                            @@ -541,48 +541,48 @@

                            Note: This function is used when constructing a value_type is expensive and the value_type can be compared with a cheaper key type. Usually this key is part of the value_type.

                          39. -
                            iterator iterator_to(reference value);
                            +
                            iterator iterator_to(reference value);

                            Requires: value must be an lvalue and shall be in a unordered_set of appropriate type. Otherwise the behavior is undefined.

                            Effects: Returns: a valid iterator belonging to the unordered_set that points to the value

                            Complexity: Constant.

                            Throws: If the internal hash function throws.

                          40. -
                            const_iterator iterator_to(const_reference value) const;
                            +
                            const_iterator iterator_to(const_reference value) const;

                            Requires: value must be an lvalue and shall be in a unordered_set of appropriate type. Otherwise the behavior is undefined.

                            Effects: Returns: a valid const_iterator belonging to the unordered_set that points to the value

                            Complexity: Constant.

                            Throws: If the internal hash function throws.

                          41. -
                            local_iterator local_iterator_to(reference value);
                            +
                            local_iterator local_iterator_to(reference value);

                            Requires: value must be an lvalue and shall be in a unordered_set of appropriate type. Otherwise the behavior is undefined.

                            Effects: Returns: a valid local_iterator belonging to the unordered_set that points to the value

                            Complexity: Constant.

                            Throws: Nothing.

                          42. -
                            const_local_iterator local_iterator_to(const_reference value) const;
                            +
                            const_local_iterator local_iterator_to(const_reference value) const;

                            Requires: value must be an lvalue and shall be in a unordered_set of appropriate type. Otherwise the behavior is undefined.

                            Effects: Returns: a valid local_iterator belonging to the unordered_set that points to the value

                            Complexity: Constant.

                            Throws: Nothing.

                          43. -
                            size_type bucket_count() const;
                            +
                            size_type bucket_count() const;

                            Effects: Returns the number of buckets passed in the constructor or the last rehash function.

                            Complexity: Constant.

                            Throws: Nothing.

                          44. -
                            size_type bucket_size(size_type n) const;
                            +
                            size_type bucket_size(size_type n) const;

                            Requires: n is in the range [0, this->bucket_count()).

                            Effects: Returns the number of elements in the nth bucket.

                            Complexity: Constant.

                            Throws: Nothing.

                          45. -
                            size_type bucket(const key_type & k) const;
                            +
                            size_type bucket(const key_type & k) const;

                            Effects: Returns the index of the bucket in which elements with keys equivalent to k would be found, if any such element existed.

                            Complexity: Constant.

                            Throws: If the hash functor throws.

                            @@ -590,7 +590,7 @@ 
                          46. template<typename KeyType, typename KeyHasher> 
-  size_type bucket(const KeyType & k, KeyHasher hash_func) const;
                            + size_type bucket(const KeyType & k, KeyHasher hash_func) const;

                            Requires: "hash_func" must be a hash function that induces the same hash values as the stored hasher. The difference is that "hash_func" hashes the given key instead of the value_type.

                            Effects: Returns the index of the bucket in which elements with keys equivalent to k would be found, if any such element existed.

                            Complexity: Constant.

                            @@ -598,13 +598,13 @@

                            Note: the return value is in the range [0, this->bucket_count()).

                          47. -
                            bucket_ptr bucket_pointer() const;
                            +
                            bucket_ptr bucket_pointer() const;

                            Effects: Returns the bucket array pointer passed in the constructor or the last rehash function.

                            Complexity: Constant.

                            Throws: Nothing.

                          48. -
                            local_iterator begin(size_type n);
                            +
                            local_iterator begin(size_type n);

                            Requires: n is in the range [0, this->bucket_count()).

                            Effects: Returns a local_iterator pointing to the beginning of the sequence stored in the bucket n.

                            Complexity: Constant.

                            @@ -612,7 +612,7 @@

                            Note: [this->begin(n), this->end(n)) is a valid range containing all of the elements in the nth bucket.

                          49. -
                            const_local_iterator begin(size_type n) const;
                            +
                            const_local_iterator begin(size_type n) const;

                            Requires: n is in the range [0, this->bucket_count()).

                            Effects: Returns a const_local_iterator pointing to the beginning of the sequence stored in the bucket n.

                            Complexity: Constant.

                            @@ -620,7 +620,7 @@

                            Note: [this->begin(n), this->end(n)) is a valid range containing all of the elements in the nth bucket.

                          50. -
                            const_local_iterator cbegin(size_type n) const;
                            +
                            const_local_iterator cbegin(size_type n) const;

                            Requires: n is in the range [0, this->bucket_count()).

                            Effects: Returns a const_local_iterator pointing to the beginning of the sequence stored in the bucket n.

                            Complexity: Constant.

                            @@ -628,7 +628,7 @@

                            Note: [this->begin(n), this->end(n)) is a valid range containing all of the elements in the nth bucket.

                          51. -
                            local_iterator end(size_type n);
                            +
                            local_iterator end(size_type n);

                            Requires: n is in the range [0, this->bucket_count()).

                            Effects: Returns a local_iterator pointing to the end of the sequence stored in the bucket n.

                            Complexity: Constant.

                            @@ -636,7 +636,7 @@

                            Note: [this->begin(n), this->end(n)) is a valid range containing all of the elements in the nth bucket.

                          52. -
                            const_local_iterator end(size_type n) const;
                            +
                            const_local_iterator end(size_type n) const;

                            Requires: n is in the range [0, this->bucket_count()).

                            Effects: Returns a const_local_iterator pointing to the end of the sequence stored in the bucket n.

                            Complexity: Constant.

                            @@ -644,7 +644,7 @@

                            Note: [this->begin(n), this->end(n)) is a valid range containing all of the elements in the nth bucket.

                          53. -
                            const_local_iterator cend(size_type n) const;
                            +
                            const_local_iterator cend(size_type n) const;

                            Requires: n is in the range [0, this->bucket_count()).

                            Effects: Returns a const_local_iterator pointing to the end of the sequence stored in the bucket n.

                            Complexity: Constant.

                            @@ -652,7 +652,7 @@

                            Note: [this->begin(n), this->end(n)) is a valid range containing all of the elements in the nth bucket.

                          54. -
                            void rehash(const bucket_traits & new_bucket_traits);
                            +
                            void rehash(const bucket_traits & new_bucket_traits);

                            Requires: new_bucket_traits can hold a pointer to a new bucket array or the same as the old bucket array with a different length. new_size is the length of the the array pointed by new_buckets. If new_bucket_traits.bucket_begin() == this->bucket_pointer() new_bucket_traits.bucket_count() can be bigger or smaller than this->bucket_count(). 'new_bucket_traits' copy constructor should not throw.

                            Effects: If new_bucket_traits.bucket_begin() == this->bucket_pointer() is false, unlinks values from the old bucket and inserts then in the new one according to the hash value of values.

                            If new_bucket_traits.bucket_begin() == this->bucket_pointer() is true, the implementations avoids moving values as much as possible.

                            @@ -663,7 +663,7 @@

                            Throws: If the hasher functor throws. Basic guarantee.

                          55. -
                            void full_rehash();
                            +
                            void full_rehash();

                            Note: This function is used when keys from inserted elements are changed (e.g. a language change when key is a string) but uniqueness and hash properties are preserved so a fast full rehash recovers invariants for *this without extracting and reinserting all elements again.

                            Requires: Calls produced to the hash function should not alter the value uniqueness properties of already inserted elements. If hasher(key1) == hasher(key2) was true when elements were inserted, it shall be true during calls produced in the execution of this function.

                            key_equal is not called inside this function so it is assumed that key_equal(value1, value2) should produce the same results as before for inserted elements.

                            @@ -673,7 +673,7 @@

                            Throws: If the hasher functor throws. Basic guarantee.

                          56. -
                            bool incremental_rehash(bool grow = true);
                            +
                            bool incremental_rehash(bool grow = true);

                            Requires:

                            Effects:

                            Complexity:

                            @@ -681,7 +681,7 @@

                            Note: this method is only available if incremental<true> option is activated.

                          57. -
                            bool incremental_rehash(const bucket_traits & new_bucket_traits);
                            +
                            bool incremental_rehash(const bucket_traits & new_bucket_traits);

                            Effects: If new_bucket_traits.bucket_count() is not this->bucket_count()/2 or this->bucket_count()*2, or this->split_bucket() != new_bucket_traits.bucket_count() returns false and does nothing.

                            Otherwise, copy assigns new_bucket_traits to the internal bucket_traits and transfers all the objects from old buckets to the new ones.

                            Complexity: Linear to size().

                            @@ -689,7 +689,7 @@

                            Note: this method is only available if incremental<true> option is activated.

                          58. -
                            size_type split_count() const;
                            +
                            size_type split_count() const;

                            Requires: incremental<> option must be set

                            Effects: returns the current split count

                            Complexity: Constant

                            @@ -699,10 +699,10 @@

                          -unordered_set public static functions

                          +unordered_set public static functions
                          1. -
                            static local_iterator s_local_iterator_to(reference value);
                            +
                            static local_iterator s_local_iterator_to(reference value);

                            Requires: value must be an lvalue and shall be in a unordered_set of appropriate type. Otherwise the behavior is undefined.

                            Effects: Returns: a valid local_iterator belonging to the unordered_set that points to the value

                            Complexity: Constant.

                            @@ -710,7 +710,7 @@

                            Note: This static function is available only if the value traits is stateless.

                          2. -
                            static const_local_iterator s_local_iterator_to(const_reference value);
                            +
                            static const_local_iterator s_local_iterator_to(const_reference value);

                            Requires: value must be an lvalue and shall be in a unordered_set of appropriate type. Otherwise the behavior is undefined.

                            Effects: Returns: a valid local_iterator belonging to the unordered_set that points to the value

                            Complexity: Constant.

                            @@ -718,13 +718,13 @@

                            Note: This static function is available only if the value traits is stateless.

                          3. -
                            static size_type suggested_upper_bucket_count(size_type n);
                            +
                            static size_type suggested_upper_bucket_count(size_type n);

                            Effects: Returns the nearest new bucket count optimized for the container that is bigger or equal than n. This suggestion can be used to create bucket arrays with a size that will usually improve container's performance. If such value does not exist, the higher possible value is returned.

                            Complexity: Amortized constant time.

                            Throws: Nothing.

                          4. -
                            static size_type suggested_lower_bucket_count(size_type n);
                            +
                            static size_type suggested_lower_bucket_count(size_type n);

                            Effects: Returns the nearest new bucket count optimized for the container that is smaller or equal than n. This suggestion can be used to create bucket arrays with a size that will usually improve container's performance. If such value does not exist, the lowest possible value is returned.

                            Complexity: Amortized constant time.

                            Throws: Nothing.

                            diff --git a/doc/html/boost/intrusive/unordered_set_base_hook.html b/doc/html/boost/intrusive/unordered_set_base_hook.html index 4f29b12b3e..07e898bb32 100644 --- a/doc/html/boost/intrusive/unordered_set_base_hook.html +++ b/doc/html/boost/intrusive/unordered_set_base_hook.html @@ -7,8 +7,8 @@ - - + + @@ -21,7 +21,7 @@
                            -PrevUpHomeNext +PrevUpHomeNext
                            @@ -38,15 +38,15 @@ { public: // construct/copy/destruct - unordered_set_base_hook(); - unordered_set_base_hook(const unordered_set_base_hook &); - unordered_set_base_hook & operator=(const unordered_set_base_hook &); - ~unordered_set_base_hook(); + unordered_set_base_hook(); + unordered_set_base_hook(const unordered_set_base_hook &); + unordered_set_base_hook & operator=(const unordered_set_base_hook &); + ~unordered_set_base_hook(); - // public member functions - void swap_nodes(unordered_set_base_hook &); - bool is_linked() const; - void unlink(); + // public member functions + void swap_nodes(unordered_set_base_hook &); + bool is_linked() const; + void unlink(); };

                            Description

                            @@ -64,24 +64,24 @@ construct/copy/destruct
                            1. -
                              unordered_set_base_hook();
                              +
                              unordered_set_base_hook();

                              Effects: If link_mode is auto_unlink or safe_link initializes the node to an unlinked state.

                              Throws: Nothing.

                            2. -
                              unordered_set_base_hook(const unordered_set_base_hook &);
                              +
                              unordered_set_base_hook(const unordered_set_base_hook &);

                              Effects: If link_mode is auto_unlink or safe_link initializes the node to an unlinked state. The argument is ignored.

                              Throws: Nothing.

                              Rationale: Providing a copy-constructor makes classes using the hook STL-compliant without forcing the user to do some additional work. swap can be used to emulate move-semantics.

                            3. -
                              unordered_set_base_hook & operator=(const unordered_set_base_hook &);
                              +
                              unordered_set_base_hook & operator=(const unordered_set_base_hook &);

                              Effects: Empty function. The argument is ignored.

                              Throws: Nothing.

                              Rationale: Providing an assignment operator makes classes using the hook STL-compliant without forcing the user to do some additional work. swap can be used to emulate move-semantics.

                            4. -
                              ~unordered_set_base_hook();
                              +
                              ~unordered_set_base_hook();

                              Effects: If link_mode is normal_link, the destructor does nothing (ie. no code is generated). If link_mode is safe_link and the object is stored in an unordered_set an assertion is raised. If link_mode is auto_unlink and is_linked() is true, the node is unlinked.

                              Throws: Nothing.

                              5. @@ -89,22 +89,22 @@

                            -unordered_set_base_hook public member functions

                            +unordered_set_base_hook public member functions
                            1. -
                              void swap_nodes(unordered_set_base_hook & other);
                              +
                              void swap_nodes(unordered_set_base_hook & other);

                              Effects: Swapping two nodes swaps the position of the elements related to those nodes in one or two containers. That is, if the node this is part of the element e1, the node x is part of the element e2 and both elements are included in the containers s1 and s2, then after the swap-operation e1 is in s2 at the position of e2 and e2 is in s1 at the position of e1. If one element is not in a container, then after the swap-operation the other element is not in a container. Iterators to e1 and e2 related to those nodes are invalidated.

                              Complexity: Constant

                              Throws: Nothing.

                            2. -
                              bool is_linked() const;
                              +
                              bool is_linked() const;

                              Precondition: link_mode must be safe_link or auto_unlink.

                              Returns: true, if the node belongs to a container, false otherwise. This function can be used to test whether unordered_set::iterator_to will return a valid iterator.

                              Complexity: Constant

                            3. -
                              void unlink();
                              +
                              void unlink();

                              Effects: Removes the node if it's inserted in a container. This function is only allowed if link_mode is auto_unlink.

                              Throws: Nothing.

                              4. @@ -122,7 +122,7 @@
                              -PrevUpHomeNext +PrevUpHomeNext
                              diff --git a/doc/html/boost/intrusive/unordered_set_member_hook.html b/doc/html/boost/intrusive/unordered_set_member_hook.html index 02a61bfe29..d757786342 100644 --- a/doc/html/boost/intrusive/unordered_set_member_hook.html +++ b/doc/html/boost/intrusive/unordered_set_member_hook.html @@ -7,7 +7,7 @@ - + @@ -21,7 +21,7 @@
                              -PrevUpHomeNext +PrevUpHomeNext
                              @@ -38,15 +38,15 @@ { public: // construct/copy/destruct - unordered_set_member_hook(); - unordered_set_member_hook(const unordered_set_member_hook &); - unordered_set_member_hook & operator=(const unordered_set_member_hook &); - ~unordered_set_member_hook(); + unordered_set_member_hook(); + unordered_set_member_hook(const unordered_set_member_hook &); + unordered_set_member_hook & operator=(const unordered_set_member_hook &); + ~unordered_set_member_hook(); - // public member functions - void swap_nodes(unordered_set_member_hook &); - bool is_linked() const; - void unlink(); + // public member functions + void swap_nodes(unordered_set_member_hook &); + bool is_linked() const; + void unlink(); };

                              Description

                              @@ -62,24 +62,24 @@ construct/copy/destruct
                              1. -
                                unordered_set_member_hook();
                                +
                                unordered_set_member_hook();

                                Effects: If link_mode is auto_unlink or safe_link initializes the node to an unlinked state.

                                Throws: Nothing.

                              2. -
                                unordered_set_member_hook(const unordered_set_member_hook &);
                                +
                                unordered_set_member_hook(const unordered_set_member_hook &);

                                Effects: If link_mode is auto_unlink or safe_link initializes the node to an unlinked state. The argument is ignored.

                                Throws: Nothing.

                                Rationale: Providing a copy-constructor makes classes using the hook STL-compliant without forcing the user to do some additional work. swap can be used to emulate move-semantics.

                              3. -
                                unordered_set_member_hook & operator=(const unordered_set_member_hook &);
                                +
                                unordered_set_member_hook & operator=(const unordered_set_member_hook &);

                                Effects: Empty function. The argument is ignored.

                                Throws: Nothing.

                                Rationale: Providing an assignment operator makes classes using the hook STL-compliant without forcing the user to do some additional work. swap can be used to emulate move-semantics.

                              4. -
                                ~unordered_set_member_hook();
                                +
                                ~unordered_set_member_hook();

                                Effects: If link_mode is normal_link, the destructor does nothing (ie. no code is generated). If link_mode is safe_link and the object is stored in an unordered_set an assertion is raised. If link_mode is auto_unlink and is_linked() is true, the node is unlinked.

                                Throws: Nothing.

                                5. @@ -87,22 +87,22 @@

                              -unordered_set_member_hook public member functions

                              +unordered_set_member_hook public member functions
                              1. -
                                void swap_nodes(unordered_set_member_hook & other);
                                +
                                void swap_nodes(unordered_set_member_hook & other);

                                Effects: Swapping two nodes swaps the position of the elements related to those nodes in one or two containers. That is, if the node this is part of the element e1, the node x is part of the element e2 and both elements are included in the containers s1 and s2, then after the swap-operation e1 is in s2 at the position of e2 and e2 is in s1 at the position of e1. If one element is not in a container, then after the swap-operation the other element is not in a container. Iterators to e1 and e2 related to those nodes are invalidated.

                                Complexity: Constant

                                Throws: Nothing.

                              2. -
                                bool is_linked() const;
                                +
                                bool is_linked() const;

                                Precondition: link_mode must be safe_link or auto_unlink.

                                Returns: true, if the node belongs to a container, false otherwise. This function can be used to test whether unordered_set::iterator_to will return a valid iterator.

                                Complexity: Constant

                              3. -
                                void unlink();
                                +
                                void unlink();

                                Effects: Removes the node if it's inserted in a container. This function is only allowed if link_mode is auto_unlink.

                                Throws: Nothing.

                                4. @@ -120,7 +120,7 @@
                                -PrevUpHomeNext +PrevUpHomeNext
                                diff --git a/doc/html/boost/local_time/ambiguous_result.html b/doc/html/boost/local_time/ambiguous_result.html index 828e36231f..fdbce453bf 100644 --- a/doc/html/boost/local_time/ambiguous_result.html +++ b/doc/html/boost/local_time/ambiguous_result.html @@ -35,16 +35,16 @@ struct ambiguous_result : public logic_error { // construct/copy/destruct - ambiguous_result(std::string const & = std::string()); + ambiguous_result(std::string const & = std::string()); };
                              -

                              Description

                              +

                              Description

                              -

                              +

                              ambiguous_result public construct/copy/destruct

                              -
                              1. ambiguous_result(std::string const & msg = std::string());
                              +
                              1. ambiguous_result(std::string const & msg = std::string());
                              diff --git a/doc/html/boost/local_time/bad_adjustment.html b/doc/html/boost/local_time/bad_adjustment.html index 930a181b37..951bbbfe4f 100644 --- a/doc/html/boost/local_time/bad_adjustment.html +++ b/doc/html/boost/local_time/bad_adjustment.html @@ -35,16 +35,16 @@ struct bad_adjustment : public out_of_range { // construct/copy/destruct - bad_adjustment(std::string const & = std::string()); + bad_adjustment(std::string const & = std::string()); };
                              -

                              Description

                              +

                              Description

                              -

                              +

                              bad_adjustment public construct/copy/destruct

                              -
                              1. bad_adjustment(std::string const & msg = std::string());
                              +
                              1. bad_adjustment(std::string const & msg = std::string());
                            diff --git a/doc/html/boost/local_time/bad_offset.html b/doc/html/boost/local_time/bad_offset.html index cc4c429c68..4759d3acbd 100644 --- a/doc/html/boost/local_time/bad_offset.html +++ b/doc/html/boost/local_time/bad_offset.html @@ -35,16 +35,16 @@ struct bad_offset : public out_of_range { // construct/copy/destruct - bad_offset(std::string const & = std::string()); + bad_offset(std::string const & = std::string()); };
                            -

                            Description

                            +

                            Description

                            -

                            +

                            bad_offset public construct/copy/destruct

                            -
                            1. bad_offset(std::string const & msg = std::string());
                            +
                            1. bad_offset(std::string const & msg = std::string());
                            diff --git a/doc/html/boost/local_time/custom_time_zone_base.html b/doc/html/boost/local_time/custom_time_zone_base.html index ff802da8ae..b77e7243ab 100644 --- a/doc/html/boost/local_time/custom_time_zone_base.html +++ b/doc/html/boost/local_time/custom_time_zone_base.html @@ -7,8 +7,8 @@ - - + + @@ -21,7 +21,7 @@
                            -PrevUpHomeNext +PrevUpHomeNext
                            @@ -46,58 +46,58 @@ typedef CharT char_type; // construct/copy/destruct - custom_time_zone_base(const time_zone_names &, const time_duration_type &, + custom_time_zone_base(const time_zone_names &, const time_duration_type &, const dst_adjustment_offsets &, boost::shared_ptr< dst_calc_rule >); - ~custom_time_zone_base(); + ~custom_time_zone_base(); - // public member functions - virtual string_type dst_zone_abbrev() const; - virtual string_type std_zone_abbrev() const; - virtual string_type dst_zone_name() const; - virtual string_type std_zone_name() const; - virtual bool has_dst() const; - virtual posix_time::ptime dst_local_start_time(gregorian::greg_year) const; - virtual posix_time::ptime dst_local_end_time(gregorian::greg_year) const; - virtual time_duration_type base_utc_offset() const; - virtual time_duration_type dst_offset() const; - virtual string_type to_posix_string() const; + // public member functions + virtual string_type dst_zone_abbrev() const; + virtual string_type std_zone_abbrev() const; + virtual string_type dst_zone_name() const; + virtual string_type std_zone_name() const; + virtual bool has_dst() const; + virtual posix_time::ptime dst_local_start_time(gregorian::greg_year) const; + virtual posix_time::ptime dst_local_end_time(gregorian::greg_year) const; + virtual time_duration_type base_utc_offset() const; + virtual time_duration_type dst_offset() const; + virtual string_type to_posix_string() const; };
                            -

                            Description

                            +

                            Description

                            -

                            +

                            custom_time_zone_base public construct/copy/destruct

                              -
                            1. custom_time_zone_base(const time_zone_names & zone_names, 
+
                            2. custom_time_zone_base(const time_zone_names & zone_names, 
                       const time_duration_type & utc_offset, 
                       const dst_adjustment_offsets & dst_shift, 
                       boost::shared_ptr< dst_calc_rule > calc_rule);
                              3. 
-
                            3. ~custom_time_zone_base();
                              4. 
+
                            4. ~custom_time_zone_base();
                              5.
                            -

                            -custom_time_zone_base public member functions

                            +

                            +custom_time_zone_base public member functions

                              -
                            1. virtual string_type dst_zone_abbrev() const;
                              2. -
                            2. virtual string_type std_zone_abbrev() const;
                              3. -
                            3. virtual string_type dst_zone_name() const;
                              4. -
                            4. virtual string_type std_zone_name() const;
                              5. +
                            5. virtual string_type dst_zone_abbrev() const;
                              6. +
                            6. virtual string_type std_zone_abbrev() const;
                              7. +
                            7. virtual string_type dst_zone_name() const;
                              8. +
                            8. virtual string_type std_zone_name() const;
                            9. -
                              virtual bool has_dst() const;
                              True if zone uses daylight savings adjustments.
                              10. +
                              virtual bool has_dst() const;
                              True if zone uses daylight savings adjustments.
                            10. -
                              virtual posix_time::ptime dst_local_start_time(gregorian::greg_year y) const;
                              Local time that DST starts – NADT if has_dst is false.
                              11. +
                              virtual posix_time::ptime dst_local_start_time(gregorian::greg_year y) const;
                              Local time that DST starts – NADT if has_dst is false.
                            11. -
                              virtual posix_time::ptime dst_local_end_time(gregorian::greg_year y) const;
                              Local time that DST ends – NADT if has_dst is false.
                              12. +
                              virtual posix_time::ptime dst_local_end_time(gregorian::greg_year y) const;
                              Local time that DST ends – NADT if has_dst is false.
                            12. -
                              virtual time_duration_type base_utc_offset() const;
                              Base offset from UTC for zone (eg: -07:30:00)
                              13. +
                              virtual time_duration_type base_utc_offset() const;
                              Base offset from UTC for zone (eg: -07:30:00)
                            13. -
                              virtual time_duration_type dst_offset() const;
                              Adjustment forward or back made while DST is in effect.
                              14. +
                              virtual time_duration_type dst_offset() const;
                              Adjustment forward or back made while DST is in effect.
                            14. -
                              virtual string_type to_posix_string() const;
                              Returns a POSIX time_zone string for this object.
                              15. +
                              virtual string_type to_posix_string() const;
                              Returns a POSIX time_zone string for this object.
                            @@ -110,7 +110,7 @@
                            -PrevUpHomeNext +PrevUpHomeNext
                            diff --git a/doc/html/boost/local_time/dst_not_valid.html b/doc/html/boost/local_time/dst_not_valid.html index 21d9d4f3e1..82571e75eb 100644 --- a/doc/html/boost/local_time/dst_not_valid.html +++ b/doc/html/boost/local_time/dst_not_valid.html @@ -35,16 +35,16 @@ struct dst_not_valid : public logic_error { // construct/copy/destruct - dst_not_valid(std::string const & = std::string()); + dst_not_valid(std::string const & = std::string()); };
                          -

                          Description

                          +

                          Description

                          -

                          +

                          dst_not_valid public construct/copy/destruct

                          -
                          1. dst_not_valid(std::string const & msg = std::string());
                          +
                          1. dst_not_valid(std::string const & msg = std::string());
                          diff --git a/doc/html/boost/local_time/local_date_time_base.html b/doc/html/boost/local_time/local_date_time_base.html index 8bb9f2c88e..91f938d546 100644 --- a/doc/html/boost/local_time/local_date_time_base.html +++ b/doc/html/boost/local_time/local_date_time_base.html @@ -47,64 +47,64 @@ enum DST_CALC_OPTIONS { EXCEPTION_ON_ERROR, NOT_DATE_TIME_ON_ERROR }; // construct/copy/destruct - local_date_time_base(utc_time_type, boost::shared_ptr< tz_type >); - local_date_time_base(date_type, time_duration_type, + local_date_time_base(utc_time_type, boost::shared_ptr< tz_type >); + local_date_time_base(date_type, time_duration_type, boost::shared_ptr< tz_type >, bool); - local_date_time_base(date_type, time_duration_type, + local_date_time_base(date_type, time_duration_type, boost::shared_ptr< tz_type >, DST_CALC_OPTIONS); - local_date_time_base(const local_date_time_base &); - explicit local_date_time_base(const boost::date_time::special_values, + local_date_time_base(const local_date_time_base &); + explicit local_date_time_base(const boost::date_time::special_values, boost::shared_ptr< tz_type > = boost::shared_ptr< tz_type >()); - ~local_date_time_base(); + ~local_date_time_base(); - // public member functions - boost::shared_ptr< tz_type > zone() const; - bool is_dst() const; - utc_time_type utc_time() const; - utc_time_type local_time() const; - std::string to_string() const; + // public member functions + boost::shared_ptr< tz_type > zone() const; + bool is_dst() const; + utc_time_type utc_time() const; + utc_time_type local_time() const; + std::string to_string() const; local_date_time_base - local_time_in(boost::shared_ptr< tz_type >, + local_time_in(boost::shared_ptr< tz_type >, time_duration_type = time_duration_type(0, 0, 0)) const; - std::string zone_name(bool = false) const; - std::string zone_abbrev(bool = false) const; - std::string zone_as_posix_string() const; - bool operator==(const local_date_time_base &) const; - bool operator!=(const local_date_time_base &) const; - bool operator<(const local_date_time_base &) const; - bool operator<=(const local_date_time_base &) const; - bool operator>(const local_date_time_base &) const; - bool operator>=(const local_date_time_base &) const; - local_date_time_base operator+(const date_duration_type &) const; - local_date_time_base operator+=(const date_duration_type &); - local_date_time_base operator-(const date_duration_type &) const; - local_date_time_base operator-=(const date_duration_type &); - local_date_time_base operator+(const time_duration_type &) const; - local_date_time_base operator+=(const time_duration_type &); - local_date_time_base operator-(const time_duration_type &) const; - local_date_time_base operator-=(const time_duration_type &); - time_duration_type operator-(const local_date_time_base &) const; + std::string zone_name(bool = false) const; + std::string zone_abbrev(bool = false) const; + std::string zone_as_posix_string() const; + bool operator==(const local_date_time_base &) const; + bool operator!=(const local_date_time_base &) const; + bool operator<(const local_date_time_base &) const; + bool operator<=(const local_date_time_base &) const; + bool operator>(const local_date_time_base &) const; + bool operator>=(const local_date_time_base &) const; + local_date_time_base operator+(const date_duration_type &) const; + local_date_time_base operator+=(const date_duration_type &); + local_date_time_base operator-(const date_duration_type &) const; + local_date_time_base operator-=(const date_duration_type &); + local_date_time_base operator+(const time_duration_type &) const; + local_date_time_base operator+=(const time_duration_type &); + local_date_time_base operator-(const time_duration_type &) const; + local_date_time_base operator-=(const time_duration_type &); + time_duration_type operator-(const local_date_time_base &) const; - // public static functions + // public static functions static time_is_dst_result - check_dst(date_type, time_duration_type, boost::shared_ptr< tz_type >); + check_dst(date_type, time_duration_type, boost::shared_ptr< tz_type >); - // private member functions + // private member functions utc_time_type - construction_adjustment(utc_time_type, boost::shared_ptr< tz_type >, bool); - std::string zone_as_offset(const time_duration_type &, const std::string &) const; + construction_adjustment(utc_time_type, boost::shared_ptr< tz_type >, bool); + std::string zone_as_offset(const time_duration_type &, const std::string &) const; };
                          -

                          Description

                          +

                          Description

                          Representation of "wall-clock" time in a particular time zone Local_date_time_base holds a time value (date and time offset from 00:00) along with a time zone. The time value is stored as UTC and conversions to wall clock time are made as needed. This approach allows for operations between wall-clock times in different time zones, and daylight savings time considerations, to be made. Time zones are required to be in the form of a boost::shared_ptr<time_zone_base>.

                          -

                          +

                          local_date_time_base public construct/copy/destruct

                          1. -
                            local_date_time_base(utc_time_type t, boost::shared_ptr< tz_type > tz);
                            +
                            local_date_time_base(utc_time_type t, boost::shared_ptr< tz_type > tz);

                            This constructor interprets the passed time as a UTC time. So, for example, if the passed timezone is UTC-5 then the time will be adjusted back 5 hours. The time zone allows for automatic calculation of whether the particular time is adjusted for daylight savings, etc. If the time zone shared pointer is null then time stays unadjusted.

                            @@ -134,7 +134,7 @@
                          2. -
                            local_date_time_base(date_type d, time_duration_type td, 
+
                            local_date_time_base(date_type d, time_duration_type td, 
                      boost::shared_ptr< tz_type > tz, bool dst_flag);
                            
 
                            This constructs a local time – the passed time information understood to be in the passed tz. The DST flag must be passed to indicate whether the time is in daylight savings or not. 
 
                            
@@ -150,102 +150,102 @@
                        8. -
                          local_date_time_base(date_type d, time_duration_type td, 
+
                          local_date_time_base(date_type d, time_duration_type td, 
                      boost::shared_ptr< tz_type > tz, 
                      DST_CALC_OPTIONS calc_option);
                          
 
                          This constructs a local time – the passed time information understood to be in the passed tz. The DST flag is calculated according to the specified rule.
                        9. -
                          local_date_time_base(const local_date_time_base & rhs);
                          Copy constructor.
                          10. +
                          local_date_time_base(const local_date_time_base & rhs);
                          Copy constructor.
                        10. -
                          explicit local_date_time_base(const boost::date_time::special_values sv, 
+
                          explicit local_date_time_base(const boost::date_time::special_values sv, 
                               boost::shared_ptr< tz_type > tz = boost::shared_ptr< tz_type >());
                          Special values constructor.
                        11. -
                          ~local_date_time_base();
                          Simple destructor, releases time zone if last referrer.
                          12. +
                          ~local_date_time_base();
                          Simple destructor, releases time zone if last referrer.
                        -

                        -local_date_time_base public member functions

                        +

                        +local_date_time_base public member functions

                        1. -
                          boost::shared_ptr< tz_type > zone() const;
                          returns time zone associated with calling instance
                          2. +
                          boost::shared_ptr< tz_type > zone() const;
                          returns time zone associated with calling instance
                        2. -
                          bool is_dst() const;
                          returns false is time_zone is NULL and if time value is a special_value
                          3. +
                          bool is_dst() const;
                          returns false is time_zone is NULL and if time value is a special_value
                        3. -
                          utc_time_type utc_time() const;
                          Returns object's time value as a utc representation.
                          4. +
                          utc_time_type utc_time() const;
                          Returns object's time value as a utc representation.
                        4. -
                          utc_time_type local_time() const;
                          Returns object's time value as a local representation.
                          5. +
                          utc_time_type local_time() const;
                          Returns object's time value as a local representation.
                        5. -
                          std::string to_string() const;
                          Returns string in the form "2003-Aug-20 05:00:00 EDT".

                          Returns string in the form "2003-Aug-20 05:00:00 EDT". If time_zone is NULL the time zone abbreviation will be "UTC". The time zone abbrev will not be included if calling object is a special_value

                          +
                          std::string to_string() const;
                          Returns string in the form "2003-Aug-20 05:00:00 EDT".

                          Returns string in the form "2003-Aug-20 05:00:00 EDT". If time_zone is NULL the time zone abbreviation will be "UTC". The time zone abbrev will not be included if calling object is a special_value 

                        6. local_date_time_base 
-local_time_in(boost::shared_ptr< tz_type > new_tz, 
+local_time_in(boost::shared_ptr< tz_type > new_tz, 
               time_duration_type td = time_duration_type(0, 0, 0)) const;

                          returns a local_date_time_base in the given time zone with the optional time_duration added.

                        7. -
                          std::string zone_name(bool as_offset = false) const;
                          Returns name of associated time zone or "Coordinated Universal Time".

                          Optional bool parameter will return time zone as an offset (ie "+07:00" extended iso format). Empty string is returned for classes that do not use a time_zone

                          +
                          std::string zone_name(bool as_offset = false) const;
                          Returns name of associated time zone or "Coordinated Universal Time".

                          Optional bool parameter will return time zone as an offset (ie "+07:00" extended iso format). Empty string is returned for classes that do not use a time_zone

                        8. -
                          std::string zone_abbrev(bool as_offset = false) const;
                          Returns abbreviation of associated time zone or "UTC".

                          Optional bool parameter will return time zone as an offset (ie "+0700" iso format). Empty string is returned for classes that do not use a time_zone

                          +
                          std::string zone_abbrev(bool as_offset = false) const;
                          Returns abbreviation of associated time zone or "UTC".

                          Optional bool parameter will return time zone as an offset (ie "+0700" iso format). Empty string is returned for classes that do not use a time_zone

                        9. -
                          std::string zone_as_posix_string() const;
                          returns a posix_time_zone string for the associated time_zone. If no time_zone, "UTC+00" is returned.
                          10. +
                          std::string zone_as_posix_string() const;
                          returns a posix_time_zone string for the associated time_zone. If no time_zone, "UTC+00" is returned.
                        10. -
                          bool operator==(const local_date_time_base & rhs) const;
                          Equality comparison operator.

                          Equality comparison operator

                          +
                          bool operator==(const local_date_time_base & rhs) const;
                          Equality comparison operator.

                          Equality comparison operator

                        11. -
                          bool operator!=(const local_date_time_base & rhs) const;
                          Non-Equality comparison operator.
                          12. +
                          bool operator!=(const local_date_time_base & rhs) const;
                          Non-Equality comparison operator.
                        12. -
                          bool operator<(const local_date_time_base & rhs) const;
                          Less than comparison operator.
                          13. +
                          bool operator<(const local_date_time_base & rhs) const;
                          Less than comparison operator.
                        13. -
                          bool operator<=(const local_date_time_base & rhs) const;
                          Less than or equal to comparison operator.
                          14. +
                          bool operator<=(const local_date_time_base & rhs) const;
                          Less than or equal to comparison operator.
                        14. -
                          bool operator>(const local_date_time_base & rhs) const;
                          Greater than comparison operator.
                          15. +
                          bool operator>(const local_date_time_base & rhs) const;
                          Greater than comparison operator.
                        15. -
                          bool operator>=(const local_date_time_base & rhs) const;
                          Greater than or equal to comparison operator.
                          16. +
                          bool operator>=(const local_date_time_base & rhs) const;
                          Greater than or equal to comparison operator.
                        16. -
                          local_date_time_base operator+(const date_duration_type & dd) const;
                          Local_date_time + date_duration.
                          17. +
                          local_date_time_base operator+(const date_duration_type & dd) const;
                          Local_date_time + date_duration.
                        17. -
                          local_date_time_base operator+=(const date_duration_type & dd);
                          Local_date_time += date_duration.
                          18. +
                          local_date_time_base operator+=(const date_duration_type & dd);
                          Local_date_time += date_duration.
                        18. -
                          local_date_time_base operator-(const date_duration_type & dd) const;
                          Local_date_time - date_duration.
                          19. +
                          local_date_time_base operator-(const date_duration_type & dd) const;
                          Local_date_time - date_duration.
                        19. -
                          local_date_time_base operator-=(const date_duration_type & dd);
                          Local_date_time -= date_duration.
                          20. +
                          local_date_time_base operator-=(const date_duration_type & dd);
                          Local_date_time -= date_duration.
                        20. -
                          local_date_time_base operator+(const time_duration_type & td) const;
                          Local_date_time + time_duration.
                          21. +
                          local_date_time_base operator+(const time_duration_type & td) const;
                          Local_date_time + time_duration.
                        21. -
                          local_date_time_base operator+=(const time_duration_type & td);
                          Local_date_time += time_duration.
                          22. +
                          local_date_time_base operator+=(const time_duration_type & td);
                          Local_date_time += time_duration.
                        22. -
                          local_date_time_base operator-(const time_duration_type & td) const;
                          Local_date_time - time_duration.
                          23. +
                          local_date_time_base operator-(const time_duration_type & td) const;
                          Local_date_time - time_duration.
                        23. -
                          local_date_time_base operator-=(const time_duration_type & td);
                          Local_date_time -= time_duration.
                          24. +
                          local_date_time_base operator-=(const time_duration_type & td);
                          Local_date_time -= time_duration.
                        24. -
                          time_duration_type operator-(const local_date_time_base & rhs) const;
                          local_date_time -= local_date_time –> time_duration_type
                          25. +
                          time_duration_type operator-(const local_date_time_base & rhs) const;
                          local_date_time -= local_date_time –> time_duration_type
                        -

                        -local_date_time_base public static functions

                        +

                        +local_date_time_base public static functions

                        1. static time_is_dst_result 
-check_dst(date_type d, time_duration_type td, boost::shared_ptr< tz_type > tz);
                          Determines if given time label is in daylight savings for given zone.

                          Determines if given time label is in daylight savings for given zone. Takes a date and time_duration representing a local time, along with time zone, and returns a time_is_dst_result object as result.

                          +check_dst(date_type d, time_duration_type td, boost::shared_ptr< tz_type > tz);Determines if given time label is in daylight savings for given zone.

                          Determines if given time label is in daylight savings for given zone. Takes a date and time_duration representing a local time, along with time zone, and returns a time_is_dst_result object as result.

                        -

                        -local_date_time_base private member functions

                        +

                        +local_date_time_base private member functions

                        1. utc_time_type 
-construction_adjustment(utc_time_type t, boost::shared_ptr< tz_type > z, 
+construction_adjustment(utc_time_type t, boost::shared_ptr< tz_type > z, 
                         bool dst_flag);

                          Adjust the passed in time to UTC?

                        2. -
                          std::string zone_as_offset(const time_duration_type & td, 
+
                          std::string zone_as_offset(const time_duration_type & td, 
                            const std::string & separator) const;
                          
 
                          Simple formatting code – todo remove this?
                          3. diff --git a/doc/html/boost/local_time/operat_1_3_12_15_6_4_2_1_1.html b/doc/html/boost/local_time/operat_1_3_12_15_6_4_2_1_1.html deleted file mode 100644 index 96007b169c..0000000000 --- a/doc/html/boost/local_time/operat_1_3_12_15_6_4_2_1_1.html +++ /dev/null @@ -1,54 +0,0 @@ - - - - -Function operator+ - - - - - - - - - - - - - - - -
                          Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                          -
                          -
                          -PrevUpHomeNext -
                          -
                          -
                          -
                          -

                          Function operator+

                          -

                          boost::local_time::operator+

                          -
                          -

                          Synopsis

                          -
                          // In header: <boost/date_time/local_time/date_duration_operators.hpp>
-
-
-local_date_time 
-operator+(const local_date_time & t, const boost::gregorian::months & m);
                          -
                          -

                          Description

                          -

                          Adds a months object and a local_date_time. Result will be same day-of-month as local_date_time unless original day was the last day of month. see date_time::months_duration for more details

                          -
                          -
                          - - - -
                          Copyright © 2001-2005 CrystalClear Software, Inc

                          Subject to the Boost Software License, Version 1.0. (See accompanying file - LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

                          -
                          -
                          -
                          -PrevUpHomeNext -
                          - - diff --git a/doc/html/boost/local_time/operat_1_3_12_15_6_4_2_1_2.html b/doc/html/boost/local_time/operat_1_3_12_15_6_4_2_1_2.html deleted file mode 100644 index adce80b717..0000000000 --- a/doc/html/boost/local_time/operat_1_3_12_15_6_4_2_1_2.html +++ /dev/null @@ -1,54 +0,0 @@ - - - - -Function operator+= - - - - - - - - - - - - - - - -
                          Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                          -
                          -
                          -PrevUpHomeNext -
                          -
                          -
                          -
                          -

                          Function operator+=

                          -

                          boost::local_time::operator+=

                          -
                          -

                          Synopsis

                          -
                          // In header: <boost/date_time/local_time/date_duration_operators.hpp>
-
-
-local_date_time 
-operator+=(local_date_time & t, const boost::gregorian::months & m);
                          -
                          -

                          Description

                          -

                          Adds a months object to a local_date_time. Result will be same day-of-month as local_date_time unless original day was the last day of month. see date_time::months_duration for more details

                          -
                          -
                          - - - -
                          Copyright © 2001-2005 CrystalClear Software, Inc

                          Subject to the Boost Software License, Version 1.0. (See accompanying file - LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

                          -
                          -
                          -
                          -PrevUpHomeNext -
                          - - diff --git a/doc/html/boost/local_time/operat_1_3_12_15_6_4_2_1_3.html b/doc/html/boost/local_time/operat_1_3_12_15_6_4_2_1_3.html deleted file mode 100644 index af40d8fa2b..0000000000 --- a/doc/html/boost/local_time/operat_1_3_12_15_6_4_2_1_3.html +++ /dev/null @@ -1,54 +0,0 @@ - - - - -Function operator- - - - - - - - - - - - - - - - -
                          Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                          -
                          -
                          -PrevUpHomeNext -
                          -
                          -
                          -
                          -

                          Function operator-

                          -

                          boost::local_time::operator-

                          -
                          -

                          Synopsis

                          -
                          // In header: <boost/date_time/local_time/date_duration_operators.hpp>
-
-
-local_date_time 
-operator-(const local_date_time & t, const boost::gregorian::months & m);
                          -
                          -

                          Description

                          -

                          Subtracts a months object and a local_date_time. Result will be same day-of-month as local_date_time unless original day was the last day of month. see date_time::months_duration for more details

                          -
                          -
                          - - - -
                          Copyright © 2001-2005 CrystalClear Software, Inc

                          Subject to the Boost Software License, Version 1.0. (See accompanying file - LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

                          -
                          -
                          -
                          -PrevUpHomeNext -
                          - - diff --git a/doc/html/boost/local_time/operat_1_3_12_15_6_4_2_1_4.html b/doc/html/boost/local_time/operat_1_3_12_15_6_4_2_1_4.html deleted file mode 100644 index 4443be5a4a..0000000000 --- a/doc/html/boost/local_time/operat_1_3_12_15_6_4_2_1_4.html +++ /dev/null @@ -1,54 +0,0 @@ - - - - -Function operator-= - - - - - - - - - - - - - - - -
                          Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                          -
                          -
                          -PrevUpHomeNext -
                          -
                          -
                          -
                          -

                          Function operator-=

                          -

                          boost::local_time::operator-=

                          -
                          -

                          Synopsis

                          -
                          // In header: <boost/date_time/local_time/date_duration_operators.hpp>
-
-
-local_date_time 
-operator-=(local_date_time & t, const boost::gregorian::months & m);
                          -
                          -

                          Description

                          -

                          Subtracts a months object from a local_date_time. Result will be same day-of-month as local_date_time unless original day was the last day of month. see date_time::months_duration for more details

                          -
                          -
                          - - - -
                          Copyright © 2001-2005 CrystalClear Software, Inc

                          Subject to the Boost Software License, Version 1.0. (See accompanying file - LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

                          -
                          -
                          -
                          -PrevUpHomeNext -
                          - - diff --git a/doc/html/boost/local_time/operat_1_3_12_15_6_4_2_1_5.html b/doc/html/boost/local_time/operat_1_3_12_15_6_4_2_1_5.html deleted file mode 100644 index e33656b92b..0000000000 --- a/doc/html/boost/local_time/operat_1_3_12_15_6_4_2_1_5.html +++ /dev/null @@ -1,54 +0,0 @@ - - - - -Function operator+ - - - - - - - - - - - - - - - -
                          Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                          -
                          -
                          -PrevUpHomeNext -
                          -
                          -
                          -
                          -

                          Function operator+

                          -

                          boost::local_time::operator+

                          -
                          -

                          Synopsis

                          -
                          // In header: <boost/date_time/local_time/date_duration_operators.hpp>
-
-
-local_date_time 
-operator+(const local_date_time & t, const boost::gregorian::years & y);
                          -
                          -

                          Description

                          -

                          Adds a years object and a local_date_time. Result will be same month and day-of-month as local_date_time unless original day was the last day of month. see date_time::years_duration for more details

                          -
                          -
                          - - - -
                          Copyright © 2001-2005 CrystalClear Software, Inc

                          Subject to the Boost Software License, Version 1.0. (See accompanying file - LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

                          -
                          -
                          -
                          -PrevUpHomeNext -
                          - - diff --git a/doc/html/boost/local_time/operat_1_3_12_15_6_4_2_1_6.html b/doc/html/boost/local_time/operat_1_3_12_15_6_4_2_1_6.html deleted file mode 100644 index eef227aae7..0000000000 --- a/doc/html/boost/local_time/operat_1_3_12_15_6_4_2_1_6.html +++ /dev/null @@ -1,54 +0,0 @@ - - - - -Function operator+= - - - - - - - - - - - - - - - -
                          Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                          -
                          -
                          -PrevUpHomeNext -
                          -
                          -
                          -
                          -

                          Function operator+=

                          -

                          boost::local_time::operator+=

                          -
                          -

                          Synopsis

                          -
                          // In header: <boost/date_time/local_time/date_duration_operators.hpp>
-
-
-local_date_time 
-operator+=(local_date_time & t, const boost::gregorian::years & y);
                          -
                          -

                          Description

                          -

                          Adds a years object to a local_date_time. Result will be same month and day-of-month as local_date_time unless original day was the last day of month. see date_time::years_duration for more details

                          -
                          -
                          - - - -
                          Copyright © 2001-2005 CrystalClear Software, Inc

                          Subject to the Boost Software License, Version 1.0. (See accompanying file - LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

                          -
                          -
                          -
                          -PrevUpHomeNext -
                          - - diff --git a/doc/html/boost/local_time/operat_1_3_12_15_6_4_2_1_7.html b/doc/html/boost/local_time/operat_1_3_12_15_6_4_2_1_7.html deleted file mode 100644 index 85d68454d4..0000000000 --- a/doc/html/boost/local_time/operat_1_3_12_15_6_4_2_1_7.html +++ /dev/null @@ -1,54 +0,0 @@ - - - - -Function operator- - - - - - - - - - - - - - - - -
                          Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                          -
                          -
                          -PrevUpHomeNext -
                          -
                          -
                          -
                          -

                          Function operator-

                          -

                          boost::local_time::operator-

                          -
                          -

                          Synopsis

                          -
                          // In header: <boost/date_time/local_time/date_duration_operators.hpp>
-
-
-local_date_time 
-operator-(const local_date_time & t, const boost::gregorian::years & y);
                          -
                          -

                          Description

                          -

                          Subtracts a years object and a local_date_time. Result will be same month and day-of-month as local_date_time unless original day was the last day of month. see date_time::years_duration for more details

                          -
                          -
                          - - - -
                          Copyright © 2001-2005 CrystalClear Software, Inc

                          Subject to the Boost Software License, Version 1.0. (See accompanying file - LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

                          -
                          -
                          -
                          -PrevUpHomeNext -
                          - - diff --git a/doc/html/boost/local_time/operat_1_3_12_15_6_4_2_1_8.html b/doc/html/boost/local_time/operat_1_3_12_15_6_4_2_1_8.html deleted file mode 100644 index cd57c51943..0000000000 --- a/doc/html/boost/local_time/operat_1_3_12_15_6_4_2_1_8.html +++ /dev/null @@ -1,54 +0,0 @@ - - - - -Function operator-= - - - - - - - - - - - - - - - -
                          Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                          -
                          -
                          -PrevUpHomeNext -
                          -
                          -
                          -
                          -

                          Function operator-=

                          -

                          boost::local_time::operator-=

                          -
                          -

                          Synopsis

                          -
                          // In header: <boost/date_time/local_time/date_duration_operators.hpp>
-
-
-local_date_time 
-operator-=(local_date_time & t, const boost::gregorian::years & y);
                          -
                          -

                          Description

                          -

                          Subtracts a years object from a local_date_time. Result will be same month and day-of-month as local_date_time unless original day was the last day of month. see date_time::years_duration for more details

                          -
                          -
                          - - - -
                          Copyright © 2001-2005 CrystalClear Software, Inc

                          Subject to the Boost Software License, Version 1.0. (See accompanying file - LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

                          -
                          -
                          -
                          -PrevUpHomeNext -
                          - - diff --git a/doc/html/boost/local_time/operat_1_3_13_15_6_4_2_1_1.html b/doc/html/boost/local_time/operat_1_3_13_15_6_4_2_1_1.html new file mode 100644 index 0000000000..feec90940f --- /dev/null +++ b/doc/html/boost/local_time/operat_1_3_13_15_6_4_2_1_1.html @@ -0,0 +1,54 @@ + + + + +Function operator+ + + + + + + + + + + + + + + + +
                          Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                          +
                          +
                          +PrevUpHomeNext +
                          +
                          +
                          +
                          +

                          Function operator+

                          +

                          boost::local_time::operator+

                          +
                          +

                          Synopsis

                          +
                          // In header: <boost/date_time/local_time/date_duration_operators.hpp>
+
+
+local_date_time 
+operator+(const local_date_time & t, const boost::gregorian::months & m);
                          +
                          +

                          Description

                          +

                          Adds a months object and a local_date_time. Result will be same day-of-month as local_date_time unless original day was the last day of month. see date_time::months_duration for more details

                          +
                          +
                          + + + +
                          Copyright © 2001-2005 CrystalClear Software, Inc

                          Subject to the Boost Software License, Version 1.0. (See accompanying file + LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

                          +
                          +
                          +
                          +PrevUpHomeNext +
                          + + diff --git a/doc/html/boost/local_time/operat_1_3_13_15_6_4_2_1_2.html b/doc/html/boost/local_time/operat_1_3_13_15_6_4_2_1_2.html new file mode 100644 index 0000000000..795c4085d8 --- /dev/null +++ b/doc/html/boost/local_time/operat_1_3_13_15_6_4_2_1_2.html @@ -0,0 +1,54 @@ + + + + +Function operator+= + + + + + + + + + + + + + + + +
                          Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                          +
                          +
                          +PrevUpHomeNext +
                          +
                          +
                          +
                          +

                          Function operator+=

                          +

                          boost::local_time::operator+=

                          +
                          +

                          Synopsis

                          +
                          // In header: <boost/date_time/local_time/date_duration_operators.hpp>
+
+
+local_date_time 
+operator+=(local_date_time & t, const boost::gregorian::months & m);
                          +
                          +

                          Description

                          +

                          Adds a months object to a local_date_time. Result will be same day-of-month as local_date_time unless original day was the last day of month. see date_time::months_duration for more details

                          +
                          +
                          + + + +
                          Copyright © 2001-2005 CrystalClear Software, Inc

                          Subject to the Boost Software License, Version 1.0. (See accompanying file + LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

                          +
                          +
                          +
                          +PrevUpHomeNext +
                          + + diff --git a/doc/html/boost/local_time/operat_1_3_13_15_6_4_2_1_3.html b/doc/html/boost/local_time/operat_1_3_13_15_6_4_2_1_3.html new file mode 100644 index 0000000000..4258de95d5 --- /dev/null +++ b/doc/html/boost/local_time/operat_1_3_13_15_6_4_2_1_3.html @@ -0,0 +1,54 @@ + + + + +Function operator- + + + + + + + + + + + + + + + +
                          Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                          +
                          +
                          +PrevUpHomeNext +
                          +
                          +
                          +
                          +

                          Function operator-

                          +

                          boost::local_time::operator-

                          +
                          +

                          Synopsis

                          +
                          // In header: <boost/date_time/local_time/date_duration_operators.hpp>
+
+
+local_date_time 
+operator-(const local_date_time & t, const boost::gregorian::months & m);
                          +
                          +

                          Description

                          +

                          Subtracts a months object and a local_date_time. Result will be same day-of-month as local_date_time unless original day was the last day of month. see date_time::months_duration for more details

                          +
                          +
                          + + + +
                          Copyright © 2001-2005 CrystalClear Software, Inc

                          Subject to the Boost Software License, Version 1.0. (See accompanying file + LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

                          +
                          +
                          +
                          +PrevUpHomeNext +
                          + + diff --git a/doc/html/boost/local_time/operat_1_3_13_15_6_4_2_1_4.html b/doc/html/boost/local_time/operat_1_3_13_15_6_4_2_1_4.html new file mode 100644 index 0000000000..5d3d45d127 --- /dev/null +++ b/doc/html/boost/local_time/operat_1_3_13_15_6_4_2_1_4.html @@ -0,0 +1,54 @@ + + + + +Function operator-= + + + + + + + + + + + + + + + +
                          Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                          +
                          +
                          +PrevUpHomeNext +
                          +
                          +
                          +
                          +

                          Function operator-=

                          +

                          boost::local_time::operator-=

                          +
                          +

                          Synopsis

                          +
                          // In header: <boost/date_time/local_time/date_duration_operators.hpp>
+
+
+local_date_time 
+operator-=(local_date_time & t, const boost::gregorian::months & m);
                          +
                          +

                          Description

                          +

                          Subtracts a months object from a local_date_time. Result will be same day-of-month as local_date_time unless original day was the last day of month. see date_time::months_duration for more details

                          +
                          +
                          + + + +
                          Copyright © 2001-2005 CrystalClear Software, Inc

                          Subject to the Boost Software License, Version 1.0. (See accompanying file + LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

                          +
                          +
                          +
                          +PrevUpHomeNext +
                          + + diff --git a/doc/html/boost/local_time/operat_1_3_13_15_6_4_2_1_5.html b/doc/html/boost/local_time/operat_1_3_13_15_6_4_2_1_5.html new file mode 100644 index 0000000000..ad273ad7da --- /dev/null +++ b/doc/html/boost/local_time/operat_1_3_13_15_6_4_2_1_5.html @@ -0,0 +1,54 @@ + + + + +Function operator+ + + + + + + + + + + + + + + + +
                          Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                          +
                          +
                          +PrevUpHomeNext +
                          +
                          +
                          +
                          +

                          Function operator+

                          +

                          boost::local_time::operator+

                          +
                          +

                          Synopsis

                          +
                          // In header: <boost/date_time/local_time/date_duration_operators.hpp>
+
+
+local_date_time 
+operator+(const local_date_time & t, const boost::gregorian::years & y);
                          +
                          +

                          Description

                          +

                          Adds a years object and a local_date_time. Result will be same month and day-of-month as local_date_time unless original day was the last day of month. see date_time::years_duration for more details

                          +
                          +
                          + + + +
                          Copyright © 2001-2005 CrystalClear Software, Inc

                          Subject to the Boost Software License, Version 1.0. (See accompanying file + LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

                          +
                          +
                          +
                          +PrevUpHomeNext +
                          + + diff --git a/doc/html/boost/local_time/operat_1_3_13_15_6_4_2_1_6.html b/doc/html/boost/local_time/operat_1_3_13_15_6_4_2_1_6.html new file mode 100644 index 0000000000..f703a8ccd9 --- /dev/null +++ b/doc/html/boost/local_time/operat_1_3_13_15_6_4_2_1_6.html @@ -0,0 +1,54 @@ + + + + +Function operator+= + + + + + + + + + + + + + + + +
                          Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                          +
                          +
                          +PrevUpHomeNext +
                          +
                          +
                          +
                          +

                          Function operator+=

                          +

                          boost::local_time::operator+=

                          +
                          +

                          Synopsis

                          +
                          // In header: <boost/date_time/local_time/date_duration_operators.hpp>
+
+
+local_date_time 
+operator+=(local_date_time & t, const boost::gregorian::years & y);
                          +
                          +

                          Description

                          +

                          Adds a years object to a local_date_time. Result will be same month and day-of-month as local_date_time unless original day was the last day of month. see date_time::years_duration for more details

                          +
                          +
                          + + + +
                          Copyright © 2001-2005 CrystalClear Software, Inc

                          Subject to the Boost Software License, Version 1.0. (See accompanying file + LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

                          +
                          +
                          +
                          +PrevUpHomeNext +
                          + + diff --git a/doc/html/boost/local_time/operat_1_3_13_15_6_4_2_1_7.html b/doc/html/boost/local_time/operat_1_3_13_15_6_4_2_1_7.html new file mode 100644 index 0000000000..a9d8586c5c --- /dev/null +++ b/doc/html/boost/local_time/operat_1_3_13_15_6_4_2_1_7.html @@ -0,0 +1,54 @@ + + + + +Function operator- + + + + + + + + + + + + + + + +
                          Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                          +
                          +
                          +PrevUpHomeNext +
                          +
                          +
                          +
                          +

                          Function operator-

                          +

                          boost::local_time::operator-

                          +
                          +

                          Synopsis

                          +
                          // In header: <boost/date_time/local_time/date_duration_operators.hpp>
+
+
+local_date_time 
+operator-(const local_date_time & t, const boost::gregorian::years & y);
                          +
                          +

                          Description

                          +

                          Subtracts a years object and a local_date_time. Result will be same month and day-of-month as local_date_time unless original day was the last day of month. see date_time::years_duration for more details

                          +
                          +
                          + + + +
                          Copyright © 2001-2005 CrystalClear Software, Inc

                          Subject to the Boost Software License, Version 1.0. (See accompanying file + LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

                          +
                          +
                          +
                          +PrevUpHomeNext +
                          + + diff --git a/doc/html/boost/local_time/operat_1_3_13_15_6_4_2_1_8.html b/doc/html/boost/local_time/operat_1_3_13_15_6_4_2_1_8.html new file mode 100644 index 0000000000..ccc1852c84 --- /dev/null +++ b/doc/html/boost/local_time/operat_1_3_13_15_6_4_2_1_8.html @@ -0,0 +1,54 @@ + + + + +Function operator-= + + + + + + + + + + + + + + + +
                          Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                          +
                          +
                          +PrevUpHomeNext +
                          +
                          +
                          +
                          +

                          Function operator-=

                          +

                          boost::local_time::operator-=

                          +
                          +

                          Synopsis

                          +
                          // In header: <boost/date_time/local_time/date_duration_operators.hpp>
+
+
+local_date_time 
+operator-=(local_date_time & t, const boost::gregorian::years & y);
                          +
                          +

                          Description

                          +

                          Subtracts a years object from a local_date_time. Result will be same month and day-of-month as local_date_time unless original day was the last day of month. see date_time::years_duration for more details

                          +
                          +
                          + + + +
                          Copyright © 2001-2005 CrystalClear Software, Inc

                          Subject to the Boost Software License, Version 1.0. (See accompanying file + LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

                          +
                          +
                          +
                          +PrevUpHomeNext +
                          + + diff --git a/doc/html/boost/local_time/partial_date_rule_spec.html b/doc/html/boost/local_time/partial_date_rule_spec.html index 71de18f7bd..228204757b 100644 --- a/doc/html/boost/local_time/partial_date_rule_spec.html +++ b/doc/html/boost/local_time/partial_date_rule_spec.html @@ -7,7 +7,7 @@ - + @@ -21,7 +21,7 @@
                          -PrevUpHomeNext +PrevUpHomeNext
                          @@ -48,7 +48,7 @@
                          -PrevUpHomeNext +PrevUpHomeNext
                          diff --git a/doc/html/boost/local_time/posix_time_zone_base.html b/doc/html/boost/local_time/posix_time_zone_base.html index 0521ba1e24..1bba875eb1 100644 --- a/doc/html/boost/local_time/posix_time_zone_base.html +++ b/doc/html/boost/local_time/posix_time_zone_base.html @@ -49,33 +49,33 @@ typedef tokenizer_type::iterator tokenizer_iterator_type; // construct/copy/destruct - posix_time_zone_base(const string_type &); - ~posix_time_zone_base(); + posix_time_zone_base(const string_type &); + ~posix_time_zone_base(); - // public member functions - virtual string_type std_zone_abbrev() const; - virtual string_type dst_zone_abbrev() const; - virtual string_type std_zone_name() const; - virtual string_type dst_zone_name() const; - virtual bool has_dst() const; - virtual posix_time::ptime dst_local_start_time(gregorian::greg_year) const; - virtual posix_time::ptime dst_local_end_time(gregorian::greg_year) const; - virtual time_duration_type base_utc_offset() const; - virtual time_duration_type dst_offset() const; - virtual string_type to_posix_string() const; + // public member functions + virtual string_type std_zone_abbrev() const; + virtual string_type dst_zone_abbrev() const; + virtual string_type std_zone_name() const; + virtual string_type dst_zone_name() const; + virtual bool has_dst() const; + virtual posix_time::ptime dst_local_start_time(gregorian::greg_year) const; + virtual posix_time::ptime dst_local_end_time(gregorian::greg_year) const; + virtual time_duration_type base_utc_offset() const; + virtual time_duration_type dst_offset() const; + virtual string_type to_posix_string() const; - // private member functions - void calc_zone(const string_type &); - void calc_rules(const string_type &, const string_type &); - void M_func(const string_type &, const string_type &); - void julian_no_leap(const string_type &, const string_type &); - void julian_day(const string_type &, const string_type &); + // private member functions + void calc_zone(const string_type &); + void calc_rules(const string_type &, const string_type &); + void M_func(const string_type &, const string_type &); + void julian_no_leap(const string_type &, const string_type &); + void julian_day(const string_type &, const string_type &); - // private static functions - static std::string td_as_string(const time_duration_type &); + // private static functions + static std::string td_as_string(const time_duration_type &); };
                          -

                          Description

                          +

                          Description

                          A POSIX time zone string takes the form of:
                          "std offset dst [offset],start[/time],end[/time]" (w/no spaces) 'std' specifies the abbrev of the time zone.
                          'offset' is the offset from UTC.
                          @@ -99,66 +99,66 @@

                          Note that UTC zone offsets can be greater than +12: http://www.worldtimezone.com/utc/utc+1200.html

                          -

                          +

                          posix_time_zone_base public construct/copy/destruct

                          1. -
                            posix_time_zone_base(const string_type & s);
                            Construct from a POSIX time zone string.
                            2. -
                          2. ~posix_time_zone_base();
                            3. +
                            posix_time_zone_base(const string_type & s);
                            Construct from a POSIX time zone string. +
                          3. ~posix_time_zone_base();
                          -

                          -posix_time_zone_base public member functions

                          +

                          +posix_time_zone_base public member functions

                          1. -
                            virtual string_type std_zone_abbrev() const;
                            String for the zone when not in daylight savings (eg: EST)
                            2. +
                            virtual string_type std_zone_abbrev() const;
                            String for the zone when not in daylight savings (eg: EST)
                          2. -
                            virtual string_type dst_zone_abbrev() const;
                            String for the timezone when in daylight savings (eg: EDT)

                            For those time zones that have no DST, an empty string is used

                            +
                            virtual string_type dst_zone_abbrev() const;
                            String for the timezone when in daylight savings (eg: EDT)

                            For those time zones that have no DST, an empty string is used

                          3. -
                            virtual string_type std_zone_name() const;
                            String for the zone when not in daylight savings (eg: Eastern Standard Time)

                            The full STD name is not extracted from the posix time zone string. Therefore, the STD abbreviation is used in it's place

                            +
                            virtual string_type std_zone_name() const;
                            String for the zone when not in daylight savings (eg: Eastern Standard Time)

                            The full STD name is not extracted from the posix time zone string. Therefore, the STD abbreviation is used in it's place

                          4. -
                            virtual string_type dst_zone_name() const;
                            String for the timezone when in daylight savings (eg: Eastern Daylight Time)

                            The full DST name is not extracted from the posix time zone string. Therefore, the STD abbreviation is used in it's place. For time zones that have no DST, an empty string is used

                            +
                            virtual string_type dst_zone_name() const;
                            String for the timezone when in daylight savings (eg: Eastern Daylight Time)

                            The full DST name is not extracted from the posix time zone string. Therefore, the STD abbreviation is used in it's place. For time zones that have no DST, an empty string is used

                          5. -
                            virtual bool has_dst() const;
                            True if zone uses daylight savings adjustments otherwise false.
                            6. +
                            virtual bool has_dst() const;
                            True if zone uses daylight savings adjustments otherwise false.
                          6. -
                            virtual posix_time::ptime dst_local_start_time(gregorian::greg_year y) const;
                            Local time that DST starts – NADT if has_dst is false.
                            7. +
                            virtual posix_time::ptime dst_local_start_time(gregorian::greg_year y) const;
                            Local time that DST starts – NADT if has_dst is false.
                          7. -
                            virtual posix_time::ptime dst_local_end_time(gregorian::greg_year y) const;
                            Local time that DST ends – NADT if has_dst is false.
                            8. +
                            virtual posix_time::ptime dst_local_end_time(gregorian::greg_year y) const;
                            Local time that DST ends – NADT if has_dst is false.
                          8. -
                            virtual time_duration_type base_utc_offset() const;
                            Base offset from UTC for zone (eg: -07:30:00)
                            9. +
                            virtual time_duration_type base_utc_offset() const;
                            Base offset from UTC for zone (eg: -07:30:00)
                          9. -
                            virtual time_duration_type dst_offset() const;
                            Adjustment forward or back made while DST is in effect.
                            10. +
                            virtual time_duration_type dst_offset() const;
                            Adjustment forward or back made while DST is in effect.
                          10. -
                            virtual string_type to_posix_string() const;
                            Returns a POSIX time_zone string for this object.
                            11. +
                            virtual string_type to_posix_string() const;
                            Returns a POSIX time_zone string for this object.
                          -

                          -posix_time_zone_base private member functions

                          +

                          +posix_time_zone_base private member functions

                          1. -
                            void calc_zone(const string_type & obj);
                            +
                            void calc_zone(const string_type & obj);

                            Extract time zone abbreviations for STD & DST as well as the offsets for the time shift that occurs and how much of a shift. At this time full time zone names are NOT extracted so the abbreviations are used in their place

                            2. -
                          2. void calc_rules(const string_type & start, const string_type & end);
                            3. -
                          3. void M_func(const string_type & s, const string_type & e);
                            4. +
                          4. void calc_rules(const string_type & start, const string_type & end);
                            5. +
                          5. void M_func(const string_type & s, const string_type & e);
                          6. -
                            void julian_no_leap(const string_type & s, const string_type & e);
                            Julian day. Feb29 is never counted, even in leap years.
                            7. +
                            void julian_no_leap(const string_type & s, const string_type & e);
                            Julian day. Feb29 is never counted, even in leap years.
                          7. -
                            void julian_day(const string_type & s, const string_type & e);
                            Julian day. Feb29 is always counted, but exception thrown in non-leap years.
                            8. +
                            void julian_day(const string_type & s, const string_type & e);
                            Julian day. Feb29 is always counted, but exception thrown in non-leap years.
                          -

                          -posix_time_zone_base private static functions

                          +

                          +posix_time_zone_base private static functions

                          1. -
                            static std::string td_as_string(const time_duration_type & td);
                            helper function used when throwing exceptions
                          +
                          static std::string td_as_string(const time_duration_type & td);
                          helper function used when throwing exceptions
                      diff --git a/doc/html/boost/local_time/time_label_invalid.html b/doc/html/boost/local_time/time_label_invalid.html index 0954f69d7a..89e33ca4ce 100644 --- a/doc/html/boost/local_time/time_label_invalid.html +++ b/doc/html/boost/local_time/time_label_invalid.html @@ -35,16 +35,16 @@ struct time_label_invalid : public logic_error { // construct/copy/destruct - time_label_invalid(std::string const & = std::string()); + time_label_invalid(std::string const & = std::string()); };
                      -

                      Description

                      +

                      Description

                      -

                      +

                      time_label_invalid public construct/copy/destruct

                      -
                      1. time_label_invalid(std::string const & msg = std::string());
                      +
                      1. time_label_invalid(std::string const & msg = std::string());
                      diff --git a/doc/html/boost/local_time/tz_database.html b/doc/html/boost/local_time/tz_database.html index f2a0d37b1b..f7e3bac205 100644 --- a/doc/html/boost/local_time/tz_database.html +++ b/doc/html/boost/local_time/tz_database.html @@ -8,7 +8,7 @@ - + @@ -35,7 +35,7 @@ typedefdate_time::tz_db_base<custom_time_zone,nth_kday_dst_rule>tz_database;
                      -

                      Description

                      +

                      Description

                      Object populated with boost::shared_ptr<time_zone_base> objects Database is populated from specs stored in external csv file. See date_time::tz_db_base for greater detail

                      diff --git a/doc/html/boost/lockfree/spsc_queue.html b/doc/html/boost/lockfree/spsc_queue.html index 2cdc155359..d648ab68ce 100644 --- a/doc/html/boost/lockfree/spsc_queue.html +++ b/doc/html/boost/lockfree/spsc_queue.html @@ -8,7 +8,7 @@ - +
                      @@ -21,7 +21,7 @@
                      -PrevUpHomeNext +PrevUpHomeNext
                      @@ -32,7 +32,7 @@

                      Synopsis

                      // In header: <boost/lockfree/spsc_queue.hpp>
 
-template<typename T, typename... Options> 
+template<typename T, typename A0, typename A1> 
 class spsc_queue {
 public:
   // types
@@ -40,41 +40,49 @@
   typedef implementation_defined::allocator allocator; 
   typedef implementation_defined::size_type size_type; 
 
+  // member classes/structs/unions
+  template<typename T, typename... Options> 
+  struct implementation_defined {
+    // types
+    typedef allocator_arg allocator;
+    typedef std::size_t   size_type;
+  };
+
   // construct/copy/destruct
-  spsc_queue(void);
+  spsc_queue(void);
   template<typename U> 
-    explicit spsc_queue(typename allocator::template rebind< U >::other const &);
-  explicit spsc_queue(allocator const &);
-  explicit spsc_queue(size_type);
+    explicit spsc_queue(typename allocator::template rebind< U >::other const &);
+  explicit spsc_queue(allocator const &);
+  explicit spsc_queue(size_type);
   template<typename U> 
-    spsc_queue(size_type, 
+    spsc_queue(size_type, 
                typename allocator::template rebind< U >::other const &);
-  spsc_queue(size_type, allocator_arg const &);
+  spsc_queue(size_type, allocator_arg const &);
 
-  // public member functions
-  bool push(T const &);
-  bool pop();
+  // public member functions
+  bool push(T const &);
+  bool pop();
   template<typename U> 
     boost::enable_if< typename is_convertible< T, U >::type, bool >::type 
-    pop(U &);
-  size_type push(T const *, size_type);
-  template<size_type size> size_type push(T const (&));
+    pop(U &);
+  size_type push(T const *, size_type);
+  template<size_type size> size_type push(T const (&));
   template<typename ConstIterator> 
-    ConstIterator push(ConstIterator, ConstIterator);
-  size_type pop(T *, size_type);
-  template<size_type size> size_type pop(T(&));
+    ConstIterator push(ConstIterator, ConstIterator);
+  size_type pop(T *, size_type);
+  template<size_type size> size_type pop(T(&));
   template<typename OutputIterator> 
     boost::disable_if< typename is_convertible< T, OutputIterator >::type, size_type >::type 
-    pop(OutputIterator);
-  template<typename Functor> bool consume_one(Functor &);
-  template<typename Functor> bool consume_one(Functor const &);
-  template<typename Functor> size_type consume_all(Functor &);
-  template<typename Functor> size_type consume_all(Functor const &);
-  size_type read_available() const;
-  size_type write_available() const;
-  const T & front() const;
-  T & front();
-  void reset(void);
+    pop(OutputIterator);
+  template<typename Functor> bool consume_one(Functor &);
+  template<typename Functor> bool consume_one(Functor const &);
+  template<typename Functor> size_type consume_all(Functor &);
+  template<typename Functor> size_type consume_all(Functor const &);
+  size_type read_available() const;
+  size_type write_available() const;
+  const T & front() const;
+  T & front();
+  void reset(void);
 };

                      Description

                      @@ -102,7 +110,7 @@ construct/copy/destruct
                      1. -
                        spsc_queue(void);
                        +
                        spsc_queue(void);

                        Constructs a spsc_queue

                        @@ -118,10 +126,10 @@ 
                    8. template<typename U> 
-  explicit spsc_queue(typename allocator::template rebind< U >::other const &);
                      9. -
                    9. explicit spsc_queue(allocator const &);
                      10. + explicit spsc_queue(typename allocator::template rebind< U >::other const &); +
                    10. explicit spsc_queue(allocator const &);
                    11. -
                      explicit spsc_queue(size_type element_count);
                      +
                      explicit spsc_queue(size_type element_count);

                      Constructs a spsc_queue for element_count elements

                      @@ -137,17 +145,17 @@ 
                  8. template<typename U> 
-  spsc_queue(size_type element_count, 
+  spsc_queue(size_type element_count, 
              typename allocator::template rebind< U >::other const & alloc);
                    9. -
                  9. spsc_queue(size_type element_count, allocator_arg const & alloc);
                    10. +
                  10. spsc_queue(size_type element_count, allocator_arg const & alloc);

                  -spsc_queue public member functions

                  +spsc_queue public member functions
                  1. -
                    bool push(T const & t);
                    +
                    bool push(T const & t);

                    Pushes object t to the ringbuffer.

                    @@ -184,7 +192,7 @@

                4. -
                  bool pop();
                  +
                  bool pop();

                  Pops one object from ringbuffer.

                  @@ -223,7 +231,7 @@ 

                5. template<typename U> 
   boost::enable_if< typename is_convertible< T, U >::type, bool >::type 
-  pop(U & ret);
                  + pop(U & ret);

                  Pops one object from ringbuffer.

                  @@ -260,7 +268,7 @@

                6. -
                  size_type push(T const * t, size_type size);
                  +
                  size_type push(T const * t, size_type size);

                  Pushes as many objects from the array t as there is space.

                  @@ -292,7 +300,7 @@

                7. -
                  template<size_type size> size_type push(T const (&) t);
                  +
                  template<size_type size> size_type push(T const (&) t);

                  Pushes as many objects from the array t as there is space available.

                  @@ -325,7 +333,7 @@ 

                8. template<typename ConstIterator> 
-  ConstIterator push(ConstIterator begin, ConstIterator end);
                  + ConstIterator push(ConstIterator begin, ConstIterator end);

                  Pushes as many objects from the range [begin, end) as there is space .

                  @@ -357,7 +365,7 @@

              38. -
                size_type pop(T * ret, size_type size);
                +
                size_type pop(T * ret, size_type size);

                Pops a maximum of size objects from ringbuffer.

                @@ -389,7 +397,7 @@

            8. -
              template<size_type size> size_type pop(T(&) ret);
              +
              template<size_type size> size_type pop(T(&) ret);

              Pops a maximum of size objects from spsc_queue.

              @@ -423,7 +431,7 @@ 

            9. template<typename OutputIterator> 
   boost::disable_if< typename is_convertible< T, OutputIterator >::type, size_type >::type 
-  pop(OutputIterator it);
              + pop(OutputIterator it);

              Pops objects to the output iterator it

              @@ -455,7 +463,7 @@

          8. -
            template<typename Functor> bool consume_one(Functor & f);
            +
            template<typename Functor> bool consume_one(Functor & f);

            consumes one element via a functor

            pops one element from the queue and applies the functor on this object

            @@ -481,7 +489,7 @@

        4. -
          template<typename Functor> bool consume_one(Functor const & f);
          +
          template<typename Functor> bool consume_one(Functor const & f);

          consumes one element via a functor

          pops one element from the queue and applies the functor on this object

          @@ -507,7 +515,7 @@

        5. -
          template<typename Functor> size_type consume_all(Functor & f);
          +
          template<typename Functor> size_type consume_all(Functor & f);

          consumes all elements via a functor

          sequentially pops all elements from the queue and applies the functor on each object

          @@ -533,7 +541,7 @@

        6. -
          template<typename Functor> size_type consume_all(Functor const & f);
          +
          template<typename Functor> size_type consume_all(Functor const & f);

          consumes all elements via a functor

          sequentially pops all elements from the queue and applies the functor on each object

          @@ -559,7 +567,7 @@

      38. -
        size_type read_available() const;
        +
        size_type read_available() const;

        get number of elements that are available for read

        @@ -584,7 +592,7 @@
    15. -
      size_type write_available() const;
      +
      size_type write_available() const;

      get write space to write elements

      @@ -609,7 +617,7 @@
  • -
    const T & front() const;
    +
    const T & front() const;

    get reference to element in the front of the queue

    Availability of front element can be checked using read_available().

    @@ -645,7 +653,7 @@

  • -
    T & front();
    +
    T & front();

    get reference to element in the front of the queue

    Availability of front element can be checked using read_available().

    @@ -681,7 +689,7 @@

  • -
    void reset(void);
    +
    void reset(void);

    reset the ringbuffer

    @@ -708,7 +716,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/lockfree/spsc_queue/implementation_defined.html b/doc/html/boost/lockfree/spsc_queue/implementation_defined.html new file mode 100644 index 0000000000..24a517be74 --- /dev/null +++ b/doc/html/boost/lockfree/spsc_queue/implementation_defined.html @@ -0,0 +1,57 @@ + + + + +Struct template implementation_defined + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Struct template implementation_defined

    +

    boost::lockfree::spsc_queue::implementation_defined

    +
    +

    Synopsis

    +
    // In header: <boost/lockfree/spsc_queue.hpp>
+
+
+template<typename T, typename... Options> 
+struct implementation_defined {
+  // types
+  typedef allocator_arg allocator;
+  typedef std::size_t   size_type;
+};
    +
    + + + +
    Copyright © 2008-2011 Tim + Blechmann

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/lockfree/stack.html b/doc/html/boost/lockfree/stack.html index aa807e0963..d3b7c8f5fe 100644 --- a/doc/html/boost/lockfree/stack.html +++ b/doc/html/boost/lockfree/stack.html @@ -7,7 +7,7 @@ - + @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -852,7 +852,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/logic/get_default_in_idp31765120.html b/doc/html/boost/logic/get_default_in_idp31765120.html new file mode 100644 index 0000000000..a57814d1ff --- /dev/null +++ b/doc/html/boost/logic/get_default_in_idp31765120.html @@ -0,0 +1,54 @@ + + + + +Function template get_default_indeterminate_name + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Function template get_default_indeterminate_name

    +

    boost::logic::get_default_indeterminate_name — Returns a string containing the default name for the indeterminate value of a tribool with the given character type T.

    +
    +

    Synopsis

    +
    // In header: <boost/logic/tribool_io.hpp>
+
+
+template<typename T> std::basic_string< T > get_default_indeterminate_name();
    +
    +

    Description

    +

    This routine is used by the input and output streaming operators for tribool when there is no locale support or the stream's locale does not contain the indeterminate_name facet.

    +
    +
    + + + +
    Copyright © 2002-2004 Douglas Gregor

    Use, modification and distribution is subject to the Boost + Software License, Version 1.0. (See accompanying file + LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/logic/get_default_in_idp39719728.html b/doc/html/boost/logic/get_default_in_idp39719728.html deleted file mode 100644 index a9c0a62414..0000000000 --- a/doc/html/boost/logic/get_default_in_idp39719728.html +++ /dev/null @@ -1,54 +0,0 @@ - - - - -Function template get_default_indeterminate_name - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Function template get_default_indeterminate_name

    -

    boost::logic::get_default_indeterminate_name — Returns a string containing the default name for the indeterminate value of a tribool with the given character type T.

    -
    -

    Synopsis

    -
    // In header: <boost/logic/tribool_io.hpp>
-
-
-template<typename T> std::basic_string< T > get_default_indeterminate_name();
    -
    -

    Description

    -

    This routine is used by the input and output streaming operators for tribool when there is no locale support or the stream's locale does not contain the indeterminate_name facet.

    -
    -
    - - - -
    Copyright © 2002-2004 Douglas Gregor

    Use, modification and distribution is subject to the Boost - Software License, Version 1.0. (See accompanying file - LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/logic/indeterminate_name.html b/doc/html/boost/logic/indeterminate_name.html index a727f6912c..89fc97143e 100644 --- a/doc/html/boost/logic/indeterminate_name.html +++ b/doc/html/boost/logic/indeterminate_name.html @@ -8,7 +8,7 @@ - + @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -40,11 +40,11 @@ typedef std::basic_string< CharT > string_type; // construct/copy/destruct - indeterminate_name(); - explicit indeterminate_name(const string_type &); + indeterminate_name(); + explicit indeterminate_name(const string_type &); - // public member functions - string_type name() const; + // public member functions + string_type name() const; // public data members static std::locale::id id; // Uniquily identifies this facet with the locale. @@ -59,16 +59,16 @@ construct/copy/destruct
    1. -
      indeterminate_name();
      Construct the facet with the default name.
      2. +
      indeterminate_name();
      Construct the facet with the default name.
    2. -
      explicit indeterminate_name(const string_type & initial_name);
      Construct the facet with the given name for the indeterminate value.
      3. +
      explicit indeterminate_name(const string_type & initial_name);
      Construct the facet with the given name for the indeterminate value.

    -indeterminate_name public member functions

    +indeterminate_name public member functions
    1. -
      string_type name() const;
      Returns the name for the indeterminate value.
    +
    string_type name() const;
    Returns the name for the indeterminate value.
    • @@ -81,7 +81,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/logic/operator_idp31661568.html b/doc/html/boost/logic/operator_idp31661568.html new file mode 100644 index 0000000000..df7ba4df12 --- /dev/null +++ b/doc/html/boost/logic/operator_idp31661568.html @@ -0,0 +1,114 @@ + + + + +Function operator|| + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Function operator||

    +

    boost::logic::operator|| — Computes the logical disjunction of two tribools.

    +
    +

    Synopsis

    +
    // In header: <boost/logic/tribool.hpp>
+
+
+BOOST_CONSTEXPR tribool operator||(tribool x, tribool y);
+BOOST_CONSTEXPR tribool operator||(tribool x, bool y);
+BOOST_CONSTEXPR tribool operator||(bool x, tribool y);
+BOOST_CONSTEXPR tribool operator||(indeterminate_keyword_t, tribool x);
+BOOST_CONSTEXPR tribool operator||(tribool x, indeterminate_keyword_t);
    +
    +

    Description

    +

    + +

    +
    ++++ + + + + + + + + + + +

    Returns:

    		 +

    the result of logically ORing the two tribool values, according to the following table:

    +
    ++++++ + + + + + + + + + + + + + + + + + + + + + + + + + + +
    ||falsetrueindeterminate
    falsefalsetrueindeterminate
    truetruetruetrue
    indeterminateindeterminatetrueindeterminate
    +

    +

    +

    Throws:

    		Will not throw.
    +
    +
    + + + +
    Copyright © 2002-2004 Douglas Gregor

    Use, modification and distribution is subject to the Boost + Software License, Version 1.0. (See accompanying file + LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/logic/operator_idp31770720.html b/doc/html/boost/logic/operator_idp31770720.html new file mode 100644 index 0000000000..30605da674 --- /dev/null +++ b/doc/html/boost/logic/operator_idp31770720.html @@ -0,0 +1,71 @@ + + + + +Function template operator<< + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Function template operator<<

    +

    boost::logic::operator<< — Writes the value of a tribool to a stream.

    +
    +

    Synopsis

    +
    // In header: <boost/logic/tribool_io.hpp>
+
+
+template<typename CharT, typename Traits> 
+  std::basic_ostream< CharT, Traits > & 
+  operator<<(std::basic_ostream< CharT, Traits > & out, tribool x);
    +
    +

    Description

    +

    When the value of x is either true or false, this routine is semantically equivalent to:

    +
    out << static_cast<bool>(x); 
+
    +

    When x has an indeterminate value, it outputs either the integer value 2 (if (out.flags() & std::ios_base::boolalpha) == 0) or the name of the indeterminate value. The name of the indeterminate value comes from the indeterminate_name facet (if it is defined in the output stream's locale), or from the get_default_indeterminate_name function (if it is not defined in the locale or if the C++ standard library implementation does not support locales).

    +

    +

    +
    ++++ + + + + +

    Returns:

    out

    +
    +
    + + + +
    Copyright © 2002-2004 Douglas Gregor

    Use, modification and distribution is subject to the Boost + Software License, Version 1.0. (See accompanying file + LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/logic/operator_idp31779280.html b/doc/html/boost/logic/operator_idp31779280.html new file mode 100644 index 0000000000..2a697c84f6 --- /dev/null +++ b/doc/html/boost/logic/operator_idp31779280.html @@ -0,0 +1,68 @@ + + + + +Function template operator<< + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Function template operator<<

    +

    boost::logic::operator<< — Writes the indeterminate tribool value to a stream.

    +
    +

    Synopsis

    +
    // In header: <boost/logic/tribool_io.hpp>
+
+
+template<typename CharT, typename Traits> 
+  std::basic_ostream< CharT, Traits > & 
+  operator<<(std::basic_ostream< CharT, Traits > & out, unspecified);
    +
    +

    Description

    +

    This routine outputs either the integer value 2 (if (out.flags() & std::ios_base::boolalpha) == 0) or the name of the indeterminate value. The name of the indeterminate value comes from the indeterminate_name facet (if it is defined in the output stream's locale), or from the get_default_indeterminate_name function (if it is not defined in the locale or if the C++ standard library implementation does not support locales).

    +

    +

    +
    ++++ + + + + +

    Returns:

    out

    +
    +
    + + + +
    Copyright © 2002-2004 Douglas Gregor

    Use, modification and distribution is subject to the Boost + Software License, Version 1.0. (See accompanying file + LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/logic/operator_idp31785552.html b/doc/html/boost/logic/operator_idp31785552.html new file mode 100644 index 0000000000..2703e21b7f --- /dev/null +++ b/doc/html/boost/logic/operator_idp31785552.html @@ -0,0 +1,69 @@ + + + + +Function template operator>> + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Function template operator>>

    +

    boost::logic::operator>> — Reads a tribool value from a stream.

    +
    +

    Synopsis

    +
    // In header: <boost/logic/tribool_io.hpp>
+
+
+template<typename CharT, typename Traits> 
+  std::basic_istream< CharT, Traits > & 
+  operator>>(std::basic_istream< CharT, Traits > & in, tribool & x);
    +
    +

    Description

    +

    When (out.flags() & std::ios_base::boolalpha) == 0, this function reads a long value from the input stream in and converts that value to a tribool. If that value is 0, x becomes false; if it is 1, x becomes true; if it is 2, becomes indetermine; otherwise, the operation fails (and the fail bit is set on the input stream in).

    +

    When (out.flags() & std::ios_base::boolalpha) != 0, this function first determines the names of the false, true, and indeterminate values. The false and true names are extracted from the std::numpunct facet of the input stream's locale (if the C++ standard library implementation supports locales), or from the default_false_name and default_true_name functions (if there is no locale support). The indeterminate name is extracted from the appropriate indeterminate_name facet (if it is available in the input stream's locale), or from the get_default_indeterminate_name function (if the C++ standard library implementation does not support locales, or the indeterminate_name facet is not specified for this locale object). The input is then matched to each of these names, and the tribool x is assigned the value corresponding to the longest name that matched. If no name is matched or all names are empty, the operation fails (and the fail bit is set on the input stream in).

    +

    +

    +
    ++++ + + + + +

    Returns:

    in

    +
    +
    + + + +
    Copyright © 2002-2004 Douglas Gregor

    Use, modification and distribution is subject to the Boost + Software License, Version 1.0. (See accompanying file + LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/logic/operator_idp39616176.html b/doc/html/boost/logic/operator_idp39616176.html deleted file mode 100644 index 2f85a7aa5c..0000000000 --- a/doc/html/boost/logic/operator_idp39616176.html +++ /dev/null @@ -1,114 +0,0 @@ - - - - -Function operator|| - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Function operator||

    -

    boost::logic::operator|| — Computes the logical disjunction of two tribools.

    -
    -

    Synopsis

    -
    // In header: <boost/logic/tribool.hpp>
-
-
-BOOST_CONSTEXPR tribool operator||(tribool x, tribool y);
-BOOST_CONSTEXPR tribool operator||(tribool x, bool y);
-BOOST_CONSTEXPR tribool operator||(bool x, tribool y);
-BOOST_CONSTEXPR tribool operator||(indeterminate_keyword_t, tribool x);
-BOOST_CONSTEXPR tribool operator||(tribool x, indeterminate_keyword_t);
    -
    -

    Description

    -

    - -

    -
    ---- - - - - - - - - - - -

    Returns:

    		 -

    the result of logically ORing the two tribool values, according to the following table:

    -
    ------ - - - - - - - - - - - - - - - - - - - - - - - - - - -
    ||falsetrueindeterminate
    falsefalsetrueindeterminate
    truetruetruetrue
    indeterminateindeterminatetrueindeterminate
    -

    -

    -

    Throws:

    		Will not throw.
    -
    -
    - - - -
    Copyright © 2002-2004 Douglas Gregor

    Use, modification and distribution is subject to the Boost - Software License, Version 1.0. (See accompanying file - LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/logic/operator_idp39725328.html b/doc/html/boost/logic/operator_idp39725328.html deleted file mode 100644 index 555283f834..0000000000 --- a/doc/html/boost/logic/operator_idp39725328.html +++ /dev/null @@ -1,71 +0,0 @@ - - - - -Function template operator<< - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Function template operator<<

    -

    boost::logic::operator<< — Writes the value of a tribool to a stream.

    -
    -

    Synopsis

    -
    // In header: <boost/logic/tribool_io.hpp>
-
-
-template<typename CharT, typename Traits> 
-  std::basic_ostream< CharT, Traits > & 
-  operator<<(std::basic_ostream< CharT, Traits > & out, tribool x);
    -
    -

    Description

    -

    When the value of x is either true or false, this routine is semantically equivalent to:

    -
    out << static_cast<bool>(x); 
-
    -

    When x has an indeterminate value, it outputs either the integer value 2 (if (out.flags() & std::ios_base::boolalpha) == 0) or the name of the indeterminate value. The name of the indeterminate value comes from the indeterminate_name facet (if it is defined in the output stream's locale), or from the get_default_indeterminate_name function (if it is not defined in the locale or if the C++ standard library implementation does not support locales).

    -

    -

    -
    ---- - - - - -

    Returns:

    out

    -
    -
    - - - -
    Copyright © 2002-2004 Douglas Gregor

    Use, modification and distribution is subject to the Boost - Software License, Version 1.0. (See accompanying file - LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/logic/operator_idp39733888.html b/doc/html/boost/logic/operator_idp39733888.html deleted file mode 100644 index 0e0b4eef15..0000000000 --- a/doc/html/boost/logic/operator_idp39733888.html +++ /dev/null @@ -1,68 +0,0 @@ - - - - -Function template operator<< - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Function template operator<<

    -

    boost::logic::operator<< — Writes the indeterminate tribool value to a stream.

    -
    -

    Synopsis

    -
    // In header: <boost/logic/tribool_io.hpp>
-
-
-template<typename CharT, typename Traits> 
-  std::basic_ostream< CharT, Traits > & 
-  operator<<(std::basic_ostream< CharT, Traits > & out, unspecified);
    -
    -

    Description

    -

    This routine outputs either the integer value 2 (if (out.flags() & std::ios_base::boolalpha) == 0) or the name of the indeterminate value. The name of the indeterminate value comes from the indeterminate_name facet (if it is defined in the output stream's locale), or from the get_default_indeterminate_name function (if it is not defined in the locale or if the C++ standard library implementation does not support locales).

    -

    -

    -
    ---- - - - - -

    Returns:

    out

    -
    -
    - - - -
    Copyright © 2002-2004 Douglas Gregor

    Use, modification and distribution is subject to the Boost - Software License, Version 1.0. (See accompanying file - LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/logic/operator_idp39740160.html b/doc/html/boost/logic/operator_idp39740160.html deleted file mode 100644 index ab5e749f8b..0000000000 --- a/doc/html/boost/logic/operator_idp39740160.html +++ /dev/null @@ -1,69 +0,0 @@ - - - - -Function template operator>> - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Function template operator>>

    -

    boost::logic::operator>> — Reads a tribool value from a stream.

    -
    -

    Synopsis

    -
    // In header: <boost/logic/tribool_io.hpp>
-
-
-template<typename CharT, typename Traits> 
-  std::basic_istream< CharT, Traits > & 
-  operator>>(std::basic_istream< CharT, Traits > & in, tribool & x);
    -
    -

    Description

    -

    When (out.flags() & std::ios_base::boolalpha) == 0, this function reads a long value from the input stream in and converts that value to a tribool. If that value is 0, x becomes false; if it is 1, x becomes true; if it is 2, becomes indetermine; otherwise, the operation fails (and the fail bit is set on the input stream in).

    -

    When (out.flags() & std::ios_base::boolalpha) != 0, this function first determines the names of the false, true, and indeterminate values. The false and true names are extracted from the std::numpunct facet of the input stream's locale (if the C++ standard library implementation supports locales), or from the default_false_name and default_true_name functions (if there is no locale support). The indeterminate name is extracted from the appropriate indeterminate_name facet (if it is available in the input stream's locale), or from the get_default_indeterminate_name function (if the C++ standard library implementation does not support locales, or the indeterminate_name facet is not specified for this locale object). The input is then matched to each of these names, and the tribool x is assigned the value corresponding to the longest name that matched. If no name is matched or all names are empty, the operation fails (and the fail bit is set on the input stream in).

    -

    -

    -
    ---- - - - - -

    Returns:

    in

    -
    -
    - - - -
    Copyright © 2002-2004 Douglas Gregor

    Use, modification and distribution is subject to the Boost - Software License, Version 1.0. (See accompanying file - LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/logic/tribool.html b/doc/html/boost/logic/tribool.html index add8d9df70..3fd02d0a3a 100644 --- a/doc/html/boost/logic/tribool.html +++ b/doc/html/boost/logic/tribool.html @@ -37,12 +37,12 @@ public: enum value_t; // construct/copy/destruct - tribool() noexcept; - tribool(bool) noexcept; - tribool(indeterminate_keyword_t) noexcept; + tribool() noexcept; + tribool(bool) noexcept; + tribool(indeterminate_keyword_t) noexcept; - // public member functions - BOOST_CONSTEXPR operator safe_bool() const noexcept; + // public member functions + BOOST_CONSTEXPR operator safe_bool() const noexcept; // public data members enum boost::logic::tribool::value_t value; @@ -57,7 +57,7 @@ construct/copy/destruct
    1. -
      tribool() noexcept;
      +
      tribool() noexcept;

      Construct a new 3-state boolean value with the value 'false'.

      @@ -73,7 +73,7 @@
  • -
    tribool(bool initial_value) noexcept;
    +
    tribool(bool initial_value) noexcept;

    Construct a new 3-state boolean value with the given boolean value, which may be true or false.

    @@ -89,7 +89,7 @@
  • -
    tribool(indeterminate_keyword_t) noexcept;
    +
    tribool(indeterminate_keyword_t) noexcept;

    Construct a new 3-state boolean value with an indeterminate value.

    @@ -108,9 +108,9 @@

    -tribool public member functions

    +tribool public member functions
    1. -
      BOOST_CONSTEXPR operator safe_bool() const noexcept;
      +
      BOOST_CONSTEXPR operator safe_bool() const noexcept;

      Use a 3-state boolean in a boolean context. Will evaluate true in a boolean context only when the 3-state boolean is definitely true.

      diff --git a/doc/html/boost/mpi/all_gather.html b/doc/html/boost/mpi/all_gather.html index 38385c15f7..c9c688c3fb 100644 --- a/doc/html/boost/mpi/all_gather.html +++ b/doc/html/boost/mpi/all_gather.html @@ -6,8 +6,8 @@ - - + + @@ -21,7 +21,7 @@

      -PrevUpHomeNext +PrevUpHomeNext
      @@ -30,7 +30,7 @@

      boost::mpi::all_gather — Gather the values stored at every process into vectors of values from each process.

      Synopsis

      -
      // In header: <boost/mpi/collectives.hpp>
+
      // In header: <boost/mpi/collectives.hpp>
 
 
 template<typename T> 
@@ -46,7 +46,7 @@
   void all_gather(const communicator & comm, const T * in_values, int n, 
                   T * out_values);
      
 
      
-
      Description
      
+
      Description
      
 
      all_gather is a collective algorithm that collects the values stored at each process into a vector of values indexed by the process number they came from. The type T of the values may be any type that is serializable or has an associated MPI data type.
      
 
      When the type T has an associated MPI data type, this routine invokes MPI_Allgather to gather the values.
      
 
      
@@ -94,7 +94,7 @@
 
 
      
 
      
-PrevUpHomeNext
+PrevUpHomeNext
 
      
 
 
diff --git a/doc/html/boost/mpi/all_reduce.html b/doc/html/boost/mpi/all_reduce.html
index 982800a10e..e81a16d35c 100644
--- a/doc/html/boost/mpi/all_reduce.html
+++ b/doc/html/boost/mpi/all_reduce.html
@@ -6,7 +6,7 @@
 
 
 
-
+
 
 
 
@@ -21,7 +21,7 @@
 
 
      
 
      
-PrevUpHomeNext
+PrevUpHomeNext
 
      
 
      
 
      
@@ -30,7 +30,7 @@
 
      boost::mpi::all_reduce — Combine the values stored by each process into a single value available to all processes. 
      
 
      
 
      Synopsis
      
-
      // In header: <boost/mpi/collectives.hpp>
+
      // In header: <boost/mpi/collectives.hpp>
 
 
 template<typename T, typename Op> 
@@ -47,7 +47,7 @@
 template<typename T, typename Op> 
   void all_reduce(const communicator & comm, inplace_t< T > value, Op op);
      
 
      
-
      Description
      
+
      Description
      
 
      all_reduce is a collective algorithm that combines the values stored by each process into a single value available to all processes. The values are combined in a user-defined way, specified via a function object. The type T of the values may be any type that is serializable or has an associated MPI data type. One can think of this operation as a all_gather, followed by an std::accumulate() over the gather values and using the operation op.
      
 
      When the type T has an associated MPI data type, this routine invokes MPI_Allreduce to perform the reduction. If possible, built-in MPI operations will be used; otherwise, all_reduce() will create a custom MPI_Op for the call to MPI_Allreduce.
      
 
      
@@ -112,7 +112,7 @@ If wrapped in a 
 
      
 
      
-PrevUpHomeNext
+PrevUpHomeNext
 
      
 
 
diff --git a/doc/html/boost/mpi/all_to_all.html b/doc/html/boost/mpi/all_to_all.html
index dbf9ecbdd3..2639bd0826 100644
--- a/doc/html/boost/mpi/all_to_all.html
+++ b/doc/html/boost/mpi/all_to_all.html
@@ -6,7 +6,7 @@
 
 
 
-
+
 
 
 
@@ -21,7 +21,7 @@
 
 
      
 
      
-PrevUpHomeNext
+PrevUpHomeNext
 
      
 
      
 
      
@@ -30,7 +30,7 @@
 
      boost::mpi::all_to_all — Send data from every process to every other process. 
      
 
      
 
      Synopsis
      
-
      // In header: <boost/mpi/collectives.hpp>
+
      // In header: <boost/mpi/collectives.hpp>
 
 
 template<typename T> 
@@ -48,7 +48,7 @@
   void all_to_all(const communicator & comm, const T * in_values, int n, 
                   T * out_values);
      
 
      
-
      Description
      
+
      Description
      
 
      all_to_all is a collective algorithm that transmits p values from every process to every other process. On process i, jth value of the in_values vector is sent to process j and placed in the ith position of the out_values vector in process j. The type T of the values may be any type that is serializable or has an associated MPI data type. If n is provided, then arrays of n values will be transferred from one process to another.
      
 
      When the type T has an associated MPI data type, this routine invokes MPI_Alltoall to scatter the values.
      
 
      
@@ -96,7 +96,7 @@
 
 
      
 
      
-PrevUpHomeNext
+PrevUpHomeNext
 
      
 
 
diff --git a/doc/html/boost/mpi/alloca_1_3_26_5_14_2_2_1_2.html b/doc/html/boost/mpi/alloca_1_3_26_5_14_2_2_1_2.html
new file mode 100644
index 0000000000..81abf6abd5
--- /dev/null
+++ b/doc/html/boost/mpi/alloca_1_3_26_5_14_2_2_1_2.html
@@ -0,0 +1,70 @@
+
+
+
+
+Class allocator<void>
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
      Boost C++ LibrariesHomeLibrariesPeopleFAQMore
      
+
      
+
      
+PrevUpHomeNext
+
      
+
      
+
      
+
      
+
      Class allocator<void>
      
+
      boost::mpi::allocator<void> — Allocator specialization for void value types. 
      
+
      
+
      Synopsis
      
+
      // In header: <boost/mpi/allocator.hpp>
+
+
+class allocator<void> {
+public:
+  // types
+  typedef void *       pointer;      
+  typedef const void * const_pointer;
+  typedef void         value_type;   
+
+  // member classes/structs/unions
+  template<typename U> 
+  struct rebind {
+    // types
+    typedef allocator< U > other;
+  };
+};
      
+
      
+
      Description
      
+
      The void specialization of allocator is useful only for rebinding to another, different value type. 
      
+
      
+
      
+
+
+
+
      Copyright © 2005-2007 Douglas Gregor,
+      Matthias Troyer, Trustees of Indiana University
      
+        Distributed under the Boost Software License, Version 1.0. (See accompanying
+        file LICENSE_1_0.txt or copy at 
+        http://www.boost.org/LICENSE_1_0.txt )
+      
      
+
      
+
      
+
      
+PrevUpHomeNext
+
      
+
+
diff --git a/doc/html/boost/mpi/alloca_1_3_26_5_14_2_2_1_2/rebind.html b/doc/html/boost/mpi/alloca_1_3_26_5_14_2_2_1_2/rebind.html
new file mode 100644
index 0000000000..3b9efbebfc
--- /dev/null
+++ b/doc/html/boost/mpi/alloca_1_3_26_5_14_2_2_1_2/rebind.html
@@ -0,0 +1,57 @@
+
+
+
+
+Struct template rebind
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
      Boost C++ LibrariesHomeLibrariesPeopleFAQMore
      
+
      
+
      
+PrevUpHomeNext
+
      
+
      
+
      
+
      
+
      Struct template rebind
      
+
      boost::mpi::allocator<void>::rebind
      
+
      
+
      Synopsis
      
+
      // In header: <boost/mpi/allocator.hpp>
+
+
+template<typename U> 
+struct rebind {
+  // types
+  typedef allocator< U > other;
+};
      
+
      
+
+
+
+
      Copyright © 2005-2007 Douglas Gregor,
+      Matthias Troyer, Trustees of Indiana University
      
+        Distributed under the Boost Software License, Version 1.0. (See accompanying
+        file LICENSE_1_0.txt or copy at 
+        http://www.boost.org/LICENSE_1_0.txt )
+      
      
+
      
+
      
+
      
+PrevUpHomeNext
+
      
+
+
diff --git a/doc/html/boost/mpi/allocator.html b/doc/html/boost/mpi/allocator.html
index 1b75bf8a4e..939357914c 100644
--- a/doc/html/boost/mpi/allocator.html
+++ b/doc/html/boost/mpi/allocator.html
@@ -6,8 +6,8 @@
 
 
 
-
-
+
+
 
 
 
@@ -21,7 +21,7 @@
 
 
      
 
      
-PrevUpHomeNext
+PrevUpHomeNext
 
      
 
      
 
      
@@ -30,7 +30,7 @@
 
      boost::mpi::allocator — Standard Library-compliant allocator for the MPI-2 memory allocation routines. 
      
 
      
 
      Synopsis
      
-
      // In header: <boost/mpi/allocator.hpp>
+
      // In header: <boost/mpi/allocator.hpp>
 
 template<typename T> 
 class allocator {
@@ -55,62 +55,62 @@
   };
 
   // construct/copy/destruct
-  allocator();
-  allocator(const allocator &);
-  template<typename U> allocator(const allocator< U > &);
-  ~allocator();
+  allocator();
+  allocator(const allocator &);
+  template<typename U> allocator(const allocator< U > &);
+  ~allocator();
 
-  // public member functions
-  pointer address(reference) const;
-  const_pointer address(const_reference) const;
-  pointer allocate(size_type, allocator< void >::const_pointer = 0);
-  void deallocate(pointer, size_type);
-  size_type max_size() const;
-  void construct(pointer, const T &);
-  void destroy(pointer);
+  // public member functions
+  pointer address(reference) const;
+  const_pointer address(const_reference) const;
+  pointer allocate(size_type, allocator< void >::const_pointer = 0);
+  void deallocate(pointer, size_type);
+  size_type max_size() const;
+  void construct(pointer, const T &);
+  void destroy(pointer);
 };
      
 
      
-
      Description
      
+
      Description
      
 
      This allocator provides a standard C++ interface to the MPI_Alloc_mem and MPI_Free_mem routines of MPI-2. It is intended to be used with the containers in the Standard Library (vector, in particular) in cases where the contents of the container will be directly transmitted via MPI. This allocator is also used internally by the library for character buffers that will be used in the transmission of data.
      
 
      The allocator class template only provides MPI memory allocation when the underlying MPI implementation is either MPI-2 compliant or is known to provide MPI_Alloc_mem and MPI_Free_mem as extensions. When the MPI memory allocation routines are not available, allocator is brought in directly from namespace std, so that standard allocators are used throughout. The macro BOOST_MPI_HAS_MEMORY_ALLOCATION will be defined when the MPI-2 memory allocation facilities are available. 
      
 
      
-
      
+
      
 allocator 
         public
        construct/copy/destruct
      
 
        
 
      1. 
-
        allocator();
        
+
        allocator();
        
 
        Default-construct an allocator. 
        
 
        2. 
 
      2. 
-
        allocator(const allocator &);
        
+
        allocator(const allocator &);
        
 
        Copy-construct an allocator. 
        
 
        3. 
 
      3. 
-
        template<typename U> allocator(const allocator< U > &);
        
+
        template<typename U> allocator(const allocator< U > &);
        
 
        Copy-construct an allocator from another allocator for a different value type. 
        
 
        4. 
 
      4. 
-
        ~allocator();
        
+
        ~allocator();
        
 
        Destroy an allocator. 
        
 
        5. 
 
      
 
      
 
      
-
      
-allocator public member functions
      
+
      
+allocator public member functions
      
 
        
 
      1. 
-
        pointer address(reference x) const;
        
+
        pointer address(reference x) const;
        
 
        Returns the address of object x. 
        
 
        2. 
 
      2. 
-
        const_pointer address(const_reference x) const;
        
+
        const_pointer address(const_reference x) const;
        
 
        Returns the address of object x. 
        
 
        3. 
 
      3. 
-
        pointer allocate(size_type n, allocator< void >::const_pointer = 0);
        
+
        pointer allocate(size_type n, allocator< void >::const_pointer = 0);
        
 
        Allocate enough memory for n elements of type T.
        
 
        
 
@@ -142,7 +142,7 @@
    2. -
      void deallocate(pointer p, size_type);
      +
      void deallocate(pointer p, size_type);

      Deallocate memory referred to by the pointer p.

      @@ -167,22 +167,22 @@
  • -
    size_type max_size() const;
    +
    size_type max_size() const;

    Returns the maximum number of elements that can be allocated with allocate().

  • -
    void construct(pointer p, const T & val);
    +
    void construct(pointer p, const T & val);

    Construct a copy of val at the location referenced by p.

  • -
    void destroy(pointer p);
    +
    void destroy(pointer p);

    Destroy the object referenced by p.

    • -

    Specializations

    -
    +

    Specializations

    +
    @@ -198,7 +198,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/mpi/allocator/rebind.html b/doc/html/boost/mpi/allocator/rebind.html index d2e395022d..55866568db 100644 --- a/doc/html/boost/mpi/allocator/rebind.html +++ b/doc/html/boost/mpi/allocator/rebind.html @@ -6,9 +6,9 @@ - + - + @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -30,7 +30,7 @@

    boost::mpi::allocator::rebind — Retrieve the type of an allocator similar to this allocator but for a different value type.

    Synopsis

    -
    // In header: <boost/mpi/allocator.hpp>
+
    // In header: <boost/mpi/allocator.hpp>
 
 
 
@@ -54,7 +54,7 @@
 
 
    
 
    
-PrevUpHomeNext
+PrevUpHomeNext
 
    
 
 
diff --git a/doc/html/boost/mpi/allocator_1_3_26_6_2_2_1_2.html b/doc/html/boost/mpi/allocator_1_3_26_6_2_2_1_2.html
deleted file mode 100644
index 44ebf4c2ac..0000000000
--- a/doc/html/boost/mpi/allocator_1_3_26_6_2_2_1_2.html
+++ /dev/null
@@ -1,70 +0,0 @@
-
-
-
-
-Class allocator<void>
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    
-
    
-
    
-PrevUpHomeNext
-
    
-
    
-
    
-
    
-
    Class allocator<void>
    
-
    boost::mpi::allocator<void> — Allocator specialization for void value types. 
    
-
    
-
    Synopsis
    
-
    // In header: <boost/mpi/allocator.hpp>
-
-
-class allocator<void> {
-public:
-  // types
-  typedef void *       pointer;      
-  typedef const void * const_pointer;
-  typedef void         value_type;   
-
-  // member classes/structs/unions
-  template<typename U> 
-  struct rebind {
-    // types
-    typedef allocator< U > other;
-  };
-};
    
-
    
-
    Description
    
-
    The void specialization of allocator is useful only for rebinding to another, different value type. 
    
-
    
-
    
-
-
-
-
    Copyright © 2005-2007 Douglas Gregor,
-      Matthias Troyer, Trustees of Indiana University
    
-        Distributed under the Boost Software License, Version 1.0. (See accompanying
-        file LICENSE_1_0.txt or copy at 
-        http://www.boost.org/LICENSE_1_0.txt )
-      
    
-
    
-
    
-
    
-PrevUpHomeNext
-
    
-
-
diff --git a/doc/html/boost/mpi/allocator_1_3_26_6_2_2_1_2/rebind.html b/doc/html/boost/mpi/allocator_1_3_26_6_2_2_1_2/rebind.html
deleted file mode 100644
index dc251e8ab5..0000000000
--- a/doc/html/boost/mpi/allocator_1_3_26_6_2_2_1_2/rebind.html
+++ /dev/null
@@ -1,57 +0,0 @@
-
-
-
-
-Struct template rebind
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    
-
    
-
    
-PrevUpHomeNext
-
    
-
    
-
    
-
    
-
    Struct template rebind
    
-
    boost::mpi::allocator<void>::rebind
    
-
    
-
    Synopsis
    
-
    // In header: <boost/mpi/allocator.hpp>
-
-
-template<typename U> 
-struct rebind {
-  // types
-  typedef allocator< U > other;
-};
    
-
    
-
-
-
-
    Copyright © 2005-2007 Douglas Gregor,
-      Matthias Troyer, Trustees of Indiana University
    
-        Distributed under the Boost Software License, Version 1.0. (See accompanying
-        file LICENSE_1_0.txt or copy at 
-        http://www.boost.org/LICENSE_1_0.txt )
-      
    
-
    
-
    
-
    
-PrevUpHomeNext
-
    
-
-
diff --git a/doc/html/boost/mpi/any_source.html b/doc/html/boost/mpi/any_source.html
index a3aaaccd3a..2b99a27f6b 100644
--- a/doc/html/boost/mpi/any_source.html
+++ b/doc/html/boost/mpi/any_source.html
@@ -6,7 +6,7 @@
 
 
 
-
+
 
 
 
@@ -21,7 +21,7 @@
 
 
    
 
    
-PrevUpHomeNext
+PrevUpHomeNext
 
    
 
    
 
    
@@ -30,11 +30,11 @@
 
    boost::mpi::any_source — A constant representing "any process.". 
    
 
    
 
    Synopsis
    
-
    // In header: <boost/mpi/communicator.hpp>
+
    // In header: <boost/mpi/communicator.hpp>
 
 const int any_source;
    
 
    
-
    Description
    
+
    Description
    
 
    This constant may be used for the source parameter of receive operations to indicate that a message may be received from any source. 
    
 
    
 
    
@@ -50,7 +50,7 @@
 
 
    
 
    
-PrevUpHomeNext
+PrevUpHomeNext
 
    
 
 
diff --git a/doc/html/boost/mpi/any_tag.html b/doc/html/boost/mpi/any_tag.html
index 581d82aea9..8b301c8935 100644
--- a/doc/html/boost/mpi/any_tag.html
+++ b/doc/html/boost/mpi/any_tag.html
@@ -6,9 +6,9 @@
 
 
 
-
+
 
-
+
 
 
 
@@ -21,7 +21,7 @@
 
    
 
    
 
    
-PrevUpHomeNext
+PrevUpHomeNext
 
    
 
    
 
    
@@ -30,11 +30,11 @@
 
    boost::mpi::any_tag — A constant representing "any tag.". 
    
 
    
 
    Synopsis
    
-
    // In header: <boost/mpi/communicator.hpp>
+
    // In header: <boost/mpi/communicator.hpp>
 
 const int any_tag;
    
 
    
-
    Description
    
+
    Description
    
 
    This constant may be used for the tag parameter of receive operations to indicate that a send with any tag will be matched by the receive. 
    
 
    
 
    
@@ -50,7 +50,7 @@
 
 
    
 
    
-PrevUpHomeNext
+PrevUpHomeNext
 
    
 
 
diff --git a/doc/html/boost/mpi/bitwise_and.html b/doc/html/boost/mpi/bitwise_and.html
index 2dcd154d2c..3ca0af4e72 100644
--- a/doc/html/boost/mpi/bitwise_and.html
+++ b/doc/html/boost/mpi/bitwise_and.html
@@ -6,7 +6,7 @@
 
 
 
-
+
 
 
 
@@ -21,7 +21,7 @@
 
 
    
 
    
-PrevUpHomeNext
+PrevUpHomeNext
 
    
 
    
 
    
@@ -30,22 +30,26 @@
 
    boost::mpi::bitwise_and — Compute the bitwise AND of two integral values. 
    
 
    
 
    Synopsis
    
-
    // In header: <boost/mpi/operations.hpp>
+
    // In header: <boost/mpi/operations.hpp>
 
 template<typename T> 
-struct bitwise_and : public std::binary_function< T, T, T > {
+struct bitwise_and {
+  // types
+  typedef T first_argument_type; 
+  typedef T second_argument_type;
+  typedef T result_type;         
 
-  // public member functions
-  T operator()(const T &, const T &) const;
+  // public member functions
+  T operator()(const T &, const T &) const;
 };
    
 
    
-
    Description
    
+
    Description
    
 
    This binary function object computes the bitwise AND of the two values it is given. When used with MPI and a type T that has an associated, built-in MPI data type, translates to MPI_BAND. 
    
 
    
-
    
-bitwise_and public member functions
    
+
    
+bitwise_and public member functions
    
 
    1. 
-
      T operator()(const T & x, const T & y) const;
      
+
      T operator()(const T & x, const T & y) const;
      
 
      
 
      
 
      
@@ -74,7 +78,7 @@
 
      
 
      
 
      
-PrevUpHomeNext
+PrevUpHomeNext
 
      
 
 
diff --git a/doc/html/boost/mpi/bitwise_or.html b/doc/html/boost/mpi/bitwise_or.html
index 8cc212ec5f..2047e69b8e 100644
--- a/doc/html/boost/mpi/bitwise_or.html
+++ b/doc/html/boost/mpi/bitwise_or.html
@@ -6,7 +6,7 @@
 
 
 
-
+
 
 
 
@@ -21,7 +21,7 @@
 
 
      
 
      
-PrevUpHomeNext
+PrevUpHomeNext
 
      
 
      
 
      
@@ -30,22 +30,26 @@
 
      boost::mpi::bitwise_or — Compute the bitwise OR of two integral values. 
      
 
      
 
      Synopsis
      
-
      // In header: <boost/mpi/operations.hpp>
+
      // In header: <boost/mpi/operations.hpp>
 
 template<typename T> 
-struct bitwise_or : public std::binary_function< T, T, T > {
+struct bitwise_or {
+  // types
+  typedef T first_argument_type; 
+  typedef T second_argument_type;
+  typedef T result_type;         
 
-  // public member functions
-  T operator()(const T &, const T &) const;
+  // public member functions
+  T operator()(const T &, const T &) const;
 };
      
 
      
-
      Description
      
+
      Description
      
 
      This binary function object computes the bitwise OR of the two values it is given. When used with MPI and a type T that has an associated, built-in MPI data type, translates to MPI_BOR. 
      
 
      
-
      
-bitwise_or public member functions
      
+
      
+bitwise_or public member functions
      
 
      1. 
-
        T operator()(const T & x, const T & y) const;
        
+
        T operator()(const T & x, const T & y) const;
        
 
        
 
        
 
        
@@ -74,7 +78,7 @@
 
        
 
        
 
        
-PrevUpHomeNext
+PrevUpHomeNext
 
        
 
 
diff --git a/doc/html/boost/mpi/bitwise_xor.html b/doc/html/boost/mpi/bitwise_xor.html
index 05333a446b..5975368e77 100644
--- a/doc/html/boost/mpi/bitwise_xor.html
+++ b/doc/html/boost/mpi/bitwise_xor.html
@@ -6,7 +6,7 @@
 
 
 
-
+
 
 
 
@@ -21,7 +21,7 @@
 
 
        
 
        
-PrevUpHomeNext
+PrevUpHomeNext
 
        
 
        
 
        
@@ -30,22 +30,26 @@
 
        boost::mpi::bitwise_xor — Compute the bitwise exclusive OR of two integral values. 
        
 
        
 
        Synopsis
        
-
        // In header: <boost/mpi/operations.hpp>
+
        // In header: <boost/mpi/operations.hpp>
 
 template<typename T> 
-struct bitwise_xor : public std::binary_function< T, T, T > {
+struct bitwise_xor {
+  // types
+  typedef T first_argument_type; 
+  typedef T second_argument_type;
+  typedef T result_type;         
 
-  // public member functions
-  T operator()(const T &, const T &) const;
+  // public member functions
+  T operator()(const T &, const T &) const;
 };
        
 
        
-
        Description
        
+
        Description
        
 
        This binary function object computes the bitwise exclusive OR of the two values it is given. When used with MPI and a type T that has an associated, built-in MPI data type, translates to MPI_BXOR. 
        
 
        
-
        
-bitwise_xor public member functions
        
+
        
+bitwise_xor public member functions
        
 
        1. 
-
          T operator()(const T & x, const T & y) const;
          
+
          T operator()(const T & x, const T & y) const;
          
 
          
 
          
 
          
@@ -74,7 +78,7 @@
 
          
 
          
 
          
-PrevUpHomeNext
+PrevUpHomeNext
 
          
 
 
diff --git a/doc/html/boost/mpi/broadcast.html b/doc/html/boost/mpi/broadcast.html
index 2df105a1e5..943061ae12 100644
--- a/doc/html/boost/mpi/broadcast.html
+++ b/doc/html/boost/mpi/broadcast.html
@@ -6,7 +6,7 @@
 
 
 
-
+
 
 
 
@@ -21,7 +21,7 @@
 
 
          
 
          
-PrevUpHomeNext
+PrevUpHomeNext
 
          
 
          
 
          
@@ -30,7 +30,7 @@
 
          boost::mpi::broadcast — Broadcast a value from a root process to all other processes. 
          
 
          
 
          Synopsis
          
-
          // In header: <boost/mpi/collectives.hpp>
+
          // In header: <boost/mpi/collectives.hpp>
 
 
 template<typename T> 
@@ -44,7 +44,7 @@
   void broadcast(const communicator & comm, const skeleton_proxy< T > & value, 
                  int root);
          
 
          
-
          Description
          
+
          Description
          
 
          broadcast is a collective algorithm that transfers a value from an arbitrary root process to every other process that is part of the given communicator. The broadcast algorithm can transmit any Serializable value, values that have associated MPI data types, packed archives, skeletons, and the content of skeletons; see the send primitive for communicators for a complete list. The type T shall be the same for all processes that are a part of the communicator comm, unless packed archives are being transferred: with packed archives, the root sends a packed_oarchive or packed_skeleton_oarchive whereas the other processes receive a packed_iarchive or packed_skeleton_iarchve, respectively.
          
 
          When the type T has an associated MPI data type, this routine invokes MPI_Bcast to perform the broadcast.
          
 
          
@@ -92,7 +92,7 @@
 
 
          
 
          
-PrevUpHomeNext
+PrevUpHomeNext
 
          
 
 
diff --git a/doc/html/boost/mpi/cartesian_communicator.html b/doc/html/boost/mpi/cartesian_communicator.html
new file mode 100644
index 0000000000..f527ea26c9
--- /dev/null
+++ b/doc/html/boost/mpi/cartesian_communicator.html
@@ -0,0 +1,263 @@
+
+
+
+
+Class cartesian_communicator
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
          Boost C++ LibrariesHomeLibrariesPeopleFAQMore
          
+
          
+
          
+PrevUpHomeNext
+
          
+
          
+
          
+
          
+
          Class cartesian_communicator
          
+
          boost::mpi::cartesian_communicator — An MPI communicator with a cartesian topology. 
          
+
          
+
          Synopsis
          
+
          // In header: <boost/mpi/cartesian_communicator.hpp>
+
+
+class cartesian_communicator : public boost::mpi::communicator {
+public:
+  // construct/copy/destruct
+  cartesian_communicator(const MPI_Comm &, comm_create_kind);
+  cartesian_communicator(const communicator &, const cartesian_topology &, 
+                         bool = false);
+  cartesian_communicator(const cartesian_communicator &, 
+                         const std::vector< int > &);
+
+  // public member functions
+  int ndims() const;
+  int rank(const std::vector< int > &) const;
+  std::pair< int, int > shifted_ranks(int, int) const;
+  std::vector< int > coordinates(int) const;
+  void topology(cartesian_topology &, std::vector< int > &) const;
+  cartesian_topology topology() const;
+};
          
+
          
+
          Description
          
+
          A cartesian_communicator is a communicator whose topology is expressed as a grid. Cartesian communicators have the same functionality as (intra)communicators, but also allow one to query the relationships among processes and the properties of the grid. 
          
+
          
+
          
+cartesian_communicator 
+        public
+       construct/copy/destruct
          
+
            
+
          1. 
+
            cartesian_communicator(const MPI_Comm & comm, comm_create_kind kind);
            
+
            Build a new Boost.MPI cartesian communicator based on the MPI communicator comm with cartesian topology.
            
+
            comm may be any valid MPI communicator. If comm is MPI_COMM_NULL, an empty communicator (that cannot be used for communication) is created and the kind parameter is ignored. Otherwise, the kind parameter determines how the Boost.MPI communicator will be related to comm: 
            
+
              
+
            • If kind is comm_duplicate, duplicate comm to create a new communicator. This new communicator will be freed when the Boost.MPI communicator (and all copies of it) is destroyed. This option is only permitted if the underlying MPI implementation supports MPI 2.0; duplication of intercommunicators is not available in MPI 1.x.
              • 
+
            • If kind is comm_take_ownership, take ownership of comm. It will be freed automatically when all of the Boost.MPI communicators go out of scope.
              • 
+
            • If kind is comm_attach, this Boost.MPI communicator will reference the existing MPI communicator comm but will not free comm when the Boost.MPI communicator goes out of scope. This option should only be used when the communicator is managed by the user. 
              • 
+
            
+
            
+
            
+
            2. 
+
          2. 
+
            cartesian_communicator(const communicator & comm, 
+                       const cartesian_topology & dims, bool reorder = false);
            
+
            Create a new communicator whose topology is described by the given cartesian. The indices of the vertices in the cartesian will be assumed to be the ranks of the processes within the communicator. There may be fewer vertices in the cartesian than there are processes in the communicator; in this case, the resulting communicator will be a NULL communicator.
            
+
            
+
            
+
            
++++
+
+
+
+
+
            



            Parameters:
            
++++
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
            



            comm
            The communicator that the new, cartesian communicator will be based on.
            dims
            the cartesian dimension of the new communicator. The size indicate the number of dimension. Some dimensions be set to zero, in which case the corresponding dimension value is left to the system.
            reorder
            Whether MPI is permitted to re-order the process ranks within the returned communicator, to better optimize communication. If false, the ranks of each process in the returned process will match precisely the rank of that process within the original communicator. 
            
+
            3. 
+
          3. 
+
            cartesian_communicator(const cartesian_communicator & comm, 
+                       const std::vector< int > & keep);
            
+
            Create a new cartesian communicator whose topology is a subset of an existing cartesian cimmunicator. 
+
            
+
            
++++
+
+
+
+
+
            



            Parameters:
            
++++
+
+
+
+
+
+
+
+
+
+
+
            



            comm
            the original communicator. 
            keep
            and array containiing the dimension to keep from the existing communicator. 
            
+
            4. 
+
          
+
          
+
          
+
          
+cartesian_communicator public member functions
          
+
            
+
          1. 
+
            int ndims() const;
            
+
            Retrive the number of dimension of the underlying toppology. 
            
+
            2. 
+
          2. 
+
            int rank(const std::vector< int > & coords) const;
            
+
            Return the rank of the process at the given coordinates. 
+
            
+
            
++++
+
+
+
+
+
            



            Parameters:
            
++++
+
+
+
+
+
            



            coords
            the coordinates. the size must match the communicator's topology. 
            
+
            3. 
+
          3. 
+
            std::pair< int, int > shifted_ranks(int dim, int disp) const;
            
+
            Return the rank of the source and target destination process through a shift. 
+
            
+
            
++++
+
+
+
+
+
            



            Parameters:
            
++++
+
+
+
+
+
+
+
+
+
+
+
            



            dim
            the dimension in which the shift takes place. 0 <= dim <= ndim(). 
            disp
            the shift displacement, can be positive (upward) or negative (downward). 
            
+
            4. 
+
          4. 
+
            std::vector< int > coordinates(int rk) const;
            
+
            Provides the coordinates of the process with the given rank. 
+
+
            
+
            
++++
+
+
+
+
+
+
+
+
+
+
+
            



            Parameters:
            
++++
+
+
+
+
+
            



            rk
            the ranks in this communicator. 
            Returns:
            the coordinates. 
            
+
            5. 
+
          5. 
+
            void topology(cartesian_topology & dims, std::vector< int > & coords) const;
            
+
            Retrieve the topology and coordinates of this process in the grid. 
            
+
            6. 
+
          6. 
+
            cartesian_topology topology() const;
            
+
            Retrieve the topology of the grid. 
            
+
            7. 
+
          
+
          
+
          
+
          
+
+
+
+
          Copyright © 2005-2007 Douglas Gregor,
+      Matthias Troyer, Trustees of Indiana University
          
+        Distributed under the Boost Software License, Version 1.0. (See accompanying
+        file LICENSE_1_0.txt or copy at 
+        http://www.boost.org/LICENSE_1_0.txt )
+      
          
+
          
+
          
+
          
+PrevUpHomeNext
+
          
+
+
diff --git a/doc/html/boost/mpi/cartesian_dimension.html b/doc/html/boost/mpi/cartesian_dimension.html
new file mode 100644
index 0000000000..b588a74457
--- /dev/null
+++ b/doc/html/boost/mpi/cartesian_dimension.html
@@ -0,0 +1,96 @@
+
+
+
+
+Struct cartesian_dimension
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
          Boost C++ LibrariesHomeLibrariesPeopleFAQMore
          
+
          
+
          
+PrevUpHomeNext
+
          
+
          
+
          
+
          
+
          Struct cartesian_dimension
          
+
          boost::mpi::cartesian_dimension — Specify the size and periodicity of the grid in a single dimension. 
          
+
          
+
          Synopsis
          
+
          // In header: <boost/mpi/cartesian_communicator.hpp>
+
+
+struct cartesian_dimension {
+  // construct/copy/destruct
+  cartesian_dimension(int = 0, bool = false);
+
+  // private member functions
+  template<typename Archive> void serialize(Archive &, const unsigned int);
+
+  // public data members
+  int size;
+  bool periodic;
+};
          
+
          
+
          Description
          
+
          POD lightweight object. 
          
+
          
+
          
+cartesian_dimension 
+        public
+       construct/copy/destruct
          
+
          1. cartesian_dimension(int sz = 0, bool p = false);
          
+
          
+
          
+
          
+cartesian_dimension private member functions
          
+
          1. template<typename Archive> 
+  void serialize(Archive & ar, const unsigned int version);
          
+
          
+
          
+
          
+cartesian_dimension 
+        public
+       public data members
          
+
            
+
          1. 
+
            int size;
            
+
            The size of the grid n this dimension. 
            
+
            2. 
+
          2. 
+
            bool periodic;
            
+
            Is the grid periodic in this dimension. 
            
+
            3. 
+
          
+
          
+
          
+
          
+
+
+
+
          Copyright © 2005-2007 Douglas Gregor,
+      Matthias Troyer, Trustees of Indiana University
          
+        Distributed under the Boost Software License, Version 1.0. (See accompanying
+        file LICENSE_1_0.txt or copy at 
+        http://www.boost.org/LICENSE_1_0.txt )
+      
          
+
          
+
          
+
          
+PrevUpHomeNext
+
          
+
+
diff --git a/doc/html/boost/mpi/cartesian_dimensions.html b/doc/html/boost/mpi/cartesian_dimensions.html
new file mode 100644
index 0000000000..bce41db0c4
--- /dev/null
+++ b/doc/html/boost/mpi/cartesian_dimensions.html
@@ -0,0 +1,84 @@
+
+
+
+
+Function cartesian_dimensions
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
          Boost C++ LibrariesHomeLibrariesPeopleFAQMore
          
+
          
+
          
+PrevUpHomeNext
+
          
+
          
+
          
+
          
+
          Function cartesian_dimensions
          
+
          boost::mpi::cartesian_dimensions
          
+
          
+
          Synopsis
          
+
          // In header: <boost/mpi/cartesian_communicator.hpp>
+
+
+std::vector< int > & 
+cartesian_dimensions(int nb_proc, std::vector< int > & dims);
          
+
          
+
          Description
          
+
          Given en number of processes, and a partially filled sequence of dimension, try to complete the dimension sequence. 
+
          
+
          
++++
+
+
+
+
+
          



          Parameters:
          
++++
+
+
+
+
+
+
+
+
+
+
+
          



          dims
          a sequence of positive or null dimensions. Non zero dimension will be left untouched. 
          nb_proc
          the numer of mpi processes.fill a sequence of dimension. 
          
+
          
+
          
+
+
+
+
          Copyright © 2005-2007 Douglas Gregor,
+      Matthias Troyer, Trustees of Indiana University
          
+        Distributed under the Boost Software License, Version 1.0. (See accompanying
+        file LICENSE_1_0.txt or copy at 
+        http://www.boost.org/LICENSE_1_0.txt )
+      
          
+
          
+
          
+
          
+PrevUpHomeNext
+
          
+
+
diff --git a/doc/html/boost/mpi/cartesian_topology.html b/doc/html/boost/mpi/cartesian_topology.html
new file mode 100644
index 0000000000..b65e9f6697
--- /dev/null
+++ b/doc/html/boost/mpi/cartesian_topology.html
@@ -0,0 +1,182 @@
+
+
+
+
+Class cartesian_topology
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
          Boost C++ LibrariesHomeLibrariesPeopleFAQMore
          
+
          
+
          
+PrevUpHomeNext
+
          
+
          
+
          
+
          
+
          Class cartesian_topology
          
+
          boost::mpi::cartesian_topology — Describe the topology of a cartesian grid. 
          
+
          
+
          Synopsis
          
+
          // In header: <boost/mpi/cartesian_communicator.hpp>
+
+
+class cartesian_topology : private std::vector< cartesian_dimension > {
+public:
+  // construct/copy/destruct
+  cartesian_topology() = delete;
+  cartesian_topology(cartesian_topology const &) = default;
+  cartesian_topology(cartesian_topology const &&);
+  cartesian_topology(int);
+  cartesian_topology(std::vector< cartesian_dimension > const &);
+  template<typename InitArr> explicit cartesian_topology(InitArr);
+  explicit cartesian_topology(std::initializer_list< cartesian_dimension >);
+  template<int NDIM> explicit cartesian_topology(cartesian_dimension(&));
+  template<typename DimRg, typename PerRg> 
+    cartesian_topology(DimRg const &, PerRg const &);
+  template<typename DimIter, typename PerIter> 
+    cartesian_topology(DimIter, PerIter, int);
+  cartesian_topology & operator=(cartesian_topology const &) = default;
+  cartesian_topology & operator=(cartesian_topology const &&);
+  ~cartesian_topology();
+
+  // public member functions
+  std::vector< cartesian_dimension > & stl();
+  std::vector< cartesian_dimension > const & stl() const;
+  void split(std::vector< int > &, std::vector< bool > &) const;
+};
          
+
          
+
          Description
          
+
          Behave mostly like a sequence of cartesian_dimension with the notable exception that its size is fixed. This is a lightweight object, so that any constructor that could be considered missing could be replaced with a function (move constructor provided when supported). 
          
+
          
+
          
+cartesian_topology 
+        public
+       construct/copy/destruct
          
+
            
+
          1. cartesian_topology() = delete;
            2. 
+
          2. cartesian_topology(cartesian_topology const &) = default;
            3. 
+
          3. cartesian_topology(cartesian_topology const && other);
            4. 
+
          4. 
+
            cartesian_topology(int ndim);
            Create a N dimension space. Each dimension is initialized as non periodic of size 0. 
            5. 
+
          5. 
+
            cartesian_topology(std::vector< cartesian_dimension > const & dims);
            Use the provided dimensions specification as initial values. 
            6. 
+
          6. 
+
            template<typename InitArr> explicit cartesian_topology(InitArr dims);
            Use dimensions specification provided in the sequence container as initial values. #param dims must be a sequence container. 
            7. 
+
          7. 
+
            explicit cartesian_topology(std::initializer_list< cartesian_dimension > dims);
            Use dimensions specification provided in the initialization list as initial values. #param dims can be of the form { dim_1, false}, .... {dim_n, true}. 
            8. 
+
          8. 
+
            template<int NDIM> explicit cartesian_topology(cartesian_dimension(&) dims);
            Use dimensions specification provided in the array. #param dims can be of the form { dim_1, false}, .... {dim_n, true}. 
            9. 
+
          9. 
+
            template<typename DimRg, typename PerRg> 
+  cartesian_topology(DimRg const & dim_rg, PerRg const & period_rg);
            Use dimensions specification provided in the input ranges The ranges do not need to be the same size. If the sizes are different, the missing values will be complete with zeros of the dim and assumed non periodic. 
            
+
            
+
            
++++
+
+
+
+
+
            



            Parameters:
            
++++
+
+
+
+
+
+
+
+
+
+
+
            



            dim_rg
            the dimensions, values must convert to integers. 
            period_rg
            the periodicities, values must convert to booleans. #param dims can be of the form { dim_1, false}, .... {dim_n, true} 
            
+
            10. 
+
          10. 
+
            template<typename DimIter, typename PerIter> 
+  cartesian_topology(DimIter dit, PerIter pit, int n);
            Iterator based initializer. Will use the first n iterated values. Both iterators can be single pass. 
            
+
            
+
            
++++
+
+
+
+
+
            



            Parameters:
            
++++
+
+
+
+
+
+
+
+
+
+
+
            



            dit
            dimension iterator, value must convert to integer type. 
            pit
            periodicity iterator, value must convert to booleans.. 
            
+
            11. 
+
          11. cartesian_topology & operator=(cartesian_topology const &) = default;
            12. 
+
          12. cartesian_topology & operator=(cartesian_topology const && other);
            13. 
+
          13. ~cartesian_topology();
            14. 
+
          
+
          
+
          
+
          
+cartesian_topology public member functions
          
+
            
+
          1. 
+
            std::vector< cartesian_dimension > & stl();
            
+
            Export as an stl sequence. 
            
+
            2. 
+
          2. 
+
            std::vector< cartesian_dimension > const & stl() const;
            
+
            Export as an stl sequence. 
            
+
            3. 
+
          3. 
+
            void split(std::vector< int > & dims, std::vector< bool > & periodics) const;
            
+
            Split the topology in two sequences of sizes and periodicities. 
            
+
            4. 
+
          
+
          
+
          
+
          
+
+
+
+
          Copyright © 2005-2007 Douglas Gregor,
+      Matthias Troyer, Trustees of Indiana University
          
+        Distributed under the Boost Software License, Version 1.0. (See accompanying
+        file LICENSE_1_0.txt or copy at 
+        http://www.boost.org/LICENSE_1_0.txt )
+      
          
+
          
+
          
+
          
+PrevUpHomeNext
+
          
+
+
diff --git a/doc/html/boost/mpi/comm_create_kind.html b/doc/html/boost/mpi/comm_create_kind.html
index 8f5957bbf0..829f6490e3 100644
--- a/doc/html/boost/mpi/comm_create_kind.html
+++ b/doc/html/boost/mpi/comm_create_kind.html
@@ -6,7 +6,7 @@
 
 
 
-
+
 
 
 
@@ -21,7 +21,7 @@
 
 
          
 
          
-PrevUpHomeNext
+PrevUpHomeNext
 
          
 
          
 
          
@@ -30,13 +30,13 @@
 
          boost::mpi::comm_create_kind — Enumeration used to describe how to adopt a C MPI_Comm into a Boost.MPI communicator. 
          
 
          
 
          Synopsis
          
-
          // In header: <boost/mpi/communicator.hpp>
+
          // In header: <boost/mpi/communicator.hpp>
 
 
 
 enum comm_create_kind { comm_duplicate, comm_take_ownership, comm_attach };
          
 
          
-
          Description
          
+
          Description
          
 
          The values for this enumeration determine how a Boost.MPI communicator will behave when constructed with an MPI communicator. The options are:
          
 
            
 
          • comm_duplicate: Duplicate the MPI_Comm communicator to create a new communicator (e.g., with MPI_Comm_dup). This new MPI_Comm communicator will be automatically freed when the Boost.MPI communicator (and all copies of it) is destroyed.
            • 
@@ -59,7 +59,7 @@
 
 
            
 
            
-PrevUpHomeNext
+PrevUpHomeNext
 
            
 
 
diff --git a/doc/html/boost/mpi/communicator.html b/doc/html/boost/mpi/communicator.html
index 3eba689907..983d1664b1 100644
--- a/doc/html/boost/mpi/communicator.html
+++ b/doc/html/boost/mpi/communicator.html
@@ -6,7 +6,7 @@
 
 
 
-
+
 
 
 
@@ -21,7 +21,7 @@
 
 
            
 
            
-PrevUpHomeNext
+PrevUpHomeNext
 
            
 
            
 
            
@@ -30,80 +30,82 @@
 
            boost::mpi::communicator — A communicator that permits communication and synchronization among a set of processes. 
            
 
            
 
            Synopsis
            
-
            // In header: <boost/mpi/communicator.hpp>
+
            // In header: <boost/mpi/communicator.hpp>
 
 
 class communicator {
 public:
   // construct/copy/destruct
-  communicator();
-  communicator(const MPI_Comm &, comm_create_kind);
-  communicator(const communicator &, const boost::mpi::group &);
+  communicator();
+  communicator(const MPI_Comm &, comm_create_kind);
+  communicator(const communicator &, const boost::mpi::group &);
 
-  // public member functions
-  int rank() const;
-  int size() const;
-  boost::mpi::group group() const;
-  template<typename T> void send(int, int, const T &) const;
+  // public member functions
+  int rank() const;
+  int size() const;
+  boost::mpi::group group() const;
+  template<typename T> void send(int, int, const T &) const;
   template<typename T, typename A> 
-    void send(int, int, const std::vector< T, A > &) const;
+    void send(int, int, const std::vector< T, A > &) const;
   template<typename T, typename A> 
-    void send_vector(int, int, const std::vector< T, A > &, mpl::true_) const;
+    void send_vector(int, int, const std::vector< T, A > &, mpl::true_) const;
   template<typename T, typename A> 
-    void send_vector(int, int, const std::vector< T, A > &, mpl::false_) const;
-  template<typename T> void send(int, int, const skeleton_proxy< T > &) const;
-  template<typename T> void send(int, int, const T *, int) const;
-  void send(int, int) const;
-  template<typename T> status recv(int, int, T &) const;
+    void send_vector(int, int, const std::vector< T, A > &, mpl::false_) const;
+  template<typename T> void send(int, int, const skeleton_proxy< T > &) const;
+  template<typename T> void send(int, int, const T *, int) const;
+  void send(int, int) const;
+  template<typename T> status recv(int, int, T &) const;
   template<typename T, typename A> 
-    status recv(int, int, std::vector< T, A > &) const;
+    status recv(int, int, std::vector< T, A > &) const;
   template<typename T, typename A> 
-    status recv_vector(int, int, std::vector< T, A > &, mpl::true_) const;
+    status recv_vector(int, int, std::vector< T, A > &, mpl::true_) const;
   template<typename T, typename A> 
-    status recv_vector(int, int, std::vector< T, A > &, mpl::false_) const;
+    status recv_vector(int, int, std::vector< T, A > &, mpl::false_) const;
   template<typename T> 
-    status recv(int, int, const skeleton_proxy< T > &) const;
-  template<typename T> status recv(int, int, skeleton_proxy< T > &) const;
-  template<typename T> status recv(int, int, T *, int) const;
-  status recv(int, int) const;
+    status recv(int, int, const skeleton_proxy< T > &) const;
+  template<typename T> status recv(int, int, skeleton_proxy< T > &) const;
+  template<typename T> status recv(int, int, T *, int) const;
+  status recv(int, int) const;
   template<typename T> 
-    status sendrecv(int, int, const T &, int, int, T &) const;
-  template<typename T> request isend(int, int, const T &) const;
+    status sendrecv(int, int, const T &, int, int, T &) const;
+  template<typename T> request isend(int, int, const T &) const;
   template<typename T> 
-    request isend(int, int, const skeleton_proxy< T > &) const;
-  template<typename T> request isend(int, int, const T *, int) const;
-  request isend(int, int) const;
-  template<typename T> request irecv(int, int, T &) const;
-  template<typename T> request irecv(int, int, T *, int) const;
-  request irecv(int, int) const;
-  status probe(int = any_source, int = any_tag) const;
-  optional< status > iprobe(int = any_source, int = any_tag) const;
-  void barrier() const;
-  operator bool() const;
-  operator MPI_Comm() const;
-  communicator split(int) const;
-  communicator split(int, int) const;
-  optional< intercommunicator > as_intercommunicator() const;
-  optional< graph_communicator > as_graph_communicator() const;
-  bool has_cartesian_topology() const;
-  void abort(int) const;
+    request isend(int, int, const skeleton_proxy< T > &) const;
+  template<typename T> request isend(int, int, const T *, int) const;
+  request isend(int, int) const;
+  template<typename T> request irecv(int, int, T &) const;
+  template<typename T> request irecv(int, int, T *, int) const;
+  request irecv(int, int) const;
+  status probe(int = any_source, int = any_tag) const;
+  optional< status > iprobe(int = any_source, int = any_tag) const;
+  void barrier() const;
+  operator bool() const;
+  operator MPI_Comm() const;
+  communicator split(int) const;
+  communicator split(int, int) const;
+  optional< intercommunicator > as_intercommunicator() const;
+  optional< graph_communicator > as_graph_communicator() const;
+  bool has_graph_topology() const;
+  optional< cartesian_communicator > as_cartesian_communicator() const;
+  bool has_cartesian_topology() const;
+  void abort(int) const;
 };
            
 
            
-
            Description
            
+
            Description
            
 
            The communicator class abstracts a set of communicating processes in MPI. All of the processes that belong to a certain communicator can determine the size of the communicator, their rank within the communicator, and communicate with any other processes in the communicator. 
            
 
            
-
            
+
            
 communicator 
         public
        construct/copy/destruct
            
 
              
 
            1. 
-
              communicator();
              
+
              communicator();
              
 
              Build a new Boost.MPI communicator for MPI_COMM_WORLD.
              
 
              Constructs a Boost.MPI communicator that attaches to MPI_COMM_WORLD. This is the equivalent of constructing with (MPI_COMM_WORLD, comm_attach). 
              
 
              2. 
 
            2. 
-
              communicator(const MPI_Comm & comm, comm_create_kind kind);
              
+
              communicator(const MPI_Comm & comm, comm_create_kind kind);
              
 
              Build a new Boost.MPI communicator based on the MPI communicator comm.
              
 
              comm may be any valid MPI communicator. If comm is MPI_COMM_NULL, an empty communicator (that cannot be used for communication) is created and the kind parameter is ignored. Otherwise, the kind parameters determines how the Boost.MPI communicator will be related to comm: 
              
 
                
@@ -115,7 +117,7 @@
 
                
 
 
              • 
-
                communicator(const communicator & comm, const boost::mpi::group & subgroup);
                
+
                communicator(const communicator & comm, const boost::mpi::group & subgroup);
                
 
                Build a new Boost.MPI communicator based on a subgroup of another MPI communicator.
                
 
                This routine will construct a new communicator containing all of the processes from communicator comm that are listed within the group subgroup. Equivalent to MPI_Comm_create.
                
 
                
@@ -149,11 +151,11 @@
 
            
 
            
 
            
-
            
-communicator public member functions
            
+
            
+communicator public member functions
            
 
              
 
            1. 
-
              int rank() const;
              Determine the rank of the executing process in a communicator. 
              This routine is equivalent to MPI_Comm_rank.
              
+
              int rank() const;
              Determine the rank of the executing process in a communicator. 
              This routine is equivalent to MPI_Comm_rank.
              
 
              
 
              
 
              
@@ -168,7 +170,7 @@
 
              
 
              2. 
 
            2. 
-
              int size() const;
              Determine the number of processes in a communicator. 
              This routine is equivalent to MPI_Comm_size.
              
+
              int size() const;
              Determine the number of processes in a communicator. 
              This routine is equivalent to MPI_Comm_size.
              
 
              
 
              
 
              
@@ -183,11 +185,11 @@
 
              
 
              3. 
 
            3. 
-
              boost::mpi::group group() const;
              
+
              boost::mpi::group group() const;
              
 
              This routine constructs a new group whose members are the processes within this communicator. Equivalent to calling MPI_Comm_group. 
              
 
              4. 
 
            4. 
-
              template<typename T> void send(int dest, int tag, const T & value) const;
              Send data to another process. 
              This routine executes a potentially blocking send with tag tag to the process with rank dest. It can be received by the destination process with a matching recv call.
              
+
              template<typename T> void send(int dest, int tag, const T & value) const;
              Send data to another process. 
              This routine executes a potentially blocking send with tag tag to the process with rank dest. It can be received by the destination process with a matching recv call.
              
 
              The given value must be suitable for transmission over MPI. There are several classes of types that meet these requirements:
              
 
                
 
              • Types with mappings to MPI data types: If is_mpi_datatype<T> is convertible to mpl::true_, then value will be transmitted using the MPI data type get_mpi_datatype<T>(). All primitive C++ data types that have MPI equivalents, e.g., int, float, char, double, etc., have built-in mappings to MPI data types. You may turn a Serializable type with fixed structure into an MPI data type by specializing is_mpi_datatype for your type.
                • 
@@ -231,16 +233,16 @@
 
              
 
              5. 
 
            5. template<typename T, typename A> 
-  void send(int dest, int tag, const std::vector< T, A > & value) const;
              6. 
+  void send(int dest, int tag, const std::vector< T, A > & value) const;
            
 
          • template<typename T, typename A> 
-  void send_vector(int dest, int tag, const std::vector< T, A > & value, 
+  void send_vector(int dest, int tag, const std::vector< T, A > & value, 
                    mpl::true_) const;
            • 
 
          • template<typename T, typename A> 
-  void send_vector(int dest, int tag, const std::vector< T, A > & value, 
+  void send_vector(int dest, int tag, const std::vector< T, A > & value, 
                    mpl::false_) const;
            • 
 
          • 
 
            template<typename T> 
-  void send(int dest, int tag, const skeleton_proxy< T > & proxy) const;
            Send the skeleton of an object. 
            This routine executes a potentially blocking send with tag tag to the process with rank dest. It can be received by the destination process with a matching recv call. This variation on send will be used when a send of a skeleton is explicitly requested via code such as:
            
+  void send(int dest, int tag, const skeleton_proxy< T > & proxy) const;
          Send the skeleton of an object. 
          This routine executes a potentially blocking send with tag tag to the process with rank dest. It can be received by the destination process with a matching recv call. This variation on send will be used when a send of a skeleton is explicitly requested via code such as:
          
 
          comm.send(dest, tag, skeleton(object));
 
          
 
          The semantics of this routine are equivalent to that of sending a packed_skeleton_oarchive storing the skeleton of the object.
          
@@ -278,7 +280,7 @@
 
          2. 
 
        2. 
 
          template<typename T> 
-  void send(int dest, int tag, const T * values, int n) const;
          Send an array of values to another process. 
          This routine executes a potentially blocking send of an array of data with tag tag to the process with rank dest. It can be received by the destination process with a matching array recv call.
          
+  void send(int dest, int tag, const T * values, int n) const;
        Send an array of values to another process. 
        This routine executes a potentially blocking send of an array of data with tag tag to the process with rank dest. It can be received by the destination process with a matching array recv call.
        
 
        If T is an MPI datatype, an invocation of this routine will be mapped to a single call to MPI_Send, using the datatype get_mpi_datatype<T>().
        
 
        
 
        
@@ -317,7 +319,7 @@
 
        
 
        2. 
 
      2. 
-
        void send(int dest, int tag) const;
        Send a message to another process without any data. 
        This routine executes a potentially blocking send of a message to another process. The message contains no extra data, and can therefore only be received by a matching call to recv().
        
+
        void send(int dest, int tag) const;
        Send a message to another process without any data. 
        This routine executes a potentially blocking send of a message to another process. The message contains no extra data, and can therefore only be received by a matching call to recv().
        
 
        
 
        
 
        
@@ -347,7 +349,7 @@
 
        
 
        3. 
 
      3. 
-
        template<typename T> status recv(int source, int tag, T & value) const;
        Receive data from a remote process. 
        This routine blocks until it receives a message from the process source with the given tag. The type T of the value must be suitable for transmission over MPI, which includes serializable types, types that can be mapped to MPI data types (including most built-in C++ types), packed MPI archives, skeletons, and content associated with skeletons; see the documentation of send for a complete description.
        
+
        template<typename T> status recv(int source, int tag, T & value) const;
        Receive data from a remote process. 
        This routine blocks until it receives a message from the process source with the given tag. The type T of the value must be suitable for transmission over MPI, which includes serializable types, types that can be mapped to MPI data types (including most built-in C++ types), packed MPI archives, skeletons, and content associated with skeletons; see the documentation of send for a complete description.
        
 
        
 
 
        
@@ -388,16 +390,16 @@
 
      
 
      2. 
 
    2. template<typename T, typename A> 
-  status recv(int source, int tag, std::vector< T, A > & value) const;
      3. 
+  status recv(int source, int tag, std::vector< T, A > & value) const;
    
 
  • template<typename T, typename A> 
-  status recv_vector(int source, int tag, std::vector< T, A > & value, 
+  status recv_vector(int source, int tag, std::vector< T, A > & value, 
                      mpl::true_) const;
    • 
 
  • template<typename T, typename A> 
-  status recv_vector(int source, int tag, std::vector< T, A > & value, 
+  status recv_vector(int source, int tag, std::vector< T, A > & value, 
                      mpl::false_) const;
    • 
 
  • 
 
    template<typename T> 
-  status recv(int source, int tag, const skeleton_proxy< T > & proxy) const;
    Receive a skeleton from a remote process. 
    This routine blocks until it receives a message from the process source with the given tag containing a skeleton.
    
+  status recv(int source, int tag, const skeleton_proxy< T > & proxy) const;
    • Receive a skeleton from a remote process. 
    This routine blocks until it receives a message from the process source with the given tag containing a skeleton.
    
 
    
 
 
    
@@ -439,7 +441,7 @@
 
 
  • 
 
    template<typename T> 
-  status recv(int source, int tag, skeleton_proxy< T > & proxy) const;
    Receive a skeleton from a remote process. 
    This routine blocks until it receives a message from the process source with the given tag containing a skeleton.
    
+  status recv(int source, int tag, skeleton_proxy< T > & proxy) const;
    • Receive a skeleton from a remote process.

    This routine blocks until it receives a message from the process source with the given tag containing a skeleton.

    @@ -480,7 +482,7 @@
  • -
    template<typename T> status recv(int source, int tag, T * values, int n) const;
    Receive an array of values from a remote process.

    This routine blocks until it receives an array of values from the process source with the given tag. If the type T is

    +
    template<typename T> status recv(int source, int tag, T * values, int n) const;
    Receive an array of values from a remote process.

    This routine blocks until it receives an array of values from the process source with the given tag. If the type T is

    @@ -530,7 +532,7 @@

  • -
    status recv(int source, int tag) const;
    Receive a message from a remote process without any data.

    This routine blocks until it receives a message from the process source with the given tag.

    +
    status recv(int source, int tag) const;
    Receive a message from a remote process without any data.

    This routine blocks until it receives a message from the process source with the given tag.

    @@ -568,10 +570,10 @@ 
  • template<typename T> 
-  status sendrecv(int dest, int stag, const T & sval, int src, int rtag, 
+  status sendrecv(int dest, int stag, const T & sval, int src, int rtag, 
                   T & rval) const;
    Send a message to remote process nd receive another message from another process.
  • -
    template<typename T> request isend(int dest, int tag, const T & value) const;
    Send a message to a remote process without blocking.

    The isend method is functionality identical to the send method and transmits data in the same way, except that isend will not block while waiting for the data to be transmitted. Instead, a request object will be immediately returned, allowing one to query the status of the communication or wait until it has completed.

    +
    template<typename T> request isend(int dest, int tag, const T & value) const;
    Send a message to a remote process without blocking.

    The isend method is functionality identical to the send method and transmits data in the same way, except that isend will not block while waiting for the data to be transmitted. Instead, a request object will be immediately returned, allowing one to query the status of the communication or wait until it has completed.

    @@ -613,7 +615,7 @@ 
  • template<typename T> 
-  request isend(int dest, int tag, const skeleton_proxy< T > & proxy) const;
    Send the skeleton of an object without blocking.

    This routine is functionally identical to the send method for skeleton_proxy objects except that isend will not block while waiting for the data to be transmitted. Instead, a request object will be immediately returned, allowing one to query the status of the communication or wait until it has completed.

    + request isend(int dest, int tag, const skeleton_proxy< T > & proxy) const;Send the skeleton of an object without blocking.

    This routine is functionally identical to the send method for skeleton_proxy objects except that isend will not block while waiting for the data to be transmitted. Instead, a request object will be immediately returned, allowing one to query the status of the communication or wait until it has completed.

    The semantics of this routine are equivalent to a non-blocking send of a packed_skeleton_oarchive storing the skeleton of the object.

    @@ -656,7 +658,7 @@ 

  • template<typename T> 
-  request isend(int dest, int tag, const T * values, int n) const;
    Send an array of values to another process without blocking.

    This routine is functionally identical to the send method for arrays except that isend will not block while waiting for the data to be transmitted. Instead, a request object will be immediately returned, allowing one to query the status of the communication or wait until it has completed.

    + request isend(int dest, int tag, const T * values, int n) const;Send an array of values to another process without blocking.

    This routine is functionally identical to the send method for arrays except that isend will not block while waiting for the data to be transmitted. Instead, a request object will be immediately returned, allowing one to query the status of the communication or wait until it has completed.

    @@ -701,7 +703,7 @@
  • -
    request isend(int dest, int tag) const;
    Send a message to another process without any data without blocking.

    This routine is functionally identical to the send method for sends with no data, except that isend will not block while waiting for the message to be transmitted. Instead, a request object will be immediately returned, allowing one to query the status of the communication or wait until it has completed.

    +
    request isend(int dest, int tag) const;
    Send a message to another process without any data without blocking.

    This routine is functionally identical to the send method for sends with no data, except that isend will not block while waiting for the message to be transmitted. Instead, a request object will be immediately returned, allowing one to query the status of the communication or wait until it has completed.

    @@ -738,7 +740,7 @@
  • -
    template<typename T> request irecv(int source, int tag, T & value) const;
    Prepare to receive a message from a remote process.

    The irecv method is functionally identical to the recv method and receive data in the same way, except that irecv will not block while waiting for data to be transmitted. Instead, it immediately returns a request object that allows one to query the status of the receive or wait until it has completed.

    +
    template<typename T> request irecv(int source, int tag, T & value) const;
    Prepare to receive a message from a remote process.

    The irecv method is functionally identical to the recv method and receive data in the same way, except that irecv will not block while waiting for data to be transmitted. Instead, it immediately returns a request object that allows one to query the status of the receive or wait until it has completed.

    @@ -780,7 +782,7 @@ 
  • template<typename T> 
-  request irecv(int source, int tag, T * values, int n) const;
    Initiate receipt of an array of values from a remote process.

    This routine initiates a receive operation for an array of values transmitted by process source with the given tag.

    + request irecv(int source, int tag, T * values, int n) const;Initiate receipt of an array of values from a remote process.

    This routine initiates a receive operation for an array of values transmitted by process source with the given tag.

    @@ -825,7 +827,7 @@
  • -
    request irecv(int source, int tag) const;
    Initiate receipt of a message from a remote process that carries no data.

    This routine initiates a receive operation for a message from process source with the given tag that carries no data.

    +
    request irecv(int source, int tag) const;
    Initiate receipt of a message from a remote process that carries no data.

    This routine initiates a receive operation for a message from process source with the given tag that carries no data.

    @@ -862,7 +864,7 @@
  • -
    status probe(int source = any_source, int tag = any_tag) const;
    Waits until a message is available to be received.

    This operation waits until a message matching (source, tag) is available to be received. It then returns information about that message. The functionality is equivalent to MPI_Probe. To check if a message is available without blocking, use iprobe.

    +
    status probe(int source = any_source, int tag = any_tag) const;
    Waits until a message is available to be received.

    This operation waits until a message matching (source, tag) is available to be received. It then returns information about that message. The functionality is equivalent to MPI_Probe. To check if a message is available without blocking, use iprobe.

    @@ -899,7 +901,7 @@
  • -
    optional< status > iprobe(int source = any_source, int tag = any_tag) const;
    Determine if a message is available to be received.

    This operation determines if a message matching (source, tag) is available to be received. If so, it returns information about that message; otherwise, it returns immediately with an empty optional. The functionality is equivalent to MPI_Iprobe. To wait until a message is available, use wait.

    +
    optional< status > iprobe(int source = any_source, int tag = any_tag) const;
    Determine if a message is available to be received.

    This operation determines if a message matching (source, tag) is available to be received. If so, it returns information about that message; otherwise, it returns immediately with an empty optional. The functionality is equivalent to MPI_Iprobe. To wait until a message is available, use wait.

    @@ -936,13 +938,13 @@
  • -
    void barrier() const;
    Wait for all processes within a communicator to reach the barrier.

    This routine is a collective operation that blocks each process until all processes have entered it, then releases all of the processes "simultaneously". It is equivalent to MPI_Barrier.

    +
    void barrier() const;
    Wait for all processes within a communicator to reach the barrier.

    This routine is a collective operation that blocks each process until all processes have entered it, then releases all of the processes "simultaneously". It is equivalent to MPI_Barrier.

  • -
    operator bool() const;
    Determine if this communicator is valid for communication.

    Evaluates true in a boolean context if this communicator is valid for communication, i.e., does not represent MPI_COMM_NULL. Otherwise, evaluates false.

    +
    operator bool() const;
    Determine if this communicator is valid for communication.

    Evaluates true in a boolean context if this communicator is valid for communication, i.e., does not represent MPI_COMM_NULL. Otherwise, evaluates false.

  • -
    operator MPI_Comm() const;
    Access the MPI communicator associated with a Boost.MPI communicator.

    This routine permits the implicit conversion from a Boost.MPI communicator to an MPI communicator.

    +
    operator MPI_Comm() const;
    Access the MPI communicator associated with a Boost.MPI communicator.

    This routine permits the implicit conversion from a Boost.MPI communicator to an MPI communicator.

    @@ -957,7 +959,7 @@
  • -
    communicator split(int color) const;
    +
    communicator split(int color) const;

    Split the communicator into multiple, disjoint communicators each of which is based on a particular color. This is a collective operation that returns a new communicator that is a subgroup of this. This routine is functionally equivalent to MPI_Comm_split.

    @@ -989,7 +991,7 @@

  • -
    communicator split(int color, int key) const;
    +
    communicator split(int color, int key) const;

    Split the communicator into multiple, disjoint communicators each of which is based on a particular color. This is a collective operation that returns a new communicator that is a subgroup of this. This routine is functionally equivalent to MPI_Comm_split.

    @@ -1027,7 +1029,7 @@

  • -
    optional< intercommunicator > as_intercommunicator() const;
    +
    optional< intercommunicator > as_intercommunicator() const;

    Determine if the communicator is in fact an intercommunicator and, if so, return that intercommunicator.

    @@ -1043,7 +1045,7 @@
  • -
    optional< graph_communicator > as_graph_communicator() const;
    +
    optional< graph_communicator > as_graph_communicator() const;

    Determine if the communicator has a graph topology and, if so, return that graph_communicator. Even though the communicators have different types, they refer to the same underlying communication space and can be used interchangeably for communication.

    @@ -1059,11 +1061,31 @@
  • -
    bool has_cartesian_topology() const;
    +
    bool has_graph_topology() const;
    +

    Determines whether this communicator has a Graph topology.

    +
    • +
  • +
    optional< cartesian_communicator > as_cartesian_communicator() const;
    +

    Determine if the communicator has a cartesian topology and, if so, return that cartesian_communicator. Even though the communicators have different types, they refer to the same underlying communication space and can be used interchangeably for communication.

    +

    +

    +
    ++++ + + + + +

    Returns:

    an optional containing the cartesian communicator, if this communicator does in fact have a cartesian topology. Otherwise, returns an empty optional.

    +
    • +
  • +
    bool has_cartesian_topology() const;

    Determines whether this communicator has a Cartesian topology.

  • -
    void abort(int errcode) const;
    +
    void abort(int errcode) const;

    Abort all tasks in the group of this communicator.

    Makes a "best attempt" to abort all of the tasks in the group of this communicator. Depending on the underlying MPI implementation, this may either abort the entire program (and possibly return errcode to the environment) or only abort some processes, allowing the others to continue. Consult the documentation for your MPI implementation. This is equivalent to a call to MPI_Abort

    @@ -1111,7 +1133,7 @@

    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/mpi/content.html b/doc/html/boost/mpi/content.html index db4b16ecba..db59073153 100644 --- a/doc/html/boost/mpi/content.html +++ b/doc/html/boost/mpi/content.html @@ -6,7 +6,7 @@ - + @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -30,36 +30,36 @@

    boost::mpi::content — A proxy object that transfers the content of an object without its structure.

    Synopsis

    -
    // In header: <boost/mpi/skeleton_and_content.hpp>
+
    // In header: <boost/mpi/skeleton_and_content.hpp>
 
 
 class content {
 public:
   // construct/copy/destruct
-  content();
-  content(MPI_Datatype, bool = true);
-  const content & operator=(MPI_Datatype);
+  content();
+  content(MPI_Datatype, bool = true);
+  const content & operator=(MPI_Datatype);
 
-  // public member functions
-  MPI_Datatype get_mpi_datatype() const;
-  void commit();
+  // public member functions
+  MPI_Datatype get_mpi_datatype() const;
+  void commit();
 };
    
 
    
-
    Description
    
+
    Description
    
 
    The content class indicates that Boost.MPI should transmit or receive the content of an object, but without any information about the structure of the object. It is only meaningful to transmit the content of an object after the receiver has already received the skeleton for the same object.
    
 
    Most users will not use content objects directly. Rather, they will invoke send, recv, or broadcast operations using get_content(). 
    
 
    
-
    
+
    
 content 
         public
        construct/copy/destruct
    
 
      
 
    1. 
-
      content();
      
+
      content();
      
 
      Constructs an empty content object. This object will not be useful for any Boost.MPI operations until it is reassigned. 
      
 
      2. 
 
    2. 
-
      content(MPI_Datatype d, bool committed = true);
      
+
      content(MPI_Datatype d, bool committed = true);
      
 
      This routine initializes the content object with an MPI data type that refers to the content of an object without its structure.
      
 
      
 
      
@@ -90,7 +90,7 @@
  • -
    const content & operator=(MPI_Datatype d);
    +
    const content & operator=(MPI_Datatype d);

    Replace the MPI data type referencing the content of an object.

    @@ -124,11 +124,11 @@

    -

    -content public member functions

    +

    +content public member functions

    1. -
      MPI_Datatype get_mpi_datatype() const;
      +
      MPI_Datatype get_mpi_datatype() const;

      Retrieve the MPI data type that refers to the content of the object.

      @@ -144,7 +144,7 @@
  • -
    void commit();
    +
    void commit();

    Commit the MPI data type referring to the content of the object.

    • @@ -163,7 +163,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/mpi/environment.html b/doc/html/boost/mpi/environment.html index 27bb76065b..840d116239 100644 --- a/doc/html/boost/mpi/environment.html +++ b/doc/html/boost/mpi/environment.html @@ -6,8 +6,8 @@ - - + + @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -30,32 +30,33 @@

    boost::mpi::environment — Initialize, finalize, and query the MPI environment.

    Synopsis

    -
    // In header: <boost/mpi/environment.hpp>
+
    // In header: <boost/mpi/environment.hpp>
 
 
 class environment : private noncopyable {
 public:
   // construct/copy/destruct
-  explicit environment(bool = true);
-  explicit environment(threading::level, bool = true);
-  environment(int &, char **&, bool = true);
-  environment(int &, char **&, threading::level, bool = true);
-  ~environment();
+  explicit environment(bool = true);
+  explicit environment(threading::level, bool = true);
+  environment(int &, char **&, bool = true);
+  environment(int &, char **&, threading::level, bool = true);
+  ~environment();
 
-  // public static functions
-  static void abort(int);
-  static bool initialized();
-  static bool finalized();
-  static int max_tag();
-  static int collectives_tag();
-  static optional< int > host_rank();
-  static optional< int > io_rank();
-  static std::string processor_name();
-  static threading::level thread_level();
-  static bool is_main_thread();
+  // public static functions
+  static void abort(int);
+  static bool initialized();
+  static bool finalized();
+  static int max_tag();
+  static int collectives_tag();
+  static optional< int > host_rank();
+  static optional< int > io_rank();
+  static std::string processor_name();
+  static threading::level thread_level();
+  static bool is_main_thread();
+  static std::pair< int, int > version();
 };
    
 
    
-
    Description
    
+
    Description
    
 
    The environment class is used to initialize, finalize, and query the MPI environment. It will typically be used in the main() function of a program, which will create a single instance of environment initialized with the arguments passed to the program:
    
 
    int main(int argc, char* argv[])
 {
@@ -65,13 +66,13 @@
 
    The instance of environment will initialize MPI (by calling MPI_Init) in its constructor and finalize MPI (by calling MPI_Finalize for normal termination or MPI_Abort for an uncaught exception) in its destructor.
    
 
    The use of environment is not mandatory. Users may choose to invoke MPI_Init and MPI_Finalize manually. In this case, no environment object is needed. If one is created, however, it will do nothing on either construction or destruction. 
    
 
    
-
    
+
    
 environment 
         public
        construct/copy/destruct
    
 
      
 
    1. 
-
      explicit environment(bool abort_on_exception = true);
      
+
      explicit environment(bool abort_on_exception = true);
      
 
      Initialize the MPI environment.
      
 
      If the MPI environment has not already been initialized, initializes MPI with a call to MPI_Init. Since this constructor does not take command-line arguments (argc and argv), it is only available when the underlying MPI implementation supports calling MPI_Init with NULL arguments, indicated by the macro BOOST_MPI_HAS_NOARG_INITIALIZATION.
      
 
      
@@ -97,7 +98,7 @@
 
    
 
 
  • 
-
    explicit environment(threading::level mt_level, 
+
    explicit environment(threading::level mt_level, 
                      bool abort_on_exception = true);
    
 
    Initialize the MPI environment.
    
 
    If the MPI environment has not already been initialized, initializes MPI with a call to MPI_Init_thread. Since this constructor does not take command-line arguments (argc and argv), it is only available when the underlying MPI implementation supports calling MPI_Init with NULL arguments, indicated by the macro BOOST_MPI_HAS_NOARG_INITIALIZATION.
    
@@ -130,7 +131,7 @@
 
    • 
 
 
  • 
-
    environment(int & argc, char **& argv, bool abort_on_exception = true);
    
+
    environment(int & argc, char **& argv, bool abort_on_exception = true);
    
 
    Initialize the MPI environment.
    
 
    If the MPI environment has not already been initialized, initializes MPI with a call to MPI_Init.
    
 
    
@@ -166,7 +167,7 @@
 
    • 
 
 
  • 
-
    environment(int & argc, char **& argv, threading::level mt_level, 
+
    environment(int & argc, char **& argv, threading::level mt_level, 
             bool abort_on_exception = true);
    
 
    Initialize the MPI environment.
    
 
    If the MPI environment has not already been initialized, initializes MPI with a call to MPI_Init_thread.
    
@@ -207,18 +208,18 @@
  • -
    ~environment();
    +
    ~environment();

    Shuts down the MPI environment.

    If this environment object was used to initialize the MPI environment, and the MPI environment has not already been shut down (finalized), this destructor will shut down the MPI environment. Under normal circumstances, this only involves invoking MPI_Finalize. However, if destruction is the result of an uncaught exception and the abort_on_exception parameter of the constructor had the value true, this destructor will invoke MPI_Abort with MPI_COMM_WORLD to abort the entire MPI program with a result code of -1.

    • -

    -environment public static functions

    +

    +environment public static functions

    1. -
      static void abort(int errcode);
      +
      static void abort(int errcode);

      Abort all MPI processes.

      Aborts all MPI processes and returns to the environment. The precise behavior will be defined by the underlying MPI implementation. This is equivalent to a call to MPI_Abort with MPI_COMM_WORLD.

      @@ -251,7 +252,7 @@

  • -
    static bool initialized();
    +
    static bool initialized();

    Determine if the MPI environment has already been initialized.

    This routine is equivalent to a call to MPI_Initialized.

    @@ -268,7 +269,7 @@

  • -
    static bool finalized();
    +
    static bool finalized();

    Determine if the MPI environment has already been finalized.

    The routine is equivalent to a call to MPI_Finalized.

    @@ -285,7 +286,7 @@

  • -
    static int max_tag();
    +
    static int max_tag();

    Retrieves the maximum tag value.

    Returns the maximum value that may be used for the tag parameter of send/receive operations. This value will be somewhat smaller than the value of MPI_TAG_UB, because the Boost.MPI implementation reserves some tags for collective operations.

    @@ -302,7 +303,7 @@

  • -
    static int collectives_tag();
    +
    static int collectives_tag();

    The tag value used for collective operations.

    Returns the reserved tag value used by the Boost.MPI implementation for collective operations. Although users are not permitted to use this tag to send or receive messages, it may be useful when monitoring communication patterns.

    @@ -319,7 +320,7 @@

  • -
    static optional< int > host_rank();
    +
    static optional< int > host_rank();

    Retrieves the rank of the host process, if one exists.

    If there is a host process, this routine returns the rank of that process. Otherwise, it returns an empty optional<int>. MPI does not define the meaning of a "host" process: consult the documentation for the MPI implementation. This routine examines the MPI_HOST attribute of MPI_COMM_WORLD.

    @@ -336,7 +337,7 @@

  • -
    static optional< int > io_rank();
    +
    static optional< int > io_rank();

    Retrieves the rank of a process that can perform input/output.

    This routine returns the rank of a process that can perform input/output via the standard C and C++ I/O facilities. If every process can perform I/O using the standard facilities, this routine will return any_source; if no process can perform I/O, this routine will return no value (an empty optional). This routine examines the MPI_IO attribute of MPI_COMM_WORLD.

    @@ -353,7 +354,7 @@

  • -
    static std::string processor_name();
    +
    static std::string processor_name();

    Retrieve the name of this processor.

    This routine returns the name of this processor. The actual form of the name is unspecified, but may be documented by the underlying MPI implementation. This routine is implemented as a call to MPI_Get_processor_name.

    @@ -370,13 +371,16 @@

  • -
    static threading::level thread_level();
    +
    static threading::level thread_level();

    Query the current level of thread support.

  • -
    static bool is_main_thread();
    +
    static bool is_main_thread();

    Are we in the main thread?

    • +
  • +
    static std::pair< int, int > version();
    MPI version.

    Returns a pair with the version and sub-version number.

    +
    • @@ -393,7 +397,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/mpi/exception.html b/doc/html/boost/mpi/exception.html index db76493639..f52f3a2f7e 100644 --- a/doc/html/boost/mpi/exception.html +++ b/doc/html/boost/mpi/exception.html @@ -6,7 +6,7 @@ - + @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -30,32 +30,32 @@

    boost::mpi::exception — Catch-all exception class for MPI errors.

    Synopsis

    -
    // In header: <boost/mpi/exception.hpp>
+
    // In header: <boost/mpi/exception.hpp>
 
 
 class exception : public exception {
 public:
   // construct/copy/destruct
-  exception(const char *, int);
-  ~exception();
+  exception(const char *, int);
+  ~exception();
 
-  // public member functions
-  virtual const char * what() const;
-  const char * routine() const;
-  int result_code() const;
-  int error_class() const;
+  // public member functions
+  virtual const char * what() const;
+  const char * routine() const;
+  int result_code() const;
+  int error_class() const;
 };
    
 
    
-
    Description
    
+
    Description
    
 
    Instances of this class will be thrown when an MPI error occurs. MPI failures that trigger these exceptions may or may not be recoverable, depending on the underlying MPI implementation. Consult the documentation for your MPI implementation to determine the effect of MPI errors. 
    
 
    
-
    
+
    
 exception 
         public
        construct/copy/destruct
    
 
      
 
    1. 
-
      exception(const char * routine, int result_code);
      
+
      exception(const char * routine, int result_code);
      
 
      Build a new exception exception.
      
 
      
 
      
@@ -85,25 +85,25 @@
 
 
    
 
-
  • ~exception();
    • 
+
  • ~exception();
    • 
 
    
 
    
 
    
-
    
-exception public member functions
    
+
    
+exception public member functions
    
 
      
 
    1. 
-
      virtual const char * what() const;
      
+
      virtual const char * what() const;
      
 
      A description of the error that occurred. 
      
 
      2. 
 
    2. 
-
      const char * routine() const;
      
+
      const char * routine() const;
      
 
      Retrieve the name of the MPI routine that reported the error. 
      
 
      3. 
 
    3. 
-
      int result_code() const;
      Retrieve the result code returned from the MPI routine that reported the error. 
      4. 
+
      int result_code() const;
      Retrieve the result code returned from the MPI routine that reported the error. 
 
    4. 
-
      int error_class() const;
      Returns the MPI error class associated with the error that triggered this exception. 
      5. 
+
      int error_class() const;
      Returns the MPI error class associated with the error that triggered this exception.
    @@ -120,7 +120,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/mpi/gather.html b/doc/html/boost/mpi/gather.html index 9da52eedfb..1a9e38377e 100644 --- a/doc/html/boost/mpi/gather.html +++ b/doc/html/boost/mpi/gather.html @@ -6,7 +6,7 @@ - + @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -30,7 +30,7 @@

    boost::mpi::gather — Gather the values stored at every process into a vector at the root process.

    Synopsis

    -
    // In header: <boost/mpi/collectives.hpp>
+
    // In header: <boost/mpi/collectives.hpp>
 
 
 template<typename T> 
@@ -50,7 +50,7 @@
 template<typename T> 
   void gather(const communicator & comm, const T * in_values, int n, int root);
    
 
    
-
    Description
    
+
    Description
    
 
    gather is a collective algorithm that collects the values stored at each process into a vector of values at the root process. This vector is indexed by the process number that the value came from. The type T of the values may be any type that is serializable or has an associated MPI data type.
    
 
    When the type T has an associated MPI data type, this routine invokes MPI_Gather to gather the values.
    
 
    
@@ -102,7 +102,7 @@
 
 
    
 
    
-PrevUpHomeNext
+PrevUpHomeNext
 
    
 
 
diff --git a/doc/html/boost/mpi/gatherv.html b/doc/html/boost/mpi/gatherv.html
index 0d61f8cd68..62ca980e25 100644
--- a/doc/html/boost/mpi/gatherv.html
+++ b/doc/html/boost/mpi/gatherv.html
@@ -6,7 +6,7 @@
 
 
 
-
+
 
 
 
@@ -21,7 +21,7 @@
 
 
    
 
    
-PrevUpHomeNext
+PrevUpHomeNext
 
    
 
    
 
    
@@ -30,7 +30,7 @@
 
    boost::mpi::gatherv — Similar to boost::mpi::gather with the difference that the number of values to be send by non-root processes can vary. 
    
 
    
 
    Synopsis
    
-
    // In header: <boost/mpi/collectives.hpp>
+
    // In header: <boost/mpi/collectives.hpp>
 
 
 template<typename T> 
@@ -54,7 +54,7 @@
   void gatherv(const communicator & comm, const std::vector< T > & in_values, 
                T * out_values, const std::vector< int > & sizes, int root);
    
 
    
-
    Description
    
+
    Description
    
 
    
 
    
 
    
@@ -112,7 +112,7 @@
 
    
 
    
 
    
-PrevUpHomeNext
+PrevUpHomeNext
 
    
 
 
diff --git a/doc/html/boost/mpi/get_1_3_26_5_14_12_2_2_11.html b/doc/html/boost/mpi/get_1_3_26_5_14_12_2_2_11.html
new file mode 100644
index 0000000000..82e8a6b81e
--- /dev/null
+++ b/doc/html/boost/mpi/get_1_3_26_5_14_12_2_2_11.html
@@ -0,0 +1,57 @@
+
+
+
+
+Function get
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    
+
    
+
    
+PrevUpHomeNext
+
    
+
    
+
    
+
    
+
    Function get
    
+
    boost::mpi::get — Returns a property map that maps from vertices in a communicator's graph topology to their index values. 
    
+
    
+
    Synopsis
    
+
    // In header: <boost/mpi/graph_communicator.hpp>
+
+
+identity_property_map get(vertex_index_t, const graph_communicator &);
    
+
    
+
    Description
    
+
    Since the vertices are ranks in the communicator, the returned property map is the identity property map. 
    
+
    
+
    
+
+
+
+
    Copyright © 2005-2007 Douglas Gregor,
+      Matthias Troyer, Trustees of Indiana University
    
+        Distributed under the Boost Software License, Version 1.0. (See accompanying
+        file LICENSE_1_0.txt or copy at 
+        http://www.boost.org/LICENSE_1_0.txt )
+      
    
+
    
+
    
+
    
+PrevUpHomeNext
+
    
+
+
diff --git a/doc/html/boost/mpi/get_1_3_26_5_14_12_2_2_12.html b/doc/html/boost/mpi/get_1_3_26_5_14_12_2_2_12.html
new file mode 100644
index 0000000000..ad0833b390
--- /dev/null
+++ b/doc/html/boost/mpi/get_1_3_26_5_14_12_2_2_12.html
@@ -0,0 +1,57 @@
+
+
+
+
+Function get
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    
+
    
+
    
+PrevUpHomeNext
+
    
+
    
+
    
+
    
+
    Function get
    
+
    boost::mpi::get — Returns the index of a vertex in the communicator's graph topology. 
    
+
    
+
    Synopsis
    
+
    // In header: <boost/mpi/graph_communicator.hpp>
+
+
+int get(vertex_index_t, const graph_communicator &, int vertex);
    
+
    
+
    Description
    
+
    Since the vertices are ranks in the communicator, this is the identity function. 
    
+
    
+
    
+
+
+
+
    Copyright © 2005-2007 Douglas Gregor,
+      Matthias Troyer, Trustees of Indiana University
    
+        Distributed under the Boost Software License, Version 1.0. (See accompanying
+        file LICENSE_1_0.txt or copy at 
+        http://www.boost.org/LICENSE_1_0.txt )
+      
    
+
    
+
    
+
    
+PrevUpHomeNext
+
    
+
+
diff --git a/doc/html/boost/mpi/get_1_3_26_6_11_2_2_11.html b/doc/html/boost/mpi/get_1_3_26_6_11_2_2_11.html
deleted file mode 100644
index 4e8440535f..0000000000
--- a/doc/html/boost/mpi/get_1_3_26_6_11_2_2_11.html
+++ /dev/null
@@ -1,57 +0,0 @@
-
-
-
-
-Function get
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    
-
    
-
    
-PrevUpHomeNext
-
    
-
    
-
    
-
    
-
    Function get
    
-
    boost::mpi::get — Returns a property map that maps from vertices in a communicator's graph topology to their index values. 
    
-
    
-
    Synopsis
    
-
    // In header: <boost/mpi/graph_communicator.hpp>
-
-
-identity_property_map get(vertex_index_t, const graph_communicator &);
    
-
    
-
    Description
    
-
    Since the vertices are ranks in the communicator, the returned property map is the identity property map. 
    
-
    
-
    
-
-
-
-
    Copyright © 2005-2007 Douglas Gregor,
-      Matthias Troyer, Trustees of Indiana University
    
-        Distributed under the Boost Software License, Version 1.0. (See accompanying
-        file LICENSE_1_0.txt or copy at 
-        http://www.boost.org/LICENSE_1_0.txt )
-      
    
-
    
-
    
-
    
-PrevUpHomeNext
-
    
-
-
diff --git a/doc/html/boost/mpi/get_1_3_26_6_11_2_2_12.html b/doc/html/boost/mpi/get_1_3_26_6_11_2_2_12.html
deleted file mode 100644
index bf90c9ee43..0000000000
--- a/doc/html/boost/mpi/get_1_3_26_6_11_2_2_12.html
+++ /dev/null
@@ -1,57 +0,0 @@
-
-
-
-
-Function get
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    
-
    
-
    
-PrevUpHomeNext
-
    
-
    
-
    
-
    
-
    Function get
    
-
    boost::mpi::get — Returns the index of a vertex in the communicator's graph topology. 
    
-
    
-
    Synopsis
    
-
    // In header: <boost/mpi/graph_communicator.hpp>
-
-
-int get(vertex_index_t, const graph_communicator &, int vertex);
    
-
    
-
    Description
    
-
    Since the vertices are ranks in the communicator, this is the identity function. 
    
-
    
-
    
-
-
-
-
    Copyright © 2005-2007 Douglas Gregor,
-      Matthias Troyer, Trustees of Indiana University
    
-        Distributed under the Boost Software License, Version 1.0. (See accompanying
-        file LICENSE_1_0.txt or copy at 
-        http://www.boost.org/LICENSE_1_0.txt )
-      
    
-
    
-
    
-
    
-PrevUpHomeNext
-
    
-
-
diff --git a/doc/html/boost/mpi/get_content.html b/doc/html/boost/mpi/get_content.html
index d07248cf1b..aaebfad2ef 100644
--- a/doc/html/boost/mpi/get_content.html
+++ b/doc/html/boost/mpi/get_content.html
@@ -6,7 +6,7 @@
 
 
 
-
+
 
 
 
@@ -21,7 +21,7 @@
 
 
    
 
    
-PrevUpHomeNext
+PrevUpHomeNext
 
    
 
    
 
    
@@ -30,12 +30,12 @@
 
    boost::mpi::get_content — Returns the content of an object, suitable for transmission via Boost.MPI. 
    
 
    
 
    Synopsis
    
-
    // In header: <boost/mpi/skeleton_and_content.hpp>
+
    // In header: <boost/mpi/skeleton_and_content.hpp>
 
 
 template<typename T> const content get_content(const T & x);
    
 
    
-
    Description
    
+
    Description
    
 
    The function creates an absolute MPI datatype for the object, where all offsets are counted from the address 0 (a.k.a. MPI_BOTTOM) instead of the address &x of the object. This allows the creation of MPI data types for complex data structures containing pointers, such as linked lists or trees.
    
 
    The disadvantage, compared to relative MPI data types is that for each object a new MPI data type has to be created.
    
 
    The contents of an object can only be transmitted when the receiver already has an object with the same structure or shape as the sender. To accomplish this, first transmit the skeleton of the object using, e.g., skeleton() or skeleton_proxy.
    
@@ -82,7 +82,7 @@
 
 
    
 
    
-PrevUpHomeNext
+PrevUpHomeNext
 
    
 
 
diff --git a/doc/html/boost/mpi/get_mp_1_3_26_5_14_8_2_1_8.html b/doc/html/boost/mpi/get_mp_1_3_26_5_14_8_2_1_8.html
new file mode 100644
index 0000000000..69a5c20e73
--- /dev/null
+++ b/doc/html/boost/mpi/get_mp_1_3_26_5_14_8_2_1_8.html
@@ -0,0 +1,87 @@
+
+
+
+
+Function template get_mpi_datatype
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    
+
    
+
    
+PrevUpHomeNext
+
    
+
    
+
    
+
    
+
    Function template get_mpi_datatype
    
+
    boost::mpi::get_mpi_datatype — Returns an MPI data type for a C++ type. 
    
+
    
+
    Synopsis
    
+
    // In header: <boost/mpi/datatype.hpp>
+
+
+template<typename T> MPI_Datatype get_mpi_datatype(const T & x);
    
+
    
+
    Description
    
+
    The function creates an MPI data type for the given object x. The first time it is called for a class T, the MPI data type is created and cached. Subsequent calls for objects of the same type T return the cached MPI data type. The type T must allow creation of an MPI data type. That is, it must be Serializable and is_mpi_datatype<T> must derive mpl::true_.
    
+
    For fundamental MPI types, a copy of the MPI data type of the MPI library is returned.
    
+
    Note that since the data types are cached, the caller should never call MPI_Type_free() for the MPI data type returned by this call.
    
+
    
+
+
    
+
    
++++
+
+
+
+
+
+
+
+
+
+
+
    



    Parameters:
    
++++
+
+
+
+
+
    



    x
    for an optimized call, a constructed object of the type should be passed; otherwise, an object will be default-constructed.
    Returns:
    The MPI data type corresponding to type T. 
    
+
    
+
    
+
+
+
+
    Copyright © 2005-2007 Douglas Gregor,
+      Matthias Troyer, Trustees of Indiana University
    
+        Distributed under the Boost Software License, Version 1.0. (See accompanying
+        file LICENSE_1_0.txt or copy at 
+        http://www.boost.org/LICENSE_1_0.txt )
+      
    
+
    
+
    
+
    
+PrevUpHomeNext
+
    
+
+
diff --git a/doc/html/boost/mpi/get_mpi_d_1_3_26_6_7_2_1_8.html b/doc/html/boost/mpi/get_mpi_d_1_3_26_6_7_2_1_8.html
deleted file mode 100644
index ffc1c4b9e8..0000000000
--- a/doc/html/boost/mpi/get_mpi_d_1_3_26_6_7_2_1_8.html
+++ /dev/null
@@ -1,87 +0,0 @@
-
-
-
-
-Function template get_mpi_datatype
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    
-
    
-
    
-PrevUpHomeNext
-
    
-
    
-
    
-
    
-
    Function template get_mpi_datatype
    
-
    boost::mpi::get_mpi_datatype — Returns an MPI data type for a C++ type. 
    
-
    
-
    Synopsis
    
-
    // In header: <boost/mpi/datatype.hpp>
-
-
-template<typename T> MPI_Datatype get_mpi_datatype(const T & x);
    
-
    
-
    Description
    
-
    The function creates an MPI data type for the given object x. The first time it is called for a class T, the MPI data type is created and cached. Subsequent calls for objects of the same type T return the cached MPI data type. The type T must allow creation of an MPI data type. That is, it must be Serializable and is_mpi_datatype<T> must derive mpl::true_.
    
-
    For fundamental MPI types, a copy of the MPI data type of the MPI library is returned.
    
-
    Note that since the data types are cached, the caller should never call MPI_Type_free() for the MPI data type returned by this call.
    
-
    
-
-
    
-
    
----
-
-
-
-
-
-
-
-
-
-
-
    



    Parameters:
    
----
-
-
-
-
-
    



    x
    for an optimized call, a constructed object of the type should be passed; otherwise, an object will be default-constructed.
    Returns:
    The MPI data type corresponding to type T. 
    
-
    
-
    
-
-
-
-
    Copyright © 2005-2007 Douglas Gregor,
-      Matthias Troyer, Trustees of Indiana University
    
-        Distributed under the Boost Software License, Version 1.0. (See accompanying
-        file LICENSE_1_0.txt or copy at 
-        http://www.boost.org/LICENSE_1_0.txt )
-      
    
-
    
-
    
-
    
-PrevUpHomeNext
-
    
-
-
diff --git a/doc/html/boost/mpi/graph_communicator.html b/doc/html/boost/mpi/graph_communicator.html
index 3d0c95a536..6a15879948 100644
--- a/doc/html/boost/mpi/graph_communicator.html
+++ b/doc/html/boost/mpi/graph_communicator.html
@@ -6,9 +6,9 @@
 
 
 
-
+
 
-
+
 
 
 
@@ -21,7 +21,7 @@
 
    
 
    
 
    
-PrevUpHomeNext
+PrevUpHomeNext
 
    
 
    
 
    
@@ -30,31 +30,31 @@
 
    boost::mpi::graph_communicator — An MPI communicator with a graph topology. 
    
 
    
 
    Synopsis
    
-
    // In header: <boost/mpi/graph_communicator.hpp>
+
    // In header: <boost/mpi/graph_communicator.hpp>
 
 
 class graph_communicator : public boost::mpi::communicator {
 public:
   // construct/copy/destruct
-  graph_communicator(const MPI_Comm &, comm_create_kind);
+  graph_communicator(const MPI_Comm &, comm_create_kind);
   template<typename Graph> 
-    explicit graph_communicator(const communicator &, const Graph &, 
+    explicit graph_communicator(const communicator &, const Graph &, 
                                 bool = false);
   template<typename Graph, typename RankMap> 
-    explicit graph_communicator(const communicator &, const Graph &, RankMap, 
+    explicit graph_communicator(const communicator &, const Graph &, RankMap, 
                                 bool = false);
 };
    
 
    
-
    Description
    
+
    Description
    
 
    A graph_communicator is a communicator whose topology is expressed as a graph. Graph communicators have the same functionality as (intra)communicators, but also allow one to query the relationships among processes. Those relationships are expressed via a graph, using the interface defined by the Boost Graph Library. The graph_communicator class meets the requirements of the BGL Graph, Incidence Graph, Adjacency Graph, Vertex List Graph, and Edge List Graph concepts. 
    
 
    
-
    
+
    
 graph_communicator 
         public
        construct/copy/destruct
    
 
      
 
    1. 
-
      graph_communicator(const MPI_Comm & comm, comm_create_kind kind);
      
+
      graph_communicator(const MPI_Comm & comm, comm_create_kind kind);
      
 
      Build a new Boost.MPI graph communicator based on the MPI communicator comm with graph topology.
      
 
      comm may be any valid MPI communicator. If comm is MPI_COMM_NULL, an empty communicator (that cannot be used for communication) is created and the kind parameter is ignored. Otherwise, the kind parameter determines how the Boost.MPI communicator will be related to comm: 
      
 
        
@@ -67,7 +67,7 @@
 
 
      • 
 
        template<typename Graph> 
-  explicit graph_communicator(const communicator & comm, const Graph & graph, 
+  explicit graph_communicator(const communicator & comm, const Graph & graph, 
                               bool reorder = false);
        
 
        Create a new communicator whose topology is described by the given graph. The indices of the vertices in the graph will be assumed to be the ranks of the processes within the communicator. There may be fewer vertices in the graph than there are processes in the communicator; in this case, the resulting communicator will be a NULL communicator.
        
 
        
@@ -104,7 +104,7 @@
 
        • 
 
      • 
 
        template<typename Graph, typename RankMap> 
-  explicit graph_communicator(const communicator & comm, const Graph & graph, 
+  explicit graph_communicator(const communicator & comm, const Graph & graph, 
                               RankMap rank, bool reorder = false);
        
 
        Create a new communicator whose topology is described by the given graph. The rank map (rank) gives the mapping from vertices in the graph to ranks within the communicator. There may be fewer vertices in the graph than there are processes in the communicator; in this case, the resulting communicator will be a NULL communicator.
        
 
        
@@ -159,7 +159,7 @@
 
 
        
 
        
-PrevUpHomeNext
+PrevUpHomeNext
 
        
 
 
diff --git a/doc/html/boost/mpi/group.html b/doc/html/boost/mpi/group.html
index eaf449ee10..4a4626b8e3 100644
--- a/doc/html/boost/mpi/group.html
+++ b/doc/html/boost/mpi/group.html
@@ -6,9 +6,9 @@
 
 
 
-
-
-
+
+
+
 
 
 
@@ -21,7 +21,7 @@
 
        
 
        
 
        
-PrevUpHomeNext
+PrevUpHomeNext
 
        
 
        
 
        
@@ -30,40 +30,40 @@
 
        boost::mpi::group — A group is a representation of a subset of the processes within a communicator. 
        
 
        
 
        Synopsis
        
-
        // In header: <boost/mpi/group.hpp>
+
        // In header: <boost/mpi/group.hpp>
 
 
 class group {
 public:
   // construct/copy/destruct
-  group();
-  group(const MPI_Group &, bool);
+  group();
+  group(const MPI_Group &, bool);
 
-  // public member functions
-  optional< int > rank() const;
-  int size() const;
+  // public member functions
+  optional< int > rank() const;
+  int size() const;
   template<typename InputIterator, typename OutputIterator> 
     OutputIterator 
-    translate_ranks(InputIterator, InputIterator, const group &, 
+    translate_ranks(InputIterator, InputIterator, const group &, 
                     OutputIterator);
-  operator bool() const;
-  operator MPI_Group() const;
-  template<typename InputIterator> group include(InputIterator, InputIterator);
-  template<typename InputIterator> group exclude(InputIterator, InputIterator);
+  operator bool() const;
+  operator MPI_Group() const;
+  template<typename InputIterator> group include(InputIterator, InputIterator);
+  template<typename InputIterator> group exclude(InputIterator, InputIterator);
 };
        
 
        
-
        Description
        
+
        Description
        
 
        The group class allows one to create arbitrary subsets of the processes within a communicator. One can compute the union, intersection, or difference of two groups, or create new groups by specifically including or excluding certain processes. Given a group, one can create a new communicator containing only the processes in that group. 
        
 
        
-
        
+
        
 group 
         public
        construct/copy/destruct
        
 
          
 
        1. 
-
          group();
          Constructs an empty group. 
          2. 
+
          group();
          Constructs an empty group. 
 
        2. 
-
          group(const MPI_Group & in_group, bool adopt);
          Constructs a group from an MPI_Group. 
          This routine allows one to construct a Boost.MPI group from a C MPI_Group. The group object can (optionally) adopt the MPI_Group, after which point the group object becomes responsible for freeing the MPI_Group when the last copy of group disappears.
          
+
          group(const MPI_Group & in_group, bool adopt);
          Constructs a group from an MPI_Group. 
          This routine allows one to construct a Boost.MPI group from a C MPI_Group. The group object can (optionally) adopt the MPI_Group, after which point the group object becomes responsible for freeing the MPI_Group when the last copy of group disappears.
          
 
          
 
          
 
          
@@ -95,11 +95,11 @@
 
          
-
          
-group public member functions
          
+
          
+group public member functions
          
 
            
 
          1. 
-
            optional< int > rank() const;
            Determine the rank of the calling process in the group. 
            This routine is equivalent to MPI_Group_rank.
            
+
            optional< int > rank() const;
            Determine the rank of the calling process in the group. 
            This routine is equivalent to MPI_Group_rank.
            
 
            
 
            
 
          
 
 
          
@@ -114,7 +114,7 @@
 
          
 
          3. 
 
        3. 
-
          int size() const;
          Determine the number of processes in the group. 
          This routine is equivalent to MPI_Group_size.
          
+
          int size() const;
          Determine the number of processes in the group. 
          This routine is equivalent to MPI_Group_size.
          
 
          
 
          
 
          
@@ -131,7 +131,7 @@
 
        4. 
 
          template<typename InputIterator, typename OutputIterator> 
   OutputIterator 
-  translate_ranks(InputIterator first, InputIterator last, 
+  translate_ranks(InputIterator first, InputIterator last, 
                   const group & to_group, OutputIterator out);
          Translates the ranks from one group into the ranks of the same processes in another group. 
          This routine translates each of the integer rank values in the iterator range [first, last) from the current group into rank values of the corresponding processes in to_group. The corresponding rank values are written via the output iterator out. When there is no correspondence between a rank in the current group and a rank in to_group, the value MPI_UNDEFINED is written to the output iterator.
          
 
          
 
@@ -177,7 +177,7 @@
 
          5. 
 
          5. 
 
        5. 
-
          operator bool() const;
          Determines whether the group is non-empty. 
          
+
          operator bool() const;
          Determines whether the group is non-empty. 
          
 
          
 
          @@ -191,7 +191,7 @@
 
          
 

          
 
          6. 
 
        6. 
-
          operator MPI_Group() const;
          Retrieves the underlying MPI_Group associated with this group. 
          
+
          operator MPI_Group() const;
          Retrieves the underlying MPI_Group associated with this group. 
          
 
          
 
          @@ -206,7 +206,7 @@
 
        7. 
 
          template<typename InputIterator> 
-  group include(InputIterator first, InputIterator last);
          Creates a new group including a subset of the processes in the current group. 
          This routine creates a new group which includes only those processes in the current group that are listed in the integer iterator range [first, last). Equivalent to MPI_Group_incl.
          
+  group include(InputIterator first, InputIterator last);Creates a new group including a subset of the processes in the current group. 
          This routine creates a new group which includes only those processes in the current group that are listed in the integer iterator range [first, last). Equivalent to MPI_Group_incl.
          
 
          first The beginning of the iterator range of ranks to include.
          
 
          last Past the end of the iterator range of ranks to include.
          
 
          
@@ -224,7 +224,7 @@
 
        8. 
 
          template<typename InputIterator> 
-  group exclude(InputIterator first, InputIterator last);
          Creates a new group from all of the processes in the current group, exluding a specific subset of the processes. 
          This routine creates a new group which includes all of the processes in the current group except those whose ranks are listed in the integer iterator range [first, last). Equivalent to MPI_Group_excl.
          
+  group exclude(InputIterator first, InputIterator last);Creates a new group from all of the processes in the current group, exluding a specific subset of the processes. 
          This routine creates a new group which includes all of the processes in the current group except those whose ranks are listed in the integer iterator range [first, last). Equivalent to MPI_Group_excl.
          
 
          first The beginning of the iterator range of ranks to exclude.
          
 
          last Past the end of the iterator range of ranks to exclude.
          
 
          
@@ -256,7 +256,7 @@
 
          9. 
 

 
 
          
 
          
 
          
-PrevUpHomeNext
+PrevUpHomeNext
 
          
 
 
diff --git a/doc/html/boost/mpi/inpla_1_3_26_5_14_14_2_1_2.html b/doc/html/boost/mpi/inpla_1_3_26_5_14_14_2_1_2.html
new file mode 100644
index 0000000000..d67d36c799
--- /dev/null
+++ b/doc/html/boost/mpi/inpla_1_3_26_5_14_14_2_1_2.html
@@ -0,0 +1,69 @@
+
+
+
+
+Struct template inplace_t<T *>
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
          Boost C++ LibrariesHomeLibrariesPeopleFAQMore
          
+
          
+
          
+PrevUpHomeNext
+
          
+
          
+
          
+
          
+
          Struct template inplace_t<T *>
          
+
          boost::mpi::inplace_t<T *>
          
+
          
+
          Synopsis
          
+
          // In header: <boost/mpi/inplace.hpp>
+
+template<typename T> 
+struct inplace_t<T *> {
+  // construct/copy/destruct
+  inplace_t(T *);
+
+  // public data members
+  T * buffer;
+};
          
+
          
+
          Description
          
+
          
+
          
+inplace_t 
+        public
+       construct/copy/destruct
          
+
          1. inplace_t(T * inout);
          
+
          
+
          
+
          
+
+
+
+
          Copyright © 2005-2007 Douglas Gregor,
+      Matthias Troyer, Trustees of Indiana University
          
+        Distributed under the Boost Software License, Version 1.0. (See accompanying
+        file LICENSE_1_0.txt or copy at 
+        http://www.boost.org/LICENSE_1_0.txt )
+      
          
+
          
+
          
+
          
+PrevUpHomeNext
+
          
+
+
diff --git a/doc/html/boost/mpi/inplace.html b/doc/html/boost/mpi/inplace.html
index bca16100a3..0ba37b5090 100644
--- a/doc/html/boost/mpi/inplace.html
+++ b/doc/html/boost/mpi/inplace.html
@@ -6,8 +6,8 @@
 
 
 
-
-
+
+
 
 
 
@@ -21,7 +21,7 @@
 
 
          
 
          
-PrevUpHomeNext
+PrevUpHomeNext
 
          
 
          
 
          
@@ -30,13 +30,13 @@
 
          boost::mpi::inplace — Wrapp a input data to indicate that it can be overriden with an ouput value. 
          
 
          
 
          Synopsis
          
-
          // In header: <boost/mpi/inplace.hpp>
+
          // In header: <boost/mpi/inplace.hpp>
 
 
 template<typename T> inplace_t< T > inplace(T & inout);
 template<typename T> inplace_t< T * > inplace(T * inout);
          
 
          
-
          Description
          
+
          Description
          
 
          
 
 
          
@@ -79,7 +79,7 @@
 
 
          
 
          
-PrevUpHomeNext
+PrevUpHomeNext
 
          
 
 
diff --git a/doc/html/boost/mpi/inplace__1_3_26_6_13_2_1_2.html b/doc/html/boost/mpi/inplace__1_3_26_6_13_2_1_2.html
deleted file mode 100644
index 01624b1d9b..0000000000
--- a/doc/html/boost/mpi/inplace__1_3_26_6_13_2_1_2.html
+++ /dev/null
@@ -1,69 +0,0 @@
-
-
-
-
-Struct template inplace_t<T *>
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
          Boost C++ LibrariesHomeLibrariesPeopleFAQMore
          
-
          
-
          
-PrevUpHomeNext
-
          
-
          
-
          
-
          
-
          Struct template inplace_t<T *>
          
-
          boost::mpi::inplace_t<T *>
          
-
          
-
          Synopsis
          
-
          // In header: <boost/mpi/inplace.hpp>
-
-template<typename T> 
-struct inplace_t<T *> {
-  // construct/copy/destruct
-  inplace_t(T *);
-
-  // public data members
-  T * buffer;
-};
          
-
          
-
          Description
          
-
          
-
          
-inplace_t 
-        public
-       construct/copy/destruct
          
-
          1. inplace_t(T * inout);
          
-
          
-
          
-
          
-
-
-
-
          Copyright © 2005-2007 Douglas Gregor,
-      Matthias Troyer, Trustees of Indiana University
          
-        Distributed under the Boost Software License, Version 1.0. (See accompanying
-        file LICENSE_1_0.txt or copy at 
-        http://www.boost.org/LICENSE_1_0.txt )
-      
          
-
          
-
          
-
          
-PrevUpHomeNext
-
          
-
-
diff --git a/doc/html/boost/mpi/inplace_t.html b/doc/html/boost/mpi/inplace_t.html
index c1b4cfcaf6..7ebb55f3dc 100644
--- a/doc/html/boost/mpi/inplace_t.html
+++ b/doc/html/boost/mpi/inplace_t.html
@@ -6,9 +6,9 @@
 
 
 
-
+
 
-
+
 
 
 
@@ -21,7 +21,7 @@
 
          
 
          
 
          
-PrevUpHomeNext
+PrevUpHomeNext
 
          
 
          
 
          
@@ -30,24 +30,24 @@
 
          boost::mpi::inplace_t — Wrapper type to explicitly indicate that a input data can be overriden with an output value. 
          
 
          
 
          Synopsis
          
-
          // In header: <boost/mpi/inplace.hpp>
+
          // In header: <boost/mpi/inplace.hpp>
 
 template<typename T> 
 struct inplace_t {
   // construct/copy/destruct
-  inplace_t(T &);
+  inplace_t(T &);
 
   // public data members
   T & buffer;
 };
          
 
          
-
          Description
          
+
          Description
          
 
          
-
          
+
          
 inplace_t 
         public
        construct/copy/destruct
          
-
          1. inplace_t(T & inout);
          
+
          1. inplace_t(T & inout);
          
 
          
 
          
 
          
@@ -63,7 +63,7 @@
 
 
          
 
          
-PrevUpHomeNext
+PrevUpHomeNext
 
          
 
 
diff --git a/doc/html/boost/mpi/intercommunicator.html b/doc/html/boost/mpi/intercommunicator.html
index 318bcc97bc..d10f97b84c 100644
--- a/doc/html/boost/mpi/intercommunicator.html
+++ b/doc/html/boost/mpi/intercommunicator.html
@@ -6,7 +6,7 @@
 
 
 
-
+
 
 
 
@@ -21,7 +21,7 @@
 
 
          
 
          
-PrevUpHomeNext
+PrevUpHomeNext
 
          
 
          
 
          
@@ -30,35 +30,35 @@
 
          boost::mpi::intercommunicator — Communication facilities among processes in different groups. 
          
 
          
 
          Synopsis
          
-
          // In header: <boost/mpi/intercommunicator.hpp>
+
          // In header: <boost/mpi/intercommunicator.hpp>
 
 
 class intercommunicator : public boost::mpi::communicator {
 public:
   // construct/copy/destruct
-  intercommunicator(const MPI_Comm &, comm_create_kind);
-  intercommunicator(const communicator &, int, const communicator &, int);
+  intercommunicator(const MPI_Comm &, comm_create_kind);
+  intercommunicator(const communicator &, int, const communicator &, int);
 
-  // public member functions
-  int local_size() const;
-  boost::mpi::group local_group() const;
-  int local_rank() const;
-  int remote_size() const;
-  boost::mpi::group remote_group() const;
-  communicator merge(bool) const;
+  // public member functions
+  int local_size() const;
+  boost::mpi::group local_group() const;
+  int local_rank() const;
+  int remote_size() const;
+  boost::mpi::group remote_group() const;
+  communicator merge(bool) const;
 };
          
 
          
-
          Description
          
+
          Description
          
 
          The intercommunicator class provides communication facilities among processes from different groups. An intercommunicator is always associated with two process groups: one "local" process group, containing the process that initiates an MPI operation (e.g., the sender in a send operation), and one "remote" process group, containing the process that is the target of the MPI operation.
          
 
          While intercommunicators have essentially the same point-to-point operations as intracommunicators (the latter communicate only within a single process group), all communication with intercommunicators occurs between the processes in the local group and the processes in the remote group; communication within a group must use a different (intra-)communicator. 
          
 
          
-
          
+
          
 intercommunicator 
         public
        construct/copy/destruct
          
 
            
 
          1. 
-
            intercommunicator(const MPI_Comm & comm, comm_create_kind kind);
            
+
            intercommunicator(const MPI_Comm & comm, comm_create_kind kind);
            
 
            Build a new Boost.MPI intercommunicator based on the MPI intercommunicator comm.
            
 
            comm may be any valid MPI intercommunicator. If comm is MPI_COMM_NULL, an empty communicator (that cannot be used for communication) is created and the kind parameter is ignored. Otherwise, the kind parameter determines how the Boost.MPI communicator will be related to comm: 
            
 
              
@@ -70,7 +70,7 @@
 
              
 
 
            • 
-
              intercommunicator(const communicator & local, int local_leader, 
+
              intercommunicator(const communicator & local, int local_leader, 
                   const communicator & peer, int remote_leader);
              
 
              Constructs a new intercommunicator whose local group is local and whose remote group is peer. The intercommunicator can then be used to communicate between processes in the two groups. This constructor is equivalent to a call to MPI_Intercomm_create.
              
 
              
@@ -112,31 +112,31 @@
 
          
 
          
 
          
-
          
-intercommunicator public member functions
          
+
          
+intercommunicator public member functions
          
 
            
 
          1. 
-
            int local_size() const;
            
+
            int local_size() const;
            
 
            Returns the size of the local group, i.e., the number of local processes that are part of the group. 
            
 
            2. 
 
          2. 
-
            boost::mpi::group local_group() const;
            
+
            boost::mpi::group local_group() const;
            
 
            Returns the local group, containing all of the local processes in this intercommunicator. 
            
 
            3. 
 
          3. 
-
            int local_rank() const;
            
+
            int local_rank() const;
            
 
            Returns the rank of this process within the local group. 
            
 
            4. 
 
          4. 
-
            int remote_size() const;
            
+
            int remote_size() const;
            
 
            Returns the size of the remote group, i.e., the number of processes that are part of the remote group. 
            
 
            5. 
 
          5. 
-
            boost::mpi::group remote_group() const;
            
+
            boost::mpi::group remote_group() const;
            
 
            Returns the remote group, containing all of the remote processes in this intercommunicator. 
            
 
            6. 
 
          6. 
-
            communicator merge(bool high) const;
            
+
            communicator merge(bool high) const;
            
 
            Merge the local and remote groups in this intercommunicator into a new intracommunicator containing the union of the processes in both groups. This method is equivalent to MPI_Intercomm_merge.
            
 
            
 
@@ -183,7 +183,7 @@
 
 
            
 
            
-PrevUpHomeNext
+PrevUpHomeNext
 
            
 
 
diff --git a/doc/html/boost/mpi/is_commutative.html b/doc/html/boost/mpi/is_commutative.html
index e4cc3b9be5..5f983c8d5a 100644
--- a/doc/html/boost/mpi/is_commutative.html
+++ b/doc/html/boost/mpi/is_commutative.html
@@ -6,7 +6,7 @@
 
 
 
-
+
 
 
 
@@ -21,7 +21,7 @@
 
 
            
 
            
-PrevUpHomeNext
+PrevUpHomeNext
 
            
 
            
 
            
@@ -30,13 +30,13 @@
 
            boost::mpi::is_commutative — Determine if a function object type is commutative. 
            
 
            
 
            Synopsis
            
-
            // In header: <boost/mpi/operations.hpp>
+
            // In header: <boost/mpi/operations.hpp>
 
 template<typename Op, typename T> 
 struct is_commutative : public false_ {
 };
            
 
            
-
            Description
            
+
            Description
            
 
            This trait determines if an operation Op is commutative when applied to values of type T. Parallel operations such as reduce and prefix_sum can be implemented more efficiently with commutative operations. To mark an operation as commutative, users should specialize is_commutative and derive from the class mpl::true_. 
            
 
            
 
            
@@ -52,7 +52,7 @@
 
 
            
 
            
-PrevUpHomeNext
+PrevUpHomeNext
 
            
 
 
diff --git a/doc/html/boost/mpi/is_mpi_1_3_26_5_14_3_2_1_2.html b/doc/html/boost/mpi/is_mpi_1_3_26_5_14_3_2_1_2.html
new file mode 100644
index 0000000000..b0acc16323
--- /dev/null
+++ b/doc/html/boost/mpi/is_mpi_1_3_26_5_14_3_2_1_2.html
@@ -0,0 +1,54 @@
+
+
+
+
+Struct is_mpi_datatype<cartesian_dimension>
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
            Boost C++ LibrariesHomeLibrariesPeopleFAQMore
            
+
            
+
            
+PrevUpHomeNext
+
            
+
            
+
            
+
            
+
            Struct is_mpi_datatype<cartesian_dimension>
            
+
            boost::mpi::is_mpi_datatype<cartesian_dimension>
            
+
            
+
            Synopsis
            
+
            // In header: <boost/mpi/cartesian_communicator.hpp>
+
+
+struct is_mpi_datatype<cartesian_dimension> : public true_ {
+};
            
+
            
+
+
+
+
            Copyright © 2005-2007 Douglas Gregor,
+      Matthias Troyer, Trustees of Indiana University
            
+        Distributed under the Boost Software License, Version 1.0. (See accompanying
+        file LICENSE_1_0.txt or copy at 
+        http://www.boost.org/LICENSE_1_0.txt )
+      
            
+
            
+
            
+
            
+PrevUpHomeNext
+
            
+
+
diff --git a/doc/html/boost/mpi/is_mpi_1_3_26_5_14_8_2_1_2.html b/doc/html/boost/mpi/is_mpi_1_3_26_5_14_8_2_1_2.html
new file mode 100644
index 0000000000..4ed1d6ea41
--- /dev/null
+++ b/doc/html/boost/mpi/is_mpi_1_3_26_5_14_8_2_1_2.html
@@ -0,0 +1,58 @@
+
+
+
+
+Struct template is_mpi_floating_point_datatype
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
            Boost C++ LibrariesHomeLibrariesPeopleFAQMore
            
+
            
+
            
+PrevUpHomeNext
+
            
+
            
+
            
+
            
+
            Struct template is_mpi_floating_point_datatype
            
+
            boost::mpi::is_mpi_floating_point_datatype — Type trait that determines if there exists a built-in floating point MPI data type for a given C++ type. 
            
+
            
+
            Synopsis
            
+
            // In header: <boost/mpi/datatype.hpp>
+
+template<typename T> 
+struct is_mpi_floating_point_datatype : public false_ {
+};
            
+
            
+
            Description
            
+
            This type trait determines when there is a direct mapping from a C++ type to an MPI data type that is classified as a floating point data type. See is_mpi_builtin_datatype for general information about built-in MPI data types. 
            
+
            
+
            
+
+
+
+
            Copyright © 2005-2007 Douglas Gregor,
+      Matthias Troyer, Trustees of Indiana University
            
+        Distributed under the Boost Software License, Version 1.0. (See accompanying
+        file LICENSE_1_0.txt or copy at 
+        http://www.boost.org/LICENSE_1_0.txt )
+      
            
+
            
+
            
+
            
+PrevUpHomeNext
+
            
+
+
diff --git a/doc/html/boost/mpi/is_mpi_builtin_datatype.html b/doc/html/boost/mpi/is_mpi_builtin_datatype.html
index e089964003..fdd9a4c977 100644
--- a/doc/html/boost/mpi/is_mpi_builtin_datatype.html
+++ b/doc/html/boost/mpi/is_mpi_builtin_datatype.html
@@ -6,7 +6,7 @@
 
 
 
-
+
 
 
 
@@ -21,7 +21,7 @@
 
 
            
 
            
-PrevUpHomeNext
+PrevUpHomeNext
 
            
 
            
 
            
@@ -30,16 +30,16 @@
 
            boost::mpi::is_mpi_builtin_datatype — Type trait that determines if there exists a built-in MPI data type for a given C++ type. 
            
 
            
 
            Synopsis
            
-
            // In header: <boost/mpi/datatype.hpp>
+
            // In header: <boost/mpi/datatype.hpp>
 
 template<typename T> 
 struct is_mpi_builtin_datatype : public boost::mpl::or_< is_mpi_integer_datatype< T >, is_mpi_floating_point_datatype< T >, is_mpi_logical_datatype< T >, is_mpi_complex_datatype< T >, is_mpi_byte_datatype< T > >
 {
 };
            
 
            
-
            Description
            
+
            Description
            
 
            This type trait determines when there is a direct mapping from a C++ type to an MPI type. For instance, the C++ int type maps directly to the MPI type MPI_INT. When there is a direct mapping from the type T to an MPI type, is_mpi_builtin_datatype will derive from mpl::true_ and the MPI data type will be accessible via get_mpi_datatype.
            
-
            In general, users should not need to specialize this trait. However, if you have an additional C++ type that can map directly to only of MPI's built-in types, specialize either this trait or one of the traits corresponding to categories of MPI data types (is_mpi_integer_datatype, is_mpi_floating_point_datatype, is_mpi_logical_datatype, is_mpi_complex_datatype, or is_mpi_builtin_datatype). is_mpi_builtin_datatype derives mpl::true_ if any of the traits corresponding to MPI data type categories derived mpl::true_. 
            
+
            In general, users should not need to specialize this trait. However, if you have an additional C++ type that can map directly to only of MPI's built-in types, specialize either this trait or one of the traits corresponding to categories of MPI data types (is_mpi_integer_datatype, is_mpi_floating_point_datatype, is_mpi_logical_datatype, is_mpi_complex_datatype, or is_mpi_builtin_datatype). is_mpi_builtin_datatype derives mpl::true_ if any of the traits corresponding to MPI data type categories derived mpl::true_. 
            
 
            
 
            
 
@@ -54,7 +54,7 @@
 
            
 
            
 
            
-PrevUpHomeNext
+PrevUpHomeNext
 
            
 
 
diff --git a/doc/html/boost/mpi/is_mpi_byte_datatype.html b/doc/html/boost/mpi/is_mpi_byte_datatype.html
index b09cfe7500..6a8bf6f80f 100644
--- a/doc/html/boost/mpi/is_mpi_byte_datatype.html
+++ b/doc/html/boost/mpi/is_mpi_byte_datatype.html
@@ -6,7 +6,7 @@
 
 
 
-
+
 
 
 
@@ -21,7 +21,7 @@
 
 
            
 
            
-PrevUpHomeNext
+PrevUpHomeNext
 
            
 
            
 
            
@@ -30,13 +30,13 @@
 
            boost::mpi::is_mpi_byte_datatype — Type trait that determines if there exists a built-in byte MPI data type for a given C++ type. 
            
 
            
 
            Synopsis
            
-
            // In header: <boost/mpi/datatype.hpp>
+
            // In header: <boost/mpi/datatype.hpp>
 
 template<typename T> 
 struct is_mpi_byte_datatype : public false_ {
 };
            
 
            
-
            Description
            
+
            Description
            
 
            This type trait determines when there is a direct mapping from a C++ type to an MPI data type that is classified as an byte data type. See is_mpi_builtin_datatype for general information about built-in MPI data types. 
            
 
            
 
            
@@ -52,7 +52,7 @@
 
 
            
 
            
-PrevUpHomeNext
+PrevUpHomeNext
 
            
 
 
diff --git a/doc/html/boost/mpi/is_mpi_complex_datatype.html b/doc/html/boost/mpi/is_mpi_complex_datatype.html
index 5134327c48..b415119231 100644
--- a/doc/html/boost/mpi/is_mpi_complex_datatype.html
+++ b/doc/html/boost/mpi/is_mpi_complex_datatype.html
@@ -6,7 +6,7 @@
 
 
 
-
+
 
 
 
@@ -21,7 +21,7 @@
 
 
            
 
            
-PrevUpHomeNext
+PrevUpHomeNext
 
            
 
            
 
            
@@ -30,13 +30,13 @@
 
            boost::mpi::is_mpi_complex_datatype — Type trait that determines if there exists a built-in complex MPI data type for a given C++ type. 
            
 
            
 
            Synopsis
            
-
            // In header: <boost/mpi/datatype.hpp>
+
            // In header: <boost/mpi/datatype.hpp>
 
 template<typename T> 
 struct is_mpi_complex_datatype : public false_ {
 };
            
 
            
-
            Description
            
+
            Description
            
 
            This type trait determines when there is a direct mapping from a C++ type to an MPI data type that is classified as an complex data type. See is_mpi_builtin_datatype for general information about built-in MPI data types. 
            
 
            
 
            
@@ -52,7 +52,7 @@
 
 
            
 
            
-PrevUpHomeNext
+PrevUpHomeNext
 
            
 
 
diff --git a/doc/html/boost/mpi/is_mpi_datatype.html b/doc/html/boost/mpi/is_mpi_datatype.html
index 520a8ba288..16d9badb0b 100644
--- a/doc/html/boost/mpi/is_mpi_datatype.html
+++ b/doc/html/boost/mpi/is_mpi_datatype.html
@@ -6,9 +6,9 @@
 
 
 
-
+
 
-
+
 
 
 
@@ -21,7 +21,7 @@
 
            
 
            
 
            
-PrevUpHomeNext
+PrevUpHomeNext
 
            
 
            
 
            
@@ -30,13 +30,13 @@
 
            boost::mpi::is_mpi_datatype — Type trait that determines if a C++ type can be mapped to an MPI data type. 
            
 
            
 
            Synopsis
            
-
            // In header: <boost/mpi/datatype.hpp>
+
            // In header: <boost/mpi/datatype.hpp>
 
 template<typename T> 
 struct is_mpi_datatype : public boost::mpi::is_mpi_builtin_datatype< T > {
 };
            
 
            
-
            Description
            
+
            Description
            
 
            This type trait determines if it is possible to build an MPI data type that represents a C++ data type. When this is the case, is_mpi_datatype derives mpl::true_ and the MPI data type will be accessible via get_mpi_datatype.
            
 
            For any C++ type that maps to a built-in MPI data type (see is_mpi_builtin_datatype), is_mpi_data_type is trivially true. However, any POD ("Plain Old Data") type containing types that themselves can be represented by MPI data types can itself be represented as an MPI data type. For instance, a point3d class containing three double values can be represented as an MPI data type. To do so, first make the data type Serializable (using the Boost.Serialization library); then, specialize the is_mpi_datatype trait for the point type so that it will derive mpl::true_: 
            
 
            namespace boost { namespace mpi {
@@ -59,7 +59,7 @@
 
 
            
 
            
-PrevUpHomeNext
+PrevUpHomeNext
 
            
 
 
diff --git a/doc/html/boost/mpi/is_mpi_fl_1_3_26_6_7_2_1_2.html b/doc/html/boost/mpi/is_mpi_fl_1_3_26_6_7_2_1_2.html
deleted file mode 100644
index 7afcee13a0..0000000000
--- a/doc/html/boost/mpi/is_mpi_fl_1_3_26_6_7_2_1_2.html
+++ /dev/null
@@ -1,58 +0,0 @@
-
-
-
-
-Struct template is_mpi_floating_point_datatype
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
            Boost C++ LibrariesHomeLibrariesPeopleFAQMore
            
-
            
-
            
-PrevUpHomeNext
-
            
-
            
-
            
-
            
-
            Struct template is_mpi_floating_point_datatype
            
-
            boost::mpi::is_mpi_floating_point_datatype — Type trait that determines if there exists a built-in floating point MPI data type for a given C++ type. 
            
-
            
-
            Synopsis
            
-
            // In header: <boost/mpi/datatype.hpp>
-
-template<typename T> 
-struct is_mpi_floating_point_datatype : public false_ {
-};
            
-
            
-
            Description
            
-
            This type trait determines when there is a direct mapping from a C++ type to an MPI data type that is classified as a floating point data type. See is_mpi_builtin_datatype for general information about built-in MPI data types. 
            
-
            
-
            
-
-
-
-
            Copyright © 2005-2007 Douglas Gregor,
-      Matthias Troyer, Trustees of Indiana University
            
-        Distributed under the Boost Software License, Version 1.0. (See accompanying
-        file LICENSE_1_0.txt or copy at 
-        http://www.boost.org/LICENSE_1_0.txt )
-      
            
-
            
-
            
-
            
-PrevUpHomeNext
-
            
-
-
diff --git a/doc/html/boost/mpi/is_mpi_integer_datatype.html b/doc/html/boost/mpi/is_mpi_integer_datatype.html
index 3929c160ce..13d0aa2259 100644
--- a/doc/html/boost/mpi/is_mpi_integer_datatype.html
+++ b/doc/html/boost/mpi/is_mpi_integer_datatype.html
@@ -6,9 +6,9 @@
 
 
 
-
+
 
-
+
 
 
 
@@ -21,7 +21,7 @@
 
            
 
            
 
            
-PrevUpHomeNext
+PrevUpHomeNext
 
            
 
            
 
            
@@ -30,13 +30,13 @@
 
            boost::mpi::is_mpi_integer_datatype — Type trait that determines if there exists a built-in integer MPI data type for a given C++ type. 
            
 
            
 
            Synopsis
            
-
            // In header: <boost/mpi/datatype.hpp>
+
            // In header: <boost/mpi/datatype.hpp>
 
 template<typename T> 
 struct is_mpi_integer_datatype : public false_ {
 };
            
 
            
-
            Description
            
+
            Description
            
 
            This type trait determines when there is a direct mapping from a C++ type to an MPI data type that is classified as an integer data type. See is_mpi_builtin_datatype for general information about built-in MPI data types. 
            
 
            
 
            
@@ -52,7 +52,7 @@
 
 
            
 
            
-PrevUpHomeNext
+PrevUpHomeNext
 
            
 
 
diff --git a/doc/html/boost/mpi/is_mpi_logical_datatype.html b/doc/html/boost/mpi/is_mpi_logical_datatype.html
index 89fc6f0b35..449cda012c 100644
--- a/doc/html/boost/mpi/is_mpi_logical_datatype.html
+++ b/doc/html/boost/mpi/is_mpi_logical_datatype.html
@@ -6,8 +6,8 @@
 
 
 
-
-
+
+
 
 
 
@@ -21,7 +21,7 @@
 
 
            
 
            
-PrevUpHomeNext
+PrevUpHomeNext
 
            
 
            
 
            
@@ -30,13 +30,13 @@
 
            boost::mpi::is_mpi_logical_datatype — Type trait that determines if there exists a built-in logical MPI data type for a given C++ type. 
            
 
            
 
            Synopsis
            
-
            // In header: <boost/mpi/datatype.hpp>
+
            // In header: <boost/mpi/datatype.hpp>
 
 template<typename T> 
 struct is_mpi_logical_datatype : public false_ {
 };
            
 
            
-
            Description
            
+
            Description
            
 
            This type trait determines when there is a direct mapping from a C++ type to an MPI data type that is classified as an logical data type. See is_mpi_builtin_datatype for general information about built-in MPI data types. 
            
 
            
 
            
@@ -52,7 +52,7 @@
 
 
            
 
            
-PrevUpHomeNext
+PrevUpHomeNext
 
            
 
 
diff --git a/doc/html/boost/mpi/is_mpi_op.html b/doc/html/boost/mpi/is_mpi_op.html
index 80912187bc..99773671f6 100644
--- a/doc/html/boost/mpi/is_mpi_op.html
+++ b/doc/html/boost/mpi/is_mpi_op.html
@@ -6,7 +6,7 @@
 
 
 
-
+
 
 
 
@@ -21,7 +21,7 @@
 
 
            
 
            
-PrevUpHomeNext
+PrevUpHomeNext
 
            
 
            
 
            
@@ -30,13 +30,13 @@
 
            boost::mpi::is_mpi_op — Determine if a function object has an associated MPI_Op. 
            
 
            
 
            Synopsis
            
-
            // In header: <boost/mpi/operations.hpp>
+
            // In header: <boost/mpi/operations.hpp>
 
 template<typename Op, typename T> 
 struct is_mpi_op : public false_ {
 };
            
 
            
-
            Description
            
+
            Description
            
 
            This trait determines if a function object type Op, when used with argument type T, has an associated MPI_Op. If so, is_mpi_op<Op,T> will derive from mpl::false_ and will contain a static member function op that takes no arguments but returns the associated MPI_Op value. For instance, is_mpi_op<std::plus<int>,int>::op() returns MPI_SUM.
            
 
            Users may specialize is_mpi_op for any other class templates that map onto operations that have MPI_Op equivalences, such as bitwise OR, logical and, or maximum. However, users are encouraged to use the standard function objects in the functional and boost/mpi/operations.hpp headers whenever possible. For function objects that are class templates with a single template parameter, it may be easier to specialize is_builtin_mpi_op. 
            
 
            
@@ -53,7 +53,7 @@
 
 
            
 
            
-PrevUpHomeNext
+PrevUpHomeNext
 
            
 
 
diff --git a/doc/html/boost/mpi/logical_xor.html b/doc/html/boost/mpi/logical_xor.html
index e7829b786c..4eb88b2a05 100644
--- a/doc/html/boost/mpi/logical_xor.html
+++ b/doc/html/boost/mpi/logical_xor.html
@@ -6,7 +6,7 @@
 
 
 
-
+
 
 
 
@@ -21,7 +21,7 @@
 
 
            
 
            
-PrevUpHomeNext
+PrevUpHomeNext
 
            
 
            
 
            
@@ -30,22 +30,26 @@
 
            boost::mpi::logical_xor — Compute the logical exclusive OR of two integral values. 
            
 
            
 
            Synopsis
            
-
            // In header: <boost/mpi/operations.hpp>
+
            // In header: <boost/mpi/operations.hpp>
 
 template<typename T> 
-struct logical_xor : public std::binary_function< T, T, T > {
+struct logical_xor {
+  // types
+  typedef T first_argument_type; 
+  typedef T second_argument_type;
+  typedef T result_type;         
 
-  // public member functions
-  T operator()(const T &, const T &) const;
+  // public member functions
+  T operator()(const T &, const T &) const;
 };
            
 
            
-
            Description
            
+
            Description
            
 
            This binary function object computes the logical exclusive of the two values it is given. When used with MPI and a type T that has an associated, built-in MPI data type, translates to MPI_LXOR. 
            
 
            
-
            
-logical_xor public member functions
            
+
            
+logical_xor public member functions
            
 
            1. 
-
              T operator()(const T & x, const T & y) const;
              
+
              T operator()(const T & x, const T & y) const;
              
 
              
 
              
 
              
@@ -74,7 +78,7 @@
 
              
 
              
 
              
-PrevUpHomeNext
+PrevUpHomeNext
 
              
 
 
diff --git a/doc/html/boost/mpi/maximum.html b/doc/html/boost/mpi/maximum.html
index 2f68f0ae93..eb4a7a0602 100644
--- a/doc/html/boost/mpi/maximum.html
+++ b/doc/html/boost/mpi/maximum.html
@@ -6,7 +6,7 @@
 
 
 
-
+
 
 
 
@@ -21,7 +21,7 @@
 
 
              
 
              
-PrevUpHomeNext
+PrevUpHomeNext
 
              
 
              
 
              
@@ -30,22 +30,26 @@
 
              boost::mpi::maximum — Compute the maximum of two values. 
              
 
              
 
              Synopsis
              
-
              // In header: <boost/mpi/operations.hpp>
+
              // In header: <boost/mpi/operations.hpp>
 
 template<typename T> 
-struct maximum : public std::binary_function< T, T, T > {
+struct maximum {
+  // types
+  typedef T first_argument_type; 
+  typedef T second_argument_type;
+  typedef T result_type;         
 
-  // public member functions
-  const T & operator()(const T &, const T &) const;
+  // public member functions
+  const T & operator()(const T &, const T &) const;
 };
              
 
              
-
              Description
              
+
              Description
              
 
              This binary function object computes the maximum of the two values it is given. When used with MPI and a type T that has an associated, built-in MPI data type, translates to MPI_MAX. 
              
 
              
-
              
-maximum public member functions
              
+
              
+maximum public member functions
              
 
              1. 
-
                const T & operator()(const T & x, const T & y) const;
                
+
                const T & operator()(const T & x, const T & y) const;
                
 
                
 
                
 
                
@@ -74,7 +78,7 @@
 
                
 
                
 
                
-PrevUpHomeNext
+PrevUpHomeNext
 
                
 
 
diff --git a/doc/html/boost/mpi/minimum.html b/doc/html/boost/mpi/minimum.html
index 46b93d9ee9..164041cfe4 100644
--- a/doc/html/boost/mpi/minimum.html
+++ b/doc/html/boost/mpi/minimum.html
@@ -6,7 +6,7 @@
 
 
 
-
+
 
 
 
@@ -21,7 +21,7 @@
 
 
                
 
                
-PrevUpHomeNext
+PrevUpHomeNext
 
                
 
                
 
                
@@ -30,22 +30,26 @@
 
                boost::mpi::minimum — Compute the minimum of two values. 
                
 
                
 
                Synopsis
                
-
                // In header: <boost/mpi/operations.hpp>
+
                // In header: <boost/mpi/operations.hpp>
 
 template<typename T> 
-struct minimum : public std::binary_function< T, T, T > {
+struct minimum {
+  // types
+  typedef T first_argument_type; 
+  typedef T second_argument_type;
+  typedef T result_type;         
 
-  // public member functions
-  const T & operator()(const T &, const T &) const;
+  // public member functions
+  const T & operator()(const T &, const T &) const;
 };
                
 
                
-
                Description
                
+
                Description
                
 
                This binary function object computes the minimum of the two values it is given. When used with MPI and a type T that has an associated, built-in MPI data type, translates to MPI_MIN. 
                
 
                
-
                
-minimum public member functions
                
+
                
+minimum public member functions
                
 
                1. 
-
                  const T & operator()(const T & x, const T & y) const;
                  
+
                  const T & operator()(const T & x, const T & y) const;
                  
 
                  
 
                  
 
                  
@@ -74,7 +78,7 @@
 
                  
 
                  
 
                  
-PrevUpHomeNext
+PrevUpHomeNext
 
                  
 
 
diff --git a/doc/html/boost/mpi/opera_1_3_26_5_14_13_2_1_2.html b/doc/html/boost/mpi/opera_1_3_26_5_14_13_2_1_2.html
new file mode 100644
index 0000000000..0acc6e0e86
--- /dev/null
+++ b/doc/html/boost/mpi/opera_1_3_26_5_14_13_2_1_2.html
@@ -0,0 +1,69 @@
+
+
+
+
+Function operator==
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
                  Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                  
+
                  
+
                  
+PrevUpHomeNext
+
                  
+
                  
+
                  
+
                  
+
                  Function operator==
                  
+
                  boost::mpi::operator== — Determines whether two process groups are identical. 
                  
+
                  
+
                  Synopsis
                  
+
                  // In header: <boost/mpi/group.hpp>
+
+
+BOOST_MPI_DECL bool operator==(const group & g1, const group & g2);
                  
+
                  
+
                  Description
                  
+
                  Equivalent to calling MPI_Group_compare and checking whether the result is MPI_IDENT.
                  
+
                  
+
                  
+
                  
++++
+
+
+
+
+
                  



                  Returns:
                  True when the two process groups contain the same processes in the same order. 
                  
+
                  
+
                  
+
+
+
+
                  Copyright © 2005-2007 Douglas Gregor,
+      Matthias Troyer, Trustees of Indiana University
                  
+        Distributed under the Boost Software License, Version 1.0. (See accompanying
+        file LICENSE_1_0.txt or copy at 
+        http://www.boost.org/LICENSE_1_0.txt )
+      
                  
+
                  
+
                  
+
                  
+PrevUpHomeNext
+
                  
+
+
diff --git a/doc/html/boost/mpi/opera_1_3_26_5_14_13_2_1_3.html b/doc/html/boost/mpi/opera_1_3_26_5_14_13_2_1_3.html
new file mode 100644
index 0000000000..fbe5961814
--- /dev/null
+++ b/doc/html/boost/mpi/opera_1_3_26_5_14_13_2_1_3.html
@@ -0,0 +1,69 @@
+
+
+
+
+Function operator!=
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
                  Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                  
+
                  
+
                  
+PrevUpHomeNext
+
                  
+
                  
+
                  
+
                  
+
                  Function operator!=
                  
+
                  boost::mpi::operator!= — Determines whether two process groups are not identical. 
                  
+
                  
+
                  Synopsis
                  
+
                  // In header: <boost/mpi/group.hpp>
+
+
+bool operator!=(const group & g1, const group & g2);
                  
+
                  
+
                  Description
                  
+
                  Equivalent to calling MPI_Group_compare and checking whether the result is not MPI_IDENT.
                  
+
                  
+
                  
+
                  
++++
+
+
+
+
+
                  



                  Returns:
                  False when the two process groups contain the same processes in the same order. 
                  
+
                  
+
                  
+
+
+
+
                  Copyright © 2005-2007 Douglas Gregor,
+      Matthias Troyer, Trustees of Indiana University
                  
+        Distributed under the Boost Software License, Version 1.0. (See accompanying
+        file LICENSE_1_0.txt or copy at 
+        http://www.boost.org/LICENSE_1_0.txt )
+      
                  
+
                  
+
                  
+
                  
+PrevUpHomeNext
+
                  
+
+
diff --git a/doc/html/boost/mpi/opera_1_3_26_5_14_13_2_1_4.html b/doc/html/boost/mpi/opera_1_3_26_5_14_13_2_1_4.html
new file mode 100644
index 0000000000..de9ad43685
--- /dev/null
+++ b/doc/html/boost/mpi/opera_1_3_26_5_14_13_2_1_4.html
@@ -0,0 +1,57 @@
+
+
+
+
+Function operator|
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
                  Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                  
+
                  
+
                  
+PrevUpHomeNext
+
                  
+
                  
+
                  
+
                  
+
                  Function operator|
                  
+
                  boost::mpi::operator| — Computes the union of two process groups. 
                  
+
                  
+
                  Synopsis
                  
+
                  // In header: <boost/mpi/group.hpp>
+
+
+BOOST_MPI_DECL group operator|(const group & g1, const group & g2);
                  
+
                  
+
                  Description
                  
+
                  This routine returns a new group that contains all processes that are either in group g1 or in group g2 (or both). The processes that are in g1 will be first in the resulting group, followed by the processes from g2 (but not also in g1). Equivalent to MPI_Group_union. 
                  
+
                  
+
                  
+
+
+
+
                  Copyright © 2005-2007 Douglas Gregor,
+      Matthias Troyer, Trustees of Indiana University
                  
+        Distributed under the Boost Software License, Version 1.0. (See accompanying
+        file LICENSE_1_0.txt or copy at 
+        http://www.boost.org/LICENSE_1_0.txt )
+      
                  
+
                  
+
                  
+
                  
+PrevUpHomeNext
+
                  
+
+
diff --git a/doc/html/boost/mpi/operat_1_3_26_5_14_2_2_1_3.html b/doc/html/boost/mpi/operat_1_3_26_5_14_2_2_1_3.html
new file mode 100644
index 0000000000..8734dd1be9
--- /dev/null
+++ b/doc/html/boost/mpi/operat_1_3_26_5_14_2_2_1_3.html
@@ -0,0 +1,70 @@
+
+
+
+
+Function template operator==
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
                  Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                  
+
                  
+
                  
+PrevUpHomeNext
+
                  
+
                  
+
                  
+
                  
+
                  Function template operator==
                  
+
                  boost::mpi::operator== — Compare two allocators for equality. 
                  
+
                  
+
                  Synopsis
                  
+
                  // In header: <boost/mpi/allocator.hpp>
+
+
+template<typename T1, typename T2> 
+  bool operator==(const allocator< T1 > &, const allocator< T2 > &);
                  
+
                  
+
                  Description
                  
+
                  Since MPI allocators have no state, all MPI allocators are equal.
                  
+
                  
+
                  
+
                  
++++
+
+
+
+
+
                  



                  Returns:
                  true 
                  
+
                  
+
                  
+
+
+
+
                  Copyright © 2005-2007 Douglas Gregor,
+      Matthias Troyer, Trustees of Indiana University
                  
+        Distributed under the Boost Software License, Version 1.0. (See accompanying
+        file LICENSE_1_0.txt or copy at 
+        http://www.boost.org/LICENSE_1_0.txt )
+      
                  
+
                  
+
                  
+
                  
+PrevUpHomeNext
+
                  
+
+
diff --git a/doc/html/boost/mpi/operat_1_3_26_5_14_2_2_1_4.html b/doc/html/boost/mpi/operat_1_3_26_5_14_2_2_1_4.html
new file mode 100644
index 0000000000..88f3de1c1e
--- /dev/null
+++ b/doc/html/boost/mpi/operat_1_3_26_5_14_2_2_1_4.html
@@ -0,0 +1,70 @@
+
+
+
+
+Function template operator!=
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
                  Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                  
+
                  
+
                  
+PrevUpHomeNext
+
                  
+
                  
+
                  
+
                  
+
                  Function template operator!=
                  
+
                  boost::mpi::operator!= — Compare two allocators for inequality. 
                  
+
                  
+
                  Synopsis
                  
+
                  // In header: <boost/mpi/allocator.hpp>
+
+
+template<typename T1, typename T2> 
+  bool operator!=(const allocator< T1 > &, const allocator< T2 > &);
                  
+
                  
+
                  Description
                  
+
                  Since MPI allocators have no state, all MPI allocators are equal.
                  
+
                  
+
                  
+
                  
++++
+
+
+
+
+
                  



                  Returns:
                  false 
                  
+
                  
+
                  
+
+
+
+
                  Copyright © 2005-2007 Douglas Gregor,
+      Matthias Troyer, Trustees of Indiana University
                  
+        Distributed under the Boost Software License, Version 1.0. (See accompanying
+        file LICENSE_1_0.txt or copy at 
+        http://www.boost.org/LICENSE_1_0.txt )
+      
                  
+
                  
+
                  
+
                  
+PrevUpHomeNext
+
                  
+
+
diff --git a/doc/html/boost/mpi/operat_1_3_26_5_14_6_2_1_5.html b/doc/html/boost/mpi/operat_1_3_26_5_14_6_2_1_5.html
new file mode 100644
index 0000000000..7a71c59097
--- /dev/null
+++ b/doc/html/boost/mpi/operat_1_3_26_5_14_6_2_1_5.html
@@ -0,0 +1,70 @@
+
+
+
+
+Function operator==
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
                  Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                  
+
                  
+
                  
+PrevUpHomeNext
+
                  
+
                  
+
                  
+
                  
+
                  Function operator==
                  
+
                  boost::mpi::operator== — Determines whether two communicators are identical. 
                  
+
                  
+
                  Synopsis
                  
+
                  // In header: <boost/mpi/communicator.hpp>
+
+
+BOOST_MPI_DECL bool 
+operator==(const communicator & comm1, const communicator & comm2);
                  
+
                  
+
                  Description
                  
+
                  Equivalent to calling MPI_Comm_compare and checking whether the result is MPI_IDENT.
                  
+
                  
+
                  
+
                  
++++
+
+
+
+
+
                  



                  Returns:
                  True when the two communicators refer to the same underlying MPI communicator. 
                  
+
                  
+
                  
+
+
+
+
                  Copyright © 2005-2007 Douglas Gregor,
+      Matthias Troyer, Trustees of Indiana University
                  
+        Distributed under the Boost Software License, Version 1.0. (See accompanying
+        file LICENSE_1_0.txt or copy at 
+        http://www.boost.org/LICENSE_1_0.txt )
+      
                  
+
                  
+
                  
+
                  
+PrevUpHomeNext
+
                  
+
+
diff --git a/doc/html/boost/mpi/operat_1_3_26_5_14_6_2_1_6.html b/doc/html/boost/mpi/operat_1_3_26_5_14_6_2_1_6.html
new file mode 100644
index 0000000000..92c2294b98
--- /dev/null
+++ b/doc/html/boost/mpi/operat_1_3_26_5_14_6_2_1_6.html
@@ -0,0 +1,68 @@
+
+
+
+
+Function operator!=
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
                  Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                  
+
                  
+
                  
+PrevUpHomeNext
+
                  
+
                  
+
                  
+
                  
+
                  Function operator!=
                  
+
                  boost::mpi::operator!= — Determines whether two communicators are different. 
                  
+
                  
+
                  Synopsis
                  
+
                  // In header: <boost/mpi/communicator.hpp>
+
+
+bool operator!=(const communicator & comm1, const communicator & comm2);
                  
+
                  
+
                  Description
                  
+
                  
+
                  
+
                  
++++
+
+
+
+
+
                  



                  Returns:
                  !(comm1 == comm2) 
                  
+
                  
+
                  
+
+
+
+
                  Copyright © 2005-2007 Douglas Gregor,
+      Matthias Troyer, Trustees of Indiana University
                  
+        Distributed under the Boost Software License, Version 1.0. (See accompanying
+        file LICENSE_1_0.txt or copy at 
+        http://www.boost.org/LICENSE_1_0.txt )
+      
                  
+
                  
+
                  
+
                  
+PrevUpHomeNext
+
                  
+
+
diff --git a/doc/html/boost/mpi/operator-.html b/doc/html/boost/mpi/operator-.html
index b5ba694b7d..b74bc41b96 100644
--- a/doc/html/boost/mpi/operator-.html
+++ b/doc/html/boost/mpi/operator-.html
@@ -6,7 +6,7 @@
 
 
 
-
+
 
 
 
@@ -21,7 +21,7 @@
 
 
                  
 
                  
-PrevUpHomeNext
+PrevUpHomeNext
 
                  
 
                  
 
                  
@@ -30,12 +30,12 @@
 
                  boost::mpi::operator- — Computes the difference between two process groups. 
                  
 
                  
 
                  Synopsis
                  
-
                  // In header: <boost/mpi/group.hpp>
+
                  // In header: <boost/mpi/group.hpp>
 
 
 BOOST_MPI_DECL group operator-(const group & g1, const group & g2);
                  
 
                  
-
                  Description
                  
+
                  Description
                  
 
                  This routine returns a new group that contains all processes that are in group g1 but not in group g2, ordered in the same way as g1. Equivalent to MPI_Group_difference. 
                  
 
                  
 
                  
@@ -51,7 +51,7 @@
 
 
                  
 
                  
-PrevUpHomeNext
+PrevUpHomeNext
 
                  
 
 
diff --git a/doc/html/boost/mpi/operator_.html b/doc/html/boost/mpi/operator_.html
index f5039011ce..816785f972 100644
--- a/doc/html/boost/mpi/operator_.html
+++ b/doc/html/boost/mpi/operator_.html
@@ -6,8 +6,8 @@
 
 
 
-
-
+
+
 
 
 
@@ -21,7 +21,7 @@
 
 
                  
 
                  
-PrevUpHomeNext
+PrevUpHomeNext
 
                  
 
                  
 
                  
@@ -30,12 +30,12 @@
 
                  boost::mpi::operator& — Computes the intersection of two process groups. 
                  
 
                  
 
                  Synopsis
                  
-
                  // In header: <boost/mpi/group.hpp>
+
                  // In header: <boost/mpi/group.hpp>
 
 
 BOOST_MPI_DECL group operator&(const group & g1, const group & g2);
                  
 
                  
-
                  Description
                  
+
                  Description
                  
 
                  This routine returns a new group that contains all processes that are in group g1 and in group g2, ordered in the same way as g1. Equivalent to MPI_Group_intersection. 
                  
 
                  
 
                  
@@ -51,7 +51,7 @@
 
 
                  
 
                  
-PrevUpHomeNext
+PrevUpHomeNext
 
                  
 
 
diff --git a/doc/html/boost/mpi/operator_1_3_26_6_12_2_1_2.html b/doc/html/boost/mpi/operator_1_3_26_6_12_2_1_2.html
deleted file mode 100644
index b5e67faa37..0000000000
--- a/doc/html/boost/mpi/operator_1_3_26_6_12_2_1_2.html
+++ /dev/null
@@ -1,69 +0,0 @@
-
-
-
-
-Function operator==
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
                  Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                  
-
                  
-
                  
-PrevUpHomeNext
-
                  
-
                  
-
                  
-
                  
-
                  Function operator==
                  
-
                  boost::mpi::operator== — Determines whether two process groups are identical. 
                  
-
                  
-
                  Synopsis
                  
-
                  // In header: <boost/mpi/group.hpp>
-
-
-BOOST_MPI_DECL bool operator==(const group & g1, const group & g2);
                  
-
                  
-
                  Description
                  
-
                  Equivalent to calling MPI_Group_compare and checking whether the result is MPI_IDENT.
                  
-
                  
-
                  
-
                  
----
-
-
-
-
-
                  



                  Returns:
                  True when the two process groups contain the same processes in the same order. 
                  
-
                  
-
                  
-
-
-
-
                  Copyright © 2005-2007 Douglas Gregor,
-      Matthias Troyer, Trustees of Indiana University
                  
-        Distributed under the Boost Software License, Version 1.0. (See accompanying
-        file LICENSE_1_0.txt or copy at 
-        http://www.boost.org/LICENSE_1_0.txt )
-      
                  
-
                  
-
                  
-
                  
-PrevUpHomeNext
-
                  
-
-
diff --git a/doc/html/boost/mpi/operator_1_3_26_6_12_2_1_3.html b/doc/html/boost/mpi/operator_1_3_26_6_12_2_1_3.html
deleted file mode 100644
index 40b29036ce..0000000000
--- a/doc/html/boost/mpi/operator_1_3_26_6_12_2_1_3.html
+++ /dev/null
@@ -1,69 +0,0 @@
-
-
-
-
-Function operator!=
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
                  Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                  
-
                  
-
                  
-PrevUpHomeNext
-
                  
-
                  
-
                  
-
                  
-
                  Function operator!=
                  
-
                  boost::mpi::operator!= — Determines whether two process groups are not identical. 
                  
-
                  
-
                  Synopsis
                  
-
                  // In header: <boost/mpi/group.hpp>
-
-
-bool operator!=(const group & g1, const group & g2);
                  
-
                  
-
                  Description
                  
-
                  Equivalent to calling MPI_Group_compare and checking whether the result is not MPI_IDENT.
                  
-
                  
-
                  
-
                  
----
-
-
-
-
-
                  



                  Returns:
                  False when the two process groups contain the same processes in the same order. 
                  
-
                  
-
                  
-
-
-
-
                  Copyright © 2005-2007 Douglas Gregor,
-      Matthias Troyer, Trustees of Indiana University
                  
-        Distributed under the Boost Software License, Version 1.0. (See accompanying
-        file LICENSE_1_0.txt or copy at 
-        http://www.boost.org/LICENSE_1_0.txt )
-      
                  
-
                  
-
                  
-
                  
-PrevUpHomeNext
-
                  
-
-
diff --git a/doc/html/boost/mpi/operator_1_3_26_6_12_2_1_4.html b/doc/html/boost/mpi/operator_1_3_26_6_12_2_1_4.html
deleted file mode 100644
index 788fbee250..0000000000
--- a/doc/html/boost/mpi/operator_1_3_26_6_12_2_1_4.html
+++ /dev/null
@@ -1,57 +0,0 @@
-
-
-
-
-Function operator|
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
                  Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                  
-
                  
-
                  
-PrevUpHomeNext
-
                  
-
                  
-
                  
-
                  
-
                  Function operator|
                  
-
                  boost::mpi::operator| — Computes the union of two process groups. 
                  
-
                  
-
                  Synopsis
                  
-
                  // In header: <boost/mpi/group.hpp>
-
-
-BOOST_MPI_DECL group operator|(const group & g1, const group & g2);
                  
-
                  
-
                  Description
                  
-
                  This routine returns a new group that contains all processes that are either in group g1 or in group g2 (or both). The processes that are in g1 will be first in the resulting group, followed by the processes from g2 (but not also in g1). Equivalent to MPI_Group_union. 
                  
-
                  
-
                  
-
-
-
-
                  Copyright © 2005-2007 Douglas Gregor,
-      Matthias Troyer, Trustees of Indiana University
                  
-        Distributed under the Boost Software License, Version 1.0. (See accompanying
-        file LICENSE_1_0.txt or copy at 
-        http://www.boost.org/LICENSE_1_0.txt )
-      
                  
-
                  
-
                  
-
                  
-PrevUpHomeNext
-
                  
-
-
diff --git a/doc/html/boost/mpi/operator__1_3_26_6_2_2_1_3.html b/doc/html/boost/mpi/operator__1_3_26_6_2_2_1_3.html
deleted file mode 100644
index ebe79efa98..0000000000
--- a/doc/html/boost/mpi/operator__1_3_26_6_2_2_1_3.html
+++ /dev/null
@@ -1,70 +0,0 @@
-
-
-
-
-Function template operator==
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
                  Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                  
-
                  
-
                  
-PrevUpHomeNext
-
                  
-
                  
-
                  
-
                  
-
                  Function template operator==
                  
-
                  boost::mpi::operator== — Compare two allocators for equality. 
                  
-
                  
-
                  Synopsis
                  
-
                  // In header: <boost/mpi/allocator.hpp>
-
-
-template<typename T1, typename T2> 
-  bool operator==(const allocator< T1 > &, const allocator< T2 > &);
                  
-
                  
-
                  Description
                  
-
                  Since MPI allocators have no state, all MPI allocators are equal.
                  
-
                  
-
                  
-
                  
----
-
-
-
-
-
                  



                  Returns:
                  true 
                  
-
                  
-
                  
-
-
-
-
                  Copyright © 2005-2007 Douglas Gregor,
-      Matthias Troyer, Trustees of Indiana University
                  
-        Distributed under the Boost Software License, Version 1.0. (See accompanying
-        file LICENSE_1_0.txt or copy at 
-        http://www.boost.org/LICENSE_1_0.txt )
-      
                  
-
                  
-
                  
-
                  
-PrevUpHomeNext
-
                  
-
-
diff --git a/doc/html/boost/mpi/operator__1_3_26_6_2_2_1_4.html b/doc/html/boost/mpi/operator__1_3_26_6_2_2_1_4.html
deleted file mode 100644
index c048e53816..0000000000
--- a/doc/html/boost/mpi/operator__1_3_26_6_2_2_1_4.html
+++ /dev/null
@@ -1,70 +0,0 @@
-
-
-
-
-Function template operator!=
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
                  Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                  
-
                  
-
                  
-PrevUpHomeNext
-
                  
-
                  
-
                  
-
                  
-
                  Function template operator!=
                  
-
                  boost::mpi::operator!= — Compare two allocators for inequality. 
                  
-
                  
-
                  Synopsis
                  
-
                  // In header: <boost/mpi/allocator.hpp>
-
-
-template<typename T1, typename T2> 
-  bool operator!=(const allocator< T1 > &, const allocator< T2 > &);
                  
-
                  
-
                  Description
                  
-
                  Since MPI allocators have no state, all MPI allocators are equal.
                  
-
                  
-
                  
-
                  
----
-
-
-
-
-
                  



                  Returns:
                  false 
                  
-
                  
-
                  
-
-
-
-
                  Copyright © 2005-2007 Douglas Gregor,
-      Matthias Troyer, Trustees of Indiana University
                  
-        Distributed under the Boost Software License, Version 1.0. (See accompanying
-        file LICENSE_1_0.txt or copy at 
-        http://www.boost.org/LICENSE_1_0.txt )
-      
                  
-
                  
-
                  
-
                  
-PrevUpHomeNext
-
                  
-
-
diff --git a/doc/html/boost/mpi/operator__1_3_26_6_5_2_1_5.html b/doc/html/boost/mpi/operator__1_3_26_6_5_2_1_5.html
deleted file mode 100644
index 0dc49ddc26..0000000000
--- a/doc/html/boost/mpi/operator__1_3_26_6_5_2_1_5.html
+++ /dev/null
@@ -1,70 +0,0 @@
-
-
-
-
-Function operator==
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
                  Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                  
-
                  
-
                  
-PrevUpHomeNext
-
                  
-
                  
-
                  
-
                  
-
                  Function operator==
                  
-
                  boost::mpi::operator== — Determines whether two communicators are identical. 
                  
-
                  
-
                  Synopsis
                  
-
                  // In header: <boost/mpi/communicator.hpp>
-
-
-BOOST_MPI_DECL bool 
-operator==(const communicator & comm1, const communicator & comm2);
                  
-
                  
-
                  Description
                  
-
                  Equivalent to calling MPI_Comm_compare and checking whether the result is MPI_IDENT.
                  
-
                  
-
                  
-
                  
----
-
-
-
-
-
                  



                  Returns:
                  True when the two communicators refer to the same underlying MPI communicator. 
                  
-
                  
-
                  
-
-
-
-
                  Copyright © 2005-2007 Douglas Gregor,
-      Matthias Troyer, Trustees of Indiana University
                  
-        Distributed under the Boost Software License, Version 1.0. (See accompanying
-        file LICENSE_1_0.txt or copy at 
-        http://www.boost.org/LICENSE_1_0.txt )
-      
                  
-
                  
-
                  
-
                  
-PrevUpHomeNext
-
                  
-
-
diff --git a/doc/html/boost/mpi/operator__1_3_26_6_5_2_1_6.html b/doc/html/boost/mpi/operator__1_3_26_6_5_2_1_6.html
deleted file mode 100644
index a7c57e1f22..0000000000
--- a/doc/html/boost/mpi/operator__1_3_26_6_5_2_1_6.html
+++ /dev/null
@@ -1,68 +0,0 @@
-
-
-
-
-Function operator!=
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
                  Boost C++ LibrariesHomeLibrariesPeopleFAQMore
                  
-
                  
-
                  
-PrevUpHomeNext
-
                  
-
                  
-
                  
-
                  
-
                  Function operator!=
                  
-
                  boost::mpi::operator!= — Determines whether two communicators are different. 
                  
-
                  
-
                  Synopsis
                  
-
                  // In header: <boost/mpi/communicator.hpp>
-
-
-bool operator!=(const communicator & comm1, const communicator & comm2);
                  
-
                  
-
                  Description
                  
-
                  
-
                  
-
                  
----
-
-
-
-
-
                  



                  Returns:
                  !(comm1 == comm2) 
                  
-
                  
-
                  
-
-
-
-
                  Copyright © 2005-2007 Douglas Gregor,
-      Matthias Troyer, Trustees of Indiana University
                  
-        Distributed under the Boost Software License, Version 1.0. (See accompanying
-        file LICENSE_1_0.txt or copy at 
-        http://www.boost.org/LICENSE_1_0.txt )
-      
                  
-
                  
-
                  
-
                  
-PrevUpHomeNext
-
                  
-
-
diff --git a/doc/html/boost/mpi/packed.html b/doc/html/boost/mpi/packed.html
index fcfecb1f95..2e2e465da5 100644
--- a/doc/html/boost/mpi/packed.html
+++ b/doc/html/boost/mpi/packed.html
@@ -6,7 +6,7 @@
 
 
 
-
+
 
 
 
@@ -21,7 +21,7 @@
 
 
                  
 
                  
-PrevUpHomeNext
+PrevUpHomeNext
 
                  
 
                  
 
                  
@@ -30,7 +30,7 @@
 
                  boost::mpi::packed — a dummy data type giving MPI_PACKED as its MPI_Datatype 
                  
 
                  
 
                  Synopsis
                  
-
                  // In header: <boost/mpi/datatype_fwd.hpp>
+
                  // In header: <boost/mpi/datatype_fwd.hpp>
 
 
 struct packed {
@@ -48,7 +48,7 @@
 
 
                  
 
                  
-PrevUpHomeNext
+PrevUpHomeNext
 
                  
 
 
diff --git a/doc/html/boost/mpi/packed_iarchive.html b/doc/html/boost/mpi/packed_iarchive.html
index 687798a3a4..c8db0f7282 100644
--- a/doc/html/boost/mpi/packed_iarchive.html
+++ b/doc/html/boost/mpi/packed_iarchive.html
@@ -6,7 +6,7 @@
 
 
 
-
+
 
 
 
@@ -21,7 +21,7 @@
 
 
                  
 
                  
-PrevUpHomeNext
+PrevUpHomeNext
 
                  
 
                  
 
                  
@@ -30,38 +30,38 @@
 
                  boost::mpi::packed_iarchive — An archive that unpacks binary data from an MPI buffer. 
                  
 
                  
 
                  Synopsis
                  
-
                  // In header: <boost/mpi/packed_iarchive.hpp>
+
                  // In header: <boost/mpi/packed_iarchive.hpp>
 
 
 class packed_iarchive : public iprimitive {
 public:
   // construct/copy/destruct
-  packed_iarchive(MPI_Comm const &, buffer_type &, 
+  packed_iarchive(MPI_Comm const &, buffer_type &, 
                   unsigned int = boost::archive::no_header, int = 0);
-  packed_iarchive(MPI_Comm const &, std::size_t = 0, 
+  packed_iarchive(MPI_Comm const &, std::size_t = 0, 
                   unsigned int = boost::archive::no_header);
 
-  // public member functions
-  template<typename T> void load_override(T &, mpl::false_);
-  template<typename T> void load_override(T &, mpl::true_);
-  template<typename T> void load_override(T &);
-  void load_override(archive::class_id_optional_type &);
-  void load_override(archive::class_id_type &);
-  void load_override(archive::version_type &);
-  void load_override(archive::class_id_reference_type &);
-  void load_override(archive::class_name_type &);
+  // public member functions
+  template<typename T> void load_override(T &, mpl::false_);
+  template<typename T> void load_override(T &, mpl::true_);
+  template<typename T> void load_override(T &);
+  void load_override(archive::class_id_optional_type &);
+  void load_override(archive::class_id_type &);
+  void load_override(archive::version_type &);
+  void load_override(archive::class_id_reference_type &);
+  void load_override(archive::class_name_type &);
 };
                  
 
                  
-
                  Description
                  
+
                  Description
                  
 
                  The packed_oarchive class is an Archiver (as in the Boost.Serialization library) that unpacks binary data from a buffer received via MPI. It can operate on any Serializable data type and will use the MPI_Unpack function of the underlying MPI implementation to perform deserialization. 
                  
 
                  
-
                  
+
                  
 packed_iarchive 
         public
        construct/copy/destruct
                  
 
                    
 
                  1. 
-
                    packed_iarchive(MPI_Comm const & comm, buffer_type & b, 
+
                    packed_iarchive(MPI_Comm const & comm, buffer_type & b, 
                 unsigned int flags = boost::archive::no_header, 
                 int position = 0);
                    
 
                    Construct a packed_iarchive to receive data over the given MPI communicator and with an initial buffer.
                    
@@ -98,7 +98,7 @@
 
                  
 
                  2. 
 
                2. 
-
                  packed_iarchive(MPI_Comm const & comm, std::size_t s = 0, 
+
                  packed_iarchive(MPI_Comm const & comm, std::size_t s = 0, 
                 unsigned int flags = boost::archive::no_header);
                  
 
                  Construct a packed_iarchive to receive data over the given MPI communicator.
                  
 
                  
@@ -132,17 +132,17 @@
 
                
 
                
 
                
-
                
-packed_iarchive public member functions
                
+
                
+packed_iarchive public member functions
                
 
                  
-
                1. template<typename T> void load_override(T & x, mpl::false_);
                  2. 
-
                2. template<typename T> void load_override(T & x, mpl::true_);
                  3. 
-
                3. template<typename T> void load_override(T & x);
                  4. 
-
                4. void load_override(archive::class_id_optional_type &);
                  5. 
-
                5. void load_override(archive::class_id_type & t);
                  6. 
-
                6. void load_override(archive::version_type & t);
                  7. 
-
                7. void load_override(archive::class_id_reference_type & t);
                  8. 
-
                8. void load_override(archive::class_name_type & t);
                  9. 
+
                9. template<typename T> void load_override(T & x, mpl::false_);
                  10. 
+
                10. template<typename T> void load_override(T & x, mpl::true_);
                  11. 
+
                11. template<typename T> void load_override(T & x);
                  12. 
+
                12. void load_override(archive::class_id_optional_type &);
                  13. 
+
                13. void load_override(archive::class_id_type & t);
                  14. 
+
                14. void load_override(archive::version_type & t);
                  15. 
+
                15. void load_override(archive::class_id_reference_type & t);
                  16. 
+
                16. void load_override(archive::class_name_type & t);
                  17. 
 
                
 
                
 
                
@@ -159,7 +159,7 @@
 
 
                
 
                
-PrevUpHomeNext
+PrevUpHomeNext
 
                
 
 
diff --git a/doc/html/boost/mpi/packed_oarchive.html b/doc/html/boost/mpi/packed_oarchive.html
index 157eb626b0..1ce3466631 100644
--- a/doc/html/boost/mpi/packed_oarchive.html
+++ b/doc/html/boost/mpi/packed_oarchive.html
@@ -6,7 +6,7 @@
 
 
 
-
+
 
 
 
@@ -21,7 +21,7 @@
 
 
                
 
                
-PrevUpHomeNext
+PrevUpHomeNext
 
                
 
                
 
                
@@ -30,36 +30,36 @@
 
                boost::mpi::packed_oarchive — An archive that packs binary data into an MPI buffer. 
                
 
                
 
                Synopsis
                
-
                // In header: <boost/mpi/packed_oarchive.hpp>
+
                // In header: <boost/mpi/packed_oarchive.hpp>
 
 
 class packed_oarchive : public oprimitive {
 public:
   // construct/copy/destruct
-  packed_oarchive(MPI_Comm const &, buffer_type &, 
+  packed_oarchive(MPI_Comm const &, buffer_type &, 
                   unsigned int = boost::archive::no_header);
-  packed_oarchive(MPI_Comm const &, unsigned int = boost::archive::no_header);
+  packed_oarchive(MPI_Comm const &, unsigned int = boost::archive::no_header);
 
-  // public member functions
-  template<typename T> void save_override(T const &, mpl::false_);
-  template<typename T> void save_override(T const &, mpl::true_);
-  template<typename T> void save_override(T const &);
-  void save_override(const archive::class_id_optional_type &);
-  void save_override(const archive::class_name_type &);
-  void save_override(const archive::class_id_type &);
-  void save_override(const archive::version_type &);
+  // public member functions
+  template<typename T> void save_override(T const &, mpl::false_);
+  template<typename T> void save_override(T const &, mpl::true_);
+  template<typename T> void save_override(T const &);
+  void save_override(const archive::class_id_optional_type &);
+  void save_override(const archive::class_name_type &);
+  void save_override(const archive::class_id_type &);
+  void save_override(const archive::version_type &);
 };
                
 
                
-
                Description
                
+
                Description
                
 
                The packed_iarchive class is an Archiver (as in the Boost.Serialization library) that packs binary data into a buffer for transmission via MPI. It can operate on any Serializable data type and will use the MPI_Pack function of the underlying MPI implementation to perform serialization. 
                
 
                
-
                
+
                
 packed_oarchive 
         public
        construct/copy/destruct
                
 
                  
 
                1. 
-
                  packed_oarchive(MPI_Comm const & comm, buffer_type & b, 
+
                  packed_oarchive(MPI_Comm const & comm, buffer_type & b, 
                 unsigned int flags = boost::archive::no_header);
                  
 
                  Construct a packed_oarchive for transmission over the given MPI communicator and with an initial buffer.
                  
 
                  
@@ -95,7 +95,7 @@
 
                
 
                2. 
 
              2. 
-
                packed_oarchive(MPI_Comm const & comm, 
+
                packed_oarchive(MPI_Comm const & comm, 
                 unsigned int flags = boost::archive::no_header);
                
 
                Construct a packed_oarchive for transmission over the given MPI communicator.
                
 
                
@@ -129,16 +129,16 @@
 
              
 
              
 
              
-
              
-packed_oarchive public member functions
              
+
              
+packed_oarchive public member functions
              
 
                
-
              1. template<typename T> void save_override(T const & x, mpl::false_);
                2. 
-
              2. template<typename T> void save_override(T const & x, mpl::true_);
                3. 
-
              3. template<typename T> void save_override(T const & x);
                4. 
-
              4. void save_override(const archive::class_id_optional_type &);
                5. 
-
              5. void save_override(const archive::class_name_type & t);
                6. 
-
              6. void save_override(const archive::class_id_type & t);
                7. 
-
              7. void save_override(const archive::version_type & t);
                8. 
+
              8. template<typename T> void save_override(T const & x, mpl::false_);
                9. 
+
              9. template<typename T> void save_override(T const & x, mpl::true_);
                10. 
+
              10. template<typename T> void save_override(T const & x);
                11. 
+
              11. void save_override(const archive::class_id_optional_type &);
                12. 
+
              12. void save_override(const archive::class_name_type & t);
                13. 
+
              13. void save_override(const archive::class_id_type & t);
                14. 
+
              14. void save_override(const archive::version_type & t);
                15. 
 
              
 
              
 
              
@@ -155,7 +155,7 @@
 
 
              
 
              
-PrevUpHomeNext
+PrevUpHomeNext
 
              
 
 
diff --git a/doc/html/boost/mpi/packed_skeleton_iarchive.html b/doc/html/boost/mpi/packed_skeleton_iarchive.html
index 02a11345a6..3202bcbfaf 100644
--- a/doc/html/boost/mpi/packed_skeleton_iarchive.html
+++ b/doc/html/boost/mpi/packed_skeleton_iarchive.html
@@ -6,7 +6,7 @@
 
 
 
-
+
 
 
 
@@ -21,7 +21,7 @@
 
 
              
 
              
-PrevUpHomeNext
+PrevUpHomeNext
 
              
 
              
 
              
@@ -30,32 +30,32 @@
 
              boost::mpi::packed_skeleton_iarchive — An archiver that reconstructs a data structure based on the binary skeleton stored in a buffer. 
              
 
              
 
              Synopsis
              
-
              // In header: <boost/mpi/skeleton_and_content.hpp>
+
              // In header: <boost/mpi/skeleton_and_content.hpp>
 
 
 class packed_skeleton_iarchive : public ignore_iprimitive {
 public:
   // construct/copy/destruct
-  packed_skeleton_iarchive(MPI_Comm const &, 
+  packed_skeleton_iarchive(MPI_Comm const &, 
                            unsigned int = boost::archive::no_header);
-  explicit packed_skeleton_iarchive(packed_iarchive &);
+  explicit packed_skeleton_iarchive(packed_iarchive &);
 
-  // public member functions
-  const packed_iarchive & get_skeleton() const;
-  packed_iarchive & get_skeleton();
+  // public member functions
+  const packed_iarchive & get_skeleton() const;
+  packed_iarchive & get_skeleton();
 };
              
 
              
-
              Description
              
+
              Description
              
 
              The packed_skeleton_iarchive class is an Archiver (as in the Boost.Serialization library) that can construct the the shape of a data structure based on a binary skeleton stored in a buffer. The packed_skeleton_iarchive is typically used by the receiver of a skeleton, to prepare a data structure that will eventually receive content separately.
              
 
              Users will not generally need to use packed_skeleton_iarchive directly. Instead, use skeleton or get_skeleton. 
              
 
              
-
              
+
              
 packed_skeleton_iarchive 
         public
        construct/copy/destruct
              
 
                
 
              1. 
-
                packed_skeleton_iarchive(MPI_Comm const & comm, 
+
                packed_skeleton_iarchive(MPI_Comm const & comm, 
                          unsigned int flags = boost::archive::no_header);
                
 
                Construct a packed_skeleton_iarchive for the given communicator.
                
 
                
@@ -87,7 +87,7 @@
 
              
 
              2. 
 
            2. 
-
              explicit packed_skeleton_iarchive(packed_iarchive & archive);
              
+
              explicit packed_skeleton_iarchive(packed_iarchive & archive);
              
 
              Construct a packed_skeleton_iarchive that unpacks a skeleton from the given archive.
              
 
              
 
              
@@ -114,15 +114,15 @@
 
            
 
            
 
            
-
            
-packed_skeleton_iarchive public member functions
            
+
            
+packed_skeleton_iarchive public member functions
            
 
              
 
            1. 
-
              const packed_iarchive & get_skeleton() const;
              
+
              const packed_iarchive & get_skeleton() const;
              
 
              Retrieve the archive corresponding to this skeleton. 
              
 
              2. 
 
            2. 
-
              packed_iarchive & get_skeleton();
              
+
              packed_iarchive & get_skeleton();
              
 
              Retrieve the archive corresponding to this skeleton. 
              
 
              3. 
 
            
@@ -141,7 +141,7 @@
 
 
            
 
            
-PrevUpHomeNext
+PrevUpHomeNext
 
            
 
 
diff --git a/doc/html/boost/mpi/packed_skeleton_oarchive.html b/doc/html/boost/mpi/packed_skeleton_oarchive.html
index 8c7af4f02d..205da15845 100644
--- a/doc/html/boost/mpi/packed_skeleton_oarchive.html
+++ b/doc/html/boost/mpi/packed_skeleton_oarchive.html
@@ -6,7 +6,7 @@
 
 
 
-
+
 
 
 
@@ -21,7 +21,7 @@
 
 
            
 
            
-PrevUpHomeNext
+PrevUpHomeNext
 
            
 
            
 
            
@@ -30,31 +30,31 @@
 
            boost::mpi::packed_skeleton_oarchive — An archiver that records the binary skeleton of a data structure into a buffer. 
            
 
            
 
            Synopsis
            
-
            // In header: <boost/mpi/skeleton_and_content.hpp>
+
            // In header: <boost/mpi/skeleton_and_content.hpp>
 
 
 class packed_skeleton_oarchive : public ignore_oprimitive {
 public:
   // construct/copy/destruct
-  packed_skeleton_oarchive(MPI_Comm const &, 
+  packed_skeleton_oarchive(MPI_Comm const &, 
                            unsigned int = boost::archive::no_header);
-  explicit packed_skeleton_oarchive(packed_oarchive &);
+  explicit packed_skeleton_oarchive(packed_oarchive &);
 
-  // public member functions
-  const packed_oarchive & get_skeleton() const;
+  // public member functions
+  const packed_oarchive & get_skeleton() const;
 };
            
 
            
-
            Description
            
+
            Description
            
 
            The packed_skeleton_oarchive class is an Archiver (as in the Boost.Serialization library) that can record the shape of a data structure (called the "skeleton") into a binary representation stored in a buffer. The packed_skeleton_oarchive is typically used by the send of a skeleton, to pack the skeleton of a data structure for transmission separately from the content.
            
 
            Users will not generally need to use packed_skeleton_oarchive directly. Instead, use skeleton or get_skeleton. 
            
 
            
-
            
+
            
 packed_skeleton_oarchive 
         public
        construct/copy/destruct
            
 
              
 
            1. 
-
              packed_skeleton_oarchive(MPI_Comm const & comm, 
+
              packed_skeleton_oarchive(MPI_Comm const & comm, 
                          unsigned int flags = boost::archive::no_header);
              
 
              Construct a packed_skeleton_oarchive for the given communicator.
              
 
              
@@ -86,7 +86,7 @@
 
            
 
            7. 
 
          7. 
-
            explicit packed_skeleton_oarchive(packed_oarchive & archive);
            
+
            explicit packed_skeleton_oarchive(packed_oarchive & archive);
            
 
            Construct a packed_skeleton_oarchive that packs a skeleton into the given archive.
            
 
            
 
            
@@ -113,10 +113,10 @@
 
          
 
          
 
          
-
          
-packed_skeleton_oarchive public member functions
          
+
          
+packed_skeleton_oarchive public member functions
          
 
          1. 
-
            const packed_oarchive & get_skeleton() const;
            
+
            const packed_oarchive & get_skeleton() const;
            
 
            Retrieve the archive corresponding to this skeleton. 
            
 
          
 
          
@@ -134,7 +134,7 @@
 
 
          
 
          
-PrevUpHomeNext
+PrevUpHomeNext
 
          
 
 
diff --git a/doc/html/boost/mpi/python/reg_1_3_26_5_14_20_2_1_1_2.html b/doc/html/boost/mpi/python/reg_1_3_26_5_14_20_2_1_1_2.html
new file mode 100644
index 0000000000..5ecefb2017
--- /dev/null
+++ b/doc/html/boost/mpi/python/reg_1_3_26_5_14_20_2_1_1_2.html
@@ -0,0 +1,86 @@
+
+
+
+
+Function template register_skeleton_and_content
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
          Boost C++ LibrariesHomeLibrariesPeopleFAQMore
          
+
          
+
          
+PrevUpHomeNext
+
          
+
          
+
          
+
          
+
          Function template register_skeleton_and_content
          
+
          boost::mpi::python::register_skeleton_and_content — Registers a type for use with the skeleton/content mechanism in Python. 
          
+
          
+
          Synopsis
          
+
          // In header: <boost/mpi/python.hpp>
+
+
+template<typename T> 
+  void register_skeleton_and_content(const T & value = T(), 
+                                     PyTypeObject * type = 0);
          
+
          
+
          Description
          
+
          The skeleton/content mechanism can only be used from Python with C++ types that have previously been registered via a call to this function. Both the sender and the transmitter must register the type. It is permitted to call this function multiple times for the same type T, but only one call per process per type is required. The type T must be Serializable.
          
+
          
+
          
+
          
++++
+
+
+
+
+
          



          Parameters:
          
++++
+
+
+
+
+
+
+
+
+
+
+
          



          type
          The Python type associated with the C++ type T. If not provided, it will be computed from the same value value. 
          value
          A sample object of type T that will be used to determine the Python type associated with T, if type is not specified.
          
+
          
+
          
+
+
+
+
          Copyright © 2005-2007 Douglas Gregor,
+      Matthias Troyer, Trustees of Indiana University
          
+        Distributed under the Boost Software License, Version 1.0. (See accompanying
+        file LICENSE_1_0.txt or copy at 
+        http://www.boost.org/LICENSE_1_0.txt )
+      
          
+
          
+
          
+
          
+PrevUpHomeNext
+
          
+
+
diff --git a/doc/html/boost/mpi/python/regist_1_3_26_6_19_2_1_1_2.html b/doc/html/boost/mpi/python/regist_1_3_26_6_19_2_1_1_2.html
deleted file mode 100644
index c7feb0f8ef..0000000000
--- a/doc/html/boost/mpi/python/regist_1_3_26_6_19_2_1_1_2.html
+++ /dev/null
@@ -1,86 +0,0 @@
-
-
-
-
-Function template register_skeleton_and_content
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
          Boost C++ LibrariesHomeLibrariesPeopleFAQMore
          
-
          
-
          
-PrevUpHomeNext
-
          
-
          
-
          
-
          
-
          Function template register_skeleton_and_content
          
-
          boost::mpi::python::register_skeleton_and_content — Registers a type for use with the skeleton/content mechanism in Python. 
          
-
          
-
          Synopsis
          
-
          // In header: <boost/mpi/python.hpp>
-
-
-template<typename T> 
-  void register_skeleton_and_content(const T & value = T(), 
-                                     PyTypeObject * type = 0);
          
-
          
-
          Description
          
-
          The skeleton/content mechanism can only be used from Python with C++ types that have previously been registered via a call to this function. Both the sender and the transmitter must register the type. It is permitted to call this function multiple times for the same type T, but only one call per process per type is required. The type T must be Serializable.
          
-
          
-
          
-
          
----
-
-
-
-
-
          



          Parameters:
          
----
-
-
-
-
-
-
-
-
-
-
-
          



          type
          The Python type associated with the C++ type T. If not provided, it will be computed from the same value value. 
          value
          A sample object of type T that will be used to determine the Python type associated with T, if type is not specified.
          
-
          
-
          
-
-
-
-
          Copyright © 2005-2007 Douglas Gregor,
-      Matthias Troyer, Trustees of Indiana University
          
-        Distributed under the Boost Software License, Version 1.0. (See accompanying
-        file LICENSE_1_0.txt or copy at 
-        http://www.boost.org/LICENSE_1_0.txt )
-      
          
-
          
-
          
-
          
-PrevUpHomeNext
-
          
-
-
diff --git a/doc/html/boost/mpi/python/register_serialized.html b/doc/html/boost/mpi/python/register_serialized.html
index c33e6c7256..c215817734 100644
--- a/doc/html/boost/mpi/python/register_serialized.html
+++ b/doc/html/boost/mpi/python/register_serialized.html
@@ -6,9 +6,9 @@
 
 
 
-
+
 
-
+
 
 
 
@@ -21,7 +21,7 @@
 
          
 
          
 
          
-PrevUpHomeNext
+PrevUpHomeNext
 
          
 
          
 
          
@@ -30,13 +30,13 @@
 
          boost::mpi::python::register_serialized — Register the type T for direct serialization within Boost.MPI. 
          
 
          
 
          Synopsis
          
-
          // In header: <boost/mpi/python.hpp>
+
          // In header: <boost/mpi/python.hpp>
 
 
 template<typename T> 
   void register_serialized(const T & value = T(), PyTypeObject * type = 0);
          
 
          
-
          Description
          
+
          Description
          
 
          The register_serialized function registers a C++ type for direct serialization within Boost.MPI. Direct serialization elides the use of the Python pickle package when serializing Python objects that represent C++ values. Direct serialization can be beneficial both to improve serialization performance (Python pickling can be very inefficient) and to permit serialization for Python-wrapped C++ objects that do not support pickling.
          
 
          
 
          
@@ -79,7 +79,7 @@
 
 
          
 
          
-PrevUpHomeNext
+PrevUpHomeNext
 
          
 
 
diff --git a/doc/html/boost/mpi/reduce.html b/doc/html/boost/mpi/reduce.html
index 309108b63c..4ab20256d6 100644
--- a/doc/html/boost/mpi/reduce.html
+++ b/doc/html/boost/mpi/reduce.html
@@ -6,7 +6,7 @@
 
 
 
-
+
 
 
 
@@ -21,7 +21,7 @@
 
 
          
 
          
-PrevUpHomeNext
+PrevUpHomeNext
 
          
 
          
 
          
@@ -30,7 +30,7 @@
 
          boost::mpi::reduce — Combine the values stored by each process into a single value at the root. 
          
 
          
 
          Synopsis
          
-
          // In header: <boost/mpi/collectives.hpp>
+
          // In header: <boost/mpi/collectives.hpp>
 
 
 template<typename T, typename Op> 
@@ -45,7 +45,7 @@
   void reduce(const communicator & comm, const T * in_values, int n, Op op, 
               int root);
          
 
          
-
          Description
          
+
          Description
          
 
          reduce is a collective algorithm that combines the values stored by each process into a single value at the root. The values can be combined arbitrarily, specified via a function object. The type T of the values may be any type that is serializable or has an associated MPI data type. One can think of this operation as a gather to the root, followed by an std::accumulate() over the gathered values and using the operation op.
          
 
          When the type T has an associated MPI data type, this routine invokes MPI_Reduce to perform the reduction. If possible, built-in MPI operations will be used; otherwise, reduce() will create a custom MPI_Op for the call to MPI_Reduce.
          
 
          
@@ -101,7 +101,7 @@
 
 
          
 
          
-PrevUpHomeNext
+PrevUpHomeNext
 
          
 
 
diff --git a/doc/html/boost/mpi/request.html b/doc/html/boost/mpi/request.html
index 2478bc1803..18ee22b4f6 100644
--- a/doc/html/boost/mpi/request.html
+++ b/doc/html/boost/mpi/request.html
@@ -6,8 +6,8 @@
 
 
 
-
-
+
+
 
 
 
@@ -21,7 +21,7 @@
 
 
          
 
          
-PrevUpHomeNext
+PrevUpHomeNext
 
          
 
          
 
          
@@ -30,46 +30,46 @@
 
          boost::mpi::request — A request for a non-blocking send or receive. 
          
 
          
 
          Synopsis
          
-
          // In header: <boost/mpi/request.hpp>
+
          // In header: <boost/mpi/request.hpp>
 
 
 class request {
 public:
   // construct/copy/destruct
-  request();
+  request();
 
-  // public member functions
-  status wait();
-  optional< status > test();
-  void cancel();
+  // public member functions
+  status wait();
+  optional< status > test();
+  void cancel();
 };
          
 
          
-
          Description
          
+
          Description
          
 
          This structure contains information about a non-blocking send or receive and will be returned from isend or irecv, respectively. 
          
 
          
-
          
+
          
 request 
         public
        construct/copy/destruct
          
 
          1. 
-
            request();
            
+
            request();
            
 
            Constructs a NULL request. 
            
 
          
 
          
 
          
-
          
-request public member functions
          
+
          
+request public member functions
          
 
            
 
          1. 
-
            status wait();
            
+
            status wait();
            
 
            Wait until the communication associated with this request has completed, then return a status object describing the communication. 
            
 
            2. 
 
          2. 
-
            optional< status > test();
            
+
            optional< status > test();
            
 
            Determine whether the communication associated with this request has completed successfully. If so, returns the status object describing the communication. Otherwise, returns an empty optional<> to indicate that the communication has not completed yet. Note that once test() returns a status object, the request has completed and wait() should not be called. 
            
 
            3. 
 
          3. 
-
            void cancel();
            
+
            void cancel();
            
 
            Cancel a pending communication, assuming it has not already been completed. 
            
 
            4. 
 
          
@@ -88,7 +88,7 @@
 
 
          
 
          
-PrevUpHomeNext
+PrevUpHomeNext
 
          
 
 
diff --git a/doc/html/boost/mpi/scan.html b/doc/html/boost/mpi/scan.html
index c2daec5086..f55afb544c 100644
--- a/doc/html/boost/mpi/scan.html
+++ b/doc/html/boost/mpi/scan.html
@@ -6,7 +6,7 @@
 
 
 
-
+
 
 
 
@@ -21,7 +21,7 @@
 
 
          
 
          
-PrevUpHomeNext
+PrevUpHomeNext
 
          
 
          
 
          
@@ -30,7 +30,7 @@
 
          boost::mpi::scan — Compute a prefix reduction of values from all processes in the communicator. 
          
 
          
 
          Synopsis
          
-
          // In header: <boost/mpi/collectives.hpp>
+
          // In header: <boost/mpi/collectives.hpp>
 
 
 template<typename T, typename Op> 
@@ -42,7 +42,7 @@
   void scan(const communicator & comm, const T * in_values, int n, 
             T * out_values, Op op);
          
 
          
-
          Description
          
+
          Description
          
 
          scan is a collective algorithm that combines the values stored by each process with the values of all processes with a smaller rank. The values can be arbitrarily combined, specified via a function object op. The type T of the values may be any type that is serializable or has an associated MPI data type. One can think of this operation as a gather to some process, followed by an std::prefix_sum() over the gathered values using the operation op. The ith process returns the ith value emitted by std::prefix_sum().
          
 
          When the type T has an associated MPI data type, this routine invokes MPI_Scan to perform the reduction. If possible, built-in MPI operations will be used; otherwise, scan() will create a custom MPI_Op for the call to MPI_Scan.
          
 
          
@@ -101,7 +101,7 @@
 
 
          
 
          
-PrevUpHomeNext
+PrevUpHomeNext
 
          
 
 
diff --git a/doc/html/boost/mpi/scatter.html b/doc/html/boost/mpi/scatter.html
index dddfd82a56..f7c4091241 100644
--- a/doc/html/boost/mpi/scatter.html
+++ b/doc/html/boost/mpi/scatter.html
@@ -6,7 +6,7 @@
 
 
 
-
+
 
 
 
@@ -21,7 +21,7 @@
 
 
          
 
          
-PrevUpHomeNext
+PrevUpHomeNext
 
          
 
          
 
          
@@ -30,7 +30,7 @@
 
          boost::mpi::scatter — Scatter the values stored at the root to all processes within the communicator. 
          
 
          
 
          Synopsis
          
-
          // In header: <boost/mpi/collectives.hpp>
+
          // In header: <boost/mpi/collectives.hpp>
 
 
 template<typename T> 
@@ -50,7 +50,7 @@
 template<typename T> 
   void scatter(const communicator & comm, T * out_values, int n, int root);
          
 
          
-
          Description
          
+
          Description
          
 
          scatter is a collective algorithm that scatters the values stored in the root process (inside a vector) to all of the processes in the communicator. The vector out_values (only significant at the root) is indexed by the process number to which the corresponding value will be sent. The type T of the values may be any type that is serializable or has an associated MPI data type.
          
 
          When the type T has an associated MPI data type, this routine invokes MPI_Scatter to scatter the values.
          
 
          
@@ -102,7 +102,7 @@
 
 
          
 
          
-PrevUpHomeNext
+PrevUpHomeNext
 
          
 
 
diff --git a/doc/html/boost/mpi/scatterv.html b/doc/html/boost/mpi/scatterv.html
index eacb5d952e..f076b02436 100644
--- a/doc/html/boost/mpi/scatterv.html
+++ b/doc/html/boost/mpi/scatterv.html
@@ -6,7 +6,7 @@
 
 
 
-
+
 
 
 
@@ -21,7 +21,7 @@
 
 
          
 
          
-PrevUpHomeNext
+PrevUpHomeNext
 
          
 
          
 
          
@@ -30,7 +30,7 @@
 
          boost::mpi::scatterv — Similar to boost::mpi::scatter with the difference that the number of values stored at the root process does not need to be a multiple of the communicator's size. 
          
 
          
 
          Synopsis
          
-
          // In header: <boost/mpi/collectives.hpp>
+
          // In header: <boost/mpi/collectives.hpp>
 
 
 template<typename T> 
@@ -53,7 +53,7 @@
   void scatterv(const communicator & comm, const std::vector< T > & in_values, 
                 const std::vector< int > & sizes, T * out_values, int root);
          
 
          
-
          Description
          
+
          Description
          
 
          
 
          
 
          
@@ -115,7 +115,7 @@
 
          
 
          
 
          
-PrevUpHomeNext
+PrevUpHomeNext
 
          
 
 
diff --git a/doc/html/boost/mpi/skeleton.html b/doc/html/boost/mpi/skeleton.html
index 1654f88117..f2e6f93e46 100644
--- a/doc/html/boost/mpi/skeleton.html
+++ b/doc/html/boost/mpi/skeleton.html
@@ -6,7 +6,7 @@
 
 
 
-
+
 
 
 
@@ -21,7 +21,7 @@
 
 
          
 
          
-PrevUpHomeNext
+PrevUpHomeNext
 
          
 
          
 
          
@@ -30,12 +30,12 @@
 
          boost::mpi::skeleton — Create a skeleton proxy object. 
          
 
          
 
          Synopsis
          
-
          // In header: <boost/mpi/skeleton_and_content.hpp>
+
          // In header: <boost/mpi/skeleton_and_content.hpp>
 
 
 template<typename T> const skeleton_proxy< T > skeleton(T & x);
          
 
          
-
          Description
          
+
          Description
          
 
          This routine creates an instance of the skeleton_proxy class. It will typically be used when calling send, recv, or broadcast, to indicate that only the skeleton (structure) of an object should be transmitted and not its contents.
          
 
          
 
@@ -79,7 +79,7 @@
 
 
          
 
          
-PrevUpHomeNext
+PrevUpHomeNext
 
          
 
 
diff --git a/doc/html/boost/mpi/skeleton_proxy.html b/doc/html/boost/mpi/skeleton_proxy.html
index fa06644ef3..1cd44c0bb7 100644
--- a/doc/html/boost/mpi/skeleton_proxy.html
+++ b/doc/html/boost/mpi/skeleton_proxy.html
@@ -6,7 +6,7 @@
 
 
 
-
+
 
 
 
@@ -21,7 +21,7 @@
 
 
          
 
          
-PrevUpHomeNext
+PrevUpHomeNext
 
          
 
          
 
          
@@ -30,26 +30,26 @@
 
          boost::mpi::skeleton_proxy — A proxy that requests that the skeleton of an object be transmitted. 
          
 
          
 
          Synopsis
          
-
          // In header: <boost/mpi/skeleton_and_content.hpp>
+
          // In header: <boost/mpi/skeleton_and_content.hpp>
 
 template<typename T> 
 struct skeleton_proxy {
   // construct/copy/destruct
-  skeleton_proxy(T &);
+  skeleton_proxy(T &);
 
   // public data members
   T & object;
 };
          
 
          
-
          Description
          
+
          Description
          
 
          The skeleton_proxy is a lightweight proxy object used to indicate that the skeleton of an object, not the object itself, should be transmitted. It can be used with the send and recv operations of communicators or the broadcast collective. When a skeleton_proxy is sent, Boost.MPI generates a description containing the structure of the stored object. When that skeleton is received, the receiving object is reshaped to match the structure. Once the skeleton of an object as been transmitted, its content can be transmitted separately (often several times) without changing the structure of the object. 
          
 
          
-
          
+
          
 skeleton_proxy 
         public
        construct/copy/destruct
          
 
          1. 
-
            skeleton_proxy(T & x);
            
+
            skeleton_proxy(T & x);
            
 
            Constructs a skeleton_proxy that references object x.
            
 
            
 
            
@@ -88,7 +88,7 @@
 
 
            
 
            
-PrevUpHomeNext
+PrevUpHomeNext
 
            
 
 
diff --git a/doc/html/boost/mpi/status.html b/doc/html/boost/mpi/status.html
index 69b1e607a3..c9496505f8 100644
--- a/doc/html/boost/mpi/status.html
+++ b/doc/html/boost/mpi/status.html
@@ -6,7 +6,7 @@
 
 
 
-
+
 
 
 
@@ -21,7 +21,7 @@
 
 
            
 
            
-PrevUpHomeNext
+PrevUpHomeNext
 
            
 
            
 
            
@@ -30,62 +30,62 @@
 
            boost::mpi::status — Contains information about a message that has been or can be received. 
            
 
            
 
            Synopsis
            
-
            // In header: <boost/mpi/status.hpp>
+
            // In header: <boost/mpi/status.hpp>
 
 
 class status {
 public:
   // construct/copy/destruct
-  status();
-  status(MPI_Status const &);
+  status();
+  status(MPI_Status const &);
 
-  // public member functions
-  int source() const;
-  int tag() const;
-  int error() const;
-  bool cancelled() const;
-  template<typename T> optional< int > count() const;
-  operator MPI_Status &();
-  operator const MPI_Status &() const;
+  // public member functions
+  int source() const;
+  int tag() const;
+  int error() const;
+  bool cancelled() const;
+  template<typename T> optional< int > count() const;
+  operator MPI_Status &();
+  operator const MPI_Status &() const;
 
   // public data members
   mutable int m_count;
 };
            
 
            
-
            Description
            
+
            Description
            
 
            This structure contains status information about messages that have been received (with communicator::recv) or can be received (returned from communicator::probe or communicator::iprobe). It permits access to the source of the message, message tag, error code (rarely used), or the number of elements that have been transmitted. 
            
 
            
-
            
+
            
 status 
         public
        construct/copy/destruct
            
 
              
-
            1. status();
              2. 
-
            2. status(MPI_Status const & s);
              3. 
+
            3. status();
              4. 
+
            4. status(MPI_Status const & s);
              5. 
 
            
 
            
 
            
-
            
-status public member functions
            
+
            
+status public member functions
            
 
              
 
            1. 
-
              int source() const;
              
+
              int source() const;
              
 
              Retrieve the source of the message. 
              
 
              2. 
 
            2. 
-
              int tag() const;
              
+
              int tag() const;
              
 
              Retrieve the message tag. 
              
 
              3. 
 
            3. 
-
              int error() const;
              
+
              int error() const;
              
 
              Retrieve the error code. 
              
 
              4. 
 
            4. 
-
              bool cancelled() const;
              
+
              bool cancelled() const;
              
 
              Determine whether the communication associated with this object has been successfully cancelled. 
              
 
              5. 
 
            5. 
-
              template<typename T> optional< int > count() const;
              
+
              template<typename T> optional< int > count() const;
              
 
              Determines the number of elements of type T contained in the message. The type T must have an associated data type, i.e., is_mpi_datatype<T> must derive mpl::true_. In cases where the type T does not match the transmitted type, this routine will return an empty optional<int>.
              
 
              
 
              
@@ -101,11 +101,11 @@
 
            
 
            2. 
 
          2. 
-
            operator MPI_Status &();
            
+
            operator MPI_Status &();
            
 
            References the underlying MPI_Status 
            
 
            3. 
 
          3. 
-
            operator const MPI_Status &() const;
            
+
            operator const MPI_Status &() const;
            
 
            References the underlying MPI_Status 
            
 
            4. 
 
          
@@ -124,7 +124,7 @@
 
 
          
 
          
-PrevUpHomeNext
+PrevUpHomeNext
 
          
 
 
diff --git a/doc/html/boost/mpi/test_all.html b/doc/html/boost/mpi/test_all.html
index 1600749ecf..1124eaecbc 100644
--- a/doc/html/boost/mpi/test_all.html
+++ b/doc/html/boost/mpi/test_all.html
@@ -6,7 +6,7 @@
 
 
 
-
+
 
 
 
@@ -21,7 +21,7 @@
 
 
          
 
          
-PrevUpHomeNext
+PrevUpHomeNext
 
          
 
          
 
          
@@ -30,7 +30,7 @@
 
          boost::mpi::test_all — Tests whether all non-blocking requests have completed. 
          
 
          
 
          Synopsis
          
-
          // In header: <boost/mpi/nonblocking.hpp>
+
          // In header: <boost/mpi/nonblocking.hpp>
 
 
 template<typename ForwardIterator, typename OutputIterator> 
@@ -39,7 +39,7 @@
 template<typename ForwardIterator> 
   bool test_all(ForwardIterator first, ForwardIterator last);
          
 
          
-
          Description
          
+
          Description
          
 
          This routine takes in a set of requests stored in the iterator range [first,last) and determines whether all of these requests have been completed. However, due to limitations of the underlying MPI implementation, if any of the requests refers to a non-blocking send or receive of a serialized data type, test_all will always return the equivalent of false (i.e., the requests cannot all be finished at this time). This routine performs the same functionality as wait_all, except that this routine will not block. This routine provides functionality equivalent to MPI_Testall.
          
 
          
 
@@ -93,7 +93,7 @@
 
 
          
 
          
-PrevUpHomeNext
+PrevUpHomeNext
 
          
 
 
diff --git a/doc/html/boost/mpi/test_any.html b/doc/html/boost/mpi/test_any.html
index 6c0974f7c4..1bb5c5c28c 100644
--- a/doc/html/boost/mpi/test_any.html
+++ b/doc/html/boost/mpi/test_any.html
@@ -6,7 +6,7 @@
 
 
 
-
+
 
 
 
@@ -21,7 +21,7 @@
 
 
          
 
          
-PrevUpHomeNext
+PrevUpHomeNext
 
          
 
          
 
          
@@ -30,14 +30,14 @@
 
          boost::mpi::test_any — Test whether any non-blocking request has completed. 
          
 
          
 
          Synopsis
          
-
          // In header: <boost/mpi/nonblocking.hpp>
+
          // In header: <boost/mpi/nonblocking.hpp>
 
 
 template<typename ForwardIterator> 
   optional< std::pair< status, ForwardIterator > > 
   test_any(ForwardIterator first, ForwardIterator last);
          
 
          
-
          Description
          
+
          Description
          
 
          This routine takes in a set of requests stored in the iterator range [first,last) and tests whether any of these requests has been completed. This routine is similar to wait_any, but will not block waiting for requests to completed. It provides functionality equivalent to MPI_Testany.
          
 
          
 
@@ -87,7 +87,7 @@
 
 
          
 
          
-PrevUpHomeNext
+PrevUpHomeNext
 
          
 
 
diff --git a/doc/html/boost/mpi/test_some.html b/doc/html/boost/mpi/test_some.html
index 3fe62318d7..d40bd0f5e6 100644
--- a/doc/html/boost/mpi/test_some.html
+++ b/doc/html/boost/mpi/test_some.html
@@ -6,7 +6,7 @@
 
 
 
-
+
 
 
 
@@ -21,7 +21,7 @@
 
 
          
 
          
-PrevUpHomeNext
+PrevUpHomeNext
 
          
 
          
 
          
@@ -30,7 +30,7 @@
 
          boost::mpi::test_some — Test whether some non-blocking requests have completed. 
          
 
          
 
          Synopsis
          
-
          // In header: <boost/mpi/nonblocking.hpp>
+
          // In header: <boost/mpi/nonblocking.hpp>
 
 
 template<typename BidirectionalIterator, typename OutputIterator> 
@@ -41,7 +41,7 @@
   BidirectionalIterator 
   test_some(BidirectionalIterator first, BidirectionalIterator last);
          
 
          
-
          Description
          
+
          Description
          
 
          This routine takes in a set of requests stored in the iterator range [first,last) and tests to see if any of the requests has completed. It completes all of the requests it can, partitioning the input sequence into pending requests followed by completed requests. If an output iterator is provided, status objects will be emitted for each of the completed requests. This routine is similar to wait_some, but does not wait until any requests have completed. This routine provides functionality equivalent to MPI_Testsome.
          
 
          
 
@@ -95,7 +95,7 @@
 
 
          
 
          
-PrevUpHomeNext
+PrevUpHomeNext
 
          
 
 
diff --git a/doc/html/boost/mpi/threading/level.html b/doc/html/boost/mpi/threading/level.html
index 3a75a0d0f5..a93f9aa0f6 100644
--- a/doc/html/boost/mpi/threading/level.html
+++ b/doc/html/boost/mpi/threading/level.html
@@ -6,9 +6,9 @@
 
 
 
-
+
 
-
+
 
 
 
@@ -21,7 +21,7 @@
 
          
 
          
 
          
-PrevUpHomeNext
+PrevUpHomeNext
 
          
 
          
 
          
@@ -30,14 +30,14 @@
 
          boost::mpi::threading::level — specify the supported threading level. 
          
 
          
 
          Synopsis
          
-
          // In header: <boost/mpi/environment.hpp>
+
          // In header: <boost/mpi/environment.hpp>
 
 
 enum level { single = = MPI_THREAD_SINGLE, funneled = = MPI_THREAD_FUNNELED, 
              serialized = = MPI_THREAD_SERIALIZED, 
              multiple = = MPI_THREAD_MULTIPLE };
          
 
          
-
          Description
          
+
          Description
          
 
          Based on MPI 2 standard/8.7.3 
          
 
          
 
          single
          
@@ -72,7 +72,7 @@
 
 
          
 
          
-PrevUpHomeNext
+PrevUpHomeNext
 
          
 
 
diff --git a/doc/html/boost/mpi/threading/ope_1_3_26_5_14_10_2_1_2_2.html b/doc/html/boost/mpi/threading/ope_1_3_26_5_14_10_2_1_2_2.html
new file mode 100644
index 0000000000..ae6d1f7b4f
--- /dev/null
+++ b/doc/html/boost/mpi/threading/ope_1_3_26_5_14_10_2_1_2_2.html
@@ -0,0 +1,57 @@
+
+
+
+
+Function operator<<
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
          Boost C++ LibrariesHomeLibrariesPeopleFAQMore
          
+
          
+
          
+PrevUpHomeNext
+
          
+
          
+
          
+
          
+
          Function operator<<
          
+
          boost::mpi::threading::operator<<
          
+
          
+
          Synopsis
          
+
          // In header: <boost/mpi/environment.hpp>
+
+
+std::ostream & operator<<(std::ostream & out, level l);
          
+
          
+
          Description
          
+
          Formated output for threading level. 
          
+
          
+
          
+
+
+
+
          Copyright © 2005-2007 Douglas Gregor,
+      Matthias Troyer, Trustees of Indiana University
          
+        Distributed under the Boost Software License, Version 1.0. (See accompanying
+        file LICENSE_1_0.txt or copy at 
+        http://www.boost.org/LICENSE_1_0.txt )
+      
          
+
          
+
          
+
          
+PrevUpHomeNext
+
          
+
+
diff --git a/doc/html/boost/mpi/threading/ope_1_3_26_5_14_10_2_1_2_3.html b/doc/html/boost/mpi/threading/ope_1_3_26_5_14_10_2_1_2_3.html
new file mode 100644
index 0000000000..18c75c3e92
--- /dev/null
+++ b/doc/html/boost/mpi/threading/ope_1_3_26_5_14_10_2_1_2_3.html
@@ -0,0 +1,57 @@
+
+
+
+
+Function operator>>
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
          Boost C++ LibrariesHomeLibrariesPeopleFAQMore
          
+
          
+
          
+PrevUpHomeNext
+
          
+
          
+
          
+
          
+
          Function operator>>
          
+
          boost::mpi::threading::operator>>
          
+
          
+
          Synopsis
          
+
          // In header: <boost/mpi/environment.hpp>
+
+
+std::istream & operator>>(std::istream & in, level & l);
          
+
          
+
          Description
          
+
          Formated input for threading level. 
          
+
          
+
          
+
+
+
+
          Copyright © 2005-2007 Douglas Gregor,
+      Matthias Troyer, Trustees of Indiana University
          
+        Distributed under the Boost Software License, Version 1.0. (See accompanying
+        file LICENSE_1_0.txt or copy at 
+        http://www.boost.org/LICENSE_1_0.txt )
+      
          
+
          
+
          
+
          
+PrevUpHomeNext
+
          
+
+
diff --git a/doc/html/boost/mpi/threading/operato_1_3_26_6_9_2_1_2_2.html b/doc/html/boost/mpi/threading/operato_1_3_26_6_9_2_1_2_2.html
deleted file mode 100644
index 852cd2c55f..0000000000
--- a/doc/html/boost/mpi/threading/operato_1_3_26_6_9_2_1_2_2.html
+++ /dev/null
@@ -1,57 +0,0 @@
-
-
-
-
-Function operator<<
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
          Boost C++ LibrariesHomeLibrariesPeopleFAQMore
          
-
          
-
          
-PrevUpHomeNext
-
          
-
          
-
          
-
          
-
          Function operator<<
          
-
          boost::mpi::threading::operator<<
          
-
          
-
          Synopsis
          
-
          // In header: <boost/mpi/environment.hpp>
-
-
-std::ostream & operator<<(std::ostream & out, level l);
          
-
          
-
          Description
          
-
          Formated output for threading level. 
          
-
          
-
          
-
-
-
-
          Copyright © 2005-2007 Douglas Gregor,
-      Matthias Troyer, Trustees of Indiana University
          
-        Distributed under the Boost Software License, Version 1.0. (See accompanying
-        file LICENSE_1_0.txt or copy at 
-        http://www.boost.org/LICENSE_1_0.txt )
-      
          
-
          
-
          
-
          
-PrevUpHomeNext
-
          
-
-
diff --git a/doc/html/boost/mpi/threading/operato_1_3_26_6_9_2_1_2_3.html b/doc/html/boost/mpi/threading/operato_1_3_26_6_9_2_1_2_3.html
deleted file mode 100644
index 44dce79a36..0000000000
--- a/doc/html/boost/mpi/threading/operato_1_3_26_6_9_2_1_2_3.html
+++ /dev/null
@@ -1,57 +0,0 @@
-
-
-
-
-Function operator>>
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
          Boost C++ LibrariesHomeLibrariesPeopleFAQMore
          
-
          
-
          
-PrevUpHomeNext
-
          
-
          
-
          
-
          
-
          Function operator>>
          
-
          boost::mpi::threading::operator>>
          
-
          
-
          Synopsis
          
-
          // In header: <boost/mpi/environment.hpp>
-
-
-std::istream & operator>>(std::istream & in, level & l);
          
-
          
-
          Description
          
-
          Formated input for threading level. 
          
-
          
-
          
-
-
-
-
          Copyright © 2005-2007 Douglas Gregor,
-      Matthias Troyer, Trustees of Indiana University
          
-        Distributed under the Boost Software License, Version 1.0. (See accompanying
-        file LICENSE_1_0.txt or copy at 
-        http://www.boost.org/LICENSE_1_0.txt )
-      
          
-
          
-
          
-
          
-PrevUpHomeNext
-
          
-
-
diff --git a/doc/html/boost/mpi/timer.html b/doc/html/boost/mpi/timer.html
index 045bc0f2ac..f8ba4dcefc 100644
--- a/doc/html/boost/mpi/timer.html
+++ b/doc/html/boost/mpi/timer.html
@@ -6,9 +6,9 @@
 
 
 
-
+
 
-
+
 
 
 
@@ -21,7 +21,7 @@
 
          
 
          
 
          
-PrevUpHomeNext
+PrevUpHomeNext
 
          
 
          
 
          
@@ -30,33 +30,33 @@
 
          boost::mpi::timer — A simple timer that provides access to the MPI timing facilities. 
          
 
          
 
          Synopsis
          
-
          // In header: <boost/mpi/timer.hpp>
+
          // In header: <boost/mpi/timer.hpp>
 
 
 class timer {
 public:
   // construct/copy/destruct
-  timer();
+  timer();
 
-  // public member functions
-  void restart();
-  double elapsed() const;
-  double elapsed_max() const;
-  double elapsed_min() const;
+  // public member functions
+  void restart();
+  double elapsed() const;
+  double elapsed_max() const;
+  double elapsed_min() const;
 
-  // public static functions
-  static bool time_is_global();
+  // public static functions
+  static bool time_is_global();
 };
          
 
          
-
          Description
          
+
          Description
          
 
          The timer class is a simple wrapper around the MPI timing facilities that mimics the interface of the Boost Timer library. 
          
 
          
-
          
+
          
 timer 
         public
        construct/copy/destruct
          
 
          1. 
-
            timer();
            
+
            timer();
            
 
            Initializes the timer
            
 
            
 
            
@@ -73,11 +73,11 @@
 
          
 
          
 
          
-
          
-timer public member functions
          
+
          
+timer public member functions
          
 
            
 
          1. 
-
            void restart();
            
+
            void restart();
            
 
            Restart the timer.
            
 
            
 
            
@@ -93,24 +93,24 @@
 
          
 
          9. 
 
        9. 
-
          double elapsed() const;
          
+
          double elapsed() const;
          
 
          Return the amount of time that has elapsed since the last construction or reset, in seconds. 
          
 
          10. 
 
        10. 
-
          double elapsed_max() const;
          
+
          double elapsed_max() const;
          
 
          Return an estimate of the maximum possible value of elapsed(). Note that this routine may return too high a value on some systems. 
          
 
          11. 
 
        11. 
-
          double elapsed_min() const;
          
+
          double elapsed_min() const;
          
 
          Returns the minimum non-zero value that elapsed() may return. This is the resolution of the timer. 
          
 
          12. 
 
        
 
        
 
        
-
        
-timer public static functions
        
+
        
+timer public static functions
        
 
        1. 
-
          static bool time_is_global();
          
+
          static bool time_is_global();
          
 
          Determines whether the elapsed time values are global times or local processor times. 
          
 
        
 
        
@@ -128,7 +128,7 @@
 
 
        
 
        
-PrevUpHomeNext
+PrevUpHomeNext
 
        
 
 
diff --git a/doc/html/boost/mpi/wait_all.html b/doc/html/boost/mpi/wait_all.html
index ce9daf3c93..f13ec29c78 100644
--- a/doc/html/boost/mpi/wait_all.html
+++ b/doc/html/boost/mpi/wait_all.html
@@ -6,7 +6,7 @@
 
 
 
-
+
 
 
 
@@ -21,7 +21,7 @@
 
 
        
 
        
-PrevUpHomeNext
+PrevUpHomeNext
 
        
 
        
 
        
@@ -30,7 +30,7 @@
 
        boost::mpi::wait_all — Wait until all non-blocking requests have completed. 
        
 
        
 
        Synopsis
        
-
        // In header: <boost/mpi/nonblocking.hpp>
+
        // In header: <boost/mpi/nonblocking.hpp>
 
 
 template<typename ForwardIterator, typename OutputIterator> 
@@ -39,7 +39,7 @@
 template<typename ForwardIterator> 
   void wait_all(ForwardIterator first, ForwardIterator last);
        
 
        
-
        Description
        
+
        Description
        
 
        This routine takes in a set of requests stored in the iterator range [first,last) and waits until all of these requests have been completed. It provides functionality equivalent to MPI_Waitall.
        
 
        
 
@@ -93,7 +93,7 @@
 
 
        
 
        
-PrevUpHomeNext
+PrevUpHomeNext
 
        
 
 
diff --git a/doc/html/boost/mpi/wait_any.html b/doc/html/boost/mpi/wait_any.html
index 641b4dd827..bfef4455b0 100644
--- a/doc/html/boost/mpi/wait_any.html
+++ b/doc/html/boost/mpi/wait_any.html
@@ -6,7 +6,7 @@
 
 
 
-
+
 
 
 
@@ -21,7 +21,7 @@
 
 
        
 
        
-PrevUpHomeNext
+PrevUpHomeNext
 
        
 
        
 
        
@@ -30,14 +30,14 @@
 
        boost::mpi::wait_any — Wait until any non-blocking request has completed. 
        
 
        
 
        Synopsis
        
-
        // In header: <boost/mpi/nonblocking.hpp>
+
        // In header: <boost/mpi/nonblocking.hpp>
 
 
 template<typename ForwardIterator> 
   std::pair< status, ForwardIterator > 
   wait_any(ForwardIterator first, ForwardIterator last);
        
 
        
-
        Description
        
+
        Description
        
 
        This routine takes in a set of requests stored in the iterator range [first,last) and waits until any of these requests has been completed. It provides functionality equivalent to MPI_Waitany.
        
 
        
 
@@ -87,7 +87,7 @@
 
 
        
 
        
-PrevUpHomeNext
+PrevUpHomeNext
 
        
 
 
diff --git a/doc/html/boost/mpi/wait_some.html b/doc/html/boost/mpi/wait_some.html
index bc368b5b87..948a01903e 100644
--- a/doc/html/boost/mpi/wait_some.html
+++ b/doc/html/boost/mpi/wait_some.html
@@ -6,7 +6,7 @@
 
 
 
-
+
 
 
 
@@ -21,7 +21,7 @@
 
 
        
 
        
-PrevUpHomeNext
+PrevUpHomeNext
 
        
 
        
 
        
@@ -30,7 +30,7 @@
 
        boost::mpi::wait_some — Wait until some non-blocking requests have completed. 
        
 
        
 
        Synopsis
        
-
        // In header: <boost/mpi/nonblocking.hpp>
+
        // In header: <boost/mpi/nonblocking.hpp>
 
 
 template<typename BidirectionalIterator, typename OutputIterator> 
@@ -41,7 +41,7 @@
   BidirectionalIterator 
   wait_some(BidirectionalIterator first, BidirectionalIterator last);
        
 
        
-
        Description
        
+
        Description
        
 
        This routine takes in a set of requests stored in the iterator range [first,last) and waits until at least one of the requests has completed. It then completes all of the requests it can, partitioning the input sequence into pending requests followed by completed requests. If an output iterator is provided, status objects will be emitted for each of the completed requests. This routine provides functionality equivalent to MPI_Waitsome.
        
 
        
 
@@ -95,7 +95,7 @@
 
 
        
 
        
-PrevUpHomeNext
+PrevUpHomeNext
 
        
 
 
diff --git a/doc/html/boost/operator___idp24460448.html b/doc/html/boost/operator___idp24460448.html
deleted file mode 100644
index 190d5948a6..0000000000
--- a/doc/html/boost/operator___idp24460448.html
+++ /dev/null
@@ -1,101 +0,0 @@
-
-
-
-
-Function template operator==
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
        
-
        
-
        
-PrevUpHomeNext
-
        
-
        
-
        
-
        
-
        Function template operator==
        
-
        boost::operator== — Compare two circular_buffers element-by-element to determine if they are equal. 
        
-
        
-
        Synopsis
        
-
        // In header: <boost/circular_buffer/base.hpp>
-
-
-template<typename T, typename Alloc> 
-  bool operator==(const circular_buffer< T, Alloc > & lhs, 
-                  const circular_buffer< T, Alloc > & rhs);
        
-
        
-
        Description
        
-
        
-
-
-
        
-
        Complexity. Linear (in the size of the circular_buffers). 
        
-
        
-
        
-
        Iterator Invalidation. Does not invalidate any iterators. 
        
-
        
-
        
-
        
----
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
        



        Parameters:
        
----
-
-
-
-
-
-
-
-
-
-
-
        



        lhs
        The circular_buffer to compare. 
        rhs
        The circular_buffer to compare. 
        Returns:
        lhs.size() == rhs.size() && std::equal(lhs.begin(), lhs.end(), rhs.begin()) 
        Throws:
        		Nothing. 
        
-
        
-
        
-
-
-
-
        Copyright © 2003-2013 Jan Gaspar
        
-        Distributed under the Boost Software License, Version 1.0. (See accompanying
-        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-      
        
-
        
-
        
-
        
-PrevUpHomeNext
-
        
-
-
diff --git a/doc/html/boost/operator___idp24487216.html b/doc/html/boost/operator___idp24487216.html
deleted file mode 100644
index 40dbe23cca..0000000000
--- a/doc/html/boost/operator___idp24487216.html
+++ /dev/null
@@ -1,105 +0,0 @@
-
-
-
-
-Function template operator!=
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
        
-
        
-
        
-PrevUpHomeNext
-
        
-
        
-
        
-
        
-
        Function template operator!=
        
-
        boost::operator!= — Compare two circular_buffers element-by-element to determine if they are non-equal. 
        
-
        
-
        Synopsis
        
-
        // In header: <boost/circular_buffer/base.hpp>
-
-
-template<typename T, typename Alloc> 
-  bool operator!=(const circular_buffer< T, Alloc > & lhs, 
-                  const circular_buffer< T, Alloc > & rhs);
        
-
        
-
        Description
        
-
        
-
-
-
        
-
        Complexity. Linear (in the size of the circular_buffers). 
        
-
        
-
        
-
        Iterator Invalidation. Does not invalidate any iterators. 
        
-
        
-
        
-
        See Also:
        
-
        operator==(const circular_buffer<T,Alloc>&, const circular_buffer<T,Alloc>&) 
        
-
        
-
        
-
        
----
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
        



        Parameters:
        
----
-
-
-
-
-
-
-
-
-
-
-
        



        lhs
        The circular_buffer to compare. 
        rhs
        The circular_buffer to compare. 
        Returns:
        !(lhs == rhs) 
        Throws:
        		Nothing. 
        
-
        
-
        
-
-
-
-
        Copyright © 2003-2013 Jan Gaspar
        
-        Distributed under the Boost Software License, Version 1.0. (See accompanying
-        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-      
        
-
        
-
        
-
        
-PrevUpHomeNext
-
        
-
-
diff --git a/doc/html/boost/operator___idp24515552.html b/doc/html/boost/operator___idp24515552.html
deleted file mode 100644
index 0ef349a588..0000000000
--- a/doc/html/boost/operator___idp24515552.html
+++ /dev/null
@@ -1,105 +0,0 @@
-
-
-
-
-Function template operator<=
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
        
-
        
-
        
-PrevUpHomeNext
-
        
-
        
-
        
-
        
-
        Function template operator<=
        
-
        boost::operator<= — Compare two circular_buffers element-by-element to determine if the left one is lesser or equal to the right one. 
        
-
        
-
        Synopsis
        
-
        // In header: <boost/circular_buffer/base.hpp>
-
-
-template<typename T, typename Alloc> 
-  bool operator<=(const circular_buffer< T, Alloc > & lhs, 
-                  const circular_buffer< T, Alloc > & rhs);
        
-
        
-
        Description
        
-
        
-
-
-
        
-
        Complexity. Linear (in the size of the circular_buffers). 
        
-
        
-
        
-
        Iterator Invalidation. Does not invalidate any iterators. 
        
-
        
-
        
-
        See Also:
        
-
        operator<(const circular_buffer<T,Alloc>&, const circular_buffer<T,Alloc>&) 
        
-
        
-
        
-
        
----
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
        



        Parameters:
        
----
-
-
-
-
-
-
-
-
-
-
-
        



        lhs
        The circular_buffer to compare. 
        rhs
        The circular_buffer to compare. 
        Returns:
        !(rhs < lhs) 
        Throws:
        		Nothing. 
        
-
        
-
        
-
-
-
-
        Copyright © 2003-2013 Jan Gaspar
        
-        Distributed under the Boost Software License, Version 1.0. (See accompanying
-        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-      
        
-
        
-
        
-
        
-PrevUpHomeNext
-
        
-
-
diff --git a/doc/html/boost/operator___idp24529728.html b/doc/html/boost/operator___idp24529728.html
deleted file mode 100644
index e970367cca..0000000000
--- a/doc/html/boost/operator___idp24529728.html
+++ /dev/null
@@ -1,105 +0,0 @@
-
-
-
-
-Function template operator>=
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
        
-
        
-
        
-PrevUpHomeNext
-
        
-
        
-
        
-
        
-
        Function template operator>=
        
-
        boost::operator>= — Compare two circular_buffers element-by-element to determine if the left one is greater or equal to the right one. 
        
-
        
-
        Synopsis
        
-
        // In header: <boost/circular_buffer/base.hpp>
-
-
-template<typename T, typename Alloc> 
-  bool operator>=(const circular_buffer< T, Alloc > & lhs, 
-                  const circular_buffer< T, Alloc > & rhs);
        
-
        
-
        Description
        
-
        
-
-
-
        
-
        Complexity. Linear (in the size of the circular_buffers). 
        
-
        
-
        
-
        Iterator Invalidation. Does not invalidate any iterators. 
        
-
        
-
        
-
        See Also:
        
-
        operator<(const circular_buffer<T,Alloc>&, const circular_buffer<T,Alloc>&) 
        
-
        
-
        
-
        
----
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
        



        Parameters:
        
----
-
-
-
-
-
-
-
-
-
-
-
        



        lhs
        The circular_buffer to compare. 
        rhs
        The circular_buffer to compare. 
        Returns:
        !(lhs < rhs) 
        Throws:
        		Nothing. 
        
-
        
-
        
-
-
-
-
        Copyright © 2003-2013 Jan Gaspar
        
-        Distributed under the Boost Software License, Version 1.0. (See accompanying
-        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-      
        
-
        
-
        
-
        
-PrevUpHomeNext
-
        
-
-
diff --git a/doc/html/boost/operator___idp43338976.html b/doc/html/boost/operator___idp43338976.html
new file mode 100644
index 0000000000..7c94f7d5bb
--- /dev/null
+++ b/doc/html/boost/operator___idp43338976.html
@@ -0,0 +1,101 @@
+
+
+
+
+Function template operator==
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
        
+
        
+
        
+PrevUpHomeNext
+
        
+
        
+
        
+
        
+
        Function template operator==
        
+
        boost::operator== — Compare two circular_buffers element-by-element to determine if they are equal. 
        
+
        
+
        Synopsis
        
+
        // In header: <boost/circular_buffer/base.hpp>
+
+
+template<typename T, typename Alloc> 
+  bool operator==(const circular_buffer< T, Alloc > & lhs, 
+                  const circular_buffer< T, Alloc > & rhs);
        
+
        
+
        Description
        
+
        
+
+
+
        
+
        Complexity. Linear (in the size of the circular_buffers). 
        
+
        
+
        
+
        Iterator Invalidation. Does not invalidate any iterators. 
        
+
        
+
        
+
        
++++
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
        



        Parameters:
        
++++
+
+
+
+
+
+
+
+
+
+
+
        



        lhs
        The circular_buffer to compare. 
        rhs
        The circular_buffer to compare. 
        Returns:
        lhs.size() == rhs.size() && std::equal(lhs.begin(), lhs.end(), rhs.begin()) 
        Throws:
        		Nothing. 
        
+
        
+
        
+
+
+
+
        Copyright © 2003-2013 Jan Gaspar
        
+        Distributed under the Boost Software License, Version 1.0. (See accompanying
+        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+      
        
+
        
+
        
+
        
+PrevUpHomeNext
+
        
+
+
diff --git a/doc/html/boost/operator___idp43365744.html b/doc/html/boost/operator___idp43365744.html
new file mode 100644
index 0000000000..ed7f6bd929
--- /dev/null
+++ b/doc/html/boost/operator___idp43365744.html
@@ -0,0 +1,105 @@
+
+
+
+
+Function template operator!=
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
        
+
        
+
        
+PrevUpHomeNext
+
        
+
        
+
        
+
        
+
        Function template operator!=
        
+
        boost::operator!= — Compare two circular_buffers element-by-element to determine if they are non-equal. 
        
+
        
+
        Synopsis
        
+
        // In header: <boost/circular_buffer/base.hpp>
+
+
+template<typename T, typename Alloc> 
+  bool operator!=(const circular_buffer< T, Alloc > & lhs, 
+                  const circular_buffer< T, Alloc > & rhs);
        
+
        
+
        Description
        
+
        
+
+
+
        
+
        Complexity. Linear (in the size of the circular_buffers). 
        
+
        
+
        
+
        Iterator Invalidation. Does not invalidate any iterators. 
        
+
        
+
        
+
        See Also:
        
+
        operator==(const circular_buffer<T,Alloc>&, const circular_buffer<T,Alloc>&) 
        
+
        
+
        
+
        
++++
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
        



        Parameters:
        
++++
+
+
+
+
+
+
+
+
+
+
+
        



        lhs
        The circular_buffer to compare. 
        rhs
        The circular_buffer to compare. 
        Returns:
        !(lhs == rhs) 
        Throws:
        		Nothing. 
        
+
        
+
        
+
+
+
+
        Copyright © 2003-2013 Jan Gaspar
        
+        Distributed under the Boost Software License, Version 1.0. (See accompanying
+        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+      
        
+
        
+
        
+
        
+PrevUpHomeNext
+
        
+
+
diff --git a/doc/html/boost/operator___idp43394080.html b/doc/html/boost/operator___idp43394080.html
new file mode 100644
index 0000000000..1e40df7e13
--- /dev/null
+++ b/doc/html/boost/operator___idp43394080.html
@@ -0,0 +1,105 @@
+
+
+
+
+Function template operator<=
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
        
+
        
+
        
+PrevUpHomeNext
+
        
+
        
+
        
+
        
+
        Function template operator<=
        
+
        boost::operator<= — Compare two circular_buffers element-by-element to determine if the left one is lesser or equal to the right one. 
        
+
        
+
        Synopsis
        
+
        // In header: <boost/circular_buffer/base.hpp>
+
+
+template<typename T, typename Alloc> 
+  bool operator<=(const circular_buffer< T, Alloc > & lhs, 
+                  const circular_buffer< T, Alloc > & rhs);
        
+
        
+
        Description
        
+
        
+
+
+
        
+
        Complexity. Linear (in the size of the circular_buffers). 
        
+
        
+
        
+
        Iterator Invalidation. Does not invalidate any iterators. 
        
+
        
+
        
+
        See Also:
        
+
        operator<(const circular_buffer<T,Alloc>&, const circular_buffer<T,Alloc>&) 
        
+
        
+
        
+
        
++++
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
        



        Parameters:
        
++++
+
+
+
+
+
+
+
+
+
+
+
        



        lhs
        The circular_buffer to compare. 
        rhs
        The circular_buffer to compare. 
        Returns:
        !(rhs < lhs) 
        Throws:
        		Nothing. 
        
+
        
+
        
+
+
+
+
        Copyright © 2003-2013 Jan Gaspar
        
+        Distributed under the Boost Software License, Version 1.0. (See accompanying
+        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+      
        
+
        
+
        
+
        
+PrevUpHomeNext
+
        
+
+
diff --git a/doc/html/boost/operator___idp43408256.html b/doc/html/boost/operator___idp43408256.html
new file mode 100644
index 0000000000..e4fc199e93
--- /dev/null
+++ b/doc/html/boost/operator___idp43408256.html
@@ -0,0 +1,105 @@
+
+
+
+
+Function template operator>=
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
        
+
        
+
        
+PrevUpHomeNext
+
        
+
        
+
        
+
        
+
        Function template operator>=
        
+
        boost::operator>= — Compare two circular_buffers element-by-element to determine if the left one is greater or equal to the right one. 
        
+
        
+
        Synopsis
        
+
        // In header: <boost/circular_buffer/base.hpp>
+
+
+template<typename T, typename Alloc> 
+  bool operator>=(const circular_buffer< T, Alloc > & lhs, 
+                  const circular_buffer< T, Alloc > & rhs);
        
+
        
+
        Description
        
+
        
+
+
+
        
+
        Complexity. Linear (in the size of the circular_buffers). 
        
+
        
+
        
+
        Iterator Invalidation. Does not invalidate any iterators. 
        
+
        
+
        
+
        See Also:
        
+
        operator<(const circular_buffer<T,Alloc>&, const circular_buffer<T,Alloc>&) 
        
+
        
+
        
+
        
++++
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
        



        Parameters:
        
++++
+
+
+
+
+
+
+
+
+
+
+
        



        lhs
        The circular_buffer to compare. 
        rhs
        The circular_buffer to compare. 
        Returns:
        !(lhs < rhs) 
        Throws:
        		Nothing. 
        
+
        
+
        
+
+
+
+
        Copyright © 2003-2013 Jan Gaspar
        
+        Distributed under the Boost Software License, Version 1.0. (See accompanying
+        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+      
        
+
        
+
        
+
        
+PrevUpHomeNext
+
        
+
+
diff --git a/doc/html/boost/operator_idp24473872.html b/doc/html/boost/operator_idp24473872.html
deleted file mode 100644
index 915272846c..0000000000
--- a/doc/html/boost/operator_idp24473872.html
+++ /dev/null
@@ -1,101 +0,0 @@
-
-
-
-
-Function template operator<
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
        
-
        
-
        
-PrevUpHomeNext
-
        
-
        
-
        
-
        
-
        Function template operator<
        
-
        boost::operator< — Compare two circular_buffers element-by-element to determine if the left one is lesser than the right one. 
        
-
        
-
        Synopsis
        
-
        // In header: <boost/circular_buffer/base.hpp>
-
-
-template<typename T, typename Alloc> 
-  bool operator<(const circular_buffer< T, Alloc > & lhs, 
-                 const circular_buffer< T, Alloc > & rhs);
        
-
        
-
        Description
        
-
        
-
-
-
        
-
        Complexity. Linear (in the size of the circular_buffers). 
        
-
        
-
        
-
        Iterator Invalidation. Does not invalidate any iterators. 
        
-
        
-
        
-
        
----
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
        



        Parameters:
        
----
-
-
-
-
-
-
-
-
-
-
-
        



        lhs
        The circular_buffer to compare. 
        rhs
        The circular_buffer to compare. 
        Returns:
        std::lexicographical_compare(lhs.begin(), lhs.end(), rhs.begin(), rhs.end()) 
        Throws:
        		Nothing. 
        
-
        
-
        
-
-
-
-
        Copyright © 2003-2013 Jan Gaspar
        
-        Distributed under the Boost Software License, Version 1.0. (See accompanying
-        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-      
        
-
        
-
        
-
        
-PrevUpHomeNext
-
        
-
-
diff --git a/doc/html/boost/operator_idp24501376.html b/doc/html/boost/operator_idp24501376.html
deleted file mode 100644
index 2e73be370d..0000000000
--- a/doc/html/boost/operator_idp24501376.html
+++ /dev/null
@@ -1,105 +0,0 @@
-
-
-
-
-Function template operator>
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
        
-
        
-
        
-PrevUpHomeNext
-
        
-
        
-
        
-
        
-
        Function template operator>
        
-
        boost::operator> — Compare two circular_buffers element-by-element to determine if the left one is greater than the right one. 
        
-
        
-
        Synopsis
        
-
        // In header: <boost/circular_buffer/base.hpp>
-
-
-template<typename T, typename Alloc> 
-  bool operator>(const circular_buffer< T, Alloc > & lhs, 
-                 const circular_buffer< T, Alloc > & rhs);
        
-
        
-
        Description
        
-
        
-
-
-
        
-
        Complexity. Linear (in the size of the circular_buffers). 
        
-
        
-
        
-
        Iterator Invalidation. Does not invalidate any iterators. 
        
-
        
-
        
-
        See Also:
        
-
        operator<(const circular_buffer<T,Alloc>&, const circular_buffer<T,Alloc>&) 
        
-
        
-
        
-
        
----
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
        



        Parameters:
        
----
-
-
-
-
-
-
-
-
-
-
-
        



        lhs
        The circular_buffer to compare. 
        rhs
        The circular_buffer to compare. 
        Returns:
        rhs < lhs 
        Throws:
        		Nothing. 
        
-
        
-
        
-
-
-
-
        Copyright © 2003-2013 Jan Gaspar
        
-        Distributed under the Boost Software License, Version 1.0. (See accompanying
-        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-      
        
-
        
-
        
-
        
-PrevUpHomeNext
-
        
-
-
diff --git a/doc/html/boost/operator_idp43352400.html b/doc/html/boost/operator_idp43352400.html
new file mode 100644
index 0000000000..f9e224e570
--- /dev/null
+++ b/doc/html/boost/operator_idp43352400.html
@@ -0,0 +1,101 @@
+
+
+
+
+Function template operator<
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
        
+
        
+
        
+PrevUpHomeNext
+
        
+
        
+
        
+
        
+
        Function template operator<
        
+
        boost::operator< — Compare two circular_buffers element-by-element to determine if the left one is lesser than the right one. 
        
+
        
+
        Synopsis
        
+
        // In header: <boost/circular_buffer/base.hpp>
+
+
+template<typename T, typename Alloc> 
+  bool operator<(const circular_buffer< T, Alloc > & lhs, 
+                 const circular_buffer< T, Alloc > & rhs);
        
+
        
+
        Description
        
+
        
+
+
+
        
+
        Complexity. Linear (in the size of the circular_buffers). 
        
+
        
+
        
+
        Iterator Invalidation. Does not invalidate any iterators. 
        
+
        
+
        
+
        
++++
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
        



        Parameters:
        
++++
+
+
+
+
+
+
+
+
+
+
+
        



        lhs
        The circular_buffer to compare. 
        rhs
        The circular_buffer to compare. 
        Returns:
        std::lexicographical_compare(lhs.begin(), lhs.end(), rhs.begin(), rhs.end()) 
        Throws:
        		Nothing. 
        
+
        
+
        
+
+
+
+
        Copyright © 2003-2013 Jan Gaspar
        
+        Distributed under the Boost Software License, Version 1.0. (See accompanying
+        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+      
        
+
        
+
        
+
        
+PrevUpHomeNext
+
        
+
+
diff --git a/doc/html/boost/operator_idp43379904.html b/doc/html/boost/operator_idp43379904.html
new file mode 100644
index 0000000000..fd64108285
--- /dev/null
+++ b/doc/html/boost/operator_idp43379904.html
@@ -0,0 +1,105 @@
+
+
+
+
+Function template operator>
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
        
+
        
+
        
+PrevUpHomeNext
+
        
+
        
+
        
+
        
+
        Function template operator>
        
+
        boost::operator> — Compare two circular_buffers element-by-element to determine if the left one is greater than the right one. 
        
+
        
+
        Synopsis
        
+
        // In header: <boost/circular_buffer/base.hpp>
+
+
+template<typename T, typename Alloc> 
+  bool operator>(const circular_buffer< T, Alloc > & lhs, 
+                 const circular_buffer< T, Alloc > & rhs);
        
+
        
+
        Description
        
+
        
+
+
+
        
+
        Complexity. Linear (in the size of the circular_buffers). 
        
+
        
+
        
+
        Iterator Invalidation. Does not invalidate any iterators. 
        
+
        
+
        
+
        See Also:
        
+
        operator<(const circular_buffer<T,Alloc>&, const circular_buffer<T,Alloc>&) 
        
+
        
+
        
+
        
++++
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
        



        Parameters:
        
++++
+
+
+
+
+
+
+
+
+
+
+
        



        lhs
        The circular_buffer to compare. 
        rhs
        The circular_buffer to compare. 
        Returns:
        rhs < lhs 
        Throws:
        		Nothing. 
        
+
        
+
        
+
+
+
+
        Copyright © 2003-2013 Jan Gaspar
        
+        Distributed under the Boost Software License, Version 1.0. (See accompanying
+        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+      
        
+
        
+
        
+
        
+PrevUpHomeNext
+
        
+
+
diff --git a/doc/html/boost/posix_time/duration_from_string.html b/doc/html/boost/posix_time/duration_from_string.html
index 501540e350..1e6bf743de 100644
--- a/doc/html/boost/posix_time/duration_from_string.html
+++ b/doc/html/boost/posix_time/duration_from_string.html
@@ -8,7 +8,7 @@
 
 
 
-
+
 
 
 
@@ -21,7 +21,7 @@
 
        
 
        
 
        
-PrevUpHomeNext
+PrevUpHomeNext
 
        
 
        
 
        
@@ -35,7 +35,7 @@
 
 time_duration duration_from_string(const std::string & s);
        
 
        
-
        Description
        
+
        Description
        
 
        Expected format for string is "[-]h[h][:mm][:ss][.fff]". A negative duration will be created if the first character in string is a '-', all other '-' will be treated as delimiters. Accepted delimiters are "-:,.". 
        
 
        
 
        
@@ -47,7 +47,7 @@
 
 
        
 
        
-PrevUpHomeNext
+PrevUpHomeNext
 
        
 
 
diff --git a/doc/html/boost/posix_time/from_ftime.html b/doc/html/boost/posix_time/from_ftime.html
index c498249de9..b9563abe4f 100644
--- a/doc/html/boost/posix_time/from_ftime.html
+++ b/doc/html/boost/posix_time/from_ftime.html
@@ -8,7 +8,7 @@
 
 
 
-
+
 
 
 
@@ -21,7 +21,7 @@
 
        
 
        
 
        
-PrevUpHomeNext
+PrevUpHomeNext
 
        
 
        
 
        
@@ -36,7 +36,7 @@
 template<typename TimeT, typename FileTimeT> 
   TimeT from_ftime(const FileTimeT & ft);
        
 
        
-
        Description
        
+
        Description
        
 
        Function to create a time object from an initialized FILETIME struct. A FILETIME struct holds 100-nanosecond units (0.0000001). When built with microsecond resolution the FILETIME's sub second value will be truncated. Nanosecond resolution has no truncation.
        
 
        
@@ -60,7 +60,7 @@
 
        
 
        
 
        
 
        
-PrevUpHomeNext
+PrevUpHomeNext
 
        
 
 
diff --git a/doc/html/boost/posix_time/hours.html b/doc/html/boost/posix_time/hours.html
index d9b04242d0..c93d934db9 100644
--- a/doc/html/boost/posix_time/hours.html
+++ b/doc/html/boost/posix_time/hours.html
@@ -7,7 +7,7 @@
 
 
 
-
+
 
 
 
@@ -21,13 +21,13 @@
 
 
        
 
        
-PrevUpHomeNext
+PrevUpHomeNext
 
        
 
        
 
        
 
        
 
        Class hours
        
-
        boost::posix_time::hours — Allows expression of durations as an hour count. 
        
+
        boost::posix_time::hours
        
 
        
 
        Synopsis
        
 
        // In header: <boost/date_time/posix_time/posix_time_duration.hpp>
@@ -36,16 +36,21 @@
 class hours : public boost::posix_time::time_duration {
 public:
   // construct/copy/destruct
-  explicit hours(long);
+  template<typename T> 
+    explicit hours(T const &, 
+                   typename boost::enable_if< boost::is_integral< T >, void >::type * = 0);
 };
        
 
        
-
        Description
        
+
        Description
        
+
        Allows expression of durations as an hour count The argument must be an integral type 
        
 
        
-
        
+
        
 hours 
         public
        construct/copy/destruct
        
-
        1. explicit hours(long h);
        
+
        1. template<typename T> 
+  explicit hours(T const & h, 
+                 typename boost::enable_if< boost::is_integral< T >, void >::type * = 0);
        
 
        
 
        
 
        
@@ -57,7 +62,7 @@
 
 
        
 
        
-PrevUpHomeNext
+PrevUpHomeNext
 
        
 
 
diff --git a/doc/html/boost/posix_time/millis_1_3_12_15_5_5_1_1_4.html b/doc/html/boost/posix_time/millis_1_3_12_15_5_5_1_1_4.html
deleted file mode 100644
index 4cc07d86e4..0000000000
--- a/doc/html/boost/posix_time/millis_1_3_12_15_5_5_1_1_4.html
+++ /dev/null
@@ -1,70 +0,0 @@
-
-
-
-
-Class millisec_posix_time_system_config
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
        
-
        
-
        
-PrevUpHomeNext
-
        
-
        
-
        
-
        
-
        Class millisec_posix_time_system_config
        
-
        boost::posix_time::millisec_posix_time_system_config
        
-
        
-
        Synopsis
        
-
        // In header: <boost/date_time/posix_time/posix_time_config.hpp>
-
-
-class millisec_posix_time_system_config {
-public:
-  // types
-  typedef boost::int64_t             time_rep_type;     
-  typedef gregorian::date            date_type;         
-  typedef gregorian::date_duration   date_duration_type;
-  typedef time_duration              time_duration_type;
-  typedef time_res_traits::tick_type int_type;          
-  typedef time_res_traits::impl_type impl_type;         
-  typedef time_res_traits            resolution_traits; 
-
-  // public member functions
-   BOOST_STATIC_CONSTANT(boost::int64_t, tick_per_second = 1000000);
-};
        
-
        
-
        Description
        
-
        
-
        
-millisec_posix_time_system_config public member functions
        
-
        1.  BOOST_STATIC_CONSTANT(boost::int64_t, tick_per_second = 1000000);
        
-
        
-
        
-
        
-
-
-
-
        Copyright © 2001-2005 CrystalClear Software, Inc
        Subject to the Boost Software License, Version 1.0. (See accompanying file
-    LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
        
-
        
-
        
-
        
-PrevUpHomeNext
-
        
-
-
diff --git a/doc/html/boost/posix_time/millis_1_3_13_15_5_5_1_1_4.html b/doc/html/boost/posix_time/millis_1_3_13_15_5_5_1_1_4.html
new file mode 100644
index 0000000000..3f8dcebf9f
--- /dev/null
+++ b/doc/html/boost/posix_time/millis_1_3_13_15_5_5_1_1_4.html
@@ -0,0 +1,70 @@
+
+
+
+
+Class millisec_posix_time_system_config
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
        
+
        
+
        
+PrevUpHomeNext
+
        
+
        
+
        
+
        
+
        Class millisec_posix_time_system_config
        
+
        boost::posix_time::millisec_posix_time_system_config
        
+
        
+
        Synopsis
        
+
        // In header: <boost/date_time/posix_time/posix_time_config.hpp>
+
+
+class millisec_posix_time_system_config {
+public:
+  // types
+  typedef boost::int64_t             time_rep_type;     
+  typedef gregorian::date            date_type;         
+  typedef gregorian::date_duration   date_duration_type;
+  typedef time_duration              time_duration_type;
+  typedef time_res_traits::tick_type int_type;          
+  typedef time_res_traits::impl_type impl_type;         
+  typedef time_res_traits            resolution_traits; 
+
+  // public member functions
+   BOOST_STATIC_CONSTANT(boost::int64_t, tick_per_second = 1000000);
+};
        
+
        
+
        Description
        
+
        
+
        
+millisec_posix_time_system_config public member functions
        
+
        1.  BOOST_STATIC_CONSTANT(boost::int64_t, tick_per_second = 1000000);
        
+
        
+
        
+
        
+
+
+
+
        Copyright © 2001-2005 CrystalClear Software, Inc
        Subject to the Boost Software License, Version 1.0. (See accompanying file
+    LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
        
+
        
+
        
+
        
+PrevUpHomeNext
+
        
+
+
diff --git a/doc/html/boost/posix_time/minutes.html b/doc/html/boost/posix_time/minutes.html
index f65a46ce03..bd37f63497 100644
--- a/doc/html/boost/posix_time/minutes.html
+++ b/doc/html/boost/posix_time/minutes.html
@@ -27,7 +27,7 @@
 
        
 
        
 
        Class minutes
        
-
        boost::posix_time::minutes — Allows expression of durations as a minute count. 
        
+
        boost::posix_time::minutes
        
 
        
 
        Synopsis
        
 
        // In header: <boost/date_time/posix_time/posix_time_duration.hpp>
@@ -36,16 +36,21 @@
 class minutes : public boost::posix_time::time_duration {
 public:
   // construct/copy/destruct
-  explicit minutes(long);
+  template<typename T> 
+    explicit minutes(T const &, 
+                     typename boost::enable_if< boost::is_integral< T >, void >::type * = 0);
 };
        
 
        
-
        Description
        
+
        Description
        
+
        Allows expression of durations as a minute count The argument must be an integral type 
        
 
        
-
        
+
        
 minutes 
         public
        construct/copy/destruct
        
-
        1. explicit minutes(long m);
        
+
        1. template<typename T> 
+  explicit minutes(T const & m, 
+                   typename boost::enable_if< boost::is_integral< T >, void >::type * = 0);
        
 
        
 
        
 
        
diff --git a/doc/html/boost/posix_time/operat_1_3_12_15_5_3_2_1_1.html b/doc/html/boost/posix_time/operat_1_3_12_15_5_3_2_1_1.html
deleted file mode 100644
index 1fcb863681..0000000000
--- a/doc/html/boost/posix_time/operat_1_3_12_15_5_3_2_1_1.html
+++ /dev/null
@@ -1,53 +0,0 @@
-
-
-
-
-Function operator+
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
        
-
        
-
        
-PrevUpHomeNext
-
        
-
        
-
        
-
        
-
        Function operator+
        
-
        boost::posix_time::operator+
        
-
        
-
        Synopsis
        
-
        // In header: <boost/date_time/posix_time/date_duration_operators.hpp>
-
-
-ptime operator+(const ptime & t, const boost::gregorian::months & m);
        
-
        
-
        Description
        
-
        Adds a months object and a ptime. Result will be same day-of-month as ptime unless original day was the last day of month. see date_time::months_duration for more details 
        
-
        
-
        
-
-
-
-
        Copyright © 2001-2005 CrystalClear Software, Inc
        Subject to the Boost Software License, Version 1.0. (See accompanying file
-    LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
        
-
        
-
        
-
        
-PrevUpHomeNext
-
        
-
-
diff --git a/doc/html/boost/posix_time/operat_1_3_12_15_5_3_2_1_2.html b/doc/html/boost/posix_time/operat_1_3_12_15_5_3_2_1_2.html
deleted file mode 100644
index ec081fe161..0000000000
--- a/doc/html/boost/posix_time/operat_1_3_12_15_5_3_2_1_2.html
+++ /dev/null
@@ -1,53 +0,0 @@
-
-
-
-
-Function operator+=
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
        
-
        
-
        
-PrevUpHomeNext
-
        
-
        
-
        
-
        
-
        Function operator+=
        
-
        boost::posix_time::operator+=
        
-
        
-
        Synopsis
        
-
        // In header: <boost/date_time/posix_time/date_duration_operators.hpp>
-
-
-ptime operator+=(ptime & t, const boost::gregorian::months & m);
        
-
        
-
        Description
        
-
        Adds a months object to a ptime. Result will be same day-of-month as ptime unless original day was the last day of month. see date_time::months_duration for more details 
        
-
        
-
        
-
-
-
-
        Copyright © 2001-2005 CrystalClear Software, Inc
        Subject to the Boost Software License, Version 1.0. (See accompanying file
-    LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
        
-
        
-
        
-
        
-PrevUpHomeNext
-
        
-
-
diff --git a/doc/html/boost/posix_time/operat_1_3_12_15_5_3_2_1_3.html b/doc/html/boost/posix_time/operat_1_3_12_15_5_3_2_1_3.html
deleted file mode 100644
index 4aa463d263..0000000000
--- a/doc/html/boost/posix_time/operat_1_3_12_15_5_3_2_1_3.html
+++ /dev/null
@@ -1,53 +0,0 @@
-
-
-
-
-Function operator-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
        
-
        
-
        
-PrevUpHomeNext
-
        
-
        
-
        
-
        
-
        Function operator-
        
-
        boost::posix_time::operator-
        
-
        
-
        Synopsis
        
-
        // In header: <boost/date_time/posix_time/date_duration_operators.hpp>
-
-
-ptime operator-(const ptime & t, const boost::gregorian::months & m);
        
-
        
-
        Description
        
-
        Subtracts a months object and a ptime. Result will be same day-of-month as ptime unless original day was the last day of month. see date_time::months_duration for more details 
        
-
        
-
        
-
-
-
-
        Copyright © 2001-2005 CrystalClear Software, Inc
        Subject to the Boost Software License, Version 1.0. (See accompanying file
-    LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
        
-
        
-
        
-
        
-PrevUpHomeNext
-
        
-
-
diff --git a/doc/html/boost/posix_time/operat_1_3_12_15_5_3_2_1_4.html b/doc/html/boost/posix_time/operat_1_3_12_15_5_3_2_1_4.html
deleted file mode 100644
index efbe6c747a..0000000000
--- a/doc/html/boost/posix_time/operat_1_3_12_15_5_3_2_1_4.html
+++ /dev/null
@@ -1,53 +0,0 @@
-
-
-
-
-Function operator-=
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
        
-
        
-
        
-PrevUpHomeNext
-
        
-
        
-
        
-
        
-
        Function operator-=
        
-
        boost::posix_time::operator-=
        
-
        
-
        Synopsis
        
-
        // In header: <boost/date_time/posix_time/date_duration_operators.hpp>
-
-
-ptime operator-=(ptime & t, const boost::gregorian::months & m);
        
-
        
-
        Description
        
-
        Subtracts a months object from a ptime. Result will be same day-of-month as ptime unless original day was the last day of month. see date_time::months_duration for more details 
        
-
        
-
        
-
-
-
-
        Copyright © 2001-2005 CrystalClear Software, Inc
        Subject to the Boost Software License, Version 1.0. (See accompanying file
-    LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
        
-
        
-
        
-
        
-PrevUpHomeNext
-
        
-
-
diff --git a/doc/html/boost/posix_time/operat_1_3_12_15_5_3_2_1_5.html b/doc/html/boost/posix_time/operat_1_3_12_15_5_3_2_1_5.html
deleted file mode 100644
index 7f2fc8fe00..0000000000
--- a/doc/html/boost/posix_time/operat_1_3_12_15_5_3_2_1_5.html
+++ /dev/null
@@ -1,53 +0,0 @@
-
-
-
-
-Function operator+
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
        
-
        
-
        
-PrevUpHomeNext
-
        
-
        
-
        
-
        
-
        Function operator+
        
-
        boost::posix_time::operator+
        
-
        
-
        Synopsis
        
-
        // In header: <boost/date_time/posix_time/date_duration_operators.hpp>
-
-
-ptime operator+(const ptime & t, const boost::gregorian::years & y);
        
-
        
-
        Description
        
-
        Adds a years object and a ptime. Result will be same month and day-of-month as ptime unless original day was the last day of month. see date_time::years_duration for more details 
        
-
        
-
        
-
-
-
-
        Copyright © 2001-2005 CrystalClear Software, Inc
        Subject to the Boost Software License, Version 1.0. (See accompanying file
-    LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
        
-
        
-
        
-
        
-PrevUpHomeNext
-
        
-
-
diff --git a/doc/html/boost/posix_time/operat_1_3_12_15_5_3_2_1_6.html b/doc/html/boost/posix_time/operat_1_3_12_15_5_3_2_1_6.html
deleted file mode 100644
index 75049b01f3..0000000000
--- a/doc/html/boost/posix_time/operat_1_3_12_15_5_3_2_1_6.html
+++ /dev/null
@@ -1,53 +0,0 @@
-
-
-
-
-Function operator+=
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
        
-
        
-
        
-PrevUpHomeNext
-
        
-
        
-
        
-
        
-
        Function operator+=
        
-
        boost::posix_time::operator+=
        
-
        
-
        Synopsis
        
-
        // In header: <boost/date_time/posix_time/date_duration_operators.hpp>
-
-
-ptime operator+=(ptime & t, const boost::gregorian::years & y);
        
-
        
-
        Description
        
-
        Adds a years object to a ptime. Result will be same month and day-of-month as ptime unless original day was the last day of month. see date_time::years_duration for more details 
        
-
        
-
        
-
-
-
-
        Copyright © 2001-2005 CrystalClear Software, Inc
        Subject to the Boost Software License, Version 1.0. (See accompanying file
-    LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
        
-
        
-
        
-
        
-PrevUpHomeNext
-
        
-
-
diff --git a/doc/html/boost/posix_time/operat_1_3_12_15_5_3_2_1_7.html b/doc/html/boost/posix_time/operat_1_3_12_15_5_3_2_1_7.html
deleted file mode 100644
index 026c24118c..0000000000
--- a/doc/html/boost/posix_time/operat_1_3_12_15_5_3_2_1_7.html
+++ /dev/null
@@ -1,53 +0,0 @@
-
-
-
-
-Function operator-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
        
-
        
-
        
-PrevUpHomeNext
-
        
-
        
-
        
-
        
-
        Function operator-
        
-
        boost::posix_time::operator-
        
-
        
-
        Synopsis
        
-
        // In header: <boost/date_time/posix_time/date_duration_operators.hpp>
-
-
-ptime operator-(const ptime & t, const boost::gregorian::years & y);
        
-
        
-
        Description
        
-
        Subtracts a years object and a ptime. Result will be same month and day-of-month as ptime unless original day was the last day of month. see date_time::years_duration for more details 
        
-
        
-
        
-
-
-
-
        Copyright © 2001-2005 CrystalClear Software, Inc
        Subject to the Boost Software License, Version 1.0. (See accompanying file
-    LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
        
-
        
-
        
-
        
-PrevUpHomeNext
-
        
-
-
diff --git a/doc/html/boost/posix_time/operat_1_3_12_15_5_3_2_1_8.html b/doc/html/boost/posix_time/operat_1_3_12_15_5_3_2_1_8.html
deleted file mode 100644
index e5c8c2bae2..0000000000
--- a/doc/html/boost/posix_time/operat_1_3_12_15_5_3_2_1_8.html
+++ /dev/null
@@ -1,53 +0,0 @@
-
-
-
-
-Function operator-=
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
        
-
        
-
        
-PrevUpHomeNext
-
        
-
        
-
        
-
        
-
        Function operator-=
        
-
        boost::posix_time::operator-=
        
-
        
-
        Synopsis
        
-
        // In header: <boost/date_time/posix_time/date_duration_operators.hpp>
-
-
-ptime operator-=(ptime & t, const boost::gregorian::years & y);
        
-
        
-
        Description
        
-
        Subtracts a years object from a ptime. Result will be same month and day-of-month as ptime unless original day was the last day of month. see date_time::years_duration for more details 
        
-
        
-
        
-
-
-
-
        Copyright © 2001-2005 CrystalClear Software, Inc
        Subject to the Boost Software License, Version 1.0. (See accompanying file
-    LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
        
-
        
-
        
-
        
-PrevUpHomeNext
-
        
-
-
diff --git a/doc/html/boost/posix_time/operat_1_3_12_15_5_8_1_1_6.html b/doc/html/boost/posix_time/operat_1_3_12_15_5_8_1_1_6.html
deleted file mode 100644
index 216f646704..0000000000
--- a/doc/html/boost/posix_time/operat_1_3_12_15_5_8_1_1_6.html
+++ /dev/null
@@ -1,55 +0,0 @@
-
-
-
-
-Function template operator>>
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
        
-
        
-
        
-PrevUpHomeNext
-
        
-
        
-
        
-
        
-
        Function template operator>>
        
-
        boost::posix_time::operator>>
        
-
        
-
        Synopsis
        
-
        // In header: <boost/date_time/posix_time/posix_time_legacy_io.hpp>
-
-
-template<typename charT> 
-  std::basic_istream< charT > & 
-  operator>>(std::basic_istream< charT > & is, time_period & tp);
        
-
        
-
        Description
        
-
        operator>> for time_period. time_period must be in "[date time_duration/date time_duration]" format. 
        
-
        
-
        
-
-
-
-
        Copyright © 2001-2005 CrystalClear Software, Inc
        Subject to the Boost Software License, Version 1.0. (See accompanying file
-    LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
        
-
        
-
        
-
        
-PrevUpHomeNext
-
        
-
-
diff --git a/doc/html/boost/posix_time/operat_1_3_13_15_5_3_2_1_1.html b/doc/html/boost/posix_time/operat_1_3_13_15_5_3_2_1_1.html
new file mode 100644
index 0000000000..a2779756f6
--- /dev/null
+++ b/doc/html/boost/posix_time/operat_1_3_13_15_5_3_2_1_1.html
@@ -0,0 +1,53 @@
+
+
+
+
+Function operator+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
        
+
        
+
        
+PrevUpHomeNext
+
        
+
        
+
        
+
        
+
        Function operator+
        
+
        boost::posix_time::operator+
        
+
        
+
        Synopsis
        
+
        // In header: <boost/date_time/posix_time/date_duration_operators.hpp>
+
+
+ptime operator+(const ptime & t, const boost::gregorian::months & m);
        
+
        
+
        Description
        
+
        Adds a months object and a ptime. Result will be same day-of-month as ptime unless original day was the last day of month. see date_time::months_duration for more details 
        
+
        
+
        
+
+
+
+
        Copyright © 2001-2005 CrystalClear Software, Inc
        Subject to the Boost Software License, Version 1.0. (See accompanying file
+    LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
        
+
        
+
        
+
        
+PrevUpHomeNext
+
        
+
+
diff --git a/doc/html/boost/posix_time/operat_1_3_13_15_5_3_2_1_2.html b/doc/html/boost/posix_time/operat_1_3_13_15_5_3_2_1_2.html
new file mode 100644
index 0000000000..600f6b64fb
--- /dev/null
+++ b/doc/html/boost/posix_time/operat_1_3_13_15_5_3_2_1_2.html
@@ -0,0 +1,53 @@
+
+
+
+
+Function operator+=
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
        
+
        
+
        
+PrevUpHomeNext
+
        
+
        
+
        
+
        
+
        Function operator+=
        
+
        boost::posix_time::operator+=
        
+
        
+
        Synopsis
        
+
        // In header: <boost/date_time/posix_time/date_duration_operators.hpp>
+
+
+ptime operator+=(ptime & t, const boost::gregorian::months & m);
        
+
        
+
        Description
        
+
        Adds a months object to a ptime. Result will be same day-of-month as ptime unless original day was the last day of month. see date_time::months_duration for more details 
        
+
        
+
        
+
+
+
+
        Copyright © 2001-2005 CrystalClear Software, Inc
        Subject to the Boost Software License, Version 1.0. (See accompanying file
+    LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
        
+
        
+
        
+
        
+PrevUpHomeNext
+
        
+
+
diff --git a/doc/html/boost/posix_time/operat_1_3_13_15_5_3_2_1_3.html b/doc/html/boost/posix_time/operat_1_3_13_15_5_3_2_1_3.html
new file mode 100644
index 0000000000..b6e63f4c31
--- /dev/null
+++ b/doc/html/boost/posix_time/operat_1_3_13_15_5_3_2_1_3.html
@@ -0,0 +1,53 @@
+
+
+
+
+Function operator-
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
        
+
        
+
        
+PrevUpHomeNext
+
        
+
        
+
        
+
        
+
        Function operator-
        
+
        boost::posix_time::operator-
        
+
        
+
        Synopsis
        
+
        // In header: <boost/date_time/posix_time/date_duration_operators.hpp>
+
+
+ptime operator-(const ptime & t, const boost::gregorian::months & m);
        
+
        
+
        Description
        
+
        Subtracts a months object and a ptime. Result will be same day-of-month as ptime unless original day was the last day of month. see date_time::months_duration for more details 
        
+
        
+
        
+
+
+
+
        Copyright © 2001-2005 CrystalClear Software, Inc
        Subject to the Boost Software License, Version 1.0. (See accompanying file
+    LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
        
+
        
+
        
+
        
+PrevUpHomeNext
+
        
+
+
diff --git a/doc/html/boost/posix_time/operat_1_3_13_15_5_3_2_1_4.html b/doc/html/boost/posix_time/operat_1_3_13_15_5_3_2_1_4.html
new file mode 100644
index 0000000000..b683c5a52f
--- /dev/null
+++ b/doc/html/boost/posix_time/operat_1_3_13_15_5_3_2_1_4.html
@@ -0,0 +1,53 @@
+
+
+
+
+Function operator-=
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
        
+
        
+
        
+PrevUpHomeNext
+
        
+
        
+
        
+
        
+
        Function operator-=
        
+
        boost::posix_time::operator-=
        
+
        
+
        Synopsis
        
+
        // In header: <boost/date_time/posix_time/date_duration_operators.hpp>
+
+
+ptime operator-=(ptime & t, const boost::gregorian::months & m);
        
+
        
+
        Description
        
+
        Subtracts a months object from a ptime. Result will be same day-of-month as ptime unless original day was the last day of month. see date_time::months_duration for more details 
        
+
        
+
        
+
+
+
+
        Copyright © 2001-2005 CrystalClear Software, Inc
        Subject to the Boost Software License, Version 1.0. (See accompanying file
+    LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
        
+
        
+
        
+
        
+PrevUpHomeNext
+
        
+
+
diff --git a/doc/html/boost/posix_time/operat_1_3_13_15_5_3_2_1_5.html b/doc/html/boost/posix_time/operat_1_3_13_15_5_3_2_1_5.html
new file mode 100644
index 0000000000..f94e3bacc1
--- /dev/null
+++ b/doc/html/boost/posix_time/operat_1_3_13_15_5_3_2_1_5.html
@@ -0,0 +1,53 @@
+
+
+
+
+Function operator+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
        
+
        
+
        
+PrevUpHomeNext
+
        
+
        
+
        
+
        
+
        Function operator+
        
+
        boost::posix_time::operator+
        
+
        
+
        Synopsis
        
+
        // In header: <boost/date_time/posix_time/date_duration_operators.hpp>
+
+
+ptime operator+(const ptime & t, const boost::gregorian::years & y);
        
+
        
+
        Description
        
+
        Adds a years object and a ptime. Result will be same month and day-of-month as ptime unless original day was the last day of month. see date_time::years_duration for more details 
        
+
        
+
        
+
+
+
+
        Copyright © 2001-2005 CrystalClear Software, Inc
        Subject to the Boost Software License, Version 1.0. (See accompanying file
+    LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
        
+
        
+
        
+
        
+PrevUpHomeNext
+
        
+
+
diff --git a/doc/html/boost/posix_time/operat_1_3_13_15_5_3_2_1_6.html b/doc/html/boost/posix_time/operat_1_3_13_15_5_3_2_1_6.html
new file mode 100644
index 0000000000..4c0e1fed14
--- /dev/null
+++ b/doc/html/boost/posix_time/operat_1_3_13_15_5_3_2_1_6.html
@@ -0,0 +1,53 @@
+
+
+
+
+Function operator+=
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
        
+
        
+
        
+PrevUpHomeNext
+
        
+
        
+
        
+
        
+
        Function operator+=
        
+
        boost::posix_time::operator+=
        
+
        
+
        Synopsis
        
+
        // In header: <boost/date_time/posix_time/date_duration_operators.hpp>
+
+
+ptime operator+=(ptime & t, const boost::gregorian::years & y);
        
+
        
+
        Description
        
+
        Adds a years object to a ptime. Result will be same month and day-of-month as ptime unless original day was the last day of month. see date_time::years_duration for more details 
        
+
        
+
        
+
+
+
+
        Copyright © 2001-2005 CrystalClear Software, Inc
        Subject to the Boost Software License, Version 1.0. (See accompanying file
+    LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
        
+
        
+
        
+
        
+PrevUpHomeNext
+
        
+
+
diff --git a/doc/html/boost/posix_time/operat_1_3_13_15_5_3_2_1_7.html b/doc/html/boost/posix_time/operat_1_3_13_15_5_3_2_1_7.html
new file mode 100644
index 0000000000..bc46cb88ef
--- /dev/null
+++ b/doc/html/boost/posix_time/operat_1_3_13_15_5_3_2_1_7.html
@@ -0,0 +1,53 @@
+
+
+
+
+Function operator-
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
        
+
        
+
        
+PrevUpHomeNext
+
        
+
        
+
        
+
        
+
        Function operator-
        
+
        boost::posix_time::operator-
        
+
        
+
        Synopsis
        
+
        // In header: <boost/date_time/posix_time/date_duration_operators.hpp>
+
+
+ptime operator-(const ptime & t, const boost::gregorian::years & y);
        
+
        
+
        Description
        
+
        Subtracts a years object and a ptime. Result will be same month and day-of-month as ptime unless original day was the last day of month. see date_time::years_duration for more details 
        
+
        
+
        
+
+
+
+
        Copyright © 2001-2005 CrystalClear Software, Inc
        Subject to the Boost Software License, Version 1.0. (See accompanying file
+    LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
        
+
        
+
        
+
        
+PrevUpHomeNext
+
        
+
+
diff --git a/doc/html/boost/posix_time/operat_1_3_13_15_5_3_2_1_8.html b/doc/html/boost/posix_time/operat_1_3_13_15_5_3_2_1_8.html
new file mode 100644
index 0000000000..8530b2dbd8
--- /dev/null
+++ b/doc/html/boost/posix_time/operat_1_3_13_15_5_3_2_1_8.html
@@ -0,0 +1,53 @@
+
+
+
+
+Function operator-=
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
        
+
        
+
        
+PrevUpHomeNext
+
        
+
        
+
        
+
        
+
        Function operator-=
        
+
        boost::posix_time::operator-=
        
+
        
+
        Synopsis
        
+
        // In header: <boost/date_time/posix_time/date_duration_operators.hpp>
+
+
+ptime operator-=(ptime & t, const boost::gregorian::years & y);
        
+
        
+
        Description
        
+
        Subtracts a years object from a ptime. Result will be same month and day-of-month as ptime unless original day was the last day of month. see date_time::years_duration for more details 
        
+
        
+
        
+
+
+
+
        Copyright © 2001-2005 CrystalClear Software, Inc
        Subject to the Boost Software License, Version 1.0. (See accompanying file
+    LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
        
+
        
+
        
+
        
+PrevUpHomeNext
+
        
+
+
diff --git a/doc/html/boost/posix_time/operat_1_3_13_15_5_8_1_1_6.html b/doc/html/boost/posix_time/operat_1_3_13_15_5_8_1_1_6.html
new file mode 100644
index 0000000000..19b7bb43c3
--- /dev/null
+++ b/doc/html/boost/posix_time/operat_1_3_13_15_5_8_1_1_6.html
@@ -0,0 +1,55 @@
+
+
+
+
+Function template operator>>
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
        Boost C++ LibrariesHomeLibrariesPeopleFAQMore
        
+
        
+
        
+PrevUpHomeNext
+
        
+
        
+
        
+
        
+
        Function template operator>>
        
+
        boost::posix_time::operator>>
        
+
        
+
        Synopsis
        
+
        // In header: <boost/date_time/posix_time/posix_time_legacy_io.hpp>
+
+
+template<typename charT> 
+  std::basic_istream< charT > & 
+  operator>>(std::basic_istream< charT > & is, time_period & tp);
        
+
        
+
        Description
        
+
        operator>> for time_period. time_period must be in "[date time_duration/date time_duration]" format. 
        
+
        
+
        
+
+
+
+
        Copyright © 2001-2005 CrystalClear Software, Inc
        Subject to the Boost Software License, Version 1.0. (See accompanying file
+    LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
        
+
        
+
        
+
        
+PrevUpHomeNext
+
        
+
+
diff --git a/doc/html/boost/posix_time/posix_time_system_config.html b/doc/html/boost/posix_time/posix_time_system_config.html
index b4c20c53f2..0b3ad3ea1b 100644
--- a/doc/html/boost/posix_time/posix_time_system_config.html
+++ b/doc/html/boost/posix_time/posix_time_system_config.html
@@ -8,7 +8,7 @@
 
 
 
-
+
 
 
 
@@ -21,7 +21,7 @@
 
        
 
        
 
        
-PrevUpHomeNext
+PrevUpHomeNext
 
        
 
        
 
        
@@ -43,15 +43,15 @@
   typedef time_res_traits::tick_type int_type;          
   typedef time_res_traits            resolution_traits; 
 
-  // public member functions
-   BOOST_STATIC_CONSTANT(boost::int64_t, tick_per_second = 1000000000);
+  // public member functions
+   BOOST_STATIC_CONSTANT(boost::int64_t, tick_per_second = 1000000000);
 };
        
 
        
-
        Description
        
+
        Description
        
 
        
-
        
-posix_time_system_config public member functions
        
-
        1.  BOOST_STATIC_CONSTANT(boost::int64_t, tick_per_second = 1000000000);
        
+
        
+posix_time_system_config public member functions
        
+
        1.  BOOST_STATIC_CONSTANT(boost::int64_t, tick_per_second = 1000000000);
        
 
        
 
        
 
        
@@ -63,7 +63,7 @@
 
 
        
 
        
-PrevUpHomeNext
+PrevUpHomeNext
 
        
 
 
diff --git a/doc/html/boost/posix_time/ptime.html b/doc/html/boost/posix_time/ptime.html
index bf048bce13..ec4a886b39 100644
--- a/doc/html/boost/posix_time/ptime.html
+++ b/doc/html/boost/posix_time/ptime.html
@@ -7,7 +7,7 @@
 
 
 
-
+
 
 
 
@@ -21,7 +21,7 @@
 
 
        
 
        
-PrevUpHomeNext
+PrevUpHomeNext
 
        
 
        
 
        
@@ -42,29 +42,29 @@
   typedef ptime                                time_type;         
 
   // construct/copy/destruct
-  ptime(gregorian::date, time_duration_type);
-  explicit ptime(gregorian::date);
-  ptime(const time_rep_type &);
-  ptime(const special_values);
-  ptime();
+  ptime(gregorian::date, time_duration_type);
+  explicit ptime(gregorian::date);
+  ptime(const time_rep_type &);
+  ptime(const special_values);
+  ptime();
 };
        
 
        
-
        Description
        
+
        Description
        
 
        
-
        
+
        
 ptime 
         public
        construct/copy/destruct
        
 
          
 
        1. 
-
          ptime(gregorian::date d, time_duration_type td);
          Construct with date and offset in day. 
          2. 
+
          ptime(gregorian::date d, time_duration_type td);
          Construct with date and offset in day. 
 
        2. 
-
          explicit ptime(gregorian::date d);
          Construct a time at start of the given day (midnight) 
          3. 
+
          explicit ptime(gregorian::date d);
          Construct a time at start of the given day (midnight) 
 
        3. 
-
          ptime(const time_rep_type & rhs);
          Copy from time_rep. 
          4. 
+
          ptime(const time_rep_type & rhs);
          Copy from time_rep. 
 
        4. 
-
          ptime(const special_values sv);
          Construct from special value. 
          5. 
-
        5. ptime();
          6. 
+
          ptime(const special_values sv);
          Construct from special value. 
+
        6. ptime();
          7. 
 
        
 
        
 
        
@@ -77,7 +77,7 @@
 
 
        
 
        
-PrevUpHomeNext
+PrevUpHomeNext
 
        
 
 
diff --git a/doc/html/boost/posix_time/seconds.html b/doc/html/boost/posix_time/seconds.html
index 5db364eccd..f0987b7f4a 100644
--- a/doc/html/boost/posix_time/seconds.html
+++ b/doc/html/boost/posix_time/seconds.html
@@ -27,7 +27,7 @@
 
        
 
        
 
        Class seconds
        
-
        boost::posix_time::seconds — Allows expression of durations as a seconds count. 
        
+
        boost::posix_time::seconds
        
 
        
 
        Synopsis
        
 
        // In header: <boost/date_time/posix_time/posix_time_duration.hpp>
@@ -36,16 +36,21 @@
 class seconds : public boost::posix_time::time_duration {
 public:
   // construct/copy/destruct
-  explicit seconds(long);
+  template<typename T> 
+    explicit seconds(T const &, 
+                     typename boost::enable_if< boost::is_integral< T >, void >::type * = 0);
 };
        
 
        
-
        Description
        
+
        Description
        
+
        Allows expression of durations as a seconds count The argument must be an integral type 
        
 
        
-
        
+
        
 seconds 
         public
        construct/copy/destruct
        
-
        1. explicit seconds(long s);
        
+
        1. template<typename T> 
+  explicit seconds(T const & s, 
+                   typename boost::enable_if< boost::is_integral< T >, void >::type * = 0);
        
 
        
 
        
 
      
diff --git a/doc/html/boost/posix_time/simple_time_rep.html b/doc/html/boost/posix_time/simple_time_rep.html
index 5cd81ef045..270f7c7660 100644
--- a/doc/html/boost/posix_time/simple_time_rep.html
+++ b/doc/html/boost/posix_time/simple_time_rep.html
@@ -39,35 +39,35 @@
   typedef time_duration   time_duration_type;
 
   // construct/copy/destruct
-  simple_time_rep(date_type, time_duration_type);
+  simple_time_rep(date_type, time_duration_type);
 
-  // public member functions
-  bool is_special() const;
-  bool is_pos_infinity() const;
-  bool is_neg_infinity() const;
-  bool is_not_a_date_time() const;
+  // public member functions
+  bool is_special() const;
+  bool is_pos_infinity() const;
+  bool is_neg_infinity() const;
+  bool is_not_a_date_time() const;
 
   // public data members
   date_type day;
   time_duration_type time_of_day;
 };
    
 
    
-
    Description
    
+
    Description
    
 
    
-
    
+
    
 simple_time_rep 
         public
        construct/copy/destruct
    
-
    1. simple_time_rep(date_type d, time_duration_type tod);
    
+
    1. simple_time_rep(date_type d, time_duration_type tod);
    
 
    
 
    
-
    
-simple_time_rep public member functions
    
+
    
+simple_time_rep public member functions
    
 
      
-
    1. bool is_special() const;
      2. 
-
    2. bool is_pos_infinity() const;
      3. 
-
    3. bool is_neg_infinity() const;
      4. 
-
    4. bool is_not_a_date_time() const;
      5. 
+
    5. bool is_special() const;
      6. 
+
    6. bool is_pos_infinity() const;
      7. 
+
    7. bool is_neg_infinity() const;
      8. 
+
    8. bool is_not_a_date_time() const;
      9. 
 
    
 
    
 
    
diff --git a/doc/html/boost/posix_time/time_duration.html b/doc/html/boost/posix_time/time_duration.html
index f8c4b2a785..f5042c0bb6 100644
--- a/doc/html/boost/posix_time/time_duration.html
+++ b/doc/html/boost/posix_time/time_duration.html
@@ -7,7 +7,7 @@
 
 
 
-
+
 
 
 
@@ -21,7 +21,7 @@
 
 
    
 
    
-PrevUpHomeNext
+PrevUpHomeNext
 
    
 
    
 
    
@@ -48,25 +48,25 @@
   typedef time_res_traits::impl_type               impl_type;              
 
   // construct/copy/destruct
-  time_duration(hour_type, min_type, sec_type, fractional_seconds_type = 0);
-  time_duration();
-  time_duration(boost::date_time::special_values);
-  explicit time_duration(impl_type);
+  time_duration(hour_type, min_type, sec_type, fractional_seconds_type = 0);
+  time_duration();
+  time_duration(boost::date_time::special_values);
+  explicit time_duration(impl_type);
 };
    
 
    
-
    Description
    
+
    Description
    
 
    
-
    
+
    
 time_duration 
         public
        construct/copy/destruct
    
 
      
-
    1. time_duration(hour_type hour, min_type min, sec_type sec, 
+
    2. time_duration(hour_type hour, min_type min, sec_type sec, 
               fractional_seconds_type fs = 0);
      3. 
-
    3. time_duration();
      4. 
+
    4. time_duration();
      5. 
 
    5. 
-
      time_duration(boost::date_time::special_values sv);
      Construct from special_values. 
      6. 
-
    6. explicit time_duration(impl_type tick_count);
      7. 
+
      time_duration(boost::date_time::special_values sv);
      Construct from special_values. 
      7. 
+
    7. explicit time_duration(impl_type tick_count);
      8. 
 
    
 
    
 
    
@@ -79,7 +79,7 @@
 
 
    
 
    
-PrevUpHomeNext
+PrevUpHomeNext
 
    
 
 
diff --git a/doc/html/boost/posix_time/wtime_facet.html b/doc/html/boost/posix_time/wtime_facet.html
index 2492b682f9..5e5b922db7 100644
--- a/doc/html/boost/posix_time/wtime_facet.html
+++ b/doc/html/boost/posix_time/wtime_facet.html
@@ -8,7 +8,7 @@
 
 
 
-
+
 
 
 
@@ -21,7 +21,7 @@
 
    
 
    
 
    
-PrevUpHomeNext
+PrevUpHomeNext
 
    
 
    
 
    
@@ -35,7 +35,7 @@
 
 typedef boost::date_time::time_facet< ptime, wchar_t > wtime_facet;
    
 
    
-
    Description
    
+
    Description
    
 
    ptime_facet is depricated and will be phased out. use time_facet instead wptime_input_facet is depricated and will be phased out. use wtime_input_facet instead ptime_input_facet is depricated and will be phased out. use time_input_facet instead 
    
 
    
 
    
@@ -47,7 +47,7 @@
 
 
    
 
    
-PrevUpHomeNext
+PrevUpHomeNext
 
    
 
 
diff --git a/doc/html/boost/process/async_pipe.html b/doc/html/boost/process/async_pipe.html
index ab35532d8e..38dfc21e1e 100644
--- a/doc/html/boost/process/async_pipe.html
+++ b/doc/html/boost/process/async_pipe.html
@@ -40,51 +40,51 @@
   typedef platform_specific handle_type;       
 
   // construct/copy/destruct
-  async_pipe(boost::asio::io_context &);
-  async_pipe(boost::asio::io_context &, boost::asio::io_context &);
-  async_pipe(boost::asio::io_context &, const std::string &);
-  async_pipe(boost::asio::io_context &, boost::asio::io_context &, 
+  async_pipe(boost::asio::io_context &);
+  async_pipe(boost::asio::io_context &, boost::asio::io_context &);
+  async_pipe(boost::asio::io_context &, const std::string &);
+  async_pipe(boost::asio::io_context &, boost::asio::io_context &, 
              const std::string &);
-  async_pipe(const async_pipe &);
-  async_pipe(async_pipe &&);
+  async_pipe(const async_pipe &);
+  async_pipe(async_pipe &&);
   template<typename CharT, typename Traits = std::char_traits<CharT> > 
-    explicit async_pipe(boost::asio::io_context &, 
+    explicit async_pipe(boost::asio::io_context &, 
                         const basic_pipe< CharT, Traits > &);
   template<typename CharT, typename Traits = std::char_traits<CharT> > 
-    explicit async_pipe(boost::asio::io_context &, boost::asio::io_context &, 
+    explicit async_pipe(boost::asio::io_context &, boost::asio::io_context &, 
                         const basic_pipe< CharT, Traits > &);
   template<typename CharT, typename Traits = std::char_traits<CharT> > 
-    async_pipe & operator=(const basic_pipe< CharT, Traits > &);
-  async_pipe & operator=(const async_pipe &);
-  async_pipe & operator=(async_pipe &&);
-  ~async_pipe();
+    async_pipe & operator=(const basic_pipe< CharT, Traits > &);
+  async_pipe & operator=(const async_pipe &);
+  async_pipe & operator=(async_pipe &&);
+  ~async_pipe();
 
-  // public member functions
+  // public member functions
   template<typename CharT, typename Traits = std::char_traits<CharT> > 
-    explicit operator basic_pipe< CharT, Traits >() const;
-  void cancel();
-  void close();
-  void close(std::error_code &);
-  bool is_open() const;
-  void async_close();
+    explicit operator basic_pipe< CharT, Traits >() const;
+  void cancel();
+  void close();
+  void close(std::error_code &);
+  bool is_open() const;
+  void async_close();
   template<typename MutableBufferSequence> 
-    std::size_t read_some(const MutableBufferSequence &);
+    std::size_t read_some(const MutableBufferSequence &);
   template<typename MutableBufferSequence> 
-    std::size_t write_some(const MutableBufferSequence &);
-  native_handle native_source() const;
-  native_handle native_sink() const;
+    std::size_t write_some(const MutableBufferSequence &);
+  native_handle native_source() const;
+  native_handle native_sink() const;
   template<typename MutableBufferSequence, typename ReadHandler> 
-    unspecified async_read_some(const MutableBufferSequence &, ReadHandler &&);
+    unspecified async_read_some(const MutableBufferSequence &, ReadHandler &&);
   template<typename ConstBufferSequence, typename WriteHandler> 
-    unspecified async_write_some(const ConstBufferSequence &, WriteHandler &&);
-  const handle_type & sink() const;
-  const handle_type & source() const;
-  handle_type && sink();
-  handle_type && source();
-  handle_type source(::boost::asio::io_context &);
-  handle_type sink(::boost::asio::io_context &);
-  handle_type source(::boost::asio::io_context &) const;
-  handle_type sink(::boost::asio::io_context &) const;
+    unspecified async_write_some(const ConstBufferSequence &, WriteHandler &&);
+  const handle_type & sink() const;
+  const handle_type & source() const;
+  handle_type && sink();
+  handle_type && source();
+  handle_type source(::boost::asio::io_context &);
+  handle_type sink(::boost::asio::io_context &);
+  handle_type source(::boost::asio::io_context &) const;
+  handle_type sink(::boost::asio::io_context &) const;
 };

    Description

    @@ -133,7 +133,7 @@ construct/copy/destruct
    1. -
      async_pipe(boost::asio::io_context & ios);
      +
      async_pipe(boost::asio::io_context & ios);

      Construct a new async_pipe, does automatically open the pipe. Initializes source and sink with the same io_context.

      @@ -146,7 +146,7 @@

    2. -
      async_pipe(boost::asio::io_context & ios_source, 
+
      async_pipe(boost::asio::io_context & ios_source, 
            boost::asio::io_context & ios_sink);
      
 
      Construct a new async_pipe, does automatically open the pipe.
      3. @@ -160,7 +160,7 @@

    3. -
      async_pipe(boost::asio::io_context & ios, const std::string & name);
      +
      async_pipe(boost::asio::io_context & ios, const std::string & name);

      Construct a new async_pipe, does automatically open. Initializes source and sink with the same io_context.

      4. @@ -173,7 +173,7 @@

    4. -
      async_pipe(boost::asio::io_context & ios_source, 
+
      async_pipe(boost::asio::io_context & ios_source, 
            boost::asio::io_context & ios_sink, const std::string & name);
      
 
      Construct a new async_pipe, does automatically open.
      5. @@ -187,7 +187,7 @@

    5. -
      async_pipe(const async_pipe & lhs);
      +
      async_pipe(const async_pipe & lhs);

      Copy-Constructor of the async pipe.

      6. @@ -200,12 +200,12 @@

    6. -
      async_pipe(async_pipe && lhs);
      +
      async_pipe(async_pipe && lhs);

      Move-Constructor of the async pipe. 

    7. template<typename CharT, typename Traits = std::char_traits<CharT> > 
-  explicit async_pipe(boost::asio::io_context & ios, 
+  explicit async_pipe(boost::asio::io_context & ios, 
                       const basic_pipe< CharT, Traits > & p);

      Construct the async-pipe from a pipe.

      8. @@ -220,7 +220,7 @@ 
    8. template<typename CharT, typename Traits = std::char_traits<CharT> > 
-  explicit async_pipe(boost::asio::io_context & ios_source, 
+  explicit async_pipe(boost::asio::io_context & ios_source, 
                       boost::asio::io_context & ios_sink, 
                       const basic_pipe< CharT, Traits > & p);

      Construct the async-pipe from a pipe, with two different io_context objects.

      @@ -236,7 +236,7 @@ 
    9. template<typename CharT, typename Traits = std::char_traits<CharT> > 
-  async_pipe & operator=(const basic_pipe< CharT, Traits > & p);
      + async_pipe & operator=(const basic_pipe< CharT, Traits > & p);

      Assign a basic_pipe.

      10. @@ -249,7 +249,7 @@

    10. -
      async_pipe & operator=(const async_pipe & lhs);
      +
      async_pipe & operator=(const async_pipe & lhs);

      Copy Assign a pipe.

      11. @@ -262,42 +262,42 @@

    11. -
      async_pipe & operator=(async_pipe && lhs);
      +
      async_pipe & operator=(async_pipe && lhs);

      Move assign a pipe

    12. -
      ~async_pipe();
      +
      ~async_pipe();

      Destructor. Closes the pipe handles.

      13. -async_pipe public member functions

      +async_pipe public member functions 
      1. template<typename CharT, typename Traits = std::char_traits<CharT> > 
-  explicit operator basic_pipe< CharT, Traits >() const;
        + explicit operator basic_pipe< CharT, Traits >() const;

        Explicit cast to basic_pipe.

      2. -
        void cancel();
        +
        void cancel();

        Cancel the current asynchronous operations.

      3. -
        void close();
        +
        void close();

        Close the pipe handles.

      4. -
        void close(std::error_code & ec);
        +
        void close(std::error_code & ec);

        Close the pipe handles. While passing an error_code

      5. -
        bool is_open() const;
        +
        bool is_open() const;

        Check if the pipes are open.

      6. -
        void async_close();
        +
        void async_close();

        Async close, i.e. close after current operation is completed.

      @@ -311,48 +311,48 @@ 
    13. template<typename MutableBufferSequence> 
-  std::size_t read_some(const MutableBufferSequence & buffers);
      + std::size_t read_some(const MutableBufferSequence & buffers);

      Read some data from the handle.

      See the boost.asio documentation for more details. 

    14. template<typename MutableBufferSequence> 
-  std::size_t write_some(const MutableBufferSequence & buffers);
      + std::size_t write_some(const MutableBufferSequence & buffers);

      Write some data to the handle.

      See the boost.asio documentation for more details.

    15. -
      native_handle native_source() const;
      +
      native_handle native_source() const;

      Get the native handle of the source.

    16. -
      native_handle native_sink() const;
      +
      native_handle native_sink() const;

      Get the native handle of the sink. 

    17. template<typename MutableBufferSequence, typename ReadHandler> 
-  unspecified async_read_some(const MutableBufferSequence & buffers, 
+  unspecified async_read_some(const MutableBufferSequence & buffers, 
                               ReadHandler && handler);

      Start an asynchronous read.

      See the boost.asio documentation for more details. 

    18. template<typename ConstBufferSequence, typename WriteHandler> 
-  unspecified async_write_some(const ConstBufferSequence & buffers, 
+  unspecified async_write_some(const ConstBufferSequence & buffers, 
                                WriteHandler && handler);

      Start an asynchronous write.

      See the boost.asio documentation for more details.

    19. -
      const handle_type & sink() const;
      Get the asio handle of the pipe sink.
      20. +
      const handle_type & sink() const;
      Get the asio handle of the pipe sink.
    20. -
      const handle_type & source() const;
      Get the asio handle of the pipe source.
      21. +
      const handle_type & source() const;
      Get the asio handle of the pipe source.
    21. -
      handle_type && sink();
      Get the asio handle of the pipe sink. Qualified as rvalue.
      22. +
      handle_type && sink();
      Get the asio handle of the pipe sink. Qualified as rvalue.
    22. -
      handle_type && source();
      Get the asio handle of the pipe source. Qualified as rvalue.
      23. +
      handle_type && source();
      Get the asio handle of the pipe source. Qualified as rvalue.
    23. -
      handle_type source(::boost::asio::io_context & ios);
      Move the source out of this class and change the io_context. Qualified as rvalue.
      24. +
      handle_type source(::boost::asio::io_context & ios);
      Move the source out of this class and change the io_context. Qualified as rvalue.
      @@ -363,7 +363,7 @@

    24. -
      handle_type sink(::boost::asio::io_context & ios);
      Move the sink out of this class and change the io_context. Qualified as rvalue.
      25. [Note] Note
      +
      handle_type sink(::boost::asio::io_context & ios);
      Move the sink out of this class and change the io_context. Qualified as rvalue.
      @@ -374,7 +374,7 @@

    25. -
      handle_type source(::boost::asio::io_context & ios) const;
      Copy the source out of this class and change the io_context.
      26. [Note] Note
      +
      handle_type source(::boost::asio::io_context & ios) const;
      Copy the source out of this class and change the io_context.
      @@ -385,7 +385,7 @@

    26. -
      handle_type sink(::boost::asio::io_context & ios) const;
      Copy the sink out of this class and change the io_context.
      27. [Note] Note
      +
      handle_type sink(::boost::asio::io_context & ios) const;
      Copy the sink out of this class and change the io_context.
      diff --git a/doc/html/boost/process/basic_environment.html b/doc/html/boost/process/basic_environment.html index 54f1f95a44..c6ab432174 100644 --- a/doc/html/boost/process/basic_environment.html +++ b/doc/html/boost/process/basic_environment.html @@ -54,12 +54,12 @@ typedefEnvironmentenvironment_t;// construct/copy/destruct - const_entry&operator=(constconst_entry&)=default; + const_entry&operator=(constconst_entry&)=default; - // public member functions - std::vector<string_type>to_vector()const; - const_entry(constconst_entry&)=default; - boolempty()const; + // public member functions + std::vector<string_type>to_vector()const; + const_entry(constconst_entry&)=default; + boolempty()const;};template<typename Char,typename Environment>structentry_type{ @@ -71,47 +71,47 @@ typedefEnvironmentenvironment_t;// construct/copy/destruct - entry&operator=(constentry&)=default; - entry&operator=(conststring_type&); - entry&operator=(conststd::vector<string_type>&); + entry&operator=(constentry&)=default; + entry&operator=(conststring_type&); + entry&operator=(conststd::vector<string_type>&); - // public member functions - std::vector<string_type>to_vector()const; - entry(constentry&)=default; - boolempty()const; - voidassign(conststring_type&); - voidassign(conststd::vector<string_type>&); - voidappend(conststring_type&); - voidclear(); - entry&operator+=(conststring_type&); + // public member functions + std::vector<string_type>to_vector()const; + entry(constentry&)=default; + boolempty()const; + voidassign(conststring_type&); + voidassign(conststd::vector<string_type>&); + voidappend(conststring_type&); + voidclear(); + entry&operator+=(conststring_type&);};// construct/copy/destruct - basic_environment(); - basic_environment(constbasic_environment&); - basic_environment(basic_environment&&); - basic_environment&operator=(constbasic_environment&); - basic_environment&operator=(basic_environment&&); + basic_environment(); + basic_environment(constbasic_environment&); + basic_environment(basic_environment&&); + basic_environment&operator=(constbasic_environment&); + basic_environment&operator=(basic_environment&&); - // public member functions - iteratorbegin(); - const_iteratorbegin()const; - const_iteratorcbegin()const; - iteratorend(); - const_iteratorend()const; - const_iteratorcend()const; - iteratorfind(conststring_type&); - const_iteratorfind(conststring_type&)const; - std::size_tcount(conststring_type&)const; - voiderase(conststring_type&); + // public member functions + iteratorbegin(); + const_iteratorbegin()const; + const_iteratorcbegin()const; + iteratorend(); + const_iteratorend()const; + const_iteratorcend()const; + iteratorfind(conststring_type&); + const_iteratorfind(conststring_type&)const; + std::size_tcount(conststring_type&)const; + voiderase(conststring_type&);std::pair<iterator,bool> - emplace(conststring_type&,conststring_type&); - boolempty(); - std::size_tsize()const; - voidclear(); - entry_typeat(conststring_type&); - const_entry_typeat(conststring_type&)const; - entry_typeoperator[](conststring_type&); + emplace(conststring_type&,conststring_type&); + boolempty(); + std::size_tsize()const; + voidclear(); + entry_typeat(conststring_type&); + const_entry_typeat(conststring_type&)const; + entry_typeoperator[](conststring_type&);};

      Description

      @@ -123,52 +123,52 @@ construct/copy/destruct
      1. -
        basic_environment();
        Default constructor.
        2. +
        basic_environment();
        Default constructor.
      2. -
        basic_environment(const basic_environment &);
        Copy constructor.
        3. +
        basic_environment(const basic_environment &);
        Copy constructor.
      3. -
        basic_environment(basic_environment &&);
        Move constructor.
        4. +
        basic_environment(basic_environment &&);
        Move constructor.
      4. -
        basic_environment & operator=(const basic_environment &);
        Copy assignment.
        5. +
        basic_environment & operator=(const basic_environment &);
        Copy assignment.
      5. -
        basic_environment & operator=(basic_environment &&);
        Move assignment.
        6. +
        basic_environment & operator=(basic_environment &&);
        Move assignment.

      -basic_environment public member functions

      +basic_environment public member functions
      1. -
        iterator begin();
        Returns an iterator to the beginning.
        2. +
        iterator begin();
        Returns an iterator to the beginning.
      2. -
        const_iterator begin() const;
        Returns an iterator to the beginning.
        3. +
        const_iterator begin() const;
        Returns an iterator to the beginning.
      3. -
        const_iterator cbegin() const;
        Returns an iterator to the beginning.
        4. +
        const_iterator cbegin() const;
        Returns an iterator to the beginning.
      4. -
        iterator end();
        Returns an iterator to the end.
        5. +
        iterator end();
        Returns an iterator to the end.
      5. -
        const_iterator end() const;
        Returns an iterator to the end.
        6. +
        const_iterator end() const;
        Returns an iterator to the end.
      6. -
        const_iterator cend() const;
        Returns an iterator to the end.
        7. +
        const_iterator cend() const;
        Returns an iterator to the end.
      7. -
        iterator find(const string_type & key);
        Find a variable by its name.
        8. +
        iterator find(const string_type & key);
        Find a variable by its name.
      8. -
        const_iterator find(const string_type & key) const;
        Find a variable by its name.
        9. +
        const_iterator find(const string_type & key) const;
        Find a variable by its name.
      9. -
        std::size_t count(const string_type & st) const;
        Number of variables.
        10. +
        std::size_t count(const string_type & st) const;
        Number of variables.
      10. -
        void erase(const string_type & id);
        +
        void erase(const string_type & id);

        Erase variable by id. 

      11. std::pair< iterator, bool > 
-emplace(const string_type & id, const string_type & value);
        Emplace an environment variable.
        12. +emplace(const string_type & id, const string_type & value);Emplace an environment variable.
      12. -
        bool empty();
        Check if environment has entries.
        13. +
        bool empty();
        Check if environment has entries.
      13. -
        std::size_t size() const;
        Get the number of variables.
        14. +
        std::size_t size() const;
        Get the number of variables.
      14. -
        void clear();
        Clear the environment.
      [Note] Note
      +
      void clear();
      Clear the environment.
      @@ -179,11 +179,11 @@

    27. -
      entry_type at(const string_type & key);
      Get the entry with the key. Throws if it does not exist.
      28. +
      entry_type at(const string_type & key);
      Get the entry with the key. Throws if it does not exist.
    28. -
      const_entry_type at(const string_type & key) const;
      Get the entry with the key. Throws if it does not exist.
      29. +
      const_entry_type at(const string_type & key) const;
      Get the entry with the key. Throws if it does not exist.
    29. -
      entry_type operator[](const string_type & key);
      Get the entry with the given key. It creates the entry if it doesn't exist.
      30. +
      entry_type operator[](const string_type & key);
      Get the entry with the given key. It creates the entry if it doesn't exist. diff --git a/doc/html/boost/process/basic_environment/const_entry_type.html b/doc/html/boost/process/basic_environment/const_entry_type.html index 989fb540dd..3c4610a834 100644 --- a/doc/html/boost/process/basic_environment/const_entry_type.html +++ b/doc/html/boost/process/basic_environment/const_entry_type.html @@ -43,12 +43,12 @@ typedefEnvironmentenvironment_t;// construct/copy/destruct - const_entry&operator=(constconst_entry&)=default; + const_entry&operator=(constconst_entry&)=default; - // public member functions - std::vector<string_type>to_vector()const; - const_entry(constconst_entry&)=default; - boolempty()const; + // public member functions + std::vector<string_type>to_vector()const; + const_entry(constconst_entry&)=default; + boolempty()const;};

      Description

      @@ -68,19 +68,19 @@ public construct/copy/destruct
      1. -
        const_entry & operator=(const const_entry &) = default;
        Move Constructor.
      +
      const_entry & operator=(const const_entry &) = default;
      Move Constructor.

      -const_entry_type public member functions

      +const_entry_type public member functions
      1. -
        std::vector< string_type > to_vector() const;
        Split the entry by ";" or ":" and return it as a vector. Used by PATH.

        Get the value as string. Get the name of this entry.

        +
        std::vector< string_type > to_vector() const;
        Split the entry by ";" or ":" and return it as a vector. Used by PATH.

        Get the value as string. Get the name of this entry.

      2. -
         const_entry(const const_entry &) = default;
        Copy Constructor.
        3. +
         const_entry(const const_entry &) = default;
        Copy Constructor.
      3. -
        bool empty() const;
        Check if the entry is empty.
        4. +
        bool empty() const;
        Check if the entry is empty.
      diff --git a/doc/html/boost/process/basic_environment/entry_type.html b/doc/html/boost/process/basic_environment/entry_type.html index f0eb5c7d8d..981e9c643f 100644 --- a/doc/html/boost/process/basic_environment/entry_type.html +++ b/doc/html/boost/process/basic_environment/entry_type.html @@ -43,19 +43,19 @@ typedefEnvironmentenvironment_t;// construct/copy/destruct - entry&operator=(constentry&)=default; - entry&operator=(conststring_type&); - entry&operator=(conststd::vector<string_type>&); + entry&operator=(constentry&)=default; + entry&operator=(conststring_type&); + entry&operator=(conststd::vector<string_type>&); - // public member functions - std::vector<string_type>to_vector()const; - entry(constentry&)=default; - boolempty()const; - voidassign(conststring_type&); - voidassign(conststd::vector<string_type>&); - voidappend(conststring_type&); - voidclear(); - entry&operator+=(conststring_type&); + // public member functions + std::vector<string_type>to_vector()const; + entry(constentry&)=default; + boolempty()const; + voidassign(conststring_type&); + voidassign(conststd::vector<string_type>&); + voidappend(conststring_type&); + voidclear(); + entry&operator+=(conststring_type&);};

      Description

      @@ -76,34 +76,34 @@ construct/copy/destruct
      1. -
        entry & operator=(const entry &) = default;
        Move Constructor.
        2. +
        entry & operator=(const entry &) = default;
        Move Constructor.
      2. -
        entry & operator=(const string_type & value);
        Assign a string to the entry.
        3. +
        entry & operator=(const string_type & value);
        Assign a string to the entry.
      3. -
        entry & operator=(const std::vector< string_type > & value);
        Assign a set of strings to the entry; they will be separated by ';' or ':'.
        4. +
        entry & operator=(const std::vector< string_type > & value);
        Assign a set of strings to the entry; they will be separated by ';' or ':'.

      -entry_type public member functions

      +entry_type public member functions
      1. -
        std::vector< string_type > to_vector() const;
        Split the entry by ";" or ":" and return it as a vector. Used by PATH.

        Get the value as string. Get the name of this entry.

        +
        std::vector< string_type > to_vector() const;
        Split the entry by ";" or ":" and return it as a vector. Used by PATH.

        Get the value as string. Get the name of this entry.

      2. -
         entry(const entry &) = default;
        Copy Constructor.
        3. +
         entry(const entry &) = default;
        Copy Constructor.
      3. -
        bool empty() const;
        Check if the entry is empty.
        4. +
        bool empty() const;
        Check if the entry is empty.
      4. -
        void assign(const string_type & value);
        Assign a string to the value.
        5. +
        void assign(const string_type & value);
        Assign a string to the value.
      5. -
        void assign(const std::vector< string_type > & value);
        Assign a set of strings to the entry; they will be separated by ';' or ':'.
        6. +
        void assign(const std::vector< string_type > & value);
        Assign a set of strings to the entry; they will be separated by ';' or ':'.
      6. -
        void append(const string_type & value);
        Append a string to the end of the entry, it will separated by ';' or ':'.
        7. +
        void append(const string_type & value);
        Append a string to the end of the entry, it will separated by ';' or ':'.
      7. -
        void clear();
        Reset the value.
        8. +
        void clear();
        Reset the value.
      8. -
        entry & operator+=(const string_type & value);
        Append a string to the end of the entry, it will separated by ';' or ':'.
        9. +
        entry & operator+=(const string_type & value);
        Append a string to the end of the entry, it will separated by ';' or ':'.
      diff --git a/doc/html/boost/process/basic_ipstream.html b/doc/html/boost/process/basic_ipstream.html index 684411568a..be39e8e210 100644 --- a/doc/html/boost/process/basic_ipstream.html +++ b/doc/html/boost/process/basic_ipstream.html @@ -44,23 +44,23 @@ typedefTraits::off_typeoff_type;// construct/copy/destruct - basic_ipstream(); - basic_ipstream(constbasic_ipstream&)=delete; - basic_ipstream(basic_ipstream&&)=default; - basic_ipstream(pipe_type&&); - basic_ipstream(constpipe_type&); - basic_ipstream&operator=(constbasic_ipstream&)=delete; - basic_ipstream&operator=(basic_ipstream&&)=default; - basic_ipstream&operator=(pipe_type&&); - basic_ipstream&operator=(constpipe_type&); + basic_ipstream(); + basic_ipstream(constbasic_ipstream&)=delete; + basic_ipstream(basic_ipstream&&)=default; + basic_ipstream(pipe_type&&); + basic_ipstream(constpipe_type&); + basic_ipstream&operator=(constbasic_ipstream&)=delete; + basic_ipstream&operator=(basic_ipstream&&)=default; + basic_ipstream&operator=(pipe_type&&); + basic_ipstream&operator=(constpipe_type&); - // public member functions - basic_pipebuf<CharT,Traits>*rdbuf(); - voidpipe(pipe_type&&); - voidpipe(constpipe_type&); - pipe_type&pipe(); - constpipe_type&pipe()const; - pipe_type&&pipe(); + // public member functions + basic_pipebuf<CharT,Traits>*rdbuf(); + voidpipe(pipe_type&&); + voidpipe(constpipe_type&); + pipe_type&pipe(); + constpipe_type&pipe()const; + pipe_type&&pipe();};

      Description

      @@ -72,41 +72,41 @@ construct/copy/destruct
      1. -
        basic_ipstream();
        Default constructor.
        2. +
        basic_ipstream();
        Default constructor.
      2. -
        basic_ipstream(const basic_ipstream &) = delete;
        Copy constructor.
        3. +
        basic_ipstream(const basic_ipstream &) = delete;
        Copy constructor.
      3. -
        basic_ipstream(basic_ipstream &&) = default;
        Move constructor.
        4. +
        basic_ipstream(basic_ipstream &&) = default;
        Move constructor.
      4. -
        basic_ipstream(pipe_type && p);
        Move construct from a pipe.
        5. +
        basic_ipstream(pipe_type && p);
        Move construct from a pipe.
      5. -
        basic_ipstream(const pipe_type & p);
        Copy construct from a pipe.
        6. +
        basic_ipstream(const pipe_type & p);
        Copy construct from a pipe.
      6. -
        basic_ipstream & operator=(const basic_ipstream &) = delete;
        Copy assignment.
        7. +
        basic_ipstream & operator=(const basic_ipstream &) = delete;
        Copy assignment.
      7. -
        basic_ipstream & operator=(basic_ipstream &&) = default;
        Move assignment.
        8. +
        basic_ipstream & operator=(basic_ipstream &&) = default;
        Move assignment.
      8. -
        basic_ipstream & operator=(pipe_type && p);
        Move assignment of a pipe.
        9. +
        basic_ipstream & operator=(pipe_type && p);
        Move assignment of a pipe.
      9. -
        basic_ipstream & operator=(const pipe_type & p);
        Copy assignment of a pipe.
        10. +
        basic_ipstream & operator=(const pipe_type & p);
        Copy assignment of a pipe.

      -basic_ipstream public member functions

      +basic_ipstream public member functions
      1. -
        basic_pipebuf< CharT, Traits > * rdbuf();
        Get access to the underlying stream_buf.
        2. +
        basic_pipebuf< CharT, Traits > * rdbuf();
        Get access to the underlying stream_buf.
      2. -
        void pipe(pipe_type && p);
        Set the pipe of the streambuf.
        3. +
        void pipe(pipe_type && p);
        Set the pipe of the streambuf.
      3. -
        void pipe(const pipe_type & p);
        Set the pipe of the streambuf.
        4. +
        void pipe(const pipe_type & p);
        Set the pipe of the streambuf.
      4. -
        pipe_type & pipe();
        Get a reference to the pipe.
        5. +
        pipe_type & pipe();
        Get a reference to the pipe.
      5. -
        const pipe_type & pipe() const;
        Get a const reference to the pipe.
        6. +
        const pipe_type & pipe() const;
        Get a const reference to the pipe.
      6. -
        pipe_type && pipe();
        Get a rvalue reference to the pipe. Qualified as rvalue.
        7. +
        pipe_type && pipe();
        Get a rvalue reference to the pipe. Qualified as rvalue.
      diff --git a/doc/html/boost/process/basic_native_environment.html b/doc/html/boost/process/basic_native_environment.html index ce6f7ff04e..f816fb995a 100644 --- a/doc/html/boost/process/basic_native_environment.html +++ b/doc/html/boost/process/basic_native_environment.html @@ -54,12 +54,12 @@ typedefEnvironmentenvironment_t;// construct/copy/destruct - const_entry&operator=(constconst_entry&)=default; + const_entry&operator=(constconst_entry&)=default; - // public member functions - std::vector<string_type>to_vector()const; - const_entry(constconst_entry&)=default; - boolempty()const; + // public member functions + std::vector<string_type>to_vector()const; + const_entry(constconst_entry&)=default; + boolempty()const;};template<typename Char,typename Environment>structentry_type{ @@ -71,44 +71,44 @@ typedefEnvironmentenvironment_t;// construct/copy/destruct - entry&operator=(constentry&)=default; - entry&operator=(conststring_type&); - entry&operator=(conststd::vector<string_type>&); + entry&operator=(constentry&)=default; + entry&operator=(conststring_type&); + entry&operator=(conststd::vector<string_type>&); - // public member functions - std::vector<string_type>to_vector()const; - entry(constentry&)=default; - boolempty()const; - voidassign(conststring_type&); - voidassign(conststd::vector<string_type>&); - voidappend(conststring_type&); - voidclear(); - entry&operator+=(conststring_type&); + // public member functions + std::vector<string_type>to_vector()const; + entry(constentry&)=default; + boolempty()const; + voidassign(conststring_type&); + voidassign(conststd::vector<string_type>&); + voidappend(conststring_type&); + voidclear(); + entry&operator+=(conststring_type&);};// construct/copy/destruct - basic_native_environment(); - basic_native_environment(basic_native_environment&&); - basic_native_environment&operator=(basic_native_environment&&); + basic_native_environment(); + basic_native_environment(basic_native_environment&&); + basic_native_environment&operator=(basic_native_environment&&); - // public member functions - iteratorbegin(); - const_iteratorbegin()const; - const_iteratorcbegin()const; - iteratorend(); - const_iteratorend()const; - const_iteratorcend()const; - iteratorfind(conststring_type&); - const_iteratorfind(conststring_type&)const; - std::size_tcount(conststring_type&)const; - voiderase(conststring_type&); + // public member functions + iteratorbegin(); + const_iteratorbegin()const; + const_iteratorcbegin()const; + iteratorend(); + const_iteratorend()const; + const_iteratorcend()const; + iteratorfind(conststring_type&); + const_iteratorfind(conststring_type&)const; + std::size_tcount(conststring_type&)const; + voiderase(conststring_type&);std::pair<iterator,bool> - emplace(conststring_type&,conststring_type&); - boolempty(); - std::size_tsize()const; - entry_typeat(conststring_type&); - const_entry_typeat(conststring_type&)const; - entry_typeoperator[](conststring_type&); + emplace(conststring_type&,conststring_type&); + boolempty(); + std::size_tsize()const; + entry_typeat(conststring_type&); + const_entry_typeat(conststring_type&)const; + entry_typeoperator[](conststring_type&);};

      Description

      @@ -120,52 +120,52 @@ construct/copy/destruct
      1. -
        basic_native_environment();
        Default constructor.
        2. +
        basic_native_environment();
        Default constructor.
      2. -
        basic_native_environment(basic_native_environment &&);
        Move constructor.
        3. +
        basic_native_environment(basic_native_environment &&);
        Move constructor.
      3. -
        basic_native_environment & operator=(basic_native_environment &&);
        Move assignment.
        4. +
        basic_native_environment & operator=(basic_native_environment &&);
        Move assignment.

      -basic_native_environment public member functions

      +basic_native_environment public member functions
      1. -
        iterator begin();
        Returns an iterator to the beginning.
        2. +
        iterator begin();
        Returns an iterator to the beginning.
      2. -
        const_iterator begin() const;
        Returns an iterator to the beginning.
        3. +
        const_iterator begin() const;
        Returns an iterator to the beginning.
      3. -
        const_iterator cbegin() const;
        Returns an iterator to the beginning.
        4. +
        const_iterator cbegin() const;
        Returns an iterator to the beginning.
      4. -
        iterator end();
        Returns an iterator to the end.
        5. +
        iterator end();
        Returns an iterator to the end.
      5. -
        const_iterator end() const;
        Returns an iterator to the end.
        6. +
        const_iterator end() const;
        Returns an iterator to the end.
      6. -
        const_iterator cend() const;
        Returns an iterator to the end.
        7. +
        const_iterator cend() const;
        Returns an iterator to the end.
      7. -
        iterator find(const string_type & key);
        Find a variable by its name.
        8. +
        iterator find(const string_type & key);
        Find a variable by its name.
      8. -
        const_iterator find(const string_type & key) const;
        Find a variable by its name.
        9. +
        const_iterator find(const string_type & key) const;
        Find a variable by its name.
      9. -
        std::size_t count(const string_type & st) const;
        Number of variables.
        10. +
        std::size_t count(const string_type & st) const;
        Number of variables.
      10. -
        void erase(const string_type & id);
        +
        void erase(const string_type & id);

        Erase variable by id. 

      11. std::pair< iterator, bool > 
-emplace(const string_type & id, const string_type & value);
        Emplace an environment variable.
        12. +emplace(const string_type & id, const string_type & value);Emplace an environment variable.
      12. -
        bool empty();
        Check if environment has entries.
        13. +
        bool empty();
        Check if environment has entries.
      13. -
        std::size_t size() const;
        Get the number of variables.
        14. +
        std::size_t size() const;
        Get the number of variables.
      14. -
        entry_type at(const string_type & key);
        Get the entry with the key. Throws if it does not exist.
        15. +
        entry_type at(const string_type & key);
        Get the entry with the key. Throws if it does not exist.
      15. -
        const_entry_type at(const string_type & key) const;
        Get the entry with the key. Throws if it does not exist.
        16. +
        const_entry_type at(const string_type & key) const;
        Get the entry with the key. Throws if it does not exist.
      16. -
        entry_type operator[](const string_type & key);
        Get the entry with the given key. It creates the entry if it doesn't exist.
        17. +
        entry_type operator[](const string_type & key);
        Get the entry with the given key. It creates the entry if it doesn't exist.
      diff --git a/doc/html/boost/process/basic_native_environment/const_entry_type.html b/doc/html/boost/process/basic_native_environment/const_entry_type.html index 38ee4465d5..4802299556 100644 --- a/doc/html/boost/process/basic_native_environment/const_entry_type.html +++ b/doc/html/boost/process/basic_native_environment/const_entry_type.html @@ -43,12 +43,12 @@ typedefEnvironmentenvironment_t;// construct/copy/destruct - const_entry&operator=(constconst_entry&)=default; + const_entry&operator=(constconst_entry&)=default; - // public member functions - std::vector<string_type>to_vector()const; - const_entry(constconst_entry&)=default; - boolempty()const; + // public member functions + std::vector<string_type>to_vector()const; + const_entry(constconst_entry&)=default; + boolempty()const;};

      Description

      @@ -68,19 +68,19 @@ public construct/copy/destruct
      1. -
        const_entry & operator=(const const_entry &) = default;
        Move Constructor.
      +
      const_entry & operator=(const const_entry &) = default;
      Move Constructor.

      -const_entry_type public member functions

      +const_entry_type public member functions
      1. -
        std::vector< string_type > to_vector() const;
        Split the entry by ";" or ":" and return it as a vector. Used by PATH.

        Get the value as string. Get the name of this entry.

        +
        std::vector< string_type > to_vector() const;
        Split the entry by ";" or ":" and return it as a vector. Used by PATH.

        Get the value as string. Get the name of this entry.

      2. -
         const_entry(const const_entry &) = default;
        Copy Constructor.
        3. +
         const_entry(const const_entry &) = default;
        Copy Constructor.
      3. -
        bool empty() const;
        Check if the entry is empty.
        4. +
        bool empty() const;
        Check if the entry is empty.
      diff --git a/doc/html/boost/process/basic_native_environment/entry_type.html b/doc/html/boost/process/basic_native_environment/entry_type.html index d1c19afc74..6899f3dca2 100644 --- a/doc/html/boost/process/basic_native_environment/entry_type.html +++ b/doc/html/boost/process/basic_native_environment/entry_type.html @@ -43,19 +43,19 @@ typedefEnvironmentenvironment_t;// construct/copy/destruct - entry&operator=(constentry&)=default; - entry&operator=(conststring_type&); - entry&operator=(conststd::vector<string_type>&); + entry&operator=(constentry&)=default; + entry&operator=(conststring_type&); + entry&operator=(conststd::vector<string_type>&); - // public member functions - std::vector<string_type>to_vector()const; - entry(constentry&)=default; - boolempty()const; - voidassign(conststring_type&); - voidassign(conststd::vector<string_type>&); - voidappend(conststring_type&); - voidclear(); - entry&operator+=(conststring_type&); + // public member functions + std::vector<string_type>to_vector()const; + entry(constentry&)=default; + boolempty()const; + voidassign(conststring_type&); + voidassign(conststd::vector<string_type>&); + voidappend(conststring_type&); + voidclear(); + entry&operator+=(conststring_type&);};

      Description

      @@ -76,34 +76,34 @@ construct/copy/destruct
      1. -
        entry & operator=(const entry &) = default;
        Move Constructor.
        2. +
        entry & operator=(const entry &) = default;
        Move Constructor.
      2. -
        entry & operator=(const string_type & value);
        Assign a string to the entry.
        3. +
        entry & operator=(const string_type & value);
        Assign a string to the entry.
      3. -
        entry & operator=(const std::vector< string_type > & value);
        Assign a set of strings to the entry; they will be separated by ';' or ':'.
        4. +
        entry & operator=(const std::vector< string_type > & value);
        Assign a set of strings to the entry; they will be separated by ';' or ':'.

      -entry_type public member functions

      +entry_type public member functions
      1. -
        std::vector< string_type > to_vector() const;
        Split the entry by ";" or ":" and return it as a vector. Used by PATH.

        Get the value as string. Get the name of this entry.

        +
        std::vector< string_type > to_vector() const;
        Split the entry by ";" or ":" and return it as a vector. Used by PATH.

        Get the value as string. Get the name of this entry.

      2. -
         entry(const entry &) = default;
        Copy Constructor.
        3. +
         entry(const entry &) = default;
        Copy Constructor.
      3. -
        bool empty() const;
        Check if the entry is empty.
        4. +
        bool empty() const;
        Check if the entry is empty.
      4. -
        void assign(const string_type & value);
        Assign a string to the value.
        5. +
        void assign(const string_type & value);
        Assign a string to the value.
      5. -
        void assign(const std::vector< string_type > & value);
        Assign a set of strings to the entry; they will be separated by ';' or ':'.
        6. +
        void assign(const std::vector< string_type > & value);
        Assign a set of strings to the entry; they will be separated by ';' or ':'.
      6. -
        void append(const string_type & value);
        Append a string to the end of the entry, it will separated by ';' or ':'.
        7. +
        void append(const string_type & value);
        Append a string to the end of the entry, it will separated by ';' or ':'.
      7. -
        void clear();
        Reset the value.
        8. +
        void clear();
        Reset the value.
      8. -
        entry & operator+=(const string_type & value);
        Append a string to the end of the entry, it will separated by ';' or ':'.
        9. +
        entry & operator+=(const string_type & value);
        Append a string to the end of the entry, it will separated by ';' or ':'.
      diff --git a/doc/html/boost/process/basic_opstream.html b/doc/html/boost/process/basic_opstream.html index a66974a28a..32f3b2210e 100644 --- a/doc/html/boost/process/basic_opstream.html +++ b/doc/html/boost/process/basic_opstream.html @@ -44,23 +44,23 @@ typedefTraits::off_typeoff_type;// construct/copy/destruct - basic_opstream(); - basic_opstream(constbasic_opstream&)=delete; - basic_opstream(basic_opstream&&)=default; - basic_opstream(pipe_type&&); - basic_opstream(constpipe_type&); - basic_opstream&operator=(constbasic_opstream&)=delete; - basic_opstream&operator=(basic_opstream&&)=default; - basic_opstream&operator=(pipe_type&&); - basic_opstream&operator=(constpipe_type&); + basic_opstream(); + basic_opstream(constbasic_opstream&)=delete; + basic_opstream(basic_opstream&&)=default; + basic_opstream(pipe_type&&); + basic_opstream(constpipe_type&); + basic_opstream&operator=(constbasic_opstream&)=delete; + basic_opstream&operator=(basic_opstream&&)=default; + basic_opstream&operator=(pipe_type&&); + basic_opstream&operator=(constpipe_type&); - // public member functions - basic_pipebuf<CharT,Traits>*rdbuf()const; - voidpipe(pipe_type&&); - voidpipe(constpipe_type&); - pipe_type&pipe(); - constpipe_type&pipe()const; - pipe_type&&pipe(); + // public member functions + basic_pipebuf<CharT,Traits>*rdbuf()const; + voidpipe(pipe_type&&); + voidpipe(constpipe_type&); + pipe_type&pipe(); + constpipe_type&pipe()const; + pipe_type&&pipe();};

      Description

      @@ -72,41 +72,41 @@ construct/copy/destruct
      1. -
        basic_opstream();
        Default constructor.
        2. +
        basic_opstream();
        Default constructor.
      2. -
        basic_opstream(const basic_opstream &) = delete;
        Copy constructor.
        3. +
        basic_opstream(const basic_opstream &) = delete;
        Copy constructor.
      3. -
        basic_opstream(basic_opstream &&) = default;
        Move constructor.
        4. +
        basic_opstream(basic_opstream &&) = default;
        Move constructor.
      4. -
        basic_opstream(pipe_type && p);
        Move construct from a pipe.
        5. +
        basic_opstream(pipe_type && p);
        Move construct from a pipe.
      5. -
        basic_opstream(const pipe_type & p);
        Copy construct from a pipe.
        6. +
        basic_opstream(const pipe_type & p);
        Copy construct from a pipe.
      6. -
        basic_opstream & operator=(const basic_opstream &) = delete;
        Copy assignment.
        7. +
        basic_opstream & operator=(const basic_opstream &) = delete;
        Copy assignment.
      7. -
        basic_opstream & operator=(basic_opstream &&) = default;
        Move assignment.
        8. +
        basic_opstream & operator=(basic_opstream &&) = default;
        Move assignment.
      8. -
        basic_opstream & operator=(pipe_type && p);
        Move assignment of a pipe.
        9. +
        basic_opstream & operator=(pipe_type && p);
        Move assignment of a pipe.
      9. -
        basic_opstream & operator=(const pipe_type & p);
        Copy assignment of a pipe.
        10. +
        basic_opstream & operator=(const pipe_type & p);
        Copy assignment of a pipe.

      -basic_opstream public member functions

      +basic_opstream public member functions
      1. -
        basic_pipebuf< CharT, Traits > * rdbuf() const;
        Get access to the underlying stream_buf.
        2. +
        basic_pipebuf< CharT, Traits > * rdbuf() const;
        Get access to the underlying stream_buf.
      2. -
        void pipe(pipe_type && p);
        Set the pipe of the streambuf.
        3. +
        void pipe(pipe_type && p);
        Set the pipe of the streambuf.
      3. -
        void pipe(const pipe_type & p);
        Set the pipe of the streambuf.
        4. +
        void pipe(const pipe_type & p);
        Set the pipe of the streambuf.
      4. -
        pipe_type & pipe();
        Get a reference to the pipe.
        5. +
        pipe_type & pipe();
        Get a reference to the pipe.
      5. -
        const pipe_type & pipe() const;
        Get a const reference to the pipe.
        6. +
        const pipe_type & pipe() const;
        Get a const reference to the pipe.
      6. -
        pipe_type && pipe();
        Get a rvalue reference to the pipe. Qualified as rvalue.
        7. +
        pipe_type && pipe();
        Get a rvalue reference to the pipe. Qualified as rvalue.
      diff --git a/doc/html/boost/process/basic_pipe.html b/doc/html/boost/process/basic_pipe.html index 6a2bf7a169..57c9b0647e 100644 --- a/doc/html/boost/process/basic_pipe.html +++ b/doc/html/boost/process/basic_pipe.html @@ -44,23 +44,23 @@ typedefunspecifiednative_handle;// construct/copy/destruct - basic_pipe(); - explicitbasic_pipe(conststd::string&); - basic_pipe(constbasic_pipe&); - basic_pipe(basic_pipe&&); - basic_pipe&operator=(constbasic_pipe&); - basic_pipe&operator=(basic_pipe&&); - ~basic_pipe(); + basic_pipe(); + explicitbasic_pipe(conststd::string&); + basic_pipe(constbasic_pipe&); + basic_pipe(basic_pipe&&); + basic_pipe&operator=(constbasic_pipe&); + basic_pipe&operator=(basic_pipe&&); + ~basic_pipe(); - // public member functions - native_handlenative_source()const; - native_handlenative_sink()const; - voidassign_source(native_handle); - voidassign_sink(native_handle); - int_typewrite(constchar_type*,int_type); - int_typeread(char_type*,int_type); - boolis_open(); - voidclose(); + // public member functions + native_handlenative_source()const; + native_handlenative_sink()const; + voidassign_source(native_handle); + voidassign_sink(native_handle); + int_typewrite(constchar_type*,int_type); + int_typeread(char_type*,int_type); + boolis_open(); + voidclose();};

      Description

      @@ -72,11 +72,11 @@ construct/copy/destruct
      1. -
        basic_pipe();
        Default construct the pipe. Will be opened.
        2. +
        basic_pipe();
        Default construct the pipe. Will be opened.
      2. -
        explicit basic_pipe(const std::string & name);
        Construct a named pipe.
        3. +
        explicit basic_pipe(const std::string & name);
        Construct a named pipe.
      3. -
        basic_pipe(const basic_pipe & p);
        +
        basic_pipe(const basic_pipe & p);

        Copy construct the pipe.

      [Note] Note
      @@ -89,11 +89,11 @@

    30. -
      basic_pipe(basic_pipe && lhs);
      +
      basic_pipe(basic_pipe && lhs);

      Move construct the pipe.

    31. -
      basic_pipe & operator=(const basic_pipe & p);
      +
      basic_pipe & operator=(const basic_pipe & p);

      Copy assign the pipe.

      32. @@ -106,43 +106,43 @@

    32. -
      basic_pipe & operator=(basic_pipe && lhs);
      +
      basic_pipe & operator=(basic_pipe && lhs);

      Move assign the pipe.

    33. -
      ~basic_pipe();
      +
      ~basic_pipe();

      Destructor closes the handles.

      34. -basic_pipe public member functions

      +basic_pipe public member functions
      1. -
        native_handle native_source() const;
        +
        native_handle native_source() const;

        Get the native handle of the source.

      2. -
        native_handle native_sink() const;
        +
        native_handle native_sink() const;

        Get the native handle of the sink.

      3. -
        void assign_source(native_handle h);
        +
        void assign_source(native_handle h);

        Assign a new value to the source

      4. -
        void assign_sink(native_handle h);
        +
        void assign_sink(native_handle h);

        Assign a new value to the sink

      5. -
        int_type write(const char_type * data, int_type count);
        Write data to the pipe.
        6. +
        int_type write(const char_type * data, int_type count);
        Write data to the pipe.
      6. -
        int_type read(char_type * data, int_type count);
        Read data from the pipe.
        7. +
        int_type read(char_type * data, int_type count);
        Read data from the pipe.
      7. -
        bool is_open();
        Check if the pipe is open.
        8. +
        bool is_open();
        Check if the pipe is open.
      8. -
        void close();
        Close the pipe.
        9. +
        void close();
        Close the pipe.
      diff --git a/doc/html/boost/process/basic_pipebuf.html b/doc/html/boost/process/basic_pipebuf.html index 7548ef2f5d..0115b9656a 100644 --- a/doc/html/boost/process/basic_pipebuf.html +++ b/doc/html/boost/process/basic_pipebuf.html @@ -43,28 +43,28 @@ typedefTraits::off_typeoff_type;// construct/copy/destruct - basic_pipebuf(); - basic_pipebuf(constbasic_pipebuf&)=default; - basic_pipebuf(basic_pipebuf&&)=default; - basic_pipebuf(pipe_type&&); - basic_pipebuf(constpipe_type&); - basic_pipebuf&operator=(constbasic_pipebuf&)=delete; - basic_pipebuf&operator=(basic_pipebuf&&)=default; - basic_pipebuf&operator=(pipe_type&&); - basic_pipebuf&operator=(constpipe_type&); + basic_pipebuf(); + basic_pipebuf(constbasic_pipebuf&)=default; + basic_pipebuf(basic_pipebuf&&)=default; + basic_pipebuf(pipe_type&&); + basic_pipebuf(constpipe_type&); + basic_pipebuf&operator=(constbasic_pipebuf&)=delete; + basic_pipebuf&operator=(basic_pipebuf&&)=default; + basic_pipebuf&operator=(pipe_type&&); + basic_pipebuf&operator=(constpipe_type&); - // public member functions - int_typeoverflow(int_type=traits_type::eof()); - intsync(); - int_typeunderflow(); - voidpipe(pipe_type&&); - voidpipe(constpipe_type&); - pipe_type&pipe(); - constpipe_type&pipe()const; - pipe_type&&pipe(); + // public member functions + int_typeoverflow(int_type=traits_type::eof()); + intsync(); + int_typeunderflow(); + voidpipe(pipe_type&&); + voidpipe(constpipe_type&); + pipe_type&pipe(); + constpipe_type&pipe()const; + pipe_type&&pipe(); - // private member functions - bool_write_impl(); + // private member functions + bool_write_impl();// public data membersstaticconstexprintdefault_buffer_size; @@ -79,51 +79,51 @@ construct/copy/destruct
      1. -
        basic_pipebuf();
        Default constructor, will also construct the pipe.
        2. +
        basic_pipebuf();
        Default constructor, will also construct the pipe.
      2. -
        basic_pipebuf(const basic_pipebuf &) = default;
        Copy Constructor.
        3. +
        basic_pipebuf(const basic_pipebuf &) = default;
        Copy Constructor.
      3. -
        basic_pipebuf(basic_pipebuf &&) = default;
        Move Constructor.
        4. +
        basic_pipebuf(basic_pipebuf &&) = default;
        Move Constructor.
      4. -
        basic_pipebuf(pipe_type && p);
        Move construct from a pipe.
        5. +
        basic_pipebuf(pipe_type && p);
        Move construct from a pipe.
      5. -
        basic_pipebuf(const pipe_type & p);
        Construct from a pipe.
        6. +
        basic_pipebuf(const pipe_type & p);
        Construct from a pipe.
      6. -
        basic_pipebuf & operator=(const basic_pipebuf &) = delete;
        Copy assign.
        7. +
        basic_pipebuf & operator=(const basic_pipebuf &) = delete;
        Copy assign.
      7. -
        basic_pipebuf & operator=(basic_pipebuf &&) = default;
        Move assign.
        8. +
        basic_pipebuf & operator=(basic_pipebuf &&) = default;
        Move assign.
      8. -
        basic_pipebuf & operator=(pipe_type && p);
        Move assign a pipe.
        9. +
        basic_pipebuf & operator=(pipe_type && p);
        Move assign a pipe.
      9. -
        basic_pipebuf & operator=(const pipe_type & p);
        Copy assign a pipe.
        10. +
        basic_pipebuf & operator=(const pipe_type & p);
        Copy assign a pipe.

      -basic_pipebuf public member functions

      +basic_pipebuf public member functions
      1. -
        int_type overflow(int_type ch = traits_type::eof());
        Writes characters to the associated output sequence from the put area.
        2. +
        int_type overflow(int_type ch = traits_type::eof());
        Writes characters to the associated output sequence from the put area.
      2. -
        int sync();
        Synchronizes the buffers with the associated character sequence.
        3. +
        int sync();
        Synchronizes the buffers with the associated character sequence.
      3. -
        int_type underflow();
        Reads characters from the associated input sequence to the get area.
        4. +
        int_type underflow();
        Reads characters from the associated input sequence to the get area.
      4. -
        void pipe(pipe_type && p);
        Set the pipe of the streambuf.
        5. +
        void pipe(pipe_type && p);
        Set the pipe of the streambuf.
      5. -
        void pipe(const pipe_type & p);
        Set the pipe of the streambuf.
        6. +
        void pipe(const pipe_type & p);
        Set the pipe of the streambuf.
      6. -
        pipe_type & pipe();
        Get a reference to the pipe.
        7. +
        pipe_type & pipe();
        Get a reference to the pipe.
      7. -
        const pipe_type & pipe() const;
        Get a const reference to the pipe.
        8. +
        const pipe_type & pipe() const;
        Get a const reference to the pipe.
      8. -
        pipe_type && pipe();
        Get a rvalue reference to the pipe. Qualified as rvalue.
        9. +
        pipe_type && pipe();
        Get a rvalue reference to the pipe. Qualified as rvalue.

      -basic_pipebuf private member functions

      -
      1. bool _write_impl();
      +basic_pipebuf private member functions +
      1. bool _write_impl();
      diff --git a/doc/html/boost/process/basic_pstream.html b/doc/html/boost/process/basic_pstream.html index 0161b87856..1e89f71787 100644 --- a/doc/html/boost/process/basic_pstream.html +++ b/doc/html/boost/process/basic_pstream.html @@ -44,23 +44,23 @@ typedefTraits::off_typeoff_type;// construct/copy/destruct - basic_pstream(); - basic_pstream(constbasic_pstream&)=delete; - basic_pstream(basic_pstream&&)=default; - basic_pstream(pipe_type&&); - basic_pstream(constpipe_type&); - basic_pstream&operator=(constbasic_pstream&)=delete; - basic_pstream&operator=(basic_pstream&&)=default; - basic_pstream&operator=(pipe_type&&); - basic_pstream&operator=(constpipe_type&); + basic_pstream(); + basic_pstream(constbasic_pstream&)=delete; + basic_pstream(basic_pstream&&)=default; + basic_pstream(pipe_type&&); + basic_pstream(constpipe_type&); + basic_pstream&operator=(constbasic_pstream&)=delete; + basic_pstream&operator=(basic_pstream&&)=default; + basic_pstream&operator=(pipe_type&&); + basic_pstream&operator=(constpipe_type&); - // public member functions - basic_pipebuf<CharT,Traits>*rdbuf()const; - voidpipe(pipe_type&&); - voidpipe(constpipe_type&); - pipe_type&pipe(); - constpipe_type&pipe()const; - pipe_type&&pipe(); + // public member functions + basic_pipebuf<CharT,Traits>*rdbuf()const; + voidpipe(pipe_type&&); + voidpipe(constpipe_type&); + pipe_type&pipe(); + constpipe_type&pipe()const; + pipe_type&&pipe();};

      Description

      @@ -72,41 +72,41 @@ construct/copy/destruct
      1. -
        basic_pstream();
        Default constructor.
        2. +
        basic_pstream();
        Default constructor.
      2. -
        basic_pstream(const basic_pstream &) = delete;
        Copy constructor.
        3. +
        basic_pstream(const basic_pstream &) = delete;
        Copy constructor.
      3. -
        basic_pstream(basic_pstream &&) = default;
        Move constructor.
        4. +
        basic_pstream(basic_pstream &&) = default;
        Move constructor.
      4. -
        basic_pstream(pipe_type && p);
        Move construct from a pipe.
        5. +
        basic_pstream(pipe_type && p);
        Move construct from a pipe.
      5. -
        basic_pstream(const pipe_type & p);
        Copy construct from a pipe.
        6. +
        basic_pstream(const pipe_type & p);
        Copy construct from a pipe.
      6. -
        basic_pstream & operator=(const basic_pstream &) = delete;
        Copy assignment.
        7. +
        basic_pstream & operator=(const basic_pstream &) = delete;
        Copy assignment.
      7. -
        basic_pstream & operator=(basic_pstream &&) = default;
        Move assignment.
        8. +
        basic_pstream & operator=(basic_pstream &&) = default;
        Move assignment.
      8. -
        basic_pstream & operator=(pipe_type && p);
        Move assignment of a pipe.
        9. +
        basic_pstream & operator=(pipe_type && p);
        Move assignment of a pipe.
      9. -
        basic_pstream & operator=(const pipe_type & p);
        Copy assignment of a pipe.
        10. +
        basic_pstream & operator=(const pipe_type & p);
        Copy assignment of a pipe.

      -basic_pstream public member functions

      +basic_pstream public member functions
      1. -
        basic_pipebuf< CharT, Traits > * rdbuf() const;
        Get access to the underlying stream_buf.
        2. +
        basic_pipebuf< CharT, Traits > * rdbuf() const;
        Get access to the underlying stream_buf.
      2. -
        void pipe(pipe_type && p);
        Set the pipe of the streambuf.
        3. +
        void pipe(pipe_type && p);
        Set the pipe of the streambuf.
      3. -
        void pipe(const pipe_type & p);
        Set the pipe of the streambuf.
        4. +
        void pipe(const pipe_type & p);
        Set the pipe of the streambuf.
      4. -
        pipe_type & pipe();
        Get a reference to the pipe.
        5. +
        pipe_type & pipe();
        Get a reference to the pipe.
      5. -
        const pipe_type & pipe() const;
        Get a const reference to the pipe.
        6. +
        const pipe_type & pipe() const;
        Get a const reference to the pipe.
      6. -
        pipe_type && pipe();
        Get a rvalue reference to the pipe. Qualified as rvalue.
        7. +
        pipe_type && pipe();
        Get a rvalue reference to the pipe. Qualified as rvalue.
      diff --git a/doc/html/boost/process/child.html b/doc/html/boost/process/child.html index 969178e40b..c5b2184b8c 100644 --- a/doc/html/boost/process/child.html +++ b/doc/html/boost/process/child.html @@ -36,38 +36,38 @@ classchild{public:// construct/copy/destruct - explicitchild(pid_t&); - child(child&&); - template<typename... Args>explicitchild(Args&&...); - child()=default; - child&operator=(child&&); - ~child(); + explicitchild(pid_t&); + child(child&&); + template<typename... Args>explicitchild(Args&&...); + child()=default; + child&operator=(child&&); + ~child(); - // private member functions - voiddetach(); - voidjoin(); - booljoinable(); - native_handle_tnative_handle()const; - intexit_code()const; - pid_tid()const; - boolrunning(); - boolrunning(std::error_code&)noexcept; - voidwait(); - voidwait(std::error_code&)noexcept; + // private member functions + voiddetach(); + voidjoin(); + booljoinable(); + native_handle_tnative_handle()const; + intexit_code()const; + pid_tid()const; + boolrunning(); + boolrunning(std::error_code&)noexcept; + voidwait(); + voidwait(std::error_code&)noexcept;template<typename Rep,typename Period> - boolwait_for(conststd::chrono::duration<Rep,Period>&); - boolwait_for(conststd::chrono::duration<Rep,Period>&, + boolwait_for(conststd::chrono::duration<Rep,Period>&); + boolwait_for(conststd::chrono::duration<Rep,Period>&,std::error_code&)noexcept;template<typename Clock,typename Duration> - boolwait_until(conststd::chrono::time_point<Clock,Duration>&); - boolwait_until(conststd::chrono::time_point<Clock,Duration>&, + boolwait_until(conststd::chrono::time_point<Clock,Duration>&); + boolwait_until(conststd::chrono::time_point<Clock,Duration>&,std::error_code&)noexcept; - boolvalid()const; - explicitoperator bool()const; - boolin_group()const; - boolin_group(std::error_code&)constnoexcept; - voidterminate(); - voidterminate(std::error_code&)noexcept; + boolvalid()const; + explicitoperator bool()const; + boolin_group()const; + boolin_group(std::error_code&)constnoexcept; + voidterminate(); + voidterminate(std::error_code&)noexcept;};

      Description

      @@ -88,7 +88,7 @@ construct/copy/destruct
      1. -
        explicit child(pid_t & pid);
        +
        explicit child(pid_t & pid);

        Construct the child from a pid.

      @@ -101,23 +101,23 @@

    34. -
      child(child && lhs);
      +
      child(child && lhs);

      Move-Constructor.

    35. -
      template<typename... Args> explicit child(Args &&... args);
      +
      template<typename... Args> explicit child(Args &&... args);

      Construct a child from a property list and launch it The standard version is to create a subprocess, which will spawn the process.

    36. -
      child() = default;
      +
      child() = default;

      Construct an empty child.

    37. -
      child & operator=(child && lhs);
      +
      child & operator=(child && lhs);

      Move assign.

    38. -
      ~child();
      +
      ~child();

      Destructor.

      39. @@ -133,51 +133,51 @@

      -child private member functions

      +child private member functions
      1. -
        void detach();
        +
        void detach();

        Detach the child, i.e. let it run after this handle dies.

      2. -
        void join();
        +
        void join();

        Join the child. This just calls wait, but that way the naming is similar to std::thread

      3. -
        bool joinable();
        +
        bool joinable();

        Check if the child is joinable.

      4. -
        native_handle_t native_handle() const;
        +
        native_handle_t native_handle() const;

        Get the native handle for the child process.

      5. -
        int exit_code() const;
        +
        int exit_code() const;

        Get the exit_code. The return value is without any meaning if the child wasn't waited for or if it was terminated.

      6. -
        pid_t id() const;
        +
        pid_t id() const;

        Get the Process Identifier.

      7. -
        bool running();
        +
        bool running();

        Check if the child process is running.

      8. -
        bool running(std::error_code & ec) noexcept;
        +
        bool running(std::error_code & ec) noexcept;

        This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

      9. -
        void wait();
        +
        void wait();

        Wait for the child process to exit.

      10. -
        void wait(std::error_code & ec) noexcept;
        +
        void wait(std::error_code & ec) noexcept;

        This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts. 

      11. template<typename Rep, typename Period> 
-  bool wait_for(const std::chrono::duration< Rep, Period > & rel_time);
        + bool wait_for(const std::chrono::duration< Rep, Period > & rel_time);

        Wait for the child process to exit for a period of time.

      @@ -192,13 +192,13 @@
    39. -
      bool wait_for(const std::chrono::duration< Rep, Period > & rel_time, 
+
      bool wait_for(const std::chrono::duration< Rep, Period > & rel_time, 
               std::error_code & ec) noexcept;
      
 
      This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts. 
      
 
    40. template<typename Clock, typename Duration> 
-  bool wait_until(const std::chrono::time_point< Clock, Duration > & timeout_time);
      + bool wait_until(const std::chrono::time_point< Clock, Duration > & timeout_time);

      Wait for the child process to exit until a point in time.

      @@ -213,12 +213,12 @@
    41. -
      bool wait_until(const std::chrono::time_point< Clock, Duration > & timeout_time, 
+
      bool wait_until(const std::chrono::time_point< Clock, Duration > & timeout_time, 
                 std::error_code & ec) noexcept;
      
 
      This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.
    42. -
      bool valid() const;
      +
      bool valid() const;

      Check if this handle holds a child process.

      @@ -231,24 +231,24 @@

    43. -
      explicit operator bool() const;
      +
      explicit operator bool() const;

      Same as valid, for convenience.

    44. -
      bool in_group() const;
      +
      bool in_group() const;

      Check if the the chlid process is in any process group.

    45. -
      bool in_group(std::error_code & ec) const noexcept;
      +
      bool in_group(std::error_code & ec) const noexcept;

      This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

    46. -
      void terminate();
      +
      void terminate();

      Terminate the child process.

      This function will cause the child process to unconditionally and immediately exit. It is implement with SIGKILL on posix and TerminateProcess on windows.

    47. -
      void terminate(std::error_code & ec) noexcept;
      +
      void terminate(std::error_code & ec) noexcept;

      This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

      48. diff --git a/doc/html/boost/process/extend/handler.html b/doc/html/boost/process/extend/handler.html index c842e4b82c..0967e683b0 100644 --- a/doc/html/boost/process/extend/handler.html +++ b/doc/html/boost/process/extend/handler.html @@ -35,16 +35,16 @@ structhandler{ - // public member functions - template<typename Executor>voidon_setup(Executor&)const; + // public member functions + template<typename Executor>voidon_setup(Executor&)const;template<typename Executor> - voidon_error(Executor&,conststd::error_code&)const; - template<typename Executor>voidon_success(Executor&)const; + voidon_error(Executor&,conststd::error_code&)const; + template<typename Executor>voidon_success(Executor&)const;template<typename Executor> - voidon_fork_error(Executor&,conststd::error_code&)const; - template<typename Executor>voidon_exec_setup(Executor&)const; + voidon_fork_error(Executor&,conststd::error_code&)const; + template<typename Executor>voidon_exec_setup(Executor&)const;template<typename Executor> - voidon_exec_error(Executor&,conststd::error_code&)const; + voidon_exec_error(Executor&,conststd::error_code&)const;};

      Description

      @@ -61,10 +61,10 @@

      -handler public member functions

      +handler public member functions
      1. -
        template<typename Executor> void on_setup(Executor &) const;
        This function is invoked before the process launch.
      +
      template<typename Executor> void on_setup(Executor &) const;
      This function is invoked before the process launch.
      @@ -76,7 +76,7 @@ 
    48. template<typename Executor> 
-  void on_error(Executor &, const std::error_code &) const;
      + void on_error(Executor &, const std::error_code &) const;

      This function is invoked if an error occured while trying to launch the process.

      49. [Note] Note
      @@ -89,7 +89,7 @@

    49. -
      template<typename Executor> void on_success(Executor &) const;
      +
      template<typename Executor> void on_success(Executor &) const;

      This function is invoked if the process was successfully launched.

      50. @@ -103,7 +103,7 @@ 
    50. template<typename Executor> 
-  void on_fork_error(Executor &, const std::error_code &) const;
      + void on_fork_error(Executor &, const std::error_code &) const;

      This function is invoked if an error occured during the call of fork.

      51. @@ -116,7 +116,7 @@

    51. -
      template<typename Executor> void on_exec_setup(Executor &) const;
      +
      template<typename Executor> void on_exec_setup(Executor &) const;

      This function is invoked if the call of fork was successful, before calling execve.

      52. @@ -139,7 +139,7 @@ 
    52. template<typename Executor> 
-  void on_exec_error(Executor &, const std::error_code &) const;
      + void on_exec_error(Executor &, const std::error_code &) const;

      This function is invoked if the call of execve failed.

      53. diff --git a/doc/html/boost/process/extend/posix_executor.html b/doc/html/boost/process/extend/posix_executor.html index 8629773943..54c76c8827 100644 --- a/doc/html/boost/process/extend/posix_executor.html +++ b/doc/html/boost/process/extend/posix_executor.html @@ -35,10 +35,10 @@ template<typename Sequence>structposix_executor{ - // public member functions - conststd::error_code&error()const; - voidset_error(conststd::error_code&,conststd::string&); - voidset_error(conststd::error_code&,constchar*); + // public member functions + conststd::error_code&error()const; + voidset_error(conststd::error_code&,conststd::string&); + voidset_error(conststd::error_code&,constchar*);// public data membersSequence&seq;// A reference to the actual initializer-sequence. @@ -65,35 +65,35 @@ As information for extension development, here is the structure of the process l 

       for (auto & s : seq)
-    s.on_setup(*this);
+    s.on_setup(*this);
 
-if (error())
+if (error())
 {
     for (auto & s : seq)
-       s.on_error(*this, error());
+       s.on_error(*this, error());
     return child();
 }
 
 pid = fork()
-on_setup(*this);
+on_setup(*this);
 
 if (pid == -1) //fork error 
 {
-    set_error(get_last_error());
+    set_error(get_last_error());
     for (auto & s : seq)
-        s.on_fork_error(*this, error());
+        s.on_fork_error(*this, error());
     for (auto & s : seq)
-        s.on_error(*this, error());
+        s.on_error(*this, error());
     return child()
 }
 else if (pid == 0) //child process
 {
     for (auto & s : seq)
-        s.on_exec_setup(*this);
+        s.on_exec_setup(*this);
     execve(exe, cmd_line, env);
     auto ec = get_last_error();
     for (auto & s : seq)
-        s.on_exec_error(*this);
+        s.on_exec_error(*this);
 
     unspecified();//here the error is send to the father process interally
 
@@ -105,18 +105,18 @@ As information for extension development, here is the structure of the process l
 
 unspecified();//here, we read the the error from the child process
 
-if (error())
+if (error())
     for (auto & s : seq)
-        s.on_error(*this, error());
+        s.on_error(*this, error());
 else
     for (auto & s : seq)
-        s.on_success(*this);
+        s.on_success(*this);
 
 //now we check again, because a on_success handler might've errored.
-if (error())
+if (error())
 {
     for (auto & s : seq)
-        s.on_error(*this, error());
+        s.on_error(*this, error());
     return child();
 }
 else
@@ -161,12 +161,12 @@ As information for extension development, here is the structure of the process l
 
 
      
 
      
-posix_executor public member functions
      
+posix_executor public member functions
 
        
 
      1. 
-
        const std::error_code & error() const;
        This function returns a const reference to the error state of the executor. 
        2. 
+
        const std::error_code & error() const;
        This function returns a const reference to the error state of the executor. 
 
      2. 
-
        void set_error(const std::error_code & ec, const std::string & msg);
        
+
        void set_error(const std::error_code & ec, const std::string & msg);
        
 
        This function can be used to report an error to the executor. This will be handled according to the configuration of the executor, i.e. it might throw an exception.
      @@ -179,7 +179,7 @@ As information for extension development, here is the structure of the process l

    53. -
      void set_error(const std::error_code & ec, const char * msg);
      +
      void set_error(const std::error_code & ec, const char * msg);

      This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

      54. diff --git a/doc/html/boost/process/extend/windows_executor.html b/doc/html/boost/process/extend/windows_executor.html index 3732e68e6a..1bb108da8b 100644 --- a/doc/html/boost/process/extend/windows_executor.html +++ b/doc/html/boost/process/extend/windows_executor.html @@ -38,11 +38,11 @@ typedefunspecifiedstartup_info_t;// The type of the startup-info, depending on the char-type. typedefunspecifiedstartup_info_ex_t;// The type of the extended startup-info, depending the char-type; only defined with winapi-version equal or higher than 6. - // public member functions - conststd::error_code&error()const; - voidset_error(conststd::error_code&,conststd::string&); - voidset_error(conststd::error_code&,constchar*); - voidset_startup_info_ex(); + // public member functions + conststd::error_code&error()const; + voidset_error(conststd::error_code&,conststd::string&); + voidset_error(conststd::error_code&,constchar*); + voidset_startup_info_ex();// public data membersSequence&seq;// A reference to the actual initializer-sequence. @@ -75,12 +75,12 @@ As information for extension development, here is the structure of the process launching (in pseudo-code and uml)

       for (auto & s : seq)
-    s.on_setup(*this);
+    s.on_setup(*this);
 
-if (error())
+if (error())
 {
     for (auto & s : seq)
-       s.on_error(*this, error());
+       s.on_error(*this, error());
     return child();
 }
 int err_code = CreateProcess(
@@ -96,18 +96,18 @@ As information for extension development, here is the structure of the process l
 
 child c(proc_info, exit_code);
 
-if (error())
+if (error())
     for (auto & s : seq)
-        s.on_error(*this, error());
+        s.on_error(*this, error());
 else
     for (auto & s : seq)
-        s.on_success(*this);
+        s.on_success(*this);
 
 //now we check again, because a on_success handler might've errored.
-if (error())
+if (error())
 {
     for (auto & s : seq)
-        s.on_error(*this, error());
+        s.on_error(*this, error());
     return child();
 }
 else
@@ -136,12 +136,12 @@ As information for extension development, here is the structure of the process l
 
 
      
 
      
-windows_executor public member functions
      
+windows_executor public member functions
 
        
 
      1. 
-
        const std::error_code & error() const;
        This function returns a const reference to the error state of the executor. 
        2. 
+
        const std::error_code & error() const;
        This function returns a const reference to the error state of the executor. 
 
      2. 
-
        void set_error(const std::error_code & ec, const std::string & msg);
        
+
        void set_error(const std::error_code & ec, const std::string & msg);
        
 
        This function can be used to report an error to the executor. This will be handled according to the configuration of the executor, i.e. it might throw an exception.
      @@ -154,11 +154,11 @@ As information for extension development, here is the structure of the process l

    54. -
      void set_error(const std::error_code & ec, const char * msg);
      +
      void set_error(const std::error_code & ec, const char * msg);

      This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

    55. -
      void set_startup_info_ex();
      This function switches the information, so that the extended structure is used.
      56. +
      void set_startup_info_ex();
      This function switches the information, so that the extended structure is used.
      diff --git a/doc/html/boost/process/group.html b/doc/html/boost/process/group.html index 96d9a07a00..27aa61203a 100644 --- a/doc/html/boost/process/group.html +++ b/doc/html/boost/process/group.html @@ -40,40 +40,40 @@ typedefgroup_handle::handle_tnative_handle_t;// Native representation of the handle. // construct/copy/destruct - explicitgroup(group_handle&&); - explicitgroup(native_handle_t&); - group(constgroup&)=delete; - group(group&&); - group()=default; - group&operator=(constgroup&)=delete; - group&operator=(group&&); - ~group(); + explicitgroup(group_handle&&); + explicitgroup(native_handle_t&); + group(constgroup&)=delete; + group(group&&); + group()=default; + group&operator=(constgroup&)=delete; + group&operator=(group&&); + ~group(); - // public member functions - voiddetach(); - voidjoin(); - booljoinable(); - native_handle_tnative_handle()const; - voidwait(); - voidwait(std::error_code&)noexcept; + // public member functions + voiddetach(); + voidjoin(); + booljoinable(); + native_handle_tnative_handle()const; + voidwait(); + voidwait(std::error_code&)noexcept;template<typename Rep,typename Period> - boolwait_for(conststd::chrono::duration<Rep,Period>&); + boolwait_for(conststd::chrono::duration<Rep,Period>&);template<typename Rep,typename Period> - boolwait_for(conststd::chrono::duration<Rep,Period>&, + boolwait_for(conststd::chrono::duration<Rep,Period>&,std::error_code&)noexcept;template<typename Clock,typename Duration> - boolwait_until(conststd::chrono::time_point<Clock,Duration>&); + boolwait_until(conststd::chrono::time_point<Clock,Duration>&);template<typename Clock,typename Duration> - boolwait_until(conststd::chrono::time_point<Clock,Duration>&, + boolwait_until(conststd::chrono::time_point<Clock,Duration>&,std::error_code&)noexcept; - boolvalid()const; - explicitoperator bool()const; - voidterminate(); - voidterminate(std::error_code&)noexcept; - voidadd(constchild&); - voidadd(constchild&,std::error_code&)noexcept; - boolhas(constchild&); - boolhas(constchild&,std::error_code&)noexcept; + boolvalid()const; + explicitoperator bool()const; + voidterminate(); + voidterminate(std::error_code&)noexcept; + voidadd(constchild&); + voidadd(constchild&,std::error_code&)noexcept; + boolhas(constchild&); + boolhas(constchild&,std::error_code&)noexcept;};

      Description

      @@ -107,19 +107,19 @@ public construct/copy/destruct
        -
      1. explicit group(group_handle && ch);
        2. +
      2. explicit group(group_handle && ch);
      3. -
        explicit group(native_handle_t & handle);
        Construct the group from a native_handle.
        4. -
      4. group(const group &) = delete;
        5. +
        explicit group(native_handle_t & handle);
        Construct the group from a native_handle. +
      5. group(const group &) = delete;
      6. -
        group(group && lhs);
        Move constructor.
        7. +
        group(group && lhs);
        Move constructor.
      7. -
        group() = default;
        Default constructor.
        8. -
      8. group & operator=(const group &) = delete;
        9. +
        group() = default;
        Default constructor. +
      9. group & operator=(const group &) = delete;
      10. -
        group & operator=(group && lhs);
        Move assign.
        11. +
        group & operator=(group && lhs);
        Move assign.
      11. -
        ~group();
        +
        ~group();

        Destructor

      [Note] Note
      @@ -135,29 +135,29 @@

      -group public member functions

      +group public member functions
      1. -
        void detach();
        Detach the group.
        2. +
        void detach();
        Detach the group.
      2. -
        void join();
        +
        void join();

        Join the child. This just calls wait, but that way the naming is similar to std::thread

      3. -
        bool joinable();
        +
        bool joinable();

        Check if the child is joinable.

      4. -
        native_handle_t native_handle() const;
        Obtain the native handle of the group.
        5. +
        native_handle_t native_handle() const;
        Obtain the native handle of the group.
      5. -
        void wait();
        Wait for the process group to exit.
        6. +
        void wait();
        Wait for the process group to exit.
      6. -
        void wait(std::error_code & ec) noexcept;
        +
        void wait(std::error_code & ec) noexcept;

        This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts. 

      7. template<typename Rep, typename Period> 
-  bool wait_for(const std::chrono::duration< Rep, Period > & rel_time);
        + bool wait_for(const std::chrono::duration< Rep, Period > & rel_time);

        Wait for the process group to exit for period of time.

      @@ -173,13 +173,13 @@ 
    56. template<typename Rep, typename Period> 
-  bool wait_for(const std::chrono::duration< Rep, Period > & rel_time, 
+  bool wait_for(const std::chrono::duration< Rep, Period > & rel_time, 
                 std::error_code & ec) noexcept;

      This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts. 

    57. template<typename Clock, typename Duration> 
-  bool wait_until(const std::chrono::time_point< Clock, Duration > & timeout_time);
      + bool wait_until(const std::chrono::time_point< Clock, Duration > & timeout_time);

      Wait for the process group to exit until a point in time.

      58. @@ -195,30 +195,30 @@ 
    58. template<typename Clock, typename Duration> 
-  bool wait_until(const std::chrono::time_point< Clock, Duration > & timeout_time, 
+  bool wait_until(const std::chrono::time_point< Clock, Duration > & timeout_time, 
                   std::error_code & ec) noexcept;

      This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

    59. -
      bool valid() const;
      Check if the group has a valid handle.
      60. +
      bool valid() const;
      Check if the group has a valid handle.
    60. -
      explicit operator bool() const;
      Convenience to call valid.
      61. +
      explicit operator bool() const;
      Convenience to call valid.
    61. -
      void terminate();
      Terminate the process group, i.e. all processes in the group.
      62. +
      void terminate();
      Terminate the process group, i.e. all processes in the group.
    62. -
      void terminate(std::error_code & ec) noexcept;
      +
      void terminate(std::error_code & ec) noexcept;

      This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

    63. -
      void add(const child & c);
      Assign a child process to the group.
      64. +
      void add(const child & c);
      Assign a child process to the group.
    64. -
      void add(const child & c, std::error_code & ec) noexcept;
      +
      void add(const child & c, std::error_code & ec) noexcept;

      This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

    65. -
      bool has(const child & c);
      Check if the child process is in the group.
      66. +
      bool has(const child & c);
      Check if the child process is in the group.
    66. -
      bool has(const child & c, std::error_code & ec) noexcept;
      +
      bool has(const child & c, std::error_code & ec) noexcept;

      This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

      67. diff --git a/doc/html/boost/process/on_exit.html b/doc/html/boost/process/on_exit.html index ff7eb04322..b7e7873b1e 100644 --- a/doc/html/boost/process/on_exit.html +++ b/doc/html/boost/process/on_exit.html @@ -67,7 +67,7 @@

      When used ignore_error it might get invoked on error.

      -

      All on_exit use one signal(SIGCHLD) on posix, which is only guaranteed to work when all use the same io_context.

      +

      on_exit uses boost::asio::signal_set to listen for SIGCHLD on posix, and so has the same restrictions as that class (do not register a handler for SIGCHLD except by using boost::asio::signal_set).

      diff --git a/doc/html/boost/process/windows/create_no_window.html b/doc/html/boost/process/windows/create_no_window.html new file mode 100644 index 0000000000..4f773a14cb --- /dev/null +++ b/doc/html/boost/process/windows/create_no_window.html @@ -0,0 +1,51 @@ + + + + +Global create_no_window + + + + + + + + + + + + + + + +
      Boost C++ LibrariesHomeLibrariesPeopleFAQMore
      +

      +
      +PrevUpHomeNext +
      +
      +
      +
      +

      Global create_no_window

      +

      boost::process::windows::create_no_window — Adds the CREATE_NO_WINDOW.aspx) flag.

      +
      +

      Synopsis

      +
      // In header: <boost/process/windows.hpp>
+
+unspecified create_no_window;
      +
      + + + +
      Copyright © 2006-2012 Julio M. Merino Vidal, Ilya Sokolov, + Felipe Tanus, Jeff Flinn, Boris Schaeling
      Copyright © 2016 Klemens D. Morgenstern

      + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

      +
      +
      +
      +PrevUpHomeNext +
      + + diff --git a/doc/html/boost/process/windows/show_normal.html b/doc/html/boost/process/windows/show_normal.html index 05ff91ddd1..5eec215d12 100644 --- a/doc/html/boost/process/windows/show_normal.html +++ b/doc/html/boost/process/windows/show_normal.html @@ -8,7 +8,7 @@ - + @@ -21,7 +21,7 @@
      -PrevUpHomeNext +PrevUpHomeNext
      @@ -45,7 +45,7 @@
      -PrevUpHomeNext +PrevUpHomeNext
      diff --git a/doc/html/boost/random/linear_congruential_engine.html b/doc/html/boost/random/linear_congruential_engine.html index 8a67c30096..b6abb77093 100644 --- a/doc/html/boost/random/linear_congruential_engine.html +++ b/doc/html/boost/random/linear_congruential_engine.html @@ -116,7 +116,7 @@

      Calls seed(default_seed)

    67. -
      void seed(IntType x0);
      +
      void seed(IntType x0_);

      If c mod m is zero and x0 mod m is zero, changes the current value of the generator to 1. Otherwise, changes it to x0 mod m. If c is zero, distinct seeds in the range [1,m) will leave the generator in distinct states. If c is not zero, the range is [0,m).

    68. diff --git a/doc/html/boost/stacktrace/safe_dump_1_3_38_7_6_2_1_3.html b/doc/html/boost/stacktrace/safe_dump_1_3_38_7_6_2_1_3.html index bc2ce52ed8..94fd8ad0a1 100644 --- a/doc/html/boost/stacktrace/safe_dump_1_3_38_7_6_2_1_3.html +++ b/doc/html/boost/stacktrace/safe_dump_1_3_38_7_6_2_1_3.html @@ -27,7 +27,7 @@

      Function safe_dump_to

      -

      boost::stacktrace::safe_dump_to — Opens a file and rewrites its content with current function call sequence.

      +

      boost::stacktrace::safe_dump_to — Opens a file and rewrites its content with current function call sequence if such operations are async signal safe.

      Synopsis

      // In header: <boost/stacktrace/safe_dump_to.hpp>
diff --git a/doc/html/boost/stacktrace/safe_dump_1_3_38_7_6_2_1_4.html b/doc/html/boost/stacktrace/safe_dump_1_3_38_7_6_2_1_4.html
index 0cb3b1b80f..a67b968572 100644
--- a/doc/html/boost/stacktrace/safe_dump_1_3_38_7_6_2_1_4.html
+++ b/doc/html/boost/stacktrace/safe_dump_1_3_38_7_6_2_1_4.html
@@ -27,7 +27,7 @@
 
      
 
      
 
      Function safe_dump_to
      
-
      boost::stacktrace::safe_dump_to — Opens a file and rewrites its content with current function call sequence. 
      
+
      boost::stacktrace::safe_dump_to — Opens a file and rewrites its content with current function call sequence if such operations are async signal safe. 
      
 
      
 
      Synopsis
      
 
      // In header: <boost/stacktrace/safe_dump_to.hpp>
diff --git a/doc/html/boost/stacktrace/safe_dump_1_3_38_7_6_2_1_5.html b/doc/html/boost/stacktrace/safe_dump_1_3_38_7_6_2_1_5.html
index b3721811f5..7952521a6d 100644
--- a/doc/html/boost/stacktrace/safe_dump_1_3_38_7_6_2_1_5.html
+++ b/doc/html/boost/stacktrace/safe_dump_1_3_38_7_6_2_1_5.html
@@ -27,7 +27,7 @@
 
      
 
      
 
      Function safe_dump_to
      
-
      boost::stacktrace::safe_dump_to — Writes into the provided file descriptor the current function call sequence. 
      
+
      boost::stacktrace::safe_dump_to — Writes into the provided file descriptor the current function call sequence if such operation is async signal safe. 
      
 
      
 
      Synopsis
      
 
      // In header: <boost/stacktrace/safe_dump_to.hpp>
diff --git a/doc/html/boost/stacktrace/safe_dump_1_3_38_7_6_2_1_6.html b/doc/html/boost/stacktrace/safe_dump_1_3_38_7_6_2_1_6.html
index 8f9dbd3f64..05ffc4034d 100644
--- a/doc/html/boost/stacktrace/safe_dump_1_3_38_7_6_2_1_6.html
+++ b/doc/html/boost/stacktrace/safe_dump_1_3_38_7_6_2_1_6.html
@@ -27,7 +27,7 @@
 
      
 
      
 
      Function safe_dump_to
      
-
      boost::stacktrace::safe_dump_to — Writes into the provided file descriptor the current function call sequence. 
      
+
      boost::stacktrace::safe_dump_to — Writes into the provided file descriptor the current function call sequence if such operation is async signal safe. 
      
 
      
 
      Synopsis
      
 
      // In header: <boost/stacktrace/safe_dump_to.hpp>
diff --git a/doc/html/boost/swap_idp24543920.html b/doc/html/boost/swap_idp24543920.html
deleted file mode 100644
index 9514aafa5a..0000000000
--- a/doc/html/boost/swap_idp24543920.html
+++ /dev/null
@@ -1,105 +0,0 @@
-
-
-
-
-Function template swap
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
      Boost C++ LibrariesHomeLibrariesPeopleFAQMore
      
-
      
-
      
-PrevUpHomeNext
-
      
-
      
-
      
-
      
-
      Function template swap
      
-
      boost::swap — Swap the contents of two circular_buffers. 
      
-
      
-
      Synopsis
      
-
      // In header: <boost/circular_buffer/base.hpp>
-
-
-template<typename T, typename Alloc> 
-  void swap(circular_buffer< T, Alloc > & lhs, 
-            circular_buffer< T, Alloc > & rhs);
      
-
      
-
      Description
      
-
      
-
-
-
      
-
      Complexity. Constant (in the size of the circular_buffers). 
      
-
      
-
      
-
      Iterator Invalidation. Invalidates all iterators of both circular_buffers. (On the other hand the iterators still point to the same elements but within another container. If you want to rely on this feature you have to turn the Debug Support off otherwise an assertion will report an error if such invalidated iterator is used.) 
      
-
      
-
      
-
      See Also:
      
-
      swap(circular_buffer<T, Alloc>&) 
      
-
      
-
      
-
      
----
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
      



      Parameters:
      
----
-
-
-
-
-
-
-
-
-
-
-
      



      lhs
      The circular_buffer whose content will be swapped with rhs. 
      rhs
      The circular_buffer whose content will be swapped with lhs. 
      Postconditions:
      lhs contains elements of rhs and vice versa. 
      Throws:
      		Nothing. 
      
-
      
-
      
-
-
-
-
      Copyright © 2003-2013 Jan Gaspar
      
-        Distributed under the Boost Software License, Version 1.0. (See accompanying
-        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-      
      
-
      
-
      
-
      
-PrevUpHomeNext
-
      
-
-
diff --git a/doc/html/boost/swap_idp43422448.html b/doc/html/boost/swap_idp43422448.html
new file mode 100644
index 0000000000..6f862bbaf9
--- /dev/null
+++ b/doc/html/boost/swap_idp43422448.html
@@ -0,0 +1,105 @@
+
+
+
+
+Function template swap
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
      Boost C++ LibrariesHomeLibrariesPeopleFAQMore
      
+
      
+
      
+PrevUpHomeNext
+
      
+
      
+
      
+
      
+
      Function template swap
      
+
      boost::swap — Swap the contents of two circular_buffers. 
      
+
      
+
      Synopsis
      
+
      // In header: <boost/circular_buffer/base.hpp>
+
+
+template<typename T, typename Alloc> 
+  void swap(circular_buffer< T, Alloc > & lhs, 
+            circular_buffer< T, Alloc > & rhs);
      
+
      
+
      Description
      
+
      
+
+
+
      
+
      Complexity. Constant (in the size of the circular_buffers). 
      
+
      
+
      
+
      Iterator Invalidation. Invalidates all iterators of both circular_buffers. (On the other hand the iterators still point to the same elements but within another container. If you want to rely on this feature you have to turn the Debug Support off otherwise an assertion will report an error if such invalidated iterator is used.) 
      
+
      
+
      
+
      See Also:
      
+
      swap(circular_buffer<T, Alloc>&) 
      
+
      
+
      
+
      
++++
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
      



      Parameters:
      
++++
+
+
+
+
+
+
+
+
+
+
+
      



      lhs
      The circular_buffer whose content will be swapped with rhs. 
      rhs
      The circular_buffer whose content will be swapped with lhs. 
      Postconditions:
      lhs contains elements of rhs and vice versa. 
      Throws:
      		Nothing. 
      
+
      
+
      
+
+
+
+
      Copyright © 2003-2013 Jan Gaspar
      
+        Distributed under the Boost Software License, Version 1.0. (See accompanying
+        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+      
      
+
      
+
      
+
      
+PrevUpHomeNext
+
      
+
+
diff --git a/doc/html/boost/type_erasure/_self.html b/doc/html/boost/type_erasure/_self.html
index 4317a4a097..decd3137cb 100644
--- a/doc/html/boost/type_erasure/_self.html
+++ b/doc/html/boost/type_erasure/_self.html
@@ -8,7 +8,7 @@
 
 
 
-
+
 
 
 
@@ -21,7 +21,7 @@
 
      
 
      
 
      
-PrevUpHomeNext
+PrevUpHomeNext
 
      
 
      
 
      
@@ -50,7 +50,7 @@
 
 
      
 
      
-PrevUpHomeNext
+PrevUpHomeNext
 
      
 
 
diff --git a/doc/html/boost/type_erasure/any.html b/doc/html/boost/type_erasure/any.html
index 8f640d9ef5..f0dbc9585f 100644
--- a/doc/html/boost/type_erasure/any.html
+++ b/doc/html/boost/type_erasure/any.html
@@ -6,9 +6,9 @@
 
 
 
-
-
-
+
+
+
 
 
 
@@ -21,7 +21,7 @@
 
      
 
      
 
      
-PrevUpHomeNext
+PrevUpHomeNext
 
      
 
      
 
      
@@ -30,30 +30,29 @@
 
      boost::type_erasure::any
      
 
      
 
      Synopsis
      
-
      // In header: <boost/type_erasure/rebind_any.hpp>
+
      // In header: <boost/type_erasure/any.hpp>
 
-template<typename Concept, typename T> 
+template<typename Concept, typename T = _self> 
 class any {
 public:
   // construct/copy/destruct
-  any();
-  template<typename U> any(U &&);
-  template<typename U, typename Map> any(U &&, const static_binding< Map > &);
-  any(const any &);
+  any();
+  template<typename U> any(U &&);
+  template<typename U, typename Map> any(U &&, const static_binding< Map > &);
+  any(const any &);
   template<typename Concept2, typename Tag2> 
-    any(const any< Concept2, Tag2 > &);
+    any(const any< Concept2, Tag2 > &);
   template<typename Concept2, typename Tag2, typename Map> 
-    any(const any< Concept2, Tag2 > &, const static_binding< Map > &);
+    any(const any< Concept2, Tag2 > &, const static_binding< Map > &);
   template<typename Concept2, typename Tag2> 
-    any(const any< Concept2, Tag2 > &, const binding< Concept > &);
-  template<class... U> explicit any(U &&...);
-  template<class... U> explicit any(const binding< Concept > &, U &&...);
-  any & operator=(const any &);
-  template<typename U> any & operator=(const U &);
-  ~any();
+    any(const any< Concept2, Tag2 > &, const binding< Concept > &);
+  template<class... U> explicit any(U &&...);
+  template<class... U> explicit any(const binding< Concept > &, U &&...);
+  template<typename U> any & operator=(U &&);
+  ~any();
 };
      
 
      
-
      Description
      
+
      Description
      
 
      The class template any can store any object that models a specific Concept. It dispatches all the functions defined by the Concept to the contained type at runtime.
      
 
      
 
      
@@ -62,26 +61,26 @@
 
      
 
      
 
      
-
      Template Parameters
      
+
      Template Parameters
      
 
        
 
      1. 
 
        typename Concept
        
 
        The Concept that the stored type should model. 
        
 
        2. 
 
      2. 
-
        typename T
        
+
        typename T = _self
        
 
        A placeholder specifying which type this is.
        
 
        3. 
 
      
 
      
 
      
-
      
+
      
 any 
         public
        construct/copy/destruct
      
 
        
 
      1. 
-
        any();
        
+
        any();
        
 
        Constructs an empty any.
        
 
        Except as otherwise noted, all operations on an empty any result in a bad_function_call exception. The copy-constructor of an empty any creates another null any. The destructor of an empty any is a no-op. Comparison operators treat all empty anys as equal.  typeid_of applied to an empty any returns typeid(void).
        
 
        An any which does not include relaxed in its  Concept can never be null.
        
@@ -110,7 +109,7 @@
    69. -
      template<typename U> any(U && data);
      +
      template<typename U> any(U && data);

      Constructs an any to hold a copy of data. The Concept will be instantiated with the placeholder T bound to U.

      @@ -161,7 +160,7 @@ 

    70. template<typename U, typename Map> 
-  any(U && data, const static_binding< Map > & binding);
      + any(U && data, const static_binding< Map > & binding);

      Constructs an any to hold a copy of data with explicitly specified placeholder bindings.

      @@ -218,7 +217,7 @@

  • -
    any(const any & other);
    +
    any(const any & other);

    Copies an any.

    @@ -256,7 +255,7 @@ 

  • template<typename Concept2, typename Tag2> 
-  any(const any< Concept2, Tag2 > & other);
    + any(const any< Concept2, Tag2 > & other);

    Upcasts from an any with stricter requirements to an any with weaker requirements.

    @@ -284,7 +283,7 @@

    Requires:

    -

    Concept must contain constructible<T(const T&)>.

    +

    Concept must contain constructible<T(const T&)>.

    Concept must not refer to any non-deduced placeholder besides T.

    After substituting T for Tag2, the requirements of Concept2 must be a superset of the requirements of Concept.

    @@ -298,7 +297,7 @@ 
  • template<typename Concept2, typename Tag2, typename Map> 
-  any(const any< Concept2, Tag2 > & other, 
+  any(const any< Concept2, Tag2 > & other, 
       const static_binding< Map > & binding);

    Constructs an any from another any.

    @@ -333,7 +332,7 @@

    Requires:

    -

    Concept must contain constructible<T(const T&)>.

    +

    Concept must contain constructible<T(const T&)>.

    Map must be an MPL map with keys for all the non-deduced placeholders used by Concept and values for the corresponding placeholders in Concept2.

    After substituting placeholders according to Map, the requirements of Concept2 must be a superset of the requirements of Concept.

    @@ -347,7 +346,7 @@ 
  • template<typename Concept2, typename Tag2> 
-  any(const any< Concept2, Tag2 > & other, const binding< Concept > & binding);
    + any(const any< Concept2, Tag2 > & other, const binding< Concept > & binding);

    Constructs an any from another any.

    @@ -391,7 +390,7 @@

    Requires:

    -

    Concept must contain constructible<T(const T&)>.

    +

    Concept must contain constructible<T(const T&)>.

    The type stored in other must match the type expected by binding.

    @@ -407,7 +406,7 @@
  • -
    template<class... U> explicit any(U &&... arg);
    +
    template<class... U> explicit any(U &&... arg);

    Calls a constructor of the contained type. The bindings will be deduced from the arguments.

    @@ -458,7 +457,7 @@ 

  • template<class... U> 
-  explicit any(const binding< Concept > & binding, U &&... arg);
    + explicit any(const binding< Concept > & binding, U &&... arg);

    Calls a constructor of the contained type.

    @@ -509,27 +508,18 @@

  • -
    any & operator=(const any & other);
    +
    template<typename U> any & operator=(U && other);

    Assigns to an any.

    If an appropriate overload of assignable is not available and relaxed is in Concept, falls back on constructing from other.

    -

    -

    -
    ---- - - - - +

    Throws:

    		Whatever the assignment operator of the contained type throws. When falling back on construction, throws std::bad_alloc or whatever the copy constructor of the contained type throws. In this case assignment provides the strong exception guarantee. When calling the assignment operator of the contained type, the exception guarantee is whatever the contained type provides.
    + + + + +
    [Note]Note

    If U is an any, then this can decide dynamically whether to use construction based on the type stored in other.

    -
    • -
  • -
    template<typename U> any & operator=(const U & other);
    -

    Assigns to an any.

    -

    If an appropriate overload of assignable is not available and relaxed is in Concept, falls back on constructing from other.

    +

    @@ -538,12 +528,12 @@ - +

    Throws:

    		Whatever the assignment operator of the contained type throws. When falling back on construction, throws std::bad_alloc or whatever the copy constructor of the contained type throws. In this case assignment provides the strong exception guarantee. When calling an assignment operator of the contained type, the exception guarantee is whatever the contained type provides. Whatever the assignment operator of the contained type throws. When falling back on construction, throws std::bad_alloc or whatever the move (or copy) constructor of the contained type throws. In this case move assignment provides the strong exception guarantee. When calling a (move) assignment operator of the contained type, the exception guarantee is whatever the contained type provides.
  • -
    ~any();
    +
    ~any();

    @@ -559,6 +549,14 @@ +
    +

    Specializations

    +
    +
    @@ -571,7 +569,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/type_erasure/any_Conc_1_3_41_13_1_1_1_1.html b/doc/html/boost/type_erasure/any_Conc_1_3_41_13_1_1_1_1.html deleted file mode 100644 index 3996d0f6c3..0000000000 --- a/doc/html/boost/type_erasure/any_Conc_1_3_41_13_1_1_1_1.html +++ /dev/null @@ -1,560 +0,0 @@ - - - - -Class template any<Concept, T &> - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Class template any<Concept, T &>

    -

    boost::type_erasure::any<Concept, T &>

    -
    -

    Synopsis

    -
    // In header: <boost/type_erasure/any.hpp>
-
-template<typename Concept, typename T> 
-class any<Concept, T &> {
-public:
-  // construct/copy/destruct
-  template<typename U> any(U &);
-  template<typename U, typename Map> any(U &, const static_binding< Map > &);
-  any(const any &);
-  any(any< Concept, T > &);
-  template<typename Concept2, typename Tag2> 
-    any(const any< Concept2, Tag2 & > &);
-  template<typename Concept2, typename Tag2> any(any< Concept2, Tag2 > &);
-  template<typename Concept2, typename Tag2, typename Map> 
-    any(const any< Concept2, Tag2 & > &, const static_binding< Map > &);
-  template<typename Concept2, typename Tag2, typename Map> 
-    any(any< Concept2, Tag2 > &, const static_binding< Map > &);
-  template<typename Concept2, typename Tag2> 
-    any(const any< Concept2, Tag2 & > &, const binding< Concept > &);
-  template<typename Concept2, typename Tag2> 
-    any(any< Concept2, Tag2 > &, const binding< Concept > &);
-  any & operator=(const any &);
-  template<typename U> any & operator=(U &);
-  template<typename U> any & operator=(const U &);
-};
    -
    -

    Description

    -
    -

    -any - public - construct/copy/destruct

    -
      -
    1. -
      template<typename U> any(U & arg);
      -

      Constructs an any from a reference.

      -

      - - -

      -
      ---- - - - - - - - - - - - - - - -

      Parameters:

      ---- - - - - -

      arg

      The object to bind the reference to.

      Requires:

      		 -

      U is a model of Concept.

      -

      Concept must not refer to any non-deduced placeholder besides T.

      -

      Throws:

      		Nothing.
      -
      2. -
    2. -
      template<typename U, typename Map> 
-  any(U & arg, const static_binding< Map > & binding);
      -

      Constructs an any from a reference.

      -

      - - -

      -
      ---- - - - - - - - - - - - - - - -

      Parameters:

      ---- - - - - - - - - - - -

      arg

      The object to bind the reference to.

      binding

      Specifies the actual types that all the placeholders should bind to.

      Requires:

      		 -

      U is a model of Concept.

      -

      Map is an MPL map with an entry for every non-deduced placeholder referred to by Concept.

      -

      Throws:

      		Nothing.
      -
      3. -
    3. -
      any(const any & other);
      -

      Constructs an any from another reference.

      -

      - -

      -
      ---- - - - - - - - - - - -

      Parameters:

      ---- - - - - -

      other

      The reference to copy.

      Throws:

      		Nothing.
      -
      4. -
    4. -
      any(any< Concept, T > & other);
      -

      Constructs an any from another any.

      -

      - -

      -
      ---- - - - - - - - - - - -

      Parameters:

      ---- - - - - -

      other

      The object to bind the reference to.

      Throws:

      		Nothing.
      -
      5. -
    5. -
      template<typename Concept2, typename Tag2> 
-  any(const any< Concept2, Tag2 & > & other);
      -

      Constructs an any from another reference.

      -

      - - -

      -
      ---- - - - - - - - - - - - - - - -

      Parameters:

      ---- - - - - -

      other

      The reference to copy.

      Requires:

      		 -

      Concept must not refer to any non-deduced placeholder besides T.

      -

      After substituting T for Tag2, the requirements of Concept2 must be a superset of the requirements of Concept.

      -

      Throws:

      		std::bad_alloc
      -
      6. -
    6. -
      template<typename Concept2, typename Tag2> any(any< Concept2, Tag2 > & other);
      -

      Constructs an any from another any.

      -

      - - -

      -
      ---- - - - - - - - - - - - - - - -

      Parameters:

      ---- - - - - -

      other

      The object to bind the reference to.

      Requires:

      		 -

      Concept must not refer to any non-deduced placeholder besides T.

      -

      After substituting T for Tag2, the requirements of Concept2 must be a superset of the requirements of Concept.

      -

      Throws:

      		std::bad_alloc
      -
      7. -
    7. -
      template<typename Concept2, typename Tag2, typename Map> 
-  any(const any< Concept2, Tag2 & > & other, 
-      const static_binding< Map > & binding);
      -

      Constructs an any from another reference.

      -

      - - -

      -
      ---- - - - - - - - - - - - - - - -

      Parameters:

      ---- - - - - - - - - - - -

      binding

      Specifies the mapping between the two concepts.

      other

      The reference to copy.

      Requires:

      		 -

      Map must be an MPL map with keys for all the non-deduced placeholders used by Concept and values for the corresponding placeholders in Concept2.

      -

      After substituting placeholders according to Map, the requirements of Concept2 must be a superset of the requirements of Concept.

      -

      Throws:

      		std::bad_alloc
      -
      8. -
    8. -
      template<typename Concept2, typename Tag2, typename Map> 
-  any(any< Concept2, Tag2 > & other, const static_binding< Map > & binding);
      -

      Constructs an any from another any.

      -

      - - -

      -
      ---- - - - - - - - - - - - - - - -

      Parameters:

      ---- - - - - - - - - - - -

      binding

      Specifies the mapping between the two concepts.

      other

      The object to bind the reference to.

      Requires:

      		 -

      Map must be an MPL map with keys for all the non-deduced placeholders used by Concept and values for the corresponding placeholders in Concept2.

      -

      After substituting placeholders according to Map, the requirements of Concept2 must be a superset of the requirements of Concept.

      -

      Throws:

      		std::bad_alloc
      -
      9. -
    9. -
      template<typename Concept2, typename Tag2> 
-  any(const any< Concept2, Tag2 & > & other, 
-      const binding< Concept > & binding);
      -

      Constructs an any from another reference.

      -

      - - - -

      -
      ---- - - - - - - - - - - - - - - - - - - -

      Parameters:

      ---- - - - - - - - - - - -

      binding

      Specifies the bindings of placeholders to actual types.

      other

      The reference to copy.

      Requires:

      The type stored in other must match the type expected by binding.

      Postconditions:

      binding_of(*this) == binding

      Throws:

      		Nothing.
      -
      10. -
    10. -
      template<typename Concept2, typename Tag2> 
-  any(any< Concept2, Tag2 > & other, const binding< Concept > & binding);
      -

      Constructs an any from another any.

      -

      - - - -

      -
      ---- - - - - - - - - - - - - - - - - - - -

      Parameters:

      ---- - - - - - - - - - - -

      binding

      Specifies the bindings of placeholders to actual types.

      other

      The object to bind the reference to.

      Requires:

      The type stored in other must match the type expected by binding.

      Postconditions:

      binding_of(*this) == binding

      Throws:

      		Nothing.
      -
      11. -
    11. -
      any & operator=(const any & other);
      -

      Assigns to an any.

      -

      If an appropriate overload of assignable is not available and relaxed is in Concept, falls back on constructing from other.

      -

      -

      -
      ---- - - - - -

      Throws:

      		Whatever the assignment operator of the contained type throws. When falling back on construction, throws std::bad_alloc. In this case assignment provides the strong exception guarantee. When calling the assignment operator of the contained type, the exception guarantee is whatever the contained type provides.
      -
      12. -
    12. -
      template<typename U> any & operator=(U & other);
      -

      Assigns to an any.

      -

      If an appropriate overload of assignable is not available and relaxed is in Concept, falls back on constructing from other.

      -

      -

      -
      ---- - - - - -

      Throws:

      		Whatever the assignment operator of the contained type throws. When falling back on construction, throws std::bad_alloc. In this case assignment provides the strong exception guarantee. When calling the assignment operator of the contained type, the exception guarantee is whatever the contained type provides.
      -
      13. -
    13. -
      template<typename U> any & operator=(const U & other);
      -

      Assigns to an any.

      -

      If an appropriate overload of assignable is not available and relaxed is in Concept, falls back on constructing from other.

      -

      -

      -
      ---- - - - - -

      Throws:

      		Whatever the assignment operator of the contained type throws. When falling back on construction, throws std::bad_alloc. In this case assignment provides the strong exception guarantee. When calling the assignment operator of the contained type, the exception guarantee is whatever the contained type provides.
      -
      14. -
    -
    -
    -
    - - - -
    Copyright © 2011-2013 Steven Watanabe

    - Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/type_erasure/any_Conc_1_3_41_13_1_1_1_2.html b/doc/html/boost/type_erasure/any_Conc_1_3_41_13_1_1_1_2.html index 399e7fcebc..48f467f36e 100644 --- a/doc/html/boost/type_erasure/any_Conc_1_3_41_13_1_1_1_2.html +++ b/doc/html/boost/type_erasure/any_Conc_1_3_41_13_1_1_1_2.html @@ -2,13 +2,13 @@ -Class template any<Concept, const T &> +Class template any<Concept, T &> - - + + @@ -21,47 +21,48 @@
    -PrevUpHomeNext +PrevUpHomeNext
    -

    Class template any<Concept, const T &>

    -

    boost::type_erasure::any<Concept, const T &>

    +

    Class template any<Concept, T &>

    +

    boost::type_erasure::any<Concept, T &>

    Synopsis

    // In header: <boost/type_erasure/any.hpp>
 
 template<typename Concept, typename T> 
-class any<Concept, const T &> {
+class any<Concept, T &> {
 public:
   // construct/copy/destruct
-  template<typename U> any(const U &);
-  template<typename U, typename Map> 
-    any(const U &, const static_binding< Map > &);
+  template<typename U> any(U &);
+  template<typename U, typename Map> any(U &, const static_binding< Map > &);
   any(const any &);
-  any(const any< Concept, T & > &);
-  any(const any< Concept, T > &);
-  any(const any< Concept, T && > &);
+  any(any< Concept, T > &);
   template<typename Concept2, typename Tag2> 
-    any(const any< Concept2, Tag2 > &);
+    any(const any< Concept2, Tag2 & > &);
+  template<typename Concept2, typename Tag2> any(any< Concept2, Tag2 > &);
   template<typename Concept2, typename Tag2, typename Map> 
-    any(const any< Concept2, Tag2 > &, const static_binding< Map > &);
+    any(const any< Concept2, Tag2 & > &, const static_binding< Map > &);
+  template<typename Concept2, typename Tag2, typename Map> 
+    any(any< Concept2, Tag2 > &, const static_binding< Map > &);
+  template<typename Concept2, typename Tag2> 
+    any(const any< Concept2, Tag2 & > &, const binding< Concept > &);
   template<typename Concept2, typename Tag2> 
-    any(const any< Concept2, Tag2 > &, const binding< Concept > &);
-  any & operator=(const any &);
-  template<typename U> any & operator=(const U &);
+    any(any< Concept2, Tag2 > &, const binding< Concept > &);
+  template<typename U> any & operator=(U &&);
 };
    -

    Description

    +

    Description

    -

    +

    any public construct/copy/destruct

    1. -
      template<typename U> any(const U & arg);
      +
      template<typename U> any(U & arg);

      Constructs an any from a reference.

      @@ -102,7 +103,7 @@ 

    2. template<typename U, typename Map> 
-  any(const U & arg, const static_binding< Map > & binding);
      + any(U & arg, const static_binding< Map > & binding);

      Constructs an any from a reference.

      @@ -149,7 +150,7 @@ 

    3. any(const any & other);
      -

      Constructs an any from another any.

      +

      Constructs an any from another reference.

      @@ -180,7 +181,7 @@
  • -
    any(const any< Concept, T & > & other);
    +
    any(any< Concept, T > & other);

    Constructs an any from another any.

    @@ -200,7 +201,7 @@

    other

    -

    The reference to copy.

    +

    The object to bind the reference to.

    @@ -212,10 +213,12 @@
  • -
    any(const any< Concept, T > & other);
    -

    Constructs an any from another any.

    +
    template<typename Concept2, typename Tag2> 
+  any(const any< Concept2, Tag2 & > & other);
    +

    Constructs an any from another reference.

    +

    @@ -232,22 +235,30 @@ - +

    other

    The object to bind the reference to.

    The reference to copy.
    +

    Requires:

    + +

    Concept must not refer to any non-deduced placeholder besides T.

    +

    After substituting T for Tag2, the requirements of Concept2 must be a superset of the requirements of Concept.

    + + +

    Throws:

    -Nothing. +std::bad_alloc
  • -
    any(const any< Concept, T && > & other);
    +
    template<typename Concept2, typename Tag2> any(any< Concept2, Tag2 > & other);

    Constructs an any from another any.

    +

    @@ -269,16 +280,24 @@
    +

    Requires:

    + +

    Concept must not refer to any non-deduced placeholder besides T.

    +

    After substituting T for Tag2, the requirements of Concept2 must be a superset of the requirements of Concept.

    + + +

    Throws:

    -Nothing. +std::bad_alloc
  • -
    template<typename Concept2, typename Tag2> 
-  any(const any< Concept2, Tag2 > & other);
    -

    Constructs an any from another any.

    +
    template<typename Concept2, typename Tag2, typename Map> 
+  any(const any< Concept2, Tag2 & > & other, 
+      const static_binding< Map > & binding);
    +

    Constructs an any from another reference.

    @@ -296,17 +315,23 @@ - + + +

    binding

    +

    Specifies the mapping between the two concepts.

    + +

    other

    -

    The object to bind the reference to.

    - +

    The reference to copy.

    + +

    Requires:

    -

    Concept must not refer to any non-deduced placeholder besides T.

    -

    After substituting T for Tag2, the requirements of Concept2 must be a superset of the requirements of Concept.

    +

    Map must be an MPL map with keys for all the non-deduced placeholders used by Concept and values for the corresponding placeholders in Concept2.

    +

    After substituting placeholders according to Map, the requirements of Concept2 must be a superset of the requirements of Concept.

    @@ -318,8 +343,7 @@ 
  • template<typename Concept2, typename Tag2, typename Map> 
-  any(const any< Concept2, Tag2 > & other, 
-      const static_binding< Map > & binding);
    + any(any< Concept2, Tag2 > & other, const static_binding< Map > & binding);

    Constructs an any from another any.

    @@ -366,8 +390,9 @@ 

  • template<typename Concept2, typename Tag2> 
-  any(const any< Concept2, Tag2 > & other, const binding< Concept > & binding);
    -

    Constructs an any from another any.

    + any(const any< Concept2, Tag2 & > & other, + const binding< Concept > & binding); +

    Constructs an any from another reference.

    @@ -393,7 +418,7 @@

    other

    -

    The object to bind the reference to.

    +

    The reference to copy.

    @@ -414,10 +439,13 @@
  • -
    any & operator=(const any & other);
    -

    Assigns to an any.

    +
    template<typename Concept2, typename Tag2> 
+  any(any< Concept2, Tag2 > & other, const binding< Concept > & binding);
    +

    Constructs an any from another any.

    + +

    @@ -426,8 +454,31 @@ + + + + - + + + + + @@ -437,26 +488,20 @@

    Parameters:

    ++++ + + + + + + + + + + +

    binding

    Specifies the bindings of placeholders to actual types.

    other

    The object to bind the reference to.

    Requires:

    relaxed is in Concept.

    The type stored in other must match the type expected by binding.

    Postconditions:

    binding_of(*this) == binding

    Throws:

  • -
    template<typename U> any & operator=(const U & other);
    +
    template<typename U> any & operator=(U && other);

    Assigns to an any.

    +

    If an appropriate overload of assignable is not available and relaxed is in Concept, falls back on constructing from other.

    -

    - - - - - - + - - - + +

    Requires:

    relaxed is in Concept.

    Throws:

    		std::bad_alloc. Provides the strong exception guarantee.
    Whatever the assignment operator of the contained type throws. When falling back on construction, can only throw std::bad_alloc if U is an any that uses a different Concept. In this case assignment provides the strong exception guarantee. When calling the assignment operator of the contained type, the exception guarantee is whatever the contained type provides.
    • @@ -473,7 +518,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/type_erasure/any_Conc_1_3_41_13_1_1_1_3.html b/doc/html/boost/type_erasure/any_Conc_1_3_41_13_1_1_1_3.html index ef0b41dc95..bf98873266 100644 --- a/doc/html/boost/type_erasure/any_Conc_1_3_41_13_1_1_1_3.html +++ b/doc/html/boost/type_erasure/any_Conc_1_3_41_13_1_1_1_3.html @@ -2,13 +2,13 @@ -Class template any<Concept, T &&> +Class template any<Concept, const T &> - - + + @@ -21,48 +21,47 @@
    -PrevUpHomeNext +PrevUpHomeNext
    -

    Class template any<Concept, T &&>

    -

    boost::type_erasure::any<Concept, T &&>

    +

    Class template any<Concept, const T &>

    +

    boost::type_erasure::any<Concept, const T &>

    Synopsis

    // In header: <boost/type_erasure/any.hpp>
 
 template<typename Concept, typename T> 
-class any<Concept, T &&> {
+class any<Concept, const T &> {
 public:
   // construct/copy/destruct
-  template<typename U> any(U &&);
-  template<typename U, typename Map> any(U &&, const static_binding< Map > &);
-  any(any< Concept, T > &&);
-  template<typename Concept2, typename Tag2> any(any< Concept2, Tag2 && > &&);
-  template<typename Concept2, typename Tag2> any(any< Concept2, Tag2 > &&);
-  template<typename Concept2, typename Tag2, typename Map> 
-    any(const any< Concept2, Tag2 && > &, const static_binding< Map > &);
-  template<typename Concept2, typename Tag2, typename Map> 
-    any(any< Concept2, Tag2 > &&, const static_binding< Map > &);
+  template<typename U> any(const U &);
+  template<typename U, typename Map> 
+    any(const U &, const static_binding< Map > &);
+  any(const any &);
+  any(const any< Concept, T & > &);
+  any(const any< Concept, T > &);
+  any(const any< Concept, T && > &);
   template<typename Concept2, typename Tag2> 
-    any(const any< Concept2, Tag2 && > &, const binding< Concept > &);
+    any(const any< Concept2, Tag2 > &);
+  template<typename Concept2, typename Tag2, typename Map> 
+    any(const any< Concept2, Tag2 > &, const static_binding< Map > &);
   template<typename Concept2, typename Tag2> 
-    any(any< Concept2, Tag2 > &&, const binding< Concept > &);
+    any(const any< Concept2, Tag2 > &, const binding< Concept > &);
   any & operator=(const any &);
-  template<typename U> any & operator=(U &);
-  template<typename U> any & operator=(const U &);
+  template<typename U> any & operator=(const U &);
 };
    -

    Description

    +

    Description

    -

    +

    any public construct/copy/destruct

    1. -
      template<typename U> any(U && arg);
      +
      template<typename U> any(const U & arg);

      Constructs an any from a reference.

      @@ -103,7 +102,7 @@ 

    2. template<typename U, typename Map> 
-  any(U && arg, const static_binding< Map > & binding);
      + any(const U & arg, const static_binding< Map > & binding);

      Constructs an any from a reference.

      @@ -149,12 +148,10 @@

  • -
    any(any< Concept, T > && other);
    -

    Constructs an any from another rvalue reference.

    +
    any(const any & other);
    +

    Constructs an any from another any.

    - -

    @@ -171,30 +168,22 @@ - +

    other

    		 -

    The reference to copy.

    -

    The object to bind the reference to.

    -

    The reference to copy.

    Throws:

    - -

    Nothing. Constructs an any from another any.

    -

    Nothing.

    - +Nothing.
  • -
    template<typename Concept2, typename Tag2> 
-  any(any< Concept2, Tag2 && > && other);
    -

    Constructs an any from another rvalue reference.

    +
    any(const any< Concept, T & > & other);
    +

    Constructs an any from another any.

    -

    @@ -216,25 +205,17 @@
    -

    Requires:

    - -

    Concept must not refer to any non-deduced placeholder besides T.

    -

    After substituting T for Tag2, the requirements of Concept2 must be a superset of the requirements of Concept.

    - - -

    Throws:

    -std::bad_alloc +Nothing.
  • -
    template<typename Concept2, typename Tag2> any(any< Concept2, Tag2 > && other);
    +
    any(const any< Concept, T > & other);

    Constructs an any from another any.

    -

    @@ -256,27 +237,17 @@
    -

    Requires:

    - -

    Concept must not refer to any non-deduced placeholder besides T.

    -

    After substituting T for Tag2, the requirements of Concept2 must be a superset of the requirements of Concept.

    - - -

    Throws:

    -std::bad_alloc +Nothing.
  • -
    template<typename Concept2, typename Tag2, typename Map> 
-  any(const any< Concept2, Tag2 && > & other, 
-      const static_binding< Map > & binding);
    -

    Constructs an any from another reference.

    +
    any(const any< Concept, T && > & other);
    +

    Constructs an any from another any.

    -

    @@ -291,35 +262,22 @@ - - - - - - + - - - + +

    binding

    Specifies the mapping between the two concepts.

    other

    The reference to copy.

    The object to bind the reference to.
    -

    Requires:

    - -

    Map must be an MPL map with keys for all the non-deduced placeholders used by Concept and values for the corresponding placeholders in Concept2.

    -

    After substituting placeholders according to Map, the requirements of Concept2 must be a superset of the requirements of Concept.

    - - -

    Throws:

    -std::bad_alloc +Nothing.
  • -
    template<typename Concept2, typename Tag2, typename Map> 
-  any(any< Concept2, Tag2 > && other, const static_binding< Map > & binding);
    +
    template<typename Concept2, typename Tag2> 
+  any(const any< Concept2, Tag2 > & other);

    Constructs an any from another any.

    @@ -338,23 +296,17 @@ - - -

    binding

    -

    Specifies the mapping between the two concepts.

    - - +

    other

    -

    The object to bind the reference to.

    - - +

    The object to bind the reference to.

    +

    Requires:

    -

    Map must be an MPL map with keys for all the non-deduced placeholders used by Concept and values for the corresponding placeholders in Concept2.

    -

    After substituting placeholders according to Map, the requirements of Concept2 must be a superset of the requirements of Concept.

    +

    Concept must not refer to any non-deduced placeholder besides T.

    +

    After substituting T for Tag2, the requirements of Concept2 must be a superset of the requirements of Concept.

    @@ -365,14 +317,13 @@
  • -
    template<typename Concept2, typename Tag2> 
-  any(const any< Concept2, Tag2 && > & other, 
-      const binding< Concept > & binding);
    -

    Constructs an any from another rvalue reference.

    +
    template<typename Concept2, typename Tag2, typename Map> 
+  any(const any< Concept2, Tag2 > & other, 
+      const static_binding< Map > & binding);
    +

    Constructs an any from another any.

    -

    @@ -390,33 +341,32 @@ - + - +

    binding

    Specifies the bindings of placeholders to actual types.

    Specifies the mapping between the two concepts.

    other

    The reference to copy.

    The object to bind the reference to.

    Requires:

    -

    The type stored in other must match the type expected by binding.

    - - -

    Postconditions:

    -

    binding_of(*this) == binding

    + +

    Map must be an MPL map with keys for all the non-deduced placeholders used by Concept and values for the corresponding placeholders in Concept2.

    +

    After substituting placeholders according to Map, the requirements of Concept2 must be a superset of the requirements of Concept.

    +

    Throws:

    -Nothing. +std::bad_alloc 
  • template<typename Concept2, typename Tag2> 
-  any(any< Concept2, Tag2 > && other, const binding< Concept > & binding);
    + any(const any< Concept2, Tag2 > & other, const binding< Concept > & binding);

    Constructs an any from another any.

    @@ -466,52 +416,47 @@ 

  • any & operator=(const any & other);

    Assigns to an any.

    -

    If an appropriate overload of assignable is not available and relaxed is in Concept, falls back on constructing from other.

    -

    -

    -
    ---- - - - - -

    Throws:

    		Whatever the assignment operator of the contained type throws. When falling back on construction, throws std::bad_alloc. In this case assignment provides the strong exception guarantee. When calling the assignment operator of the contained type, the exception guarantee is whatever the contained type provides.
    -
    • -
  • -
    template<typename U> any & operator=(U & other);
    -

    Assigns to an any.

    -

    If an appropriate overload of assignable is not available and relaxed is in Concept, falls back on constructing from other.

    +

    - + + + + + + - - + + +

    Requires:

    relaxed is in Concept.

    Throws:

    		Whatever the assignment operator of the contained type throws. When falling back on construction, throws std::bad_alloc. In this case assignment provides the strong exception guarantee. When calling the assignment operator of the contained type, the exception guarantee is whatever the contained type provides.
    Nothing.
  • -
    template<typename U> any & operator=(const U & other);
    +
    template<typename U> any & operator=(const U & other);

    Assigns to an any.

    -

    If an appropriate overload of assignable is not available and relaxed is in Concept, falls back on constructing from other.

    +

    - + + + + + + - - + + +

    Requires:

    relaxed is in Concept.

    Throws:

    		Whatever the assignment operator of the contained type throws. When falling back on construction, throws std::bad_alloc. In this case assignment provides the strong exception guarantee. When calling the assignment operator of the contained type, the exception guarantee is whatever the contained type provides.
    std::bad_alloc. Provides the strong exception guarantee.
    • @@ -528,7 +473,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/type_erasure/any_Conc_1_3_41_13_1_1_1_4.html b/doc/html/boost/type_erasure/any_Conc_1_3_41_13_1_1_1_4.html new file mode 100644 index 0000000000..527160060d --- /dev/null +++ b/doc/html/boost/type_erasure/any_Conc_1_3_41_13_1_1_1_4.html @@ -0,0 +1,498 @@ + + + + +Class template any<Concept, T &&> + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Class template any<Concept, T &&>

    +

    boost::type_erasure::any<Concept, T &&>

    +
    +

    Synopsis

    +
    // In header: <boost/type_erasure/any.hpp>
+
+template<typename Concept, typename T> 
+class any<Concept, T &&> {
+public:
+  // construct/copy/destruct
+  template<typename U> any(U &&);
+  template<typename U, typename Map> any(U &&, const static_binding< Map > &);
+  any(any< Concept, T > &&);
+  template<typename Concept2, typename Tag2> any(any< Concept2, Tag2 && > &&);
+  template<typename Concept2, typename Tag2> any(any< Concept2, Tag2 > &&);
+  template<typename Concept2, typename Tag2, typename Map> 
+    any(const any< Concept2, Tag2 && > &, const static_binding< Map > &);
+  template<typename Concept2, typename Tag2, typename Map> 
+    any(any< Concept2, Tag2 > &&, const static_binding< Map > &);
+  template<typename Concept2, typename Tag2> 
+    any(const any< Concept2, Tag2 && > &, const binding< Concept > &);
+  template<typename Concept2, typename Tag2> 
+    any(any< Concept2, Tag2 > &&, const binding< Concept > &);
+  template<typename U> any & operator=(U &&);
+};
    +
    +

    Description

    +
    +

    +any + public + construct/copy/destruct

    +
      +
    1. +
      template<typename U> any(U && arg);
      +

      Constructs an any from a reference.

      +

      + + +

      +
      ++++ + + + + + + + + + + + + + + +

      Parameters:

      ++++ + + + + +

      arg

      The object to bind the reference to.

      Requires:

      		 +

      U is a model of Concept.

      +

      Concept must not refer to any non-deduced placeholder besides T.

      +

      Throws:

      		Nothing.
      +
      2. +
    2. +
      template<typename U, typename Map> 
+  any(U && arg, const static_binding< Map > & binding);
      +

      Constructs an any from a reference.

      +

      + + +

      +
      ++++ + + + + + + + + + + + + + + +

      Parameters:

      ++++ + + + + + + + + + + +

      arg

      The object to bind the reference to.

      binding

      Specifies the actual types that all the placeholders should bind to.

      Requires:

      		 +

      U is a model of Concept.

      +

      Map is an MPL map with an entry for every non-deduced placeholder referred to by Concept.

      +

      Throws:

      		Nothing.
      +
      3. +
    3. +
      any(any< Concept, T > && other);
      +

      Constructs an any from another rvalue reference.

      +

      + + + +

      +
      ++++ + + + + + + + + + + +

      Parameters:

      ++++ + + + + +

      other

      		 +

      The reference to copy.

      +

      The object to bind the reference to.

      +

      Throws:

      		 +

      Nothing. Constructs an any from another any.

      +

      Nothing.

      +
      +
      4. +
    4. +
      template<typename Concept2, typename Tag2> 
+  any(any< Concept2, Tag2 && > && other);
      +

      Constructs an any from another rvalue reference.

      +

      + + +

      +
      ++++ + + + + + + + + + + + + + + +

      Parameters:

      ++++ + + + + +

      other

      The reference to copy.

      Requires:

      		 +

      Concept must not refer to any non-deduced placeholder besides T.

      +

      After substituting T for Tag2, the requirements of Concept2 must be a superset of the requirements of Concept.

      +

      Throws:

      		std::bad_alloc
      +
      5. +
    5. +
      template<typename Concept2, typename Tag2> any(any< Concept2, Tag2 > && other);
      +

      Constructs an any from another any.

      +

      + + +

      +
      ++++ + + + + + + + + + + + + + + +

      Parameters:

      ++++ + + + + +

      other

      The object to bind the reference to.

      Requires:

      		 +

      Concept must not refer to any non-deduced placeholder besides T.

      +

      After substituting T for Tag2, the requirements of Concept2 must be a superset of the requirements of Concept.

      +

      Throws:

      		std::bad_alloc
      +
      6. +
    6. +
      template<typename Concept2, typename Tag2, typename Map> 
+  any(const any< Concept2, Tag2 && > & other, 
+      const static_binding< Map > & binding);
      +

      Constructs an any from another reference.

      +

      + + +

      +
      ++++ + + + + + + + + + + + + + + +

      Parameters:

      ++++ + + + + + + + + + + +

      binding

      Specifies the mapping between the two concepts.

      other

      The reference to copy.

      Requires:

      		 +

      Map must be an MPL map with keys for all the non-deduced placeholders used by Concept and values for the corresponding placeholders in Concept2.

      +

      After substituting placeholders according to Map, the requirements of Concept2 must be a superset of the requirements of Concept.

      +

      Throws:

      		std::bad_alloc
      +
      7. +
    7. +
      template<typename Concept2, typename Tag2, typename Map> 
+  any(any< Concept2, Tag2 > && other, const static_binding< Map > & binding);
      +

      Constructs an any from another any.

      +

      + + +

      +
      ++++ + + + + + + + + + + + + + + +

      Parameters:

      ++++ + + + + + + + + + + +

      binding

      Specifies the mapping between the two concepts.

      other

      The object to bind the reference to.

      Requires:

      		 +

      Map must be an MPL map with keys for all the non-deduced placeholders used by Concept and values for the corresponding placeholders in Concept2.

      +

      After substituting placeholders according to Map, the requirements of Concept2 must be a superset of the requirements of Concept.

      +

      Throws:

      		std::bad_alloc
      +
      8. +
    8. +
      template<typename Concept2, typename Tag2> 
+  any(const any< Concept2, Tag2 && > & other, 
+      const binding< Concept > & binding);
      +

      Constructs an any from another rvalue reference.

      +

      + + + +

      +
      ++++ + + + + + + + + + + + + + + + + + + +

      Parameters:

      ++++ + + + + + + + + + + +

      binding

      Specifies the bindings of placeholders to actual types.

      other

      The reference to copy.

      Requires:

      The type stored in other must match the type expected by binding.

      Postconditions:

      binding_of(*this) == binding

      Throws:

      		Nothing.
      +
      9. +
    9. +
      template<typename Concept2, typename Tag2> 
+  any(any< Concept2, Tag2 > && other, const binding< Concept > & binding);
      +

      Constructs an any from another any.

      +

      + + + +

      +
      ++++ + + + + + + + + + + + + + + + + + + +

      Parameters:

      ++++ + + + + + + + + + + +

      binding

      Specifies the bindings of placeholders to actual types.

      other

      The object to bind the reference to.

      Requires:

      The type stored in other must match the type expected by binding.

      Postconditions:

      binding_of(*this) == binding

      Throws:

      		Nothing.
      +
      10. +
    10. +
      template<typename U> any & operator=(U && other);
      +

      Assigns to an any.

      +

      If an appropriate overload of assignable is not available and relaxed is in Concept, falls back on constructing from other.

      +

      +

      +
      ++++ + + + + +

      Throws:

      		Whatever the assignment operator of the contained type throws. When falling back on construction, can only throw std::bad_alloc if U is an any that uses a different Concept. In this case assignment provides the strong exception guarantee. When calling the assignment operator of the contained type, the exception guarantee is whatever the contained type provides.
      +
      11. +
    +
    +
    +
    + + + +
    Copyright © 2011-2013 Steven Watanabe

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost/type_erasure/any_cast.html b/doc/html/boost/type_erasure/any_cast.html index 1f68639856..e2e0bf519a 100644 --- a/doc/html/boost/type_erasure/any_cast.html +++ b/doc/html/boost/type_erasure/any_cast.html @@ -7,8 +7,8 @@ - - + + @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -65,7 +65,7 @@

    Requires:

    if arg is a pointer, T must be a pointer type.

    -

    Concept must contain typeid_<Tag>.

    +

    Concept must contain typeid_<Tag>.

    @@ -87,7 +87,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/type_erasure/as_param.html b/doc/html/boost/type_erasure/as_param.html index 6ae1499ad5..544a315cf6 100644 --- a/doc/html/boost/type_erasure/as_param.html +++ b/doc/html/boost/type_erasure/as_param.html @@ -7,7 +7,7 @@ - + @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -38,8 +38,8 @@ typedef unspecified type; };
    -

    Description

    -

    If T is a (cv/reference qualifed) placeholder, returns param<concept_of<Any>::type, T>, otherwise, returns T. This metafunction is intended to be used for function arguments in specializations of concept_interface.

    +

    Description

    +

    If T is a (cv/reference qualified) placeholder, returns param<concept_of<Any>::type, T>, otherwise, returns T. This metafunction is intended to be used for function arguments in specializations of concept_interface.

    See Also:

    derived, rebind_any

    @@ -56,7 +56,7 @@

    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/type_erasure/assignable.html b/doc/html/boost/type_erasure/assignable.html index 9a6913c160..018e4cbb77 100644 --- a/doc/html/boost/type_erasure/assignable.html +++ b/doc/html/boost/type_erasure/assignable.html @@ -8,7 +8,7 @@ - + @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -32,11 +32,11 @@

    Synopsis

    // In header: <boost/type_erasure/builtin.hpp>
 
-template<typename T = _self, typename U = T> 
+template<typename T = _self, typename U = const T&> 
 struct assignable {
 
   // public static functions
-  static void apply(T &, const U &);
+  static void apply(T &, U);
 };

    Description

    @@ -44,7 +44,7 @@

    assignable public static functions

    -
    1. static void apply(T & dst, const U & src);
    +
    1. static void apply(T & dst, U src);
    @@ -58,7 +58,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/type_erasure/binding.html b/doc/html/boost/type_erasure/binding.html index e4fd3a5827..1cbb84e142 100644 --- a/doc/html/boost/type_erasure/binding.html +++ b/doc/html/boost/type_erasure/binding.html @@ -6,9 +6,9 @@ - - - + + + @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -30,38 +30,38 @@

    boost::type_erasure::binding

    Synopsis

    -
    // In header: <boost/type_erasure/require_match.hpp>
+
    // In header: <boost/type_erasure/binding.hpp>
 
 template<typename Concept> 
 class binding {
 public:
   // construct/copy/destruct
-  binding();
-  template<typename Map> explicit binding(const Map &);
-  template<typename Map> binding(const static_binding< Map > &);
+  binding();
+  template<typename Map> explicit binding(const Map &);
+  template<typename Map> binding(const static_binding< Map > &);
   template<typename Concept2, typename Map> 
-    binding(const binding< Concept2 > &, const Map &);
+    binding(const binding< Concept2 > &, const Map &);
   template<typename Concept2, typename Map> 
-    binding(const binding< Concept2 > &, const static_binding< Map > &);
+    binding(const binding< Concept2 > &, const static_binding< Map > &);
   template<typename Placeholders, typename Map> 
-    binding(const dynamic_binding< Placeholders > &, 
+    binding(const dynamic_binding< Placeholders > &, 
             const static_binding< Map > &);
 
-  // friend functions
-  friend bool operator==(const binding &, const binding &);
-  friend bool operator!=(const binding &, const binding &);
+  // friend functions
+  friend bool operator==(const binding &, const binding &);
+  friend bool operator!=(const binding &, const binding &);
 };
    
 
    
-
    Description
    
+
    Description
    
 
    Stores the binding of a Concept to a set of actual types. Concept is interpreted in the same way as with any. 
    
 
    
-
    
+
    
 binding 
         public
        construct/copy/destruct
    
 
      
 
    1. 
-
      binding();
      
+
      binding();
      
 
      
 
 
      
@@ -83,7 +83,7 @@
 
    
 
 
  • 
-
    template<typename Map> explicit binding(const Map &);
    
+
    template<typename Map> explicit binding(const Map &);
    
 
    
 
 
    
@@ -105,7 +105,7 @@
 
    • 
 
 
  • 
-
    template<typename Map> binding(const static_binding< Map > &);
    
+
    template<typename Map> binding(const static_binding< Map > &);
    
 
    
 
 
    
@@ -128,7 +128,7 @@
 
    • 
 
  • 
 
    template<typename Concept2, typename Map> 
-  binding(const binding< Concept2 > & other, const Map &);
    
+  binding(const binding< Concept2 > & other, const Map &);

    • Converts from another set of bindings.

    @@ -152,7 +152,7 @@ 

  • template<typename Concept2, typename Map> 
-  binding(const binding< Concept2 > & other, const static_binding< Map > &);
    + binding(const binding< Concept2 > & other, const static_binding< Map > &);

    Converts from another set of bindings.

    @@ -176,7 +176,7 @@ 

  • template<typename Placeholders, typename Map> 
-  binding(const dynamic_binding< Placeholders > & other, 
+  binding(const dynamic_binding< Placeholders > & other, 
           const static_binding< Map > &);

    Converts from another set of bindings.

    @@ -202,11 +202,11 @@

    • -

    -binding friend functions

    +

    +binding friend functions

    1. -
      friend bool operator==(const binding & lhs, const binding & rhs);
      +
      friend bool operator==(const binding & lhs, const binding & rhs);

      @@ -228,7 +228,7 @@
  • -
    friend bool operator!=(const binding & lhs, const binding & rhs);
    +
    friend bool operator!=(const binding & lhs, const binding & rhs);

    @@ -263,7 +263,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/type_erasure/binding_of.html b/doc/html/boost/type_erasure/binding_of.html index 6723f79e38..327af3b143 100644 --- a/doc/html/boost/type_erasure/binding_of.html +++ b/doc/html/boost/type_erasure/binding_of.html @@ -7,7 +7,7 @@ - + @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -68,7 +68,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/type_erasure/call.html b/doc/html/boost/type_erasure/call.html index 25ed435779..de44cab625 100644 --- a/doc/html/boost/type_erasure/call.html +++ b/doc/html/boost/type_erasure/call.html @@ -7,7 +7,7 @@ - + @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -81,7 +81,7 @@ Example:

    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/type_erasure/callable.html b/doc/html/boost/type_erasure/callable.html index e1b646fe3a..175eb2b8af 100644 --- a/doc/html/boost/type_erasure/callable.html +++ b/doc/html/boost/type_erasure/callable.html @@ -8,7 +8,7 @@ - + @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -62,7 +62,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/type_erasure/check_match.html b/doc/html/boost/type_erasure/check_match.html index ccba7872cb..ce34171450 100644 --- a/doc/html/boost/type_erasure/check_match.html +++ b/doc/html/boost/type_erasure/check_match.html @@ -7,7 +7,7 @@ - + @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -38,7 +38,7 @@ U &&... args); template<typename Op, class... U> bool check_match(const Op & f, U &&... args);
    -

    Description

    +

    Description

    If relaxed is in Concept, checks whether the arguments to f match the types specified by binding. If relaxed is not in Concept, returns true. If binding is not specified, it will be deduced from the arguments.

    @@ -52,7 +52,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/type_erasure/dynamic_any_cast.html b/doc/html/boost/type_erasure/dynamic_any_cast.html index 87b42e719e..5147c1e8f2 100644 --- a/doc/html/boost/type_erasure/dynamic_any_cast.html +++ b/doc/html/boost/type_erasure/dynamic_any_cast.html @@ -75,7 +75,7 @@ Example:

    Throws:

    -bad_any_cast if the concepts used by R were not previously registered via a call to register_binding. +bad_any_cast if the concepts used by R were not previously registered via a call to register_binding.
    diff --git a/doc/html/boost/type_erasure/is_placeholder.html b/doc/html/boost/type_erasure/is_placeholder.html index 6be8ff886a..e501438380 100644 --- a/doc/html/boost/type_erasure/is_placeholder.html +++ b/doc/html/boost/type_erasure/is_placeholder.html @@ -33,7 +33,7 @@ 
    // In header: <boost/type_erasure/is_placeholder.hpp>
 
 template<typename T> 
-struct is_placeholder : public boost::is_base_and_derived< placeholder, T > {
+struct is_placeholder {
 };

    Description

    diff --git a/doc/html/boost/type_erasure/istreamable.html b/doc/html/boost/type_erasure/istreamable.html index 2ccb01e77d..a5df981f38 100644 --- a/doc/html/boost/type_erasure/istreamable.html +++ b/doc/html/boost/type_erasure/istreamable.html @@ -8,7 +8,7 @@ - + @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -58,7 +58,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/type_erasure/param.html b/doc/html/boost/type_erasure/param.html index 9475ebd88a..37e5042109 100644 --- a/doc/html/boost/type_erasure/param.html +++ b/doc/html/boost/type_erasure/param.html @@ -6,9 +6,9 @@ - - - + + + @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -30,23 +30,23 @@

    boost::type_erasure::param — A wrapper to help with overload resolution for functions operating on an any.

    Synopsis

    -
    // In header: <boost/type_erasure/placeholder_of.hpp>
+
    // In header: <boost/type_erasure/param.hpp>
 
 template<typename Concept, typename T> 
 class param {
 public:
   // construct/copy/destruct
-  template<typename U> param(any< Concept, U > &);
-  template<typename U> param(const any< Concept, U > &);
-  template<typename U> param(any< Concept, U > &&);
+  template<typename U> param(any< Concept, U > &);
+  template<typename U> param(const any< Concept, U > &);
+  template<typename U> param(any< Concept, U > &&);
 
-  // public member functions
-  any< Concept, T > get() const;
+  // public member functions
+  any< Concept, T > get() const;
 };
    
 
    
-
    Description
    
+
    Description
    
 
    The template arguments are interpreted in the same way as any.
    
-
    A parameter of type param can be initialized with an any that has the same Concept and base placeholder when there exists a corresponding standard conversion for the placeholder. A conversion sequence from any<C, P> to param<C, P1> is a better conversion sequence than any<C, P> to param<C, P2> iff the corresponding placeholder standard conversion sequence from P to P1 is a better conversion sequence than P to P2.
    
+
    A parameter of type param can be initialized with an any that has the same Concept and base placeholder when there exists a corresponding standard conversion for the placeholder. A conversion sequence from any<C, P> to param<C, P1> is a better conversion sequence than any<C, P> to param<C, P2> iff the corresponding placeholder standard conversion sequence from P to P1 is a better conversion sequence than P to P2.
    
 
    
@@ -69,21 +69,21 @@ Example:
     
    
-
    
+
    
 param 
         public
        construct/copy/destruct
    
 
      
-
    1. template<typename U> param(any< Concept, U > & a);
      2. 
-
    2. template<typename U> param(const any< Concept, U > & a);
      3. 
-
    3. template<typename U> param(any< Concept, U > && a);
      4. 
+
    4. template<typename U> param(any< Concept, U > & a);
      5. 
+
    5. template<typename U> param(const any< Concept, U > & a);
      6. 
+
    6. template<typename U> param(any< Concept, U > && a);
      7. 
 
    
 
    
-
    
-param public member functions
    
+
    
+param public member functions
    
 
    1. 
-
      any< Concept, T > get() const;
      
+
      any< Concept, T > get() const;
      
 
      Returns the stored any. 
      
 
    
 
    
@@ -99,7 +99,7 @@ Example:
    
 
    
 [Note]
 
 
 
 
 
    
 
    
 
    
-PrevUpHomeNext
+PrevUpHomeNext
 
    
 
 
diff --git a/doc/html/boost/type_erasure/placeholder_of.html b/doc/html/boost/type_erasure/placeholder_of.html
index f0576bfc26..6e6b3ea652 100644
--- a/doc/html/boost/type_erasure/placeholder_of.html
+++ b/doc/html/boost/type_erasure/placeholder_of.html
@@ -7,8 +7,8 @@
 
 
 
-
-
+
+
 
 
 
@@ -21,7 +21,7 @@
 
    
 
    
 
    
-PrevUpHomeNext
+PrevUpHomeNext
 
    
 
    
 
    
@@ -38,7 +38,7 @@
   typedef unspecified type;
 };
    -

    Description

    +

    Description

    A metafunction returning the (const/reference qualified) placeholder corresponding to an any. It will also work for all bases of any, so it can be applied to the Base parameter of concept_interface.

    @@ -52,7 +52,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/type_erasure/rebind_any.html b/doc/html/boost/type_erasure/rebind_any.html index a33ba62db0..1195b4713f 100644 --- a/doc/html/boost/type_erasure/rebind_any.html +++ b/doc/html/boost/type_erasure/rebind_any.html @@ -7,7 +7,7 @@ - + @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -38,12 +38,13 @@ typedef unspecified type; };
    -

    Description

    +

    Description

    A metafunction that changes the placeholder of an any. If T is not a placeholder, returns T unchanged. This class is intended to be used in concept_interface to deduce the argument types from the arguments of the concept.

    rebind_any<any<Concept>, _a>::type -> any<Concept, _a>
 rebind_any<any<Concept>, _b&>::type -> any<Concept, _b&>
+rebind_any<any<Concept>, _c&&>::type -> any<Concept, _c&&>
 rebind_any<any<Concept>, int>::type -> int

    See Also:

    @@ -62,7 +63,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/type_erasure/register_binding.html b/doc/html/boost/type_erasure/register_binding.html index 2e7a024b18..30b2b2f8c1 100644 --- a/doc/html/boost/type_erasure/register_binding.html +++ b/doc/html/boost/type_erasure/register_binding.html @@ -38,7 +38,7 @@ template<typename Concept, typename T> void register_binding();

    Description

    -

    Registers a model of a concept to allow downcasting any via dynamic_any_cast.

    +

    Registers a model of a concept to allow downcasting any via dynamic_any_cast.

    diff --git a/doc/html/boost/type_erasure/relaxed.html b/doc/html/boost/type_erasure/relaxed.html index d5c59e478e..75c3745209 100644 --- a/doc/html/boost/type_erasure/relaxed.html +++ b/doc/html/boost/type_erasure/relaxed.html @@ -8,7 +8,7 @@ - +
    @@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    @@ -41,7 +41,7 @@

    In detail, relaxed enables the following:

    • A raw value can be assigned to an any. This will replace the value stored by the any. (But note that if assignable is present, it takes priority.)

      • -

    • copy assignment of any uses the copy constructor if it can't use assignable (either because assignable is missing, or because the stored types do not match).

      • +

    • assignment of any uses the constructor if it can't use assignable (either because assignable is missing, or because the stored types do not match).

    • default construction of any is allowed and creates a null any.

    • equality_comparable: If the types do not match, it will return false.

    • less_than_comparable: If the types do not match, the ordering will be according to std::type_info::before.

      • @@ -61,7 +61,7 @@
      -PrevUpHomeNext +PrevUpHomeNext
      diff --git a/doc/html/boost/type_erasure/require_match.html b/doc/html/boost/type_erasure/require_match.html index 3d7f5d9559..7a5cf4cfb5 100644 --- a/doc/html/boost/type_erasure/require_match.html +++ b/doc/html/boost/type_erasure/require_match.html @@ -7,7 +7,7 @@ - + @@ -21,7 +21,7 @@
      -PrevUpHomeNext +PrevUpHomeNext
      @@ -39,7 +39,7 @@ template<typename Op, class... U> void require_match(const Op & f, U &&... args);
      -

      Description

      +

      Description

      Checks that the actual types stored in all the any arguments match the types specified by binding. If they do not match then,

      • If relaxed is in Concept, throws bad_function_call.

        • @@ -72,7 +72,7 @@
        -PrevUpHomeNext +PrevUpHomeNext
        diff --git a/doc/html/boost/type_erasure/static_binding.html b/doc/html/boost/type_erasure/static_binding.html index 123b3843db..ea457fbd93 100644 --- a/doc/html/boost/type_erasure/static_binding.html +++ b/doc/html/boost/type_erasure/static_binding.html @@ -34,6 +34,8 @@ template<typename Map> struct static_binding { + // types + typedef Map map_type; };

      Description

      diff --git a/doc/html/boost/type_erasure/typeid_.html b/doc/html/boost/type_erasure/typeid_.html index 07a8aace8a..86e8623c2a 100644 --- a/doc/html/boost/type_erasure/typeid_.html +++ b/doc/html/boost/type_erasure/typeid_.html @@ -6,9 +6,9 @@ - - - + + + @@ -21,7 +21,7 @@
      -PrevUpHomeNext +PrevUpHomeNext
      @@ -30,13 +30,13 @@

      boost::type_erasure::typeid_

      Synopsis

      -
      // In header: <boost/type_erasure/check_match.hpp>
+
      // In header: <boost/type_erasure/builtin.hpp>
 
-template<typename T> 
+template<typename T = _self> 
 struct typeid_ {
 };
      
 
      
-
      Description
      
+
      Description
      
 
      Enables runtime type information. This is required if you want to use any_cast or typeid_of.
      
 
      
@@ -59,7 +59,7 @@
 
      
 
      
 
      
 
      
-PrevUpHomeNext
+PrevUpHomeNext
 
      
 
 
diff --git a/doc/html/boost/typeindex/hash_value.html b/doc/html/boost/typeindex/hash_value.html
index 5d53ca69ad..ce32b85061 100644
--- a/doc/html/boost/typeindex/hash_value.html
+++ b/doc/html/boost/typeindex/hash_value.html
@@ -43,7 +43,7 @@
 [Note]
 Note
 
-
      <boost/functional/hash.hpp> has to be included if this function is used. 
      
+
      <boost/container_hash/hash.hpp> has to be included if this function is used. 
      
 
      
 
      
 
      
diff --git a/doc/html/boost/typeindex/type_index_facade.html b/doc/html/boost/typeindex/type_index_facade.html
index 0cbfe550ac..2c94f7efcc 100644
--- a/doc/html/boost/typeindex/type_index_facade.html
+++ b/doc/html/boost/typeindex/type_index_facade.html
@@ -173,7 +173,7 @@
 [Note]
 Note
 
-
      Derived class header must include <boost/functional/hash.hpp>, unless this function is redefined in Derived class to not use boost::hash_range(). 
      
+
      Derived class header must include <boost/container_hash/hash.hpp>, unless this function is redefined in Derived class to not use boost::hash_range(). 
      
 
      
 
      
 
      
diff --git a/doc/html/boost/units/absolute.html b/doc/html/boost/units/absolute.html
index b5d2ce76aa..04941d3b3a 100644
--- a/doc/html/boost/units/absolute.html
+++ b/doc/html/boost/units/absolute.html
@@ -43,12 +43,12 @@
   absolute();
   absolute(const value_type &);
   absolute(const this_type &);
-  this_type & operator=(const this_type &);
+  BOOST_CXX14_CONSTEXPR this_type & operator=(const this_type &);
 
   // public member functions
-  const value_type & value() const;
-  const this_type & operator+=(const value_type &);
-  const this_type & operator-=(const value_type &);
+  BOOST_CONSTEXPR const value_type & value() const;
+  BOOST_CXX14_CONSTEXPR const this_type & operator+=(const value_type &);
+  BOOST_CXX14_CONSTEXPR const this_type & operator-=(const value_type &);
 };

      Description

      @@ -62,16 +62,16 @@ 
    • absolute();
    • absolute(const value_type & val);
    • absolute(const this_type & source);
      • -
    • this_type & operator=(const this_type & source);
      • +
    • BOOST_CXX14_CONSTEXPR this_type & operator=(const this_type & source);

      • absolute public member functions

        -
      1. const value_type & value() const;
        2. -
      2. const this_type & operator+=(const value_type & val);
        3. -
      3. const this_type & operator-=(const value_type & val);
        4. +
      4. BOOST_CONSTEXPR const value_type & value() const;
        5. +
      5. BOOST_CXX14_CONSTEXPR const this_type & operator+=(const value_type & val);
        6. +
      6. BOOST_CXX14_CONSTEXPR const this_type & operator-=(const value_type & val);
      diff --git a/doc/html/boost/units/ba_1_3_44_10_10_5_10_1_1_1.html b/doc/html/boost/units/ba_1_3_44_10_10_5_10_1_1_1.html index 3fba04f1d1..5afaf481ac 100644 --- a/doc/html/boost/units/ba_1_3_44_10_10_5_10_1_1_1.html +++ b/doc/html/boost/units/ba_1_3_44_10_10_5_10_1_1_1.html @@ -36,8 +36,8 @@ struct base_unit_info<imperial::inch_base_unit> { // public static functions - static const char * name(); - static const char * symbol(); + static BOOST_CONSTEXPR const char * name(); + static BOOST_CONSTEXPR const char * symbol(); };

    Description

    @@ -45,8 +45,8 @@

    base_unit_info public static functions

      -
    1. static const char * name();
      2. -
    2. static const char * symbol();
      3. +
    3. static BOOST_CONSTEXPR const char * name();
      4. +
    4. static BOOST_CONSTEXPR const char * symbol();
    diff --git a/doc/html/boost/units/ba_1_3_44_10_10_5_11_1_1_1.html b/doc/html/boost/units/ba_1_3_44_10_10_5_11_1_1_1.html index 39eada609c..552596c344 100644 --- a/doc/html/boost/units/ba_1_3_44_10_10_5_11_1_1_1.html +++ b/doc/html/boost/units/ba_1_3_44_10_10_5_11_1_1_1.html @@ -36,8 +36,8 @@ struct base_unit_info<imperial::league_base_unit> { // public static functions - static const char * name(); - static const char * symbol(); + static BOOST_CONSTEXPR const char * name(); + static BOOST_CONSTEXPR const char * symbol(); };

    Description

    @@ -45,8 +45,8 @@

    base_unit_info public static functions

      -
    1. static const char * name();
      2. -
    2. static const char * symbol();
      3. +
    3. static BOOST_CONSTEXPR const char * name();
      4. +
    4. static BOOST_CONSTEXPR const char * symbol();
    • diff --git a/doc/html/boost/units/ba_1_3_44_10_10_5_12_1_1_1.html b/doc/html/boost/units/ba_1_3_44_10_10_5_12_1_1_1.html index 67eafe16d2..abf94f8b16 100644 --- a/doc/html/boost/units/ba_1_3_44_10_10_5_12_1_1_1.html +++ b/doc/html/boost/units/ba_1_3_44_10_10_5_12_1_1_1.html @@ -36,8 +36,8 @@ struct base_unit_info<imperial::mile_base_unit> { // public static functions - static const char * name(); - static const char * symbol(); + static BOOST_CONSTEXPR const char * name(); + static BOOST_CONSTEXPR const char * symbol(); };

    Description

    @@ -45,8 +45,8 @@

    base_unit_info public static functions

      -
    1. static const char * name();
      2. -
    2. static const char * symbol();
      3. +
    3. static BOOST_CONSTEXPR const char * name();
      4. +
    4. static BOOST_CONSTEXPR const char * symbol();
    diff --git a/doc/html/boost/units/ba_1_3_44_10_10_5_13_1_1_1.html b/doc/html/boost/units/ba_1_3_44_10_10_5_13_1_1_1.html index 4e33581462..3f329222d4 100644 --- a/doc/html/boost/units/ba_1_3_44_10_10_5_13_1_1_1.html +++ b/doc/html/boost/units/ba_1_3_44_10_10_5_13_1_1_1.html @@ -36,8 +36,8 @@ struct base_unit_info<imperial::ounce_base_unit> { // public static functions - static const char * name(); - static const char * symbol(); + static BOOST_CONSTEXPR const char * name(); + static BOOST_CONSTEXPR const char * symbol(); };

    Description

    @@ -45,8 +45,8 @@

    base_unit_info public static functions

      -
    1. static const char * name();
      2. -
    2. static const char * symbol();
      3. +
    3. static BOOST_CONSTEXPR const char * name();
      4. +
    4. static BOOST_CONSTEXPR const char * symbol();
    diff --git a/doc/html/boost/units/ba_1_3_44_10_10_5_16_1_1_1.html b/doc/html/boost/units/ba_1_3_44_10_10_5_16_1_1_1.html index 1bc8a7ca75..466f126451 100644 --- a/doc/html/boost/units/ba_1_3_44_10_10_5_16_1_1_1.html +++ b/doc/html/boost/units/ba_1_3_44_10_10_5_16_1_1_1.html @@ -36,8 +36,8 @@ struct base_unit_info<imperial::quart_base_unit> { // public static functions - static const char * name(); - static const char * symbol(); + static BOOST_CONSTEXPR const char * name(); + static BOOST_CONSTEXPR const char * symbol(); };

    Description

    @@ -45,8 +45,8 @@

    base_unit_info public static functions

      -
    1. static const char * name();
      2. -
    2. static const char * symbol();
      3. +
    3. static BOOST_CONSTEXPR const char * name();
      4. +
    4. static BOOST_CONSTEXPR const char * symbol();
    diff --git a/doc/html/boost/units/ba_1_3_44_10_10_5_17_1_1_1.html b/doc/html/boost/units/ba_1_3_44_10_10_5_17_1_1_1.html index 6a10dd2494..1a06ed9b56 100644 --- a/doc/html/boost/units/ba_1_3_44_10_10_5_17_1_1_1.html +++ b/doc/html/boost/units/ba_1_3_44_10_10_5_17_1_1_1.html @@ -36,8 +36,8 @@ struct base_unit_info<imperial::quarter_base_unit> { // public static functions - static const char * name(); - static const char * symbol(); + static BOOST_CONSTEXPR const char * name(); + static BOOST_CONSTEXPR const char * symbol(); };

    Description

    @@ -45,8 +45,8 @@

    base_unit_info public static functions

      -
    1. static const char * name();
      2. -
    2. static const char * symbol();
      3. +
    3. static BOOST_CONSTEXPR const char * name();
      4. +
    4. static BOOST_CONSTEXPR const char * symbol();
    diff --git a/doc/html/boost/units/ba_1_3_44_10_10_5_18_1_1_1.html b/doc/html/boost/units/ba_1_3_44_10_10_5_18_1_1_1.html index 88897627d7..7e11117f93 100644 --- a/doc/html/boost/units/ba_1_3_44_10_10_5_18_1_1_1.html +++ b/doc/html/boost/units/ba_1_3_44_10_10_5_18_1_1_1.html @@ -36,8 +36,8 @@ struct base_unit_info<imperial::stone_base_unit> { // public static functions - static const char * name(); - static const char * symbol(); + static BOOST_CONSTEXPR const char * name(); + static BOOST_CONSTEXPR const char * symbol(); };

    Description

    @@ -45,8 +45,8 @@

    base_unit_info public static functions

      -
    1. static const char * name();
      2. -
    2. static const char * symbol();
      3. +
    3. static BOOST_CONSTEXPR const char * name();
      4. +
    4. static BOOST_CONSTEXPR const char * symbol();
    diff --git a/doc/html/boost/units/ba_1_3_44_10_10_5_19_1_1_1.html b/doc/html/boost/units/ba_1_3_44_10_10_5_19_1_1_1.html index a9a4eefdc0..b02a791cd8 100644 --- a/doc/html/boost/units/ba_1_3_44_10_10_5_19_1_1_1.html +++ b/doc/html/boost/units/ba_1_3_44_10_10_5_19_1_1_1.html @@ -36,8 +36,8 @@ struct base_unit_info<imperial::thou_base_unit> { // public static functions - static const char * name(); - static const char * symbol(); + static BOOST_CONSTEXPR const char * name(); + static BOOST_CONSTEXPR const char * symbol(); };

    Description

    @@ -45,8 +45,8 @@

    base_unit_info public static functions

      -
    1. static const char * name();
      2. -
    2. static const char * symbol();
      3. +
    3. static BOOST_CONSTEXPR const char * name();
      4. +
    4. static BOOST_CONSTEXPR const char * symbol();
    diff --git a/doc/html/boost/units/ba_1_3_44_10_10_5_20_1_1_1.html b/doc/html/boost/units/ba_1_3_44_10_10_5_20_1_1_1.html index 36ac9b4082..9d5d0e9e95 100644 --- a/doc/html/boost/units/ba_1_3_44_10_10_5_20_1_1_1.html +++ b/doc/html/boost/units/ba_1_3_44_10_10_5_20_1_1_1.html @@ -36,8 +36,8 @@ struct base_unit_info<imperial::ton_base_unit> { // public static functions - static const char * name(); - static const char * symbol(); + static BOOST_CONSTEXPR const char * name(); + static BOOST_CONSTEXPR const char * symbol(); };

    Description

    @@ -45,8 +45,8 @@

    base_unit_info public static functions

      -
    1. static const char * name();
      2. -
    2. static const char * symbol();
      3. +
    3. static BOOST_CONSTEXPR const char * name();
      4. +
    4. static BOOST_CONSTEXPR const char * symbol();
    diff --git a/doc/html/boost/units/ba_1_3_44_10_10_6_10_1_1_1.html b/doc/html/boost/units/ba_1_3_44_10_10_6_10_1_1_1.html index 6a2090bed5..aeb3e163bb 100644 --- a/doc/html/boost/units/ba_1_3_44_10_10_6_10_1_1_1.html +++ b/doc/html/boost/units/ba_1_3_44_10_10_6_10_1_1_1.html @@ -36,8 +36,8 @@ struct base_unit_info<metric::hour_base_unit> { // public static functions - static const char * name(); - static const char * symbol(); + static BOOST_CONSTEXPR const char * name(); + static BOOST_CONSTEXPR const char * symbol(); };

    Description

    @@ -45,8 +45,8 @@

    base_unit_info public static functions

      -
    1. static const char * name();
      2. -
    2. static const char * symbol();
      3. +
    3. static BOOST_CONSTEXPR const char * name();
      4. +
    4. static BOOST_CONSTEXPR const char * symbol();
    diff --git a/doc/html/boost/units/ba_1_3_44_10_10_6_13_1_1_1.html b/doc/html/boost/units/ba_1_3_44_10_10_6_13_1_1_1.html index 2df2b8cf69..f0449379af 100644 --- a/doc/html/boost/units/ba_1_3_44_10_10_6_13_1_1_1.html +++ b/doc/html/boost/units/ba_1_3_44_10_10_6_13_1_1_1.html @@ -36,8 +36,8 @@ struct base_unit_info<metric::micron_base_unit> { // public static functions - static const char * name(); - static const char * symbol(); + static BOOST_CONSTEXPR const char * name(); + static BOOST_CONSTEXPR const char * symbol(); };

    Description

    @@ -45,8 +45,8 @@

    base_unit_info public static functions

      -
    1. static const char * name();
      2. -
    2. static const char * symbol();
      3. +
    3. static BOOST_CONSTEXPR const char * name();
      4. +
    4. static BOOST_CONSTEXPR const char * symbol();
    diff --git a/doc/html/boost/units/ba_1_3_44_10_10_6_14_1_1_1.html b/doc/html/boost/units/ba_1_3_44_10_10_6_14_1_1_1.html index 432ca3f7c1..8bcde05806 100644 --- a/doc/html/boost/units/ba_1_3_44_10_10_6_14_1_1_1.html +++ b/doc/html/boost/units/ba_1_3_44_10_10_6_14_1_1_1.html @@ -36,8 +36,8 @@ struct base_unit_info<metric::minute_base_unit> { // public static functions - static const char * name(); - static const char * symbol(); + static BOOST_CONSTEXPR const char * name(); + static BOOST_CONSTEXPR const char * symbol(); };

    Description

    @@ -45,8 +45,8 @@

    base_unit_info public static functions

      -
    1. static const char * name();
      2. -
    2. static const char * symbol();
      3. +
    3. static BOOST_CONSTEXPR const char * name();
      4. +
    4. static BOOST_CONSTEXPR const char * symbol();
    diff --git a/doc/html/boost/units/ba_1_3_44_10_10_6_16_1_1_1.html b/doc/html/boost/units/ba_1_3_44_10_10_6_16_1_1_1.html index 3d9a4f9c1b..60c4db5e2a 100644 --- a/doc/html/boost/units/ba_1_3_44_10_10_6_16_1_1_1.html +++ b/doc/html/boost/units/ba_1_3_44_10_10_6_16_1_1_1.html @@ -36,8 +36,8 @@ struct base_unit_info<metric::nautical_mile_base_unit> { // public static functions - static const char * name(); - static const char * symbol(); + static BOOST_CONSTEXPR const char * name(); + static BOOST_CONSTEXPR const char * symbol(); };

    Description

    @@ -45,8 +45,8 @@

    base_unit_info public static functions

      -
    1. static const char * name();
      2. -
    2. static const char * symbol();
      3. +
    3. static BOOST_CONSTEXPR const char * name();
      4. +
    4. static BOOST_CONSTEXPR const char * symbol();
    diff --git a/doc/html/boost/units/ba_1_3_44_10_10_6_17_1_1_1.html b/doc/html/boost/units/ba_1_3_44_10_10_6_17_1_1_1.html index 6dc5b1c11d..c846dfea69 100644 --- a/doc/html/boost/units/ba_1_3_44_10_10_6_17_1_1_1.html +++ b/doc/html/boost/units/ba_1_3_44_10_10_6_17_1_1_1.html @@ -36,8 +36,8 @@ struct base_unit_info<metric::ton_base_unit> { // public static functions - static const char * name(); - static const char * symbol(); + static BOOST_CONSTEXPR const char * name(); + static BOOST_CONSTEXPR const char * symbol(); };

    Description

    @@ -45,8 +45,8 @@

    base_unit_info public static functions

      -
    1. static const char * name();
      2. -
    2. static const char * symbol();
      3. +
    3. static BOOST_CONSTEXPR const char * name();
      4. +
    4. static BOOST_CONSTEXPR const char * symbol();
    diff --git a/doc/html/boost/units/ba_1_3_44_10_10_6_19_1_1_1.html b/doc/html/boost/units/ba_1_3_44_10_10_6_19_1_1_1.html index e3ceecd0b6..06778de8e1 100644 --- a/doc/html/boost/units/ba_1_3_44_10_10_6_19_1_1_1.html +++ b/doc/html/boost/units/ba_1_3_44_10_10_6_19_1_1_1.html @@ -36,8 +36,8 @@ struct base_unit_info<metric::year_base_unit> { // public static functions - static const char * name(); - static const char * symbol(); + static BOOST_CONSTEXPR const char * name(); + static BOOST_CONSTEXPR const char * symbol(); };

    Description

    @@ -45,8 +45,8 @@

    base_unit_info public static functions

      -
    1. static const char * name();
      2. -
    2. static const char * symbol();
      3. +
    3. static BOOST_CONSTEXPR const char * name();
      4. +
    4. static BOOST_CONSTEXPR const char * symbol();
    diff --git a/doc/html/boost/units/ba_1_3_44_10_10_9_10_1_1_1.html b/doc/html/boost/units/ba_1_3_44_10_10_9_10_1_1_1.html index 9243e0b459..cbd5a34329 100644 --- a/doc/html/boost/units/ba_1_3_44_10_10_9_10_1_1_1.html +++ b/doc/html/boost/units/ba_1_3_44_10_10_9_10_1_1_1.html @@ -36,8 +36,8 @@ struct base_unit_info<us::hundredweight_base_unit> { // public static functions - static const char * name(); - static const char * symbol(); + static BOOST_CONSTEXPR const char * name(); + static BOOST_CONSTEXPR const char * symbol(); };

    Description

    @@ -45,8 +45,8 @@

    base_unit_info public static functions

      -
    1. static const char * name();
      2. -
    2. static const char * symbol();
      3. +
    3. static BOOST_CONSTEXPR const char * name();
      4. +
    4. static BOOST_CONSTEXPR const char * symbol();
    diff --git a/doc/html/boost/units/ba_1_3_44_10_10_9_11_1_1_1.html b/doc/html/boost/units/ba_1_3_44_10_10_9_11_1_1_1.html index 0588387d0d..550f67ef6a 100644 --- a/doc/html/boost/units/ba_1_3_44_10_10_9_11_1_1_1.html +++ b/doc/html/boost/units/ba_1_3_44_10_10_9_11_1_1_1.html @@ -36,8 +36,8 @@ struct base_unit_info<us::inch_base_unit> { // public static functions - static const char * name(); - static const char * symbol(); + static BOOST_CONSTEXPR const char * name(); + static BOOST_CONSTEXPR const char * symbol(); };

    Description

    @@ -45,8 +45,8 @@

    base_unit_info public static functions

      -
    1. static const char * name();
      2. -
    2. static const char * symbol();
      3. +
    3. static BOOST_CONSTEXPR const char * name();
      4. +
    4. static BOOST_CONSTEXPR const char * symbol();
    diff --git a/doc/html/boost/units/ba_1_3_44_10_10_9_12_1_1_1.html b/doc/html/boost/units/ba_1_3_44_10_10_9_12_1_1_1.html index 7d2319fc4b..8abf4c5e61 100644 --- a/doc/html/boost/units/ba_1_3_44_10_10_9_12_1_1_1.html +++ b/doc/html/boost/units/ba_1_3_44_10_10_9_12_1_1_1.html @@ -36,8 +36,8 @@ struct base_unit_info<us::mil_base_unit> { // public static functions - static const char * name(); - static const char * symbol(); + static BOOST_CONSTEXPR const char * name(); + static BOOST_CONSTEXPR const char * symbol(); };

    Description

    @@ -45,8 +45,8 @@

    base_unit_info public static functions

      -
    1. static const char * name();
      2. -
    2. static const char * symbol();
      3. +
    3. static BOOST_CONSTEXPR const char * name();
      4. +
    4. static BOOST_CONSTEXPR const char * symbol();
    diff --git a/doc/html/boost/units/ba_1_3_44_10_10_9_13_1_1_1.html b/doc/html/boost/units/ba_1_3_44_10_10_9_13_1_1_1.html index 367b028c78..0c1a0c139c 100644 --- a/doc/html/boost/units/ba_1_3_44_10_10_9_13_1_1_1.html +++ b/doc/html/boost/units/ba_1_3_44_10_10_9_13_1_1_1.html @@ -36,8 +36,8 @@ struct base_unit_info<us::mile_base_unit> { // public static functions - static const char * name(); - static const char * symbol(); + static BOOST_CONSTEXPR const char * name(); + static BOOST_CONSTEXPR const char * symbol(); };

    Description

    @@ -45,8 +45,8 @@

    base_unit_info public static functions

      -
    1. static const char * name();
      2. -
    2. static const char * symbol();
      3. +
    3. static BOOST_CONSTEXPR const char * name();
      4. +
    4. static BOOST_CONSTEXPR const char * symbol();
    diff --git a/doc/html/boost/units/ba_1_3_44_10_10_9_14_1_1_1.html b/doc/html/boost/units/ba_1_3_44_10_10_9_14_1_1_1.html index fae0a275f5..dbaebddb8a 100644 --- a/doc/html/boost/units/ba_1_3_44_10_10_9_14_1_1_1.html +++ b/doc/html/boost/units/ba_1_3_44_10_10_9_14_1_1_1.html @@ -36,8 +36,8 @@ struct base_unit_info<us::minim_base_unit> { // public static functions - static const char * name(); - static const char * symbol(); + static BOOST_CONSTEXPR const char * name(); + static BOOST_CONSTEXPR const char * symbol(); };

    Description

    @@ -45,8 +45,8 @@

    base_unit_info public static functions

      -
    1. static const char * name();
      2. -
    2. static const char * symbol();
      3. +
    3. static BOOST_CONSTEXPR const char * name();
      4. +
    4. static BOOST_CONSTEXPR const char * symbol();
    diff --git a/doc/html/boost/units/ba_1_3_44_10_10_9_15_1_1_1.html b/doc/html/boost/units/ba_1_3_44_10_10_9_15_1_1_1.html index 44657ed006..2ff4cc287c 100644 --- a/doc/html/boost/units/ba_1_3_44_10_10_9_15_1_1_1.html +++ b/doc/html/boost/units/ba_1_3_44_10_10_9_15_1_1_1.html @@ -36,8 +36,8 @@ struct base_unit_info<us::ounce_base_unit> { // public static functions - static const char * name(); - static const char * symbol(); + static BOOST_CONSTEXPR const char * name(); + static BOOST_CONSTEXPR const char * symbol(); };

    Description

    @@ -45,8 +45,8 @@

    base_unit_info public static functions

      -
    1. static const char * name();
      2. -
    2. static const char * symbol();
      3. +
    3. static BOOST_CONSTEXPR const char * name();
      4. +
    4. static BOOST_CONSTEXPR const char * symbol();
    diff --git a/doc/html/boost/units/ba_1_3_44_10_10_9_19_1_1_1.html b/doc/html/boost/units/ba_1_3_44_10_10_9_19_1_1_1.html index 4c590f2445..921e9f26bc 100644 --- a/doc/html/boost/units/ba_1_3_44_10_10_9_19_1_1_1.html +++ b/doc/html/boost/units/ba_1_3_44_10_10_9_19_1_1_1.html @@ -36,8 +36,8 @@ struct base_unit_info<us::quart_base_unit> { // public static functions - static const char * name(); - static const char * symbol(); + static BOOST_CONSTEXPR const char * name(); + static BOOST_CONSTEXPR const char * symbol(); };

    Description

    @@ -45,8 +45,8 @@

    base_unit_info public static functions

      -
    1. static const char * name();
      2. -
    2. static const char * symbol();
      3. +
    3. static BOOST_CONSTEXPR const char * name();
      4. +
    4. static BOOST_CONSTEXPR const char * symbol();
    diff --git a/doc/html/boost/units/ba_1_3_44_10_10_9_20_1_1_1.html b/doc/html/boost/units/ba_1_3_44_10_10_9_20_1_1_1.html index 2bc31f6e4b..d71d25eed1 100644 --- a/doc/html/boost/units/ba_1_3_44_10_10_9_20_1_1_1.html +++ b/doc/html/boost/units/ba_1_3_44_10_10_9_20_1_1_1.html @@ -36,8 +36,8 @@ struct base_unit_info<us::tablespoon_base_unit> { // public static functions - static const char * name(); - static const char * symbol(); + static BOOST_CONSTEXPR const char * name(); + static BOOST_CONSTEXPR const char * symbol(); };

    Description

    @@ -45,8 +45,8 @@

    base_unit_info public static functions

      -
    1. static const char * name();
      2. -
    2. static const char * symbol();
      3. +
    3. static BOOST_CONSTEXPR const char * name();
      4. +
    4. static BOOST_CONSTEXPR const char * symbol();
    diff --git a/doc/html/boost/units/ba_1_3_44_10_10_9_21_1_1_1.html b/doc/html/boost/units/ba_1_3_44_10_10_9_21_1_1_1.html index 4b120e0cdc..c830271e83 100644 --- a/doc/html/boost/units/ba_1_3_44_10_10_9_21_1_1_1.html +++ b/doc/html/boost/units/ba_1_3_44_10_10_9_21_1_1_1.html @@ -36,8 +36,8 @@ struct base_unit_info<us::teaspoon_base_unit> { // public static functions - static const char * name(); - static const char * symbol(); + static BOOST_CONSTEXPR const char * name(); + static BOOST_CONSTEXPR const char * symbol(); };

    Description

    @@ -45,8 +45,8 @@

    base_unit_info public static functions

      -
    1. static const char * name();
      2. -
    2. static const char * symbol();
      3. +
    3. static BOOST_CONSTEXPR const char * name();
      4. +
    4. static BOOST_CONSTEXPR const char * symbol();
    diff --git a/doc/html/boost/units/ba_1_3_44_10_10_9_22_1_1_1.html b/doc/html/boost/units/ba_1_3_44_10_10_9_22_1_1_1.html index 1d2672af40..ed3dd61993 100644 --- a/doc/html/boost/units/ba_1_3_44_10_10_9_22_1_1_1.html +++ b/doc/html/boost/units/ba_1_3_44_10_10_9_22_1_1_1.html @@ -36,8 +36,8 @@ struct base_unit_info<us::ton_base_unit> { // public static functions - static const char * name(); - static const char * symbol(); + static BOOST_CONSTEXPR const char * name(); + static BOOST_CONSTEXPR const char * symbol(); };

    Description

    @@ -45,8 +45,8 @@

    base_unit_info public static functions

      -
    1. static const char * name();
      2. -
    2. static const char * symbol();
      3. +
    3. static BOOST_CONSTEXPR const char * name();
      4. +
    4. static BOOST_CONSTEXPR const char * symbol();
    diff --git a/doc/html/boost/units/bas_1_3_44_10_10_2_2_1_1_1.html b/doc/html/boost/units/bas_1_3_44_10_10_2_2_1_1_1.html index 4f45774b67..b8aa95de39 100644 --- a/doc/html/boost/units/bas_1_3_44_10_10_2_2_1_1_1.html +++ b/doc/html/boost/units/bas_1_3_44_10_10_2_2_1_1_1.html @@ -36,8 +36,8 @@ struct base_unit_info<angle::arcminute_base_unit> { // public static functions - static const char * name(); - static const char * symbol(); + static BOOST_CONSTEXPR const char * name(); + static BOOST_CONSTEXPR const char * symbol(); };

    Description

    @@ -45,8 +45,8 @@

    base_unit_info public static functions

      -
    1. static const char * name();
      2. -
    2. static const char * symbol();
      3. +
    3. static BOOST_CONSTEXPR const char * name();
      4. +
    4. static BOOST_CONSTEXPR const char * symbol();
    diff --git a/doc/html/boost/units/bas_1_3_44_10_10_2_3_1_1_1.html b/doc/html/boost/units/bas_1_3_44_10_10_2_3_1_1_1.html index bad3461d51..df997235e4 100644 --- a/doc/html/boost/units/bas_1_3_44_10_10_2_3_1_1_1.html +++ b/doc/html/boost/units/bas_1_3_44_10_10_2_3_1_1_1.html @@ -36,8 +36,8 @@ struct base_unit_info<angle::arcsecond_base_unit> { // public static functions - static const char * name(); - static const char * symbol(); + static BOOST_CONSTEXPR const char * name(); + static BOOST_CONSTEXPR const char * symbol(); };

    Description

    @@ -45,8 +45,8 @@

    base_unit_info public static functions

      -
    1. static const char * name();
      2. -
    2. static const char * symbol();
      3. +
    3. static BOOST_CONSTEXPR const char * name();
      4. +
    4. static BOOST_CONSTEXPR const char * symbol();
    diff --git a/doc/html/boost/units/bas_1_3_44_10_10_2_7_1_1_1.html b/doc/html/boost/units/bas_1_3_44_10_10_2_7_1_1_1.html index c39ebe4b3a..47fee1f16b 100644 --- a/doc/html/boost/units/bas_1_3_44_10_10_2_7_1_1_1.html +++ b/doc/html/boost/units/bas_1_3_44_10_10_2_7_1_1_1.html @@ -36,8 +36,8 @@ struct base_unit_info<angle::revolution_base_unit> { // public static functions - static const char * name(); - static const char * symbol(); + static BOOST_CONSTEXPR const char * name(); + static BOOST_CONSTEXPR const char * symbol(); };

    Description

    @@ -45,8 +45,8 @@

    base_unit_info public static functions

      -
    1. static const char * name();
      2. -
    2. static const char * symbol();
      3. +
    3. static BOOST_CONSTEXPR const char * name();
      4. +
    4. static BOOST_CONSTEXPR const char * symbol();
    diff --git a/doc/html/boost/units/bas_1_3_44_10_10_3_3_1_1_1.html b/doc/html/boost/units/bas_1_3_44_10_10_3_3_1_1_1.html index 4dd5dc93db..58a22227df 100644 --- a/doc/html/boost/units/bas_1_3_44_10_10_3_3_1_1_1.html +++ b/doc/html/boost/units/bas_1_3_44_10_10_3_3_1_1_1.html @@ -36,8 +36,8 @@ struct base_unit_info<astronomical::light_day_base_unit> { // public static functions - static const char * name(); - static const char * symbol(); + static BOOST_CONSTEXPR const char * name(); + static BOOST_CONSTEXPR const char * symbol(); };

    Description

    @@ -45,8 +45,8 @@

    base_unit_info public static functions

      -
    1. static const char * name();
      2. -
    2. static const char * symbol();
      3. +
    3. static BOOST_CONSTEXPR const char * name();
      4. +
    4. static BOOST_CONSTEXPR const char * symbol();
    diff --git a/doc/html/boost/units/bas_1_3_44_10_10_3_4_1_1_1.html b/doc/html/boost/units/bas_1_3_44_10_10_3_4_1_1_1.html index 20a83b7b62..215513547c 100644 --- a/doc/html/boost/units/bas_1_3_44_10_10_3_4_1_1_1.html +++ b/doc/html/boost/units/bas_1_3_44_10_10_3_4_1_1_1.html @@ -36,8 +36,8 @@ struct base_unit_info<astronomical::light_hour_base_unit> { // public static functions - static const char * name(); - static const char * symbol(); + static BOOST_CONSTEXPR const char * name(); + static BOOST_CONSTEXPR const char * symbol(); };

    Description

    @@ -45,8 +45,8 @@

    base_unit_info public static functions

      -
    1. static const char * name();
      2. -
    2. static const char * symbol();
      3. +
    3. static BOOST_CONSTEXPR const char * name();
      4. +
    4. static BOOST_CONSTEXPR const char * symbol();
    diff --git a/doc/html/boost/units/bas_1_3_44_10_10_3_5_1_1_1.html b/doc/html/boost/units/bas_1_3_44_10_10_3_5_1_1_1.html index ec8b7942f2..118208110a 100644 --- a/doc/html/boost/units/bas_1_3_44_10_10_3_5_1_1_1.html +++ b/doc/html/boost/units/bas_1_3_44_10_10_3_5_1_1_1.html @@ -36,8 +36,8 @@ struct base_unit_info<astronomical::light_minute_base_unit> { // public static functions - static const char * name(); - static const char * symbol(); + static BOOST_CONSTEXPR const char * name(); + static BOOST_CONSTEXPR const char * symbol(); };

    Description

    @@ -45,8 +45,8 @@

    base_unit_info public static functions

      -
    1. static const char * name();
      2. -
    2. static const char * symbol();
      3. +
    3. static BOOST_CONSTEXPR const char * name();
      4. +
    4. static BOOST_CONSTEXPR const char * symbol();
    diff --git a/doc/html/boost/units/bas_1_3_44_10_10_3_7_1_1_1.html b/doc/html/boost/units/bas_1_3_44_10_10_3_7_1_1_1.html index f952d2f161..23a6c82c72 100644 --- a/doc/html/boost/units/bas_1_3_44_10_10_3_7_1_1_1.html +++ b/doc/html/boost/units/bas_1_3_44_10_10_3_7_1_1_1.html @@ -36,8 +36,8 @@ struct base_unit_info<astronomical::light_year_base_unit> { // public static functions - static const char * name(); - static const char * symbol(); + static BOOST_CONSTEXPR const char * name(); + static BOOST_CONSTEXPR const char * symbol(); };

    Description

    @@ -45,8 +45,8 @@

    base_unit_info public static functions

      -
    1. static const char * name();
      2. -
    2. static const char * symbol();
      3. +
    3. static BOOST_CONSTEXPR const char * name();
      4. +
    4. static BOOST_CONSTEXPR const char * symbol();
    diff --git a/doc/html/boost/units/bas_1_3_44_10_10_5_2_1_1_1.html b/doc/html/boost/units/bas_1_3_44_10_10_5_2_1_1_1.html index e4dd8ba3c2..134722a6ed 100644 --- a/doc/html/boost/units/bas_1_3_44_10_10_5_2_1_1_1.html +++ b/doc/html/boost/units/bas_1_3_44_10_10_5_2_1_1_1.html @@ -36,8 +36,8 @@ struct base_unit_info<imperial::drachm_base_unit> { // public static functions - static const char * name(); - static const char * symbol(); + static BOOST_CONSTEXPR const char * name(); + static BOOST_CONSTEXPR const char * symbol(); };

    Description

    @@ -45,8 +45,8 @@

    base_unit_info public static functions

      -
    1. static const char * name();
      2. -
    2. static const char * symbol();
      3. +
    3. static BOOST_CONSTEXPR const char * name();
      4. +
    4. static BOOST_CONSTEXPR const char * symbol();
    diff --git a/doc/html/boost/units/bas_1_3_44_10_10_5_3_1_1_1.html b/doc/html/boost/units/bas_1_3_44_10_10_5_3_1_1_1.html index 6bbfab0064..35467c809d 100644 --- a/doc/html/boost/units/bas_1_3_44_10_10_5_3_1_1_1.html +++ b/doc/html/boost/units/bas_1_3_44_10_10_5_3_1_1_1.html @@ -36,8 +36,8 @@ struct base_unit_info<imperial::fluid_ounce_base_unit> { // public static functions - static const char * name(); - static const char * symbol(); + static BOOST_CONSTEXPR const char * name(); + static BOOST_CONSTEXPR const char * symbol(); };

    Description

    @@ -45,8 +45,8 @@

    base_unit_info public static functions

      -
    1. static const char * name();
      2. -
    2. static const char * symbol();
      3. +
    3. static BOOST_CONSTEXPR const char * name();
      4. +
    4. static BOOST_CONSTEXPR const char * symbol();
    diff --git a/doc/html/boost/units/bas_1_3_44_10_10_5_4_1_1_1.html b/doc/html/boost/units/bas_1_3_44_10_10_5_4_1_1_1.html index 5eacd699fb..958d788d10 100644 --- a/doc/html/boost/units/bas_1_3_44_10_10_5_4_1_1_1.html +++ b/doc/html/boost/units/bas_1_3_44_10_10_5_4_1_1_1.html @@ -36,8 +36,8 @@ struct base_unit_info<imperial::foot_base_unit> { // public static functions - static const char * name(); - static const char * symbol(); + static BOOST_CONSTEXPR const char * name(); + static BOOST_CONSTEXPR const char * symbol(); };

    Description

    @@ -45,8 +45,8 @@

    base_unit_info public static functions

      -
    1. static const char * name();
      2. -
    2. static const char * symbol();
      3. +
    3. static BOOST_CONSTEXPR const char * name();
      4. +
    4. static BOOST_CONSTEXPR const char * symbol();
    diff --git a/doc/html/boost/units/bas_1_3_44_10_10_5_5_1_1_1.html b/doc/html/boost/units/bas_1_3_44_10_10_5_5_1_1_1.html index 299b98f903..deddf77223 100644 --- a/doc/html/boost/units/bas_1_3_44_10_10_5_5_1_1_1.html +++ b/doc/html/boost/units/bas_1_3_44_10_10_5_5_1_1_1.html @@ -36,8 +36,8 @@ struct base_unit_info<imperial::furlong_base_unit> { // public static functions - static const char * name(); - static const char * symbol(); + static BOOST_CONSTEXPR const char * name(); + static BOOST_CONSTEXPR const char * symbol(); };

    Description

    @@ -45,8 +45,8 @@

    base_unit_info public static functions

      -
    1. static const char * name();
      2. -
    2. static const char * symbol();
      3. +
    3. static BOOST_CONSTEXPR const char * name();
      4. +
    4. static BOOST_CONSTEXPR const char * symbol();
    diff --git a/doc/html/boost/units/bas_1_3_44_10_10_5_6_1_1_1.html b/doc/html/boost/units/bas_1_3_44_10_10_5_6_1_1_1.html index f8207eeef1..0fbc72f81c 100644 --- a/doc/html/boost/units/bas_1_3_44_10_10_5_6_1_1_1.html +++ b/doc/html/boost/units/bas_1_3_44_10_10_5_6_1_1_1.html @@ -36,8 +36,8 @@ struct base_unit_info<imperial::gallon_base_unit> { // public static functions - static const char * name(); - static const char * symbol(); + static BOOST_CONSTEXPR const char * name(); + static BOOST_CONSTEXPR const char * symbol(); };

    Description

    @@ -45,8 +45,8 @@

    base_unit_info public static functions

      -
    1. static const char * name();
      2. -
    2. static const char * symbol();
      3. +
    3. static BOOST_CONSTEXPR const char * name();
      4. +
    4. static BOOST_CONSTEXPR const char * symbol();
    diff --git a/doc/html/boost/units/bas_1_3_44_10_10_5_7_1_1_1.html b/doc/html/boost/units/bas_1_3_44_10_10_5_7_1_1_1.html index d0ab01024e..611e71e4f5 100644 --- a/doc/html/boost/units/bas_1_3_44_10_10_5_7_1_1_1.html +++ b/doc/html/boost/units/bas_1_3_44_10_10_5_7_1_1_1.html @@ -36,8 +36,8 @@ struct base_unit_info<imperial::gill_base_unit> { // public static functions - static const char * name(); - static const char * symbol(); + static BOOST_CONSTEXPR const char * name(); + static BOOST_CONSTEXPR const char * symbol(); };

    Description

    @@ -45,8 +45,8 @@

    base_unit_info public static functions

      -
    1. static const char * name();
      2. -
    2. static const char * symbol();
      3. +
    3. static BOOST_CONSTEXPR const char * name();
      4. +
    4. static BOOST_CONSTEXPR const char * symbol();
    diff --git a/doc/html/boost/units/bas_1_3_44_10_10_5_8_1_1_1.html b/doc/html/boost/units/bas_1_3_44_10_10_5_8_1_1_1.html index f5d0832847..0e029c6383 100644 --- a/doc/html/boost/units/bas_1_3_44_10_10_5_8_1_1_1.html +++ b/doc/html/boost/units/bas_1_3_44_10_10_5_8_1_1_1.html @@ -36,8 +36,8 @@ struct base_unit_info<imperial::grain_base_unit> { // public static functions - static const char * name(); - static const char * symbol(); + static BOOST_CONSTEXPR const char * name(); + static BOOST_CONSTEXPR const char * symbol(); };

    Description

    @@ -45,8 +45,8 @@

    base_unit_info public static functions

      -
    1. static const char * name();
      2. -
    2. static const char * symbol();
      3. +
    3. static BOOST_CONSTEXPR const char * name();
      4. +
    4. static BOOST_CONSTEXPR const char * symbol();
    diff --git a/doc/html/boost/units/bas_1_3_44_10_10_5_9_1_1_1.html b/doc/html/boost/units/bas_1_3_44_10_10_5_9_1_1_1.html index 38f563f1cc..2ad08ad62a 100644 --- a/doc/html/boost/units/bas_1_3_44_10_10_5_9_1_1_1.html +++ b/doc/html/boost/units/bas_1_3_44_10_10_5_9_1_1_1.html @@ -36,8 +36,8 @@ struct base_unit_info<imperial::hundredweight_base_unit> { // public static functions - static const char * name(); - static const char * symbol(); + static BOOST_CONSTEXPR const char * name(); + static BOOST_CONSTEXPR const char * symbol(); };

    Description

    @@ -45,8 +45,8 @@

    base_unit_info public static functions

      -
    1. static const char * name();
      2. -
    2. static const char * symbol();
      3. +
    3. static BOOST_CONSTEXPR const char * name();
      4. +
    4. static BOOST_CONSTEXPR const char * symbol();
    diff --git a/doc/html/boost/units/bas_1_3_44_10_10_6_2_1_1_1.html b/doc/html/boost/units/bas_1_3_44_10_10_6_2_1_1_1.html index bee4b32d80..f8278af814 100644 --- a/doc/html/boost/units/bas_1_3_44_10_10_6_2_1_1_1.html +++ b/doc/html/boost/units/bas_1_3_44_10_10_6_2_1_1_1.html @@ -36,8 +36,8 @@ struct base_unit_info<metric::angstrom_base_unit> { // public static functions - static const char * name(); - static const char * symbol(); + static BOOST_CONSTEXPR const char * name(); + static BOOST_CONSTEXPR const char * symbol(); };

    Description

    @@ -45,8 +45,8 @@

    base_unit_info public static functions

      -
    1. static const char * name();
      2. -
    2. static const char * symbol();
      3. +
    3. static BOOST_CONSTEXPR const char * name();
      4. +
    4. static BOOST_CONSTEXPR const char * symbol();
    diff --git a/doc/html/boost/units/bas_1_3_44_10_10_6_7_1_1_1.html b/doc/html/boost/units/bas_1_3_44_10_10_6_7_1_1_1.html index 1549bc36a3..e3489e2507 100644 --- a/doc/html/boost/units/bas_1_3_44_10_10_6_7_1_1_1.html +++ b/doc/html/boost/units/bas_1_3_44_10_10_6_7_1_1_1.html @@ -36,8 +36,8 @@ struct base_unit_info<metric::day_base_unit> { // public static functions - static const char * name(); - static const char * symbol(); + static BOOST_CONSTEXPR const char * name(); + static BOOST_CONSTEXPR const char * symbol(); };

    Description

    @@ -45,8 +45,8 @@

    base_unit_info public static functions

      -
    1. static const char * name();
      2. -
    2. static const char * symbol();
      3. +
    3. static BOOST_CONSTEXPR const char * name();
      4. +
    4. static BOOST_CONSTEXPR const char * symbol();
    diff --git a/doc/html/boost/units/bas_1_3_44_10_10_6_8_1_1_1.html b/doc/html/boost/units/bas_1_3_44_10_10_6_8_1_1_1.html index 51481f2b2d..04b946c381 100644 --- a/doc/html/boost/units/bas_1_3_44_10_10_6_8_1_1_1.html +++ b/doc/html/boost/units/bas_1_3_44_10_10_6_8_1_1_1.html @@ -36,8 +36,8 @@ struct base_unit_info<metric::fermi_base_unit> { // public static functions - static const char * name(); - static const char * symbol(); + static BOOST_CONSTEXPR const char * name(); + static BOOST_CONSTEXPR const char * symbol(); };

    Description

    @@ -45,8 +45,8 @@

    base_unit_info public static functions

      -
    1. static const char * name();
      2. -
    2. static const char * symbol();
      3. +
    3. static BOOST_CONSTEXPR const char * name();
      4. +
    4. static BOOST_CONSTEXPR const char * symbol();
    diff --git a/doc/html/boost/units/bas_1_3_44_10_10_9_2_1_1_1.html b/doc/html/boost/units/bas_1_3_44_10_10_9_2_1_1_1.html index daebd0b5df..d3eb23dca1 100644 --- a/doc/html/boost/units/bas_1_3_44_10_10_9_2_1_1_1.html +++ b/doc/html/boost/units/bas_1_3_44_10_10_9_2_1_1_1.html @@ -36,8 +36,8 @@ struct base_unit_info<us::cup_base_unit> { // public static functions - static const char * name(); - static const char * symbol(); + static BOOST_CONSTEXPR const char * name(); + static BOOST_CONSTEXPR const char * symbol(); };

    Description

    @@ -45,8 +45,8 @@

    base_unit_info public static functions

      -
    1. static const char * name();
      2. -
    2. static const char * symbol();
      3. +
    3. static BOOST_CONSTEXPR const char * name();
      4. +
    4. static BOOST_CONSTEXPR const char * symbol();
    diff --git a/doc/html/boost/units/bas_1_3_44_10_10_9_3_1_1_1.html b/doc/html/boost/units/bas_1_3_44_10_10_9_3_1_1_1.html index 815d8620c5..d47c601d18 100644 --- a/doc/html/boost/units/bas_1_3_44_10_10_9_3_1_1_1.html +++ b/doc/html/boost/units/bas_1_3_44_10_10_9_3_1_1_1.html @@ -36,8 +36,8 @@ struct base_unit_info<us::dram_base_unit> { // public static functions - static const char * name(); - static const char * symbol(); + static BOOST_CONSTEXPR const char * name(); + static BOOST_CONSTEXPR const char * symbol(); };

    Description

    @@ -45,8 +45,8 @@

    base_unit_info public static functions

      -
    1. static const char * name();
      2. -
    2. static const char * symbol();
      3. +
    3. static BOOST_CONSTEXPR const char * name();
      4. +
    4. static BOOST_CONSTEXPR const char * symbol();
    diff --git a/doc/html/boost/units/bas_1_3_44_10_10_9_4_1_1_1.html b/doc/html/boost/units/bas_1_3_44_10_10_9_4_1_1_1.html index 4c7323f811..ddb0cf4a51 100644 --- a/doc/html/boost/units/bas_1_3_44_10_10_9_4_1_1_1.html +++ b/doc/html/boost/units/bas_1_3_44_10_10_9_4_1_1_1.html @@ -36,8 +36,8 @@ struct base_unit_info<us::fluid_dram_base_unit> { // public static functions - static const char * name(); - static const char * symbol(); + static BOOST_CONSTEXPR const char * name(); + static BOOST_CONSTEXPR const char * symbol(); };

    Description

    @@ -45,8 +45,8 @@

    base_unit_info public static functions

      -
    1. static const char * name();
      2. -
    2. static const char * symbol();
      3. +
    3. static BOOST_CONSTEXPR const char * name();
      4. +
    4. static BOOST_CONSTEXPR const char * symbol();
    diff --git a/doc/html/boost/units/bas_1_3_44_10_10_9_5_1_1_1.html b/doc/html/boost/units/bas_1_3_44_10_10_9_5_1_1_1.html index 5a31b9ad01..a0b5a7574c 100644 --- a/doc/html/boost/units/bas_1_3_44_10_10_9_5_1_1_1.html +++ b/doc/html/boost/units/bas_1_3_44_10_10_9_5_1_1_1.html @@ -36,8 +36,8 @@ struct base_unit_info<us::fluid_ounce_base_unit> { // public static functions - static const char * name(); - static const char * symbol(); + static BOOST_CONSTEXPR const char * name(); + static BOOST_CONSTEXPR const char * symbol(); };

    Description

    @@ -45,8 +45,8 @@

    base_unit_info public static functions

      -
    1. static const char * name();
      2. -
    2. static const char * symbol();
      3. +
    3. static BOOST_CONSTEXPR const char * name();
      4. +
    4. static BOOST_CONSTEXPR const char * symbol();
    diff --git a/doc/html/boost/units/bas_1_3_44_10_10_9_6_1_1_1.html b/doc/html/boost/units/bas_1_3_44_10_10_9_6_1_1_1.html index 50e14e3795..9d7ba31546 100644 --- a/doc/html/boost/units/bas_1_3_44_10_10_9_6_1_1_1.html +++ b/doc/html/boost/units/bas_1_3_44_10_10_9_6_1_1_1.html @@ -36,8 +36,8 @@ struct base_unit_info<us::foot_base_unit> { // public static functions - static const char * name(); - static const char * symbol(); + static BOOST_CONSTEXPR const char * name(); + static BOOST_CONSTEXPR const char * symbol(); };

    Description

    @@ -45,8 +45,8 @@

    base_unit_info public static functions

      -
    1. static const char * name();
      2. -
    2. static const char * symbol();
      3. +
    3. static BOOST_CONSTEXPR const char * name();
      4. +
    4. static BOOST_CONSTEXPR const char * symbol();
    diff --git a/doc/html/boost/units/bas_1_3_44_10_10_9_7_1_1_1.html b/doc/html/boost/units/bas_1_3_44_10_10_9_7_1_1_1.html index c2d8c8b368..54b95055f8 100644 --- a/doc/html/boost/units/bas_1_3_44_10_10_9_7_1_1_1.html +++ b/doc/html/boost/units/bas_1_3_44_10_10_9_7_1_1_1.html @@ -36,8 +36,8 @@ struct base_unit_info<us::gallon_base_unit> { // public static functions - static const char * name(); - static const char * symbol(); + static BOOST_CONSTEXPR const char * name(); + static BOOST_CONSTEXPR const char * symbol(); };

    Description

    @@ -45,8 +45,8 @@

    base_unit_info public static functions

      -
    1. static const char * name();
      2. -
    2. static const char * symbol();
      3. +
    3. static BOOST_CONSTEXPR const char * name();
      4. +
    4. static BOOST_CONSTEXPR const char * symbol();
    diff --git a/doc/html/boost/units/bas_1_3_44_10_10_9_8_1_1_1.html b/doc/html/boost/units/bas_1_3_44_10_10_9_8_1_1_1.html index 98f8d023d8..2f4a1687da 100644 --- a/doc/html/boost/units/bas_1_3_44_10_10_9_8_1_1_1.html +++ b/doc/html/boost/units/bas_1_3_44_10_10_9_8_1_1_1.html @@ -36,8 +36,8 @@ struct base_unit_info<us::gill_base_unit> { // public static functions - static const char * name(); - static const char * symbol(); + static BOOST_CONSTEXPR const char * name(); + static BOOST_CONSTEXPR const char * symbol(); };

    Description

    @@ -45,8 +45,8 @@

    base_unit_info public static functions

      -
    1. static const char * name();
      2. -
    2. static const char * symbol();
      3. +
    3. static BOOST_CONSTEXPR const char * name();
      4. +
    4. static BOOST_CONSTEXPR const char * symbol();
    diff --git a/doc/html/boost/units/bas_1_3_44_10_10_9_9_1_1_1.html b/doc/html/boost/units/bas_1_3_44_10_10_9_9_1_1_1.html index a70656d6a7..36abfda3b7 100644 --- a/doc/html/boost/units/bas_1_3_44_10_10_9_9_1_1_1.html +++ b/doc/html/boost/units/bas_1_3_44_10_10_9_9_1_1_1.html @@ -36,8 +36,8 @@ struct base_unit_info<us::grain_base_unit> { // public static functions - static const char * name(); - static const char * symbol(); + static BOOST_CONSTEXPR const char * name(); + static BOOST_CONSTEXPR const char * symbol(); };

    Description

    @@ -45,8 +45,8 @@

    base_unit_info public static functions

      -
    1. static const char * name();
      2. -
    2. static const char * symbol();
      3. +
    3. static BOOST_CONSTEXPR const char * name();
      4. +
    4. static BOOST_CONSTEXPR const char * symbol();
    diff --git a/doc/html/boost/units/conversion_helper.html b/doc/html/boost/units/conversion_helper.html index 45a95f3449..0e1155f22e 100644 --- a/doc/html/boost/units/conversion_helper.html +++ b/doc/html/boost/units/conversion_helper.html @@ -36,7 +36,7 @@ struct conversion_helper { // public static functions - static To convert(const From &); + static BOOST_CONSTEXPR To convert(const From &); };

    Description

    @@ -58,7 +58,7 @@

    conversion_helper public static functions

    -
    1. static To convert(const From &);
    +
    1. static BOOST_CONSTEXPR To convert(const From &);
    diff --git a/doc/html/boost/units/pow_1_3_44_10_2_5_3_1_29.html b/doc/html/boost/units/pow_1_3_44_10_2_5_3_1_29.html index ecf316ce4c..fa692a4dcc 100644 --- a/doc/html/boost/units/pow_1_3_44_10_2_5_3_1_29.html +++ b/doc/html/boost/units/pow_1_3_44_10_2_5_3_1_29.html @@ -34,7 +34,7 @@ template<typename S, typename Y> - quantity< BOOST_UNITS_DIMENSIONLESS_UNIT(S), Y > + BOOST_CONSTEXPR quantity< BOOST_UNITS_DIMENSIONLESS_UNIT(S), Y > pow(const quantity< BOOST_UNITS_DIMENSIONLESS_UNIT(S), Y > & q1, const quantity< BOOST_UNITS_DIMENSIONLESS_UNIT(S), Y > & q2);
    diff --git a/doc/html/boost/units/power_1_3_44_10_2_42_1_1_3.html b/doc/html/boost/units/power_1_3_44_10_2_42_1_1_3.html index 522ceda57d..d02a34f5f4 100644 --- a/doc/html/boost/units/power_1_3_44_10_2_42_1_1_3.html +++ b/doc/html/boost/units/power_1_3_44_10_2_42_1_1_3.html @@ -38,14 +38,14 @@ typedef unit< typename static_power< Dim, static_rational< N, D > >::type, typename static_power< System, static_rational< N, D > >::type > type; // public static functions - static type value(const unit< Dim, System > &); + static BOOST_CONSTEXPR type value(const unit< Dim, System > &); };

    Description

    power_typeof_helper public static functions

    -
    1. static type value(const unit< Dim, System > &);
    +
    1. static BOOST_CONSTEXPR type value(const unit< Dim, System > &);
    diff --git a/doc/html/boost/units/power_typeof_helper.html b/doc/html/boost/units/power_typeof_helper.html index b939369bed..19993c8fc6 100644 --- a/doc/html/boost/units/power_typeof_helper.html +++ b/doc/html/boost/units/power_typeof_helper.html @@ -38,7 +38,7 @@ typedef unspecified type; // specifies the result type // public static functions - static type value(const BaseType &); + static BOOST_CONSTEXPR type value(const BaseType &); };

    Description

    @@ -47,7 +47,7 @@

    power_typeof_helper public static functions

    1. -
      static type value(const BaseType & base);
      Carries out the runtime calculation.
    +
    static BOOST_CONSTEXPR type value(const BaseType & base);
    Carries out the runtime calculation.
    diff --git a/doc/html/boost/units/quant_1_3_44_10_2_36_1_1_2.html b/doc/html/boost/units/quant_1_3_44_10_2_36_1_1_2.html index 66dcf299c4..c6bac21dfa 100644 --- a/doc/html/boost/units/quant_1_3_44_10_2_36_1_1_2.html +++ b/doc/html/boost/units/quant_1_3_44_10_2_36_1_1_2.html @@ -61,22 +61,24 @@ template<typename System2, typename Y2> explicit quantity(const quantity< unit< dimensionless_type, System2 >, Y2 > &, unspecified = 0); - this_type & operator=(const this_type &); + BOOST_CXX14_CONSTEXPR this_type & operator=(const this_type &); template<typename YY> - this_type & operator=(const quantity< unit< dimension_type, system_type >, YY > &); + BOOST_CXX14_CONSTEXPR this_type & + operator=(const quantity< unit< dimension_type, system_type >, YY > &); template<typename System2> - this_type & operator=(const quantity< BOOST_UNITS_DIMENSIONLESS_UNIT(System2), Y > &); + BOOST_CXX14_CONSTEXPR this_type & + operator=(const quantity< BOOST_UNITS_DIMENSIONLESS_UNIT(System2), Y > &); // public member functions - operator value_type() const; - const value_type & value() const; - this_type & operator+=(const this_type &); - this_type & operator-=(const this_type &); - this_type & operator*=(const value_type &); - this_type & operator/=(const value_type &); + BOOST_CONSTEXPR operator value_type() const; + BOOST_CONSTEXPR const value_type & value() const; + BOOST_CXX14_CONSTEXPR this_type & operator+=(const this_type &); + BOOST_CXX14_CONSTEXPR this_type & operator-=(const this_type &); + BOOST_CXX14_CONSTEXPR this_type & operator*=(const value_type &); + BOOST_CXX14_CONSTEXPR this_type & operator/=(const value_type &); // public static functions - static this_type from_value(const value_type &); + static BOOST_CONSTEXPR this_type from_value(const value_type &); };

    Description

    @@ -113,13 +115,15 @@ unspecified = 0);

    conversion between different unit systems is explicit when the units are not equivalent.

    -
  • this_type & operator=(const this_type & source);
    • +
  • BOOST_CXX14_CONSTEXPR this_type & operator=(const this_type & source);
  • template<typename YY> 
-  this_type & operator=(const quantity< unit< dimension_type, system_type >, YY > & source);
    implicit assignment between value types is allowed if allowed for value types themselves
    • + BOOST_CXX14_CONSTEXPR this_type & + operator=(const quantity< unit< dimension_type, system_type >, YY > & source);implicit assignment between value types is allowed if allowed for value types themselves 
  • template<typename System2> 
-  this_type & operator=(const quantity< BOOST_UNITS_DIMENSIONLESS_UNIT(System2), Y > & source);
    implicit assignment between different unit systems is allowed
    • + BOOST_CXX14_CONSTEXPR this_type & + operator=(const quantity< BOOST_UNITS_DIMENSIONLESS_UNIT(System2), Y > & source);implicit assignment between different unit systems is allowed
    @@ -127,24 +131,24 @@ quantity public member functions
    1. -
      operator value_type() const;
      implicit conversion to value_type is allowed
      2. +
      BOOST_CONSTEXPR operator value_type() const;
      implicit conversion to value_type is allowed
    2. -
      const value_type & value() const;
      constant accessor to value

      can add a quantity of the same type if add_typeof_helper<value_type,value_type>::type is convertible to value_type

      +
      BOOST_CONSTEXPR const value_type & value() const;
      constant accessor to value

      can add a quantity of the same type if add_typeof_helper<value_type,value_type>::type is convertible to value_type

    3. -
      this_type & operator+=(const this_type & source);
      can subtract a quantity of the same type if subtract_typeof_helper<value_type,value_type>::type is convertible to value_type
      4. +
      BOOST_CXX14_CONSTEXPR this_type & operator+=(const this_type & source);
      can subtract a quantity of the same type if subtract_typeof_helper<value_type,value_type>::type is convertible to value_type
    4. -
      this_type & operator-=(const this_type & source);
      can multiply a quantity by a scalar value_type if multiply_typeof_helper<value_type,value_type>::type is convertible to value_type
      5. +
      BOOST_CXX14_CONSTEXPR this_type & operator-=(const this_type & source);
      can multiply a quantity by a scalar value_type if multiply_typeof_helper<value_type,value_type>::type is convertible to value_type
    5. -
      this_type & operator*=(const value_type & val);
      can divide a quantity by a scalar value_type if divide_typeof_helper<value_type,value_type>::type is convertible to value_type
      6. -
    6. this_type & operator/=(const value_type & val);
      7. +
      BOOST_CXX14_CONSTEXPR this_type & operator*=(const value_type & val);
      can divide a quantity by a scalar value_type if divide_typeof_helper<value_type,value_type>::type is convertible to value_type +
    7. BOOST_CXX14_CONSTEXPR this_type & operator/=(const value_type & val);

    quantity public static functions

    1. -
      static this_type from_value(const value_type & val);
      Construct quantity directly from value_type.
    +
    static BOOST_CONSTEXPR this_type from_value(const value_type & val);
    Construct quantity directly from value_type.
    diff --git a/doc/html/boost/units/quantity.html b/doc/html/boost/units/quantity.html index c2b9a82c35..c931414196 100644 --- a/doc/html/boost/units/quantity.html +++ b/doc/html/boost/units/quantity.html @@ -53,29 +53,34 @@ template<typename Unit2, typename YY> quantity(const quantity< Unit2, YY > &, unspecified = 0); explicit quantity(const value_type &, int); - this_type & operator=(const this_type &); - template<typename YY> this_type & operator=(const quantity< Unit, YY > &); + BOOST_CXX14_CONSTEXPR this_type & operator=(const this_type &); + template<typename YY> + BOOST_CXX14_CONSTEXPR this_type & operator=(const quantity< Unit, YY > &); template<typename Unit2, typename YY> - this_type & operator=(const quantity< Unit2, YY > &); + BOOST_CXX14_CONSTEXPR this_type & operator=(const quantity< Unit2, YY > &); // private member functions BOOST_MPL_ASSERT_NOT(unspecified); // public member functions - const value_type & value() const; + BOOST_CONSTEXPR const value_type & value() const; template<typename Unit2, typename YY> - this_type & operator+=(const quantity< Unit2, YY > &); + BOOST_CXX14_CONSTEXPR this_type & + operator+=(const quantity< Unit2, YY > &); template<typename Unit2, typename YY> - this_type & operator-=(const quantity< Unit2, YY > &); + BOOST_CXX14_CONSTEXPR this_type & + operator-=(const quantity< Unit2, YY > &); template<typename Unit2, typename YY> - this_type & operator*=(const quantity< Unit2, YY > &); + BOOST_CXX14_CONSTEXPR this_type & + operator*=(const quantity< Unit2, YY > &); template<typename Unit2, typename YY> - this_type & operator/=(const quantity< Unit2, YY > &); - this_type & operator*=(const value_type &); - this_type & operator/=(const value_type &); + BOOST_CXX14_CONSTEXPR this_type & + operator/=(const quantity< Unit2, YY > &); + BOOST_CXX14_CONSTEXPR this_type & operator*=(const value_type &); + BOOST_CXX14_CONSTEXPR this_type & operator/=(const value_type &); // public static functions - static this_type from_value(const value_type &); + static BOOST_CONSTEXPR this_type from_value(const value_type &); };

    Description

    @@ -101,13 +106,15 @@ 
    template<typename Unit2, typename YY> 
   quantity(const quantity< Unit2, YY > & source, unspecified = 0);
    implicit conversion between different unit systems is allowed if each fundamental dimension is implicitly convertible 
  • explicit quantity(const value_type & val, int);
    • -
  • this_type & operator=(const this_type & source);
    • +
  • BOOST_CXX14_CONSTEXPR this_type & operator=(const this_type & source);
  • template<typename YY> 
-  this_type & operator=(const quantity< Unit, YY > & source);
    implicit assignment between value types is allowed if allowed for value types themselves
    • + BOOST_CXX14_CONSTEXPR this_type & + operator=(const quantity< Unit, YY > & source);implicit assignment between value types is allowed if allowed for value types themselves 
  • template<typename Unit2, typename YY> 
-  this_type & operator=(const quantity< Unit2, YY > & source);
    implicit assignment between different unit systems is allowed if each fundamental dimension is implicitly convertible
    • + BOOST_CXX14_CONSTEXPR this_type & + operator=(const quantity< Unit2, YY > & source);implicit assignment between different unit systems is allowed if each fundamental dimension is implicitly convertible
    @@ -120,28 +127,32 @@ quantity public member functions
    1. -
      const value_type & value() const;
      constant accessor to value

      can add a quantity of the same type if add_typeof_helper<value_type,value_type>::type is convertible to value_type

      +
      BOOST_CONSTEXPR const value_type & value() const;
      constant accessor to value

      can add a quantity of the same type if add_typeof_helper<value_type,value_type>::type is convertible to value_type 

    2. template<typename Unit2, typename YY> 
-  this_type & operator+=(const quantity< Unit2, YY > & source);
      can subtract a quantity of the same type if subtract_typeof_helper<value_type,value_type>::type is convertible to value_type
      3. + BOOST_CXX14_CONSTEXPR this_type & + operator+=(const quantity< Unit2, YY > & source);can subtract a quantity of the same type if subtract_typeof_helper<value_type,value_type>::type is convertible to value_type 
    3. template<typename Unit2, typename YY> 
-  this_type & operator-=(const quantity< Unit2, YY > & source);
      4. + BOOST_CXX14_CONSTEXPR this_type & + operator-=(const quantity< Unit2, YY > & source); 
    4. template<typename Unit2, typename YY> 
-  this_type & operator*=(const quantity< Unit2, YY > & source);
      5. + BOOST_CXX14_CONSTEXPR this_type & + operator*=(const quantity< Unit2, YY > & source); 
    5. template<typename Unit2, typename YY> 
-  this_type & operator/=(const quantity< Unit2, YY > & source);
      can multiply a quantity by a scalar value_type if multiply_typeof_helper<value_type,value_type>::type is convertible to value_type
      6. + BOOST_CXX14_CONSTEXPR this_type & + operator/=(const quantity< Unit2, YY > & source);can multiply a quantity by a scalar value_type if multiply_typeof_helper<value_type,value_type>::type is convertible to value_type
    6. -
      this_type & operator*=(const value_type & source);
      can divide a quantity by a scalar value_type if divide_typeof_helper<value_type,value_type>::type is convertible to value_type
      7. -
    7. this_type & operator/=(const value_type & source);
      8. +
      BOOST_CXX14_CONSTEXPR this_type & operator*=(const value_type & source);
      can divide a quantity by a scalar value_type if divide_typeof_helper<value_type,value_type>::type is convertible to value_type +
    8. BOOST_CXX14_CONSTEXPR this_type & operator/=(const value_type & source);

    quantity public static functions

    1. -
      static this_type from_value(const value_type & val);
      Construct quantity directly from value_type (potentially dangerous).
    +
    static BOOST_CONSTEXPR this_type from_value(const value_type & val);
    Construct quantity directly from value_type (potentially dangerous).

    Specializations

    diff --git a/doc/html/boost/units/root__1_3_44_10_2_42_1_1_4.html b/doc/html/boost/units/root__1_3_44_10_2_42_1_1_4.html index bfe27b2815..e2f705a9e6 100644 --- a/doc/html/boost/units/root__1_3_44_10_2_42_1_1_4.html +++ b/doc/html/boost/units/root__1_3_44_10_2_42_1_1_4.html @@ -38,14 +38,14 @@ typedef unit< typename static_root< Dim, static_rational< N, D > >::type, typename static_root< System, static_rational< N, D > >::type > type; // public static functions - static type value(const unit< Dim, System > &); + static BOOST_CONSTEXPR type value(const unit< Dim, System > &); };

    Description

    root_typeof_helper public static functions

    -
    1. static type value(const unit< Dim, System > &);
    +
    1. static BOOST_CONSTEXPR type value(const unit< Dim, System > &);
    diff --git a/doc/html/boost/units/root_typeof_helper.html b/doc/html/boost/units/root_typeof_helper.html index 487e201ef3..06c283c8ff 100644 --- a/doc/html/boost/units/root_typeof_helper.html +++ b/doc/html/boost/units/root_typeof_helper.html @@ -38,7 +38,7 @@ typedef unspecified type; // specifies the result type // public static functions - static type value(const Radicand &); + static BOOST_CONSTEXPR type value(const Radicand &); };

    Description

    @@ -47,7 +47,7 @@

    root_typeof_helper public static functions

    1. -
      static type value(const Radicand & base);
      Carries out the runtime calculation.
    +
    static BOOST_CONSTEXPR type value(const Radicand & base);
    Carries out the runtime calculation.
    diff --git a/doc/html/boost/units/scale.html b/doc/html/boost/units/scale.html index f9a16fdf8a..60a8397bde 100644 --- a/doc/html/boost/units/scale.html +++ b/doc/html/boost/units/scale.html @@ -39,10 +39,10 @@ typedef double value_type; // public static functions - static value_type value(); + static BOOST_CONSTEXPR value_type value(); // public data members - static const long base; + BOOST_STATIC_CONSTEXPR long base; };

    Description

    @@ -50,7 +50,7 @@

    scale public static functions

    -
    1. static value_type value();
    +
    1. static BOOST_CONSTEXPR value_type value();
    diff --git a/doc/html/boost/units/static_rational.html b/doc/html/boost/units/static_rational.html index d21c5b0253..fccc4b4574 100644 --- a/doc/html/boost/units/static_rational.html +++ b/doc/html/boost/units/static_rational.html @@ -43,12 +43,12 @@ static_rational(); // public static functions - static integer_type numerator(); - static integer_type denominator(); + static BOOST_CONSTEXPR integer_type numerator(); + static BOOST_CONSTEXPR integer_type denominator(); // public data members - static const integer_type Numerator; - static const integer_type Denominator; + BOOST_STATIC_CONSTEXPR integer_type Numerator; + BOOST_STATIC_CONSTEXPR integer_type Denominator; };

    Description

    @@ -74,8 +74,8 @@

    static_rational public static functions

      -
    1. static integer_type numerator();
      2. -
    2. static integer_type denominator();
      3. +
    3. static BOOST_CONSTEXPR integer_type numerator();
      4. +
    4. static BOOST_CONSTEXPR integer_type denominator();
    diff --git a/doc/html/boost/units/unit.html b/doc/html/boost/units/unit.html index 8a33370828..f8d48a9f7e 100644 --- a/doc/html/boost/units/unit.html +++ b/doc/html/boost/units/unit.html @@ -44,7 +44,7 @@ // construct/copy/destruct unit(); unit(const this_type &); - this_type & operator=(const this_type &); + BOOST_CXX14_CONSTEXPR this_type & operator=(const this_type &); };

    Description

    @@ -57,7 +57,7 @@ 
    1. unit();
    2. unit(const this_type &);
      3. -
    3. this_type & operator=(const this_type &);
      4. +
    4. BOOST_CXX14_CONSTEXPR this_type & operator=(const this_type &);
    diff --git a/doc/html/boost_asio.html b/doc/html/boost_asio.html index 07dac1028a..fa60f7881e 100644 --- a/doc/html/boost_asio.html +++ b/doc/html/boost_asio.html @@ -25,7 +25,7 @@

    Christopher Kohlhoff

    -

    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying @@ -82,7 +82,7 @@

    - +

    Last revised: December 14, 2017 at 00:01:04 GMT

    Last revised: April 11, 2018 at 14:03:06 GMT
    diff --git a/doc/html/boost_asio/example/cpp03/allocation/server.cpp b/doc/html/boost_asio/example/cpp03/allocation/server.cpp index cb4cbcd472..4c4bbf5b0f 100644 --- a/doc/html/boost_asio/example/cpp03/allocation/server.cpp +++ b/doc/html/boost_asio/example/cpp03/allocation/server.cpp @@ -2,7 +2,7 @@ // server.cpp // ~~~~~~~~~~ // -// Copyright (c) 2003-2017 Christopher M. Kohlhoff (chris at kohlhoff dot com) +// Copyright (c) 2003-2018 Christopher M. Kohlhoff (chris at kohlhoff dot com) // // Distributed under the Boost Software License, Version 1.0. (See accompanying // file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) diff --git a/doc/html/boost_asio/example/cpp03/buffers/reference_counted.cpp b/doc/html/boost_asio/example/cpp03/buffers/reference_counted.cpp index 81128f5986..f62b6bc16c 100644 --- a/doc/html/boost_asio/example/cpp03/buffers/reference_counted.cpp +++ b/doc/html/boost_asio/example/cpp03/buffers/reference_counted.cpp @@ -2,7 +2,7 @@ // reference_counted.cpp // ~~~~~~~~~~~~~~~~~~~~~ // -// Copyright (c) 2003-2017 Christopher M. Kohlhoff (chris at kohlhoff dot com) +// Copyright (c) 2003-2018 Christopher M. Kohlhoff (chris at kohlhoff dot com) // // Distributed under the Boost Software License, Version 1.0. (See accompanying // file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) diff --git a/doc/html/boost_asio/example/cpp03/chat/chat_client.cpp b/doc/html/boost_asio/example/cpp03/chat/chat_client.cpp index e37dfe4b57..9c60e92a5c 100644 --- a/doc/html/boost_asio/example/cpp03/chat/chat_client.cpp +++ b/doc/html/boost_asio/example/cpp03/chat/chat_client.cpp @@ -2,7 +2,7 @@ // chat_client.cpp // ~~~~~~~~~~~~~~~ // -// Copyright (c) 2003-2017 Christopher M. Kohlhoff (chris at kohlhoff dot com) +// Copyright (c) 2003-2018 Christopher M. Kohlhoff (chris at kohlhoff dot com) // // Distributed under the Boost Software License, Version 1.0. (See accompanying // file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) diff --git a/doc/html/boost_asio/example/cpp03/chat/chat_message.hpp b/doc/html/boost_asio/example/cpp03/chat/chat_message.hpp index 75d31ab993..942b480a19 100644 --- a/doc/html/boost_asio/example/cpp03/chat/chat_message.hpp +++ b/doc/html/boost_asio/example/cpp03/chat/chat_message.hpp @@ -2,7 +2,7 @@ // chat_message.hpp // ~~~~~~~~~~~~~~~~ // -// Copyright (c) 2003-2017 Christopher M. Kohlhoff (chris at kohlhoff dot com) +// Copyright (c) 2003-2018 Christopher M. Kohlhoff (chris at kohlhoff dot com) // // Distributed under the Boost Software License, Version 1.0. (See accompanying // file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) diff --git a/doc/html/boost_asio/example/cpp03/chat/chat_server.cpp b/doc/html/boost_asio/example/cpp03/chat/chat_server.cpp index 903b568bce..e5d79019e1 100644 --- a/doc/html/boost_asio/example/cpp03/chat/chat_server.cpp +++ b/doc/html/boost_asio/example/cpp03/chat/chat_server.cpp @@ -2,7 +2,7 @@ // chat_server.cpp // ~~~~~~~~~~~~~~~ // -// Copyright (c) 2003-2017 Christopher M. Kohlhoff (chris at kohlhoff dot com) +// Copyright (c) 2003-2018 Christopher M. Kohlhoff (chris at kohlhoff dot com) // // Distributed under the Boost Software License, Version 1.0. (See accompanying // file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) diff --git a/doc/html/boost_asio/example/cpp03/chat/posix_chat_client.cpp b/doc/html/boost_asio/example/cpp03/chat/posix_chat_client.cpp index 40844c94e4..994be59bd9 100644 --- a/doc/html/boost_asio/example/cpp03/chat/posix_chat_client.cpp +++ b/doc/html/boost_asio/example/cpp03/chat/posix_chat_client.cpp @@ -2,7 +2,7 @@ // posix_chat_client.cpp // ~~~~~~~~~~~~~~~~~~~~~ // -// Copyright (c) 2003-2017 Christopher M. Kohlhoff (chris at kohlhoff dot com) +// Copyright (c) 2003-2018 Christopher M. Kohlhoff (chris at kohlhoff dot com) // // Distributed under the Boost Software License, Version 1.0. (See accompanying // file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) diff --git a/doc/html/boost_asio/example/cpp03/echo/async_tcp_echo_server.cpp b/doc/html/boost_asio/example/cpp03/echo/async_tcp_echo_server.cpp index f0a672dde6..9afc46541b 100644 --- a/doc/html/boost_asio/example/cpp03/echo/async_tcp_echo_server.cpp +++ b/doc/html/boost_asio/example/cpp03/echo/async_tcp_echo_server.cpp @@ -2,7 +2,7 @@ // async_tcp_echo_server.cpp // ~~~~~~~~~~~~~~~~~~~~~~~~~ // -// Copyright (c) 2003-2017 Christopher M. Kohlhoff (chris at kohlhoff dot com) +// Copyright (c) 2003-2018 Christopher M. Kohlhoff (chris at kohlhoff dot com) // // Distributed under the Boost Software License, Version 1.0. (See accompanying // file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) diff --git a/doc/html/boost_asio/example/cpp03/echo/async_udp_echo_server.cpp b/doc/html/boost_asio/example/cpp03/echo/async_udp_echo_server.cpp index bdcd4f785b..5723d28011 100644 --- a/doc/html/boost_asio/example/cpp03/echo/async_udp_echo_server.cpp +++ b/doc/html/boost_asio/example/cpp03/echo/async_udp_echo_server.cpp @@ -2,7 +2,7 @@ // async_udp_echo_server.cpp // ~~~~~~~~~~~~~~~~~~~~~~~~~ // -// Copyright (c) 2003-2017 Christopher M. Kohlhoff (chris at kohlhoff dot com) +// Copyright (c) 2003-2018 Christopher M. Kohlhoff (chris at kohlhoff dot com) // // Distributed under the Boost Software License, Version 1.0. (See accompanying // file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) diff --git a/doc/html/boost_asio/example/cpp03/echo/blocking_tcp_echo_client.cpp b/doc/html/boost_asio/example/cpp03/echo/blocking_tcp_echo_client.cpp index 1def9d0bc0..74b28106bb 100644 --- a/doc/html/boost_asio/example/cpp03/echo/blocking_tcp_echo_client.cpp +++ b/doc/html/boost_asio/example/cpp03/echo/blocking_tcp_echo_client.cpp @@ -2,7 +2,7 @@ // blocking_tcp_echo_client.cpp // ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ // -// Copyright (c) 2003-2017 Christopher M. Kohlhoff (chris at kohlhoff dot com) +// Copyright (c) 2003-2018 Christopher M. Kohlhoff (chris at kohlhoff dot com) // // Distributed under the Boost Software License, Version 1.0. (See accompanying // file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) diff --git a/doc/html/boost_asio/example/cpp03/echo/blocking_tcp_echo_server.cpp b/doc/html/boost_asio/example/cpp03/echo/blocking_tcp_echo_server.cpp index c4acbe4e15..28846129fc 100644 --- a/doc/html/boost_asio/example/cpp03/echo/blocking_tcp_echo_server.cpp +++ b/doc/html/boost_asio/example/cpp03/echo/blocking_tcp_echo_server.cpp @@ -2,7 +2,7 @@ // blocking_tcp_echo_server.cpp // ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ // -// Copyright (c) 2003-2017 Christopher M. Kohlhoff (chris at kohlhoff dot com) +// Copyright (c) 2003-2018 Christopher M. Kohlhoff (chris at kohlhoff dot com) // // Distributed under the Boost Software License, Version 1.0. (See accompanying // file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) diff --git a/doc/html/boost_asio/example/cpp03/echo/blocking_udp_echo_client.cpp b/doc/html/boost_asio/example/cpp03/echo/blocking_udp_echo_client.cpp index 3b1067a03e..71d503a3da 100644 --- a/doc/html/boost_asio/example/cpp03/echo/blocking_udp_echo_client.cpp +++ b/doc/html/boost_asio/example/cpp03/echo/blocking_udp_echo_client.cpp @@ -2,7 +2,7 @@ // blocking_udp_echo_client.cpp // ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ // -// Copyright (c) 2003-2017 Christopher M. Kohlhoff (chris at kohlhoff dot com) +// Copyright (c) 2003-2018 Christopher M. Kohlhoff (chris at kohlhoff dot com) // // Distributed under the Boost Software License, Version 1.0. (See accompanying // file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) diff --git a/doc/html/boost_asio/example/cpp03/echo/blocking_udp_echo_server.cpp b/doc/html/boost_asio/example/cpp03/echo/blocking_udp_echo_server.cpp index 5e70a6e44f..00dc177698 100644 --- a/doc/html/boost_asio/example/cpp03/echo/blocking_udp_echo_server.cpp +++ b/doc/html/boost_asio/example/cpp03/echo/blocking_udp_echo_server.cpp @@ -2,7 +2,7 @@ // blocking_udp_echo_server.cpp // ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ // -// Copyright (c) 2003-2017 Christopher M. Kohlhoff (chris at kohlhoff dot com) +// Copyright (c) 2003-2018 Christopher M. Kohlhoff (chris at kohlhoff dot com) // // Distributed under the Boost Software License, Version 1.0. (See accompanying // file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) diff --git a/doc/html/boost_asio/example/cpp03/fork/daemon.cpp b/doc/html/boost_asio/example/cpp03/fork/daemon.cpp index 53fdf28781..db69befbae 100644 --- a/doc/html/boost_asio/example/cpp03/fork/daemon.cpp +++ b/doc/html/boost_asio/example/cpp03/fork/daemon.cpp @@ -2,7 +2,7 @@ // daemon.cpp // ~~~~~~~~~~ // -// Copyright (c) 2003-2017 Christopher M. Kohlhoff (chris at kohlhoff dot com) +// Copyright (c) 2003-2018 Christopher M. Kohlhoff (chris at kohlhoff dot com) // // Distributed under the Boost Software License, Version 1.0. (See accompanying // file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) diff --git a/doc/html/boost_asio/example/cpp03/fork/process_per_connection.cpp b/doc/html/boost_asio/example/cpp03/fork/process_per_connection.cpp index 305cdc2d23..f85ea93dca 100644 --- a/doc/html/boost_asio/example/cpp03/fork/process_per_connection.cpp +++ b/doc/html/boost_asio/example/cpp03/fork/process_per_connection.cpp @@ -2,7 +2,7 @@ // process_per_connection.cpp // ~~~~~~~~~~~~~~~~~~~~~~~~~~ // -// Copyright (c) 2003-2017 Christopher M. Kohlhoff (chris at kohlhoff dot com) +// Copyright (c) 2003-2018 Christopher M. Kohlhoff (chris at kohlhoff dot com) // // Distributed under the Boost Software License, Version 1.0. (See accompanying // file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) diff --git a/doc/html/boost_asio/example/cpp03/http/client/async_client.cpp b/doc/html/boost_asio/example/cpp03/http/client/async_client.cpp index 61832aa34f..5c486e39c0 100644 --- a/doc/html/boost_asio/example/cpp03/http/client/async_client.cpp +++ b/doc/html/boost_asio/example/cpp03/http/client/async_client.cpp @@ -2,7 +2,7 @@ // async_client.cpp // ~~~~~~~~~~~~~~~~ // -// Copyright (c) 2003-2017 Christopher M. Kohlhoff (chris at kohlhoff dot com) +// Copyright (c) 2003-2018 Christopher M. Kohlhoff (chris at kohlhoff dot com) // // Distributed under the Boost Software License, Version 1.0. (See accompanying // file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) diff --git a/doc/html/boost_asio/example/cpp03/http/client/sync_client.cpp b/doc/html/boost_asio/example/cpp03/http/client/sync_client.cpp index 6813e053f5..d2af7c593e 100644 --- a/doc/html/boost_asio/example/cpp03/http/client/sync_client.cpp +++ b/doc/html/boost_asio/example/cpp03/http/client/sync_client.cpp @@ -2,7 +2,7 @@ // sync_client.cpp // ~~~~~~~~~~~~~~~ // -// Copyright (c) 2003-2017 Christopher M. Kohlhoff (chris at kohlhoff dot com) +// Copyright (c) 2003-2018 Christopher M. Kohlhoff (chris at kohlhoff dot com) // // Distributed under the Boost Software License, Version 1.0. (See accompanying // file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) diff --git a/doc/html/boost_asio/example/cpp03/http/server/connection.cpp b/doc/html/boost_asio/example/cpp03/http/server/connection.cpp index c922257697..8e4a960cd5 100644 --- a/doc/html/boost_asio/example/cpp03/http/server/connection.cpp +++ b/doc/html/boost_asio/example/cpp03/http/server/connection.cpp @@ -2,7 +2,7 @@ // connection.cpp // ~~~~~~~~~~~~~~ // -// Copyright (c) 2003-2017 Christopher M. Kohlhoff (chris at kohlhoff dot com) +// Copyright (c) 2003-2018 Christopher M. Kohlhoff (chris at kohlhoff dot com) // // Distributed under the Boost Software License, Version 1.0. (See accompanying // file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) diff --git a/doc/html/boost_asio/example/cpp03/http/server/connection.hpp b/doc/html/boost_asio/example/cpp03/http/server/connection.hpp index 80bf20df5e..9f806549eb 100644 --- a/doc/html/boost_asio/example/cpp03/http/server/connection.hpp +++ b/doc/html/boost_asio/example/cpp03/http/server/connection.hpp @@ -2,7 +2,7 @@ // connection.hpp // ~~~~~~~~~~~~~~ // -// Copyright (c) 2003-2017 Christopher M. Kohlhoff (chris at kohlhoff dot com) +// Copyright (c) 2003-2018 Christopher M. Kohlhoff (chris at kohlhoff dot com) // // Distributed under the Boost Software License, Version 1.0. (See accompanying // file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) diff --git a/doc/html/boost_asio/example/cpp03/http/server/connection_manager.cpp b/doc/html/boost_asio/example/cpp03/http/server/connection_manager.cpp index ac2ba36817..b7eb24e211 100644 --- a/doc/html/boost_asio/example/cpp03/http/server/connection_manager.cpp +++ b/doc/html/boost_asio/example/cpp03/http/server/connection_manager.cpp @@ -2,7 +2,7 @@ // connection_manager.cpp // ~~~~~~~~~~~~~~~~~~~~~~ // -// Copyright (c) 2003-2017 Christopher M. Kohlhoff (chris at kohlhoff dot com) +// Copyright (c) 2003-2018 Christopher M. Kohlhoff (chris at kohlhoff dot com) // // Distributed under the Boost Software License, Version 1.0. (See accompanying // file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) diff --git a/doc/html/boost_asio/example/cpp03/http/server/connection_manager.hpp b/doc/html/boost_asio/example/cpp03/http/server/connection_manager.hpp index 706c4e1e07..1e18e4490e 100644 --- a/doc/html/boost_asio/example/cpp03/http/server/connection_manager.hpp +++ b/doc/html/boost_asio/example/cpp03/http/server/connection_manager.hpp @@ -2,7 +2,7 @@ // connection_manager.hpp // ~~~~~~~~~~~~~~~~~~~~~~ // -// Copyright (c) 2003-2017 Christopher M. Kohlhoff (chris at kohlhoff dot com) +// Copyright (c) 2003-2018 Christopher M. Kohlhoff (chris at kohlhoff dot com) // // Distributed under the Boost Software License, Version 1.0. (See accompanying // file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) diff --git a/doc/html/boost_asio/example/cpp03/http/server/header.hpp b/doc/html/boost_asio/example/cpp03/http/server/header.hpp index 877211f190..18bad986a4 100644 --- a/doc/html/boost_asio/example/cpp03/http/server/header.hpp +++ b/doc/html/boost_asio/example/cpp03/http/server/header.hpp @@ -2,7 +2,7 @@ // header.hpp // ~~~~~~~~~~ // -// Copyright (c) 2003-2017 Christopher M. Kohlhoff (chris at kohlhoff dot com) +// Copyright (c) 2003-2018 Christopher M. Kohlhoff (chris at kohlhoff dot com) // // Distributed under the Boost Software License, Version 1.0. (See accompanying // file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) diff --git a/doc/html/boost_asio/example/cpp03/http/server/main.cpp b/doc/html/boost_asio/example/cpp03/http/server/main.cpp index 0125aee76a..9ea3c09a96 100644 --- a/doc/html/boost_asio/example/cpp03/http/server/main.cpp +++ b/doc/html/boost_asio/example/cpp03/http/server/main.cpp @@ -2,7 +2,7 @@ // main.cpp // ~~~~~~~~ // -// Copyright (c) 2003-2017 Christopher M. Kohlhoff (chris at kohlhoff dot com) +// Copyright (c) 2003-2018 Christopher M. Kohlhoff (chris at kohlhoff dot com) // // Distributed under the Boost Software License, Version 1.0. (See accompanying // file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) diff --git a/doc/html/boost_asio/example/cpp03/http/server/mime_types.cpp b/doc/html/boost_asio/example/cpp03/http/server/mime_types.cpp index a03d5e7a16..8a66683e01 100644 --- a/doc/html/boost_asio/example/cpp03/http/server/mime_types.cpp +++ b/doc/html/boost_asio/example/cpp03/http/server/mime_types.cpp @@ -2,7 +2,7 @@ // mime_types.cpp // ~~~~~~~~~~~~~~ // -// Copyright (c) 2003-2017 Christopher M. Kohlhoff (chris at kohlhoff dot com) +// Copyright (c) 2003-2018 Christopher M. Kohlhoff (chris at kohlhoff dot com) // // Distributed under the Boost Software License, Version 1.0. (See accompanying // file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) diff --git a/doc/html/boost_asio/example/cpp03/http/server/mime_types.hpp b/doc/html/boost_asio/example/cpp03/http/server/mime_types.hpp index 891c443669..a5f352e69a 100644 --- a/doc/html/boost_asio/example/cpp03/http/server/mime_types.hpp +++ b/doc/html/boost_asio/example/cpp03/http/server/mime_types.hpp @@ -2,7 +2,7 @@ // mime_types.hpp // ~~~~~~~~~~~~~~ // -// Copyright (c) 2003-2017 Christopher M. Kohlhoff (chris at kohlhoff dot com) +// Copyright (c) 2003-2018 Christopher M. Kohlhoff (chris at kohlhoff dot com) // // Distributed under the Boost Software License, Version 1.0. (See accompanying // file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) diff --git a/doc/html/boost_asio/example/cpp03/http/server/reply.cpp b/doc/html/boost_asio/example/cpp03/http/server/reply.cpp index 4f08fe34d3..d9a4df0d7e 100644 --- a/doc/html/boost_asio/example/cpp03/http/server/reply.cpp +++ b/doc/html/boost_asio/example/cpp03/http/server/reply.cpp @@ -2,7 +2,7 @@ // reply.cpp // ~~~~~~~~~ // -// Copyright (c) 2003-2017 Christopher M. Kohlhoff (chris at kohlhoff dot com) +// Copyright (c) 2003-2018 Christopher M. Kohlhoff (chris at kohlhoff dot com) // // Distributed under the Boost Software License, Version 1.0. (See accompanying // file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) diff --git a/doc/html/boost_asio/example/cpp03/http/server/reply.hpp b/doc/html/boost_asio/example/cpp03/http/server/reply.hpp index 51d495bc65..03293227e7 100644 --- a/doc/html/boost_asio/example/cpp03/http/server/reply.hpp +++ b/doc/html/boost_asio/example/cpp03/http/server/reply.hpp @@ -2,7 +2,7 @@ // reply.hpp // ~~~~~~~~~ // -// Copyright (c) 2003-2017 Christopher M. Kohlhoff (chris at kohlhoff dot com) +// Copyright (c) 2003-2018 Christopher M. Kohlhoff (chris at kohlhoff dot com) // // Distributed under the Boost Software License, Version 1.0. (See accompanying // file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) diff --git a/doc/html/boost_asio/example/cpp03/http/server/request.hpp b/doc/html/boost_asio/example/cpp03/http/server/request.hpp index 20efff4dd3..6488b1ddeb 100644 --- a/doc/html/boost_asio/example/cpp03/http/server/request.hpp +++ b/doc/html/boost_asio/example/cpp03/http/server/request.hpp @@ -2,7 +2,7 @@ // request.hpp // ~~~~~~~~~~~ // -// Copyright (c) 2003-2017 Christopher M. Kohlhoff (chris at kohlhoff dot com) +// Copyright (c) 2003-2018 Christopher M. Kohlhoff (chris at kohlhoff dot com) // // Distributed under the Boost Software License, Version 1.0. (See accompanying // file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) diff --git a/doc/html/boost_asio/example/cpp03/http/server/request_handler.cpp b/doc/html/boost_asio/example/cpp03/http/server/request_handler.cpp index 1b45ce577c..a8a5a5529c 100644 --- a/doc/html/boost_asio/example/cpp03/http/server/request_handler.cpp +++ b/doc/html/boost_asio/example/cpp03/http/server/request_handler.cpp @@ -2,7 +2,7 @@ // request_handler.cpp // ~~~~~~~~~~~~~~~~~~~ // -// Copyright (c) 2003-2017 Christopher M. Kohlhoff (chris at kohlhoff dot com) +// Copyright (c) 2003-2018 Christopher M. Kohlhoff (chris at kohlhoff dot com) // // Distributed under the Boost Software License, Version 1.0. (See accompanying // file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) diff --git a/doc/html/boost_asio/example/cpp03/http/server/request_handler.hpp b/doc/html/boost_asio/example/cpp03/http/server/request_handler.hpp index 542df83b7a..7d05dbcb91 100644 --- a/doc/html/boost_asio/example/cpp03/http/server/request_handler.hpp +++ b/doc/html/boost_asio/example/cpp03/http/server/request_handler.hpp @@ -2,7 +2,7 @@ // request_handler.hpp // ~~~~~~~~~~~~~~~~~~~ // -// Copyright (c) 2003-2017 Christopher M. Kohlhoff (chris at kohlhoff dot com) +// Copyright (c) 2003-2018 Christopher M. Kohlhoff (chris at kohlhoff dot com) // // Distributed under the Boost Software License, Version 1.0. (See accompanying // file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) diff --git a/doc/html/boost_asio/example/cpp03/http/server/request_parser.cpp b/doc/html/boost_asio/example/cpp03/http/server/request_parser.cpp index bda4f1dbe3..7ce45ddeab 100644 --- a/doc/html/boost_asio/example/cpp03/http/server/request_parser.cpp +++ b/doc/html/boost_asio/example/cpp03/http/server/request_parser.cpp @@ -2,7 +2,7 @@ // request_parser.cpp // ~~~~~~~~~~~~~~~~~~ // -// Copyright (c) 2003-2017 Christopher M. Kohlhoff (chris at kohlhoff dot com) +// Copyright (c) 2003-2018 Christopher M. Kohlhoff (chris at kohlhoff dot com) // // Distributed under the Boost Software License, Version 1.0. (See accompanying // file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) diff --git a/doc/html/boost_asio/example/cpp03/http/server/request_parser.hpp b/doc/html/boost_asio/example/cpp03/http/server/request_parser.hpp index f8c45bec9f..ecda685f57 100644 --- a/doc/html/boost_asio/example/cpp03/http/server/request_parser.hpp +++ b/doc/html/boost_asio/example/cpp03/http/server/request_parser.hpp @@ -2,7 +2,7 @@ // request_parser.hpp // ~~~~~~~~~~~~~~~~~~ // -// Copyright (c) 2003-2017 Christopher M. Kohlhoff (chris at kohlhoff dot com) +// Copyright (c) 2003-2018 Christopher M. Kohlhoff (chris at kohlhoff dot com) // // Distributed under the Boost Software License, Version 1.0. (See accompanying // file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) diff --git a/doc/html/boost_asio/example/cpp03/http/server/server.cpp b/doc/html/boost_asio/example/cpp03/http/server/server.cpp index 1ebddad8d2..912a4369d4 100644 --- a/doc/html/boost_asio/example/cpp03/http/server/server.cpp +++ b/doc/html/boost_asio/example/cpp03/http/server/server.cpp @@ -2,7 +2,7 @@ // server.cpp // ~~~~~~~~~~ // -// Copyright (c) 2003-2017 Christopher M. Kohlhoff (chris at kohlhoff dot com) +// Copyright (c) 2003-2018 Christopher M. Kohlhoff (chris at kohlhoff dot com) // // Distributed under the Boost Software License, Version 1.0. (See accompanying // file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) diff --git a/doc/html/boost_asio/example/cpp03/http/server/server.hpp b/doc/html/boost_asio/example/cpp03/http/server/server.hpp index 8702dce85b..e14d3527a4 100644 --- a/doc/html/boost_asio/example/cpp03/http/server/server.hpp +++ b/doc/html/boost_asio/example/cpp03/http/server/server.hpp @@ -2,7 +2,7 @@ // server.hpp // ~~~~~~~~~~ // -// Copyright (c) 2003-2017 Christopher M. Kohlhoff (chris at kohlhoff dot com) +// Copyright (c) 2003-2018 Christopher M. Kohlhoff (chris at kohlhoff dot com) // // Distributed under the Boost Software License, Version 1.0. (See accompanying // file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) diff --git a/doc/html/boost_asio/example/cpp03/http/server2/connection.cpp b/doc/html/boost_asio/example/cpp03/http/server2/connection.cpp index 328e4a9fff..d671ba5bec 100644 --- a/doc/html/boost_asio/example/cpp03/http/server2/connection.cpp +++ b/doc/html/boost_asio/example/cpp03/http/server2/connection.cpp @@ -2,7 +2,7 @@ // connection.cpp // ~~~~~~~~~~~~~~ // -// Copyright (c) 2003-2017 Christopher M. Kohlhoff (chris at kohlhoff dot com) +// Copyright (c) 2003-2018 Christopher M. Kohlhoff (chris at kohlhoff dot com) // // Distributed under the Boost Software License, Version 1.0. (See accompanying // file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) diff --git a/doc/html/boost_asio/example/cpp03/http/server2/connection.hpp b/doc/html/boost_asio/example/cpp03/http/server2/connection.hpp index b9ba677f56..770a0aaa6b 100644 --- a/doc/html/boost_asio/example/cpp03/http/server2/connection.hpp +++ b/doc/html/boost_asio/example/cpp03/http/server2/connection.hpp @@ -2,7 +2,7 @@ // connection.hpp // ~~~~~~~~~~~~~~ // -// Copyright (c) 2003-2017 Christopher M. Kohlhoff (chris at kohlhoff dot com) +// Copyright (c) 2003-2018 Christopher M. Kohlhoff (chris at kohlhoff dot com) // // Distributed under the Boost Software License, Version 1.0. (See accompanying // file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) diff --git a/doc/html/boost_asio/example/cpp03/http/server2/header.hpp b/doc/html/boost_asio/example/cpp03/http/server2/header.hpp index 45613d3cf4..559c5c1aef 100644 --- a/doc/html/boost_asio/example/cpp03/http/server2/header.hpp +++ b/doc/html/boost_asio/example/cpp03/http/server2/header.hpp @@ -2,7 +2,7 @@ // header.hpp // ~~~~~~~~~~ // -// Copyright (c) 2003-2017 Christopher M. Kohlhoff (chris at kohlhoff dot com) +// Copyright (c) 2003-2018 Christopher M. Kohlhoff (chris at kohlhoff dot com) // // Distributed under the Boost Software License, Version 1.0. (See accompanying // file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) diff --git a/doc/html/boost_asio/example/cpp03/http/server2/io_context_pool.cpp b/doc/html/boost_asio/example/cpp03/http/server2/io_context_pool.cpp index ed47b75569..817517a7e4 100644 --- a/doc/html/boost_asio/example/cpp03/http/server2/io_context_pool.cpp +++ b/doc/html/boost_asio/example/cpp03/http/server2/io_context_pool.cpp @@ -2,7 +2,7 @@ // io_context_pool.cpp // ~~~~~~~~~~~~~~~~~~~ // -// Copyright (c) 2003-2017 Christopher M. Kohlhoff (chris at kohlhoff dot com) +// Copyright (c) 2003-2018 Christopher M. Kohlhoff (chris at kohlhoff dot com) // // Distributed under the Boost Software License, Version 1.0. (See accompanying // file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) diff --git a/doc/html/boost_asio/example/cpp03/http/server2/io_context_pool.hpp b/doc/html/boost_asio/example/cpp03/http/server2/io_context_pool.hpp index 7af524a077..06bd88658a 100644 --- a/doc/html/boost_asio/example/cpp03/http/server2/io_context_pool.hpp +++ b/doc/html/boost_asio/example/cpp03/http/server2/io_context_pool.hpp @@ -2,7 +2,7 @@ // io_context_pool.hpp // ~~~~~~~~~~~~~~~~~~~ // -// Copyright (c) 2003-2017 Christopher M. Kohlhoff (chris at kohlhoff dot com) +// Copyright (c) 2003-2018 Christopher M. Kohlhoff (chris at kohlhoff dot com) // // Distributed under the Boost Software License, Version 1.0. (See accompanying // file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) diff --git a/doc/html/boost_asio/example/cpp03/http/server2/main.cpp b/doc/html/boost_asio/example/cpp03/http/server2/main.cpp index c6a00836c2..2d04db4cb7 100644 --- a/doc/html/boost_asio/example/cpp03/http/server2/main.cpp +++ b/doc/html/boost_asio/example/cpp03/http/server2/main.cpp @@ -2,7 +2,7 @@ // main.cpp // ~~~~~~~~ // -// Copyright (c) 2003-2017 Christopher M. Kohlhoff (chris at kohlhoff dot com) +// Copyright (c) 2003-2018 Christopher M. Kohlhoff (chris at kohlhoff dot com) // // Distributed under the Boost Software License, Version 1.0. (See accompanying // file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) diff --git a/doc/html/boost_asio/example/cpp03/http/server2/mime_types.cpp b/doc/html/boost_asio/example/cpp03/http/server2/mime_types.cpp index 5dee5eb3b6..0fdd731015 100644 --- a/doc/html/boost_asio/example/cpp03/http/server2/mime_types.cpp +++ b/doc/html/boost_asio/example/cpp03/http/server2/mime_types.cpp @@ -2,7 +2,7 @@ // mime_types.cpp // ~~~~~~~~~~~~~~ // -// Copyright (c) 2003-2017 Christopher M. Kohlhoff (chris at kohlhoff dot com) +// Copyright (c) 2003-2018 Christopher M. Kohlhoff (chris at kohlhoff dot com) // // Distributed under the Boost Software License, Version 1.0. (See accompanying // file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) diff --git a/doc/html/boost_asio/example/cpp03/http/server2/mime_types.hpp b/doc/html/boost_asio/example/cpp03/http/server2/mime_types.hpp index bf1f6d39e5..c11280b5d0 100644 --- a/doc/html/boost_asio/example/cpp03/http/server2/mime_types.hpp +++ b/doc/html/boost_asio/example/cpp03/http/server2/mime_types.hpp @@ -2,7 +2,7 @@ // mime_types.hpp // ~~~~~~~~~~~~~~ // -// Copyright (c) 2003-2017 Christopher M. Kohlhoff (chris at kohlhoff dot com) +// Copyright (c) 2003-2018 Christopher M. Kohlhoff (chris at kohlhoff dot com) // // Distributed under the Boost Software License, Version 1.0. (See accompanying // file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) diff --git a/doc/html/boost_asio/example/cpp03/http/server2/reply.cpp b/doc/html/boost_asio/example/cpp03/http/server2/reply.cpp index d7f7c987cb..5da5414621 100644 --- a/doc/html/boost_asio/example/cpp03/http/server2/reply.cpp +++ b/doc/html/boost_asio/example/cpp03/http/server2/reply.cpp @@ -2,7 +2,7 @@ // reply.cpp // ~~~~~~~~~ // -// Copyright (c) 2003-2017 Christopher M. Kohlhoff (chris at kohlhoff dot com) +// Copyright (c) 2003-2018 Christopher M. Kohlhoff (chris at kohlhoff dot com) // // Distributed under the Boost Software License, Version 1.0. (See accompanying // file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) diff --git a/doc/html/boost_asio/example/cpp03/http/server2/reply.hpp b/doc/html/boost_asio/example/cpp03/http/server2/reply.hpp index fd386217ef..8a974bbc44 100644 --- a/doc/html/boost_asio/example/cpp03/http/server2/reply.hpp +++ b/doc/html/boost_asio/example/cpp03/http/server2/reply.hpp @@ -2,7 +2,7 @@ // reply.hpp // ~~~~~~~~~ // -// Copyright (c) 2003-2017 Christopher M. Kohlhoff (chris at kohlhoff dot com) +// Copyright (c) 2003-2018 Christopher M. Kohlhoff (chris at kohlhoff dot com) // // Distributed under the Boost Software License, Version 1.0. (See accompanying // file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) diff --git a/doc/html/boost_asio/example/cpp03/http/server2/request.hpp b/doc/html/boost_asio/example/cpp03/http/server2/request.hpp index 0d70416209..3eb3494f3e 100644 --- a/doc/html/boost_asio/example/cpp03/http/server2/request.hpp +++ b/doc/html/boost_asio/example/cpp03/http/server2/request.hpp @@ -2,7 +2,7 @@ // request.hpp // ~~~~~~~~~~~ // -// Copyright (c) 2003-2017 Christopher M. Kohlhoff (chris at kohlhoff dot com) +// Copyright (c) 2003-2018 Christopher M. Kohlhoff (chris at kohlhoff dot com) // // Distributed under the Boost Software License, Version 1.0. (See accompanying // file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) diff --git a/doc/html/boost_asio/example/cpp03/http/server2/request_handler.cpp b/doc/html/boost_asio/example/cpp03/http/server2/request_handler.cpp index 84f50b8732..acac4d1830 100644 --- a/doc/html/boost_asio/example/cpp03/http/server2/request_handler.cpp +++ b/doc/html/boost_asio/example/cpp03/http/server2/request_handler.cpp @@ -2,7 +2,7 @@ // request_handler.cpp // ~~~~~~~~~~~~~~~~~~~ // -// Copyright (c) 2003-2017 Christopher M. Kohlhoff (chris at kohlhoff dot com) +// Copyright (c) 2003-2018 Christopher M. Kohlhoff (chris at kohlhoff dot com) // // Distributed under the Boost Software License, Version 1.0. (See accompanying // file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) diff --git a/doc/html/boost_asio/example/cpp03/http/server2/request_handler.hpp b/doc/html/boost_asio/example/cpp03/http/server2/request_handler.hpp index 75d8d0d0ba..3f9c743304 100644 --- a/doc/html/boost_asio/example/cpp03/http/server2/request_handler.hpp +++ b/doc/html/boost_asio/example/cpp03/http/server2/request_handler.hpp @@ -2,7 +2,7 @@ // request_handler.hpp // ~~~~~~~~~~~~~~~~~~~ // -// Copyright (c) 2003-2017 Christopher M. Kohlhoff (chris at kohlhoff dot com) +// Copyright (c) 2003-2018 Christopher M. Kohlhoff (chris at kohlhoff dot com) // // Distributed under the Boost Software License, Version 1.0. (See accompanying // file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) diff --git a/doc/html/boost_asio/example/cpp03/http/server2/request_parser.cpp b/doc/html/boost_asio/example/cpp03/http/server2/request_parser.cpp index 8e2e4637e6..b7e7d6490c 100644 --- a/doc/html/boost_asio/example/cpp03/http/server2/request_parser.cpp +++ b/doc/html/boost_asio/example/cpp03/http/server2/request_parser.cpp @@ -2,7 +2,7 @@ // request_parser.cpp // ~~~~~~~~~~~~~~~~~~ // -// Copyright (c) 2003-2017 Christopher M. Kohlhoff (chris at kohlhoff dot com) +// Copyright (c) 2003-2018 Christopher M. Kohlhoff (chris at kohlhoff dot com) // // Distributed under the Boost Software License, Version 1.0. (See accompanying // file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) diff --git a/doc/html/boost_asio/example/cpp03/http/server2/request_parser.hpp b/doc/html/boost_asio/example/cpp03/http/server2/request_parser.hpp index a8c6945492..a986720951 100644 --- a/doc/html/boost_asio/example/cpp03/http/server2/request_parser.hpp +++ b/doc/html/boost_asio/example/cpp03/http/server2/request_parser.hpp @@ -2,7 +2,7 @@ // request_parser.hpp // ~~~~~~~~~~~~~~~~~~ // -// Copyright (c) 2003-2017 Christopher M. Kohlhoff (chris at kohlhoff dot com) +// Copyright (c) 2003-2018 Christopher M. Kohlhoff (chris at kohlhoff dot com) // // Distributed under the Boost Software License, Version 1.0. (See accompanying // file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) diff --git a/doc/html/boost_asio/example/cpp03/http/server2/server.cpp b/doc/html/boost_asio/example/cpp03/http/server2/server.cpp index d3bfa58ea7..367708c59d 100644 --- a/doc/html/boost_asio/example/cpp03/http/server2/server.cpp +++ b/doc/html/boost_asio/example/cpp03/http/server2/server.cpp @@ -2,7 +2,7 @@ // server.cpp // ~~~~~~~~~~ // -// Copyright (c) 2003-2017 Christopher M. Kohlhoff (chris at kohlhoff dot com) +// Copyright (c) 2003-2018 Christopher M. Kohlhoff (chris at kohlhoff dot com) // // Distributed under the Boost Software License, Version 1.0. (See accompanying // file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) diff --git a/doc/html/boost_asio/example/cpp03/http/server2/server.hpp b/doc/html/boost_asio/example/cpp03/http/server2/server.hpp index a35415b5e0..3867a9204d 100644 --- a/doc/html/boost_asio/example/cpp03/http/server2/server.hpp +++ b/doc/html/boost_asio/example/cpp03/http/server2/server.hpp @@ -2,7 +2,7 @@ // server.hpp // ~~~~~~~~~~ // -// Copyright (c) 2003-2017 Christopher M. Kohlhoff (chris at kohlhoff dot com) +// Copyright (c) 2003-2018 Christopher M. Kohlhoff (chris at kohlhoff dot com) // // Distributed under the Boost Software License, Version 1.0. (See accompanying // file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) diff --git a/doc/html/boost_asio/example/cpp03/http/server3/connection.cpp b/doc/html/boost_asio/example/cpp03/http/server3/connection.cpp index 37890b570d..378ded16b2 100644 --- a/doc/html/boost_asio/example/cpp03/http/server3/connection.cpp +++ b/doc/html/boost_asio/example/cpp03/http/server3/connection.cpp @@ -2,7 +2,7 @@ // connection.cpp // ~~~~~~~~~~~~~~ // -// Copyright (c) 2003-2017 Christopher M. Kohlhoff (chris at kohlhoff dot com) +// Copyright (c) 2003-2018 Christopher M. Kohlhoff (chris at kohlhoff dot com) // // Distributed under the Boost Software License, Version 1.0. (See accompanying // file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) diff --git a/doc/html/boost_asio/example/cpp03/http/server3/connection.hpp b/doc/html/boost_asio/example/cpp03/http/server3/connection.hpp index 420dd0e743..5cb78db242 100644 --- a/doc/html/boost_asio/example/cpp03/http/server3/connection.hpp +++ b/doc/html/boost_asio/example/cpp03/http/server3/connection.hpp @@ -2,7 +2,7 @@ // connection.hpp // ~~~~~~~~~~~~~~ // -// Copyright (c) 2003-2017 Christopher M. Kohlhoff (chris at kohlhoff dot com) +// Copyright (c) 2003-2018 Christopher M. Kohlhoff (chris at kohlhoff dot com) // // Distributed under the Boost Software License, Version 1.0. (See accompanying // file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) diff --git a/doc/html/boost_asio/example/cpp03/http/server3/header.hpp b/doc/html/boost_asio/example/cpp03/http/server3/header.hpp index 54e034ba29..d53fede4b0 100644 --- a/doc/html/boost_asio/example/cpp03/http/server3/header.hpp +++ b/doc/html/boost_asio/example/cpp03/http/server3/header.hpp @@ -2,7 +2,7 @@ // header.hpp // ~~~~~~~~~~ // -// Copyright (c) 2003-2017 Christopher M. Kohlhoff (chris at kohlhoff dot com) +// Copyright (c) 2003-2018 Christopher M. Kohlhoff (chris at kohlhoff dot com) // // Distributed under the Boost Software License, Version 1.0. (See accompanying // file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) diff --git a/doc/html/boost_asio/example/cpp03/http/server3/main.cpp b/doc/html/boost_asio/example/cpp03/http/server3/main.cpp index ee1812e425..c7af0c7a1c 100644 --- a/doc/html/boost_asio/example/cpp03/http/server3/main.cpp +++ b/doc/html/boost_asio/example/cpp03/http/server3/main.cpp @@ -2,7 +2,7 @@ // main.cpp // ~~~~~~~~ // -// Copyright (c) 2003-2017 Christopher M. Kohlhoff (chris at kohlhoff dot com) +// Copyright (c) 2003-2018 Christopher M. Kohlhoff (chris at kohlhoff dot com) // // Distributed under the Boost Software License, Version 1.0. (See accompanying // file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) diff --git a/doc/html/boost_asio/example/cpp03/http/server3/mime_types.cpp b/doc/html/boost_asio/example/cpp03/http/server3/mime_types.cpp index 97aba9db57..8bc6cd47eb 100644 --- a/doc/html/boost_asio/example/cpp03/http/server3/mime_types.cpp +++ b/doc/html/boost_asio/example/cpp03/http/server3/mime_types.cpp @@ -2,7 +2,7 @@ // mime_types.cpp // ~~~~~~~~~~~~~~ // -// Copyright (c) 2003-2017 Christopher M. Kohlhoff (chris at kohlhoff dot com) +// Copyright (c) 2003-2018 Christopher M. Kohlhoff (chris at kohlhoff dot com) // // Distributed under the Boost Software License, Version 1.0. (See accompanying // file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) diff --git a/doc/html/boost_asio/example/cpp03/http/server3/mime_types.hpp b/doc/html/boost_asio/example/cpp03/http/server3/mime_types.hpp index e4793e0613..559380699f 100644 --- a/doc/html/boost_asio/example/cpp03/http/server3/mime_types.hpp +++ b/doc/html/boost_asio/example/cpp03/http/server3/mime_types.hpp @@ -2,7 +2,7 @@ // mime_types.hpp // ~~~~~~~~~~~~~~ // -// Copyright (c) 2003-2017 Christopher M. Kohlhoff (chris at kohlhoff dot com) +// Copyright (c) 2003-2018 Christopher M. Kohlhoff (chris at kohlhoff dot com) // // Distributed under the Boost Software License, Version 1.0. (See accompanying // file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) diff --git a/doc/html/boost_asio/example/cpp03/http/server3/reply.cpp b/doc/html/boost_asio/example/cpp03/http/server3/reply.cpp index a8a2f3e7b9..e899c68424 100644 --- a/doc/html/boost_asio/example/cpp03/http/server3/reply.cpp +++ b/doc/html/boost_asio/example/cpp03/http/server3/reply.cpp @@ -2,7 +2,7 @@ // reply.cpp // ~~~~~~~~~ // -// Copyright (c) 2003-2017 Christopher M. Kohlhoff (chris at kohlhoff dot com) +// Copyright (c) 2003-2018 Christopher M. Kohlhoff (chris at kohlhoff dot com) // // Distributed under the Boost Software License, Version 1.0. (See accompanying // file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) diff --git a/doc/html/boost_asio/example/cpp03/http/server3/reply.hpp b/doc/html/boost_asio/example/cpp03/http/server3/reply.hpp index fa3c7e8f7f..7931e70a69 100644 --- a/doc/html/boost_asio/example/cpp03/http/server3/reply.hpp +++ b/doc/html/boost_asio/example/cpp03/http/server3/reply.hpp @@ -2,7 +2,7 @@ // reply.hpp // ~~~~~~~~~ // -// Copyright (c) 2003-2017 Christopher M. Kohlhoff (chris at kohlhoff dot com) +// Copyright (c) 2003-2018 Christopher M. Kohlhoff (chris at kohlhoff dot com) // // Distributed under the Boost Software License, Version 1.0. (See accompanying // file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) diff --git a/doc/html/boost_asio/example/cpp03/http/server3/request.hpp b/doc/html/boost_asio/example/cpp03/http/server3/request.hpp index 388f80b6f9..92ef781771 100644 --- a/doc/html/boost_asio/example/cpp03/http/server3/request.hpp +++ b/doc/html/boost_asio/example/cpp03/http/server3/request.hpp @@ -2,7 +2,7 @@ // request.hpp // ~~~~~~~~~~~ // -// Copyright (c) 2003-2017 Christopher M. Kohlhoff (chris at kohlhoff dot com) +// Copyright (c) 2003-2018 Christopher M. Kohlhoff (chris at kohlhoff dot com) // // Distributed under the Boost Software License, Version 1.0. (See accompanying // file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) diff --git a/doc/html/boost_asio/example/cpp03/http/server3/request_handler.cpp b/doc/html/boost_asio/example/cpp03/http/server3/request_handler.cpp index 611d06c311..e13d21d884 100644 --- a/doc/html/boost_asio/example/cpp03/http/server3/request_handler.cpp +++ b/doc/html/boost_asio/example/cpp03/http/server3/request_handler.cpp @@ -2,7 +2,7 @@ // request_handler.cpp // ~~~~~~~~~~~~~~~~~~~ // -// Copyright (c) 2003-2017 Christopher M. Kohlhoff (chris at kohlhoff dot com) +// Copyright (c) 2003-2018 Christopher M. Kohlhoff (chris at kohlhoff dot com) // // Distributed under the Boost Software License, Version 1.0. (See accompanying // file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) diff --git a/doc/html/boost_asio/example/cpp03/http/server3/request_handler.hpp b/doc/html/boost_asio/example/cpp03/http/server3/request_handler.hpp index 167b3771d5..8697fbcd9e 100644 --- a/doc/html/boost_asio/example/cpp03/http/server3/request_handler.hpp +++ b/doc/html/boost_asio/example/cpp03/http/server3/request_handler.hpp @@ -2,7 +2,7 @@ // request_handler.hpp // ~~~~~~~~~~~~~~~~~~~ // -// Copyright (c) 2003-2017 Christopher M. Kohlhoff (chris at kohlhoff dot com) +// Copyright (c) 2003-2018 Christopher M. Kohlhoff (chris at kohlhoff dot com) // // Distributed under the Boost Software License, Version 1.0. (See accompanying // file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) diff --git a/doc/html/boost_asio/example/cpp03/http/server3/request_parser.cpp b/doc/html/boost_asio/example/cpp03/http/server3/request_parser.cpp index 9ef5e7c773..1623443829 100644 --- a/doc/html/boost_asio/example/cpp03/http/server3/request_parser.cpp +++ b/doc/html/boost_asio/example/cpp03/http/server3/request_parser.cpp @@ -2,7 +2,7 @@ // request_parser.cpp // ~~~~~~~~~~~~~~~~~~ // -// Copyright (c) 2003-2017 Christopher M. Kohlhoff (chris at kohlhoff dot com) +// Copyright (c) 2003-2018 Christopher M. Kohlhoff (chris at kohlhoff dot com) // // Distributed under the Boost Software License, Version 1.0. (See accompanying // file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) diff --git a/doc/html/boost_asio/example/cpp03/http/server3/request_parser.hpp b/doc/html/boost_asio/example/cpp03/http/server3/request_parser.hpp index 20da2d55e7..19cfa1c9f8 100644 --- a/doc/html/boost_asio/example/cpp03/http/server3/request_parser.hpp +++ b/doc/html/boost_asio/example/cpp03/http/server3/request_parser.hpp @@ -2,7 +2,7 @@ // request_parser.hpp // ~~~~~~~~~~~~~~~~~~ // -// Copyright (c) 2003-2017 Christopher M. Kohlhoff (chris at kohlhoff dot com) +// Copyright (c) 2003-2018 Christopher M. Kohlhoff (chris at kohlhoff dot com) // // Distributed under the Boost Software License, Version 1.0. (See accompanying // file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) diff --git a/doc/html/boost_asio/example/cpp03/http/server3/server.cpp b/doc/html/boost_asio/example/cpp03/http/server3/server.cpp index fc1c651686..edcc3a89fd 100644 --- a/doc/html/boost_asio/example/cpp03/http/server3/server.cpp +++ b/doc/html/boost_asio/example/cpp03/http/server3/server.cpp @@ -2,7 +2,7 @@ // server.cpp // ~~~~~~~~~~ // -// Copyright (c) 2003-2017 Christopher M. Kohlhoff (chris at kohlhoff dot com) +// Copyright (c) 2003-2018 Christopher M. Kohlhoff (chris at kohlhoff dot com) // // Distributed under the Boost Software License, Version 1.0. (See accompanying // file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) diff --git a/doc/html/boost_asio/example/cpp03/http/server3/server.hpp b/doc/html/boost_asio/example/cpp03/http/server3/server.hpp index 8f1b1c20af..ede47b232a 100644 --- a/doc/html/boost_asio/example/cpp03/http/server3/server.hpp +++ b/doc/html/boost_asio/example/cpp03/http/server3/server.hpp @@ -2,7 +2,7 @@ // server.hpp // ~~~~~~~~~~ // -// Copyright (c) 2003-2017 Christopher M. Kohlhoff (chris at kohlhoff dot com) +// Copyright (c) 2003-2018 Christopher M. Kohlhoff (chris at kohlhoff dot com) // // Distributed under the Boost Software License, Version 1.0. (See accompanying // file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) diff --git a/doc/html/boost_asio/example/cpp03/http/server4/file_handler.cpp b/doc/html/boost_asio/example/cpp03/http/server4/file_handler.cpp index d1cdb0e2f0..1a4bb6c8ab 100644 --- a/doc/html/boost_asio/example/cpp03/http/server4/file_handler.cpp +++ b/doc/html/boost_asio/example/cpp03/http/server4/file_handler.cpp @@ -2,7 +2,7 @@ // file_handler.cpp // ~~~~~~~~~~~~~~~~ // -// Copyright (c) 2003-2017 Christopher M. Kohlhoff (chris at kohlhoff dot com) +// Copyright (c) 2003-2018 Christopher M. Kohlhoff (chris at kohlhoff dot com) // // Distributed under the Boost Software License, Version 1.0. (See accompanying // file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) diff --git a/doc/html/boost_asio/example/cpp03/http/server4/file_handler.hpp b/doc/html/boost_asio/example/cpp03/http/server4/file_handler.hpp index 678da526e8..1835922bfc 100644 --- a/doc/html/boost_asio/example/cpp03/http/server4/file_handler.hpp +++ b/doc/html/boost_asio/example/cpp03/http/server4/file_handler.hpp @@ -2,7 +2,7 @@ // file_handler.hpp // ~~~~~~~~~~~~~~~~ // -// Copyright (c) 2003-2017 Christopher M. Kohlhoff (chris at kohlhoff dot com) +// Copyright (c) 2003-2018 Christopher M. Kohlhoff (chris at kohlhoff dot com) // // Distributed under the Boost Software License, Version 1.0. (See accompanying // file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) diff --git a/doc/html/boost_asio/example/cpp03/http/server4/header.hpp b/doc/html/boost_asio/example/cpp03/http/server4/header.hpp index 4478e1de39..8fa25127b7 100644 --- a/doc/html/boost_asio/example/cpp03/http/server4/header.hpp +++ b/doc/html/boost_asio/example/cpp03/http/server4/header.hpp @@ -2,7 +2,7 @@ // header.hpp // ~~~~~~~~~~ // -// Copyright (c) 2003-2017 Christopher M. Kohlhoff (chris at kohlhoff dot com) +// Copyright (c) 2003-2018 Christopher M. Kohlhoff (chris at kohlhoff dot com) // // Distributed under the Boost Software License, Version 1.0. (See accompanying // file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) diff --git a/doc/html/boost_asio/example/cpp03/http/server4/main.cpp b/doc/html/boost_asio/example/cpp03/http/server4/main.cpp index 449ffa3a3e..cdcd484388 100644 --- a/doc/html/boost_asio/example/cpp03/http/server4/main.cpp +++ b/doc/html/boost_asio/example/cpp03/http/server4/main.cpp @@ -2,7 +2,7 @@ // main.cpp // ~~~~~~~~ // -// Copyright (c) 2003-2017 Christopher M. Kohlhoff (chris at kohlhoff dot com) +// Copyright (c) 2003-2018 Christopher M. Kohlhoff (chris at kohlhoff dot com) // // Distributed under the Boost Software License, Version 1.0. (See accompanying // file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) diff --git a/doc/html/boost_asio/example/cpp03/http/server4/mime_types.cpp b/doc/html/boost_asio/example/cpp03/http/server4/mime_types.cpp index 255f628e89..7b30ffbf4e 100644 --- a/doc/html/boost_asio/example/cpp03/http/server4/mime_types.cpp +++ b/doc/html/boost_asio/example/cpp03/http/server4/mime_types.cpp @@ -2,7 +2,7 @@ // mime_types.cpp // ~~~~~~~~~~~~~~ // -// Copyright (c) 2003-2017 Christopher M. Kohlhoff (chris at kohlhoff dot com) +// Copyright (c) 2003-2018 Christopher M. Kohlhoff (chris at kohlhoff dot com) // // Distributed under the Boost Software License, Version 1.0. (See accompanying // file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) diff --git a/doc/html/boost_asio/example/cpp03/http/server4/mime_types.hpp b/doc/html/boost_asio/example/cpp03/http/server4/mime_types.hpp index 7f3f04f9ce..6eae007d36 100644 --- a/doc/html/boost_asio/example/cpp03/http/server4/mime_types.hpp +++ b/doc/html/boost_asio/example/cpp03/http/server4/mime_types.hpp @@ -2,7 +2,7 @@ // mime_types.hpp // ~~~~~~~~~~~~~~ // -// Copyright (c) 2003-2017 Christopher M. Kohlhoff (chris at kohlhoff dot com) +// Copyright (c) 2003-2018 Christopher M. Kohlhoff (chris at kohlhoff dot com) // // Distributed under the Boost Software License, Version 1.0. (See accompanying // file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) diff --git a/doc/html/boost_asio/example/cpp03/http/server4/reply.cpp b/doc/html/boost_asio/example/cpp03/http/server4/reply.cpp index b69247c2e6..5d21aa18d0 100644 --- a/doc/html/boost_asio/example/cpp03/http/server4/reply.cpp +++ b/doc/html/boost_asio/example/cpp03/http/server4/reply.cpp @@ -2,7 +2,7 @@ // reply.cpp // ~~~~~~~~~ // -// Copyright (c) 2003-2017 Christopher M. Kohlhoff (chris at kohlhoff dot com) +// Copyright (c) 2003-2018 Christopher M. Kohlhoff (chris at kohlhoff dot com) // // Distributed under the Boost Software License, Version 1.0. (See accompanying // file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) diff --git a/doc/html/boost_asio/example/cpp03/http/server4/reply.hpp b/doc/html/boost_asio/example/cpp03/http/server4/reply.hpp index 1f744a7a17..fae8bfea41 100644 --- a/doc/html/boost_asio/example/cpp03/http/server4/reply.hpp +++ b/doc/html/boost_asio/example/cpp03/http/server4/reply.hpp @@ -2,7 +2,7 @@ // reply.hpp // ~~~~~~~~~ // -// Copyright (c) 2003-2017 Christopher M. Kohlhoff (chris at kohlhoff dot com) +// Copyright (c) 2003-2018 Christopher M. Kohlhoff (chris at kohlhoff dot com) // // Distributed under the Boost Software License, Version 1.0. (See accompanying // file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) diff --git a/doc/html/boost_asio/example/cpp03/http/server4/request.hpp b/doc/html/boost_asio/example/cpp03/http/server4/request.hpp index ade91fa965..902212ad56 100644 --- a/doc/html/boost_asio/example/cpp03/http/server4/request.hpp +++ b/doc/html/boost_asio/example/cpp03/http/server4/request.hpp @@ -2,7 +2,7 @@ // request.hpp // ~~~~~~~~~~~ // -// Copyright (c) 2003-2017 Christopher M. Kohlhoff (chris at kohlhoff dot com) +// Copyright (c) 2003-2018 Christopher M. Kohlhoff (chris at kohlhoff dot com) // // Distributed under the Boost Software License, Version 1.0. (See accompanying // file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) diff --git a/doc/html/boost_asio/example/cpp03/http/server4/request_parser.cpp b/doc/html/boost_asio/example/cpp03/http/server4/request_parser.cpp index 1031e7046c..0e1a598379 100644 --- a/doc/html/boost_asio/example/cpp03/http/server4/request_parser.cpp +++ b/doc/html/boost_asio/example/cpp03/http/server4/request_parser.cpp @@ -2,7 +2,7 @@ // request_parser.cpp // ~~~~~~~~~~~~~~~~~~ // -// Copyright (c) 2003-2017 Christopher M. Kohlhoff (chris at kohlhoff dot com) +// Copyright (c) 2003-2018 Christopher M. Kohlhoff (chris at kohlhoff dot com) // // Distributed under the Boost Software License, Version 1.0. (See accompanying // file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) diff --git a/doc/html/boost_asio/example/cpp03/http/server4/request_parser.hpp b/doc/html/boost_asio/example/cpp03/http/server4/request_parser.hpp index 34d4c47f58..42edfd36da 100644 --- a/doc/html/boost_asio/example/cpp03/http/server4/request_parser.hpp +++ b/doc/html/boost_asio/example/cpp03/http/server4/request_parser.hpp @@ -2,7 +2,7 @@ // request_parser.hpp // ~~~~~~~~~~~~~~~~~~ // -// Copyright (c) 2003-2017 Christopher M. Kohlhoff (chris at kohlhoff dot com) +// Copyright (c) 2003-2018 Christopher M. Kohlhoff (chris at kohlhoff dot com) // // Distributed under the Boost Software License, Version 1.0. (See accompanying // file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) diff --git a/doc/html/boost_asio/example/cpp03/http/server4/server.cpp b/doc/html/boost_asio/example/cpp03/http/server4/server.cpp index 080fa345b9..9a8d39e1ea 100644 --- a/doc/html/boost_asio/example/cpp03/http/server4/server.cpp +++ b/doc/html/boost_asio/example/cpp03/http/server4/server.cpp @@ -2,7 +2,7 @@ // server.cpp // ~~~~~~~~~~ // -// Copyright (c) 2003-2017 Christopher M. Kohlhoff (chris at kohlhoff dot com) +// Copyright (c) 2003-2018 Christopher M. Kohlhoff (chris at kohlhoff dot com) // // Distributed under the Boost Software License, Version 1.0. (See accompanying // file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) diff --git a/doc/html/boost_asio/example/cpp03/http/server4/server.hpp b/doc/html/boost_asio/example/cpp03/http/server4/server.hpp index 3ef3b68a9b..ed5a392a00 100644 --- a/doc/html/boost_asio/example/cpp03/http/server4/server.hpp +++ b/doc/html/boost_asio/example/cpp03/http/server4/server.hpp @@ -2,7 +2,7 @@ // server.hpp // ~~~~~~~~~~ // -// Copyright (c) 2003-2017 Christopher M. Kohlhoff (chris at kohlhoff dot com) +// Copyright (c) 2003-2018 Christopher M. Kohlhoff (chris at kohlhoff dot com) // // Distributed under the Boost Software License, Version 1.0. (See accompanying // file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) diff --git a/doc/html/boost_asio/example/cpp03/icmp/icmp_header.hpp b/doc/html/boost_asio/example/cpp03/icmp/icmp_header.hpp index 12272e21a8..2e6f46b019 100644 --- a/doc/html/boost_asio/example/cpp03/icmp/icmp_header.hpp +++ b/doc/html/boost_asio/example/cpp03/icmp/icmp_header.hpp @@ -2,7 +2,7 @@ // icmp_header.hpp // ~~~~~~~~~~~~~~~ // -// Copyright (c) 2003-2017 Christopher M. Kohlhoff (chris at kohlhoff dot com) +// Copyright (c) 2003-2018 Christopher M. Kohlhoff (chris at kohlhoff dot com) // // Distributed under the Boost Software License, Version 1.0. (See accompanying // file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) diff --git a/doc/html/boost_asio/example/cpp03/icmp/ipv4_header.hpp b/doc/html/boost_asio/example/cpp03/icmp/ipv4_header.hpp index b724707d50..1026aa2762 100644 --- a/doc/html/boost_asio/example/cpp03/icmp/ipv4_header.hpp +++ b/doc/html/boost_asio/example/cpp03/icmp/ipv4_header.hpp @@ -2,7 +2,7 @@ // ipv4_header.hpp // ~~~~~~~~~~~~~~~ // -// Copyright (c) 2003-2017 Christopher M. Kohlhoff (chris at kohlhoff dot com) +// Copyright (c) 2003-2018 Christopher M. Kohlhoff (chris at kohlhoff dot com) // // Distributed under the Boost Software License, Version 1.0. (See accompanying // file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) diff --git a/doc/html/boost_asio/example/cpp03/icmp/ping.cpp b/doc/html/boost_asio/example/cpp03/icmp/ping.cpp index 4daf81948b..b4aac7cbf0 100644 --- a/doc/html/boost_asio/example/cpp03/icmp/ping.cpp +++ b/doc/html/boost_asio/example/cpp03/icmp/ping.cpp @@ -2,7 +2,7 @@ // ping.cpp // ~~~~~~~~ // -// Copyright (c) 2003-2017 Christopher M. Kohlhoff (chris at kohlhoff dot com) +// Copyright (c) 2003-2018 Christopher M. Kohlhoff (chris at kohlhoff dot com) // // Distributed under the Boost Software License, Version 1.0. (See accompanying // file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) @@ -18,8 +18,8 @@ #include "ipv4_header.hpp" using boost::asio::ip::icmp; -using boost::asio::deadline_timer; -namespace posix_time = boost::posix_time; +using boost::asio::steady_timer; +namespace chrono = boost::asio::chrono; class pinger { @@ -53,12 +53,12 @@ private: os << echo_request << body; // Send the request. - time_sent_ = posix_time::microsec_clock::universal_time(); + time_sent_ = steady_timer::clock_type::now(); socket_.send_to(request_buffer.data(), destination_); // Wait up to five seconds for a reply. num_replies_ = 0; - timer_.expires_at(time_sent_ + posix_time::seconds(5)); + timer_.expires_at(time_sent_ + chrono::seconds(5)); timer_.async_wait(boost::bind(&pinger::handle_timeout, this)); } @@ -68,7 +68,7 @@ private: std::cout << "Request timed out" << std::endl; // Requests must be sent no less than one second apart. - timer_.expires_at(time_sent_ + posix_time::seconds(1)); + timer_.expires_at(time_sent_ + chrono::seconds(1)); timer_.async_wait(boost::bind(&pinger::start_send, this)); } @@ -106,12 +106,14 @@ private: timer_.cancel(); // Print out some information about the reply packet. - posix_time::ptime now = posix_time::microsec_clock::universal_time(); + chrono::steady_clock::time_point now = chrono::steady_clock::now(); + chrono::steady_clock::duration elapsed = now - time_sent_; std::cout << length - ipv4_hdr.header_length() << " bytes from " << ipv4_hdr.source_address() << ": icmp_seq=" << icmp_hdr.sequence_number() << ", ttl=" << ipv4_hdr.time_to_live() - << ", time=" << (now - time_sent_).total_milliseconds() << " ms" + << ", time=" + << chrono::duration_cast(elapsed).count() << std::endl; } @@ -130,9 +132,9 @@ private: icmp::resolver resolver_; icmp::endpoint destination_; icmp::socket socket_; - deadline_timer timer_; + steady_timer timer_; unsigned short sequence_number_; - posix_time::ptime time_sent_; + chrono::steady_clock::time_point time_sent_; boost::asio::streambuf reply_buffer_; std::size_t num_replies_; }; diff --git a/doc/html/boost_asio/example/cpp03/invocation/prioritised_handlers.cpp b/doc/html/boost_asio/example/cpp03/invocation/prioritised_handlers.cpp index 5e2dcb7997..71940977ba 100644 --- a/doc/html/boost_asio/example/cpp03/invocation/prioritised_handlers.cpp +++ b/doc/html/boost_asio/example/cpp03/invocation/prioritised_handlers.cpp @@ -2,7 +2,7 @@ // prioritised_handlers.cpp // ~~~~~~~~~~~~~~~~~~~~~~~~ // -// Copyright (c) 2003-2017 Christopher M. Kohlhoff (chris at kohlhoff dot com) +// Copyright (c) 2003-2018 Christopher M. Kohlhoff (chris at kohlhoff dot com) // // Distributed under the Boost Software License, Version 1.0. (See accompanying // file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) @@ -153,8 +153,8 @@ int main() client_socket.connect(acceptor.local_endpoint()); // Set a deadline timer to expire immediately. - boost::asio::deadline_timer timer(io_context); - timer.expires_at(boost::posix_time::neg_infin); + boost::asio::steady_timer timer(io_context); + timer.expires_at(boost::asio::steady_timer::time_point::min()); timer.async_wait(pri_queue.wrap(42, middle_priority_handler)); while (io_context.run_one()) diff --git a/doc/html/boost_asio/example/cpp03/iostreams/daytime_client.cpp b/doc/html/boost_asio/example/cpp03/iostreams/daytime_client.cpp index 20ed37211f..c750024ddd 100644 --- a/doc/html/boost_asio/example/cpp03/iostreams/daytime_client.cpp +++ b/doc/html/boost_asio/example/cpp03/iostreams/daytime_client.cpp @@ -2,7 +2,7 @@ // daytime_client.cpp // ~~~~~~~~~~~~~~~~~~ // -// Copyright (c) 2003-2017 Christopher M. Kohlhoff (chris at kohlhoff dot com) +// Copyright (c) 2003-2018 Christopher M. Kohlhoff (chris at kohlhoff dot com) // // Distributed under the Boost Software License, Version 1.0. (See accompanying // file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) diff --git a/doc/html/boost_asio/example/cpp03/iostreams/daytime_server.cpp b/doc/html/boost_asio/example/cpp03/iostreams/daytime_server.cpp index 3e0356c79b..b7aae994c0 100644 --- a/doc/html/boost_asio/example/cpp03/iostreams/daytime_server.cpp +++ b/doc/html/boost_asio/example/cpp03/iostreams/daytime_server.cpp @@ -2,7 +2,7 @@ // daytime_server.cpp // ~~~~~~~~~~~~~~~~~~ // -// Copyright (c) 2003-2017 Christopher M. Kohlhoff (chris at kohlhoff dot com) +// Copyright (c) 2003-2018 Christopher M. Kohlhoff (chris at kohlhoff dot com) // // Distributed under the Boost Software License, Version 1.0. (See accompanying // file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) diff --git a/doc/html/boost_asio/example/cpp03/iostreams/http_client.cpp b/doc/html/boost_asio/example/cpp03/iostreams/http_client.cpp index 52842abfd7..2460123297 100644 --- a/doc/html/boost_asio/example/cpp03/iostreams/http_client.cpp +++ b/doc/html/boost_asio/example/cpp03/iostreams/http_client.cpp @@ -2,7 +2,7 @@ // http_client.cpp // ~~~~~~~~~~~~~~~ // -// Copyright (c) 2003-2017 Christopher M. Kohlhoff (chris at kohlhoff dot com) +// Copyright (c) 2003-2018 Christopher M. Kohlhoff (chris at kohlhoff dot com) // // Distributed under the Boost Software License, Version 1.0. (See accompanying // file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) @@ -33,7 +33,7 @@ int main(int argc, char* argv[]) // The entire sequence of I/O operations must complete within 60 seconds. // If an expiry occurs, the socket is automatically closed and the stream // becomes bad. - s.expires_after(boost::posix_time::seconds(60)); + s.expires_after(boost::asio::chrono::seconds(60)); // Establish a connection to the server. s.connect(argv[1], "http"); diff --git a/doc/html/boost_asio/example/cpp03/local/connect_pair.cpp b/doc/html/boost_asio/example/cpp03/local/connect_pair.cpp index 934731b710..892ec62f06 100644 --- a/doc/html/boost_asio/example/cpp03/local/connect_pair.cpp +++ b/doc/html/boost_asio/example/cpp03/local/connect_pair.cpp @@ -2,7 +2,7 @@ // connect_pair.cpp // ~~~~~~~~~~~~~~~~ // -// Copyright (c) 2003-2017 Christopher M. Kohlhoff (chris at kohlhoff dot com) +// Copyright (c) 2003-2018 Christopher M. Kohlhoff (chris at kohlhoff dot com) // // Distributed under the Boost Software License, Version 1.0. (See accompanying // file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) diff --git a/doc/html/boost_asio/example/cpp03/local/iostream_client.cpp b/doc/html/boost_asio/example/cpp03/local/iostream_client.cpp index d2e0621c82..9ddc80c3c6 100644 --- a/doc/html/boost_asio/example/cpp03/local/iostream_client.cpp +++ b/doc/html/boost_asio/example/cpp03/local/iostream_client.cpp @@ -2,7 +2,7 @@ // stream_client.cpp // ~~~~~~~~~~~~~~~~~ // -// Copyright (c) 2003-2017 Christopher M. Kohlhoff (chris at kohlhoff dot com) +// Copyright (c) 2003-2018 Christopher M. Kohlhoff (chris at kohlhoff dot com) // // Distributed under the Boost Software License, Version 1.0. (See accompanying // file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) diff --git a/doc/html/boost_asio/example/cpp03/local/stream_client.cpp b/doc/html/boost_asio/example/cpp03/local/stream_client.cpp index 915cbe2f3f..a41e937ad8 100644 --- a/doc/html/boost_asio/example/cpp03/local/stream_client.cpp +++ b/doc/html/boost_asio/example/cpp03/local/stream_client.cpp @@ -2,7 +2,7 @@ // stream_client.cpp // ~~~~~~~~~~~~~~~~~ // -// Copyright (c) 2003-2017 Christopher M. Kohlhoff (chris at kohlhoff dot com) +// Copyright (c) 2003-2018 Christopher M. Kohlhoff (chris at kohlhoff dot com) // // Distributed under the Boost Software License, Version 1.0. (See accompanying // file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) diff --git a/doc/html/boost_asio/example/cpp03/local/stream_server.cpp b/doc/html/boost_asio/example/cpp03/local/stream_server.cpp index 05194240c3..8eea66a525 100644 --- a/doc/html/boost_asio/example/cpp03/local/stream_server.cpp +++ b/doc/html/boost_asio/example/cpp03/local/stream_server.cpp @@ -2,7 +2,7 @@ // stream_server.cpp // ~~~~~~~~~~~~~~~~~ // -// Copyright (c) 2003-2017 Christopher M. Kohlhoff (chris at kohlhoff dot com) +// Copyright (c) 2003-2018 Christopher M. Kohlhoff (chris at kohlhoff dot com) // // Distributed under the Boost Software License, Version 1.0. (See accompanying // file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) diff --git a/doc/html/boost_asio/example/cpp03/multicast/receiver.cpp b/doc/html/boost_asio/example/cpp03/multicast/receiver.cpp index ed9d5ccb27..fcea3c9169 100644 --- a/doc/html/boost_asio/example/cpp03/multicast/receiver.cpp +++ b/doc/html/boost_asio/example/cpp03/multicast/receiver.cpp @@ -2,7 +2,7 @@ // receiver.cpp // ~~~~~~~~~~~~ // -// Copyright (c) 2003-2017 Christopher M. Kohlhoff (chris at kohlhoff dot com) +// Copyright (c) 2003-2018 Christopher M. Kohlhoff (chris at kohlhoff dot com) // // Distributed under the Boost Software License, Version 1.0. (See accompanying // file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) diff --git a/doc/html/boost_asio/example/cpp03/multicast/sender.cpp b/doc/html/boost_asio/example/cpp03/multicast/sender.cpp index 15267248b4..aa27dade75 100644 --- a/doc/html/boost_asio/example/cpp03/multicast/sender.cpp +++ b/doc/html/boost_asio/example/cpp03/multicast/sender.cpp @@ -2,7 +2,7 @@ // sender.cpp // ~~~~~~~~~~ // -// Copyright (c) 2003-2017 Christopher M. Kohlhoff (chris at kohlhoff dot com) +// Copyright (c) 2003-2018 Christopher M. Kohlhoff (chris at kohlhoff dot com) // // Distributed under the Boost Software License, Version 1.0. (See accompanying // file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) @@ -13,7 +13,6 @@ #include #include #include "boost/bind.hpp" -#include "boost/date_time/posix_time/posix_time_types.hpp" const short multicast_port = 30001; const int max_message_count = 10; @@ -42,7 +41,7 @@ public: { if (!error && message_count_ < max_message_count) { - timer_.expires_from_now(boost::posix_time::seconds(1)); + timer_.expires_after(boost::asio::chrono::seconds(1)); timer_.async_wait( boost::bind(&sender::handle_timeout, this, boost::asio::placeholders::error)); @@ -67,7 +66,7 @@ public: private: boost::asio::ip::udp::endpoint endpoint_; boost::asio::ip::udp::socket socket_; - boost::asio::deadline_timer timer_; + boost::asio::steady_timer timer_; int message_count_; std::string message_; }; diff --git a/doc/html/boost_asio/example/cpp03/nonblocking/third_party_lib.cpp b/doc/html/boost_asio/example/cpp03/nonblocking/third_party_lib.cpp index 6ace6d8c63..1148947615 100644 --- a/doc/html/boost_asio/example/cpp03/nonblocking/third_party_lib.cpp +++ b/doc/html/boost_asio/example/cpp03/nonblocking/third_party_lib.cpp @@ -2,7 +2,7 @@ // third_party_lib.cpp // ~~~~~~~~~~~~~~~~~~~ // -// Copyright (c) 2003-2017 Christopher M. Kohlhoff (chris at kohlhoff dot com) +// Copyright (c) 2003-2018 Christopher M. Kohlhoff (chris at kohlhoff dot com) // // Distributed under the Boost Software License, Version 1.0. (See accompanying // file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) diff --git a/doc/html/boost_asio/example/cpp03/porthopper/client.cpp b/doc/html/boost_asio/example/cpp03/porthopper/client.cpp index 05c020cd75..dc02322ebf 100644 --- a/doc/html/boost_asio/example/cpp03/porthopper/client.cpp +++ b/doc/html/boost_asio/example/cpp03/porthopper/client.cpp @@ -2,7 +2,7 @@ // client.cpp // ~~~~~~~~~~ // -// Copyright (c) 2003-2017 Christopher M. Kohlhoff (chris at kohlhoff dot com) +// Copyright (c) 2003-2018 Christopher M. Kohlhoff (chris at kohlhoff dot com) // // Distributed under the Boost Software License, Version 1.0. (See accompanying // file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) diff --git a/doc/html/boost_asio/example/cpp03/porthopper/protocol.hpp b/doc/html/boost_asio/example/cpp03/porthopper/protocol.hpp index 272aa876eb..f67de4f748 100644 --- a/doc/html/boost_asio/example/cpp03/porthopper/protocol.hpp +++ b/doc/html/boost_asio/example/cpp03/porthopper/protocol.hpp @@ -2,7 +2,7 @@ // protocol.hpp // ~~~~~~~~~~~~ // -// Copyright (c) 2003-2017 Christopher M. Kohlhoff (chris at kohlhoff dot com) +// Copyright (c) 2003-2018 Christopher M. Kohlhoff (chris at kohlhoff dot com) // // Distributed under the Boost Software License, Version 1.0. (See accompanying // file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) diff --git a/doc/html/boost_asio/example/cpp03/porthopper/server.cpp b/doc/html/boost_asio/example/cpp03/porthopper/server.cpp index 0426c365be..e8c9f8af67 100644 --- a/doc/html/boost_asio/example/cpp03/porthopper/server.cpp +++ b/doc/html/boost_asio/example/cpp03/porthopper/server.cpp @@ -2,7 +2,7 @@ // server.cpp // ~~~~~~~~~~ // -// Copyright (c) 2003-2017 Christopher M. Kohlhoff (chris at kohlhoff dot com) +// Copyright (c) 2003-2018 Christopher M. Kohlhoff (chris at kohlhoff dot com) // // Distributed under the Boost Software License, Version 1.0. (See accompanying // file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) @@ -22,7 +22,7 @@ using boost::asio::ip::tcp; using boost::asio::ip::udp; typedef boost::shared_ptr tcp_socket_ptr; -typedef boost::shared_ptr timer_ptr; +typedef boost::shared_ptr timer_ptr; typedef boost::shared_ptr control_request_ptr; class server @@ -43,7 +43,7 @@ public: boost::asio::placeholders::error, new_socket)); // Start the timer used to generate outgoing frames. - timer_.expires_from_now(boost::posix_time::milliseconds(100)); + timer_.expires_after(boost::asio::chrono::milliseconds(100)); timer_.async_wait(boost::bind(&server::handle_timer, this)); } @@ -75,8 +75,8 @@ public: { // Delay handling of the control request to simulate network latency. timer_ptr delay_timer( - new boost::asio::deadline_timer(acceptor_.get_executor().context())); - delay_timer->expires_from_now(boost::posix_time::seconds(2)); + new boost::asio::steady_timer(acceptor_.get_executor().context())); + delay_timer->expires_after(boost::asio::chrono::seconds(2)); delay_timer->async_wait( boost::bind(&server::handle_control_request_timer, this, socket, request, delay_timer)); @@ -142,7 +142,7 @@ public: } // Wait for next timeout. - timer_.expires_from_now(boost::posix_time::milliseconds(100)); + timer_.expires_after(boost::asio::chrono::milliseconds(100)); timer_.async_wait(boost::bind(&server::handle_timer, this)); } @@ -151,7 +151,7 @@ private: tcp::acceptor acceptor_; // The timer used for generating data. - boost::asio::deadline_timer timer_; + boost::asio::steady_timer timer_; // The socket used to send data to subscribers. udp::socket udp_socket_; diff --git a/doc/html/boost_asio/example/cpp03/serialization/client.cpp b/doc/html/boost_asio/example/cpp03/serialization/client.cpp index 06f3e4c09e..f11e55f44e 100644 --- a/doc/html/boost_asio/example/cpp03/serialization/client.cpp +++ b/doc/html/boost_asio/example/cpp03/serialization/client.cpp @@ -2,7 +2,7 @@ // client.cpp // ~~~~~~~~~~ // -// Copyright (c) 2003-2017 Christopher M. Kohlhoff (chris at kohlhoff dot com) +// Copyright (c) 2003-2018 Christopher M. Kohlhoff (chris at kohlhoff dot com) // // Distributed under the Boost Software License, Version 1.0. (See accompanying // file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) diff --git a/doc/html/boost_asio/example/cpp03/serialization/connection.hpp b/doc/html/boost_asio/example/cpp03/serialization/connection.hpp index 88b0a71508..4eb662db90 100644 --- a/doc/html/boost_asio/example/cpp03/serialization/connection.hpp +++ b/doc/html/boost_asio/example/cpp03/serialization/connection.hpp @@ -2,7 +2,7 @@ // connection.hpp // ~~~~~~~~~~~~~~ // -// Copyright (c) 2003-2017 Christopher M. Kohlhoff (chris at kohlhoff dot com) +// Copyright (c) 2003-2018 Christopher M. Kohlhoff (chris at kohlhoff dot com) // // Distributed under the Boost Software License, Version 1.0. (See accompanying // file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) diff --git a/doc/html/boost_asio/example/cpp03/serialization/server.cpp b/doc/html/boost_asio/example/cpp03/serialization/server.cpp index 6fb4881d94..df99e371ec 100644 --- a/doc/html/boost_asio/example/cpp03/serialization/server.cpp +++ b/doc/html/boost_asio/example/cpp03/serialization/server.cpp @@ -2,7 +2,7 @@ // server.cpp // ~~~~~~~~~~ // -// Copyright (c) 2003-2017 Christopher M. Kohlhoff (chris at kohlhoff dot com) +// Copyright (c) 2003-2018 Christopher M. Kohlhoff (chris at kohlhoff dot com) // // Distributed under the Boost Software License, Version 1.0. (See accompanying // file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) diff --git a/doc/html/boost_asio/example/cpp03/serialization/stock.hpp b/doc/html/boost_asio/example/cpp03/serialization/stock.hpp index 67a5d3f49b..b1d1c60c62 100644 --- a/doc/html/boost_asio/example/cpp03/serialization/stock.hpp +++ b/doc/html/boost_asio/example/cpp03/serialization/stock.hpp @@ -2,7 +2,7 @@ // stock.hpp // ~~~~~~~~~ // -// Copyright (c) 2003-2017 Christopher M. Kohlhoff (chris at kohlhoff dot com) +// Copyright (c) 2003-2018 Christopher M. Kohlhoff (chris at kohlhoff dot com) // // Distributed under the Boost Software License, Version 1.0. (See accompanying // file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) diff --git a/doc/html/boost_asio/example/cpp03/services/basic_logger.hpp b/doc/html/boost_asio/example/cpp03/services/basic_logger.hpp index 0f56c2fef8..6f0aeb426f 100644 --- a/doc/html/boost_asio/example/cpp03/services/basic_logger.hpp +++ b/doc/html/boost_asio/example/cpp03/services/basic_logger.hpp @@ -2,7 +2,7 @@ // basic_logger.hpp // ~~~~~~~~~~~~~~~~ // -// Copyright (c) 2003-2017 Christopher M. Kohlhoff (chris at kohlhoff dot com) +// Copyright (c) 2003-2018 Christopher M. Kohlhoff (chris at kohlhoff dot com) // // Distributed under the Boost Software License, Version 1.0. (See accompanying // file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) diff --git a/doc/html/boost_asio/example/cpp03/services/daytime_client.cpp b/doc/html/boost_asio/example/cpp03/services/daytime_client.cpp index 204382a989..109e061699 100644 --- a/doc/html/boost_asio/example/cpp03/services/daytime_client.cpp +++ b/doc/html/boost_asio/example/cpp03/services/daytime_client.cpp @@ -2,7 +2,7 @@ // daytime_client.cpp // ~~~~~~~~~~~~~~~~~~ // -// Copyright (c) 2003-2017 Christopher M. Kohlhoff (chris at kohlhoff dot com) +// Copyright (c) 2003-2018 Christopher M. Kohlhoff (chris at kohlhoff dot com) // // Distributed under the Boost Software License, Version 1.0. (See accompanying // file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) diff --git a/doc/html/boost_asio/example/cpp03/services/logger.hpp b/doc/html/boost_asio/example/cpp03/services/logger.hpp index 749620d1ab..71ec68d0b8 100644 --- a/doc/html/boost_asio/example/cpp03/services/logger.hpp +++ b/doc/html/boost_asio/example/cpp03/services/logger.hpp @@ -2,7 +2,7 @@ // logger.hpp // ~~~~~~~~~~ // -// Copyright (c) 2003-2017 Christopher M. Kohlhoff (chris at kohlhoff dot com) +// Copyright (c) 2003-2018 Christopher M. Kohlhoff (chris at kohlhoff dot com) // // Distributed under the Boost Software License, Version 1.0. (See accompanying // file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) diff --git a/doc/html/boost_asio/example/cpp03/services/logger_service.cpp b/doc/html/boost_asio/example/cpp03/services/logger_service.cpp index 1324d30745..82fcb223c5 100644 --- a/doc/html/boost_asio/example/cpp03/services/logger_service.cpp +++ b/doc/html/boost_asio/example/cpp03/services/logger_service.cpp @@ -2,7 +2,7 @@ // logger_service.cpp // ~~~~~~~~~~~~~~~~~~ // -// Copyright (c) 2003-2017 Christopher M. Kohlhoff (chris at kohlhoff dot com) +// Copyright (c) 2003-2018 Christopher M. Kohlhoff (chris at kohlhoff dot com) // // Distributed under the Boost Software License, Version 1.0. (See accompanying // file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) diff --git a/doc/html/boost_asio/example/cpp03/services/logger_service.hpp b/doc/html/boost_asio/example/cpp03/services/logger_service.hpp index 071d6bfc5e..84ac5a195c 100644 --- a/doc/html/boost_asio/example/cpp03/services/logger_service.hpp +++ b/doc/html/boost_asio/example/cpp03/services/logger_service.hpp @@ -2,7 +2,7 @@ // logger_service.hpp // ~~~~~~~~~~~~~~~~~~ // -// Copyright (c) 2003-2017 Christopher M. Kohlhoff (chris at kohlhoff dot com) +// Copyright (c) 2003-2018 Christopher M. Kohlhoff (chris at kohlhoff dot com) // // Distributed under the Boost Software License, Version 1.0. (See accompanying // file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) diff --git a/doc/html/boost_asio/example/cpp03/socks4/socks4.hpp b/doc/html/boost_asio/example/cpp03/socks4/socks4.hpp index 07dc1a1ce2..e954d7a88a 100644 --- a/doc/html/boost_asio/example/cpp03/socks4/socks4.hpp +++ b/doc/html/boost_asio/example/cpp03/socks4/socks4.hpp @@ -2,7 +2,7 @@ // socks4.hpp // ~~~~~~~~~~ // -// Copyright (c) 2003-2017 Christopher M. Kohlhoff (chris at kohlhoff dot com) +// Copyright (c) 2003-2018 Christopher M. Kohlhoff (chris at kohlhoff dot com) // // Distributed under the Boost Software License, Version 1.0. (See accompanying // file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) diff --git a/doc/html/boost_asio/example/cpp03/socks4/sync_client.cpp b/doc/html/boost_asio/example/cpp03/socks4/sync_client.cpp index e9106a059c..5650248603 100644 --- a/doc/html/boost_asio/example/cpp03/socks4/sync_client.cpp +++ b/doc/html/boost_asio/example/cpp03/socks4/sync_client.cpp @@ -2,7 +2,7 @@ // sync_client.cpp // ~~~~~~~~~~~~~~~ // -// Copyright (c) 2003-2017 Christopher M. Kohlhoff (chris at kohlhoff dot com) +// Copyright (c) 2003-2018 Christopher M. Kohlhoff (chris at kohlhoff dot com) // // Distributed under the Boost Software License, Version 1.0. (See accompanying // file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) diff --git a/doc/html/boost_asio/example/cpp03/spawn/echo_server.cpp b/doc/html/boost_asio/example/cpp03/spawn/echo_server.cpp index db6a1679f5..6b60b46f4a 100644 --- a/doc/html/boost_asio/example/cpp03/spawn/echo_server.cpp +++ b/doc/html/boost_asio/example/cpp03/spawn/echo_server.cpp @@ -2,16 +2,16 @@ // echo_server.cpp // ~~~~~~~~~~~~~~~ // -// Copyright (c) 2003-2017 Christopher M. Kohlhoff (chris at kohlhoff dot com) +// Copyright (c) 2003-2018 Christopher M. Kohlhoff (chris at kohlhoff dot com) // // Distributed under the Boost Software License, Version 1.0. (See accompanying // file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) // -#include #include #include #include +#include #include #include #include @@ -53,7 +53,7 @@ private: char data[128]; for (;;) { - timer_.expires_from_now(boost::posix_time::seconds(10)); + timer_.expires_after(boost::asio::chrono::seconds(10)); std::size_t n = socket_.async_read_some(boost::asio::buffer(data), yield); boost::asio::async_write(socket_, boost::asio::buffer(data, n), yield); } @@ -71,14 +71,14 @@ private: { boost::system::error_code ignored_ec; timer_.async_wait(yield[ignored_ec]); - if (timer_.expires_from_now() <= boost::posix_time::seconds(0)) + if (timer_.expiry() <= boost::asio::steady_timer::clock_type::now()) socket_.close(); } } boost::asio::io_context::strand strand_; tcp::socket socket_; - boost::asio::deadline_timer timer_; + boost::asio::steady_timer timer_; }; void do_accept(boost::asio::io_context& io_context, diff --git a/doc/html/boost_asio/example/cpp03/spawn/parallel_grep.cpp b/doc/html/boost_asio/example/cpp03/spawn/parallel_grep.cpp index 63aa2fc447..5de86204b5 100644 --- a/doc/html/boost_asio/example/cpp03/spawn/parallel_grep.cpp +++ b/doc/html/boost_asio/example/cpp03/spawn/parallel_grep.cpp @@ -2,7 +2,7 @@ // parallel_grep.cpp // ~~~~~~~~~~~~~~~~~ // -// Copyright (c) 2003-2017 Christopher M. Kohlhoff (chris at kohlhoff dot com) +// Copyright (c) 2003-2018 Christopher M. Kohlhoff (chris at kohlhoff dot com) // // Distributed under the Boost Software License, Version 1.0. (See accompanying // file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) diff --git a/doc/html/boost_asio/example/cpp03/ssl/client.cpp b/doc/html/boost_asio/example/cpp03/ssl/client.cpp index 7239496add..6064ca4959 100644 --- a/doc/html/boost_asio/example/cpp03/ssl/client.cpp +++ b/doc/html/boost_asio/example/cpp03/ssl/client.cpp @@ -2,7 +2,7 @@ // client.cpp // ~~~~~~~~~~ // -// Copyright (c) 2003-2017 Christopher M. Kohlhoff (chris at kohlhoff dot com) +// Copyright (c) 2003-2018 Christopher M. Kohlhoff (chris at kohlhoff dot com) // // Distributed under the Boost Software License, Version 1.0. (See accompanying // file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) diff --git a/doc/html/boost_asio/example/cpp03/ssl/server.cpp b/doc/html/boost_asio/example/cpp03/ssl/server.cpp index 604189034e..0848b0a096 100644 --- a/doc/html/boost_asio/example/cpp03/ssl/server.cpp +++ b/doc/html/boost_asio/example/cpp03/ssl/server.cpp @@ -2,7 +2,7 @@ // server.cpp // ~~~~~~~~~~ // -// Copyright (c) 2003-2017 Christopher M. Kohlhoff (chris at kohlhoff dot com) +// Copyright (c) 2003-2018 Christopher M. Kohlhoff (chris at kohlhoff dot com) // // Distributed under the Boost Software License, Version 1.0. (See accompanying // file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) diff --git a/doc/html/boost_asio/example/cpp03/timeouts/async_tcp_client.cpp b/doc/html/boost_asio/example/cpp03/timeouts/async_tcp_client.cpp index 2134e6395d..f295ed5fb2 100644 --- a/doc/html/boost_asio/example/cpp03/timeouts/async_tcp_client.cpp +++ b/doc/html/boost_asio/example/cpp03/timeouts/async_tcp_client.cpp @@ -2,22 +2,23 @@ // async_tcp_client.cpp // ~~~~~~~~~~~~~~~~~~~~ // -// Copyright (c) 2003-2017 Christopher M. Kohlhoff (chris at kohlhoff dot com) +// Copyright (c) 2003-2018 Christopher M. Kohlhoff (chris at kohlhoff dot com) // // Distributed under the Boost Software License, Version 1.0. (See accompanying // file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) // -#include +#include #include #include #include -#include +#include #include #include #include +#include -using boost::asio::deadline_timer; +using boost::asio::steady_timer; using boost::asio::ip::tcp; // @@ -78,7 +79,7 @@ using boost::asio::ip::tcp; // // The heartbeat actor sends a heartbeat (a message that consists of a single // newline character) every 10 seconds. In this example, no deadline is applied -// message sending. +// to message sending. // class client { @@ -125,7 +126,7 @@ private: std::cout << "Trying " << endpoint_iter->endpoint() << "...\n"; // Set a deadline for the connect operation. - deadline_.expires_from_now(boost::posix_time::seconds(60)); + deadline_.expires_after(boost::asio::chrono::seconds(60)); // Start the asynchronous connect operation. socket_.async_connect(endpoint_iter->endpoint(), @@ -185,14 +186,15 @@ private: void start_read() { // Set a deadline for the read operation. - deadline_.expires_from_now(boost::posix_time::seconds(30)); + deadline_.expires_after(boost::asio::chrono::seconds(30)); // Start an asynchronous operation to read a newline-delimited message. - boost::asio::async_read_until(socket_, input_buffer_, '\n', - boost::bind(&client::handle_read, this, _1)); + boost::asio::async_read_until(socket_, + boost::asio::dynamic_buffer(input_buffer_), '\n', + boost::bind(&client::handle_read, this, _1, _2)); } - void handle_read(const boost::system::error_code& ec) + void handle_read(const boost::system::error_code& ec, std::size_t n) { if (stopped_) return; @@ -200,9 +202,8 @@ private: if (!ec) { // Extract the newline-delimited message from the buffer. - std::string line; - std::istream is(&input_buffer_); - std::getline(is, line); + std::string line(input_buffer_.substr(0, n - 1)); + input_buffer_.erase(0, n); // Empty messages are heartbeats and so ignored. if (!line.empty()) @@ -238,7 +239,7 @@ private: if (!ec) { // Wait 10 seconds before sending the next heartbeat. - heartbeat_timer_.expires_from_now(boost::posix_time::seconds(10)); + heartbeat_timer_.expires_after(boost::asio::chrono::seconds(10)); heartbeat_timer_.async_wait(boost::bind(&client::start_write, this)); } else @@ -257,15 +258,16 @@ private: // Check whether the deadline has passed. We compare the deadline against // the current time since a new asynchronous operation may have moved the // deadline before this actor had a chance to run. - if (deadline_.expires_at() <= deadline_timer::traits_type::now()) + if (deadline_.expiry() <= steady_timer::clock_type::now()) { // The deadline has passed. The socket is closed so that any outstanding // asynchronous operations are cancelled. socket_.close(); - // There is no longer an active deadline. The expiry is set to positive - // infinity so that the actor takes no action until a new deadline is set. - deadline_.expires_at(boost::posix_time::pos_infin); + // There is no longer an active deadline. The expiry is set to the + // maximum time point so that the actor takes no action until a new + // deadline is set. + deadline_.expires_at(steady_timer::time_point::max()); } // Put the actor back to sleep. @@ -276,9 +278,9 @@ private: bool stopped_; tcp::resolver::results_type endpoints_; tcp::socket socket_; - boost::asio::streambuf input_buffer_; - deadline_timer deadline_; - deadline_timer heartbeat_timer_; + std::string input_buffer_; + steady_timer deadline_; + steady_timer heartbeat_timer_; }; int main(int argc, char* argv[]) diff --git a/doc/html/boost_asio/example/cpp03/timeouts/blocking_tcp_client.cpp b/doc/html/boost_asio/example/cpp03/timeouts/blocking_tcp_client.cpp index 67224cfd0f..2392882c87 100644 --- a/doc/html/boost_asio/example/cpp03/timeouts/blocking_tcp_client.cpp +++ b/doc/html/boost_asio/example/cpp03/timeouts/blocking_tcp_client.cpp @@ -2,18 +2,17 @@ // blocking_tcp_client.cpp // ~~~~~~~~~~~~~~~~~~~~~~~ // -// Copyright (c) 2003-2017 Christopher M. Kohlhoff (chris at kohlhoff dot com) +// Copyright (c) 2003-2018 Christopher M. Kohlhoff (chris at kohlhoff dot com) // // Distributed under the Boost Software License, Version 1.0. (See accompanying // file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) // +#include #include -#include #include #include #include -#include #include #include #include @@ -22,178 +21,127 @@ #include #include -using boost::asio::deadline_timer; using boost::asio::ip::tcp; using boost::lambda::bind; using boost::lambda::var; using boost::lambda::_1; +using boost::lambda::_2; //---------------------------------------------------------------------- // -// This class manages socket timeouts by applying the concept of a deadline. -// Each asynchronous operation is given a deadline by which it must complete. -// Deadlines are enforced by an "actor" that persists for the lifetime of the -// client object: -// -// +----------------+ -// | | -// | check_deadline |<---+ -// | | | -// +----------------+ | async_wait() -// | | -// +---------+ -// -// If the actor determines that the deadline has expired, the socket is closed -// and any outstanding operations are consequently cancelled. The socket -// operations themselves use boost::lambda function objects as completion -// handlers. For a given socket operation, the client object runs the -// io_context to block thread execution until the actor completes. +// This class manages socket timeouts by running the io_context using the timed +// io_context::run_for() member function. Each asynchronous operation is given +// a timeout within which it must complete. The socket operations themselves +// use boost::lambda function objects as completion handlers. For a given +// socket operation, the client object runs the io_context to block thread +// execution until the operation completes or the timeout is reached. If the +// io_context::run_for() function times out, the socket is closed and the +// outstanding asynchronous operation is cancelled. // class client { public: client() - : socket_(io_context_), - deadline_(io_context_) + : socket_(io_context_) { - // No deadline is required until the first socket operation is started. We - // set the deadline to positive infinity so that the actor takes no action - // until a specific deadline is set. - deadline_.expires_at(boost::posix_time::pos_infin); - - // Start the persistent actor that checks for deadline expiry. - check_deadline(); } void connect(const std::string& host, const std::string& service, - boost::posix_time::time_duration timeout) + boost::asio::chrono::steady_clock::duration timeout) { // Resolve the host name and service to a list of endpoints. tcp::resolver::results_type endpoints = tcp::resolver(io_context_).resolve(host, service); - // Set a deadline for the asynchronous operation. As a host name may - // resolve to multiple endpoints, this function uses the composed operation - // async_connect. The deadline applies to the entire operation, rather than - // individual connection attempts. - deadline_.expires_from_now(timeout); - - // Set up the variable that receives the result of the asynchronous - // operation. The error code is set to would_block to signal that the - // operation is incomplete. Asio guarantees that its asynchronous - // operations will never fail with would_block, so any other value in - // ec indicates completion. - boost::system::error_code ec = boost::asio::error::would_block; - // Start the asynchronous operation itself. The boost::lambda function // object is used as a callback and will update the ec variable when the // operation completes. The blocking_udp_client.cpp example shows how you // can use boost::bind rather than boost::lambda. + boost::system::error_code ec; boost::asio::async_connect(socket_, endpoints, var(ec) = _1); - // Block until the asynchronous operation has completed. - do io_context_.run_one(); while (ec == boost::asio::error::would_block); - - // Determine whether a connection was successfully established. The - // deadline actor may have had a chance to run and close our socket, even - // though the connect operation notionally succeeded. Therefore we must - // check whether the socket is still open before deciding if we succeeded - // or failed. - if (ec || !socket_.is_open()) - throw boost::system::system_error( - ec ? ec : boost::asio::error::operation_aborted); + // Run the operation until it completes, or until the timeout. + run(timeout); + + // Determine whether a connection was successfully established. + if (ec) + throw boost::system::system_error(ec); } - std::string read_line(boost::posix_time::time_duration timeout) + std::string read_line(boost::asio::chrono::steady_clock::duration timeout) { - // Set a deadline for the asynchronous operation. Since this function uses - // a composed operation (async_read_until), the deadline applies to the - // entire operation, rather than individual reads from the socket. - deadline_.expires_from_now(timeout); - - // Set up the variable that receives the result of the asynchronous - // operation. The error code is set to would_block to signal that the - // operation is incomplete. Asio guarantees that its asynchronous - // operations will never fail with would_block, so any other value in - // ec indicates completion. - boost::system::error_code ec = boost::asio::error::would_block; - - // Start the asynchronous operation itself. The boost::lambda function - // object is used as a callback and will update the ec variable when the - // operation completes. The blocking_udp_client.cpp example shows how you - // can use boost::bind rather than boost::lambda. - boost::asio::async_read_until(socket_, input_buffer_, '\n', var(ec) = _1); - - // Block until the asynchronous operation has completed. - do io_context_.run_one(); while (ec == boost::asio::error::would_block); - + // Start the asynchronous operation. The boost::lambda function object is + // used as a callback and will update the ec variable when the operation + // completes. The blocking_udp_client.cpp example shows how you can use + // boost::bind rather than boost::lambda. + boost::system::error_code ec; + std::size_t n = 0; + boost::asio::async_read_until(socket_, + boost::asio::dynamic_buffer(input_buffer_), + '\n', (var(ec) = _1, var(n) = _2)); + + // Run the operation until it completes, or until the timeout. + run(timeout); + + // Determine whether the read completed successfully. if (ec) throw boost::system::system_error(ec); - std::string line; - std::istream is(&input_buffer_); - std::getline(is, line); + std::string line(input_buffer_.substr(0, n - 1)); + input_buffer_.erase(0, n); return line; } void write_line(const std::string& line, - boost::posix_time::time_duration timeout) + boost::asio::chrono::steady_clock::duration timeout) { std::string data = line + "\n"; - // Set a deadline for the asynchronous operation. Since this function uses - // a composed operation (async_write), the deadline applies to the entire - // operation, rather than individual writes to the socket. - deadline_.expires_from_now(timeout); - - // Set up the variable that receives the result of the asynchronous - // operation. The error code is set to would_block to signal that the - // operation is incomplete. Asio guarantees that its asynchronous - // operations will never fail with would_block, so any other value in - // ec indicates completion. - boost::system::error_code ec = boost::asio::error::would_block; - - // Start the asynchronous operation itself. The boost::lambda function - // object is used as a callback and will update the ec variable when the - // operation completes. The blocking_udp_client.cpp example shows how you - // can use boost::bind rather than boost::lambda. + // Start the asynchronous operation. The boost::lambda function object is + // used as a callback and will update the ec variable when the operation + // completes. The blocking_udp_client.cpp example shows how you can use + // boost::bind rather than boost::lambda. + boost::system::error_code ec; boost::asio::async_write(socket_, boost::asio::buffer(data), var(ec) = _1); - // Block until the asynchronous operation has completed. - do io_context_.run_one(); while (ec == boost::asio::error::would_block); + // Run the operation until it completes, or until the timeout. + run(timeout); + // Determine whether the read completed successfully. if (ec) throw boost::system::system_error(ec); } private: - void check_deadline() + void run(boost::asio::chrono::steady_clock::duration timeout) { - // Check whether the deadline has passed. We compare the deadline against - // the current time since a new asynchronous operation may have moved the - // deadline before this actor had a chance to run. - if (deadline_.expires_at() <= deadline_timer::traits_type::now()) + // Restart the io_context, as it may have been left in the "stopped" state + // by a previous operation. + io_context_.restart(); + + // Block until the asynchronous operation has completed, or timed out. If + // the pending asynchronous operation is a composed operation, the deadline + // applies to the entire operation, rather than individual operations on + // the socket. + io_context_.run_for(timeout); + + // If the asynchronous operation completed successfully then the io_context + // would have been stopped due to running out of work. If it was not + // stopped, then the io_context::run_for call must have timed out. + if (!io_context_.stopped()) { - // The deadline has passed. The socket is closed so that any outstanding - // asynchronous operations are cancelled. This allows the blocked - // connect(), read_line() or write_line() functions to return. - boost::system::error_code ignored_ec; - socket_.close(ignored_ec); - - // There is no longer an active deadline. The expiry is set to positive - // infinity so that the actor takes no action until a new deadline is set. - deadline_.expires_at(boost::posix_time::pos_infin); - } + // Close the socket to cancel the outstanding asynchronous operation. + socket_.close(); - // Put the actor back to sleep. - deadline_.async_wait(bind(&client::check_deadline, this)); + // Run the io_context again until the operation completes. + io_context_.run(); + } } boost::asio::io_context io_context_; tcp::socket socket_; - deadline_timer deadline_; - boost::asio::streambuf input_buffer_; + std::string input_buffer_; }; //---------------------------------------------------------------------- @@ -204,32 +152,34 @@ int main(int argc, char* argv[]) { if (argc != 4) { - std::cerr << "Usage: blocking_tcp \n"; + std::cerr << "Usage: blocking_tcp_client \n"; return 1; } client c; - c.connect(argv[1], argv[2], boost::posix_time::seconds(10)); + c.connect(argv[1], argv[2], boost::asio::chrono::seconds(10)); - boost::posix_time::ptime time_sent = - boost::posix_time::microsec_clock::universal_time(); + boost::asio::chrono::steady_clock::time_point time_sent = + boost::asio::chrono::steady_clock::now(); - c.write_line(argv[3], boost::posix_time::seconds(10)); + c.write_line(argv[3], boost::asio::chrono::seconds(10)); for (;;) { - std::string line = c.read_line(boost::posix_time::seconds(10)); + std::string line = c.read_line(boost::asio::chrono::seconds(10)); // Keep going until we get back the line that was sent. if (line == argv[3]) break; } - boost::posix_time::ptime time_received = - boost::posix_time::microsec_clock::universal_time(); + boost::asio::chrono::steady_clock::time_point time_received = + boost::asio::chrono::steady_clock::now(); std::cout << "Round trip time: "; - std::cout << (time_received - time_sent).total_microseconds(); + std::cout << boost::asio::chrono::duration_cast< + boost::asio::chrono::microseconds>( + time_received - time_sent).count(); std::cout << " microseconds\n"; } catch (std::exception& e) diff --git a/doc/html/boost_asio/example/cpp03/timeouts/blocking_token_tcp_client.cpp b/doc/html/boost_asio/example/cpp03/timeouts/blocking_token_tcp_client.cpp new file mode 100644 index 0000000000..0903d87864 --- /dev/null +++ b/doc/html/boost_asio/example/cpp03/timeouts/blocking_token_tcp_client.cpp @@ -0,0 +1,198 @@ +// +// blocking_token_tcp_client.cpp +// ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ +// +// Copyright (c) 2003-2018 Christopher M. Kohlhoff (chris at kohlhoff dot com) +// +// Distributed under the Boost Software License, Version 1.0. (See accompanying +// file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +// + +#include +#include +#include +#include +#include +#include +#include +#include +#include +#include +#include + +using boost::asio::ip::tcp; + +//---------------------------------------------------------------------- + +// A custom completion token that makes asynchronous operations behave as +// though they are blocking calls with a timeout. +struct close_after +{ + close_after(boost::asio::chrono::steady_clock::duration t, tcp::socket& s) + : timeout_(t), socket_(s) + { + } + + // The maximum time to wait for an asynchronous operation to complete. + boost::asio::chrono::steady_clock::duration timeout_; + + // The socket to be closed if the operation does not complete in time. + tcp::socket& socket_; +}; + +namespace boost { +namespace asio { + +// The async_result template is specialised to allow the close_after token to +// be used with asynchronous operations that have a completion signature of +// void(error_code, T). Generalising this for all completion signature forms is +// left as an exercise for the reader. +template +class async_result +{ +public: + // An asynchronous operation's initiating function automatically creates an + // completion_handler_type object from the token. This function object is + // then called on completion of the asynchronous operation. + class completion_handler_type + { + public: + completion_handler_type(const close_after& token) + : token_(token) + { + } + + void operator()(boost::system::error_code ec, T t) + { + *ec_ = ec; + *t_ = t; + } + + private: + friend class async_result; + close_after token_; + boost::system::error_code* ec_; + T* t_; + }; + + // The async_result constructor associates the completion handler object with + // the result of the initiating function. + explicit async_result(completion_handler_type& h) + : timeout_(h.token_.timeout_), + socket_(h.token_.socket_) + { + h.ec_ = &ec_; + h.t_ = &t_; + } + + // The return_type typedef determines the result type of the asynchronous + // operation's initiating function. + typedef T return_type; + + // The get() function is used to obtain the result of the asynchronous + // operation's initiating function. For the close_after completion token, we + // use this function to run the io_context until the operation is complete. + return_type get() + { + boost::asio::io_context& io_context = socket_.get_executor().context(); + + // Restart the io_context, as it may have been left in the "stopped" state + // by a previous operation. + io_context.restart(); + + // Block until the asynchronous operation has completed, or timed out. If + // the pending asynchronous operation is a composed operation, the deadline + // applies to the entire operation, rather than individual operations on + // the socket. + io_context.run_for(timeout_); + + // If the asynchronous operation completed successfully then the io_context + // would have been stopped due to running out of work. If it was not + // stopped, then the io_context::run_for call must have timed out and the + // operation is still incomplete. + if (!io_context.stopped()) + { + // Close the socket to cancel the outstanding asynchronous operation. + socket_.close(); + + // Run the io_context again until the operation completes. + io_context.run(); + } + + // If the operation failed, throw an exception. Otherwise return the result. + return ec_ ? throw boost::system::system_error(ec_) : t_; + } + +private: + boost::asio::chrono::steady_clock::duration timeout_; + tcp::socket& socket_; + boost::system::error_code ec_; + T t_; +}; + +} // namespace asio +} // namespace boost + +//---------------------------------------------------------------------- + +int main(int argc, char* argv[]) +{ + try + { + if (argc != 4) + { + std::cerr << "Usage: blocking_tcp_client \n"; + return 1; + } + + boost::asio::io_context io_context; + + // Resolve the host name and service to a list of endpoints. + tcp::resolver::results_type endpoints = + tcp::resolver(io_context).resolve(argv[1], argv[2]); + + tcp::socket socket(io_context); + + // Run an asynchronous connect operation with a timeout. + boost::asio::async_connect(socket, endpoints, + close_after(boost::asio::chrono::seconds(10), socket)); + + boost::asio::chrono::steady_clock::time_point time_sent = + boost::asio::chrono::steady_clock::now(); + + // Run an asynchronous write operation with a timeout. + std::string msg = argv[3] + std::string("\n"); + boost::asio::async_write(socket, boost::asio::buffer(msg), + close_after(boost::asio::chrono::seconds(10), socket)); + + for (std::string input_buffer;;) + { + // Run an asynchronous read operation with a timeout. + std::size_t n = boost::asio::async_read_until(socket, + boost::asio::dynamic_buffer(input_buffer), '\n', + close_after(boost::asio::chrono::seconds(10), socket)); + + std::string line(input_buffer.substr(0, n - 1)); + input_buffer.erase(0, n); + + // Keep going until we get back the line that was sent. + if (line == argv[3]) + break; + } + + boost::asio::chrono::steady_clock::time_point time_received = + boost::asio::chrono::steady_clock::now(); + + std::cout << "Round trip time: "; + std::cout << boost::asio::chrono::duration_cast< + boost::asio::chrono::microseconds>( + time_received - time_sent).count(); + std::cout << " microseconds\n"; + } + catch (std::exception& e) + { + std::cerr << "Exception: " << e.what() << "\n"; + } + + return 0; +} diff --git a/doc/html/boost_asio/example/cpp03/timeouts/blocking_udp_client.cpp b/doc/html/boost_asio/example/cpp03/timeouts/blocking_udp_client.cpp index 03aafca2f7..7630e8da26 100644 --- a/doc/html/boost_asio/example/cpp03/timeouts/blocking_udp_client.cpp +++ b/doc/html/boost_asio/example/cpp03/timeouts/blocking_udp_client.cpp @@ -2,42 +2,28 @@ // blocking_udp_client.cpp // ~~~~~~~~~~~~~~~~~~~~~~~ // -// Copyright (c) 2003-2017 Christopher M. Kohlhoff (chris at kohlhoff dot com) +// Copyright (c) 2003-2018 Christopher M. Kohlhoff (chris at kohlhoff dot com) // // Distributed under the Boost Software License, Version 1.0. (See accompanying // file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) // -#include +#include #include #include #include #include -#include #include -using boost::asio::deadline_timer; using boost::asio::ip::udp; //---------------------------------------------------------------------- // -// This class manages socket timeouts by applying the concept of a deadline. -// Each asynchronous operation is given a deadline by which it must complete. -// Deadlines are enforced by an "actor" that persists for the lifetime of the -// client object: -// -// +----------------+ -// | | -// | check_deadline |<---+ -// | | | -// +----------------+ | async_wait() -// | | -// +---------+ -// -// If the actor determines that the deadline has expired, any outstanding -// socket operations are cancelled. The socket operations themselves are -// implemented as transient actors: +// This class manages socket timeouts by running the io_context using the timed +// io_context::run_for() member function. Each asynchronous operation is given +// a timeout within which it must complete. The socket operations themselves +// use boost::bind to specify the completion handler: // // +---------------+ // | | @@ -51,73 +37,59 @@ using boost::asio::ip::udp; // | | // +----------------+ // -// The client object runs the io_context to block thread execution until the -// actor completes. +// For a given socket operation, the client object runs the io_context to block +// thread execution until the operation completes or the timeout is reached. If +// the io_context::run_for() function times out, the socket is closed and the +// outstanding asynchronous operation is cancelled. // class client { public: client(const udp::endpoint& listen_endpoint) - : socket_(io_context_, listen_endpoint), - deadline_(io_context_) + : socket_(io_context_, listen_endpoint) { - // No deadline is required until the first socket operation is started. We - // set the deadline to positive infinity so that the actor takes no action - // until a specific deadline is set. - deadline_.expires_at(boost::posix_time::pos_infin); - - // Start the persistent actor that checks for deadline expiry. - check_deadline(); } std::size_t receive(const boost::asio::mutable_buffer& buffer, - boost::posix_time::time_duration timeout, boost::system::error_code& ec) + boost::asio::chrono::steady_clock::duration timeout, + boost::system::error_code& ec) { - // Set a deadline for the asynchronous operation. - deadline_.expires_from_now(timeout); - - // Set up the variables that receive the result of the asynchronous - // operation. The error code is set to would_block to signal that the - // operation is incomplete. Asio guarantees that its asynchronous - // operations will never fail with would_block, so any other value in - // ec indicates completion. - ec = boost::asio::error::would_block; + // Start the asynchronous operation. The handle_receive function used as a + // callback will update the ec and length variables. std::size_t length = 0; - - // Start the asynchronous operation itself. The handle_receive function - // used as a callback will update the ec and length variables. socket_.async_receive(boost::asio::buffer(buffer), boost::bind(&client::handle_receive, _1, _2, &ec, &length)); - // Block until the asynchronous operation has completed. - do io_context_.run_one(); while (ec == boost::asio::error::would_block); + // Run the operation until it completes, or until the timeout. + run(timeout); return length; } private: - void check_deadline() + void run(boost::asio::chrono::steady_clock::duration timeout) { - // Check whether the deadline has passed. We compare the deadline against - // the current time since a new asynchronous operation may have moved the - // deadline before this actor had a chance to run. - if (deadline_.expires_at() <= deadline_timer::traits_type::now()) + // Restart the io_context, as it may have been left in the "stopped" state + // by a previous operation. + io_context_.restart(); + + // Block until the asynchronous operation has completed, or timed out. If + // the pending asynchronous operation is a composed operation, the deadline + // applies to the entire operation, rather than individual operations on + // the socket. + io_context_.run_for(timeout); + + // If the asynchronous operation completed successfully then the io_context + // would have been stopped due to running out of work. If it was not + // stopped, then the io_context::run_for call must have timed out. + if (!io_context_.stopped()) { - // The deadline has passed. The outstanding asynchronous operation needs - // to be cancelled so that the blocked receive() function will return. - // - // Please note that cancel() has portability issues on some versions of - // Microsoft Windows, and it may be necessary to use close() instead. - // Consult the documentation for cancel() for further information. + // Cancel the outstanding asynchronous operation. socket_.cancel(); - // There is no longer an active deadline. The expiry is set to positive - // infinity so that the actor takes no action until a new deadline is set. - deadline_.expires_at(boost::posix_time::pos_infin); + // Run the io_context again until the operation completes. + io_context_.run(); } - - // Put the actor back to sleep. - deadline_.async_wait(boost::bind(&client::check_deadline, this)); } static void handle_receive( @@ -131,7 +103,6 @@ private: private: boost::asio::io_context io_context_; udp::socket socket_; - deadline_timer deadline_; }; //---------------------------------------------------------------------- @@ -144,7 +115,7 @@ int main(int argc, char* argv[]) if (argc != 3) { - std::cerr << "Usage: blocking_udp_timeout \n"; + std::cerr << "Usage: blocking_udp_client \n"; return 1; } @@ -159,7 +130,7 @@ int main(int argc, char* argv[]) char data[1024]; boost::system::error_code ec; std::size_t n = c.receive(boost::asio::buffer(data), - boost::posix_time::seconds(10), ec); + boost::asio::chrono::seconds(10), ec); if (ec) { diff --git a/doc/html/boost_asio/example/cpp03/timeouts/server.cpp b/doc/html/boost_asio/example/cpp03/timeouts/server.cpp index 23c276521e..be85fc2dbe 100644 --- a/doc/html/boost_asio/example/cpp03/timeouts/server.cpp +++ b/doc/html/boost_asio/example/cpp03/timeouts/server.cpp @@ -2,7 +2,7 @@ // server.cpp // ~~~~~~~~~~ // -// Copyright (c) 2003-2017 Christopher M. Kohlhoff (chris at kohlhoff dot com) +// Copyright (c) 2003-2018 Christopher M. Kohlhoff (chris at kohlhoff dot com) // // Distributed under the Boost Software License, Version 1.0. (See accompanying // file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) @@ -13,18 +13,19 @@ #include #include #include +#include #include #include #include -#include +#include #include #include #include #include -#include +#include #include -using boost::asio::deadline_timer; +using boost::asio::steady_timer; using boost::asio::ip::tcp; using boost::asio::ip::udp; @@ -121,8 +122,8 @@ private: // +-------------+ +--------------+ // // The output actor first waits for an output message to be enqueued. It does -// this by using a deadline_timer as an asynchronous condition variable. The -// deadline_timer will be signalled whenever the output queue is non-empty. +// this by using a steady_timer as an asynchronous condition variable. The +// steady_timer will be signalled whenever the output queue is non-empty. // // Once a message is available, it is sent to the client. The deadline for // sending a complete message is 30 seconds. After the message is successfully @@ -140,13 +141,13 @@ public: non_empty_output_queue_(io_context), output_deadline_(io_context) { - input_deadline_.expires_at(boost::posix_time::pos_infin); - output_deadline_.expires_at(boost::posix_time::pos_infin); + input_deadline_.expires_at(steady_timer::time_point::max()); + output_deadline_.expires_at(steady_timer::time_point::max()); - // The non_empty_output_queue_ deadline_timer is set to pos_infin whenever - // the output queue is empty. This ensures that the output actor stays - // asleep until a message is put into the queue. - non_empty_output_queue_.expires_at(boost::posix_time::pos_infin); + // The non_empty_output_queue_ steady_timer is set to the maximum time + // point whenever the output queue is empty. This ensures that the output + // actor stays asleep until a message is put into the queue. + non_empty_output_queue_.expires_at(steady_timer::time_point::max()); } tcp::socket& socket() @@ -195,20 +196,21 @@ private: // Signal that the output queue contains messages. Modifying the expiry // will wake the output actor, if it is waiting on the timer. - non_empty_output_queue_.expires_at(boost::posix_time::neg_infin); + non_empty_output_queue_.expires_at(steady_timer::time_point::min()); } void start_read() { // Set a deadline for the read operation. - input_deadline_.expires_from_now(boost::posix_time::seconds(30)); + input_deadline_.expires_after(boost::asio::chrono::seconds(30)); // Start an asynchronous operation to read a newline-delimited message. - boost::asio::async_read_until(socket_, input_buffer_, '\n', - boost::bind(&tcp_session::handle_read, shared_from_this(), _1)); + boost::asio::async_read_until(socket_, + boost::asio::dynamic_buffer(input_buffer_), '\n', + boost::bind(&tcp_session::handle_read, shared_from_this(), _1, _2)); } - void handle_read(const boost::system::error_code& ec) + void handle_read(const boost::system::error_code& ec, std::size_t n) { if (stopped()) return; @@ -216,9 +218,8 @@ private: if (!ec) { // Extract the newline-delimited message from the buffer. - std::string msg; - std::istream is(&input_buffer_); - std::getline(is, msg); + std::string msg(input_buffer_.substr(0, n - 1)); + input_buffer_.erase(0, n); if (!msg.empty()) { @@ -234,7 +235,7 @@ private: // Signal that the output queue contains messages. Modifying the // expiry will wake the output actor, if it is waiting on the timer. - non_empty_output_queue_.expires_at(boost::posix_time::neg_infin); + non_empty_output_queue_.expires_at(steady_timer::time_point::min()); } } @@ -256,7 +257,7 @@ private: // There are no messages that are ready to be sent. The actor goes to // sleep by waiting on the non_empty_output_queue_ timer. When a new // message is added, the timer will be modified and the actor will wake. - non_empty_output_queue_.expires_at(boost::posix_time::pos_infin); + non_empty_output_queue_.expires_at(steady_timer::time_point::max()); non_empty_output_queue_.async_wait( boost::bind(&tcp_session::await_output, shared_from_this())); } @@ -269,7 +270,7 @@ private: void start_write() { // Set a deadline for the write operation. - output_deadline_.expires_from_now(boost::posix_time::seconds(30)); + output_deadline_.expires_after(boost::asio::chrono::seconds(30)); // Start an asynchronous operation to send a message. boost::asio::async_write(socket_, @@ -294,7 +295,7 @@ private: } } - void check_deadline(deadline_timer* deadline) + void check_deadline(steady_timer* deadline) { if (stopped()) return; @@ -302,7 +303,7 @@ private: // Check whether the deadline has passed. We compare the deadline against // the current time since a new asynchronous operation may have moved the // deadline before this actor had a chance to run. - if (deadline->expires_at() <= deadline_timer::traits_type::now()) + if (deadline->expiry() <= steady_timer::clock_type::now()) { // The deadline has passed. Stop the session. The other actors will // terminate as soon as possible. @@ -319,11 +320,11 @@ private: channel& channel_; tcp::socket socket_; - boost::asio::streambuf input_buffer_; - deadline_timer input_deadline_; + std::string input_buffer_; + steady_timer input_deadline_; std::deque output_queue_; - deadline_timer non_empty_output_queue_; - deadline_timer output_deadline_; + steady_timer non_empty_output_queue_; + steady_timer output_deadline_; }; typedef boost::shared_ptr tcp_session_ptr; @@ -339,6 +340,7 @@ public: : socket_(io_context) { socket_.connect(broadcast_endpoint); + socket_.set_option(udp::socket::broadcast(true)); } private: diff --git a/doc/html/boost_asio/example/cpp03/timers/tick_count_timer.cpp b/doc/html/boost_asio/example/cpp03/timers/tick_count_timer.cpp deleted file mode 100644 index 8111a5cacd..0000000000 --- a/doc/html/boost_asio/example/cpp03/timers/tick_count_timer.cpp +++ /dev/null @@ -1,123 +0,0 @@ -// -// tick_count_timer.cpp -// ~~~~~~~~~~~~~~~~~~~~ -// -// Copyright (c) 2003-2017 Christopher M. Kohlhoff (chris at kohlhoff dot com) -// -// Distributed under the Boost Software License, Version 1.0. (See accompanying -// file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) -// - -#include -#include -#include - -#if defined(WIN32) -# include -#else -# error This example is for Windows only! -#endif - -struct tick_count_traits -{ - // The time type. This type has no constructor that takes a DWORD to ensure - // that the timer can only be used with relative times. - class time_type - { - public: - time_type() : ticks_(0) {} - private: - friend struct tick_count_traits; - DWORD ticks_; - }; - - // The duration type. According to the TimeTraits requirements, the duration - // must be a signed type. This means we can't handle durations larger than - // 2^31. - class duration_type - { - public: - duration_type() : ticks_(0) {} - duration_type(LONG ticks) : ticks_(ticks) {} - private: - friend struct tick_count_traits; - LONG ticks_; - }; - - // Get the current time. - static time_type now() - { - time_type result; - result.ticks_ = ::GetTickCount(); - return result; - } - - // Add a duration to a time. - static time_type add(const time_type& t, const duration_type& d) - { - time_type result; - result.ticks_ = t.ticks_ + d.ticks_; - return result; - } - - // Subtract one time from another. - static duration_type subtract(const time_type& t1, const time_type& t2) - { - // DWORD tick count values can wrap (see less_than() below). We'll convert - // to a duration by taking the absolute difference and adding the sign - // based on which is the "lesser" absolute time. - return duration_type(less_than(t1, t2) - ? -static_cast(t2.ticks_ - t1.ticks_) - : static_cast(t1.ticks_ - t2.ticks_)); - } - - // Test whether one time is less than another. - static bool less_than(const time_type& t1, const time_type& t2) - { - // DWORD tick count values wrap periodically, so we'll use a heuristic that - // says that if subtracting t1 from t2 yields a value smaller than 2^31, - // then t1 is probably less than t2. This means that we can't handle - // durations larger than 2^31, which shouldn't be a problem in practice. - return (t2.ticks_ - t1.ticks_) < static_cast(1 << 31); - } - - // Convert to POSIX duration type. - static boost::posix_time::time_duration to_posix_duration( - const duration_type& d) - { - return boost::posix_time::milliseconds(d.ticks_); - } -}; - -typedef boost::asio::basic_deadline_timer< - DWORD, tick_count_traits> tick_count_timer; - -void handle_timeout(const boost::system::error_code&) -{ - std::cout << "handle_timeout\n"; -} - -int main() -{ - try - { - boost::asio::io_context io_context; - - tick_count_timer timer(io_context, 5000); - std::cout << "Starting synchronous wait\n"; - timer.wait(); - std::cout << "Finished synchronous wait\n"; - - timer.expires_from_now(5000); - std::cout << "Starting asynchronous wait\n"; - timer.async_wait(&handle_timeout); - io_context.run(); - std::cout << "Finished asynchronous wait\n"; - } - catch (std::exception& e) - { - std::cout << "Exception: " << e.what() << "\n"; - } - - return 0; -} diff --git a/doc/html/boost_asio/example/cpp03/timers/time_t_timer.cpp b/doc/html/boost_asio/example/cpp03/timers/time_t_timer.cpp index 95b443eccd..061ed81bf1 100644 --- a/doc/html/boost_asio/example/cpp03/timers/time_t_timer.cpp +++ b/doc/html/boost_asio/example/cpp03/timers/time_t_timer.cpp @@ -2,7 +2,7 @@ // time_t_timer.cpp // ~~~~~~~~~~~~~~~~ // -// Copyright (c) 2003-2017 Christopher M. Kohlhoff (chris at kohlhoff dot com) +// Copyright (c) 2003-2018 Christopher M. Kohlhoff (chris at kohlhoff dot com) // // Distributed under the Boost Software License, Version 1.0. (See accompanying // file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) @@ -12,53 +12,66 @@ #include #include -struct time_t_traits +// A custom implementation of the Clock concept from the standard C++ library. +struct time_t_clock { - // The time type. - typedef std::time_t time_type; - // The duration type. - struct duration_type - { - duration_type() : value(0) {} - duration_type(std::time_t v) : value(v) {} - std::time_t value; - }; + typedef boost::asio::chrono::steady_clock::duration duration; - // Get the current time. - static time_type now() - { - return std::time(0); - } + // The duration's underlying arithmetic representation. + typedef duration::rep rep; - // Add a duration to a time. - static time_type add(const time_type& t, const duration_type& d) - { - return t + d.value; - } + // The ratio representing the duration's tick period. + typedef duration::period period; + + // An absolute time point represented using the clock. + typedef boost::asio::chrono::time_point time_point; + + // The clock is not monotonically increasing. + static const bool is_steady = false; - // Subtract one time from another. - static duration_type subtract(const time_type& t1, const time_type& t2) + // Get the current time. + static time_point now() { - return duration_type(t1 - t2); + return time_point() + boost::asio::chrono::seconds(std::time(0)); } +}; - // Test whether one time is less than another. - static bool less_than(const time_type& t1, const time_type& t2) +// The boost::asio::basic_waitable_timer template accepts an optional WaitTraits +// template parameter. The underlying time_t clock has one-second granularity, +// so these traits may be customised to reduce the latency between the clock +// ticking over and a wait operation's completion. When the timeout is near +// (less than one second away) we poll the clock more frequently to detect the +// time change closer to when it occurs. The user can select the appropriate +// trade off between accuracy and the increased CPU cost of polling. In extreme +// cases, a zero duration may be returned to make the timers as accurate as +// possible, albeit with 100% CPU usage. +struct time_t_wait_traits +{ + // Determine how long until the clock should be next polled to determine + // whether the duration has elapsed. + static time_t_clock::duration to_wait_duration( + const time_t_clock::duration& d) { - return t1 < t2; + if (d > boost::asio::chrono::seconds(1)) + return d - boost::asio::chrono::seconds(1); + else if (d > boost::asio::chrono::seconds(0)) + return boost::asio::chrono::milliseconds(10); + else + return boost::asio::chrono::seconds(0); } - // Convert to POSIX duration type. - static boost::posix_time::time_duration to_posix_duration( - const duration_type& d) + // Determine how long until the clock should be next polled to determine + // whether the absoluate time has been reached. + static time_t_clock::duration to_wait_duration( + const time_t_clock::time_point& t) { - return boost::posix_time::seconds(d.value); + return to_wait_duration(t - time_t_clock::now()); } }; -typedef boost::asio::basic_deadline_timer< - std::time_t, time_t_traits> time_t_timer; +typedef boost::asio::basic_waitable_timer< + time_t_clock, time_t_wait_traits> time_t_timer; void handle_timeout(const boost::system::error_code&) { @@ -73,12 +86,12 @@ int main() time_t_timer timer(io_context); - timer.expires_from_now(5); + timer.expires_after(boost::asio::chrono::seconds(5)); std::cout << "Starting synchronous wait\n"; timer.wait(); std::cout << "Finished synchronous wait\n"; - timer.expires_from_now(5); + timer.expires_after(boost::asio::chrono::seconds(5)); std::cout << "Starting asynchronous wait\n"; timer.async_wait(&handle_timeout); io_context.run(); diff --git a/doc/html/boost_asio/example/cpp03/windows/transmit_file.cpp b/doc/html/boost_asio/example/cpp03/windows/transmit_file.cpp index 38ff8a9d60..2f2f05c735 100644 --- a/doc/html/boost_asio/example/cpp03/windows/transmit_file.cpp +++ b/doc/html/boost_asio/example/cpp03/windows/transmit_file.cpp @@ -2,7 +2,7 @@ // transmit_file.cpp // ~~~~~~~~~~~~~~~~~ // -// Copyright (c) 2003-2017 Christopher M. Kohlhoff (chris at kohlhoff dot com) +// Copyright (c) 2003-2018 Christopher M. Kohlhoff (chris at kohlhoff dot com) // // Distributed under the Boost Software License, Version 1.0. (See accompanying // file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) diff --git a/doc/html/boost_asio/example/cpp11/allocation/server.cpp b/doc/html/boost_asio/example/cpp11/allocation/server.cpp index 5be7508dcc..fc1b03eaa3 100644 --- a/doc/html/boost_asio/example/cpp11/allocation/server.cpp +++ b/doc/html/boost_asio/example/cpp11/allocation/server.cpp @@ -2,7 +2,7 @@ // server.cpp // ~~~~~~~~~~ // -// Copyright (c) 2003-2017 Christopher M. Kohlhoff (chris at kohlhoff dot com) +// Copyright (c) 2003-2018 Christopher M. Kohlhoff (chris at kohlhoff dot com) // // Distributed under the Boost Software License, Version 1.0. (See accompanying // file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) diff --git a/doc/html/boost_asio/example/cpp11/buffers/reference_counted.cpp b/doc/html/boost_asio/example/cpp11/buffers/reference_counted.cpp index 462d5f04e1..e56778f249 100644 --- a/doc/html/boost_asio/example/cpp11/buffers/reference_counted.cpp +++ b/doc/html/boost_asio/example/cpp11/buffers/reference_counted.cpp @@ -2,7 +2,7 @@ // reference_counted.cpp // ~~~~~~~~~~~~~~~~~~~~~ // -// Copyright (c) 2003-2017 Christopher M. Kohlhoff (chris at kohlhoff dot com) +// Copyright (c) 2003-2018 Christopher M. Kohlhoff (chris at kohlhoff dot com) // // Distributed under the Boost Software License, Version 1.0. (See accompanying // file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) @@ -13,6 +13,7 @@ #include #include #include +#include using boost::asio::ip::tcp; diff --git a/doc/html/boost_asio/example/cpp11/chat/chat_client.cpp b/doc/html/boost_asio/example/cpp11/chat/chat_client.cpp index a422e0f9f8..5ee9464cef 100644 --- a/doc/html/boost_asio/example/cpp11/chat/chat_client.cpp +++ b/doc/html/boost_asio/example/cpp11/chat/chat_client.cpp @@ -2,7 +2,7 @@ // chat_client.cpp // ~~~~~~~~~~~~~~~ // -// Copyright (c) 2003-2017 Christopher M. Kohlhoff (chris at kohlhoff dot com) +// Copyright (c) 2003-2018 Christopher M. Kohlhoff (chris at kohlhoff dot com) // // Distributed under the Boost Software License, Version 1.0. (See accompanying // file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) diff --git a/doc/html/boost_asio/example/cpp11/chat/chat_message.hpp b/doc/html/boost_asio/example/cpp11/chat/chat_message.hpp index d2edd1cc76..629105b05b 100644 --- a/doc/html/boost_asio/example/cpp11/chat/chat_message.hpp +++ b/doc/html/boost_asio/example/cpp11/chat/chat_message.hpp @@ -2,7 +2,7 @@ // chat_message.hpp // ~~~~~~~~~~~~~~~~ // -// Copyright (c) 2003-2017 Christopher M. Kohlhoff (chris at kohlhoff dot com) +// Copyright (c) 2003-2018 Christopher M. Kohlhoff (chris at kohlhoff dot com) // // Distributed under the Boost Software License, Version 1.0. (See accompanying // file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) diff --git a/doc/html/boost_asio/example/cpp11/chat/chat_server.cpp b/doc/html/boost_asio/example/cpp11/chat/chat_server.cpp index 4db62b4ba3..6253ff2de9 100644 --- a/doc/html/boost_asio/example/cpp11/chat/chat_server.cpp +++ b/doc/html/boost_asio/example/cpp11/chat/chat_server.cpp @@ -2,7 +2,7 @@ // chat_server.cpp // ~~~~~~~~~~~~~~~ // -// Copyright (c) 2003-2017 Christopher M. Kohlhoff (chris at kohlhoff dot com) +// Copyright (c) 2003-2018 Christopher M. Kohlhoff (chris at kohlhoff dot com) // // Distributed under the Boost Software License, Version 1.0. (See accompanying // file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) diff --git a/doc/html/boost_asio/example/cpp11/echo/async_tcp_echo_server.cpp b/doc/html/boost_asio/example/cpp11/echo/async_tcp_echo_server.cpp index 14a3810a63..34fbb48808 100644 --- a/doc/html/boost_asio/example/cpp11/echo/async_tcp_echo_server.cpp +++ b/doc/html/boost_asio/example/cpp11/echo/async_tcp_echo_server.cpp @@ -2,7 +2,7 @@ // async_tcp_echo_server.cpp // ~~~~~~~~~~~~~~~~~~~~~~~~~ // -// Copyright (c) 2003-2017 Christopher M. Kohlhoff (chris at kohlhoff dot com) +// Copyright (c) 2003-2018 Christopher M. Kohlhoff (chris at kohlhoff dot com) // // Distributed under the Boost Software License, Version 1.0. (See accompanying // file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) diff --git a/doc/html/boost_asio/example/cpp11/echo/async_udp_echo_server.cpp b/doc/html/boost_asio/example/cpp11/echo/async_udp_echo_server.cpp index 3e0ab89586..d6e6587ee4 100644 --- a/doc/html/boost_asio/example/cpp11/echo/async_udp_echo_server.cpp +++ b/doc/html/boost_asio/example/cpp11/echo/async_udp_echo_server.cpp @@ -2,7 +2,7 @@ // async_udp_echo_server.cpp // ~~~~~~~~~~~~~~~~~~~~~~~~~ // -// Copyright (c) 2003-2017 Christopher M. Kohlhoff (chris at kohlhoff dot com) +// Copyright (c) 2003-2018 Christopher M. Kohlhoff (chris at kohlhoff dot com) // // Distributed under the Boost Software License, Version 1.0. (See accompanying // file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) diff --git a/doc/html/boost_asio/example/cpp11/echo/blocking_tcp_echo_client.cpp b/doc/html/boost_asio/example/cpp11/echo/blocking_tcp_echo_client.cpp index 557b14e41d..fe6c447b39 100644 --- a/doc/html/boost_asio/example/cpp11/echo/blocking_tcp_echo_client.cpp +++ b/doc/html/boost_asio/example/cpp11/echo/blocking_tcp_echo_client.cpp @@ -2,7 +2,7 @@ // blocking_tcp_echo_client.cpp // ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ // -// Copyright (c) 2003-2017 Christopher M. Kohlhoff (chris at kohlhoff dot com) +// Copyright (c) 2003-2018 Christopher M. Kohlhoff (chris at kohlhoff dot com) // // Distributed under the Boost Software License, Version 1.0. (See accompanying // file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) diff --git a/doc/html/boost_asio/example/cpp11/echo/blocking_tcp_echo_server.cpp b/doc/html/boost_asio/example/cpp11/echo/blocking_tcp_echo_server.cpp index 44c69c0dae..c00a585242 100644 --- a/doc/html/boost_asio/example/cpp11/echo/blocking_tcp_echo_server.cpp +++ b/doc/html/boost_asio/example/cpp11/echo/blocking_tcp_echo_server.cpp @@ -2,7 +2,7 @@ // blocking_tcp_echo_server.cpp // ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ // -// Copyright (c) 2003-2017 Christopher M. Kohlhoff (chris at kohlhoff dot com) +// Copyright (c) 2003-2018 Christopher M. Kohlhoff (chris at kohlhoff dot com) // // Distributed under the Boost Software License, Version 1.0. (See accompanying // file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) diff --git a/doc/html/boost_asio/example/cpp11/echo/blocking_udp_echo_client.cpp b/doc/html/boost_asio/example/cpp11/echo/blocking_udp_echo_client.cpp index 8be33a0688..887891a737 100644 --- a/doc/html/boost_asio/example/cpp11/echo/blocking_udp_echo_client.cpp +++ b/doc/html/boost_asio/example/cpp11/echo/blocking_udp_echo_client.cpp @@ -2,7 +2,7 @@ // blocking_udp_echo_client.cpp // ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ // -// Copyright (c) 2003-2017 Christopher M. Kohlhoff (chris at kohlhoff dot com) +// Copyright (c) 2003-2018 Christopher M. Kohlhoff (chris at kohlhoff dot com) // // Distributed under the Boost Software License, Version 1.0. (See accompanying // file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) diff --git a/doc/html/boost_asio/example/cpp11/echo/blocking_udp_echo_server.cpp b/doc/html/boost_asio/example/cpp11/echo/blocking_udp_echo_server.cpp index 6626d74d82..0941b0c8d4 100644 --- a/doc/html/boost_asio/example/cpp11/echo/blocking_udp_echo_server.cpp +++ b/doc/html/boost_asio/example/cpp11/echo/blocking_udp_echo_server.cpp @@ -2,7 +2,7 @@ // blocking_udp_echo_server.cpp // ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ // -// Copyright (c) 2003-2017 Christopher M. Kohlhoff (chris at kohlhoff dot com) +// Copyright (c) 2003-2018 Christopher M. Kohlhoff (chris at kohlhoff dot com) // // Distributed under the Boost Software License, Version 1.0. (See accompanying // file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) diff --git a/doc/html/boost_asio/example/cpp11/executors/fork_join.cpp b/doc/html/boost_asio/example/cpp11/executors/fork_join.cpp index 4cfd5e6fca..98926d53fe 100644 --- a/doc/html/boost_asio/example/cpp11/executors/fork_join.cpp +++ b/doc/html/boost_asio/example/cpp11/executors/fork_join.cpp @@ -6,6 +6,7 @@ #include #include #include +#include using boost::asio::dispatch; using boost::asio::execution_context; diff --git a/doc/html/boost_asio/example/cpp11/executors/pipeline.cpp b/doc/html/boost_asio/example/cpp11/executors/pipeline.cpp index 52b70cad56..9c2a778fee 100644 --- a/doc/html/boost_asio/example/cpp11/executors/pipeline.cpp +++ b/doc/html/boost_asio/example/cpp11/executors/pipeline.cpp @@ -11,6 +11,7 @@ #include #include #include +#include using boost::asio::execution_context; using boost::asio::executor_binder; diff --git a/doc/html/boost_asio/example/cpp11/fork/daemon.cpp b/doc/html/boost_asio/example/cpp11/fork/daemon.cpp index 4e0557365b..2661926220 100644 --- a/doc/html/boost_asio/example/cpp11/fork/daemon.cpp +++ b/doc/html/boost_asio/example/cpp11/fork/daemon.cpp @@ -2,7 +2,7 @@ // daemon.cpp // ~~~~~~~~~~ // -// Copyright (c) 2003-2017 Christopher M. Kohlhoff (chris at kohlhoff dot com) +// Copyright (c) 2003-2018 Christopher M. Kohlhoff (chris at kohlhoff dot com) // // Distributed under the Boost Software License, Version 1.0. (See accompanying // file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) diff --git a/doc/html/boost_asio/example/cpp11/fork/process_per_connection.cpp b/doc/html/boost_asio/example/cpp11/fork/process_per_connection.cpp index 5f68c12d89..3608c440da 100644 --- a/doc/html/boost_asio/example/cpp11/fork/process_per_connection.cpp +++ b/doc/html/boost_asio/example/cpp11/fork/process_per_connection.cpp @@ -2,7 +2,7 @@ // process_per_connection.cpp // ~~~~~~~~~~~~~~~~~~~~~~~~~~ // -// Copyright (c) 2003-2017 Christopher M. Kohlhoff (chris at kohlhoff dot com) +// Copyright (c) 2003-2018 Christopher M. Kohlhoff (chris at kohlhoff dot com) // // Distributed under the Boost Software License, Version 1.0. (See accompanying // file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) diff --git a/doc/html/boost_asio/example/cpp11/futures/daytime_client.cpp b/doc/html/boost_asio/example/cpp11/futures/daytime_client.cpp index 2ec8a67290..1e49fc87d3 100644 --- a/doc/html/boost_asio/example/cpp11/futures/daytime_client.cpp +++ b/doc/html/boost_asio/example/cpp11/futures/daytime_client.cpp @@ -2,7 +2,7 @@ // daytime_client.cpp // ~~~~~~~~~~~~~~~~~~ // -// Copyright (c) 2003-2017 Christopher M. Kohlhoff (chris at kohlhoff dot com) +// Copyright (c) 2003-2018 Christopher M. Kohlhoff (chris at kohlhoff dot com) // // Distributed under the Boost Software License, Version 1.0. (See accompanying // file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) diff --git a/doc/html/boost_asio/example/cpp11/handler_tracking/async_tcp_echo_server.cpp b/doc/html/boost_asio/example/cpp11/handler_tracking/async_tcp_echo_server.cpp index 14a3810a63..34fbb48808 100644 --- a/doc/html/boost_asio/example/cpp11/handler_tracking/async_tcp_echo_server.cpp +++ b/doc/html/boost_asio/example/cpp11/handler_tracking/async_tcp_echo_server.cpp @@ -2,7 +2,7 @@ // async_tcp_echo_server.cpp // ~~~~~~~~~~~~~~~~~~~~~~~~~ // -// Copyright (c) 2003-2017 Christopher M. Kohlhoff (chris at kohlhoff dot com) +// Copyright (c) 2003-2018 Christopher M. Kohlhoff (chris at kohlhoff dot com) // // Distributed under the Boost Software License, Version 1.0. (See accompanying // file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) diff --git a/doc/html/boost_asio/example/cpp11/handler_tracking/custom_tracking.hpp b/doc/html/boost_asio/example/cpp11/handler_tracking/custom_tracking.hpp index 7e039b5562..997e1588c3 100644 --- a/doc/html/boost_asio/example/cpp11/handler_tracking/custom_tracking.hpp +++ b/doc/html/boost_asio/example/cpp11/handler_tracking/custom_tracking.hpp @@ -2,7 +2,7 @@ // custom_tracking.hpp // ~~~~~~~~~~~~~~~~~~~ // -// Copyright (c) 2003-2017 Christopher M. Kohlhoff (chris at kohlhoff dot com) +// Copyright (c) 2003-2018 Christopher M. Kohlhoff (chris at kohlhoff dot com) // // Distributed under the Boost Software License, Version 1.0. (See accompanying // file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) diff --git a/doc/html/boost_asio/example/cpp11/http/server/connection.cpp b/doc/html/boost_asio/example/cpp11/http/server/connection.cpp index 733fe69d27..5eed24764e 100644 --- a/doc/html/boost_asio/example/cpp11/http/server/connection.cpp +++ b/doc/html/boost_asio/example/cpp11/http/server/connection.cpp @@ -2,7 +2,7 @@ // connection.cpp // ~~~~~~~~~~~~~~ // -// Copyright (c) 2003-2017 Christopher M. Kohlhoff (chris at kohlhoff dot com) +// Copyright (c) 2003-2018 Christopher M. Kohlhoff (chris at kohlhoff dot com) // // Distributed under the Boost Software License, Version 1.0. (See accompanying // file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) diff --git a/doc/html/boost_asio/example/cpp11/http/server/connection.hpp b/doc/html/boost_asio/example/cpp11/http/server/connection.hpp index d459e5f8cc..5f3ce5c377 100644 --- a/doc/html/boost_asio/example/cpp11/http/server/connection.hpp +++ b/doc/html/boost_asio/example/cpp11/http/server/connection.hpp @@ -2,7 +2,7 @@ // connection.hpp // ~~~~~~~~~~~~~~ // -// Copyright (c) 2003-2017 Christopher M. Kohlhoff (chris at kohlhoff dot com) +// Copyright (c) 2003-2018 Christopher M. Kohlhoff (chris at kohlhoff dot com) // // Distributed under the Boost Software License, Version 1.0. (See accompanying // file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) diff --git a/doc/html/boost_asio/example/cpp11/http/server/connection_manager.cpp b/doc/html/boost_asio/example/cpp11/http/server/connection_manager.cpp index e3e18ca7a1..ac862994b5 100644 --- a/doc/html/boost_asio/example/cpp11/http/server/connection_manager.cpp +++ b/doc/html/boost_asio/example/cpp11/http/server/connection_manager.cpp @@ -2,7 +2,7 @@ // connection_manager.cpp // ~~~~~~~~~~~~~~~~~~~~~~ // -// Copyright (c) 2003-2017 Christopher M. Kohlhoff (chris at kohlhoff dot com) +// Copyright (c) 2003-2018 Christopher M. Kohlhoff (chris at kohlhoff dot com) // // Distributed under the Boost Software License, Version 1.0. (See accompanying // file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) diff --git a/doc/html/boost_asio/example/cpp11/http/server/connection_manager.hpp b/doc/html/boost_asio/example/cpp11/http/server/connection_manager.hpp index 617a54f1ba..027b9e92d8 100644 --- a/doc/html/boost_asio/example/cpp11/http/server/connection_manager.hpp +++ b/doc/html/boost_asio/example/cpp11/http/server/connection_manager.hpp @@ -2,7 +2,7 @@ // connection_manager.hpp // ~~~~~~~~~~~~~~~~~~~~~~ // -// Copyright (c) 2003-2017 Christopher M. Kohlhoff (chris at kohlhoff dot com) +// Copyright (c) 2003-2018 Christopher M. Kohlhoff (chris at kohlhoff dot com) // // Distributed under the Boost Software License, Version 1.0. (See accompanying // file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) diff --git a/doc/html/boost_asio/example/cpp11/http/server/header.hpp b/doc/html/boost_asio/example/cpp11/http/server/header.hpp index 877211f190..18bad986a4 100644 --- a/doc/html/boost_asio/example/cpp11/http/server/header.hpp +++ b/doc/html/boost_asio/example/cpp11/http/server/header.hpp @@ -2,7 +2,7 @@ // header.hpp // ~~~~~~~~~~ // -// Copyright (c) 2003-2017 Christopher M. Kohlhoff (chris at kohlhoff dot com) +// Copyright (c) 2003-2018 Christopher M. Kohlhoff (chris at kohlhoff dot com) // // Distributed under the Boost Software License, Version 1.0. (See accompanying // file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) diff --git a/doc/html/boost_asio/example/cpp11/http/server/main.cpp b/doc/html/boost_asio/example/cpp11/http/server/main.cpp index fcc72ecc93..15cffd5234 100644 --- a/doc/html/boost_asio/example/cpp11/http/server/main.cpp +++ b/doc/html/boost_asio/example/cpp11/http/server/main.cpp @@ -2,7 +2,7 @@ // main.cpp // ~~~~~~~~ // -// Copyright (c) 2003-2017 Christopher M. Kohlhoff (chris at kohlhoff dot com) +// Copyright (c) 2003-2018 Christopher M. Kohlhoff (chris at kohlhoff dot com) // // Distributed under the Boost Software License, Version 1.0. (See accompanying // file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) diff --git a/doc/html/boost_asio/example/cpp11/http/server/mime_types.cpp b/doc/html/boost_asio/example/cpp11/http/server/mime_types.cpp index c05ee4b656..0762cf7fea 100644 --- a/doc/html/boost_asio/example/cpp11/http/server/mime_types.cpp +++ b/doc/html/boost_asio/example/cpp11/http/server/mime_types.cpp @@ -2,7 +2,7 @@ // mime_types.cpp // ~~~~~~~~~~~~~~ // -// Copyright (c) 2003-2017 Christopher M. Kohlhoff (chris at kohlhoff dot com) +// Copyright (c) 2003-2018 Christopher M. Kohlhoff (chris at kohlhoff dot com) // // Distributed under the Boost Software License, Version 1.0. (See accompanying // file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) diff --git a/doc/html/boost_asio/example/cpp11/http/server/mime_types.hpp b/doc/html/boost_asio/example/cpp11/http/server/mime_types.hpp index 891c443669..a5f352e69a 100644 --- a/doc/html/boost_asio/example/cpp11/http/server/mime_types.hpp +++ b/doc/html/boost_asio/example/cpp11/http/server/mime_types.hpp @@ -2,7 +2,7 @@ // mime_types.hpp // ~~~~~~~~~~~~~~ // -// Copyright (c) 2003-2017 Christopher M. Kohlhoff (chris at kohlhoff dot com) +// Copyright (c) 2003-2018 Christopher M. Kohlhoff (chris at kohlhoff dot com) // // Distributed under the Boost Software License, Version 1.0. (See accompanying // file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) diff --git a/doc/html/boost_asio/example/cpp11/http/server/reply.cpp b/doc/html/boost_asio/example/cpp11/http/server/reply.cpp index c7e9b9f2b7..e1e23daaa6 100644 --- a/doc/html/boost_asio/example/cpp11/http/server/reply.cpp +++ b/doc/html/boost_asio/example/cpp11/http/server/reply.cpp @@ -2,7 +2,7 @@ // reply.cpp // ~~~~~~~~~ // -// Copyright (c) 2003-2017 Christopher M. Kohlhoff (chris at kohlhoff dot com) +// Copyright (c) 2003-2018 Christopher M. Kohlhoff (chris at kohlhoff dot com) // // Distributed under the Boost Software License, Version 1.0. (See accompanying // file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) diff --git a/doc/html/boost_asio/example/cpp11/http/server/reply.hpp b/doc/html/boost_asio/example/cpp11/http/server/reply.hpp index 51d495bc65..03293227e7 100644 --- a/doc/html/boost_asio/example/cpp11/http/server/reply.hpp +++ b/doc/html/boost_asio/example/cpp11/http/server/reply.hpp @@ -2,7 +2,7 @@ // reply.hpp // ~~~~~~~~~ // -// Copyright (c) 2003-2017 Christopher M. Kohlhoff (chris at kohlhoff dot com) +// Copyright (c) 2003-2018 Christopher M. Kohlhoff (chris at kohlhoff dot com) // // Distributed under the Boost Software License, Version 1.0. (See accompanying // file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) diff --git a/doc/html/boost_asio/example/cpp11/http/server/request.hpp b/doc/html/boost_asio/example/cpp11/http/server/request.hpp index 20efff4dd3..6488b1ddeb 100644 --- a/doc/html/boost_asio/example/cpp11/http/server/request.hpp +++ b/doc/html/boost_asio/example/cpp11/http/server/request.hpp @@ -2,7 +2,7 @@ // request.hpp // ~~~~~~~~~~~ // -// Copyright (c) 2003-2017 Christopher M. Kohlhoff (chris at kohlhoff dot com) +// Copyright (c) 2003-2018 Christopher M. Kohlhoff (chris at kohlhoff dot com) // // Distributed under the Boost Software License, Version 1.0. (See accompanying // file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) diff --git a/doc/html/boost_asio/example/cpp11/http/server/request_handler.cpp b/doc/html/boost_asio/example/cpp11/http/server/request_handler.cpp index 419c62b5ae..04a5959b12 100644 --- a/doc/html/boost_asio/example/cpp11/http/server/request_handler.cpp +++ b/doc/html/boost_asio/example/cpp11/http/server/request_handler.cpp @@ -2,7 +2,7 @@ // request_handler.cpp // ~~~~~~~~~~~~~~~~~~~ // -// Copyright (c) 2003-2017 Christopher M. Kohlhoff (chris at kohlhoff dot com) +// Copyright (c) 2003-2018 Christopher M. Kohlhoff (chris at kohlhoff dot com) // // Distributed under the Boost Software License, Version 1.0. (See accompanying // file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) diff --git a/doc/html/boost_asio/example/cpp11/http/server/request_handler.hpp b/doc/html/boost_asio/example/cpp11/http/server/request_handler.hpp index e2dff5c26c..82bd61392a 100644 --- a/doc/html/boost_asio/example/cpp11/http/server/request_handler.hpp +++ b/doc/html/boost_asio/example/cpp11/http/server/request_handler.hpp @@ -2,7 +2,7 @@ // request_handler.hpp // ~~~~~~~~~~~~~~~~~~~ // -// Copyright (c) 2003-2017 Christopher M. Kohlhoff (chris at kohlhoff dot com) +// Copyright (c) 2003-2018 Christopher M. Kohlhoff (chris at kohlhoff dot com) // // Distributed under the Boost Software License, Version 1.0. (See accompanying // file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) diff --git a/doc/html/boost_asio/example/cpp11/http/server/request_parser.cpp b/doc/html/boost_asio/example/cpp11/http/server/request_parser.cpp index 2104034ea7..4b148c5af6 100644 --- a/doc/html/boost_asio/example/cpp11/http/server/request_parser.cpp +++ b/doc/html/boost_asio/example/cpp11/http/server/request_parser.cpp @@ -2,7 +2,7 @@ // request_parser.cpp // ~~~~~~~~~~~~~~~~~~ // -// Copyright (c) 2003-2017 Christopher M. Kohlhoff (chris at kohlhoff dot com) +// Copyright (c) 2003-2018 Christopher M. Kohlhoff (chris at kohlhoff dot com) // // Distributed under the Boost Software License, Version 1.0. (See accompanying // file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) diff --git a/doc/html/boost_asio/example/cpp11/http/server/request_parser.hpp b/doc/html/boost_asio/example/cpp11/http/server/request_parser.hpp index 2c1d05ab04..aaae6b9539 100644 --- a/doc/html/boost_asio/example/cpp11/http/server/request_parser.hpp +++ b/doc/html/boost_asio/example/cpp11/http/server/request_parser.hpp @@ -2,7 +2,7 @@ // request_parser.hpp // ~~~~~~~~~~~~~~~~~~ // -// Copyright (c) 2003-2017 Christopher M. Kohlhoff (chris at kohlhoff dot com) +// Copyright (c) 2003-2018 Christopher M. Kohlhoff (chris at kohlhoff dot com) // // Distributed under the Boost Software License, Version 1.0. (See accompanying // file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) diff --git a/doc/html/boost_asio/example/cpp11/http/server/server.cpp b/doc/html/boost_asio/example/cpp11/http/server/server.cpp index df453b8ed2..ce415b80fd 100644 --- a/doc/html/boost_asio/example/cpp11/http/server/server.cpp +++ b/doc/html/boost_asio/example/cpp11/http/server/server.cpp @@ -2,7 +2,7 @@ // server.cpp // ~~~~~~~~~~ // -// Copyright (c) 2003-2017 Christopher M. Kohlhoff (chris at kohlhoff dot com) +// Copyright (c) 2003-2018 Christopher M. Kohlhoff (chris at kohlhoff dot com) // // Distributed under the Boost Software License, Version 1.0. (See accompanying // file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) diff --git a/doc/html/boost_asio/example/cpp11/http/server/server.hpp b/doc/html/boost_asio/example/cpp11/http/server/server.hpp index 7b8aee0c5d..820b46bc13 100644 --- a/doc/html/boost_asio/example/cpp11/http/server/server.hpp +++ b/doc/html/boost_asio/example/cpp11/http/server/server.hpp @@ -2,7 +2,7 @@ // server.hpp // ~~~~~~~~~~ // -// Copyright (c) 2003-2017 Christopher M. Kohlhoff (chris at kohlhoff dot com) +// Copyright (c) 2003-2018 Christopher M. Kohlhoff (chris at kohlhoff dot com) // // Distributed under the Boost Software License, Version 1.0. (See accompanying // file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) diff --git a/doc/html/boost_asio/example/cpp11/invocation/prioritised_handlers.cpp b/doc/html/boost_asio/example/cpp11/invocation/prioritised_handlers.cpp index d7ef7b1ff4..99ea7454f2 100644 --- a/doc/html/boost_asio/example/cpp11/invocation/prioritised_handlers.cpp +++ b/doc/html/boost_asio/example/cpp11/invocation/prioritised_handlers.cpp @@ -2,7 +2,7 @@ // prioritised_handlers.cpp // ~~~~~~~~~~~~~~~~~~~~~~~~ // -// Copyright (c) 2003-2017 Christopher M. Kohlhoff (chris at kohlhoff dot com) +// Copyright (c) 2003-2018 Christopher M. Kohlhoff (chris at kohlhoff dot com) // // Distributed under the Boost Software License, Version 1.0. (See accompanying // file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) diff --git a/doc/html/boost_asio/example/cpp11/local/connect_pair.cpp b/doc/html/boost_asio/example/cpp11/local/connect_pair.cpp index 727b12f850..ad5428dd66 100644 --- a/doc/html/boost_asio/example/cpp11/local/connect_pair.cpp +++ b/doc/html/boost_asio/example/cpp11/local/connect_pair.cpp @@ -2,7 +2,7 @@ // connect_pair.cpp // ~~~~~~~~~~~~~~~~ // -// Copyright (c) 2003-2017 Christopher M. Kohlhoff (chris at kohlhoff dot com) +// Copyright (c) 2003-2018 Christopher M. Kohlhoff (chris at kohlhoff dot com) // // Distributed under the Boost Software License, Version 1.0. (See accompanying // file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) diff --git a/doc/html/boost_asio/example/cpp11/local/iostream_client.cpp b/doc/html/boost_asio/example/cpp11/local/iostream_client.cpp index 57c0faf86e..7bab1d39fa 100644 --- a/doc/html/boost_asio/example/cpp11/local/iostream_client.cpp +++ b/doc/html/boost_asio/example/cpp11/local/iostream_client.cpp @@ -2,7 +2,7 @@ // stream_client.cpp // ~~~~~~~~~~~~~~~~~ // -// Copyright (c) 2003-2017 Christopher M. Kohlhoff (chris at kohlhoff dot com) +// Copyright (c) 2003-2018 Christopher M. Kohlhoff (chris at kohlhoff dot com) // // Distributed under the Boost Software License, Version 1.0. (See accompanying // file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) diff --git a/doc/html/boost_asio/example/cpp11/local/stream_client.cpp b/doc/html/boost_asio/example/cpp11/local/stream_client.cpp index 234d190b8e..0faf617ea7 100644 --- a/doc/html/boost_asio/example/cpp11/local/stream_client.cpp +++ b/doc/html/boost_asio/example/cpp11/local/stream_client.cpp @@ -2,7 +2,7 @@ // stream_client.cpp // ~~~~~~~~~~~~~~~~~ // -// Copyright (c) 2003-2017 Christopher M. Kohlhoff (chris at kohlhoff dot com) +// Copyright (c) 2003-2018 Christopher M. Kohlhoff (chris at kohlhoff dot com) // // Distributed under the Boost Software License, Version 1.0. (See accompanying // file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) diff --git a/doc/html/boost_asio/example/cpp11/local/stream_server.cpp b/doc/html/boost_asio/example/cpp11/local/stream_server.cpp index 7413773a8f..abfdf3d2fc 100644 --- a/doc/html/boost_asio/example/cpp11/local/stream_server.cpp +++ b/doc/html/boost_asio/example/cpp11/local/stream_server.cpp @@ -2,7 +2,7 @@ // stream_server.cpp // ~~~~~~~~~~~~~~~~~ // -// Copyright (c) 2003-2017 Christopher M. Kohlhoff (chris at kohlhoff dot com) +// Copyright (c) 2003-2018 Christopher M. Kohlhoff (chris at kohlhoff dot com) // // Distributed under the Boost Software License, Version 1.0. (See accompanying // file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) diff --git a/doc/html/boost_asio/example/cpp11/multicast/receiver.cpp b/doc/html/boost_asio/example/cpp11/multicast/receiver.cpp index f77266e871..d785265b6c 100644 --- a/doc/html/boost_asio/example/cpp11/multicast/receiver.cpp +++ b/doc/html/boost_asio/example/cpp11/multicast/receiver.cpp @@ -2,7 +2,7 @@ // receiver.cpp // ~~~~~~~~~~~~ // -// Copyright (c) 2003-2017 Christopher M. Kohlhoff (chris at kohlhoff dot com) +// Copyright (c) 2003-2018 Christopher M. Kohlhoff (chris at kohlhoff dot com) // // Distributed under the Boost Software License, Version 1.0. (See accompanying // file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) diff --git a/doc/html/boost_asio/example/cpp11/multicast/sender.cpp b/doc/html/boost_asio/example/cpp11/multicast/sender.cpp index 41f59d89b7..7b52e4ebe3 100644 --- a/doc/html/boost_asio/example/cpp11/multicast/sender.cpp +++ b/doc/html/boost_asio/example/cpp11/multicast/sender.cpp @@ -2,7 +2,7 @@ // sender.cpp // ~~~~~~~~~~ // -// Copyright (c) 2003-2017 Christopher M. Kohlhoff (chris at kohlhoff dot com) +// Copyright (c) 2003-2018 Christopher M. Kohlhoff (chris at kohlhoff dot com) // // Distributed under the Boost Software License, Version 1.0. (See accompanying // file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) diff --git a/doc/html/boost_asio/example/cpp11/spawn/echo_server.cpp b/doc/html/boost_asio/example/cpp11/spawn/echo_server.cpp index 350304e63e..979c9a9273 100644 --- a/doc/html/boost_asio/example/cpp11/spawn/echo_server.cpp +++ b/doc/html/boost_asio/example/cpp11/spawn/echo_server.cpp @@ -2,7 +2,7 @@ // echo_server.cpp // ~~~~~~~~~~~~~~~ // -// Copyright (c) 2003-2017 Christopher M. Kohlhoff (chris at kohlhoff dot com) +// Copyright (c) 2003-2018 Christopher M. Kohlhoff (chris at kohlhoff dot com) // // Distributed under the Boost Software License, Version 1.0. (See accompanying // file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) diff --git a/doc/html/boost_asio/example/cpp11/spawn/parallel_grep.cpp b/doc/html/boost_asio/example/cpp11/spawn/parallel_grep.cpp index b15173be2c..e4af2624e7 100644 --- a/doc/html/boost_asio/example/cpp11/spawn/parallel_grep.cpp +++ b/doc/html/boost_asio/example/cpp11/spawn/parallel_grep.cpp @@ -2,7 +2,7 @@ // parallel_grep.cpp // ~~~~~~~~~~~~~~~~~ // -// Copyright (c) 2003-2017 Christopher M. Kohlhoff (chris at kohlhoff dot com) +// Copyright (c) 2003-2018 Christopher M. Kohlhoff (chris at kohlhoff dot com) // // Distributed under the Boost Software License, Version 1.0. (See accompanying // file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) diff --git a/doc/html/boost_asio/example/cpp17/coroutines_ts/chat_server.cpp b/doc/html/boost_asio/example/cpp17/coroutines_ts/chat_server.cpp new file mode 100644 index 0000000000..cf6260ea57 --- /dev/null +++ b/doc/html/boost_asio/example/cpp17/coroutines_ts/chat_server.cpp @@ -0,0 +1,224 @@ +// +// chat_server.cpp +// ~~~~~~~~~~~~~~~ +// +// Copyright (c) 2003-2018 Christopher M. Kohlhoff (chris at kohlhoff dot com) +// +// Distributed under the Boost Software License, Version 1.0. (See accompanying +// file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +// + +#include +#include +#include +#include +#include +#include +#include +#include +#include +#include +#include +#include +#include +#include +#include + +using boost::asio::ip::tcp; +using boost::asio::experimental::awaitable; +using boost::asio::experimental::co_spawn; +using boost::asio::experimental::detached; +using boost::asio::experimental::redirect_error; +namespace this_coro = boost::asio::experimental::this_coro; + +//---------------------------------------------------------------------- + +class chat_participant +{ +public: + virtual ~chat_participant() {} + virtual void deliver(const std::string& msg) = 0; +}; + +typedef std::shared_ptr chat_participant_ptr; + +//---------------------------------------------------------------------- + +class chat_room +{ +public: + void join(chat_participant_ptr participant) + { + participants_.insert(participant); + for (auto msg: recent_msgs_) + participant->deliver(msg); + } + + void leave(chat_participant_ptr participant) + { + participants_.erase(participant); + } + + void deliver(const std::string& msg) + { + recent_msgs_.push_back(msg); + while (recent_msgs_.size() > max_recent_msgs) + recent_msgs_.pop_front(); + + for (auto participant: participants_) + participant->deliver(msg); + } + +private: + std::set participants_; + enum { max_recent_msgs = 100 }; + std::deque recent_msgs_; +}; + +//---------------------------------------------------------------------- + +class chat_session + : public chat_participant, + public std::enable_shared_from_this +{ +public: + chat_session(tcp::socket socket, chat_room& room) + : socket_(std::move(socket)), + timer_(socket_.get_executor().context()), + room_(room) + { + timer_.expires_at(std::chrono::steady_clock::time_point::max()); + } + + void start() + { + room_.join(shared_from_this()); + + co_spawn(socket_.get_executor(), + [self = shared_from_this()]{ return self->reader(); }, + detached); + + co_spawn(socket_.get_executor(), + [self = shared_from_this()]{ return self->writer(); }, + detached); + } + + void deliver(const std::string& msg) + { + write_msgs_.push_back(msg); + timer_.cancel_one(); + } + +private: + awaitable reader() + { + auto token = co_await this_coro::token(); + + try + { + for (std::string read_msg;;) + { + std::size_t n = co_await boost::asio::async_read_until(socket_, + boost::asio::dynamic_buffer(read_msg, 1024), "\n", token); + + room_.deliver(read_msg.substr(0, n)); + read_msg.erase(0, n); + } + } + catch (std::exception&) + { + stop(); + } + } + + awaitable writer() + { + auto token = co_await this_coro::token(); + + try + { + while (socket_.is_open()) + { + if (write_msgs_.empty()) + { + boost::system::error_code ec; + co_await timer_.async_wait(redirect_error(token, ec)); + } + else + { + co_await boost::asio::async_write(socket_, + boost::asio::buffer(write_msgs_.front()), token); + write_msgs_.pop_front(); + } + } + } + catch (std::exception&) + { + stop(); + } + } + + void stop() + { + room_.leave(shared_from_this()); + socket_.close(); + timer_.cancel(); + } + + tcp::socket socket_; + boost::asio::steady_timer timer_; + chat_room& room_; + std::deque write_msgs_; +}; + +//---------------------------------------------------------------------- + +awaitable listener(tcp::acceptor acceptor) +{ + auto token = co_await this_coro::token(); + + chat_room room; + + for (;;) + { + std::make_shared( + co_await acceptor.async_accept(token), + room + )->start(); + } +} + +//---------------------------------------------------------------------- + +int main(int argc, char* argv[]) +{ + try + { + if (argc < 2) + { + std::cerr << "Usage: chat_server [ ...]\n"; + return 1; + } + + boost::asio::io_context io_context(1); + + for (int i = 1; i < argc; ++i) + { + unsigned short port = std::atoi(argv[i]); + co_spawn(io_context, + [&]{ return listener(tcp::acceptor(io_context, {tcp::v4(), port})); }, + detached); + } + + boost::asio::signal_set signals(io_context, SIGINT, SIGTERM); + signals.async_wait([&](auto, auto){ io_context.stop(); }); + + io_context.run(); + } + catch (std::exception& e) + { + std::cerr << "Exception: " << e.what() << "\n"; + } + + return 0; +} diff --git a/doc/html/boost_asio/example/cpp17/coroutines_ts/double_buffered_echo_server.cpp b/doc/html/boost_asio/example/cpp17/coroutines_ts/double_buffered_echo_server.cpp new file mode 100644 index 0000000000..2355df29c0 --- /dev/null +++ b/doc/html/boost_asio/example/cpp17/coroutines_ts/double_buffered_echo_server.cpp @@ -0,0 +1,97 @@ +// +// double_buffered_echo_server.cpp +// ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ +// +// Copyright (c) 2003-2018 Christopher M. Kohlhoff (chris at kohlhoff dot com) +// +// Distributed under the Boost Software License, Version 1.0. (See accompanying +// file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +// + +#include +#include +#include +#include +#include +#include +#include + +using boost::asio::ip::tcp; +using boost::asio::experimental::co_spawn; +using boost::asio::experimental::detached; +namespace this_coro = boost::asio::experimental::this_coro; + +template + using awaitable = boost::asio::experimental::awaitable< + T, boost::asio::io_context::executor_type>; + +awaitable echo(tcp::socket s) +{ + auto token = co_await this_coro::token(); + + try + { + char data1[1024]; + char data2[1024]; + + char* p1 = data1; + char* p2 = data2; + + // Perform initial read into first buffer. + size_t n = co_await s.async_read_some(boost::asio::buffer(p1, 1024), token); + + for (;;) + { + // Swap received data to other buffer and initiate write operation. + std::swap(p1, p2); + auto write_result = boost::asio::async_write(s, boost::asio::buffer(p2, n), token); + + // Perform next read while write operation is in progress. + n = co_await s.async_read_some(boost::asio::buffer(p1, 1024), token); + + // Wait for write operation to complete before proceeding. + co_await write_result; + } + } + catch (std::exception& e) + { + std::printf("echo Exception: %s\n", e.what()); + } +} + +awaitable listener() +{ + auto executor = co_await this_coro::executor(); + auto token = co_await this_coro::token(); + + tcp::acceptor acceptor(executor.context(), {tcp::v4(), 55555}); + for (;;) + { + tcp::socket socket = co_await acceptor.async_accept(token); + co_spawn(executor, + [socket = std::move(socket)]() mutable + { + return echo(std::move(socket)); + }, + detached); + } +} + +int main() +{ + try + { + boost::asio::io_context io_context(1); + + boost::asio::signal_set signals(io_context, SIGINT, SIGTERM); + signals.async_wait([&](auto, auto){ io_context.stop(); }); + + co_spawn(io_context, listener, detached); + + io_context.run(); + } + catch (std::exception& e) + { + std::printf("Exception: %s\n", e.what()); + } +} diff --git a/doc/html/boost_asio/example/cpp17/coroutines_ts/echo_server.cpp b/doc/html/boost_asio/example/cpp17/coroutines_ts/echo_server.cpp new file mode 100644 index 0000000000..7f663effe9 --- /dev/null +++ b/doc/html/boost_asio/example/cpp17/coroutines_ts/echo_server.cpp @@ -0,0 +1,82 @@ +// +// echo_server.cpp +// ~~~~~~~~~~~~~~~ +// +// Copyright (c) 2003-2018 Christopher M. Kohlhoff (chris at kohlhoff dot com) +// +// Distributed under the Boost Software License, Version 1.0. (See accompanying +// file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +// + +#include +#include +#include +#include +#include +#include +#include + +using boost::asio::ip::tcp; +using boost::asio::experimental::co_spawn; +using boost::asio::experimental::detached; +namespace this_coro = boost::asio::experimental::this_coro; + +template + using awaitable = boost::asio::experimental::awaitable< + T, boost::asio::io_context::executor_type>; + +awaitable echo(tcp::socket socket) +{ + auto token = co_await this_coro::token(); + + try + { + char data[1024]; + for (;;) + { + std::size_t n = co_await socket.async_read_some(boost::asio::buffer(data), token); + co_await async_write(socket, boost::asio::buffer(data, n), token); + } + } + catch (std::exception& e) + { + std::printf("echo Exception: %s\n", e.what()); + } +} + +awaitable listener() +{ + auto executor = co_await this_coro::executor(); + auto token = co_await this_coro::token(); + + tcp::acceptor acceptor(executor.context(), {tcp::v4(), 55555}); + for (;;) + { + tcp::socket socket = co_await acceptor.async_accept(token); + co_spawn(executor, + [socket = std::move(socket)]() mutable + { + return echo(std::move(socket)); + }, + detached); + } +} + +int main() +{ + try + { + boost::asio::io_context io_context(1); + + boost::asio::signal_set signals(io_context, SIGINT, SIGTERM); + signals.async_wait([&](auto, auto){ io_context.stop(); }); + + co_spawn(io_context, listener, detached); + + io_context.run(); + } + catch (std::exception& e) + { + std::printf("Exception: %s\n", e.what()); + } +} diff --git a/doc/html/boost_asio/example/cpp17/coroutines_ts/range_based_for.cpp b/doc/html/boost_asio/example/cpp17/coroutines_ts/range_based_for.cpp new file mode 100644 index 0000000000..a43f888395 --- /dev/null +++ b/doc/html/boost_asio/example/cpp17/coroutines_ts/range_based_for.cpp @@ -0,0 +1,111 @@ +// +// range_based_for.cpp +// ~~~~~~~~~~~~~~~~~~~ +// +// Copyright (c) 2003-2018 Christopher M. Kohlhoff (chris at kohlhoff dot com) +// +// Distributed under the Boost Software License, Version 1.0. (See accompanying +// file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +// + +#include +#include +#include +#include +#include +#include +#include + +using boost::asio::ip::tcp; +using boost::asio::experimental::awaitable; +using boost::asio::experimental::co_spawn; +using boost::asio::experimental::detached; +namespace this_coro = boost::asio::experimental::this_coro; + +class connection_iter +{ + friend class connections; + tcp::acceptor* acceptor_ = nullptr; + tcp::socket socket_; + + connection_iter(tcp::acceptor& a, tcp::socket s) + : acceptor_(&a), socket_(std::move(s)) {} + +public: + tcp::socket operator*() + { + return std::move(socket_); + } + + awaitable operator++() + { + auto token = co_await this_coro::token(); + socket_ = co_await acceptor_->async_accept(token); + } + + bool operator==(const connection_iter&) const noexcept + { + return false; + } + + bool operator!=(const connection_iter&) const noexcept + { + return true; + } +}; + +class connections +{ + tcp::acceptor& acceptor_; + +public: + explicit connections(tcp::acceptor& a) : acceptor_(a) {} + + awaitable begin() + { + auto token = co_await this_coro::token(); + tcp::socket s = co_await acceptor_.async_accept(token); + co_return connection_iter(acceptor_, std::move(s)); + } + + connection_iter end() + { + return connection_iter(acceptor_, + tcp::socket(acceptor_.get_executor().context())); + } +}; + +awaitable listener(tcp::acceptor acceptor) +{ + auto token = co_await this_coro::token(); + + for co_await (tcp::socket s : connections(acceptor)) + { + co_await boost::asio::async_write(s, boost::asio::buffer("hello\r\n", 7), token); + } +} + +int main() +{ + try + { + boost::asio::io_context io_context(1); + + boost::asio::signal_set signals(io_context, SIGINT, SIGTERM); + signals.async_wait([&](auto, auto){ io_context.stop(); }); + + tcp::acceptor acceptor(io_context, {tcp::v4(), 55555}); + co_spawn(io_context, + [acceptor = std::move(acceptor)]() mutable + { + return listener(std::move(acceptor)); + }, + detached); + + io_context.run(); + } + catch (std::exception& e) + { + std::printf("Exception: %s\n", e.what()); + } +} diff --git a/doc/html/boost_asio/example/cpp17/coroutines_ts/refactored_echo_server.cpp b/doc/html/boost_asio/example/cpp17/coroutines_ts/refactored_echo_server.cpp new file mode 100644 index 0000000000..57bf3f379a --- /dev/null +++ b/doc/html/boost_asio/example/cpp17/coroutines_ts/refactored_echo_server.cpp @@ -0,0 +1,91 @@ +// +// refactored_echo_server.cpp +// ~~~~~~~~~~~~~~~~~~~~~~~~~~ +// +// Copyright (c) 2003-2018 Christopher M. Kohlhoff (chris at kohlhoff dot com) +// +// Distributed under the Boost Software License, Version 1.0. (See accompanying +// file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +// + +#include +#include +#include +#include +#include +#include +#include + +using boost::asio::ip::tcp; +using boost::asio::experimental::co_spawn; +using boost::asio::experimental::detached; +namespace this_coro = boost::asio::experimental::this_coro; + +template + using awaitable = boost::asio::experimental::awaitable< + T, boost::asio::io_context::executor_type>; + +awaitable echo_once(tcp::socket& socket) +{ + auto token = co_await this_coro::token(); + + char data[128]; + std::size_t n = co_await socket.async_read_some(boost::asio::buffer(data), token); + co_await async_write(socket, boost::asio::buffer(data, n), token); +} + +awaitable echo(tcp::socket socket) +{ + try + { + for (;;) + { + // The asynchronous operations to echo a single chunk of data have been + // refactored into a separate function. When this function is called, the + // operations are still performed in the context of the current + // coroutine, and the behaviour is functionally equivalent. + co_await echo_once(socket); + } + } + catch (std::exception& e) + { + std::printf("echo Exception: %s\n", e.what()); + } +} + +awaitable listener() +{ + auto executor = co_await this_coro::executor(); + auto token = co_await this_coro::token(); + + tcp::acceptor acceptor(executor.context(), {tcp::v4(), 55555}); + for (;;) + { + tcp::socket socket = co_await acceptor.async_accept(token); + co_spawn(executor, + [socket = std::move(socket)]() mutable + { + return echo(std::move(socket)); + }, + detached); + } +} + +int main() +{ + try + { + boost::asio::io_context io_context(1); + + boost::asio::signal_set signals(io_context, SIGINT, SIGTERM); + signals.async_wait([&](auto, auto){ io_context.stop(); }); + + co_spawn(io_context, listener, detached); + + io_context.run(); + } + catch (std::exception& e) + { + std::printf("Exception: %s\n", e.what()); + } +} diff --git a/doc/html/boost_asio/examples.html b/doc/html/boost_asio/examples.html index f08afdcdde..02de137df4 100644 --- a/doc/html/boost_asio/examples.html +++ b/doc/html/boost_asio/examples.html @@ -39,11 +39,16 @@ only C++11 library and language facilities. These examples do not make direct use of Boost C++ libraries. +
  • + C++17 Examples: + Selected examples illustrating C++17 usage in conjunction with Technical + Specifications. +
    • -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/examples/cpp03_examples.html b/doc/html/boost_asio/examples/cpp03_examples.html index cfc716fb0d..0f21739a05 100644 --- a/doc/html/boost_asio/examples/cpp03_examples.html +++ b/doc/html/boost_asio/examples/cpp03_examples.html @@ -530,6 +530,9 @@
  • boost_asio/example/cpp03/timeouts/blocking_tcp_client.cpp
    • +
  • + boost_asio/example/cpp03/timeouts/blocking_token_tcp_client.cpp +
  • boost_asio/example/cpp03/timeouts/blocking_udp_client.cpp
    • @@ -542,16 +545,12 @@ Timers

    - Examples showing how to customise deadline_timer using different time types. + Example showing how to customise basic_waitable_timer using a different clock + type.

    -
    Porthopper @@ -630,7 +629,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/examples/cpp11_examples.html b/doc/html/boost_asio/examples/cpp11_examples.html index e9ab7d2a90..7f8696ec3e 100644 --- a/doc/html/boost_asio/examples/cpp11_examples.html +++ b/doc/html/boost_asio/examples/cpp11_examples.html @@ -7,7 +7,7 @@ - + @@ -20,7 +20,7 @@
    -PrevUpHomeNext +PrevUpHomeNext

    @@ -263,7 +263,7 @@

    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    @@ -271,7 +271,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost_asio/examples/cpp17_examples.html b/doc/html/boost_asio/examples/cpp17_examples.html new file mode 100644 index 0000000000..8931038376 --- /dev/null +++ b/doc/html/boost_asio/examples/cpp17_examples.html @@ -0,0 +1,69 @@ + + + +C++17 Examples + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    + + Coroutines + TS Support +
    +

    + Examples showing how to implement a chain of asynchronous operations using + the Coroutines TS. +

    +
    +
    + + + +
    Copyright © 2003-2018 Christopher M. Kohlhoff

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost_asio/history.html b/doc/html/boost_asio/history.html index f9ee49ccea..b0cec7d95e 100644 --- a/doc/html/boost_asio/history.html +++ b/doc/html/boost_asio/history.html @@ -28,6 +28,130 @@

    + Asio + 1.12.1 / Boost 1.67 +

    +
      +
    • + Added missing const qualifier to basic_socket_acceptor::get_option. +
      • +
    • + Worked around a parsing error that occurs with some versions of gcc. +
      • +
    • + Fixed broken code samples in tutorial. +
      • +
    • + Added new experimental features. (Note that "experimental" features + may be changed without notice in subsequent releases.) +
        +
      • + Added experimental::detached completion token. +
        • +
      • + Added experimental::redirect_error completion token. +
        • +
      • + Added experimental::co_spawn facility for integration + with the coroutines technical specification. +
        • +
      +
      • +
    • + Updated timeout examples to use latest features. +
        +
      • + Used asio::steady_timer rather than asio::deadline_timer. +
        • +
      • + Used asio::dynamic_buffer rather than asio::streambuf. +
        • +
      • + Used timed asio::io_context::run_for() function for + blocking clients. +
        • +
      • + Added example showing a custom completion token for blocking with + timeouts. +
        • +
      +
      • +
    • + Fixed unit tests to compile when BOOST_ASIO_NO_DEPRECATED + is defined. +
      • +
    • + Changed socket iostreams to use chrono by default, to fix compatibility + with the Networking TS. Define BOOST_ASIO_USE_BOOST_DATE_TIME_FOR_SOCKET_IOSTREAM + to enable the old Boost.Date_Time interface in basic_socket_streambuf + and basic_socket_iostream. +
      • +
    • + Updated examples to use chrono rather than Boost.Date_Time. +
      • +
    • + Fixed an incorrect member function detector in the is_dynamic_buffer + trait. +
      • +
    • + Fixed an async_result incompatibility with deprecated handler_type. +
      • +
    • + Added a missing move optimisation in the SSL stream implementation. +
      • +
    • + Fixed incorrect basic_resolver_results::value_type typedef. +
      • +
    • + Fixed a compile error with some OpenSSL versions when SSL_OP_NO_COMPRESSION + is defined. +
      • +
    • + Changed add_certificate_authority to process multiple certificates + in a bundle. +
      • +
    • + Eliminated deprecation warning with MSVC by using std::invoke_result + rather than std::result_of. +
      • +
    • + Changed to use std::string_view for C++17 or later, and std::experimental::string_view + for C++14. Define the preprocessor macro BOOST_ASIO_DISABLE_STD_STRING_VIEW + to force the use of std::experimental::string_view (assuming it is available) + when compiling in C++17 mode. +
      • +
    • + Ensured DynamicBuffer template arguments are decayed before + using in enable_if tests. +
      • +
    • + Changed documentation to distinguish legacy completion handlers (which + are still required to be CopyConstructible) from new MoveConstructible + handlers. +
      • +
    • + Suppressed a discarded return value warning in the buffer debugging support. +
      • +
    • + Fixed basic_yield_context to work with completion signatures + containing reference parameters. +
      • +
    • + Ensured that stackful coroutines launched using spawn() correctly + store decayed copies of their function and handler arguments. +
      • +
    • + Fixed some compatibility issues with Android. +
      • +
    • + Added cross-compilation support to Jamfiles. +
      • +
    • + Fixed some minor portability issues in examples. +
      • +
    +

    + Asio 1.12.0 / Boost 1.66

    @@ -73,7 +197,7 @@

    - + Asio 1.10.10 / Boost 1.65

    @@ -110,7 +234,7 @@

    - + Asio 1.10.9 / Boost 1.64

    @@ -163,7 +287,7 @@

    - + Asio 1.10.8 / Boost 1.62

    @@ -198,7 +322,7 @@

    - + Asio 1.10.7 / Boost 1.60

    @@ -233,7 +357,7 @@

    - + Asio 1.10.6 / Boost 1.58

    @@ -313,7 +437,7 @@

    - + Asio 1.10.5 / Boost 1.57

    @@ -356,7 +480,7 @@

    - + Asio 1.10.4 / Boost 1.56

    @@ -378,7 +502,7 @@

    - + Asio 1.10.3

    @@ -413,7 +537,7 @@

    - + Asio 1.10.2

    @@ -486,7 +610,7 @@

    - + Asio 1.10.1 / Boost 1.55

    @@ -601,7 +725,7 @@

    - + Asio 1.10.0 / Boost 1.54

    @@ -751,7 +875,7 @@

    - + Asio 1.8.3 / Boost 1.53

    @@ -792,7 +916,7 @@

    - + Asio 1.8.2 / Boost 1.51

    @@ -834,7 +958,7 @@

    - + Asio 1.8.1 / Boost 1.50

    @@ -869,7 +993,7 @@

    - + Asio 1.8.0 / Boost 1.49

    @@ -916,7 +1040,7 @@

    - + Asio 1.6.1 / Boost 1.48

    @@ -1009,7 +1133,7 @@

    - + Asio 1.6.0 / Boost 1.47

    @@ -1240,7 +1364,7 @@

    - + Asio 1.4.9 / Boost 1.46.1

    @@ -1271,7 +1395,7 @@

    - + Asio 1.4.8 / Boost 1.46

    @@ -1287,7 +1411,7 @@

    - + Asio 1.4.7 / Boost 1.45

    @@ -1366,7 +1490,7 @@

    - + Asio 1.4.6 / Boost 1.44

    @@ -1434,7 +1558,7 @@

    - + Asio 1.4.5 / Boost 1.43

    @@ -1501,7 +1625,7 @@

    - + Asio 1.4.4 / Boost 1.42

    @@ -1562,7 +1686,7 @@

    - + Asio 1.4.3 / Boost 1.40

    @@ -1617,7 +1741,7 @@

    - + Asio 1.4.2 / Boost 1.39

    @@ -1670,7 +1794,7 @@

    - + Asio 1.4.1 / Boost 1.38

    @@ -1702,7 +1826,7 @@

    - + Asio 1.4.0 / Boost 1.37

    @@ -1737,7 +1861,7 @@

    - + Asio 1.2.0 / Boost 1.36

    @@ -1787,7 +1911,7 @@

    - + Asio 1.0.0 / Boost 1.35

    @@ -1797,7 +1921,7 @@ -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/index.html b/doc/html/boost_asio/index.html index fdd745d85c..c27e3e992a 100644 --- a/doc/html/boost_asio/index.html +++ b/doc/html/boost_asio/index.html @@ -25,125 +25,128 @@

    -Index

    +Index

    Symbols

    -
    ~bad_address_cast
    +
    ~awaitable
    +
    experimental::awaitable, experimental::awaitable::~awaitable +
    +
    ~bad_address_cast
    ip::bad_address_cast, ip::bad_address_cast::~bad_address_cast
    -
    ~basic_datagram_socket
    +
    ~basic_datagram_socket
    basic_datagram_socket, basic_datagram_socket::~basic_datagram_socket
    -
    ~basic_deadline_timer
    +
    ~basic_deadline_timer
    basic_deadline_timer, basic_deadline_timer::~basic_deadline_timer
    -
    ~basic_io_object
    +
    ~basic_io_object
    basic_io_object, basic_io_object::~basic_io_object
    -
    ~basic_raw_socket
    +
    ~basic_raw_socket
    basic_raw_socket, basic_raw_socket::~basic_raw_socket
    -
    ~basic_resolver
    +
    ~basic_resolver
    ip::basic_resolver, ip::basic_resolver::~basic_resolver
    -
    ~basic_seq_packet_socket
    +
    ~basic_seq_packet_socket
    basic_seq_packet_socket, basic_seq_packet_socket::~basic_seq_packet_socket
    -
    ~basic_socket
    +
    ~basic_socket
    basic_socket, basic_socket::~basic_socket
    -
    ~basic_socket_acceptor
    +
    ~basic_socket_acceptor
    basic_socket_acceptor, basic_socket_acceptor::~basic_socket_acceptor
    -
    ~basic_socket_streambuf
    +
    ~basic_socket_streambuf
    basic_socket_streambuf, basic_socket_streambuf::~basic_socket_streambuf
    -
    ~basic_stream_socket
    +
    ~basic_stream_socket
    basic_stream_socket, basic_stream_socket::~basic_stream_socket
    -
    ~basic_waitable_timer
    +
    ~basic_waitable_timer
    basic_waitable_timer, basic_waitable_timer::~basic_waitable_timer
    -
    ~context
    +
    ~context
    ssl::context, ssl::context::~context
    -
    ~context_base
    +
    ~context_base
    ssl::context_base, ssl::context_base::~context_base
    -
    ~descriptor
    +
    ~descriptor
    posix::descriptor, posix::descriptor::~descriptor
    -
    ~descriptor_base
    +
    ~descriptor_base
    posix::descriptor_base, posix::descriptor_base::~descriptor_base
    -
    ~execution_context
    +
    ~execution_context
    execution_context, execution_context::~execution_context
    -
    ~executor
    +
    ~executor
    executor, executor::~executor
    -
    ~executor_binder
    +
    ~executor_binder
    executor_binder, executor_binder::~executor_binder
    -
    ~executor_work_guard
    +
    ~executor_work_guard
    executor_work_guard, executor_work_guard::~executor_work_guard
    -
    ~io_context
    +
    ~io_context
    io_context, io_context::~io_context
    -
    ~overlapped_handle
    +
    ~overlapped_handle
    windows::overlapped_handle, windows::overlapped_handle::~overlapped_handle
    -
    ~overlapped_ptr
    +
    ~overlapped_ptr
    windows::overlapped_ptr, windows::overlapped_ptr::~overlapped_ptr
    -
    ~resolver_base
    +
    ~resolver_base
    ip::resolver_base, ip::resolver_base::~resolver_base
    -
    ~resolver_query_base
    +
    ~resolver_query_base
    ip::resolver_query_base, ip::resolver_query_base::~resolver_query_base
    -
    ~serial_port
    +
    ~serial_port
    serial_port, serial_port::~serial_port
    -
    ~serial_port_base
    +
    ~serial_port_base
    serial_port_base, serial_port_base::~serial_port_base
    -
    ~service
    +
    ~service
    execution_context::service, execution_context::service::~service
    io_context::service, io_context::service::~service
    -
    ~signal_set
    +
    ~signal_set
    signal_set, signal_set::~signal_set
    -
    ~socket_base
    +
    ~socket_base
    socket_base, socket_base::~socket_base
    -
    ~strand
    +
    ~strand
    io_context::strand, io_context::strand::~strand
    strand, strand::~strand
    -
    ~stream
    +
    ~stream
    ssl::stream, ssl::stream::~stream
    -
    ~stream_base
    +
    ~stream_base
    ssl::stream_base, ssl::stream_base::~stream_base
    -
    ~system_context
    +
    ~system_context
    system_context, system_context::~system_context
    -
    ~thread_pool
    +
    ~thread_pool
    thread_pool, thread_pool::~thread_pool
    -
    ~work
    +
    ~work
    io_context::work, io_context::work::~work
    @@ -151,20 +154,20 @@

    A

    -
    accept
    +
    accept
    basic_socket_acceptor, basic_socket_acceptor::accept
    -
    acceptor
    +
    acceptor
    ip::tcp, ip::tcp::acceptor
    local::stream_protocol, local::stream_protocol::acceptor
    -
    access_denied
    +
    access_denied
    error::basic_errors, error::basic_errors
    -
    add
    +
    add
    signal_set, signal_set::add
    @@ -173,7 +176,7 @@ boost::posix_time::ptime >::add
    -
    address
    +
    address
    ip::address, ip::address::address
    @@ -184,7 +187,7 @@
    ip::network_v6, ip::network_v6::address
    -
    address_configured
    +
    address_configured
    ip::basic_resolver, ip::basic_resolver::address_configured
    @@ -195,22 +198,22 @@
    ip::resolver_query_base, ip::resolver_query_base::address_configured
    -
    address_family_not_supported
    +
    address_family_not_supported
    error::basic_errors, error::basic_errors
    -
    address_in_use
    +
    address_in_use
    error::basic_errors, error::basic_errors
    -
    address_v4
    +
    address_v4
    ip::address_v4, ip::address_v4::address_v4
    -
    address_v6
    +
    address_v6
    ip::address_v6, ip::address_v6::address_v6
    -
    add_certificate_authority
    +
    add_certificate_authority
    ssl::context, ssl::context::add_certificate_authority
    -
    add_service, add_service +
    add_service, add_service
    execution_context, execution_context::add_service @@ -222,13 +225,13 @@
    thread_pool, thread_pool::add_service
    -
    add_verify_path
    +
    add_verify_path
    ssl::context, ssl::context::add_verify_path
    -
    allocator_type
    +
    allocator_type
    use_future_t, use_future_t::allocator_type
    -
    all_matching
    +
    all_matching
    ip::basic_resolver, ip::basic_resolver::all_matching
    @@ -239,41 +242,41 @@
    ip::resolver_query_base, ip::resolver_query_base::all_matching
    -
    already_connected
    +
    already_connected
    error::basic_errors, error::basic_errors
    -
    already_open
    +
    already_open
    error::misc_errors, error::misc_errors
    -
    already_started
    +
    already_started
    error::basic_errors, error::basic_errors
    -
    any
    +
    any
    ip::address_v4, ip::address_v4::any
    ip::address_v6, ip::address_v6::any
    -
    argument_type
    +
    argument_type
    executor_binder, executor_binder::argument_type
    -
    asio_handler_allocate, asio_handler_allocate +
    asio_handler_allocate, asio_handler_allocate
    -
    asio_handler_deallocate, asio_handler_deallocate +
    asio_handler_deallocate, asio_handler_deallocate
    -
    asio_handler_invoke, asio_handler_invoke +
    asio_handler_invoke, asio_handler_invoke
    -
    asio_handler_is_continuation, asio_handler_is_continuation +
    asio_handler_is_continuation, asio_handler_is_continuation
    -
    asn1
    +
    asn1
    ssl::context, ssl::context::file_format
    ssl::context_base, ssl::context_base::file_format
    -
    assign
    +
    assign
    basic_datagram_socket, basic_datagram_socket::assign
    @@ -302,13 +305,13 @@
    windows::stream_handle, windows::stream_handle::assign
    -
    async_accept
    +
    async_accept
    basic_socket_acceptor, basic_socket_acceptor::async_accept
    -
    async_completion
    +
    async_completion
    async_completion, async_completion::async_completion
    -
    async_connect, async_connect +
    async_connect, async_connect
    basic_datagram_socket, basic_datagram_socket::async_connect @@ -322,28 +325,28 @@
    basic_stream_socket, basic_stream_socket::async_connect
    -
    async_fill
    +
    async_fill
    buffered_read_stream, buffered_read_stream::async_fill
    buffered_stream, buffered_stream::async_fill
    -
    async_flush
    +
    async_flush
    buffered_stream, buffered_stream::async_flush
    buffered_write_stream, buffered_write_stream::async_flush
    -
    async_handshake
    +
    async_handshake
    ssl::stream, ssl::stream::async_handshake
    -
    async_read, async_read +
    async_read, async_read
    -
    async_read_at, async_read_at +
    async_read_at, async_read_at
    -
    async_read_some
    +
    async_read_some
    basic_stream_socket, basic_stream_socket::async_read_some
    @@ -362,12 +365,12 @@
    windows::stream_handle, windows::stream_handle::async_read_some
    -
    async_read_some_at
    +
    async_read_some_at
    windows::random_access_handle, windows::random_access_handle::async_read_some_at
    -
    async_read_until, async_read_until +
    async_read_until, async_read_until
    -
    async_receive
    +
    async_receive
    basic_datagram_socket, basic_datagram_socket::async_receive
    @@ -378,17 +381,17 @@
    basic_stream_socket, basic_stream_socket::async_receive
    -
    async_receive_from
    +
    async_receive_from
    basic_datagram_socket, basic_datagram_socket::async_receive_from
    basic_raw_socket, basic_raw_socket::async_receive_from
    -
    async_resolve
    +
    async_resolve
    ip::basic_resolver, ip::basic_resolver::async_resolve
    -
    async_result
    +
    async_result
    async_result, async_result::async_result
    @@ -401,7 +404,7 @@ std::packaged_task< Result(Args...)>, Signature >::async_result
    -
    async_send
    +
    async_send
    basic_datagram_socket, basic_datagram_socket::async_send
    @@ -412,17 +415,17 @@
    basic_stream_socket, basic_stream_socket::async_send
    -
    async_send_to
    +
    async_send_to
    basic_datagram_socket, basic_datagram_socket::async_send_to
    basic_raw_socket, basic_raw_socket::async_send_to
    -
    async_shutdown
    +
    async_shutdown
    ssl::stream, ssl::stream::async_shutdown
    -
    async_wait
    +
    async_wait
    basic_datagram_socket, basic_datagram_socket::async_wait
    @@ -449,11 +452,11 @@
    windows::object_handle, windows::object_handle::async_wait
    -
    async_write, async_write +
    async_write, async_write
    -
    async_write_at, async_write_at +
    async_write_at, async_write_at
    -
    async_write_some
    +
    async_write_some
    basic_stream_socket, basic_stream_socket::async_write_some
    @@ -472,10 +475,10 @@
    windows::stream_handle, windows::stream_handle::async_write_some
    -
    async_write_some_at
    +
    async_write_some_at
    windows::random_access_handle, windows::random_access_handle::async_write_some_at
    -
    at_mark
    +
    at_mark
    basic_datagram_socket, basic_datagram_socket::at_mark
    @@ -488,7 +491,7 @@
    basic_stream_socket, basic_stream_socket::at_mark
    -
    available
    +
    available
    basic_datagram_socket, basic_datagram_socket::available
    @@ -501,21 +504,27 @@
    basic_stream_socket, basic_stream_socket::available
    +
    awaitable
    +
    experimental::awaitable, experimental::awaitable::awaitable +
    +
    await_token
    +
    experimental::await_token, experimental::await_token::await_token +

    B

    -
    bad_address_cast
    +
    bad_address_cast
    ip::bad_address_cast, ip::bad_address_cast::bad_address_cast
    -
    bad_descriptor
    +
    bad_descriptor
    error::basic_errors, error::basic_errors
    -
    bad_executor
    +
    bad_executor
    bad_executor, bad_executor::bad_executor
    -
    basic_address_iterator
    +
    basic_address_iterator
    ip::basic_address_iterator< address_v4 >, ip::basic_address_iterator< @@ -526,7 +535,7 @@ address_v6 >::basic_address_iterator
    -
    basic_address_range
    +
    basic_address_range
    ip::basic_address_range< address_v4 >, ip::basic_address_range< @@ -537,13 +546,13 @@ address_v6 >::basic_address_range
    -
    basic_datagram_socket
    +
    basic_datagram_socket
    basic_datagram_socket, basic_datagram_socket::basic_datagram_socket
    -
    basic_deadline_timer
    +
    basic_deadline_timer
    basic_deadline_timer, basic_deadline_timer::basic_deadline_timer
    -
    basic_endpoint
    +
    basic_endpoint
    generic::basic_endpoint, generic::basic_endpoint::basic_endpoint
    @@ -552,61 +561,61 @@
    local::basic_endpoint, local::basic_endpoint::basic_endpoint
    -
    basic_io_object
    +
    basic_io_object
    basic_io_object, basic_io_object::basic_io_object
    -
    basic_raw_socket
    +
    basic_raw_socket
    basic_raw_socket, basic_raw_socket::basic_raw_socket
    -
    basic_resolver
    +
    basic_resolver
    ip::basic_resolver, ip::basic_resolver::basic_resolver
    -
    basic_resolver_entry
    +
    basic_resolver_entry
    ip::basic_resolver_entry, ip::basic_resolver_entry::basic_resolver_entry
    -
    basic_resolver_iterator
    +
    basic_resolver_iterator
    ip::basic_resolver_iterator, ip::basic_resolver_iterator::basic_resolver_iterator
    -
    basic_resolver_query
    +
    basic_resolver_query
    ip::basic_resolver_query, ip::basic_resolver_query::basic_resolver_query
    -
    basic_resolver_results
    +
    basic_resolver_results
    ip::basic_resolver_results, ip::basic_resolver_results::basic_resolver_results
    -
    basic_seq_packet_socket
    +
    basic_seq_packet_socket
    basic_seq_packet_socket, basic_seq_packet_socket::basic_seq_packet_socket
    -
    basic_socket
    +
    basic_socket
    basic_socket, basic_socket::basic_socket
    -
    basic_socket_acceptor
    +
    basic_socket_acceptor
    basic_socket_acceptor, basic_socket_acceptor::basic_socket_acceptor
    -
    basic_socket_iostream
    +
    basic_socket_iostream
    basic_socket_iostream, basic_socket_iostream::basic_socket_iostream
    -
    basic_socket_streambuf
    +
    basic_socket_streambuf
    basic_socket_streambuf, basic_socket_streambuf::basic_socket_streambuf
    -
    basic_streambuf
    +
    basic_streambuf
    basic_streambuf, basic_streambuf::basic_streambuf
    -
    basic_streambuf_ref
    +
    basic_streambuf_ref
    basic_streambuf_ref, basic_streambuf_ref::basic_streambuf_ref
    -
    basic_stream_socket
    +
    basic_stream_socket
    basic_stream_socket, basic_stream_socket::basic_stream_socket
    -
    basic_waitable_timer
    +
    basic_waitable_timer
    basic_waitable_timer, basic_waitable_timer::basic_waitable_timer
    -
    basic_yield_context
    +
    basic_yield_context
    basic_yield_context, basic_yield_context::basic_yield_context
    -
    baud_rate
    +
    baud_rate
    serial_port_base::baud_rate, serial_port_base::baud_rate::baud_rate
    -
    begin
    +
    begin
    buffers_iterator, buffers_iterator::begin
    @@ -627,7 +636,7 @@
    null_buffers, null_buffers::begin
    -
    bind
    +
    bind
    basic_datagram_socket, basic_datagram_socket::bind
    @@ -642,9 +651,9 @@
    basic_stream_socket, basic_stream_socket::bind
    -
    bind_executor, bind_executor +
    bind_executor, bind_executor
    -
    broadcast
    +
    broadcast
    basic_datagram_socket, basic_datagram_socket::broadcast
    @@ -665,38 +674,38 @@
    socket_base, socket_base::broadcast
    -
    broken_pipe
    +
    broken_pipe
    error::basic_errors, error::basic_errors
    -
    buffer, buffer +
    buffer, buffer
    -
    buffered_read_stream
    +
    buffered_read_stream
    buffered_read_stream, buffered_read_stream::buffered_read_stream
    -
    buffered_stream
    +
    buffered_stream
    buffered_stream, buffered_stream::buffered_stream
    -
    buffered_write_stream
    +
    buffered_write_stream
    buffered_write_stream, buffered_write_stream::buffered_write_stream
    -
    buffers_begin, buffers_begin +
    buffers_begin, buffers_begin
    -
    buffers_end, buffers_end +
    buffers_end, buffers_end
    -
    buffers_iterator
    +
    buffers_iterator
    buffers_iterator, buffers_iterator::buffers_iterator
    -
    buffer_cast, buffer_cast +
    buffer_cast, buffer_cast
    -
    buffer_copy, buffer_copy +
    buffer_copy, buffer_copy
    -
    buffer_sequence_begin, buffer_sequence_begin +
    buffer_sequence_begin, buffer_sequence_begin
    -
    buffer_sequence_end, buffer_sequence_end +
    buffer_sequence_end, buffer_sequence_end
    -
    buffer_size, buffer_size +
    buffer_size, buffer_size
    -
    bytes_readable
    +
    bytes_readable
    basic_datagram_socket, basic_datagram_socket::bytes_readable
    @@ -719,7 +728,7 @@
    socket_base, socket_base::bytes_readable
    -
    bytes_type
    +
    bytes_type
    ip::address_v4, ip::address_v4::bytes_type
    @@ -731,13 +740,13 @@

    C

    -
    callee_type
    +
    callee_type
    basic_yield_context, basic_yield_context::callee_type
    -
    caller_type
    +
    caller_type
    basic_yield_context, basic_yield_context::caller_type
    -
    cancel
    +
    cancel
    basic_datagram_socket, basic_datagram_socket::cancel
    @@ -774,21 +783,21 @@
    windows::stream_handle, windows::stream_handle::cancel
    -
    cancel_one
    +
    cancel_one
    basic_deadline_timer, basic_deadline_timer::cancel_one
    basic_waitable_timer, basic_waitable_timer::cancel_one
    -
    canonical
    +
    canonical
    ip::network_v4, ip::network_v4::canonical
    ip::network_v6, ip::network_v6::canonical
    -
    canonical_name
    +
    canonical_name
    ip::basic_resolver, ip::basic_resolver::canonical_name
    @@ -799,7 +808,7 @@
    ip::resolver_query_base, ip::resolver_query_base::canonical_name
    -
    capacity
    +
    capacity
    basic_streambuf, basic_streambuf::capacity
    @@ -816,29 +825,29 @@
    local::basic_endpoint, local::basic_endpoint::capacity
    -
    cbegin
    +
    cbegin
    ip::basic_resolver_results, ip::basic_resolver_results::cbegin
    -
    cend
    +
    cend
    ip::basic_resolver_results, ip::basic_resolver_results::cend
    -
    character_size
    +
    character_size
    serial_port_base::character_size, serial_port_base::character_size::character_size
    -
    clear
    +
    clear
    signal_set, signal_set::clear
    -
    clear_options
    +
    clear_options
    ssl::context, ssl::context::clear_options
    -
    client
    +
    client
    ssl::stream, ssl::stream::handshake_type
    ssl::stream_base, ssl::stream_base::handshake_type
    -
    clock_type
    +
    clock_type
    basic_socket_iostream, basic_socket_iostream::clock_type
    @@ -847,7 +856,7 @@
    basic_waitable_timer, basic_waitable_timer::clock_type
    -
    close
    +
    close
    basic_datagram_socket, basic_datagram_socket::close
    @@ -886,7 +895,7 @@
    windows::stream_handle, windows::stream_handle::close
    -
    commit
    +
    commit
    basic_streambuf, basic_streambuf::commit
    @@ -897,13 +906,13 @@
    dynamic_vector_buffer, dynamic_vector_buffer::commit
    -
    complete
    +
    complete
    windows::overlapped_ptr, windows::overlapped_ptr::complete
    -
    completion_handler
    +
    completion_handler
    async_completion, async_completion::completion_handler
    -
    completion_handler_type
    +
    completion_handler_type
    async_completion, async_completion::completion_handler_type
    @@ -914,7 +923,7 @@ std::packaged_task< Result(Args...)>, Signature >::completion_handler_type
    -
    connect, connect +
    connect, connect
    basic_datagram_socket, basic_datagram_socket::connect @@ -932,22 +941,22 @@
    basic_stream_socket, basic_stream_socket::connect
    -
    connection_aborted
    +
    connection_aborted
    error::basic_errors, error::basic_errors
    -
    connection_refused
    +
    connection_refused
    error::basic_errors, error::basic_errors
    -
    connection_reset
    +
    connection_reset
    error::basic_errors, error::basic_errors
    -
    const_buffer
    +
    const_buffer
    const_buffer, const_buffer::const_buffer
    -
    const_buffers_1
    +
    const_buffers_1
    const_buffers_1, const_buffers_1::const_buffers_1
    -
    const_buffers_type
    +
    const_buffers_type
    basic_streambuf, basic_streambuf::const_buffers_type
    @@ -958,7 +967,7 @@
    dynamic_vector_buffer, dynamic_vector_buffer::const_buffers_type
    -
    const_iterator
    +
    const_iterator
    const_buffers_1, const_buffers_1::const_iterator
    @@ -969,10 +978,10 @@
    null_buffers, null_buffers::const_iterator
    -
    const_reference
    +
    const_reference
    ip::basic_resolver_results, ip::basic_resolver_results::const_reference
    -
    consume
    +
    consume
    basic_streambuf, basic_streambuf::consume
    @@ -983,7 +992,7 @@
    dynamic_vector_buffer, dynamic_vector_buffer::consume
    -
    context
    +
    context
    execution_context::service, execution_context::service::context
    @@ -1002,10 +1011,10 @@
    thread_pool::executor_type, thread_pool::executor_type::context
    -
    coroutine
    +
    coroutine
    coroutine, coroutine::coroutine
    -
    count_type
    +
    count_type
    io_context, io_context::count_type
    @@ -1013,7 +1022,7 @@

    D

    -
    data
    +
    data
    basic_streambuf, basic_streambuf::data
    @@ -1038,10 +1047,10 @@
    mutable_buffers_1, mutable_buffers_1::data
    -
    datagram_protocol
    +
    datagram_protocol
    generic::datagram_protocol, generic::datagram_protocol::datagram_protocol
    -
    data_type
    +
    data_type
    generic::basic_endpoint, generic::basic_endpoint::data_type
    @@ -1050,9 +1059,9 @@
    local::basic_endpoint, local::basic_endpoint::data_type
    -
    deadline_timer, deadline_timer +
    deadline_timer, deadline_timer
    -
    debug
    +
    debug
    basic_datagram_socket, basic_datagram_socket::debug
    @@ -1069,21 +1078,21 @@
    socket_base, socket_base::debug
    -
    default_buffer_size
    +
    default_buffer_size
    buffered_read_stream, buffered_read_stream::default_buffer_size
    buffered_write_stream, buffered_write_stream::default_buffer_size
    -
    default_workarounds
    +
    default_workarounds
    ssl::context, ssl::context::default_workarounds
    ssl::context_base, ssl::context_base::default_workarounds
    -
    defer, defer +
    defer, defer
    executor, executor::defer @@ -1099,17 +1108,17 @@
    thread_pool::executor_type, thread_pool::executor_type::defer
    -
    dereference
    +
    dereference
    ip::basic_resolver_iterator, ip::basic_resolver_iterator::dereference
    ip::basic_resolver_results, ip::basic_resolver_results::dereference
    -
    descriptor
    +
    descriptor
    posix::descriptor, posix::descriptor::descriptor
    -
    destroy
    +
    destroy
    execution_context, execution_context::destroy
    @@ -1120,7 +1129,10 @@
    thread_pool, thread_pool::destroy
    -
    difference_type
    +
    detached_t
    +
    experimental::detached_t, experimental::detached_t::detached_t +
    +
    difference_type
    buffers_iterator, buffers_iterator::difference_type
    @@ -1137,7 +1149,7 @@
    ip::basic_resolver_results, ip::basic_resolver_results::difference_type
    -
    dispatch, dispatch +
    dispatch, dispatch
    executor, executor::dispatch @@ -1155,7 +1167,7 @@
    thread_pool::executor_type, thread_pool::executor_type::dispatch
    -
    do_not_route
    +
    do_not_route
    basic_datagram_socket, basic_datagram_socket::do_not_route
    @@ -1172,7 +1184,7 @@
    socket_base, socket_base::do_not_route
    -
    duration
    +
    duration
    basic_socket_iostream, basic_socket_iostream::duration
    @@ -1181,7 +1193,7 @@
    basic_waitable_timer, basic_waitable_timer::duration
    -
    duration_type
    +
    duration_type
    basic_deadline_timer, basic_deadline_timer::duration_type
    @@ -1194,12 +1206,12 @@ boost::posix_time::ptime >::duration_type
    -
    dynamic_buffer, dynamic_buffer +
    dynamic_buffer, dynamic_buffer
    -
    dynamic_string_buffer
    +
    dynamic_string_buffer
    dynamic_string_buffer, dynamic_string_buffer::dynamic_string_buffer
    -
    dynamic_vector_buffer
    +
    dynamic_vector_buffer
    dynamic_vector_buffer, dynamic_vector_buffer::dynamic_vector_buffer
    @@ -1207,7 +1219,10 @@

    E

    -
    empty
    +
    ec_
    +
    experimental::redirect_error_t, experimental::redirect_error_t::ec_ +
    +
    empty
    ip::basic_address_range< address_v4 >, ip::basic_address_range< @@ -1220,7 +1235,7 @@
    ip::basic_resolver_results, ip::basic_resolver_results::empty
    -
    enable_connection_aborted
    +
    enable_connection_aborted
    basic_datagram_socket, basic_datagram_socket::enable_connection_aborted
    @@ -1237,7 +1252,7 @@
    socket_base, socket_base::enable_connection_aborted
    -
    end
    +
    end
    buffers_iterator, buffers_iterator::end
    @@ -1258,7 +1273,7 @@
    null_buffers, null_buffers::end
    -
    endpoint
    +
    endpoint
    generic::datagram_protocol, generic::datagram_protocol::endpoint
    @@ -1281,7 +1296,7 @@
    local::stream_protocol, local::stream_protocol::endpoint
    -
    endpoint_type
    +
    endpoint_type
    basic_datagram_socket, basic_datagram_socket::endpoint_type
    @@ -1306,73 +1321,73 @@
    ip::basic_resolver_results, ip::basic_resolver_results::endpoint_type
    -
    eof
    +
    eof
    error::misc_errors, error::misc_errors
    -
    equal
    +
    equal
    ip::basic_resolver_iterator, ip::basic_resolver_iterator::equal
    ip::basic_resolver_results, ip::basic_resolver_results::equal
    -
    error
    +
    error
    basic_socket_iostream, basic_socket_iostream::error
    basic_socket_streambuf, basic_socket_streambuf::error
    -
    error::addrinfo_category, error::addrinfo_category +
    error::addrinfo_category, error::addrinfo_category
    -
    error::addrinfo_errors, error::addrinfo_errors +
    error::addrinfo_errors, error::addrinfo_errors
    -
    error::basic_errors, error::basic_errors +
    error::basic_errors, error::basic_errors
    -
    error::get_addrinfo_category, error::get_addrinfo_category +
    error::get_addrinfo_category, error::get_addrinfo_category
    -
    error::get_misc_category, error::get_misc_category +
    error::get_misc_category, error::get_misc_category
    -
    error::get_netdb_category, error::get_netdb_category +
    error::get_netdb_category, error::get_netdb_category
    -
    error::get_ssl_category, error::get_ssl_category +
    error::get_ssl_category, error::get_ssl_category
    -
    error::get_system_category, error::get_system_category +
    error::get_system_category, error::get_system_category
    -
    error::make_error_code, error::make_error_code +
    error::make_error_code, error::make_error_code
    -
    error::misc_category, error::misc_category +
    error::misc_category, error::misc_category
    -
    error::misc_errors, error::misc_errors +
    error::misc_errors, error::misc_errors
    -
    error::netdb_category, error::netdb_category +
    error::netdb_category, error::netdb_category
    -
    error::netdb_errors, error::netdb_errors +
    error::netdb_errors, error::netdb_errors
    -
    error::ssl_category, error::ssl_category +
    error::ssl_category, error::ssl_category
    -
    error::ssl_errors, error::ssl_errors +
    error::ssl_errors, error::ssl_errors
    -
    error::system_category, error::system_category +
    error::system_category, error::system_category
    -
    even
    +
    even
    serial_port_base::parity, serial_port_base::parity::type
    -
    execution_context
    +
    execution_context
    execution_context, execution_context::execution_context
    -
    executor
    +
    executor
    executor, executor::executor
    -
    executor_arg, executor_arg +
    executor_arg, executor_arg
    -
    executor_arg_t
    +
    executor_arg_t
    executor_arg_t, executor_arg_t::executor_arg_t
    -
    executor_binder
    +
    executor_binder
    executor_binder, executor_binder::executor_binder
    -
    executor_type
    +
    executor_type
    basic_datagram_socket, basic_datagram_socket::executor_type
    @@ -1402,6 +1417,10 @@
    executor_work_guard, executor_work_guard::executor_type
    +
    experimental::awaitable, experimental::awaitable::executor_type +
    +
    experimental::await_token, experimental::await_token::executor_type +
    ip::basic_resolver, ip::basic_resolver::executor_type
    posix::descriptor, posix::descriptor::executor_type @@ -1425,10 +1444,20 @@
    windows::stream_handle, windows::stream_handle::executor_type
    -
    executor_work_guard
    +
    executor_work_guard
    executor_work_guard, executor_work_guard::executor_work_guard
    -
    expires_after
    +
    experimental::co_spawn, experimental::co_spawn +
    +
    experimental::detached, experimental::detached +
    +
    experimental::redirect_error, experimental::redirect_error +
    +
    experimental::this_coro::executor, experimental::this_coro::executor +
    +
    experimental::this_coro::token, experimental::this_coro::token +
    +
    expires_after
    basic_socket_iostream, basic_socket_iostream::expires_after
    @@ -1437,7 +1466,7 @@
    basic_waitable_timer, basic_waitable_timer::expires_after
    -
    expires_at
    +
    expires_at
    basic_deadline_timer, basic_deadline_timer::expires_at
    @@ -1448,7 +1477,7 @@
    basic_waitable_timer, basic_waitable_timer::expires_at
    -
    expires_from_now
    +
    expires_from_now
    basic_deadline_timer, basic_deadline_timer::expires_from_now
    @@ -1459,7 +1488,7 @@
    basic_waitable_timer, basic_waitable_timer::expires_from_now
    -
    expiry
    +
    expiry
    basic_socket_iostream, basic_socket_iostream::expiry
    @@ -1473,7 +1502,7 @@

    F

    -
    family
    +
    family
    generic::datagram_protocol, generic::datagram_protocol::family
    @@ -1494,27 +1523,27 @@
    local::stream_protocol, local::stream_protocol::family
    -
    fault
    +
    fault
    error::basic_errors, error::basic_errors
    -
    fd_set_failure
    +
    fd_set_failure
    error::misc_errors, error::misc_errors
    -
    file_format
    +
    file_format
    ssl::context, ssl::context::file_format
    ssl::context_base, ssl::context_base::file_format
    -
    fill
    +
    fill
    buffered_read_stream, buffered_read_stream::fill
    buffered_stream, buffered_stream::fill
    -
    find
    +
    find
    ip::basic_address_range< address_v4 >, ip::basic_address_range< @@ -1525,10 +1554,10 @@ address_v6 >::find
    -
    first_argument_type
    +
    first_argument_type
    executor_binder, executor_binder::first_argument_type
    -
    flags
    +
    flags
    ip::basic_resolver, ip::basic_resolver::flags
    @@ -1539,17 +1568,17 @@
    ip::resolver_query_base, ip::resolver_query_base::flags
    -
    flow_control
    +
    flow_control
    serial_port_base::flow_control, serial_port_base::flow_control::flow_control
    -
    flush
    +
    flush
    buffered_stream, buffered_stream::flush
    buffered_write_stream, buffered_write_stream::flush
    -
    fork_child
    +
    fork_child
    execution_context, execution_context::fork_event
    @@ -1560,7 +1589,7 @@
    thread_pool, thread_pool::fork_event
    -
    fork_event
    +
    fork_event
    execution_context, execution_context::fork_event
    @@ -1571,7 +1600,7 @@
    thread_pool, thread_pool::fork_event
    -
    fork_parent
    +
    fork_parent
    execution_context, execution_context::fork_event
    @@ -1582,7 +1611,7 @@
    thread_pool, thread_pool::fork_event
    -
    fork_prepare
    +
    fork_prepare
    execution_context, execution_context::fork_event
    @@ -1593,21 +1622,21 @@
    thread_pool, thread_pool::fork_event
    -
    for_reading
    +
    for_reading
    ssl::context, ssl::context::password_purpose
    ssl::context_base, ssl::context_base::password_purpose
    -
    for_writing
    +
    for_writing
    ssl::context, ssl::context::password_purpose
    ssl::context_base, ssl::context_base::password_purpose
    -
    from_string
    +
    from_string
    ip::address, ip::address::from_string
    @@ -1621,7 +1650,7 @@

    G

    -
    get
    +
    get
    associated_allocator, associated_allocator::get
    @@ -1642,14 +1671,14 @@
    windows::overlapped_ptr, windows::overlapped_ptr::get
    -
    get_allocator
    +
    get_allocator
    use_future_t, use_future_t::get_allocator
    -
    get_associated_allocator, get_associated_allocator +
    get_associated_allocator, get_associated_allocator
    -
    get_associated_executor, get_associated_executor +
    get_associated_executor, get_associated_executor
    -
    get_executor
    +
    get_executor
    basic_datagram_socket, basic_datagram_socket::get_executor
    @@ -1679,6 +1708,8 @@
    executor_work_guard, executor_work_guard::get_executor
    +
    experimental::await_token, experimental::await_token::get_executor +
    io_context, io_context::get_executor
    ip::basic_resolver, ip::basic_resolver::get_executor @@ -1706,13 +1737,13 @@
    windows::stream_handle, windows::stream_handle::get_executor
    -
    get_implementation
    +
    get_implementation
    basic_io_object, basic_io_object::get_implementation
    -
    get_inner_executor
    +
    get_inner_executor
    strand, strand::get_inner_executor
    -
    get_io_context
    +
    get_io_context
    basic_datagram_socket, basic_datagram_socket::get_io_context
    @@ -1765,7 +1796,7 @@
    windows::stream_handle, windows::stream_handle::get_io_context
    -
    get_io_service
    +
    get_io_service
    basic_datagram_socket, basic_datagram_socket::get_io_service
    @@ -1818,7 +1849,7 @@
    windows::stream_handle, windows::stream_handle::get_io_service
    -
    get_option
    +
    get_option
    basic_datagram_socket, basic_datagram_socket::get_option
    @@ -1835,7 +1866,7 @@
    serial_port, serial_port::get_option
    -
    get_service
    +
    get_service
    basic_io_object, basic_io_object::get_service
    @@ -1843,20 +1874,20 @@

    H

    -
    handshake
    +
    handshake
    ssl::stream, ssl::stream::handshake
    -
    handshake_type
    +
    handshake_type
    ssl::stream, ssl::stream::handshake_type
    ssl::stream_base, ssl::stream_base::handshake_type
    -
    hardware
    +
    hardware
    serial_port_base::flow_control, serial_port_base::flow_control::type
    -
    has_service, has_service +
    has_service, has_service
    execution_context, execution_context::has_service @@ -1868,32 +1899,32 @@
    thread_pool, thread_pool::has_service
    -
    high_resolution_timer, high_resolution_timer +
    high_resolution_timer, high_resolution_timer
    -
    hints
    +
    hints
    ip::basic_resolver_query, ip::basic_resolver_query::hints
    -
    hosts
    +
    hosts
    ip::network_v4, ip::network_v4::hosts
    ip::network_v6, ip::network_v6::hosts
    -
    host_name
    +
    host_name
    ip::basic_resolver_entry, ip::basic_resolver_entry::host_name
    ip::basic_resolver_query, ip::basic_resolver_query::host_name
    -
    host_not_found
    +
    host_not_found
    error::netdb_errors, error::netdb_errors
    -
    host_not_found_try_again
    +
    host_not_found_try_again
    error::netdb_errors, error::netdb_errors
    -
    host_unreachable
    +
    host_unreachable
    error::basic_errors, error::basic_errors
    @@ -1901,39 +1932,39 @@

    I

    -
    id
    +
    id
    execution_context::id, execution_context::id::id
    -
    implementation_type
    +
    implementation_type
    basic_io_object, basic_io_object::implementation_type
    -
    increment
    +
    increment
    ip::basic_resolver_iterator, ip::basic_resolver_iterator::increment
    ip::basic_resolver_results, ip::basic_resolver_results::increment
    -
    index_
    +
    index_
    ip::basic_resolver_iterator, ip::basic_resolver_iterator::index_
    ip::basic_resolver_results, ip::basic_resolver_results::index_
    -
    inner_executor_type
    +
    inner_executor_type
    strand, strand::inner_executor_type
    -
    interrupted
    +
    interrupted
    error::basic_errors, error::basic_errors
    -
    invalid_argument
    +
    invalid_argument
    error::basic_errors, error::basic_errors
    -
    invalid_service_owner
    +
    invalid_service_owner
    invalid_service_owner, invalid_service_owner::invalid_service_owner
    -
    in_avail
    +
    in_avail
    buffered_read_stream, buffered_read_stream::in_avail
    @@ -1942,10 +1973,10 @@
    buffered_write_stream, buffered_write_stream::in_avail
    -
    in_progress
    +
    in_progress
    error::basic_errors, error::basic_errors
    -
    iostream
    +
    iostream
    generic::stream_protocol, generic::stream_protocol::iostream
    @@ -1954,10 +1985,10 @@
    local::stream_protocol, local::stream_protocol::iostream
    -
    io_context
    +
    io_context
    io_context, io_context::io_context
    -
    io_control
    +
    io_control
    basic_datagram_socket, basic_datagram_socket::io_control
    @@ -1976,60 +2007,60 @@
    posix::stream_descriptor, posix::stream_descriptor::io_control
    -
    io_service, io_service +
    io_service, io_service
    -
    ip::address_v4_iterator, ip::address_v4_iterator +
    ip::address_v4_iterator, ip::address_v4_iterator
    -
    ip::address_v4_range, ip::address_v4_range +
    ip::address_v4_range, ip::address_v4_range
    -
    ip::address_v6_iterator, ip::address_v6_iterator +
    ip::address_v6_iterator, ip::address_v6_iterator
    -
    ip::address_v6_range, ip::address_v6_range +
    ip::address_v6_range, ip::address_v6_range
    -
    ip::host_name, ip::host_name +
    ip::host_name, ip::host_name
    -
    ip::multicast::enable_loopback, ip::multicast::enable_loopback +
    ip::multicast::enable_loopback, ip::multicast::enable_loopback
    -
    ip::multicast::hops, ip::multicast::hops +
    ip::multicast::hops, ip::multicast::hops
    -
    ip::multicast::join_group, ip::multicast::join_group +
    ip::multicast::join_group, ip::multicast::join_group
    -
    ip::multicast::leave_group, ip::multicast::leave_group +
    ip::multicast::leave_group, ip::multicast::leave_group
    -
    ip::multicast::outbound_interface, ip::multicast::outbound_interface +
    ip::multicast::outbound_interface, ip::multicast::outbound_interface
    -
    ip::unicast::hops, ip::unicast::hops +
    ip::unicast::hops, ip::unicast::hops
    -
    ip::v4_mapped_t, ip::v4_mapped_t +
    ip::v4_mapped_t, ip::v4_mapped_t
    -
    ip::v6_only, ip::v6_only +
    ip::v6_only, ip::v6_only
    -
    is_child
    +
    is_child
    coroutine, coroutine::is_child
    -
    is_class_a
    +
    is_class_a
    ip::address_v4, ip::address_v4::is_class_a
    -
    is_class_b
    +
    is_class_b
    ip::address_v4, ip::address_v4::is_class_b
    -
    is_class_c
    +
    is_class_c
    ip::address_v4, ip::address_v4::is_class_c
    -
    is_complete
    +
    is_complete
    coroutine, coroutine::is_complete
    -
    is_host
    +
    is_host
    ip::network_v4, ip::network_v4::is_host
    ip::network_v6, ip::network_v6::is_host
    -
    is_link_local
    +
    is_link_local
    ip::address_v6, ip::address_v6::is_link_local
    -
    is_loopback
    +
    is_loopback
    ip::address, ip::address::is_loopback
    @@ -2038,7 +2069,7 @@
    ip::address_v6, ip::address_v6::is_loopback
    -
    is_multicast
    +
    is_multicast
    ip::address, ip::address::is_multicast
    @@ -2047,22 +2078,22 @@
    ip::address_v6, ip::address_v6::is_multicast
    -
    is_multicast_global
    +
    is_multicast_global
    ip::address_v6, ip::address_v6::is_multicast_global
    -
    is_multicast_link_local
    +
    is_multicast_link_local
    ip::address_v6, ip::address_v6::is_multicast_link_local
    -
    is_multicast_node_local
    +
    is_multicast_node_local
    ip::address_v6, ip::address_v6::is_multicast_node_local
    -
    is_multicast_org_local
    +
    is_multicast_org_local
    ip::address_v6, ip::address_v6::is_multicast_org_local
    -
    is_multicast_site_local
    +
    is_multicast_site_local
    ip::address_v6, ip::address_v6::is_multicast_site_local
    -
    is_open
    +
    is_open
    basic_datagram_socket, basic_datagram_socket::is_open
    @@ -2091,20 +2122,20 @@
    windows::stream_handle, windows::stream_handle::is_open
    -
    is_parent
    +
    is_parent
    coroutine, coroutine::is_parent
    -
    is_site_local
    +
    is_site_local
    ip::address_v6, ip::address_v6::is_site_local
    -
    is_subnet_of
    +
    is_subnet_of
    ip::network_v4, ip::network_v4::is_subnet_of
    ip::network_v6, ip::network_v6::is_subnet_of
    -
    is_unspecified
    +
    is_unspecified
    ip::address, ip::address::is_unspecified
    @@ -2113,19 +2144,19 @@
    ip::address_v6, ip::address_v6::is_unspecified
    -
    is_v4
    +
    is_v4
    ip::address, ip::address::is_v4
    -
    is_v4_compatible
    +
    is_v4_compatible
    ip::address_v6, ip::address_v6::is_v4_compatible
    -
    is_v4_mapped
    +
    is_v4_mapped
    ip::address_v6, ip::address_v6::is_v4_mapped
    -
    is_v6
    +
    is_v6
    ip::address, ip::address::is_v6
    -
    iterator
    +
    iterator
    ip::basic_address_range< address_v4 >, ip::basic_address_range< @@ -2140,7 +2171,7 @@
    ip::basic_resolver_results, ip::basic_resolver_results::iterator
    -
    iterator_category
    +
    iterator_category
    buffers_iterator, buffers_iterator::iterator_category
    @@ -2162,7 +2193,7 @@

    J

    -
    join
    +
    join
    system_context, system_context::join
    @@ -2174,7 +2205,7 @@

    K

    -
    keep_alive
    +
    keep_alive
    basic_datagram_socket, basic_datagram_socket::keep_alive
    @@ -2196,12 +2227,12 @@

    L

    -
    less_than
    +
    less_than
    time_traits< boost::posix_time::ptime >, time_traits< boost::posix_time::ptime >::less_than
    -
    linger
    +
    linger
    basic_datagram_socket, basic_datagram_socket::linger
    @@ -2218,10 +2249,10 @@
    socket_base, socket_base::linger
    -
    listen
    +
    listen
    basic_socket_acceptor, basic_socket_acceptor::listen
    -
    load
    +
    load
    serial_port_base::baud_rate, serial_port_base::baud_rate::load
    @@ -2234,12 +2265,12 @@
    serial_port_base::stop_bits, serial_port_base::stop_bits::load
    -
    load_verify_file
    +
    load_verify_file
    ssl::context, ssl::context::load_verify_file
    -
    local::connect_pair, local::connect_pair +
    local::connect_pair, local::connect_pair
    -
    local_endpoint
    +
    local_endpoint
    basic_datagram_socket, basic_datagram_socket::local_endpoint
    @@ -2254,14 +2285,14 @@
    basic_stream_socket, basic_stream_socket::local_endpoint
    -
    loopback
    +
    loopback
    ip::address_v4, ip::address_v4::loopback
    ip::address_v6, ip::address_v6::loopback
    -
    lowest_layer
    +
    lowest_layer
    basic_datagram_socket, basic_datagram_socket::lowest_layer
    @@ -2296,7 +2327,7 @@
    windows::stream_handle, windows::stream_handle::lowest_layer
    -
    lowest_layer_type
    +
    lowest_layer_type
    basic_datagram_socket, basic_datagram_socket::lowest_layer_type
    @@ -2336,30 +2367,30 @@

    M

    -
    make_address
    +
    make_address
    ip::address, ip::address::make_address
    -
    make_address_v4
    +
    make_address_v4
    ip::address_v4, ip::address_v4::make_address_v4
    -
    make_address_v6
    +
    make_address_v6
    ip::address_v6, ip::address_v6::make_address_v6
    -
    make_network_v4
    +
    make_network_v4
    ip::address_v4, ip::address_v4::make_network_v4
    ip::network_v4, ip::network_v4::make_network_v4
    -
    make_network_v6
    +
    make_network_v6
    ip::address_v6, ip::address_v6::make_network_v6
    ip::network_v6, ip::network_v6::make_network_v6
    -
    make_service
    +
    make_service
    execution_context, execution_context::make_service
    @@ -2370,9 +2401,9 @@
    thread_pool, thread_pool::make_service
    -
    make_work_guard, make_work_guard +
    make_work_guard, make_work_guard
    -
    max_connections
    +
    max_connections
    basic_datagram_socket, basic_datagram_socket::max_connections
    @@ -2389,7 +2420,7 @@
    socket_base, socket_base::max_connections
    -
    max_listen_connections
    +
    max_listen_connections
    basic_datagram_socket, basic_datagram_socket::max_listen_connections
    @@ -2406,7 +2437,7 @@
    socket_base, socket_base::max_listen_connections
    -
    max_size
    +
    max_size
    basic_streambuf, basic_streambuf::max_size
    @@ -2419,7 +2450,7 @@
    ip::basic_resolver_results, ip::basic_resolver_results::max_size
    -
    message_do_not_route
    +
    message_do_not_route
    basic_datagram_socket, basic_datagram_socket::message_do_not_route
    @@ -2436,7 +2467,7 @@
    socket_base, socket_base::message_do_not_route
    -
    message_end_of_record
    +
    message_end_of_record
    basic_datagram_socket, basic_datagram_socket::message_end_of_record
    @@ -2453,7 +2484,7 @@
    socket_base, socket_base::message_end_of_record
    -
    message_flags
    +
    message_flags
    basic_datagram_socket, basic_datagram_socket::message_flags
    @@ -2470,7 +2501,7 @@
    socket_base, socket_base::message_flags
    -
    message_out_of_band
    +
    message_out_of_band
    basic_datagram_socket, basic_datagram_socket::message_out_of_band
    @@ -2487,7 +2518,7 @@
    socket_base, socket_base::message_out_of_band
    -
    message_peek
    +
    message_peek
    basic_datagram_socket, basic_datagram_socket::message_peek
    @@ -2504,23 +2535,23 @@
    socket_base, socket_base::message_peek
    -
    message_size
    +
    message_size
    error::basic_errors, error::basic_errors
    -
    method
    +
    method
    ssl::context, ssl::context::method
    ssl::context_base, ssl::context_base::method
    -
    mutable_buffer
    +
    mutable_buffer
    mutable_buffer, mutable_buffer::mutable_buffer
    -
    mutable_buffers_1
    +
    mutable_buffers_1
    mutable_buffers_1, mutable_buffers_1::mutable_buffers_1
    -
    mutable_buffers_type
    +
    mutable_buffers_type
    basic_streambuf, basic_streambuf::mutable_buffers_type
    @@ -2536,10 +2567,10 @@

    N

    -
    name_too_long
    +
    name_too_long
    error::basic_errors, error::basic_errors
    -
    native_handle
    +
    native_handle
    basic_datagram_socket, basic_datagram_socket::native_handle
    @@ -2574,7 +2605,7 @@
    windows::stream_handle, windows::stream_handle::native_handle
    -
    native_handle_type
    +
    native_handle_type
    basic_datagram_socket, basic_datagram_socket::native_handle_type
    @@ -2609,7 +2640,7 @@
    windows::stream_handle, windows::stream_handle::native_handle_type
    -
    native_non_blocking
    +
    native_non_blocking
    basic_datagram_socket, basic_datagram_socket::native_non_blocking
    @@ -2628,36 +2659,36 @@
    posix::stream_descriptor, posix::stream_descriptor::native_non_blocking
    -
    netmask
    +
    netmask
    ip::address_v4, ip::address_v4::netmask
    ip::network_v4, ip::network_v4::netmask
    -
    network
    +
    network
    ip::network_v4, ip::network_v4::network
    ip::network_v6, ip::network_v6::network
    -
    network_down
    +
    network_down
    error::basic_errors, error::basic_errors
    -
    network_reset
    +
    network_reset
    error::basic_errors, error::basic_errors
    -
    network_unreachable
    +
    network_unreachable
    error::basic_errors, error::basic_errors
    -
    network_v4
    +
    network_v4
    ip::network_v4, ip::network_v4::network_v4
    -
    network_v6
    +
    network_v6
    ip::network_v6, ip::network_v6::network_v6
    -
    next_layer
    +
    next_layer
    buffered_read_stream, buffered_read_stream::next_layer
    @@ -2668,7 +2699,7 @@
    ssl::stream, ssl::stream::next_layer
    -
    next_layer_type
    +
    next_layer_type
    buffered_read_stream, buffered_read_stream::next_layer_type
    @@ -2679,14 +2710,14 @@
    ssl::stream, ssl::stream::next_layer_type
    -
    none
    +
    none
    serial_port_base::flow_control, serial_port_base::flow_control::type
    serial_port_base::parity, serial_port_base::parity::type
    -
    non_blocking
    +
    non_blocking
    basic_datagram_socket, basic_datagram_socket::non_blocking
    @@ -2705,7 +2736,7 @@
    posix::stream_descriptor, posix::stream_descriptor::non_blocking
    -
    notify_fork
    +
    notify_fork
    execution_context, execution_context::notify_fork
    @@ -2718,90 +2749,90 @@
    thread_pool, thread_pool::notify_fork
    -
    not_connected
    +
    not_connected
    error::basic_errors, error::basic_errors
    -
    not_found
    +
    not_found
    error::misc_errors, error::misc_errors
    -
    not_socket
    +
    not_socket
    error::basic_errors, error::basic_errors
    -
    now
    +
    now
    time_traits< boost::posix_time::ptime >, time_traits< boost::posix_time::ptime >::now
    -
    no_buffer_space
    +
    no_buffer_space
    error::basic_errors, error::basic_errors
    -
    no_compression
    +
    no_compression
    ssl::context, ssl::context::no_compression
    ssl::context_base, ssl::context_base::no_compression
    -
    no_data
    +
    no_data
    error::netdb_errors, error::netdb_errors
    -
    no_delay
    +
    no_delay
    ip::tcp, ip::tcp::no_delay
    -
    no_descriptors
    +
    no_descriptors
    error::basic_errors, error::basic_errors
    -
    no_memory
    +
    no_memory
    error::basic_errors, error::basic_errors
    -
    no_permission
    +
    no_permission
    error::basic_errors, error::basic_errors
    -
    no_protocol_option
    +
    no_protocol_option
    error::basic_errors, error::basic_errors
    -
    no_recovery
    +
    no_recovery
    error::netdb_errors, error::netdb_errors
    -
    no_sslv2
    +
    no_sslv2
    ssl::context, ssl::context::no_sslv2
    ssl::context_base, ssl::context_base::no_sslv2
    -
    no_sslv3
    +
    no_sslv3
    ssl::context, ssl::context::no_sslv3
    ssl::context_base, ssl::context_base::no_sslv3
    -
    no_such_device
    +
    no_such_device
    error::basic_errors, error::basic_errors
    -
    no_tlsv1
    +
    no_tlsv1
    ssl::context, ssl::context::no_tlsv1
    ssl::context_base, ssl::context_base::no_tlsv1
    -
    no_tlsv1_1
    +
    no_tlsv1_1
    ssl::context, ssl::context::no_tlsv1_1
    ssl::context_base, ssl::context_base::no_tlsv1_1
    -
    no_tlsv1_2
    +
    no_tlsv1_2
    ssl::context, ssl::context::no_tlsv1_2
    ssl::context_base, ssl::context_base::no_tlsv1_2
    -
    numeric_host
    +
    numeric_host
    ip::basic_resolver, ip::basic_resolver::numeric_host
    @@ -2812,7 +2843,7 @@
    ip::resolver_query_base, ip::resolver_query_base::numeric_host
    -
    numeric_service
    +
    numeric_service
    ip::basic_resolver, ip::basic_resolver::numeric_service
    @@ -2828,19 +2859,19 @@

    O

    -
    object_handle
    +
    object_handle
    windows::object_handle, windows::object_handle::object_handle
    -
    odd
    +
    odd
    serial_port_base::parity, serial_port_base::parity::type
    -
    one
    +
    one
    serial_port_base::stop_bits, serial_port_base::stop_bits::type
    -
    onepointfive
    +
    onepointfive
    serial_port_base::stop_bits, serial_port_base::stop_bits::type
    -
    on_work_finished
    +
    on_work_finished
    executor, executor::on_work_finished
    @@ -2855,7 +2886,7 @@
    thread_pool::executor_type, thread_pool::executor_type::on_work_finished
    -
    on_work_started
    +
    on_work_started
    executor, executor::on_work_started
    @@ -2870,7 +2901,7 @@
    thread_pool::executor_type, thread_pool::executor_type::on_work_started
    -
    open
    +
    open
    basic_datagram_socket, basic_datagram_socket::open
    @@ -2887,13 +2918,13 @@
    serial_port, serial_port::open
    -
    operation_aborted
    +
    operation_aborted
    error::basic_errors, error::basic_errors
    -
    operation_not_supported
    +
    operation_not_supported
    error::basic_errors, error::basic_errors
    -
    operator *
    +
    operator *
    buffers_iterator, buffers_iterator::operator * @@ -2911,16 +2942,16 @@ *
    -
    operator +
    operator endpoint_type
    ip::basic_resolver_entry, ip::basic_resolver_entry::operator endpoint_type
    -
    operator unspecified_bool_type
    +
    operator unspecified_bool_type
    executor, executor::operator unspecified_bool_type
    -
    operator!=
    +
    operator!=
    buffers_iterator, buffers_iterator::operator!=
    @@ -2979,7 +3010,7 @@
    thread_pool::executor_type, thread_pool::executor_type::operator!=
    -
    operator()
    +
    operator()
    executor_binder, executor_binder::operator()
    @@ -2988,7 +3019,7 @@
    use_future_t, use_future_t::operator()
    -
    operator+
    +
    operator+
    buffers_iterator, buffers_iterator::operator+
    @@ -3001,7 +3032,7 @@
    mutable_buffers_1, mutable_buffers_1::operator+
    -
    operator++
    +
    operator++
    buffers_iterator, buffers_iterator::operator++
    @@ -3018,7 +3049,7 @@
    ip::basic_resolver_results, ip::basic_resolver_results::operator++
    -
    operator+=
    +
    operator+=
    buffers_iterator, buffers_iterator::operator+=
    @@ -3031,10 +3062,10 @@
    mutable_buffers_1, mutable_buffers_1::operator+=
    -
    operator-
    +
    operator-
    buffers_iterator, buffers_iterator::operator-
    -
    operator--
    +
    operator--
    buffers_iterator, buffers_iterator::operator--
    @@ -3047,10 +3078,10 @@ address_v6 >::operator--
    -
    operator-=
    +
    operator-=
    buffers_iterator, buffers_iterator::operator-=
    -
    operator->
    +
    operator->
    buffers_iterator, buffers_iterator::operator->
    @@ -3067,7 +3098,7 @@
    ip::basic_resolver_results, ip::basic_resolver_results::operator->
    -
    operator<
    +
    operator<
    buffers_iterator, buffers_iterator::operator<
    @@ -3084,7 +3115,7 @@
    local::basic_endpoint, local::basic_endpoint::operator<
    -
    operator<<
    +
    operator<<
    ip::address, ip::address::operator<<
    @@ -3097,7 +3128,7 @@
    local::basic_endpoint, local::basic_endpoint::operator<<
    -
    operator<=
    +
    operator<=
    buffers_iterator, buffers_iterator::operator<=
    @@ -3114,7 +3145,7 @@
    local::basic_endpoint, local::basic_endpoint::operator<=
    -
    operator=
    +
    operator=
    basic_datagram_socket, basic_datagram_socket::operator=
    @@ -3197,7 +3228,7 @@
    windows::stream_handle, windows::stream_handle::operator=
    -
    operator==
    +
    operator==
    buffers_iterator, buffers_iterator::operator==
    @@ -3256,7 +3287,7 @@
    thread_pool::executor_type, thread_pool::executor_type::operator==
    -
    operator>
    +
    operator>
    buffers_iterator, buffers_iterator::operator>
    @@ -3273,7 +3304,7 @@
    local::basic_endpoint, local::basic_endpoint::operator>
    -
    operator>=
    +
    operator>=
    buffers_iterator, buffers_iterator::operator>=
    @@ -3290,7 +3321,7 @@
    local::basic_endpoint, local::basic_endpoint::operator>=
    -
    operator[]
    +
    operator[]
    basic_yield_context, basic_yield_context::operator[]
    @@ -3299,14 +3330,14 @@
    use_future_t, use_future_t::operator[]
    -
    options
    +
    options
    ssl::context, ssl::context::options
    ssl::context_base, ssl::context_base::options
    -
    out_of_band_inline
    +
    out_of_band_inline
    basic_datagram_socket, basic_datagram_socket::out_of_band_inline
    @@ -3323,20 +3354,20 @@
    socket_base, socket_base::out_of_band_inline
    -
    overflow
    +
    overflow
    basic_socket_streambuf, basic_socket_streambuf::overflow
    basic_streambuf, basic_streambuf::overflow
    -
    overlapped_handle
    +
    overlapped_handle
    windows::overlapped_handle, windows::overlapped_handle::overlapped_handle
    -
    overlapped_ptr
    +
    overlapped_ptr
    windows::overlapped_ptr, windows::overlapped_ptr::overlapped_ptr
    -
    owns_work
    +
    owns_work
    executor_work_guard, executor_work_guard::owns_work
    @@ -3344,10 +3375,10 @@

    P

    -
    parity
    +
    parity
    serial_port_base::parity, serial_port_base::parity::parity
    -
    passive
    +
    passive
    ip::basic_resolver, ip::basic_resolver::passive
    @@ -3358,17 +3389,17 @@
    ip::resolver_query_base, ip::resolver_query_base::passive
    -
    password_purpose
    +
    password_purpose
    ssl::context, ssl::context::password_purpose
    ssl::context_base, ssl::context_base::password_purpose
    -
    path
    +
    path
    local::basic_endpoint, local::basic_endpoint::path
    -
    peek
    +
    peek
    buffered_read_stream, buffered_read_stream::peek
    @@ -3377,26 +3408,26 @@
    buffered_write_stream, buffered_write_stream::peek
    -
    pem
    +
    pem
    ssl::context, ssl::context::file_format
    ssl::context_base, ssl::context_base::file_format
    -
    placeholders::bytes_transferred, placeholders::bytes_transferred +
    placeholders::bytes_transferred, placeholders::bytes_transferred
    -
    placeholders::endpoint, placeholders::endpoint +
    placeholders::endpoint, placeholders::endpoint
    -
    placeholders::error, placeholders::error +
    placeholders::error, placeholders::error
    -
    placeholders::iterator, placeholders::iterator +
    placeholders::iterator, placeholders::iterator
    -
    placeholders::results, placeholders::results +
    placeholders::results, placeholders::results
    -
    placeholders::signal_number, placeholders::signal_number +
    placeholders::signal_number, placeholders::signal_number
    -
    pointer
    +
    pointer
    buffers_iterator, buffers_iterator::pointer
    @@ -3413,16 +3444,16 @@
    ip::basic_resolver_results, ip::basic_resolver_results::pointer
    -
    poll
    +
    poll
    io_context, io_context::poll
    -
    poll_one
    +
    poll_one
    io_context, io_context::poll_one
    -
    port
    +
    port
    ip::basic_endpoint, ip::basic_endpoint::port
    -
    post, post +
    post, post
    executor, executor::post @@ -3440,14 +3471,14 @@
    thread_pool::executor_type, thread_pool::executor_type::post
    -
    prefix_length
    +
    prefix_length
    ip::network_v4, ip::network_v4::prefix_length
    ip::network_v6, ip::network_v6::prefix_length
    -
    prepare
    +
    prepare
    basic_streambuf, basic_streambuf::prepare
    @@ -3458,7 +3489,7 @@
    dynamic_vector_buffer, dynamic_vector_buffer::prepare
    -
    protocol
    +
    protocol
    generic::basic_endpoint, generic::basic_endpoint::protocol
    @@ -3485,7 +3516,7 @@
    local::stream_protocol, local::stream_protocol::protocol
    -
    protocol_type
    +
    protocol_type
    basic_datagram_socket, basic_datagram_socket::protocol_type
    @@ -3518,7 +3549,7 @@
    local::basic_endpoint, local::basic_endpoint::protocol_type
    -
    puberror
    +
    puberror
    basic_socket_streambuf, basic_socket_streambuf::puberror
    @@ -3526,7 +3557,7 @@

    Q

    -
    query
    +
    query
    ip::basic_resolver, ip::basic_resolver::query
    @@ -3534,20 +3565,20 @@

    R

    -
    random_access_handle
    +
    random_access_handle
    windows::random_access_handle, windows::random_access_handle::random_access_handle
    -
    raw_protocol
    +
    raw_protocol
    generic::raw_protocol, generic::raw_protocol::raw_protocol
    -
    rdbuf
    +
    rdbuf
    basic_socket_iostream, basic_socket_iostream::rdbuf
    -
    read, read +
    read, read
    -
    read_at, read_at +
    read_at, read_at
    -
    read_some
    +
    read_some
    basic_stream_socket, basic_stream_socket::read_some
    @@ -3566,15 +3597,15 @@
    windows::stream_handle, windows::stream_handle::read_some
    -
    read_some_at
    +
    read_some_at
    windows::random_access_handle, windows::random_access_handle::read_some_at
    -
    read_until, read_until +
    read_until, read_until
    -
    rebind
    +
    rebind
    use_future_t, use_future_t::rebind
    -
    receive
    +
    receive
    basic_datagram_socket, basic_datagram_socket::receive
    @@ -3585,7 +3616,7 @@
    basic_stream_socket, basic_stream_socket::receive
    -
    receive_buffer_size
    +
    receive_buffer_size
    basic_datagram_socket, basic_datagram_socket::receive_buffer_size
    @@ -3602,14 +3633,14 @@
    socket_base, socket_base::receive_buffer_size
    -
    receive_from
    +
    receive_from
    basic_datagram_socket, basic_datagram_socket::receive_from
    basic_raw_socket, basic_raw_socket::receive_from
    -
    receive_low_watermark
    +
    receive_low_watermark
    basic_datagram_socket, basic_datagram_socket::receive_low_watermark
    @@ -3626,7 +3657,10 @@
    socket_base, socket_base::receive_low_watermark
    -
    reference
    +
    redirect_error_t
    +
    experimental::redirect_error_t, experimental::redirect_error_t::redirect_error_t +
    +
    reference
    buffers_iterator, buffers_iterator::reference
    @@ -3643,7 +3677,7 @@
    ip::basic_resolver_results, ip::basic_resolver_results::reference
    -
    release
    +
    release
    basic_datagram_socket, basic_datagram_socket::release
    @@ -3664,7 +3698,7 @@
    windows::overlapped_ptr, windows::overlapped_ptr::release
    -
    remote_endpoint
    +
    remote_endpoint
    basic_datagram_socket, basic_datagram_socket::remote_endpoint
    @@ -3677,13 +3711,13 @@
    basic_stream_socket, basic_stream_socket::remote_endpoint
    -
    remove
    +
    remove
    signal_set, signal_set::remove
    -
    reserve
    +
    reserve
    basic_streambuf, basic_streambuf::reserve
    -
    reset
    +
    reset
    executor_work_guard, executor_work_guard::reset
    @@ -3692,7 +3726,7 @@
    windows::overlapped_ptr, windows::overlapped_ptr::reset
    -
    resize
    +
    resize
    generic::basic_endpoint, generic::basic_endpoint::resize
    @@ -3701,10 +3735,10 @@
    local::basic_endpoint, local::basic_endpoint::resize
    -
    resolve
    +
    resolve
    ip::basic_resolver, ip::basic_resolver::resolve
    -
    resolver
    +
    resolver
    ip::icmp, ip::icmp::resolver
    @@ -3713,25 +3747,25 @@
    ip::udp, ip::udp::resolver
    -
    resolver_errc::try_again, resolver_errc::try_again +
    resolver_errc::try_again, resolver_errc::try_again
    -
    restart
    +
    restart
    io_context, io_context::restart
    -
    result
    +
    result
    async_completion, async_completion::result
    -
    results_type
    +
    results_type
    ip::basic_resolver, ip::basic_resolver::results_type
    -
    result_type
    +
    result_type
    executor_binder, executor_binder::result_type
    ssl::rfc2818_verification, ssl::rfc2818_verification::result_type
    -
    return_type
    +
    return_type
    async_result, async_result::return_type
    @@ -3740,7 +3774,7 @@ std::packaged_task< Result(Args...)>, Signature >::return_type
    -
    reuse_address
    +
    reuse_address
    basic_datagram_socket, basic_datagram_socket::reuse_address
    @@ -3757,13 +3791,13 @@
    socket_base, socket_base::reuse_address
    -
    rfc2818_verification
    +
    rfc2818_verification
    ssl::rfc2818_verification, ssl::rfc2818_verification::rfc2818_verification
    -
    run
    +
    run
    io_context, io_context::run
    -
    running_in_this_thread
    +
    running_in_this_thread
    io_context::executor_type, io_context::executor_type::running_in_this_thread
    @@ -3774,19 +3808,19 @@
    thread_pool::executor_type, thread_pool::executor_type::running_in_this_thread
    -
    run_for
    +
    run_for
    io_context, io_context::run_for
    -
    run_one
    +
    run_one
    io_context, io_context::run_one
    -
    run_one_for
    +
    run_one_for
    io_context, io_context::run_one_for
    -
    run_one_until
    +
    run_one_until
    io_context, io_context::run_one_until
    -
    run_until
    +
    run_until
    io_context, io_context::run_until
    @@ -3794,13 +3828,13 @@

    S

    -
    scope_id
    +
    scope_id
    ip::address_v6, ip::address_v6::scope_id
    -
    second_argument_type
    +
    second_argument_type
    executor_binder, executor_binder::second_argument_type
    -
    send
    +
    send
    basic_datagram_socket, basic_datagram_socket::send
    @@ -3811,10 +3845,10 @@
    basic_stream_socket, basic_stream_socket::send
    -
    send_break
    +
    send_break
    serial_port, serial_port::send_break
    -
    send_buffer_size
    +
    send_buffer_size
    basic_datagram_socket, basic_datagram_socket::send_buffer_size
    @@ -3831,7 +3865,7 @@
    socket_base, socket_base::send_buffer_size
    -
    send_low_watermark
    +
    send_low_watermark
    basic_datagram_socket, basic_datagram_socket::send_low_watermark
    @@ -3848,56 +3882,56 @@
    socket_base, socket_base::send_low_watermark
    -
    send_to
    +
    send_to
    basic_datagram_socket, basic_datagram_socket::send_to
    basic_raw_socket, basic_raw_socket::send_to
    -
    seq_packet_protocol
    +
    seq_packet_protocol
    generic::seq_packet_protocol, generic::seq_packet_protocol::seq_packet_protocol
    -
    serial_port
    +
    serial_port
    serial_port, serial_port::serial_port
    -
    server
    +
    server
    ssl::stream, ssl::stream::handshake_type
    ssl::stream_base, ssl::stream_base::handshake_type
    -
    service
    +
    service
    execution_context::service, execution_context::service::service
    io_context::service, io_context::service::service
    -
    service_already_exists
    +
    service_already_exists
    service_already_exists, service_already_exists::service_already_exists
    -
    service_name
    +
    service_name
    ip::basic_resolver_entry, ip::basic_resolver_entry::service_name
    ip::basic_resolver_query, ip::basic_resolver_query::service_name
    -
    service_not_found
    +
    service_not_found
    error::addrinfo_errors, error::addrinfo_errors
    -
    service_type
    +
    service_type
    basic_io_object, basic_io_object::service_type
    -
    setbuf
    +
    setbuf
    basic_socket_streambuf, basic_socket_streambuf::setbuf
    -
    set_default_verify_paths
    +
    set_default_verify_paths
    ssl::context, ssl::context::set_default_verify_paths
    -
    set_option
    +
    set_option
    basic_datagram_socket, basic_datagram_socket::set_option
    @@ -3914,34 +3948,34 @@
    serial_port, serial_port::set_option
    -
    set_options
    +
    set_options
    ssl::context, ssl::context::set_options
    -
    set_password_callback
    +
    set_password_callback
    ssl::context, ssl::context::set_password_callback
    -
    set_verify_callback
    +
    set_verify_callback
    ssl::context, ssl::context::set_verify_callback
    ssl::stream, ssl::stream::set_verify_callback
    -
    set_verify_depth
    +
    set_verify_depth
    ssl::context, ssl::context::set_verify_depth
    ssl::stream, ssl::stream::set_verify_depth
    -
    set_verify_mode
    +
    set_verify_mode
    ssl::context, ssl::context::set_verify_mode
    ssl::stream, ssl::stream::set_verify_mode
    -
    shutdown
    +
    shutdown
    basic_datagram_socket, basic_datagram_socket::shutdown
    @@ -3966,7 +4000,7 @@
    thread_pool, thread_pool::shutdown
    -
    shutdown_both
    +
    shutdown_both
    basic_datagram_socket, basic_datagram_socket::shutdown_type
    @@ -3983,7 +4017,7 @@
    socket_base, socket_base::shutdown_type
    -
    shutdown_receive
    +
    shutdown_receive
    basic_datagram_socket, basic_datagram_socket::shutdown_type
    @@ -4000,7 +4034,7 @@
    socket_base, socket_base::shutdown_type
    -
    shutdown_send
    +
    shutdown_send
    basic_datagram_socket, basic_datagram_socket::shutdown_type
    @@ -4017,7 +4051,7 @@
    socket_base, socket_base::shutdown_type
    -
    shutdown_type
    +
    shutdown_type
    basic_datagram_socket, basic_datagram_socket::shutdown_type
    @@ -4034,20 +4068,20 @@
    socket_base, socket_base::shutdown_type
    -
    shut_down
    +
    shut_down
    error::basic_errors, error::basic_errors
    -
    signal_set
    +
    signal_set
    signal_set, signal_set::signal_set
    -
    single_dh_use
    +
    single_dh_use
    ssl::context, ssl::context::single_dh_use
    ssl::context_base, ssl::context_base::single_dh_use
    -
    size
    +
    size
    basic_streambuf, basic_streambuf::size
    @@ -4078,10 +4112,10 @@
    mutable_buffers_1, mutable_buffers_1::size
    -
    size_type
    +
    size_type
    ip::basic_resolver_results, ip::basic_resolver_results::size_type
    -
    socket
    +
    socket
    basic_socket_iostream, basic_socket_iostream::socket
    @@ -4106,101 +4140,101 @@
    local::stream_protocol, local::stream_protocol::socket
    -
    socket_type_not_supported
    +
    socket_type_not_supported
    error::addrinfo_errors, error::addrinfo_errors
    -
    software
    +
    software
    serial_port_base::flow_control, serial_port_base::flow_control::type
    -
    spawn, spawn +
    spawn, spawn
    -
    ssl
    +
    ssl
    ssl::stream::impl_struct, ssl::stream::impl_struct::ssl
    -
    ssl::error::get_stream_category, ssl::error::get_stream_category +
    ssl::error::get_stream_category, ssl::error::get_stream_category
    -
    ssl::error::make_error_code, ssl::error::make_error_code +
    ssl::error::make_error_code, ssl::error::make_error_code
    -
    ssl::error::stream_category, ssl::error::stream_category +
    ssl::error::stream_category, ssl::error::stream_category
    -
    ssl::error::stream_errors, ssl::error::stream_errors +
    ssl::error::stream_errors, ssl::error::stream_errors
    -
    ssl::verify_client_once, ssl::verify_client_once +
    ssl::verify_client_once, ssl::verify_client_once
    -
    ssl::verify_fail_if_no_peer_cert, ssl::verify_fail_if_no_peer_cert +
    ssl::verify_fail_if_no_peer_cert, ssl::verify_fail_if_no_peer_cert
    -
    ssl::verify_mode, ssl::verify_mode +
    ssl::verify_mode, ssl::verify_mode
    -
    ssl::verify_none, ssl::verify_none +
    ssl::verify_none, ssl::verify_none
    -
    ssl::verify_peer, ssl::verify_peer +
    ssl::verify_peer, ssl::verify_peer
    -
    sslv2
    +
    sslv2
    ssl::context, ssl::context::method
    ssl::context_base, ssl::context_base::method
    -
    sslv23
    +
    sslv23
    ssl::context, ssl::context::method
    ssl::context_base, ssl::context_base::method
    -
    sslv23_client
    +
    sslv23_client
    ssl::context, ssl::context::method
    ssl::context_base, ssl::context_base::method
    -
    sslv23_server
    +
    sslv23_server
    ssl::context, ssl::context::method
    ssl::context_base, ssl::context_base::method
    -
    sslv2_client
    +
    sslv2_client
    ssl::context, ssl::context::method
    ssl::context_base, ssl::context_base::method
    -
    sslv2_server
    +
    sslv2_server
    ssl::context, ssl::context::method
    ssl::context_base, ssl::context_base::method
    -
    sslv3
    +
    sslv3
    ssl::context, ssl::context::method
    ssl::context_base, ssl::context_base::method
    -
    sslv3_client
    +
    sslv3_client
    ssl::context, ssl::context::method
    ssl::context_base, ssl::context_base::method
    -
    sslv3_server
    +
    sslv3_server
    ssl::context, ssl::context::method
    ssl::context_base, ssl::context_base::method
    -
    steady_timer, steady_timer +
    steady_timer, steady_timer
    -
    stop
    +
    stop
    io_context, io_context::stop
    @@ -4209,17 +4243,17 @@
    thread_pool, thread_pool::stop
    -
    stopped
    +
    stopped
    io_context, io_context::stopped
    system_context, system_context::stopped
    -
    stop_bits
    +
    stop_bits
    serial_port_base::stop_bits, serial_port_base::stop_bits::stop_bits
    -
    store
    +
    store
    serial_port_base::baud_rate, serial_port_base::baud_rate::store
    @@ -4232,65 +4266,65 @@
    serial_port_base::stop_bits, serial_port_base::stop_bits::store
    -
    strand
    +
    strand
    io_context::strand, io_context::strand::strand
    strand, strand::strand
    -
    stream
    +
    stream
    ssl::stream, ssl::stream::stream
    -
    streambuf, streambuf +
    streambuf, streambuf
    -
    stream_descriptor
    +
    stream_descriptor
    posix::stream_descriptor, posix::stream_descriptor::stream_descriptor
    -
    stream_handle
    +
    stream_handle
    windows::stream_handle, windows::stream_handle::stream_handle
    -
    stream_protocol
    +
    stream_protocol
    generic::stream_protocol, generic::stream_protocol::stream_protocol
    -
    stream_truncated
    +
    stream_truncated
    ssl::error::stream_errors, ssl::error::stream_errors
    -
    subtract
    +
    subtract
    time_traits< boost::posix_time::ptime >, time_traits< boost::posix_time::ptime >::subtract
    -
    swap
    +
    swap
    ip::basic_resolver_results, ip::basic_resolver_results::swap
    -
    sync
    +
    sync
    basic_socket_streambuf, basic_socket_streambuf::sync
    -
    system_timer, system_timer +
    system_timer, system_timer

    T

    -
    target
    +
    target
    executor, executor::target
    -
    target_type
    +
    target_type
    executor, executor::target_type
    executor_binder, executor_binder::target_type
    -
    thread_pool
    +
    thread_pool
    thread_pool, thread_pool::thread_pool
    -
    timed_out
    +
    timed_out
    error::basic_errors, error::basic_errors
    -
    time_point
    +
    time_point
    basic_socket_iostream, basic_socket_iostream::time_point
    @@ -4299,7 +4333,7 @@
    basic_waitable_timer, basic_waitable_timer::time_point
    -
    time_type
    +
    time_type
    basic_deadline_timer, basic_deadline_timer::time_type
    @@ -4312,103 +4346,106 @@ boost::posix_time::ptime >::time_type
    -
    tls
    +
    tls
    ssl::context, ssl::context::method
    ssl::context_base, ssl::context_base::method
    -
    tlsv1
    +
    tlsv1
    ssl::context, ssl::context::method
    ssl::context_base, ssl::context_base::method
    -
    tlsv11
    +
    tlsv11
    ssl::context, ssl::context::method
    ssl::context_base, ssl::context_base::method
    -
    tlsv11_client
    +
    tlsv11_client
    ssl::context, ssl::context::method
    ssl::context_base, ssl::context_base::method
    -
    tlsv11_server
    +
    tlsv11_server
    ssl::context, ssl::context::method
    ssl::context_base, ssl::context_base::method
    -
    tlsv12
    +
    tlsv12
    ssl::context, ssl::context::method
    ssl::context_base, ssl::context_base::method
    -
    tlsv12_client
    +
    tlsv12_client
    ssl::context, ssl::context::method
    ssl::context_base, ssl::context_base::method
    -
    tlsv12_server
    +
    tlsv12_server
    ssl::context, ssl::context::method
    ssl::context_base, ssl::context_base::method
    -
    tlsv1_client
    +
    tlsv1_client
    ssl::context, ssl::context::method
    ssl::context_base, ssl::context_base::method
    -
    tlsv1_server
    +
    tlsv1_server
    ssl::context, ssl::context::method
    ssl::context_base, ssl::context_base::method
    -
    tls_client
    +
    tls_client
    ssl::context, ssl::context::method
    ssl::context_base, ssl::context_base::method
    -
    tls_server
    +
    tls_server
    ssl::context, ssl::context::method
    ssl::context_base, ssl::context_base::method
    -
    to_bytes
    +
    token_
    +
    experimental::redirect_error_t, experimental::redirect_error_t::token_ +
    +
    to_bytes
    ip::address_v4, ip::address_v4::to_bytes
    ip::address_v6, ip::address_v6::to_bytes
    -
    to_posix_duration
    +
    to_posix_duration
    time_traits< boost::posix_time::ptime >, time_traits< boost::posix_time::ptime >::to_posix_duration
    -
    to_string
    +
    to_string
    ip::address, ip::address::to_string
    @@ -4421,45 +4458,45 @@
    ip::network_v6, ip::network_v6::to_string
    -
    to_uint
    +
    to_uint
    ip::address_v4, ip::address_v4::to_uint
    -
    to_ulong
    +
    to_ulong
    ip::address_v4, ip::address_v4::to_ulong
    -
    to_v4
    +
    to_v4
    ip::address, ip::address::to_v4
    ip::address_v6, ip::address_v6::to_v4
    -
    to_v6
    +
    to_v6
    ip::address, ip::address::to_v6
    -
    to_wait_duration
    +
    to_wait_duration
    wait_traits, wait_traits::to_wait_duration
    -
    traits_type
    +
    traits_type
    basic_deadline_timer, basic_deadline_timer::traits_type
    basic_waitable_timer, basic_waitable_timer::traits_type
    -
    transfer_all, transfer_all +
    transfer_all, transfer_all
    -
    transfer_at_least, transfer_at_least +
    transfer_at_least, transfer_at_least
    -
    transfer_exactly, transfer_exactly +
    transfer_exactly, transfer_exactly
    -
    try_again
    +
    try_again
    error::basic_errors, error::basic_errors
    -
    two
    +
    two
    serial_port_base::stop_bits, serial_port_base::stop_bits::type
    -
    type
    +
    type
    associated_allocator, associated_allocator::type
    @@ -4501,52 +4538,52 @@

    U

    -
    uint_type
    +
    uint_type
    ip::address_v4, ip::address_v4::uint_type
    -
    underflow
    +
    underflow
    basic_socket_streambuf, basic_socket_streambuf::underflow
    basic_streambuf, basic_streambuf::underflow
    -
    unspecified_bool_true
    +
    unspecified_bool_true
    executor, executor::unspecified_bool_true
    -
    unspecified_bool_type
    +
    unspecified_bool_type
    executor, executor::unspecified_bool_type
    -
    use_certificate
    +
    use_certificate
    ssl::context, ssl::context::use_certificate
    -
    use_certificate_chain
    +
    use_certificate_chain
    ssl::context, ssl::context::use_certificate_chain
    -
    use_certificate_chain_file
    +
    use_certificate_chain_file
    ssl::context, ssl::context::use_certificate_chain_file
    -
    use_certificate_file
    +
    use_certificate_file
    ssl::context, ssl::context::use_certificate_file
    -
    use_future, use_future +
    use_future, use_future
    -
    use_future_t
    +
    use_future_t
    use_future_t, use_future_t::use_future_t
    -
    use_private_key
    +
    use_private_key
    ssl::context, ssl::context::use_private_key
    -
    use_private_key_file
    +
    use_private_key_file
    ssl::context, ssl::context::use_private_key_file
    -
    use_rsa_private_key
    +
    use_rsa_private_key
    ssl::context, ssl::context::use_rsa_private_key
    -
    use_rsa_private_key_file
    +
    use_rsa_private_key_file
    ssl::context, ssl::context::use_rsa_private_key_file
    -
    use_service, use_service +
    use_service, use_service
    execution_context, execution_context::use_service @@ -4558,10 +4595,10 @@
    thread_pool, thread_pool::use_service
    -
    use_tmp_dh
    +
    use_tmp_dh
    ssl::context, ssl::context::use_tmp_dh
    -
    use_tmp_dh_file
    +
    use_tmp_dh_file
    ssl::context, ssl::context::use_tmp_dh_file
    @@ -4569,7 +4606,7 @@

    V

    -
    v4
    +
    v4
    ip::icmp, ip::icmp::v4
    @@ -4578,10 +4615,10 @@
    ip::udp, ip::udp::v4
    -
    v4_compatible
    +
    v4_compatible
    ip::address_v6, ip::address_v6::v4_compatible
    -
    v4_mapped
    +
    v4_mapped
    ip::address_v6, ip::address_v6::v4_mapped
    @@ -4596,7 +4633,7 @@
    ip::v4_mapped_t, ip::v4_mapped_t
    -
    v6
    +
    v6
    ip::icmp, ip::icmp::v6
    @@ -4605,7 +4642,7 @@
    ip::udp, ip::udp::v6
    -
    value
    +
    value
    boost::system::is_error_code_enum< boost::asio::error::addrinfo_errors >, boost::system::is_error_code_enum< @@ -4650,19 +4687,21 @@
    serial_port_base::stop_bits, serial_port_base::stop_bits::value
    -
    values_
    +
    values_
    ip::basic_resolver_iterator, ip::basic_resolver_iterator::values_
    ip::basic_resolver_results, ip::basic_resolver_results::values_
    -
    value_type
    +
    value_type
    buffers_iterator, buffers_iterator::value_type
    const_buffers_1, const_buffers_1::value_type
    +
    experimental::awaitable, experimental::awaitable::value_type +
    ip::basic_address_iterator< address_v4 >, ip::basic_address_iterator< address_v4 >::value_type @@ -4680,7 +4719,7 @@
    null_buffers, null_buffers::value_type
    -
    verify_context
    +
    verify_context
    ssl::verify_context, ssl::verify_context::verify_context
    @@ -4688,7 +4727,7 @@

    W

    -
    wait
    +
    wait
    basic_datagram_socket, basic_datagram_socket::wait
    @@ -4713,7 +4752,7 @@
    windows::object_handle, windows::object_handle::wait
    -
    wait_error
    +
    wait_error
    basic_datagram_socket, basic_datagram_socket::wait_type
    @@ -4736,7 +4775,7 @@
    socket_base, socket_base::wait_type
    -
    wait_read
    +
    wait_read
    basic_datagram_socket, basic_datagram_socket::wait_type
    @@ -4759,7 +4798,7 @@
    socket_base, socket_base::wait_type
    -
    wait_type
    +
    wait_type
    basic_datagram_socket, basic_datagram_socket::wait_type
    @@ -4782,7 +4821,7 @@
    socket_base, socket_base::wait_type
    -
    wait_write
    +
    wait_write
    basic_datagram_socket, basic_datagram_socket::wait_type
    @@ -4805,31 +4844,31 @@
    socket_base, socket_base::wait_type
    -
    what
    +
    what
    bad_executor, bad_executor::what
    ip::bad_address_cast, ip::bad_address_cast::what
    -
    work
    +
    work
    io_context::work, io_context::work::work
    -
    would_block
    +
    would_block
    error::basic_errors, error::basic_errors
    -
    wrap
    +
    wrap
    io_context, io_context::wrap
    io_context::strand, io_context::strand::wrap
    -
    write, write +
    write, write
    -
    write_at, write_at +
    write_at, write_at
    -
    write_some
    +
    write_some
    basic_stream_socket, basic_stream_socket::write_some
    @@ -4848,14 +4887,14 @@
    windows::stream_handle, windows::stream_handle::write_some
    -
    write_some_at
    +
    write_some_at
    windows::random_access_handle, windows::random_access_handle::write_some_at

    Y

    -
    yield_context, yield_context +
    yield_context, yield_context
    @@ -4863,7 +4902,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/net_ts.html b/doc/html/boost_asio/net_ts.html index a727efc096..597972259b 100644 --- a/doc/html/boost_asio/net_ts.html +++ b/doc/html/boost_asio/net_ts.html @@ -1214,7 +1214,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/overview.html b/doc/html/boost_asio/overview.html index d7ec25b0bb..4f6c5f0b08 100644 --- a/doc/html/boost_asio/overview.html +++ b/doc/html/boost_asio/overview.html @@ -79,6 +79,10 @@
  • Stackful Coroutines
    • +
  • + Coroutines + TS Support (experimental) +
  • @@ -184,7 +188,7 @@ -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/overview/core.html b/doc/html/boost_asio/overview/core.html index d3cffb3fcf..044ea44c3f 100644 --- a/doc/html/boost_asio/overview/core.html +++ b/doc/html/boost_asio/overview/core.html @@ -70,11 +70,15 @@
  • Stackful Coroutines
    • +
  • + Coroutines TS + Support (experimental) +
    • -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/overview/core/allocation.html b/doc/html/boost_asio/overview/core/allocation.html index c29f0215c4..9a4a83db65 100644 --- a/doc/html/boost_asio/overview/core/allocation.html +++ b/doc/html/boost_asio/overview/core/allocation.html @@ -129,7 +129,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/overview/core/async.html b/doc/html/boost_asio/overview/core/async.html index 80f3abf156..892b38f353 100644 --- a/doc/html/boost_asio/overview/core/async.html +++ b/doc/html/boost_asio/overview/core/async.html @@ -274,7 +274,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/overview/core/basics.html b/doc/html/boost_asio/overview/core/basics.html index 2fd0eec986..bd9d71188c 100644 --- a/doc/html/boost_asio/overview/core/basics.html +++ b/doc/html/boost_asio/overview/core/basics.html @@ -159,7 +159,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/overview/core/buffers.html b/doc/html/boost_asio/overview/core/buffers.html index 5950760055..7616d0e9c5 100644 --- a/doc/html/boost_asio/overview/core/buffers.html +++ b/doc/html/boost_asio/overview/core/buffers.html @@ -232,7 +232,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/overview/core/concurrency_hint.html b/doc/html/boost_asio/overview/core/concurrency_hint.html index ac2b87339c..d6561f41ca 100644 --- a/doc/html/boost_asio/overview/core/concurrency_hint.html +++ b/doc/html/boost_asio/overview/core/concurrency_hint.html @@ -161,7 +161,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/overview/core/coroutine.html b/doc/html/boost_asio/overview/core/coroutine.html index 86da571741..fbb9c59642 100644 --- a/doc/html/boost_asio/overview/core/coroutine.html +++ b/doc/html/boost_asio/overview/core/coroutine.html @@ -76,7 +76,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/overview/core/coroutines_ts.html b/doc/html/boost_asio/overview/core/coroutines_ts.html new file mode 100644 index 0000000000..985b524859 --- /dev/null +++ b/doc/html/boost_asio/overview/core/coroutines_ts.html @@ -0,0 +1,155 @@ + + + +Coroutines TS Support (experimental) + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +

    + (Note: "Experimental" means that this interface is provided to + gather feedback and may change in subsequent Asio releases.) +

    +

    + Experimental support for the Coroutines TS is provided via the experimental::co_spawn() + function. This co_spawn() function enables programs to implement + asynchronous logic in a synchronous manner, in conjunction with the co_await + keyword, as shown in the following example: +

    +
    boost::asio::experimental::co_spawn(executor,
+    [socket = std::move(socket)]() mutable
+    {
+      return echo(std::move(socket));
+    },
+    boost::asio::experimental::detached);
+
+// ...
+
+boost::asio::experimental::awaitable<void> echo(tcp::socket socket)
+{
+  auto token = co_await boost::asio::experimental::this_coro::token();
+
+  try
+  {
+    char data[1024];
+    for (;;)
+    {
+      std::size_t n = co_await socket.async_read_some(boost::asio::buffer(data), token);
+      co_await async_write(socket, boost::asio::buffer(data, n), token);
+    }
+  }
+  catch (std::exception& e)
+  {
+    std::printf("echo Exception: %s\n", e.what());
+  }
+}
+
    +

    + The first argument to co_spawn() is an executor + that determines the context in which the coroutine is permitted to execute. + For example, a server's per-client object may consist of multiple coroutines; + they should all run on the same strand so that no explicit + synchronisation is required. +

    +

    + The second argument is a nullary function object that returns a boost::asio::awaitable<R>, + where R is the type of return value produced by the coroutine. + In the above example, the coroutine returns void. +

    +

    + The third argument is a completion token, and this is used by co_spawn() + to produce a completion handler with signature void(std::exception_ptr, + R). This completion handler is invoked with the result of the coroutine + once it has finished. In the above example we pass a completion token type, + boost::asio::experimental::detached, + which is used to explicitly ignore the result of an asynchronous operation. +

    +

    + In this example the body of the coroutine is implemented in the echo + function. This function first obtains a completion token that represents + the current coroutine: +

    +
    auto token = co_await boost::asio::experimental::this_coro::token();
+
    +

    + When this completion token is passed to an asynchronous operation, the + operation's initiating function returns an awaitable that + may be used with the co_await keyword: +

    +
    std::size_t n = co_await socket.async_read_some(boost::asio::buffer(data), token);
+
    +

    + Where an asynchronous operation's handler signature has the form: +

    +
    void handler(boost::system::error_code ec, result_type result);
+
    +

    + the resulting type of the co_await expression is result_type. + In the async_read_some example above, this is size_t. + If the asynchronous operation fails, the error_code is converted + into a system_error exception and thrown. +

    +

    + Where a handler signature has the form: +

    +
    void handler(boost::system::error_code ec);
+
    +

    + the co_await expression produces a void result. + As above, an error is passed back to the coroutine as a system_error + exception. +

    +
    + + See + Also +
    +

    + experimental::co_spawn, + experimental::detached, + experimental::redirect_error, + experimental::awaitable, + experimental::await_token, + experimental::this_coro::executor, + experimental::this_coro::token, + Coroutines + TS examples, Stackful + Coroutines, Stackless + Coroutines. +

    +
    + + + +
    Copyright © 2003-2018 Christopher M. Kohlhoff

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost_asio/overview/core/handler_tracking.html b/doc/html/boost_asio/overview/core/handler_tracking.html index 68279e2f9c..edbb2d4715 100644 --- a/doc/html/boost_asio/overview/core/handler_tracking.html +++ b/doc/html/boost_asio/overview/core/handler_tracking.html @@ -408,7 +408,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/overview/core/line_based.html b/doc/html/boost_asio/overview/core/line_based.html index 9147f63cfb..e63a499f42 100644 --- a/doc/html/boost_asio/overview/core/line_based.html +++ b/doc/html/boost_asio/overview/core/line_based.html @@ -150,7 +150,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/overview/core/reactor.html b/doc/html/boost_asio/overview/core/reactor.html index 4afd7ec4a3..0e29ac381e 100644 --- a/doc/html/boost_asio/overview/core/reactor.html +++ b/doc/html/boost_asio/overview/core/reactor.html @@ -72,7 +72,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/overview/core/spawn.html b/doc/html/boost_asio/overview/core/spawn.html index c57e00bdb0..3171231aa3 100644 --- a/doc/html/boost_asio/overview/core/spawn.html +++ b/doc/html/boost_asio/overview/core/spawn.html @@ -7,7 +7,7 @@ - + @@ -20,7 +20,7 @@
    -PrevUpHomeNext +PrevUpHomeNext

    @@ -139,7 +139,7 @@ std::size_t length =

    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    @@ -147,7 +147,7 @@ std::size_t length =
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost_asio/overview/core/strands.html b/doc/html/boost_asio/overview/core/strands.html index 3326545ebd..802e536252 100644 --- a/doc/html/boost_asio/overview/core/strands.html +++ b/doc/html/boost_asio/overview/core/strands.html @@ -156,7 +156,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/overview/core/streams.html b/doc/html/boost_asio/overview/core/streams.html index b3c1e0129f..3b2cb44166 100644 --- a/doc/html/boost_asio/overview/core/streams.html +++ b/doc/html/boost_asio/overview/core/streams.html @@ -113,7 +113,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/overview/core/threads.html b/doc/html/boost_asio/overview/core/threads.html index 2faa780947..e32cce69c2 100644 --- a/doc/html/boost_asio/overview/core/threads.html +++ b/doc/html/boost_asio/overview/core/threads.html @@ -116,7 +116,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/overview/cpp2011.html b/doc/html/boost_asio/overview/cpp2011.html index 930b9070bf..f26154fdf3 100644 --- a/doc/html/boost_asio/overview/cpp2011.html +++ b/doc/html/boost_asio/overview/cpp2011.html @@ -53,7 +53,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/overview/cpp2011/array.html b/doc/html/boost_asio/overview/cpp2011/array.html index c6652912ce..974193f595 100644 --- a/doc/html/boost_asio/overview/cpp2011/array.html +++ b/doc/html/boost_asio/overview/cpp2011/array.html @@ -55,7 +55,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/overview/cpp2011/atomic.html b/doc/html/boost_asio/overview/cpp2011/atomic.html index 853ec6de38..39d0e73bc0 100644 --- a/doc/html/boost_asio/overview/cpp2011/atomic.html +++ b/doc/html/boost_asio/overview/cpp2011/atomic.html @@ -40,7 +40,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/overview/cpp2011/chrono.html b/doc/html/boost_asio/overview/cpp2011/chrono.html index 4e931eb0a6..5559be1066 100644 --- a/doc/html/boost_asio/overview/cpp2011/chrono.html +++ b/doc/html/boost_asio/overview/cpp2011/chrono.html @@ -52,7 +52,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/overview/cpp2011/futures.html b/doc/html/boost_asio/overview/cpp2011/futures.html index 3a36cc3d6b..85458783fe 100644 --- a/doc/html/boost_asio/overview/cpp2011/futures.html +++ b/doc/html/boost_asio/overview/cpp2011/futures.html @@ -66,7 +66,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/overview/cpp2011/move_handlers.html b/doc/html/boost_asio/overview/cpp2011/move_handlers.html index 14c35329f0..b261d6e97f 100644 --- a/doc/html/boost_asio/overview/cpp2011/move_handlers.html +++ b/doc/html/boost_asio/overview/cpp2011/move_handlers.html @@ -77,7 +77,7 @@ void async_XYZ(..., Handler&& handler);
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/overview/cpp2011/move_objects.html b/doc/html/boost_asio/overview/cpp2011/move_objects.html index 954be1c9e5..d7a0589f29 100644 --- a/doc/html/boost_asio/overview/cpp2011/move_objects.html +++ b/doc/html/boost_asio/overview/cpp2011/move_objects.html @@ -95,7 +95,7 @@ sockets.push_back(tcp::socket(...));
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/overview/cpp2011/shared_ptr.html b/doc/html/boost_asio/overview/cpp2011/shared_ptr.html index b6d26635ab..cef976f35d 100644 --- a/doc/html/boost_asio/overview/cpp2011/shared_ptr.html +++ b/doc/html/boost_asio/overview/cpp2011/shared_ptr.html @@ -40,7 +40,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/overview/cpp2011/variadic.html b/doc/html/boost_asio/overview/cpp2011/variadic.html index 4753f08e22..9642728530 100644 --- a/doc/html/boost_asio/overview/cpp2011/variadic.html +++ b/doc/html/boost_asio/overview/cpp2011/variadic.html @@ -41,7 +41,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/overview/implementation.html b/doc/html/boost_asio/overview/implementation.html index 51bb96b34c..537e5e775a 100644 --- a/doc/html/boost_asio/overview/implementation.html +++ b/doc/html/boost_asio/overview/implementation.html @@ -484,7 +484,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/overview/networking.html b/doc/html/boost_asio/overview/networking.html index b7027f8efd..5f5f1d327b 100644 --- a/doc/html/boost_asio/overview/networking.html +++ b/doc/html/boost_asio/overview/networking.html @@ -6,7 +6,7 @@ - + @@ -20,7 +20,7 @@
    -PrevUpHomeNext +PrevUpHomeNext

    @@ -46,7 +46,7 @@

    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    @@ -54,7 +54,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost_asio/overview/networking/bsd_sockets.html b/doc/html/boost_asio/overview/networking/bsd_sockets.html index 8aee302074..3d05c55765 100644 --- a/doc/html/boost_asio/overview/networking/bsd_sockets.html +++ b/doc/html/boost_asio/overview/networking/bsd_sockets.html @@ -538,7 +538,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/overview/networking/iostreams.html b/doc/html/boost_asio/overview/networking/iostreams.html index d6854c497e..8cc411408f 100644 --- a/doc/html/boost_asio/overview/networking/iostreams.html +++ b/doc/html/boost_asio/overview/networking/iostreams.html @@ -105,7 +105,7 @@ std::cout << stream.rdbuf();
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/overview/networking/other_protocols.html b/doc/html/boost_asio/overview/networking/other_protocols.html index 310f34d9d8..3005c63e44 100644 --- a/doc/html/boost_asio/overview/networking/other_protocols.html +++ b/doc/html/boost_asio/overview/networking/other_protocols.html @@ -143,7 +143,7 @@ my_acceptor.accept(my_socket);
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/overview/networking/protocols.html b/doc/html/boost_asio/overview/networking/protocols.html index e6260ddfa1..43ea4e762f 100644 --- a/doc/html/boost_asio/overview/networking/protocols.html +++ b/doc/html/boost_asio/overview/networking/protocols.html @@ -194,7 +194,7 @@ ip::icmp::socket socket(my_io_context, endpoint);
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/overview/posix.html b/doc/html/boost_asio/overview/posix.html index d890649fd3..90f8e7d420 100644 --- a/doc/html/boost_asio/overview/posix.html +++ b/doc/html/boost_asio/overview/posix.html @@ -39,7 +39,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/overview/posix/fork.html b/doc/html/boost_asio/overview/posix/fork.html index 0c01c53ac0..196e33382a 100644 --- a/doc/html/boost_asio/overview/posix/fork.html +++ b/doc/html/boost_asio/overview/posix/fork.html @@ -69,7 +69,7 @@ else
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/overview/posix/local.html b/doc/html/boost_asio/overview/posix/local.html index 0d93b4cf9a..0ad86f3ada 100644 --- a/doc/html/boost_asio/overview/posix/local.html +++ b/doc/html/boost_asio/overview/posix/local.html @@ -96,7 +96,7 @@ socket.connect(ep);
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/overview/posix/stream_descriptor.html b/doc/html/boost_asio/overview/posix/stream_descriptor.html index 97dd1f3b19..3014dc0ce5 100644 --- a/doc/html/boost_asio/overview/posix/stream_descriptor.html +++ b/doc/html/boost_asio/overview/posix/stream_descriptor.html @@ -78,7 +78,7 @@ posix::stream_descriptor out(my_io_context, ::dup(STDOUT_FILENO));
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/overview/rationale.html b/doc/html/boost_asio/overview/rationale.html index 410c63e049..d814f83264 100644 --- a/doc/html/boost_asio/overview/rationale.html +++ b/doc/html/boost_asio/overview/rationale.html @@ -89,7 +89,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/overview/serial_ports.html b/doc/html/boost_asio/overview/serial_ports.html index c23049a43b..c855ff991d 100644 --- a/doc/html/boost_asio/overview/serial_ports.html +++ b/doc/html/boost_asio/overview/serial_ports.html @@ -74,7 +74,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/overview/signals.html b/doc/html/boost_asio/overview/signals.html index b35622b114..fde001ab4d 100644 --- a/doc/html/boost_asio/overview/signals.html +++ b/doc/html/boost_asio/overview/signals.html @@ -68,7 +68,7 @@ signals.async_wait(handler);
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/overview/ssl.html b/doc/html/boost_asio/overview/ssl.html index 5afde5ceda..c8211f0466 100644 --- a/doc/html/boost_asio/overview/ssl.html +++ b/doc/html/boost_asio/overview/ssl.html @@ -179,7 +179,7 @@ sock.handshake(ssl_socket::client);
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/overview/timers.html b/doc/html/boost_asio/overview/timers.html index ede0969b40..539e882c66 100644 --- a/doc/html/boost_asio/overview/timers.html +++ b/doc/html/boost_asio/overview/timers.html @@ -80,7 +80,7 @@ t2.expires_at(t.expires_at() + boost::posix_time::seconds(30));
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/overview/windows.html b/doc/html/boost_asio/overview/windows.html index 8ac44dfbcb..2503cb0abf 100644 --- a/doc/html/boost_asio/overview/windows.html +++ b/doc/html/boost_asio/overview/windows.html @@ -40,7 +40,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/overview/windows/object_handle.html b/doc/html/boost_asio/overview/windows/object_handle.html index 2894795080..d606443f61 100644 --- a/doc/html/boost_asio/overview/windows/object_handle.html +++ b/doc/html/boost_asio/overview/windows/object_handle.html @@ -87,7 +87,7 @@ windows::object_handle file(my_io_context, handle);
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/overview/windows/random_access_handle.html b/doc/html/boost_asio/overview/windows/random_access_handle.html index 038aece148..524f17265a 100644 --- a/doc/html/boost_asio/overview/windows/random_access_handle.html +++ b/doc/html/boost_asio/overview/windows/random_access_handle.html @@ -69,7 +69,7 @@ windows::random_access_handle file(my_io_context, handle);
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/overview/windows/stream_handle.html b/doc/html/boost_asio/overview/windows/stream_handle.html index 4876633b4f..45cd956a73 100644 --- a/doc/html/boost_asio/overview/windows/stream_handle.html +++ b/doc/html/boost_asio/overview/windows/stream_handle.html @@ -71,7 +71,7 @@ windows::stream_handle pipe(my_io_context, handle);
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference.html b/doc/html/boost_asio/reference.html index e813759004..c8a4303e0f 100644 --- a/doc/html/boost_asio/reference.html +++ b/doc/html/boost_asio/reference.html @@ -6,7 +6,7 @@ - + @@ -20,7 +20,7 @@
    -PrevUpHomeNext +PrevUpHomeNext

    @@ -36,12 +36,12 @@

    -Core

    +Core

    -Classes

    +Classes @@ -65,7 +65,7 @@
    coroutine
    execution_context

    -Free Functions

    +Free Functions @@ -86,7 +86,7 @@
    add_service
    asio_handler_allocate

    -Class Templates

    +Class Templates @@ -97,13 +97,13 @@
    async_completion
    basic_io_object
    use_future_t

    -Special Values

    +Special Values
    executor_arg
    use_future

    -Boost.Bind Placeholders

    +Boost.Bind Placeholders @@ -115,7 +115,7 @@
    placeholders::bytes_transferred
    placeholders::endpoint

    -Error Codes

    +Error Codes @@ -123,7 +123,7 @@
    error::basic_errors
    error::netdb_errors
    error::misc_errors

    -Type Traits

    +Type Traits @@ -134,7 +134,7 @@
    associated_allocator
    associated_executor
    uses_executor

    -Type Requirements

    +Type Requirements @@ -155,12 +155,12 @@
    Asynchronous operations
    CompletionHandler

    -Buffers and Buffer-Oriented Operations

    +Buffers and Buffer-Oriented Operations

    -Classes

    +Classes @@ -173,7 +173,7 @@
    const_buffer
    mutable_buffer
    streambuf

    -Class Templates

    +Class Templates @@ -186,7 +186,7 @@
    basic_streambuf
    buffered_read_stream

    -Free Functions

    +Free Functions @@ -213,7 +213,7 @@
    async_read
    async_read_at

    -Type Traits

    +Type Traits @@ -224,7 +224,7 @@
    is_const_buffer_sequence
    is_match_condition

    -Type Requirements

    +Type Requirements @@ -254,12 +254,12 @@
    Read and write operations
    AsyncRandomAccessReadDevice

    -Networking

    +Networking

    -Classes

    +Classes @@ -303,7 +303,7 @@
    generic::datagram_protocol
    generic::datagram_protocol::endpoint

    -Free Functions

    +Free Functions @@ -315,7 +315,7 @@
    async_connect
    connect
    ip::make_network_v6

    -Class Templates

    +Class Templates @@ -335,7 +335,7 @@
    basic_datagram_socket
    basic_raw_socket

    -Socket Options

    +Socket Options @@ -360,10 +360,10 @@
    ip::multicast::enable_loopback
    ip::multicast::hops

    -I/O Control Commands

    +I/O Control Commands
    socket_base::bytes_readable

    -Type Requirements

    +Type Requirements @@ -396,25 +396,25 @@
    Synchronous socket operations
    Asynchronous socket operations

    -Timers

    +Timers

    -SSL

    +SSL

    -Serial Ports

    +Serial Ports

    -Signal Handling

    +Signal Handling

    -Classes

    +Classes @@ -422,7 +422,7 @@
    deadline_timer
    high_resolution_timer
    system_timer

    -Class Templates

    +Class Templates @@ -430,7 +430,7 @@
    basic_deadline_timer
    basic_waitable_timer
    wait_traits

    -Type Requirements

    +Type Requirements @@ -439,7 +439,7 @@
    TimeTraits
    WaitHandler

    -Classes

    +Classes @@ -448,10 +448,10 @@
    ssl::context
    ssl::context_base
    ssl::verify_context

    -Class Templates

    +Class Templates
    ssl::stream

    -Type Requirements

    +Type Requirements @@ -460,13 +460,13 @@
    BufferedHandshakeHandler
    HandshakeHandler

    -Classes

    +Classes
    serial_port
    serial_port_base

    -Serial Port Options

    +Serial Port Options @@ -475,7 +475,7 @@
    serial_port_base::baud_rate
    serial_port_base::flow_control
    serial_port_base::character_size

    -Type Requirements

    +Type Requirements @@ -483,10 +483,10 @@ @@ -501,17 +501,21 @@ - +
    GettableSerialPortOption
    SettableSerialPortOption

    -Classes

    +Classes
    signal_set

    -Type Requirements

    +Type Requirements
    SignalHandler

    -POSIX-specific

    +POSIX-specific     		+ +

    +Windows-specific

    +

    -Windows-specific

    +Experimental

    -Classes

    +Classes @@ -528,15 +532,15 @@ - +
    local::stream_protocol
    local::stream_protocol::acceptor

    -Free Functions

    +Free Functions
    local::connect_pair

    -Class Templates

    +Class Templates
    local::basic_endpoint
    		 +

    -Classes

    +Classes @@ -545,13 +549,39 @@
    windows::object_handle
    windows::overlapped_handle
    windows::stream_handle
    		 +

    +Classes

    + + + + +
    experimental::detached_t
    experimental::this_coro::executor_t
    experimental::this_coro::token_t
    +

    +Class Templates

    + + + + +
    experimental::awaitable
    experimental::await_token
    experimental::redirect_error_t
    +

    +Free Functions

    + + + + +
    experimental::co_spawn
    experimental::this_coro::executor
    experimental::this_coro::token
    +

    +Special Values

    +
    experimental::detached
    +
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    @@ -559,7 +589,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost_asio/reference/AcceptHandler.html b/doc/html/boost_asio/reference/AcceptHandler.html index f467209fd2..7dfb07da64 100644 --- a/doc/html/boost_asio/reference/AcceptHandler.html +++ b/doc/html/boost_asio/reference/AcceptHandler.html @@ -97,7 +97,7 @@ acceptor.async_accept(..., -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/AcceptableProtocol.html b/doc/html/boost_asio/reference/AcceptableProtocol.html index 0011ff3d1f..5025e64306 100644 --- a/doc/html/boost_asio/reference/AcceptableProtocol.html +++ b/doc/html/boost_asio/reference/AcceptableProtocol.html @@ -80,7 +80,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/AsyncRandomAccessReadDevice.html b/doc/html/boost_asio/reference/AsyncRandomAccessReadDevice.html index 1aa7238ed2..bcc9d62d48 100644 --- a/doc/html/boost_asio/reference/AsyncRandomAccessReadDevice.html +++ b/doc/html/boost_asio/reference/AsyncRandomAccessReadDevice.html @@ -121,7 +121,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/AsyncRandomAccessWriteDevice.html b/doc/html/boost_asio/reference/AsyncRandomAccessWriteDevice.html index fb5ec8f1cc..ad4abddd3b 100644 --- a/doc/html/boost_asio/reference/AsyncRandomAccessWriteDevice.html +++ b/doc/html/boost_asio/reference/AsyncRandomAccessWriteDevice.html @@ -121,7 +121,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/AsyncReadStream.html b/doc/html/boost_asio/reference/AsyncReadStream.html index 8115a970f2..aa31cd6ccd 100644 --- a/doc/html/boost_asio/reference/AsyncReadStream.html +++ b/doc/html/boost_asio/reference/AsyncReadStream.html @@ -121,7 +121,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/AsyncWriteStream.html b/doc/html/boost_asio/reference/AsyncWriteStream.html index 7bd3d9dae6..0524452a0c 100644 --- a/doc/html/boost_asio/reference/AsyncWriteStream.html +++ b/doc/html/boost_asio/reference/AsyncWriteStream.html @@ -118,7 +118,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/BufferedHandshakeHandler.html b/doc/html/boost_asio/reference/BufferedHandshakeHandler.html index 08325e1eea..7e4938ed71 100644 --- a/doc/html/boost_asio/reference/BufferedHandshakeHandler.html +++ b/doc/html/boost_asio/reference/BufferedHandshakeHandler.html @@ -82,7 +82,7 @@ socket.async_handshake(...,
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/CompletionCondition.html b/doc/html/boost_asio/reference/CompletionCondition.html index 30246863de..8989b6ed03 100644 --- a/doc/html/boost_asio/reference/CompletionCondition.html +++ b/doc/html/boost_asio/reference/CompletionCondition.html @@ -99,7 +99,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/CompletionHandler.html b/doc/html/boost_asio/reference/CompletionHandler.html index 2f471117df..03799b8447 100644 --- a/doc/html/boost_asio/reference/CompletionHandler.html +++ b/doc/html/boost_asio/reference/CompletionHandler.html @@ -91,7 +91,7 @@ my_io_service.post(boost::bind(&my_class::completion_handler, this));
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ConnectCondition.html b/doc/html/boost_asio/reference/ConnectCondition.html index feca8497fa..7fc938684a 100644 --- a/doc/html/boost_asio/reference/ConnectCondition.html +++ b/doc/html/boost_asio/reference/ConnectCondition.html @@ -92,7 +92,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ConnectHandler.html b/doc/html/boost_asio/reference/ConnectHandler.html index d6f0cb646a..f9e0feee4c 100644 --- a/doc/html/boost_asio/reference/ConnectHandler.html +++ b/doc/html/boost_asio/reference/ConnectHandler.html @@ -98,7 +98,7 @@ socket.async_connect(...,
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ConstBufferSequence.html b/doc/html/boost_asio/reference/ConstBufferSequence.html index 9cfe359ce7..86e0850e71 100644 --- a/doc/html/boost_asio/reference/ConstBufferSequence.html +++ b/doc/html/boost_asio/reference/ConstBufferSequence.html @@ -122,7 +122,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/DynamicBuffer.html b/doc/html/boost_asio/reference/DynamicBuffer.html index 011d0a8a67..d39ca46115 100644 --- a/doc/html/boost_asio/reference/DynamicBuffer.html +++ b/doc/html/boost_asio/reference/DynamicBuffer.html @@ -249,7 +249,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/Endpoint.html b/doc/html/boost_asio/reference/Endpoint.html index c9f252f214..38f840a46d 100644 --- a/doc/html/boost_asio/reference/Endpoint.html +++ b/doc/html/boost_asio/reference/Endpoint.html @@ -244,7 +244,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/EndpointSequence.html b/doc/html/boost_asio/reference/EndpointSequence.html index 455ecb81b2..eb89b148bf 100644 --- a/doc/html/boost_asio/reference/EndpointSequence.html +++ b/doc/html/boost_asio/reference/EndpointSequence.html @@ -87,7 +87,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ExecutionContext.html b/doc/html/boost_asio/reference/ExecutionContext.html index dfc112a4b3..9136b9ae8e 100644 --- a/doc/html/boost_asio/reference/ExecutionContext.html +++ b/doc/html/boost_asio/reference/ExecutionContext.html @@ -116,7 +116,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/Executor1.html b/doc/html/boost_asio/reference/Executor1.html index 7fd671dd29..ab06b099c3 100644 --- a/doc/html/boost_asio/reference/Executor1.html +++ b/doc/html/boost_asio/reference/Executor1.html @@ -282,7 +282,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/GettableSerialPortOption.html b/doc/html/boost_asio/reference/GettableSerialPortOption.html index 6e81672c33..04ad82908b 100644 --- a/doc/html/boost_asio/reference/GettableSerialPortOption.html +++ b/doc/html/boost_asio/reference/GettableSerialPortOption.html @@ -87,7 +87,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/GettableSocketOption.html b/doc/html/boost_asio/reference/GettableSocketOption.html index 4c24bfc348..77e328e9e7 100644 --- a/doc/html/boost_asio/reference/GettableSocketOption.html +++ b/doc/html/boost_asio/reference/GettableSocketOption.html @@ -167,7 +167,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/Handler.html b/doc/html/boost_asio/reference/Handler.html index 2e19f181a4..bccfbb65f9 100644 --- a/doc/html/boost_asio/reference/Handler.html +++ b/doc/html/boost_asio/reference/Handler.html @@ -27,8 +27,8 @@ Handlers

    - A handler must meet the requirements of CopyConstructible types - (C++ Std, 20.1.3). + A handler must meet the requirements of MoveConstructible types + (C++Std [moveconstructible]).

    In the table below, X denotes a handler class, h @@ -142,7 +142,7 @@ asio_handler_invoke(f, &h); -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/HandshakeHandler.html b/doc/html/boost_asio/reference/HandshakeHandler.html index 9f464b5c2a..584a892b59 100644 --- a/doc/html/boost_asio/reference/HandshakeHandler.html +++ b/doc/html/boost_asio/reference/HandshakeHandler.html @@ -100,7 +100,7 @@ ssl_stream.async_handshake(...,
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/InternetProtocol.html b/doc/html/boost_asio/reference/InternetProtocol.html index 13e5365e9e..a263cf18ff 100644 --- a/doc/html/boost_asio/reference/InternetProtocol.html +++ b/doc/html/boost_asio/reference/InternetProtocol.html @@ -156,7 +156,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/IoControlCommand.html b/doc/html/boost_asio/reference/IoControlCommand.html index 90c7dd703c..da1bea392f 100644 --- a/doc/html/boost_asio/reference/IoControlCommand.html +++ b/doc/html/boost_asio/reference/IoControlCommand.html @@ -101,7 +101,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/IoObjectService.html b/doc/html/boost_asio/reference/IoObjectService.html index 1b258f12d0..63619e9dd2 100644 --- a/doc/html/boost_asio/reference/IoObjectService.html +++ b/doc/html/boost_asio/reference/IoObjectService.html @@ -163,7 +163,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/IteratorConnectHandler.html b/doc/html/boost_asio/reference/IteratorConnectHandler.html index a875f95abe..4b68c2713c 100644 --- a/doc/html/boost_asio/reference/IteratorConnectHandler.html +++ b/doc/html/boost_asio/reference/IteratorConnectHandler.html @@ -7,7 +7,7 @@ - + @@ -20,7 +20,7 @@
    -PrevUpHomeNext +PrevUpHomeNext

    @@ -110,7 +110,7 @@ boost::asio::async_connect(...,

    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    @@ -118,7 +118,7 @@ boost::asio::async_connect(...,
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost_asio/reference/LegacyCompletionHandler.html b/doc/html/boost_asio/reference/LegacyCompletionHandler.html new file mode 100644 index 0000000000..edee929978 --- /dev/null +++ b/doc/html/boost_asio/reference/LegacyCompletionHandler.html @@ -0,0 +1,106 @@ + + + +Legacy completion handler requirements + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +

    + A legacy completion handler must meet the requirements for a handler. + A legacy completion handler must meet the requirements of CopyConstructible + types (C++Std [copyconstructible]). A value h of a completion + handler class should work correctly in the expression h(). +

    +
    + + Examples +
    +

    + A free function as a completion handler: +

    +
    void completion_handler()
+{
+  ...
+}
+
    +

    + A completion handler function object: +

    +
    struct completion_handler
+{
+  ...
+  void operator()()
+  {
+    ...
+  }
+  ...
+};
+
    +

    + A lambda as a completion handler: +

    +
    my_io_service.post(
+    []()
+    {
+      ...
+    });
+
    +

    + A non-static class member function adapted to a completion handler using + std::bind(): +

    +
    void my_class::completion_handler()
+{
+  ...
+}
+...
+my_io_service.post(std::bind(&my_class::completion_handler, this));
+
    +

    + A non-static class member function adapted to a completion handler using + boost::bind(): +

    +
    void my_class::completion_handler()
+{
+  ...
+}
+...
+my_io_service.post(boost::bind(&my_class::completion_handler, this));
+
    +
    + + + +
    Copyright © 2003-2018 Christopher M. Kohlhoff

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost_asio/reference/MoveAcceptHandler.html b/doc/html/boost_asio/reference/MoveAcceptHandler.html index 652d216edd..d3aedc89af 100644 --- a/doc/html/boost_asio/reference/MoveAcceptHandler.html +++ b/doc/html/boost_asio/reference/MoveAcceptHandler.html @@ -6,7 +6,7 @@ - + @@ -20,7 +20,7 @@
    -PrevUpHomeNext +PrevUpHomeNext

    @@ -89,7 +89,7 @@ boost::asio::async_accept(...,

    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    @@ -97,7 +97,7 @@ boost::asio::async_accept(...,
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost_asio/reference/MutableBufferSequence.html b/doc/html/boost_asio/reference/MutableBufferSequence.html index 71e017711b..c21868b613 100644 --- a/doc/html/boost_asio/reference/MutableBufferSequence.html +++ b/doc/html/boost_asio/reference/MutableBufferSequence.html @@ -122,7 +122,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ProtoAllocator.html b/doc/html/boost_asio/reference/ProtoAllocator.html index b55fa11a80..6d109ebe53 100644 --- a/doc/html/boost_asio/reference/ProtoAllocator.html +++ b/doc/html/boost_asio/reference/ProtoAllocator.html @@ -41,7 +41,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/Protocol.html b/doc/html/boost_asio/reference/Protocol.html index 9fb36f6e86..de082d05b9 100644 --- a/doc/html/boost_asio/reference/Protocol.html +++ b/doc/html/boost_asio/reference/Protocol.html @@ -169,7 +169,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/RangeConnectHandler.html b/doc/html/boost_asio/reference/RangeConnectHandler.html index 01ed5089a9..4866e4909e 100644 --- a/doc/html/boost_asio/reference/RangeConnectHandler.html +++ b/doc/html/boost_asio/reference/RangeConnectHandler.html @@ -110,7 +110,7 @@ boost::asio::async_connect(...,
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ReadHandler.html b/doc/html/boost_asio/reference/ReadHandler.html index 7a789804de..ae1f3e3873 100644 --- a/doc/html/boost_asio/reference/ReadHandler.html +++ b/doc/html/boost_asio/reference/ReadHandler.html @@ -105,7 +105,7 @@ socket.async_read(...,
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ResolveHandler.html b/doc/html/boost_asio/reference/ResolveHandler.html index a04c43cdc6..068284761a 100644 --- a/doc/html/boost_asio/reference/ResolveHandler.html +++ b/doc/html/boost_asio/reference/ResolveHandler.html @@ -108,7 +108,7 @@ resolver.async_resolve(...,
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/Service.html b/doc/html/boost_asio/reference/Service.html index 69f1a1a169..7118536551 100644 --- a/doc/html/boost_asio/reference/Service.html +++ b/doc/html/boost_asio/reference/Service.html @@ -66,7 +66,7 @@ private:
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/SettableSerialPortOption.html b/doc/html/boost_asio/reference/SettableSerialPortOption.html index d416bbbebe..c688c656fa 100644 --- a/doc/html/boost_asio/reference/SettableSerialPortOption.html +++ b/doc/html/boost_asio/reference/SettableSerialPortOption.html @@ -86,7 +86,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/SettableSocketOption.html b/doc/html/boost_asio/reference/SettableSocketOption.html index 24117509ea..409f0d93df 100644 --- a/doc/html/boost_asio/reference/SettableSocketOption.html +++ b/doc/html/boost_asio/reference/SettableSocketOption.html @@ -147,7 +147,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ShutdownHandler.html b/doc/html/boost_asio/reference/ShutdownHandler.html index d1448b47e2..15ee7a60de 100644 --- a/doc/html/boost_asio/reference/ShutdownHandler.html +++ b/doc/html/boost_asio/reference/ShutdownHandler.html @@ -98,7 +98,7 @@ ssl_stream.async_shutdown(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/SignalHandler.html b/doc/html/boost_asio/reference/SignalHandler.html index 3a2316f466..3f78be5dc8 100644 --- a/doc/html/boost_asio/reference/SignalHandler.html +++ b/doc/html/boost_asio/reference/SignalHandler.html @@ -105,7 +105,7 @@ my_signal_set.async_wait(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/SyncRandomAccessReadDevice.html b/doc/html/boost_asio/reference/SyncRandomAccessReadDevice.html index 820bf8bb49..f689cd2d69 100644 --- a/doc/html/boost_asio/reference/SyncRandomAccessReadDevice.html +++ b/doc/html/boost_asio/reference/SyncRandomAccessReadDevice.html @@ -118,7 +118,7 @@ return s;
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/SyncRandomAccessWriteDevice.html b/doc/html/boost_asio/reference/SyncRandomAccessWriteDevice.html index c476725659..d6edb23517 100644 --- a/doc/html/boost_asio/reference/SyncRandomAccessWriteDevice.html +++ b/doc/html/boost_asio/reference/SyncRandomAccessWriteDevice.html @@ -118,7 +118,7 @@ return s;
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/SyncReadStream.html b/doc/html/boost_asio/reference/SyncReadStream.html index 1a0fec8340..07daf45fe0 100644 --- a/doc/html/boost_asio/reference/SyncReadStream.html +++ b/doc/html/boost_asio/reference/SyncReadStream.html @@ -95,7 +95,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/SyncWriteStream.html b/doc/html/boost_asio/reference/SyncWriteStream.html index b07b7701de..85f4962545 100644 --- a/doc/html/boost_asio/reference/SyncWriteStream.html +++ b/doc/html/boost_asio/reference/SyncWriteStream.html @@ -93,7 +93,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/TimeTraits.html b/doc/html/boost_asio/reference/TimeTraits.html index 08727da5c6..d734aaaa88 100644 --- a/doc/html/boost_asio/reference/TimeTraits.html +++ b/doc/html/boost_asio/reference/TimeTraits.html @@ -190,7 +190,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/WaitHandler.html b/doc/html/boost_asio/reference/WaitHandler.html index 69fd5d1073..82135f85c3 100644 --- a/doc/html/boost_asio/reference/WaitHandler.html +++ b/doc/html/boost_asio/reference/WaitHandler.html @@ -97,7 +97,7 @@ socket.async_wait(...,
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/WaitTraits.html b/doc/html/boost_asio/reference/WaitTraits.html index ffe36cda36..53b0ed5dfb 100644 --- a/doc/html/boost_asio/reference/WaitTraits.html +++ b/doc/html/boost_asio/reference/WaitTraits.html @@ -122,7 +122,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/WriteHandler.html b/doc/html/boost_asio/reference/WriteHandler.html index 15a47bcc18..057a4c975f 100644 --- a/doc/html/boost_asio/reference/WriteHandler.html +++ b/doc/html/boost_asio/reference/WriteHandler.html @@ -105,7 +105,7 @@ socket.async_write(...,
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/add_service.html b/doc/html/boost_asio/reference/add_service.html index b6b0c01342..76dc08fb1f 100644 --- a/doc/html/boost_asio/reference/add_service.html +++ b/doc/html/boost_asio/reference/add_service.html @@ -97,7 +97,7 @@ void add_service(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/asio_handler_allocate.html b/doc/html/boost_asio/reference/asio_handler_allocate.html index bccb1314cc..6a6af12d79 100644 --- a/doc/html/boost_asio/reference/asio_handler_allocate.html +++ b/doc/html/boost_asio/reference/asio_handler_allocate.html @@ -87,7 +87,7 @@ void asio_handler_deallocate(void* pointer, std::size_t size,
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/asio_handler_deallocate.html b/doc/html/boost_asio/reference/asio_handler_deallocate.html index be88a0bd4f..36156579be 100644 --- a/doc/html/boost_asio/reference/asio_handler_deallocate.html +++ b/doc/html/boost_asio/reference/asio_handler_deallocate.html @@ -57,7 +57,7 @@ Default
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/asio_handler_invoke.html b/doc/html/boost_asio/reference/asio_handler_invoke.html index cdf5ee3fea..7e6ac5527c 100644 --- a/doc/html/boost_asio/reference/asio_handler_invoke.html +++ b/doc/html/boost_asio/reference/asio_handler_invoke.html @@ -101,7 +101,7 @@ void asio_handler_invoke(Function function, my_handler* context)
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/asio_handler_invoke/overload1.html b/doc/html/boost_asio/reference/asio_handler_invoke/overload1.html index 7730206409..c4b96fc978 100644 --- a/doc/html/boost_asio/reference/asio_handler_invoke/overload1.html +++ b/doc/html/boost_asio/reference/asio_handler_invoke/overload1.html @@ -39,7 +39,7 @@ void asio_handler_invoke(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/asio_handler_invoke/overload2.html b/doc/html/boost_asio/reference/asio_handler_invoke/overload2.html index 93b6713079..6adfb73e91 100644 --- a/doc/html/boost_asio/reference/asio_handler_invoke/overload2.html +++ b/doc/html/boost_asio/reference/asio_handler_invoke/overload2.html @@ -39,7 +39,7 @@ void asio_handler_invoke(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/asio_handler_is_continuation.html b/doc/html/boost_asio/reference/asio_handler_is_continuation.html index fb3c6d81fc..275374490c 100644 --- a/doc/html/boost_asio/reference/asio_handler_is_continuation.html +++ b/doc/html/boost_asio/reference/asio_handler_is_continuation.html @@ -70,7 +70,7 @@ bool asio_handler_is_continuation(my_handler* context)
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/associated_allocator.html b/doc/html/boost_asio/reference/associated_allocator.html index 9ff8bc471d..80e6241d22 100644 --- a/doc/html/boost_asio/reference/associated_allocator.html +++ b/doc/html/boost_asio/reference/associated_allocator.html @@ -142,7 +142,7 @@ struct associated_allocator
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/associated_allocator/get.html b/doc/html/boost_asio/reference/associated_allocator/get.html index d3f6a880c9..6ec8a5ea77 100644 --- a/doc/html/boost_asio/reference/associated_allocator/get.html +++ b/doc/html/boost_asio/reference/associated_allocator/get.html @@ -39,7 +39,7 @@ If
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/associated_allocator/type.html b/doc/html/boost_asio/reference/associated_allocator/type.html index 856f516e7a..d20f9380c6 100644 --- a/doc/html/boost_asio/reference/associated_allocator/type.html +++ b/doc/html/boost_asio/reference/associated_allocator/type.html @@ -47,7 +47,7 @@ If
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/associated_executor.html b/doc/html/boost_asio/reference/associated_executor.html index dbf82065fa..5e7cf4e22c 100644 --- a/doc/html/boost_asio/reference/associated_executor.html +++ b/doc/html/boost_asio/reference/associated_executor.html @@ -142,7 +142,7 @@ struct associated_executor
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/associated_executor/get.html b/doc/html/boost_asio/reference/associated_executor/get.html index e35ea2203c..1e1d87a93a 100644 --- a/doc/html/boost_asio/reference/associated_executor/get.html +++ b/doc/html/boost_asio/reference/associated_executor/get.html @@ -39,7 +39,7 @@ If T
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/associated_executor/type.html b/doc/html/boost_asio/reference/associated_executor/type.html index ebdf2d960d..1e4394f595 100644 --- a/doc/html/boost_asio/reference/associated_executor/type.html +++ b/doc/html/boost_asio/reference/associated_executor/type.html @@ -47,7 +47,7 @@ If
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/async_completion.html b/doc/html/boost_asio/reference/async_completion.html index a497fccdf8..e9eaad4166 100644 --- a/doc/html/boost_asio/reference/async_completion.html +++ b/doc/html/boost_asio/reference/async_completion.html @@ -166,7 +166,7 @@ struct async_completion
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/async_completion/async_completion.html b/doc/html/boost_asio/reference/async_completion/async_completion.html index 1f9739b7f8..a3c6063fd3 100644 --- a/doc/html/boost_asio/reference/async_completion/async_completion.html +++ b/doc/html/boost_asio/reference/async_completion/async_completion.html @@ -40,7 +40,7 @@ Constructor.
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/async_completion/completion_handler.html b/doc/html/boost_asio/reference/async_completion/completion_handler.html index 43ced903cf..3479508c50 100644 --- a/doc/html/boost_asio/reference/async_completion/completion_handler.html +++ b/doc/html/boost_asio/reference/async_completion/completion_handler.html @@ -36,7 +36,7 @@ A
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/async_completion/completion_handler_type.html b/doc/html/boost_asio/reference/async_completion/completion_handler_type.html index 2569292aec..49cbee6637 100644 --- a/doc/html/boost_asio/reference/async_completion/completion_handler_type.html +++ b/doc/html/boost_asio/reference/async_completion/completion_handler_type.html @@ -168,7 +168,7 @@ The
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/async_completion/result.html b/doc/html/boost_asio/reference/async_completion/result.html index 11cee8ff75..4138e148b3 100644 --- a/doc/html/boost_asio/reference/async_completion/result.html +++ b/doc/html/boost_asio/reference/async_completion/result.html @@ -36,7 +36,7 @@ The result
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/async_connect.html b/doc/html/boost_asio/reference/async_connect.html index bb9b7c9abc..10f410b88b 100644 --- a/doc/html/boost_asio/reference/async_connect.html +++ b/doc/html/boost_asio/reference/async_connect.html @@ -116,7 +116,7 @@ template<
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/async_connect/overload1.html b/doc/html/boost_asio/reference/async_connect/overload1.html index 33ad14b484..1318e6dce7 100644 --- a/doc/html/boost_asio/reference/async_connect/overload1.html +++ b/doc/html/boost_asio/reference/async_connect/overload1.html @@ -126,7 +126,7 @@ void connect_handler(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/async_connect/overload2.html b/doc/html/boost_asio/reference/async_connect/overload2.html index c13c2c495e..3cf5ec7eab 100644 --- a/doc/html/boost_asio/reference/async_connect/overload2.html +++ b/doc/html/boost_asio/reference/async_connect/overload2.html @@ -102,7 +102,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/async_connect/overload3.html b/doc/html/boost_asio/reference/async_connect/overload3.html index 8589b5d721..b9d5f15fc0 100644 --- a/doc/html/boost_asio/reference/async_connect/overload3.html +++ b/doc/html/boost_asio/reference/async_connect/overload3.html @@ -116,7 +116,7 @@ void connect_handler(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/async_connect/overload4.html b/doc/html/boost_asio/reference/async_connect/overload4.html index e8be6a79df..1735593b01 100644 --- a/doc/html/boost_asio/reference/async_connect/overload4.html +++ b/doc/html/boost_asio/reference/async_connect/overload4.html @@ -176,7 +176,7 @@ void connect_handler(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/async_connect/overload5.html b/doc/html/boost_asio/reference/async_connect/overload5.html index 2f18beb080..3c0dbf3fcd 100644 --- a/doc/html/boost_asio/reference/async_connect/overload5.html +++ b/doc/html/boost_asio/reference/async_connect/overload5.html @@ -123,7 +123,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/async_connect/overload6.html b/doc/html/boost_asio/reference/async_connect/overload6.html index 6d38cfe3df..6bda894db5 100644 --- a/doc/html/boost_asio/reference/async_connect/overload6.html +++ b/doc/html/boost_asio/reference/async_connect/overload6.html @@ -181,7 +181,7 @@ void connect_handler(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/async_read.html b/doc/html/boost_asio/reference/async_read.html index 0def274024..4ca33449e8 100644 --- a/doc/html/boost_asio/reference/async_read.html +++ b/doc/html/boost_asio/reference/async_read.html @@ -63,7 +63,7 @@ template< AsyncReadStream & s, DynamicBuffer && buffers, ReadHandler && handler, - typename enable_if< is_dynamic_buffer< DynamicBuffer >::value >::type * = 0); + typename enable_if< is_dynamic_buffer< typename decay< DynamicBuffer >::type >::value >::type * = 0); » more... template< @@ -76,7 +76,7 @@ template< DynamicBuffer && buffers, CompletionCondition completion_condition, ReadHandler && handler, - typename enable_if< is_dynamic_buffer< DynamicBuffer >::value >::type * = 0); + typename enable_if< is_dynamic_buffer< typename decay< DynamicBuffer >::type >::value >::type * = 0); » more... template< @@ -114,7 +114,7 @@ template<
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/async_read/overload1.html b/doc/html/boost_asio/reference/async_read/overload1.html index 585a7a8b0e..331f106c9d 100644 --- a/doc/html/boost_asio/reference/async_read/overload1.html +++ b/doc/html/boost_asio/reference/async_read/overload1.html @@ -140,7 +140,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/async_read/overload2.html b/doc/html/boost_asio/reference/async_read/overload2.html index 9c290a89bf..80c347c6fb 100644 --- a/doc/html/boost_asio/reference/async_read/overload2.html +++ b/doc/html/boost_asio/reference/async_read/overload2.html @@ -146,7 +146,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/async_read/overload3.html b/doc/html/boost_asio/reference/async_read/overload3.html index f31d7129b4..16920e921d 100644 --- a/doc/html/boost_asio/reference/async_read/overload3.html +++ b/doc/html/boost_asio/reference/async_read/overload3.html @@ -39,7 +39,7 @@ AsyncReadStream & s, DynamicBuffer && buffers, ReadHandler && handler, - typename enable_if< is_dynamic_buffer< DynamicBuffer >::value >::type * = 0); + typename enable_if< is_dynamic_buffer< typename decay< DynamicBuffer >::type >::value >::type * = 0);

    This function is used to asynchronously read a certain number of bytes @@ -123,7 +123,7 @@

    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/async_read/overload4.html b/doc/html/boost_asio/reference/async_read/overload4.html index 6965fa8137..3c67c9dd14 100644 --- a/doc/html/boost_asio/reference/async_read/overload4.html +++ b/doc/html/boost_asio/reference/async_read/overload4.html @@ -41,7 +41,7 @@ DynamicBuffer && buffers, CompletionCondition completion_condition, ReadHandler && handler, - typename enable_if< is_dynamic_buffer< DynamicBuffer >::value >::type * = 0); + typename enable_if< is_dynamic_buffer< typename decay< DynamicBuffer >::type >::value >::type * = 0);

    This function is used to asynchronously read a certain number of bytes @@ -133,7 +133,7 @@

    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/async_read/overload5.html b/doc/html/boost_asio/reference/async_read/overload5.html index 7e56007f3a..7191814404 100644 --- a/doc/html/boost_asio/reference/async_read/overload5.html +++ b/doc/html/boost_asio/reference/async_read/overload5.html @@ -121,7 +121,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/async_read/overload6.html b/doc/html/boost_asio/reference/async_read/overload6.html index a5f3780b51..7bcf5b9bd0 100644 --- a/doc/html/boost_asio/reference/async_read/overload6.html +++ b/doc/html/boost_asio/reference/async_read/overload6.html @@ -131,7 +131,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/async_read_at.html b/doc/html/boost_asio/reference/async_read_at.html index 690143204e..cae2ee1af8 100644 --- a/doc/html/boost_asio/reference/async_read_at.html +++ b/doc/html/boost_asio/reference/async_read_at.html @@ -92,7 +92,7 @@ template<
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/async_read_at/overload1.html b/doc/html/boost_asio/reference/async_read_at/overload1.html index e4e00f11a2..b1a69c8134 100644 --- a/doc/html/boost_asio/reference/async_read_at/overload1.html +++ b/doc/html/boost_asio/reference/async_read_at/overload1.html @@ -141,7 +141,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/async_read_at/overload2.html b/doc/html/boost_asio/reference/async_read_at/overload2.html index a63c3aecdf..f1ebf93ded 100644 --- a/doc/html/boost_asio/reference/async_read_at/overload2.html +++ b/doc/html/boost_asio/reference/async_read_at/overload2.html @@ -150,7 +150,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/async_read_at/overload3.html b/doc/html/boost_asio/reference/async_read_at/overload3.html index 5f1e903082..9bb32a74e6 100644 --- a/doc/html/boost_asio/reference/async_read_at/overload3.html +++ b/doc/html/boost_asio/reference/async_read_at/overload3.html @@ -118,7 +118,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/async_read_at/overload4.html b/doc/html/boost_asio/reference/async_read_at/overload4.html index 2c95379b76..6ab8f1a646 100644 --- a/doc/html/boost_asio/reference/async_read_at/overload4.html +++ b/doc/html/boost_asio/reference/async_read_at/overload4.html @@ -128,7 +128,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/async_read_until.html b/doc/html/boost_asio/reference/async_read_until.html index f708a58b79..5f87bed7c4 100644 --- a/doc/html/boost_asio/reference/async_read_until.html +++ b/doc/html/boost_asio/reference/async_read_until.html @@ -138,7 +138,7 @@ template<
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/async_read_until/overload1.html b/doc/html/boost_asio/reference/async_read_until/overload1.html index 8f25c73450..39fc435597 100644 --- a/doc/html/boost_asio/reference/async_read_until/overload1.html +++ b/doc/html/boost_asio/reference/async_read_until/overload1.html @@ -172,7 +172,7 @@ boost::asio::async_read_until(s, data, '\n', handler);
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/async_read_until/overload2.html b/doc/html/boost_asio/reference/async_read_until/overload2.html index 3dab88e72b..881f1db572 100644 --- a/doc/html/boost_asio/reference/async_read_until/overload2.html +++ b/doc/html/boost_asio/reference/async_read_until/overload2.html @@ -172,7 +172,7 @@ boost::asio::async_read_until(s, data, "\r\n", handler);
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/async_read_until/overload3.html b/doc/html/boost_asio/reference/async_read_until/overload3.html index aeb9875df8..a7bf63103b 100644 --- a/doc/html/boost_asio/reference/async_read_until/overload3.html +++ b/doc/html/boost_asio/reference/async_read_until/overload3.html @@ -176,7 +176,7 @@ boost::asio::async_read_until(s, data,
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/async_read_until/overload4.html b/doc/html/boost_asio/reference/async_read_until/overload4.html index 04c0b6d806..8b0006971f 100644 --- a/doc/html/boost_asio/reference/async_read_until/overload4.html +++ b/doc/html/boost_asio/reference/async_read_until/overload4.html @@ -216,7 +216,7 @@ boost::asio::async_read_until(s, data, match_char('a'), handler);
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/async_read_until/overload5.html b/doc/html/boost_asio/reference/async_read_until/overload5.html index 0377d6ee9c..c6bff1630e 100644 --- a/doc/html/boost_asio/reference/async_read_until/overload5.html +++ b/doc/html/boost_asio/reference/async_read_until/overload5.html @@ -169,7 +169,7 @@ boost::asio::async_read_until(s, b, '\n', handler);
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/async_read_until/overload6.html b/doc/html/boost_asio/reference/async_read_until/overload6.html index 4dbaa2fac0..5009b8db0e 100644 --- a/doc/html/boost_asio/reference/async_read_until/overload6.html +++ b/doc/html/boost_asio/reference/async_read_until/overload6.html @@ -169,7 +169,7 @@ boost::asio::async_read_until(s, b, "\r\n", handler);
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/async_read_until/overload7.html b/doc/html/boost_asio/reference/async_read_until/overload7.html index a1c6081bc9..e43a1a77fc 100644 --- a/doc/html/boost_asio/reference/async_read_until/overload7.html +++ b/doc/html/boost_asio/reference/async_read_until/overload7.html @@ -172,7 +172,7 @@ boost::asio::async_read_until(s, b, boost::regex("\r\n"), handler);
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/async_read_until/overload8.html b/doc/html/boost_asio/reference/async_read_until/overload8.html index aaaaefdb23..acbbf3690b 100644 --- a/doc/html/boost_asio/reference/async_read_until/overload8.html +++ b/doc/html/boost_asio/reference/async_read_until/overload8.html @@ -212,7 +212,7 @@ boost::asio::async_read_until(s, b, match_char('a'), handler);
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/async_result.html b/doc/html/boost_asio/reference/async_result.html index ab073aad84..a0f496e2d8 100644 --- a/doc/html/boost_asio/reference/async_result.html +++ b/doc/html/boost_asio/reference/async_result.html @@ -168,7 +168,7 @@ class async_result
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/async_result/async_result.html b/doc/html/boost_asio/reference/async_result/async_result.html index eb9d896513..bbcce23212 100644 --- a/doc/html/boost_asio/reference/async_result/async_result.html +++ b/doc/html/boost_asio/reference/async_result/async_result.html @@ -43,7 +43,7 @@ Construct
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/async_result/completion_handler_type.html b/doc/html/boost_asio/reference/async_result/completion_handler_type.html index b677b29dc7..f4d4769d3e 100644 --- a/doc/html/boost_asio/reference/async_result/completion_handler_type.html +++ b/doc/html/boost_asio/reference/async_result/completion_handler_type.html @@ -46,7 +46,7 @@ The
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/async_result/get.html b/doc/html/boost_asio/reference/async_result/get.html index 9fdf3baf85..67bfa3762b 100644 --- a/doc/html/boost_asio/reference/async_result/get.html +++ b/doc/html/boost_asio/reference/async_result/get.html @@ -36,7 +36,7 @@ Obtain the value to
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/async_result/return_type.html b/doc/html/boost_asio/reference/async_result/return_type.html index 2593d983f0..cb703c1d98 100644 --- a/doc/html/boost_asio/reference/async_result/return_type.html +++ b/doc/html/boost_asio/reference/async_result/return_type.html @@ -46,7 +46,7 @@ The
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/async_result_lt__Handler__gt_.html b/doc/html/boost_asio/reference/async_result_lt__Handler__gt_.html index 76d1655da7..4d394ce5be 100644 --- a/doc/html/boost_asio/reference/async_result_lt__Handler__gt_.html +++ b/doc/html/boost_asio/reference/async_result_lt__Handler__gt_.html @@ -134,7 +134,7 @@ class async_result< Handler >
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/async_result_lt__Handler__gt_/async_result.html b/doc/html/boost_asio/reference/async_result_lt__Handler__gt_/async_result.html index c7bc3dc751..72b0c100fd 100644 --- a/doc/html/boost_asio/reference/async_result_lt__Handler__gt_/async_result.html +++ b/doc/html/boost_asio/reference/async_result_lt__Handler__gt_/async_result.html @@ -42,7 +42,7 @@ Construct an async result from a given handler.
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/async_result_lt__Handler__gt_/get.html b/doc/html/boost_asio/reference/async_result_lt__Handler__gt_/get.html index 22e7ea02ec..ecd98ccd9c 100644 --- a/doc/html/boost_asio/reference/async_result_lt__Handler__gt_/get.html +++ b/doc/html/boost_asio/reference/async_result_lt__Handler__gt_/get.html @@ -36,7 +36,7 @@ Obtain the value to be returned from the initiating function.
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/async_result_lt__Handler__gt_/type.html b/doc/html/boost_asio/reference/async_result_lt__Handler__gt_/type.html index df18863cae..da5d0aab34 100644 --- a/doc/html/boost_asio/reference/async_result_lt__Handler__gt_/type.html +++ b/doc/html/boost_asio/reference/async_result_lt__Handler__gt_/type.html @@ -46,7 +46,7 @@ The return type of the initiating function.
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/async_result_lt__std__packaged_task_lt__Result_lp_Args_ellipsis__rp__gt__comma__Signature__gt_.html b/doc/html/boost_asio/reference/async_result_lt__std__packaged_task_lt__Result_lp_Args_ellipsis__rp__gt__comma__Signature__gt_.html index 3343e7fb54..093b88bd7a 100644 --- a/doc/html/boost_asio/reference/async_result_lt__std__packaged_task_lt__Result_lp_Args_ellipsis__rp__gt__comma__Signature__gt_.html +++ b/doc/html/boost_asio/reference/async_result_lt__std__packaged_task_lt__Result_lp_Args_ellipsis__rp__gt__comma__Signature__gt_.html @@ -147,7 +147,7 @@ class async_result< std::packaged_task< Result(Args...)>, Signature >
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/async_result_lt__std__packaged_task_lt__Result_lp_Args_ellipsis__rp__gt__comma__Signature__gt_/async_result.html b/doc/html/boost_asio/reference/async_result_lt__std__packaged_task_lt__Result_lp_Args_ellipsis__rp__gt__comma__Signature__gt_/async_result.html index 139b339f1f..bb271d7e65 100644 --- a/doc/html/boost_asio/reference/async_result_lt__std__packaged_task_lt__Result_lp_Args_ellipsis__rp__gt__comma__Signature__gt_/async_result.html +++ b/doc/html/boost_asio/reference/async_result_lt__std__packaged_task_lt__Result_lp_Args_ellipsis__rp__gt__comma__Signature__gt_/async_result.html @@ -38,7 +38,7 @@ The constructor
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/async_result_lt__std__packaged_task_lt__Result_lp_Args_ellipsis__rp__gt__comma__Signature__gt_/completion_handler_type.html b/doc/html/boost_asio/reference/async_result_lt__std__packaged_task_lt__Result_lp_Args_ellipsis__rp__gt__comma__Signature__gt_/completion_handler_type.html index d5075d3e75..731c18f701 100644 --- a/doc/html/boost_asio/reference/async_result_lt__std__packaged_task_lt__Result_lp_Args_ellipsis__rp__gt__comma__Signature__gt_/completion_handler_type.html +++ b/doc/html/boost_asio/reference/async_result_lt__std__packaged_task_lt__Result_lp_Args_ellipsis__rp__gt__comma__Signature__gt_/completion_handler_type.html @@ -47,7 +47,7 @@ The packaged
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/async_result_lt__std__packaged_task_lt__Result_lp_Args_ellipsis__rp__gt__comma__Signature__gt_/get.html b/doc/html/boost_asio/reference/async_result_lt__std__packaged_task_lt__Result_lp_Args_ellipsis__rp__gt__comma__Signature__gt_/get.html index d6d62dc7be..e34060d89b 100644 --- a/doc/html/boost_asio/reference/async_result_lt__std__packaged_task_lt__Result_lp_Args_ellipsis__rp__gt__comma__Signature__gt_/get.html +++ b/doc/html/boost_asio/reference/async_result_lt__std__packaged_task_lt__Result_lp_Args_ellipsis__rp__gt__comma__Signature__gt_/get.html @@ -37,7 +37,7 @@ Returns the packaged
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/async_result_lt__std__packaged_task_lt__Result_lp_Args_ellipsis__rp__gt__comma__Signature__gt_/return_type.html b/doc/html/boost_asio/reference/async_result_lt__std__packaged_task_lt__Result_lp_Args_ellipsis__rp__gt__comma__Signature__gt_/return_type.html index 3974513b99..325c1024a1 100644 --- a/doc/html/boost_asio/reference/async_result_lt__std__packaged_task_lt__Result_lp_Args_ellipsis__rp__gt__comma__Signature__gt_/return_type.html +++ b/doc/html/boost_asio/reference/async_result_lt__std__packaged_task_lt__Result_lp_Args_ellipsis__rp__gt__comma__Signature__gt_/return_type.html @@ -47,7 +47,7 @@ The return type
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/async_write.html b/doc/html/boost_asio/reference/async_write.html index 0874f14adb..b65b60a9bc 100644 --- a/doc/html/boost_asio/reference/async_write.html +++ b/doc/html/boost_asio/reference/async_write.html @@ -63,7 +63,7 @@ template< AsyncWriteStream & s, DynamicBuffer && buffers, WriteHandler && handler, - typename enable_if< is_dynamic_buffer< DynamicBuffer >::value >::type * = 0); + typename enable_if< is_dynamic_buffer< typename decay< DynamicBuffer >::type >::value >::type * = 0); » more... template< @@ -76,7 +76,7 @@ template< DynamicBuffer && buffers, CompletionCondition completion_condition, WriteHandler && handler, - typename enable_if< is_dynamic_buffer< DynamicBuffer >::value >::type * = 0); + typename enable_if< is_dynamic_buffer< typename decay< DynamicBuffer >::type >::value >::type * = 0); » more... template< @@ -114,7 +114,7 @@ template<
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/async_write/overload1.html b/doc/html/boost_asio/reference/async_write/overload1.html index 3347aa6d8c..c97ba0a960 100644 --- a/doc/html/boost_asio/reference/async_write/overload1.html +++ b/doc/html/boost_asio/reference/async_write/overload1.html @@ -125,7 +125,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/async_write/overload2.html b/doc/html/boost_asio/reference/async_write/overload2.html index e885c91569..623e7ed487 100644 --- a/doc/html/boost_asio/reference/async_write/overload2.html +++ b/doc/html/boost_asio/reference/async_write/overload2.html @@ -150,7 +150,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/async_write/overload3.html b/doc/html/boost_asio/reference/async_write/overload3.html index fa5a5e1421..e0f319db94 100644 --- a/doc/html/boost_asio/reference/async_write/overload3.html +++ b/doc/html/boost_asio/reference/async_write/overload3.html @@ -39,7 +39,7 @@ AsyncWriteStream & s, DynamicBuffer && buffers, WriteHandler && handler, - typename enable_if< is_dynamic_buffer< DynamicBuffer >::value >::type * = 0); + typename enable_if< is_dynamic_buffer< typename decay< DynamicBuffer >::type >::value >::type * = 0);

    This function is used to asynchronously write a certain number of bytes @@ -110,7 +110,7 @@

    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/async_write/overload4.html b/doc/html/boost_asio/reference/async_write/overload4.html index 143aca2579..e3d198271e 100644 --- a/doc/html/boost_asio/reference/async_write/overload4.html +++ b/doc/html/boost_asio/reference/async_write/overload4.html @@ -41,7 +41,7 @@ DynamicBuffer && buffers, CompletionCondition completion_condition, WriteHandler && handler, - typename enable_if< is_dynamic_buffer< DynamicBuffer >::value >::type * = 0); + typename enable_if< is_dynamic_buffer< typename decay< DynamicBuffer >::type >::value >::type * = 0);

    This function is used to asynchronously write a certain number of bytes @@ -132,7 +132,7 @@

    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/async_write/overload5.html b/doc/html/boost_asio/reference/async_write/overload5.html index a79fa800f8..e9fe092618 100644 --- a/doc/html/boost_asio/reference/async_write/overload5.html +++ b/doc/html/boost_asio/reference/async_write/overload5.html @@ -109,7 +109,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/async_write/overload6.html b/doc/html/boost_asio/reference/async_write/overload6.html index af5881e630..5174f19157 100644 --- a/doc/html/boost_asio/reference/async_write/overload6.html +++ b/doc/html/boost_asio/reference/async_write/overload6.html @@ -131,7 +131,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/async_write_at.html b/doc/html/boost_asio/reference/async_write_at.html index 57290bfb94..f10c4abf76 100644 --- a/doc/html/boost_asio/reference/async_write_at.html +++ b/doc/html/boost_asio/reference/async_write_at.html @@ -92,7 +92,7 @@ template<
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/async_write_at/overload1.html b/doc/html/boost_asio/reference/async_write_at/overload1.html index 94ebd9e917..b9ab7efa14 100644 --- a/doc/html/boost_asio/reference/async_write_at/overload1.html +++ b/doc/html/boost_asio/reference/async_write_at/overload1.html @@ -131,7 +131,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/async_write_at/overload2.html b/doc/html/boost_asio/reference/async_write_at/overload2.html index 76e199c298..dd37194642 100644 --- a/doc/html/boost_asio/reference/async_write_at/overload2.html +++ b/doc/html/boost_asio/reference/async_write_at/overload2.html @@ -156,7 +156,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/async_write_at/overload3.html b/doc/html/boost_asio/reference/async_write_at/overload3.html index f24ab9c524..7d8dcedcbc 100644 --- a/doc/html/boost_asio/reference/async_write_at/overload3.html +++ b/doc/html/boost_asio/reference/async_write_at/overload3.html @@ -116,7 +116,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/async_write_at/overload4.html b/doc/html/boost_asio/reference/async_write_at/overload4.html index 41dda1bf20..e9467c2f27 100644 --- a/doc/html/boost_asio/reference/async_write_at/overload4.html +++ b/doc/html/boost_asio/reference/async_write_at/overload4.html @@ -138,7 +138,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/asynchronous_operations.html b/doc/html/boost_asio/reference/asynchronous_operations.html index 2f5279eb1e..59c352df55 100644 --- a/doc/html/boost_asio/reference/asynchronous_operations.html +++ b/doc/html/boost_asio/reference/asynchronous_operations.html @@ -40,7 +40,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/asynchronous_operations/allocation_of_intermediate_storage.html b/doc/html/boost_asio/reference/asynchronous_operations/allocation_of_intermediate_storage.html index bc4358fb1a..1849dd8753 100644 --- a/doc/html/boost_asio/reference/asynchronous_operations/allocation_of_intermediate_storage.html +++ b/doc/html/boost_asio/reference/asynchronous_operations/allocation_of_intermediate_storage.html @@ -68,7 +68,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/asynchronous_operations/associated_executor.html b/doc/html/boost_asio/reference/asynchronous_operations/associated_executor.html index d9db590bb3..ad6c669d6c 100644 --- a/doc/html/boost_asio/reference/asynchronous_operations/associated_executor.html +++ b/doc/html/boost_asio/reference/asynchronous_operations/associated_executor.html @@ -34,7 +34,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/asynchronous_operations/automatic_deduction_of_initiating_function_return_type.html b/doc/html/boost_asio/reference/asynchronous_operations/automatic_deduction_of_initiating_function_return_type.html index 6b77810a68..94bf9fa3aa 100644 --- a/doc/html/boost_asio/reference/asynchronous_operations/automatic_deduction_of_initiating_function_return_type.html +++ b/doc/html/boost_asio/reference/asynchronous_operations/automatic_deduction_of_initiating_function_return_type.html @@ -41,7 +41,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/asynchronous_operations/completion_handler_executor.html b/doc/html/boost_asio/reference/asynchronous_operations/completion_handler_executor.html index 7bdb04d9e7..e35df490b6 100644 --- a/doc/html/boost_asio/reference/asynchronous_operations/completion_handler_executor.html +++ b/doc/html/boost_asio/reference/asynchronous_operations/completion_handler_executor.html @@ -38,7 +38,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/asynchronous_operations/completion_handlers_and_exceptions.html b/doc/html/boost_asio/reference/asynchronous_operations/completion_handlers_and_exceptions.html index 4f108f9bc6..bcc56182e0 100644 --- a/doc/html/boost_asio/reference/asynchronous_operations/completion_handlers_and_exceptions.html +++ b/doc/html/boost_asio/reference/asynchronous_operations/completion_handlers_and_exceptions.html @@ -35,7 +35,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/asynchronous_operations/completion_token.html b/doc/html/boost_asio/reference/asynchronous_operations/completion_token.html index 4a9778377e..8f3e8190f1 100644 --- a/doc/html/boost_asio/reference/asynchronous_operations/completion_token.html +++ b/doc/html/boost_asio/reference/asynchronous_operations/completion_token.html @@ -66,7 +66,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/asynchronous_operations/execution_of_completion_handler_on_completion_of_asynchronous_operation.html b/doc/html/boost_asio/reference/asynchronous_operations/execution_of_completion_handler_on_completion_of_asynchronous_operation.html index 1e736be5d1..b372669fea 100644 --- a/doc/html/boost_asio/reference/asynchronous_operations/execution_of_completion_handler_on_completion_of_asynchronous_operation.html +++ b/doc/html/boost_asio/reference/asynchronous_operations/execution_of_completion_handler_on_completion_of_asynchronous_operation.html @@ -54,7 +54,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/asynchronous_operations/general_asynchronous_operation_concepts.html b/doc/html/boost_asio/reference/asynchronous_operations/general_asynchronous_operation_concepts.html index 5f6e68af70..12f27ef5a3 100644 --- a/doc/html/boost_asio/reference/asynchronous_operations/general_asynchronous_operation_concepts.html +++ b/doc/html/boost_asio/reference/asynchronous_operations/general_asynchronous_operation_concepts.html @@ -63,7 +63,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/asynchronous_operations/i_o_executor.html b/doc/html/boost_asio/reference/asynchronous_operations/i_o_executor.html index 55f2a408d4..aa1c18e09c 100644 --- a/doc/html/boost_asio/reference/asynchronous_operations/i_o_executor.html +++ b/doc/html/boost_asio/reference/asynchronous_operations/i_o_executor.html @@ -54,7 +54,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/asynchronous_operations/lifetime_of_initiating_function_arguments.html b/doc/html/boost_asio/reference/asynchronous_operations/lifetime_of_initiating_function_arguments.html index f3fce9839c..26e8caf67e 100644 --- a/doc/html/boost_asio/reference/asynchronous_operations/lifetime_of_initiating_function_arguments.html +++ b/doc/html/boost_asio/reference/asynchronous_operations/lifetime_of_initiating_function_arguments.html @@ -50,7 +50,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/asynchronous_operations/non_blocking_requirements_on_initiating_functions.html b/doc/html/boost_asio/reference/asynchronous_operations/non_blocking_requirements_on_initiating_functions.html index 3788cc0ecd..b85534f009 100644 --- a/doc/html/boost_asio/reference/asynchronous_operations/non_blocking_requirements_on_initiating_functions.html +++ b/doc/html/boost_asio/reference/asynchronous_operations/non_blocking_requirements_on_initiating_functions.html @@ -39,7 +39,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/asynchronous_operations/outstanding_work.html b/doc/html/boost_asio/reference/asynchronous_operations/outstanding_work.html index 1f0685fc12..257a69e436 100644 --- a/doc/html/boost_asio/reference/asynchronous_operations/outstanding_work.html +++ b/doc/html/boost_asio/reference/asynchronous_operations/outstanding_work.html @@ -44,7 +44,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/asynchronous_operations/production_of_initiating_function_return_value.html b/doc/html/boost_asio/reference/asynchronous_operations/production_of_initiating_function_return_value.html index c434f521da..c89353a432 100644 --- a/doc/html/boost_asio/reference/asynchronous_operations/production_of_initiating_function_return_value.html +++ b/doc/html/boost_asio/reference/asynchronous_operations/production_of_initiating_function_return_value.html @@ -78,7 +78,7 @@ auto async_xyz(T1 t1, T2 t2, CompletionToken&& token)
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/asynchronous_socket_operations.html b/doc/html/boost_asio/reference/asynchronous_socket_operations.html index 4cfdf68ebe..ee0c720c95 100644 --- a/doc/html/boost_asio/reference/asynchronous_socket_operations.html +++ b/doc/html/boost_asio/reference/asynchronous_socket_operations.html @@ -69,7 +69,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/bad_executor.html b/doc/html/boost_asio/reference/bad_executor.html index 317ca24eef..3d080545f6 100644 --- a/doc/html/boost_asio/reference/bad_executor.html +++ b/doc/html/boost_asio/reference/bad_executor.html @@ -94,7 +94,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/bad_executor/bad_executor.html b/doc/html/boost_asio/reference/bad_executor/bad_executor.html index dc42d11987..70a341b342 100644 --- a/doc/html/boost_asio/reference/bad_executor/bad_executor.html +++ b/doc/html/boost_asio/reference/bad_executor/bad_executor.html @@ -35,7 +35,7 @@ Constructor.
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/bad_executor/what.html b/doc/html/boost_asio/reference/bad_executor/what.html index 1fd02039ea..710222ccfb 100644 --- a/doc/html/boost_asio/reference/bad_executor/what.html +++ b/doc/html/boost_asio/reference/bad_executor/what.html @@ -36,7 +36,7 @@ Obtain message associated
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_datagram_socket.html b/doc/html/boost_asio/reference/basic_datagram_socket.html index 17c6e49f1e..c8dea0312c 100644 --- a/doc/html/boost_asio/reference/basic_datagram_socket.html +++ b/doc/html/boost_asio/reference/basic_datagram_socket.html @@ -942,7 +942,7 @@ class basic_datagram_socket :
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_datagram_socket/_basic_datagram_socket.html b/doc/html/boost_asio/reference/basic_datagram_socket/_basic_datagram_socket.html index 611c3af5fb..de587e48b7 100644 --- a/doc/html/boost_asio/reference/basic_datagram_socket/_basic_datagram_socket.html +++ b/doc/html/boost_asio/reference/basic_datagram_socket/_basic_datagram_socket.html @@ -40,7 +40,7 @@ Destroys
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_datagram_socket/assign.html b/doc/html/boost_asio/reference/basic_datagram_socket/assign.html index db6f71c0c8..6c6b39286e 100644 --- a/doc/html/boost_asio/reference/basic_datagram_socket/assign.html +++ b/doc/html/boost_asio/reference/basic_datagram_socket/assign.html @@ -45,7 +45,7 @@ void
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_datagram_socket/assign/overload1.html b/doc/html/boost_asio/reference/basic_datagram_socket/assign/overload1.html index 038ebf9b28..16f6f87526 100644 --- a/doc/html/boost_asio/reference/basic_datagram_socket/assign/overload1.html +++ b/doc/html/boost_asio/reference/basic_datagram_socket/assign/overload1.html @@ -40,7 +40,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_datagram_socket/assign/overload2.html b/doc/html/boost_asio/reference/basic_datagram_socket/assign/overload2.html index f1763dc929..ecf6fbe3f5 100644 --- a/doc/html/boost_asio/reference/basic_datagram_socket/assign/overload2.html +++ b/doc/html/boost_asio/reference/basic_datagram_socket/assign/overload2.html @@ -41,7 +41,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_datagram_socket/async_connect.html b/doc/html/boost_asio/reference/basic_datagram_socket/async_connect.html index fbfd891562..bfecbecfc4 100644 --- a/doc/html/boost_asio/reference/basic_datagram_socket/async_connect.html +++ b/doc/html/boost_asio/reference/basic_datagram_socket/async_connect.html @@ -103,7 +103,7 @@ socket.async_connect(endpoint, connect_handler);
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_datagram_socket/async_receive.html b/doc/html/boost_asio/reference/basic_datagram_socket/async_receive.html index 6c9f83e83e..d6b13eda91 100644 --- a/doc/html/boost_asio/reference/basic_datagram_socket/async_receive.html +++ b/doc/html/boost_asio/reference/basic_datagram_socket/async_receive.html @@ -51,7 +51,7 @@ template<
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_datagram_socket/async_receive/overload1.html b/doc/html/boost_asio/reference/basic_datagram_socket/async_receive/overload1.html index adc044b1bf..c9135648b4 100644 --- a/doc/html/boost_asio/reference/basic_datagram_socket/async_receive/overload1.html +++ b/doc/html/boost_asio/reference/basic_datagram_socket/async_receive/overload1.html @@ -103,7 +103,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_datagram_socket/async_receive/overload2.html b/doc/html/boost_asio/reference/basic_datagram_socket/async_receive/overload2.html index 2e0d3a37bb..5e70304f50 100644 --- a/doc/html/boost_asio/reference/basic_datagram_socket/async_receive/overload2.html +++ b/doc/html/boost_asio/reference/basic_datagram_socket/async_receive/overload2.html @@ -93,7 +93,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_datagram_socket/async_receive_from.html b/doc/html/boost_asio/reference/basic_datagram_socket/async_receive_from.html index 7771613203..27ce7cd159 100644 --- a/doc/html/boost_asio/reference/basic_datagram_socket/async_receive_from.html +++ b/doc/html/boost_asio/reference/basic_datagram_socket/async_receive_from.html @@ -53,7 +53,7 @@ template<
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_datagram_socket/async_receive_from/overload1.html b/doc/html/boost_asio/reference/basic_datagram_socket/async_receive_from/overload1.html index aa317026df..447378069a 100644 --- a/doc/html/boost_asio/reference/basic_datagram_socket/async_receive_from/overload1.html +++ b/doc/html/boost_asio/reference/basic_datagram_socket/async_receive_from/overload1.html @@ -103,7 +103,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_datagram_socket/async_receive_from/overload2.html b/doc/html/boost_asio/reference/basic_datagram_socket/async_receive_from/overload2.html index 2e2320fc35..7fb63524fd 100644 --- a/doc/html/boost_asio/reference/basic_datagram_socket/async_receive_from/overload2.html +++ b/doc/html/boost_asio/reference/basic_datagram_socket/async_receive_from/overload2.html @@ -92,7 +92,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_datagram_socket/async_send.html b/doc/html/boost_asio/reference/basic_datagram_socket/async_send.html index 76bbec4543..94ea419eac 100644 --- a/doc/html/boost_asio/reference/basic_datagram_socket/async_send.html +++ b/doc/html/boost_asio/reference/basic_datagram_socket/async_send.html @@ -51,7 +51,7 @@ template<
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_datagram_socket/async_send/overload1.html b/doc/html/boost_asio/reference/basic_datagram_socket/async_send/overload1.html index 8ead1a2262..64c399b59c 100644 --- a/doc/html/boost_asio/reference/basic_datagram_socket/async_send/overload1.html +++ b/doc/html/boost_asio/reference/basic_datagram_socket/async_send/overload1.html @@ -102,7 +102,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_datagram_socket/async_send/overload2.html b/doc/html/boost_asio/reference/basic_datagram_socket/async_send/overload2.html index 53b89a0d3c..21c5a64a1d 100644 --- a/doc/html/boost_asio/reference/basic_datagram_socket/async_send/overload2.html +++ b/doc/html/boost_asio/reference/basic_datagram_socket/async_send/overload2.html @@ -92,7 +92,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_datagram_socket/async_send_to.html b/doc/html/boost_asio/reference/basic_datagram_socket/async_send_to.html index 68daa89463..626752be93 100644 --- a/doc/html/boost_asio/reference/basic_datagram_socket/async_send_to.html +++ b/doc/html/boost_asio/reference/basic_datagram_socket/async_send_to.html @@ -53,7 +53,7 @@ template<
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_datagram_socket/async_send_to/overload1.html b/doc/html/boost_asio/reference/basic_datagram_socket/async_send_to/overload1.html index f14ab7f7eb..9c60584c45 100644 --- a/doc/html/boost_asio/reference/basic_datagram_socket/async_send_to/overload1.html +++ b/doc/html/boost_asio/reference/basic_datagram_socket/async_send_to/overload1.html @@ -103,7 +103,7 @@ socket.async_send_to(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_datagram_socket/async_send_to/overload2.html b/doc/html/boost_asio/reference/basic_datagram_socket/async_send_to/overload2.html index c30353fefa..40a255d4dc 100644 --- a/doc/html/boost_asio/reference/basic_datagram_socket/async_send_to/overload2.html +++ b/doc/html/boost_asio/reference/basic_datagram_socket/async_send_to/overload2.html @@ -90,7 +90,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_datagram_socket/async_wait.html b/doc/html/boost_asio/reference/basic_datagram_socket/async_wait.html index ac86771dab..fe23509ed8 100644 --- a/doc/html/boost_asio/reference/basic_datagram_socket/async_wait.html +++ b/doc/html/boost_asio/reference/basic_datagram_socket/async_wait.html @@ -97,7 +97,7 @@ socket.async_wait(boost::asio::ip::tcp::socket::wait_read, wait_handler);
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_datagram_socket/at_mark.html b/doc/html/boost_asio/reference/basic_datagram_socket/at_mark.html index 24aad75c71..15a5a88127 100644 --- a/doc/html/boost_asio/reference/basic_datagram_socket/at_mark.html +++ b/doc/html/boost_asio/reference/basic_datagram_socket/at_mark.html @@ -41,7 +41,7 @@ bool
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_datagram_socket/at_mark/overload1.html b/doc/html/boost_asio/reference/basic_datagram_socket/at_mark/overload1.html index 5570449e5c..8c11d5a15c 100644 --- a/doc/html/boost_asio/reference/basic_datagram_socket/at_mark/overload1.html +++ b/doc/html/boost_asio/reference/basic_datagram_socket/at_mark/overload1.html @@ -63,7 +63,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_datagram_socket/at_mark/overload2.html b/doc/html/boost_asio/reference/basic_datagram_socket/at_mark/overload2.html index ec4ef24494..1b879860b2 100644 --- a/doc/html/boost_asio/reference/basic_datagram_socket/at_mark/overload2.html +++ b/doc/html/boost_asio/reference/basic_datagram_socket/at_mark/overload2.html @@ -64,7 +64,7 @@
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_datagram_socket/available.html b/doc/html/boost_asio/reference/basic_datagram_socket/available.html index 1819e99573..0a1bdcfa56 100644 --- a/doc/html/boost_asio/reference/basic_datagram_socket/available.html +++ b/doc/html/boost_asio/reference/basic_datagram_socket/available.html @@ -41,7 +41,7 @@ std::size_t
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_datagram_socket/available/overload1.html b/doc/html/boost_asio/reference/basic_datagram_socket/available/overload1.html index ae1434a57f..5a3fe6172d 100644 --- a/doc/html/boost_asio/reference/basic_datagram_socket/available/overload1.html +++ b/doc/html/boost_asio/reference/basic_datagram_socket/available/overload1.html @@ -64,7 +64,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_datagram_socket/available/overload2.html b/doc/html/boost_asio/reference/basic_datagram_socket/available/overload2.html index 0950838523..93f81c0b3c 100644 --- a/doc/html/boost_asio/reference/basic_datagram_socket/available/overload2.html +++ b/doc/html/boost_asio/reference/basic_datagram_socket/available/overload2.html @@ -65,7 +65,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_datagram_socket/basic_datagram_socket.html b/doc/html/boost_asio/reference/basic_datagram_socket/basic_datagram_socket.html index 27bf258ca0..7376323d07 100644 --- a/doc/html/boost_asio/reference/basic_datagram_socket/basic_datagram_socket.html +++ b/doc/html/boost_asio/reference/basic_datagram_socket/basic_datagram_socket.html @@ -85,7 +85,7 @@ Construct
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_datagram_socket/basic_datagram_socket/overload1.html b/doc/html/boost_asio/reference/basic_datagram_socket/basic_datagram_socket/overload1.html index 86e8935c3e..53f6faa6ca 100644 --- a/doc/html/boost_asio/reference/basic_datagram_socket/basic_datagram_socket/overload1.html +++ b/doc/html/boost_asio/reference/basic_datagram_socket/basic_datagram_socket/overload1.html @@ -56,7 +56,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_datagram_socket/basic_datagram_socket/overload2.html b/doc/html/boost_asio/reference/basic_datagram_socket/basic_datagram_socket/overload2.html index 6c7fc3f8c3..ed0586cebb 100644 --- a/doc/html/boost_asio/reference/basic_datagram_socket/basic_datagram_socket/overload2.html +++ b/doc/html/boost_asio/reference/basic_datagram_socket/basic_datagram_socket/overload2.html @@ -72,7 +72,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_datagram_socket/basic_datagram_socket/overload3.html b/doc/html/boost_asio/reference/basic_datagram_socket/basic_datagram_socket/overload3.html index e8bef7f388..d920a8dacd 100644 --- a/doc/html/boost_asio/reference/basic_datagram_socket/basic_datagram_socket/overload3.html +++ b/doc/html/boost_asio/reference/basic_datagram_socket/basic_datagram_socket/overload3.html @@ -76,7 +76,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_datagram_socket/basic_datagram_socket/overload4.html b/doc/html/boost_asio/reference/basic_datagram_socket/basic_datagram_socket/overload4.html index b5fcbc978e..d36e28c92e 100644 --- a/doc/html/boost_asio/reference/basic_datagram_socket/basic_datagram_socket/overload4.html +++ b/doc/html/boost_asio/reference/basic_datagram_socket/basic_datagram_socket/overload4.html @@ -79,7 +79,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_datagram_socket/basic_datagram_socket/overload5.html b/doc/html/boost_asio/reference/basic_datagram_socket/basic_datagram_socket/overload5.html index b08d44502d..345fb52015 100644 --- a/doc/html/boost_asio/reference/basic_datagram_socket/basic_datagram_socket/overload5.html +++ b/doc/html/boost_asio/reference/basic_datagram_socket/basic_datagram_socket/overload5.html @@ -62,7 +62,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_datagram_socket/basic_datagram_socket/overload6.html b/doc/html/boost_asio/reference/basic_datagram_socket/basic_datagram_socket/overload6.html index c156b623bf..71f1819321 100644 --- a/doc/html/boost_asio/reference/basic_datagram_socket/basic_datagram_socket/overload6.html +++ b/doc/html/boost_asio/reference/basic_datagram_socket/basic_datagram_socket/overload6.html @@ -65,7 +65,7 @@ basic_datagram_socket(
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_datagram_socket/bind.html b/doc/html/boost_asio/reference/basic_datagram_socket/bind.html index 8ae1bb4197..ba962a7a80 100644 --- a/doc/html/boost_asio/reference/basic_datagram_socket/bind.html +++ b/doc/html/boost_asio/reference/basic_datagram_socket/bind.html @@ -43,7 +43,7 @@ void
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_datagram_socket/bind/overload1.html b/doc/html/boost_asio/reference/basic_datagram_socket/bind/overload1.html index 302977d6e2..dd284bf5d8 100644 --- a/doc/html/boost_asio/reference/basic_datagram_socket/bind/overload1.html +++ b/doc/html/boost_asio/reference/basic_datagram_socket/bind/overload1.html @@ -78,7 +78,7 @@ socket.bind(boost::asio::ip::tcp::endpoint(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_datagram_socket/bind/overload2.html b/doc/html/boost_asio/reference/basic_datagram_socket/bind/overload2.html index 33b76dd888..95682d49e8 100644 --- a/doc/html/boost_asio/reference/basic_datagram_socket/bind/overload2.html +++ b/doc/html/boost_asio/reference/basic_datagram_socket/bind/overload2.html @@ -75,7 +75,7 @@ if (ec)
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_datagram_socket/broadcast.html b/doc/html/boost_asio/reference/basic_datagram_socket/broadcast.html index ee5b3cf8f4..3713703717 100644 --- a/doc/html/boost_asio/reference/basic_datagram_socket/broadcast.html +++ b/doc/html/boost_asio/reference/basic_datagram_socket/broadcast.html @@ -73,7 +73,7 @@ bool is_set = option.value();
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_datagram_socket/bytes_readable.html b/doc/html/boost_asio/reference/basic_datagram_socket/bytes_readable.html index 2ad3d921ad..ce833d80a9 100644 --- a/doc/html/boost_asio/reference/basic_datagram_socket/bytes_readable.html +++ b/doc/html/boost_asio/reference/basic_datagram_socket/bytes_readable.html @@ -62,7 +62,7 @@ std::size_t bytes_readable = command.get();
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_datagram_socket/cancel.html b/doc/html/boost_asio/reference/basic_datagram_socket/cancel.html index 090adcfb39..dd55733d06 100644 --- a/doc/html/boost_asio/reference/basic_datagram_socket/cancel.html +++ b/doc/html/boost_asio/reference/basic_datagram_socket/cancel.html @@ -41,7 +41,7 @@ void
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_datagram_socket/cancel/overload1.html b/doc/html/boost_asio/reference/basic_datagram_socket/cancel/overload1.html index 97aa8777a0..5c23ac5aa1 100644 --- a/doc/html/boost_asio/reference/basic_datagram_socket/cancel/overload1.html +++ b/doc/html/boost_asio/reference/basic_datagram_socket/cancel/overload1.html @@ -97,7 +97,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_datagram_socket/cancel/overload2.html b/doc/html/boost_asio/reference/basic_datagram_socket/cancel/overload2.html index 0d31c76eab..ad1f177780 100644 --- a/doc/html/boost_asio/reference/basic_datagram_socket/cancel/overload2.html +++ b/doc/html/boost_asio/reference/basic_datagram_socket/cancel/overload2.html @@ -98,7 +98,7 @@
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_datagram_socket/close.html b/doc/html/boost_asio/reference/basic_datagram_socket/close.html index 09a7c154f8..ba9719489f 100644 --- a/doc/html/boost_asio/reference/basic_datagram_socket/close.html +++ b/doc/html/boost_asio/reference/basic_datagram_socket/close.html @@ -41,7 +41,7 @@ void
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_datagram_socket/close/overload1.html b/doc/html/boost_asio/reference/basic_datagram_socket/close/overload1.html index a66fa37734..999bdcbd22 100644 --- a/doc/html/boost_asio/reference/basic_datagram_socket/close/overload1.html +++ b/doc/html/boost_asio/reference/basic_datagram_socket/close/overload1.html @@ -65,7 +65,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_datagram_socket/close/overload2.html b/doc/html/boost_asio/reference/basic_datagram_socket/close/overload2.html index ebc963e768..1c6cff8a06 100644 --- a/doc/html/boost_asio/reference/basic_datagram_socket/close/overload2.html +++ b/doc/html/boost_asio/reference/basic_datagram_socket/close/overload2.html @@ -79,7 +79,7 @@ if (ec)
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_datagram_socket/connect.html b/doc/html/boost_asio/reference/basic_datagram_socket/connect.html index 3f055c562f..105f4df4df 100644 --- a/doc/html/boost_asio/reference/basic_datagram_socket/connect.html +++ b/doc/html/boost_asio/reference/basic_datagram_socket/connect.html @@ -43,7 +43,7 @@ void
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_datagram_socket/connect/overload1.html b/doc/html/boost_asio/reference/basic_datagram_socket/connect/overload1.html index da12b85fdb..1e410c84b3 100644 --- a/doc/html/boost_asio/reference/basic_datagram_socket/connect/overload1.html +++ b/doc/html/boost_asio/reference/basic_datagram_socket/connect/overload1.html @@ -84,7 +84,7 @@ socket.connect(endpoint);
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_datagram_socket/connect/overload2.html b/doc/html/boost_asio/reference/basic_datagram_socket/connect/overload2.html index 785d5371a8..4e7c918a1b 100644 --- a/doc/html/boost_asio/reference/basic_datagram_socket/connect/overload2.html +++ b/doc/html/boost_asio/reference/basic_datagram_socket/connect/overload2.html @@ -81,7 +81,7 @@ if (ec)
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_datagram_socket/debug.html b/doc/html/boost_asio/reference/basic_datagram_socket/debug.html index 5c2f40d970..74fd730ff5 100644 --- a/doc/html/boost_asio/reference/basic_datagram_socket/debug.html +++ b/doc/html/boost_asio/reference/basic_datagram_socket/debug.html @@ -73,7 +73,7 @@ bool is_set = option.value();
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_datagram_socket/do_not_route.html b/doc/html/boost_asio/reference/basic_datagram_socket/do_not_route.html index f8737f71b6..059034e7ab 100644 --- a/doc/html/boost_asio/reference/basic_datagram_socket/do_not_route.html +++ b/doc/html/boost_asio/reference/basic_datagram_socket/do_not_route.html @@ -73,7 +73,7 @@ bool is_set = option.value();
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_datagram_socket/enable_connection_aborted.html b/doc/html/boost_asio/reference/basic_datagram_socket/enable_connection_aborted.html index 4da320ab5f..faafb4ea4d 100644 --- a/doc/html/boost_asio/reference/basic_datagram_socket/enable_connection_aborted.html +++ b/doc/html/boost_asio/reference/basic_datagram_socket/enable_connection_aborted.html @@ -75,7 +75,7 @@ bool is_set = option.value();
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_datagram_socket/endpoint_type.html b/doc/html/boost_asio/reference/basic_datagram_socket/endpoint_type.html index 3e638dbc58..48f0604274 100644 --- a/doc/html/boost_asio/reference/basic_datagram_socket/endpoint_type.html +++ b/doc/html/boost_asio/reference/basic_datagram_socket/endpoint_type.html @@ -46,7 +46,7 @@ The
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_datagram_socket/executor_type.html b/doc/html/boost_asio/reference/basic_datagram_socket/executor_type.html index b7605b92c1..addb2ed2e2 100644 --- a/doc/html/boost_asio/reference/basic_datagram_socket/executor_type.html +++ b/doc/html/boost_asio/reference/basic_datagram_socket/executor_type.html @@ -206,7 +206,7 @@ The
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_datagram_socket/get_executor.html b/doc/html/boost_asio/reference/basic_datagram_socket/get_executor.html index d4f6255f62..b14111acd4 100644 --- a/doc/html/boost_asio/reference/basic_datagram_socket/get_executor.html +++ b/doc/html/boost_asio/reference/basic_datagram_socket/get_executor.html @@ -39,7 +39,7 @@ Get
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_datagram_socket/get_io_context.html b/doc/html/boost_asio/reference/basic_datagram_socket/get_io_context.html index 516c63db82..d13bf7a7cf 100644 --- a/doc/html/boost_asio/reference/basic_datagram_socket/get_io_context.html +++ b/doc/html/boost_asio/reference/basic_datagram_socket/get_io_context.html @@ -54,7 +54,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_datagram_socket/get_io_service.html b/doc/html/boost_asio/reference/basic_datagram_socket/get_io_service.html index 3837914af3..46bfc001b8 100644 --- a/doc/html/boost_asio/reference/basic_datagram_socket/get_io_service.html +++ b/doc/html/boost_asio/reference/basic_datagram_socket/get_io_service.html @@ -54,7 +54,7 @@
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_datagram_socket/get_option.html b/doc/html/boost_asio/reference/basic_datagram_socket/get_option.html index ef5d26ec84..7016a8342d 100644 --- a/doc/html/boost_asio/reference/basic_datagram_socket/get_option.html +++ b/doc/html/boost_asio/reference/basic_datagram_socket/get_option.html @@ -47,7 +47,7 @@ void
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_datagram_socket/get_option/overload1.html b/doc/html/boost_asio/reference/basic_datagram_socket/get_option/overload1.html index b67202d54e..16c227fb2b 100644 --- a/doc/html/boost_asio/reference/basic_datagram_socket/get_option/overload1.html +++ b/doc/html/boost_asio/reference/basic_datagram_socket/get_option/overload1.html @@ -83,7 +83,7 @@ bool is_set = option.value();
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_datagram_socket/get_option/overload2.html b/doc/html/boost_asio/reference/basic_datagram_socket/get_option/overload2.html index bb10cb2cad..7ceca9fd11 100644 --- a/doc/html/boost_asio/reference/basic_datagram_socket/get_option/overload2.html +++ b/doc/html/boost_asio/reference/basic_datagram_socket/get_option/overload2.html @@ -80,7 +80,7 @@ bool is_set = option.value();
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_datagram_socket/io_control.html b/doc/html/boost_asio/reference/basic_datagram_socket/io_control.html index a563f91879..e1affe6db2 100644 --- a/doc/html/boost_asio/reference/basic_datagram_socket/io_control.html +++ b/doc/html/boost_asio/reference/basic_datagram_socket/io_control.html @@ -47,7 +47,7 @@ void
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_datagram_socket/io_control/overload1.html b/doc/html/boost_asio/reference/basic_datagram_socket/io_control/overload1.html index f80de98657..c35ceecc5d 100644 --- a/doc/html/boost_asio/reference/basic_datagram_socket/io_control/overload1.html +++ b/doc/html/boost_asio/reference/basic_datagram_socket/io_control/overload1.html @@ -83,7 +83,7 @@ std::size_t bytes_readable = command.get();
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_datagram_socket/io_control/overload2.html b/doc/html/boost_asio/reference/basic_datagram_socket/io_control/overload2.html index 69dda1a41d..0d4041466d 100644 --- a/doc/html/boost_asio/reference/basic_datagram_socket/io_control/overload2.html +++ b/doc/html/boost_asio/reference/basic_datagram_socket/io_control/overload2.html @@ -80,7 +80,7 @@ std::size_t bytes_readable = command.get();
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_datagram_socket/is_open.html b/doc/html/boost_asio/reference/basic_datagram_socket/is_open.html index 74645f3070..533947af41 100644 --- a/doc/html/boost_asio/reference/basic_datagram_socket/is_open.html +++ b/doc/html/boost_asio/reference/basic_datagram_socket/is_open.html @@ -39,7 +39,7 @@ Determine
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_datagram_socket/keep_alive.html b/doc/html/boost_asio/reference/basic_datagram_socket/keep_alive.html index 63dcf49809..16c4628476 100644 --- a/doc/html/boost_asio/reference/basic_datagram_socket/keep_alive.html +++ b/doc/html/boost_asio/reference/basic_datagram_socket/keep_alive.html @@ -73,7 +73,7 @@ bool is_set = option.value();
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_datagram_socket/linger.html b/doc/html/boost_asio/reference/basic_datagram_socket/linger.html index dac7740142..30f441009a 100644 --- a/doc/html/boost_asio/reference/basic_datagram_socket/linger.html +++ b/doc/html/boost_asio/reference/basic_datagram_socket/linger.html @@ -75,7 +75,7 @@ unsigned short timeout = option.timeout();
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_datagram_socket/local_endpoint.html b/doc/html/boost_asio/reference/basic_datagram_socket/local_endpoint.html index e5e5e514ff..a74afd79e3 100644 --- a/doc/html/boost_asio/reference/basic_datagram_socket/local_endpoint.html +++ b/doc/html/boost_asio/reference/basic_datagram_socket/local_endpoint.html @@ -41,7 +41,7 @@ endpoint_type
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_datagram_socket/local_endpoint/overload1.html b/doc/html/boost_asio/reference/basic_datagram_socket/local_endpoint/overload1.html index dbcb96c3c6..fe096e83df 100644 --- a/doc/html/boost_asio/reference/basic_datagram_socket/local_endpoint/overload1.html +++ b/doc/html/boost_asio/reference/basic_datagram_socket/local_endpoint/overload1.html @@ -70,7 +70,7 @@ boost::asio::ip::tcp::endpoint endpoint = socket.local_endpoint();
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_datagram_socket/local_endpoint/overload2.html b/doc/html/boost_asio/reference/basic_datagram_socket/local_endpoint/overload2.html index 796b4b10e5..ec3d6f84a9 100644 --- a/doc/html/boost_asio/reference/basic_datagram_socket/local_endpoint/overload2.html +++ b/doc/html/boost_asio/reference/basic_datagram_socket/local_endpoint/overload2.html @@ -77,7 +77,7 @@ if (ec)
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_datagram_socket/lowest_layer.html b/doc/html/boost_asio/reference/basic_datagram_socket/lowest_layer.html index 353abbf301..d5feaf8553 100644 --- a/doc/html/boost_asio/reference/basic_datagram_socket/lowest_layer.html +++ b/doc/html/boost_asio/reference/basic_datagram_socket/lowest_layer.html @@ -43,7 +43,7 @@ Get
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_datagram_socket/lowest_layer/overload1.html b/doc/html/boost_asio/reference/basic_datagram_socket/lowest_layer/overload1.html index abd2a8d963..26b43cde06 100644 --- a/doc/html/boost_asio/reference/basic_datagram_socket/lowest_layer/overload1.html +++ b/doc/html/boost_asio/reference/basic_datagram_socket/lowest_layer/overload1.html @@ -52,7 +52,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_datagram_socket/lowest_layer/overload2.html b/doc/html/boost_asio/reference/basic_datagram_socket/lowest_layer/overload2.html index cf527357bf..d6af63bb9a 100644 --- a/doc/html/boost_asio/reference/basic_datagram_socket/lowest_layer/overload2.html +++ b/doc/html/boost_asio/reference/basic_datagram_socket/lowest_layer/overload2.html @@ -52,7 +52,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_datagram_socket/lowest_layer_type.html b/doc/html/boost_asio/reference/basic_datagram_socket/lowest_layer_type.html index e186d918cb..115dddf3cc 100644 --- a/doc/html/boost_asio/reference/basic_datagram_socket/lowest_layer_type.html +++ b/doc/html/boost_asio/reference/basic_datagram_socket/lowest_layer_type.html @@ -874,7 +874,7 @@ A
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_datagram_socket/max_connections.html b/doc/html/boost_asio/reference/basic_datagram_socket/max_connections.html index a4757c11e5..776777b25a 100644 --- a/doc/html/boost_asio/reference/basic_datagram_socket/max_connections.html +++ b/doc/html/boost_asio/reference/basic_datagram_socket/max_connections.html @@ -40,7 +40,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_datagram_socket/max_listen_connections.html b/doc/html/boost_asio/reference/basic_datagram_socket/max_listen_connections.html index 8699ed36dc..8ff356f0b0 100644 --- a/doc/html/boost_asio/reference/basic_datagram_socket/max_listen_connections.html +++ b/doc/html/boost_asio/reference/basic_datagram_socket/max_listen_connections.html @@ -39,7 +39,7 @@ The
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_datagram_socket/message_do_not_route.html b/doc/html/boost_asio/reference/basic_datagram_socket/message_do_not_route.html index f2d156bd39..794492ff69 100644 --- a/doc/html/boost_asio/reference/basic_datagram_socket/message_do_not_route.html +++ b/doc/html/boost_asio/reference/basic_datagram_socket/message_do_not_route.html @@ -39,7 +39,7 @@ Specify
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_datagram_socket/message_end_of_record.html b/doc/html/boost_asio/reference/basic_datagram_socket/message_end_of_record.html index 59dee308ed..53b14b7b9f 100644 --- a/doc/html/boost_asio/reference/basic_datagram_socket/message_end_of_record.html +++ b/doc/html/boost_asio/reference/basic_datagram_socket/message_end_of_record.html @@ -39,7 +39,7 @@ Specifies
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_datagram_socket/message_flags.html b/doc/html/boost_asio/reference/basic_datagram_socket/message_flags.html index b2001d2d58..6457ad1a2c 100644 --- a/doc/html/boost_asio/reference/basic_datagram_socket/message_flags.html +++ b/doc/html/boost_asio/reference/basic_datagram_socket/message_flags.html @@ -49,7 +49,7 @@ Bitmask
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_datagram_socket/message_out_of_band.html b/doc/html/boost_asio/reference/basic_datagram_socket/message_out_of_band.html index 58b11d5d01..01cca637dd 100644 --- a/doc/html/boost_asio/reference/basic_datagram_socket/message_out_of_band.html +++ b/doc/html/boost_asio/reference/basic_datagram_socket/message_out_of_band.html @@ -39,7 +39,7 @@ Process
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_datagram_socket/message_peek.html b/doc/html/boost_asio/reference/basic_datagram_socket/message_peek.html index b2c62ec21e..9198b14a0b 100644 --- a/doc/html/boost_asio/reference/basic_datagram_socket/message_peek.html +++ b/doc/html/boost_asio/reference/basic_datagram_socket/message_peek.html @@ -39,7 +39,7 @@ Peek
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_datagram_socket/native_handle.html b/doc/html/boost_asio/reference/basic_datagram_socket/native_handle.html index 72026ec7b3..428e071020 100644 --- a/doc/html/boost_asio/reference/basic_datagram_socket/native_handle.html +++ b/doc/html/boost_asio/reference/basic_datagram_socket/native_handle.html @@ -44,7 +44,7 @@ Get
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_datagram_socket/native_handle_type.html b/doc/html/boost_asio/reference/basic_datagram_socket/native_handle_type.html index 97c8ef7d9a..255b6a7437 100644 --- a/doc/html/boost_asio/reference/basic_datagram_socket/native_handle_type.html +++ b/doc/html/boost_asio/reference/basic_datagram_socket/native_handle_type.html @@ -46,7 +46,7 @@ The
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_datagram_socket/native_non_blocking.html b/doc/html/boost_asio/reference/basic_datagram_socket/native_non_blocking.html index 25f2ee632f..5896e49c10 100644 --- a/doc/html/boost_asio/reference/basic_datagram_socket/native_non_blocking.html +++ b/doc/html/boost_asio/reference/basic_datagram_socket/native_non_blocking.html @@ -49,7 +49,7 @@ void
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_datagram_socket/native_non_blocking/overload1.html b/doc/html/boost_asio/reference/basic_datagram_socket/native_non_blocking/overload1.html index bee602edee..e6bff0fdc9 100644 --- a/doc/html/boost_asio/reference/basic_datagram_socket/native_non_blocking/overload1.html +++ b/doc/html/boost_asio/reference/basic_datagram_socket/native_non_blocking/overload1.html @@ -137,7 +137,7 @@ void async_sendfile(tcp::socket& sock, int fd, Handler h)
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_datagram_socket/native_non_blocking/overload2.html b/doc/html/boost_asio/reference/basic_datagram_socket/native_non_blocking/overload2.html index ca7f3f8f35..6288c883bf 100644 --- a/doc/html/boost_asio/reference/basic_datagram_socket/native_non_blocking/overload2.html +++ b/doc/html/boost_asio/reference/basic_datagram_socket/native_non_blocking/overload2.html @@ -150,7 +150,7 @@ void async_sendfile(tcp::socket& sock, int fd, Handler h)
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_datagram_socket/native_non_blocking/overload3.html b/doc/html/boost_asio/reference/basic_datagram_socket/native_non_blocking/overload3.html index 8399fc2dbb..369b731ae1 100644 --- a/doc/html/boost_asio/reference/basic_datagram_socket/native_non_blocking/overload3.html +++ b/doc/html/boost_asio/reference/basic_datagram_socket/native_non_blocking/overload3.html @@ -142,7 +142,7 @@ void async_sendfile(tcp::socket& sock, int fd, Handler h)
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_datagram_socket/non_blocking.html b/doc/html/boost_asio/reference/basic_datagram_socket/non_blocking.html index 50981168a2..356364a1a5 100644 --- a/doc/html/boost_asio/reference/basic_datagram_socket/non_blocking.html +++ b/doc/html/boost_asio/reference/basic_datagram_socket/non_blocking.html @@ -49,7 +49,7 @@ void
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_datagram_socket/non_blocking/overload1.html b/doc/html/boost_asio/reference/basic_datagram_socket/non_blocking/overload1.html index 5bf22d7fbd..cc126bd17c 100644 --- a/doc/html/boost_asio/reference/basic_datagram_socket/non_blocking/overload1.html +++ b/doc/html/boost_asio/reference/basic_datagram_socket/non_blocking/overload1.html @@ -57,7 +57,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_datagram_socket/non_blocking/overload2.html b/doc/html/boost_asio/reference/basic_datagram_socket/non_blocking/overload2.html index cf629ad0db..e927aeeba7 100644 --- a/doc/html/boost_asio/reference/basic_datagram_socket/non_blocking/overload2.html +++ b/doc/html/boost_asio/reference/basic_datagram_socket/non_blocking/overload2.html @@ -76,7 +76,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_datagram_socket/non_blocking/overload3.html b/doc/html/boost_asio/reference/basic_datagram_socket/non_blocking/overload3.html index e8e6d51226..57ac7fc40f 100644 --- a/doc/html/boost_asio/reference/basic_datagram_socket/non_blocking/overload3.html +++ b/doc/html/boost_asio/reference/basic_datagram_socket/non_blocking/overload3.html @@ -68,7 +68,7 @@
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_datagram_socket/open.html b/doc/html/boost_asio/reference/basic_datagram_socket/open.html index f9c91120bf..bf6886cf61 100644 --- a/doc/html/boost_asio/reference/basic_datagram_socket/open.html +++ b/doc/html/boost_asio/reference/basic_datagram_socket/open.html @@ -43,7 +43,7 @@ void
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_datagram_socket/open/overload1.html b/doc/html/boost_asio/reference/basic_datagram_socket/open/overload1.html index 61a95a792f..f5de6f41af 100644 --- a/doc/html/boost_asio/reference/basic_datagram_socket/open/overload1.html +++ b/doc/html/boost_asio/reference/basic_datagram_socket/open/overload1.html @@ -75,7 +75,7 @@ socket.open(boost::asio::ip::tcp::v4());
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_datagram_socket/open/overload2.html b/doc/html/boost_asio/reference/basic_datagram_socket/open/overload2.html index 2ca462a179..8cd03e5885 100644 --- a/doc/html/boost_asio/reference/basic_datagram_socket/open/overload2.html +++ b/doc/html/boost_asio/reference/basic_datagram_socket/open/overload2.html @@ -72,7 +72,7 @@ if (ec)
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_datagram_socket/operator_eq_.html b/doc/html/boost_asio/reference/basic_datagram_socket/operator_eq_.html index eb95fe2c30..dea2cca297 100644 --- a/doc/html/boost_asio/reference/basic_datagram_socket/operator_eq_.html +++ b/doc/html/boost_asio/reference/basic_datagram_socket/operator_eq_.html @@ -49,7 +49,7 @@ enable_if< is_convertible< Protocol1, Protocol >::value, basic_datagram
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_datagram_socket/operator_eq_/overload1.html b/doc/html/boost_asio/reference/basic_datagram_socket/operator_eq_/overload1.html index ee18504de9..9a0e6d0755 100644 --- a/doc/html/boost_asio/reference/basic_datagram_socket/operator_eq_/overload1.html +++ b/doc/html/boost_asio/reference/basic_datagram_socket/operator_eq_/overload1.html @@ -62,7 +62,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_datagram_socket/operator_eq_/overload2.html b/doc/html/boost_asio/reference/basic_datagram_socket/operator_eq_/overload2.html index 90f34f0844..79559efe85 100644 --- a/doc/html/boost_asio/reference/basic_datagram_socket/operator_eq_/overload2.html +++ b/doc/html/boost_asio/reference/basic_datagram_socket/operator_eq_/overload2.html @@ -64,7 +64,7 @@ enable_if< is_convertible< Protocol1, Protocol >::value, basic_datagram
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_datagram_socket/out_of_band_inline.html b/doc/html/boost_asio/reference/basic_datagram_socket/out_of_band_inline.html index f2ea21eed3..fdefddcbd0 100644 --- a/doc/html/boost_asio/reference/basic_datagram_socket/out_of_band_inline.html +++ b/doc/html/boost_asio/reference/basic_datagram_socket/out_of_band_inline.html @@ -73,7 +73,7 @@ bool value = option.value();
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_datagram_socket/protocol_type.html b/doc/html/boost_asio/reference/basic_datagram_socket/protocol_type.html index e5ac3c3c7c..b39914b735 100644 --- a/doc/html/boost_asio/reference/basic_datagram_socket/protocol_type.html +++ b/doc/html/boost_asio/reference/basic_datagram_socket/protocol_type.html @@ -46,7 +46,7 @@ The
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_datagram_socket/receive.html b/doc/html/boost_asio/reference/basic_datagram_socket/receive.html index 071424145d..0c55f6810a 100644 --- a/doc/html/boost_asio/reference/basic_datagram_socket/receive.html +++ b/doc/html/boost_asio/reference/basic_datagram_socket/receive.html @@ -55,7 +55,7 @@ std::size_t
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_datagram_socket/receive/overload1.html b/doc/html/boost_asio/reference/basic_datagram_socket/receive/overload1.html index 2123d8f0d9..ff88d21028 100644 --- a/doc/html/boost_asio/reference/basic_datagram_socket/receive/overload1.html +++ b/doc/html/boost_asio/reference/basic_datagram_socket/receive/overload1.html @@ -100,7 +100,7 @@ std::size_t receive(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_datagram_socket/receive/overload2.html b/doc/html/boost_asio/reference/basic_datagram_socket/receive/overload2.html index ce02009dc9..958ca1a883 100644 --- a/doc/html/boost_asio/reference/basic_datagram_socket/receive/overload2.html +++ b/doc/html/boost_asio/reference/basic_datagram_socket/receive/overload2.html @@ -90,7 +90,7 @@ std::size_t receive(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_datagram_socket/receive/overload3.html b/doc/html/boost_asio/reference/basic_datagram_socket/receive/overload3.html index 57825251dc..1ac0c06959 100644 --- a/doc/html/boost_asio/reference/basic_datagram_socket/receive/overload3.html +++ b/doc/html/boost_asio/reference/basic_datagram_socket/receive/overload3.html @@ -82,7 +82,7 @@ std::size_t receive(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_datagram_socket/receive_buffer_size.html b/doc/html/boost_asio/reference/basic_datagram_socket/receive_buffer_size.html index a5fd831f1a..9aaf654bc0 100644 --- a/doc/html/boost_asio/reference/basic_datagram_socket/receive_buffer_size.html +++ b/doc/html/boost_asio/reference/basic_datagram_socket/receive_buffer_size.html @@ -73,7 +73,7 @@ int size = option.value();
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_datagram_socket/receive_from.html b/doc/html/boost_asio/reference/basic_datagram_socket/receive_from.html index a6efeca0b7..f11037844e 100644 --- a/doc/html/boost_asio/reference/basic_datagram_socket/receive_from.html +++ b/doc/html/boost_asio/reference/basic_datagram_socket/receive_from.html @@ -58,7 +58,7 @@ std::size_t
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_datagram_socket/receive_from/overload1.html b/doc/html/boost_asio/reference/basic_datagram_socket/receive_from/overload1.html index 5670ce9b33..5906675ba3 100644 --- a/doc/html/boost_asio/reference/basic_datagram_socket/receive_from/overload1.html +++ b/doc/html/boost_asio/reference/basic_datagram_socket/receive_from/overload1.html @@ -99,7 +99,7 @@ socket.receive_from(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_datagram_socket/receive_from/overload2.html b/doc/html/boost_asio/reference/basic_datagram_socket/receive_from/overload2.html index 4bc268ea22..7d7b9c1721 100644 --- a/doc/html/boost_asio/reference/basic_datagram_socket/receive_from/overload2.html +++ b/doc/html/boost_asio/reference/basic_datagram_socket/receive_from/overload2.html @@ -87,7 +87,7 @@ std::size_t receive_from(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_datagram_socket/receive_from/overload3.html b/doc/html/boost_asio/reference/basic_datagram_socket/receive_from/overload3.html index 064f398a57..b7d885f094 100644 --- a/doc/html/boost_asio/reference/basic_datagram_socket/receive_from/overload3.html +++ b/doc/html/boost_asio/reference/basic_datagram_socket/receive_from/overload3.html @@ -79,7 +79,7 @@ std::size_t receive_from(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_datagram_socket/receive_low_watermark.html b/doc/html/boost_asio/reference/basic_datagram_socket/receive_low_watermark.html index 8c58689f4d..a0fad2d3a5 100644 --- a/doc/html/boost_asio/reference/basic_datagram_socket/receive_low_watermark.html +++ b/doc/html/boost_asio/reference/basic_datagram_socket/receive_low_watermark.html @@ -73,7 +73,7 @@ int size = option.value();
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_datagram_socket/release.html b/doc/html/boost_asio/reference/basic_datagram_socket/release.html index 41ac61bc25..5b8ccf497d 100644 --- a/doc/html/boost_asio/reference/basic_datagram_socket/release.html +++ b/doc/html/boost_asio/reference/basic_datagram_socket/release.html @@ -41,7 +41,7 @@ native_handle_type
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_datagram_socket/release/overload1.html b/doc/html/boost_asio/reference/basic_datagram_socket/release/overload1.html index fdec11c50a..b5a495d570 100644 --- a/doc/html/boost_asio/reference/basic_datagram_socket/release/overload1.html +++ b/doc/html/boost_asio/reference/basic_datagram_socket/release/overload1.html @@ -66,7 +66,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_datagram_socket/release/overload2.html b/doc/html/boost_asio/reference/basic_datagram_socket/release/overload2.html index b7bdfed96d..f8853f8783 100644 --- a/doc/html/boost_asio/reference/basic_datagram_socket/release/overload2.html +++ b/doc/html/boost_asio/reference/basic_datagram_socket/release/overload2.html @@ -67,7 +67,7 @@
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_datagram_socket/remote_endpoint.html b/doc/html/boost_asio/reference/basic_datagram_socket/remote_endpoint.html index 7178523418..d96df3ff32 100644 --- a/doc/html/boost_asio/reference/basic_datagram_socket/remote_endpoint.html +++ b/doc/html/boost_asio/reference/basic_datagram_socket/remote_endpoint.html @@ -41,7 +41,7 @@ endpoint_type
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_datagram_socket/remote_endpoint/overload1.html b/doc/html/boost_asio/reference/basic_datagram_socket/remote_endpoint/overload1.html index d1ab09ddf1..bb52347efc 100644 --- a/doc/html/boost_asio/reference/basic_datagram_socket/remote_endpoint/overload1.html +++ b/doc/html/boost_asio/reference/basic_datagram_socket/remote_endpoint/overload1.html @@ -70,7 +70,7 @@ boost::asio::ip::tcp::endpoint endpoint = socket.remote_endpoint();
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_datagram_socket/remote_endpoint/overload2.html b/doc/html/boost_asio/reference/basic_datagram_socket/remote_endpoint/overload2.html index 4b58813fdf..ff81d67058 100644 --- a/doc/html/boost_asio/reference/basic_datagram_socket/remote_endpoint/overload2.html +++ b/doc/html/boost_asio/reference/basic_datagram_socket/remote_endpoint/overload2.html @@ -77,7 +77,7 @@ if (ec)
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_datagram_socket/reuse_address.html b/doc/html/boost_asio/reference/basic_datagram_socket/reuse_address.html index cb6570d505..1c3400509b 100644 --- a/doc/html/boost_asio/reference/basic_datagram_socket/reuse_address.html +++ b/doc/html/boost_asio/reference/basic_datagram_socket/reuse_address.html @@ -74,7 +74,7 @@ bool is_set = option.value();
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_datagram_socket/send.html b/doc/html/boost_asio/reference/basic_datagram_socket/send.html index 92a767c2fa..3ffab3ee44 100644 --- a/doc/html/boost_asio/reference/basic_datagram_socket/send.html +++ b/doc/html/boost_asio/reference/basic_datagram_socket/send.html @@ -55,7 +55,7 @@ std::size_t
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_datagram_socket/send/overload1.html b/doc/html/boost_asio/reference/basic_datagram_socket/send/overload1.html index c5b66ea3bf..a98f3039d8 100644 --- a/doc/html/boost_asio/reference/basic_datagram_socket/send/overload1.html +++ b/doc/html/boost_asio/reference/basic_datagram_socket/send/overload1.html @@ -100,7 +100,7 @@ std::size_t send(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_datagram_socket/send/overload2.html b/doc/html/boost_asio/reference/basic_datagram_socket/send/overload2.html index d1d9f581ee..72c9c18380 100644 --- a/doc/html/boost_asio/reference/basic_datagram_socket/send/overload2.html +++ b/doc/html/boost_asio/reference/basic_datagram_socket/send/overload2.html @@ -90,7 +90,7 @@ std::size_t send(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_datagram_socket/send/overload3.html b/doc/html/boost_asio/reference/basic_datagram_socket/send/overload3.html index 8d982a3485..75042a0977 100644 --- a/doc/html/boost_asio/reference/basic_datagram_socket/send/overload3.html +++ b/doc/html/boost_asio/reference/basic_datagram_socket/send/overload3.html @@ -82,7 +82,7 @@ std::size_t send(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_datagram_socket/send_buffer_size.html b/doc/html/boost_asio/reference/basic_datagram_socket/send_buffer_size.html index b1cad3df9d..cd2bc1f51c 100644 --- a/doc/html/boost_asio/reference/basic_datagram_socket/send_buffer_size.html +++ b/doc/html/boost_asio/reference/basic_datagram_socket/send_buffer_size.html @@ -73,7 +73,7 @@ int size = option.value();
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_datagram_socket/send_low_watermark.html b/doc/html/boost_asio/reference/basic_datagram_socket/send_low_watermark.html index b8330d6ad7..d2e28b024f 100644 --- a/doc/html/boost_asio/reference/basic_datagram_socket/send_low_watermark.html +++ b/doc/html/boost_asio/reference/basic_datagram_socket/send_low_watermark.html @@ -73,7 +73,7 @@ int size = option.value();
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_datagram_socket/send_to.html b/doc/html/boost_asio/reference/basic_datagram_socket/send_to.html index a353953822..b922e43062 100644 --- a/doc/html/boost_asio/reference/basic_datagram_socket/send_to.html +++ b/doc/html/boost_asio/reference/basic_datagram_socket/send_to.html @@ -58,7 +58,7 @@ std::size_t
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_datagram_socket/send_to/overload1.html b/doc/html/boost_asio/reference/basic_datagram_socket/send_to/overload1.html index 5db6a59e73..4c68b71395 100644 --- a/doc/html/boost_asio/reference/basic_datagram_socket/send_to/overload1.html +++ b/doc/html/boost_asio/reference/basic_datagram_socket/send_to/overload1.html @@ -99,7 +99,7 @@ socket.send_to(boost::asio::buffer(data, size), destination);
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_datagram_socket/send_to/overload2.html b/doc/html/boost_asio/reference/basic_datagram_socket/send_to/overload2.html index 12c181db25..5d71f3ac13 100644 --- a/doc/html/boost_asio/reference/basic_datagram_socket/send_to/overload2.html +++ b/doc/html/boost_asio/reference/basic_datagram_socket/send_to/overload2.html @@ -87,7 +87,7 @@ std::size_t send_to(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_datagram_socket/send_to/overload3.html b/doc/html/boost_asio/reference/basic_datagram_socket/send_to/overload3.html index d8a2271630..20ae6a7bea 100644 --- a/doc/html/boost_asio/reference/basic_datagram_socket/send_to/overload3.html +++ b/doc/html/boost_asio/reference/basic_datagram_socket/send_to/overload3.html @@ -79,7 +79,7 @@ std::size_t send_to(
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_datagram_socket/set_option.html b/doc/html/boost_asio/reference/basic_datagram_socket/set_option.html index cd5499f4a3..d3252af18c 100644 --- a/doc/html/boost_asio/reference/basic_datagram_socket/set_option.html +++ b/doc/html/boost_asio/reference/basic_datagram_socket/set_option.html @@ -47,7 +47,7 @@ void
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_datagram_socket/set_option/overload1.html b/doc/html/boost_asio/reference/basic_datagram_socket/set_option/overload1.html index 3677154650..1ba98d3b8b 100644 --- a/doc/html/boost_asio/reference/basic_datagram_socket/set_option/overload1.html +++ b/doc/html/boost_asio/reference/basic_datagram_socket/set_option/overload1.html @@ -82,7 +82,7 @@ socket.set_option(option);
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_datagram_socket/set_option/overload2.html b/doc/html/boost_asio/reference/basic_datagram_socket/set_option/overload2.html index ee6ee736db..45fef5702c 100644 --- a/doc/html/boost_asio/reference/basic_datagram_socket/set_option/overload2.html +++ b/doc/html/boost_asio/reference/basic_datagram_socket/set_option/overload2.html @@ -79,7 +79,7 @@ if (ec)
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_datagram_socket/shutdown.html b/doc/html/boost_asio/reference/basic_datagram_socket/shutdown.html index 6a8d3f7297..5047c2256e 100644 --- a/doc/html/boost_asio/reference/basic_datagram_socket/shutdown.html +++ b/doc/html/boost_asio/reference/basic_datagram_socket/shutdown.html @@ -43,7 +43,7 @@ void
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_datagram_socket/shutdown/overload1.html b/doc/html/boost_asio/reference/basic_datagram_socket/shutdown/overload1.html index 159cd62590..e9ed65eef3 100644 --- a/doc/html/boost_asio/reference/basic_datagram_socket/shutdown/overload1.html +++ b/doc/html/boost_asio/reference/basic_datagram_socket/shutdown/overload1.html @@ -80,7 +80,7 @@ socket.shutdown(boost::asio::ip::tcp::socket::shutdown_send);
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_datagram_socket/shutdown/overload2.html b/doc/html/boost_asio/reference/basic_datagram_socket/shutdown/overload2.html index 1281d06e90..40d1014f71 100644 --- a/doc/html/boost_asio/reference/basic_datagram_socket/shutdown/overload2.html +++ b/doc/html/boost_asio/reference/basic_datagram_socket/shutdown/overload2.html @@ -77,7 +77,7 @@ if (ec)
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_datagram_socket/shutdown_type.html b/doc/html/boost_asio/reference/basic_datagram_socket/shutdown_type.html index fbde89e2a0..5b4a66770e 100644 --- a/doc/html/boost_asio/reference/basic_datagram_socket/shutdown_type.html +++ b/doc/html/boost_asio/reference/basic_datagram_socket/shutdown_type.html @@ -65,7 +65,7 @@ Different
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_datagram_socket/wait.html b/doc/html/boost_asio/reference/basic_datagram_socket/wait.html index 7289f62f99..fbc508213f 100644 --- a/doc/html/boost_asio/reference/basic_datagram_socket/wait.html +++ b/doc/html/boost_asio/reference/basic_datagram_socket/wait.html @@ -44,7 +44,7 @@ void
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_datagram_socket/wait/overload1.html b/doc/html/boost_asio/reference/basic_datagram_socket/wait/overload1.html index 5f98807fe4..3a90c882bf 100644 --- a/doc/html/boost_asio/reference/basic_datagram_socket/wait/overload1.html +++ b/doc/html/boost_asio/reference/basic_datagram_socket/wait/overload1.html @@ -68,7 +68,7 @@ socket.wait(boost::asio::ip::tcp::socket::wait_read);
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_datagram_socket/wait/overload2.html b/doc/html/boost_asio/reference/basic_datagram_socket/wait/overload2.html index 1095d7f6c1..21d4239b95 100644 --- a/doc/html/boost_asio/reference/basic_datagram_socket/wait/overload2.html +++ b/doc/html/boost_asio/reference/basic_datagram_socket/wait/overload2.html @@ -74,7 +74,7 @@ socket.wait(boost::asio::ip::tcp::socket::wait_read, ec);
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_datagram_socket/wait_type.html b/doc/html/boost_asio/reference/basic_datagram_socket/wait_type.html index 04508a97d1..64e95934df 100644 --- a/doc/html/boost_asio/reference/basic_datagram_socket/wait_type.html +++ b/doc/html/boost_asio/reference/basic_datagram_socket/wait_type.html @@ -68,7 +68,7 @@ Wait
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_deadline_timer.html b/doc/html/boost_asio/reference/basic_deadline_timer.html index 66f8c69bbe..a7d1307b37 100644 --- a/doc/html/boost_asio/reference/basic_deadline_timer.html +++ b/doc/html/boost_asio/reference/basic_deadline_timer.html @@ -411,7 +411,7 @@ void on_timeout(const boost::system::error_code& e)
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_deadline_timer/_basic_deadline_timer.html b/doc/html/boost_asio/reference/basic_deadline_timer/_basic_deadline_timer.html index 76e0a3569b..f96703d6ad 100644 --- a/doc/html/boost_asio/reference/basic_deadline_timer/_basic_deadline_timer.html +++ b/doc/html/boost_asio/reference/basic_deadline_timer/_basic_deadline_timer.html @@ -40,7 +40,7 @@ Destroys
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_deadline_timer/async_wait.html b/doc/html/boost_asio/reference/basic_deadline_timer/async_wait.html index 0c17f41e13..d0ef1212e5 100644 --- a/doc/html/boost_asio/reference/basic_deadline_timer/async_wait.html +++ b/doc/html/boost_asio/reference/basic_deadline_timer/async_wait.html @@ -83,7 +83,7 @@ Start
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_deadline_timer/basic_deadline_timer.html b/doc/html/boost_asio/reference/basic_deadline_timer/basic_deadline_timer.html index c816bf2e77..329c6507a3 100644 --- a/doc/html/boost_asio/reference/basic_deadline_timer/basic_deadline_timer.html +++ b/doc/html/boost_asio/reference/basic_deadline_timer/basic_deadline_timer.html @@ -61,7 +61,7 @@ Constructor.
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_deadline_timer/basic_deadline_timer/overload1.html b/doc/html/boost_asio/reference/basic_deadline_timer/basic_deadline_timer/overload1.html index 1ca8547786..5bc1b48677 100644 --- a/doc/html/boost_asio/reference/basic_deadline_timer/basic_deadline_timer/overload1.html +++ b/doc/html/boost_asio/reference/basic_deadline_timer/basic_deadline_timer/overload1.html @@ -56,7 +56,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_deadline_timer/basic_deadline_timer/overload2.html b/doc/html/boost_asio/reference/basic_deadline_timer/basic_deadline_timer/overload2.html index b05041e8f8..8794b1c314 100644 --- a/doc/html/boost_asio/reference/basic_deadline_timer/basic_deadline_timer/overload2.html +++ b/doc/html/boost_asio/reference/basic_deadline_timer/basic_deadline_timer/overload2.html @@ -60,7 +60,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_deadline_timer/basic_deadline_timer/overload3.html b/doc/html/boost_asio/reference/basic_deadline_timer/basic_deadline_timer/overload3.html index bf76639f29..e65f68026e 100644 --- a/doc/html/boost_asio/reference/basic_deadline_timer/basic_deadline_timer/overload3.html +++ b/doc/html/boost_asio/reference/basic_deadline_timer/basic_deadline_timer/overload3.html @@ -59,7 +59,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_deadline_timer/basic_deadline_timer/overload4.html b/doc/html/boost_asio/reference/basic_deadline_timer/basic_deadline_timer/overload4.html index c75847ac0b..e8562e9026 100644 --- a/doc/html/boost_asio/reference/basic_deadline_timer/basic_deadline_timer/overload4.html +++ b/doc/html/boost_asio/reference/basic_deadline_timer/basic_deadline_timer/overload4.html @@ -62,7 +62,7 @@
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_deadline_timer/cancel.html b/doc/html/boost_asio/reference/basic_deadline_timer/cancel.html index 0721ee1e9c..5734aef218 100644 --- a/doc/html/boost_asio/reference/basic_deadline_timer/cancel.html +++ b/doc/html/boost_asio/reference/basic_deadline_timer/cancel.html @@ -41,7 +41,7 @@ std::size_t
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_deadline_timer/cancel/overload1.html b/doc/html/boost_asio/reference/basic_deadline_timer/cancel/overload1.html index 987a8ccc2f..5c54f21d54 100644 --- a/doc/html/boost_asio/reference/basic_deadline_timer/cancel/overload1.html +++ b/doc/html/boost_asio/reference/basic_deadline_timer/cancel/overload1.html @@ -85,7 +85,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_deadline_timer/cancel/overload2.html b/doc/html/boost_asio/reference/basic_deadline_timer/cancel/overload2.html index de33a0d2e9..b08065101e 100644 --- a/doc/html/boost_asio/reference/basic_deadline_timer/cancel/overload2.html +++ b/doc/html/boost_asio/reference/basic_deadline_timer/cancel/overload2.html @@ -86,7 +86,7 @@
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_deadline_timer/cancel_one.html b/doc/html/boost_asio/reference/basic_deadline_timer/cancel_one.html index da26a3a7db..121bae9963 100644 --- a/doc/html/boost_asio/reference/basic_deadline_timer/cancel_one.html +++ b/doc/html/boost_asio/reference/basic_deadline_timer/cancel_one.html @@ -41,7 +41,7 @@ std::size_t
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_deadline_timer/cancel_one/overload1.html b/doc/html/boost_asio/reference/basic_deadline_timer/cancel_one/overload1.html index c2ca8c7dd5..5393d1b807 100644 --- a/doc/html/boost_asio/reference/basic_deadline_timer/cancel_one/overload1.html +++ b/doc/html/boost_asio/reference/basic_deadline_timer/cancel_one/overload1.html @@ -86,7 +86,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_deadline_timer/cancel_one/overload2.html b/doc/html/boost_asio/reference/basic_deadline_timer/cancel_one/overload2.html index f5932703b2..32cb701915 100644 --- a/doc/html/boost_asio/reference/basic_deadline_timer/cancel_one/overload2.html +++ b/doc/html/boost_asio/reference/basic_deadline_timer/cancel_one/overload2.html @@ -87,7 +87,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_deadline_timer/duration_type.html b/doc/html/boost_asio/reference/basic_deadline_timer/duration_type.html index 944c673e92..9bda30218a 100644 --- a/doc/html/boost_asio/reference/basic_deadline_timer/duration_type.html +++ b/doc/html/boost_asio/reference/basic_deadline_timer/duration_type.html @@ -46,7 +46,7 @@ The
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_deadline_timer/executor_type.html b/doc/html/boost_asio/reference/basic_deadline_timer/executor_type.html index c2eaf66fb7..c2c0a05d7f 100644 --- a/doc/html/boost_asio/reference/basic_deadline_timer/executor_type.html +++ b/doc/html/boost_asio/reference/basic_deadline_timer/executor_type.html @@ -203,7 +203,7 @@ The
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_deadline_timer/expires_at.html b/doc/html/boost_asio/reference/basic_deadline_timer/expires_at.html index 9b87cf9358..1036eca196 100644 --- a/doc/html/boost_asio/reference/basic_deadline_timer/expires_at.html +++ b/doc/html/boost_asio/reference/basic_deadline_timer/expires_at.html @@ -49,7 +49,7 @@ std::size_t
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_deadline_timer/expires_at/overload1.html b/doc/html/boost_asio/reference/basic_deadline_timer/expires_at/overload1.html index a354338b12..ce4e9bb95b 100644 --- a/doc/html/boost_asio/reference/basic_deadline_timer/expires_at/overload1.html +++ b/doc/html/boost_asio/reference/basic_deadline_timer/expires_at/overload1.html @@ -39,7 +39,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_deadline_timer/expires_at/overload2.html b/doc/html/boost_asio/reference/basic_deadline_timer/expires_at/overload2.html index cdc1629ddd..636b420a43 100644 --- a/doc/html/boost_asio/reference/basic_deadline_timer/expires_at/overload2.html +++ b/doc/html/boost_asio/reference/basic_deadline_timer/expires_at/overload2.html @@ -95,7 +95,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_deadline_timer/expires_at/overload3.html b/doc/html/boost_asio/reference/basic_deadline_timer/expires_at/overload3.html index d024d75a5f..21a1b71290 100644 --- a/doc/html/boost_asio/reference/basic_deadline_timer/expires_at/overload3.html +++ b/doc/html/boost_asio/reference/basic_deadline_timer/expires_at/overload3.html @@ -87,7 +87,7 @@
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_deadline_timer/expires_from_now.html b/doc/html/boost_asio/reference/basic_deadline_timer/expires_from_now.html index f2a47d6a29..343daeae19 100644 --- a/doc/html/boost_asio/reference/basic_deadline_timer/expires_from_now.html +++ b/doc/html/boost_asio/reference/basic_deadline_timer/expires_from_now.html @@ -49,7 +49,7 @@ std::size_t
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_deadline_timer/expires_from_now/overload1.html b/doc/html/boost_asio/reference/basic_deadline_timer/expires_from_now/overload1.html index 608f10e7f1..0866e429d6 100644 --- a/doc/html/boost_asio/reference/basic_deadline_timer/expires_from_now/overload1.html +++ b/doc/html/boost_asio/reference/basic_deadline_timer/expires_from_now/overload1.html @@ -39,7 +39,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_deadline_timer/expires_from_now/overload2.html b/doc/html/boost_asio/reference/basic_deadline_timer/expires_from_now/overload2.html index 6fbdd4cb96..f64bacfbf1 100644 --- a/doc/html/boost_asio/reference/basic_deadline_timer/expires_from_now/overload2.html +++ b/doc/html/boost_asio/reference/basic_deadline_timer/expires_from_now/overload2.html @@ -95,7 +95,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_deadline_timer/expires_from_now/overload3.html b/doc/html/boost_asio/reference/basic_deadline_timer/expires_from_now/overload3.html index 58f00c1e9a..af65c1956a 100644 --- a/doc/html/boost_asio/reference/basic_deadline_timer/expires_from_now/overload3.html +++ b/doc/html/boost_asio/reference/basic_deadline_timer/expires_from_now/overload3.html @@ -87,7 +87,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_deadline_timer/get_executor.html b/doc/html/boost_asio/reference/basic_deadline_timer/get_executor.html index 587c685815..9f410a8f3c 100644 --- a/doc/html/boost_asio/reference/basic_deadline_timer/get_executor.html +++ b/doc/html/boost_asio/reference/basic_deadline_timer/get_executor.html @@ -36,7 +36,7 @@ Get
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_deadline_timer/get_io_context.html b/doc/html/boost_asio/reference/basic_deadline_timer/get_io_context.html index 2aadb6b223..5128b019fa 100644 --- a/doc/html/boost_asio/reference/basic_deadline_timer/get_io_context.html +++ b/doc/html/boost_asio/reference/basic_deadline_timer/get_io_context.html @@ -51,7 +51,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_deadline_timer/get_io_service.html b/doc/html/boost_asio/reference/basic_deadline_timer/get_io_service.html index 482ad36d9b..cdf4cc91d5 100644 --- a/doc/html/boost_asio/reference/basic_deadline_timer/get_io_service.html +++ b/doc/html/boost_asio/reference/basic_deadline_timer/get_io_service.html @@ -51,7 +51,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_deadline_timer/operator_eq_.html b/doc/html/boost_asio/reference/basic_deadline_timer/operator_eq_.html index 510fd9fd8d..b3e8710ede 100644 --- a/doc/html/boost_asio/reference/basic_deadline_timer/operator_eq_.html +++ b/doc/html/boost_asio/reference/basic_deadline_timer/operator_eq_.html @@ -64,7 +64,7 @@ Move-assign
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_deadline_timer/time_type.html b/doc/html/boost_asio/reference/basic_deadline_timer/time_type.html index 3bcba82777..424d75009f 100644 --- a/doc/html/boost_asio/reference/basic_deadline_timer/time_type.html +++ b/doc/html/boost_asio/reference/basic_deadline_timer/time_type.html @@ -46,7 +46,7 @@ The
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_deadline_timer/traits_type.html b/doc/html/boost_asio/reference/basic_deadline_timer/traits_type.html index 1d9ec6b9a7..e712c42259 100644 --- a/doc/html/boost_asio/reference/basic_deadline_timer/traits_type.html +++ b/doc/html/boost_asio/reference/basic_deadline_timer/traits_type.html @@ -46,7 +46,7 @@ The
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_deadline_timer/wait.html b/doc/html/boost_asio/reference/basic_deadline_timer/wait.html index 91c2aaeb53..444af5f190 100644 --- a/doc/html/boost_asio/reference/basic_deadline_timer/wait.html +++ b/doc/html/boost_asio/reference/basic_deadline_timer/wait.html @@ -41,7 +41,7 @@ void
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_deadline_timer/wait/overload1.html b/doc/html/boost_asio/reference/basic_deadline_timer/wait/overload1.html index 0dfad079cd..52cc11e1d5 100644 --- a/doc/html/boost_asio/reference/basic_deadline_timer/wait/overload1.html +++ b/doc/html/boost_asio/reference/basic_deadline_timer/wait/overload1.html @@ -52,7 +52,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_deadline_timer/wait/overload2.html b/doc/html/boost_asio/reference/basic_deadline_timer/wait/overload2.html index 03138fa4ea..0321d575a2 100644 --- a/doc/html/boost_asio/reference/basic_deadline_timer/wait/overload2.html +++ b/doc/html/boost_asio/reference/basic_deadline_timer/wait/overload2.html @@ -53,7 +53,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_io_object.html b/doc/html/boost_asio/reference/basic_io_object.html index 589e450360..198c6de05a 100644 --- a/doc/html/boost_asio/reference/basic_io_object.html +++ b/doc/html/boost_asio/reference/basic_io_object.html @@ -267,7 +267,7 @@ class basic_io_object
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_io_object/_basic_io_object.html b/doc/html/boost_asio/reference/basic_io_object/_basic_io_object.html index dd9279c549..98e52137fa 100644 --- a/doc/html/boost_asio/reference/basic_io_object/_basic_io_object.html +++ b/doc/html/boost_asio/reference/basic_io_object/_basic_io_object.html @@ -41,7 +41,7 @@ Protected
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_io_object/basic_io_object.html b/doc/html/boost_asio/reference/basic_io_object/basic_io_object.html index 9b648e75a9..291b5a66e5 100644 --- a/doc/html/boost_asio/reference/basic_io_object/basic_io_object.html +++ b/doc/html/boost_asio/reference/basic_io_object/basic_io_object.html @@ -55,7 +55,7 @@ Construct
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_io_object/basic_io_object/overload1.html b/doc/html/boost_asio/reference/basic_io_object/basic_io_object/overload1.html index 3ef4ec91cb..004a419678 100644 --- a/doc/html/boost_asio/reference/basic_io_object/basic_io_object/overload1.html +++ b/doc/html/boost_asio/reference/basic_io_object/basic_io_object/overload1.html @@ -41,7 +41,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_io_object/basic_io_object/overload2.html b/doc/html/boost_asio/reference/basic_io_object/basic_io_object/overload2.html index 0402992cc9..06b7c4b203 100644 --- a/doc/html/boost_asio/reference/basic_io_object/basic_io_object/overload2.html +++ b/doc/html/boost_asio/reference/basic_io_object/basic_io_object/overload2.html @@ -49,7 +49,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_io_object/basic_io_object/overload3.html b/doc/html/boost_asio/reference/basic_io_object/basic_io_object/overload3.html index 4e54afd212..3b1820809a 100644 --- a/doc/html/boost_asio/reference/basic_io_object/basic_io_object/overload3.html +++ b/doc/html/boost_asio/reference/basic_io_object/basic_io_object/overload3.html @@ -39,7 +39,7 @@ basic_io_object(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_io_object/executor_type.html b/doc/html/boost_asio/reference/basic_io_object/executor_type.html index c16c2e4fad..d3a923bac6 100644 --- a/doc/html/boost_asio/reference/basic_io_object/executor_type.html +++ b/doc/html/boost_asio/reference/basic_io_object/executor_type.html @@ -203,7 +203,7 @@ The
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_io_object/get_executor.html b/doc/html/boost_asio/reference/basic_io_object/get_executor.html index cc051ce43e..0dec01a31b 100644 --- a/doc/html/boost_asio/reference/basic_io_object/get_executor.html +++ b/doc/html/boost_asio/reference/basic_io_object/get_executor.html @@ -36,7 +36,7 @@ Get
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_io_object/get_implementation.html b/doc/html/boost_asio/reference/basic_io_object/get_implementation.html index e5c1ac55c5..b7bc8d1bbd 100644 --- a/doc/html/boost_asio/reference/basic_io_object/get_implementation.html +++ b/doc/html/boost_asio/reference/basic_io_object/get_implementation.html @@ -40,7 +40,7 @@ const implementation_type &
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_io_object/get_implementation/overload1.html b/doc/html/boost_asio/reference/basic_io_object/get_implementation/overload1.html index 9f13970f85..9fde12b9ff 100644 --- a/doc/html/boost_asio/reference/basic_io_object/get_implementation/overload1.html +++ b/doc/html/boost_asio/reference/basic_io_object/get_implementation/overload1.html @@ -35,7 +35,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_io_object/get_implementation/overload2.html b/doc/html/boost_asio/reference/basic_io_object/get_implementation/overload2.html index 8a98d5fd4b..d3e1b93f61 100644 --- a/doc/html/boost_asio/reference/basic_io_object/get_implementation/overload2.html +++ b/doc/html/boost_asio/reference/basic_io_object/get_implementation/overload2.html @@ -35,7 +35,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_io_object/get_io_context.html b/doc/html/boost_asio/reference/basic_io_object/get_io_context.html index 47ccbc13d9..108435842a 100644 --- a/doc/html/boost_asio/reference/basic_io_object/get_io_context.html +++ b/doc/html/boost_asio/reference/basic_io_object/get_io_context.html @@ -51,7 +51,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_io_object/get_io_service.html b/doc/html/boost_asio/reference/basic_io_object/get_io_service.html index 90c1dec79b..b01168dd68 100644 --- a/doc/html/boost_asio/reference/basic_io_object/get_io_service.html +++ b/doc/html/boost_asio/reference/basic_io_object/get_io_service.html @@ -51,7 +51,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_io_object/get_service.html b/doc/html/boost_asio/reference/basic_io_object/get_service.html index 43a7669b8f..6ae390b184 100644 --- a/doc/html/boost_asio/reference/basic_io_object/get_service.html +++ b/doc/html/boost_asio/reference/basic_io_object/get_service.html @@ -40,7 +40,7 @@ const service_type & -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_io_object/get_service/overload1.html b/doc/html/boost_asio/reference/basic_io_object/get_service/overload1.html index a868a8ea9f..0585564c1a 100644 --- a/doc/html/boost_asio/reference/basic_io_object/get_service/overload1.html +++ b/doc/html/boost_asio/reference/basic_io_object/get_service/overload1.html @@ -35,7 +35,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_io_object/get_service/overload2.html b/doc/html/boost_asio/reference/basic_io_object/get_service/overload2.html index d632a8943c..e0da8b6b2d 100644 --- a/doc/html/boost_asio/reference/basic_io_object/get_service/overload2.html +++ b/doc/html/boost_asio/reference/basic_io_object/get_service/overload2.html @@ -35,7 +35,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_io_object/implementation_type.html b/doc/html/boost_asio/reference/basic_io_object/implementation_type.html index 6bef862517..ccadf91e16 100644 --- a/doc/html/boost_asio/reference/basic_io_object/implementation_type.html +++ b/doc/html/boost_asio/reference/basic_io_object/implementation_type.html @@ -46,7 +46,7 @@ The
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_io_object/operator_eq_.html b/doc/html/boost_asio/reference/basic_io_object/operator_eq_.html index bee55b128f..a56a8040a3 100644 --- a/doc/html/boost_asio/reference/basic_io_object/operator_eq_.html +++ b/doc/html/boost_asio/reference/basic_io_object/operator_eq_.html @@ -50,7 +50,7 @@ Move-assign
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_io_object/service_type.html b/doc/html/boost_asio/reference/basic_io_object/service_type.html index 7b3340c913..414eaf3eef 100644 --- a/doc/html/boost_asio/reference/basic_io_object/service_type.html +++ b/doc/html/boost_asio/reference/basic_io_object/service_type.html @@ -46,7 +46,7 @@ The
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_raw_socket.html b/doc/html/boost_asio/reference/basic_raw_socket.html index 56e4a58b41..4c05c06ef5 100644 --- a/doc/html/boost_asio/reference/basic_raw_socket.html +++ b/doc/html/boost_asio/reference/basic_raw_socket.html @@ -941,7 +941,7 @@ class basic_raw_socket :
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_raw_socket/_basic_raw_socket.html b/doc/html/boost_asio/reference/basic_raw_socket/_basic_raw_socket.html index 6af321a1d7..03a8d1aa71 100644 --- a/doc/html/boost_asio/reference/basic_raw_socket/_basic_raw_socket.html +++ b/doc/html/boost_asio/reference/basic_raw_socket/_basic_raw_socket.html @@ -40,7 +40,7 @@ Destroys
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_raw_socket/assign.html b/doc/html/boost_asio/reference/basic_raw_socket/assign.html index cb836dae8b..3f69c28543 100644 --- a/doc/html/boost_asio/reference/basic_raw_socket/assign.html +++ b/doc/html/boost_asio/reference/basic_raw_socket/assign.html @@ -45,7 +45,7 @@ void
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_raw_socket/assign/overload1.html b/doc/html/boost_asio/reference/basic_raw_socket/assign/overload1.html index 95f5a0b6a3..13fcc7ccb4 100644 --- a/doc/html/boost_asio/reference/basic_raw_socket/assign/overload1.html +++ b/doc/html/boost_asio/reference/basic_raw_socket/assign/overload1.html @@ -40,7 +40,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_raw_socket/assign/overload2.html b/doc/html/boost_asio/reference/basic_raw_socket/assign/overload2.html index 79cda42220..dc4a26d823 100644 --- a/doc/html/boost_asio/reference/basic_raw_socket/assign/overload2.html +++ b/doc/html/boost_asio/reference/basic_raw_socket/assign/overload2.html @@ -41,7 +41,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_raw_socket/async_connect.html b/doc/html/boost_asio/reference/basic_raw_socket/async_connect.html index c840437404..fa57211b4b 100644 --- a/doc/html/boost_asio/reference/basic_raw_socket/async_connect.html +++ b/doc/html/boost_asio/reference/basic_raw_socket/async_connect.html @@ -103,7 +103,7 @@ socket.async_connect(endpoint, connect_handler);
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_raw_socket/async_receive.html b/doc/html/boost_asio/reference/basic_raw_socket/async_receive.html index c02a91cf17..7f50c92e66 100644 --- a/doc/html/boost_asio/reference/basic_raw_socket/async_receive.html +++ b/doc/html/boost_asio/reference/basic_raw_socket/async_receive.html @@ -51,7 +51,7 @@ template<
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_raw_socket/async_receive/overload1.html b/doc/html/boost_asio/reference/basic_raw_socket/async_receive/overload1.html index e5e13c0332..fddd00f918 100644 --- a/doc/html/boost_asio/reference/basic_raw_socket/async_receive/overload1.html +++ b/doc/html/boost_asio/reference/basic_raw_socket/async_receive/overload1.html @@ -103,7 +103,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_raw_socket/async_receive/overload2.html b/doc/html/boost_asio/reference/basic_raw_socket/async_receive/overload2.html index d4a9dcf56d..6b9f3d87d8 100644 --- a/doc/html/boost_asio/reference/basic_raw_socket/async_receive/overload2.html +++ b/doc/html/boost_asio/reference/basic_raw_socket/async_receive/overload2.html @@ -93,7 +93,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_raw_socket/async_receive_from.html b/doc/html/boost_asio/reference/basic_raw_socket/async_receive_from.html index d881d27c60..487e983c48 100644 --- a/doc/html/boost_asio/reference/basic_raw_socket/async_receive_from.html +++ b/doc/html/boost_asio/reference/basic_raw_socket/async_receive_from.html @@ -53,7 +53,7 @@ template<
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_raw_socket/async_receive_from/overload1.html b/doc/html/boost_asio/reference/basic_raw_socket/async_receive_from/overload1.html index dfc38813af..ebc6a0a590 100644 --- a/doc/html/boost_asio/reference/basic_raw_socket/async_receive_from/overload1.html +++ b/doc/html/boost_asio/reference/basic_raw_socket/async_receive_from/overload1.html @@ -103,7 +103,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_raw_socket/async_receive_from/overload2.html b/doc/html/boost_asio/reference/basic_raw_socket/async_receive_from/overload2.html index 492585a34d..6cfa172d7e 100644 --- a/doc/html/boost_asio/reference/basic_raw_socket/async_receive_from/overload2.html +++ b/doc/html/boost_asio/reference/basic_raw_socket/async_receive_from/overload2.html @@ -92,7 +92,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_raw_socket/async_send.html b/doc/html/boost_asio/reference/basic_raw_socket/async_send.html index b0a4a62192..101b210690 100644 --- a/doc/html/boost_asio/reference/basic_raw_socket/async_send.html +++ b/doc/html/boost_asio/reference/basic_raw_socket/async_send.html @@ -51,7 +51,7 @@ template<
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_raw_socket/async_send/overload1.html b/doc/html/boost_asio/reference/basic_raw_socket/async_send/overload1.html index 3fc2ea6657..1522f06038 100644 --- a/doc/html/boost_asio/reference/basic_raw_socket/async_send/overload1.html +++ b/doc/html/boost_asio/reference/basic_raw_socket/async_send/overload1.html @@ -102,7 +102,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_raw_socket/async_send/overload2.html b/doc/html/boost_asio/reference/basic_raw_socket/async_send/overload2.html index 231fb5afe5..833ac34e2b 100644 --- a/doc/html/boost_asio/reference/basic_raw_socket/async_send/overload2.html +++ b/doc/html/boost_asio/reference/basic_raw_socket/async_send/overload2.html @@ -92,7 +92,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_raw_socket/async_send_to.html b/doc/html/boost_asio/reference/basic_raw_socket/async_send_to.html index cc06f6a885..b6f3b25a61 100644 --- a/doc/html/boost_asio/reference/basic_raw_socket/async_send_to.html +++ b/doc/html/boost_asio/reference/basic_raw_socket/async_send_to.html @@ -53,7 +53,7 @@ template<
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_raw_socket/async_send_to/overload1.html b/doc/html/boost_asio/reference/basic_raw_socket/async_send_to/overload1.html index f3ab4d3340..04c837a46b 100644 --- a/doc/html/boost_asio/reference/basic_raw_socket/async_send_to/overload1.html +++ b/doc/html/boost_asio/reference/basic_raw_socket/async_send_to/overload1.html @@ -103,7 +103,7 @@ socket.async_send_to(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_raw_socket/async_send_to/overload2.html b/doc/html/boost_asio/reference/basic_raw_socket/async_send_to/overload2.html index be82e4561c..a29813edfd 100644 --- a/doc/html/boost_asio/reference/basic_raw_socket/async_send_to/overload2.html +++ b/doc/html/boost_asio/reference/basic_raw_socket/async_send_to/overload2.html @@ -90,7 +90,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_raw_socket/async_wait.html b/doc/html/boost_asio/reference/basic_raw_socket/async_wait.html index 26478a75ad..cbae167023 100644 --- a/doc/html/boost_asio/reference/basic_raw_socket/async_wait.html +++ b/doc/html/boost_asio/reference/basic_raw_socket/async_wait.html @@ -97,7 +97,7 @@ socket.async_wait(boost::asio::ip::tcp::socket::wait_read, wait_handler);
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_raw_socket/at_mark.html b/doc/html/boost_asio/reference/basic_raw_socket/at_mark.html index 1143a0ce18..8a6b20caee 100644 --- a/doc/html/boost_asio/reference/basic_raw_socket/at_mark.html +++ b/doc/html/boost_asio/reference/basic_raw_socket/at_mark.html @@ -41,7 +41,7 @@ bool
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_raw_socket/at_mark/overload1.html b/doc/html/boost_asio/reference/basic_raw_socket/at_mark/overload1.html index c9283afac9..d26a53c2eb 100644 --- a/doc/html/boost_asio/reference/basic_raw_socket/at_mark/overload1.html +++ b/doc/html/boost_asio/reference/basic_raw_socket/at_mark/overload1.html @@ -63,7 +63,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_raw_socket/at_mark/overload2.html b/doc/html/boost_asio/reference/basic_raw_socket/at_mark/overload2.html index 49d92d4e25..cf14c0c225 100644 --- a/doc/html/boost_asio/reference/basic_raw_socket/at_mark/overload2.html +++ b/doc/html/boost_asio/reference/basic_raw_socket/at_mark/overload2.html @@ -64,7 +64,7 @@
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_raw_socket/available.html b/doc/html/boost_asio/reference/basic_raw_socket/available.html index 57e6c697fa..3e1c75776f 100644 --- a/doc/html/boost_asio/reference/basic_raw_socket/available.html +++ b/doc/html/boost_asio/reference/basic_raw_socket/available.html @@ -41,7 +41,7 @@ std::size_t
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_raw_socket/available/overload1.html b/doc/html/boost_asio/reference/basic_raw_socket/available/overload1.html index 85903c8932..5b9e78a79a 100644 --- a/doc/html/boost_asio/reference/basic_raw_socket/available/overload1.html +++ b/doc/html/boost_asio/reference/basic_raw_socket/available/overload1.html @@ -64,7 +64,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_raw_socket/available/overload2.html b/doc/html/boost_asio/reference/basic_raw_socket/available/overload2.html index aca39c4c4e..1327a25679 100644 --- a/doc/html/boost_asio/reference/basic_raw_socket/available/overload2.html +++ b/doc/html/boost_asio/reference/basic_raw_socket/available/overload2.html @@ -65,7 +65,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_raw_socket/basic_raw_socket.html b/doc/html/boost_asio/reference/basic_raw_socket/basic_raw_socket.html index fd69283248..7dccb50583 100644 --- a/doc/html/boost_asio/reference/basic_raw_socket/basic_raw_socket.html +++ b/doc/html/boost_asio/reference/basic_raw_socket/basic_raw_socket.html @@ -85,7 +85,7 @@ Construct
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_raw_socket/basic_raw_socket/overload1.html b/doc/html/boost_asio/reference/basic_raw_socket/basic_raw_socket/overload1.html index d66bad54a4..e37174783b 100644 --- a/doc/html/boost_asio/reference/basic_raw_socket/basic_raw_socket/overload1.html +++ b/doc/html/boost_asio/reference/basic_raw_socket/basic_raw_socket/overload1.html @@ -56,7 +56,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_raw_socket/basic_raw_socket/overload2.html b/doc/html/boost_asio/reference/basic_raw_socket/basic_raw_socket/overload2.html index 862959c32e..f8587a8b62 100644 --- a/doc/html/boost_asio/reference/basic_raw_socket/basic_raw_socket/overload2.html +++ b/doc/html/boost_asio/reference/basic_raw_socket/basic_raw_socket/overload2.html @@ -72,7 +72,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_raw_socket/basic_raw_socket/overload3.html b/doc/html/boost_asio/reference/basic_raw_socket/basic_raw_socket/overload3.html index aad3eefcbb..6271388638 100644 --- a/doc/html/boost_asio/reference/basic_raw_socket/basic_raw_socket/overload3.html +++ b/doc/html/boost_asio/reference/basic_raw_socket/basic_raw_socket/overload3.html @@ -76,7 +76,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_raw_socket/basic_raw_socket/overload4.html b/doc/html/boost_asio/reference/basic_raw_socket/basic_raw_socket/overload4.html index 1ae2d676e0..90712b280c 100644 --- a/doc/html/boost_asio/reference/basic_raw_socket/basic_raw_socket/overload4.html +++ b/doc/html/boost_asio/reference/basic_raw_socket/basic_raw_socket/overload4.html @@ -79,7 +79,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_raw_socket/basic_raw_socket/overload5.html b/doc/html/boost_asio/reference/basic_raw_socket/basic_raw_socket/overload5.html index ccc952c957..a5f0b39e96 100644 --- a/doc/html/boost_asio/reference/basic_raw_socket/basic_raw_socket/overload5.html +++ b/doc/html/boost_asio/reference/basic_raw_socket/basic_raw_socket/overload5.html @@ -62,7 +62,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_raw_socket/basic_raw_socket/overload6.html b/doc/html/boost_asio/reference/basic_raw_socket/basic_raw_socket/overload6.html index 5b6f72eda0..b622e9bd8f 100644 --- a/doc/html/boost_asio/reference/basic_raw_socket/basic_raw_socket/overload6.html +++ b/doc/html/boost_asio/reference/basic_raw_socket/basic_raw_socket/overload6.html @@ -65,7 +65,7 @@ basic_raw_socket(
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_raw_socket/bind.html b/doc/html/boost_asio/reference/basic_raw_socket/bind.html index 99d2e4e5ab..0c4cb90572 100644 --- a/doc/html/boost_asio/reference/basic_raw_socket/bind.html +++ b/doc/html/boost_asio/reference/basic_raw_socket/bind.html @@ -43,7 +43,7 @@ void
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_raw_socket/bind/overload1.html b/doc/html/boost_asio/reference/basic_raw_socket/bind/overload1.html index 83821bde25..9b8d3c0d68 100644 --- a/doc/html/boost_asio/reference/basic_raw_socket/bind/overload1.html +++ b/doc/html/boost_asio/reference/basic_raw_socket/bind/overload1.html @@ -78,7 +78,7 @@ socket.bind(boost::asio::ip::tcp::endpoint(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_raw_socket/bind/overload2.html b/doc/html/boost_asio/reference/basic_raw_socket/bind/overload2.html index 448676e51f..50d9ae4126 100644 --- a/doc/html/boost_asio/reference/basic_raw_socket/bind/overload2.html +++ b/doc/html/boost_asio/reference/basic_raw_socket/bind/overload2.html @@ -75,7 +75,7 @@ if (ec)
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_raw_socket/broadcast.html b/doc/html/boost_asio/reference/basic_raw_socket/broadcast.html index e0088ce5b7..41cce36852 100644 --- a/doc/html/boost_asio/reference/basic_raw_socket/broadcast.html +++ b/doc/html/boost_asio/reference/basic_raw_socket/broadcast.html @@ -73,7 +73,7 @@ bool is_set = option.value();
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_raw_socket/bytes_readable.html b/doc/html/boost_asio/reference/basic_raw_socket/bytes_readable.html index a306c0e8ee..1fb2b535a2 100644 --- a/doc/html/boost_asio/reference/basic_raw_socket/bytes_readable.html +++ b/doc/html/boost_asio/reference/basic_raw_socket/bytes_readable.html @@ -62,7 +62,7 @@ std::size_t bytes_readable = command.get();
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_raw_socket/cancel.html b/doc/html/boost_asio/reference/basic_raw_socket/cancel.html index 449a9cdf9b..b1927ad160 100644 --- a/doc/html/boost_asio/reference/basic_raw_socket/cancel.html +++ b/doc/html/boost_asio/reference/basic_raw_socket/cancel.html @@ -41,7 +41,7 @@ void
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_raw_socket/cancel/overload1.html b/doc/html/boost_asio/reference/basic_raw_socket/cancel/overload1.html index fc010ef7bf..d59d227b0e 100644 --- a/doc/html/boost_asio/reference/basic_raw_socket/cancel/overload1.html +++ b/doc/html/boost_asio/reference/basic_raw_socket/cancel/overload1.html @@ -97,7 +97,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_raw_socket/cancel/overload2.html b/doc/html/boost_asio/reference/basic_raw_socket/cancel/overload2.html index 218552bb64..8a6f627baf 100644 --- a/doc/html/boost_asio/reference/basic_raw_socket/cancel/overload2.html +++ b/doc/html/boost_asio/reference/basic_raw_socket/cancel/overload2.html @@ -98,7 +98,7 @@
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_raw_socket/close.html b/doc/html/boost_asio/reference/basic_raw_socket/close.html index 466d55fc5b..0fb13ef6e8 100644 --- a/doc/html/boost_asio/reference/basic_raw_socket/close.html +++ b/doc/html/boost_asio/reference/basic_raw_socket/close.html @@ -41,7 +41,7 @@ void
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_raw_socket/close/overload1.html b/doc/html/boost_asio/reference/basic_raw_socket/close/overload1.html index 33154ea2c0..1b40c9fb5a 100644 --- a/doc/html/boost_asio/reference/basic_raw_socket/close/overload1.html +++ b/doc/html/boost_asio/reference/basic_raw_socket/close/overload1.html @@ -65,7 +65,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_raw_socket/close/overload2.html b/doc/html/boost_asio/reference/basic_raw_socket/close/overload2.html index 03b3261142..06bf93e1a9 100644 --- a/doc/html/boost_asio/reference/basic_raw_socket/close/overload2.html +++ b/doc/html/boost_asio/reference/basic_raw_socket/close/overload2.html @@ -79,7 +79,7 @@ if (ec)
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_raw_socket/connect.html b/doc/html/boost_asio/reference/basic_raw_socket/connect.html index f6f9f97f6a..6c7e9ba058 100644 --- a/doc/html/boost_asio/reference/basic_raw_socket/connect.html +++ b/doc/html/boost_asio/reference/basic_raw_socket/connect.html @@ -43,7 +43,7 @@ void
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_raw_socket/connect/overload1.html b/doc/html/boost_asio/reference/basic_raw_socket/connect/overload1.html index 12489e921e..50479fd8a3 100644 --- a/doc/html/boost_asio/reference/basic_raw_socket/connect/overload1.html +++ b/doc/html/boost_asio/reference/basic_raw_socket/connect/overload1.html @@ -84,7 +84,7 @@ socket.connect(endpoint);
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_raw_socket/connect/overload2.html b/doc/html/boost_asio/reference/basic_raw_socket/connect/overload2.html index df42255aa3..74d2149077 100644 --- a/doc/html/boost_asio/reference/basic_raw_socket/connect/overload2.html +++ b/doc/html/boost_asio/reference/basic_raw_socket/connect/overload2.html @@ -81,7 +81,7 @@ if (ec)
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_raw_socket/debug.html b/doc/html/boost_asio/reference/basic_raw_socket/debug.html index e970ba58cf..18eef785d6 100644 --- a/doc/html/boost_asio/reference/basic_raw_socket/debug.html +++ b/doc/html/boost_asio/reference/basic_raw_socket/debug.html @@ -73,7 +73,7 @@ bool is_set = option.value();
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_raw_socket/do_not_route.html b/doc/html/boost_asio/reference/basic_raw_socket/do_not_route.html index 5b7806f985..3bca593daa 100644 --- a/doc/html/boost_asio/reference/basic_raw_socket/do_not_route.html +++ b/doc/html/boost_asio/reference/basic_raw_socket/do_not_route.html @@ -73,7 +73,7 @@ bool is_set = option.value();
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_raw_socket/enable_connection_aborted.html b/doc/html/boost_asio/reference/basic_raw_socket/enable_connection_aborted.html index 9de4040d01..bf77615ccf 100644 --- a/doc/html/boost_asio/reference/basic_raw_socket/enable_connection_aborted.html +++ b/doc/html/boost_asio/reference/basic_raw_socket/enable_connection_aborted.html @@ -75,7 +75,7 @@ bool is_set = option.value();
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_raw_socket/endpoint_type.html b/doc/html/boost_asio/reference/basic_raw_socket/endpoint_type.html index 879dc03baa..d7626c2200 100644 --- a/doc/html/boost_asio/reference/basic_raw_socket/endpoint_type.html +++ b/doc/html/boost_asio/reference/basic_raw_socket/endpoint_type.html @@ -46,7 +46,7 @@ The
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_raw_socket/executor_type.html b/doc/html/boost_asio/reference/basic_raw_socket/executor_type.html index 66569e2137..6985bddda4 100644 --- a/doc/html/boost_asio/reference/basic_raw_socket/executor_type.html +++ b/doc/html/boost_asio/reference/basic_raw_socket/executor_type.html @@ -206,7 +206,7 @@ The
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_raw_socket/get_executor.html b/doc/html/boost_asio/reference/basic_raw_socket/get_executor.html index 5114f94c82..73ff391a04 100644 --- a/doc/html/boost_asio/reference/basic_raw_socket/get_executor.html +++ b/doc/html/boost_asio/reference/basic_raw_socket/get_executor.html @@ -39,7 +39,7 @@ Get
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_raw_socket/get_io_context.html b/doc/html/boost_asio/reference/basic_raw_socket/get_io_context.html index 97f9d99361..d866893873 100644 --- a/doc/html/boost_asio/reference/basic_raw_socket/get_io_context.html +++ b/doc/html/boost_asio/reference/basic_raw_socket/get_io_context.html @@ -54,7 +54,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_raw_socket/get_io_service.html b/doc/html/boost_asio/reference/basic_raw_socket/get_io_service.html index e830b5b8d1..58e42b8a68 100644 --- a/doc/html/boost_asio/reference/basic_raw_socket/get_io_service.html +++ b/doc/html/boost_asio/reference/basic_raw_socket/get_io_service.html @@ -54,7 +54,7 @@
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_raw_socket/get_option.html b/doc/html/boost_asio/reference/basic_raw_socket/get_option.html index de2e369621..ec29a9744e 100644 --- a/doc/html/boost_asio/reference/basic_raw_socket/get_option.html +++ b/doc/html/boost_asio/reference/basic_raw_socket/get_option.html @@ -47,7 +47,7 @@ void
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_raw_socket/get_option/overload1.html b/doc/html/boost_asio/reference/basic_raw_socket/get_option/overload1.html index ec9b2c7df8..95bb567916 100644 --- a/doc/html/boost_asio/reference/basic_raw_socket/get_option/overload1.html +++ b/doc/html/boost_asio/reference/basic_raw_socket/get_option/overload1.html @@ -83,7 +83,7 @@ bool is_set = option.value();
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_raw_socket/get_option/overload2.html b/doc/html/boost_asio/reference/basic_raw_socket/get_option/overload2.html index 918db01153..1dded87ed8 100644 --- a/doc/html/boost_asio/reference/basic_raw_socket/get_option/overload2.html +++ b/doc/html/boost_asio/reference/basic_raw_socket/get_option/overload2.html @@ -80,7 +80,7 @@ bool is_set = option.value();
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_raw_socket/io_control.html b/doc/html/boost_asio/reference/basic_raw_socket/io_control.html index 54f562c2b2..d76ed0cadf 100644 --- a/doc/html/boost_asio/reference/basic_raw_socket/io_control.html +++ b/doc/html/boost_asio/reference/basic_raw_socket/io_control.html @@ -47,7 +47,7 @@ void
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_raw_socket/io_control/overload1.html b/doc/html/boost_asio/reference/basic_raw_socket/io_control/overload1.html index 13c9de89f1..b287003ade 100644 --- a/doc/html/boost_asio/reference/basic_raw_socket/io_control/overload1.html +++ b/doc/html/boost_asio/reference/basic_raw_socket/io_control/overload1.html @@ -83,7 +83,7 @@ std::size_t bytes_readable = command.get();
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_raw_socket/io_control/overload2.html b/doc/html/boost_asio/reference/basic_raw_socket/io_control/overload2.html index b17ca771ea..7e9128cab7 100644 --- a/doc/html/boost_asio/reference/basic_raw_socket/io_control/overload2.html +++ b/doc/html/boost_asio/reference/basic_raw_socket/io_control/overload2.html @@ -80,7 +80,7 @@ std::size_t bytes_readable = command.get();
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_raw_socket/is_open.html b/doc/html/boost_asio/reference/basic_raw_socket/is_open.html index 7f8bc89c57..f5b20673cf 100644 --- a/doc/html/boost_asio/reference/basic_raw_socket/is_open.html +++ b/doc/html/boost_asio/reference/basic_raw_socket/is_open.html @@ -39,7 +39,7 @@ Determine
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_raw_socket/keep_alive.html b/doc/html/boost_asio/reference/basic_raw_socket/keep_alive.html index ee2b0d648b..7b1c954633 100644 --- a/doc/html/boost_asio/reference/basic_raw_socket/keep_alive.html +++ b/doc/html/boost_asio/reference/basic_raw_socket/keep_alive.html @@ -73,7 +73,7 @@ bool is_set = option.value();
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_raw_socket/linger.html b/doc/html/boost_asio/reference/basic_raw_socket/linger.html index cce67721f4..cced2db414 100644 --- a/doc/html/boost_asio/reference/basic_raw_socket/linger.html +++ b/doc/html/boost_asio/reference/basic_raw_socket/linger.html @@ -75,7 +75,7 @@ unsigned short timeout = option.timeout();
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_raw_socket/local_endpoint.html b/doc/html/boost_asio/reference/basic_raw_socket/local_endpoint.html index 804a966926..7db5055352 100644 --- a/doc/html/boost_asio/reference/basic_raw_socket/local_endpoint.html +++ b/doc/html/boost_asio/reference/basic_raw_socket/local_endpoint.html @@ -41,7 +41,7 @@ endpoint_type
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_raw_socket/local_endpoint/overload1.html b/doc/html/boost_asio/reference/basic_raw_socket/local_endpoint/overload1.html index aea52f8e83..1f1b695d73 100644 --- a/doc/html/boost_asio/reference/basic_raw_socket/local_endpoint/overload1.html +++ b/doc/html/boost_asio/reference/basic_raw_socket/local_endpoint/overload1.html @@ -70,7 +70,7 @@ boost::asio::ip::tcp::endpoint endpoint = socket.local_endpoint();
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_raw_socket/local_endpoint/overload2.html b/doc/html/boost_asio/reference/basic_raw_socket/local_endpoint/overload2.html index 2cacfca200..905c9ada83 100644 --- a/doc/html/boost_asio/reference/basic_raw_socket/local_endpoint/overload2.html +++ b/doc/html/boost_asio/reference/basic_raw_socket/local_endpoint/overload2.html @@ -77,7 +77,7 @@ if (ec)
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_raw_socket/lowest_layer.html b/doc/html/boost_asio/reference/basic_raw_socket/lowest_layer.html index a7a166b1b2..6aa6be401c 100644 --- a/doc/html/boost_asio/reference/basic_raw_socket/lowest_layer.html +++ b/doc/html/boost_asio/reference/basic_raw_socket/lowest_layer.html @@ -43,7 +43,7 @@ Get
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_raw_socket/lowest_layer/overload1.html b/doc/html/boost_asio/reference/basic_raw_socket/lowest_layer/overload1.html index 5a21347f75..40843eac8d 100644 --- a/doc/html/boost_asio/reference/basic_raw_socket/lowest_layer/overload1.html +++ b/doc/html/boost_asio/reference/basic_raw_socket/lowest_layer/overload1.html @@ -52,7 +52,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_raw_socket/lowest_layer/overload2.html b/doc/html/boost_asio/reference/basic_raw_socket/lowest_layer/overload2.html index d9ed7c84dd..da29b9d3b3 100644 --- a/doc/html/boost_asio/reference/basic_raw_socket/lowest_layer/overload2.html +++ b/doc/html/boost_asio/reference/basic_raw_socket/lowest_layer/overload2.html @@ -52,7 +52,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_raw_socket/lowest_layer_type.html b/doc/html/boost_asio/reference/basic_raw_socket/lowest_layer_type.html index 6f19ff5a2f..c9fae8db3a 100644 --- a/doc/html/boost_asio/reference/basic_raw_socket/lowest_layer_type.html +++ b/doc/html/boost_asio/reference/basic_raw_socket/lowest_layer_type.html @@ -874,7 +874,7 @@ A
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_raw_socket/max_connections.html b/doc/html/boost_asio/reference/basic_raw_socket/max_connections.html index c293f2c519..1b134a81ce 100644 --- a/doc/html/boost_asio/reference/basic_raw_socket/max_connections.html +++ b/doc/html/boost_asio/reference/basic_raw_socket/max_connections.html @@ -40,7 +40,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_raw_socket/max_listen_connections.html b/doc/html/boost_asio/reference/basic_raw_socket/max_listen_connections.html index 10dee5da52..2fffdc3049 100644 --- a/doc/html/boost_asio/reference/basic_raw_socket/max_listen_connections.html +++ b/doc/html/boost_asio/reference/basic_raw_socket/max_listen_connections.html @@ -39,7 +39,7 @@ The
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_raw_socket/message_do_not_route.html b/doc/html/boost_asio/reference/basic_raw_socket/message_do_not_route.html index 6f48342b19..31c8adc109 100644 --- a/doc/html/boost_asio/reference/basic_raw_socket/message_do_not_route.html +++ b/doc/html/boost_asio/reference/basic_raw_socket/message_do_not_route.html @@ -39,7 +39,7 @@ Specify
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_raw_socket/message_end_of_record.html b/doc/html/boost_asio/reference/basic_raw_socket/message_end_of_record.html index 2b0fd8f37a..05c113e144 100644 --- a/doc/html/boost_asio/reference/basic_raw_socket/message_end_of_record.html +++ b/doc/html/boost_asio/reference/basic_raw_socket/message_end_of_record.html @@ -39,7 +39,7 @@ Specifies
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_raw_socket/message_flags.html b/doc/html/boost_asio/reference/basic_raw_socket/message_flags.html index 357b128c0d..ac29aa9060 100644 --- a/doc/html/boost_asio/reference/basic_raw_socket/message_flags.html +++ b/doc/html/boost_asio/reference/basic_raw_socket/message_flags.html @@ -49,7 +49,7 @@ Bitmask
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_raw_socket/message_out_of_band.html b/doc/html/boost_asio/reference/basic_raw_socket/message_out_of_band.html index 3743fc3413..31dc01cd4a 100644 --- a/doc/html/boost_asio/reference/basic_raw_socket/message_out_of_band.html +++ b/doc/html/boost_asio/reference/basic_raw_socket/message_out_of_band.html @@ -39,7 +39,7 @@ Process
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_raw_socket/message_peek.html b/doc/html/boost_asio/reference/basic_raw_socket/message_peek.html index a23d768f42..b6a2e62300 100644 --- a/doc/html/boost_asio/reference/basic_raw_socket/message_peek.html +++ b/doc/html/boost_asio/reference/basic_raw_socket/message_peek.html @@ -39,7 +39,7 @@ Peek
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_raw_socket/native_handle.html b/doc/html/boost_asio/reference/basic_raw_socket/native_handle.html index 3907b6387b..efb6d8daaa 100644 --- a/doc/html/boost_asio/reference/basic_raw_socket/native_handle.html +++ b/doc/html/boost_asio/reference/basic_raw_socket/native_handle.html @@ -44,7 +44,7 @@ Get
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_raw_socket/native_handle_type.html b/doc/html/boost_asio/reference/basic_raw_socket/native_handle_type.html index 15dec03176..8b91943ae0 100644 --- a/doc/html/boost_asio/reference/basic_raw_socket/native_handle_type.html +++ b/doc/html/boost_asio/reference/basic_raw_socket/native_handle_type.html @@ -46,7 +46,7 @@ The
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_raw_socket/native_non_blocking.html b/doc/html/boost_asio/reference/basic_raw_socket/native_non_blocking.html index 11882bb5fd..427e2bbff8 100644 --- a/doc/html/boost_asio/reference/basic_raw_socket/native_non_blocking.html +++ b/doc/html/boost_asio/reference/basic_raw_socket/native_non_blocking.html @@ -49,7 +49,7 @@ void
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_raw_socket/native_non_blocking/overload1.html b/doc/html/boost_asio/reference/basic_raw_socket/native_non_blocking/overload1.html index d1c3af5359..c2164c80e9 100644 --- a/doc/html/boost_asio/reference/basic_raw_socket/native_non_blocking/overload1.html +++ b/doc/html/boost_asio/reference/basic_raw_socket/native_non_blocking/overload1.html @@ -137,7 +137,7 @@ void async_sendfile(tcp::socket& sock, int fd, Handler h)
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_raw_socket/native_non_blocking/overload2.html b/doc/html/boost_asio/reference/basic_raw_socket/native_non_blocking/overload2.html index e6b0df87c4..867d39ca44 100644 --- a/doc/html/boost_asio/reference/basic_raw_socket/native_non_blocking/overload2.html +++ b/doc/html/boost_asio/reference/basic_raw_socket/native_non_blocking/overload2.html @@ -150,7 +150,7 @@ void async_sendfile(tcp::socket& sock, int fd, Handler h)
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_raw_socket/native_non_blocking/overload3.html b/doc/html/boost_asio/reference/basic_raw_socket/native_non_blocking/overload3.html index 84a6d4312c..0fdb6f43bb 100644 --- a/doc/html/boost_asio/reference/basic_raw_socket/native_non_blocking/overload3.html +++ b/doc/html/boost_asio/reference/basic_raw_socket/native_non_blocking/overload3.html @@ -142,7 +142,7 @@ void async_sendfile(tcp::socket& sock, int fd, Handler h)
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_raw_socket/non_blocking.html b/doc/html/boost_asio/reference/basic_raw_socket/non_blocking.html index 73d4cc8f3f..e3105bf7c3 100644 --- a/doc/html/boost_asio/reference/basic_raw_socket/non_blocking.html +++ b/doc/html/boost_asio/reference/basic_raw_socket/non_blocking.html @@ -49,7 +49,7 @@ void
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_raw_socket/non_blocking/overload1.html b/doc/html/boost_asio/reference/basic_raw_socket/non_blocking/overload1.html index 201203f5f7..5f8cb032b4 100644 --- a/doc/html/boost_asio/reference/basic_raw_socket/non_blocking/overload1.html +++ b/doc/html/boost_asio/reference/basic_raw_socket/non_blocking/overload1.html @@ -57,7 +57,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_raw_socket/non_blocking/overload2.html b/doc/html/boost_asio/reference/basic_raw_socket/non_blocking/overload2.html index d4365fd32b..55649118e1 100644 --- a/doc/html/boost_asio/reference/basic_raw_socket/non_blocking/overload2.html +++ b/doc/html/boost_asio/reference/basic_raw_socket/non_blocking/overload2.html @@ -76,7 +76,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_raw_socket/non_blocking/overload3.html b/doc/html/boost_asio/reference/basic_raw_socket/non_blocking/overload3.html index ae1607018a..ec8d8ccc27 100644 --- a/doc/html/boost_asio/reference/basic_raw_socket/non_blocking/overload3.html +++ b/doc/html/boost_asio/reference/basic_raw_socket/non_blocking/overload3.html @@ -68,7 +68,7 @@
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_raw_socket/open.html b/doc/html/boost_asio/reference/basic_raw_socket/open.html index 323694e2eb..d769b4ca80 100644 --- a/doc/html/boost_asio/reference/basic_raw_socket/open.html +++ b/doc/html/boost_asio/reference/basic_raw_socket/open.html @@ -43,7 +43,7 @@ void
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_raw_socket/open/overload1.html b/doc/html/boost_asio/reference/basic_raw_socket/open/overload1.html index 397704001e..1e555d5828 100644 --- a/doc/html/boost_asio/reference/basic_raw_socket/open/overload1.html +++ b/doc/html/boost_asio/reference/basic_raw_socket/open/overload1.html @@ -75,7 +75,7 @@ socket.open(boost::asio::ip::tcp::v4());
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_raw_socket/open/overload2.html b/doc/html/boost_asio/reference/basic_raw_socket/open/overload2.html index d25e1c0c0c..375b0172b1 100644 --- a/doc/html/boost_asio/reference/basic_raw_socket/open/overload2.html +++ b/doc/html/boost_asio/reference/basic_raw_socket/open/overload2.html @@ -72,7 +72,7 @@ if (ec)
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_raw_socket/operator_eq_.html b/doc/html/boost_asio/reference/basic_raw_socket/operator_eq_.html index 34dccefe02..b9347e7df6 100644 --- a/doc/html/boost_asio/reference/basic_raw_socket/operator_eq_.html +++ b/doc/html/boost_asio/reference/basic_raw_socket/operator_eq_.html @@ -49,7 +49,7 @@ enable_if< is_convertible< Protocol1, Protocol >::value, basic_raw_sock
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_raw_socket/operator_eq_/overload1.html b/doc/html/boost_asio/reference/basic_raw_socket/operator_eq_/overload1.html index 003cd87449..99bb89ec22 100644 --- a/doc/html/boost_asio/reference/basic_raw_socket/operator_eq_/overload1.html +++ b/doc/html/boost_asio/reference/basic_raw_socket/operator_eq_/overload1.html @@ -62,7 +62,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_raw_socket/operator_eq_/overload2.html b/doc/html/boost_asio/reference/basic_raw_socket/operator_eq_/overload2.html index 2ecf0854e6..748263afaa 100644 --- a/doc/html/boost_asio/reference/basic_raw_socket/operator_eq_/overload2.html +++ b/doc/html/boost_asio/reference/basic_raw_socket/operator_eq_/overload2.html @@ -64,7 +64,7 @@ enable_if< is_convertible< Protocol1, Protocol >::value, basic_raw_sock
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_raw_socket/out_of_band_inline.html b/doc/html/boost_asio/reference/basic_raw_socket/out_of_band_inline.html index 9a33e6a19b..74c52b567c 100644 --- a/doc/html/boost_asio/reference/basic_raw_socket/out_of_band_inline.html +++ b/doc/html/boost_asio/reference/basic_raw_socket/out_of_band_inline.html @@ -73,7 +73,7 @@ bool value = option.value();
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_raw_socket/protocol_type.html b/doc/html/boost_asio/reference/basic_raw_socket/protocol_type.html index c78e4274a2..5d9cd078c6 100644 --- a/doc/html/boost_asio/reference/basic_raw_socket/protocol_type.html +++ b/doc/html/boost_asio/reference/basic_raw_socket/protocol_type.html @@ -46,7 +46,7 @@ The
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_raw_socket/receive.html b/doc/html/boost_asio/reference/basic_raw_socket/receive.html index 49767b8dc5..2ecb3adca3 100644 --- a/doc/html/boost_asio/reference/basic_raw_socket/receive.html +++ b/doc/html/boost_asio/reference/basic_raw_socket/receive.html @@ -55,7 +55,7 @@ std::size_t
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_raw_socket/receive/overload1.html b/doc/html/boost_asio/reference/basic_raw_socket/receive/overload1.html index 665b7632c5..a92393afea 100644 --- a/doc/html/boost_asio/reference/basic_raw_socket/receive/overload1.html +++ b/doc/html/boost_asio/reference/basic_raw_socket/receive/overload1.html @@ -100,7 +100,7 @@ std::size_t receive(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_raw_socket/receive/overload2.html b/doc/html/boost_asio/reference/basic_raw_socket/receive/overload2.html index 5d6a2ab0c4..4f92bddde0 100644 --- a/doc/html/boost_asio/reference/basic_raw_socket/receive/overload2.html +++ b/doc/html/boost_asio/reference/basic_raw_socket/receive/overload2.html @@ -90,7 +90,7 @@ std::size_t receive(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_raw_socket/receive/overload3.html b/doc/html/boost_asio/reference/basic_raw_socket/receive/overload3.html index 1d2fbc46ce..cec616a08a 100644 --- a/doc/html/boost_asio/reference/basic_raw_socket/receive/overload3.html +++ b/doc/html/boost_asio/reference/basic_raw_socket/receive/overload3.html @@ -82,7 +82,7 @@ std::size_t receive(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_raw_socket/receive_buffer_size.html b/doc/html/boost_asio/reference/basic_raw_socket/receive_buffer_size.html index c4d24ec98d..b809bb6a98 100644 --- a/doc/html/boost_asio/reference/basic_raw_socket/receive_buffer_size.html +++ b/doc/html/boost_asio/reference/basic_raw_socket/receive_buffer_size.html @@ -73,7 +73,7 @@ int size = option.value();
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_raw_socket/receive_from.html b/doc/html/boost_asio/reference/basic_raw_socket/receive_from.html index b0c08b38a6..7af4a24cc9 100644 --- a/doc/html/boost_asio/reference/basic_raw_socket/receive_from.html +++ b/doc/html/boost_asio/reference/basic_raw_socket/receive_from.html @@ -58,7 +58,7 @@ std::size_t
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_raw_socket/receive_from/overload1.html b/doc/html/boost_asio/reference/basic_raw_socket/receive_from/overload1.html index d5c42afe69..c211bc4c56 100644 --- a/doc/html/boost_asio/reference/basic_raw_socket/receive_from/overload1.html +++ b/doc/html/boost_asio/reference/basic_raw_socket/receive_from/overload1.html @@ -99,7 +99,7 @@ socket.receive_from(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_raw_socket/receive_from/overload2.html b/doc/html/boost_asio/reference/basic_raw_socket/receive_from/overload2.html index 53da88c1ec..895b1e41b1 100644 --- a/doc/html/boost_asio/reference/basic_raw_socket/receive_from/overload2.html +++ b/doc/html/boost_asio/reference/basic_raw_socket/receive_from/overload2.html @@ -87,7 +87,7 @@ std::size_t receive_from(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_raw_socket/receive_from/overload3.html b/doc/html/boost_asio/reference/basic_raw_socket/receive_from/overload3.html index de1f83dbba..2cebcb6c17 100644 --- a/doc/html/boost_asio/reference/basic_raw_socket/receive_from/overload3.html +++ b/doc/html/boost_asio/reference/basic_raw_socket/receive_from/overload3.html @@ -79,7 +79,7 @@ std::size_t receive_from(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_raw_socket/receive_low_watermark.html b/doc/html/boost_asio/reference/basic_raw_socket/receive_low_watermark.html index 4f77475934..f8762e5b53 100644 --- a/doc/html/boost_asio/reference/basic_raw_socket/receive_low_watermark.html +++ b/doc/html/boost_asio/reference/basic_raw_socket/receive_low_watermark.html @@ -73,7 +73,7 @@ int size = option.value();
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_raw_socket/release.html b/doc/html/boost_asio/reference/basic_raw_socket/release.html index 5d86c04523..19717e5712 100644 --- a/doc/html/boost_asio/reference/basic_raw_socket/release.html +++ b/doc/html/boost_asio/reference/basic_raw_socket/release.html @@ -41,7 +41,7 @@ native_handle_type
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_raw_socket/release/overload1.html b/doc/html/boost_asio/reference/basic_raw_socket/release/overload1.html index fccee67f04..817798fe55 100644 --- a/doc/html/boost_asio/reference/basic_raw_socket/release/overload1.html +++ b/doc/html/boost_asio/reference/basic_raw_socket/release/overload1.html @@ -66,7 +66,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_raw_socket/release/overload2.html b/doc/html/boost_asio/reference/basic_raw_socket/release/overload2.html index 5e56e63054..47be25b762 100644 --- a/doc/html/boost_asio/reference/basic_raw_socket/release/overload2.html +++ b/doc/html/boost_asio/reference/basic_raw_socket/release/overload2.html @@ -67,7 +67,7 @@
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_raw_socket/remote_endpoint.html b/doc/html/boost_asio/reference/basic_raw_socket/remote_endpoint.html index 1e3795a3d0..19e5fe8dc4 100644 --- a/doc/html/boost_asio/reference/basic_raw_socket/remote_endpoint.html +++ b/doc/html/boost_asio/reference/basic_raw_socket/remote_endpoint.html @@ -41,7 +41,7 @@ endpoint_type
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_raw_socket/remote_endpoint/overload1.html b/doc/html/boost_asio/reference/basic_raw_socket/remote_endpoint/overload1.html index 6d81a90a36..1290709a1a 100644 --- a/doc/html/boost_asio/reference/basic_raw_socket/remote_endpoint/overload1.html +++ b/doc/html/boost_asio/reference/basic_raw_socket/remote_endpoint/overload1.html @@ -70,7 +70,7 @@ boost::asio::ip::tcp::endpoint endpoint = socket.remote_endpoint();
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_raw_socket/remote_endpoint/overload2.html b/doc/html/boost_asio/reference/basic_raw_socket/remote_endpoint/overload2.html index f297bd1c01..5da93e5beb 100644 --- a/doc/html/boost_asio/reference/basic_raw_socket/remote_endpoint/overload2.html +++ b/doc/html/boost_asio/reference/basic_raw_socket/remote_endpoint/overload2.html @@ -77,7 +77,7 @@ if (ec)
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_raw_socket/reuse_address.html b/doc/html/boost_asio/reference/basic_raw_socket/reuse_address.html index 78d96cd593..a3b7c030f9 100644 --- a/doc/html/boost_asio/reference/basic_raw_socket/reuse_address.html +++ b/doc/html/boost_asio/reference/basic_raw_socket/reuse_address.html @@ -74,7 +74,7 @@ bool is_set = option.value();
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_raw_socket/send.html b/doc/html/boost_asio/reference/basic_raw_socket/send.html index 4057ebd788..8cc76ff398 100644 --- a/doc/html/boost_asio/reference/basic_raw_socket/send.html +++ b/doc/html/boost_asio/reference/basic_raw_socket/send.html @@ -55,7 +55,7 @@ std::size_t
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_raw_socket/send/overload1.html b/doc/html/boost_asio/reference/basic_raw_socket/send/overload1.html index 250ceba609..ec5af86329 100644 --- a/doc/html/boost_asio/reference/basic_raw_socket/send/overload1.html +++ b/doc/html/boost_asio/reference/basic_raw_socket/send/overload1.html @@ -99,7 +99,7 @@ std::size_t send(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_raw_socket/send/overload2.html b/doc/html/boost_asio/reference/basic_raw_socket/send/overload2.html index 684daedd41..7ef5449235 100644 --- a/doc/html/boost_asio/reference/basic_raw_socket/send/overload2.html +++ b/doc/html/boost_asio/reference/basic_raw_socket/send/overload2.html @@ -89,7 +89,7 @@ std::size_t send(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_raw_socket/send/overload3.html b/doc/html/boost_asio/reference/basic_raw_socket/send/overload3.html index 4f4892f0e2..c3a79473f4 100644 --- a/doc/html/boost_asio/reference/basic_raw_socket/send/overload3.html +++ b/doc/html/boost_asio/reference/basic_raw_socket/send/overload3.html @@ -81,7 +81,7 @@ std::size_t send(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_raw_socket/send_buffer_size.html b/doc/html/boost_asio/reference/basic_raw_socket/send_buffer_size.html index 4e9af75593..ec23c3041e 100644 --- a/doc/html/boost_asio/reference/basic_raw_socket/send_buffer_size.html +++ b/doc/html/boost_asio/reference/basic_raw_socket/send_buffer_size.html @@ -73,7 +73,7 @@ int size = option.value();
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_raw_socket/send_low_watermark.html b/doc/html/boost_asio/reference/basic_raw_socket/send_low_watermark.html index 529cee31b4..b9d8175b54 100644 --- a/doc/html/boost_asio/reference/basic_raw_socket/send_low_watermark.html +++ b/doc/html/boost_asio/reference/basic_raw_socket/send_low_watermark.html @@ -73,7 +73,7 @@ int size = option.value();
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_raw_socket/send_to.html b/doc/html/boost_asio/reference/basic_raw_socket/send_to.html index ba00df7947..3857acc54c 100644 --- a/doc/html/boost_asio/reference/basic_raw_socket/send_to.html +++ b/doc/html/boost_asio/reference/basic_raw_socket/send_to.html @@ -58,7 +58,7 @@ std::size_t
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_raw_socket/send_to/overload1.html b/doc/html/boost_asio/reference/basic_raw_socket/send_to/overload1.html index e5f7da04bb..30ce42edad 100644 --- a/doc/html/boost_asio/reference/basic_raw_socket/send_to/overload1.html +++ b/doc/html/boost_asio/reference/basic_raw_socket/send_to/overload1.html @@ -99,7 +99,7 @@ socket.send_to(boost::asio::buffer(data, size), destination);
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_raw_socket/send_to/overload2.html b/doc/html/boost_asio/reference/basic_raw_socket/send_to/overload2.html index 09afe45ab4..abee3c7ea3 100644 --- a/doc/html/boost_asio/reference/basic_raw_socket/send_to/overload2.html +++ b/doc/html/boost_asio/reference/basic_raw_socket/send_to/overload2.html @@ -87,7 +87,7 @@ std::size_t send_to(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_raw_socket/send_to/overload3.html b/doc/html/boost_asio/reference/basic_raw_socket/send_to/overload3.html index 2cbc57a5d7..6d5417582f 100644 --- a/doc/html/boost_asio/reference/basic_raw_socket/send_to/overload3.html +++ b/doc/html/boost_asio/reference/basic_raw_socket/send_to/overload3.html @@ -79,7 +79,7 @@ std::size_t send_to(
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_raw_socket/set_option.html b/doc/html/boost_asio/reference/basic_raw_socket/set_option.html index 9276db24bf..6bd3910193 100644 --- a/doc/html/boost_asio/reference/basic_raw_socket/set_option.html +++ b/doc/html/boost_asio/reference/basic_raw_socket/set_option.html @@ -47,7 +47,7 @@ void
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_raw_socket/set_option/overload1.html b/doc/html/boost_asio/reference/basic_raw_socket/set_option/overload1.html index 9a1bc4fe84..34ff16e420 100644 --- a/doc/html/boost_asio/reference/basic_raw_socket/set_option/overload1.html +++ b/doc/html/boost_asio/reference/basic_raw_socket/set_option/overload1.html @@ -82,7 +82,7 @@ socket.set_option(option);
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_raw_socket/set_option/overload2.html b/doc/html/boost_asio/reference/basic_raw_socket/set_option/overload2.html index 16b2792772..e1034d1ed7 100644 --- a/doc/html/boost_asio/reference/basic_raw_socket/set_option/overload2.html +++ b/doc/html/boost_asio/reference/basic_raw_socket/set_option/overload2.html @@ -79,7 +79,7 @@ if (ec)
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_raw_socket/shutdown.html b/doc/html/boost_asio/reference/basic_raw_socket/shutdown.html index 2c1fb4fa87..8cd0035c0d 100644 --- a/doc/html/boost_asio/reference/basic_raw_socket/shutdown.html +++ b/doc/html/boost_asio/reference/basic_raw_socket/shutdown.html @@ -43,7 +43,7 @@ void
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_raw_socket/shutdown/overload1.html b/doc/html/boost_asio/reference/basic_raw_socket/shutdown/overload1.html index 350d44302f..936ba8b6f2 100644 --- a/doc/html/boost_asio/reference/basic_raw_socket/shutdown/overload1.html +++ b/doc/html/boost_asio/reference/basic_raw_socket/shutdown/overload1.html @@ -80,7 +80,7 @@ socket.shutdown(boost::asio::ip::tcp::socket::shutdown_send);
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_raw_socket/shutdown/overload2.html b/doc/html/boost_asio/reference/basic_raw_socket/shutdown/overload2.html index f0151171d9..652f78844c 100644 --- a/doc/html/boost_asio/reference/basic_raw_socket/shutdown/overload2.html +++ b/doc/html/boost_asio/reference/basic_raw_socket/shutdown/overload2.html @@ -77,7 +77,7 @@ if (ec)
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_raw_socket/shutdown_type.html b/doc/html/boost_asio/reference/basic_raw_socket/shutdown_type.html index 3b3df56739..dfca136917 100644 --- a/doc/html/boost_asio/reference/basic_raw_socket/shutdown_type.html +++ b/doc/html/boost_asio/reference/basic_raw_socket/shutdown_type.html @@ -65,7 +65,7 @@ Different
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_raw_socket/wait.html b/doc/html/boost_asio/reference/basic_raw_socket/wait.html index 963b4b9ce3..4887f0c236 100644 --- a/doc/html/boost_asio/reference/basic_raw_socket/wait.html +++ b/doc/html/boost_asio/reference/basic_raw_socket/wait.html @@ -44,7 +44,7 @@ void
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_raw_socket/wait/overload1.html b/doc/html/boost_asio/reference/basic_raw_socket/wait/overload1.html index 772a90bf9d..15f88d4787 100644 --- a/doc/html/boost_asio/reference/basic_raw_socket/wait/overload1.html +++ b/doc/html/boost_asio/reference/basic_raw_socket/wait/overload1.html @@ -68,7 +68,7 @@ socket.wait(boost::asio::ip::tcp::socket::wait_read);
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_raw_socket/wait/overload2.html b/doc/html/boost_asio/reference/basic_raw_socket/wait/overload2.html index 14e77c7b1b..4b61cfa7aa 100644 --- a/doc/html/boost_asio/reference/basic_raw_socket/wait/overload2.html +++ b/doc/html/boost_asio/reference/basic_raw_socket/wait/overload2.html @@ -74,7 +74,7 @@ socket.wait(boost::asio::ip::tcp::socket::wait_read, ec);
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_raw_socket/wait_type.html b/doc/html/boost_asio/reference/basic_raw_socket/wait_type.html index 3ba2ff38ba..8b2caa26f4 100644 --- a/doc/html/boost_asio/reference/basic_raw_socket/wait_type.html +++ b/doc/html/boost_asio/reference/basic_raw_socket/wait_type.html @@ -68,7 +68,7 @@ Wait
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_seq_packet_socket.html b/doc/html/boost_asio/reference/basic_seq_packet_socket.html index 04745ead47..9f0698bf69 100644 --- a/doc/html/boost_asio/reference/basic_seq_packet_socket.html +++ b/doc/html/boost_asio/reference/basic_seq_packet_socket.html @@ -898,7 +898,7 @@ class basic_seq_packet_socket :
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_seq_packet_socket/_basic_seq_packet_socket.html b/doc/html/boost_asio/reference/basic_seq_packet_socket/_basic_seq_packet_socket.html index 3a65b2bb60..95d09c1f4f 100644 --- a/doc/html/boost_asio/reference/basic_seq_packet_socket/_basic_seq_packet_socket.html +++ b/doc/html/boost_asio/reference/basic_seq_packet_socket/_basic_seq_packet_socket.html @@ -40,7 +40,7 @@ Destroys
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_seq_packet_socket/assign.html b/doc/html/boost_asio/reference/basic_seq_packet_socket/assign.html index e652ac0995..f58da68c52 100644 --- a/doc/html/boost_asio/reference/basic_seq_packet_socket/assign.html +++ b/doc/html/boost_asio/reference/basic_seq_packet_socket/assign.html @@ -45,7 +45,7 @@ void
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_seq_packet_socket/assign/overload1.html b/doc/html/boost_asio/reference/basic_seq_packet_socket/assign/overload1.html index 2f5a850abe..886d594364 100644 --- a/doc/html/boost_asio/reference/basic_seq_packet_socket/assign/overload1.html +++ b/doc/html/boost_asio/reference/basic_seq_packet_socket/assign/overload1.html @@ -40,7 +40,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_seq_packet_socket/assign/overload2.html b/doc/html/boost_asio/reference/basic_seq_packet_socket/assign/overload2.html index 5f59513cf9..fd5d921313 100644 --- a/doc/html/boost_asio/reference/basic_seq_packet_socket/assign/overload2.html +++ b/doc/html/boost_asio/reference/basic_seq_packet_socket/assign/overload2.html @@ -41,7 +41,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_seq_packet_socket/async_connect.html b/doc/html/boost_asio/reference/basic_seq_packet_socket/async_connect.html index 509219d772..1e9de2a488 100644 --- a/doc/html/boost_asio/reference/basic_seq_packet_socket/async_connect.html +++ b/doc/html/boost_asio/reference/basic_seq_packet_socket/async_connect.html @@ -103,7 +103,7 @@ socket.async_connect(endpoint, connect_handler);
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_seq_packet_socket/async_receive.html b/doc/html/boost_asio/reference/basic_seq_packet_socket/async_receive.html index 7a9bafdb96..233a43df75 100644 --- a/doc/html/boost_asio/reference/basic_seq_packet_socket/async_receive.html +++ b/doc/html/boost_asio/reference/basic_seq_packet_socket/async_receive.html @@ -53,7 +53,7 @@ template<
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_seq_packet_socket/async_receive/overload1.html b/doc/html/boost_asio/reference/basic_seq_packet_socket/async_receive/overload1.html index eca2979788..6caed185e3 100644 --- a/doc/html/boost_asio/reference/basic_seq_packet_socket/async_receive/overload1.html +++ b/doc/html/boost_asio/reference/basic_seq_packet_socket/async_receive/overload1.html @@ -103,7 +103,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_seq_packet_socket/async_receive/overload2.html b/doc/html/boost_asio/reference/basic_seq_packet_socket/async_receive/overload2.html index fdf42f0673..9ad10c56d6 100644 --- a/doc/html/boost_asio/reference/basic_seq_packet_socket/async_receive/overload2.html +++ b/doc/html/boost_asio/reference/basic_seq_packet_socket/async_receive/overload2.html @@ -110,7 +110,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_seq_packet_socket/async_send.html b/doc/html/boost_asio/reference/basic_seq_packet_socket/async_send.html index 420ffb75a4..7a3091bf56 100644 --- a/doc/html/boost_asio/reference/basic_seq_packet_socket/async_send.html +++ b/doc/html/boost_asio/reference/basic_seq_packet_socket/async_send.html @@ -100,7 +100,7 @@ Start
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_seq_packet_socket/async_wait.html b/doc/html/boost_asio/reference/basic_seq_packet_socket/async_wait.html index 131868b52a..d441509a4c 100644 --- a/doc/html/boost_asio/reference/basic_seq_packet_socket/async_wait.html +++ b/doc/html/boost_asio/reference/basic_seq_packet_socket/async_wait.html @@ -97,7 +97,7 @@ socket.async_wait(boost::asio::ip::tcp::socket::wait_read, wait_handler);
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_seq_packet_socket/at_mark.html b/doc/html/boost_asio/reference/basic_seq_packet_socket/at_mark.html index 4c37b2f1c3..24b8fbd33c 100644 --- a/doc/html/boost_asio/reference/basic_seq_packet_socket/at_mark.html +++ b/doc/html/boost_asio/reference/basic_seq_packet_socket/at_mark.html @@ -41,7 +41,7 @@ bool
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_seq_packet_socket/at_mark/overload1.html b/doc/html/boost_asio/reference/basic_seq_packet_socket/at_mark/overload1.html index cdc51996a1..f9b69db771 100644 --- a/doc/html/boost_asio/reference/basic_seq_packet_socket/at_mark/overload1.html +++ b/doc/html/boost_asio/reference/basic_seq_packet_socket/at_mark/overload1.html @@ -63,7 +63,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_seq_packet_socket/at_mark/overload2.html b/doc/html/boost_asio/reference/basic_seq_packet_socket/at_mark/overload2.html index f82f5a4c1c..2b9a66c420 100644 --- a/doc/html/boost_asio/reference/basic_seq_packet_socket/at_mark/overload2.html +++ b/doc/html/boost_asio/reference/basic_seq_packet_socket/at_mark/overload2.html @@ -64,7 +64,7 @@
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_seq_packet_socket/available.html b/doc/html/boost_asio/reference/basic_seq_packet_socket/available.html index e64f286cc4..66516827fc 100644 --- a/doc/html/boost_asio/reference/basic_seq_packet_socket/available.html +++ b/doc/html/boost_asio/reference/basic_seq_packet_socket/available.html @@ -41,7 +41,7 @@ std::size_t
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_seq_packet_socket/available/overload1.html b/doc/html/boost_asio/reference/basic_seq_packet_socket/available/overload1.html index 60e33090f5..798c99ae63 100644 --- a/doc/html/boost_asio/reference/basic_seq_packet_socket/available/overload1.html +++ b/doc/html/boost_asio/reference/basic_seq_packet_socket/available/overload1.html @@ -64,7 +64,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_seq_packet_socket/available/overload2.html b/doc/html/boost_asio/reference/basic_seq_packet_socket/available/overload2.html index 6ad373b9d4..8691f634db 100644 --- a/doc/html/boost_asio/reference/basic_seq_packet_socket/available/overload2.html +++ b/doc/html/boost_asio/reference/basic_seq_packet_socket/available/overload2.html @@ -65,7 +65,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_seq_packet_socket/basic_seq_packet_socket.html b/doc/html/boost_asio/reference/basic_seq_packet_socket/basic_seq_packet_socket.html index a5140ab117..51738a07a6 100644 --- a/doc/html/boost_asio/reference/basic_seq_packet_socket/basic_seq_packet_socket.html +++ b/doc/html/boost_asio/reference/basic_seq_packet_socket/basic_seq_packet_socket.html @@ -85,7 +85,7 @@ Construct
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_seq_packet_socket/basic_seq_packet_socket/overload1.html b/doc/html/boost_asio/reference/basic_seq_packet_socket/basic_seq_packet_socket/overload1.html index 4582438d00..d5bca63dc6 100644 --- a/doc/html/boost_asio/reference/basic_seq_packet_socket/basic_seq_packet_socket/overload1.html +++ b/doc/html/boost_asio/reference/basic_seq_packet_socket/basic_seq_packet_socket/overload1.html @@ -57,7 +57,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_seq_packet_socket/basic_seq_packet_socket/overload2.html b/doc/html/boost_asio/reference/basic_seq_packet_socket/basic_seq_packet_socket/overload2.html index 794233c165..90865de6e3 100644 --- a/doc/html/boost_asio/reference/basic_seq_packet_socket/basic_seq_packet_socket/overload2.html +++ b/doc/html/boost_asio/reference/basic_seq_packet_socket/basic_seq_packet_socket/overload2.html @@ -74,7 +74,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_seq_packet_socket/basic_seq_packet_socket/overload3.html b/doc/html/boost_asio/reference/basic_seq_packet_socket/basic_seq_packet_socket/overload3.html index 8b7544bc70..9bdf1680c1 100644 --- a/doc/html/boost_asio/reference/basic_seq_packet_socket/basic_seq_packet_socket/overload3.html +++ b/doc/html/boost_asio/reference/basic_seq_packet_socket/basic_seq_packet_socket/overload3.html @@ -76,7 +76,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_seq_packet_socket/basic_seq_packet_socket/overload4.html b/doc/html/boost_asio/reference/basic_seq_packet_socket/basic_seq_packet_socket/overload4.html index f88d9ab4b3..fdb5f523ec 100644 --- a/doc/html/boost_asio/reference/basic_seq_packet_socket/basic_seq_packet_socket/overload4.html +++ b/doc/html/boost_asio/reference/basic_seq_packet_socket/basic_seq_packet_socket/overload4.html @@ -79,7 +79,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_seq_packet_socket/basic_seq_packet_socket/overload5.html b/doc/html/boost_asio/reference/basic_seq_packet_socket/basic_seq_packet_socket/overload5.html index e7717dacec..f5b1418f67 100644 --- a/doc/html/boost_asio/reference/basic_seq_packet_socket/basic_seq_packet_socket/overload5.html +++ b/doc/html/boost_asio/reference/basic_seq_packet_socket/basic_seq_packet_socket/overload5.html @@ -63,7 +63,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_seq_packet_socket/basic_seq_packet_socket/overload6.html b/doc/html/boost_asio/reference/basic_seq_packet_socket/basic_seq_packet_socket/overload6.html index c7e2e2ba27..1fb0a4e1d7 100644 --- a/doc/html/boost_asio/reference/basic_seq_packet_socket/basic_seq_packet_socket/overload6.html +++ b/doc/html/boost_asio/reference/basic_seq_packet_socket/basic_seq_packet_socket/overload6.html @@ -66,7 +66,7 @@ basic_seq_packet_socket(
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_seq_packet_socket/bind.html b/doc/html/boost_asio/reference/basic_seq_packet_socket/bind.html index 9950680a0e..e299fb9421 100644 --- a/doc/html/boost_asio/reference/basic_seq_packet_socket/bind.html +++ b/doc/html/boost_asio/reference/basic_seq_packet_socket/bind.html @@ -43,7 +43,7 @@ void
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_seq_packet_socket/bind/overload1.html b/doc/html/boost_asio/reference/basic_seq_packet_socket/bind/overload1.html index 3027691651..a9599694bc 100644 --- a/doc/html/boost_asio/reference/basic_seq_packet_socket/bind/overload1.html +++ b/doc/html/boost_asio/reference/basic_seq_packet_socket/bind/overload1.html @@ -78,7 +78,7 @@ socket.bind(boost::asio::ip::tcp::endpoint(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_seq_packet_socket/bind/overload2.html b/doc/html/boost_asio/reference/basic_seq_packet_socket/bind/overload2.html index b45bae7f57..f8928a319c 100644 --- a/doc/html/boost_asio/reference/basic_seq_packet_socket/bind/overload2.html +++ b/doc/html/boost_asio/reference/basic_seq_packet_socket/bind/overload2.html @@ -75,7 +75,7 @@ if (ec)
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_seq_packet_socket/broadcast.html b/doc/html/boost_asio/reference/basic_seq_packet_socket/broadcast.html index cc8e2a50e8..87dd09b3e6 100644 --- a/doc/html/boost_asio/reference/basic_seq_packet_socket/broadcast.html +++ b/doc/html/boost_asio/reference/basic_seq_packet_socket/broadcast.html @@ -73,7 +73,7 @@ bool is_set = option.value();
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_seq_packet_socket/bytes_readable.html b/doc/html/boost_asio/reference/basic_seq_packet_socket/bytes_readable.html index f792434000..07d1f29957 100644 --- a/doc/html/boost_asio/reference/basic_seq_packet_socket/bytes_readable.html +++ b/doc/html/boost_asio/reference/basic_seq_packet_socket/bytes_readable.html @@ -62,7 +62,7 @@ std::size_t bytes_readable = command.get();
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_seq_packet_socket/cancel.html b/doc/html/boost_asio/reference/basic_seq_packet_socket/cancel.html index e04d42d5d0..2a8e0711b6 100644 --- a/doc/html/boost_asio/reference/basic_seq_packet_socket/cancel.html +++ b/doc/html/boost_asio/reference/basic_seq_packet_socket/cancel.html @@ -41,7 +41,7 @@ void
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_seq_packet_socket/cancel/overload1.html b/doc/html/boost_asio/reference/basic_seq_packet_socket/cancel/overload1.html index cb31ad68c8..f64406bf4b 100644 --- a/doc/html/boost_asio/reference/basic_seq_packet_socket/cancel/overload1.html +++ b/doc/html/boost_asio/reference/basic_seq_packet_socket/cancel/overload1.html @@ -97,7 +97,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_seq_packet_socket/cancel/overload2.html b/doc/html/boost_asio/reference/basic_seq_packet_socket/cancel/overload2.html index 16047f190e..9eda7eb9b5 100644 --- a/doc/html/boost_asio/reference/basic_seq_packet_socket/cancel/overload2.html +++ b/doc/html/boost_asio/reference/basic_seq_packet_socket/cancel/overload2.html @@ -98,7 +98,7 @@
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_seq_packet_socket/close.html b/doc/html/boost_asio/reference/basic_seq_packet_socket/close.html index 8aae19f4c6..103c4abf20 100644 --- a/doc/html/boost_asio/reference/basic_seq_packet_socket/close.html +++ b/doc/html/boost_asio/reference/basic_seq_packet_socket/close.html @@ -41,7 +41,7 @@ void
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_seq_packet_socket/close/overload1.html b/doc/html/boost_asio/reference/basic_seq_packet_socket/close/overload1.html index 46a12ed820..991b44bfc7 100644 --- a/doc/html/boost_asio/reference/basic_seq_packet_socket/close/overload1.html +++ b/doc/html/boost_asio/reference/basic_seq_packet_socket/close/overload1.html @@ -65,7 +65,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_seq_packet_socket/close/overload2.html b/doc/html/boost_asio/reference/basic_seq_packet_socket/close/overload2.html index 2261c7359c..459a9375b5 100644 --- a/doc/html/boost_asio/reference/basic_seq_packet_socket/close/overload2.html +++ b/doc/html/boost_asio/reference/basic_seq_packet_socket/close/overload2.html @@ -79,7 +79,7 @@ if (ec)
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_seq_packet_socket/connect.html b/doc/html/boost_asio/reference/basic_seq_packet_socket/connect.html index a79a435c56..312b1b3711 100644 --- a/doc/html/boost_asio/reference/basic_seq_packet_socket/connect.html +++ b/doc/html/boost_asio/reference/basic_seq_packet_socket/connect.html @@ -43,7 +43,7 @@ void
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_seq_packet_socket/connect/overload1.html b/doc/html/boost_asio/reference/basic_seq_packet_socket/connect/overload1.html index 6f2e955b87..bd2e797e5d 100644 --- a/doc/html/boost_asio/reference/basic_seq_packet_socket/connect/overload1.html +++ b/doc/html/boost_asio/reference/basic_seq_packet_socket/connect/overload1.html @@ -84,7 +84,7 @@ socket.connect(endpoint);
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_seq_packet_socket/connect/overload2.html b/doc/html/boost_asio/reference/basic_seq_packet_socket/connect/overload2.html index d3ecceefae..4704fe60d8 100644 --- a/doc/html/boost_asio/reference/basic_seq_packet_socket/connect/overload2.html +++ b/doc/html/boost_asio/reference/basic_seq_packet_socket/connect/overload2.html @@ -81,7 +81,7 @@ if (ec)
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_seq_packet_socket/debug.html b/doc/html/boost_asio/reference/basic_seq_packet_socket/debug.html index c0722fc9af..70558164fd 100644 --- a/doc/html/boost_asio/reference/basic_seq_packet_socket/debug.html +++ b/doc/html/boost_asio/reference/basic_seq_packet_socket/debug.html @@ -73,7 +73,7 @@ bool is_set = option.value();
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_seq_packet_socket/do_not_route.html b/doc/html/boost_asio/reference/basic_seq_packet_socket/do_not_route.html index 98d60f9f70..e3361d1c11 100644 --- a/doc/html/boost_asio/reference/basic_seq_packet_socket/do_not_route.html +++ b/doc/html/boost_asio/reference/basic_seq_packet_socket/do_not_route.html @@ -73,7 +73,7 @@ bool is_set = option.value();
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_seq_packet_socket/enable_connection_aborted.html b/doc/html/boost_asio/reference/basic_seq_packet_socket/enable_connection_aborted.html index 72bbc8fbc3..c836abcf7d 100644 --- a/doc/html/boost_asio/reference/basic_seq_packet_socket/enable_connection_aborted.html +++ b/doc/html/boost_asio/reference/basic_seq_packet_socket/enable_connection_aborted.html @@ -75,7 +75,7 @@ bool is_set = option.value();
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_seq_packet_socket/endpoint_type.html b/doc/html/boost_asio/reference/basic_seq_packet_socket/endpoint_type.html index 0b29f564b7..14f68f667c 100644 --- a/doc/html/boost_asio/reference/basic_seq_packet_socket/endpoint_type.html +++ b/doc/html/boost_asio/reference/basic_seq_packet_socket/endpoint_type.html @@ -46,7 +46,7 @@ The
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_seq_packet_socket/executor_type.html b/doc/html/boost_asio/reference/basic_seq_packet_socket/executor_type.html index 43d31415af..9a21c60684 100644 --- a/doc/html/boost_asio/reference/basic_seq_packet_socket/executor_type.html +++ b/doc/html/boost_asio/reference/basic_seq_packet_socket/executor_type.html @@ -206,7 +206,7 @@ The
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_seq_packet_socket/get_executor.html b/doc/html/boost_asio/reference/basic_seq_packet_socket/get_executor.html index 694ca25995..4f73fb3feb 100644 --- a/doc/html/boost_asio/reference/basic_seq_packet_socket/get_executor.html +++ b/doc/html/boost_asio/reference/basic_seq_packet_socket/get_executor.html @@ -39,7 +39,7 @@ Get
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_seq_packet_socket/get_io_context.html b/doc/html/boost_asio/reference/basic_seq_packet_socket/get_io_context.html index fa107e8ea5..357768b396 100644 --- a/doc/html/boost_asio/reference/basic_seq_packet_socket/get_io_context.html +++ b/doc/html/boost_asio/reference/basic_seq_packet_socket/get_io_context.html @@ -54,7 +54,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_seq_packet_socket/get_io_service.html b/doc/html/boost_asio/reference/basic_seq_packet_socket/get_io_service.html index ba8cb08f13..99e2a5fdea 100644 --- a/doc/html/boost_asio/reference/basic_seq_packet_socket/get_io_service.html +++ b/doc/html/boost_asio/reference/basic_seq_packet_socket/get_io_service.html @@ -54,7 +54,7 @@
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_seq_packet_socket/get_option.html b/doc/html/boost_asio/reference/basic_seq_packet_socket/get_option.html index 1e76534166..e4ab7ab925 100644 --- a/doc/html/boost_asio/reference/basic_seq_packet_socket/get_option.html +++ b/doc/html/boost_asio/reference/basic_seq_packet_socket/get_option.html @@ -47,7 +47,7 @@ void
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_seq_packet_socket/get_option/overload1.html b/doc/html/boost_asio/reference/basic_seq_packet_socket/get_option/overload1.html index 5a1f502ca8..55e31b3cb1 100644 --- a/doc/html/boost_asio/reference/basic_seq_packet_socket/get_option/overload1.html +++ b/doc/html/boost_asio/reference/basic_seq_packet_socket/get_option/overload1.html @@ -83,7 +83,7 @@ bool is_set = option.value();
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_seq_packet_socket/get_option/overload2.html b/doc/html/boost_asio/reference/basic_seq_packet_socket/get_option/overload2.html index aafeb58d1e..1a82d8943b 100644 --- a/doc/html/boost_asio/reference/basic_seq_packet_socket/get_option/overload2.html +++ b/doc/html/boost_asio/reference/basic_seq_packet_socket/get_option/overload2.html @@ -80,7 +80,7 @@ bool is_set = option.value();
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_seq_packet_socket/io_control.html b/doc/html/boost_asio/reference/basic_seq_packet_socket/io_control.html index 863f87a42e..94b72bdab3 100644 --- a/doc/html/boost_asio/reference/basic_seq_packet_socket/io_control.html +++ b/doc/html/boost_asio/reference/basic_seq_packet_socket/io_control.html @@ -47,7 +47,7 @@ void
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_seq_packet_socket/io_control/overload1.html b/doc/html/boost_asio/reference/basic_seq_packet_socket/io_control/overload1.html index 66bb228916..474154678a 100644 --- a/doc/html/boost_asio/reference/basic_seq_packet_socket/io_control/overload1.html +++ b/doc/html/boost_asio/reference/basic_seq_packet_socket/io_control/overload1.html @@ -83,7 +83,7 @@ std::size_t bytes_readable = command.get();
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_seq_packet_socket/io_control/overload2.html b/doc/html/boost_asio/reference/basic_seq_packet_socket/io_control/overload2.html index f1102d1097..d631e31cb4 100644 --- a/doc/html/boost_asio/reference/basic_seq_packet_socket/io_control/overload2.html +++ b/doc/html/boost_asio/reference/basic_seq_packet_socket/io_control/overload2.html @@ -80,7 +80,7 @@ std::size_t bytes_readable = command.get();
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_seq_packet_socket/is_open.html b/doc/html/boost_asio/reference/basic_seq_packet_socket/is_open.html index c29651d039..1f34942b16 100644 --- a/doc/html/boost_asio/reference/basic_seq_packet_socket/is_open.html +++ b/doc/html/boost_asio/reference/basic_seq_packet_socket/is_open.html @@ -39,7 +39,7 @@ Determine
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_seq_packet_socket/keep_alive.html b/doc/html/boost_asio/reference/basic_seq_packet_socket/keep_alive.html index 01895a17af..3fff0222e7 100644 --- a/doc/html/boost_asio/reference/basic_seq_packet_socket/keep_alive.html +++ b/doc/html/boost_asio/reference/basic_seq_packet_socket/keep_alive.html @@ -73,7 +73,7 @@ bool is_set = option.value();
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_seq_packet_socket/linger.html b/doc/html/boost_asio/reference/basic_seq_packet_socket/linger.html index 0b384114a3..2e4de175c5 100644 --- a/doc/html/boost_asio/reference/basic_seq_packet_socket/linger.html +++ b/doc/html/boost_asio/reference/basic_seq_packet_socket/linger.html @@ -75,7 +75,7 @@ unsigned short timeout = option.timeout();
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_seq_packet_socket/local_endpoint.html b/doc/html/boost_asio/reference/basic_seq_packet_socket/local_endpoint.html index 39954d86b5..73e636ed31 100644 --- a/doc/html/boost_asio/reference/basic_seq_packet_socket/local_endpoint.html +++ b/doc/html/boost_asio/reference/basic_seq_packet_socket/local_endpoint.html @@ -41,7 +41,7 @@ endpoint_type
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_seq_packet_socket/local_endpoint/overload1.html b/doc/html/boost_asio/reference/basic_seq_packet_socket/local_endpoint/overload1.html index 4cff9ef513..77dacf588f 100644 --- a/doc/html/boost_asio/reference/basic_seq_packet_socket/local_endpoint/overload1.html +++ b/doc/html/boost_asio/reference/basic_seq_packet_socket/local_endpoint/overload1.html @@ -70,7 +70,7 @@ boost::asio::ip::tcp::endpoint endpoint = socket.local_endpoint();
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_seq_packet_socket/local_endpoint/overload2.html b/doc/html/boost_asio/reference/basic_seq_packet_socket/local_endpoint/overload2.html index a11343a24d..cd0eae0585 100644 --- a/doc/html/boost_asio/reference/basic_seq_packet_socket/local_endpoint/overload2.html +++ b/doc/html/boost_asio/reference/basic_seq_packet_socket/local_endpoint/overload2.html @@ -77,7 +77,7 @@ if (ec)
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_seq_packet_socket/lowest_layer.html b/doc/html/boost_asio/reference/basic_seq_packet_socket/lowest_layer.html index d043d36c13..a87f565f64 100644 --- a/doc/html/boost_asio/reference/basic_seq_packet_socket/lowest_layer.html +++ b/doc/html/boost_asio/reference/basic_seq_packet_socket/lowest_layer.html @@ -43,7 +43,7 @@ Get
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_seq_packet_socket/lowest_layer/overload1.html b/doc/html/boost_asio/reference/basic_seq_packet_socket/lowest_layer/overload1.html index 9ba469588d..e5221788c3 100644 --- a/doc/html/boost_asio/reference/basic_seq_packet_socket/lowest_layer/overload1.html +++ b/doc/html/boost_asio/reference/basic_seq_packet_socket/lowest_layer/overload1.html @@ -52,7 +52,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_seq_packet_socket/lowest_layer/overload2.html b/doc/html/boost_asio/reference/basic_seq_packet_socket/lowest_layer/overload2.html index 38d5eed629..75466db414 100644 --- a/doc/html/boost_asio/reference/basic_seq_packet_socket/lowest_layer/overload2.html +++ b/doc/html/boost_asio/reference/basic_seq_packet_socket/lowest_layer/overload2.html @@ -52,7 +52,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_seq_packet_socket/lowest_layer_type.html b/doc/html/boost_asio/reference/basic_seq_packet_socket/lowest_layer_type.html index 9afce42353..4ad5a0d4a5 100644 --- a/doc/html/boost_asio/reference/basic_seq_packet_socket/lowest_layer_type.html +++ b/doc/html/boost_asio/reference/basic_seq_packet_socket/lowest_layer_type.html @@ -874,7 +874,7 @@ A
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_seq_packet_socket/max_connections.html b/doc/html/boost_asio/reference/basic_seq_packet_socket/max_connections.html index ebb587b609..85f3a85f0d 100644 --- a/doc/html/boost_asio/reference/basic_seq_packet_socket/max_connections.html +++ b/doc/html/boost_asio/reference/basic_seq_packet_socket/max_connections.html @@ -40,7 +40,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_seq_packet_socket/max_listen_connections.html b/doc/html/boost_asio/reference/basic_seq_packet_socket/max_listen_connections.html index 31c16ae8ef..f3e2284d6a 100644 --- a/doc/html/boost_asio/reference/basic_seq_packet_socket/max_listen_connections.html +++ b/doc/html/boost_asio/reference/basic_seq_packet_socket/max_listen_connections.html @@ -39,7 +39,7 @@ The
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_seq_packet_socket/message_do_not_route.html b/doc/html/boost_asio/reference/basic_seq_packet_socket/message_do_not_route.html index bd899e752d..b146aa6dcb 100644 --- a/doc/html/boost_asio/reference/basic_seq_packet_socket/message_do_not_route.html +++ b/doc/html/boost_asio/reference/basic_seq_packet_socket/message_do_not_route.html @@ -39,7 +39,7 @@ Specify
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_seq_packet_socket/message_end_of_record.html b/doc/html/boost_asio/reference/basic_seq_packet_socket/message_end_of_record.html index 0454ac7ac2..c48001f91e 100644 --- a/doc/html/boost_asio/reference/basic_seq_packet_socket/message_end_of_record.html +++ b/doc/html/boost_asio/reference/basic_seq_packet_socket/message_end_of_record.html @@ -39,7 +39,7 @@ Specifies
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_seq_packet_socket/message_flags.html b/doc/html/boost_asio/reference/basic_seq_packet_socket/message_flags.html index 7208547268..c5d2a97442 100644 --- a/doc/html/boost_asio/reference/basic_seq_packet_socket/message_flags.html +++ b/doc/html/boost_asio/reference/basic_seq_packet_socket/message_flags.html @@ -49,7 +49,7 @@ Bitmask
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_seq_packet_socket/message_out_of_band.html b/doc/html/boost_asio/reference/basic_seq_packet_socket/message_out_of_band.html index 1718e20f7a..dfec0a8980 100644 --- a/doc/html/boost_asio/reference/basic_seq_packet_socket/message_out_of_band.html +++ b/doc/html/boost_asio/reference/basic_seq_packet_socket/message_out_of_band.html @@ -39,7 +39,7 @@ Process
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_seq_packet_socket/message_peek.html b/doc/html/boost_asio/reference/basic_seq_packet_socket/message_peek.html index 5b1ee926a8..a35429c5e2 100644 --- a/doc/html/boost_asio/reference/basic_seq_packet_socket/message_peek.html +++ b/doc/html/boost_asio/reference/basic_seq_packet_socket/message_peek.html @@ -39,7 +39,7 @@ Peek
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_seq_packet_socket/native_handle.html b/doc/html/boost_asio/reference/basic_seq_packet_socket/native_handle.html index 99425a8086..49383e049c 100644 --- a/doc/html/boost_asio/reference/basic_seq_packet_socket/native_handle.html +++ b/doc/html/boost_asio/reference/basic_seq_packet_socket/native_handle.html @@ -44,7 +44,7 @@ Get
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_seq_packet_socket/native_handle_type.html b/doc/html/boost_asio/reference/basic_seq_packet_socket/native_handle_type.html index bac546c34a..54ecc42c32 100644 --- a/doc/html/boost_asio/reference/basic_seq_packet_socket/native_handle_type.html +++ b/doc/html/boost_asio/reference/basic_seq_packet_socket/native_handle_type.html @@ -46,7 +46,7 @@ The
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_seq_packet_socket/native_non_blocking.html b/doc/html/boost_asio/reference/basic_seq_packet_socket/native_non_blocking.html index 5fb399eb0c..7b3382022c 100644 --- a/doc/html/boost_asio/reference/basic_seq_packet_socket/native_non_blocking.html +++ b/doc/html/boost_asio/reference/basic_seq_packet_socket/native_non_blocking.html @@ -49,7 +49,7 @@ void
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_seq_packet_socket/native_non_blocking/overload1.html b/doc/html/boost_asio/reference/basic_seq_packet_socket/native_non_blocking/overload1.html index fd17ff2e2f..371360f055 100644 --- a/doc/html/boost_asio/reference/basic_seq_packet_socket/native_non_blocking/overload1.html +++ b/doc/html/boost_asio/reference/basic_seq_packet_socket/native_non_blocking/overload1.html @@ -137,7 +137,7 @@ void async_sendfile(tcp::socket& sock, int fd, Handler h)
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_seq_packet_socket/native_non_blocking/overload2.html b/doc/html/boost_asio/reference/basic_seq_packet_socket/native_non_blocking/overload2.html index 2f87816b2b..8a741b47b8 100644 --- a/doc/html/boost_asio/reference/basic_seq_packet_socket/native_non_blocking/overload2.html +++ b/doc/html/boost_asio/reference/basic_seq_packet_socket/native_non_blocking/overload2.html @@ -150,7 +150,7 @@ void async_sendfile(tcp::socket& sock, int fd, Handler h)
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_seq_packet_socket/native_non_blocking/overload3.html b/doc/html/boost_asio/reference/basic_seq_packet_socket/native_non_blocking/overload3.html index b6a4dfd28c..f635b6a93e 100644 --- a/doc/html/boost_asio/reference/basic_seq_packet_socket/native_non_blocking/overload3.html +++ b/doc/html/boost_asio/reference/basic_seq_packet_socket/native_non_blocking/overload3.html @@ -142,7 +142,7 @@ void async_sendfile(tcp::socket& sock, int fd, Handler h)
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_seq_packet_socket/non_blocking.html b/doc/html/boost_asio/reference/basic_seq_packet_socket/non_blocking.html index 85710a0eb2..4868dbadc6 100644 --- a/doc/html/boost_asio/reference/basic_seq_packet_socket/non_blocking.html +++ b/doc/html/boost_asio/reference/basic_seq_packet_socket/non_blocking.html @@ -49,7 +49,7 @@ void
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_seq_packet_socket/non_blocking/overload1.html b/doc/html/boost_asio/reference/basic_seq_packet_socket/non_blocking/overload1.html index 201833f747..f7b6800f8f 100644 --- a/doc/html/boost_asio/reference/basic_seq_packet_socket/non_blocking/overload1.html +++ b/doc/html/boost_asio/reference/basic_seq_packet_socket/non_blocking/overload1.html @@ -57,7 +57,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_seq_packet_socket/non_blocking/overload2.html b/doc/html/boost_asio/reference/basic_seq_packet_socket/non_blocking/overload2.html index 5d1f2aa857..3b43c76237 100644 --- a/doc/html/boost_asio/reference/basic_seq_packet_socket/non_blocking/overload2.html +++ b/doc/html/boost_asio/reference/basic_seq_packet_socket/non_blocking/overload2.html @@ -76,7 +76,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_seq_packet_socket/non_blocking/overload3.html b/doc/html/boost_asio/reference/basic_seq_packet_socket/non_blocking/overload3.html index f696eb4122..4f791c02ce 100644 --- a/doc/html/boost_asio/reference/basic_seq_packet_socket/non_blocking/overload3.html +++ b/doc/html/boost_asio/reference/basic_seq_packet_socket/non_blocking/overload3.html @@ -68,7 +68,7 @@
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_seq_packet_socket/open.html b/doc/html/boost_asio/reference/basic_seq_packet_socket/open.html index a66530bbe4..31a9890991 100644 --- a/doc/html/boost_asio/reference/basic_seq_packet_socket/open.html +++ b/doc/html/boost_asio/reference/basic_seq_packet_socket/open.html @@ -43,7 +43,7 @@ void
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_seq_packet_socket/open/overload1.html b/doc/html/boost_asio/reference/basic_seq_packet_socket/open/overload1.html index a404d183c9..9f4f8e9a8b 100644 --- a/doc/html/boost_asio/reference/basic_seq_packet_socket/open/overload1.html +++ b/doc/html/boost_asio/reference/basic_seq_packet_socket/open/overload1.html @@ -75,7 +75,7 @@ socket.open(boost::asio::ip::tcp::v4());
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_seq_packet_socket/open/overload2.html b/doc/html/boost_asio/reference/basic_seq_packet_socket/open/overload2.html index fbb0c8a9a1..1432a8996c 100644 --- a/doc/html/boost_asio/reference/basic_seq_packet_socket/open/overload2.html +++ b/doc/html/boost_asio/reference/basic_seq_packet_socket/open/overload2.html @@ -72,7 +72,7 @@ if (ec)
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_seq_packet_socket/operator_eq_.html b/doc/html/boost_asio/reference/basic_seq_packet_socket/operator_eq_.html index b660747388..6578da3ef6 100644 --- a/doc/html/boost_asio/reference/basic_seq_packet_socket/operator_eq_.html +++ b/doc/html/boost_asio/reference/basic_seq_packet_socket/operator_eq_.html @@ -49,7 +49,7 @@ enable_if< is_convertible< Protocol1, Protocol >::value, basic_seq_pack
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_seq_packet_socket/operator_eq_/overload1.html b/doc/html/boost_asio/reference/basic_seq_packet_socket/operator_eq_/overload1.html index d8dc72a610..413cda84f5 100644 --- a/doc/html/boost_asio/reference/basic_seq_packet_socket/operator_eq_/overload1.html +++ b/doc/html/boost_asio/reference/basic_seq_packet_socket/operator_eq_/overload1.html @@ -64,7 +64,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_seq_packet_socket/operator_eq_/overload2.html b/doc/html/boost_asio/reference/basic_seq_packet_socket/operator_eq_/overload2.html index 0e6e7c7e9e..0597154c65 100644 --- a/doc/html/boost_asio/reference/basic_seq_packet_socket/operator_eq_/overload2.html +++ b/doc/html/boost_asio/reference/basic_seq_packet_socket/operator_eq_/overload2.html @@ -66,7 +66,7 @@ enable_if< is_convertible< Protocol1, Protocol >::value, basic_seq_pack
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_seq_packet_socket/out_of_band_inline.html b/doc/html/boost_asio/reference/basic_seq_packet_socket/out_of_band_inline.html index 1c28da792a..a7cd37e79f 100644 --- a/doc/html/boost_asio/reference/basic_seq_packet_socket/out_of_band_inline.html +++ b/doc/html/boost_asio/reference/basic_seq_packet_socket/out_of_band_inline.html @@ -73,7 +73,7 @@ bool value = option.value();
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_seq_packet_socket/protocol_type.html b/doc/html/boost_asio/reference/basic_seq_packet_socket/protocol_type.html index c5305fc624..96026df498 100644 --- a/doc/html/boost_asio/reference/basic_seq_packet_socket/protocol_type.html +++ b/doc/html/boost_asio/reference/basic_seq_packet_socket/protocol_type.html @@ -46,7 +46,7 @@ The
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_seq_packet_socket/receive.html b/doc/html/boost_asio/reference/basic_seq_packet_socket/receive.html index 43132aa93f..e01fe0810a 100644 --- a/doc/html/boost_asio/reference/basic_seq_packet_socket/receive.html +++ b/doc/html/boost_asio/reference/basic_seq_packet_socket/receive.html @@ -61,7 +61,7 @@ std::size_t
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_seq_packet_socket/receive/overload1.html b/doc/html/boost_asio/reference/basic_seq_packet_socket/receive/overload1.html index 37afa7290b..0cbd846f0f 100644 --- a/doc/html/boost_asio/reference/basic_seq_packet_socket/receive/overload1.html +++ b/doc/html/boost_asio/reference/basic_seq_packet_socket/receive/overload1.html @@ -100,7 +100,7 @@ std::size_t receive(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_seq_packet_socket/receive/overload2.html b/doc/html/boost_asio/reference/basic_seq_packet_socket/receive/overload2.html index 8c806ecc9e..4b3e51fdf0 100644 --- a/doc/html/boost_asio/reference/basic_seq_packet_socket/receive/overload2.html +++ b/doc/html/boost_asio/reference/basic_seq_packet_socket/receive/overload2.html @@ -115,7 +115,7 @@ std::size_t receive(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_seq_packet_socket/receive/overload3.html b/doc/html/boost_asio/reference/basic_seq_packet_socket/receive/overload3.html index 4ddfa2c42b..938128920e 100644 --- a/doc/html/boost_asio/reference/basic_seq_packet_socket/receive/overload3.html +++ b/doc/html/boost_asio/reference/basic_seq_packet_socket/receive/overload3.html @@ -91,7 +91,7 @@ std::size_t receive(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_seq_packet_socket/receive_buffer_size.html b/doc/html/boost_asio/reference/basic_seq_packet_socket/receive_buffer_size.html index db550f8d79..4b8297d8cd 100644 --- a/doc/html/boost_asio/reference/basic_seq_packet_socket/receive_buffer_size.html +++ b/doc/html/boost_asio/reference/basic_seq_packet_socket/receive_buffer_size.html @@ -73,7 +73,7 @@ int size = option.value();
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_seq_packet_socket/receive_low_watermark.html b/doc/html/boost_asio/reference/basic_seq_packet_socket/receive_low_watermark.html index d6dca798e2..f3fc42fd9c 100644 --- a/doc/html/boost_asio/reference/basic_seq_packet_socket/receive_low_watermark.html +++ b/doc/html/boost_asio/reference/basic_seq_packet_socket/receive_low_watermark.html @@ -73,7 +73,7 @@ int size = option.value();
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_seq_packet_socket/release.html b/doc/html/boost_asio/reference/basic_seq_packet_socket/release.html index f915c4720e..7db39fe53b 100644 --- a/doc/html/boost_asio/reference/basic_seq_packet_socket/release.html +++ b/doc/html/boost_asio/reference/basic_seq_packet_socket/release.html @@ -41,7 +41,7 @@ native_handle_type
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_seq_packet_socket/release/overload1.html b/doc/html/boost_asio/reference/basic_seq_packet_socket/release/overload1.html index 9b975ae15b..c25dfc3fb3 100644 --- a/doc/html/boost_asio/reference/basic_seq_packet_socket/release/overload1.html +++ b/doc/html/boost_asio/reference/basic_seq_packet_socket/release/overload1.html @@ -66,7 +66,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_seq_packet_socket/release/overload2.html b/doc/html/boost_asio/reference/basic_seq_packet_socket/release/overload2.html index fc45c8cd80..02d1668847 100644 --- a/doc/html/boost_asio/reference/basic_seq_packet_socket/release/overload2.html +++ b/doc/html/boost_asio/reference/basic_seq_packet_socket/release/overload2.html @@ -67,7 +67,7 @@
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_seq_packet_socket/remote_endpoint.html b/doc/html/boost_asio/reference/basic_seq_packet_socket/remote_endpoint.html index aea5731988..d500673c7d 100644 --- a/doc/html/boost_asio/reference/basic_seq_packet_socket/remote_endpoint.html +++ b/doc/html/boost_asio/reference/basic_seq_packet_socket/remote_endpoint.html @@ -41,7 +41,7 @@ endpoint_type
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_seq_packet_socket/remote_endpoint/overload1.html b/doc/html/boost_asio/reference/basic_seq_packet_socket/remote_endpoint/overload1.html index 9a513e417c..2e3993d577 100644 --- a/doc/html/boost_asio/reference/basic_seq_packet_socket/remote_endpoint/overload1.html +++ b/doc/html/boost_asio/reference/basic_seq_packet_socket/remote_endpoint/overload1.html @@ -70,7 +70,7 @@ boost::asio::ip::tcp::endpoint endpoint = socket.remote_endpoint();
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_seq_packet_socket/remote_endpoint/overload2.html b/doc/html/boost_asio/reference/basic_seq_packet_socket/remote_endpoint/overload2.html index 60f44a32a0..a7c4d69abb 100644 --- a/doc/html/boost_asio/reference/basic_seq_packet_socket/remote_endpoint/overload2.html +++ b/doc/html/boost_asio/reference/basic_seq_packet_socket/remote_endpoint/overload2.html @@ -77,7 +77,7 @@ if (ec)
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_seq_packet_socket/reuse_address.html b/doc/html/boost_asio/reference/basic_seq_packet_socket/reuse_address.html index ce4667ffa4..c742378117 100644 --- a/doc/html/boost_asio/reference/basic_seq_packet_socket/reuse_address.html +++ b/doc/html/boost_asio/reference/basic_seq_packet_socket/reuse_address.html @@ -74,7 +74,7 @@ bool is_set = option.value();
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_seq_packet_socket/send.html b/doc/html/boost_asio/reference/basic_seq_packet_socket/send.html index 7144ba254d..89fd205aeb 100644 --- a/doc/html/boost_asio/reference/basic_seq_packet_socket/send.html +++ b/doc/html/boost_asio/reference/basic_seq_packet_socket/send.html @@ -49,7 +49,7 @@ std::size_t
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_seq_packet_socket/send/overload1.html b/doc/html/boost_asio/reference/basic_seq_packet_socket/send/overload1.html index 8a7c44d4c9..f64f9bae55 100644 --- a/doc/html/boost_asio/reference/basic_seq_packet_socket/send/overload1.html +++ b/doc/html/boost_asio/reference/basic_seq_packet_socket/send/overload1.html @@ -97,7 +97,7 @@ std::size_t send(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_seq_packet_socket/send/overload2.html b/doc/html/boost_asio/reference/basic_seq_packet_socket/send/overload2.html index 462fc38d8b..b675ea33ce 100644 --- a/doc/html/boost_asio/reference/basic_seq_packet_socket/send/overload2.html +++ b/doc/html/boost_asio/reference/basic_seq_packet_socket/send/overload2.html @@ -84,7 +84,7 @@ std::size_t send(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_seq_packet_socket/send_buffer_size.html b/doc/html/boost_asio/reference/basic_seq_packet_socket/send_buffer_size.html index 8b233c8dcf..2bdf4060f6 100644 --- a/doc/html/boost_asio/reference/basic_seq_packet_socket/send_buffer_size.html +++ b/doc/html/boost_asio/reference/basic_seq_packet_socket/send_buffer_size.html @@ -73,7 +73,7 @@ int size = option.value();
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_seq_packet_socket/send_low_watermark.html b/doc/html/boost_asio/reference/basic_seq_packet_socket/send_low_watermark.html index 85c5571522..37a0550597 100644 --- a/doc/html/boost_asio/reference/basic_seq_packet_socket/send_low_watermark.html +++ b/doc/html/boost_asio/reference/basic_seq_packet_socket/send_low_watermark.html @@ -73,7 +73,7 @@ int size = option.value();
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_seq_packet_socket/set_option.html b/doc/html/boost_asio/reference/basic_seq_packet_socket/set_option.html index cc7a0be7d3..ff0af28ef9 100644 --- a/doc/html/boost_asio/reference/basic_seq_packet_socket/set_option.html +++ b/doc/html/boost_asio/reference/basic_seq_packet_socket/set_option.html @@ -47,7 +47,7 @@ void
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_seq_packet_socket/set_option/overload1.html b/doc/html/boost_asio/reference/basic_seq_packet_socket/set_option/overload1.html index e7f8ef4af3..1efaa31f76 100644 --- a/doc/html/boost_asio/reference/basic_seq_packet_socket/set_option/overload1.html +++ b/doc/html/boost_asio/reference/basic_seq_packet_socket/set_option/overload1.html @@ -82,7 +82,7 @@ socket.set_option(option);
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_seq_packet_socket/set_option/overload2.html b/doc/html/boost_asio/reference/basic_seq_packet_socket/set_option/overload2.html index 3729f9ebf6..0c92e5a379 100644 --- a/doc/html/boost_asio/reference/basic_seq_packet_socket/set_option/overload2.html +++ b/doc/html/boost_asio/reference/basic_seq_packet_socket/set_option/overload2.html @@ -79,7 +79,7 @@ if (ec)
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_seq_packet_socket/shutdown.html b/doc/html/boost_asio/reference/basic_seq_packet_socket/shutdown.html index a3682842a6..abfc620abd 100644 --- a/doc/html/boost_asio/reference/basic_seq_packet_socket/shutdown.html +++ b/doc/html/boost_asio/reference/basic_seq_packet_socket/shutdown.html @@ -43,7 +43,7 @@ void
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_seq_packet_socket/shutdown/overload1.html b/doc/html/boost_asio/reference/basic_seq_packet_socket/shutdown/overload1.html index 09566a22e0..b22255f71e 100644 --- a/doc/html/boost_asio/reference/basic_seq_packet_socket/shutdown/overload1.html +++ b/doc/html/boost_asio/reference/basic_seq_packet_socket/shutdown/overload1.html @@ -80,7 +80,7 @@ socket.shutdown(boost::asio::ip::tcp::socket::shutdown_send);
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_seq_packet_socket/shutdown/overload2.html b/doc/html/boost_asio/reference/basic_seq_packet_socket/shutdown/overload2.html index 1fe89ad592..7bb3b61cf6 100644 --- a/doc/html/boost_asio/reference/basic_seq_packet_socket/shutdown/overload2.html +++ b/doc/html/boost_asio/reference/basic_seq_packet_socket/shutdown/overload2.html @@ -77,7 +77,7 @@ if (ec)
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_seq_packet_socket/shutdown_type.html b/doc/html/boost_asio/reference/basic_seq_packet_socket/shutdown_type.html index 439f57653a..f13b1daef4 100644 --- a/doc/html/boost_asio/reference/basic_seq_packet_socket/shutdown_type.html +++ b/doc/html/boost_asio/reference/basic_seq_packet_socket/shutdown_type.html @@ -65,7 +65,7 @@ Different
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_seq_packet_socket/wait.html b/doc/html/boost_asio/reference/basic_seq_packet_socket/wait.html index 021a0f8b25..004246b72d 100644 --- a/doc/html/boost_asio/reference/basic_seq_packet_socket/wait.html +++ b/doc/html/boost_asio/reference/basic_seq_packet_socket/wait.html @@ -44,7 +44,7 @@ void
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_seq_packet_socket/wait/overload1.html b/doc/html/boost_asio/reference/basic_seq_packet_socket/wait/overload1.html index 02831f9f2e..15447adaf8 100644 --- a/doc/html/boost_asio/reference/basic_seq_packet_socket/wait/overload1.html +++ b/doc/html/boost_asio/reference/basic_seq_packet_socket/wait/overload1.html @@ -68,7 +68,7 @@ socket.wait(boost::asio::ip::tcp::socket::wait_read);
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_seq_packet_socket/wait/overload2.html b/doc/html/boost_asio/reference/basic_seq_packet_socket/wait/overload2.html index cf47e38981..49d16ac09f 100644 --- a/doc/html/boost_asio/reference/basic_seq_packet_socket/wait/overload2.html +++ b/doc/html/boost_asio/reference/basic_seq_packet_socket/wait/overload2.html @@ -74,7 +74,7 @@ socket.wait(boost::asio::ip::tcp::socket::wait_read, ec);
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_seq_packet_socket/wait_type.html b/doc/html/boost_asio/reference/basic_seq_packet_socket/wait_type.html index b7d0b66796..9519eaeb80 100644 --- a/doc/html/boost_asio/reference/basic_seq_packet_socket/wait_type.html +++ b/doc/html/boost_asio/reference/basic_seq_packet_socket/wait_type.html @@ -68,7 +68,7 @@ Wait
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket.html b/doc/html/boost_asio/reference/basic_socket.html index ea543a0204..a0db07bd81 100644 --- a/doc/html/boost_asio/reference/basic_socket.html +++ b/doc/html/boost_asio/reference/basic_socket.html @@ -869,7 +869,7 @@ class basic_socket :
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket/_basic_socket.html b/doc/html/boost_asio/reference/basic_socket/_basic_socket.html index 9ba2b2f7c6..bd7e69043b 100644 --- a/doc/html/boost_asio/reference/basic_socket/_basic_socket.html +++ b/doc/html/boost_asio/reference/basic_socket/_basic_socket.html @@ -40,7 +40,7 @@ Protected
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket/assign.html b/doc/html/boost_asio/reference/basic_socket/assign.html index 19a62ef368..8a9f3cae48 100644 --- a/doc/html/boost_asio/reference/basic_socket/assign.html +++ b/doc/html/boost_asio/reference/basic_socket/assign.html @@ -45,7 +45,7 @@ void
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket/assign/overload1.html b/doc/html/boost_asio/reference/basic_socket/assign/overload1.html index 0b8c6ae196..289d77c549 100644 --- a/doc/html/boost_asio/reference/basic_socket/assign/overload1.html +++ b/doc/html/boost_asio/reference/basic_socket/assign/overload1.html @@ -37,7 +37,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket/assign/overload2.html b/doc/html/boost_asio/reference/basic_socket/assign/overload2.html index 12744f7819..6ce23deb16 100644 --- a/doc/html/boost_asio/reference/basic_socket/assign/overload2.html +++ b/doc/html/boost_asio/reference/basic_socket/assign/overload2.html @@ -38,7 +38,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket/async_connect.html b/doc/html/boost_asio/reference/basic_socket/async_connect.html index 9ca7d3689e..74196d3466 100644 --- a/doc/html/boost_asio/reference/basic_socket/async_connect.html +++ b/doc/html/boost_asio/reference/basic_socket/async_connect.html @@ -100,7 +100,7 @@ socket.async_connect(endpoint, connect_handler);
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket/async_wait.html b/doc/html/boost_asio/reference/basic_socket/async_wait.html index 15809e3749..9de831fcc9 100644 --- a/doc/html/boost_asio/reference/basic_socket/async_wait.html +++ b/doc/html/boost_asio/reference/basic_socket/async_wait.html @@ -94,7 +94,7 @@ socket.async_wait(boost::asio::ip::tcp::socket::wait_read, wait_handler);
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket/at_mark.html b/doc/html/boost_asio/reference/basic_socket/at_mark.html index 7eb22a7c56..6731736451 100644 --- a/doc/html/boost_asio/reference/basic_socket/at_mark.html +++ b/doc/html/boost_asio/reference/basic_socket/at_mark.html @@ -41,7 +41,7 @@ bool
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket/at_mark/overload1.html b/doc/html/boost_asio/reference/basic_socket/at_mark/overload1.html index 0e4c5b6139..d8d55384b0 100644 --- a/doc/html/boost_asio/reference/basic_socket/at_mark/overload1.html +++ b/doc/html/boost_asio/reference/basic_socket/at_mark/overload1.html @@ -60,7 +60,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket/at_mark/overload2.html b/doc/html/boost_asio/reference/basic_socket/at_mark/overload2.html index f210f8dfed..2d76c754e9 100644 --- a/doc/html/boost_asio/reference/basic_socket/at_mark/overload2.html +++ b/doc/html/boost_asio/reference/basic_socket/at_mark/overload2.html @@ -61,7 +61,7 @@
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket/available.html b/doc/html/boost_asio/reference/basic_socket/available.html index 9b7ddfb455..65cff7db8b 100644 --- a/doc/html/boost_asio/reference/basic_socket/available.html +++ b/doc/html/boost_asio/reference/basic_socket/available.html @@ -41,7 +41,7 @@ std::size_t
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket/available/overload1.html b/doc/html/boost_asio/reference/basic_socket/available/overload1.html index 0b329b5463..43f2aaa87a 100644 --- a/doc/html/boost_asio/reference/basic_socket/available/overload1.html +++ b/doc/html/boost_asio/reference/basic_socket/available/overload1.html @@ -61,7 +61,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket/available/overload2.html b/doc/html/boost_asio/reference/basic_socket/available/overload2.html index 53cef6301b..4f59d1e3f8 100644 --- a/doc/html/boost_asio/reference/basic_socket/available/overload2.html +++ b/doc/html/boost_asio/reference/basic_socket/available/overload2.html @@ -62,7 +62,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket/basic_socket.html b/doc/html/boost_asio/reference/basic_socket/basic_socket.html index 56d16028c9..7f78b30d09 100644 --- a/doc/html/boost_asio/reference/basic_socket/basic_socket.html +++ b/doc/html/boost_asio/reference/basic_socket/basic_socket.html @@ -85,7 +85,7 @@ Construct
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket/basic_socket/overload1.html b/doc/html/boost_asio/reference/basic_socket/basic_socket/overload1.html index 349719a679..e3ae19a8cc 100644 --- a/doc/html/boost_asio/reference/basic_socket/basic_socket/overload1.html +++ b/doc/html/boost_asio/reference/basic_socket/basic_socket/overload1.html @@ -55,7 +55,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket/basic_socket/overload2.html b/doc/html/boost_asio/reference/basic_socket/basic_socket/overload2.html index b954e63e35..94280036de 100644 --- a/doc/html/boost_asio/reference/basic_socket/basic_socket/overload2.html +++ b/doc/html/boost_asio/reference/basic_socket/basic_socket/overload2.html @@ -72,7 +72,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket/basic_socket/overload3.html b/doc/html/boost_asio/reference/basic_socket/basic_socket/overload3.html index 53f42f6bbf..645c2490a2 100644 --- a/doc/html/boost_asio/reference/basic_socket/basic_socket/overload3.html +++ b/doc/html/boost_asio/reference/basic_socket/basic_socket/overload3.html @@ -75,7 +75,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket/basic_socket/overload4.html b/doc/html/boost_asio/reference/basic_socket/basic_socket/overload4.html index 4046b4a482..87b6400d36 100644 --- a/doc/html/boost_asio/reference/basic_socket/basic_socket/overload4.html +++ b/doc/html/boost_asio/reference/basic_socket/basic_socket/overload4.html @@ -78,7 +78,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket/basic_socket/overload5.html b/doc/html/boost_asio/reference/basic_socket/basic_socket/overload5.html index 565c35a01b..2eeb3b54fe 100644 --- a/doc/html/boost_asio/reference/basic_socket/basic_socket/overload5.html +++ b/doc/html/boost_asio/reference/basic_socket/basic_socket/overload5.html @@ -62,7 +62,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket/basic_socket/overload6.html b/doc/html/boost_asio/reference/basic_socket/basic_socket/overload6.html index 135dd7951d..a39452309d 100644 --- a/doc/html/boost_asio/reference/basic_socket/basic_socket/overload6.html +++ b/doc/html/boost_asio/reference/basic_socket/basic_socket/overload6.html @@ -65,7 +65,7 @@ basic_socket(
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket/bind.html b/doc/html/boost_asio/reference/basic_socket/bind.html index ff8a892ea3..cf6905d5b5 100644 --- a/doc/html/boost_asio/reference/basic_socket/bind.html +++ b/doc/html/boost_asio/reference/basic_socket/bind.html @@ -43,7 +43,7 @@ void
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket/bind/overload1.html b/doc/html/boost_asio/reference/basic_socket/bind/overload1.html index c11146d200..152cc70c14 100644 --- a/doc/html/boost_asio/reference/basic_socket/bind/overload1.html +++ b/doc/html/boost_asio/reference/basic_socket/bind/overload1.html @@ -75,7 +75,7 @@ socket.bind(boost::asio::ip::tcp::endpoint(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket/bind/overload2.html b/doc/html/boost_asio/reference/basic_socket/bind/overload2.html index 90f40c03f6..8ac0cc21d6 100644 --- a/doc/html/boost_asio/reference/basic_socket/bind/overload2.html +++ b/doc/html/boost_asio/reference/basic_socket/bind/overload2.html @@ -72,7 +72,7 @@ if (ec)
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket/broadcast.html b/doc/html/boost_asio/reference/basic_socket/broadcast.html index ddd79ccf2e..58342ef7c3 100644 --- a/doc/html/boost_asio/reference/basic_socket/broadcast.html +++ b/doc/html/boost_asio/reference/basic_socket/broadcast.html @@ -73,7 +73,7 @@ bool is_set = option.value();
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket/bytes_readable.html b/doc/html/boost_asio/reference/basic_socket/bytes_readable.html index 6a61ba6977..86078d502e 100644 --- a/doc/html/boost_asio/reference/basic_socket/bytes_readable.html +++ b/doc/html/boost_asio/reference/basic_socket/bytes_readable.html @@ -62,7 +62,7 @@ std::size_t bytes_readable = command.get();
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket/cancel.html b/doc/html/boost_asio/reference/basic_socket/cancel.html index d3cc55ad63..157fa4601d 100644 --- a/doc/html/boost_asio/reference/basic_socket/cancel.html +++ b/doc/html/boost_asio/reference/basic_socket/cancel.html @@ -41,7 +41,7 @@ void
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket/cancel/overload1.html b/doc/html/boost_asio/reference/basic_socket/cancel/overload1.html index de342d6c6f..55e6e464c1 100644 --- a/doc/html/boost_asio/reference/basic_socket/cancel/overload1.html +++ b/doc/html/boost_asio/reference/basic_socket/cancel/overload1.html @@ -94,7 +94,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket/cancel/overload2.html b/doc/html/boost_asio/reference/basic_socket/cancel/overload2.html index e52a8deb7f..e13ff231f3 100644 --- a/doc/html/boost_asio/reference/basic_socket/cancel/overload2.html +++ b/doc/html/boost_asio/reference/basic_socket/cancel/overload2.html @@ -95,7 +95,7 @@
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket/close.html b/doc/html/boost_asio/reference/basic_socket/close.html index 16ec82554c..8315065cd6 100644 --- a/doc/html/boost_asio/reference/basic_socket/close.html +++ b/doc/html/boost_asio/reference/basic_socket/close.html @@ -40,7 +40,7 @@ void
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket/close/overload1.html b/doc/html/boost_asio/reference/basic_socket/close/overload1.html index 4001992b77..5e229e209c 100644 --- a/doc/html/boost_asio/reference/basic_socket/close/overload1.html +++ b/doc/html/boost_asio/reference/basic_socket/close/overload1.html @@ -62,7 +62,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket/close/overload2.html b/doc/html/boost_asio/reference/basic_socket/close/overload2.html index f152a7ffda..7e3b5d8200 100644 --- a/doc/html/boost_asio/reference/basic_socket/close/overload2.html +++ b/doc/html/boost_asio/reference/basic_socket/close/overload2.html @@ -76,7 +76,7 @@ if (ec)
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket/connect.html b/doc/html/boost_asio/reference/basic_socket/connect.html index 9791ca7f71..196a1f0746 100644 --- a/doc/html/boost_asio/reference/basic_socket/connect.html +++ b/doc/html/boost_asio/reference/basic_socket/connect.html @@ -43,7 +43,7 @@ void
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket/connect/overload1.html b/doc/html/boost_asio/reference/basic_socket/connect/overload1.html index e0b8dc37ca..e8a402196e 100644 --- a/doc/html/boost_asio/reference/basic_socket/connect/overload1.html +++ b/doc/html/boost_asio/reference/basic_socket/connect/overload1.html @@ -81,7 +81,7 @@ socket.connect(endpoint);
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket/connect/overload2.html b/doc/html/boost_asio/reference/basic_socket/connect/overload2.html index b7960bb71e..e8933bb3c9 100644 --- a/doc/html/boost_asio/reference/basic_socket/connect/overload2.html +++ b/doc/html/boost_asio/reference/basic_socket/connect/overload2.html @@ -78,7 +78,7 @@ if (ec)
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket/debug.html b/doc/html/boost_asio/reference/basic_socket/debug.html index 94b84bb286..ce517d75bf 100644 --- a/doc/html/boost_asio/reference/basic_socket/debug.html +++ b/doc/html/boost_asio/reference/basic_socket/debug.html @@ -73,7 +73,7 @@ bool is_set = option.value();
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket/do_not_route.html b/doc/html/boost_asio/reference/basic_socket/do_not_route.html index b01b0b9e9e..cb504a36d8 100644 --- a/doc/html/boost_asio/reference/basic_socket/do_not_route.html +++ b/doc/html/boost_asio/reference/basic_socket/do_not_route.html @@ -73,7 +73,7 @@ bool is_set = option.value();
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket/enable_connection_aborted.html b/doc/html/boost_asio/reference/basic_socket/enable_connection_aborted.html index bb20e2627e..f251374295 100644 --- a/doc/html/boost_asio/reference/basic_socket/enable_connection_aborted.html +++ b/doc/html/boost_asio/reference/basic_socket/enable_connection_aborted.html @@ -75,7 +75,7 @@ bool is_set = option.value();
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket/endpoint_type.html b/doc/html/boost_asio/reference/basic_socket/endpoint_type.html index d37a4cf3da..042e2d77bc 100644 --- a/doc/html/boost_asio/reference/basic_socket/endpoint_type.html +++ b/doc/html/boost_asio/reference/basic_socket/endpoint_type.html @@ -46,7 +46,7 @@ The
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket/executor_type.html b/doc/html/boost_asio/reference/basic_socket/executor_type.html index 08a8ec0689..1819ef72e4 100644 --- a/doc/html/boost_asio/reference/basic_socket/executor_type.html +++ b/doc/html/boost_asio/reference/basic_socket/executor_type.html @@ -203,7 +203,7 @@ The
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket/get_executor.html b/doc/html/boost_asio/reference/basic_socket/get_executor.html index babc4a95d3..7a17205534 100644 --- a/doc/html/boost_asio/reference/basic_socket/get_executor.html +++ b/doc/html/boost_asio/reference/basic_socket/get_executor.html @@ -36,7 +36,7 @@ Get
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket/get_io_context.html b/doc/html/boost_asio/reference/basic_socket/get_io_context.html index 08d37db2aa..698cbe7002 100644 --- a/doc/html/boost_asio/reference/basic_socket/get_io_context.html +++ b/doc/html/boost_asio/reference/basic_socket/get_io_context.html @@ -51,7 +51,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket/get_io_service.html b/doc/html/boost_asio/reference/basic_socket/get_io_service.html index 3bfbaceb43..00e05750e0 100644 --- a/doc/html/boost_asio/reference/basic_socket/get_io_service.html +++ b/doc/html/boost_asio/reference/basic_socket/get_io_service.html @@ -51,7 +51,7 @@
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket/get_option.html b/doc/html/boost_asio/reference/basic_socket/get_option.html index 78543935bc..048fc0173e 100644 --- a/doc/html/boost_asio/reference/basic_socket/get_option.html +++ b/doc/html/boost_asio/reference/basic_socket/get_option.html @@ -47,7 +47,7 @@ void
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket/get_option/overload1.html b/doc/html/boost_asio/reference/basic_socket/get_option/overload1.html index 92bd389931..a708ed7334 100644 --- a/doc/html/boost_asio/reference/basic_socket/get_option/overload1.html +++ b/doc/html/boost_asio/reference/basic_socket/get_option/overload1.html @@ -80,7 +80,7 @@ bool is_set = option.value();
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket/get_option/overload2.html b/doc/html/boost_asio/reference/basic_socket/get_option/overload2.html index 6b4dc120e2..4a163e141f 100644 --- a/doc/html/boost_asio/reference/basic_socket/get_option/overload2.html +++ b/doc/html/boost_asio/reference/basic_socket/get_option/overload2.html @@ -77,7 +77,7 @@ bool is_set = option.value();
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket/io_control.html b/doc/html/boost_asio/reference/basic_socket/io_control.html index 28c1431c96..0264ac769d 100644 --- a/doc/html/boost_asio/reference/basic_socket/io_control.html +++ b/doc/html/boost_asio/reference/basic_socket/io_control.html @@ -47,7 +47,7 @@ void
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket/io_control/overload1.html b/doc/html/boost_asio/reference/basic_socket/io_control/overload1.html index b7548b6807..197f992b5f 100644 --- a/doc/html/boost_asio/reference/basic_socket/io_control/overload1.html +++ b/doc/html/boost_asio/reference/basic_socket/io_control/overload1.html @@ -80,7 +80,7 @@ std::size_t bytes_readable = command.get();
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket/io_control/overload2.html b/doc/html/boost_asio/reference/basic_socket/io_control/overload2.html index 8f2144ed84..c71960f466 100644 --- a/doc/html/boost_asio/reference/basic_socket/io_control/overload2.html +++ b/doc/html/boost_asio/reference/basic_socket/io_control/overload2.html @@ -77,7 +77,7 @@ std::size_t bytes_readable = command.get();
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket/is_open.html b/doc/html/boost_asio/reference/basic_socket/is_open.html index 05a6de701c..af8d7f79ce 100644 --- a/doc/html/boost_asio/reference/basic_socket/is_open.html +++ b/doc/html/boost_asio/reference/basic_socket/is_open.html @@ -36,7 +36,7 @@ Determine whether
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket/keep_alive.html b/doc/html/boost_asio/reference/basic_socket/keep_alive.html index c55ac87609..5d3a7cbc0d 100644 --- a/doc/html/boost_asio/reference/basic_socket/keep_alive.html +++ b/doc/html/boost_asio/reference/basic_socket/keep_alive.html @@ -73,7 +73,7 @@ bool is_set = option.value();
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket/linger.html b/doc/html/boost_asio/reference/basic_socket/linger.html index 7bf03703fc..6c9df657f7 100644 --- a/doc/html/boost_asio/reference/basic_socket/linger.html +++ b/doc/html/boost_asio/reference/basic_socket/linger.html @@ -74,7 +74,7 @@ unsigned short timeout = option.timeout();
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket/local_endpoint.html b/doc/html/boost_asio/reference/basic_socket/local_endpoint.html index 0a87e2ec54..77f2e08641 100644 --- a/doc/html/boost_asio/reference/basic_socket/local_endpoint.html +++ b/doc/html/boost_asio/reference/basic_socket/local_endpoint.html @@ -41,7 +41,7 @@ endpoint_type
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket/local_endpoint/overload1.html b/doc/html/boost_asio/reference/basic_socket/local_endpoint/overload1.html index 80b7b3b1c7..751b1ef978 100644 --- a/doc/html/boost_asio/reference/basic_socket/local_endpoint/overload1.html +++ b/doc/html/boost_asio/reference/basic_socket/local_endpoint/overload1.html @@ -67,7 +67,7 @@ boost::asio::ip::tcp::endpoint endpoint = socket.local_endpoint();
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket/local_endpoint/overload2.html b/doc/html/boost_asio/reference/basic_socket/local_endpoint/overload2.html index ba0b6b9bff..ad91c214e5 100644 --- a/doc/html/boost_asio/reference/basic_socket/local_endpoint/overload2.html +++ b/doc/html/boost_asio/reference/basic_socket/local_endpoint/overload2.html @@ -74,7 +74,7 @@ if (ec)
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket/lowest_layer.html b/doc/html/boost_asio/reference/basic_socket/lowest_layer.html index e0cf93d24a..1fb01a8d89 100644 --- a/doc/html/boost_asio/reference/basic_socket/lowest_layer.html +++ b/doc/html/boost_asio/reference/basic_socket/lowest_layer.html @@ -43,7 +43,7 @@ Get
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket/lowest_layer/overload1.html b/doc/html/boost_asio/reference/basic_socket/lowest_layer/overload1.html index cf2b80d6ca..44abe8003e 100644 --- a/doc/html/boost_asio/reference/basic_socket/lowest_layer/overload1.html +++ b/doc/html/boost_asio/reference/basic_socket/lowest_layer/overload1.html @@ -49,7 +49,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket/lowest_layer/overload2.html b/doc/html/boost_asio/reference/basic_socket/lowest_layer/overload2.html index 99d85b87f6..03f468015e 100644 --- a/doc/html/boost_asio/reference/basic_socket/lowest_layer/overload2.html +++ b/doc/html/boost_asio/reference/basic_socket/lowest_layer/overload2.html @@ -49,7 +49,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket/lowest_layer_type.html b/doc/html/boost_asio/reference/basic_socket/lowest_layer_type.html index ee10547bf2..89cff206b3 100644 --- a/doc/html/boost_asio/reference/basic_socket/lowest_layer_type.html +++ b/doc/html/boost_asio/reference/basic_socket/lowest_layer_type.html @@ -871,7 +871,7 @@ A
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket/max_connections.html b/doc/html/boost_asio/reference/basic_socket/max_connections.html index 3a48b43d3b..2c431d0801 100644 --- a/doc/html/boost_asio/reference/basic_socket/max_connections.html +++ b/doc/html/boost_asio/reference/basic_socket/max_connections.html @@ -40,7 +40,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket/max_listen_connections.html b/doc/html/boost_asio/reference/basic_socket/max_listen_connections.html index 2aba5bd55f..e7d2e4ca21 100644 --- a/doc/html/boost_asio/reference/basic_socket/max_listen_connections.html +++ b/doc/html/boost_asio/reference/basic_socket/max_listen_connections.html @@ -39,7 +39,7 @@ The
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket/message_do_not_route.html b/doc/html/boost_asio/reference/basic_socket/message_do_not_route.html index 5dfebba2ba..c136d2f446 100644 --- a/doc/html/boost_asio/reference/basic_socket/message_do_not_route.html +++ b/doc/html/boost_asio/reference/basic_socket/message_do_not_route.html @@ -39,7 +39,7 @@ Specify
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket/message_end_of_record.html b/doc/html/boost_asio/reference/basic_socket/message_end_of_record.html index 20e58607ce..6c1b5fec83 100644 --- a/doc/html/boost_asio/reference/basic_socket/message_end_of_record.html +++ b/doc/html/boost_asio/reference/basic_socket/message_end_of_record.html @@ -39,7 +39,7 @@ Specifies
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket/message_flags.html b/doc/html/boost_asio/reference/basic_socket/message_flags.html index de10c68b62..7c69ee0cf0 100644 --- a/doc/html/boost_asio/reference/basic_socket/message_flags.html +++ b/doc/html/boost_asio/reference/basic_socket/message_flags.html @@ -49,7 +49,7 @@ Bitmask
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket/message_out_of_band.html b/doc/html/boost_asio/reference/basic_socket/message_out_of_band.html index 82dde06715..1167f6b590 100644 --- a/doc/html/boost_asio/reference/basic_socket/message_out_of_band.html +++ b/doc/html/boost_asio/reference/basic_socket/message_out_of_band.html @@ -39,7 +39,7 @@ Process
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket/message_peek.html b/doc/html/boost_asio/reference/basic_socket/message_peek.html index 1ccb28c169..08c4de324c 100644 --- a/doc/html/boost_asio/reference/basic_socket/message_peek.html +++ b/doc/html/boost_asio/reference/basic_socket/message_peek.html @@ -39,7 +39,7 @@ Peek
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket/native_handle.html b/doc/html/boost_asio/reference/basic_socket/native_handle.html index e32250fbe1..3d2a67a1d6 100644 --- a/doc/html/boost_asio/reference/basic_socket/native_handle.html +++ b/doc/html/boost_asio/reference/basic_socket/native_handle.html @@ -41,7 +41,7 @@ Get
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket/native_handle_type.html b/doc/html/boost_asio/reference/basic_socket/native_handle_type.html index 065145bcbf..4b8ee23229 100644 --- a/doc/html/boost_asio/reference/basic_socket/native_handle_type.html +++ b/doc/html/boost_asio/reference/basic_socket/native_handle_type.html @@ -46,7 +46,7 @@ The
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket/native_non_blocking.html b/doc/html/boost_asio/reference/basic_socket/native_non_blocking.html index 3cd6ffda4a..ae10addb4e 100644 --- a/doc/html/boost_asio/reference/basic_socket/native_non_blocking.html +++ b/doc/html/boost_asio/reference/basic_socket/native_non_blocking.html @@ -49,7 +49,7 @@ void
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket/native_non_blocking/overload1.html b/doc/html/boost_asio/reference/basic_socket/native_non_blocking/overload1.html index 0aed0145b7..6891659fd1 100644 --- a/doc/html/boost_asio/reference/basic_socket/native_non_blocking/overload1.html +++ b/doc/html/boost_asio/reference/basic_socket/native_non_blocking/overload1.html @@ -134,7 +134,7 @@ void async_sendfile(tcp::socket& sock, int fd, Handler h)
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket/native_non_blocking/overload2.html b/doc/html/boost_asio/reference/basic_socket/native_non_blocking/overload2.html index c128f80e99..1729a42a97 100644 --- a/doc/html/boost_asio/reference/basic_socket/native_non_blocking/overload2.html +++ b/doc/html/boost_asio/reference/basic_socket/native_non_blocking/overload2.html @@ -147,7 +147,7 @@ void async_sendfile(tcp::socket& sock, int fd, Handler h)
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket/native_non_blocking/overload3.html b/doc/html/boost_asio/reference/basic_socket/native_non_blocking/overload3.html index 10f741a0b6..a40abb2e0e 100644 --- a/doc/html/boost_asio/reference/basic_socket/native_non_blocking/overload3.html +++ b/doc/html/boost_asio/reference/basic_socket/native_non_blocking/overload3.html @@ -139,7 +139,7 @@ void async_sendfile(tcp::socket& sock, int fd, Handler h)
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket/non_blocking.html b/doc/html/boost_asio/reference/basic_socket/non_blocking.html index f051533c47..49cead1f69 100644 --- a/doc/html/boost_asio/reference/basic_socket/non_blocking.html +++ b/doc/html/boost_asio/reference/basic_socket/non_blocking.html @@ -49,7 +49,7 @@ void
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket/non_blocking/overload1.html b/doc/html/boost_asio/reference/basic_socket/non_blocking/overload1.html index 6b85a0cd5d..763a5366ca 100644 --- a/doc/html/boost_asio/reference/basic_socket/non_blocking/overload1.html +++ b/doc/html/boost_asio/reference/basic_socket/non_blocking/overload1.html @@ -54,7 +54,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket/non_blocking/overload2.html b/doc/html/boost_asio/reference/basic_socket/non_blocking/overload2.html index 57da99b66c..38bb82130f 100644 --- a/doc/html/boost_asio/reference/basic_socket/non_blocking/overload2.html +++ b/doc/html/boost_asio/reference/basic_socket/non_blocking/overload2.html @@ -73,7 +73,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket/non_blocking/overload3.html b/doc/html/boost_asio/reference/basic_socket/non_blocking/overload3.html index 34be05a39f..8bfc3f399e 100644 --- a/doc/html/boost_asio/reference/basic_socket/non_blocking/overload3.html +++ b/doc/html/boost_asio/reference/basic_socket/non_blocking/overload3.html @@ -65,7 +65,7 @@
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket/open.html b/doc/html/boost_asio/reference/basic_socket/open.html index fd58635a4e..f66cd3c393 100644 --- a/doc/html/boost_asio/reference/basic_socket/open.html +++ b/doc/html/boost_asio/reference/basic_socket/open.html @@ -43,7 +43,7 @@ void
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket/open/overload1.html b/doc/html/boost_asio/reference/basic_socket/open/overload1.html index 6343ebc417..c5f575c357 100644 --- a/doc/html/boost_asio/reference/basic_socket/open/overload1.html +++ b/doc/html/boost_asio/reference/basic_socket/open/overload1.html @@ -72,7 +72,7 @@ socket.open(boost::asio::ip::tcp::v4());
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket/open/overload2.html b/doc/html/boost_asio/reference/basic_socket/open/overload2.html index d6b5bd4e1a..a7d1e091a3 100644 --- a/doc/html/boost_asio/reference/basic_socket/open/overload2.html +++ b/doc/html/boost_asio/reference/basic_socket/open/overload2.html @@ -69,7 +69,7 @@ if (ec)
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket/operator_eq_.html b/doc/html/boost_asio/reference/basic_socket/operator_eq_.html index af848e698e..a229c956a0 100644 --- a/doc/html/boost_asio/reference/basic_socket/operator_eq_.html +++ b/doc/html/boost_asio/reference/basic_socket/operator_eq_.html @@ -49,7 +49,7 @@ enable_if< is_convertible< Protocol1, Protocol >::value, basic_socket &
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket/operator_eq_/overload1.html b/doc/html/boost_asio/reference/basic_socket/operator_eq_/overload1.html index ef94018a28..6574820e0d 100644 --- a/doc/html/boost_asio/reference/basic_socket/operator_eq_/overload1.html +++ b/doc/html/boost_asio/reference/basic_socket/operator_eq_/overload1.html @@ -62,7 +62,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket/operator_eq_/overload2.html b/doc/html/boost_asio/reference/basic_socket/operator_eq_/overload2.html index 4efbe6b053..58f176f892 100644 --- a/doc/html/boost_asio/reference/basic_socket/operator_eq_/overload2.html +++ b/doc/html/boost_asio/reference/basic_socket/operator_eq_/overload2.html @@ -64,7 +64,7 @@ enable_if< is_convertible< Protocol1, Protocol >::value, basic_socket &
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket/out_of_band_inline.html b/doc/html/boost_asio/reference/basic_socket/out_of_band_inline.html index 75b88ed58a..16115b889c 100644 --- a/doc/html/boost_asio/reference/basic_socket/out_of_band_inline.html +++ b/doc/html/boost_asio/reference/basic_socket/out_of_band_inline.html @@ -73,7 +73,7 @@ bool value = option.value();
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket/protocol_type.html b/doc/html/boost_asio/reference/basic_socket/protocol_type.html index 872ceb3d37..c01873e54b 100644 --- a/doc/html/boost_asio/reference/basic_socket/protocol_type.html +++ b/doc/html/boost_asio/reference/basic_socket/protocol_type.html @@ -46,7 +46,7 @@ The
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket/receive_buffer_size.html b/doc/html/boost_asio/reference/basic_socket/receive_buffer_size.html index 6e93b133f2..cf7a447184 100644 --- a/doc/html/boost_asio/reference/basic_socket/receive_buffer_size.html +++ b/doc/html/boost_asio/reference/basic_socket/receive_buffer_size.html @@ -73,7 +73,7 @@ int size = option.value();
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket/receive_low_watermark.html b/doc/html/boost_asio/reference/basic_socket/receive_low_watermark.html index ec1229d47e..afa7b5fd6d 100644 --- a/doc/html/boost_asio/reference/basic_socket/receive_low_watermark.html +++ b/doc/html/boost_asio/reference/basic_socket/receive_low_watermark.html @@ -73,7 +73,7 @@ int size = option.value();
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket/release.html b/doc/html/boost_asio/reference/basic_socket/release.html index efcf1ba25e..65857baac7 100644 --- a/doc/html/boost_asio/reference/basic_socket/release.html +++ b/doc/html/boost_asio/reference/basic_socket/release.html @@ -41,7 +41,7 @@ native_handle_type
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket/release/overload1.html b/doc/html/boost_asio/reference/basic_socket/release/overload1.html index f695035360..f58ecc7ac1 100644 --- a/doc/html/boost_asio/reference/basic_socket/release/overload1.html +++ b/doc/html/boost_asio/reference/basic_socket/release/overload1.html @@ -63,7 +63,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket/release/overload2.html b/doc/html/boost_asio/reference/basic_socket/release/overload2.html index c9aa69ba04..340c415631 100644 --- a/doc/html/boost_asio/reference/basic_socket/release/overload2.html +++ b/doc/html/boost_asio/reference/basic_socket/release/overload2.html @@ -64,7 +64,7 @@
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket/remote_endpoint.html b/doc/html/boost_asio/reference/basic_socket/remote_endpoint.html index 6ad0e9cd65..a9f00a5248 100644 --- a/doc/html/boost_asio/reference/basic_socket/remote_endpoint.html +++ b/doc/html/boost_asio/reference/basic_socket/remote_endpoint.html @@ -41,7 +41,7 @@ endpoint_type
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket/remote_endpoint/overload1.html b/doc/html/boost_asio/reference/basic_socket/remote_endpoint/overload1.html index 6e57e44531..65fcaf9db4 100644 --- a/doc/html/boost_asio/reference/basic_socket/remote_endpoint/overload1.html +++ b/doc/html/boost_asio/reference/basic_socket/remote_endpoint/overload1.html @@ -67,7 +67,7 @@ boost::asio::ip::tcp::endpoint endpoint = socket.remote_endpoint();
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket/remote_endpoint/overload2.html b/doc/html/boost_asio/reference/basic_socket/remote_endpoint/overload2.html index 2c05034c66..a5eb7e4735 100644 --- a/doc/html/boost_asio/reference/basic_socket/remote_endpoint/overload2.html +++ b/doc/html/boost_asio/reference/basic_socket/remote_endpoint/overload2.html @@ -74,7 +74,7 @@ if (ec)
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket/reuse_address.html b/doc/html/boost_asio/reference/basic_socket/reuse_address.html index a2a2fa9975..681b7bccd6 100644 --- a/doc/html/boost_asio/reference/basic_socket/reuse_address.html +++ b/doc/html/boost_asio/reference/basic_socket/reuse_address.html @@ -74,7 +74,7 @@ bool is_set = option.value();
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket/send_buffer_size.html b/doc/html/boost_asio/reference/basic_socket/send_buffer_size.html index e7e03981ac..298d6a6f19 100644 --- a/doc/html/boost_asio/reference/basic_socket/send_buffer_size.html +++ b/doc/html/boost_asio/reference/basic_socket/send_buffer_size.html @@ -73,7 +73,7 @@ int size = option.value();
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket/send_low_watermark.html b/doc/html/boost_asio/reference/basic_socket/send_low_watermark.html index 76fa6d7342..b007387581 100644 --- a/doc/html/boost_asio/reference/basic_socket/send_low_watermark.html +++ b/doc/html/boost_asio/reference/basic_socket/send_low_watermark.html @@ -73,7 +73,7 @@ int size = option.value();
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket/set_option.html b/doc/html/boost_asio/reference/basic_socket/set_option.html index 4553f60517..1ec692f91a 100644 --- a/doc/html/boost_asio/reference/basic_socket/set_option.html +++ b/doc/html/boost_asio/reference/basic_socket/set_option.html @@ -47,7 +47,7 @@ void
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket/set_option/overload1.html b/doc/html/boost_asio/reference/basic_socket/set_option/overload1.html index 1c69bbc33e..3d39c9fb8d 100644 --- a/doc/html/boost_asio/reference/basic_socket/set_option/overload1.html +++ b/doc/html/boost_asio/reference/basic_socket/set_option/overload1.html @@ -79,7 +79,7 @@ socket.set_option(option);
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket/set_option/overload2.html b/doc/html/boost_asio/reference/basic_socket/set_option/overload2.html index 5e1b9cdfb7..ea2ff88b82 100644 --- a/doc/html/boost_asio/reference/basic_socket/set_option/overload2.html +++ b/doc/html/boost_asio/reference/basic_socket/set_option/overload2.html @@ -76,7 +76,7 @@ if (ec)
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket/shutdown.html b/doc/html/boost_asio/reference/basic_socket/shutdown.html index 3ac32ecc11..b25671bec9 100644 --- a/doc/html/boost_asio/reference/basic_socket/shutdown.html +++ b/doc/html/boost_asio/reference/basic_socket/shutdown.html @@ -43,7 +43,7 @@ void
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket/shutdown/overload1.html b/doc/html/boost_asio/reference/basic_socket/shutdown/overload1.html index ac3f1e86b0..bf504d2c2e 100644 --- a/doc/html/boost_asio/reference/basic_socket/shutdown/overload1.html +++ b/doc/html/boost_asio/reference/basic_socket/shutdown/overload1.html @@ -77,7 +77,7 @@ socket.shutdown(boost::asio::ip::tcp::socket::shutdown_send);
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket/shutdown/overload2.html b/doc/html/boost_asio/reference/basic_socket/shutdown/overload2.html index d4f4a9cce3..3bf86c3570 100644 --- a/doc/html/boost_asio/reference/basic_socket/shutdown/overload2.html +++ b/doc/html/boost_asio/reference/basic_socket/shutdown/overload2.html @@ -74,7 +74,7 @@ if (ec)
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket/shutdown_type.html b/doc/html/boost_asio/reference/basic_socket/shutdown_type.html index ebeeb48aa5..e07c6dcd17 100644 --- a/doc/html/boost_asio/reference/basic_socket/shutdown_type.html +++ b/doc/html/boost_asio/reference/basic_socket/shutdown_type.html @@ -65,7 +65,7 @@ Different
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket/wait.html b/doc/html/boost_asio/reference/basic_socket/wait.html index 28d8905ff7..fefaf84fae 100644 --- a/doc/html/boost_asio/reference/basic_socket/wait.html +++ b/doc/html/boost_asio/reference/basic_socket/wait.html @@ -43,7 +43,7 @@ void
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket/wait/overload1.html b/doc/html/boost_asio/reference/basic_socket/wait/overload1.html index 269bc966ad..6c98d12ef2 100644 --- a/doc/html/boost_asio/reference/basic_socket/wait/overload1.html +++ b/doc/html/boost_asio/reference/basic_socket/wait/overload1.html @@ -65,7 +65,7 @@ socket.wait(boost::asio::ip::tcp::socket::wait_read);
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket/wait/overload2.html b/doc/html/boost_asio/reference/basic_socket/wait/overload2.html index b50cc7c76f..23efd1b5e4 100644 --- a/doc/html/boost_asio/reference/basic_socket/wait/overload2.html +++ b/doc/html/boost_asio/reference/basic_socket/wait/overload2.html @@ -71,7 +71,7 @@ socket.wait(boost::asio::ip::tcp::socket::wait_read, ec);
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket/wait_type.html b/doc/html/boost_asio/reference/basic_socket/wait_type.html index 64a08b0190..a83bc6dd00 100644 --- a/doc/html/boost_asio/reference/basic_socket/wait_type.html +++ b/doc/html/boost_asio/reference/basic_socket/wait_type.html @@ -67,7 +67,7 @@ Wait types.
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket_acceptor.html b/doc/html/boost_asio/reference/basic_socket_acceptor.html index fcf93cc54c..6d3d342c4e 100644 --- a/doc/html/boost_asio/reference/basic_socket_acceptor.html +++ b/doc/html/boost_asio/reference/basic_socket_acceptor.html @@ -799,7 +799,7 @@ acceptor.listen();
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket_acceptor/_basic_socket_acceptor.html b/doc/html/boost_asio/reference/basic_socket_acceptor/_basic_socket_acceptor.html index 0e95709608..2064ef7952 100644 --- a/doc/html/boost_asio/reference/basic_socket_acceptor/_basic_socket_acceptor.html +++ b/doc/html/boost_asio/reference/basic_socket_acceptor/_basic_socket_acceptor.html @@ -40,7 +40,7 @@ Destroys
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket_acceptor/accept.html b/doc/html/boost_asio/reference/basic_socket_acceptor/accept.html index 494e525418..ca43012195 100644 --- a/doc/html/boost_asio/reference/basic_socket_acceptor/accept.html +++ b/doc/html/boost_asio/reference/basic_socket_acceptor/accept.html @@ -99,7 +99,7 @@ Protocol::socket
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket_acceptor/accept/overload1.html b/doc/html/boost_asio/reference/basic_socket_acceptor/accept/overload1.html index 162db67621..39d96644d9 100644 --- a/doc/html/boost_asio/reference/basic_socket_acceptor/accept/overload1.html +++ b/doc/html/boost_asio/reference/basic_socket_acceptor/accept/overload1.html @@ -79,7 +79,7 @@ acceptor.accept(socket);
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket_acceptor/accept/overload10.html b/doc/html/boost_asio/reference/basic_socket_acceptor/accept/overload10.html index 68cb6f8315..b82b915a3e 100644 --- a/doc/html/boost_asio/reference/basic_socket_acceptor/accept/overload10.html +++ b/doc/html/boost_asio/reference/basic_socket_acceptor/accept/overload10.html @@ -86,7 +86,7 @@ if (ec)
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket_acceptor/accept/overload11.html b/doc/html/boost_asio/reference/basic_socket_acceptor/accept/overload11.html index 8923ff30ac..7154c6c8b7 100644 --- a/doc/html/boost_asio/reference/basic_socket_acceptor/accept/overload11.html +++ b/doc/html/boost_asio/reference/basic_socket_acceptor/accept/overload11.html @@ -96,7 +96,7 @@ boost::asio::ip::tcp::socket socket(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket_acceptor/accept/overload12.html b/doc/html/boost_asio/reference/basic_socket_acceptor/accept/overload12.html index 10df167e26..c5449f300b 100644 --- a/doc/html/boost_asio/reference/basic_socket_acceptor/accept/overload12.html +++ b/doc/html/boost_asio/reference/basic_socket_acceptor/accept/overload12.html @@ -93,7 +93,7 @@ if (ec)
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket_acceptor/accept/overload2.html b/doc/html/boost_asio/reference/basic_socket_acceptor/accept/overload2.html index 9a6d4f97f5..b57635a9c5 100644 --- a/doc/html/boost_asio/reference/basic_socket_acceptor/accept/overload2.html +++ b/doc/html/boost_asio/reference/basic_socket_acceptor/accept/overload2.html @@ -76,7 +76,7 @@ if (ec)
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket_acceptor/accept/overload3.html b/doc/html/boost_asio/reference/basic_socket_acceptor/accept/overload3.html index e1ac7b7e6b..c558ddfa13 100644 --- a/doc/html/boost_asio/reference/basic_socket_acceptor/accept/overload3.html +++ b/doc/html/boost_asio/reference/basic_socket_acceptor/accept/overload3.html @@ -84,7 +84,7 @@ acceptor.accept(socket, endpoint);
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket_acceptor/accept/overload4.html b/doc/html/boost_asio/reference/basic_socket_acceptor/accept/overload4.html index 57e55d8f64..6472a5433c 100644 --- a/doc/html/boost_asio/reference/basic_socket_acceptor/accept/overload4.html +++ b/doc/html/boost_asio/reference/basic_socket_acceptor/accept/overload4.html @@ -81,7 +81,7 @@ if (ec)
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket_acceptor/accept/overload5.html b/doc/html/boost_asio/reference/basic_socket_acceptor/accept/overload5.html index dd383eef3e..40fdc7a300 100644 --- a/doc/html/boost_asio/reference/basic_socket_acceptor/accept/overload5.html +++ b/doc/html/boost_asio/reference/basic_socket_acceptor/accept/overload5.html @@ -73,7 +73,7 @@ boost::asio::ip::tcp::socket socket(acceptor.accept());
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket_acceptor/accept/overload6.html b/doc/html/boost_asio/reference/basic_socket_acceptor/accept/overload6.html index a9723268a5..4b64d0ddbe 100644 --- a/doc/html/boost_asio/reference/basic_socket_acceptor/accept/overload6.html +++ b/doc/html/boost_asio/reference/basic_socket_acceptor/accept/overload6.html @@ -79,7 +79,7 @@ if (ec)
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket_acceptor/accept/overload7.html b/doc/html/boost_asio/reference/basic_socket_acceptor/accept/overload7.html index 8d1ab0da04..e5397b3e27 100644 --- a/doc/html/boost_asio/reference/basic_socket_acceptor/accept/overload7.html +++ b/doc/html/boost_asio/reference/basic_socket_acceptor/accept/overload7.html @@ -88,7 +88,7 @@ boost::asio::ip::tcp::socket socket(acceptor.accept());
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket_acceptor/accept/overload8.html b/doc/html/boost_asio/reference/basic_socket_acceptor/accept/overload8.html index 849c236d9e..22e3c7dd33 100644 --- a/doc/html/boost_asio/reference/basic_socket_acceptor/accept/overload8.html +++ b/doc/html/boost_asio/reference/basic_socket_acceptor/accept/overload8.html @@ -85,7 +85,7 @@ if (ec)
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket_acceptor/accept/overload9.html b/doc/html/boost_asio/reference/basic_socket_acceptor/accept/overload9.html index 0ea185bdbc..9a5fa27874 100644 --- a/doc/html/boost_asio/reference/basic_socket_acceptor/accept/overload9.html +++ b/doc/html/boost_asio/reference/basic_socket_acceptor/accept/overload9.html @@ -89,7 +89,7 @@ boost::asio::ip::tcp::socket socket(acceptor.accept(endpoint));
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket_acceptor/assign.html b/doc/html/boost_asio/reference/basic_socket_acceptor/assign.html index 3761736eb5..3a624065bf 100644 --- a/doc/html/boost_asio/reference/basic_socket_acceptor/assign.html +++ b/doc/html/boost_asio/reference/basic_socket_acceptor/assign.html @@ -45,7 +45,7 @@ void
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket_acceptor/assign/overload1.html b/doc/html/boost_asio/reference/basic_socket_acceptor/assign/overload1.html index ec6baecf5d..255e1566ad 100644 --- a/doc/html/boost_asio/reference/basic_socket_acceptor/assign/overload1.html +++ b/doc/html/boost_asio/reference/basic_socket_acceptor/assign/overload1.html @@ -37,7 +37,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket_acceptor/assign/overload2.html b/doc/html/boost_asio/reference/basic_socket_acceptor/assign/overload2.html index 3af7ff8af7..e485253663 100644 --- a/doc/html/boost_asio/reference/basic_socket_acceptor/assign/overload2.html +++ b/doc/html/boost_asio/reference/basic_socket_acceptor/assign/overload2.html @@ -38,7 +38,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket_acceptor/async_accept.html b/doc/html/boost_asio/reference/basic_socket_acceptor/async_accept.html index d04407db38..b48216b9a7 100644 --- a/doc/html/boost_asio/reference/basic_socket_acceptor/async_accept.html +++ b/doc/html/boost_asio/reference/basic_socket_acceptor/async_accept.html @@ -79,7 +79,7 @@ template<
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket_acceptor/async_accept/overload1.html b/doc/html/boost_asio/reference/basic_socket_acceptor/async_accept/overload1.html index 34a1bab016..b778f1f3d7 100644 --- a/doc/html/boost_asio/reference/basic_socket_acceptor/async_accept/overload1.html +++ b/doc/html/boost_asio/reference/basic_socket_acceptor/async_accept/overload1.html @@ -97,7 +97,7 @@ acceptor.async_accept(socket, accept_handler);
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket_acceptor/async_accept/overload2.html b/doc/html/boost_asio/reference/basic_socket_acceptor/async_accept/overload2.html index 2a05ce6df3..bc58e768d4 100644 --- a/doc/html/boost_asio/reference/basic_socket_acceptor/async_accept/overload2.html +++ b/doc/html/boost_asio/reference/basic_socket_acceptor/async_accept/overload2.html @@ -85,7 +85,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket_acceptor/async_accept/overload3.html b/doc/html/boost_asio/reference/basic_socket_acceptor/async_accept/overload3.html index dfaf994895..774e4c5224 100644 --- a/doc/html/boost_asio/reference/basic_socket_acceptor/async_accept/overload3.html +++ b/doc/html/boost_asio/reference/basic_socket_acceptor/async_accept/overload3.html @@ -93,7 +93,7 @@ acceptor.async_accept(accept_handler);
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket_acceptor/async_accept/overload4.html b/doc/html/boost_asio/reference/basic_socket_acceptor/async_accept/overload4.html index 569d3aa2a3..5c1b7e9d34 100644 --- a/doc/html/boost_asio/reference/basic_socket_acceptor/async_accept/overload4.html +++ b/doc/html/boost_asio/reference/basic_socket_acceptor/async_accept/overload4.html @@ -99,7 +99,7 @@ acceptor.async_accept(io_context2, accept_handler);
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket_acceptor/async_accept/overload5.html b/doc/html/boost_asio/reference/basic_socket_acceptor/async_accept/overload5.html index 29c80feb48..969462d656 100644 --- a/doc/html/boost_asio/reference/basic_socket_acceptor/async_accept/overload5.html +++ b/doc/html/boost_asio/reference/basic_socket_acceptor/async_accept/overload5.html @@ -102,7 +102,7 @@ acceptor.async_accept(endpoint, accept_handler);
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket_acceptor/async_accept/overload6.html b/doc/html/boost_asio/reference/basic_socket_acceptor/async_accept/overload6.html index 0aeb9435f6..7e6588c91f 100644 --- a/doc/html/boost_asio/reference/basic_socket_acceptor/async_accept/overload6.html +++ b/doc/html/boost_asio/reference/basic_socket_acceptor/async_accept/overload6.html @@ -108,7 +108,7 @@ acceptor.async_accept(io_context2, endpoint, accept_handler);
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket_acceptor/async_wait.html b/doc/html/boost_asio/reference/basic_socket_acceptor/async_wait.html index 115f385d4e..0051996299 100644 --- a/doc/html/boost_asio/reference/basic_socket_acceptor/async_wait.html +++ b/doc/html/boost_asio/reference/basic_socket_acceptor/async_wait.html @@ -96,7 +96,7 @@ acceptor.async_wait(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket_acceptor/basic_socket_acceptor.html b/doc/html/boost_asio/reference/basic_socket_acceptor/basic_socket_acceptor.html index 020d62de24..6e63741c88 100644 --- a/doc/html/boost_asio/reference/basic_socket_acceptor/basic_socket_acceptor.html +++ b/doc/html/boost_asio/reference/basic_socket_acceptor/basic_socket_acceptor.html @@ -84,7 +84,7 @@ Construct
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket_acceptor/basic_socket_acceptor/overload1.html b/doc/html/boost_asio/reference/basic_socket_acceptor/basic_socket_acceptor/overload1.html index a3fac34f65..2254dc4d43 100644 --- a/doc/html/boost_asio/reference/basic_socket_acceptor/basic_socket_acceptor/overload1.html +++ b/doc/html/boost_asio/reference/basic_socket_acceptor/basic_socket_acceptor/overload1.html @@ -56,7 +56,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket_acceptor/basic_socket_acceptor/overload2.html b/doc/html/boost_asio/reference/basic_socket_acceptor/basic_socket_acceptor/overload2.html index 7714de9889..6b7204c5f1 100644 --- a/doc/html/boost_asio/reference/basic_socket_acceptor/basic_socket_acceptor/overload2.html +++ b/doc/html/boost_asio/reference/basic_socket_acceptor/basic_socket_acceptor/overload2.html @@ -72,7 +72,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket_acceptor/basic_socket_acceptor/overload3.html b/doc/html/boost_asio/reference/basic_socket_acceptor/basic_socket_acceptor/overload3.html index ac314b04a2..568de6f562 100644 --- a/doc/html/boost_asio/reference/basic_socket_acceptor/basic_socket_acceptor/overload3.html +++ b/doc/html/boost_asio/reference/basic_socket_acceptor/basic_socket_acceptor/overload3.html @@ -93,7 +93,7 @@ acceptor.listen(listen_backlog);
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket_acceptor/basic_socket_acceptor/overload4.html b/doc/html/boost_asio/reference/basic_socket_acceptor/basic_socket_acceptor/overload4.html index 8102c781fb..693fc82c60 100644 --- a/doc/html/boost_asio/reference/basic_socket_acceptor/basic_socket_acceptor/overload4.html +++ b/doc/html/boost_asio/reference/basic_socket_acceptor/basic_socket_acceptor/overload4.html @@ -79,7 +79,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket_acceptor/basic_socket_acceptor/overload5.html b/doc/html/boost_asio/reference/basic_socket_acceptor/basic_socket_acceptor/overload5.html index e3331e9119..a6605a3afe 100644 --- a/doc/html/boost_asio/reference/basic_socket_acceptor/basic_socket_acceptor/overload5.html +++ b/doc/html/boost_asio/reference/basic_socket_acceptor/basic_socket_acceptor/overload5.html @@ -62,7 +62,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket_acceptor/basic_socket_acceptor/overload6.html b/doc/html/boost_asio/reference/basic_socket_acceptor/basic_socket_acceptor/overload6.html index 0cce7c87f8..1ff1d54c35 100644 --- a/doc/html/boost_asio/reference/basic_socket_acceptor/basic_socket_acceptor/overload6.html +++ b/doc/html/boost_asio/reference/basic_socket_acceptor/basic_socket_acceptor/overload6.html @@ -65,7 +65,7 @@ basic_socket_acceptor(
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket_acceptor/bind.html b/doc/html/boost_asio/reference/basic_socket_acceptor/bind.html index 745c567504..47a0f142d3 100644 --- a/doc/html/boost_asio/reference/basic_socket_acceptor/bind.html +++ b/doc/html/boost_asio/reference/basic_socket_acceptor/bind.html @@ -43,7 +43,7 @@ void
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket_acceptor/bind/overload1.html b/doc/html/boost_asio/reference/basic_socket_acceptor/bind/overload1.html index db9b9ccc05..7717f536a3 100644 --- a/doc/html/boost_asio/reference/basic_socket_acceptor/bind/overload1.html +++ b/doc/html/boost_asio/reference/basic_socket_acceptor/bind/overload1.html @@ -76,7 +76,7 @@ acceptor.bind(endpoint);
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket_acceptor/bind/overload2.html b/doc/html/boost_asio/reference/basic_socket_acceptor/bind/overload2.html index 79c31c7ca7..327b246e71 100644 --- a/doc/html/boost_asio/reference/basic_socket_acceptor/bind/overload2.html +++ b/doc/html/boost_asio/reference/basic_socket_acceptor/bind/overload2.html @@ -73,7 +73,7 @@ if (ec)
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket_acceptor/broadcast.html b/doc/html/boost_asio/reference/basic_socket_acceptor/broadcast.html index 78ecadf53d..e532f2b7ac 100644 --- a/doc/html/boost_asio/reference/basic_socket_acceptor/broadcast.html +++ b/doc/html/boost_asio/reference/basic_socket_acceptor/broadcast.html @@ -73,7 +73,7 @@ bool is_set = option.value();
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket_acceptor/bytes_readable.html b/doc/html/boost_asio/reference/basic_socket_acceptor/bytes_readable.html index e49c39d5a6..c4bc3db454 100644 --- a/doc/html/boost_asio/reference/basic_socket_acceptor/bytes_readable.html +++ b/doc/html/boost_asio/reference/basic_socket_acceptor/bytes_readable.html @@ -62,7 +62,7 @@ std::size_t bytes_readable = command.get();
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket_acceptor/cancel.html b/doc/html/boost_asio/reference/basic_socket_acceptor/cancel.html index f39c28a8b7..4b0a1d4d63 100644 --- a/doc/html/boost_asio/reference/basic_socket_acceptor/cancel.html +++ b/doc/html/boost_asio/reference/basic_socket_acceptor/cancel.html @@ -41,7 +41,7 @@ void
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket_acceptor/cancel/overload1.html b/doc/html/boost_asio/reference/basic_socket_acceptor/cancel/overload1.html index 230a9e4d4c..b535f17143 100644 --- a/doc/html/boost_asio/reference/basic_socket_acceptor/cancel/overload1.html +++ b/doc/html/boost_asio/reference/basic_socket_acceptor/cancel/overload1.html @@ -54,7 +54,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket_acceptor/cancel/overload2.html b/doc/html/boost_asio/reference/basic_socket_acceptor/cancel/overload2.html index 00e1662d7f..d3a9456dbd 100644 --- a/doc/html/boost_asio/reference/basic_socket_acceptor/cancel/overload2.html +++ b/doc/html/boost_asio/reference/basic_socket_acceptor/cancel/overload2.html @@ -55,7 +55,7 @@
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket_acceptor/close.html b/doc/html/boost_asio/reference/basic_socket_acceptor/close.html index c43d229a9a..e60d5c466b 100644 --- a/doc/html/boost_asio/reference/basic_socket_acceptor/close.html +++ b/doc/html/boost_asio/reference/basic_socket_acceptor/close.html @@ -41,7 +41,7 @@ void
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket_acceptor/close/overload1.html b/doc/html/boost_asio/reference/basic_socket_acceptor/close/overload1.html index c1ea5f53b4..f4f42fc879 100644 --- a/doc/html/boost_asio/reference/basic_socket_acceptor/close/overload1.html +++ b/doc/html/boost_asio/reference/basic_socket_acceptor/close/overload1.html @@ -56,7 +56,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket_acceptor/close/overload2.html b/doc/html/boost_asio/reference/basic_socket_acceptor/close/overload2.html index 6a70b1e821..0ae85ed585 100644 --- a/doc/html/boost_asio/reference/basic_socket_acceptor/close/overload2.html +++ b/doc/html/boost_asio/reference/basic_socket_acceptor/close/overload2.html @@ -70,7 +70,7 @@ if (ec)
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket_acceptor/debug.html b/doc/html/boost_asio/reference/basic_socket_acceptor/debug.html index 9a546dc747..3f5089871d 100644 --- a/doc/html/boost_asio/reference/basic_socket_acceptor/debug.html +++ b/doc/html/boost_asio/reference/basic_socket_acceptor/debug.html @@ -73,7 +73,7 @@ bool is_set = option.value();
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket_acceptor/do_not_route.html b/doc/html/boost_asio/reference/basic_socket_acceptor/do_not_route.html index a93d8610be..5003a94804 100644 --- a/doc/html/boost_asio/reference/basic_socket_acceptor/do_not_route.html +++ b/doc/html/boost_asio/reference/basic_socket_acceptor/do_not_route.html @@ -73,7 +73,7 @@ bool is_set = option.value();
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket_acceptor/enable_connection_aborted.html b/doc/html/boost_asio/reference/basic_socket_acceptor/enable_connection_aborted.html index 8ed266cdd6..170d01b9b5 100644 --- a/doc/html/boost_asio/reference/basic_socket_acceptor/enable_connection_aborted.html +++ b/doc/html/boost_asio/reference/basic_socket_acceptor/enable_connection_aborted.html @@ -75,7 +75,7 @@ bool is_set = option.value();
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket_acceptor/endpoint_type.html b/doc/html/boost_asio/reference/basic_socket_acceptor/endpoint_type.html index ef07a1a413..7ba770d375 100644 --- a/doc/html/boost_asio/reference/basic_socket_acceptor/endpoint_type.html +++ b/doc/html/boost_asio/reference/basic_socket_acceptor/endpoint_type.html @@ -46,7 +46,7 @@ The
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket_acceptor/executor_type.html b/doc/html/boost_asio/reference/basic_socket_acceptor/executor_type.html index 6008a72707..e0d1b2fe77 100644 --- a/doc/html/boost_asio/reference/basic_socket_acceptor/executor_type.html +++ b/doc/html/boost_asio/reference/basic_socket_acceptor/executor_type.html @@ -203,7 +203,7 @@ The
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket_acceptor/get_executor.html b/doc/html/boost_asio/reference/basic_socket_acceptor/get_executor.html index 43fc208e87..651a1beb70 100644 --- a/doc/html/boost_asio/reference/basic_socket_acceptor/get_executor.html +++ b/doc/html/boost_asio/reference/basic_socket_acceptor/get_executor.html @@ -36,7 +36,7 @@ Get
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket_acceptor/get_io_context.html b/doc/html/boost_asio/reference/basic_socket_acceptor/get_io_context.html index defb82d12e..a8f8208928 100644 --- a/doc/html/boost_asio/reference/basic_socket_acceptor/get_io_context.html +++ b/doc/html/boost_asio/reference/basic_socket_acceptor/get_io_context.html @@ -51,7 +51,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket_acceptor/get_io_service.html b/doc/html/boost_asio/reference/basic_socket_acceptor/get_io_service.html index c796ef80ee..6b97b06173 100644 --- a/doc/html/boost_asio/reference/basic_socket_acceptor/get_io_service.html +++ b/doc/html/boost_asio/reference/basic_socket_acceptor/get_io_service.html @@ -51,7 +51,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket_acceptor/get_option.html b/doc/html/boost_asio/reference/basic_socket_acceptor/get_option.html index ba398acbcd..dc4d5ce115 100644 --- a/doc/html/boost_asio/reference/basic_socket_acceptor/get_option.html +++ b/doc/html/boost_asio/reference/basic_socket_acceptor/get_option.html @@ -34,20 +34,20 @@ Get 
    template<
     typename GettableSocketOption>
 void get_option(
-    GettableSocketOption & option);
+    GettableSocketOption & option) const;
   » more...
 
 template<
     typename GettableSocketOption>
 void get_option(
     GettableSocketOption & option,
-    boost::system::error_code & ec);
+    boost::system::error_code & ec) const;
   » more...
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket_acceptor/get_option/overload1.html b/doc/html/boost_asio/reference/basic_socket_acceptor/get_option/overload1.html index 4c1d6dbf55..82409e3cb5 100644 --- a/doc/html/boost_asio/reference/basic_socket_acceptor/get_option/overload1.html +++ b/doc/html/boost_asio/reference/basic_socket_acceptor/get_option/overload1.html @@ -33,7 +33,7 @@ 
    template<
     typename GettableSocketOption>
 void get_option(
-    GettableSocketOption & option);
+    GettableSocketOption & option) const;

    This function is used to get the current value of an option on the acceptor. @@ -80,7 +80,7 @@ bool is_set = option.get();

    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket_acceptor/get_option/overload2.html b/doc/html/boost_asio/reference/basic_socket_acceptor/get_option/overload2.html index fd4044f0ad..ee5cd83881 100644 --- a/doc/html/boost_asio/reference/basic_socket_acceptor/get_option/overload2.html +++ b/doc/html/boost_asio/reference/basic_socket_acceptor/get_option/overload2.html @@ -34,7 +34,7 @@ typename GettableSocketOption> void get_option( GettableSocketOption & option, - boost::system::error_code & ec); + boost::system::error_code & ec) const;

    This function is used to get the current value of an option on the acceptor. @@ -77,7 +77,7 @@ bool is_set = option.get();

    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket_acceptor/io_control.html b/doc/html/boost_asio/reference/basic_socket_acceptor/io_control.html index 517d022dab..73bbd26259 100644 --- a/doc/html/boost_asio/reference/basic_socket_acceptor/io_control.html +++ b/doc/html/boost_asio/reference/basic_socket_acceptor/io_control.html @@ -47,7 +47,7 @@ void
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket_acceptor/io_control/overload1.html b/doc/html/boost_asio/reference/basic_socket_acceptor/io_control/overload1.html index c52a315fd7..f934bf5d8b 100644 --- a/doc/html/boost_asio/reference/basic_socket_acceptor/io_control/overload1.html +++ b/doc/html/boost_asio/reference/basic_socket_acceptor/io_control/overload1.html @@ -79,7 +79,7 @@ socket.io_control(command);
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket_acceptor/io_control/overload2.html b/doc/html/boost_asio/reference/basic_socket_acceptor/io_control/overload2.html index 783fe4afcd..95d0895e2a 100644 --- a/doc/html/boost_asio/reference/basic_socket_acceptor/io_control/overload2.html +++ b/doc/html/boost_asio/reference/basic_socket_acceptor/io_control/overload2.html @@ -76,7 +76,7 @@ if (ec)
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket_acceptor/is_open.html b/doc/html/boost_asio/reference/basic_socket_acceptor/is_open.html index 87b6e76490..5a23e25d0e 100644 --- a/doc/html/boost_asio/reference/basic_socket_acceptor/is_open.html +++ b/doc/html/boost_asio/reference/basic_socket_acceptor/is_open.html @@ -36,7 +36,7 @@ Determine
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket_acceptor/keep_alive.html b/doc/html/boost_asio/reference/basic_socket_acceptor/keep_alive.html index a9eb083481..510dde38f7 100644 --- a/doc/html/boost_asio/reference/basic_socket_acceptor/keep_alive.html +++ b/doc/html/boost_asio/reference/basic_socket_acceptor/keep_alive.html @@ -73,7 +73,7 @@ bool is_set = option.value();
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket_acceptor/linger.html b/doc/html/boost_asio/reference/basic_socket_acceptor/linger.html index 0748eab715..99503b0f1c 100644 --- a/doc/html/boost_asio/reference/basic_socket_acceptor/linger.html +++ b/doc/html/boost_asio/reference/basic_socket_acceptor/linger.html @@ -75,7 +75,7 @@ unsigned short timeout = option.timeout();
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket_acceptor/listen.html b/doc/html/boost_asio/reference/basic_socket_acceptor/listen.html index b9e7f3ea0c..e67a105fea 100644 --- a/doc/html/boost_asio/reference/basic_socket_acceptor/listen.html +++ b/doc/html/boost_asio/reference/basic_socket_acceptor/listen.html @@ -43,7 +43,7 @@ void
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket_acceptor/listen/overload1.html b/doc/html/boost_asio/reference/basic_socket_acceptor/listen/overload1.html index 44f42652b5..82133136fe 100644 --- a/doc/html/boost_asio/reference/basic_socket_acceptor/listen/overload1.html +++ b/doc/html/boost_asio/reference/basic_socket_acceptor/listen/overload1.html @@ -66,7 +66,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket_acceptor/listen/overload2.html b/doc/html/boost_asio/reference/basic_socket_acceptor/listen/overload2.html index 169a2da235..c29d3d5bd3 100644 --- a/doc/html/boost_asio/reference/basic_socket_acceptor/listen/overload2.html +++ b/doc/html/boost_asio/reference/basic_socket_acceptor/listen/overload2.html @@ -71,7 +71,7 @@ if (ec)
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket_acceptor/local_endpoint.html b/doc/html/boost_asio/reference/basic_socket_acceptor/local_endpoint.html index 5f733811f3..41d5e940af 100644 --- a/doc/html/boost_asio/reference/basic_socket_acceptor/local_endpoint.html +++ b/doc/html/boost_asio/reference/basic_socket_acceptor/local_endpoint.html @@ -41,7 +41,7 @@ endpoint_type
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket_acceptor/local_endpoint/overload1.html b/doc/html/boost_asio/reference/basic_socket_acceptor/local_endpoint/overload1.html index 513d54bfbc..132660bfb7 100644 --- a/doc/html/boost_asio/reference/basic_socket_acceptor/local_endpoint/overload1.html +++ b/doc/html/boost_asio/reference/basic_socket_acceptor/local_endpoint/overload1.html @@ -67,7 +67,7 @@ boost::asio::ip::tcp::endpoint endpoint = acceptor.local_endpoint();
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket_acceptor/local_endpoint/overload2.html b/doc/html/boost_asio/reference/basic_socket_acceptor/local_endpoint/overload2.html index f7f15c0ba0..e6eebeeea0 100644 --- a/doc/html/boost_asio/reference/basic_socket_acceptor/local_endpoint/overload2.html +++ b/doc/html/boost_asio/reference/basic_socket_acceptor/local_endpoint/overload2.html @@ -75,7 +75,7 @@ if (ec)
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket_acceptor/max_connections.html b/doc/html/boost_asio/reference/basic_socket_acceptor/max_connections.html index a68a97e5c4..a89879852b 100644 --- a/doc/html/boost_asio/reference/basic_socket_acceptor/max_connections.html +++ b/doc/html/boost_asio/reference/basic_socket_acceptor/max_connections.html @@ -40,7 +40,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket_acceptor/max_listen_connections.html b/doc/html/boost_asio/reference/basic_socket_acceptor/max_listen_connections.html index 6853db1ad3..105c9da200 100644 --- a/doc/html/boost_asio/reference/basic_socket_acceptor/max_listen_connections.html +++ b/doc/html/boost_asio/reference/basic_socket_acceptor/max_listen_connections.html @@ -39,7 +39,7 @@ The
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket_acceptor/message_do_not_route.html b/doc/html/boost_asio/reference/basic_socket_acceptor/message_do_not_route.html index 53dc81685d..4bffb11ab3 100644 --- a/doc/html/boost_asio/reference/basic_socket_acceptor/message_do_not_route.html +++ b/doc/html/boost_asio/reference/basic_socket_acceptor/message_do_not_route.html @@ -39,7 +39,7 @@ Specify
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket_acceptor/message_end_of_record.html b/doc/html/boost_asio/reference/basic_socket_acceptor/message_end_of_record.html index 59175a3bc8..bc415a03ea 100644 --- a/doc/html/boost_asio/reference/basic_socket_acceptor/message_end_of_record.html +++ b/doc/html/boost_asio/reference/basic_socket_acceptor/message_end_of_record.html @@ -39,7 +39,7 @@ Specifies
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket_acceptor/message_flags.html b/doc/html/boost_asio/reference/basic_socket_acceptor/message_flags.html index 816b81ae0a..5e71a9fd16 100644 --- a/doc/html/boost_asio/reference/basic_socket_acceptor/message_flags.html +++ b/doc/html/boost_asio/reference/basic_socket_acceptor/message_flags.html @@ -49,7 +49,7 @@ Bitmask
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket_acceptor/message_out_of_band.html b/doc/html/boost_asio/reference/basic_socket_acceptor/message_out_of_band.html index eeb6ed3f46..62cf649b33 100644 --- a/doc/html/boost_asio/reference/basic_socket_acceptor/message_out_of_band.html +++ b/doc/html/boost_asio/reference/basic_socket_acceptor/message_out_of_band.html @@ -39,7 +39,7 @@ Process
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket_acceptor/message_peek.html b/doc/html/boost_asio/reference/basic_socket_acceptor/message_peek.html index 8b20adc1fc..f438de3a8f 100644 --- a/doc/html/boost_asio/reference/basic_socket_acceptor/message_peek.html +++ b/doc/html/boost_asio/reference/basic_socket_acceptor/message_peek.html @@ -39,7 +39,7 @@ Peek
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket_acceptor/native_handle.html b/doc/html/boost_asio/reference/basic_socket_acceptor/native_handle.html index 287e531108..82231c4e69 100644 --- a/doc/html/boost_asio/reference/basic_socket_acceptor/native_handle.html +++ b/doc/html/boost_asio/reference/basic_socket_acceptor/native_handle.html @@ -41,7 +41,7 @@ Get
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket_acceptor/native_handle_type.html b/doc/html/boost_asio/reference/basic_socket_acceptor/native_handle_type.html index 166331ee69..4616a743f2 100644 --- a/doc/html/boost_asio/reference/basic_socket_acceptor/native_handle_type.html +++ b/doc/html/boost_asio/reference/basic_socket_acceptor/native_handle_type.html @@ -46,7 +46,7 @@ The
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket_acceptor/native_non_blocking.html b/doc/html/boost_asio/reference/basic_socket_acceptor/native_non_blocking.html index 81daf672f0..fe2025b9f6 100644 --- a/doc/html/boost_asio/reference/basic_socket_acceptor/native_non_blocking.html +++ b/doc/html/boost_asio/reference/basic_socket_acceptor/native_non_blocking.html @@ -49,7 +49,7 @@ void
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket_acceptor/native_non_blocking/overload1.html b/doc/html/boost_asio/reference/basic_socket_acceptor/native_non_blocking/overload1.html index 0e4e01f28c..778559880d 100644 --- a/doc/html/boost_asio/reference/basic_socket_acceptor/native_non_blocking/overload1.html +++ b/doc/html/boost_asio/reference/basic_socket_acceptor/native_non_blocking/overload1.html @@ -59,7 +59,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket_acceptor/native_non_blocking/overload2.html b/doc/html/boost_asio/reference/basic_socket_acceptor/native_non_blocking/overload2.html index a103c1d5b4..f00edc4767 100644 --- a/doc/html/boost_asio/reference/basic_socket_acceptor/native_non_blocking/overload2.html +++ b/doc/html/boost_asio/reference/basic_socket_acceptor/native_non_blocking/overload2.html @@ -72,7 +72,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket_acceptor/native_non_blocking/overload3.html b/doc/html/boost_asio/reference/basic_socket_acceptor/native_non_blocking/overload3.html index bcbdbce5f9..e5e7fe5e6b 100644 --- a/doc/html/boost_asio/reference/basic_socket_acceptor/native_non_blocking/overload3.html +++ b/doc/html/boost_asio/reference/basic_socket_acceptor/native_non_blocking/overload3.html @@ -64,7 +64,7 @@
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket_acceptor/non_blocking.html b/doc/html/boost_asio/reference/basic_socket_acceptor/non_blocking.html index 009d87b881..8323fe7fa3 100644 --- a/doc/html/boost_asio/reference/basic_socket_acceptor/non_blocking.html +++ b/doc/html/boost_asio/reference/basic_socket_acceptor/non_blocking.html @@ -49,7 +49,7 @@ void
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket_acceptor/non_blocking/overload1.html b/doc/html/boost_asio/reference/basic_socket_acceptor/non_blocking/overload1.html index 2fc1bc2b4d..b1dcded3f7 100644 --- a/doc/html/boost_asio/reference/basic_socket_acceptor/non_blocking/overload1.html +++ b/doc/html/boost_asio/reference/basic_socket_acceptor/non_blocking/overload1.html @@ -54,7 +54,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket_acceptor/non_blocking/overload2.html b/doc/html/boost_asio/reference/basic_socket_acceptor/non_blocking/overload2.html index d99e73f169..413dd49996 100644 --- a/doc/html/boost_asio/reference/basic_socket_acceptor/non_blocking/overload2.html +++ b/doc/html/boost_asio/reference/basic_socket_acceptor/non_blocking/overload2.html @@ -73,7 +73,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket_acceptor/non_blocking/overload3.html b/doc/html/boost_asio/reference/basic_socket_acceptor/non_blocking/overload3.html index c2e1f3083c..92b2979987 100644 --- a/doc/html/boost_asio/reference/basic_socket_acceptor/non_blocking/overload3.html +++ b/doc/html/boost_asio/reference/basic_socket_acceptor/non_blocking/overload3.html @@ -65,7 +65,7 @@
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket_acceptor/open.html b/doc/html/boost_asio/reference/basic_socket_acceptor/open.html index 50abdd7840..71f8d3771b 100644 --- a/doc/html/boost_asio/reference/basic_socket_acceptor/open.html +++ b/doc/html/boost_asio/reference/basic_socket_acceptor/open.html @@ -43,7 +43,7 @@ void
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket_acceptor/open/overload1.html b/doc/html/boost_asio/reference/basic_socket_acceptor/open/overload1.html index 9dc1dbf935..5c4fe43c13 100644 --- a/doc/html/boost_asio/reference/basic_socket_acceptor/open/overload1.html +++ b/doc/html/boost_asio/reference/basic_socket_acceptor/open/overload1.html @@ -73,7 +73,7 @@ acceptor.open(boost::asio::ip::tcp::v4());
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket_acceptor/open/overload2.html b/doc/html/boost_asio/reference/basic_socket_acceptor/open/overload2.html index 53fce5b85b..55c2086849 100644 --- a/doc/html/boost_asio/reference/basic_socket_acceptor/open/overload2.html +++ b/doc/html/boost_asio/reference/basic_socket_acceptor/open/overload2.html @@ -70,7 +70,7 @@ if (ec)
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket_acceptor/operator_eq_.html b/doc/html/boost_asio/reference/basic_socket_acceptor/operator_eq_.html index 2d96bb3292..c7c01a6ef5 100644 --- a/doc/html/boost_asio/reference/basic_socket_acceptor/operator_eq_.html +++ b/doc/html/boost_asio/reference/basic_socket_acceptor/operator_eq_.html @@ -49,7 +49,7 @@ enable_if< is_convertible< Protocol1, Protocol >::value, basic_socket_a
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket_acceptor/operator_eq_/overload1.html b/doc/html/boost_asio/reference/basic_socket_acceptor/operator_eq_/overload1.html index 986c9ed4dc..ade353909c 100644 --- a/doc/html/boost_asio/reference/basic_socket_acceptor/operator_eq_/overload1.html +++ b/doc/html/boost_asio/reference/basic_socket_acceptor/operator_eq_/overload1.html @@ -62,7 +62,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket_acceptor/operator_eq_/overload2.html b/doc/html/boost_asio/reference/basic_socket_acceptor/operator_eq_/overload2.html index c2bc9c90fa..985a6c0e4e 100644 --- a/doc/html/boost_asio/reference/basic_socket_acceptor/operator_eq_/overload2.html +++ b/doc/html/boost_asio/reference/basic_socket_acceptor/operator_eq_/overload2.html @@ -64,7 +64,7 @@ enable_if< is_convertible< Protocol1, Protocol >::value, basic_socket_a
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket_acceptor/out_of_band_inline.html b/doc/html/boost_asio/reference/basic_socket_acceptor/out_of_band_inline.html index 19195088c2..5bb8539afe 100644 --- a/doc/html/boost_asio/reference/basic_socket_acceptor/out_of_band_inline.html +++ b/doc/html/boost_asio/reference/basic_socket_acceptor/out_of_band_inline.html @@ -73,7 +73,7 @@ bool value = option.value();
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket_acceptor/protocol_type.html b/doc/html/boost_asio/reference/basic_socket_acceptor/protocol_type.html index 772ef0dfc1..bd7f200bdd 100644 --- a/doc/html/boost_asio/reference/basic_socket_acceptor/protocol_type.html +++ b/doc/html/boost_asio/reference/basic_socket_acceptor/protocol_type.html @@ -46,7 +46,7 @@ The
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket_acceptor/receive_buffer_size.html b/doc/html/boost_asio/reference/basic_socket_acceptor/receive_buffer_size.html index 5aebd6cb4a..9006ec2bda 100644 --- a/doc/html/boost_asio/reference/basic_socket_acceptor/receive_buffer_size.html +++ b/doc/html/boost_asio/reference/basic_socket_acceptor/receive_buffer_size.html @@ -73,7 +73,7 @@ int size = option.value();
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket_acceptor/receive_low_watermark.html b/doc/html/boost_asio/reference/basic_socket_acceptor/receive_low_watermark.html index aef795df06..09cf08a3b6 100644 --- a/doc/html/boost_asio/reference/basic_socket_acceptor/receive_low_watermark.html +++ b/doc/html/boost_asio/reference/basic_socket_acceptor/receive_low_watermark.html @@ -73,7 +73,7 @@ int size = option.value();
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket_acceptor/release.html b/doc/html/boost_asio/reference/basic_socket_acceptor/release.html index a1fd27f1b9..9962d97542 100644 --- a/doc/html/boost_asio/reference/basic_socket_acceptor/release.html +++ b/doc/html/boost_asio/reference/basic_socket_acceptor/release.html @@ -41,7 +41,7 @@ native_handle_type
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket_acceptor/release/overload1.html b/doc/html/boost_asio/reference/basic_socket_acceptor/release/overload1.html index 36e3b15545..94b696c1fc 100644 --- a/doc/html/boost_asio/reference/basic_socket_acceptor/release/overload1.html +++ b/doc/html/boost_asio/reference/basic_socket_acceptor/release/overload1.html @@ -63,7 +63,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket_acceptor/release/overload2.html b/doc/html/boost_asio/reference/basic_socket_acceptor/release/overload2.html index 913890e89d..61803a3141 100644 --- a/doc/html/boost_asio/reference/basic_socket_acceptor/release/overload2.html +++ b/doc/html/boost_asio/reference/basic_socket_acceptor/release/overload2.html @@ -64,7 +64,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket_acceptor/reuse_address.html b/doc/html/boost_asio/reference/basic_socket_acceptor/reuse_address.html index 671dc486ab..6a6d0145c1 100644 --- a/doc/html/boost_asio/reference/basic_socket_acceptor/reuse_address.html +++ b/doc/html/boost_asio/reference/basic_socket_acceptor/reuse_address.html @@ -74,7 +74,7 @@ bool is_set = option.value();
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket_acceptor/send_buffer_size.html b/doc/html/boost_asio/reference/basic_socket_acceptor/send_buffer_size.html index eae5b881ac..ae6c95bafd 100644 --- a/doc/html/boost_asio/reference/basic_socket_acceptor/send_buffer_size.html +++ b/doc/html/boost_asio/reference/basic_socket_acceptor/send_buffer_size.html @@ -73,7 +73,7 @@ int size = option.value();
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket_acceptor/send_low_watermark.html b/doc/html/boost_asio/reference/basic_socket_acceptor/send_low_watermark.html index 8ea40cc25d..2754254be1 100644 --- a/doc/html/boost_asio/reference/basic_socket_acceptor/send_low_watermark.html +++ b/doc/html/boost_asio/reference/basic_socket_acceptor/send_low_watermark.html @@ -73,7 +73,7 @@ int size = option.value();
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket_acceptor/set_option.html b/doc/html/boost_asio/reference/basic_socket_acceptor/set_option.html index de23eb0c61..a23336a004 100644 --- a/doc/html/boost_asio/reference/basic_socket_acceptor/set_option.html +++ b/doc/html/boost_asio/reference/basic_socket_acceptor/set_option.html @@ -47,7 +47,7 @@ void
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket_acceptor/set_option/overload1.html b/doc/html/boost_asio/reference/basic_socket_acceptor/set_option/overload1.html index 3b639fedf3..d68373746e 100644 --- a/doc/html/boost_asio/reference/basic_socket_acceptor/set_option/overload1.html +++ b/doc/html/boost_asio/reference/basic_socket_acceptor/set_option/overload1.html @@ -79,7 +79,7 @@ acceptor.set_option(option);
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket_acceptor/set_option/overload2.html b/doc/html/boost_asio/reference/basic_socket_acceptor/set_option/overload2.html index ebb393cf78..10aeccdf29 100644 --- a/doc/html/boost_asio/reference/basic_socket_acceptor/set_option/overload2.html +++ b/doc/html/boost_asio/reference/basic_socket_acceptor/set_option/overload2.html @@ -76,7 +76,7 @@ if (ec)
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket_acceptor/shutdown_type.html b/doc/html/boost_asio/reference/basic_socket_acceptor/shutdown_type.html index bad6b6f3d4..6c8bcd572f 100644 --- a/doc/html/boost_asio/reference/basic_socket_acceptor/shutdown_type.html +++ b/doc/html/boost_asio/reference/basic_socket_acceptor/shutdown_type.html @@ -65,7 +65,7 @@ Different
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket_acceptor/wait.html b/doc/html/boost_asio/reference/basic_socket_acceptor/wait.html index a1f8714972..5b6e15cb7b 100644 --- a/doc/html/boost_asio/reference/basic_socket_acceptor/wait.html +++ b/doc/html/boost_asio/reference/basic_socket_acceptor/wait.html @@ -44,7 +44,7 @@ void
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket_acceptor/wait/overload1.html b/doc/html/boost_asio/reference/basic_socket_acceptor/wait/overload1.html index 09318bd2e0..7c85c06dae 100644 --- a/doc/html/boost_asio/reference/basic_socket_acceptor/wait/overload1.html +++ b/doc/html/boost_asio/reference/basic_socket_acceptor/wait/overload1.html @@ -65,7 +65,7 @@ acceptor.wait(boost::asio::ip::tcp::acceptor::wait_read);
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket_acceptor/wait/overload2.html b/doc/html/boost_asio/reference/basic_socket_acceptor/wait/overload2.html index 39264bdac0..f29621e4e1 100644 --- a/doc/html/boost_asio/reference/basic_socket_acceptor/wait/overload2.html +++ b/doc/html/boost_asio/reference/basic_socket_acceptor/wait/overload2.html @@ -71,7 +71,7 @@ acceptor.wait(boost::asio::ip::tcp::acceptor::wait_read, ec);
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket_acceptor/wait_type.html b/doc/html/boost_asio/reference/basic_socket_acceptor/wait_type.html index 03d6fffea6..3f533ec953 100644 --- a/doc/html/boost_asio/reference/basic_socket_acceptor/wait_type.html +++ b/doc/html/boost_asio/reference/basic_socket_acceptor/wait_type.html @@ -68,7 +68,7 @@ Wait
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket_iostream.html b/doc/html/boost_asio/reference/basic_socket_iostream.html index 6c02e789ec..edf48304bf 100644 --- a/doc/html/boost_asio/reference/basic_socket_iostream.html +++ b/doc/html/boost_asio/reference/basic_socket_iostream.html @@ -333,7 +333,7 @@ class basic_socket_iostream
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket_iostream/basic_socket_iostream.html b/doc/html/boost_asio/reference/basic_socket_iostream/basic_socket_iostream.html index 3b27298f67..56461d25cf 100644 --- a/doc/html/boost_asio/reference/basic_socket_iostream/basic_socket_iostream.html +++ b/doc/html/boost_asio/reference/basic_socket_iostream/basic_socket_iostream.html @@ -67,7 +67,7 @@ explicit
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket_iostream/basic_socket_iostream/overload1.html b/doc/html/boost_asio/reference/basic_socket_iostream/basic_socket_iostream/overload1.html index 069ed23e4b..5ae2014a91 100644 --- a/doc/html/boost_asio/reference/basic_socket_iostream/basic_socket_iostream/overload1.html +++ b/doc/html/boost_asio/reference/basic_socket_iostream/basic_socket_iostream/overload1.html @@ -36,7 +36,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket_iostream/basic_socket_iostream/overload2.html b/doc/html/boost_asio/reference/basic_socket_iostream/basic_socket_iostream/overload2.html index 3671ad1444..cd4b02313e 100644 --- a/doc/html/boost_asio/reference/basic_socket_iostream/basic_socket_iostream/overload2.html +++ b/doc/html/boost_asio/reference/basic_socket_iostream/basic_socket_iostream/overload2.html @@ -37,7 +37,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket_iostream/basic_socket_iostream/overload3.html b/doc/html/boost_asio/reference/basic_socket_iostream/basic_socket_iostream/overload3.html index c72b9b1643..fe04793da9 100644 --- a/doc/html/boost_asio/reference/basic_socket_iostream/basic_socket_iostream/overload3.html +++ b/doc/html/boost_asio/reference/basic_socket_iostream/basic_socket_iostream/overload3.html @@ -37,7 +37,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket_iostream/basic_socket_iostream/overload4.html b/doc/html/boost_asio/reference/basic_socket_iostream/basic_socket_iostream/overload4.html index 5f459b12a9..3488d7e444 100644 --- a/doc/html/boost_asio/reference/basic_socket_iostream/basic_socket_iostream/overload4.html +++ b/doc/html/boost_asio/reference/basic_socket_iostream/basic_socket_iostream/overload4.html @@ -47,7 +47,7 @@ basic_socket_iostream(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket_iostream/clock_type.html b/doc/html/boost_asio/reference/basic_socket_iostream/clock_type.html index bcd9a81feb..8bdae5b8e6 100644 --- a/doc/html/boost_asio/reference/basic_socket_iostream/clock_type.html +++ b/doc/html/boost_asio/reference/basic_socket_iostream/clock_type.html @@ -46,7 +46,7 @@ The
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket_iostream/close.html b/doc/html/boost_asio/reference/basic_socket_iostream/close.html index 69ec0f5f34..4c9887fbaf 100644 --- a/doc/html/boost_asio/reference/basic_socket_iostream/close.html +++ b/doc/html/boost_asio/reference/basic_socket_iostream/close.html @@ -36,7 +36,7 @@ Close
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket_iostream/connect.html b/doc/html/boost_asio/reference/basic_socket_iostream/connect.html index 1d3e626075..eba8f0a578 100644 --- a/doc/html/boost_asio/reference/basic_socket_iostream/connect.html +++ b/doc/html/boost_asio/reference/basic_socket_iostream/connect.html @@ -48,7 +48,7 @@ void connect(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket_iostream/duration.html b/doc/html/boost_asio/reference/basic_socket_iostream/duration.html index f83475803c..ad02090cb6 100644 --- a/doc/html/boost_asio/reference/basic_socket_iostream/duration.html +++ b/doc/html/boost_asio/reference/basic_socket_iostream/duration.html @@ -46,7 +46,7 @@ The
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket_iostream/duration_type.html b/doc/html/boost_asio/reference/basic_socket_iostream/duration_type.html index d06befd741..60aae45e1e 100644 --- a/doc/html/boost_asio/reference/basic_socket_iostream/duration_type.html +++ b/doc/html/boost_asio/reference/basic_socket_iostream/duration_type.html @@ -46,7 +46,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket_iostream/endpoint_type.html b/doc/html/boost_asio/reference/basic_socket_iostream/endpoint_type.html index abbd417177..12d466e79a 100644 --- a/doc/html/boost_asio/reference/basic_socket_iostream/endpoint_type.html +++ b/doc/html/boost_asio/reference/basic_socket_iostream/endpoint_type.html @@ -46,7 +46,7 @@ The
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket_iostream/error.html b/doc/html/boost_asio/reference/basic_socket_iostream/error.html index 7c6922ac7f..cfce41e223 100644 --- a/doc/html/boost_asio/reference/basic_socket_iostream/error.html +++ b/doc/html/boost_asio/reference/basic_socket_iostream/error.html @@ -57,7 +57,7 @@ if (!s)
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket_iostream/expires_after.html b/doc/html/boost_asio/reference/basic_socket_iostream/expires_after.html index 61e41e2755..8249622254 100644 --- a/doc/html/boost_asio/reference/basic_socket_iostream/expires_after.html +++ b/doc/html/boost_asio/reference/basic_socket_iostream/expires_after.html @@ -55,7 +55,7 @@ Set
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket_iostream/expires_at.html b/doc/html/boost_asio/reference/basic_socket_iostream/expires_at.html index 72234f65ad..70e7531026 100644 --- a/doc/html/boost_asio/reference/basic_socket_iostream/expires_at.html +++ b/doc/html/boost_asio/reference/basic_socket_iostream/expires_at.html @@ -45,7 +45,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket_iostream/expires_at/overload1.html b/doc/html/boost_asio/reference/basic_socket_iostream/expires_at/overload1.html index 198f49eed3..412a5a5165 100644 --- a/doc/html/boost_asio/reference/basic_socket_iostream/expires_at/overload1.html +++ b/doc/html/boost_asio/reference/basic_socket_iostream/expires_at/overload1.html @@ -44,7 +44,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket_iostream/expires_at/overload2.html b/doc/html/boost_asio/reference/basic_socket_iostream/expires_at/overload2.html index 9e35640e5f..114c6ccdcd 100644 --- a/doc/html/boost_asio/reference/basic_socket_iostream/expires_at/overload2.html +++ b/doc/html/boost_asio/reference/basic_socket_iostream/expires_at/overload2.html @@ -54,7 +54,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket_iostream/expires_from_now.html b/doc/html/boost_asio/reference/basic_socket_iostream/expires_from_now.html index 5f858371a7..093cf28ef7 100644 --- a/doc/html/boost_asio/reference/basic_socket_iostream/expires_from_now.html +++ b/doc/html/boost_asio/reference/basic_socket_iostream/expires_from_now.html @@ -45,7 +45,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket_iostream/expires_from_now/overload1.html b/doc/html/boost_asio/reference/basic_socket_iostream/expires_from_now/overload1.html index d461f999f3..1b402bdd50 100644 --- a/doc/html/boost_asio/reference/basic_socket_iostream/expires_from_now/overload1.html +++ b/doc/html/boost_asio/reference/basic_socket_iostream/expires_from_now/overload1.html @@ -44,7 +44,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket_iostream/expires_from_now/overload2.html b/doc/html/boost_asio/reference/basic_socket_iostream/expires_from_now/overload2.html index 29a883aa91..ec5b96fa1a 100644 --- a/doc/html/boost_asio/reference/basic_socket_iostream/expires_from_now/overload2.html +++ b/doc/html/boost_asio/reference/basic_socket_iostream/expires_from_now/overload2.html @@ -55,7 +55,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket_iostream/expiry.html b/doc/html/boost_asio/reference/basic_socket_iostream/expiry.html index 893733716d..c142bf872d 100644 --- a/doc/html/boost_asio/reference/basic_socket_iostream/expiry.html +++ b/doc/html/boost_asio/reference/basic_socket_iostream/expiry.html @@ -44,7 +44,7 @@ Get
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket_iostream/operator_eq_.html b/doc/html/boost_asio/reference/basic_socket_iostream/operator_eq_.html index 1be55df9b8..cc92268244 100644 --- a/doc/html/boost_asio/reference/basic_socket_iostream/operator_eq_.html +++ b/doc/html/boost_asio/reference/basic_socket_iostream/operator_eq_.html @@ -38,7 +38,7 @@ Move-assign
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket_iostream/protocol_type.html b/doc/html/boost_asio/reference/basic_socket_iostream/protocol_type.html index 53a62027e3..e40ddef381 100644 --- a/doc/html/boost_asio/reference/basic_socket_iostream/protocol_type.html +++ b/doc/html/boost_asio/reference/basic_socket_iostream/protocol_type.html @@ -46,7 +46,7 @@ The
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket_iostream/rdbuf.html b/doc/html/boost_asio/reference/basic_socket_iostream/rdbuf.html index 84d29adbe9..e5f8315124 100644 --- a/doc/html/boost_asio/reference/basic_socket_iostream/rdbuf.html +++ b/doc/html/boost_asio/reference/basic_socket_iostream/rdbuf.html @@ -36,7 +36,7 @@ Return
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket_iostream/socket.html b/doc/html/boost_asio/reference/basic_socket_iostream/socket.html index 1ac6931ef8..0b6a8a72f0 100644 --- a/doc/html/boost_asio/reference/basic_socket_iostream/socket.html +++ b/doc/html/boost_asio/reference/basic_socket_iostream/socket.html @@ -36,7 +36,7 @@ Get
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket_iostream/time_point.html b/doc/html/boost_asio/reference/basic_socket_iostream/time_point.html index c82e1bc55c..07abb17bd0 100644 --- a/doc/html/boost_asio/reference/basic_socket_iostream/time_point.html +++ b/doc/html/boost_asio/reference/basic_socket_iostream/time_point.html @@ -46,7 +46,7 @@ The
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket_iostream/time_type.html b/doc/html/boost_asio/reference/basic_socket_iostream/time_type.html index b703ea20d8..d6527284e9 100644 --- a/doc/html/boost_asio/reference/basic_socket_iostream/time_type.html +++ b/doc/html/boost_asio/reference/basic_socket_iostream/time_type.html @@ -46,7 +46,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket_streambuf.html b/doc/html/boost_asio/reference/basic_socket_streambuf.html index 18b1212d4c..7c96aa0d12 100644 --- a/doc/html/boost_asio/reference/basic_socket_streambuf.html +++ b/doc/html/boost_asio/reference/basic_socket_streambuf.html @@ -403,7 +403,7 @@ class basic_socket_streambuf :
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket_streambuf/_basic_socket_streambuf.html b/doc/html/boost_asio/reference/basic_socket_streambuf/_basic_socket_streambuf.html index cef2848bf2..1347beee9c 100644 --- a/doc/html/boost_asio/reference/basic_socket_streambuf/_basic_socket_streambuf.html +++ b/doc/html/boost_asio/reference/basic_socket_streambuf/_basic_socket_streambuf.html @@ -36,7 +36,7 @@ Destructor
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket_streambuf/basic_socket_streambuf.html b/doc/html/boost_asio/reference/basic_socket_streambuf/basic_socket_streambuf.html index 1e5c13028f..5638f68bf7 100644 --- a/doc/html/boost_asio/reference/basic_socket_streambuf/basic_socket_streambuf.html +++ b/doc/html/boost_asio/reference/basic_socket_streambuf/basic_socket_streambuf.html @@ -54,7 +54,7 @@ Construct
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket_streambuf/basic_socket_streambuf/overload1.html b/doc/html/boost_asio/reference/basic_socket_streambuf/basic_socket_streambuf/overload1.html index 1d49b70cc5..fb46ab8ebf 100644 --- a/doc/html/boost_asio/reference/basic_socket_streambuf/basic_socket_streambuf/overload1.html +++ b/doc/html/boost_asio/reference/basic_socket_streambuf/basic_socket_streambuf/overload1.html @@ -36,7 +36,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket_streambuf/basic_socket_streambuf/overload2.html b/doc/html/boost_asio/reference/basic_socket_streambuf/basic_socket_streambuf/overload2.html index c2c90bc4fc..903fa07052 100644 --- a/doc/html/boost_asio/reference/basic_socket_streambuf/basic_socket_streambuf/overload2.html +++ b/doc/html/boost_asio/reference/basic_socket_streambuf/basic_socket_streambuf/overload2.html @@ -37,7 +37,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket_streambuf/basic_socket_streambuf/overload3.html b/doc/html/boost_asio/reference/basic_socket_streambuf/basic_socket_streambuf/overload3.html index ee0f37c1c7..8d487dabf1 100644 --- a/doc/html/boost_asio/reference/basic_socket_streambuf/basic_socket_streambuf/overload3.html +++ b/doc/html/boost_asio/reference/basic_socket_streambuf/basic_socket_streambuf/overload3.html @@ -37,7 +37,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket_streambuf/clock_type.html b/doc/html/boost_asio/reference/basic_socket_streambuf/clock_type.html index 11d1dd81a3..5ca16f5d6d 100644 --- a/doc/html/boost_asio/reference/basic_socket_streambuf/clock_type.html +++ b/doc/html/boost_asio/reference/basic_socket_streambuf/clock_type.html @@ -46,7 +46,7 @@ The
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket_streambuf/close.html b/doc/html/boost_asio/reference/basic_socket_streambuf/close.html index c3e8fbce79..b5b2ee62d2 100644 --- a/doc/html/boost_asio/reference/basic_socket_streambuf/close.html +++ b/doc/html/boost_asio/reference/basic_socket_streambuf/close.html @@ -45,7 +45,7 @@ Close
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket_streambuf/connect.html b/doc/html/boost_asio/reference/basic_socket_streambuf/connect.html index 084cc8d78a..51477e8a31 100644 --- a/doc/html/boost_asio/reference/basic_socket_streambuf/connect.html +++ b/doc/html/boost_asio/reference/basic_socket_streambuf/connect.html @@ -48,7 +48,7 @@ basic_socket_streambuf *
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket_streambuf/connect/overload1.html b/doc/html/boost_asio/reference/basic_socket_streambuf/connect/overload1.html index 1a10c9cd58..bcdf262dfe 100644 --- a/doc/html/boost_asio/reference/basic_socket_streambuf/connect/overload1.html +++ b/doc/html/boost_asio/reference/basic_socket_streambuf/connect/overload1.html @@ -48,7 +48,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket_streambuf/connect/overload2.html b/doc/html/boost_asio/reference/basic_socket_streambuf/connect/overload2.html index fc6bfc558b..4dae75dfc6 100644 --- a/doc/html/boost_asio/reference/basic_socket_streambuf/connect/overload2.html +++ b/doc/html/boost_asio/reference/basic_socket_streambuf/connect/overload2.html @@ -56,7 +56,7 @@ basic_socket_streambuf * connect(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket_streambuf/duration.html b/doc/html/boost_asio/reference/basic_socket_streambuf/duration.html index 6ab212679c..2d026a0eda 100644 --- a/doc/html/boost_asio/reference/basic_socket_streambuf/duration.html +++ b/doc/html/boost_asio/reference/basic_socket_streambuf/duration.html @@ -46,7 +46,7 @@ The
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket_streambuf/duration_type.html b/doc/html/boost_asio/reference/basic_socket_streambuf/duration_type.html index 691035d4f7..e5c5f50c9a 100644 --- a/doc/html/boost_asio/reference/basic_socket_streambuf/duration_type.html +++ b/doc/html/boost_asio/reference/basic_socket_streambuf/duration_type.html @@ -46,7 +46,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket_streambuf/endpoint_type.html b/doc/html/boost_asio/reference/basic_socket_streambuf/endpoint_type.html index 6bf65750f5..d46f042e55 100644 --- a/doc/html/boost_asio/reference/basic_socket_streambuf/endpoint_type.html +++ b/doc/html/boost_asio/reference/basic_socket_streambuf/endpoint_type.html @@ -46,7 +46,7 @@ The
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket_streambuf/error.html b/doc/html/boost_asio/reference/basic_socket_streambuf/error.html index 01e67c49d0..b7f0c28dff 100644 --- a/doc/html/boost_asio/reference/basic_socket_streambuf/error.html +++ b/doc/html/boost_asio/reference/basic_socket_streambuf/error.html @@ -45,7 +45,7 @@ Get
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket_streambuf/expires_after.html b/doc/html/boost_asio/reference/basic_socket_streambuf/expires_after.html index 952d28d8c0..a20cf3aa12 100644 --- a/doc/html/boost_asio/reference/basic_socket_streambuf/expires_after.html +++ b/doc/html/boost_asio/reference/basic_socket_streambuf/expires_after.html @@ -55,7 +55,7 @@ Set
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket_streambuf/expires_at.html b/doc/html/boost_asio/reference/basic_socket_streambuf/expires_at.html index 5cb7ee7e82..8cf4ba71d2 100644 --- a/doc/html/boost_asio/reference/basic_socket_streambuf/expires_at.html +++ b/doc/html/boost_asio/reference/basic_socket_streambuf/expires_at.html @@ -45,7 +45,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket_streambuf/expires_at/overload1.html b/doc/html/boost_asio/reference/basic_socket_streambuf/expires_at/overload1.html index 4294a069c6..e4a813cc02 100644 --- a/doc/html/boost_asio/reference/basic_socket_streambuf/expires_at/overload1.html +++ b/doc/html/boost_asio/reference/basic_socket_streambuf/expires_at/overload1.html @@ -44,7 +44,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket_streambuf/expires_at/overload2.html b/doc/html/boost_asio/reference/basic_socket_streambuf/expires_at/overload2.html index 2f3086f2be..ce44c0497a 100644 --- a/doc/html/boost_asio/reference/basic_socket_streambuf/expires_at/overload2.html +++ b/doc/html/boost_asio/reference/basic_socket_streambuf/expires_at/overload2.html @@ -54,7 +54,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket_streambuf/expires_from_now.html b/doc/html/boost_asio/reference/basic_socket_streambuf/expires_from_now.html index 7e7d6a1159..b44181ddde 100644 --- a/doc/html/boost_asio/reference/basic_socket_streambuf/expires_from_now.html +++ b/doc/html/boost_asio/reference/basic_socket_streambuf/expires_from_now.html @@ -46,7 +46,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket_streambuf/expires_from_now/overload1.html b/doc/html/boost_asio/reference/basic_socket_streambuf/expires_from_now/overload1.html index 41274a2f91..394668632e 100644 --- a/doc/html/boost_asio/reference/basic_socket_streambuf/expires_from_now/overload1.html +++ b/doc/html/boost_asio/reference/basic_socket_streambuf/expires_from_now/overload1.html @@ -44,7 +44,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket_streambuf/expires_from_now/overload2.html b/doc/html/boost_asio/reference/basic_socket_streambuf/expires_from_now/overload2.html index 435d5c0b5e..9106e8d4ae 100644 --- a/doc/html/boost_asio/reference/basic_socket_streambuf/expires_from_now/overload2.html +++ b/doc/html/boost_asio/reference/basic_socket_streambuf/expires_from_now/overload2.html @@ -55,7 +55,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket_streambuf/expiry.html b/doc/html/boost_asio/reference/basic_socket_streambuf/expiry.html index 39a39dc64d..553293d392 100644 --- a/doc/html/boost_asio/reference/basic_socket_streambuf/expiry.html +++ b/doc/html/boost_asio/reference/basic_socket_streambuf/expiry.html @@ -44,7 +44,7 @@ Get
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket_streambuf/operator_eq_.html b/doc/html/boost_asio/reference/basic_socket_streambuf/operator_eq_.html index 4ab028f7dd..84f9fb917e 100644 --- a/doc/html/boost_asio/reference/basic_socket_streambuf/operator_eq_.html +++ b/doc/html/boost_asio/reference/basic_socket_streambuf/operator_eq_.html @@ -38,7 +38,7 @@ Move-assign
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket_streambuf/overflow.html b/doc/html/boost_asio/reference/basic_socket_streambuf/overflow.html index e0b5b09a84..1eb759c3d0 100644 --- a/doc/html/boost_asio/reference/basic_socket_streambuf/overflow.html +++ b/doc/html/boost_asio/reference/basic_socket_streambuf/overflow.html @@ -35,7 +35,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket_streambuf/protocol_type.html b/doc/html/boost_asio/reference/basic_socket_streambuf/protocol_type.html index 3429e0acc0..a9e27f2c02 100644 --- a/doc/html/boost_asio/reference/basic_socket_streambuf/protocol_type.html +++ b/doc/html/boost_asio/reference/basic_socket_streambuf/protocol_type.html @@ -46,7 +46,7 @@ The
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket_streambuf/puberror.html b/doc/html/boost_asio/reference/basic_socket_streambuf/puberror.html index 126835d25b..c7c326f870 100644 --- a/doc/html/boost_asio/reference/basic_socket_streambuf/puberror.html +++ b/doc/html/boost_asio/reference/basic_socket_streambuf/puberror.html @@ -46,7 +46,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket_streambuf/setbuf.html b/doc/html/boost_asio/reference/basic_socket_streambuf/setbuf.html index 6a444cdecf..f2e01f582f 100644 --- a/doc/html/boost_asio/reference/basic_socket_streambuf/setbuf.html +++ b/doc/html/boost_asio/reference/basic_socket_streambuf/setbuf.html @@ -36,7 +36,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket_streambuf/socket.html b/doc/html/boost_asio/reference/basic_socket_streambuf/socket.html index fb7fc75770..875b335911 100644 --- a/doc/html/boost_asio/reference/basic_socket_streambuf/socket.html +++ b/doc/html/boost_asio/reference/basic_socket_streambuf/socket.html @@ -36,7 +36,7 @@ Get
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket_streambuf/sync.html b/doc/html/boost_asio/reference/basic_socket_streambuf/sync.html index 90d19c562c..a439a214eb 100644 --- a/doc/html/boost_asio/reference/basic_socket_streambuf/sync.html +++ b/doc/html/boost_asio/reference/basic_socket_streambuf/sync.html @@ -34,7 +34,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket_streambuf/time_point.html b/doc/html/boost_asio/reference/basic_socket_streambuf/time_point.html index e02d7823c0..488d109cdd 100644 --- a/doc/html/boost_asio/reference/basic_socket_streambuf/time_point.html +++ b/doc/html/boost_asio/reference/basic_socket_streambuf/time_point.html @@ -46,7 +46,7 @@ The
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket_streambuf/time_type.html b/doc/html/boost_asio/reference/basic_socket_streambuf/time_type.html index 22c3a2ac53..2cc5aec4fd 100644 --- a/doc/html/boost_asio/reference/basic_socket_streambuf/time_type.html +++ b/doc/html/boost_asio/reference/basic_socket_streambuf/time_type.html @@ -46,7 +46,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_socket_streambuf/underflow.html b/doc/html/boost_asio/reference/basic_socket_streambuf/underflow.html index 0d40887294..abba47cc60 100644 --- a/doc/html/boost_asio/reference/basic_socket_streambuf/underflow.html +++ b/doc/html/boost_asio/reference/basic_socket_streambuf/underflow.html @@ -34,7 +34,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_stream_socket.html b/doc/html/boost_asio/reference/basic_stream_socket.html index d32146d127..0cb6082efd 100644 --- a/doc/html/boost_asio/reference/basic_stream_socket.html +++ b/doc/html/boost_asio/reference/basic_stream_socket.html @@ -944,7 +944,7 @@ class basic_stream_socket :
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_stream_socket/_basic_stream_socket.html b/doc/html/boost_asio/reference/basic_stream_socket/_basic_stream_socket.html index 69aed83f28..c68598bc04 100644 --- a/doc/html/boost_asio/reference/basic_stream_socket/_basic_stream_socket.html +++ b/doc/html/boost_asio/reference/basic_stream_socket/_basic_stream_socket.html @@ -40,7 +40,7 @@ Destroys
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_stream_socket/assign.html b/doc/html/boost_asio/reference/basic_stream_socket/assign.html index 95792e8bae..2f98347c36 100644 --- a/doc/html/boost_asio/reference/basic_stream_socket/assign.html +++ b/doc/html/boost_asio/reference/basic_stream_socket/assign.html @@ -45,7 +45,7 @@ void
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_stream_socket/assign/overload1.html b/doc/html/boost_asio/reference/basic_stream_socket/assign/overload1.html index 6b2d6c48a2..4f295b89af 100644 --- a/doc/html/boost_asio/reference/basic_stream_socket/assign/overload1.html +++ b/doc/html/boost_asio/reference/basic_stream_socket/assign/overload1.html @@ -40,7 +40,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_stream_socket/assign/overload2.html b/doc/html/boost_asio/reference/basic_stream_socket/assign/overload2.html index 9e8a490229..13548638a6 100644 --- a/doc/html/boost_asio/reference/basic_stream_socket/assign/overload2.html +++ b/doc/html/boost_asio/reference/basic_stream_socket/assign/overload2.html @@ -41,7 +41,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_stream_socket/async_connect.html b/doc/html/boost_asio/reference/basic_stream_socket/async_connect.html index d068b3770e..a2df1aac04 100644 --- a/doc/html/boost_asio/reference/basic_stream_socket/async_connect.html +++ b/doc/html/boost_asio/reference/basic_stream_socket/async_connect.html @@ -103,7 +103,7 @@ socket.async_connect(endpoint, connect_handler);
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_stream_socket/async_read_some.html b/doc/html/boost_asio/reference/basic_stream_socket/async_read_some.html index 716f13e72d..14269c55d9 100644 --- a/doc/html/boost_asio/reference/basic_stream_socket/async_read_some.html +++ b/doc/html/boost_asio/reference/basic_stream_socket/async_read_some.html @@ -105,7 +105,7 @@ Start
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_stream_socket/async_receive.html b/doc/html/boost_asio/reference/basic_stream_socket/async_receive.html index 802ac92daa..9835fc1f04 100644 --- a/doc/html/boost_asio/reference/basic_stream_socket/async_receive.html +++ b/doc/html/boost_asio/reference/basic_stream_socket/async_receive.html @@ -51,7 +51,7 @@ template<
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_stream_socket/async_receive/overload1.html b/doc/html/boost_asio/reference/basic_stream_socket/async_receive/overload1.html index 25f88f8288..0d3942ff9b 100644 --- a/doc/html/boost_asio/reference/basic_stream_socket/async_receive/overload1.html +++ b/doc/html/boost_asio/reference/basic_stream_socket/async_receive/overload1.html @@ -104,7 +104,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_stream_socket/async_receive/overload2.html b/doc/html/boost_asio/reference/basic_stream_socket/async_receive/overload2.html index 9ccbfdc649..8917d21c6d 100644 --- a/doc/html/boost_asio/reference/basic_stream_socket/async_receive/overload2.html +++ b/doc/html/boost_asio/reference/basic_stream_socket/async_receive/overload2.html @@ -109,7 +109,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_stream_socket/async_send.html b/doc/html/boost_asio/reference/basic_stream_socket/async_send.html index 21b08494da..dc3542665d 100644 --- a/doc/html/boost_asio/reference/basic_stream_socket/async_send.html +++ b/doc/html/boost_asio/reference/basic_stream_socket/async_send.html @@ -51,7 +51,7 @@ template<
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_stream_socket/async_send/overload1.html b/doc/html/boost_asio/reference/basic_stream_socket/async_send/overload1.html index 7b397c124a..ee61f341e6 100644 --- a/doc/html/boost_asio/reference/basic_stream_socket/async_send/overload1.html +++ b/doc/html/boost_asio/reference/basic_stream_socket/async_send/overload1.html @@ -104,7 +104,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_stream_socket/async_send/overload2.html b/doc/html/boost_asio/reference/basic_stream_socket/async_send/overload2.html index b17d37149f..24f53aade6 100644 --- a/doc/html/boost_asio/reference/basic_stream_socket/async_send/overload2.html +++ b/doc/html/boost_asio/reference/basic_stream_socket/async_send/overload2.html @@ -109,7 +109,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_stream_socket/async_wait.html b/doc/html/boost_asio/reference/basic_stream_socket/async_wait.html index 5d2168f165..4de62b8d85 100644 --- a/doc/html/boost_asio/reference/basic_stream_socket/async_wait.html +++ b/doc/html/boost_asio/reference/basic_stream_socket/async_wait.html @@ -97,7 +97,7 @@ socket.async_wait(boost::asio::ip::tcp::socket::wait_read, wait_handler);
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_stream_socket/async_write_some.html b/doc/html/boost_asio/reference/basic_stream_socket/async_write_some.html index a3f7f3ceb0..49ed4f9727 100644 --- a/doc/html/boost_asio/reference/basic_stream_socket/async_write_some.html +++ b/doc/html/boost_asio/reference/basic_stream_socket/async_write_some.html @@ -105,7 +105,7 @@ Start
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_stream_socket/at_mark.html b/doc/html/boost_asio/reference/basic_stream_socket/at_mark.html index 19221b3a78..b581fa0ec6 100644 --- a/doc/html/boost_asio/reference/basic_stream_socket/at_mark.html +++ b/doc/html/boost_asio/reference/basic_stream_socket/at_mark.html @@ -41,7 +41,7 @@ bool
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_stream_socket/at_mark/overload1.html b/doc/html/boost_asio/reference/basic_stream_socket/at_mark/overload1.html index 5c765028fb..2ae3379112 100644 --- a/doc/html/boost_asio/reference/basic_stream_socket/at_mark/overload1.html +++ b/doc/html/boost_asio/reference/basic_stream_socket/at_mark/overload1.html @@ -63,7 +63,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_stream_socket/at_mark/overload2.html b/doc/html/boost_asio/reference/basic_stream_socket/at_mark/overload2.html index 49c87dd92b..d283a6d8c8 100644 --- a/doc/html/boost_asio/reference/basic_stream_socket/at_mark/overload2.html +++ b/doc/html/boost_asio/reference/basic_stream_socket/at_mark/overload2.html @@ -64,7 +64,7 @@
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_stream_socket/available.html b/doc/html/boost_asio/reference/basic_stream_socket/available.html index e494856322..7d131ce78f 100644 --- a/doc/html/boost_asio/reference/basic_stream_socket/available.html +++ b/doc/html/boost_asio/reference/basic_stream_socket/available.html @@ -41,7 +41,7 @@ std::size_t
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_stream_socket/available/overload1.html b/doc/html/boost_asio/reference/basic_stream_socket/available/overload1.html index 638f97e3e4..c3db660d9c 100644 --- a/doc/html/boost_asio/reference/basic_stream_socket/available/overload1.html +++ b/doc/html/boost_asio/reference/basic_stream_socket/available/overload1.html @@ -64,7 +64,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_stream_socket/available/overload2.html b/doc/html/boost_asio/reference/basic_stream_socket/available/overload2.html index c8255f50af..31c9e08002 100644 --- a/doc/html/boost_asio/reference/basic_stream_socket/available/overload2.html +++ b/doc/html/boost_asio/reference/basic_stream_socket/available/overload2.html @@ -65,7 +65,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_stream_socket/basic_stream_socket.html b/doc/html/boost_asio/reference/basic_stream_socket/basic_stream_socket.html index 726f51c495..8a9e246aa0 100644 --- a/doc/html/boost_asio/reference/basic_stream_socket/basic_stream_socket.html +++ b/doc/html/boost_asio/reference/basic_stream_socket/basic_stream_socket.html @@ -85,7 +85,7 @@ Construct
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_stream_socket/basic_stream_socket/overload1.html b/doc/html/boost_asio/reference/basic_stream_socket/basic_stream_socket/overload1.html index 661f405217..95500b5785 100644 --- a/doc/html/boost_asio/reference/basic_stream_socket/basic_stream_socket/overload1.html +++ b/doc/html/boost_asio/reference/basic_stream_socket/basic_stream_socket/overload1.html @@ -57,7 +57,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_stream_socket/basic_stream_socket/overload2.html b/doc/html/boost_asio/reference/basic_stream_socket/basic_stream_socket/overload2.html index 60a3c4aba3..14d3b3c2ef 100644 --- a/doc/html/boost_asio/reference/basic_stream_socket/basic_stream_socket/overload2.html +++ b/doc/html/boost_asio/reference/basic_stream_socket/basic_stream_socket/overload2.html @@ -73,7 +73,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_stream_socket/basic_stream_socket/overload3.html b/doc/html/boost_asio/reference/basic_stream_socket/basic_stream_socket/overload3.html index 20d17192ba..32e465d438 100644 --- a/doc/html/boost_asio/reference/basic_stream_socket/basic_stream_socket/overload3.html +++ b/doc/html/boost_asio/reference/basic_stream_socket/basic_stream_socket/overload3.html @@ -76,7 +76,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_stream_socket/basic_stream_socket/overload4.html b/doc/html/boost_asio/reference/basic_stream_socket/basic_stream_socket/overload4.html index e5e72195a3..c779e1d099 100644 --- a/doc/html/boost_asio/reference/basic_stream_socket/basic_stream_socket/overload4.html +++ b/doc/html/boost_asio/reference/basic_stream_socket/basic_stream_socket/overload4.html @@ -79,7 +79,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_stream_socket/basic_stream_socket/overload5.html b/doc/html/boost_asio/reference/basic_stream_socket/basic_stream_socket/overload5.html index 61af743320..23aae8bbbd 100644 --- a/doc/html/boost_asio/reference/basic_stream_socket/basic_stream_socket/overload5.html +++ b/doc/html/boost_asio/reference/basic_stream_socket/basic_stream_socket/overload5.html @@ -62,7 +62,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_stream_socket/basic_stream_socket/overload6.html b/doc/html/boost_asio/reference/basic_stream_socket/basic_stream_socket/overload6.html index 62e2fb8a67..cda88a90c8 100644 --- a/doc/html/boost_asio/reference/basic_stream_socket/basic_stream_socket/overload6.html +++ b/doc/html/boost_asio/reference/basic_stream_socket/basic_stream_socket/overload6.html @@ -65,7 +65,7 @@ basic_stream_socket(
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_stream_socket/bind.html b/doc/html/boost_asio/reference/basic_stream_socket/bind.html index 3c39af4c69..b83d7bf86b 100644 --- a/doc/html/boost_asio/reference/basic_stream_socket/bind.html +++ b/doc/html/boost_asio/reference/basic_stream_socket/bind.html @@ -43,7 +43,7 @@ void
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_stream_socket/bind/overload1.html b/doc/html/boost_asio/reference/basic_stream_socket/bind/overload1.html index e7616611fd..0a98598664 100644 --- a/doc/html/boost_asio/reference/basic_stream_socket/bind/overload1.html +++ b/doc/html/boost_asio/reference/basic_stream_socket/bind/overload1.html @@ -78,7 +78,7 @@ socket.bind(boost::asio::ip::tcp::endpoint(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_stream_socket/bind/overload2.html b/doc/html/boost_asio/reference/basic_stream_socket/bind/overload2.html index 4779f1897d..207133c82c 100644 --- a/doc/html/boost_asio/reference/basic_stream_socket/bind/overload2.html +++ b/doc/html/boost_asio/reference/basic_stream_socket/bind/overload2.html @@ -75,7 +75,7 @@ if (ec)
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_stream_socket/broadcast.html b/doc/html/boost_asio/reference/basic_stream_socket/broadcast.html index edb7ce0fcc..ae9c141e47 100644 --- a/doc/html/boost_asio/reference/basic_stream_socket/broadcast.html +++ b/doc/html/boost_asio/reference/basic_stream_socket/broadcast.html @@ -73,7 +73,7 @@ bool is_set = option.value();
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_stream_socket/bytes_readable.html b/doc/html/boost_asio/reference/basic_stream_socket/bytes_readable.html index a673292a7c..68c894b854 100644 --- a/doc/html/boost_asio/reference/basic_stream_socket/bytes_readable.html +++ b/doc/html/boost_asio/reference/basic_stream_socket/bytes_readable.html @@ -62,7 +62,7 @@ std::size_t bytes_readable = command.get();
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_stream_socket/cancel.html b/doc/html/boost_asio/reference/basic_stream_socket/cancel.html index 2ffda047e6..2b0aa3d87d 100644 --- a/doc/html/boost_asio/reference/basic_stream_socket/cancel.html +++ b/doc/html/boost_asio/reference/basic_stream_socket/cancel.html @@ -41,7 +41,7 @@ void
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_stream_socket/cancel/overload1.html b/doc/html/boost_asio/reference/basic_stream_socket/cancel/overload1.html index 115cbe2ac4..32b7543c32 100644 --- a/doc/html/boost_asio/reference/basic_stream_socket/cancel/overload1.html +++ b/doc/html/boost_asio/reference/basic_stream_socket/cancel/overload1.html @@ -97,7 +97,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_stream_socket/cancel/overload2.html b/doc/html/boost_asio/reference/basic_stream_socket/cancel/overload2.html index d264b53752..45ac1969fc 100644 --- a/doc/html/boost_asio/reference/basic_stream_socket/cancel/overload2.html +++ b/doc/html/boost_asio/reference/basic_stream_socket/cancel/overload2.html @@ -98,7 +98,7 @@
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_stream_socket/close.html b/doc/html/boost_asio/reference/basic_stream_socket/close.html index 752492934e..5cd6c53083 100644 --- a/doc/html/boost_asio/reference/basic_stream_socket/close.html +++ b/doc/html/boost_asio/reference/basic_stream_socket/close.html @@ -41,7 +41,7 @@ void
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_stream_socket/close/overload1.html b/doc/html/boost_asio/reference/basic_stream_socket/close/overload1.html index 7f352a930c..3015c8cdd1 100644 --- a/doc/html/boost_asio/reference/basic_stream_socket/close/overload1.html +++ b/doc/html/boost_asio/reference/basic_stream_socket/close/overload1.html @@ -65,7 +65,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_stream_socket/close/overload2.html b/doc/html/boost_asio/reference/basic_stream_socket/close/overload2.html index 587a30299a..81c35b33ec 100644 --- a/doc/html/boost_asio/reference/basic_stream_socket/close/overload2.html +++ b/doc/html/boost_asio/reference/basic_stream_socket/close/overload2.html @@ -79,7 +79,7 @@ if (ec)
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_stream_socket/connect.html b/doc/html/boost_asio/reference/basic_stream_socket/connect.html index afb209315a..b69798e5df 100644 --- a/doc/html/boost_asio/reference/basic_stream_socket/connect.html +++ b/doc/html/boost_asio/reference/basic_stream_socket/connect.html @@ -43,7 +43,7 @@ void
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_stream_socket/connect/overload1.html b/doc/html/boost_asio/reference/basic_stream_socket/connect/overload1.html index 6334f16840..21a93f2137 100644 --- a/doc/html/boost_asio/reference/basic_stream_socket/connect/overload1.html +++ b/doc/html/boost_asio/reference/basic_stream_socket/connect/overload1.html @@ -84,7 +84,7 @@ socket.connect(endpoint);
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_stream_socket/connect/overload2.html b/doc/html/boost_asio/reference/basic_stream_socket/connect/overload2.html index 659fc74d77..0503dbf18a 100644 --- a/doc/html/boost_asio/reference/basic_stream_socket/connect/overload2.html +++ b/doc/html/boost_asio/reference/basic_stream_socket/connect/overload2.html @@ -81,7 +81,7 @@ if (ec)
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_stream_socket/debug.html b/doc/html/boost_asio/reference/basic_stream_socket/debug.html index 58334d7c2b..a917480e99 100644 --- a/doc/html/boost_asio/reference/basic_stream_socket/debug.html +++ b/doc/html/boost_asio/reference/basic_stream_socket/debug.html @@ -73,7 +73,7 @@ bool is_set = option.value();
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_stream_socket/do_not_route.html b/doc/html/boost_asio/reference/basic_stream_socket/do_not_route.html index 1c7dcb2dc3..f0404cba53 100644 --- a/doc/html/boost_asio/reference/basic_stream_socket/do_not_route.html +++ b/doc/html/boost_asio/reference/basic_stream_socket/do_not_route.html @@ -73,7 +73,7 @@ bool is_set = option.value();
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_stream_socket/enable_connection_aborted.html b/doc/html/boost_asio/reference/basic_stream_socket/enable_connection_aborted.html index e3bf543c5e..aa42695088 100644 --- a/doc/html/boost_asio/reference/basic_stream_socket/enable_connection_aborted.html +++ b/doc/html/boost_asio/reference/basic_stream_socket/enable_connection_aborted.html @@ -75,7 +75,7 @@ bool is_set = option.value();
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_stream_socket/endpoint_type.html b/doc/html/boost_asio/reference/basic_stream_socket/endpoint_type.html index 3cd3536f25..6707f94545 100644 --- a/doc/html/boost_asio/reference/basic_stream_socket/endpoint_type.html +++ b/doc/html/boost_asio/reference/basic_stream_socket/endpoint_type.html @@ -46,7 +46,7 @@ The
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_stream_socket/executor_type.html b/doc/html/boost_asio/reference/basic_stream_socket/executor_type.html index efd10d1fec..dad9b0312e 100644 --- a/doc/html/boost_asio/reference/basic_stream_socket/executor_type.html +++ b/doc/html/boost_asio/reference/basic_stream_socket/executor_type.html @@ -206,7 +206,7 @@ The
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_stream_socket/get_executor.html b/doc/html/boost_asio/reference/basic_stream_socket/get_executor.html index 6a72b2fd77..fbb9ae3618 100644 --- a/doc/html/boost_asio/reference/basic_stream_socket/get_executor.html +++ b/doc/html/boost_asio/reference/basic_stream_socket/get_executor.html @@ -39,7 +39,7 @@ Get
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_stream_socket/get_io_context.html b/doc/html/boost_asio/reference/basic_stream_socket/get_io_context.html index 13bd7b33ea..9b80922ed8 100644 --- a/doc/html/boost_asio/reference/basic_stream_socket/get_io_context.html +++ b/doc/html/boost_asio/reference/basic_stream_socket/get_io_context.html @@ -54,7 +54,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_stream_socket/get_io_service.html b/doc/html/boost_asio/reference/basic_stream_socket/get_io_service.html index 65d4accaf7..fc107432a4 100644 --- a/doc/html/boost_asio/reference/basic_stream_socket/get_io_service.html +++ b/doc/html/boost_asio/reference/basic_stream_socket/get_io_service.html @@ -54,7 +54,7 @@
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_stream_socket/get_option.html b/doc/html/boost_asio/reference/basic_stream_socket/get_option.html index e4c60dfe86..49ccf903e7 100644 --- a/doc/html/boost_asio/reference/basic_stream_socket/get_option.html +++ b/doc/html/boost_asio/reference/basic_stream_socket/get_option.html @@ -47,7 +47,7 @@ void
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_stream_socket/get_option/overload1.html b/doc/html/boost_asio/reference/basic_stream_socket/get_option/overload1.html index 1430de694a..384ef832dc 100644 --- a/doc/html/boost_asio/reference/basic_stream_socket/get_option/overload1.html +++ b/doc/html/boost_asio/reference/basic_stream_socket/get_option/overload1.html @@ -83,7 +83,7 @@ bool is_set = option.value();
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_stream_socket/get_option/overload2.html b/doc/html/boost_asio/reference/basic_stream_socket/get_option/overload2.html index 8e43a39d1b..cd88ad2787 100644 --- a/doc/html/boost_asio/reference/basic_stream_socket/get_option/overload2.html +++ b/doc/html/boost_asio/reference/basic_stream_socket/get_option/overload2.html @@ -80,7 +80,7 @@ bool is_set = option.value();
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_stream_socket/io_control.html b/doc/html/boost_asio/reference/basic_stream_socket/io_control.html index 1afccebb16..36e46e1f6d 100644 --- a/doc/html/boost_asio/reference/basic_stream_socket/io_control.html +++ b/doc/html/boost_asio/reference/basic_stream_socket/io_control.html @@ -47,7 +47,7 @@ void
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_stream_socket/io_control/overload1.html b/doc/html/boost_asio/reference/basic_stream_socket/io_control/overload1.html index 767fd63ae5..cadf799587 100644 --- a/doc/html/boost_asio/reference/basic_stream_socket/io_control/overload1.html +++ b/doc/html/boost_asio/reference/basic_stream_socket/io_control/overload1.html @@ -83,7 +83,7 @@ std::size_t bytes_readable = command.get();
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_stream_socket/io_control/overload2.html b/doc/html/boost_asio/reference/basic_stream_socket/io_control/overload2.html index 5857f67e82..06af9e5e7b 100644 --- a/doc/html/boost_asio/reference/basic_stream_socket/io_control/overload2.html +++ b/doc/html/boost_asio/reference/basic_stream_socket/io_control/overload2.html @@ -80,7 +80,7 @@ std::size_t bytes_readable = command.get();
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_stream_socket/is_open.html b/doc/html/boost_asio/reference/basic_stream_socket/is_open.html index c806c70d51..d181da0d69 100644 --- a/doc/html/boost_asio/reference/basic_stream_socket/is_open.html +++ b/doc/html/boost_asio/reference/basic_stream_socket/is_open.html @@ -39,7 +39,7 @@ Determine
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_stream_socket/keep_alive.html b/doc/html/boost_asio/reference/basic_stream_socket/keep_alive.html index 430e255a4d..ceaf8b7335 100644 --- a/doc/html/boost_asio/reference/basic_stream_socket/keep_alive.html +++ b/doc/html/boost_asio/reference/basic_stream_socket/keep_alive.html @@ -73,7 +73,7 @@ bool is_set = option.value();
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_stream_socket/linger.html b/doc/html/boost_asio/reference/basic_stream_socket/linger.html index 88799b679c..197f8e7d2b 100644 --- a/doc/html/boost_asio/reference/basic_stream_socket/linger.html +++ b/doc/html/boost_asio/reference/basic_stream_socket/linger.html @@ -75,7 +75,7 @@ unsigned short timeout = option.timeout();
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_stream_socket/local_endpoint.html b/doc/html/boost_asio/reference/basic_stream_socket/local_endpoint.html index 529aefb970..927b707cd9 100644 --- a/doc/html/boost_asio/reference/basic_stream_socket/local_endpoint.html +++ b/doc/html/boost_asio/reference/basic_stream_socket/local_endpoint.html @@ -41,7 +41,7 @@ endpoint_type
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_stream_socket/local_endpoint/overload1.html b/doc/html/boost_asio/reference/basic_stream_socket/local_endpoint/overload1.html index 47660d6ec2..a467d7ac9b 100644 --- a/doc/html/boost_asio/reference/basic_stream_socket/local_endpoint/overload1.html +++ b/doc/html/boost_asio/reference/basic_stream_socket/local_endpoint/overload1.html @@ -70,7 +70,7 @@ boost::asio::ip::tcp::endpoint endpoint = socket.local_endpoint();
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_stream_socket/local_endpoint/overload2.html b/doc/html/boost_asio/reference/basic_stream_socket/local_endpoint/overload2.html index 04d1de1307..0f34db52c8 100644 --- a/doc/html/boost_asio/reference/basic_stream_socket/local_endpoint/overload2.html +++ b/doc/html/boost_asio/reference/basic_stream_socket/local_endpoint/overload2.html @@ -77,7 +77,7 @@ if (ec)
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_stream_socket/lowest_layer.html b/doc/html/boost_asio/reference/basic_stream_socket/lowest_layer.html index 16b839fbff..4dbc6a4b1a 100644 --- a/doc/html/boost_asio/reference/basic_stream_socket/lowest_layer.html +++ b/doc/html/boost_asio/reference/basic_stream_socket/lowest_layer.html @@ -43,7 +43,7 @@ Get
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_stream_socket/lowest_layer/overload1.html b/doc/html/boost_asio/reference/basic_stream_socket/lowest_layer/overload1.html index 6e4bb5b621..6f55302d2e 100644 --- a/doc/html/boost_asio/reference/basic_stream_socket/lowest_layer/overload1.html +++ b/doc/html/boost_asio/reference/basic_stream_socket/lowest_layer/overload1.html @@ -52,7 +52,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_stream_socket/lowest_layer/overload2.html b/doc/html/boost_asio/reference/basic_stream_socket/lowest_layer/overload2.html index c5f3c359b9..3d918450ac 100644 --- a/doc/html/boost_asio/reference/basic_stream_socket/lowest_layer/overload2.html +++ b/doc/html/boost_asio/reference/basic_stream_socket/lowest_layer/overload2.html @@ -52,7 +52,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_stream_socket/lowest_layer_type.html b/doc/html/boost_asio/reference/basic_stream_socket/lowest_layer_type.html index 1c347f03b9..38b7325eed 100644 --- a/doc/html/boost_asio/reference/basic_stream_socket/lowest_layer_type.html +++ b/doc/html/boost_asio/reference/basic_stream_socket/lowest_layer_type.html @@ -874,7 +874,7 @@ A
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_stream_socket/max_connections.html b/doc/html/boost_asio/reference/basic_stream_socket/max_connections.html index 4f43ab950d..9582360810 100644 --- a/doc/html/boost_asio/reference/basic_stream_socket/max_connections.html +++ b/doc/html/boost_asio/reference/basic_stream_socket/max_connections.html @@ -40,7 +40,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_stream_socket/max_listen_connections.html b/doc/html/boost_asio/reference/basic_stream_socket/max_listen_connections.html index 3aaf42b7ce..469398626d 100644 --- a/doc/html/boost_asio/reference/basic_stream_socket/max_listen_connections.html +++ b/doc/html/boost_asio/reference/basic_stream_socket/max_listen_connections.html @@ -39,7 +39,7 @@ The
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_stream_socket/message_do_not_route.html b/doc/html/boost_asio/reference/basic_stream_socket/message_do_not_route.html index 21978d8a9a..5d13c9e015 100644 --- a/doc/html/boost_asio/reference/basic_stream_socket/message_do_not_route.html +++ b/doc/html/boost_asio/reference/basic_stream_socket/message_do_not_route.html @@ -39,7 +39,7 @@ Specify
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_stream_socket/message_end_of_record.html b/doc/html/boost_asio/reference/basic_stream_socket/message_end_of_record.html index 6505fd9269..48c2f8f47e 100644 --- a/doc/html/boost_asio/reference/basic_stream_socket/message_end_of_record.html +++ b/doc/html/boost_asio/reference/basic_stream_socket/message_end_of_record.html @@ -39,7 +39,7 @@ Specifies
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_stream_socket/message_flags.html b/doc/html/boost_asio/reference/basic_stream_socket/message_flags.html index 0ba31a7104..40731e53db 100644 --- a/doc/html/boost_asio/reference/basic_stream_socket/message_flags.html +++ b/doc/html/boost_asio/reference/basic_stream_socket/message_flags.html @@ -49,7 +49,7 @@ Bitmask
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_stream_socket/message_out_of_band.html b/doc/html/boost_asio/reference/basic_stream_socket/message_out_of_band.html index 1fcbd8d08d..27a6694884 100644 --- a/doc/html/boost_asio/reference/basic_stream_socket/message_out_of_band.html +++ b/doc/html/boost_asio/reference/basic_stream_socket/message_out_of_band.html @@ -39,7 +39,7 @@ Process
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_stream_socket/message_peek.html b/doc/html/boost_asio/reference/basic_stream_socket/message_peek.html index 9d2278c35d..77d26959d0 100644 --- a/doc/html/boost_asio/reference/basic_stream_socket/message_peek.html +++ b/doc/html/boost_asio/reference/basic_stream_socket/message_peek.html @@ -39,7 +39,7 @@ Peek
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_stream_socket/native_handle.html b/doc/html/boost_asio/reference/basic_stream_socket/native_handle.html index dd868f6f0a..2a54399db0 100644 --- a/doc/html/boost_asio/reference/basic_stream_socket/native_handle.html +++ b/doc/html/boost_asio/reference/basic_stream_socket/native_handle.html @@ -44,7 +44,7 @@ Get
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_stream_socket/native_handle_type.html b/doc/html/boost_asio/reference/basic_stream_socket/native_handle_type.html index 139555dc00..994ac83efb 100644 --- a/doc/html/boost_asio/reference/basic_stream_socket/native_handle_type.html +++ b/doc/html/boost_asio/reference/basic_stream_socket/native_handle_type.html @@ -46,7 +46,7 @@ The
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_stream_socket/native_non_blocking.html b/doc/html/boost_asio/reference/basic_stream_socket/native_non_blocking.html index 671ca403f6..a2233bc9f0 100644 --- a/doc/html/boost_asio/reference/basic_stream_socket/native_non_blocking.html +++ b/doc/html/boost_asio/reference/basic_stream_socket/native_non_blocking.html @@ -49,7 +49,7 @@ void
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_stream_socket/native_non_blocking/overload1.html b/doc/html/boost_asio/reference/basic_stream_socket/native_non_blocking/overload1.html index cd0dd18dad..f008873221 100644 --- a/doc/html/boost_asio/reference/basic_stream_socket/native_non_blocking/overload1.html +++ b/doc/html/boost_asio/reference/basic_stream_socket/native_non_blocking/overload1.html @@ -137,7 +137,7 @@ void async_sendfile(tcp::socket& sock, int fd, Handler h)
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_stream_socket/native_non_blocking/overload2.html b/doc/html/boost_asio/reference/basic_stream_socket/native_non_blocking/overload2.html index 246fe4d0e6..c92def2029 100644 --- a/doc/html/boost_asio/reference/basic_stream_socket/native_non_blocking/overload2.html +++ b/doc/html/boost_asio/reference/basic_stream_socket/native_non_blocking/overload2.html @@ -150,7 +150,7 @@ void async_sendfile(tcp::socket& sock, int fd, Handler h)
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_stream_socket/native_non_blocking/overload3.html b/doc/html/boost_asio/reference/basic_stream_socket/native_non_blocking/overload3.html index 2399cbac56..86947089dc 100644 --- a/doc/html/boost_asio/reference/basic_stream_socket/native_non_blocking/overload3.html +++ b/doc/html/boost_asio/reference/basic_stream_socket/native_non_blocking/overload3.html @@ -142,7 +142,7 @@ void async_sendfile(tcp::socket& sock, int fd, Handler h)
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_stream_socket/non_blocking.html b/doc/html/boost_asio/reference/basic_stream_socket/non_blocking.html index 38f3e1aa8b..a10958ebf0 100644 --- a/doc/html/boost_asio/reference/basic_stream_socket/non_blocking.html +++ b/doc/html/boost_asio/reference/basic_stream_socket/non_blocking.html @@ -49,7 +49,7 @@ void
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_stream_socket/non_blocking/overload1.html b/doc/html/boost_asio/reference/basic_stream_socket/non_blocking/overload1.html index d0a8502aa8..174ab0ed6e 100644 --- a/doc/html/boost_asio/reference/basic_stream_socket/non_blocking/overload1.html +++ b/doc/html/boost_asio/reference/basic_stream_socket/non_blocking/overload1.html @@ -57,7 +57,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_stream_socket/non_blocking/overload2.html b/doc/html/boost_asio/reference/basic_stream_socket/non_blocking/overload2.html index 81b809b63d..9fba890e67 100644 --- a/doc/html/boost_asio/reference/basic_stream_socket/non_blocking/overload2.html +++ b/doc/html/boost_asio/reference/basic_stream_socket/non_blocking/overload2.html @@ -76,7 +76,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_stream_socket/non_blocking/overload3.html b/doc/html/boost_asio/reference/basic_stream_socket/non_blocking/overload3.html index ba3093e157..d05376f14c 100644 --- a/doc/html/boost_asio/reference/basic_stream_socket/non_blocking/overload3.html +++ b/doc/html/boost_asio/reference/basic_stream_socket/non_blocking/overload3.html @@ -68,7 +68,7 @@
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_stream_socket/open.html b/doc/html/boost_asio/reference/basic_stream_socket/open.html index a67d9c8faa..f13de8a853 100644 --- a/doc/html/boost_asio/reference/basic_stream_socket/open.html +++ b/doc/html/boost_asio/reference/basic_stream_socket/open.html @@ -43,7 +43,7 @@ void
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_stream_socket/open/overload1.html b/doc/html/boost_asio/reference/basic_stream_socket/open/overload1.html index 7c5ab4e829..af76f38dd6 100644 --- a/doc/html/boost_asio/reference/basic_stream_socket/open/overload1.html +++ b/doc/html/boost_asio/reference/basic_stream_socket/open/overload1.html @@ -75,7 +75,7 @@ socket.open(boost::asio::ip::tcp::v4());
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_stream_socket/open/overload2.html b/doc/html/boost_asio/reference/basic_stream_socket/open/overload2.html index deaca7a85e..19d5e5d263 100644 --- a/doc/html/boost_asio/reference/basic_stream_socket/open/overload2.html +++ b/doc/html/boost_asio/reference/basic_stream_socket/open/overload2.html @@ -72,7 +72,7 @@ if (ec)
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_stream_socket/operator_eq_.html b/doc/html/boost_asio/reference/basic_stream_socket/operator_eq_.html index fb98644116..94f288dec0 100644 --- a/doc/html/boost_asio/reference/basic_stream_socket/operator_eq_.html +++ b/doc/html/boost_asio/reference/basic_stream_socket/operator_eq_.html @@ -49,7 +49,7 @@ enable_if< is_convertible< Protocol1, Protocol >::value, basic_stream_s
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_stream_socket/operator_eq_/overload1.html b/doc/html/boost_asio/reference/basic_stream_socket/operator_eq_/overload1.html index 356fa24c6c..14d2446a8c 100644 --- a/doc/html/boost_asio/reference/basic_stream_socket/operator_eq_/overload1.html +++ b/doc/html/boost_asio/reference/basic_stream_socket/operator_eq_/overload1.html @@ -62,7 +62,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_stream_socket/operator_eq_/overload2.html b/doc/html/boost_asio/reference/basic_stream_socket/operator_eq_/overload2.html index 0ecd1645e2..1ba8a85944 100644 --- a/doc/html/boost_asio/reference/basic_stream_socket/operator_eq_/overload2.html +++ b/doc/html/boost_asio/reference/basic_stream_socket/operator_eq_/overload2.html @@ -64,7 +64,7 @@ enable_if< is_convertible< Protocol1, Protocol >::value, basic_stream_s
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_stream_socket/out_of_band_inline.html b/doc/html/boost_asio/reference/basic_stream_socket/out_of_band_inline.html index 263ad176d2..332fa7a146 100644 --- a/doc/html/boost_asio/reference/basic_stream_socket/out_of_band_inline.html +++ b/doc/html/boost_asio/reference/basic_stream_socket/out_of_band_inline.html @@ -73,7 +73,7 @@ bool value = option.value();
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_stream_socket/protocol_type.html b/doc/html/boost_asio/reference/basic_stream_socket/protocol_type.html index 0c59bb5dab..1fe61c0b70 100644 --- a/doc/html/boost_asio/reference/basic_stream_socket/protocol_type.html +++ b/doc/html/boost_asio/reference/basic_stream_socket/protocol_type.html @@ -46,7 +46,7 @@ The
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_stream_socket/read_some.html b/doc/html/boost_asio/reference/basic_stream_socket/read_some.html index 07a94f9b86..444d8244d8 100644 --- a/doc/html/boost_asio/reference/basic_stream_socket/read_some.html +++ b/doc/html/boost_asio/reference/basic_stream_socket/read_some.html @@ -47,7 +47,7 @@ std::size_t
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_stream_socket/read_some/overload1.html b/doc/html/boost_asio/reference/basic_stream_socket/read_some/overload1.html index 756464150c..63d6ee39b1 100644 --- a/doc/html/boost_asio/reference/basic_stream_socket/read_some/overload1.html +++ b/doc/html/boost_asio/reference/basic_stream_socket/read_some/overload1.html @@ -103,7 +103,7 @@ std::size_t read_some(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_stream_socket/read_some/overload2.html b/doc/html/boost_asio/reference/basic_stream_socket/read_some/overload2.html index ffee96af78..eb0ca1a2b3 100644 --- a/doc/html/boost_asio/reference/basic_stream_socket/read_some/overload2.html +++ b/doc/html/boost_asio/reference/basic_stream_socket/read_some/overload2.html @@ -79,7 +79,7 @@ std::size_t read_some(
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_stream_socket/receive.html b/doc/html/boost_asio/reference/basic_stream_socket/receive.html index 2975f98c5c..fe7fb26aa7 100644 --- a/doc/html/boost_asio/reference/basic_stream_socket/receive.html +++ b/doc/html/boost_asio/reference/basic_stream_socket/receive.html @@ -58,7 +58,7 @@ std::size_t
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_stream_socket/receive/overload1.html b/doc/html/boost_asio/reference/basic_stream_socket/receive/overload1.html index c3c39c0818..68ea31fb57 100644 --- a/doc/html/boost_asio/reference/basic_stream_socket/receive/overload1.html +++ b/doc/html/boost_asio/reference/basic_stream_socket/receive/overload1.html @@ -103,7 +103,7 @@ std::size_t receive(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_stream_socket/receive/overload2.html b/doc/html/boost_asio/reference/basic_stream_socket/receive/overload2.html index 007f118792..7702efcc6e 100644 --- a/doc/html/boost_asio/reference/basic_stream_socket/receive/overload2.html +++ b/doc/html/boost_asio/reference/basic_stream_socket/receive/overload2.html @@ -108,7 +108,7 @@ std::size_t receive(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_stream_socket/receive/overload3.html b/doc/html/boost_asio/reference/basic_stream_socket/receive/overload3.html index c0f68084ff..00ea0b2867 100644 --- a/doc/html/boost_asio/reference/basic_stream_socket/receive/overload3.html +++ b/doc/html/boost_asio/reference/basic_stream_socket/receive/overload3.html @@ -84,7 +84,7 @@ std::size_t receive(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_stream_socket/receive_buffer_size.html b/doc/html/boost_asio/reference/basic_stream_socket/receive_buffer_size.html index 2f0bcc904f..c74691d8e8 100644 --- a/doc/html/boost_asio/reference/basic_stream_socket/receive_buffer_size.html +++ b/doc/html/boost_asio/reference/basic_stream_socket/receive_buffer_size.html @@ -73,7 +73,7 @@ int size = option.value();
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_stream_socket/receive_low_watermark.html b/doc/html/boost_asio/reference/basic_stream_socket/receive_low_watermark.html index b0a658fc0d..40b1a65558 100644 --- a/doc/html/boost_asio/reference/basic_stream_socket/receive_low_watermark.html +++ b/doc/html/boost_asio/reference/basic_stream_socket/receive_low_watermark.html @@ -73,7 +73,7 @@ int size = option.value();
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_stream_socket/release.html b/doc/html/boost_asio/reference/basic_stream_socket/release.html index 0d64d3640e..b30978805e 100644 --- a/doc/html/boost_asio/reference/basic_stream_socket/release.html +++ b/doc/html/boost_asio/reference/basic_stream_socket/release.html @@ -41,7 +41,7 @@ native_handle_type
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_stream_socket/release/overload1.html b/doc/html/boost_asio/reference/basic_stream_socket/release/overload1.html index 851d951c01..9c8665010b 100644 --- a/doc/html/boost_asio/reference/basic_stream_socket/release/overload1.html +++ b/doc/html/boost_asio/reference/basic_stream_socket/release/overload1.html @@ -66,7 +66,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_stream_socket/release/overload2.html b/doc/html/boost_asio/reference/basic_stream_socket/release/overload2.html index a2778b2e44..972427e27a 100644 --- a/doc/html/boost_asio/reference/basic_stream_socket/release/overload2.html +++ b/doc/html/boost_asio/reference/basic_stream_socket/release/overload2.html @@ -67,7 +67,7 @@
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_stream_socket/remote_endpoint.html b/doc/html/boost_asio/reference/basic_stream_socket/remote_endpoint.html index ecd5580875..84469742fa 100644 --- a/doc/html/boost_asio/reference/basic_stream_socket/remote_endpoint.html +++ b/doc/html/boost_asio/reference/basic_stream_socket/remote_endpoint.html @@ -41,7 +41,7 @@ endpoint_type
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_stream_socket/remote_endpoint/overload1.html b/doc/html/boost_asio/reference/basic_stream_socket/remote_endpoint/overload1.html index b2b7fbe74a..d1771a1fb4 100644 --- a/doc/html/boost_asio/reference/basic_stream_socket/remote_endpoint/overload1.html +++ b/doc/html/boost_asio/reference/basic_stream_socket/remote_endpoint/overload1.html @@ -70,7 +70,7 @@ boost::asio::ip::tcp::endpoint endpoint = socket.remote_endpoint();
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_stream_socket/remote_endpoint/overload2.html b/doc/html/boost_asio/reference/basic_stream_socket/remote_endpoint/overload2.html index 907e2fbfa1..5391437534 100644 --- a/doc/html/boost_asio/reference/basic_stream_socket/remote_endpoint/overload2.html +++ b/doc/html/boost_asio/reference/basic_stream_socket/remote_endpoint/overload2.html @@ -77,7 +77,7 @@ if (ec)
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_stream_socket/reuse_address.html b/doc/html/boost_asio/reference/basic_stream_socket/reuse_address.html index 0ea8aaafef..9d6a047467 100644 --- a/doc/html/boost_asio/reference/basic_stream_socket/reuse_address.html +++ b/doc/html/boost_asio/reference/basic_stream_socket/reuse_address.html @@ -74,7 +74,7 @@ bool is_set = option.value();
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_stream_socket/send.html b/doc/html/boost_asio/reference/basic_stream_socket/send.html index 3f3483f9a6..9f5e599dc7 100644 --- a/doc/html/boost_asio/reference/basic_stream_socket/send.html +++ b/doc/html/boost_asio/reference/basic_stream_socket/send.html @@ -55,7 +55,7 @@ std::size_t
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_stream_socket/send/overload1.html b/doc/html/boost_asio/reference/basic_stream_socket/send/overload1.html index 59174f626e..0eb16c66d3 100644 --- a/doc/html/boost_asio/reference/basic_stream_socket/send/overload1.html +++ b/doc/html/boost_asio/reference/basic_stream_socket/send/overload1.html @@ -102,7 +102,7 @@ std::size_t send(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_stream_socket/send/overload2.html b/doc/html/boost_asio/reference/basic_stream_socket/send/overload2.html index 24646af38b..c6c08346b7 100644 --- a/doc/html/boost_asio/reference/basic_stream_socket/send/overload2.html +++ b/doc/html/boost_asio/reference/basic_stream_socket/send/overload2.html @@ -107,7 +107,7 @@ std::size_t send(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_stream_socket/send/overload3.html b/doc/html/boost_asio/reference/basic_stream_socket/send/overload3.html index 464ec92dcc..561c96b20b 100644 --- a/doc/html/boost_asio/reference/basic_stream_socket/send/overload3.html +++ b/doc/html/boost_asio/reference/basic_stream_socket/send/overload3.html @@ -84,7 +84,7 @@ std::size_t send(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_stream_socket/send_buffer_size.html b/doc/html/boost_asio/reference/basic_stream_socket/send_buffer_size.html index 763986d4c3..f600abe633 100644 --- a/doc/html/boost_asio/reference/basic_stream_socket/send_buffer_size.html +++ b/doc/html/boost_asio/reference/basic_stream_socket/send_buffer_size.html @@ -73,7 +73,7 @@ int size = option.value();
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_stream_socket/send_low_watermark.html b/doc/html/boost_asio/reference/basic_stream_socket/send_low_watermark.html index 8e5db2116b..f4f5d3d441 100644 --- a/doc/html/boost_asio/reference/basic_stream_socket/send_low_watermark.html +++ b/doc/html/boost_asio/reference/basic_stream_socket/send_low_watermark.html @@ -73,7 +73,7 @@ int size = option.value();
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_stream_socket/set_option.html b/doc/html/boost_asio/reference/basic_stream_socket/set_option.html index 469fce9277..39af33c922 100644 --- a/doc/html/boost_asio/reference/basic_stream_socket/set_option.html +++ b/doc/html/boost_asio/reference/basic_stream_socket/set_option.html @@ -47,7 +47,7 @@ void
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_stream_socket/set_option/overload1.html b/doc/html/boost_asio/reference/basic_stream_socket/set_option/overload1.html index a83fd8b23b..9eb739c36f 100644 --- a/doc/html/boost_asio/reference/basic_stream_socket/set_option/overload1.html +++ b/doc/html/boost_asio/reference/basic_stream_socket/set_option/overload1.html @@ -82,7 +82,7 @@ socket.set_option(option);
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_stream_socket/set_option/overload2.html b/doc/html/boost_asio/reference/basic_stream_socket/set_option/overload2.html index 71886b63e8..624f1659c4 100644 --- a/doc/html/boost_asio/reference/basic_stream_socket/set_option/overload2.html +++ b/doc/html/boost_asio/reference/basic_stream_socket/set_option/overload2.html @@ -79,7 +79,7 @@ if (ec)
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_stream_socket/shutdown.html b/doc/html/boost_asio/reference/basic_stream_socket/shutdown.html index e30b739e0a..b4e6115594 100644 --- a/doc/html/boost_asio/reference/basic_stream_socket/shutdown.html +++ b/doc/html/boost_asio/reference/basic_stream_socket/shutdown.html @@ -43,7 +43,7 @@ void
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_stream_socket/shutdown/overload1.html b/doc/html/boost_asio/reference/basic_stream_socket/shutdown/overload1.html index 6f31de915c..e5503b227f 100644 --- a/doc/html/boost_asio/reference/basic_stream_socket/shutdown/overload1.html +++ b/doc/html/boost_asio/reference/basic_stream_socket/shutdown/overload1.html @@ -80,7 +80,7 @@ socket.shutdown(boost::asio::ip::tcp::socket::shutdown_send);
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_stream_socket/shutdown/overload2.html b/doc/html/boost_asio/reference/basic_stream_socket/shutdown/overload2.html index 251cb28222..3690b16dfc 100644 --- a/doc/html/boost_asio/reference/basic_stream_socket/shutdown/overload2.html +++ b/doc/html/boost_asio/reference/basic_stream_socket/shutdown/overload2.html @@ -77,7 +77,7 @@ if (ec)
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_stream_socket/shutdown_type.html b/doc/html/boost_asio/reference/basic_stream_socket/shutdown_type.html index 0c9b8e60d7..3d7b2bd3a6 100644 --- a/doc/html/boost_asio/reference/basic_stream_socket/shutdown_type.html +++ b/doc/html/boost_asio/reference/basic_stream_socket/shutdown_type.html @@ -65,7 +65,7 @@ Different
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_stream_socket/wait.html b/doc/html/boost_asio/reference/basic_stream_socket/wait.html index 10217e559c..29fd60fb93 100644 --- a/doc/html/boost_asio/reference/basic_stream_socket/wait.html +++ b/doc/html/boost_asio/reference/basic_stream_socket/wait.html @@ -44,7 +44,7 @@ void
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_stream_socket/wait/overload1.html b/doc/html/boost_asio/reference/basic_stream_socket/wait/overload1.html index e83aac5257..d5c859e98b 100644 --- a/doc/html/boost_asio/reference/basic_stream_socket/wait/overload1.html +++ b/doc/html/boost_asio/reference/basic_stream_socket/wait/overload1.html @@ -68,7 +68,7 @@ socket.wait(boost::asio::ip::tcp::socket::wait_read);
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_stream_socket/wait/overload2.html b/doc/html/boost_asio/reference/basic_stream_socket/wait/overload2.html index b3c9c24a9b..7b0afcf61b 100644 --- a/doc/html/boost_asio/reference/basic_stream_socket/wait/overload2.html +++ b/doc/html/boost_asio/reference/basic_stream_socket/wait/overload2.html @@ -74,7 +74,7 @@ socket.wait(boost::asio::ip::tcp::socket::wait_read, ec);
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_stream_socket/wait_type.html b/doc/html/boost_asio/reference/basic_stream_socket/wait_type.html index 6260edfdc0..dd270d72f2 100644 --- a/doc/html/boost_asio/reference/basic_stream_socket/wait_type.html +++ b/doc/html/boost_asio/reference/basic_stream_socket/wait_type.html @@ -68,7 +68,7 @@ Wait
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_stream_socket/write_some.html b/doc/html/boost_asio/reference/basic_stream_socket/write_some.html index 66513c0e8d..c39058f7a5 100644 --- a/doc/html/boost_asio/reference/basic_stream_socket/write_some.html +++ b/doc/html/boost_asio/reference/basic_stream_socket/write_some.html @@ -47,7 +47,7 @@ std::size_t
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_stream_socket/write_some/overload1.html b/doc/html/boost_asio/reference/basic_stream_socket/write_some/overload1.html index f6f026f3a5..522a102b22 100644 --- a/doc/html/boost_asio/reference/basic_stream_socket/write_some/overload1.html +++ b/doc/html/boost_asio/reference/basic_stream_socket/write_some/overload1.html @@ -103,7 +103,7 @@ std::size_t write_some(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_stream_socket/write_some/overload2.html b/doc/html/boost_asio/reference/basic_stream_socket/write_some/overload2.html index bf7afe442b..c0fb3065f2 100644 --- a/doc/html/boost_asio/reference/basic_stream_socket/write_some/overload2.html +++ b/doc/html/boost_asio/reference/basic_stream_socket/write_some/overload2.html @@ -79,7 +79,7 @@ std::size_t write_some(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_streambuf.html b/doc/html/boost_asio/reference/basic_streambuf.html index 52859dddd9..d8f581cc48 100644 --- a/doc/html/boost_asio/reference/basic_streambuf.html +++ b/doc/html/boost_asio/reference/basic_streambuf.html @@ -355,7 +355,7 @@ is >> s;
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_streambuf/basic_streambuf.html b/doc/html/boost_asio/reference/basic_streambuf/basic_streambuf.html index a80c76050f..acaed045ab 100644 --- a/doc/html/boost_asio/reference/basic_streambuf/basic_streambuf.html +++ b/doc/html/boost_asio/reference/basic_streambuf/basic_streambuf.html @@ -43,7 +43,7 @@ Construct
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_streambuf/capacity.html b/doc/html/boost_asio/reference/basic_streambuf/capacity.html index 7af5aa1023..7ec254f4c5 100644 --- a/doc/html/boost_asio/reference/basic_streambuf/capacity.html +++ b/doc/html/boost_asio/reference/basic_streambuf/capacity.html @@ -45,7 +45,7 @@ Get
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_streambuf/commit.html b/doc/html/boost_asio/reference/basic_streambuf/commit.html index 594cbab58d..2e52142765 100644 --- a/doc/html/boost_asio/reference/basic_streambuf/commit.html +++ b/doc/html/boost_asio/reference/basic_streambuf/commit.html @@ -54,7 +54,7 @@ Move characters
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_streambuf/const_buffers_type.html b/doc/html/boost_asio/reference/basic_streambuf/const_buffers_type.html index 043a8b7545..2c4a335050 100644 --- a/doc/html/boost_asio/reference/basic_streambuf/const_buffers_type.html +++ b/doc/html/boost_asio/reference/basic_streambuf/const_buffers_type.html @@ -46,7 +46,7 @@ The
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_streambuf/consume.html b/doc/html/boost_asio/reference/basic_streambuf/consume.html index 61145de9ca..5487140992 100644 --- a/doc/html/boost_asio/reference/basic_streambuf/consume.html +++ b/doc/html/boost_asio/reference/basic_streambuf/consume.html @@ -48,7 +48,7 @@ Remove
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_streambuf/data.html b/doc/html/boost_asio/reference/basic_streambuf/data.html index 6dd1a0b3fe..c4f0ec2397 100644 --- a/doc/html/boost_asio/reference/basic_streambuf/data.html +++ b/doc/html/boost_asio/reference/basic_streambuf/data.html @@ -53,7 +53,7 @@ Get a list
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_streambuf/max_size.html b/doc/html/boost_asio/reference/basic_streambuf/max_size.html index b19d1807e8..5298257503 100644 --- a/doc/html/boost_asio/reference/basic_streambuf/max_size.html +++ b/doc/html/boost_asio/reference/basic_streambuf/max_size.html @@ -45,7 +45,7 @@ Get
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_streambuf/mutable_buffers_type.html b/doc/html/boost_asio/reference/basic_streambuf/mutable_buffers_type.html index d716ee46c2..457a7bf760 100644 --- a/doc/html/boost_asio/reference/basic_streambuf/mutable_buffers_type.html +++ b/doc/html/boost_asio/reference/basic_streambuf/mutable_buffers_type.html @@ -46,7 +46,7 @@ The
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_streambuf/overflow.html b/doc/html/boost_asio/reference/basic_streambuf/overflow.html index e11844b8bd..7b4d81c747 100644 --- a/doc/html/boost_asio/reference/basic_streambuf/overflow.html +++ b/doc/html/boost_asio/reference/basic_streambuf/overflow.html @@ -43,7 +43,7 @@ Override
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_streambuf/prepare.html b/doc/html/boost_asio/reference/basic_streambuf/prepare.html index 5561ccef71..39ce8f910e 100644 --- a/doc/html/boost_asio/reference/basic_streambuf/prepare.html +++ b/doc/html/boost_asio/reference/basic_streambuf/prepare.html @@ -72,7 +72,7 @@ Get a
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_streambuf/reserve.html b/doc/html/boost_asio/reference/basic_streambuf/reserve.html index 59c25b3630..72528b2f95 100644 --- a/doc/html/boost_asio/reference/basic_streambuf/reserve.html +++ b/doc/html/boost_asio/reference/basic_streambuf/reserve.html @@ -35,7 +35,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_streambuf/size.html b/doc/html/boost_asio/reference/basic_streambuf/size.html index 7cc9666bf3..0d82481966 100644 --- a/doc/html/boost_asio/reference/basic_streambuf/size.html +++ b/doc/html/boost_asio/reference/basic_streambuf/size.html @@ -54,7 +54,7 @@ while (i != bufs.end())
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_streambuf/underflow.html b/doc/html/boost_asio/reference/basic_streambuf/underflow.html index e28bd1d8d1..3efcbf653b 100644 --- a/doc/html/boost_asio/reference/basic_streambuf/underflow.html +++ b/doc/html/boost_asio/reference/basic_streambuf/underflow.html @@ -39,7 +39,7 @@ Override
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_streambuf_ref.html b/doc/html/boost_asio/reference/basic_streambuf_ref.html index 6fc28e83db..4e0c9936c7 100644 --- a/doc/html/boost_asio/reference/basic_streambuf_ref.html +++ b/doc/html/boost_asio/reference/basic_streambuf_ref.html @@ -223,7 +223,7 @@ class basic_streambuf_ref
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_streambuf_ref/basic_streambuf_ref.html b/doc/html/boost_asio/reference/basic_streambuf_ref/basic_streambuf_ref.html index 1f539aa5ed..6335effa7b 100644 --- a/doc/html/boost_asio/reference/basic_streambuf_ref/basic_streambuf_ref.html +++ b/doc/html/boost_asio/reference/basic_streambuf_ref/basic_streambuf_ref.html @@ -54,7 +54,7 @@ Construct
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_streambuf_ref/basic_streambuf_ref/overload1.html b/doc/html/boost_asio/reference/basic_streambuf_ref/basic_streambuf_ref/overload1.html index b539adaaaa..1398c519eb 100644 --- a/doc/html/boost_asio/reference/basic_streambuf_ref/basic_streambuf_ref/overload1.html +++ b/doc/html/boost_asio/reference/basic_streambuf_ref/basic_streambuf_ref/overload1.html @@ -38,7 +38,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_streambuf_ref/basic_streambuf_ref/overload2.html b/doc/html/boost_asio/reference/basic_streambuf_ref/basic_streambuf_ref/overload2.html index c1b211ab0b..977ac0753b 100644 --- a/doc/html/boost_asio/reference/basic_streambuf_ref/basic_streambuf_ref/overload2.html +++ b/doc/html/boost_asio/reference/basic_streambuf_ref/basic_streambuf_ref/overload2.html @@ -36,7 +36,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_streambuf_ref/basic_streambuf_ref/overload3.html b/doc/html/boost_asio/reference/basic_streambuf_ref/basic_streambuf_ref/overload3.html index 353b21bf64..fbc66dd4b1 100644 --- a/doc/html/boost_asio/reference/basic_streambuf_ref/basic_streambuf_ref/overload3.html +++ b/doc/html/boost_asio/reference/basic_streambuf_ref/basic_streambuf_ref/overload3.html @@ -36,7 +36,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_streambuf_ref/capacity.html b/doc/html/boost_asio/reference/basic_streambuf_ref/capacity.html index eba7c7dd27..ae240fa96e 100644 --- a/doc/html/boost_asio/reference/basic_streambuf_ref/capacity.html +++ b/doc/html/boost_asio/reference/basic_streambuf_ref/capacity.html @@ -36,7 +36,7 @@ Get
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_streambuf_ref/commit.html b/doc/html/boost_asio/reference/basic_streambuf_ref/commit.html index d6b99df1c1..4fa66bbb07 100644 --- a/doc/html/boost_asio/reference/basic_streambuf_ref/commit.html +++ b/doc/html/boost_asio/reference/basic_streambuf_ref/commit.html @@ -37,7 +37,7 @@ Move
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_streambuf_ref/const_buffers_type.html b/doc/html/boost_asio/reference/basic_streambuf_ref/const_buffers_type.html index 6eef006f16..b4ed5a4de1 100644 --- a/doc/html/boost_asio/reference/basic_streambuf_ref/const_buffers_type.html +++ b/doc/html/boost_asio/reference/basic_streambuf_ref/const_buffers_type.html @@ -355,7 +355,7 @@ is >> s;
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_streambuf_ref/consume.html b/doc/html/boost_asio/reference/basic_streambuf_ref/consume.html index 36bc772989..bb7750e675 100644 --- a/doc/html/boost_asio/reference/basic_streambuf_ref/consume.html +++ b/doc/html/boost_asio/reference/basic_streambuf_ref/consume.html @@ -37,7 +37,7 @@ Remove
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_streambuf_ref/data.html b/doc/html/boost_asio/reference/basic_streambuf_ref/data.html index f26e0f5690..636ee47da6 100644 --- a/doc/html/boost_asio/reference/basic_streambuf_ref/data.html +++ b/doc/html/boost_asio/reference/basic_streambuf_ref/data.html @@ -36,7 +36,7 @@ Get
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_streambuf_ref/max_size.html b/doc/html/boost_asio/reference/basic_streambuf_ref/max_size.html index d030b8aead..bfd084c685 100644 --- a/doc/html/boost_asio/reference/basic_streambuf_ref/max_size.html +++ b/doc/html/boost_asio/reference/basic_streambuf_ref/max_size.html @@ -36,7 +36,7 @@ Get
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_streambuf_ref/mutable_buffers_type.html b/doc/html/boost_asio/reference/basic_streambuf_ref/mutable_buffers_type.html index 4d40c9badd..5f5c8327f5 100644 --- a/doc/html/boost_asio/reference/basic_streambuf_ref/mutable_buffers_type.html +++ b/doc/html/boost_asio/reference/basic_streambuf_ref/mutable_buffers_type.html @@ -355,7 +355,7 @@ is >> s;
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_streambuf_ref/prepare.html b/doc/html/boost_asio/reference/basic_streambuf_ref/prepare.html index a4774e54d1..69223ee5fc 100644 --- a/doc/html/boost_asio/reference/basic_streambuf_ref/prepare.html +++ b/doc/html/boost_asio/reference/basic_streambuf_ref/prepare.html @@ -37,7 +37,7 @@ Get
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_streambuf_ref/size.html b/doc/html/boost_asio/reference/basic_streambuf_ref/size.html index 06a498d6e7..5e57457781 100644 --- a/doc/html/boost_asio/reference/basic_streambuf_ref/size.html +++ b/doc/html/boost_asio/reference/basic_streambuf_ref/size.html @@ -36,7 +36,7 @@ Get
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_waitable_timer.html b/doc/html/boost_asio/reference/basic_waitable_timer.html index 45761c723c..d739fd3234 100644 --- a/doc/html/boost_asio/reference/basic_waitable_timer.html +++ b/doc/html/boost_asio/reference/basic_waitable_timer.html @@ -472,7 +472,7 @@ void on_timeout(const boost::system::error_code& e)
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_waitable_timer/_basic_waitable_timer.html b/doc/html/boost_asio/reference/basic_waitable_timer/_basic_waitable_timer.html index dad255129f..7de13b3584 100644 --- a/doc/html/boost_asio/reference/basic_waitable_timer/_basic_waitable_timer.html +++ b/doc/html/boost_asio/reference/basic_waitable_timer/_basic_waitable_timer.html @@ -40,7 +40,7 @@ Destroys
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_waitable_timer/async_wait.html b/doc/html/boost_asio/reference/basic_waitable_timer/async_wait.html index bba46a2d5b..1458b88842 100644 --- a/doc/html/boost_asio/reference/basic_waitable_timer/async_wait.html +++ b/doc/html/boost_asio/reference/basic_waitable_timer/async_wait.html @@ -83,7 +83,7 @@ Start
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_waitable_timer/basic_waitable_timer.html b/doc/html/boost_asio/reference/basic_waitable_timer/basic_waitable_timer.html index b66c83d26f..5216b58ad7 100644 --- a/doc/html/boost_asio/reference/basic_waitable_timer/basic_waitable_timer.html +++ b/doc/html/boost_asio/reference/basic_waitable_timer/basic_waitable_timer.html @@ -61,7 +61,7 @@ Constructor.
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_waitable_timer/basic_waitable_timer/overload1.html b/doc/html/boost_asio/reference/basic_waitable_timer/basic_waitable_timer/overload1.html index ffcc42efad..e9b3e2b142 100644 --- a/doc/html/boost_asio/reference/basic_waitable_timer/basic_waitable_timer/overload1.html +++ b/doc/html/boost_asio/reference/basic_waitable_timer/basic_waitable_timer/overload1.html @@ -56,7 +56,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_waitable_timer/basic_waitable_timer/overload2.html b/doc/html/boost_asio/reference/basic_waitable_timer/basic_waitable_timer/overload2.html index ef3bcfc6b9..43d5240b78 100644 --- a/doc/html/boost_asio/reference/basic_waitable_timer/basic_waitable_timer/overload2.html +++ b/doc/html/boost_asio/reference/basic_waitable_timer/basic_waitable_timer/overload2.html @@ -60,7 +60,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_waitable_timer/basic_waitable_timer/overload3.html b/doc/html/boost_asio/reference/basic_waitable_timer/basic_waitable_timer/overload3.html index da39bcda05..0d4088ae9b 100644 --- a/doc/html/boost_asio/reference/basic_waitable_timer/basic_waitable_timer/overload3.html +++ b/doc/html/boost_asio/reference/basic_waitable_timer/basic_waitable_timer/overload3.html @@ -59,7 +59,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_waitable_timer/basic_waitable_timer/overload4.html b/doc/html/boost_asio/reference/basic_waitable_timer/basic_waitable_timer/overload4.html index 3c610e470b..f7315bb8fb 100644 --- a/doc/html/boost_asio/reference/basic_waitable_timer/basic_waitable_timer/overload4.html +++ b/doc/html/boost_asio/reference/basic_waitable_timer/basic_waitable_timer/overload4.html @@ -62,7 +62,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_waitable_timer/cancel.html b/doc/html/boost_asio/reference/basic_waitable_timer/cancel.html index c37a2a4583..fb7735528a 100644 --- a/doc/html/boost_asio/reference/basic_waitable_timer/cancel.html +++ b/doc/html/boost_asio/reference/basic_waitable_timer/cancel.html @@ -45,7 +45,7 @@ Cancel
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_waitable_timer/cancel/overload1.html b/doc/html/boost_asio/reference/basic_waitable_timer/cancel/overload1.html index a22956bac4..22311528f0 100644 --- a/doc/html/boost_asio/reference/basic_waitable_timer/cancel/overload1.html +++ b/doc/html/boost_asio/reference/basic_waitable_timer/cancel/overload1.html @@ -85,7 +85,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_waitable_timer/cancel/overload2.html b/doc/html/boost_asio/reference/basic_waitable_timer/cancel/overload2.html index 9c26e2b2b4..f62bb9d242 100644 --- a/doc/html/boost_asio/reference/basic_waitable_timer/cancel/overload2.html +++ b/doc/html/boost_asio/reference/basic_waitable_timer/cancel/overload2.html @@ -87,7 +87,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_waitable_timer/cancel_one.html b/doc/html/boost_asio/reference/basic_waitable_timer/cancel_one.html index 26cdc2e46f..002b405624 100644 --- a/doc/html/boost_asio/reference/basic_waitable_timer/cancel_one.html +++ b/doc/html/boost_asio/reference/basic_waitable_timer/cancel_one.html @@ -45,7 +45,7 @@ Cancels
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_waitable_timer/cancel_one/overload1.html b/doc/html/boost_asio/reference/basic_waitable_timer/cancel_one/overload1.html index c20caa1ea7..644393a3de 100644 --- a/doc/html/boost_asio/reference/basic_waitable_timer/cancel_one/overload1.html +++ b/doc/html/boost_asio/reference/basic_waitable_timer/cancel_one/overload1.html @@ -86,7 +86,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_waitable_timer/cancel_one/overload2.html b/doc/html/boost_asio/reference/basic_waitable_timer/cancel_one/overload2.html index 8d5adb5eb5..f0f38c0882 100644 --- a/doc/html/boost_asio/reference/basic_waitable_timer/cancel_one/overload2.html +++ b/doc/html/boost_asio/reference/basic_waitable_timer/cancel_one/overload2.html @@ -88,7 +88,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_waitable_timer/clock_type.html b/doc/html/boost_asio/reference/basic_waitable_timer/clock_type.html index 9b4c33bab8..3752643f76 100644 --- a/doc/html/boost_asio/reference/basic_waitable_timer/clock_type.html +++ b/doc/html/boost_asio/reference/basic_waitable_timer/clock_type.html @@ -46,7 +46,7 @@ The
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_waitable_timer/duration.html b/doc/html/boost_asio/reference/basic_waitable_timer/duration.html index d9acab9b23..356bbc4bf3 100644 --- a/doc/html/boost_asio/reference/basic_waitable_timer/duration.html +++ b/doc/html/boost_asio/reference/basic_waitable_timer/duration.html @@ -46,7 +46,7 @@ The
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_waitable_timer/executor_type.html b/doc/html/boost_asio/reference/basic_waitable_timer/executor_type.html index f4c492a5cd..32389032fc 100644 --- a/doc/html/boost_asio/reference/basic_waitable_timer/executor_type.html +++ b/doc/html/boost_asio/reference/basic_waitable_timer/executor_type.html @@ -203,7 +203,7 @@ The
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_waitable_timer/expires_after.html b/doc/html/boost_asio/reference/basic_waitable_timer/expires_after.html index c296b78447..48d3fe1bf0 100644 --- a/doc/html/boost_asio/reference/basic_waitable_timer/expires_after.html +++ b/doc/html/boost_asio/reference/basic_waitable_timer/expires_after.html @@ -96,7 +96,7 @@ Set
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_waitable_timer/expires_at.html b/doc/html/boost_asio/reference/basic_waitable_timer/expires_at.html index 9ff425ff4e..b4e4c5e5e7 100644 --- a/doc/html/boost_asio/reference/basic_waitable_timer/expires_at.html +++ b/doc/html/boost_asio/reference/basic_waitable_timer/expires_at.html @@ -54,7 +54,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_waitable_timer/expires_at/overload1.html b/doc/html/boost_asio/reference/basic_waitable_timer/expires_at/overload1.html index fb51893ece..aa59cd236d 100644 --- a/doc/html/boost_asio/reference/basic_waitable_timer/expires_at/overload1.html +++ b/doc/html/boost_asio/reference/basic_waitable_timer/expires_at/overload1.html @@ -40,7 +40,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_waitable_timer/expires_at/overload2.html b/doc/html/boost_asio/reference/basic_waitable_timer/expires_at/overload2.html index deb3ae2378..0d323e22b8 100644 --- a/doc/html/boost_asio/reference/basic_waitable_timer/expires_at/overload2.html +++ b/doc/html/boost_asio/reference/basic_waitable_timer/expires_at/overload2.html @@ -95,7 +95,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_waitable_timer/expires_at/overload3.html b/doc/html/boost_asio/reference/basic_waitable_timer/expires_at/overload3.html index 22a9ea01dc..ae138456c4 100644 --- a/doc/html/boost_asio/reference/basic_waitable_timer/expires_at/overload3.html +++ b/doc/html/boost_asio/reference/basic_waitable_timer/expires_at/overload3.html @@ -88,7 +88,7 @@
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_waitable_timer/expires_from_now.html b/doc/html/boost_asio/reference/basic_waitable_timer/expires_from_now.html index 64747eb56d..7a9d0e6746 100644 --- a/doc/html/boost_asio/reference/basic_waitable_timer/expires_from_now.html +++ b/doc/html/boost_asio/reference/basic_waitable_timer/expires_from_now.html @@ -50,7 +50,7 @@ std::size_t
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_waitable_timer/expires_from_now/overload1.html b/doc/html/boost_asio/reference/basic_waitable_timer/expires_from_now/overload1.html index 116e140e21..bca978f00c 100644 --- a/doc/html/boost_asio/reference/basic_waitable_timer/expires_from_now/overload1.html +++ b/doc/html/boost_asio/reference/basic_waitable_timer/expires_from_now/overload1.html @@ -40,7 +40,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_waitable_timer/expires_from_now/overload2.html b/doc/html/boost_asio/reference/basic_waitable_timer/expires_from_now/overload2.html index d8f796d369..50b486df9b 100644 --- a/doc/html/boost_asio/reference/basic_waitable_timer/expires_from_now/overload2.html +++ b/doc/html/boost_asio/reference/basic_waitable_timer/expires_from_now/overload2.html @@ -96,7 +96,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_waitable_timer/expires_from_now/overload3.html b/doc/html/boost_asio/reference/basic_waitable_timer/expires_from_now/overload3.html index 9764bd7f81..94a802ce47 100644 --- a/doc/html/boost_asio/reference/basic_waitable_timer/expires_from_now/overload3.html +++ b/doc/html/boost_asio/reference/basic_waitable_timer/expires_from_now/overload3.html @@ -88,7 +88,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_waitable_timer/expiry.html b/doc/html/boost_asio/reference/basic_waitable_timer/expiry.html index 519118c4d1..93d6924358 100644 --- a/doc/html/boost_asio/reference/basic_waitable_timer/expiry.html +++ b/doc/html/boost_asio/reference/basic_waitable_timer/expiry.html @@ -40,7 +40,7 @@ Get
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_waitable_timer/get_executor.html b/doc/html/boost_asio/reference/basic_waitable_timer/get_executor.html index 915f69e236..7f2c245f55 100644 --- a/doc/html/boost_asio/reference/basic_waitable_timer/get_executor.html +++ b/doc/html/boost_asio/reference/basic_waitable_timer/get_executor.html @@ -36,7 +36,7 @@ Get
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_waitable_timer/get_io_context.html b/doc/html/boost_asio/reference/basic_waitable_timer/get_io_context.html index 937676136b..471b6ba84b 100644 --- a/doc/html/boost_asio/reference/basic_waitable_timer/get_io_context.html +++ b/doc/html/boost_asio/reference/basic_waitable_timer/get_io_context.html @@ -51,7 +51,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_waitable_timer/get_io_service.html b/doc/html/boost_asio/reference/basic_waitable_timer/get_io_service.html index e2697b6f10..8f5f197301 100644 --- a/doc/html/boost_asio/reference/basic_waitable_timer/get_io_service.html +++ b/doc/html/boost_asio/reference/basic_waitable_timer/get_io_service.html @@ -51,7 +51,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_waitable_timer/operator_eq_.html b/doc/html/boost_asio/reference/basic_waitable_timer/operator_eq_.html index 22748f23eb..4ac55e24d3 100644 --- a/doc/html/boost_asio/reference/basic_waitable_timer/operator_eq_.html +++ b/doc/html/boost_asio/reference/basic_waitable_timer/operator_eq_.html @@ -64,7 +64,7 @@ Move-assign
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_waitable_timer/time_point.html b/doc/html/boost_asio/reference/basic_waitable_timer/time_point.html index b95e5e504e..6031d52624 100644 --- a/doc/html/boost_asio/reference/basic_waitable_timer/time_point.html +++ b/doc/html/boost_asio/reference/basic_waitable_timer/time_point.html @@ -46,7 +46,7 @@ The
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_waitable_timer/traits_type.html b/doc/html/boost_asio/reference/basic_waitable_timer/traits_type.html index 250507e1ee..ab10b8825a 100644 --- a/doc/html/boost_asio/reference/basic_waitable_timer/traits_type.html +++ b/doc/html/boost_asio/reference/basic_waitable_timer/traits_type.html @@ -46,7 +46,7 @@ The
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_waitable_timer/wait.html b/doc/html/boost_asio/reference/basic_waitable_timer/wait.html index a1922159b9..12fa9d53ff 100644 --- a/doc/html/boost_asio/reference/basic_waitable_timer/wait.html +++ b/doc/html/boost_asio/reference/basic_waitable_timer/wait.html @@ -41,7 +41,7 @@ void
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_waitable_timer/wait/overload1.html b/doc/html/boost_asio/reference/basic_waitable_timer/wait/overload1.html index 20c0151c2e..e2c44202b0 100644 --- a/doc/html/boost_asio/reference/basic_waitable_timer/wait/overload1.html +++ b/doc/html/boost_asio/reference/basic_waitable_timer/wait/overload1.html @@ -52,7 +52,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_waitable_timer/wait/overload2.html b/doc/html/boost_asio/reference/basic_waitable_timer/wait/overload2.html index da236c9f06..b34ea08386 100644 --- a/doc/html/boost_asio/reference/basic_waitable_timer/wait/overload2.html +++ b/doc/html/boost_asio/reference/basic_waitable_timer/wait/overload2.html @@ -53,7 +53,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_yield_context.html b/doc/html/boost_asio/reference/basic_yield_context.html index 730f43fa9a..db7f5bcbf5 100644 --- a/doc/html/boost_asio/reference/basic_yield_context.html +++ b/doc/html/boost_asio/reference/basic_yield_context.html @@ -165,7 +165,7 @@ void my_coroutine(basic_yield_context<Handler> yield)
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_yield_context/basic_yield_context.html b/doc/html/boost_asio/reference/basic_yield_context/basic_yield_context.html index 7e7c907287..28eec5b5be 100644 --- a/doc/html/boost_asio/reference/basic_yield_context/basic_yield_context.html +++ b/doc/html/boost_asio/reference/basic_yield_context/basic_yield_context.html @@ -49,7 +49,7 @@ Construct
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_yield_context/basic_yield_context/overload1.html b/doc/html/boost_asio/reference/basic_yield_context/basic_yield_context/overload1.html index 3483d57bc8..6c50f58bba 100644 --- a/doc/html/boost_asio/reference/basic_yield_context/basic_yield_context/overload1.html +++ b/doc/html/boost_asio/reference/basic_yield_context/basic_yield_context/overload1.html @@ -43,7 +43,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_yield_context/basic_yield_context/overload2.html b/doc/html/boost_asio/reference/basic_yield_context/basic_yield_context/overload2.html index 299ca0c0a9..1fa9a53f0d 100644 --- a/doc/html/boost_asio/reference/basic_yield_context/basic_yield_context/overload2.html +++ b/doc/html/boost_asio/reference/basic_yield_context/basic_yield_context/overload2.html @@ -41,7 +41,7 @@ basic_yield_context(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_yield_context/callee_type.html b/doc/html/boost_asio/reference/basic_yield_context/callee_type.html index 052886b9ce..9e4531abf8 100644 --- a/doc/html/boost_asio/reference/basic_yield_context/callee_type.html +++ b/doc/html/boost_asio/reference/basic_yield_context/callee_type.html @@ -56,7 +56,7 @@ The
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_yield_context/caller_type.html b/doc/html/boost_asio/reference/basic_yield_context/caller_type.html index 12cffa7407..9ec256b338 100644 --- a/doc/html/boost_asio/reference/basic_yield_context/caller_type.html +++ b/doc/html/boost_asio/reference/basic_yield_context/caller_type.html @@ -56,7 +56,7 @@ The
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/basic_yield_context/operator_lb__rb_.html b/doc/html/boost_asio/reference/basic_yield_context/operator_lb__rb_.html index 2039b19b71..b3fbe41474 100644 --- a/doc/html/boost_asio/reference/basic_yield_context/operator_lb__rb_.html +++ b/doc/html/boost_asio/reference/basic_yield_context/operator_lb__rb_.html @@ -55,7 +55,7 @@ void my_coroutine(basic_yield_context<Handler> yield)
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/bind_executor.html b/doc/html/boost_asio/reference/bind_executor.html index ca198fecf0..da18e1efa0 100644 --- a/doc/html/boost_asio/reference/bind_executor.html +++ b/doc/html/boost_asio/reference/bind_executor.html @@ -62,7 +62,7 @@ executor_binder< typename decay< T >::type, typename ExecutionContext::
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/bind_executor/overload1.html b/doc/html/boost_asio/reference/bind_executor/overload1.html index 06312269a8..7a44b9594d 100644 --- a/doc/html/boost_asio/reference/bind_executor/overload1.html +++ b/doc/html/boost_asio/reference/bind_executor/overload1.html @@ -41,7 +41,7 @@ executor_binder< typename decay< T >::type, Executor > bind_executor
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/bind_executor/overload2.html b/doc/html/boost_asio/reference/bind_executor/overload2.html index ab910ad0e2..cc913f4eac 100644 --- a/doc/html/boost_asio/reference/bind_executor/overload2.html +++ b/doc/html/boost_asio/reference/bind_executor/overload2.html @@ -42,7 +42,7 @@ executor_binder< typename decay< T >::type, typename ExecutionContext::
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/buffer.html b/doc/html/boost_asio/reference/buffer.html index 74928b3dac..1ccf7acde3 100644 --- a/doc/html/boost_asio/reference/buffer.html +++ b/doc/html/boost_asio/reference/buffer.html @@ -466,7 +466,7 @@ bytes_transferred = sock.send(bufs2);
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/buffer/overload1.html b/doc/html/boost_asio/reference/buffer/overload1.html index fc841d70d5..5365badbcf 100644 --- a/doc/html/boost_asio/reference/buffer/overload1.html +++ b/doc/html/boost_asio/reference/buffer/overload1.html @@ -43,7 +43,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/buffer/overload10.html b/doc/html/boost_asio/reference/buffer/overload10.html index 8bc9c85870..b6c1e9cbff 100644 --- a/doc/html/boost_asio/reference/buffer/overload10.html +++ b/doc/html/boost_asio/reference/buffer/overload10.html @@ -52,7 +52,7 @@ const_buffer buffer(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/buffer/overload11.html b/doc/html/boost_asio/reference/buffer/overload11.html index bff296775f..5e239c83cc 100644 --- a/doc/html/boost_asio/reference/buffer/overload11.html +++ b/doc/html/boost_asio/reference/buffer/overload11.html @@ -51,7 +51,7 @@ mutable_buffer buffer(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/buffer/overload12.html b/doc/html/boost_asio/reference/buffer/overload12.html index b723066c0d..3b13add4fc 100644 --- a/doc/html/boost_asio/reference/buffer/overload12.html +++ b/doc/html/boost_asio/reference/buffer/overload12.html @@ -52,7 +52,7 @@ mutable_buffer buffer(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/buffer/overload13.html b/doc/html/boost_asio/reference/buffer/overload13.html index 6b6f9c9240..3f1c29d47d 100644 --- a/doc/html/boost_asio/reference/buffer/overload13.html +++ b/doc/html/boost_asio/reference/buffer/overload13.html @@ -51,7 +51,7 @@ const_buffer buffer(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/buffer/overload14.html b/doc/html/boost_asio/reference/buffer/overload14.html index 6d686d09d1..bbb2963c7f 100644 --- a/doc/html/boost_asio/reference/buffer/overload14.html +++ b/doc/html/boost_asio/reference/buffer/overload14.html @@ -52,7 +52,7 @@ const_buffer buffer(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/buffer/overload15.html b/doc/html/boost_asio/reference/buffer/overload15.html index 3a094da0ed..fb46ad02c5 100644 --- a/doc/html/boost_asio/reference/buffer/overload15.html +++ b/doc/html/boost_asio/reference/buffer/overload15.html @@ -51,7 +51,7 @@ const_buffer buffer(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/buffer/overload16.html b/doc/html/boost_asio/reference/buffer/overload16.html index a9e29b5fb3..09a1279768 100644 --- a/doc/html/boost_asio/reference/buffer/overload16.html +++ b/doc/html/boost_asio/reference/buffer/overload16.html @@ -52,7 +52,7 @@ const_buffer buffer(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/buffer/overload17.html b/doc/html/boost_asio/reference/buffer/overload17.html index 57423a126f..1ddd608602 100644 --- a/doc/html/boost_asio/reference/buffer/overload17.html +++ b/doc/html/boost_asio/reference/buffer/overload17.html @@ -51,7 +51,7 @@ mutable_buffer buffer(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/buffer/overload18.html b/doc/html/boost_asio/reference/buffer/overload18.html index 7244a330ff..93b75539d6 100644 --- a/doc/html/boost_asio/reference/buffer/overload18.html +++ b/doc/html/boost_asio/reference/buffer/overload18.html @@ -52,7 +52,7 @@ mutable_buffer buffer(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/buffer/overload19.html b/doc/html/boost_asio/reference/buffer/overload19.html index eb35542b1f..2d6ef4e78a 100644 --- a/doc/html/boost_asio/reference/buffer/overload19.html +++ b/doc/html/boost_asio/reference/buffer/overload19.html @@ -51,7 +51,7 @@ const_buffer buffer(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/buffer/overload2.html b/doc/html/boost_asio/reference/buffer/overload2.html index e3987f664c..f7294f3c2e 100644 --- a/doc/html/boost_asio/reference/buffer/overload2.html +++ b/doc/html/boost_asio/reference/buffer/overload2.html @@ -49,7 +49,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/buffer/overload20.html b/doc/html/boost_asio/reference/buffer/overload20.html index 06c7ce874a..4318825dcf 100644 --- a/doc/html/boost_asio/reference/buffer/overload20.html +++ b/doc/html/boost_asio/reference/buffer/overload20.html @@ -52,7 +52,7 @@ const_buffer buffer(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/buffer/overload21.html b/doc/html/boost_asio/reference/buffer/overload21.html index 20145001cf..1fb44af550 100644 --- a/doc/html/boost_asio/reference/buffer/overload21.html +++ b/doc/html/boost_asio/reference/buffer/overload21.html @@ -51,7 +51,7 @@ const_buffer buffer(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/buffer/overload22.html b/doc/html/boost_asio/reference/buffer/overload22.html index 5b10bad82d..89e21389de 100644 --- a/doc/html/boost_asio/reference/buffer/overload22.html +++ b/doc/html/boost_asio/reference/buffer/overload22.html @@ -52,7 +52,7 @@ const_buffer buffer(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/buffer/overload23.html b/doc/html/boost_asio/reference/buffer/overload23.html index 25cd19d243..19d8d001f1 100644 --- a/doc/html/boost_asio/reference/buffer/overload23.html +++ b/doc/html/boost_asio/reference/buffer/overload23.html @@ -59,7 +59,7 @@ mutable_buffer buffer(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/buffer/overload24.html b/doc/html/boost_asio/reference/buffer/overload24.html index 5ef95cdf05..bc0a66c7b8 100644 --- a/doc/html/boost_asio/reference/buffer/overload24.html +++ b/doc/html/boost_asio/reference/buffer/overload24.html @@ -60,7 +60,7 @@ mutable_buffer buffer(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/buffer/overload25.html b/doc/html/boost_asio/reference/buffer/overload25.html index dbae09cfb0..b5e347c926 100644 --- a/doc/html/boost_asio/reference/buffer/overload25.html +++ b/doc/html/boost_asio/reference/buffer/overload25.html @@ -59,7 +59,7 @@ const_buffer buffer(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/buffer/overload26.html b/doc/html/boost_asio/reference/buffer/overload26.html index 2c6c7dd3e7..c88fb91e26 100644 --- a/doc/html/boost_asio/reference/buffer/overload26.html +++ b/doc/html/boost_asio/reference/buffer/overload26.html @@ -60,7 +60,7 @@ const_buffer buffer(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/buffer/overload27.html b/doc/html/boost_asio/reference/buffer/overload27.html index 8082cbff0d..d22ea92298 100644 --- a/doc/html/boost_asio/reference/buffer/overload27.html +++ b/doc/html/boost_asio/reference/buffer/overload27.html @@ -55,7 +55,7 @@ mutable_buffer buffer(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/buffer/overload28.html b/doc/html/boost_asio/reference/buffer/overload28.html index 5106af8684..c53c8ad348 100644 --- a/doc/html/boost_asio/reference/buffer/overload28.html +++ b/doc/html/boost_asio/reference/buffer/overload28.html @@ -61,7 +61,7 @@ mutable_buffer buffer(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/buffer/overload29.html b/doc/html/boost_asio/reference/buffer/overload29.html index 37d0b2ccf8..8967d27946 100644 --- a/doc/html/boost_asio/reference/buffer/overload29.html +++ b/doc/html/boost_asio/reference/buffer/overload29.html @@ -55,7 +55,7 @@ const_buffer buffer(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/buffer/overload3.html b/doc/html/boost_asio/reference/buffer/overload3.html index 6d8a6625cd..5d9aab8cff 100644 --- a/doc/html/boost_asio/reference/buffer/overload3.html +++ b/doc/html/boost_asio/reference/buffer/overload3.html @@ -43,7 +43,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/buffer/overload30.html b/doc/html/boost_asio/reference/buffer/overload30.html index a9f111ecf8..e3a3336e65 100644 --- a/doc/html/boost_asio/reference/buffer/overload30.html +++ b/doc/html/boost_asio/reference/buffer/overload30.html @@ -61,7 +61,7 @@ const_buffer buffer(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/buffer/overload31.html b/doc/html/boost_asio/reference/buffer/overload31.html index 1b1e102731..b25a847c3d 100644 --- a/doc/html/boost_asio/reference/buffer/overload31.html +++ b/doc/html/boost_asio/reference/buffer/overload31.html @@ -46,7 +46,7 @@ const_buffer buffer(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/buffer/overload32.html b/doc/html/boost_asio/reference/buffer/overload32.html index 7114743db2..31e9420467 100644 --- a/doc/html/boost_asio/reference/buffer/overload32.html +++ b/doc/html/boost_asio/reference/buffer/overload32.html @@ -52,7 +52,7 @@ const_buffer buffer(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/buffer/overload4.html b/doc/html/boost_asio/reference/buffer/overload4.html index 00a26a75b5..3874482d45 100644 --- a/doc/html/boost_asio/reference/buffer/overload4.html +++ b/doc/html/boost_asio/reference/buffer/overload4.html @@ -49,7 +49,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/buffer/overload5.html b/doc/html/boost_asio/reference/buffer/overload5.html index 0936d69f06..67da068d99 100644 --- a/doc/html/boost_asio/reference/buffer/overload5.html +++ b/doc/html/boost_asio/reference/buffer/overload5.html @@ -44,7 +44,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/buffer/overload6.html b/doc/html/boost_asio/reference/buffer/overload6.html index e6a2f92a33..f814e61a18 100644 --- a/doc/html/boost_asio/reference/buffer/overload6.html +++ b/doc/html/boost_asio/reference/buffer/overload6.html @@ -44,7 +44,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/buffer/overload7.html b/doc/html/boost_asio/reference/buffer/overload7.html index 1a0cc9a2af..25ea492ac1 100644 --- a/doc/html/boost_asio/reference/buffer/overload7.html +++ b/doc/html/boost_asio/reference/buffer/overload7.html @@ -51,7 +51,7 @@ mutable_buffer buffer(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/buffer/overload8.html b/doc/html/boost_asio/reference/buffer/overload8.html index 3eac832c61..b6008f6180 100644 --- a/doc/html/boost_asio/reference/buffer/overload8.html +++ b/doc/html/boost_asio/reference/buffer/overload8.html @@ -52,7 +52,7 @@ mutable_buffer buffer(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/buffer/overload9.html b/doc/html/boost_asio/reference/buffer/overload9.html index a229c57132..9a611fbb4c 100644 --- a/doc/html/boost_asio/reference/buffer/overload9.html +++ b/doc/html/boost_asio/reference/buffer/overload9.html @@ -51,7 +51,7 @@ const_buffer buffer(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/buffer_cast.html b/doc/html/boost_asio/reference/buffer_cast.html index 361eea12ff..c1d27d2792 100644 --- a/doc/html/boost_asio/reference/buffer_cast.html +++ b/doc/html/boost_asio/reference/buffer_cast.html @@ -77,7 +77,7 @@ unsigned char* p2 = boost::asio::buffer_cast<unsigned char*>(b2);
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/buffer_cast/overload1.html b/doc/html/boost_asio/reference/buffer_cast/overload1.html index 4fd99cb11d..8411972bb9 100644 --- a/doc/html/boost_asio/reference/buffer_cast/overload1.html +++ b/doc/html/boost_asio/reference/buffer_cast/overload1.html @@ -38,7 +38,7 @@ PointerToPodType buffer_cast(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/buffer_cast/overload2.html b/doc/html/boost_asio/reference/buffer_cast/overload2.html index fdf987b789..c8bdae1afe 100644 --- a/doc/html/boost_asio/reference/buffer_cast/overload2.html +++ b/doc/html/boost_asio/reference/buffer_cast/overload2.html @@ -38,7 +38,7 @@ PointerToPodType buffer_cast(
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/buffer_copy.html b/doc/html/boost_asio/reference/buffer_copy.html index 9ad1049c9f..9a7eee53d1 100644 --- a/doc/html/boost_asio/reference/buffer_copy.html +++ b/doc/html/boost_asio/reference/buffer_copy.html @@ -97,7 +97,7 @@ std::size_t
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/buffer_copy/overload1.html b/doc/html/boost_asio/reference/buffer_copy/overload1.html index 4f65c9f724..2f5420afb8 100644 --- a/doc/html/boost_asio/reference/buffer_copy/overload1.html +++ b/doc/html/boost_asio/reference/buffer_copy/overload1.html @@ -86,7 +86,7 @@ std::size_t buffer_copy(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/buffer_copy/overload2.html b/doc/html/boost_asio/reference/buffer_copy/overload2.html index 062a3d1b8f..3078cdc953 100644 --- a/doc/html/boost_asio/reference/buffer_copy/overload2.html +++ b/doc/html/boost_asio/reference/buffer_copy/overload2.html @@ -95,7 +95,7 @@ std::size_t buffer_copy(
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/buffer_sequence_begin.html b/doc/html/boost_asio/reference/buffer_sequence_begin.html index 82595902bd..b4cea89a72 100644 --- a/doc/html/boost_asio/reference/buffer_sequence_begin.html +++ b/doc/html/boost_asio/reference/buffer_sequence_begin.html @@ -64,7 +64,7 @@ auto
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/buffer_sequence_begin/overload1.html b/doc/html/boost_asio/reference/buffer_sequence_begin/overload1.html index f465079802..64979ac70b 100644 --- a/doc/html/boost_asio/reference/buffer_sequence_begin/overload1.html +++ b/doc/html/boost_asio/reference/buffer_sequence_begin/overload1.html @@ -36,7 +36,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/buffer_sequence_begin/overload2.html b/doc/html/boost_asio/reference/buffer_sequence_begin/overload2.html index 99f22eab6f..dcddc28f68 100644 --- a/doc/html/boost_asio/reference/buffer_sequence_begin/overload2.html +++ b/doc/html/boost_asio/reference/buffer_sequence_begin/overload2.html @@ -36,7 +36,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/buffer_sequence_begin/overload3.html b/doc/html/boost_asio/reference/buffer_sequence_begin/overload3.html index c3fe9caa6c..e193b5506b 100644 --- a/doc/html/boost_asio/reference/buffer_sequence_begin/overload3.html +++ b/doc/html/boost_asio/reference/buffer_sequence_begin/overload3.html @@ -38,7 +38,7 @@ auto buffer_sequence_begin(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/buffer_sequence_begin/overload4.html b/doc/html/boost_asio/reference/buffer_sequence_begin/overload4.html index 4936e39cd8..57a113f0af 100644 --- a/doc/html/boost_asio/reference/buffer_sequence_begin/overload4.html +++ b/doc/html/boost_asio/reference/buffer_sequence_begin/overload4.html @@ -38,7 +38,7 @@ auto buffer_sequence_begin(
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/buffer_sequence_end.html b/doc/html/boost_asio/reference/buffer_sequence_end.html index f5fce7e922..a63038c8cd 100644 --- a/doc/html/boost_asio/reference/buffer_sequence_end.html +++ b/doc/html/boost_asio/reference/buffer_sequence_end.html @@ -65,7 +65,7 @@ auto
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/buffer_sequence_end/overload1.html b/doc/html/boost_asio/reference/buffer_sequence_end/overload1.html index 23c18a0988..a9f81a14f1 100644 --- a/doc/html/boost_asio/reference/buffer_sequence_end/overload1.html +++ b/doc/html/boost_asio/reference/buffer_sequence_end/overload1.html @@ -36,7 +36,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/buffer_sequence_end/overload2.html b/doc/html/boost_asio/reference/buffer_sequence_end/overload2.html index ce5eb08a71..ebbd83e381 100644 --- a/doc/html/boost_asio/reference/buffer_sequence_end/overload2.html +++ b/doc/html/boost_asio/reference/buffer_sequence_end/overload2.html @@ -36,7 +36,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/buffer_sequence_end/overload3.html b/doc/html/boost_asio/reference/buffer_sequence_end/overload3.html index fd9163b1b3..6422e2224f 100644 --- a/doc/html/boost_asio/reference/buffer_sequence_end/overload3.html +++ b/doc/html/boost_asio/reference/buffer_sequence_end/overload3.html @@ -38,7 +38,7 @@ auto buffer_sequence_end(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/buffer_sequence_end/overload4.html b/doc/html/boost_asio/reference/buffer_sequence_end/overload4.html index 97de9347e3..cdd6937a93 100644 --- a/doc/html/boost_asio/reference/buffer_sequence_end/overload4.html +++ b/doc/html/boost_asio/reference/buffer_sequence_end/overload4.html @@ -38,7 +38,7 @@ auto buffer_sequence_end(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/buffer_size.html b/doc/html/boost_asio/reference/buffer_size.html index 3d4aca7eb9..350b389548 100644 --- a/doc/html/boost_asio/reference/buffer_size.html +++ b/doc/html/boost_asio/reference/buffer_size.html @@ -68,7 +68,7 @@ return total_size;
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/buffered_read_stream.html b/doc/html/boost_asio/reference/buffered_read_stream.html index 4f837b7e62..e5dbf9d867 100644 --- a/doc/html/boost_asio/reference/buffered_read_stream.html +++ b/doc/html/boost_asio/reference/buffered_read_stream.html @@ -391,7 +391,7 @@ class buffered_read_stream :
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/buffered_read_stream/async_fill.html b/doc/html/boost_asio/reference/buffered_read_stream/async_fill.html index 0c62b99778..fe7daba5ab 100644 --- a/doc/html/boost_asio/reference/buffered_read_stream/async_fill.html +++ b/doc/html/boost_asio/reference/buffered_read_stream/async_fill.html @@ -39,7 +39,7 @@ Start
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/buffered_read_stream/async_read_some.html b/doc/html/boost_asio/reference/buffered_read_stream/async_read_some.html index ab841115b4..2f33650fe2 100644 --- a/doc/html/boost_asio/reference/buffered_read_stream/async_read_some.html +++ b/doc/html/boost_asio/reference/buffered_read_stream/async_read_some.html @@ -42,7 +42,7 @@ Start
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/buffered_read_stream/async_write_some.html b/doc/html/boost_asio/reference/buffered_read_stream/async_write_some.html index 1e787c39eb..c5e90f5d8a 100644 --- a/doc/html/boost_asio/reference/buffered_read_stream/async_write_some.html +++ b/doc/html/boost_asio/reference/buffered_read_stream/async_write_some.html @@ -42,7 +42,7 @@ Start
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/buffered_read_stream/buffered_read_stream.html b/doc/html/boost_asio/reference/buffered_read_stream/buffered_read_stream.html index bea2281833..651185bcb3 100644 --- a/doc/html/boost_asio/reference/buffered_read_stream/buffered_read_stream.html +++ b/doc/html/boost_asio/reference/buffered_read_stream/buffered_read_stream.html @@ -47,7 +47,7 @@ template<
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/buffered_read_stream/buffered_read_stream/overload1.html b/doc/html/boost_asio/reference/buffered_read_stream/buffered_read_stream/overload1.html index a33a8956f3..fdf2802628 100644 --- a/doc/html/boost_asio/reference/buffered_read_stream/buffered_read_stream/overload1.html +++ b/doc/html/boost_asio/reference/buffered_read_stream/buffered_read_stream/overload1.html @@ -38,7 +38,7 @@ buffered_read_stream(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/buffered_read_stream/buffered_read_stream/overload2.html b/doc/html/boost_asio/reference/buffered_read_stream/buffered_read_stream/overload2.html index b103939251..f3e4bfe503 100644 --- a/doc/html/boost_asio/reference/buffered_read_stream/buffered_read_stream/overload2.html +++ b/doc/html/boost_asio/reference/buffered_read_stream/buffered_read_stream/overload2.html @@ -39,7 +39,7 @@ buffered_read_stream(
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/buffered_read_stream/close.html b/doc/html/boost_asio/reference/buffered_read_stream/close.html index 44c6e1c5c3..51e8f2529d 100644 --- a/doc/html/boost_asio/reference/buffered_read_stream/close.html +++ b/doc/html/boost_asio/reference/buffered_read_stream/close.html @@ -41,7 +41,7 @@ void
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/buffered_read_stream/close/overload1.html b/doc/html/boost_asio/reference/buffered_read_stream/close/overload1.html index c9dbaaa157..1d132526d1 100644 --- a/doc/html/boost_asio/reference/buffered_read_stream/close/overload1.html +++ b/doc/html/boost_asio/reference/buffered_read_stream/close/overload1.html @@ -35,7 +35,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/buffered_read_stream/close/overload2.html b/doc/html/boost_asio/reference/buffered_read_stream/close/overload2.html index e88c0a7f0c..a667189549 100644 --- a/doc/html/boost_asio/reference/buffered_read_stream/close/overload2.html +++ b/doc/html/boost_asio/reference/buffered_read_stream/close/overload2.html @@ -36,7 +36,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/buffered_read_stream/default_buffer_size.html b/doc/html/boost_asio/reference/buffered_read_stream/default_buffer_size.html index fb0fe354bd..618b4bb80a 100644 --- a/doc/html/boost_asio/reference/buffered_read_stream/default_buffer_size.html +++ b/doc/html/boost_asio/reference/buffered_read_stream/default_buffer_size.html @@ -36,7 +36,7 @@ The
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/buffered_read_stream/executor_type.html b/doc/html/boost_asio/reference/buffered_read_stream/executor_type.html index cef9ae6c4c..58ab89944d 100644 --- a/doc/html/boost_asio/reference/buffered_read_stream/executor_type.html +++ b/doc/html/boost_asio/reference/buffered_read_stream/executor_type.html @@ -46,7 +46,7 @@ The
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/buffered_read_stream/fill.html b/doc/html/boost_asio/reference/buffered_read_stream/fill.html index 28a6f5a76d..dbbe62b608 100644 --- a/doc/html/boost_asio/reference/buffered_read_stream/fill.html +++ b/doc/html/boost_asio/reference/buffered_read_stream/fill.html @@ -46,7 +46,7 @@ Fill
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/buffered_read_stream/fill/overload1.html b/doc/html/boost_asio/reference/buffered_read_stream/fill/overload1.html index a0a00d1f6d..4cd71a82a1 100644 --- a/doc/html/boost_asio/reference/buffered_read_stream/fill/overload1.html +++ b/doc/html/boost_asio/reference/buffered_read_stream/fill/overload1.html @@ -36,7 +36,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/buffered_read_stream/fill/overload2.html b/doc/html/boost_asio/reference/buffered_read_stream/fill/overload2.html index 077caeed39..4fbdaae790 100644 --- a/doc/html/boost_asio/reference/buffered_read_stream/fill/overload2.html +++ b/doc/html/boost_asio/reference/buffered_read_stream/fill/overload2.html @@ -37,7 +37,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/buffered_read_stream/get_executor.html b/doc/html/boost_asio/reference/buffered_read_stream/get_executor.html index 5ebe2646ed..e786b10f50 100644 --- a/doc/html/boost_asio/reference/buffered_read_stream/get_executor.html +++ b/doc/html/boost_asio/reference/buffered_read_stream/get_executor.html @@ -36,7 +36,7 @@ Get
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/buffered_read_stream/get_io_context.html b/doc/html/boost_asio/reference/buffered_read_stream/get_io_context.html index 72048d3cf0..c1ac68d6c7 100644 --- a/doc/html/boost_asio/reference/buffered_read_stream/get_io_context.html +++ b/doc/html/boost_asio/reference/buffered_read_stream/get_io_context.html @@ -37,7 +37,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/buffered_read_stream/get_io_service.html b/doc/html/boost_asio/reference/buffered_read_stream/get_io_service.html index 84ad21dd1a..e77c08d53d 100644 --- a/doc/html/boost_asio/reference/buffered_read_stream/get_io_service.html +++ b/doc/html/boost_asio/reference/buffered_read_stream/get_io_service.html @@ -37,7 +37,7 @@
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/buffered_read_stream/in_avail.html b/doc/html/boost_asio/reference/buffered_read_stream/in_avail.html index 767ade06db..d0ffcfcd1d 100644 --- a/doc/html/boost_asio/reference/buffered_read_stream/in_avail.html +++ b/doc/html/boost_asio/reference/buffered_read_stream/in_avail.html @@ -41,7 +41,7 @@ std::size_t
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/buffered_read_stream/in_avail/overload1.html b/doc/html/boost_asio/reference/buffered_read_stream/in_avail/overload1.html index 803da04a0c..f07b0d2140 100644 --- a/doc/html/boost_asio/reference/buffered_read_stream/in_avail/overload1.html +++ b/doc/html/boost_asio/reference/buffered_read_stream/in_avail/overload1.html @@ -35,7 +35,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/buffered_read_stream/in_avail/overload2.html b/doc/html/boost_asio/reference/buffered_read_stream/in_avail/overload2.html index 70f6f60bb3..b3a9cfee34 100644 --- a/doc/html/boost_asio/reference/buffered_read_stream/in_avail/overload2.html +++ b/doc/html/boost_asio/reference/buffered_read_stream/in_avail/overload2.html @@ -36,7 +36,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/buffered_read_stream/lowest_layer.html b/doc/html/boost_asio/reference/buffered_read_stream/lowest_layer.html index 8656c6daa7..2e8bfff306 100644 --- a/doc/html/boost_asio/reference/buffered_read_stream/lowest_layer.html +++ b/doc/html/boost_asio/reference/buffered_read_stream/lowest_layer.html @@ -43,7 +43,7 @@ Get
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/buffered_read_stream/lowest_layer/overload1.html b/doc/html/boost_asio/reference/buffered_read_stream/lowest_layer/overload1.html index 08813e8895..cd3f516e98 100644 --- a/doc/html/boost_asio/reference/buffered_read_stream/lowest_layer/overload1.html +++ b/doc/html/boost_asio/reference/buffered_read_stream/lowest_layer/overload1.html @@ -35,7 +35,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/buffered_read_stream/lowest_layer/overload2.html b/doc/html/boost_asio/reference/buffered_read_stream/lowest_layer/overload2.html index 589d3c9a51..5b55d8ef42 100644 --- a/doc/html/boost_asio/reference/buffered_read_stream/lowest_layer/overload2.html +++ b/doc/html/boost_asio/reference/buffered_read_stream/lowest_layer/overload2.html @@ -35,7 +35,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/buffered_read_stream/lowest_layer_type.html b/doc/html/boost_asio/reference/buffered_read_stream/lowest_layer_type.html index 1d5bffa5e3..ad354805e6 100644 --- a/doc/html/boost_asio/reference/buffered_read_stream/lowest_layer_type.html +++ b/doc/html/boost_asio/reference/buffered_read_stream/lowest_layer_type.html @@ -46,7 +46,7 @@ The
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/buffered_read_stream/next_layer.html b/doc/html/boost_asio/reference/buffered_read_stream/next_layer.html index 6f65feb284..6ca3f48453 100644 --- a/doc/html/boost_asio/reference/buffered_read_stream/next_layer.html +++ b/doc/html/boost_asio/reference/buffered_read_stream/next_layer.html @@ -36,7 +36,7 @@ Get
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/buffered_read_stream/next_layer_type.html b/doc/html/boost_asio/reference/buffered_read_stream/next_layer_type.html index cced8e8b1d..f85ef17c14 100644 --- a/doc/html/boost_asio/reference/buffered_read_stream/next_layer_type.html +++ b/doc/html/boost_asio/reference/buffered_read_stream/next_layer_type.html @@ -46,7 +46,7 @@ The
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/buffered_read_stream/peek.html b/doc/html/boost_asio/reference/buffered_read_stream/peek.html index 8745c2a9d8..92aceb7c20 100644 --- a/doc/html/boost_asio/reference/buffered_read_stream/peek.html +++ b/doc/html/boost_asio/reference/buffered_read_stream/peek.html @@ -52,7 +52,7 @@ std::size_t
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/buffered_read_stream/peek/overload1.html b/doc/html/boost_asio/reference/buffered_read_stream/peek/overload1.html index 0e31fddb9f..f5aa835ed8 100644 --- a/doc/html/boost_asio/reference/buffered_read_stream/peek/overload1.html +++ b/doc/html/boost_asio/reference/buffered_read_stream/peek/overload1.html @@ -39,7 +39,7 @@ std::size_t peek(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/buffered_read_stream/peek/overload2.html b/doc/html/boost_asio/reference/buffered_read_stream/peek/overload2.html index aea0f09e87..303345d260 100644 --- a/doc/html/boost_asio/reference/buffered_read_stream/peek/overload2.html +++ b/doc/html/boost_asio/reference/buffered_read_stream/peek/overload2.html @@ -40,7 +40,7 @@ std::size_t peek(
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/buffered_read_stream/read_some.html b/doc/html/boost_asio/reference/buffered_read_stream/read_some.html index de38d7646f..18b29ec18e 100644 --- a/doc/html/boost_asio/reference/buffered_read_stream/read_some.html +++ b/doc/html/boost_asio/reference/buffered_read_stream/read_some.html @@ -52,7 +52,7 @@ std::size_t
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/buffered_read_stream/read_some/overload1.html b/doc/html/boost_asio/reference/buffered_read_stream/read_some/overload1.html index 892834f23d..6ba29f5fe2 100644 --- a/doc/html/boost_asio/reference/buffered_read_stream/read_some/overload1.html +++ b/doc/html/boost_asio/reference/buffered_read_stream/read_some/overload1.html @@ -39,7 +39,7 @@ std::size_t read_some(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/buffered_read_stream/read_some/overload2.html b/doc/html/boost_asio/reference/buffered_read_stream/read_some/overload2.html index 3503c35f67..92b7354ce5 100644 --- a/doc/html/boost_asio/reference/buffered_read_stream/read_some/overload2.html +++ b/doc/html/boost_asio/reference/buffered_read_stream/read_some/overload2.html @@ -40,7 +40,7 @@ std::size_t read_some(
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/buffered_read_stream/write_some.html b/doc/html/boost_asio/reference/buffered_read_stream/write_some.html index b1fd361dea..e7ceab6862 100644 --- a/doc/html/boost_asio/reference/buffered_read_stream/write_some.html +++ b/doc/html/boost_asio/reference/buffered_read_stream/write_some.html @@ -52,7 +52,7 @@ std::size_t
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/buffered_read_stream/write_some/overload1.html b/doc/html/boost_asio/reference/buffered_read_stream/write_some/overload1.html index f364670a98..4ab526219f 100644 --- a/doc/html/boost_asio/reference/buffered_read_stream/write_some/overload1.html +++ b/doc/html/boost_asio/reference/buffered_read_stream/write_some/overload1.html @@ -39,7 +39,7 @@ std::size_t write_some(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/buffered_read_stream/write_some/overload2.html b/doc/html/boost_asio/reference/buffered_read_stream/write_some/overload2.html index 15ba7186ef..d1666d4707 100644 --- a/doc/html/boost_asio/reference/buffered_read_stream/write_some/overload2.html +++ b/doc/html/boost_asio/reference/buffered_read_stream/write_some/overload2.html @@ -40,7 +40,7 @@ std::size_t write_some(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/buffered_stream.html b/doc/html/boost_asio/reference/buffered_stream.html index 507e3680bc..8afaad1c0a 100644 --- a/doc/html/boost_asio/reference/buffered_stream.html +++ b/doc/html/boost_asio/reference/buffered_stream.html @@ -387,7 +387,7 @@ class buffered_stream :
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/buffered_stream/async_fill.html b/doc/html/boost_asio/reference/buffered_stream/async_fill.html index 96de1a2a8b..c4ef02156f 100644 --- a/doc/html/boost_asio/reference/buffered_stream/async_fill.html +++ b/doc/html/boost_asio/reference/buffered_stream/async_fill.html @@ -39,7 +39,7 @@ Start
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/buffered_stream/async_flush.html b/doc/html/boost_asio/reference/buffered_stream/async_flush.html index a694368510..de86e76b60 100644 --- a/doc/html/boost_asio/reference/buffered_stream/async_flush.html +++ b/doc/html/boost_asio/reference/buffered_stream/async_flush.html @@ -39,7 +39,7 @@ Start
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/buffered_stream/async_read_some.html b/doc/html/boost_asio/reference/buffered_stream/async_read_some.html index 9ccc168f9b..9a396bb01c 100644 --- a/doc/html/boost_asio/reference/buffered_stream/async_read_some.html +++ b/doc/html/boost_asio/reference/buffered_stream/async_read_some.html @@ -42,7 +42,7 @@ Start
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/buffered_stream/async_write_some.html b/doc/html/boost_asio/reference/buffered_stream/async_write_some.html index 163c3b1880..7c7090d2c2 100644 --- a/doc/html/boost_asio/reference/buffered_stream/async_write_some.html +++ b/doc/html/boost_asio/reference/buffered_stream/async_write_some.html @@ -42,7 +42,7 @@ Start
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/buffered_stream/buffered_stream.html b/doc/html/boost_asio/reference/buffered_stream/buffered_stream.html index 3e90e078e6..8d90cc0f2a 100644 --- a/doc/html/boost_asio/reference/buffered_stream/buffered_stream.html +++ b/doc/html/boost_asio/reference/buffered_stream/buffered_stream.html @@ -48,7 +48,7 @@ explicit
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/buffered_stream/buffered_stream/overload1.html b/doc/html/boost_asio/reference/buffered_stream/buffered_stream/overload1.html index 94f6a65ea4..81f652fda3 100644 --- a/doc/html/boost_asio/reference/buffered_stream/buffered_stream/overload1.html +++ b/doc/html/boost_asio/reference/buffered_stream/buffered_stream/overload1.html @@ -38,7 +38,7 @@ buffered_stream(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/buffered_stream/buffered_stream/overload2.html b/doc/html/boost_asio/reference/buffered_stream/buffered_stream/overload2.html index 3b3bb00dfa..13bc10cff3 100644 --- a/doc/html/boost_asio/reference/buffered_stream/buffered_stream/overload2.html +++ b/doc/html/boost_asio/reference/buffered_stream/buffered_stream/overload2.html @@ -40,7 +40,7 @@ buffered_stream(
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/buffered_stream/close.html b/doc/html/boost_asio/reference/buffered_stream/close.html index ce1d2cd49a..fd63dc692f 100644 --- a/doc/html/boost_asio/reference/buffered_stream/close.html +++ b/doc/html/boost_asio/reference/buffered_stream/close.html @@ -41,7 +41,7 @@ void
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/buffered_stream/close/overload1.html b/doc/html/boost_asio/reference/buffered_stream/close/overload1.html index 332e376e26..46bf19dce6 100644 --- a/doc/html/boost_asio/reference/buffered_stream/close/overload1.html +++ b/doc/html/boost_asio/reference/buffered_stream/close/overload1.html @@ -35,7 +35,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/buffered_stream/close/overload2.html b/doc/html/boost_asio/reference/buffered_stream/close/overload2.html index e65f575729..2571ebae94 100644 --- a/doc/html/boost_asio/reference/buffered_stream/close/overload2.html +++ b/doc/html/boost_asio/reference/buffered_stream/close/overload2.html @@ -36,7 +36,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/buffered_stream/executor_type.html b/doc/html/boost_asio/reference/buffered_stream/executor_type.html index ed7e3b0646..99842033d9 100644 --- a/doc/html/boost_asio/reference/buffered_stream/executor_type.html +++ b/doc/html/boost_asio/reference/buffered_stream/executor_type.html @@ -46,7 +46,7 @@ The
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/buffered_stream/fill.html b/doc/html/boost_asio/reference/buffered_stream/fill.html index c8bc58712c..b5141eeb16 100644 --- a/doc/html/boost_asio/reference/buffered_stream/fill.html +++ b/doc/html/boost_asio/reference/buffered_stream/fill.html @@ -46,7 +46,7 @@ Fill the buffer
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/buffered_stream/fill/overload1.html b/doc/html/boost_asio/reference/buffered_stream/fill/overload1.html index 11c65402e8..00d17c01ab 100644 --- a/doc/html/boost_asio/reference/buffered_stream/fill/overload1.html +++ b/doc/html/boost_asio/reference/buffered_stream/fill/overload1.html @@ -36,7 +36,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/buffered_stream/fill/overload2.html b/doc/html/boost_asio/reference/buffered_stream/fill/overload2.html index a9ecbd6552..08c1cbf176 100644 --- a/doc/html/boost_asio/reference/buffered_stream/fill/overload2.html +++ b/doc/html/boost_asio/reference/buffered_stream/fill/overload2.html @@ -37,7 +37,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/buffered_stream/flush.html b/doc/html/boost_asio/reference/buffered_stream/flush.html index 79ddc268e5..efaa7e0b06 100644 --- a/doc/html/boost_asio/reference/buffered_stream/flush.html +++ b/doc/html/boost_asio/reference/buffered_stream/flush.html @@ -47,7 +47,7 @@ Flush all
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/buffered_stream/flush/overload1.html b/doc/html/boost_asio/reference/buffered_stream/flush/overload1.html index c4a85d48fc..bad0dffd1c 100644 --- a/doc/html/boost_asio/reference/buffered_stream/flush/overload1.html +++ b/doc/html/boost_asio/reference/buffered_stream/flush/overload1.html @@ -37,7 +37,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/buffered_stream/flush/overload2.html b/doc/html/boost_asio/reference/buffered_stream/flush/overload2.html index 4f4d8dbc1c..5d62b8a88e 100644 --- a/doc/html/boost_asio/reference/buffered_stream/flush/overload2.html +++ b/doc/html/boost_asio/reference/buffered_stream/flush/overload2.html @@ -38,7 +38,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/buffered_stream/get_executor.html b/doc/html/boost_asio/reference/buffered_stream/get_executor.html index d4bceb9dee..cf2ae02a3e 100644 --- a/doc/html/boost_asio/reference/buffered_stream/get_executor.html +++ b/doc/html/boost_asio/reference/buffered_stream/get_executor.html @@ -36,7 +36,7 @@ Get
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/buffered_stream/get_io_context.html b/doc/html/boost_asio/reference/buffered_stream/get_io_context.html index 4569e9bd01..44b69e677e 100644 --- a/doc/html/boost_asio/reference/buffered_stream/get_io_context.html +++ b/doc/html/boost_asio/reference/buffered_stream/get_io_context.html @@ -37,7 +37,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/buffered_stream/get_io_service.html b/doc/html/boost_asio/reference/buffered_stream/get_io_service.html index 916280671a..8057fcf505 100644 --- a/doc/html/boost_asio/reference/buffered_stream/get_io_service.html +++ b/doc/html/boost_asio/reference/buffered_stream/get_io_service.html @@ -37,7 +37,7 @@
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/buffered_stream/in_avail.html b/doc/html/boost_asio/reference/buffered_stream/in_avail.html index ed0c06b5da..b09aa47332 100644 --- a/doc/html/boost_asio/reference/buffered_stream/in_avail.html +++ b/doc/html/boost_asio/reference/buffered_stream/in_avail.html @@ -41,7 +41,7 @@ std::size_t
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/buffered_stream/in_avail/overload1.html b/doc/html/boost_asio/reference/buffered_stream/in_avail/overload1.html index 04964fe992..ac7d080d0f 100644 --- a/doc/html/boost_asio/reference/buffered_stream/in_avail/overload1.html +++ b/doc/html/boost_asio/reference/buffered_stream/in_avail/overload1.html @@ -35,7 +35,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/buffered_stream/in_avail/overload2.html b/doc/html/boost_asio/reference/buffered_stream/in_avail/overload2.html index cd7745d47a..f40e2c7c6e 100644 --- a/doc/html/boost_asio/reference/buffered_stream/in_avail/overload2.html +++ b/doc/html/boost_asio/reference/buffered_stream/in_avail/overload2.html @@ -36,7 +36,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/buffered_stream/lowest_layer.html b/doc/html/boost_asio/reference/buffered_stream/lowest_layer.html index d9b6bfe046..13445cab47 100644 --- a/doc/html/boost_asio/reference/buffered_stream/lowest_layer.html +++ b/doc/html/boost_asio/reference/buffered_stream/lowest_layer.html @@ -43,7 +43,7 @@ Get
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/buffered_stream/lowest_layer/overload1.html b/doc/html/boost_asio/reference/buffered_stream/lowest_layer/overload1.html index bdf11d488b..c4f3cb1524 100644 --- a/doc/html/boost_asio/reference/buffered_stream/lowest_layer/overload1.html +++ b/doc/html/boost_asio/reference/buffered_stream/lowest_layer/overload1.html @@ -35,7 +35,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/buffered_stream/lowest_layer/overload2.html b/doc/html/boost_asio/reference/buffered_stream/lowest_layer/overload2.html index 52b9d7df7e..93942fa2eb 100644 --- a/doc/html/boost_asio/reference/buffered_stream/lowest_layer/overload2.html +++ b/doc/html/boost_asio/reference/buffered_stream/lowest_layer/overload2.html @@ -35,7 +35,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/buffered_stream/lowest_layer_type.html b/doc/html/boost_asio/reference/buffered_stream/lowest_layer_type.html index 56666f8499..9217f48dc7 100644 --- a/doc/html/boost_asio/reference/buffered_stream/lowest_layer_type.html +++ b/doc/html/boost_asio/reference/buffered_stream/lowest_layer_type.html @@ -46,7 +46,7 @@ The
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/buffered_stream/next_layer.html b/doc/html/boost_asio/reference/buffered_stream/next_layer.html index bab66c327e..8689cae38c 100644 --- a/doc/html/boost_asio/reference/buffered_stream/next_layer.html +++ b/doc/html/boost_asio/reference/buffered_stream/next_layer.html @@ -36,7 +36,7 @@ Get
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/buffered_stream/next_layer_type.html b/doc/html/boost_asio/reference/buffered_stream/next_layer_type.html index 29d3456fb4..70e6a7bcc7 100644 --- a/doc/html/boost_asio/reference/buffered_stream/next_layer_type.html +++ b/doc/html/boost_asio/reference/buffered_stream/next_layer_type.html @@ -46,7 +46,7 @@ The
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/buffered_stream/peek.html b/doc/html/boost_asio/reference/buffered_stream/peek.html index 14e0546fd4..e195529b13 100644 --- a/doc/html/boost_asio/reference/buffered_stream/peek.html +++ b/doc/html/boost_asio/reference/buffered_stream/peek.html @@ -52,7 +52,7 @@ std::size_t
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/buffered_stream/peek/overload1.html b/doc/html/boost_asio/reference/buffered_stream/peek/overload1.html index 180c59df86..d71f283e13 100644 --- a/doc/html/boost_asio/reference/buffered_stream/peek/overload1.html +++ b/doc/html/boost_asio/reference/buffered_stream/peek/overload1.html @@ -39,7 +39,7 @@ std::size_t peek(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/buffered_stream/peek/overload2.html b/doc/html/boost_asio/reference/buffered_stream/peek/overload2.html index f902270191..51351052b9 100644 --- a/doc/html/boost_asio/reference/buffered_stream/peek/overload2.html +++ b/doc/html/boost_asio/reference/buffered_stream/peek/overload2.html @@ -40,7 +40,7 @@ std::size_t peek(
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/buffered_stream/read_some.html b/doc/html/boost_asio/reference/buffered_stream/read_some.html index 2c57a2a45a..a89d7605d0 100644 --- a/doc/html/boost_asio/reference/buffered_stream/read_some.html +++ b/doc/html/boost_asio/reference/buffered_stream/read_some.html @@ -52,7 +52,7 @@ std::size_t
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/buffered_stream/read_some/overload1.html b/doc/html/boost_asio/reference/buffered_stream/read_some/overload1.html index f72fea85d1..52ffff3698 100644 --- a/doc/html/boost_asio/reference/buffered_stream/read_some/overload1.html +++ b/doc/html/boost_asio/reference/buffered_stream/read_some/overload1.html @@ -39,7 +39,7 @@ std::size_t read_some(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/buffered_stream/read_some/overload2.html b/doc/html/boost_asio/reference/buffered_stream/read_some/overload2.html index 4fe7c709b8..79dd1e3cad 100644 --- a/doc/html/boost_asio/reference/buffered_stream/read_some/overload2.html +++ b/doc/html/boost_asio/reference/buffered_stream/read_some/overload2.html @@ -40,7 +40,7 @@ std::size_t read_some(
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/buffered_stream/write_some.html b/doc/html/boost_asio/reference/buffered_stream/write_some.html index 7c4a94d20e..1e19677b1f 100644 --- a/doc/html/boost_asio/reference/buffered_stream/write_some.html +++ b/doc/html/boost_asio/reference/buffered_stream/write_some.html @@ -52,7 +52,7 @@ std::size_t
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/buffered_stream/write_some/overload1.html b/doc/html/boost_asio/reference/buffered_stream/write_some/overload1.html index ac361753c3..f9bf325f75 100644 --- a/doc/html/boost_asio/reference/buffered_stream/write_some/overload1.html +++ b/doc/html/boost_asio/reference/buffered_stream/write_some/overload1.html @@ -39,7 +39,7 @@ std::size_t write_some(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/buffered_stream/write_some/overload2.html b/doc/html/boost_asio/reference/buffered_stream/write_some/overload2.html index e1158846a7..e563a439b7 100644 --- a/doc/html/boost_asio/reference/buffered_stream/write_some/overload2.html +++ b/doc/html/boost_asio/reference/buffered_stream/write_some/overload2.html @@ -40,7 +40,7 @@ std::size_t write_some(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/buffered_write_stream.html b/doc/html/boost_asio/reference/buffered_write_stream.html index 2aa47c23c2..9a384bf4dc 100644 --- a/doc/html/boost_asio/reference/buffered_write_stream.html +++ b/doc/html/boost_asio/reference/buffered_write_stream.html @@ -393,7 +393,7 @@ class buffered_write_stream :
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/buffered_write_stream/async_flush.html b/doc/html/boost_asio/reference/buffered_write_stream/async_flush.html index e6df6ad4a4..59ed0a75a4 100644 --- a/doc/html/boost_asio/reference/buffered_write_stream/async_flush.html +++ b/doc/html/boost_asio/reference/buffered_write_stream/async_flush.html @@ -39,7 +39,7 @@ Start
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/buffered_write_stream/async_read_some.html b/doc/html/boost_asio/reference/buffered_write_stream/async_read_some.html index d9bc9f9dbc..b717a69a06 100644 --- a/doc/html/boost_asio/reference/buffered_write_stream/async_read_some.html +++ b/doc/html/boost_asio/reference/buffered_write_stream/async_read_some.html @@ -42,7 +42,7 @@ Start
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/buffered_write_stream/async_write_some.html b/doc/html/boost_asio/reference/buffered_write_stream/async_write_some.html index 377d8d0d52..297e4f5e7f 100644 --- a/doc/html/boost_asio/reference/buffered_write_stream/async_write_some.html +++ b/doc/html/boost_asio/reference/buffered_write_stream/async_write_some.html @@ -42,7 +42,7 @@ Start
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/buffered_write_stream/buffered_write_stream.html b/doc/html/boost_asio/reference/buffered_write_stream/buffered_write_stream.html index 9e0129fc43..4e52460801 100644 --- a/doc/html/boost_asio/reference/buffered_write_stream/buffered_write_stream.html +++ b/doc/html/boost_asio/reference/buffered_write_stream/buffered_write_stream.html @@ -47,7 +47,7 @@ template<
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/buffered_write_stream/buffered_write_stream/overload1.html b/doc/html/boost_asio/reference/buffered_write_stream/buffered_write_stream/overload1.html index aa4c9c407b..5dbf48e791 100644 --- a/doc/html/boost_asio/reference/buffered_write_stream/buffered_write_stream/overload1.html +++ b/doc/html/boost_asio/reference/buffered_write_stream/buffered_write_stream/overload1.html @@ -38,7 +38,7 @@ buffered_write_stream(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/buffered_write_stream/buffered_write_stream/overload2.html b/doc/html/boost_asio/reference/buffered_write_stream/buffered_write_stream/overload2.html index 13f5fc576d..c303ab7b10 100644 --- a/doc/html/boost_asio/reference/buffered_write_stream/buffered_write_stream/overload2.html +++ b/doc/html/boost_asio/reference/buffered_write_stream/buffered_write_stream/overload2.html @@ -39,7 +39,7 @@ buffered_write_stream(
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/buffered_write_stream/close.html b/doc/html/boost_asio/reference/buffered_write_stream/close.html index 31c2be9c63..f03de1bc76 100644 --- a/doc/html/boost_asio/reference/buffered_write_stream/close.html +++ b/doc/html/boost_asio/reference/buffered_write_stream/close.html @@ -41,7 +41,7 @@ void
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/buffered_write_stream/close/overload1.html b/doc/html/boost_asio/reference/buffered_write_stream/close/overload1.html index 64803285df..61585c73cc 100644 --- a/doc/html/boost_asio/reference/buffered_write_stream/close/overload1.html +++ b/doc/html/boost_asio/reference/buffered_write_stream/close/overload1.html @@ -35,7 +35,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/buffered_write_stream/close/overload2.html b/doc/html/boost_asio/reference/buffered_write_stream/close/overload2.html index bba7141325..531f6c73ec 100644 --- a/doc/html/boost_asio/reference/buffered_write_stream/close/overload2.html +++ b/doc/html/boost_asio/reference/buffered_write_stream/close/overload2.html @@ -36,7 +36,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/buffered_write_stream/default_buffer_size.html b/doc/html/boost_asio/reference/buffered_write_stream/default_buffer_size.html index 720ca22a9f..6c077eaf98 100644 --- a/doc/html/boost_asio/reference/buffered_write_stream/default_buffer_size.html +++ b/doc/html/boost_asio/reference/buffered_write_stream/default_buffer_size.html @@ -36,7 +36,7 @@ The
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/buffered_write_stream/executor_type.html b/doc/html/boost_asio/reference/buffered_write_stream/executor_type.html index b2b65db707..f00a0ce439 100644 --- a/doc/html/boost_asio/reference/buffered_write_stream/executor_type.html +++ b/doc/html/boost_asio/reference/buffered_write_stream/executor_type.html @@ -46,7 +46,7 @@ The
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/buffered_write_stream/flush.html b/doc/html/boost_asio/reference/buffered_write_stream/flush.html index 224ab538fb..dc656e3d3b 100644 --- a/doc/html/boost_asio/reference/buffered_write_stream/flush.html +++ b/doc/html/boost_asio/reference/buffered_write_stream/flush.html @@ -48,7 +48,7 @@ Flush
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/buffered_write_stream/flush/overload1.html b/doc/html/boost_asio/reference/buffered_write_stream/flush/overload1.html index 8c158e3354..f5f8a25d1a 100644 --- a/doc/html/boost_asio/reference/buffered_write_stream/flush/overload1.html +++ b/doc/html/boost_asio/reference/buffered_write_stream/flush/overload1.html @@ -37,7 +37,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/buffered_write_stream/flush/overload2.html b/doc/html/boost_asio/reference/buffered_write_stream/flush/overload2.html index f772fb66f1..872f0cd828 100644 --- a/doc/html/boost_asio/reference/buffered_write_stream/flush/overload2.html +++ b/doc/html/boost_asio/reference/buffered_write_stream/flush/overload2.html @@ -38,7 +38,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/buffered_write_stream/get_executor.html b/doc/html/boost_asio/reference/buffered_write_stream/get_executor.html index 7d872428c1..f3521ef221 100644 --- a/doc/html/boost_asio/reference/buffered_write_stream/get_executor.html +++ b/doc/html/boost_asio/reference/buffered_write_stream/get_executor.html @@ -36,7 +36,7 @@ Get
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/buffered_write_stream/get_io_context.html b/doc/html/boost_asio/reference/buffered_write_stream/get_io_context.html index a7fb6c5dc0..16397d339c 100644 --- a/doc/html/boost_asio/reference/buffered_write_stream/get_io_context.html +++ b/doc/html/boost_asio/reference/buffered_write_stream/get_io_context.html @@ -37,7 +37,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/buffered_write_stream/get_io_service.html b/doc/html/boost_asio/reference/buffered_write_stream/get_io_service.html index 78c4cec811..17296aa1ee 100644 --- a/doc/html/boost_asio/reference/buffered_write_stream/get_io_service.html +++ b/doc/html/boost_asio/reference/buffered_write_stream/get_io_service.html @@ -37,7 +37,7 @@
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/buffered_write_stream/in_avail.html b/doc/html/boost_asio/reference/buffered_write_stream/in_avail.html index 2ba2f17a3a..83421348b1 100644 --- a/doc/html/boost_asio/reference/buffered_write_stream/in_avail.html +++ b/doc/html/boost_asio/reference/buffered_write_stream/in_avail.html @@ -41,7 +41,7 @@ std::size_t
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/buffered_write_stream/in_avail/overload1.html b/doc/html/boost_asio/reference/buffered_write_stream/in_avail/overload1.html index 2510ccecc9..7db75868db 100644 --- a/doc/html/boost_asio/reference/buffered_write_stream/in_avail/overload1.html +++ b/doc/html/boost_asio/reference/buffered_write_stream/in_avail/overload1.html @@ -35,7 +35,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/buffered_write_stream/in_avail/overload2.html b/doc/html/boost_asio/reference/buffered_write_stream/in_avail/overload2.html index 678ec212c4..d07b01379e 100644 --- a/doc/html/boost_asio/reference/buffered_write_stream/in_avail/overload2.html +++ b/doc/html/boost_asio/reference/buffered_write_stream/in_avail/overload2.html @@ -36,7 +36,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/buffered_write_stream/lowest_layer.html b/doc/html/boost_asio/reference/buffered_write_stream/lowest_layer.html index fb1962c0f6..45d0e4a32d 100644 --- a/doc/html/boost_asio/reference/buffered_write_stream/lowest_layer.html +++ b/doc/html/boost_asio/reference/buffered_write_stream/lowest_layer.html @@ -43,7 +43,7 @@ Get
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/buffered_write_stream/lowest_layer/overload1.html b/doc/html/boost_asio/reference/buffered_write_stream/lowest_layer/overload1.html index 46d33650ab..1e04855452 100644 --- a/doc/html/boost_asio/reference/buffered_write_stream/lowest_layer/overload1.html +++ b/doc/html/boost_asio/reference/buffered_write_stream/lowest_layer/overload1.html @@ -35,7 +35,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/buffered_write_stream/lowest_layer/overload2.html b/doc/html/boost_asio/reference/buffered_write_stream/lowest_layer/overload2.html index ca7be2cb76..fffd32d4b2 100644 --- a/doc/html/boost_asio/reference/buffered_write_stream/lowest_layer/overload2.html +++ b/doc/html/boost_asio/reference/buffered_write_stream/lowest_layer/overload2.html @@ -35,7 +35,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/buffered_write_stream/lowest_layer_type.html b/doc/html/boost_asio/reference/buffered_write_stream/lowest_layer_type.html index f1087aba6e..2e511a317d 100644 --- a/doc/html/boost_asio/reference/buffered_write_stream/lowest_layer_type.html +++ b/doc/html/boost_asio/reference/buffered_write_stream/lowest_layer_type.html @@ -46,7 +46,7 @@ The
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/buffered_write_stream/next_layer.html b/doc/html/boost_asio/reference/buffered_write_stream/next_layer.html index c223efc141..493a772226 100644 --- a/doc/html/boost_asio/reference/buffered_write_stream/next_layer.html +++ b/doc/html/boost_asio/reference/buffered_write_stream/next_layer.html @@ -36,7 +36,7 @@ Get
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/buffered_write_stream/next_layer_type.html b/doc/html/boost_asio/reference/buffered_write_stream/next_layer_type.html index 6fd8fbee93..3e2f2dd3ce 100644 --- a/doc/html/boost_asio/reference/buffered_write_stream/next_layer_type.html +++ b/doc/html/boost_asio/reference/buffered_write_stream/next_layer_type.html @@ -46,7 +46,7 @@ The
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/buffered_write_stream/peek.html b/doc/html/boost_asio/reference/buffered_write_stream/peek.html index 5ae9b7f65d..04af52184d 100644 --- a/doc/html/boost_asio/reference/buffered_write_stream/peek.html +++ b/doc/html/boost_asio/reference/buffered_write_stream/peek.html @@ -52,7 +52,7 @@ std::size_t
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/buffered_write_stream/peek/overload1.html b/doc/html/boost_asio/reference/buffered_write_stream/peek/overload1.html index dae2ae2214..110497cbe7 100644 --- a/doc/html/boost_asio/reference/buffered_write_stream/peek/overload1.html +++ b/doc/html/boost_asio/reference/buffered_write_stream/peek/overload1.html @@ -39,7 +39,7 @@ std::size_t peek(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/buffered_write_stream/peek/overload2.html b/doc/html/boost_asio/reference/buffered_write_stream/peek/overload2.html index f28f05dc9e..0407d6ce43 100644 --- a/doc/html/boost_asio/reference/buffered_write_stream/peek/overload2.html +++ b/doc/html/boost_asio/reference/buffered_write_stream/peek/overload2.html @@ -40,7 +40,7 @@ std::size_t peek(
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/buffered_write_stream/read_some.html b/doc/html/boost_asio/reference/buffered_write_stream/read_some.html index e46dddf330..e543f69dab 100644 --- a/doc/html/boost_asio/reference/buffered_write_stream/read_some.html +++ b/doc/html/boost_asio/reference/buffered_write_stream/read_some.html @@ -52,7 +52,7 @@ std::size_t
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/buffered_write_stream/read_some/overload1.html b/doc/html/boost_asio/reference/buffered_write_stream/read_some/overload1.html index bd7e100655..f6b54bd405 100644 --- a/doc/html/boost_asio/reference/buffered_write_stream/read_some/overload1.html +++ b/doc/html/boost_asio/reference/buffered_write_stream/read_some/overload1.html @@ -39,7 +39,7 @@ std::size_t read_some(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/buffered_write_stream/read_some/overload2.html b/doc/html/boost_asio/reference/buffered_write_stream/read_some/overload2.html index bf8baefdb1..41d8861e61 100644 --- a/doc/html/boost_asio/reference/buffered_write_stream/read_some/overload2.html +++ b/doc/html/boost_asio/reference/buffered_write_stream/read_some/overload2.html @@ -40,7 +40,7 @@ std::size_t read_some(
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/buffered_write_stream/write_some.html b/doc/html/boost_asio/reference/buffered_write_stream/write_some.html index 7eca6a8246..c6df7ce37c 100644 --- a/doc/html/boost_asio/reference/buffered_write_stream/write_some.html +++ b/doc/html/boost_asio/reference/buffered_write_stream/write_some.html @@ -52,7 +52,7 @@ std::size_t
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/buffered_write_stream/write_some/overload1.html b/doc/html/boost_asio/reference/buffered_write_stream/write_some/overload1.html index b38f0477f1..9e8b94d165 100644 --- a/doc/html/boost_asio/reference/buffered_write_stream/write_some/overload1.html +++ b/doc/html/boost_asio/reference/buffered_write_stream/write_some/overload1.html @@ -39,7 +39,7 @@ std::size_t write_some(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/buffered_write_stream/write_some/overload2.html b/doc/html/boost_asio/reference/buffered_write_stream/write_some/overload2.html index 852458e53e..e68b013fa7 100644 --- a/doc/html/boost_asio/reference/buffered_write_stream/write_some/overload2.html +++ b/doc/html/boost_asio/reference/buffered_write_stream/write_some/overload2.html @@ -40,7 +40,7 @@ std::size_t write_some(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/buffers_begin.html b/doc/html/boost_asio/reference/buffers_begin.html index 2b0c73b0fd..27c65aed4d 100644 --- a/doc/html/boost_asio/reference/buffers_begin.html +++ b/doc/html/boost_asio/reference/buffers_begin.html @@ -49,7 +49,7 @@ buffers_iterator< BufferSequence > buffers_begin(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/buffers_end.html b/doc/html/boost_asio/reference/buffers_end.html index 2f3a6bf5ea..e5c138b335 100644 --- a/doc/html/boost_asio/reference/buffers_end.html +++ b/doc/html/boost_asio/reference/buffers_end.html @@ -49,7 +49,7 @@ buffers_iterator< BufferSequence > buffers_end(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/buffers_iterator.html b/doc/html/boost_asio/reference/buffers_iterator.html index dc4b192ad8..3090adcf48 100644 --- a/doc/html/boost_asio/reference/buffers_iterator.html +++ b/doc/html/boost_asio/reference/buffers_iterator.html @@ -402,7 +402,7 @@ class buffers_iterator
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/buffers_iterator/begin.html b/doc/html/boost_asio/reference/buffers_iterator/begin.html index 173b65278b..9adda3502e 100644 --- a/doc/html/boost_asio/reference/buffers_iterator/begin.html +++ b/doc/html/boost_asio/reference/buffers_iterator/begin.html @@ -37,7 +37,7 @@ Construct
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/buffers_iterator/buffers_iterator.html b/doc/html/boost_asio/reference/buffers_iterator/buffers_iterator.html index 3fbc57890c..ede32f5d4f 100644 --- a/doc/html/boost_asio/reference/buffers_iterator/buffers_iterator.html +++ b/doc/html/boost_asio/reference/buffers_iterator/buffers_iterator.html @@ -36,7 +36,7 @@ Default
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/buffers_iterator/difference_type.html b/doc/html/boost_asio/reference/buffers_iterator/difference_type.html index 2ced1a56be..9b7766ccf7 100644 --- a/doc/html/boost_asio/reference/buffers_iterator/difference_type.html +++ b/doc/html/boost_asio/reference/buffers_iterator/difference_type.html @@ -46,7 +46,7 @@ The
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/buffers_iterator/end.html b/doc/html/boost_asio/reference/buffers_iterator/end.html index e0e196511a..6acd3be5b4 100644 --- a/doc/html/boost_asio/reference/buffers_iterator/end.html +++ b/doc/html/boost_asio/reference/buffers_iterator/end.html @@ -37,7 +37,7 @@ Construct an
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/buffers_iterator/iterator_category.html b/doc/html/boost_asio/reference/buffers_iterator/iterator_category.html index da137044d1..254f8339ca 100644 --- a/doc/html/boost_asio/reference/buffers_iterator/iterator_category.html +++ b/doc/html/boost_asio/reference/buffers_iterator/iterator_category.html @@ -46,7 +46,7 @@ The
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/buffers_iterator/operator__star_.html b/doc/html/boost_asio/reference/buffers_iterator/operator__star_.html index 8cb6af164b..ff2dd1c4f5 100644 --- a/doc/html/boost_asio/reference/buffers_iterator/operator__star_.html +++ b/doc/html/boost_asio/reference/buffers_iterator/operator__star_.html @@ -37,7 +37,7 @@ Dereference
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/buffers_iterator/operator_arrow_.html b/doc/html/boost_asio/reference/buffers_iterator/operator_arrow_.html index cf217972db..7723928e14 100644 --- a/doc/html/boost_asio/reference/buffers_iterator/operator_arrow_.html +++ b/doc/html/boost_asio/reference/buffers_iterator/operator_arrow_.html @@ -36,7 +36,7 @@ Dereference
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/buffers_iterator/operator_eq__eq_.html b/doc/html/boost_asio/reference/buffers_iterator/operator_eq__eq_.html index b4c005a10a..cfce62d53d 100644 --- a/doc/html/boost_asio/reference/buffers_iterator/operator_eq__eq_.html +++ b/doc/html/boost_asio/reference/buffers_iterator/operator_eq__eq_.html @@ -48,7 +48,7 @@ Test
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/buffers_iterator/operator_gt_.html b/doc/html/boost_asio/reference/buffers_iterator/operator_gt_.html index e11974ca47..169fbcd5a2 100644 --- a/doc/html/boost_asio/reference/buffers_iterator/operator_gt_.html +++ b/doc/html/boost_asio/reference/buffers_iterator/operator_gt_.html @@ -48,7 +48,7 @@ Compare
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/buffers_iterator/operator_gt__eq_.html b/doc/html/boost_asio/reference/buffers_iterator/operator_gt__eq_.html index e2fd036173..b477d3155b 100644 --- a/doc/html/boost_asio/reference/buffers_iterator/operator_gt__eq_.html +++ b/doc/html/boost_asio/reference/buffers_iterator/operator_gt__eq_.html @@ -48,7 +48,7 @@ Compare
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/buffers_iterator/operator_lb__rb_.html b/doc/html/boost_asio/reference/buffers_iterator/operator_lb__rb_.html index bc75d47595..c2c95be566 100644 --- a/doc/html/boost_asio/reference/buffers_iterator/operator_lb__rb_.html +++ b/doc/html/boost_asio/reference/buffers_iterator/operator_lb__rb_.html @@ -37,7 +37,7 @@ Access
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/buffers_iterator/operator_lt_.html b/doc/html/boost_asio/reference/buffers_iterator/operator_lt_.html index ea51249fdd..0dd634d606 100644 --- a/doc/html/boost_asio/reference/buffers_iterator/operator_lt_.html +++ b/doc/html/boost_asio/reference/buffers_iterator/operator_lt_.html @@ -48,7 +48,7 @@ Compare
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/buffers_iterator/operator_lt__eq_.html b/doc/html/boost_asio/reference/buffers_iterator/operator_lt__eq_.html index c2c29eed5c..acbe27833c 100644 --- a/doc/html/boost_asio/reference/buffers_iterator/operator_lt__eq_.html +++ b/doc/html/boost_asio/reference/buffers_iterator/operator_lt__eq_.html @@ -48,7 +48,7 @@ Compare
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/buffers_iterator/operator_minus_.html b/doc/html/boost_asio/reference/buffers_iterator/operator_minus_.html index 783d31c724..318ced4e7d 100644 --- a/doc/html/boost_asio/reference/buffers_iterator/operator_minus_.html +++ b/doc/html/boost_asio/reference/buffers_iterator/operator_minus_.html @@ -44,7 +44,7 @@ friend std::ptrdiff_t -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/buffers_iterator/operator_minus_/overload1.html b/doc/html/boost_asio/reference/buffers_iterator/operator_minus_/overload1.html index d245bdbf24..3fa9845327 100644 --- a/doc/html/boost_asio/reference/buffers_iterator/operator_minus_/overload1.html +++ b/doc/html/boost_asio/reference/buffers_iterator/operator_minus_/overload1.html @@ -47,7 +47,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/buffers_iterator/operator_minus_/overload2.html b/doc/html/boost_asio/reference/buffers_iterator/operator_minus_/overload2.html index b37804c7df..4ceaedd88b 100644 --- a/doc/html/boost_asio/reference/buffers_iterator/operator_minus_/overload2.html +++ b/doc/html/boost_asio/reference/buffers_iterator/operator_minus_/overload2.html @@ -47,7 +47,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/buffers_iterator/operator_minus__eq_.html b/doc/html/boost_asio/reference/buffers_iterator/operator_minus__eq_.html index 2297dcaeed..c5920fba3c 100644 --- a/doc/html/boost_asio/reference/buffers_iterator/operator_minus__eq_.html +++ b/doc/html/boost_asio/reference/buffers_iterator/operator_minus__eq_.html @@ -37,7 +37,7 @@ Subtraction
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/buffers_iterator/operator_minus__minus_.html b/doc/html/boost_asio/reference/buffers_iterator/operator_minus__minus_.html index ad92404341..9244f23472 100644 --- a/doc/html/boost_asio/reference/buffers_iterator/operator_minus__minus_.html +++ b/doc/html/boost_asio/reference/buffers_iterator/operator_minus__minus_.html @@ -44,7 +44,7 @@ Decrement
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/buffers_iterator/operator_minus__minus_/overload1.html b/doc/html/boost_asio/reference/buffers_iterator/operator_minus__minus_/overload1.html index 3661578761..023e05da45 100644 --- a/doc/html/boost_asio/reference/buffers_iterator/operator_minus__minus_/overload1.html +++ b/doc/html/boost_asio/reference/buffers_iterator/operator_minus__minus_/overload1.html @@ -35,7 +35,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/buffers_iterator/operator_minus__minus_/overload2.html b/doc/html/boost_asio/reference/buffers_iterator/operator_minus__minus_/overload2.html index 4bff4c6bdd..923d60a104 100644 --- a/doc/html/boost_asio/reference/buffers_iterator/operator_minus__minus_/overload2.html +++ b/doc/html/boost_asio/reference/buffers_iterator/operator_minus__minus_/overload2.html @@ -36,7 +36,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/buffers_iterator/operator_not__eq_.html b/doc/html/boost_asio/reference/buffers_iterator/operator_not__eq_.html index 7374642a62..734c625e63 100644 --- a/doc/html/boost_asio/reference/buffers_iterator/operator_not__eq_.html +++ b/doc/html/boost_asio/reference/buffers_iterator/operator_not__eq_.html @@ -48,7 +48,7 @@ Test
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/buffers_iterator/operator_plus_.html b/doc/html/boost_asio/reference/buffers_iterator/operator_plus_.html index edae9ada7f..2453a72e42 100644 --- a/doc/html/boost_asio/reference/buffers_iterator/operator_plus_.html +++ b/doc/html/boost_asio/reference/buffers_iterator/operator_plus_.html @@ -44,7 +44,7 @@ friend buffers_iterator -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/buffers_iterator/operator_plus_/overload1.html b/doc/html/boost_asio/reference/buffers_iterator/operator_plus_/overload1.html index 0f7a4f4d8c..58f73fe6f0 100644 --- a/doc/html/boost_asio/reference/buffers_iterator/operator_plus_/overload1.html +++ b/doc/html/boost_asio/reference/buffers_iterator/operator_plus_/overload1.html @@ -47,7 +47,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/buffers_iterator/operator_plus_/overload2.html b/doc/html/boost_asio/reference/buffers_iterator/operator_plus_/overload2.html index af4e0cfb78..13a3aac338 100644 --- a/doc/html/boost_asio/reference/buffers_iterator/operator_plus_/overload2.html +++ b/doc/html/boost_asio/reference/buffers_iterator/operator_plus_/overload2.html @@ -47,7 +47,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/buffers_iterator/operator_plus__eq_.html b/doc/html/boost_asio/reference/buffers_iterator/operator_plus__eq_.html index 1ead8b7fa0..755792439c 100644 --- a/doc/html/boost_asio/reference/buffers_iterator/operator_plus__eq_.html +++ b/doc/html/boost_asio/reference/buffers_iterator/operator_plus__eq_.html @@ -37,7 +37,7 @@ Addition
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/buffers_iterator/operator_plus__plus_.html b/doc/html/boost_asio/reference/buffers_iterator/operator_plus__plus_.html index 34feaf97f6..a7c818ea9c 100644 --- a/doc/html/boost_asio/reference/buffers_iterator/operator_plus__plus_.html +++ b/doc/html/boost_asio/reference/buffers_iterator/operator_plus__plus_.html @@ -44,7 +44,7 @@ Increment
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/buffers_iterator/operator_plus__plus_/overload1.html b/doc/html/boost_asio/reference/buffers_iterator/operator_plus__plus_/overload1.html index 841105872d..61552966cc 100644 --- a/doc/html/boost_asio/reference/buffers_iterator/operator_plus__plus_/overload1.html +++ b/doc/html/boost_asio/reference/buffers_iterator/operator_plus__plus_/overload1.html @@ -35,7 +35,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/buffers_iterator/operator_plus__plus_/overload2.html b/doc/html/boost_asio/reference/buffers_iterator/operator_plus__plus_/overload2.html index 0f8a07d8e3..e3f9001d1b 100644 --- a/doc/html/boost_asio/reference/buffers_iterator/operator_plus__plus_/overload2.html +++ b/doc/html/boost_asio/reference/buffers_iterator/operator_plus__plus_/overload2.html @@ -36,7 +36,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/buffers_iterator/pointer.html b/doc/html/boost_asio/reference/buffers_iterator/pointer.html index 2df4edbdc6..7e01f0c219 100644 --- a/doc/html/boost_asio/reference/buffers_iterator/pointer.html +++ b/doc/html/boost_asio/reference/buffers_iterator/pointer.html @@ -51,7 +51,7 @@ The
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/buffers_iterator/reference.html b/doc/html/boost_asio/reference/buffers_iterator/reference.html index 3c29e10772..00ca24c5b6 100644 --- a/doc/html/boost_asio/reference/buffers_iterator/reference.html +++ b/doc/html/boost_asio/reference/buffers_iterator/reference.html @@ -51,7 +51,7 @@ The
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/buffers_iterator/value_type.html b/doc/html/boost_asio/reference/buffers_iterator/value_type.html index f4ef15cc3e..900519abe9 100644 --- a/doc/html/boost_asio/reference/buffers_iterator/value_type.html +++ b/doc/html/boost_asio/reference/buffers_iterator/value_type.html @@ -46,7 +46,7 @@ The
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/connect.html b/doc/html/boost_asio/reference/connect.html index 5ce57c2e69..4b3eb7b222 100644 --- a/doc/html/boost_asio/reference/connect.html +++ b/doc/html/boost_asio/reference/connect.html @@ -170,7 +170,7 @@ Iterator
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/connect/overload1.html b/doc/html/boost_asio/reference/connect/overload1.html index fe7d7b1742..b90227468f 100644 --- a/doc/html/boost_asio/reference/connect/overload1.html +++ b/doc/html/boost_asio/reference/connect/overload1.html @@ -96,7 +96,7 @@ boost::asio::connect(s, r.resolve(q));
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/connect/overload10.html b/doc/html/boost_asio/reference/connect/overload10.html index 7a1fbc08cd..3ce61952a7 100644 --- a/doc/html/boost_asio/reference/connect/overload10.html +++ b/doc/html/boost_asio/reference/connect/overload10.html @@ -111,7 +111,7 @@ Iterator connect(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/connect/overload11.html b/doc/html/boost_asio/reference/connect/overload11.html index 3341d668a9..151911a0de 100644 --- a/doc/html/boost_asio/reference/connect/overload11.html +++ b/doc/html/boost_asio/reference/connect/overload11.html @@ -144,7 +144,7 @@ std::cout << "Connected to: " << i->endpoint() << std::endl
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/connect/overload12.html b/doc/html/boost_asio/reference/connect/overload12.html index d9762844b8..a35992a45b 100644 --- a/doc/html/boost_asio/reference/connect/overload12.html +++ b/doc/html/boost_asio/reference/connect/overload12.html @@ -145,7 +145,7 @@ else
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/connect/overload2.html b/doc/html/boost_asio/reference/connect/overload2.html index 5a0838ee84..38d9f67629 100644 --- a/doc/html/boost_asio/reference/connect/overload2.html +++ b/doc/html/boost_asio/reference/connect/overload2.html @@ -94,7 +94,7 @@ if (ec)
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/connect/overload3.html b/doc/html/boost_asio/reference/connect/overload3.html index 12a723bf98..182255a79f 100644 --- a/doc/html/boost_asio/reference/connect/overload3.html +++ b/doc/html/boost_asio/reference/connect/overload3.html @@ -98,7 +98,7 @@ Iterator connect(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/connect/overload4.html b/doc/html/boost_asio/reference/connect/overload4.html index f1112e5465..c674f7db56 100644 --- a/doc/html/boost_asio/reference/connect/overload4.html +++ b/doc/html/boost_asio/reference/connect/overload4.html @@ -90,7 +90,7 @@ Iterator connect(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/connect/overload5.html b/doc/html/boost_asio/reference/connect/overload5.html index 02266e5d2b..fc8e45fd3f 100644 --- a/doc/html/boost_asio/reference/connect/overload5.html +++ b/doc/html/boost_asio/reference/connect/overload5.html @@ -101,7 +101,7 @@ boost::asio::connect(s, e.begin(), e.end());
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/connect/overload6.html b/doc/html/boost_asio/reference/connect/overload6.html index 2a3b44b86b..b4f8b5c56e 100644 --- a/doc/html/boost_asio/reference/connect/overload6.html +++ b/doc/html/boost_asio/reference/connect/overload6.html @@ -99,7 +99,7 @@ if (ec)
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/connect/overload7.html b/doc/html/boost_asio/reference/connect/overload7.html index 0bbe4523f5..6d25e5947b 100644 --- a/doc/html/boost_asio/reference/connect/overload7.html +++ b/doc/html/boost_asio/reference/connect/overload7.html @@ -139,7 +139,7 @@ std::cout << "Connected to: " << e << std::endl;
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/connect/overload8.html b/doc/html/boost_asio/reference/connect/overload8.html index 8af74c8b64..13153f852b 100644 --- a/doc/html/boost_asio/reference/connect/overload8.html +++ b/doc/html/boost_asio/reference/connect/overload8.html @@ -140,7 +140,7 @@ else
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/connect/overload9.html b/doc/html/boost_asio/reference/connect/overload9.html index 4f7eb4b891..cd3a1d0dcd 100644 --- a/doc/html/boost_asio/reference/connect/overload9.html +++ b/doc/html/boost_asio/reference/connect/overload9.html @@ -119,7 +119,7 @@ Iterator connect(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/const_buffer.html b/doc/html/boost_asio/reference/const_buffer.html index 0ccb28196e..7d99a86d7a 100644 --- a/doc/html/boost_asio/reference/const_buffer.html +++ b/doc/html/boost_asio/reference/const_buffer.html @@ -181,7 +181,7 @@ const unsigned char* p1 = static_cast<const unsigned char*>(b1.data());
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/const_buffer/const_buffer.html b/doc/html/boost_asio/reference/const_buffer/const_buffer.html index 59f177d5c6..b059d3ce30 100644 --- a/doc/html/boost_asio/reference/const_buffer/const_buffer.html +++ b/doc/html/boost_asio/reference/const_buffer/const_buffer.html @@ -52,7 +52,7 @@ Construct
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/const_buffer/const_buffer/overload1.html b/doc/html/boost_asio/reference/const_buffer/const_buffer/overload1.html index 879bd2b152..cb88677556 100644 --- a/doc/html/boost_asio/reference/const_buffer/const_buffer/overload1.html +++ b/doc/html/boost_asio/reference/const_buffer/const_buffer/overload1.html @@ -35,7 +35,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/const_buffer/const_buffer/overload2.html b/doc/html/boost_asio/reference/const_buffer/const_buffer/overload2.html index 804126fe68..e9a2b09662 100644 --- a/doc/html/boost_asio/reference/const_buffer/const_buffer/overload2.html +++ b/doc/html/boost_asio/reference/const_buffer/const_buffer/overload2.html @@ -37,7 +37,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/const_buffer/const_buffer/overload3.html b/doc/html/boost_asio/reference/const_buffer/const_buffer/overload3.html index a8a75af252..f5c4e5d826 100644 --- a/doc/html/boost_asio/reference/const_buffer/const_buffer/overload3.html +++ b/doc/html/boost_asio/reference/const_buffer/const_buffer/overload3.html @@ -36,7 +36,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/const_buffer/data.html b/doc/html/boost_asio/reference/const_buffer/data.html index e69b67eb94..67d16549c0 100644 --- a/doc/html/boost_asio/reference/const_buffer/data.html +++ b/doc/html/boost_asio/reference/const_buffer/data.html @@ -36,7 +36,7 @@ Get a pointer to
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/const_buffer/operator_plus_.html b/doc/html/boost_asio/reference/const_buffer/operator_plus_.html index dc00c53667..3cdadfffd3 100644 --- a/doc/html/boost_asio/reference/const_buffer/operator_plus_.html +++ b/doc/html/boost_asio/reference/const_buffer/operator_plus_.html @@ -44,7 +44,7 @@ const_buffer
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/const_buffer/operator_plus_/overload1.html b/doc/html/boost_asio/reference/const_buffer/operator_plus_/overload1.html index 1956726721..a102e3b342 100644 --- a/doc/html/boost_asio/reference/const_buffer/operator_plus_/overload1.html +++ b/doc/html/boost_asio/reference/const_buffer/operator_plus_/overload1.html @@ -37,7 +37,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/const_buffer/operator_plus_/overload2.html b/doc/html/boost_asio/reference/const_buffer/operator_plus_/overload2.html index e769e471fb..458c2e413a 100644 --- a/doc/html/boost_asio/reference/const_buffer/operator_plus_/overload2.html +++ b/doc/html/boost_asio/reference/const_buffer/operator_plus_/overload2.html @@ -37,7 +37,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/const_buffer/operator_plus__eq_.html b/doc/html/boost_asio/reference/const_buffer/operator_plus__eq_.html index fac6733c6e..deb3ca0dad 100644 --- a/doc/html/boost_asio/reference/const_buffer/operator_plus__eq_.html +++ b/doc/html/boost_asio/reference/const_buffer/operator_plus__eq_.html @@ -37,7 +37,7 @@ Move
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/const_buffer/size.html b/doc/html/boost_asio/reference/const_buffer/size.html index b76141d37e..dadfe5e9fa 100644 --- a/doc/html/boost_asio/reference/const_buffer/size.html +++ b/doc/html/boost_asio/reference/const_buffer/size.html @@ -36,7 +36,7 @@ Get the size of the
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/const_buffers_1.html b/doc/html/boost_asio/reference/const_buffers_1.html index f40b4c1944..3f3384cf06 100644 --- a/doc/html/boost_asio/reference/const_buffers_1.html +++ b/doc/html/boost_asio/reference/const_buffers_1.html @@ -230,7 +230,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/const_buffers_1/begin.html b/doc/html/boost_asio/reference/const_buffers_1/begin.html index b689b57499..81d64c615b 100644 --- a/doc/html/boost_asio/reference/const_buffers_1/begin.html +++ b/doc/html/boost_asio/reference/const_buffers_1/begin.html @@ -36,7 +36,7 @@ Get a random-access
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/const_buffers_1/const_buffers_1.html b/doc/html/boost_asio/reference/const_buffers_1/const_buffers_1.html index 788f76287e..77105390c2 100644 --- a/doc/html/boost_asio/reference/const_buffers_1/const_buffers_1.html +++ b/doc/html/boost_asio/reference/const_buffers_1/const_buffers_1.html @@ -46,7 +46,7 @@ Construct
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/const_buffers_1/const_buffers_1/overload1.html b/doc/html/boost_asio/reference/const_buffers_1/const_buffers_1/overload1.html index 91ec6e2399..cda88ed2a1 100644 --- a/doc/html/boost_asio/reference/const_buffers_1/const_buffers_1/overload1.html +++ b/doc/html/boost_asio/reference/const_buffers_1/const_buffers_1/overload1.html @@ -37,7 +37,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/const_buffers_1/const_buffers_1/overload2.html b/doc/html/boost_asio/reference/const_buffers_1/const_buffers_1/overload2.html index fd989c9867..9502a58143 100644 --- a/doc/html/boost_asio/reference/const_buffers_1/const_buffers_1/overload2.html +++ b/doc/html/boost_asio/reference/const_buffers_1/const_buffers_1/overload2.html @@ -36,7 +36,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/const_buffers_1/const_iterator.html b/doc/html/boost_asio/reference/const_buffers_1/const_iterator.html index 0c247ede92..11a2abec63 100644 --- a/doc/html/boost_asio/reference/const_buffers_1/const_iterator.html +++ b/doc/html/boost_asio/reference/const_buffers_1/const_iterator.html @@ -46,7 +46,7 @@ A
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/const_buffers_1/data.html b/doc/html/boost_asio/reference/const_buffers_1/data.html index eaca9d2edd..6d338d1c6d 100644 --- a/doc/html/boost_asio/reference/const_buffers_1/data.html +++ b/doc/html/boost_asio/reference/const_buffers_1/data.html @@ -39,7 +39,7 @@ Get a pointer
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/const_buffers_1/end.html b/doc/html/boost_asio/reference/const_buffers_1/end.html index 9ca8997801..b7fa4d460b 100644 --- a/doc/html/boost_asio/reference/const_buffers_1/end.html +++ b/doc/html/boost_asio/reference/const_buffers_1/end.html @@ -36,7 +36,7 @@ Get a random-access
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/const_buffers_1/operator_plus_.html b/doc/html/boost_asio/reference/const_buffers_1/operator_plus_.html index b3008c6e79..790c57d0e2 100644 --- a/doc/html/boost_asio/reference/const_buffers_1/operator_plus_.html +++ b/doc/html/boost_asio/reference/const_buffers_1/operator_plus_.html @@ -44,7 +44,7 @@ const_buffer
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/const_buffers_1/operator_plus_/overload1.html b/doc/html/boost_asio/reference/const_buffers_1/operator_plus_/overload1.html index fc9f8e1ae2..79d6111a94 100644 --- a/doc/html/boost_asio/reference/const_buffers_1/operator_plus_/overload1.html +++ b/doc/html/boost_asio/reference/const_buffers_1/operator_plus_/overload1.html @@ -40,7 +40,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/const_buffers_1/operator_plus_/overload2.html b/doc/html/boost_asio/reference/const_buffers_1/operator_plus_/overload2.html index 204284795d..0f70e921b2 100644 --- a/doc/html/boost_asio/reference/const_buffers_1/operator_plus_/overload2.html +++ b/doc/html/boost_asio/reference/const_buffers_1/operator_plus_/overload2.html @@ -40,7 +40,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/const_buffers_1/operator_plus__eq_.html b/doc/html/boost_asio/reference/const_buffers_1/operator_plus__eq_.html index 0d07b5e287..81a1065eea 100644 --- a/doc/html/boost_asio/reference/const_buffers_1/operator_plus__eq_.html +++ b/doc/html/boost_asio/reference/const_buffers_1/operator_plus__eq_.html @@ -40,7 +40,7 @@ Move
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/const_buffers_1/size.html b/doc/html/boost_asio/reference/const_buffers_1/size.html index 154a61aa79..94cc9c5e56 100644 --- a/doc/html/boost_asio/reference/const_buffers_1/size.html +++ b/doc/html/boost_asio/reference/const_buffers_1/size.html @@ -39,7 +39,7 @@ Get the size
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/const_buffers_1/value_type.html b/doc/html/boost_asio/reference/const_buffers_1/value_type.html index 1001664b73..18c3deba13 100644 --- a/doc/html/boost_asio/reference/const_buffers_1/value_type.html +++ b/doc/html/boost_asio/reference/const_buffers_1/value_type.html @@ -183,7 +183,7 @@ const unsigned char* p1 = static_cast<const unsigned char*>(b1.data());
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/coroutine.html b/doc/html/boost_asio/reference/coroutine.html index 060cc37b66..7adc8df5eb 100644 --- a/doc/html/boost_asio/reference/coroutine.html +++ b/doc/html/boost_asio/reference/coroutine.html @@ -420,7 +420,7 @@ for (;;)
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/coroutine/coroutine.html b/doc/html/boost_asio/reference/coroutine/coroutine.html index 08d5c6ac2b..d1afe5d1e6 100644 --- a/doc/html/boost_asio/reference/coroutine/coroutine.html +++ b/doc/html/boost_asio/reference/coroutine/coroutine.html @@ -36,7 +36,7 @@ Constructs a
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/coroutine/is_child.html b/doc/html/boost_asio/reference/coroutine/is_child.html index ce1114ef50..6722a7065e 100644 --- a/doc/html/boost_asio/reference/coroutine/is_child.html +++ b/doc/html/boost_asio/reference/coroutine/is_child.html @@ -36,7 +36,7 @@ Returns true if
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/coroutine/is_complete.html b/doc/html/boost_asio/reference/coroutine/is_complete.html index 0a99583432..3747cd120f 100644 --- a/doc/html/boost_asio/reference/coroutine/is_complete.html +++ b/doc/html/boost_asio/reference/coroutine/is_complete.html @@ -36,7 +36,7 @@ Returns true
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/coroutine/is_parent.html b/doc/html/boost_asio/reference/coroutine/is_parent.html index 2efd0db818..46de5808fc 100644 --- a/doc/html/boost_asio/reference/coroutine/is_parent.html +++ b/doc/html/boost_asio/reference/coroutine/is_parent.html @@ -36,7 +36,7 @@ Returns true
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/deadline_timer.html b/doc/html/boost_asio/reference/deadline_timer.html index dd01b27a1f..bbda1a103d 100644 --- a/doc/html/boost_asio/reference/deadline_timer.html +++ b/doc/html/boost_asio/reference/deadline_timer.html @@ -409,7 +409,7 @@ void on_timeout(const boost::system::error_code& e)
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/defer.html b/doc/html/boost_asio/reference/defer.html index b9bca3a495..37b842b087 100644 --- a/doc/html/boost_asio/reference/defer.html +++ b/doc/html/boost_asio/reference/defer.html @@ -68,7 +68,7 @@ template<
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/defer/overload1.html b/doc/html/boost_asio/reference/defer/overload1.html index 1ba2fa872b..3252ea161c 100644 --- a/doc/html/boost_asio/reference/defer/overload1.html +++ b/doc/html/boost_asio/reference/defer/overload1.html @@ -70,7 +70,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/defer/overload2.html b/doc/html/boost_asio/reference/defer/overload2.html index f0f1838904..0985f8ca72 100644 --- a/doc/html/boost_asio/reference/defer/overload2.html +++ b/doc/html/boost_asio/reference/defer/overload2.html @@ -81,7 +81,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/defer/overload3.html b/doc/html/boost_asio/reference/defer/overload3.html index 5ba28c5bb8..f1aaa12ae2 100644 --- a/doc/html/boost_asio/reference/defer/overload3.html +++ b/doc/html/boost_asio/reference/defer/overload3.html @@ -49,7 +49,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/dispatch.html b/doc/html/boost_asio/reference/dispatch.html index c95dffb9ff..0fd598a8ad 100644 --- a/doc/html/boost_asio/reference/dispatch.html +++ b/doc/html/boost_asio/reference/dispatch.html @@ -68,7 +68,7 @@ template<
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/dispatch/overload1.html b/doc/html/boost_asio/reference/dispatch/overload1.html index a27e70748a..769206cffb 100644 --- a/doc/html/boost_asio/reference/dispatch/overload1.html +++ b/doc/html/boost_asio/reference/dispatch/overload1.html @@ -70,7 +70,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/dispatch/overload2.html b/doc/html/boost_asio/reference/dispatch/overload2.html index c11516ab83..19ad4122ef 100644 --- a/doc/html/boost_asio/reference/dispatch/overload2.html +++ b/doc/html/boost_asio/reference/dispatch/overload2.html @@ -81,7 +81,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/dispatch/overload3.html b/doc/html/boost_asio/reference/dispatch/overload3.html index fbf0845660..18f97e209c 100644 --- a/doc/html/boost_asio/reference/dispatch/overload3.html +++ b/doc/html/boost_asio/reference/dispatch/overload3.html @@ -48,7 +48,7 @@
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/dynamic_buffer.html b/doc/html/boost_asio/reference/dynamic_buffer.html index 37ea500601..4637e975a9 100644 --- a/doc/html/boost_asio/reference/dynamic_buffer.html +++ b/doc/html/boost_asio/reference/dynamic_buffer.html @@ -77,7 +77,7 @@ dynamic_vector_buffer< Elem, Allocator >
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/dynamic_buffer/overload1.html b/doc/html/boost_asio/reference/dynamic_buffer/overload1.html index 5c784a1f96..1c98004f0a 100644 --- a/doc/html/boost_asio/reference/dynamic_buffer/overload1.html +++ b/doc/html/boost_asio/reference/dynamic_buffer/overload1.html @@ -48,7 +48,7 @@ dynamic_string_buffer< Elem, Traits, Allocator > dynamic_buffer(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/dynamic_buffer/overload2.html b/doc/html/boost_asio/reference/dynamic_buffer/overload2.html index d33c67348d..4e934686c7 100644 --- a/doc/html/boost_asio/reference/dynamic_buffer/overload2.html +++ b/doc/html/boost_asio/reference/dynamic_buffer/overload2.html @@ -49,7 +49,7 @@ dynamic_string_buffer< Elem, Traits, Allocator > dynamic_buffer(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/dynamic_buffer/overload3.html b/doc/html/boost_asio/reference/dynamic_buffer/overload3.html index 25e4c2f4f0..87ca763d16 100644 --- a/doc/html/boost_asio/reference/dynamic_buffer/overload3.html +++ b/doc/html/boost_asio/reference/dynamic_buffer/overload3.html @@ -47,7 +47,7 @@ dynamic_vector_buffer< Elem, Allocator > dynamic_buffer(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/dynamic_buffer/overload4.html b/doc/html/boost_asio/reference/dynamic_buffer/overload4.html index f5870ee1e4..f962851838 100644 --- a/doc/html/boost_asio/reference/dynamic_buffer/overload4.html +++ b/doc/html/boost_asio/reference/dynamic_buffer/overload4.html @@ -48,7 +48,7 @@ dynamic_vector_buffer< Elem, Allocator > dynamic_buffer(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/dynamic_string_buffer.html b/doc/html/boost_asio/reference/dynamic_string_buffer.html index 8488df1e2b..765a1081f1 100644 --- a/doc/html/boost_asio/reference/dynamic_string_buffer.html +++ b/doc/html/boost_asio/reference/dynamic_string_buffer.html @@ -224,7 +224,7 @@ class dynamic_string_buffer
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/dynamic_string_buffer/capacity.html b/doc/html/boost_asio/reference/dynamic_string_buffer/capacity.html index 67bbbf9def..282302c836 100644 --- a/doc/html/boost_asio/reference/dynamic_string_buffer/capacity.html +++ b/doc/html/boost_asio/reference/dynamic_string_buffer/capacity.html @@ -45,7 +45,7 @@ Get
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/dynamic_string_buffer/commit.html b/doc/html/boost_asio/reference/dynamic_string_buffer/commit.html index 592d39ca08..235a11e5ab 100644 --- a/doc/html/boost_asio/reference/dynamic_string_buffer/commit.html +++ b/doc/html/boost_asio/reference/dynamic_string_buffer/commit.html @@ -64,7 +64,7 @@ Move
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/dynamic_string_buffer/const_buffers_type.html b/doc/html/boost_asio/reference/dynamic_string_buffer/const_buffers_type.html index f33cff5123..c9649ae570 100644 --- a/doc/html/boost_asio/reference/dynamic_string_buffer/const_buffers_type.html +++ b/doc/html/boost_asio/reference/dynamic_string_buffer/const_buffers_type.html @@ -183,7 +183,7 @@ const unsigned char* p1 = static_cast<const unsigned char*>(b1.data());
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/dynamic_string_buffer/consume.html b/doc/html/boost_asio/reference/dynamic_string_buffer/consume.html index 68c28228ad..992210d61b 100644 --- a/doc/html/boost_asio/reference/dynamic_string_buffer/consume.html +++ b/doc/html/boost_asio/reference/dynamic_string_buffer/consume.html @@ -48,7 +48,7 @@ Remove
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/dynamic_string_buffer/data.html b/doc/html/boost_asio/reference/dynamic_string_buffer/data.html index f214799101..606269abb3 100644 --- a/doc/html/boost_asio/reference/dynamic_string_buffer/data.html +++ b/doc/html/boost_asio/reference/dynamic_string_buffer/data.html @@ -54,7 +54,7 @@ Get
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/dynamic_string_buffer/dynamic_string_buffer.html b/doc/html/boost_asio/reference/dynamic_string_buffer/dynamic_string_buffer.html index 6e2ad86b70..fbcbcac3a2 100644 --- a/doc/html/boost_asio/reference/dynamic_string_buffer/dynamic_string_buffer.html +++ b/doc/html/boost_asio/reference/dynamic_string_buffer/dynamic_string_buffer.html @@ -46,7 +46,7 @@ Construct
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/dynamic_string_buffer/dynamic_string_buffer/overload1.html b/doc/html/boost_asio/reference/dynamic_string_buffer/dynamic_string_buffer/overload1.html index e7c5517214..0a34dfad72 100644 --- a/doc/html/boost_asio/reference/dynamic_string_buffer/dynamic_string_buffer/overload1.html +++ b/doc/html/boost_asio/reference/dynamic_string_buffer/dynamic_string_buffer/overload1.html @@ -59,7 +59,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/dynamic_string_buffer/dynamic_string_buffer/overload2.html b/doc/html/boost_asio/reference/dynamic_string_buffer/dynamic_string_buffer/overload2.html index 51ec1dc8d2..86315f21ba 100644 --- a/doc/html/boost_asio/reference/dynamic_string_buffer/dynamic_string_buffer/overload2.html +++ b/doc/html/boost_asio/reference/dynamic_string_buffer/dynamic_string_buffer/overload2.html @@ -36,7 +36,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/dynamic_string_buffer/max_size.html b/doc/html/boost_asio/reference/dynamic_string_buffer/max_size.html index 2331c9548b..ca0deac553 100644 --- a/doc/html/boost_asio/reference/dynamic_string_buffer/max_size.html +++ b/doc/html/boost_asio/reference/dynamic_string_buffer/max_size.html @@ -45,7 +45,7 @@ Get
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/dynamic_string_buffer/mutable_buffers_type.html b/doc/html/boost_asio/reference/dynamic_string_buffer/mutable_buffers_type.html index eed3b3eb76..18a5151fbc 100644 --- a/doc/html/boost_asio/reference/dynamic_string_buffer/mutable_buffers_type.html +++ b/doc/html/boost_asio/reference/dynamic_string_buffer/mutable_buffers_type.html @@ -180,7 +180,7 @@ unsigned char* p1 = static_cast<unsigned char*>(b1.data());
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/dynamic_string_buffer/prepare.html b/doc/html/boost_asio/reference/dynamic_string_buffer/prepare.html index 49ff6c5ad5..3741d33de2 100644 --- a/doc/html/boost_asio/reference/dynamic_string_buffer/prepare.html +++ b/doc/html/boost_asio/reference/dynamic_string_buffer/prepare.html @@ -73,7 +73,7 @@ Get
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/dynamic_string_buffer/size.html b/doc/html/boost_asio/reference/dynamic_string_buffer/size.html index 22503048ef..dea9ea268a 100644 --- a/doc/html/boost_asio/reference/dynamic_string_buffer/size.html +++ b/doc/html/boost_asio/reference/dynamic_string_buffer/size.html @@ -36,7 +36,7 @@ Get
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/dynamic_vector_buffer.html b/doc/html/boost_asio/reference/dynamic_vector_buffer.html index 414a4bdbaa..261e2348f6 100644 --- a/doc/html/boost_asio/reference/dynamic_vector_buffer.html +++ b/doc/html/boost_asio/reference/dynamic_vector_buffer.html @@ -223,7 +223,7 @@ class dynamic_vector_buffer
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/dynamic_vector_buffer/capacity.html b/doc/html/boost_asio/reference/dynamic_vector_buffer/capacity.html index c0c8518cc1..89efa38e6e 100644 --- a/doc/html/boost_asio/reference/dynamic_vector_buffer/capacity.html +++ b/doc/html/boost_asio/reference/dynamic_vector_buffer/capacity.html @@ -45,7 +45,7 @@ Get
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/dynamic_vector_buffer/commit.html b/doc/html/boost_asio/reference/dynamic_vector_buffer/commit.html index 0695ed16cb..624b8602b4 100644 --- a/doc/html/boost_asio/reference/dynamic_vector_buffer/commit.html +++ b/doc/html/boost_asio/reference/dynamic_vector_buffer/commit.html @@ -64,7 +64,7 @@ Move
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/dynamic_vector_buffer/const_buffers_type.html b/doc/html/boost_asio/reference/dynamic_vector_buffer/const_buffers_type.html index 57e5241fa2..0967488fa6 100644 --- a/doc/html/boost_asio/reference/dynamic_vector_buffer/const_buffers_type.html +++ b/doc/html/boost_asio/reference/dynamic_vector_buffer/const_buffers_type.html @@ -183,7 +183,7 @@ const unsigned char* p1 = static_cast<const unsigned char*>(b1.data());
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/dynamic_vector_buffer/consume.html b/doc/html/boost_asio/reference/dynamic_vector_buffer/consume.html index 781f2a257d..2d7248e9c4 100644 --- a/doc/html/boost_asio/reference/dynamic_vector_buffer/consume.html +++ b/doc/html/boost_asio/reference/dynamic_vector_buffer/consume.html @@ -48,7 +48,7 @@ Remove
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/dynamic_vector_buffer/data.html b/doc/html/boost_asio/reference/dynamic_vector_buffer/data.html index 8dd849db88..4dd0d8a8ad 100644 --- a/doc/html/boost_asio/reference/dynamic_vector_buffer/data.html +++ b/doc/html/boost_asio/reference/dynamic_vector_buffer/data.html @@ -54,7 +54,7 @@ Get
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/dynamic_vector_buffer/dynamic_vector_buffer.html b/doc/html/boost_asio/reference/dynamic_vector_buffer/dynamic_vector_buffer.html index c4b1b66cd0..958d7f8385 100644 --- a/doc/html/boost_asio/reference/dynamic_vector_buffer/dynamic_vector_buffer.html +++ b/doc/html/boost_asio/reference/dynamic_vector_buffer/dynamic_vector_buffer.html @@ -46,7 +46,7 @@ Construct
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/dynamic_vector_buffer/dynamic_vector_buffer/overload1.html b/doc/html/boost_asio/reference/dynamic_vector_buffer/dynamic_vector_buffer/overload1.html index c3457deb8e..dd7110b997 100644 --- a/doc/html/boost_asio/reference/dynamic_vector_buffer/dynamic_vector_buffer/overload1.html +++ b/doc/html/boost_asio/reference/dynamic_vector_buffer/dynamic_vector_buffer/overload1.html @@ -59,7 +59,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/dynamic_vector_buffer/dynamic_vector_buffer/overload2.html b/doc/html/boost_asio/reference/dynamic_vector_buffer/dynamic_vector_buffer/overload2.html index 6e8979189e..c7651aefee 100644 --- a/doc/html/boost_asio/reference/dynamic_vector_buffer/dynamic_vector_buffer/overload2.html +++ b/doc/html/boost_asio/reference/dynamic_vector_buffer/dynamic_vector_buffer/overload2.html @@ -36,7 +36,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/dynamic_vector_buffer/max_size.html b/doc/html/boost_asio/reference/dynamic_vector_buffer/max_size.html index b053a8f8da..e3d6c17198 100644 --- a/doc/html/boost_asio/reference/dynamic_vector_buffer/max_size.html +++ b/doc/html/boost_asio/reference/dynamic_vector_buffer/max_size.html @@ -45,7 +45,7 @@ Get
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/dynamic_vector_buffer/mutable_buffers_type.html b/doc/html/boost_asio/reference/dynamic_vector_buffer/mutable_buffers_type.html index b4ce703d75..0863469273 100644 --- a/doc/html/boost_asio/reference/dynamic_vector_buffer/mutable_buffers_type.html +++ b/doc/html/boost_asio/reference/dynamic_vector_buffer/mutable_buffers_type.html @@ -180,7 +180,7 @@ unsigned char* p1 = static_cast<unsigned char*>(b1.data());
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/dynamic_vector_buffer/prepare.html b/doc/html/boost_asio/reference/dynamic_vector_buffer/prepare.html index 16f213ae44..9f1e32462e 100644 --- a/doc/html/boost_asio/reference/dynamic_vector_buffer/prepare.html +++ b/doc/html/boost_asio/reference/dynamic_vector_buffer/prepare.html @@ -73,7 +73,7 @@ Get
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/dynamic_vector_buffer/size.html b/doc/html/boost_asio/reference/dynamic_vector_buffer/size.html index 2a4638502f..863b5f0ea5 100644 --- a/doc/html/boost_asio/reference/dynamic_vector_buffer/size.html +++ b/doc/html/boost_asio/reference/dynamic_vector_buffer/size.html @@ -36,7 +36,7 @@ Get
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/error__addrinfo_category.html b/doc/html/boost_asio/reference/error__addrinfo_category.html index 5fa7b19ad8..ecc6d925c4 100644 --- a/doc/html/boost_asio/reference/error__addrinfo_category.html +++ b/doc/html/boost_asio/reference/error__addrinfo_category.html @@ -44,7 +44,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/error__addrinfo_errors.html b/doc/html/boost_asio/reference/error__addrinfo_errors.html index 16c684f548..0c8ccf4a9a 100644 --- a/doc/html/boost_asio/reference/error__addrinfo_errors.html +++ b/doc/html/boost_asio/reference/error__addrinfo_errors.html @@ -65,7 +65,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/error__basic_errors.html b/doc/html/boost_asio/reference/error__basic_errors.html index 71a54313b6..2c2384045c 100644 --- a/doc/html/boost_asio/reference/error__basic_errors.html +++ b/doc/html/boost_asio/reference/error__basic_errors.html @@ -226,7 +226,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/error__get_addrinfo_category.html b/doc/html/boost_asio/reference/error__get_addrinfo_category.html index d22a5e2936..af7c9a49a4 100644 --- a/doc/html/boost_asio/reference/error__get_addrinfo_category.html +++ b/doc/html/boost_asio/reference/error__get_addrinfo_category.html @@ -44,7 +44,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/error__get_misc_category.html b/doc/html/boost_asio/reference/error__get_misc_category.html index 100d210616..357c9e8ce4 100644 --- a/doc/html/boost_asio/reference/error__get_misc_category.html +++ b/doc/html/boost_asio/reference/error__get_misc_category.html @@ -44,7 +44,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/error__get_netdb_category.html b/doc/html/boost_asio/reference/error__get_netdb_category.html index d8918e8a58..2786f7f87e 100644 --- a/doc/html/boost_asio/reference/error__get_netdb_category.html +++ b/doc/html/boost_asio/reference/error__get_netdb_category.html @@ -44,7 +44,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/error__get_ssl_category.html b/doc/html/boost_asio/reference/error__get_ssl_category.html index 51f57b4fe1..0366896218 100644 --- a/doc/html/boost_asio/reference/error__get_ssl_category.html +++ b/doc/html/boost_asio/reference/error__get_ssl_category.html @@ -44,7 +44,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/error__get_system_category.html b/doc/html/boost_asio/reference/error__get_system_category.html index 142698b13d..ee4d43a863 100644 --- a/doc/html/boost_asio/reference/error__get_system_category.html +++ b/doc/html/boost_asio/reference/error__get_system_category.html @@ -44,7 +44,7 @@
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/error__make_error_code.html b/doc/html/boost_asio/reference/error__make_error_code.html index 0853bf416d..2c59dc97fa 100644 --- a/doc/html/boost_asio/reference/error__make_error_code.html +++ b/doc/html/boost_asio/reference/error__make_error_code.html @@ -62,7 +62,7 @@ boost::system::error_code
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/error__make_error_code/overload1.html b/doc/html/boost_asio/reference/error__make_error_code/overload1.html index 3c056df297..7966a55125 100644 --- a/doc/html/boost_asio/reference/error__make_error_code/overload1.html +++ b/doc/html/boost_asio/reference/error__make_error_code/overload1.html @@ -33,7 +33,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/error__make_error_code/overload2.html b/doc/html/boost_asio/reference/error__make_error_code/overload2.html index ef2f321bd0..622d76bb59 100644 --- a/doc/html/boost_asio/reference/error__make_error_code/overload2.html +++ b/doc/html/boost_asio/reference/error__make_error_code/overload2.html @@ -33,7 +33,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/error__make_error_code/overload3.html b/doc/html/boost_asio/reference/error__make_error_code/overload3.html index f57677d622..7ca6ee1623 100644 --- a/doc/html/boost_asio/reference/error__make_error_code/overload3.html +++ b/doc/html/boost_asio/reference/error__make_error_code/overload3.html @@ -33,7 +33,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/error__make_error_code/overload4.html b/doc/html/boost_asio/reference/error__make_error_code/overload4.html index fc7289902e..ac593f1ac0 100644 --- a/doc/html/boost_asio/reference/error__make_error_code/overload4.html +++ b/doc/html/boost_asio/reference/error__make_error_code/overload4.html @@ -33,7 +33,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/error__make_error_code/overload5.html b/doc/html/boost_asio/reference/error__make_error_code/overload5.html index 76b11c2c9b..92f222925e 100644 --- a/doc/html/boost_asio/reference/error__make_error_code/overload5.html +++ b/doc/html/boost_asio/reference/error__make_error_code/overload5.html @@ -33,7 +33,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/error__misc_category.html b/doc/html/boost_asio/reference/error__misc_category.html index 0bd5dd5ee9..b3f999789b 100644 --- a/doc/html/boost_asio/reference/error__misc_category.html +++ b/doc/html/boost_asio/reference/error__misc_category.html @@ -44,7 +44,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/error__misc_errors.html b/doc/html/boost_asio/reference/error__misc_errors.html index 4ce2c9663b..6e85d2aab9 100644 --- a/doc/html/boost_asio/reference/error__misc_errors.html +++ b/doc/html/boost_asio/reference/error__misc_errors.html @@ -75,7 +75,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/error__netdb_category.html b/doc/html/boost_asio/reference/error__netdb_category.html index 6fd1f9386d..3d91d7be07 100644 --- a/doc/html/boost_asio/reference/error__netdb_category.html +++ b/doc/html/boost_asio/reference/error__netdb_category.html @@ -44,7 +44,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/error__netdb_errors.html b/doc/html/boost_asio/reference/error__netdb_errors.html index 36930f0ed0..97db14653e 100644 --- a/doc/html/boost_asio/reference/error__netdb_errors.html +++ b/doc/html/boost_asio/reference/error__netdb_errors.html @@ -75,7 +75,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/error__ssl_category.html b/doc/html/boost_asio/reference/error__ssl_category.html index 6560e146f9..e918a30374 100644 --- a/doc/html/boost_asio/reference/error__ssl_category.html +++ b/doc/html/boost_asio/reference/error__ssl_category.html @@ -44,7 +44,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/error__ssl_errors.html b/doc/html/boost_asio/reference/error__ssl_errors.html index 4339861200..a3de67c3d5 100644 --- a/doc/html/boost_asio/reference/error__ssl_errors.html +++ b/doc/html/boost_asio/reference/error__ssl_errors.html @@ -44,7 +44,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/error__system_category.html b/doc/html/boost_asio/reference/error__system_category.html index 52e96fc57e..c1e1d1564c 100644 --- a/doc/html/boost_asio/reference/error__system_category.html +++ b/doc/html/boost_asio/reference/error__system_category.html @@ -44,7 +44,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/execution_context.html b/doc/html/boost_asio/reference/execution_context.html index a8a41d9dac..237242e9a3 100644 --- a/doc/html/boost_asio/reference/execution_context.html +++ b/doc/html/boost_asio/reference/execution_context.html @@ -375,7 +375,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/execution_context/_execution_context.html b/doc/html/boost_asio/reference/execution_context/_execution_context.html index e48720bc22..a046e930f1 100644 --- a/doc/html/boost_asio/reference/execution_context/_execution_context.html +++ b/doc/html/boost_asio/reference/execution_context/_execution_context.html @@ -35,7 +35,7 @@ Destructor.
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/execution_context/add_service.html b/doc/html/boost_asio/reference/execution_context/add_service.html index 1e6dcb5825..b4997d20e6 100644 --- a/doc/html/boost_asio/reference/execution_context/add_service.html +++ b/doc/html/boost_asio/reference/execution_context/add_service.html @@ -100,7 +100,7 @@ friend void add_service(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/execution_context/destroy.html b/doc/html/boost_asio/reference/execution_context/destroy.html index bd7614bf4a..55973e3683 100644 --- a/doc/html/boost_asio/reference/execution_context/destroy.html +++ b/doc/html/boost_asio/reference/execution_context/destroy.html @@ -44,7 +44,7 @@ Destroys
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/execution_context/execution_context.html b/doc/html/boost_asio/reference/execution_context/execution_context.html index f2baa4aaa6..281886c55d 100644 --- a/doc/html/boost_asio/reference/execution_context/execution_context.html +++ b/doc/html/boost_asio/reference/execution_context/execution_context.html @@ -35,7 +35,7 @@ Constructor.
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/execution_context/fork_event.html b/doc/html/boost_asio/reference/execution_context/fork_event.html index aa82525b7e..97ec9b4db2 100644 --- a/doc/html/boost_asio/reference/execution_context/fork_event.html +++ b/doc/html/boost_asio/reference/execution_context/fork_event.html @@ -62,7 +62,7 @@ Fork-related
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/execution_context/has_service.html b/doc/html/boost_asio/reference/execution_context/has_service.html index b0e24b1127..f3f6639257 100644 --- a/doc/html/boost_asio/reference/execution_context/has_service.html +++ b/doc/html/boost_asio/reference/execution_context/has_service.html @@ -77,7 +77,7 @@ friend bool has_service(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/execution_context/make_service.html b/doc/html/boost_asio/reference/execution_context/make_service.html index acb623b187..3100f9b610 100644 --- a/doc/html/boost_asio/reference/execution_context/make_service.html +++ b/doc/html/boost_asio/reference/execution_context/make_service.html @@ -86,7 +86,7 @@ friend Service & make_service(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/execution_context/notify_fork.html b/doc/html/boost_asio/reference/execution_context/notify_fork.html index cbfbebb0eb..8a9d5939e3 100644 --- a/doc/html/boost_asio/reference/execution_context/notify_fork.html +++ b/doc/html/boost_asio/reference/execution_context/notify_fork.html @@ -111,7 +111,7 @@ else
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/execution_context/shutdown.html b/doc/html/boost_asio/reference/execution_context/shutdown.html index 12cc97e821..75f68e2ef7 100644 --- a/doc/html/boost_asio/reference/execution_context/shutdown.html +++ b/doc/html/boost_asio/reference/execution_context/shutdown.html @@ -44,7 +44,7 @@ Shuts
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/execution_context/use_service.html b/doc/html/boost_asio/reference/execution_context/use_service.html index 61aa522346..88d83ebfaa 100644 --- a/doc/html/boost_asio/reference/execution_context/use_service.html +++ b/doc/html/boost_asio/reference/execution_context/use_service.html @@ -46,7 +46,7 @@ friend Service &
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/execution_context/use_service/overload1.html b/doc/html/boost_asio/reference/execution_context/use_service/overload1.html index b5c5b73d85..8d2fb8d0c2 100644 --- a/doc/html/boost_asio/reference/execution_context/use_service/overload1.html +++ b/doc/html/boost_asio/reference/execution_context/use_service/overload1.html @@ -77,7 +77,7 @@ friend Service & use_service(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/execution_context/use_service/overload2.html b/doc/html/boost_asio/reference/execution_context/use_service/overload2.html index 5a58d4ca34..c59cd63752 100644 --- a/doc/html/boost_asio/reference/execution_context/use_service/overload2.html +++ b/doc/html/boost_asio/reference/execution_context/use_service/overload2.html @@ -85,7 +85,7 @@ friend Service & use_service(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/execution_context__id.html b/doc/html/boost_asio/reference/execution_context__id.html index 4b924d1699..f3a54cba26 100644 --- a/doc/html/boost_asio/reference/execution_context__id.html +++ b/doc/html/boost_asio/reference/execution_context__id.html @@ -80,7 +80,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/execution_context__id/id.html b/doc/html/boost_asio/reference/execution_context__id/id.html index 147533c6f8..d37907c6ef 100644 --- a/doc/html/boost_asio/reference/execution_context__id/id.html +++ b/doc/html/boost_asio/reference/execution_context__id/id.html @@ -35,7 +35,7 @@ Constructor.
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/execution_context__service.html b/doc/html/boost_asio/reference/execution_context__service.html index e92723dfb5..e5f6db7779 100644 --- a/doc/html/boost_asio/reference/execution_context__service.html +++ b/doc/html/boost_asio/reference/execution_context__service.html @@ -180,7 +180,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/execution_context__service/_service.html b/doc/html/boost_asio/reference/execution_context__service/_service.html index db3769ae04..f78f2e1e6c 100644 --- a/doc/html/boost_asio/reference/execution_context__service/_service.html +++ b/doc/html/boost_asio/reference/execution_context__service/_service.html @@ -35,7 +35,7 @@ Destructor.
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/execution_context__service/context.html b/doc/html/boost_asio/reference/execution_context__service/context.html index da3afa56b7..41ce548b63 100644 --- a/doc/html/boost_asio/reference/execution_context__service/context.html +++ b/doc/html/boost_asio/reference/execution_context__service/context.html @@ -36,7 +36,7 @@ Get
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/execution_context__service/notify_fork.html b/doc/html/boost_asio/reference/execution_context__service/notify_fork.html index c3f1493f5a..5f79e66781 100644 --- a/doc/html/boost_asio/reference/execution_context__service/notify_fork.html +++ b/doc/html/boost_asio/reference/execution_context__service/notify_fork.html @@ -41,7 +41,7 @@ Handle
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/execution_context__service/service.html b/doc/html/boost_asio/reference/execution_context__service/service.html index 4d964c853a..2c7865a05b 100644 --- a/doc/html/boost_asio/reference/execution_context__service/service.html +++ b/doc/html/boost_asio/reference/execution_context__service/service.html @@ -50,7 +50,7 @@ Constructor.
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/execution_context__service/shutdown.html b/doc/html/boost_asio/reference/execution_context__service/shutdown.html index 72b4af39f2..7b0c65701f 100644 --- a/doc/html/boost_asio/reference/execution_context__service/shutdown.html +++ b/doc/html/boost_asio/reference/execution_context__service/shutdown.html @@ -36,7 +36,7 @@ Destroy
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/executor.html b/doc/html/boost_asio/reference/executor.html index 54cc3d17fb..769f369f62 100644 --- a/doc/html/boost_asio/reference/executor.html +++ b/doc/html/boost_asio/reference/executor.html @@ -335,7 +335,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/executor/_executor.html b/doc/html/boost_asio/reference/executor/_executor.html index 52896dc8a8..3767467552 100644 --- a/doc/html/boost_asio/reference/executor/_executor.html +++ b/doc/html/boost_asio/reference/executor/_executor.html @@ -35,7 +35,7 @@ Destructor.
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/executor/context.html b/doc/html/boost_asio/reference/executor/context.html index a053be8d31..5df6a8a023 100644 --- a/doc/html/boost_asio/reference/executor/context.html +++ b/doc/html/boost_asio/reference/executor/context.html @@ -36,7 +36,7 @@ Obtain the underlying
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/executor/defer.html b/doc/html/boost_asio/reference/executor/defer.html index dcfe5502dc..5f590743a9 100644 --- a/doc/html/boost_asio/reference/executor/defer.html +++ b/doc/html/boost_asio/reference/executor/defer.html @@ -72,7 +72,7 @@ void defer(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/executor/dispatch.html b/doc/html/boost_asio/reference/executor/dispatch.html index b2b8e4dc31..8e98874900 100644 --- a/doc/html/boost_asio/reference/executor/dispatch.html +++ b/doc/html/boost_asio/reference/executor/dispatch.html @@ -72,7 +72,7 @@ void dispatch(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/executor/executor.html b/doc/html/boost_asio/reference/executor/executor.html index abd42a2d3d..b4f784b82c 100644 --- a/doc/html/boost_asio/reference/executor/executor.html +++ b/doc/html/boost_asio/reference/executor/executor.html @@ -79,7 +79,7 @@ Default constructor.
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/executor/executor/overload1.html b/doc/html/boost_asio/reference/executor/executor/overload1.html index 8360dba572..9f30c3d24e 100644 --- a/doc/html/boost_asio/reference/executor/executor/overload1.html +++ b/doc/html/boost_asio/reference/executor/executor/overload1.html @@ -35,7 +35,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/executor/executor/overload2.html b/doc/html/boost_asio/reference/executor/executor/overload2.html index 2d124bd825..19ca77d3b7 100644 --- a/doc/html/boost_asio/reference/executor/executor/overload2.html +++ b/doc/html/boost_asio/reference/executor/executor/overload2.html @@ -36,7 +36,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/executor/executor/overload3.html b/doc/html/boost_asio/reference/executor/executor/overload3.html index 22ce69d778..65529741a0 100644 --- a/doc/html/boost_asio/reference/executor/executor/overload3.html +++ b/doc/html/boost_asio/reference/executor/executor/overload3.html @@ -36,7 +36,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/executor/executor/overload4.html b/doc/html/boost_asio/reference/executor/executor/overload4.html index 280720e657..6c737964ca 100644 --- a/doc/html/boost_asio/reference/executor/executor/overload4.html +++ b/doc/html/boost_asio/reference/executor/executor/overload4.html @@ -36,7 +36,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/executor/executor/overload5.html b/doc/html/boost_asio/reference/executor/executor/overload5.html index ac60ba1fa7..c054de5729 100644 --- a/doc/html/boost_asio/reference/executor/executor/overload5.html +++ b/doc/html/boost_asio/reference/executor/executor/overload5.html @@ -38,7 +38,7 @@ executor(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/executor/executor/overload6.html b/doc/html/boost_asio/reference/executor/executor/overload6.html index ed15ae7928..4ecd8e1c9c 100644 --- a/doc/html/boost_asio/reference/executor/executor/overload6.html +++ b/doc/html/boost_asio/reference/executor/executor/overload6.html @@ -42,7 +42,7 @@ executor(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/executor/on_work_finished.html b/doc/html/boost_asio/reference/executor/on_work_finished.html index cf32c99cab..8a4cf27b42 100644 --- a/doc/html/boost_asio/reference/executor/on_work_finished.html +++ b/doc/html/boost_asio/reference/executor/on_work_finished.html @@ -36,7 +36,7 @@ Inform
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/executor/on_work_started.html b/doc/html/boost_asio/reference/executor/on_work_started.html index 0d93261c18..0f16a1b279 100644 --- a/doc/html/boost_asio/reference/executor/on_work_started.html +++ b/doc/html/boost_asio/reference/executor/on_work_started.html @@ -36,7 +36,7 @@ Inform
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/executor/operator_eq_.html b/doc/html/boost_asio/reference/executor/operator_eq_.html index 095f62a96c..22efd3ec4e 100644 --- a/doc/html/boost_asio/reference/executor/operator_eq_.html +++ b/doc/html/boost_asio/reference/executor/operator_eq_.html @@ -59,7 +59,7 @@ executor &
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/executor/operator_eq_/overload1.html b/doc/html/boost_asio/reference/executor/operator_eq_/overload1.html index 4586510021..994d3f08b9 100644 --- a/doc/html/boost_asio/reference/executor/operator_eq_/overload1.html +++ b/doc/html/boost_asio/reference/executor/operator_eq_/overload1.html @@ -36,7 +36,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/executor/operator_eq_/overload2.html b/doc/html/boost_asio/reference/executor/operator_eq_/overload2.html index 126fa2fc2b..24b33b9ed3 100644 --- a/doc/html/boost_asio/reference/executor/operator_eq_/overload2.html +++ b/doc/html/boost_asio/reference/executor/operator_eq_/overload2.html @@ -33,7 +33,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/executor/operator_eq_/overload3.html b/doc/html/boost_asio/reference/executor/operator_eq_/overload3.html index 14be6c1146..41f5839d4c 100644 --- a/doc/html/boost_asio/reference/executor/operator_eq_/overload3.html +++ b/doc/html/boost_asio/reference/executor/operator_eq_/overload3.html @@ -36,7 +36,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/executor/operator_eq_/overload4.html b/doc/html/boost_asio/reference/executor/operator_eq_/overload4.html index eb9f1ad217..cccd4003ba 100644 --- a/doc/html/boost_asio/reference/executor/operator_eq_/overload4.html +++ b/doc/html/boost_asio/reference/executor/operator_eq_/overload4.html @@ -39,7 +39,7 @@ executor & operator=(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/executor/operator_eq__eq_.html b/doc/html/boost_asio/reference/executor/operator_eq__eq_.html index c1c863f598..00445d80be 100644 --- a/doc/html/boost_asio/reference/executor/operator_eq__eq_.html +++ b/doc/html/boost_asio/reference/executor/operator_eq__eq_.html @@ -48,7 +48,7 @@ Compare
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/executor/operator_not__eq_.html b/doc/html/boost_asio/reference/executor/operator_not__eq_.html index dddfbbcd99..f45d67e1ae 100644 --- a/doc/html/boost_asio/reference/executor/operator_not__eq_.html +++ b/doc/html/boost_asio/reference/executor/operator_not__eq_.html @@ -48,7 +48,7 @@ Compare
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/executor/operator_unspecified_bool_type.html b/doc/html/boost_asio/reference/executor/operator_unspecified_bool_type.html index a662e10ec1..771e6a3f37 100644 --- a/doc/html/boost_asio/reference/executor/operator_unspecified_bool_type.html +++ b/doc/html/boost_asio/reference/executor/operator_unspecified_bool_type.html @@ -37,7 +37,7 @@ Operator
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/executor/post.html b/doc/html/boost_asio/reference/executor/post.html index ce8c937a78..5099b15f6d 100644 --- a/doc/html/boost_asio/reference/executor/post.html +++ b/doc/html/boost_asio/reference/executor/post.html @@ -72,7 +72,7 @@ void post(
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/executor/target.html b/doc/html/boost_asio/reference/executor/target.html index 1f80b7fe11..dbed6fe217 100644 --- a/doc/html/boost_asio/reference/executor/target.html +++ b/doc/html/boost_asio/reference/executor/target.html @@ -44,7 +44,7 @@ const Executor *
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/executor/target/overload1.html b/doc/html/boost_asio/reference/executor/target/overload1.html index ff8a738b46..36e6efcb7f 100644 --- a/doc/html/boost_asio/reference/executor/target/overload1.html +++ b/doc/html/boost_asio/reference/executor/target/overload1.html @@ -46,7 +46,7 @@ Executor * target();
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/executor/target/overload2.html b/doc/html/boost_asio/reference/executor/target/overload2.html index c4f7b07e72..74d81ba689 100644 --- a/doc/html/boost_asio/reference/executor/target/overload2.html +++ b/doc/html/boost_asio/reference/executor/target/overload2.html @@ -46,7 +46,7 @@ const Executor * target() const;
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/executor/target_type.html b/doc/html/boost_asio/reference/executor/target_type.html index 3c7676e94e..7be6b35552 100644 --- a/doc/html/boost_asio/reference/executor/target_type.html +++ b/doc/html/boost_asio/reference/executor/target_type.html @@ -45,7 +45,7 @@ Obtain type
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/executor/unspecified_bool_true.html b/doc/html/boost_asio/reference/executor/unspecified_bool_true.html index 9f0b7311c8..15bbba4b67 100644 --- a/doc/html/boost_asio/reference/executor/unspecified_bool_true.html +++ b/doc/html/boost_asio/reference/executor/unspecified_bool_true.html @@ -35,7 +35,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/executor/unspecified_bool_type.html b/doc/html/boost_asio/reference/executor/unspecified_bool_type.html index 6b6f024e5b..2c863cd516 100644 --- a/doc/html/boost_asio/reference/executor/unspecified_bool_type.html +++ b/doc/html/boost_asio/reference/executor/unspecified_bool_type.html @@ -44,7 +44,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/executor__unspecified_bool_type_t.html b/doc/html/boost_asio/reference/executor__unspecified_bool_type_t.html index dbd2547c16..51096f0c7c 100644 --- a/doc/html/boost_asio/reference/executor__unspecified_bool_type_t.html +++ b/doc/html/boost_asio/reference/executor__unspecified_bool_type_t.html @@ -41,7 +41,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/executor_arg.html b/doc/html/boost_asio/reference/executor_arg.html index 6457369b35..c735f79ba6 100644 --- a/doc/html/boost_asio/reference/executor_arg.html +++ b/doc/html/boost_asio/reference/executor_arg.html @@ -51,7 +51,7 @@ A special value, similar to
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/executor_arg_t.html b/doc/html/boost_asio/reference/executor_arg_t.html index 6e851bd8ea..57ad0d3949 100644 --- a/doc/html/boost_asio/reference/executor_arg_t.html +++ b/doc/html/boost_asio/reference/executor_arg_t.html @@ -87,7 +87,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/executor_arg_t/executor_arg_t.html b/doc/html/boost_asio/reference/executor_arg_t/executor_arg_t.html index 80e151ccdf..9a3a5b870d 100644 --- a/doc/html/boost_asio/reference/executor_arg_t/executor_arg_t.html +++ b/doc/html/boost_asio/reference/executor_arg_t/executor_arg_t.html @@ -35,7 +35,7 @@ Constructor.
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/executor_binder.html b/doc/html/boost_asio/reference/executor_binder.html index cc22df4c0f..c5af2d399e 100644 --- a/doc/html/boost_asio/reference/executor_binder.html +++ b/doc/html/boost_asio/reference/executor_binder.html @@ -251,7 +251,7 @@ class executor_binder
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/executor_binder/_executor_binder.html b/doc/html/boost_asio/reference/executor_binder/_executor_binder.html index 676dd892ab..d29e1da999 100644 --- a/doc/html/boost_asio/reference/executor_binder/_executor_binder.html +++ b/doc/html/boost_asio/reference/executor_binder/_executor_binder.html @@ -35,7 +35,7 @@ Destructor.
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/executor_binder/argument_type.html b/doc/html/boost_asio/reference/executor_binder/argument_type.html index 37f2257fd6..ed357c49b1 100644 --- a/doc/html/boost_asio/reference/executor_binder/argument_type.html +++ b/doc/html/boost_asio/reference/executor_binder/argument_type.html @@ -64,7 +64,7 @@ The
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/executor_binder/executor_binder.html b/doc/html/boost_asio/reference/executor_binder/executor_binder.html index a35cb8a0a5..60029456c6 100644 --- a/doc/html/boost_asio/reference/executor_binder/executor_binder.html +++ b/doc/html/boost_asio/reference/executor_binder/executor_binder.html @@ -120,7 +120,7 @@ Construct
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/executor_binder/executor_binder/overload1.html b/doc/html/boost_asio/reference/executor_binder/executor_binder/overload1.html index de3032b967..412f3d21de 100644 --- a/doc/html/boost_asio/reference/executor_binder/executor_binder/overload1.html +++ b/doc/html/boost_asio/reference/executor_binder/executor_binder/overload1.html @@ -44,7 +44,7 @@ executor_binder(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/executor_binder/executor_binder/overload2.html b/doc/html/boost_asio/reference/executor_binder/executor_binder/overload2.html index b146d30ba5..068706a9cc 100644 --- a/doc/html/boost_asio/reference/executor_binder/executor_binder/overload2.html +++ b/doc/html/boost_asio/reference/executor_binder/executor_binder/overload2.html @@ -36,7 +36,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/executor_binder/executor_binder/overload3.html b/doc/html/boost_asio/reference/executor_binder/executor_binder/overload3.html index 986c6f7d9c..930c41ac45 100644 --- a/doc/html/boost_asio/reference/executor_binder/executor_binder/overload3.html +++ b/doc/html/boost_asio/reference/executor_binder/executor_binder/overload3.html @@ -38,7 +38,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/executor_binder/executor_binder/overload4.html b/doc/html/boost_asio/reference/executor_binder/executor_binder/overload4.html index 6007066165..cdfe078136 100644 --- a/doc/html/boost_asio/reference/executor_binder/executor_binder/overload4.html +++ b/doc/html/boost_asio/reference/executor_binder/executor_binder/overload4.html @@ -44,7 +44,7 @@ executor_binder(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/executor_binder/executor_binder/overload5.html b/doc/html/boost_asio/reference/executor_binder/executor_binder/overload5.html index 8fcfd54ecf..60ff54564b 100644 --- a/doc/html/boost_asio/reference/executor_binder/executor_binder/overload5.html +++ b/doc/html/boost_asio/reference/executor_binder/executor_binder/overload5.html @@ -46,7 +46,7 @@ executor_binder(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/executor_binder/executor_binder/overload6.html b/doc/html/boost_asio/reference/executor_binder/executor_binder/overload6.html index 1c33fac737..2a64e2bf59 100644 --- a/doc/html/boost_asio/reference/executor_binder/executor_binder/overload6.html +++ b/doc/html/boost_asio/reference/executor_binder/executor_binder/overload6.html @@ -36,7 +36,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/executor_binder/executor_binder/overload7.html b/doc/html/boost_asio/reference/executor_binder/executor_binder/overload7.html index 1f3cc7362e..c58d776f59 100644 --- a/doc/html/boost_asio/reference/executor_binder/executor_binder/overload7.html +++ b/doc/html/boost_asio/reference/executor_binder/executor_binder/overload7.html @@ -38,7 +38,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/executor_binder/executor_binder/overload8.html b/doc/html/boost_asio/reference/executor_binder/executor_binder/overload8.html index ee2395f072..2085a4d79a 100644 --- a/doc/html/boost_asio/reference/executor_binder/executor_binder/overload8.html +++ b/doc/html/boost_asio/reference/executor_binder/executor_binder/overload8.html @@ -39,7 +39,7 @@ executor_binder(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/executor_binder/executor_binder/overload9.html b/doc/html/boost_asio/reference/executor_binder/executor_binder/overload9.html index a71ae6def4..9b68c5ec93 100644 --- a/doc/html/boost_asio/reference/executor_binder/executor_binder/overload9.html +++ b/doc/html/boost_asio/reference/executor_binder/executor_binder/overload9.html @@ -42,7 +42,7 @@ executor_binder(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/executor_binder/executor_type.html b/doc/html/boost_asio/reference/executor_binder/executor_type.html index d887f505a0..bf2909c002 100644 --- a/doc/html/boost_asio/reference/executor_binder/executor_type.html +++ b/doc/html/boost_asio/reference/executor_binder/executor_type.html @@ -46,7 +46,7 @@ The
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/executor_binder/first_argument_type.html b/doc/html/boost_asio/reference/executor_binder/first_argument_type.html index 3eb930cb30..26c1c36a23 100644 --- a/doc/html/boost_asio/reference/executor_binder/first_argument_type.html +++ b/doc/html/boost_asio/reference/executor_binder/first_argument_type.html @@ -64,7 +64,7 @@ The
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/executor_binder/get.html b/doc/html/boost_asio/reference/executor_binder/get.html index d1b6b51218..3d11f051f7 100644 --- a/doc/html/boost_asio/reference/executor_binder/get.html +++ b/doc/html/boost_asio/reference/executor_binder/get.html @@ -40,7 +40,7 @@ const target_type &
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/executor_binder/get/overload1.html b/doc/html/boost_asio/reference/executor_binder/get/overload1.html index e83e027f31..62040a03b5 100644 --- a/doc/html/boost_asio/reference/executor_binder/get/overload1.html +++ b/doc/html/boost_asio/reference/executor_binder/get/overload1.html @@ -35,7 +35,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/executor_binder/get/overload2.html b/doc/html/boost_asio/reference/executor_binder/get/overload2.html index 9d9aed2fc6..41465532a8 100644 --- a/doc/html/boost_asio/reference/executor_binder/get/overload2.html +++ b/doc/html/boost_asio/reference/executor_binder/get/overload2.html @@ -35,7 +35,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/executor_binder/get_executor.html b/doc/html/boost_asio/reference/executor_binder/get_executor.html index f4f8f870a7..0edfd580f0 100644 --- a/doc/html/boost_asio/reference/executor_binder/get_executor.html +++ b/doc/html/boost_asio/reference/executor_binder/get_executor.html @@ -36,7 +36,7 @@ Obtain
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/executor_binder/operator_lp__rp_.html b/doc/html/boost_asio/reference/executor_binder/operator_lp__rp_.html index 46ecc610a7..84790d08de 100644 --- a/doc/html/boost_asio/reference/executor_binder/operator_lp__rp_.html +++ b/doc/html/boost_asio/reference/executor_binder/operator_lp__rp_.html @@ -44,7 +44,7 @@ auto
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/executor_binder/operator_lp__rp_/overload1.html b/doc/html/boost_asio/reference/executor_binder/operator_lp__rp_/overload1.html index b41f2692e0..be00dc16f2 100644 --- a/doc/html/boost_asio/reference/executor_binder/operator_lp__rp_/overload1.html +++ b/doc/html/boost_asio/reference/executor_binder/operator_lp__rp_/overload1.html @@ -35,7 +35,7 @@ auto operator()(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/executor_binder/operator_lp__rp_/overload2.html b/doc/html/boost_asio/reference/executor_binder/operator_lp__rp_/overload2.html index f3fac0a5ea..bc3c224412 100644 --- a/doc/html/boost_asio/reference/executor_binder/operator_lp__rp_/overload2.html +++ b/doc/html/boost_asio/reference/executor_binder/operator_lp__rp_/overload2.html @@ -35,7 +35,7 @@ auto operator()(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/executor_binder/result_type.html b/doc/html/boost_asio/reference/executor_binder/result_type.html index fcccf99bf3..504c9c22f7 100644 --- a/doc/html/boost_asio/reference/executor_binder/result_type.html +++ b/doc/html/boost_asio/reference/executor_binder/result_type.html @@ -63,7 +63,7 @@ The
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/executor_binder/second_argument_type.html b/doc/html/boost_asio/reference/executor_binder/second_argument_type.html index 59fef126ac..4c113ac5d2 100644 --- a/doc/html/boost_asio/reference/executor_binder/second_argument_type.html +++ b/doc/html/boost_asio/reference/executor_binder/second_argument_type.html @@ -64,7 +64,7 @@ The
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/executor_binder/target_type.html b/doc/html/boost_asio/reference/executor_binder/target_type.html index f129356c7b..0bd965148c 100644 --- a/doc/html/boost_asio/reference/executor_binder/target_type.html +++ b/doc/html/boost_asio/reference/executor_binder/target_type.html @@ -46,7 +46,7 @@ The
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/executor_work_guard.html b/doc/html/boost_asio/reference/executor_work_guard.html index 92adb71a79..df50d65783 100644 --- a/doc/html/boost_asio/reference/executor_work_guard.html +++ b/doc/html/boost_asio/reference/executor_work_guard.html @@ -172,7 +172,7 @@ class executor_work_guard
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/executor_work_guard/_executor_work_guard.html b/doc/html/boost_asio/reference/executor_work_guard/_executor_work_guard.html index 6c8749dd50..ffbfdf5e20 100644 --- a/doc/html/boost_asio/reference/executor_work_guard/_executor_work_guard.html +++ b/doc/html/boost_asio/reference/executor_work_guard/_executor_work_guard.html @@ -7,7 +7,7 @@ - + @@ -20,7 +20,7 @@
    -PrevUpHomeNext +PrevUpHomeNext

    @@ -39,7 +39,7 @@ Destructor.

    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    @@ -47,7 +47,7 @@ Destructor.
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost_asio/reference/executor_work_guard/executor_type.html b/doc/html/boost_asio/reference/executor_work_guard/executor_type.html index 2db43619bb..d29889d6b4 100644 --- a/doc/html/boost_asio/reference/executor_work_guard/executor_type.html +++ b/doc/html/boost_asio/reference/executor_work_guard/executor_type.html @@ -46,7 +46,7 @@ The
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/executor_work_guard/executor_work_guard.html b/doc/html/boost_asio/reference/executor_work_guard/executor_work_guard.html index 3b3561c7f1..f2e9efca6c 100644 --- a/doc/html/boost_asio/reference/executor_work_guard/executor_work_guard.html +++ b/doc/html/boost_asio/reference/executor_work_guard/executor_work_guard.html @@ -52,7 +52,7 @@ Constructs
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/executor_work_guard/executor_work_guard/overload1.html b/doc/html/boost_asio/reference/executor_work_guard/executor_work_guard/overload1.html index dac974f581..f6dad8ecdd 100644 --- a/doc/html/boost_asio/reference/executor_work_guard/executor_work_guard/overload1.html +++ b/doc/html/boost_asio/reference/executor_work_guard/executor_work_guard/overload1.html @@ -41,7 +41,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/executor_work_guard/executor_work_guard/overload2.html b/doc/html/boost_asio/reference/executor_work_guard/executor_work_guard/overload2.html index e8b4deb760..308a47b1bc 100644 --- a/doc/html/boost_asio/reference/executor_work_guard/executor_work_guard/overload2.html +++ b/doc/html/boost_asio/reference/executor_work_guard/executor_work_guard/overload2.html @@ -36,7 +36,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/executor_work_guard/executor_work_guard/overload3.html b/doc/html/boost_asio/reference/executor_work_guard/executor_work_guard/overload3.html index e8499e9b5e..b2ab60fe01 100644 --- a/doc/html/boost_asio/reference/executor_work_guard/executor_work_guard/overload3.html +++ b/doc/html/boost_asio/reference/executor_work_guard/executor_work_guard/overload3.html @@ -36,7 +36,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/executor_work_guard/get_executor.html b/doc/html/boost_asio/reference/executor_work_guard/get_executor.html index bc51a0ee27..8ff0c042c0 100644 --- a/doc/html/boost_asio/reference/executor_work_guard/get_executor.html +++ b/doc/html/boost_asio/reference/executor_work_guard/get_executor.html @@ -36,7 +36,7 @@ Obtain
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/executor_work_guard/owns_work.html b/doc/html/boost_asio/reference/executor_work_guard/owns_work.html index 8f4101dbc1..713574a78b 100644 --- a/doc/html/boost_asio/reference/executor_work_guard/owns_work.html +++ b/doc/html/boost_asio/reference/executor_work_guard/owns_work.html @@ -37,7 +37,7 @@ Whether
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/executor_work_guard/reset.html b/doc/html/boost_asio/reference/executor_work_guard/reset.html index 490a932c40..ed6ecf75e0 100644 --- a/doc/html/boost_asio/reference/executor_work_guard/reset.html +++ b/doc/html/boost_asio/reference/executor_work_guard/reset.html @@ -36,7 +36,7 @@ Indicate
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/experimental__await_token.html b/doc/html/boost_asio/reference/experimental__await_token.html new file mode 100644 index 0000000000..c8f4997fb6 --- /dev/null +++ b/doc/html/boost_asio/reference/experimental__await_token.html @@ -0,0 +1,164 @@ + + + +experimental::await_token + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +

    + A completion token that represents the currently executing coroutine. +

    +
    template<
+    typename Executor>
+class await_token
+
    +
    + + Types +
    +
    ++++ + + + + + + + + +
    +

    + Name +

    +     		+

    + Description +

    +
    +

    + executor_type +

    +     		+

    + The associated executor type. +

    +
    +
    + + Member + Functions +
    +
    ++++ + + + + + + + + + + + + + + +
    +

    + Name +

    +     		+

    + Description +

    +
    +

    + await_token +

    +     		+

    + Copy constructor. +

    +

    + Move constructor. +

    +
    +

    + get_executor +

    +     		+

    + Get the associated executor. +

    +
    +

    + The experimental::await_token + class is used to represent the currently executing coroutine. An experimental::await_token + may be passed as a handler to an asynchronous operation. For example: +

    +
    awaitable<void> my_coroutine()
+{
+  await_token token = co_await this_coro::token();
+  ...
+  std::size_t n = co_await my_socket.async_read_some(buffer, token);
+  ...
+}
+
    +

    + The initiating function (async_read_some in the above example) suspends the + current coroutine. The coroutine is resumed when the asynchronous operation + completes, and the result of the operation is returned. +

    +
    + + Requirements +
    +

    + Header: boost/asio/experimental/co_spawn.hpp +

    +

    + Convenience header: boost/asio/experimental.hpp +

    +
    + + + +
    Copyright © 2003-2018 Christopher M. Kohlhoff

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost_asio/reference/experimental__await_token/await_token.html b/doc/html/boost_asio/reference/experimental__await_token/await_token.html new file mode 100644 index 0000000000..cddb212e5c --- /dev/null +++ b/doc/html/boost_asio/reference/experimental__await_token/await_token.html @@ -0,0 +1,59 @@ + + + +experimental::await_token::await_token + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +

    + +Copy + constructor. +

    +
    await_token(
+    const await_token & other);
+  » more...
+
    +

    + Move constructor. +

    +
    await_token(
+    await_token && other);
+  » more...
+
    +
    + + + +
    Copyright © 2003-2018 Christopher M. Kohlhoff

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost_asio/reference/experimental__await_token/await_token/overload1.html b/doc/html/boost_asio/reference/experimental__await_token/await_token/overload1.html new file mode 100644 index 0000000000..51c0e95704 --- /dev/null +++ b/doc/html/boost_asio/reference/experimental__await_token/await_token/overload1.html @@ -0,0 +1,50 @@ + + + +experimental::await_token::await_token (1 of 2 overloads) + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +

    + Copy constructor. +

    +
    await_token(
+    const await_token & other);
+
    +
    + + + +
    Copyright © 2003-2018 Christopher M. Kohlhoff

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost_asio/reference/experimental__await_token/await_token/overload2.html b/doc/html/boost_asio/reference/experimental__await_token/await_token/overload2.html new file mode 100644 index 0000000000..188ccc557f --- /dev/null +++ b/doc/html/boost_asio/reference/experimental__await_token/await_token/overload2.html @@ -0,0 +1,50 @@ + + + +experimental::await_token::await_token (2 of 2 overloads) + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +

    + Move constructor. +

    +
    await_token(
+    await_token && other);
+
    +
    + + + +
    Copyright © 2003-2018 Christopher M. Kohlhoff

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost_asio/reference/experimental__await_token/executor_type.html b/doc/html/boost_asio/reference/experimental__await_token/executor_type.html new file mode 100644 index 0000000000..3f4efa0629 --- /dev/null +++ b/doc/html/boost_asio/reference/experimental__await_token/executor_type.html @@ -0,0 +1,60 @@ + + + +experimental::await_token::executor_type + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +

    + +The + associated executor type. +

    +
    typedef Executor executor_type;
+
    +
    + + Requirements +
    +

    + Header: boost/asio/experimental/co_spawn.hpp +

    +

    + Convenience header: boost/asio/experimental.hpp +

    +
    + + + +
    Copyright © 2003-2018 Christopher M. Kohlhoff

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost_asio/reference/experimental__await_token/get_executor.html b/doc/html/boost_asio/reference/experimental__await_token/get_executor.html new file mode 100644 index 0000000000..3405977cab --- /dev/null +++ b/doc/html/boost_asio/reference/experimental__await_token/get_executor.html @@ -0,0 +1,50 @@ + + + +experimental::await_token::get_executor + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +

    + +Get + the associated executor. +

    +
    executor_type get_executor() const;
+
    +
    + + + +
    Copyright © 2003-2018 Christopher M. Kohlhoff

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost_asio/reference/experimental__awaitable.html b/doc/html/boost_asio/reference/experimental__awaitable.html new file mode 100644 index 0000000000..ad8e4995cc --- /dev/null +++ b/doc/html/boost_asio/reference/experimental__awaitable.html @@ -0,0 +1,158 @@ + + + +experimental::awaitable + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +

    + The return type of a coroutine or asynchronous operation. +

    +
    template<
+    typename T,
+    typename Executor = strand<executor>>
+class awaitable
+
    +
    + + Types +
    +
    ++++ + + + + + + + + + + + + + + +
    +

    + Name +

    +     		+

    + Description +

    +
    +

    + executor_type +

    +     		+

    + The executor type that will be used for the coroutine. +

    +
    +

    + value_type +

    +     		+

    + The type of the awaited value. +

    +
    +
    + + Member + Functions +
    +
    ++++ + + + + + + + + + + + + + + +
    +

    + Name +

    +     		+

    + Description +

    +
    +

    + awaitable +

    +     		+

    + Move constructor. +

    +
    +

    + ~awaitable +

    +     		+

    + Destructor. +

    +
    +
    + + Requirements +
    +

    + Header: boost/asio/experimental/co_spawn.hpp +

    +

    + Convenience header: boost/asio/experimental.hpp +

    +
    + + + +
    Copyright © 2003-2018 Christopher M. Kohlhoff

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost_asio/reference/experimental__awaitable/_awaitable.html b/doc/html/boost_asio/reference/experimental__awaitable/_awaitable.html new file mode 100644 index 0000000000..8632adee3b --- /dev/null +++ b/doc/html/boost_asio/reference/experimental__awaitable/_awaitable.html @@ -0,0 +1,49 @@ + + + +experimental::awaitable::~awaitable + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +

    + +Destructor. +

    +
    ~awaitable();
+
    +
    + + + +
    Copyright © 2003-2018 Christopher M. Kohlhoff

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost_asio/reference/experimental__awaitable/awaitable.html b/doc/html/boost_asio/reference/experimental__awaitable/awaitable.html new file mode 100644 index 0000000000..ba771c5b3b --- /dev/null +++ b/doc/html/boost_asio/reference/experimental__awaitable/awaitable.html @@ -0,0 +1,51 @@ + + + +experimental::awaitable::awaitable + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +

    + +Move + constructor. +

    +
    awaitable(
+    awaitable && other);
+
    +
    + + + +
    Copyright © 2003-2018 Christopher M. Kohlhoff

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost_asio/reference/experimental__awaitable/executor_type.html b/doc/html/boost_asio/reference/experimental__awaitable/executor_type.html new file mode 100644 index 0000000000..2f33299484 --- /dev/null +++ b/doc/html/boost_asio/reference/experimental__awaitable/executor_type.html @@ -0,0 +1,60 @@ + + + +experimental::awaitable::executor_type + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +

    + +The + executor type that will be used for the coroutine. +

    +
    typedef Executor executor_type;
+
    +
    + + Requirements +
    +

    + Header: boost/asio/experimental/co_spawn.hpp +

    +

    + Convenience header: boost/asio/experimental.hpp +

    +
    + + + +
    Copyright © 2003-2018 Christopher M. Kohlhoff

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost_asio/reference/experimental__awaitable/value_type.html b/doc/html/boost_asio/reference/experimental__awaitable/value_type.html new file mode 100644 index 0000000000..e2577d71c0 --- /dev/null +++ b/doc/html/boost_asio/reference/experimental__awaitable/value_type.html @@ -0,0 +1,60 @@ + + + +experimental::awaitable::value_type + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +

    + +The + type of the awaited value. +

    +
    typedef T value_type;
+
    +
    + + Requirements +
    +

    + Header: boost/asio/experimental/co_spawn.hpp +

    +

    + Convenience header: boost/asio/experimental.hpp +

    +
    + + + +
    Copyright © 2003-2018 Christopher M. Kohlhoff

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost_asio/reference/experimental__co_spawn.html b/doc/html/boost_asio/reference/experimental__co_spawn.html new file mode 100644 index 0000000000..11840f80d4 --- /dev/null +++ b/doc/html/boost_asio/reference/experimental__co_spawn.html @@ -0,0 +1,90 @@ + + + +experimental::co_spawn + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +

    + +Spawn a + new thread of execution. +

    +
    template<
+    typename Executor,
+    typename F,
+    typename CompletionToken,
+    typename  = typename enable_if<is_executor<Executor>::value>::type>
+auto co_spawn(
+    const Executor & ex,
+    F && f,
+    CompletionToken && token);
+  » more...
+
+template<
+    typename ExecutionContext,
+    typename F,
+    typename CompletionToken,
+    typename  = typename enable_if<      is_convertible<ExecutionContext&, execution_context&>::value>::type>
+auto co_spawn(
+    ExecutionContext & ctx,
+    F && f,
+    CompletionToken && token);
+  » more...
+
+template<
+    typename Executor,
+    typename F,
+    typename CompletionToken>
+auto co_spawn(
+    const await_token< Executor > & parent,
+    F && f,
+    CompletionToken && token);
+  » more...
+
    +
    + + Requirements +
    +

    + Header: boost/asio/experimental/co_spawn.hpp +

    +

    + Convenience header: boost/asio/experimental.hpp +

    +
    + + + +
    Copyright © 2003-2018 Christopher M. Kohlhoff

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost_asio/reference/experimental__co_spawn/overload1.html b/doc/html/boost_asio/reference/experimental__co_spawn/overload1.html new file mode 100644 index 0000000000..a0b199ae59 --- /dev/null +++ b/doc/html/boost_asio/reference/experimental__co_spawn/overload1.html @@ -0,0 +1,57 @@ + + + +experimental::co_spawn (1 of 3 overloads) + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +

    + Spawn a new thread of execution. +

    +
    template<
+    typename Executor,
+    typename F,
+    typename CompletionToken,
+    typename  = typename enable_if<is_executor<Executor>::value>::type>
+auto co_spawn(
+    const Executor & ex,
+    F && f,
+    CompletionToken && token);
+
    +
    + + + +
    Copyright © 2003-2018 Christopher M. Kohlhoff

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost_asio/reference/experimental__co_spawn/overload2.html b/doc/html/boost_asio/reference/experimental__co_spawn/overload2.html new file mode 100644 index 0000000000..2fac2730c0 --- /dev/null +++ b/doc/html/boost_asio/reference/experimental__co_spawn/overload2.html @@ -0,0 +1,57 @@ + + + +experimental::co_spawn (2 of 3 overloads) + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +

    + Spawn a new thread of execution. +

    +
    template<
+    typename ExecutionContext,
+    typename F,
+    typename CompletionToken,
+    typename  = typename enable_if<      is_convertible<ExecutionContext&, execution_context&>::value>::type>
+auto co_spawn(
+    ExecutionContext & ctx,
+    F && f,
+    CompletionToken && token);
+
    +
    + + + +
    Copyright © 2003-2018 Christopher M. Kohlhoff

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost_asio/reference/experimental__co_spawn/overload3.html b/doc/html/boost_asio/reference/experimental__co_spawn/overload3.html new file mode 100644 index 0000000000..4c11e9f57b --- /dev/null +++ b/doc/html/boost_asio/reference/experimental__co_spawn/overload3.html @@ -0,0 +1,56 @@ + + + +experimental::co_spawn (3 of 3 overloads) + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +

    + Spawn a new thread of execution. +

    +
    template<
+    typename Executor,
+    typename F,
+    typename CompletionToken>
+auto co_spawn(
+    const await_token< Executor > & parent,
+    F && f,
+    CompletionToken && token);
+
    +
    + + + +
    Copyright © 2003-2018 Christopher M. Kohlhoff

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost_asio/reference/experimental__detached.html b/doc/html/boost_asio/reference/experimental__detached.html new file mode 100644 index 0000000000..f683037106 --- /dev/null +++ b/doc/html/boost_asio/reference/experimental__detached.html @@ -0,0 +1,64 @@ + + + +experimental::detached + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +

    + +A special + value, similar to std::nothrow. +

    +
    constexpr detached_t detached;
+
    +

    + See the documentation for experimental::detached_t + for a usage example. +

    +
    + + Requirements +
    +

    + Header: boost/asio/experimental/detached.hpp +

    +

    + Convenience header: boost/asio/experimental.hpp +

    +
    + + + +
    Copyright © 2003-2018 Christopher M. Kohlhoff

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost_asio/reference/experimental__detached_t.html b/doc/html/boost_asio/reference/experimental__detached_t.html new file mode 100644 index 0000000000..e71d403c06 --- /dev/null +++ b/doc/html/boost_asio/reference/experimental__detached_t.html @@ -0,0 +1,104 @@ + + + +experimental::detached_t + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +

    + Class used to specify that an asynchronous operation is detached. +

    +
    class detached_t
+
    +
    + + Member + Functions +
    +
    ++++ + + + + + + + + +
    +

    + Name +

    +     		+

    + Description +

    +
    +

    + detached_t +

    +     		+

    + Constructor. +

    +
    +

    + The experimental::detached_t + class is used to indicate that an asynchronous operation is detached. That + is, there is no completion handler waiting for the operation's result. A + experimental::detached_t + object may be passed as a handler to an asynchronous operation, typically + using the special value boost::asio::experimental::detached. + For example: +

    +
    my_socket.async_send(my_buffer, boost::asio::experimental::detached);
+
    +
    + + Requirements +
    +

    + Header: boost/asio/experimental/detached.hpp +

    +

    + Convenience header: boost/asio/experimental.hpp +

    +
    + + + +
    Copyright © 2003-2018 Christopher M. Kohlhoff

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost_asio/reference/experimental__detached_t/detached_t.html b/doc/html/boost_asio/reference/experimental__detached_t/detached_t.html new file mode 100644 index 0000000000..d9bbce1b3d --- /dev/null +++ b/doc/html/boost_asio/reference/experimental__detached_t/detached_t.html @@ -0,0 +1,49 @@ + + + +experimental::detached_t::detached_t + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +

    + +Constructor. +

    +
    constexpr detached_t();
+
    +
    + + + +
    Copyright © 2003-2018 Christopher M. Kohlhoff

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost_asio/reference/experimental__redirect_error.html b/doc/html/boost_asio/reference/experimental__redirect_error.html new file mode 100644 index 0000000000..a66b213e58 --- /dev/null +++ b/doc/html/boost_asio/reference/experimental__redirect_error.html @@ -0,0 +1,64 @@ + + + +experimental::redirect_error + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +

    + +Create + a completion token to capture error_code values to a variable. +

    +
    template<
+    typename CompletionToken>
+redirect_error_t< typename decay< CompletionToken >::type > redirect_error(
+    CompletionToken && completion_token,
+    boost::system::error_code & ec);
+
    +
    + + Requirements +
    +

    + Header: boost/asio/experimental/redirect_error.hpp +

    +

    + Convenience header: boost/asio/experimental.hpp +

    +
    + + + +
    Copyright © 2003-2018 Christopher M. Kohlhoff

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost_asio/reference/experimental__redirect_error_t.html b/doc/html/boost_asio/reference/experimental__redirect_error_t.html new file mode 100644 index 0000000000..c44148228a --- /dev/null +++ b/doc/html/boost_asio/reference/experimental__redirect_error_t.html @@ -0,0 +1,144 @@ + + + +experimental::redirect_error_t + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +

    + Completion token type used to specify that an error produced by an asynchronous + operation is captured to an error_code variable. +

    +
    template<
+    typename CompletionToken>
+class redirect_error_t
+
    +
    + + Member + Functions +
    +
    ++++ + + + + + + + + +
    +

    + Name +

    +     		+

    + Description +

    +
    +

    + redirect_error_t +

    +     		+

    + Constructor. +

    +
    +
    + + Data + Members +
    +
    ++++ + + + + + + + + + + + + + + +
    +

    + Name +

    +     		+

    + Description +

    +
    +

    + ec_ +

    +     		+
    +

    + token_ +

    +     		+
    +

    + The experimental::redirect_error_t + class is used to indicate that any error_code produced by an asynchronous + operation is captured to a specified variable. +

    +
    + + Requirements +
    +

    + Header: boost/asio/experimental/redirect_error.hpp +

    +

    + Convenience header: boost/asio/experimental.hpp +

    +
    + + + +
    Copyright © 2003-2018 Christopher M. Kohlhoff

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost_asio/reference/experimental__redirect_error_t/ec_.html b/doc/html/boost_asio/reference/experimental__redirect_error_t/ec_.html new file mode 100644 index 0000000000..4f96521f40 --- /dev/null +++ b/doc/html/boost_asio/reference/experimental__redirect_error_t/ec_.html @@ -0,0 +1,48 @@ + + + +experimental::redirect_error_t::ec_ + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +

    + +

    +
    boost::system::error_code & ec_;
+
    +
    + + + +
    Copyright © 2003-2018 Christopher M. Kohlhoff

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost_asio/reference/experimental__redirect_error_t/redirect_error_t.html b/doc/html/boost_asio/reference/experimental__redirect_error_t/redirect_error_t.html new file mode 100644 index 0000000000..96d46574eb --- /dev/null +++ b/doc/html/boost_asio/reference/experimental__redirect_error_t/redirect_error_t.html @@ -0,0 +1,53 @@ + + + +experimental::redirect_error_t::redirect_error_t + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +

    + +Constructor. +

    +
    template<
+    typename T>
+redirect_error_t(
+    T && completion_token,
+    boost::system::error_code & ec);
+
    +
    + + + +
    Copyright © 2003-2018 Christopher M. Kohlhoff

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost_asio/reference/experimental__redirect_error_t/token_.html b/doc/html/boost_asio/reference/experimental__redirect_error_t/token_.html new file mode 100644 index 0000000000..e9dcae80f6 --- /dev/null +++ b/doc/html/boost_asio/reference/experimental__redirect_error_t/token_.html @@ -0,0 +1,48 @@ + + + +experimental::redirect_error_t::token_ + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +

    + +

    +
    CompletionToken token_;
+
    +
    + + + +
    Copyright © 2003-2018 Christopher M. Kohlhoff

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost_asio/reference/experimental__this_coro__executor.html b/doc/html/boost_asio/reference/experimental__this_coro__executor.html new file mode 100644 index 0000000000..cddeaf4992 --- /dev/null +++ b/doc/html/boost_asio/reference/experimental__this_coro__executor.html @@ -0,0 +1,60 @@ + + + +experimental::this_coro::executor + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +

    + +Awaitable + object that returns the executor of the current coroutine. +

    +
    constexpr executor_t executor();
+
    +
    + + Requirements +
    +

    + Header: boost/asio/experimental/co_spawn.hpp +

    +

    + Convenience header: boost/asio/experimental.hpp +

    +
    + + + +
    Copyright © 2003-2018 Christopher M. Kohlhoff

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost_asio/reference/experimental__this_coro__executor_t.html b/doc/html/boost_asio/reference/experimental__this_coro__executor_t.html new file mode 100644 index 0000000000..ed9017a780 --- /dev/null +++ b/doc/html/boost_asio/reference/experimental__this_coro__executor_t.html @@ -0,0 +1,58 @@ + + + +experimental::this_coro::executor_t + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +

    + Awaitable type that returns the executor of the current coroutine. +

    +
    struct executor_t
+
    +
    + + Requirements +
    +

    + Header: boost/asio/experimental/co_spawn.hpp +

    +

    + Convenience header: boost/asio/experimental.hpp +

    +
    + + + +
    Copyright © 2003-2018 Christopher M. Kohlhoff

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost_asio/reference/experimental__this_coro__token.html b/doc/html/boost_asio/reference/experimental__this_coro__token.html new file mode 100644 index 0000000000..dc72f67c76 --- /dev/null +++ b/doc/html/boost_asio/reference/experimental__this_coro__token.html @@ -0,0 +1,60 @@ + + + +experimental::this_coro::token + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +

    + +Awaitable + object that returns a completion token for the current coroutine. +

    +
    constexpr token_t token();
+
    +
    + + Requirements +
    +

    + Header: boost/asio/experimental/co_spawn.hpp +

    +

    + Convenience header: boost/asio/experimental.hpp +

    +
    + + + +
    Copyright © 2003-2018 Christopher M. Kohlhoff

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost_asio/reference/experimental__this_coro__token_t.html b/doc/html/boost_asio/reference/experimental__this_coro__token_t.html new file mode 100644 index 0000000000..5b96ef45e9 --- /dev/null +++ b/doc/html/boost_asio/reference/experimental__this_coro__token_t.html @@ -0,0 +1,58 @@ + + + +experimental::this_coro::token_t + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +

    + Awaitable type that returns a completion token for the current coroutine. +

    +
    struct token_t
+
    +
    + + Requirements +
    +

    + Header: boost/asio/experimental/co_spawn.hpp +

    +

    + Convenience header: boost/asio/experimental.hpp +

    +
    + + + +
    Copyright © 2003-2018 Christopher M. Kohlhoff

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/boost_asio/reference/generic__basic_endpoint.html b/doc/html/boost_asio/reference/generic__basic_endpoint.html index d5709946d0..b5776edb50 100644 --- a/doc/html/boost_asio/reference/generic__basic_endpoint.html +++ b/doc/html/boost_asio/reference/generic__basic_endpoint.html @@ -6,7 +6,7 @@ - + @@ -20,7 +20,7 @@
    -PrevUpHomeNext +PrevUpHomeNext

    @@ -333,7 +333,7 @@ class basic_endpoint

    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    @@ -341,7 +341,7 @@ class basic_endpoint
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost_asio/reference/generic__basic_endpoint/basic_endpoint.html b/doc/html/boost_asio/reference/generic__basic_endpoint/basic_endpoint.html index 74aeeeb615..c891185371 100644 --- a/doc/html/boost_asio/reference/generic__basic_endpoint/basic_endpoint.html +++ b/doc/html/boost_asio/reference/generic__basic_endpoint/basic_endpoint.html @@ -62,7 +62,7 @@ Default
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/generic__basic_endpoint/basic_endpoint/overload1.html b/doc/html/boost_asio/reference/generic__basic_endpoint/basic_endpoint/overload1.html index 26e2d8056d..2d8389bedd 100644 --- a/doc/html/boost_asio/reference/generic__basic_endpoint/basic_endpoint/overload1.html +++ b/doc/html/boost_asio/reference/generic__basic_endpoint/basic_endpoint/overload1.html @@ -35,7 +35,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/generic__basic_endpoint/basic_endpoint/overload2.html b/doc/html/boost_asio/reference/generic__basic_endpoint/basic_endpoint/overload2.html index f6a6429486..0a4772089e 100644 --- a/doc/html/boost_asio/reference/generic__basic_endpoint/basic_endpoint/overload2.html +++ b/doc/html/boost_asio/reference/generic__basic_endpoint/basic_endpoint/overload2.html @@ -38,7 +38,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/generic__basic_endpoint/basic_endpoint/overload3.html b/doc/html/boost_asio/reference/generic__basic_endpoint/basic_endpoint/overload3.html index 0f7b926381..f40e617174 100644 --- a/doc/html/boost_asio/reference/generic__basic_endpoint/basic_endpoint/overload3.html +++ b/doc/html/boost_asio/reference/generic__basic_endpoint/basic_endpoint/overload3.html @@ -38,7 +38,7 @@ basic_endpoint(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/generic__basic_endpoint/basic_endpoint/overload4.html b/doc/html/boost_asio/reference/generic__basic_endpoint/basic_endpoint/overload4.html index 8b3facd103..2bc39a4146 100644 --- a/doc/html/boost_asio/reference/generic__basic_endpoint/basic_endpoint/overload4.html +++ b/doc/html/boost_asio/reference/generic__basic_endpoint/basic_endpoint/overload4.html @@ -36,7 +36,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/generic__basic_endpoint/capacity.html b/doc/html/boost_asio/reference/generic__basic_endpoint/capacity.html index faefa04e81..156e978fab 100644 --- a/doc/html/boost_asio/reference/generic__basic_endpoint/capacity.html +++ b/doc/html/boost_asio/reference/generic__basic_endpoint/capacity.html @@ -36,7 +36,7 @@ Get
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/generic__basic_endpoint/data.html b/doc/html/boost_asio/reference/generic__basic_endpoint/data.html index 4814dc894e..80c2aae4ee 100644 --- a/doc/html/boost_asio/reference/generic__basic_endpoint/data.html +++ b/doc/html/boost_asio/reference/generic__basic_endpoint/data.html @@ -40,7 +40,7 @@ const data_type *
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/generic__basic_endpoint/data/overload1.html b/doc/html/boost_asio/reference/generic__basic_endpoint/data/overload1.html index 7551079abf..06302d0dc8 100644 --- a/doc/html/boost_asio/reference/generic__basic_endpoint/data/overload1.html +++ b/doc/html/boost_asio/reference/generic__basic_endpoint/data/overload1.html @@ -35,7 +35,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/generic__basic_endpoint/data/overload2.html b/doc/html/boost_asio/reference/generic__basic_endpoint/data/overload2.html index 77a4ac94b2..5210bbeac8 100644 --- a/doc/html/boost_asio/reference/generic__basic_endpoint/data/overload2.html +++ b/doc/html/boost_asio/reference/generic__basic_endpoint/data/overload2.html @@ -35,7 +35,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/generic__basic_endpoint/data_type.html b/doc/html/boost_asio/reference/generic__basic_endpoint/data_type.html index 86b8894185..32d5a47274 100644 --- a/doc/html/boost_asio/reference/generic__basic_endpoint/data_type.html +++ b/doc/html/boost_asio/reference/generic__basic_endpoint/data_type.html @@ -47,7 +47,7 @@ The
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/generic__basic_endpoint/operator_eq_.html b/doc/html/boost_asio/reference/generic__basic_endpoint/operator_eq_.html index c8d90efa47..13ad1424c1 100644 --- a/doc/html/boost_asio/reference/generic__basic_endpoint/operator_eq_.html +++ b/doc/html/boost_asio/reference/generic__basic_endpoint/operator_eq_.html @@ -37,7 +37,7 @@ Assign
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/generic__basic_endpoint/operator_eq__eq_.html b/doc/html/boost_asio/reference/generic__basic_endpoint/operator_eq__eq_.html index edc13141ad..600fe64cc8 100644 --- a/doc/html/boost_asio/reference/generic__basic_endpoint/operator_eq__eq_.html +++ b/doc/html/boost_asio/reference/generic__basic_endpoint/operator_eq__eq_.html @@ -48,7 +48,7 @@ Compare
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/generic__basic_endpoint/operator_gt_.html b/doc/html/boost_asio/reference/generic__basic_endpoint/operator_gt_.html index 7164891e4c..248721205e 100644 --- a/doc/html/boost_asio/reference/generic__basic_endpoint/operator_gt_.html +++ b/doc/html/boost_asio/reference/generic__basic_endpoint/operator_gt_.html @@ -48,7 +48,7 @@ Compare
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/generic__basic_endpoint/operator_gt__eq_.html b/doc/html/boost_asio/reference/generic__basic_endpoint/operator_gt__eq_.html index 565b34e75e..c681be2896 100644 --- a/doc/html/boost_asio/reference/generic__basic_endpoint/operator_gt__eq_.html +++ b/doc/html/boost_asio/reference/generic__basic_endpoint/operator_gt__eq_.html @@ -48,7 +48,7 @@ Compare
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/generic__basic_endpoint/operator_lt_.html b/doc/html/boost_asio/reference/generic__basic_endpoint/operator_lt_.html index 56184fd5c9..29f72f4133 100644 --- a/doc/html/boost_asio/reference/generic__basic_endpoint/operator_lt_.html +++ b/doc/html/boost_asio/reference/generic__basic_endpoint/operator_lt_.html @@ -48,7 +48,7 @@ Compare
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/generic__basic_endpoint/operator_lt__eq_.html b/doc/html/boost_asio/reference/generic__basic_endpoint/operator_lt__eq_.html index 5754a3b3f9..10498ab08a 100644 --- a/doc/html/boost_asio/reference/generic__basic_endpoint/operator_lt__eq_.html +++ b/doc/html/boost_asio/reference/generic__basic_endpoint/operator_lt__eq_.html @@ -48,7 +48,7 @@ Compare
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/generic__basic_endpoint/operator_not__eq_.html b/doc/html/boost_asio/reference/generic__basic_endpoint/operator_not__eq_.html index a5d435f775..699132cf2e 100644 --- a/doc/html/boost_asio/reference/generic__basic_endpoint/operator_not__eq_.html +++ b/doc/html/boost_asio/reference/generic__basic_endpoint/operator_not__eq_.html @@ -48,7 +48,7 @@ Compare
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/generic__basic_endpoint/protocol.html b/doc/html/boost_asio/reference/generic__basic_endpoint/protocol.html index a7c580d596..23548c9861 100644 --- a/doc/html/boost_asio/reference/generic__basic_endpoint/protocol.html +++ b/doc/html/boost_asio/reference/generic__basic_endpoint/protocol.html @@ -36,7 +36,7 @@ The
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/generic__basic_endpoint/protocol_type.html b/doc/html/boost_asio/reference/generic__basic_endpoint/protocol_type.html index 1ebb13beb3..38aa6feb3d 100644 --- a/doc/html/boost_asio/reference/generic__basic_endpoint/protocol_type.html +++ b/doc/html/boost_asio/reference/generic__basic_endpoint/protocol_type.html @@ -46,7 +46,7 @@ The
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/generic__basic_endpoint/resize.html b/doc/html/boost_asio/reference/generic__basic_endpoint/resize.html index ffe6ce4a49..0a0f9b3e47 100644 --- a/doc/html/boost_asio/reference/generic__basic_endpoint/resize.html +++ b/doc/html/boost_asio/reference/generic__basic_endpoint/resize.html @@ -37,7 +37,7 @@ Set
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/generic__basic_endpoint/size.html b/doc/html/boost_asio/reference/generic__basic_endpoint/size.html index 061eda91c9..e0ef5b9789 100644 --- a/doc/html/boost_asio/reference/generic__basic_endpoint/size.html +++ b/doc/html/boost_asio/reference/generic__basic_endpoint/size.html @@ -36,7 +36,7 @@ Get
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/generic__datagram_protocol.html b/doc/html/boost_asio/reference/generic__datagram_protocol.html index f21aa37797..65a96cc127 100644 --- a/doc/html/boost_asio/reference/generic__datagram_protocol.html +++ b/doc/html/boost_asio/reference/generic__datagram_protocol.html @@ -246,7 +246,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/generic__datagram_protocol/datagram_protocol.html b/doc/html/boost_asio/reference/generic__datagram_protocol/datagram_protocol.html index 2542dd3b09..4fb3587748 100644 --- a/doc/html/boost_asio/reference/generic__datagram_protocol/datagram_protocol.html +++ b/doc/html/boost_asio/reference/generic__datagram_protocol/datagram_protocol.html @@ -48,7 +48,7 @@ Construct
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/generic__datagram_protocol/datagram_protocol/overload1.html b/doc/html/boost_asio/reference/generic__datagram_protocol/datagram_protocol/overload1.html index c602382aee..04c1eea6b7 100644 --- a/doc/html/boost_asio/reference/generic__datagram_protocol/datagram_protocol/overload1.html +++ b/doc/html/boost_asio/reference/generic__datagram_protocol/datagram_protocol/overload1.html @@ -37,7 +37,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/generic__datagram_protocol/datagram_protocol/overload2.html b/doc/html/boost_asio/reference/generic__datagram_protocol/datagram_protocol/overload2.html index ac73077e55..80bafbb360 100644 --- a/doc/html/boost_asio/reference/generic__datagram_protocol/datagram_protocol/overload2.html +++ b/doc/html/boost_asio/reference/generic__datagram_protocol/datagram_protocol/overload2.html @@ -51,7 +51,7 @@ datagram_protocol(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/generic__datagram_protocol/endpoint.html b/doc/html/boost_asio/reference/generic__datagram_protocol/endpoint.html index 8e4fb65508..33d209c3cf 100644 --- a/doc/html/boost_asio/reference/generic__datagram_protocol/endpoint.html +++ b/doc/html/boost_asio/reference/generic__datagram_protocol/endpoint.html @@ -333,7 +333,7 @@ The
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/generic__datagram_protocol/family.html b/doc/html/boost_asio/reference/generic__datagram_protocol/family.html index c91c92a350..209405e1d5 100644 --- a/doc/html/boost_asio/reference/generic__datagram_protocol/family.html +++ b/doc/html/boost_asio/reference/generic__datagram_protocol/family.html @@ -36,7 +36,7 @@ Obtain
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/generic__datagram_protocol/operator_eq__eq_.html b/doc/html/boost_asio/reference/generic__datagram_protocol/operator_eq__eq_.html index b1a8ff076d..1a21066dc7 100644 --- a/doc/html/boost_asio/reference/generic__datagram_protocol/operator_eq__eq_.html +++ b/doc/html/boost_asio/reference/generic__datagram_protocol/operator_eq__eq_.html @@ -48,7 +48,7 @@ Compare
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/generic__datagram_protocol/operator_not__eq_.html b/doc/html/boost_asio/reference/generic__datagram_protocol/operator_not__eq_.html index 702f655cb8..292539a077 100644 --- a/doc/html/boost_asio/reference/generic__datagram_protocol/operator_not__eq_.html +++ b/doc/html/boost_asio/reference/generic__datagram_protocol/operator_not__eq_.html @@ -48,7 +48,7 @@ Compare
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/generic__datagram_protocol/protocol.html b/doc/html/boost_asio/reference/generic__datagram_protocol/protocol.html index 396bd0e60a..4b8c3ca77d 100644 --- a/doc/html/boost_asio/reference/generic__datagram_protocol/protocol.html +++ b/doc/html/boost_asio/reference/generic__datagram_protocol/protocol.html @@ -36,7 +36,7 @@ Obtain
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/generic__datagram_protocol/socket.html b/doc/html/boost_asio/reference/generic__datagram_protocol/socket.html index 146464c78d..67ded8b9d4 100644 --- a/doc/html/boost_asio/reference/generic__datagram_protocol/socket.html +++ b/doc/html/boost_asio/reference/generic__datagram_protocol/socket.html @@ -943,7 +943,7 @@ The
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/generic__datagram_protocol/type.html b/doc/html/boost_asio/reference/generic__datagram_protocol/type.html index a8d40c5d7a..a2fb8fb4cd 100644 --- a/doc/html/boost_asio/reference/generic__datagram_protocol/type.html +++ b/doc/html/boost_asio/reference/generic__datagram_protocol/type.html @@ -36,7 +36,7 @@ Obtain
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/generic__raw_protocol.html b/doc/html/boost_asio/reference/generic__raw_protocol.html index d34408ac09..605457560a 100644 --- a/doc/html/boost_asio/reference/generic__raw_protocol.html +++ b/doc/html/boost_asio/reference/generic__raw_protocol.html @@ -246,7 +246,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/generic__raw_protocol/endpoint.html b/doc/html/boost_asio/reference/generic__raw_protocol/endpoint.html index 8ad96e6360..0af1541c70 100644 --- a/doc/html/boost_asio/reference/generic__raw_protocol/endpoint.html +++ b/doc/html/boost_asio/reference/generic__raw_protocol/endpoint.html @@ -333,7 +333,7 @@ The
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/generic__raw_protocol/family.html b/doc/html/boost_asio/reference/generic__raw_protocol/family.html index 646d5a3212..80d721179c 100644 --- a/doc/html/boost_asio/reference/generic__raw_protocol/family.html +++ b/doc/html/boost_asio/reference/generic__raw_protocol/family.html @@ -36,7 +36,7 @@ Obtain
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/generic__raw_protocol/operator_eq__eq_.html b/doc/html/boost_asio/reference/generic__raw_protocol/operator_eq__eq_.html index 2b023e4d0f..e1fca547d9 100644 --- a/doc/html/boost_asio/reference/generic__raw_protocol/operator_eq__eq_.html +++ b/doc/html/boost_asio/reference/generic__raw_protocol/operator_eq__eq_.html @@ -48,7 +48,7 @@ Compare
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/generic__raw_protocol/operator_not__eq_.html b/doc/html/boost_asio/reference/generic__raw_protocol/operator_not__eq_.html index 96673fd67f..06de76802b 100644 --- a/doc/html/boost_asio/reference/generic__raw_protocol/operator_not__eq_.html +++ b/doc/html/boost_asio/reference/generic__raw_protocol/operator_not__eq_.html @@ -48,7 +48,7 @@ Compare
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/generic__raw_protocol/protocol.html b/doc/html/boost_asio/reference/generic__raw_protocol/protocol.html index 59b25ae5ab..18e7379123 100644 --- a/doc/html/boost_asio/reference/generic__raw_protocol/protocol.html +++ b/doc/html/boost_asio/reference/generic__raw_protocol/protocol.html @@ -36,7 +36,7 @@ Obtain
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/generic__raw_protocol/raw_protocol.html b/doc/html/boost_asio/reference/generic__raw_protocol/raw_protocol.html index b0a0ab7ab6..4f9ac96da6 100644 --- a/doc/html/boost_asio/reference/generic__raw_protocol/raw_protocol.html +++ b/doc/html/boost_asio/reference/generic__raw_protocol/raw_protocol.html @@ -48,7 +48,7 @@ Construct
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/generic__raw_protocol/raw_protocol/overload1.html b/doc/html/boost_asio/reference/generic__raw_protocol/raw_protocol/overload1.html index de120988ff..e91e9d605f 100644 --- a/doc/html/boost_asio/reference/generic__raw_protocol/raw_protocol/overload1.html +++ b/doc/html/boost_asio/reference/generic__raw_protocol/raw_protocol/overload1.html @@ -37,7 +37,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/generic__raw_protocol/raw_protocol/overload2.html b/doc/html/boost_asio/reference/generic__raw_protocol/raw_protocol/overload2.html index e603ca3871..1ba5b4139e 100644 --- a/doc/html/boost_asio/reference/generic__raw_protocol/raw_protocol/overload2.html +++ b/doc/html/boost_asio/reference/generic__raw_protocol/raw_protocol/overload2.html @@ -51,7 +51,7 @@ raw_protocol(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/generic__raw_protocol/socket.html b/doc/html/boost_asio/reference/generic__raw_protocol/socket.html index 80e2bc1c46..b27b3f19d2 100644 --- a/doc/html/boost_asio/reference/generic__raw_protocol/socket.html +++ b/doc/html/boost_asio/reference/generic__raw_protocol/socket.html @@ -942,7 +942,7 @@ The
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/generic__raw_protocol/type.html b/doc/html/boost_asio/reference/generic__raw_protocol/type.html index 4a78ef7cbb..b608ecf0d4 100644 --- a/doc/html/boost_asio/reference/generic__raw_protocol/type.html +++ b/doc/html/boost_asio/reference/generic__raw_protocol/type.html @@ -36,7 +36,7 @@ Obtain
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/generic__seq_packet_protocol.html b/doc/html/boost_asio/reference/generic__seq_packet_protocol.html index 06c4071409..c0b90aa62a 100644 --- a/doc/html/boost_asio/reference/generic__seq_packet_protocol.html +++ b/doc/html/boost_asio/reference/generic__seq_packet_protocol.html @@ -241,7 +241,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/generic__seq_packet_protocol/endpoint.html b/doc/html/boost_asio/reference/generic__seq_packet_protocol/endpoint.html index 884791f486..438c4071ea 100644 --- a/doc/html/boost_asio/reference/generic__seq_packet_protocol/endpoint.html +++ b/doc/html/boost_asio/reference/generic__seq_packet_protocol/endpoint.html @@ -333,7 +333,7 @@ The
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/generic__seq_packet_protocol/family.html b/doc/html/boost_asio/reference/generic__seq_packet_protocol/family.html index fc1131c935..85eedf8cae 100644 --- a/doc/html/boost_asio/reference/generic__seq_packet_protocol/family.html +++ b/doc/html/boost_asio/reference/generic__seq_packet_protocol/family.html @@ -36,7 +36,7 @@ Obtain
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/generic__seq_packet_protocol/operator_eq__eq_.html b/doc/html/boost_asio/reference/generic__seq_packet_protocol/operator_eq__eq_.html index 04e17899f5..5cc4967020 100644 --- a/doc/html/boost_asio/reference/generic__seq_packet_protocol/operator_eq__eq_.html +++ b/doc/html/boost_asio/reference/generic__seq_packet_protocol/operator_eq__eq_.html @@ -48,7 +48,7 @@ Compare
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/generic__seq_packet_protocol/operator_not__eq_.html b/doc/html/boost_asio/reference/generic__seq_packet_protocol/operator_not__eq_.html index ec4e84610b..89e83a5010 100644 --- a/doc/html/boost_asio/reference/generic__seq_packet_protocol/operator_not__eq_.html +++ b/doc/html/boost_asio/reference/generic__seq_packet_protocol/operator_not__eq_.html @@ -48,7 +48,7 @@ Compare
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/generic__seq_packet_protocol/protocol.html b/doc/html/boost_asio/reference/generic__seq_packet_protocol/protocol.html index ca3af3d807..2f00960f82 100644 --- a/doc/html/boost_asio/reference/generic__seq_packet_protocol/protocol.html +++ b/doc/html/boost_asio/reference/generic__seq_packet_protocol/protocol.html @@ -36,7 +36,7 @@ Obtain
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/generic__seq_packet_protocol/seq_packet_protocol.html b/doc/html/boost_asio/reference/generic__seq_packet_protocol/seq_packet_protocol.html index 32f99356fa..81e481bc98 100644 --- a/doc/html/boost_asio/reference/generic__seq_packet_protocol/seq_packet_protocol.html +++ b/doc/html/boost_asio/reference/generic__seq_packet_protocol/seq_packet_protocol.html @@ -48,7 +48,7 @@ Construct
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/generic__seq_packet_protocol/seq_packet_protocol/overload1.html b/doc/html/boost_asio/reference/generic__seq_packet_protocol/seq_packet_protocol/overload1.html index 8b00d1d9c0..9a7f5bc0ff 100644 --- a/doc/html/boost_asio/reference/generic__seq_packet_protocol/seq_packet_protocol/overload1.html +++ b/doc/html/boost_asio/reference/generic__seq_packet_protocol/seq_packet_protocol/overload1.html @@ -37,7 +37,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/generic__seq_packet_protocol/seq_packet_protocol/overload2.html b/doc/html/boost_asio/reference/generic__seq_packet_protocol/seq_packet_protocol/overload2.html index 1f7ccdc96c..ba1023fc46 100644 --- a/doc/html/boost_asio/reference/generic__seq_packet_protocol/seq_packet_protocol/overload2.html +++ b/doc/html/boost_asio/reference/generic__seq_packet_protocol/seq_packet_protocol/overload2.html @@ -52,7 +52,7 @@ seq_packet_protocol(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/generic__seq_packet_protocol/socket.html b/doc/html/boost_asio/reference/generic__seq_packet_protocol/socket.html index e569e40954..7e2d5f8ddb 100644 --- a/doc/html/boost_asio/reference/generic__seq_packet_protocol/socket.html +++ b/doc/html/boost_asio/reference/generic__seq_packet_protocol/socket.html @@ -898,7 +898,7 @@ The
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/generic__seq_packet_protocol/type.html b/doc/html/boost_asio/reference/generic__seq_packet_protocol/type.html index 0a10de63f1..cc659e010c 100644 --- a/doc/html/boost_asio/reference/generic__seq_packet_protocol/type.html +++ b/doc/html/boost_asio/reference/generic__seq_packet_protocol/type.html @@ -36,7 +36,7 @@ Obtain
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/generic__stream_protocol.html b/doc/html/boost_asio/reference/generic__stream_protocol.html index 75bb769167..a7d3c87c96 100644 --- a/doc/html/boost_asio/reference/generic__stream_protocol.html +++ b/doc/html/boost_asio/reference/generic__stream_protocol.html @@ -258,7 +258,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/generic__stream_protocol/endpoint.html b/doc/html/boost_asio/reference/generic__stream_protocol/endpoint.html index ff6e95e23b..a252bc29cb 100644 --- a/doc/html/boost_asio/reference/generic__stream_protocol/endpoint.html +++ b/doc/html/boost_asio/reference/generic__stream_protocol/endpoint.html @@ -333,7 +333,7 @@ The
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/generic__stream_protocol/family.html b/doc/html/boost_asio/reference/generic__stream_protocol/family.html index 93e3239d22..9aece973a2 100644 --- a/doc/html/boost_asio/reference/generic__stream_protocol/family.html +++ b/doc/html/boost_asio/reference/generic__stream_protocol/family.html @@ -36,7 +36,7 @@ Obtain
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/generic__stream_protocol/iostream.html b/doc/html/boost_asio/reference/generic__stream_protocol/iostream.html index efd474fd8f..5e7d3b6e29 100644 --- a/doc/html/boost_asio/reference/generic__stream_protocol/iostream.html +++ b/doc/html/boost_asio/reference/generic__stream_protocol/iostream.html @@ -331,7 +331,7 @@ The
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/generic__stream_protocol/operator_eq__eq_.html b/doc/html/boost_asio/reference/generic__stream_protocol/operator_eq__eq_.html index e044a9107d..7dcc19c2e3 100644 --- a/doc/html/boost_asio/reference/generic__stream_protocol/operator_eq__eq_.html +++ b/doc/html/boost_asio/reference/generic__stream_protocol/operator_eq__eq_.html @@ -48,7 +48,7 @@ Compare
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/generic__stream_protocol/operator_not__eq_.html b/doc/html/boost_asio/reference/generic__stream_protocol/operator_not__eq_.html index 3551d4c6c7..433c729d29 100644 --- a/doc/html/boost_asio/reference/generic__stream_protocol/operator_not__eq_.html +++ b/doc/html/boost_asio/reference/generic__stream_protocol/operator_not__eq_.html @@ -48,7 +48,7 @@ Compare
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/generic__stream_protocol/protocol.html b/doc/html/boost_asio/reference/generic__stream_protocol/protocol.html index 04db4ecb65..014de2044c 100644 --- a/doc/html/boost_asio/reference/generic__stream_protocol/protocol.html +++ b/doc/html/boost_asio/reference/generic__stream_protocol/protocol.html @@ -36,7 +36,7 @@ Obtain
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/generic__stream_protocol/socket.html b/doc/html/boost_asio/reference/generic__stream_protocol/socket.html index 3e7e13055f..0a5dad6a3b 100644 --- a/doc/html/boost_asio/reference/generic__stream_protocol/socket.html +++ b/doc/html/boost_asio/reference/generic__stream_protocol/socket.html @@ -946,7 +946,7 @@ The
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/generic__stream_protocol/stream_protocol.html b/doc/html/boost_asio/reference/generic__stream_protocol/stream_protocol.html index b17146113c..30675213ca 100644 --- a/doc/html/boost_asio/reference/generic__stream_protocol/stream_protocol.html +++ b/doc/html/boost_asio/reference/generic__stream_protocol/stream_protocol.html @@ -48,7 +48,7 @@ Construct
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/generic__stream_protocol/stream_protocol/overload1.html b/doc/html/boost_asio/reference/generic__stream_protocol/stream_protocol/overload1.html index 19233b508d..69cfa629c6 100644 --- a/doc/html/boost_asio/reference/generic__stream_protocol/stream_protocol/overload1.html +++ b/doc/html/boost_asio/reference/generic__stream_protocol/stream_protocol/overload1.html @@ -37,7 +37,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/generic__stream_protocol/stream_protocol/overload2.html b/doc/html/boost_asio/reference/generic__stream_protocol/stream_protocol/overload2.html index eb436ca77f..90bce0e011 100644 --- a/doc/html/boost_asio/reference/generic__stream_protocol/stream_protocol/overload2.html +++ b/doc/html/boost_asio/reference/generic__stream_protocol/stream_protocol/overload2.html @@ -51,7 +51,7 @@ stream_protocol(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/generic__stream_protocol/type.html b/doc/html/boost_asio/reference/generic__stream_protocol/type.html index b44e330732..e0384c1829 100644 --- a/doc/html/boost_asio/reference/generic__stream_protocol/type.html +++ b/doc/html/boost_asio/reference/generic__stream_protocol/type.html @@ -36,7 +36,7 @@ Obtain
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/get_associated_allocator.html b/doc/html/boost_asio/reference/get_associated_allocator.html index 0011181561..7692a97189 100644 --- a/doc/html/boost_asio/reference/get_associated_allocator.html +++ b/doc/html/boost_asio/reference/get_associated_allocator.html @@ -58,7 +58,7 @@ associated_allocator< T, Allocator >::type
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/get_associated_allocator/overload1.html b/doc/html/boost_asio/reference/get_associated_allocator/overload1.html index 17dd02e628..76b8246f60 100644 --- a/doc/html/boost_asio/reference/get_associated_allocator/overload1.html +++ b/doc/html/boost_asio/reference/get_associated_allocator/overload1.html @@ -46,7 +46,7 @@ associated_allocator< T >::type get_associated_allocator(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/get_associated_allocator/overload2.html b/doc/html/boost_asio/reference/get_associated_allocator/overload2.html index a506272702..22afd01e0a 100644 --- a/doc/html/boost_asio/reference/get_associated_allocator/overload2.html +++ b/doc/html/boost_asio/reference/get_associated_allocator/overload2.html @@ -48,7 +48,7 @@ associated_allocator< T, Allocator >::type get_associated_allocator(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/get_associated_executor.html b/doc/html/boost_asio/reference/get_associated_executor.html index 1d11bd76f3..3fe8464f51 100644 --- a/doc/html/boost_asio/reference/get_associated_executor.html +++ b/doc/html/boost_asio/reference/get_associated_executor.html @@ -68,7 +68,7 @@ associated_executor< T, typename ExecutionContext::executor_type >::type <
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/get_associated_executor/overload1.html b/doc/html/boost_asio/reference/get_associated_executor/overload1.html index 380b64a0a7..76a387ecbf 100644 --- a/doc/html/boost_asio/reference/get_associated_executor/overload1.html +++ b/doc/html/boost_asio/reference/get_associated_executor/overload1.html @@ -46,7 +46,7 @@ associated_executor< T >::type get_associated_executor(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/get_associated_executor/overload2.html b/doc/html/boost_asio/reference/get_associated_executor/overload2.html index 759e5f1986..7e24fb24bc 100644 --- a/doc/html/boost_asio/reference/get_associated_executor/overload2.html +++ b/doc/html/boost_asio/reference/get_associated_executor/overload2.html @@ -49,7 +49,7 @@ associated_executor< T, Executor >::type get_associated_executor(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/get_associated_executor/overload3.html b/doc/html/boost_asio/reference/get_associated_executor/overload3.html index af9cfca48c..bf11098008 100644 --- a/doc/html/boost_asio/reference/get_associated_executor/overload3.html +++ b/doc/html/boost_asio/reference/get_associated_executor/overload3.html @@ -50,7 +50,7 @@ associated_executor< T, typename ExecutionContext::executor_type >::type g
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/handler_type.html b/doc/html/boost_asio/reference/handler_type.html index 1e62bd2573..b5c7c8aa02 100644 --- a/doc/html/boost_asio/reference/handler_type.html +++ b/doc/html/boost_asio/reference/handler_type.html @@ -92,7 +92,7 @@ struct handler_type
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/handler_type/type.html b/doc/html/boost_asio/reference/handler_type/type.html index bedc010487..65c7f570b0 100644 --- a/doc/html/boost_asio/reference/handler_type/type.html +++ b/doc/html/boost_asio/reference/handler_type/type.html @@ -46,7 +46,7 @@ The handler type
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/has_service.html b/doc/html/boost_asio/reference/has_service.html index f104db3831..05073fc230 100644 --- a/doc/html/boost_asio/reference/has_service.html +++ b/doc/html/boost_asio/reference/has_service.html @@ -74,7 +74,7 @@ bool has_service(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/high_resolution_timer.html b/doc/html/boost_asio/reference/high_resolution_timer.html index bd6d703cb4..2395dea4dd 100644 --- a/doc/html/boost_asio/reference/high_resolution_timer.html +++ b/doc/html/boost_asio/reference/high_resolution_timer.html @@ -479,7 +479,7 @@ void on_timeout(const boost::system::error_code& e)
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/invalid_service_owner.html b/doc/html/boost_asio/reference/invalid_service_owner.html index 409a2fd9dc..f0d7a95ac0 100644 --- a/doc/html/boost_asio/reference/invalid_service_owner.html +++ b/doc/html/boost_asio/reference/invalid_service_owner.html @@ -77,7 +77,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/invalid_service_owner/invalid_service_owner.html b/doc/html/boost_asio/reference/invalid_service_owner/invalid_service_owner.html index 01351ae060..a11e2fc469 100644 --- a/doc/html/boost_asio/reference/invalid_service_owner/invalid_service_owner.html +++ b/doc/html/boost_asio/reference/invalid_service_owner/invalid_service_owner.html @@ -34,7 +34,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/io_context.html b/doc/html/boost_asio/reference/io_context.html index 68921c7491..1c8ccf7f9f 100644 --- a/doc/html/boost_asio/reference/io_context.html +++ b/doc/html/boost_asio/reference/io_context.html @@ -715,7 +715,7 @@ work.reset(); // Allow run() to exit.
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/io_context/_io_context.html b/doc/html/boost_asio/reference/io_context/_io_context.html index bbf9ec2633..6d238779f1 100644 --- a/doc/html/boost_asio/reference/io_context/_io_context.html +++ b/doc/html/boost_asio/reference/io_context/_io_context.html @@ -82,7 +82,7 @@ Destructor.
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/io_context/add_service.html b/doc/html/boost_asio/reference/io_context/add_service.html index 486a240b87..bbc91fbf01 100644 --- a/doc/html/boost_asio/reference/io_context/add_service.html +++ b/doc/html/boost_asio/reference/io_context/add_service.html @@ -103,7 +103,7 @@ friend void add_service(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/io_context/count_type.html b/doc/html/boost_asio/reference/io_context/count_type.html index f7adc32692..35c9c05a03 100644 --- a/doc/html/boost_asio/reference/io_context/count_type.html +++ b/doc/html/boost_asio/reference/io_context/count_type.html @@ -46,7 +46,7 @@ The type
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/io_context/destroy.html b/doc/html/boost_asio/reference/io_context/destroy.html index 4e20e02344..f127722e42 100644 --- a/doc/html/boost_asio/reference/io_context/destroy.html +++ b/doc/html/boost_asio/reference/io_context/destroy.html @@ -47,7 +47,7 @@ Destroys all services
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/io_context/dispatch.html b/doc/html/boost_asio/reference/io_context/dispatch.html index 563c39f170..5233712c4b 100644 --- a/doc/html/boost_asio/reference/io_context/dispatch.html +++ b/doc/html/boost_asio/reference/io_context/dispatch.html @@ -34,9 +34,9 @@ to invoke the given handler. 

    template<
-    typename CompletionHandler>
+    typename LegacyCompletionHandler>
 DEDUCED dispatch(
-    CompletionHandler && handler);
+    LegacyCompletionHandler && handler);

    This function is used to ask the io_context @@ -91,7 +91,7 @@

    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/io_context/fork_event.html b/doc/html/boost_asio/reference/io_context/fork_event.html index 22188ddcba..9c828a6aa2 100644 --- a/doc/html/boost_asio/reference/io_context/fork_event.html +++ b/doc/html/boost_asio/reference/io_context/fork_event.html @@ -65,7 +65,7 @@ Fork-related
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/io_context/get_executor.html b/doc/html/boost_asio/reference/io_context/get_executor.html index 05943aaf6f..30be6a1d7b 100644 --- a/doc/html/boost_asio/reference/io_context/get_executor.html +++ b/doc/html/boost_asio/reference/io_context/get_executor.html @@ -36,7 +36,7 @@ Obtains
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/io_context/has_service.html b/doc/html/boost_asio/reference/io_context/has_service.html index d7e7853656..1fb48c3cc0 100644 --- a/doc/html/boost_asio/reference/io_context/has_service.html +++ b/doc/html/boost_asio/reference/io_context/has_service.html @@ -80,7 +80,7 @@ friend bool has_service(
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/io_context/io_context.html b/doc/html/boost_asio/reference/io_context/io_context.html index 3110dbdf5b..c2d645dcfc 100644 --- a/doc/html/boost_asio/reference/io_context/io_context.html +++ b/doc/html/boost_asio/reference/io_context/io_context.html @@ -40,7 +40,7 @@ explicit
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/io_context/io_context/overload1.html b/doc/html/boost_asio/reference/io_context/io_context/overload1.html index 411fa61f6c..6d15b9ddc7 100644 --- a/doc/html/boost_asio/reference/io_context/io_context/overload1.html +++ b/doc/html/boost_asio/reference/io_context/io_context/overload1.html @@ -35,7 +35,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/io_context/io_context/overload2.html b/doc/html/boost_asio/reference/io_context/io_context/overload2.html index ba90927d28..fe6fce47fc 100644 --- a/doc/html/boost_asio/reference/io_context/io_context/overload2.html +++ b/doc/html/boost_asio/reference/io_context/io_context/overload2.html @@ -53,7 +53,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/io_context/make_service.html b/doc/html/boost_asio/reference/io_context/make_service.html index 2a37c5ad7b..62e056e7bc 100644 --- a/doc/html/boost_asio/reference/io_context/make_service.html +++ b/doc/html/boost_asio/reference/io_context/make_service.html @@ -89,7 +89,7 @@ friend Service & make_service(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/io_context/notify_fork.html b/doc/html/boost_asio/reference/io_context/notify_fork.html index f3b0cc2cdf..a03f6c4a63 100644 --- a/doc/html/boost_asio/reference/io_context/notify_fork.html +++ b/doc/html/boost_asio/reference/io_context/notify_fork.html @@ -114,7 +114,7 @@ else
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/io_context/poll.html b/doc/html/boost_asio/reference/io_context/poll.html index f98b388c84..dd60554cf0 100644 --- a/doc/html/boost_asio/reference/io_context/poll.html +++ b/doc/html/boost_asio/reference/io_context/poll.html @@ -45,7 +45,7 @@ Run the -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/io_context/poll/overload1.html b/doc/html/boost_asio/reference/io_context/poll/overload1.html index 926efa0fbb..25f45d1090 100644 --- a/doc/html/boost_asio/reference/io_context/poll/overload1.html +++ b/doc/html/boost_asio/reference/io_context/poll/overload1.html @@ -49,7 +49,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/io_context/poll/overload2.html b/doc/html/boost_asio/reference/io_context/poll/overload2.html index b816aad95c..2ec2f1781e 100644 --- a/doc/html/boost_asio/reference/io_context/poll/overload2.html +++ b/doc/html/boost_asio/reference/io_context/poll/overload2.html @@ -63,7 +63,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/io_context/poll_one.html b/doc/html/boost_asio/reference/io_context/poll_one.html index 0582be3b4d..18cb04095c 100644 --- a/doc/html/boost_asio/reference/io_context/poll_one.html +++ b/doc/html/boost_asio/reference/io_context/poll_one.html @@ -45,7 +45,7 @@ Run the -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/io_context/poll_one/overload1.html b/doc/html/boost_asio/reference/io_context/poll_one/overload1.html index c7de9327da..7670b7811d 100644 --- a/doc/html/boost_asio/reference/io_context/poll_one/overload1.html +++ b/doc/html/boost_asio/reference/io_context/poll_one/overload1.html @@ -48,7 +48,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/io_context/poll_one/overload2.html b/doc/html/boost_asio/reference/io_context/poll_one/overload2.html index 14bb87623e..8d646e5250 100644 --- a/doc/html/boost_asio/reference/io_context/poll_one/overload2.html +++ b/doc/html/boost_asio/reference/io_context/poll_one/overload2.html @@ -62,7 +62,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/io_context/post.html b/doc/html/boost_asio/reference/io_context/post.html index 93e4330b8b..0aac3ef344 100644 --- a/doc/html/boost_asio/reference/io_context/post.html +++ b/doc/html/boost_asio/reference/io_context/post.html @@ -33,9 +33,9 @@ to invoke the given handler and return immediately. 

    template<
-    typename CompletionHandler>
+    typename LegacyCompletionHandler>
 DEDUCED post(
-    CompletionHandler && handler);
+    LegacyCompletionHandler && handler);

    This function is used to ask the io_context @@ -90,7 +90,7 @@

    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/io_context/reset.html b/doc/html/boost_asio/reference/io_context/reset.html index 8a67c1e55f..6d7e4979f6 100644 --- a/doc/html/boost_asio/reference/io_context/reset.html +++ b/doc/html/boost_asio/reference/io_context/reset.html @@ -51,7 +51,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/io_context/restart.html b/doc/html/boost_asio/reference/io_context/restart.html index b6a4248f33..87d8a6b6df 100644 --- a/doc/html/boost_asio/reference/io_context/restart.html +++ b/doc/html/boost_asio/reference/io_context/restart.html @@ -50,7 +50,7 @@ Restart the -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/io_context/run.html b/doc/html/boost_asio/reference/io_context/run.html index b658c5b54a..cccc621bf7 100644 --- a/doc/html/boost_asio/reference/io_context/run.html +++ b/doc/html/boost_asio/reference/io_context/run.html @@ -45,7 +45,7 @@ Run the -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/io_context/run/overload1.html b/doc/html/boost_asio/reference/io_context/run/overload1.html index 32792d1812..6048b1098a 100644 --- a/doc/html/boost_asio/reference/io_context/run/overload1.html +++ b/doc/html/boost_asio/reference/io_context/run/overload1.html @@ -80,7 +80,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/io_context/run/overload2.html b/doc/html/boost_asio/reference/io_context/run/overload2.html index ebf0a0f003..910ee4601d 100644 --- a/doc/html/boost_asio/reference/io_context/run/overload2.html +++ b/doc/html/boost_asio/reference/io_context/run/overload2.html @@ -94,7 +94,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/io_context/run_for.html b/doc/html/boost_asio/reference/io_context/run_for.html index a86bf1e5bd..b1b401d2e2 100644 --- a/doc/html/boost_asio/reference/io_context/run_for.html +++ b/doc/html/boost_asio/reference/io_context/run_for.html @@ -65,7 +65,7 @@ std::size_t run_for(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/io_context/run_one.html b/doc/html/boost_asio/reference/io_context/run_one.html index 34850dc06b..48946cdec5 100644 --- a/doc/html/boost_asio/reference/io_context/run_one.html +++ b/doc/html/boost_asio/reference/io_context/run_one.html @@ -45,7 +45,7 @@ Run the -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/io_context/run_one/overload1.html b/doc/html/boost_asio/reference/io_context/run_one/overload1.html index a353d2dc12..68d393d5e0 100644 --- a/doc/html/boost_asio/reference/io_context/run_one/overload1.html +++ b/doc/html/boost_asio/reference/io_context/run_one/overload1.html @@ -66,7 +66,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/io_context/run_one/overload2.html b/doc/html/boost_asio/reference/io_context/run_one/overload2.html index 61e569cd26..eef2f97064 100644 --- a/doc/html/boost_asio/reference/io_context/run_one/overload2.html +++ b/doc/html/boost_asio/reference/io_context/run_one/overload2.html @@ -70,7 +70,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/io_context/run_one_for.html b/doc/html/boost_asio/reference/io_context/run_one_for.html index 760fd4a814..e02aac8f78 100644 --- a/doc/html/boost_asio/reference/io_context/run_one_for.html +++ b/doc/html/boost_asio/reference/io_context/run_one_for.html @@ -68,7 +68,7 @@ std::size_t run_one_for(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/io_context/run_one_until.html b/doc/html/boost_asio/reference/io_context/run_one_until.html index 9e742bbc86..5f8ac09ed5 100644 --- a/doc/html/boost_asio/reference/io_context/run_one_until.html +++ b/doc/html/boost_asio/reference/io_context/run_one_until.html @@ -68,7 +68,7 @@ std::size_t run_one_until(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/io_context/run_until.html b/doc/html/boost_asio/reference/io_context/run_until.html index cd3fb6e7cd..bad4d8bce5 100644 --- a/doc/html/boost_asio/reference/io_context/run_until.html +++ b/doc/html/boost_asio/reference/io_context/run_until.html @@ -66,7 +66,7 @@ std::size_t run_until(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/io_context/shutdown.html b/doc/html/boost_asio/reference/io_context/shutdown.html index 1d540268a7..f37e984f9c 100644 --- a/doc/html/boost_asio/reference/io_context/shutdown.html +++ b/doc/html/boost_asio/reference/io_context/shutdown.html @@ -47,7 +47,7 @@ Shuts down all
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/io_context/stop.html b/doc/html/boost_asio/reference/io_context/stop.html index 9424391375..2975cc0100 100644 --- a/doc/html/boost_asio/reference/io_context/stop.html +++ b/doc/html/boost_asio/reference/io_context/stop.html @@ -43,7 +43,7 @@ Stop the -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/io_context/stopped.html b/doc/html/boost_asio/reference/io_context/stopped.html index b6d69f3fd0..a15236bef2 100644 --- a/doc/html/boost_asio/reference/io_context/stopped.html +++ b/doc/html/boost_asio/reference/io_context/stopped.html @@ -53,7 +53,7 @@ Determine whether
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/io_context/use_service.html b/doc/html/boost_asio/reference/io_context/use_service.html index c3ee54c307..4c92d470e4 100644 --- a/doc/html/boost_asio/reference/io_context/use_service.html +++ b/doc/html/boost_asio/reference/io_context/use_service.html @@ -47,7 +47,7 @@ friend Service &
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/io_context/use_service/overload1.html b/doc/html/boost_asio/reference/io_context/use_service/overload1.html index acca5bc6d2..475b5367e3 100644 --- a/doc/html/boost_asio/reference/io_context/use_service/overload1.html +++ b/doc/html/boost_asio/reference/io_context/use_service/overload1.html @@ -82,7 +82,7 @@ friend Service & use_service(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/io_context/use_service/overload2.html b/doc/html/boost_asio/reference/io_context/use_service/overload2.html index 193a1eb251..927f682581 100644 --- a/doc/html/boost_asio/reference/io_context/use_service/overload2.html +++ b/doc/html/boost_asio/reference/io_context/use_service/overload2.html @@ -80,7 +80,7 @@ friend Service & use_service(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/io_context/wrap.html b/doc/html/boost_asio/reference/io_context/wrap.html index c9e3128be1..1bda974c8b 100644 --- a/doc/html/boost_asio/reference/io_context/wrap.html +++ b/doc/html/boost_asio/reference/io_context/wrap.html @@ -93,7 +93,7 @@ unspecified wrap(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/io_context__executor_type.html b/doc/html/boost_asio/reference/io_context__executor_type.html index 484d5b240a..16b96d71d9 100644 --- a/doc/html/boost_asio/reference/io_context__executor_type.html +++ b/doc/html/boost_asio/reference/io_context__executor_type.html @@ -201,7 +201,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/io_context__executor_type/context.html b/doc/html/boost_asio/reference/io_context__executor_type/context.html index 3d1bac0281..03283b7365 100644 --- a/doc/html/boost_asio/reference/io_context__executor_type/context.html +++ b/doc/html/boost_asio/reference/io_context__executor_type/context.html @@ -36,7 +36,7 @@ Obtain
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/io_context__executor_type/defer.html b/doc/html/boost_asio/reference/io_context__executor_type/defer.html index 80bad80c57..5060528452 100644 --- a/doc/html/boost_asio/reference/io_context__executor_type/defer.html +++ b/doc/html/boost_asio/reference/io_context__executor_type/defer.html @@ -79,7 +79,7 @@ void defer(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/io_context__executor_type/dispatch.html b/doc/html/boost_asio/reference/io_context__executor_type/dispatch.html index f4a95f1bfd..61d1a74a5a 100644 --- a/doc/html/boost_asio/reference/io_context__executor_type/dispatch.html +++ b/doc/html/boost_asio/reference/io_context__executor_type/dispatch.html @@ -75,7 +75,7 @@ void dispatch(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/io_context__executor_type/on_work_finished.html b/doc/html/boost_asio/reference/io_context__executor_type/on_work_finished.html index 93b8929363..42f9d49869 100644 --- a/doc/html/boost_asio/reference/io_context__executor_type/on_work_finished.html +++ b/doc/html/boost_asio/reference/io_context__executor_type/on_work_finished.html @@ -44,7 +44,7 @@ Inform
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/io_context__executor_type/on_work_started.html b/doc/html/boost_asio/reference/io_context__executor_type/on_work_started.html index db7211f55e..cf2c985e2b 100644 --- a/doc/html/boost_asio/reference/io_context__executor_type/on_work_started.html +++ b/doc/html/boost_asio/reference/io_context__executor_type/on_work_started.html @@ -42,7 +42,7 @@ Inform
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/io_context__executor_type/operator_eq__eq_.html b/doc/html/boost_asio/reference/io_context__executor_type/operator_eq__eq_.html index 21faac8d8a..9f87aec3e9 100644 --- a/doc/html/boost_asio/reference/io_context__executor_type/operator_eq__eq_.html +++ b/doc/html/boost_asio/reference/io_context__executor_type/operator_eq__eq_.html @@ -51,7 +51,7 @@ Compare
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/io_context__executor_type/operator_not__eq_.html b/doc/html/boost_asio/reference/io_context__executor_type/operator_not__eq_.html index 889c653cf3..352e03864e 100644 --- a/doc/html/boost_asio/reference/io_context__executor_type/operator_not__eq_.html +++ b/doc/html/boost_asio/reference/io_context__executor_type/operator_not__eq_.html @@ -51,7 +51,7 @@ Compare
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/io_context__executor_type/post.html b/doc/html/boost_asio/reference/io_context__executor_type/post.html index 94e14f4328..fe0e4591f8 100644 --- a/doc/html/boost_asio/reference/io_context__executor_type/post.html +++ b/doc/html/boost_asio/reference/io_context__executor_type/post.html @@ -74,7 +74,7 @@ void post(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/io_context__executor_type/running_in_this_thread.html b/doc/html/boost_asio/reference/io_context__executor_type/running_in_this_thread.html index 6ebc330509..e6dd14f079 100644 --- a/doc/html/boost_asio/reference/io_context__executor_type/running_in_this_thread.html +++ b/doc/html/boost_asio/reference/io_context__executor_type/running_in_this_thread.html @@ -46,7 +46,7 @@ Determine
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/io_context__service.html b/doc/html/boost_asio/reference/io_context__service.html index c4d079293d..e8f707cff8 100644 --- a/doc/html/boost_asio/reference/io_context__service.html +++ b/doc/html/boost_asio/reference/io_context__service.html @@ -143,7 +143,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/io_context__service/_service.html b/doc/html/boost_asio/reference/io_context__service/_service.html index dc8b988787..b57d6717e9 100644 --- a/doc/html/boost_asio/reference/io_context__service/_service.html +++ b/doc/html/boost_asio/reference/io_context__service/_service.html @@ -35,7 +35,7 @@ Destructor.
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/io_context__service/get_io_context.html b/doc/html/boost_asio/reference/io_context__service/get_io_context.html index 2a4af26949..9599f026dd 100644 --- a/doc/html/boost_asio/reference/io_context__service/get_io_context.html +++ b/doc/html/boost_asio/reference/io_context__service/get_io_context.html @@ -37,7 +37,7 @@ Get
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/io_context__service/get_io_service.html b/doc/html/boost_asio/reference/io_context__service/get_io_service.html index f3d0563aec..877840e430 100644 --- a/doc/html/boost_asio/reference/io_context__service/get_io_service.html +++ b/doc/html/boost_asio/reference/io_context__service/get_io_service.html @@ -37,7 +37,7 @@ Get
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/io_context__service/service.html b/doc/html/boost_asio/reference/io_context__service/service.html index 75f69c387b..96ff792bae 100644 --- a/doc/html/boost_asio/reference/io_context__service/service.html +++ b/doc/html/boost_asio/reference/io_context__service/service.html @@ -50,7 +50,7 @@ Constructor.
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/io_context__strand.html b/doc/html/boost_asio/reference/io_context__strand.html index d65157c2fe..66aa62b0ac 100644 --- a/doc/html/boost_asio/reference/io_context__strand.html +++ b/doc/html/boost_asio/reference/io_context__strand.html @@ -359,7 +359,7 @@ async_op_2(..., s.wrap(b));
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/io_context__strand/_strand.html b/doc/html/boost_asio/reference/io_context__strand/_strand.html index d4d65b45d0..c690230a60 100644 --- a/doc/html/boost_asio/reference/io_context__strand/_strand.html +++ b/doc/html/boost_asio/reference/io_context__strand/_strand.html @@ -42,7 +42,7 @@ Destructor.
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/io_context__strand/context.html b/doc/html/boost_asio/reference/io_context__strand/context.html index c8fff1daf3..a52ee668c5 100644 --- a/doc/html/boost_asio/reference/io_context__strand/context.html +++ b/doc/html/boost_asio/reference/io_context__strand/context.html @@ -36,7 +36,7 @@ Obtain
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/io_context__strand/defer.html b/doc/html/boost_asio/reference/io_context__strand/defer.html index 31b63c5ea4..88c4c63b31 100644 --- a/doc/html/boost_asio/reference/io_context__strand/defer.html +++ b/doc/html/boost_asio/reference/io_context__strand/defer.html @@ -72,7 +72,7 @@ void defer(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/io_context__strand/dispatch.html b/doc/html/boost_asio/reference/io_context__strand/dispatch.html index 9de259855a..d8b50e5508 100644 --- a/doc/html/boost_asio/reference/io_context__strand/dispatch.html +++ b/doc/html/boost_asio/reference/io_context__strand/dispatch.html @@ -44,15 +44,15 @@ void template< - typename CompletionHandler> + typename LegacyCompletionHandler> DEDUCED dispatch( - CompletionHandler && handler); + LegacyCompletionHandler && handler); » more...
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/io_context__strand/dispatch/overload1.html b/doc/html/boost_asio/reference/io_context__strand/dispatch/overload1.html index 77258ceec3..399f4a08ae 100644 --- a/doc/html/boost_asio/reference/io_context__strand/dispatch/overload1.html +++ b/doc/html/boost_asio/reference/io_context__strand/dispatch/overload1.html @@ -74,7 +74,7 @@ void dispatch(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/io_context__strand/dispatch/overload2.html b/doc/html/boost_asio/reference/io_context__strand/dispatch/overload2.html index 4401254c82..3a0704e73f 100644 --- a/doc/html/boost_asio/reference/io_context__strand/dispatch/overload2.html +++ b/doc/html/boost_asio/reference/io_context__strand/dispatch/overload2.html @@ -32,9 +32,9 @@ Request the strand to invoke the given handler. 

    template<
-    typename CompletionHandler>
+    typename LegacyCompletionHandler>
 DEDUCED dispatch(
-    CompletionHandler && handler);
+    LegacyCompletionHandler && handler);

    This function is used to ask the strand to execute the given handler. @@ -77,7 +77,7 @@

    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/io_context__strand/get_io_context.html b/doc/html/boost_asio/reference/io_context__strand/get_io_context.html index 354ede1535..8adab3cdae 100644 --- a/doc/html/boost_asio/reference/io_context__strand/get_io_context.html +++ b/doc/html/boost_asio/reference/io_context__strand/get_io_context.html @@ -51,7 +51,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/io_context__strand/get_io_service.html b/doc/html/boost_asio/reference/io_context__strand/get_io_service.html index 67978a455c..08cf82a7ec 100644 --- a/doc/html/boost_asio/reference/io_context__strand/get_io_service.html +++ b/doc/html/boost_asio/reference/io_context__strand/get_io_service.html @@ -51,7 +51,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/io_context__strand/on_work_finished.html b/doc/html/boost_asio/reference/io_context__strand/on_work_finished.html index f96182766f..316b58682f 100644 --- a/doc/html/boost_asio/reference/io_context__strand/on_work_finished.html +++ b/doc/html/boost_asio/reference/io_context__strand/on_work_finished.html @@ -39,7 +39,7 @@ Inform
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/io_context__strand/on_work_started.html b/doc/html/boost_asio/reference/io_context__strand/on_work_started.html index a3227c46d5..92c42dd821 100644 --- a/doc/html/boost_asio/reference/io_context__strand/on_work_started.html +++ b/doc/html/boost_asio/reference/io_context__strand/on_work_started.html @@ -39,7 +39,7 @@ Inform
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/io_context__strand/operator_eq__eq_.html b/doc/html/boost_asio/reference/io_context__strand/operator_eq__eq_.html index ae7cfb7cac..8354c26720 100644 --- a/doc/html/boost_asio/reference/io_context__strand/operator_eq__eq_.html +++ b/doc/html/boost_asio/reference/io_context__strand/operator_eq__eq_.html @@ -52,7 +52,7 @@ Compare
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/io_context__strand/operator_not__eq_.html b/doc/html/boost_asio/reference/io_context__strand/operator_not__eq_.html index 9cdce7381a..322e348f08 100644 --- a/doc/html/boost_asio/reference/io_context__strand/operator_not__eq_.html +++ b/doc/html/boost_asio/reference/io_context__strand/operator_not__eq_.html @@ -52,7 +52,7 @@ Compare
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/io_context__strand/post.html b/doc/html/boost_asio/reference/io_context__strand/post.html index 00e69c5e3f..f094b27d19 100644 --- a/doc/html/boost_asio/reference/io_context__strand/post.html +++ b/doc/html/boost_asio/reference/io_context__strand/post.html @@ -44,15 +44,15 @@ void template< - typename CompletionHandler> + typename LegacyCompletionHandler> DEDUCED post( - CompletionHandler && handler); + LegacyCompletionHandler && handler); » more...
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/io_context__strand/post/overload1.html b/doc/html/boost_asio/reference/io_context__strand/post/overload1.html index 27ab336023..a8c3c78fb3 100644 --- a/doc/html/boost_asio/reference/io_context__strand/post/overload1.html +++ b/doc/html/boost_asio/reference/io_context__strand/post/overload1.html @@ -71,7 +71,7 @@ void post(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/io_context__strand/post/overload2.html b/doc/html/boost_asio/reference/io_context__strand/post/overload2.html index 5007421e01..4262e1e8e9 100644 --- a/doc/html/boost_asio/reference/io_context__strand/post/overload2.html +++ b/doc/html/boost_asio/reference/io_context__strand/post/overload2.html @@ -32,9 +32,9 @@ Request the strand to invoke the given handler and return immediately. 

    template<
-    typename CompletionHandler>
+    typename LegacyCompletionHandler>
 DEDUCED post(
-    CompletionHandler && handler);
+    LegacyCompletionHandler && handler);

    This function is used to ask the strand to execute the given handler, @@ -73,7 +73,7 @@

    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/io_context__strand/running_in_this_thread.html b/doc/html/boost_asio/reference/io_context__strand/running_in_this_thread.html index c30601ddb1..52df6c7004 100644 --- a/doc/html/boost_asio/reference/io_context__strand/running_in_this_thread.html +++ b/doc/html/boost_asio/reference/io_context__strand/running_in_this_thread.html @@ -46,7 +46,7 @@ Determine
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/io_context__strand/strand.html b/doc/html/boost_asio/reference/io_context__strand/strand.html index 3e874dc78f..2284d60752 100644 --- a/doc/html/boost_asio/reference/io_context__strand/strand.html +++ b/doc/html/boost_asio/reference/io_context__strand/strand.html @@ -54,7 +54,7 @@ Constructor.
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/io_context__strand/wrap.html b/doc/html/boost_asio/reference/io_context__strand/wrap.html index 6aa9e3a7df..14ee7673d4 100644 --- a/doc/html/boost_asio/reference/io_context__strand/wrap.html +++ b/doc/html/boost_asio/reference/io_context__strand/wrap.html @@ -92,7 +92,7 @@ unspecified wrap(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/io_context__work.html b/doc/html/boost_asio/reference/io_context__work.html index 3930650a70..0702c1029c 100644 --- a/doc/html/boost_asio/reference/io_context__work.html +++ b/doc/html/boost_asio/reference/io_context__work.html @@ -132,7 +132,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/io_context__work/_work.html b/doc/html/boost_asio/reference/io_context__work/_work.html index 4640a97a9f..26b7f9545c 100644 --- a/doc/html/boost_asio/reference/io_context__work/_work.html +++ b/doc/html/boost_asio/reference/io_context__work/_work.html @@ -43,7 +43,7 @@ Destructor
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/io_context__work/get_io_context.html b/doc/html/boost_asio/reference/io_context__work/get_io_context.html index a514fccd65..2e7008880c 100644 --- a/doc/html/boost_asio/reference/io_context__work/get_io_context.html +++ b/doc/html/boost_asio/reference/io_context__work/get_io_context.html @@ -37,7 +37,7 @@ Get
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/io_context__work/get_io_service.html b/doc/html/boost_asio/reference/io_context__work/get_io_service.html index bc0170f5a2..30fa04890d 100644 --- a/doc/html/boost_asio/reference/io_context__work/get_io_service.html +++ b/doc/html/boost_asio/reference/io_context__work/get_io_service.html @@ -37,7 +37,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/io_context__work/work.html b/doc/html/boost_asio/reference/io_context__work/work.html index 0bfb27242c..dd311b1dba 100644 --- a/doc/html/boost_asio/reference/io_context__work/work.html +++ b/doc/html/boost_asio/reference/io_context__work/work.html @@ -47,7 +47,7 @@ Constructor
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/io_context__work/work/overload1.html b/doc/html/boost_asio/reference/io_context__work/work/overload1.html index a357ff7296..0892e54b8f 100644 --- a/doc/html/boost_asio/reference/io_context__work/work/overload1.html +++ b/doc/html/boost_asio/reference/io_context__work/work/overload1.html @@ -43,7 +43,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/io_context__work/work/overload2.html b/doc/html/boost_asio/reference/io_context__work/work/overload2.html index 1437c99926..0dfc1f70a2 100644 --- a/doc/html/boost_asio/reference/io_context__work/work/overload2.html +++ b/doc/html/boost_asio/reference/io_context__work/work/overload2.html @@ -43,7 +43,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/io_service.html b/doc/html/boost_asio/reference/io_service.html index 49a14b9c8c..170539a75d 100644 --- a/doc/html/boost_asio/reference/io_service.html +++ b/doc/html/boost_asio/reference/io_service.html @@ -715,7 +715,7 @@ work.reset(); // Allow run() to exit.
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__address.html b/doc/html/boost_asio/reference/ip__address.html index 3695262990..fc6f187df8 100644 --- a/doc/html/boost_asio/reference/ip__address.html +++ b/doc/html/boost_asio/reference/ip__address.html @@ -382,7 +382,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__address/address.html b/doc/html/boost_asio/reference/ip__address/address.html index add7645296..1ab347d6db 100644 --- a/doc/html/boost_asio/reference/ip__address/address.html +++ b/doc/html/boost_asio/reference/ip__address/address.html @@ -57,7 +57,7 @@ Default constructor.
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__address/address/overload1.html b/doc/html/boost_asio/reference/ip__address/address/overload1.html index ba92d36aa0..fd2bd65932 100644 --- a/doc/html/boost_asio/reference/ip__address/address/overload1.html +++ b/doc/html/boost_asio/reference/ip__address/address/overload1.html @@ -35,7 +35,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__address/address/overload2.html b/doc/html/boost_asio/reference/ip__address/address/overload2.html index 631928ba7c..ca53967186 100644 --- a/doc/html/boost_asio/reference/ip__address/address/overload2.html +++ b/doc/html/boost_asio/reference/ip__address/address/overload2.html @@ -36,7 +36,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__address/address/overload3.html b/doc/html/boost_asio/reference/ip__address/address/overload3.html index 2e6f47f217..a319998b3f 100644 --- a/doc/html/boost_asio/reference/ip__address/address/overload3.html +++ b/doc/html/boost_asio/reference/ip__address/address/overload3.html @@ -36,7 +36,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__address/address/overload4.html b/doc/html/boost_asio/reference/ip__address/address/overload4.html index 2d1e9a96ef..678a576430 100644 --- a/doc/html/boost_asio/reference/ip__address/address/overload4.html +++ b/doc/html/boost_asio/reference/ip__address/address/overload4.html @@ -36,7 +36,7 @@
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__address/from_string.html b/doc/html/boost_asio/reference/ip__address/from_string.html index aedf0943f2..7b3b4c91e6 100644 --- a/doc/html/boost_asio/reference/ip__address/from_string.html +++ b/doc/html/boost_asio/reference/ip__address/from_string.html @@ -53,7 +53,7 @@ static address
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__address/from_string/overload1.html b/doc/html/boost_asio/reference/ip__address/from_string/overload1.html index 030f470eea..3572ec895c 100644 --- a/doc/html/boost_asio/reference/ip__address/from_string/overload1.html +++ b/doc/html/boost_asio/reference/ip__address/from_string/overload1.html @@ -38,7 +38,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__address/from_string/overload2.html b/doc/html/boost_asio/reference/ip__address/from_string/overload2.html index a4a191a3d8..5e72c5172b 100644 --- a/doc/html/boost_asio/reference/ip__address/from_string/overload2.html +++ b/doc/html/boost_asio/reference/ip__address/from_string/overload2.html @@ -39,7 +39,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__address/from_string/overload3.html b/doc/html/boost_asio/reference/ip__address/from_string/overload3.html index dd4024db10..2b1b010af1 100644 --- a/doc/html/boost_asio/reference/ip__address/from_string/overload3.html +++ b/doc/html/boost_asio/reference/ip__address/from_string/overload3.html @@ -38,7 +38,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__address/from_string/overload4.html b/doc/html/boost_asio/reference/ip__address/from_string/overload4.html index 87c04c9a3f..a65f28572e 100644 --- a/doc/html/boost_asio/reference/ip__address/from_string/overload4.html +++ b/doc/html/boost_asio/reference/ip__address/from_string/overload4.html @@ -39,7 +39,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__address/is_loopback.html b/doc/html/boost_asio/reference/ip__address/is_loopback.html index 831551b655..8eddb6b470 100644 --- a/doc/html/boost_asio/reference/ip__address/is_loopback.html +++ b/doc/html/boost_asio/reference/ip__address/is_loopback.html @@ -36,7 +36,7 @@ Determine
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__address/is_multicast.html b/doc/html/boost_asio/reference/ip__address/is_multicast.html index 43babe9a81..fe0fcf8b73 100644 --- a/doc/html/boost_asio/reference/ip__address/is_multicast.html +++ b/doc/html/boost_asio/reference/ip__address/is_multicast.html @@ -36,7 +36,7 @@ Determine
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__address/is_unspecified.html b/doc/html/boost_asio/reference/ip__address/is_unspecified.html index 82ec33e966..3d85be61c2 100644 --- a/doc/html/boost_asio/reference/ip__address/is_unspecified.html +++ b/doc/html/boost_asio/reference/ip__address/is_unspecified.html @@ -36,7 +36,7 @@ Determine
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__address/is_v4.html b/doc/html/boost_asio/reference/ip__address/is_v4.html index 209302e4aa..d0823d0460 100644 --- a/doc/html/boost_asio/reference/ip__address/is_v4.html +++ b/doc/html/boost_asio/reference/ip__address/is_v4.html @@ -36,7 +36,7 @@ Get whether the address
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__address/is_v6.html b/doc/html/boost_asio/reference/ip__address/is_v6.html index 403e176d41..8b0af0d286 100644 --- a/doc/html/boost_asio/reference/ip__address/is_v6.html +++ b/doc/html/boost_asio/reference/ip__address/is_v6.html @@ -36,7 +36,7 @@ Get whether the address
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__address/make_address.html b/doc/html/boost_asio/reference/ip__address/make_address.html index ddef0b96b9..7b23c35977 100644 --- a/doc/html/boost_asio/reference/ip__address/make_address.html +++ b/doc/html/boost_asio/reference/ip__address/make_address.html @@ -62,7 +62,7 @@ address
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__address/make_address/overload1.html b/doc/html/boost_asio/reference/ip__address/make_address/overload1.html index 635042b3ba..1e17a72840 100644 --- a/doc/html/boost_asio/reference/ip__address/make_address/overload1.html +++ b/doc/html/boost_asio/reference/ip__address/make_address/overload1.html @@ -37,7 +37,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__address/make_address/overload2.html b/doc/html/boost_asio/reference/ip__address/make_address/overload2.html index b1ed00d3c5..ddb9592389 100644 --- a/doc/html/boost_asio/reference/ip__address/make_address/overload2.html +++ b/doc/html/boost_asio/reference/ip__address/make_address/overload2.html @@ -38,7 +38,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__address/make_address/overload3.html b/doc/html/boost_asio/reference/ip__address/make_address/overload3.html index 8f648aba5f..d510054d9f 100644 --- a/doc/html/boost_asio/reference/ip__address/make_address/overload3.html +++ b/doc/html/boost_asio/reference/ip__address/make_address/overload3.html @@ -37,7 +37,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__address/make_address/overload4.html b/doc/html/boost_asio/reference/ip__address/make_address/overload4.html index b2b274ac10..6790dde144 100644 --- a/doc/html/boost_asio/reference/ip__address/make_address/overload4.html +++ b/doc/html/boost_asio/reference/ip__address/make_address/overload4.html @@ -38,7 +38,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__address/make_address/overload5.html b/doc/html/boost_asio/reference/ip__address/make_address/overload5.html index a0c05ccc04..f7255450b7 100644 --- a/doc/html/boost_asio/reference/ip__address/make_address/overload5.html +++ b/doc/html/boost_asio/reference/ip__address/make_address/overload5.html @@ -37,7 +37,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__address/make_address/overload6.html b/doc/html/boost_asio/reference/ip__address/make_address/overload6.html index 78fd7282eb..d2567f426a 100644 --- a/doc/html/boost_asio/reference/ip__address/make_address/overload6.html +++ b/doc/html/boost_asio/reference/ip__address/make_address/overload6.html @@ -38,7 +38,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__address/operator_eq_.html b/doc/html/boost_asio/reference/ip__address/operator_eq_.html index b8de1c5eb2..2ba66f210d 100644 --- a/doc/html/boost_asio/reference/ip__address/operator_eq_.html +++ b/doc/html/boost_asio/reference/ip__address/operator_eq_.html @@ -52,7 +52,7 @@ Assign
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__address/operator_eq_/overload1.html b/doc/html/boost_asio/reference/ip__address/operator_eq_/overload1.html index a81cc945e5..d1dea1e978 100644 --- a/doc/html/boost_asio/reference/ip__address/operator_eq_/overload1.html +++ b/doc/html/boost_asio/reference/ip__address/operator_eq_/overload1.html @@ -36,7 +36,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__address/operator_eq_/overload2.html b/doc/html/boost_asio/reference/ip__address/operator_eq_/overload2.html index 6e6d42d939..0fe8569048 100644 --- a/doc/html/boost_asio/reference/ip__address/operator_eq_/overload2.html +++ b/doc/html/boost_asio/reference/ip__address/operator_eq_/overload2.html @@ -36,7 +36,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__address/operator_eq_/overload3.html b/doc/html/boost_asio/reference/ip__address/operator_eq_/overload3.html index 050a5ac49b..bc07a0756e 100644 --- a/doc/html/boost_asio/reference/ip__address/operator_eq_/overload3.html +++ b/doc/html/boost_asio/reference/ip__address/operator_eq_/overload3.html @@ -36,7 +36,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__address/operator_eq__eq_.html b/doc/html/boost_asio/reference/ip__address/operator_eq__eq_.html index 59ec773cb3..6c18c16d20 100644 --- a/doc/html/boost_asio/reference/ip__address/operator_eq__eq_.html +++ b/doc/html/boost_asio/reference/ip__address/operator_eq__eq_.html @@ -48,7 +48,7 @@ Compare
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__address/operator_gt_.html b/doc/html/boost_asio/reference/ip__address/operator_gt_.html index d36d952b50..81218865f1 100644 --- a/doc/html/boost_asio/reference/ip__address/operator_gt_.html +++ b/doc/html/boost_asio/reference/ip__address/operator_gt_.html @@ -48,7 +48,7 @@ Compare
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__address/operator_gt__eq_.html b/doc/html/boost_asio/reference/ip__address/operator_gt__eq_.html index 5e778bed98..48eb2c725b 100644 --- a/doc/html/boost_asio/reference/ip__address/operator_gt__eq_.html +++ b/doc/html/boost_asio/reference/ip__address/operator_gt__eq_.html @@ -48,7 +48,7 @@ Compare
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__address/operator_lt_.html b/doc/html/boost_asio/reference/ip__address/operator_lt_.html index a932682804..67a5090b31 100644 --- a/doc/html/boost_asio/reference/ip__address/operator_lt_.html +++ b/doc/html/boost_asio/reference/ip__address/operator_lt_.html @@ -48,7 +48,7 @@ Compare
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__address/operator_lt__eq_.html b/doc/html/boost_asio/reference/ip__address/operator_lt__eq_.html index a04e9228b5..c4c58b087d 100644 --- a/doc/html/boost_asio/reference/ip__address/operator_lt__eq_.html +++ b/doc/html/boost_asio/reference/ip__address/operator_lt__eq_.html @@ -48,7 +48,7 @@ Compare
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__address/operator_lt__lt_.html b/doc/html/boost_asio/reference/ip__address/operator_lt__lt_.html index 074c234e85..6cf4ba370f 100644 --- a/doc/html/boost_asio/reference/ip__address/operator_lt__lt_.html +++ b/doc/html/boost_asio/reference/ip__address/operator_lt__lt_.html @@ -69,7 +69,7 @@ std::basic_ostream< Elem, Traits > & operator<<(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__address/operator_not__eq_.html b/doc/html/boost_asio/reference/ip__address/operator_not__eq_.html index 5ccea64e8b..e38f7f864b 100644 --- a/doc/html/boost_asio/reference/ip__address/operator_not__eq_.html +++ b/doc/html/boost_asio/reference/ip__address/operator_not__eq_.html @@ -48,7 +48,7 @@ Compare
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__address/to_string.html b/doc/html/boost_asio/reference/ip__address/to_string.html index 0fabcc963d..60aef41eed 100644 --- a/doc/html/boost_asio/reference/ip__address/to_string.html +++ b/doc/html/boost_asio/reference/ip__address/to_string.html @@ -44,7 +44,7 @@ Get the address
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__address/to_string/overload1.html b/doc/html/boost_asio/reference/ip__address/to_string/overload1.html index 31f770f5a8..aac4424a4c 100644 --- a/doc/html/boost_asio/reference/ip__address/to_string/overload1.html +++ b/doc/html/boost_asio/reference/ip__address/to_string/overload1.html @@ -35,7 +35,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__address/to_string/overload2.html b/doc/html/boost_asio/reference/ip__address/to_string/overload2.html index e183ca78b2..8be7699617 100644 --- a/doc/html/boost_asio/reference/ip__address/to_string/overload2.html +++ b/doc/html/boost_asio/reference/ip__address/to_string/overload2.html @@ -36,7 +36,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__address/to_v4.html b/doc/html/boost_asio/reference/ip__address/to_v4.html index 3ca7c09b4f..20add95e9b 100644 --- a/doc/html/boost_asio/reference/ip__address/to_v4.html +++ b/doc/html/boost_asio/reference/ip__address/to_v4.html @@ -36,7 +36,7 @@ Get the address as
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__address/to_v6.html b/doc/html/boost_asio/reference/ip__address/to_v6.html index 69404a7666..912ee7cee8 100644 --- a/doc/html/boost_asio/reference/ip__address/to_v6.html +++ b/doc/html/boost_asio/reference/ip__address/to_v6.html @@ -36,7 +36,7 @@ Get the address as
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__address_v4.html b/doc/html/boost_asio/reference/ip__address_v4.html index 1b5592463e..88738d481a 100644 --- a/doc/html/boost_asio/reference/ip__address_v4.html +++ b/doc/html/boost_asio/reference/ip__address_v4.html @@ -530,7 +530,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__address_v4/address_v4.html b/doc/html/boost_asio/reference/ip__address_v4/address_v4.html index 4b87431b3f..4b6678a603 100644 --- a/doc/html/boost_asio/reference/ip__address_v4/address_v4.html +++ b/doc/html/boost_asio/reference/ip__address_v4/address_v4.html @@ -58,7 +58,7 @@ Default
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__address_v4/address_v4/overload1.html b/doc/html/boost_asio/reference/ip__address_v4/address_v4/overload1.html index a49b2a6159..f483b2cb48 100644 --- a/doc/html/boost_asio/reference/ip__address_v4/address_v4/overload1.html +++ b/doc/html/boost_asio/reference/ip__address_v4/address_v4/overload1.html @@ -35,7 +35,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__address_v4/address_v4/overload2.html b/doc/html/boost_asio/reference/ip__address_v4/address_v4/overload2.html index 92b17fd531..d9bdf07025 100644 --- a/doc/html/boost_asio/reference/ip__address_v4/address_v4/overload2.html +++ b/doc/html/boost_asio/reference/ip__address_v4/address_v4/overload2.html @@ -36,7 +36,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__address_v4/address_v4/overload3.html b/doc/html/boost_asio/reference/ip__address_v4/address_v4/overload3.html index f3f6b4933f..41b53e820c 100644 --- a/doc/html/boost_asio/reference/ip__address_v4/address_v4/overload3.html +++ b/doc/html/boost_asio/reference/ip__address_v4/address_v4/overload3.html @@ -36,7 +36,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__address_v4/address_v4/overload4.html b/doc/html/boost_asio/reference/ip__address_v4/address_v4/overload4.html index 58e61e360b..8db5a26723 100644 --- a/doc/html/boost_asio/reference/ip__address_v4/address_v4/overload4.html +++ b/doc/html/boost_asio/reference/ip__address_v4/address_v4/overload4.html @@ -36,7 +36,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__address_v4/any.html b/doc/html/boost_asio/reference/ip__address_v4/any.html index d1e7197e37..f71f31b8fc 100644 --- a/doc/html/boost_asio/reference/ip__address_v4/any.html +++ b/doc/html/boost_asio/reference/ip__address_v4/any.html @@ -36,7 +36,7 @@ Obtain an address
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__address_v4/broadcast.html b/doc/html/boost_asio/reference/ip__address_v4/broadcast.html index d1e1622a74..0069787aaa 100644 --- a/doc/html/boost_asio/reference/ip__address_v4/broadcast.html +++ b/doc/html/boost_asio/reference/ip__address_v4/broadcast.html @@ -47,7 +47,7 @@ Obtain
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__address_v4/broadcast/overload1.html b/doc/html/boost_asio/reference/ip__address_v4/broadcast/overload1.html index ae8b11b98e..54b3a6e378 100644 --- a/doc/html/boost_asio/reference/ip__address_v4/broadcast/overload1.html +++ b/doc/html/boost_asio/reference/ip__address_v4/broadcast/overload1.html @@ -35,7 +35,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__address_v4/broadcast/overload2.html b/doc/html/boost_asio/reference/ip__address_v4/broadcast/overload2.html index c162c140cb..f41a149c95 100644 --- a/doc/html/boost_asio/reference/ip__address_v4/broadcast/overload2.html +++ b/doc/html/boost_asio/reference/ip__address_v4/broadcast/overload2.html @@ -39,7 +39,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__address_v4/bytes_type.html b/doc/html/boost_asio/reference/ip__address_v4/bytes_type.html index cebb28e2bf..7e98826202 100644 --- a/doc/html/boost_asio/reference/ip__address_v4/bytes_type.html +++ b/doc/html/boost_asio/reference/ip__address_v4/bytes_type.html @@ -54,7 +54,7 @@ The
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__address_v4/from_string.html b/doc/html/boost_asio/reference/ip__address_v4/from_string.html index 1a6566daa4..13180a1993 100644 --- a/doc/html/boost_asio/reference/ip__address_v4/from_string.html +++ b/doc/html/boost_asio/reference/ip__address_v4/from_string.html @@ -53,7 +53,7 @@ static address_v4
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__address_v4/from_string/overload1.html b/doc/html/boost_asio/reference/ip__address_v4/from_string/overload1.html index 3f3515e60c..255a4c0b89 100644 --- a/doc/html/boost_asio/reference/ip__address_v4/from_string/overload1.html +++ b/doc/html/boost_asio/reference/ip__address_v4/from_string/overload1.html @@ -37,7 +37,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__address_v4/from_string/overload2.html b/doc/html/boost_asio/reference/ip__address_v4/from_string/overload2.html index 6f90574d3f..7425ca4bee 100644 --- a/doc/html/boost_asio/reference/ip__address_v4/from_string/overload2.html +++ b/doc/html/boost_asio/reference/ip__address_v4/from_string/overload2.html @@ -38,7 +38,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__address_v4/from_string/overload3.html b/doc/html/boost_asio/reference/ip__address_v4/from_string/overload3.html index 44124a73ad..ce37f3ea30 100644 --- a/doc/html/boost_asio/reference/ip__address_v4/from_string/overload3.html +++ b/doc/html/boost_asio/reference/ip__address_v4/from_string/overload3.html @@ -37,7 +37,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__address_v4/from_string/overload4.html b/doc/html/boost_asio/reference/ip__address_v4/from_string/overload4.html index 138a3b1832..23535644dc 100644 --- a/doc/html/boost_asio/reference/ip__address_v4/from_string/overload4.html +++ b/doc/html/boost_asio/reference/ip__address_v4/from_string/overload4.html @@ -38,7 +38,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__address_v4/is_class_a.html b/doc/html/boost_asio/reference/ip__address_v4/is_class_a.html index e60c306501..4a06e11d29 100644 --- a/doc/html/boost_asio/reference/ip__address_v4/is_class_a.html +++ b/doc/html/boost_asio/reference/ip__address_v4/is_class_a.html @@ -37,7 +37,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__address_v4/is_class_b.html b/doc/html/boost_asio/reference/ip__address_v4/is_class_b.html index 41909a4efa..b7125a4f89 100644 --- a/doc/html/boost_asio/reference/ip__address_v4/is_class_b.html +++ b/doc/html/boost_asio/reference/ip__address_v4/is_class_b.html @@ -37,7 +37,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__address_v4/is_class_c.html b/doc/html/boost_asio/reference/ip__address_v4/is_class_c.html index 2d3b27ad94..14d0b1ddd4 100644 --- a/doc/html/boost_asio/reference/ip__address_v4/is_class_c.html +++ b/doc/html/boost_asio/reference/ip__address_v4/is_class_c.html @@ -37,7 +37,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__address_v4/is_loopback.html b/doc/html/boost_asio/reference/ip__address_v4/is_loopback.html index b3f5e062e6..7a1db41461 100644 --- a/doc/html/boost_asio/reference/ip__address_v4/is_loopback.html +++ b/doc/html/boost_asio/reference/ip__address_v4/is_loopback.html @@ -36,7 +36,7 @@ Determine
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__address_v4/is_multicast.html b/doc/html/boost_asio/reference/ip__address_v4/is_multicast.html index 5385788bb3..e65c57f6b9 100644 --- a/doc/html/boost_asio/reference/ip__address_v4/is_multicast.html +++ b/doc/html/boost_asio/reference/ip__address_v4/is_multicast.html @@ -36,7 +36,7 @@ Determine
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__address_v4/is_unspecified.html b/doc/html/boost_asio/reference/ip__address_v4/is_unspecified.html index 09e62920f8..764812fba7 100644 --- a/doc/html/boost_asio/reference/ip__address_v4/is_unspecified.html +++ b/doc/html/boost_asio/reference/ip__address_v4/is_unspecified.html @@ -36,7 +36,7 @@ Determine
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__address_v4/loopback.html b/doc/html/boost_asio/reference/ip__address_v4/loopback.html index bf284b44ec..102204a6a0 100644 --- a/doc/html/boost_asio/reference/ip__address_v4/loopback.html +++ b/doc/html/boost_asio/reference/ip__address_v4/loopback.html @@ -36,7 +36,7 @@ Obtain
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__address_v4/make_address_v4.html b/doc/html/boost_asio/reference/ip__address_v4/make_address_v4.html index 1ffb23a1b7..6197bf2ab5 100644 --- a/doc/html/boost_asio/reference/ip__address_v4/make_address_v4.html +++ b/doc/html/boost_asio/reference/ip__address_v4/make_address_v4.html @@ -83,7 +83,7 @@ address_v4
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__address_v4/make_address_v4/overload1.html b/doc/html/boost_asio/reference/ip__address_v4/make_address_v4/overload1.html index cd243c5a3f..b1225f7852 100644 --- a/doc/html/boost_asio/reference/ip__address_v4/make_address_v4/overload1.html +++ b/doc/html/boost_asio/reference/ip__address_v4/make_address_v4/overload1.html @@ -36,7 +36,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__address_v4/make_address_v4/overload2.html b/doc/html/boost_asio/reference/ip__address_v4/make_address_v4/overload2.html index 6685aaeaf4..4f5ef6f2f5 100644 --- a/doc/html/boost_asio/reference/ip__address_v4/make_address_v4/overload2.html +++ b/doc/html/boost_asio/reference/ip__address_v4/make_address_v4/overload2.html @@ -36,7 +36,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__address_v4/make_address_v4/overload3.html b/doc/html/boost_asio/reference/ip__address_v4/make_address_v4/overload3.html index 985a6ff633..3d53022074 100644 --- a/doc/html/boost_asio/reference/ip__address_v4/make_address_v4/overload3.html +++ b/doc/html/boost_asio/reference/ip__address_v4/make_address_v4/overload3.html @@ -36,7 +36,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__address_v4/make_address_v4/overload4.html b/doc/html/boost_asio/reference/ip__address_v4/make_address_v4/overload4.html index 76d05ea1a0..1ea84d8dae 100644 --- a/doc/html/boost_asio/reference/ip__address_v4/make_address_v4/overload4.html +++ b/doc/html/boost_asio/reference/ip__address_v4/make_address_v4/overload4.html @@ -37,7 +37,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__address_v4/make_address_v4/overload5.html b/doc/html/boost_asio/reference/ip__address_v4/make_address_v4/overload5.html index ae00503c75..52bad5a07a 100644 --- a/doc/html/boost_asio/reference/ip__address_v4/make_address_v4/overload5.html +++ b/doc/html/boost_asio/reference/ip__address_v4/make_address_v4/overload5.html @@ -36,7 +36,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__address_v4/make_address_v4/overload6.html b/doc/html/boost_asio/reference/ip__address_v4/make_address_v4/overload6.html index 4384d5e7dd..653dab13b7 100644 --- a/doc/html/boost_asio/reference/ip__address_v4/make_address_v4/overload6.html +++ b/doc/html/boost_asio/reference/ip__address_v4/make_address_v4/overload6.html @@ -37,7 +37,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__address_v4/make_address_v4/overload7.html b/doc/html/boost_asio/reference/ip__address_v4/make_address_v4/overload7.html index 41a280c31c..325c47d2db 100644 --- a/doc/html/boost_asio/reference/ip__address_v4/make_address_v4/overload7.html +++ b/doc/html/boost_asio/reference/ip__address_v4/make_address_v4/overload7.html @@ -36,7 +36,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__address_v4/make_address_v4/overload8.html b/doc/html/boost_asio/reference/ip__address_v4/make_address_v4/overload8.html index db6def3000..7a04183672 100644 --- a/doc/html/boost_asio/reference/ip__address_v4/make_address_v4/overload8.html +++ b/doc/html/boost_asio/reference/ip__address_v4/make_address_v4/overload8.html @@ -37,7 +37,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__address_v4/make_address_v4/overload9.html b/doc/html/boost_asio/reference/ip__address_v4/make_address_v4/overload9.html index b4f2713679..e968e77cc2 100644 --- a/doc/html/boost_asio/reference/ip__address_v4/make_address_v4/overload9.html +++ b/doc/html/boost_asio/reference/ip__address_v4/make_address_v4/overload9.html @@ -37,7 +37,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__address_v4/make_network_v4.html b/doc/html/boost_asio/reference/ip__address_v4/make_network_v4.html index 29780edaa3..44648140c0 100644 --- a/doc/html/boost_asio/reference/ip__address_v4/make_network_v4.html +++ b/doc/html/boost_asio/reference/ip__address_v4/make_network_v4.html @@ -47,7 +47,7 @@ Create
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__address_v4/make_network_v4/overload1.html b/doc/html/boost_asio/reference/ip__address_v4/make_network_v4/overload1.html index 6339bb3a91..04e1e729f9 100644 --- a/doc/html/boost_asio/reference/ip__address_v4/make_network_v4/overload1.html +++ b/doc/html/boost_asio/reference/ip__address_v4/make_network_v4/overload1.html @@ -37,7 +37,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__address_v4/make_network_v4/overload2.html b/doc/html/boost_asio/reference/ip__address_v4/make_network_v4/overload2.html index e1effb3617..e705dd9fac 100644 --- a/doc/html/boost_asio/reference/ip__address_v4/make_network_v4/overload2.html +++ b/doc/html/boost_asio/reference/ip__address_v4/make_network_v4/overload2.html @@ -37,7 +37,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__address_v4/netmask.html b/doc/html/boost_asio/reference/ip__address_v4/netmask.html index 5dc31b3aa2..cd6a9b9eb3 100644 --- a/doc/html/boost_asio/reference/ip__address_v4/netmask.html +++ b/doc/html/boost_asio/reference/ip__address_v4/netmask.html @@ -39,7 +39,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__address_v4/operator_eq_.html b/doc/html/boost_asio/reference/ip__address_v4/operator_eq_.html index 99308d750b..4b33e8874c 100644 --- a/doc/html/boost_asio/reference/ip__address_v4/operator_eq_.html +++ b/doc/html/boost_asio/reference/ip__address_v4/operator_eq_.html @@ -37,7 +37,7 @@ Assign
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__address_v4/operator_eq__eq_.html b/doc/html/boost_asio/reference/ip__address_v4/operator_eq__eq_.html index 9bf3283793..e938430ecd 100644 --- a/doc/html/boost_asio/reference/ip__address_v4/operator_eq__eq_.html +++ b/doc/html/boost_asio/reference/ip__address_v4/operator_eq__eq_.html @@ -48,7 +48,7 @@ Compare
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__address_v4/operator_gt_.html b/doc/html/boost_asio/reference/ip__address_v4/operator_gt_.html index ea7a7670f4..4a46232f11 100644 --- a/doc/html/boost_asio/reference/ip__address_v4/operator_gt_.html +++ b/doc/html/boost_asio/reference/ip__address_v4/operator_gt_.html @@ -48,7 +48,7 @@ Compare
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__address_v4/operator_gt__eq_.html b/doc/html/boost_asio/reference/ip__address_v4/operator_gt__eq_.html index 7a012f5eb2..6d308692b2 100644 --- a/doc/html/boost_asio/reference/ip__address_v4/operator_gt__eq_.html +++ b/doc/html/boost_asio/reference/ip__address_v4/operator_gt__eq_.html @@ -48,7 +48,7 @@ Compare
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__address_v4/operator_lt_.html b/doc/html/boost_asio/reference/ip__address_v4/operator_lt_.html index 1bc066b63f..06e57daee9 100644 --- a/doc/html/boost_asio/reference/ip__address_v4/operator_lt_.html +++ b/doc/html/boost_asio/reference/ip__address_v4/operator_lt_.html @@ -48,7 +48,7 @@ Compare
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__address_v4/operator_lt__eq_.html b/doc/html/boost_asio/reference/ip__address_v4/operator_lt__eq_.html index 1d1346dab1..b4e160447a 100644 --- a/doc/html/boost_asio/reference/ip__address_v4/operator_lt__eq_.html +++ b/doc/html/boost_asio/reference/ip__address_v4/operator_lt__eq_.html @@ -48,7 +48,7 @@ Compare
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__address_v4/operator_lt__lt_.html b/doc/html/boost_asio/reference/ip__address_v4/operator_lt__lt_.html index 77675370b5..efd18bd012 100644 --- a/doc/html/boost_asio/reference/ip__address_v4/operator_lt__lt_.html +++ b/doc/html/boost_asio/reference/ip__address_v4/operator_lt__lt_.html @@ -53,7 +53,7 @@ std::basic_ostream< Elem, Traits > &
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__address_v4/operator_lt__lt_/overload1.html b/doc/html/boost_asio/reference/ip__address_v4/operator_lt__lt_/overload1.html index 66c5f24a7d..fdd2fd0170 100644 --- a/doc/html/boost_asio/reference/ip__address_v4/operator_lt__lt_/overload1.html +++ b/doc/html/boost_asio/reference/ip__address_v4/operator_lt__lt_/overload1.html @@ -68,7 +68,7 @@ std::basic_ostream< Elem, Traits > & operator<<(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__address_v4/operator_lt__lt_/overload2.html b/doc/html/boost_asio/reference/ip__address_v4/operator_lt__lt_/overload2.html index eac8b9d4a3..872604678c 100644 --- a/doc/html/boost_asio/reference/ip__address_v4/operator_lt__lt_/overload2.html +++ b/doc/html/boost_asio/reference/ip__address_v4/operator_lt__lt_/overload2.html @@ -68,7 +68,7 @@ std::basic_ostream< Elem, Traits > & operator<<(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__address_v4/operator_not__eq_.html b/doc/html/boost_asio/reference/ip__address_v4/operator_not__eq_.html index 6fafa35be8..670095db97 100644 --- a/doc/html/boost_asio/reference/ip__address_v4/operator_not__eq_.html +++ b/doc/html/boost_asio/reference/ip__address_v4/operator_not__eq_.html @@ -48,7 +48,7 @@ Compare
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__address_v4/to_bytes.html b/doc/html/boost_asio/reference/ip__address_v4/to_bytes.html index 6583944208..8a5e5b08ea 100644 --- a/doc/html/boost_asio/reference/ip__address_v4/to_bytes.html +++ b/doc/html/boost_asio/reference/ip__address_v4/to_bytes.html @@ -36,7 +36,7 @@ Get the
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__address_v4/to_string.html b/doc/html/boost_asio/reference/ip__address_v4/to_string.html index d33a88978e..bb16b75c3e 100644 --- a/doc/html/boost_asio/reference/ip__address_v4/to_string.html +++ b/doc/html/boost_asio/reference/ip__address_v4/to_string.html @@ -45,7 +45,7 @@ Get
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__address_v4/to_string/overload1.html b/doc/html/boost_asio/reference/ip__address_v4/to_string/overload1.html index 7417752284..3f92caa848 100644 --- a/doc/html/boost_asio/reference/ip__address_v4/to_string/overload1.html +++ b/doc/html/boost_asio/reference/ip__address_v4/to_string/overload1.html @@ -35,7 +35,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__address_v4/to_string/overload2.html b/doc/html/boost_asio/reference/ip__address_v4/to_string/overload2.html index d9eea7ce2a..bd5b4d1979 100644 --- a/doc/html/boost_asio/reference/ip__address_v4/to_string/overload2.html +++ b/doc/html/boost_asio/reference/ip__address_v4/to_string/overload2.html @@ -37,7 +37,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__address_v4/to_uint.html b/doc/html/boost_asio/reference/ip__address_v4/to_uint.html index 7b586ff446..2856aa7cc8 100644 --- a/doc/html/boost_asio/reference/ip__address_v4/to_uint.html +++ b/doc/html/boost_asio/reference/ip__address_v4/to_uint.html @@ -36,7 +36,7 @@ Get the
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__address_v4/to_ulong.html b/doc/html/boost_asio/reference/ip__address_v4/to_ulong.html index 8708cbd0c7..ca5c03f471 100644 --- a/doc/html/boost_asio/reference/ip__address_v4/to_ulong.html +++ b/doc/html/boost_asio/reference/ip__address_v4/to_ulong.html @@ -36,7 +36,7 @@ Get the
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__address_v4/uint_type.html b/doc/html/boost_asio/reference/ip__address_v4/uint_type.html index b03b93f66f..c50a63c93d 100644 --- a/doc/html/boost_asio/reference/ip__address_v4/uint_type.html +++ b/doc/html/boost_asio/reference/ip__address_v4/uint_type.html @@ -46,7 +46,7 @@ The
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__address_v4_iterator.html b/doc/html/boost_asio/reference/ip__address_v4_iterator.html index c811daea73..e15ad58459 100644 --- a/doc/html/boost_asio/reference/ip__address_v4_iterator.html +++ b/doc/html/boost_asio/reference/ip__address_v4_iterator.html @@ -35,494 +35,6 @@ An input
    - Types -
    -
    ---- - - - - - - - - - - - - - - -
    -

    - Name -

    -     		-

    - Description -

    -
    -

    - bytes_type -

    -     		-

    - The type used to represent an address as an array of bytes. -

    -
    -

    - uint_type -

    -     		-

    - The type used to represent an address as an unsigned integer. -

    -
    -
    - - Member - Functions -
    -
    ---- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
    -

    - Name -

    -     		-

    - Description -

    -
    -

    - address_v4 -

    -     		-

    - Default constructor. -

    -

    - Construct an address from raw bytes. -

    -

    - Construct an address from an unsigned integer in host byte order. -

    -

    - Copy constructor. -

    -
    -

    - any -

    -     		-

    - Obtain an address object that represents any address. -

    -
    -

    - broadcast -

    -     		-

    - Obtain an address object that represents the broadcast address. -

    -

    - (Deprecated: Use network_v4 class.) Obtain an address object that - represents the broadcast address that corresponds to the specified - address and netmask. -

    -
    -

    - from_string -

    -     		-

    - (Deprecated: Use make_address_v4().) Create an address from an - IP address string in dotted decimal form. -

    -
    -

    - is_class_a -

    -     		-

    - (Deprecated: Use network_v4 class.) Determine whether the address - is a class A address. -

    -
    -

    - is_class_b -

    -     		-

    - (Deprecated: Use network_v4 class.) Determine whether the address - is a class B address. -

    -
    -

    - is_class_c -

    -     		-

    - (Deprecated: Use network_v4 class.) Determine whether the address - is a class C address. -

    -
    -

    - is_loopback -

    -     		-

    - Determine whether the address is a loopback address. -

    -
    -

    - is_multicast -

    -     		-

    - Determine whether the address is a multicast address. -

    -
    -

    - is_unspecified -

    -     		-

    - Determine whether the address is unspecified. -

    -
    -

    - loopback -

    -     		-

    - Obtain an address object that represents the loopback address. -

    -
    -

    - netmask -

    -     		-

    - (Deprecated: Use network_v4 class.) Obtain the netmask that corresponds - to the address, based on its address class. -

    -
    -

    - operator= -

    -     		-

    - Assign from another address. -

    -
    -

    - to_bytes -

    -     		-

    - Get the address in bytes, in network byte order. -

    -
    -

    - to_string -

    -     		-

    - Get the address as a string in dotted decimal format. -

    -

    - (Deprecated: Use other overload.) Get the address as a string in - dotted decimal format. -

    -
    -

    - to_uint -

    -     		-

    - Get the address as an unsigned integer in host byte order. -

    -
    -

    - to_ulong -

    -     		-

    - Get the address as an unsigned long in host byte order. -

    -
    -
    - - Friends -
    -
    ---- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
    -

    - Name -

    -     		-

    - Description -

    -
    -

    - operator!= -

    -     		-

    - Compare two addresses for inequality. -

    -
    -

    - operator< -

    -     		-

    - Compare addresses for ordering. -

    -
    -

    - operator<= -

    -     		-

    - Compare addresses for ordering. -

    -
    -

    - operator== -

    -     		-

    - Compare two addresses for equality. -

    -
    -

    - operator> -

    -     		-

    - Compare addresses for ordering. -

    -
    -

    - operator>= -

    -     		-

    - Compare addresses for ordering. -

    -
    -
    - - Related - Functions -
    -
    ---- - - - - - - - - - - - - - - - - - - -
    -

    - Name -

    -     		-

    - Description -

    -
    -

    - make_address_v4 -

    -     		-

    - Create an IPv4 address from raw bytes in network order. -

    -

    - Create an IPv4 address from an unsigned integer in host byte order. -

    -

    - Create an IPv4 address from an IP address string in dotted decimal - form. -

    -

    - Create an IPv4 address from a IPv4-mapped IPv6 address. -

    -
    -

    - make_network_v4 -

    -     		-

    - Create an IPv4 network from an address and prefix length. -

    -

    - Create an IPv4 network from an address and netmask. -

    -
    -

    - operator<< -

    -     		-

    - Output an address as a string. -

    -

    - Output a network as a string. -

    -
    -

    - The ip::address_v4 - class provides the ability to use and manipulate IP version 4 addresses. -

    -
    - - Thread - Safety -
    -

    - Distinct objects: Safe. -

    -

    - Shared objects: Unsafe. -

    -
    - Requirements

    @@ -534,7 +46,7 @@ An input

    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__address_v4_range.html b/doc/html/boost_asio/reference/ip__address_v4_range.html index 83c4f6b4db..a35986ab14 100644 --- a/doc/html/boost_asio/reference/ip__address_v4_range.html +++ b/doc/html/boost_asio/reference/ip__address_v4_range.html @@ -35,494 +35,6 @@ Represents a
    - Types -
    -
    ---- - - - - - - - - - - - - - - -
    -

    - Name -

    -     		-

    - Description -

    -
    -

    - bytes_type -

    -     		-

    - The type used to represent an address as an array of bytes. -

    -
    -

    - uint_type -

    -     		-

    - The type used to represent an address as an unsigned integer. -

    -
    -
    - - Member - Functions -
    -
    ---- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
    -

    - Name -

    -     		-

    - Description -

    -
    -

    - address_v4 -

    -     		-

    - Default constructor. -

    -

    - Construct an address from raw bytes. -

    -

    - Construct an address from an unsigned integer in host byte order. -

    -

    - Copy constructor. -

    -
    -

    - any -

    -     		-

    - Obtain an address object that represents any address. -

    -
    -

    - broadcast -

    -     		-

    - Obtain an address object that represents the broadcast address. -

    -

    - (Deprecated: Use network_v4 class.) Obtain an address object that - represents the broadcast address that corresponds to the specified - address and netmask. -

    -
    -

    - from_string -

    -     		-

    - (Deprecated: Use make_address_v4().) Create an address from an - IP address string in dotted decimal form. -

    -
    -

    - is_class_a -

    -     		-

    - (Deprecated: Use network_v4 class.) Determine whether the address - is a class A address. -

    -
    -

    - is_class_b -

    -     		-

    - (Deprecated: Use network_v4 class.) Determine whether the address - is a class B address. -

    -
    -

    - is_class_c -

    -     		-

    - (Deprecated: Use network_v4 class.) Determine whether the address - is a class C address. -

    -
    -

    - is_loopback -

    -     		-

    - Determine whether the address is a loopback address. -

    -
    -

    - is_multicast -

    -     		-

    - Determine whether the address is a multicast address. -

    -
    -

    - is_unspecified -

    -     		-

    - Determine whether the address is unspecified. -

    -
    -

    - loopback -

    -     		-

    - Obtain an address object that represents the loopback address. -

    -
    -

    - netmask -

    -     		-

    - (Deprecated: Use network_v4 class.) Obtain the netmask that corresponds - to the address, based on its address class. -

    -
    -

    - operator= -

    -     		-

    - Assign from another address. -

    -
    -

    - to_bytes -

    -     		-

    - Get the address in bytes, in network byte order. -

    -
    -

    - to_string -

    -     		-

    - Get the address as a string in dotted decimal format. -

    -

    - (Deprecated: Use other overload.) Get the address as a string in - dotted decimal format. -

    -
    -

    - to_uint -

    -     		-

    - Get the address as an unsigned integer in host byte order. -

    -
    -

    - to_ulong -

    -     		-

    - Get the address as an unsigned long in host byte order. -

    -
    -
    - - Friends -
    -
    ---- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
    -

    - Name -

    -     		-

    - Description -

    -
    -

    - operator!= -

    -     		-

    - Compare two addresses for inequality. -

    -
    -

    - operator< -

    -     		-

    - Compare addresses for ordering. -

    -
    -

    - operator<= -

    -     		-

    - Compare addresses for ordering. -

    -
    -

    - operator== -

    -     		-

    - Compare two addresses for equality. -

    -
    -

    - operator> -

    -     		-

    - Compare addresses for ordering. -

    -
    -

    - operator>= -

    -     		-

    - Compare addresses for ordering. -

    -
    -
    - - Related - Functions -
    -
    ---- - - - - - - - - - - - - - - - - - - -
    -

    - Name -

    -     		-

    - Description -

    -
    -

    - make_address_v4 -

    -     		-

    - Create an IPv4 address from raw bytes in network order. -

    -

    - Create an IPv4 address from an unsigned integer in host byte order. -

    -

    - Create an IPv4 address from an IP address string in dotted decimal - form. -

    -

    - Create an IPv4 address from a IPv4-mapped IPv6 address. -

    -
    -

    - make_network_v4 -

    -     		-

    - Create an IPv4 network from an address and prefix length. -

    -

    - Create an IPv4 network from an address and netmask. -

    -
    -

    - operator<< -

    -     		-

    - Output an address as a string. -

    -

    - Output a network as a string. -

    -
    -

    - The ip::address_v4 - class provides the ability to use and manipulate IP version 4 addresses. -

    -
    - - Thread - Safety -
    -

    - Distinct objects: Safe. -

    -

    - Shared objects: Unsafe. -

    -
    - Requirements

    @@ -534,7 +46,7 @@ Represents a

    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__address_v6.html b/doc/html/boost_asio/reference/ip__address_v6.html index 906e477ea2..53e3d884e4 100644 --- a/doc/html/boost_asio/reference/ip__address_v6.html +++ b/doc/html/boost_asio/reference/ip__address_v6.html @@ -574,7 +574,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__address_v6/address_v6.html b/doc/html/boost_asio/reference/ip__address_v6/address_v6.html index 9364875fac..5a9f6d5ef7 100644 --- a/doc/html/boost_asio/reference/ip__address_v6/address_v6.html +++ b/doc/html/boost_asio/reference/ip__address_v6/address_v6.html @@ -52,7 +52,7 @@ Default
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__address_v6/address_v6/overload1.html b/doc/html/boost_asio/reference/ip__address_v6/address_v6/overload1.html index 074f1bac94..01e32c135a 100644 --- a/doc/html/boost_asio/reference/ip__address_v6/address_v6/overload1.html +++ b/doc/html/boost_asio/reference/ip__address_v6/address_v6/overload1.html @@ -35,7 +35,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__address_v6/address_v6/overload2.html b/doc/html/boost_asio/reference/ip__address_v6/address_v6/overload2.html index f3504ff8ae..bf8e6cd159 100644 --- a/doc/html/boost_asio/reference/ip__address_v6/address_v6/overload2.html +++ b/doc/html/boost_asio/reference/ip__address_v6/address_v6/overload2.html @@ -37,7 +37,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__address_v6/address_v6/overload3.html b/doc/html/boost_asio/reference/ip__address_v6/address_v6/overload3.html index 6145b25836..3e6423f5e6 100644 --- a/doc/html/boost_asio/reference/ip__address_v6/address_v6/overload3.html +++ b/doc/html/boost_asio/reference/ip__address_v6/address_v6/overload3.html @@ -36,7 +36,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__address_v6/any.html b/doc/html/boost_asio/reference/ip__address_v6/any.html index e6ab2752af..9582cb504b 100644 --- a/doc/html/boost_asio/reference/ip__address_v6/any.html +++ b/doc/html/boost_asio/reference/ip__address_v6/any.html @@ -36,7 +36,7 @@ Obtain an address
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__address_v6/bytes_type.html b/doc/html/boost_asio/reference/ip__address_v6/bytes_type.html index bfdacc71f4..aa972e0c09 100644 --- a/doc/html/boost_asio/reference/ip__address_v6/bytes_type.html +++ b/doc/html/boost_asio/reference/ip__address_v6/bytes_type.html @@ -54,7 +54,7 @@ The
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__address_v6/from_string.html b/doc/html/boost_asio/reference/ip__address_v6/from_string.html index a1fc20309c..07e000f183 100644 --- a/doc/html/boost_asio/reference/ip__address_v6/from_string.html +++ b/doc/html/boost_asio/reference/ip__address_v6/from_string.html @@ -53,7 +53,7 @@ static address_v6
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__address_v6/from_string/overload1.html b/doc/html/boost_asio/reference/ip__address_v6/from_string/overload1.html index 7138df9d9e..3eddaa5f0f 100644 --- a/doc/html/boost_asio/reference/ip__address_v6/from_string/overload1.html +++ b/doc/html/boost_asio/reference/ip__address_v6/from_string/overload1.html @@ -37,7 +37,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__address_v6/from_string/overload2.html b/doc/html/boost_asio/reference/ip__address_v6/from_string/overload2.html index 764f4e0069..97675aac70 100644 --- a/doc/html/boost_asio/reference/ip__address_v6/from_string/overload2.html +++ b/doc/html/boost_asio/reference/ip__address_v6/from_string/overload2.html @@ -38,7 +38,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__address_v6/from_string/overload3.html b/doc/html/boost_asio/reference/ip__address_v6/from_string/overload3.html index a2305a4078..4fff40ff04 100644 --- a/doc/html/boost_asio/reference/ip__address_v6/from_string/overload3.html +++ b/doc/html/boost_asio/reference/ip__address_v6/from_string/overload3.html @@ -37,7 +37,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__address_v6/from_string/overload4.html b/doc/html/boost_asio/reference/ip__address_v6/from_string/overload4.html index 0498de4736..7916ff4548 100644 --- a/doc/html/boost_asio/reference/ip__address_v6/from_string/overload4.html +++ b/doc/html/boost_asio/reference/ip__address_v6/from_string/overload4.html @@ -38,7 +38,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__address_v6/is_link_local.html b/doc/html/boost_asio/reference/ip__address_v6/is_link_local.html index a8be8245a5..0bb78d08f4 100644 --- a/doc/html/boost_asio/reference/ip__address_v6/is_link_local.html +++ b/doc/html/boost_asio/reference/ip__address_v6/is_link_local.html @@ -36,7 +36,7 @@ Determine
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__address_v6/is_loopback.html b/doc/html/boost_asio/reference/ip__address_v6/is_loopback.html index 2b39cfd51b..84649b1920 100644 --- a/doc/html/boost_asio/reference/ip__address_v6/is_loopback.html +++ b/doc/html/boost_asio/reference/ip__address_v6/is_loopback.html @@ -36,7 +36,7 @@ Determine
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__address_v6/is_multicast.html b/doc/html/boost_asio/reference/ip__address_v6/is_multicast.html index 8a487c26e7..762efa79e6 100644 --- a/doc/html/boost_asio/reference/ip__address_v6/is_multicast.html +++ b/doc/html/boost_asio/reference/ip__address_v6/is_multicast.html @@ -36,7 +36,7 @@ Determine
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__address_v6/is_multicast_global.html b/doc/html/boost_asio/reference/ip__address_v6/is_multicast_global.html index f5d7cc391f..8425dab9b2 100644 --- a/doc/html/boost_asio/reference/ip__address_v6/is_multicast_global.html +++ b/doc/html/boost_asio/reference/ip__address_v6/is_multicast_global.html @@ -36,7 +36,7 @@ Determine
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__address_v6/is_multicast_link_local.html b/doc/html/boost_asio/reference/ip__address_v6/is_multicast_link_local.html index eabc12b52a..79c739d3f5 100644 --- a/doc/html/boost_asio/reference/ip__address_v6/is_multicast_link_local.html +++ b/doc/html/boost_asio/reference/ip__address_v6/is_multicast_link_local.html @@ -36,7 +36,7 @@ Determine
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__address_v6/is_multicast_node_local.html b/doc/html/boost_asio/reference/ip__address_v6/is_multicast_node_local.html index bd55314fdf..b68a943d06 100644 --- a/doc/html/boost_asio/reference/ip__address_v6/is_multicast_node_local.html +++ b/doc/html/boost_asio/reference/ip__address_v6/is_multicast_node_local.html @@ -36,7 +36,7 @@ Determine
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__address_v6/is_multicast_org_local.html b/doc/html/boost_asio/reference/ip__address_v6/is_multicast_org_local.html index 517f56cf90..8ae5262742 100644 --- a/doc/html/boost_asio/reference/ip__address_v6/is_multicast_org_local.html +++ b/doc/html/boost_asio/reference/ip__address_v6/is_multicast_org_local.html @@ -36,7 +36,7 @@ Determine
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__address_v6/is_multicast_site_local.html b/doc/html/boost_asio/reference/ip__address_v6/is_multicast_site_local.html index 1ca7323584..d8795e62a7 100644 --- a/doc/html/boost_asio/reference/ip__address_v6/is_multicast_site_local.html +++ b/doc/html/boost_asio/reference/ip__address_v6/is_multicast_site_local.html @@ -36,7 +36,7 @@ Determine
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__address_v6/is_site_local.html b/doc/html/boost_asio/reference/ip__address_v6/is_site_local.html index e0d83a9e54..ca6ea1b602 100644 --- a/doc/html/boost_asio/reference/ip__address_v6/is_site_local.html +++ b/doc/html/boost_asio/reference/ip__address_v6/is_site_local.html @@ -36,7 +36,7 @@ Determine
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__address_v6/is_unspecified.html b/doc/html/boost_asio/reference/ip__address_v6/is_unspecified.html index c92f56c72d..a451ad306b 100644 --- a/doc/html/boost_asio/reference/ip__address_v6/is_unspecified.html +++ b/doc/html/boost_asio/reference/ip__address_v6/is_unspecified.html @@ -36,7 +36,7 @@ Determine
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__address_v6/is_v4_compatible.html b/doc/html/boost_asio/reference/ip__address_v6/is_v4_compatible.html index 01824dbab7..663db26ebf 100644 --- a/doc/html/boost_asio/reference/ip__address_v6/is_v4_compatible.html +++ b/doc/html/boost_asio/reference/ip__address_v6/is_v4_compatible.html @@ -36,7 +36,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__address_v6/is_v4_mapped.html b/doc/html/boost_asio/reference/ip__address_v6/is_v4_mapped.html index 6fbea52748..e0899fee72 100644 --- a/doc/html/boost_asio/reference/ip__address_v6/is_v4_mapped.html +++ b/doc/html/boost_asio/reference/ip__address_v6/is_v4_mapped.html @@ -36,7 +36,7 @@ Determine
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__address_v6/loopback.html b/doc/html/boost_asio/reference/ip__address_v6/loopback.html index f48a2d2ab4..043d58f36f 100644 --- a/doc/html/boost_asio/reference/ip__address_v6/loopback.html +++ b/doc/html/boost_asio/reference/ip__address_v6/loopback.html @@ -36,7 +36,7 @@ Obtain
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__address_v6/make_address_v6.html b/doc/html/boost_asio/reference/ip__address_v6/make_address_v6.html index 9e1c47adfb..42171c6096 100644 --- a/doc/html/boost_asio/reference/ip__address_v6/make_address_v6.html +++ b/doc/html/boost_asio/reference/ip__address_v6/make_address_v6.html @@ -80,7 +80,7 @@ address_v6
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__address_v6/make_address_v6/overload1.html b/doc/html/boost_asio/reference/ip__address_v6/make_address_v6/overload1.html index 51be0ad371..c7acf9feae 100644 --- a/doc/html/boost_asio/reference/ip__address_v6/make_address_v6/overload1.html +++ b/doc/html/boost_asio/reference/ip__address_v6/make_address_v6/overload1.html @@ -37,7 +37,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__address_v6/make_address_v6/overload2.html b/doc/html/boost_asio/reference/ip__address_v6/make_address_v6/overload2.html index 1282ce324c..f10a8ef520 100644 --- a/doc/html/boost_asio/reference/ip__address_v6/make_address_v6/overload2.html +++ b/doc/html/boost_asio/reference/ip__address_v6/make_address_v6/overload2.html @@ -36,7 +36,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__address_v6/make_address_v6/overload3.html b/doc/html/boost_asio/reference/ip__address_v6/make_address_v6/overload3.html index ea2108a972..9132aa70a6 100644 --- a/doc/html/boost_asio/reference/ip__address_v6/make_address_v6/overload3.html +++ b/doc/html/boost_asio/reference/ip__address_v6/make_address_v6/overload3.html @@ -37,7 +37,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__address_v6/make_address_v6/overload4.html b/doc/html/boost_asio/reference/ip__address_v6/make_address_v6/overload4.html index 9e95a3bd3b..d753325218 100644 --- a/doc/html/boost_asio/reference/ip__address_v6/make_address_v6/overload4.html +++ b/doc/html/boost_asio/reference/ip__address_v6/make_address_v6/overload4.html @@ -36,7 +36,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__address_v6/make_address_v6/overload5.html b/doc/html/boost_asio/reference/ip__address_v6/make_address_v6/overload5.html index 25db77b467..e95a242da2 100644 --- a/doc/html/boost_asio/reference/ip__address_v6/make_address_v6/overload5.html +++ b/doc/html/boost_asio/reference/ip__address_v6/make_address_v6/overload5.html @@ -37,7 +37,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__address_v6/make_address_v6/overload6.html b/doc/html/boost_asio/reference/ip__address_v6/make_address_v6/overload6.html index 5b7c5446b6..e677342341 100644 --- a/doc/html/boost_asio/reference/ip__address_v6/make_address_v6/overload6.html +++ b/doc/html/boost_asio/reference/ip__address_v6/make_address_v6/overload6.html @@ -36,7 +36,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__address_v6/make_address_v6/overload7.html b/doc/html/boost_asio/reference/ip__address_v6/make_address_v6/overload7.html index d90829c6b5..f80602e4ee 100644 --- a/doc/html/boost_asio/reference/ip__address_v6/make_address_v6/overload7.html +++ b/doc/html/boost_asio/reference/ip__address_v6/make_address_v6/overload7.html @@ -37,7 +37,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__address_v6/make_address_v6/overload8.html b/doc/html/boost_asio/reference/ip__address_v6/make_address_v6/overload8.html index 50bbae2f5a..77fda1acb6 100644 --- a/doc/html/boost_asio/reference/ip__address_v6/make_address_v6/overload8.html +++ b/doc/html/boost_asio/reference/ip__address_v6/make_address_v6/overload8.html @@ -37,7 +37,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__address_v6/make_network_v6.html b/doc/html/boost_asio/reference/ip__address_v6/make_network_v6.html index 0eb88f28d3..09c296fc70 100644 --- a/doc/html/boost_asio/reference/ip__address_v6/make_network_v6.html +++ b/doc/html/boost_asio/reference/ip__address_v6/make_network_v6.html @@ -38,7 +38,7 @@ Create
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__address_v6/operator_eq_.html b/doc/html/boost_asio/reference/ip__address_v6/operator_eq_.html index 3688faaeb0..03223bd0f3 100644 --- a/doc/html/boost_asio/reference/ip__address_v6/operator_eq_.html +++ b/doc/html/boost_asio/reference/ip__address_v6/operator_eq_.html @@ -37,7 +37,7 @@ Assign
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__address_v6/operator_eq__eq_.html b/doc/html/boost_asio/reference/ip__address_v6/operator_eq__eq_.html index 82656d376a..36ef2d6b07 100644 --- a/doc/html/boost_asio/reference/ip__address_v6/operator_eq__eq_.html +++ b/doc/html/boost_asio/reference/ip__address_v6/operator_eq__eq_.html @@ -48,7 +48,7 @@ Compare
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__address_v6/operator_gt_.html b/doc/html/boost_asio/reference/ip__address_v6/operator_gt_.html index 29d5129040..3d67eae72a 100644 --- a/doc/html/boost_asio/reference/ip__address_v6/operator_gt_.html +++ b/doc/html/boost_asio/reference/ip__address_v6/operator_gt_.html @@ -48,7 +48,7 @@ Compare
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__address_v6/operator_gt__eq_.html b/doc/html/boost_asio/reference/ip__address_v6/operator_gt__eq_.html index ef1e971f28..e1cc213b77 100644 --- a/doc/html/boost_asio/reference/ip__address_v6/operator_gt__eq_.html +++ b/doc/html/boost_asio/reference/ip__address_v6/operator_gt__eq_.html @@ -48,7 +48,7 @@ Compare
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__address_v6/operator_lt_.html b/doc/html/boost_asio/reference/ip__address_v6/operator_lt_.html index 783665a452..2c6464bcb5 100644 --- a/doc/html/boost_asio/reference/ip__address_v6/operator_lt_.html +++ b/doc/html/boost_asio/reference/ip__address_v6/operator_lt_.html @@ -48,7 +48,7 @@ Compare
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__address_v6/operator_lt__eq_.html b/doc/html/boost_asio/reference/ip__address_v6/operator_lt__eq_.html index a4559f47b9..bd460e417d 100644 --- a/doc/html/boost_asio/reference/ip__address_v6/operator_lt__eq_.html +++ b/doc/html/boost_asio/reference/ip__address_v6/operator_lt__eq_.html @@ -48,7 +48,7 @@ Compare
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__address_v6/operator_lt__lt_.html b/doc/html/boost_asio/reference/ip__address_v6/operator_lt__lt_.html index 2906ead042..023b3b24a9 100644 --- a/doc/html/boost_asio/reference/ip__address_v6/operator_lt__lt_.html +++ b/doc/html/boost_asio/reference/ip__address_v6/operator_lt__lt_.html @@ -53,7 +53,7 @@ std::basic_ostream< Elem, Traits > &
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__address_v6/operator_lt__lt_/overload1.html b/doc/html/boost_asio/reference/ip__address_v6/operator_lt__lt_/overload1.html index 4ec691b46c..fc4acc0321 100644 --- a/doc/html/boost_asio/reference/ip__address_v6/operator_lt__lt_/overload1.html +++ b/doc/html/boost_asio/reference/ip__address_v6/operator_lt__lt_/overload1.html @@ -68,7 +68,7 @@ std::basic_ostream< Elem, Traits > & operator<<(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__address_v6/operator_lt__lt_/overload2.html b/doc/html/boost_asio/reference/ip__address_v6/operator_lt__lt_/overload2.html index 1bf8582973..bb7192abb7 100644 --- a/doc/html/boost_asio/reference/ip__address_v6/operator_lt__lt_/overload2.html +++ b/doc/html/boost_asio/reference/ip__address_v6/operator_lt__lt_/overload2.html @@ -68,7 +68,7 @@ std::basic_ostream< Elem, Traits > & operator<<(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__address_v6/operator_not__eq_.html b/doc/html/boost_asio/reference/ip__address_v6/operator_not__eq_.html index 879a6e9960..3be800e835 100644 --- a/doc/html/boost_asio/reference/ip__address_v6/operator_not__eq_.html +++ b/doc/html/boost_asio/reference/ip__address_v6/operator_not__eq_.html @@ -48,7 +48,7 @@ Compare
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__address_v6/scope_id.html b/doc/html/boost_asio/reference/ip__address_v6/scope_id.html index 5b32c4ec7b..44e8ac3bbd 100644 --- a/doc/html/boost_asio/reference/ip__address_v6/scope_id.html +++ b/doc/html/boost_asio/reference/ip__address_v6/scope_id.html @@ -41,7 +41,7 @@ void
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__address_v6/scope_id/overload1.html b/doc/html/boost_asio/reference/ip__address_v6/scope_id/overload1.html index c2d401d212..32ade2c11a 100644 --- a/doc/html/boost_asio/reference/ip__address_v6/scope_id/overload1.html +++ b/doc/html/boost_asio/reference/ip__address_v6/scope_id/overload1.html @@ -38,7 +38,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__address_v6/scope_id/overload2.html b/doc/html/boost_asio/reference/ip__address_v6/scope_id/overload2.html index 9418e6efc4..be0559d9bf 100644 --- a/doc/html/boost_asio/reference/ip__address_v6/scope_id/overload2.html +++ b/doc/html/boost_asio/reference/ip__address_v6/scope_id/overload2.html @@ -39,7 +39,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__address_v6/to_bytes.html b/doc/html/boost_asio/reference/ip__address_v6/to_bytes.html index abe3d43a33..a4b3c7ef53 100644 --- a/doc/html/boost_asio/reference/ip__address_v6/to_bytes.html +++ b/doc/html/boost_asio/reference/ip__address_v6/to_bytes.html @@ -36,7 +36,7 @@ Get the
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__address_v6/to_string.html b/doc/html/boost_asio/reference/ip__address_v6/to_string.html index ab4f8d849b..119ddbea09 100644 --- a/doc/html/boost_asio/reference/ip__address_v6/to_string.html +++ b/doc/html/boost_asio/reference/ip__address_v6/to_string.html @@ -44,7 +44,7 @@ Get
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__address_v6/to_string/overload1.html b/doc/html/boost_asio/reference/ip__address_v6/to_string/overload1.html index e9fe168436..c0266a85db 100644 --- a/doc/html/boost_asio/reference/ip__address_v6/to_string/overload1.html +++ b/doc/html/boost_asio/reference/ip__address_v6/to_string/overload1.html @@ -35,7 +35,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__address_v6/to_string/overload2.html b/doc/html/boost_asio/reference/ip__address_v6/to_string/overload2.html index 63e0b29955..1c5471afde 100644 --- a/doc/html/boost_asio/reference/ip__address_v6/to_string/overload2.html +++ b/doc/html/boost_asio/reference/ip__address_v6/to_string/overload2.html @@ -36,7 +36,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__address_v6/to_v4.html b/doc/html/boost_asio/reference/ip__address_v6/to_v4.html index fd8a1bd573..cacae546ac 100644 --- a/doc/html/boost_asio/reference/ip__address_v6/to_v4.html +++ b/doc/html/boost_asio/reference/ip__address_v6/to_v4.html @@ -37,7 +37,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__address_v6/v4_compatible.html b/doc/html/boost_asio/reference/ip__address_v6/v4_compatible.html index c819ad3dcb..5d1d3026ea 100644 --- a/doc/html/boost_asio/reference/ip__address_v6/v4_compatible.html +++ b/doc/html/boost_asio/reference/ip__address_v6/v4_compatible.html @@ -37,7 +37,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__address_v6/v4_mapped.html b/doc/html/boost_asio/reference/ip__address_v6/v4_mapped.html index ec26bbc410..ecaa223362 100644 --- a/doc/html/boost_asio/reference/ip__address_v6/v4_mapped.html +++ b/doc/html/boost_asio/reference/ip__address_v6/v4_mapped.html @@ -37,7 +37,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__address_v6_iterator.html b/doc/html/boost_asio/reference/ip__address_v6_iterator.html index c3787301c3..7d01b67fc3 100644 --- a/doc/html/boost_asio/reference/ip__address_v6_iterator.html +++ b/doc/html/boost_asio/reference/ip__address_v6_iterator.html @@ -35,538 +35,6 @@ An input
    - Types -
    -
    ---- - - - - - - - - -
    -

    - Name -

    -     		-

    - Description -

    -
    -

    - bytes_type -

    -     		-

    - The type used to represent an address as an array of bytes. -

    -
    -
    - - Member - Functions -
    -
    ---- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
    -

    - Name -

    -     		-

    - Description -

    -
    -

    - address_v6 -

    -     		-

    - Default constructor. -

    -

    - Construct an address from raw bytes and scope ID. -

    -

    - Copy constructor. -

    -
    -

    - any -

    -     		-

    - Obtain an address object that represents any address. -

    -
    -

    - from_string -

    -     		-

    - (Deprecated: Use make_address_v6().) Create an IPv6 address from - an IP address string. -

    -
    -

    - is_link_local -

    -     		-

    - Determine whether the address is link local. -

    -
    -

    - is_loopback -

    -     		-

    - Determine whether the address is a loopback address. -

    -
    -

    - is_multicast -

    -     		-

    - Determine whether the address is a multicast address. -

    -
    -

    - is_multicast_global -

    -     		-

    - Determine whether the address is a global multicast address. -

    -
    -

    - is_multicast_link_local -

    -     		-

    - Determine whether the address is a link-local multicast address. -

    -
    -

    - is_multicast_node_local -

    -     		-

    - Determine whether the address is a node-local multicast address. -

    -
    -

    - is_multicast_org_local -

    -     		-

    - Determine whether the address is a org-local multicast address. -

    -
    -

    - is_multicast_site_local -

    -     		-

    - Determine whether the address is a site-local multicast address. -

    -
    -

    - is_site_local -

    -     		-

    - Determine whether the address is site local. -

    -
    -

    - is_unspecified -

    -     		-

    - Determine whether the address is unspecified. -

    -
    -

    - is_v4_compatible -

    -     		-

    - (Deprecated: No replacement.) Determine whether the address is - an IPv4-compatible address. -

    -
    -

    - is_v4_mapped -

    -     		-

    - Determine whether the address is a mapped IPv4 address. -

    -
    -

    - loopback -

    -     		-

    - Obtain an address object that represents the loopback address. -

    -
    -

    - operator= -

    -     		-

    - Assign from another address. -

    -
    -

    - scope_id -

    -     		-

    - The scope ID of the address. -

    -
    -

    - to_bytes -

    -     		-

    - Get the address in bytes, in network byte order. -

    -
    -

    - to_string -

    -     		-

    - Get the address as a string. -

    -

    - (Deprecated: Use other overload.) Get the address as a string. -

    -
    -

    - to_v4 -

    -     		-

    - (Deprecated: Use make_address_v4().) Converts an IPv4-mapped or - IPv4-compatible address to an IPv4 address. -

    -
    -

    - v4_compatible -

    -     		-

    - (Deprecated: No replacement.) Create an IPv4-compatible IPv6 address. -

    -
    -

    - v4_mapped -

    -     		-

    - (Deprecated: Use make_address_v6().) Create an IPv4-mapped IPv6 - address. -

    -
    -
    - - Friends -
    -
    ---- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
    -

    - Name -

    -     		-

    - Description -

    -
    -

    - operator!= -

    -     		-

    - Compare two addresses for inequality. -

    -
    -

    - operator< -

    -     		-

    - Compare addresses for ordering. -

    -
    -

    - operator<= -

    -     		-

    - Compare addresses for ordering. -

    -
    -

    - operator== -

    -     		-

    - Compare two addresses for equality. -

    -
    -

    - operator> -

    -     		-

    - Compare addresses for ordering. -

    -
    -

    - operator>= -

    -     		-

    - Compare addresses for ordering. -

    -
    -
    - - Related - Functions -
    -
    ---- - - - - - - - - - - - - - - - - - - -
    -

    - Name -

    -     		-

    - Description -

    -
    -

    - make_address_v6 -

    -     		-

    - Create an IPv6 address from raw bytes and scope ID. -

    -

    - Create an IPv6 address from an IP address string. -

    -

    - Createan IPv6 address from an IP address string. -

    -

    - Create an IPv4-mapped IPv6 address from an IPv4 address. -

    -
    -

    - make_network_v6 -

    -     		-

    - Create an IPv6 network from an address and prefix length. -

    -
    -

    - operator<< -

    -     		-

    - Output an address as a string. -

    -

    - Output a network as a string. -

    -
    -

    - The ip::address_v6 - class provides the ability to use and manipulate IP version 6 addresses. -

    -
    - - Thread - Safety -
    -

    - Distinct objects: Safe. -

    -

    - Shared objects: Unsafe. -

    -
    - Requirements

    @@ -578,7 +46,7 @@ An input

    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__address_v6_range.html b/doc/html/boost_asio/reference/ip__address_v6_range.html index e656f0bb28..829469b424 100644 --- a/doc/html/boost_asio/reference/ip__address_v6_range.html +++ b/doc/html/boost_asio/reference/ip__address_v6_range.html @@ -35,538 +35,6 @@ Represents a
    - Types -
    -
    ---- - - - - - - - - -
    -

    - Name -

    -     		-

    - Description -

    -
    -

    - bytes_type -

    -     		-

    - The type used to represent an address as an array of bytes. -

    -
    -
    - - Member - Functions -
    -
    ---- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
    -

    - Name -

    -     		-

    - Description -

    -
    -

    - address_v6 -

    -     		-

    - Default constructor. -

    -

    - Construct an address from raw bytes and scope ID. -

    -

    - Copy constructor. -

    -
    -

    - any -

    -     		-

    - Obtain an address object that represents any address. -

    -
    -

    - from_string -

    -     		-

    - (Deprecated: Use make_address_v6().) Create an IPv6 address from - an IP address string. -

    -
    -

    - is_link_local -

    -     		-

    - Determine whether the address is link local. -

    -
    -

    - is_loopback -

    -     		-

    - Determine whether the address is a loopback address. -

    -
    -

    - is_multicast -

    -     		-

    - Determine whether the address is a multicast address. -

    -
    -

    - is_multicast_global -

    -     		-

    - Determine whether the address is a global multicast address. -

    -
    -

    - is_multicast_link_local -

    -     		-

    - Determine whether the address is a link-local multicast address. -

    -
    -

    - is_multicast_node_local -

    -     		-

    - Determine whether the address is a node-local multicast address. -

    -
    -

    - is_multicast_org_local -

    -     		-

    - Determine whether the address is a org-local multicast address. -

    -
    -

    - is_multicast_site_local -

    -     		-

    - Determine whether the address is a site-local multicast address. -

    -
    -

    - is_site_local -

    -     		-

    - Determine whether the address is site local. -

    -
    -

    - is_unspecified -

    -     		-

    - Determine whether the address is unspecified. -

    -
    -

    - is_v4_compatible -

    -     		-

    - (Deprecated: No replacement.) Determine whether the address is - an IPv4-compatible address. -

    -
    -

    - is_v4_mapped -

    -     		-

    - Determine whether the address is a mapped IPv4 address. -

    -
    -

    - loopback -

    -     		-

    - Obtain an address object that represents the loopback address. -

    -
    -

    - operator= -

    -     		-

    - Assign from another address. -

    -
    -

    - scope_id -

    -     		-

    - The scope ID of the address. -

    -
    -

    - to_bytes -

    -     		-

    - Get the address in bytes, in network byte order. -

    -
    -

    - to_string -

    -     		-

    - Get the address as a string. -

    -

    - (Deprecated: Use other overload.) Get the address as a string. -

    -
    -

    - to_v4 -

    -     		-

    - (Deprecated: Use make_address_v4().) Converts an IPv4-mapped or - IPv4-compatible address to an IPv4 address. -

    -
    -

    - v4_compatible -

    -     		-

    - (Deprecated: No replacement.) Create an IPv4-compatible IPv6 address. -

    -
    -

    - v4_mapped -

    -     		-

    - (Deprecated: Use make_address_v6().) Create an IPv4-mapped IPv6 - address. -

    -
    -
    - - Friends -
    -
    ---- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
    -

    - Name -

    -     		-

    - Description -

    -
    -

    - operator!= -

    -     		-

    - Compare two addresses for inequality. -

    -
    -

    - operator< -

    -     		-

    - Compare addresses for ordering. -

    -
    -

    - operator<= -

    -     		-

    - Compare addresses for ordering. -

    -
    -

    - operator== -

    -     		-

    - Compare two addresses for equality. -

    -
    -

    - operator> -

    -     		-

    - Compare addresses for ordering. -

    -
    -

    - operator>= -

    -     		-

    - Compare addresses for ordering. -

    -
    -
    - - Related - Functions -
    -
    ---- - - - - - - - - - - - - - - - - - - -
    -

    - Name -

    -     		-

    - Description -

    -
    -

    - make_address_v6 -

    -     		-

    - Create an IPv6 address from raw bytes and scope ID. -

    -

    - Create an IPv6 address from an IP address string. -

    -

    - Createan IPv6 address from an IP address string. -

    -

    - Create an IPv4-mapped IPv6 address from an IPv4 address. -

    -
    -

    - make_network_v6 -

    -     		-

    - Create an IPv6 network from an address and prefix length. -

    -
    -

    - operator<< -

    -     		-

    - Output an address as a string. -

    -

    - Output a network as a string. -

    -
    -

    - The ip::address_v6 - class provides the ability to use and manipulate IP version 6 addresses. -

    -
    - - Thread - Safety -
    -

    - Distinct objects: Safe. -

    -

    - Shared objects: Unsafe. -

    -
    - Requirements

    @@ -578,7 +46,7 @@ Represents a

    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__bad_address_cast.html b/doc/html/boost_asio/reference/ip__bad_address_cast.html index 27aa0d77e9..939624579a 100644 --- a/doc/html/boost_asio/reference/ip__bad_address_cast.html +++ b/doc/html/boost_asio/reference/ip__bad_address_cast.html @@ -105,7 +105,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__bad_address_cast/_bad_address_cast.html b/doc/html/boost_asio/reference/ip__bad_address_cast/_bad_address_cast.html index d7981995ee..b6b3c8eb82 100644 --- a/doc/html/boost_asio/reference/ip__bad_address_cast/_bad_address_cast.html +++ b/doc/html/boost_asio/reference/ip__bad_address_cast/_bad_address_cast.html @@ -35,7 +35,7 @@ Destructor.
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__bad_address_cast/bad_address_cast.html b/doc/html/boost_asio/reference/ip__bad_address_cast/bad_address_cast.html index feb414b4ce..36926af82e 100644 --- a/doc/html/boost_asio/reference/ip__bad_address_cast/bad_address_cast.html +++ b/doc/html/boost_asio/reference/ip__bad_address_cast/bad_address_cast.html @@ -36,7 +36,7 @@ Default
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__bad_address_cast/what.html b/doc/html/boost_asio/reference/ip__bad_address_cast/what.html index cc4c51dd10..ddd1b4950d 100644 --- a/doc/html/boost_asio/reference/ip__bad_address_cast/what.html +++ b/doc/html/boost_asio/reference/ip__bad_address_cast/what.html @@ -36,7 +36,7 @@ Get
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_address_iterator_lt__address_v4__gt_.html b/doc/html/boost_asio/reference/ip__basic_address_iterator_lt__address_v4__gt_.html index 870299335b..efb4ce9ece 100644 --- a/doc/html/boost_asio/reference/ip__basic_address_iterator_lt__address_v4__gt_.html +++ b/doc/html/boost_asio/reference/ip__basic_address_iterator_lt__address_v4__gt_.html @@ -299,7 +299,7 @@ class basic_address_iterator< address_v4 >
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_address_iterator_lt__address_v4__gt_/basic_address_iterator.html b/doc/html/boost_asio/reference/ip__basic_address_iterator_lt__address_v4__gt_/basic_address_iterator.html index 23b8fad707..d983800b7f 100644 --- a/doc/html/boost_asio/reference/ip__basic_address_iterator_lt__address_v4__gt_/basic_address_iterator.html +++ b/doc/html/boost_asio/reference/ip__basic_address_iterator_lt__address_v4__gt_/basic_address_iterator.html @@ -45,7 +45,7 @@ Construct an iterator that points to the specified address.
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_address_iterator_lt__address_v4__gt_/basic_address_iterator/overload1.html b/doc/html/boost_asio/reference/ip__basic_address_iterator_lt__address_v4__gt_/basic_address_iterator/overload1.html index 08c316e315..475abdbb19 100644 --- a/doc/html/boost_asio/reference/ip__basic_address_iterator_lt__address_v4__gt_/basic_address_iterator/overload1.html +++ b/doc/html/boost_asio/reference/ip__basic_address_iterator_lt__address_v4__gt_/basic_address_iterator/overload1.html @@ -36,7 +36,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_address_iterator_lt__address_v4__gt_/basic_address_iterator/overload2.html b/doc/html/boost_asio/reference/ip__basic_address_iterator_lt__address_v4__gt_/basic_address_iterator/overload2.html index 2ab869cd68..755da26105 100644 --- a/doc/html/boost_asio/reference/ip__basic_address_iterator_lt__address_v4__gt_/basic_address_iterator/overload2.html +++ b/doc/html/boost_asio/reference/ip__basic_address_iterator_lt__address_v4__gt_/basic_address_iterator/overload2.html @@ -36,7 +36,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_address_iterator_lt__address_v4__gt_/difference_type.html b/doc/html/boost_asio/reference/ip__basic_address_iterator_lt__address_v4__gt_/difference_type.html index b415875c55..3741b48069 100644 --- a/doc/html/boost_asio/reference/ip__basic_address_iterator_lt__address_v4__gt_/difference_type.html +++ b/doc/html/boost_asio/reference/ip__basic_address_iterator_lt__address_v4__gt_/difference_type.html @@ -46,7 +46,7 @@ Distance between two iterators.
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_address_iterator_lt__address_v4__gt_/iterator_category.html b/doc/html/boost_asio/reference/ip__basic_address_iterator_lt__address_v4__gt_/iterator_category.html index cf2c89b103..e8d107bf68 100644 --- a/doc/html/boost_asio/reference/ip__basic_address_iterator_lt__address_v4__gt_/iterator_category.html +++ b/doc/html/boost_asio/reference/ip__basic_address_iterator_lt__address_v4__gt_/iterator_category.html @@ -46,7 +46,7 @@ Denotes that the iterator satisfies the input iterator requirements.
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_address_iterator_lt__address_v4__gt_/operator__star_.html b/doc/html/boost_asio/reference/ip__basic_address_iterator_lt__address_v4__gt_/operator__star_.html index 865083852c..0603533f4c 100644 --- a/doc/html/boost_asio/reference/ip__basic_address_iterator_lt__address_v4__gt_/operator__star_.html +++ b/doc/html/boost_asio/reference/ip__basic_address_iterator_lt__address_v4__gt_/operator__star_.html @@ -36,7 +36,7 @@ Dereference the iterator.
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_address_iterator_lt__address_v4__gt_/operator_arrow_.html b/doc/html/boost_asio/reference/ip__basic_address_iterator_lt__address_v4__gt_/operator_arrow_.html index a587ef44b6..ac431b435f 100644 --- a/doc/html/boost_asio/reference/ip__basic_address_iterator_lt__address_v4__gt_/operator_arrow_.html +++ b/doc/html/boost_asio/reference/ip__basic_address_iterator_lt__address_v4__gt_/operator_arrow_.html @@ -36,7 +36,7 @@ Dereference the iterator.
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_address_iterator_lt__address_v4__gt_/operator_eq_.html b/doc/html/boost_asio/reference/ip__basic_address_iterator_lt__address_v4__gt_/operator_eq_.html index 73eadb9660..27d51e4cc7 100644 --- a/doc/html/boost_asio/reference/ip__basic_address_iterator_lt__address_v4__gt_/operator_eq_.html +++ b/doc/html/boost_asio/reference/ip__basic_address_iterator_lt__address_v4__gt_/operator_eq_.html @@ -37,7 +37,7 @@ Assignment operator.
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_address_iterator_lt__address_v4__gt_/operator_eq__eq_.html b/doc/html/boost_asio/reference/ip__basic_address_iterator_lt__address_v4__gt_/operator_eq__eq_.html index d49384342d..84da33639f 100644 --- a/doc/html/boost_asio/reference/ip__basic_address_iterator_lt__address_v4__gt_/operator_eq__eq_.html +++ b/doc/html/boost_asio/reference/ip__basic_address_iterator_lt__address_v4__gt_/operator_eq__eq_.html @@ -48,7 +48,7 @@ Compare two addresses for equality.
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_address_iterator_lt__address_v4__gt_/operator_minus__minus_.html b/doc/html/boost_asio/reference/ip__basic_address_iterator_lt__address_v4__gt_/operator_minus__minus_.html index 75e34b16cf..078cf41e2c 100644 --- a/doc/html/boost_asio/reference/ip__basic_address_iterator_lt__address_v4__gt_/operator_minus__minus_.html +++ b/doc/html/boost_asio/reference/ip__basic_address_iterator_lt__address_v4__gt_/operator_minus__minus_.html @@ -44,7 +44,7 @@ Pre-decrement operator.
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_address_iterator_lt__address_v4__gt_/operator_minus__minus_/overload1.html b/doc/html/boost_asio/reference/ip__basic_address_iterator_lt__address_v4__gt_/operator_minus__minus_/overload1.html index 11ad6c9f71..0ea79b1c31 100644 --- a/doc/html/boost_asio/reference/ip__basic_address_iterator_lt__address_v4__gt_/operator_minus__minus_/overload1.html +++ b/doc/html/boost_asio/reference/ip__basic_address_iterator_lt__address_v4__gt_/operator_minus__minus_/overload1.html @@ -35,7 +35,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_address_iterator_lt__address_v4__gt_/operator_minus__minus_/overload2.html b/doc/html/boost_asio/reference/ip__basic_address_iterator_lt__address_v4__gt_/operator_minus__minus_/overload2.html index e3de15a423..cbc94ef945 100644 --- a/doc/html/boost_asio/reference/ip__basic_address_iterator_lt__address_v4__gt_/operator_minus__minus_/overload2.html +++ b/doc/html/boost_asio/reference/ip__basic_address_iterator_lt__address_v4__gt_/operator_minus__minus_/overload2.html @@ -36,7 +36,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_address_iterator_lt__address_v4__gt_/operator_not__eq_.html b/doc/html/boost_asio/reference/ip__basic_address_iterator_lt__address_v4__gt_/operator_not__eq_.html index 104e07a322..270f3711eb 100644 --- a/doc/html/boost_asio/reference/ip__basic_address_iterator_lt__address_v4__gt_/operator_not__eq_.html +++ b/doc/html/boost_asio/reference/ip__basic_address_iterator_lt__address_v4__gt_/operator_not__eq_.html @@ -48,7 +48,7 @@ Compare two addresses for inequality.
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_address_iterator_lt__address_v4__gt_/operator_plus__plus_.html b/doc/html/boost_asio/reference/ip__basic_address_iterator_lt__address_v4__gt_/operator_plus__plus_.html index 05732eee68..26ba31b49d 100644 --- a/doc/html/boost_asio/reference/ip__basic_address_iterator_lt__address_v4__gt_/operator_plus__plus_.html +++ b/doc/html/boost_asio/reference/ip__basic_address_iterator_lt__address_v4__gt_/operator_plus__plus_.html @@ -44,7 +44,7 @@ Pre-increment operator.
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_address_iterator_lt__address_v4__gt_/operator_plus__plus_/overload1.html b/doc/html/boost_asio/reference/ip__basic_address_iterator_lt__address_v4__gt_/operator_plus__plus_/overload1.html index 69ce6afe91..052ae052ff 100644 --- a/doc/html/boost_asio/reference/ip__basic_address_iterator_lt__address_v4__gt_/operator_plus__plus_/overload1.html +++ b/doc/html/boost_asio/reference/ip__basic_address_iterator_lt__address_v4__gt_/operator_plus__plus_/overload1.html @@ -35,7 +35,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_address_iterator_lt__address_v4__gt_/operator_plus__plus_/overload2.html b/doc/html/boost_asio/reference/ip__basic_address_iterator_lt__address_v4__gt_/operator_plus__plus_/overload2.html index 79ae76576f..5f4b1a50c0 100644 --- a/doc/html/boost_asio/reference/ip__basic_address_iterator_lt__address_v4__gt_/operator_plus__plus_/overload2.html +++ b/doc/html/boost_asio/reference/ip__basic_address_iterator_lt__address_v4__gt_/operator_plus__plus_/overload2.html @@ -36,7 +36,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_address_iterator_lt__address_v4__gt_/pointer.html b/doc/html/boost_asio/reference/ip__basic_address_iterator_lt__address_v4__gt_/pointer.html index 8426894381..7af39f06da 100644 --- a/doc/html/boost_asio/reference/ip__basic_address_iterator_lt__address_v4__gt_/pointer.html +++ b/doc/html/boost_asio/reference/ip__basic_address_iterator_lt__address_v4__gt_/pointer.html @@ -46,7 +46,7 @@ The type of a pointer to an element pointed to by the iterator.
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_address_iterator_lt__address_v4__gt_/reference.html b/doc/html/boost_asio/reference/ip__basic_address_iterator_lt__address_v4__gt_/reference.html index 1e98b3a5ed..0a78bf1980 100644 --- a/doc/html/boost_asio/reference/ip__basic_address_iterator_lt__address_v4__gt_/reference.html +++ b/doc/html/boost_asio/reference/ip__basic_address_iterator_lt__address_v4__gt_/reference.html @@ -536,7 +536,7 @@ The type of a reference to an element pointed to by the
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_address_iterator_lt__address_v4__gt_/value_type.html b/doc/html/boost_asio/reference/ip__basic_address_iterator_lt__address_v4__gt_/value_type.html index 93b2a8ea9f..bdc047c186 100644 --- a/doc/html/boost_asio/reference/ip__basic_address_iterator_lt__address_v4__gt_/value_type.html +++ b/doc/html/boost_asio/reference/ip__basic_address_iterator_lt__address_v4__gt_/value_type.html @@ -535,7 +535,7 @@ The type of the elements pointed to by the iterator.
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_address_iterator_lt__address_v6__gt_.html b/doc/html/boost_asio/reference/ip__basic_address_iterator_lt__address_v6__gt_.html index 7eefdbd1a6..82eb0e746a 100644 --- a/doc/html/boost_asio/reference/ip__basic_address_iterator_lt__address_v6__gt_.html +++ b/doc/html/boost_asio/reference/ip__basic_address_iterator_lt__address_v6__gt_.html @@ -299,7 +299,7 @@ class basic_address_iterator< address_v6 >
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_address_iterator_lt__address_v6__gt_/basic_address_iterator.html b/doc/html/boost_asio/reference/ip__basic_address_iterator_lt__address_v6__gt_/basic_address_iterator.html index f7d0a3995b..403673c677 100644 --- a/doc/html/boost_asio/reference/ip__basic_address_iterator_lt__address_v6__gt_/basic_address_iterator.html +++ b/doc/html/boost_asio/reference/ip__basic_address_iterator_lt__address_v6__gt_/basic_address_iterator.html @@ -45,7 +45,7 @@ Construct an iterator that points to the specified address.
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_address_iterator_lt__address_v6__gt_/basic_address_iterator/overload1.html b/doc/html/boost_asio/reference/ip__basic_address_iterator_lt__address_v6__gt_/basic_address_iterator/overload1.html index 62a43c3e80..859b5f2858 100644 --- a/doc/html/boost_asio/reference/ip__basic_address_iterator_lt__address_v6__gt_/basic_address_iterator/overload1.html +++ b/doc/html/boost_asio/reference/ip__basic_address_iterator_lt__address_v6__gt_/basic_address_iterator/overload1.html @@ -36,7 +36,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_address_iterator_lt__address_v6__gt_/basic_address_iterator/overload2.html b/doc/html/boost_asio/reference/ip__basic_address_iterator_lt__address_v6__gt_/basic_address_iterator/overload2.html index 56bdff7e3d..4bc844639a 100644 --- a/doc/html/boost_asio/reference/ip__basic_address_iterator_lt__address_v6__gt_/basic_address_iterator/overload2.html +++ b/doc/html/boost_asio/reference/ip__basic_address_iterator_lt__address_v6__gt_/basic_address_iterator/overload2.html @@ -36,7 +36,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_address_iterator_lt__address_v6__gt_/difference_type.html b/doc/html/boost_asio/reference/ip__basic_address_iterator_lt__address_v6__gt_/difference_type.html index 8f0a1fd975..ae3973693c 100644 --- a/doc/html/boost_asio/reference/ip__basic_address_iterator_lt__address_v6__gt_/difference_type.html +++ b/doc/html/boost_asio/reference/ip__basic_address_iterator_lt__address_v6__gt_/difference_type.html @@ -46,7 +46,7 @@ Distance between two iterators.
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_address_iterator_lt__address_v6__gt_/iterator_category.html b/doc/html/boost_asio/reference/ip__basic_address_iterator_lt__address_v6__gt_/iterator_category.html index 161e4b3c09..e8063fc615 100644 --- a/doc/html/boost_asio/reference/ip__basic_address_iterator_lt__address_v6__gt_/iterator_category.html +++ b/doc/html/boost_asio/reference/ip__basic_address_iterator_lt__address_v6__gt_/iterator_category.html @@ -46,7 +46,7 @@ Denotes that the iterator satisfies the input iterator requirements.
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_address_iterator_lt__address_v6__gt_/operator__star_.html b/doc/html/boost_asio/reference/ip__basic_address_iterator_lt__address_v6__gt_/operator__star_.html index f8b1c51c3a..db9128ebe5 100644 --- a/doc/html/boost_asio/reference/ip__basic_address_iterator_lt__address_v6__gt_/operator__star_.html +++ b/doc/html/boost_asio/reference/ip__basic_address_iterator_lt__address_v6__gt_/operator__star_.html @@ -36,7 +36,7 @@ Dereference the iterator.
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_address_iterator_lt__address_v6__gt_/operator_arrow_.html b/doc/html/boost_asio/reference/ip__basic_address_iterator_lt__address_v6__gt_/operator_arrow_.html index 7867c54f19..37496f8139 100644 --- a/doc/html/boost_asio/reference/ip__basic_address_iterator_lt__address_v6__gt_/operator_arrow_.html +++ b/doc/html/boost_asio/reference/ip__basic_address_iterator_lt__address_v6__gt_/operator_arrow_.html @@ -36,7 +36,7 @@ Dereference the iterator.
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_address_iterator_lt__address_v6__gt_/operator_eq_.html b/doc/html/boost_asio/reference/ip__basic_address_iterator_lt__address_v6__gt_/operator_eq_.html index 1e123dec74..1bc49ae626 100644 --- a/doc/html/boost_asio/reference/ip__basic_address_iterator_lt__address_v6__gt_/operator_eq_.html +++ b/doc/html/boost_asio/reference/ip__basic_address_iterator_lt__address_v6__gt_/operator_eq_.html @@ -37,7 +37,7 @@ Assignment operator.
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_address_iterator_lt__address_v6__gt_/operator_eq__eq_.html b/doc/html/boost_asio/reference/ip__basic_address_iterator_lt__address_v6__gt_/operator_eq__eq_.html index 8fa42b770b..eb2c19834b 100644 --- a/doc/html/boost_asio/reference/ip__basic_address_iterator_lt__address_v6__gt_/operator_eq__eq_.html +++ b/doc/html/boost_asio/reference/ip__basic_address_iterator_lt__address_v6__gt_/operator_eq__eq_.html @@ -48,7 +48,7 @@ Compare two addresses for equality.
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_address_iterator_lt__address_v6__gt_/operator_minus__minus_.html b/doc/html/boost_asio/reference/ip__basic_address_iterator_lt__address_v6__gt_/operator_minus__minus_.html index f827229790..b56f4983d0 100644 --- a/doc/html/boost_asio/reference/ip__basic_address_iterator_lt__address_v6__gt_/operator_minus__minus_.html +++ b/doc/html/boost_asio/reference/ip__basic_address_iterator_lt__address_v6__gt_/operator_minus__minus_.html @@ -44,7 +44,7 @@ Pre-decrement operator.
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_address_iterator_lt__address_v6__gt_/operator_minus__minus_/overload1.html b/doc/html/boost_asio/reference/ip__basic_address_iterator_lt__address_v6__gt_/operator_minus__minus_/overload1.html index 775df57dbc..f9f1b93e06 100644 --- a/doc/html/boost_asio/reference/ip__basic_address_iterator_lt__address_v6__gt_/operator_minus__minus_/overload1.html +++ b/doc/html/boost_asio/reference/ip__basic_address_iterator_lt__address_v6__gt_/operator_minus__minus_/overload1.html @@ -35,7 +35,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_address_iterator_lt__address_v6__gt_/operator_minus__minus_/overload2.html b/doc/html/boost_asio/reference/ip__basic_address_iterator_lt__address_v6__gt_/operator_minus__minus_/overload2.html index 36a3ef4a5f..fe92b24a61 100644 --- a/doc/html/boost_asio/reference/ip__basic_address_iterator_lt__address_v6__gt_/operator_minus__minus_/overload2.html +++ b/doc/html/boost_asio/reference/ip__basic_address_iterator_lt__address_v6__gt_/operator_minus__minus_/overload2.html @@ -36,7 +36,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_address_iterator_lt__address_v6__gt_/operator_not__eq_.html b/doc/html/boost_asio/reference/ip__basic_address_iterator_lt__address_v6__gt_/operator_not__eq_.html index 26fa94fe84..1c2af0aec3 100644 --- a/doc/html/boost_asio/reference/ip__basic_address_iterator_lt__address_v6__gt_/operator_not__eq_.html +++ b/doc/html/boost_asio/reference/ip__basic_address_iterator_lt__address_v6__gt_/operator_not__eq_.html @@ -48,7 +48,7 @@ Compare two addresses for inequality.
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_address_iterator_lt__address_v6__gt_/operator_plus__plus_.html b/doc/html/boost_asio/reference/ip__basic_address_iterator_lt__address_v6__gt_/operator_plus__plus_.html index 734ac81cab..ba6d93172c 100644 --- a/doc/html/boost_asio/reference/ip__basic_address_iterator_lt__address_v6__gt_/operator_plus__plus_.html +++ b/doc/html/boost_asio/reference/ip__basic_address_iterator_lt__address_v6__gt_/operator_plus__plus_.html @@ -44,7 +44,7 @@ Pre-increment operator.
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_address_iterator_lt__address_v6__gt_/operator_plus__plus_/overload1.html b/doc/html/boost_asio/reference/ip__basic_address_iterator_lt__address_v6__gt_/operator_plus__plus_/overload1.html index 13e63e4eb6..ce04e54f72 100644 --- a/doc/html/boost_asio/reference/ip__basic_address_iterator_lt__address_v6__gt_/operator_plus__plus_/overload1.html +++ b/doc/html/boost_asio/reference/ip__basic_address_iterator_lt__address_v6__gt_/operator_plus__plus_/overload1.html @@ -35,7 +35,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_address_iterator_lt__address_v6__gt_/operator_plus__plus_/overload2.html b/doc/html/boost_asio/reference/ip__basic_address_iterator_lt__address_v6__gt_/operator_plus__plus_/overload2.html index 67660d99ac..f7b778577f 100644 --- a/doc/html/boost_asio/reference/ip__basic_address_iterator_lt__address_v6__gt_/operator_plus__plus_/overload2.html +++ b/doc/html/boost_asio/reference/ip__basic_address_iterator_lt__address_v6__gt_/operator_plus__plus_/overload2.html @@ -36,7 +36,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_address_iterator_lt__address_v6__gt_/pointer.html b/doc/html/boost_asio/reference/ip__basic_address_iterator_lt__address_v6__gt_/pointer.html index 7fbfb77e52..9ade470ee1 100644 --- a/doc/html/boost_asio/reference/ip__basic_address_iterator_lt__address_v6__gt_/pointer.html +++ b/doc/html/boost_asio/reference/ip__basic_address_iterator_lt__address_v6__gt_/pointer.html @@ -46,7 +46,7 @@ The type of a pointer to an element pointed to by the iterator.
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_address_iterator_lt__address_v6__gt_/reference.html b/doc/html/boost_asio/reference/ip__basic_address_iterator_lt__address_v6__gt_/reference.html index 4c44918473..7ace2bb157 100644 --- a/doc/html/boost_asio/reference/ip__basic_address_iterator_lt__address_v6__gt_/reference.html +++ b/doc/html/boost_asio/reference/ip__basic_address_iterator_lt__address_v6__gt_/reference.html @@ -580,7 +580,7 @@ The type of a reference to an element pointed to by the
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_address_iterator_lt__address_v6__gt_/value_type.html b/doc/html/boost_asio/reference/ip__basic_address_iterator_lt__address_v6__gt_/value_type.html index 3b3eb38fcb..941cd9aade 100644 --- a/doc/html/boost_asio/reference/ip__basic_address_iterator_lt__address_v6__gt_/value_type.html +++ b/doc/html/boost_asio/reference/ip__basic_address_iterator_lt__address_v6__gt_/value_type.html @@ -579,7 +579,7 @@ The type of the elements pointed to by the iterator.
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_address_range_lt__address_v4__gt_.html b/doc/html/boost_asio/reference/ip__basic_address_range_lt__address_v4__gt_.html index c6dad661d4..752744753c 100644 --- a/doc/html/boost_asio/reference/ip__basic_address_range_lt__address_v4__gt_.html +++ b/doc/html/boost_asio/reference/ip__basic_address_range_lt__address_v4__gt_.html @@ -206,7 +206,7 @@ class basic_address_range< address_v4 >
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_address_range_lt__address_v4__gt_/basic_address_range.html b/doc/html/boost_asio/reference/ip__basic_address_range_lt__address_v4__gt_/basic_address_range.html index e11f55b0e5..88dc618fec 100644 --- a/doc/html/boost_asio/reference/ip__basic_address_range_lt__address_v4__gt_/basic_address_range.html +++ b/doc/html/boost_asio/reference/ip__basic_address_range_lt__address_v4__gt_/basic_address_range.html @@ -52,7 +52,7 @@ Construct an empty range.
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_address_range_lt__address_v4__gt_/basic_address_range/overload1.html b/doc/html/boost_asio/reference/ip__basic_address_range_lt__address_v4__gt_/basic_address_range/overload1.html index 4f516c217b..d45fab2ee1 100644 --- a/doc/html/boost_asio/reference/ip__basic_address_range_lt__address_v4__gt_/basic_address_range/overload1.html +++ b/doc/html/boost_asio/reference/ip__basic_address_range_lt__address_v4__gt_/basic_address_range/overload1.html @@ -35,7 +35,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_address_range_lt__address_v4__gt_/basic_address_range/overload2.html b/doc/html/boost_asio/reference/ip__basic_address_range_lt__address_v4__gt_/basic_address_range/overload2.html index c27888440e..952f260403 100644 --- a/doc/html/boost_asio/reference/ip__basic_address_range_lt__address_v4__gt_/basic_address_range/overload2.html +++ b/doc/html/boost_asio/reference/ip__basic_address_range_lt__address_v4__gt_/basic_address_range/overload2.html @@ -37,7 +37,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_address_range_lt__address_v4__gt_/basic_address_range/overload3.html b/doc/html/boost_asio/reference/ip__basic_address_range_lt__address_v4__gt_/basic_address_range/overload3.html index e89ac64279..06f5c8938f 100644 --- a/doc/html/boost_asio/reference/ip__basic_address_range_lt__address_v4__gt_/basic_address_range/overload3.html +++ b/doc/html/boost_asio/reference/ip__basic_address_range_lt__address_v4__gt_/basic_address_range/overload3.html @@ -36,7 +36,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_address_range_lt__address_v4__gt_/begin.html b/doc/html/boost_asio/reference/ip__basic_address_range_lt__address_v4__gt_/begin.html index da2c270ccc..a538ad1dfb 100644 --- a/doc/html/boost_asio/reference/ip__basic_address_range_lt__address_v4__gt_/begin.html +++ b/doc/html/boost_asio/reference/ip__basic_address_range_lt__address_v4__gt_/begin.html @@ -36,7 +36,7 @@ Obtain an iterator that points to the start of the range.
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_address_range_lt__address_v4__gt_/empty.html b/doc/html/boost_asio/reference/ip__basic_address_range_lt__address_v4__gt_/empty.html index 844f737f01..911252b226 100644 --- a/doc/html/boost_asio/reference/ip__basic_address_range_lt__address_v4__gt_/empty.html +++ b/doc/html/boost_asio/reference/ip__basic_address_range_lt__address_v4__gt_/empty.html @@ -36,7 +36,7 @@ Determine whether the range is empty.
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_address_range_lt__address_v4__gt_/end.html b/doc/html/boost_asio/reference/ip__basic_address_range_lt__address_v4__gt_/end.html index a452d8e9de..d8499b9f7a 100644 --- a/doc/html/boost_asio/reference/ip__basic_address_range_lt__address_v4__gt_/end.html +++ b/doc/html/boost_asio/reference/ip__basic_address_range_lt__address_v4__gt_/end.html @@ -36,7 +36,7 @@ Obtain an iterator that points to the end of the range.
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_address_range_lt__address_v4__gt_/find.html b/doc/html/boost_asio/reference/ip__basic_address_range_lt__address_v4__gt_/find.html index 6483f3d7a1..d0576415c8 100644 --- a/doc/html/boost_asio/reference/ip__basic_address_range_lt__address_v4__gt_/find.html +++ b/doc/html/boost_asio/reference/ip__basic_address_range_lt__address_v4__gt_/find.html @@ -37,7 +37,7 @@ Find an address in the range.
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_address_range_lt__address_v4__gt_/iterator.html b/doc/html/boost_asio/reference/ip__basic_address_range_lt__address_v4__gt_/iterator.html index 0b0ecd19d7..b9439fdd1e 100644 --- a/doc/html/boost_asio/reference/ip__basic_address_range_lt__address_v4__gt_/iterator.html +++ b/doc/html/boost_asio/reference/ip__basic_address_range_lt__address_v4__gt_/iterator.html @@ -35,495 +35,6 @@ The type of an iterator that points into the range.
    - Types -
    -
    ---- - - - - - - - - - - - - - - -
    -

    - Name -

    -     		-

    - Description -

    -
    -

    - bytes_type -

    -     		-

    - The type used to represent an address as an array of bytes. -

    -
    -

    - uint_type -

    -     		-

    - The type used to represent an address as an unsigned integer. -

    -
    -
    - - Member - Functions -
    -
    ---- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
    -

    - Name -

    -     		-

    - Description -

    -
    -

    - address_v4 -

    -     		-

    - Default constructor. -

    -

    - Construct an address from raw bytes. -

    -

    - Construct an address from an unsigned integer in host byte order. -

    -

    - Copy constructor. -

    -
    -

    - any -

    -     		-

    - Obtain an address object that represents any address. -

    -
    -

    - broadcast -

    -     		-

    - Obtain an address object that represents the broadcast address. -

    -

    - (Deprecated: Use network_v4 class.) Obtain an address object - that represents the broadcast address that corresponds to the - specified address and netmask. -

    -
    -

    - from_string -

    -     		-

    - (Deprecated: Use make_address_v4().) Create an address from an - IP address string in dotted decimal form. -

    -
    -

    - is_class_a -

    -     		-

    - (Deprecated: Use network_v4 class.) Determine whether the address - is a class A address. -

    -
    -

    - is_class_b -

    -     		-

    - (Deprecated: Use network_v4 class.) Determine whether the address - is a class B address. -

    -
    -

    - is_class_c -

    -     		-

    - (Deprecated: Use network_v4 class.) Determine whether the address - is a class C address. -

    -
    -

    - is_loopback -

    -     		-

    - Determine whether the address is a loopback address. -

    -
    -

    - is_multicast -

    -     		-

    - Determine whether the address is a multicast address. -

    -
    -

    - is_unspecified -

    -     		-

    - Determine whether the address is unspecified. -

    -
    -

    - loopback -

    -     		-

    - Obtain an address object that represents the loopback address. -

    -
    -

    - netmask -

    -     		-

    - (Deprecated: Use network_v4 class.) Obtain the netmask that corresponds - to the address, based on its address class. -

    -
    -

    - operator= -

    -     		-

    - Assign from another address. -

    -
    -

    - to_bytes -

    -     		-

    - Get the address in bytes, in network byte order. -

    -
    -

    - to_string -

    -     		-

    - Get the address as a string in dotted decimal format. -

    -

    - (Deprecated: Use other overload.) Get the address as a string - in dotted decimal format. -

    -
    -

    - to_uint -

    -     		-

    - Get the address as an unsigned integer in host byte order. -

    -
    -

    - to_ulong -

    -     		-

    - Get the address as an unsigned long in host byte order. -

    -
    -
    - - Friends -
    -
    ---- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
    -

    - Name -

    -     		-

    - Description -

    -
    -

    - operator!= -

    -     		-

    - Compare two addresses for inequality. -

    -
    -

    - operator< -

    -     		-

    - Compare addresses for ordering. -

    -
    -

    - operator<= -

    -     		-

    - Compare addresses for ordering. -

    -
    -

    - operator== -

    -     		-

    - Compare two addresses for equality. -

    -
    -

    - operator> -

    -     		-

    - Compare addresses for ordering. -

    -
    -

    - operator>= -

    -     		-

    - Compare addresses for ordering. -

    -
    -
    - - Related - Functions -
    -
    ---- - - - - - - - - - - - - - - - - - - -
    -

    - Name -

    -     		-

    - Description -

    -
    -

    - make_address_v4 -

    -     		-

    - Create an IPv4 address from raw bytes in network order. -

    -

    - Create an IPv4 address from an unsigned integer in host byte - order. -

    -

    - Create an IPv4 address from an IP address string in dotted decimal - form. -

    -

    - Create an IPv4 address from a IPv4-mapped IPv6 address. -

    -
    -

    - make_network_v4 -

    -     		-

    - Create an IPv4 network from an address and prefix length. -

    -

    - Create an IPv4 network from an address and netmask. -

    -
    -

    - operator<< -

    -     		-

    - Output an address as a string. -

    -

    - Output a network as a string. -

    -
    -

    - The ip::address_v4 - class provides the ability to use and manipulate IP version 4 addresses. -

    -
    - - Thread - Safety -
    -

    - Distinct objects: Safe. -

    -

    - Shared objects: Unsafe. -

    -
    - Requirements

    @@ -535,7 +46,7 @@ The type of an iterator that points into the range.

    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_address_range_lt__address_v4__gt_/operator_eq_.html b/doc/html/boost_asio/reference/ip__basic_address_range_lt__address_v4__gt_/operator_eq_.html index d83df70659..da8d54da28 100644 --- a/doc/html/boost_asio/reference/ip__basic_address_range_lt__address_v4__gt_/operator_eq_.html +++ b/doc/html/boost_asio/reference/ip__basic_address_range_lt__address_v4__gt_/operator_eq_.html @@ -37,7 +37,7 @@ Assignment operator.
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_address_range_lt__address_v4__gt_/size.html b/doc/html/boost_asio/reference/ip__basic_address_range_lt__address_v4__gt_/size.html index ff98e89fd2..3aa75af151 100644 --- a/doc/html/boost_asio/reference/ip__basic_address_range_lt__address_v4__gt_/size.html +++ b/doc/html/boost_asio/reference/ip__basic_address_range_lt__address_v4__gt_/size.html @@ -36,7 +36,7 @@ Return the size of the range.
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_address_range_lt__address_v6__gt_.html b/doc/html/boost_asio/reference/ip__basic_address_range_lt__address_v6__gt_.html index d20367189a..fa48033463 100644 --- a/doc/html/boost_asio/reference/ip__basic_address_range_lt__address_v6__gt_.html +++ b/doc/html/boost_asio/reference/ip__basic_address_range_lt__address_v6__gt_.html @@ -194,7 +194,7 @@ class basic_address_range< address_v6 >
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_address_range_lt__address_v6__gt_/basic_address_range.html b/doc/html/boost_asio/reference/ip__basic_address_range_lt__address_v6__gt_/basic_address_range.html index 3755b204d8..c649de6eeb 100644 --- a/doc/html/boost_asio/reference/ip__basic_address_range_lt__address_v6__gt_/basic_address_range.html +++ b/doc/html/boost_asio/reference/ip__basic_address_range_lt__address_v6__gt_/basic_address_range.html @@ -52,7 +52,7 @@ Construct an empty range.
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_address_range_lt__address_v6__gt_/basic_address_range/overload1.html b/doc/html/boost_asio/reference/ip__basic_address_range_lt__address_v6__gt_/basic_address_range/overload1.html index f6c2d67f42..8700f3d41d 100644 --- a/doc/html/boost_asio/reference/ip__basic_address_range_lt__address_v6__gt_/basic_address_range/overload1.html +++ b/doc/html/boost_asio/reference/ip__basic_address_range_lt__address_v6__gt_/basic_address_range/overload1.html @@ -35,7 +35,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_address_range_lt__address_v6__gt_/basic_address_range/overload2.html b/doc/html/boost_asio/reference/ip__basic_address_range_lt__address_v6__gt_/basic_address_range/overload2.html index 38f8597dc8..ce5aaba633 100644 --- a/doc/html/boost_asio/reference/ip__basic_address_range_lt__address_v6__gt_/basic_address_range/overload2.html +++ b/doc/html/boost_asio/reference/ip__basic_address_range_lt__address_v6__gt_/basic_address_range/overload2.html @@ -37,7 +37,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_address_range_lt__address_v6__gt_/basic_address_range/overload3.html b/doc/html/boost_asio/reference/ip__basic_address_range_lt__address_v6__gt_/basic_address_range/overload3.html index c909e14bbe..40c1c30f42 100644 --- a/doc/html/boost_asio/reference/ip__basic_address_range_lt__address_v6__gt_/basic_address_range/overload3.html +++ b/doc/html/boost_asio/reference/ip__basic_address_range_lt__address_v6__gt_/basic_address_range/overload3.html @@ -36,7 +36,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_address_range_lt__address_v6__gt_/begin.html b/doc/html/boost_asio/reference/ip__basic_address_range_lt__address_v6__gt_/begin.html index 3a31710d2f..dfb507a412 100644 --- a/doc/html/boost_asio/reference/ip__basic_address_range_lt__address_v6__gt_/begin.html +++ b/doc/html/boost_asio/reference/ip__basic_address_range_lt__address_v6__gt_/begin.html @@ -36,7 +36,7 @@ Obtain an iterator that points to the start of the range.
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_address_range_lt__address_v6__gt_/empty.html b/doc/html/boost_asio/reference/ip__basic_address_range_lt__address_v6__gt_/empty.html index b21288f66b..e459270bf5 100644 --- a/doc/html/boost_asio/reference/ip__basic_address_range_lt__address_v6__gt_/empty.html +++ b/doc/html/boost_asio/reference/ip__basic_address_range_lt__address_v6__gt_/empty.html @@ -36,7 +36,7 @@ Determine whether the range is empty.
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_address_range_lt__address_v6__gt_/end.html b/doc/html/boost_asio/reference/ip__basic_address_range_lt__address_v6__gt_/end.html index d1858c4ad9..a1a6f6b500 100644 --- a/doc/html/boost_asio/reference/ip__basic_address_range_lt__address_v6__gt_/end.html +++ b/doc/html/boost_asio/reference/ip__basic_address_range_lt__address_v6__gt_/end.html @@ -36,7 +36,7 @@ Obtain an iterator that points to the end of the range.
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_address_range_lt__address_v6__gt_/find.html b/doc/html/boost_asio/reference/ip__basic_address_range_lt__address_v6__gt_/find.html index 5da8d37204..c38468955b 100644 --- a/doc/html/boost_asio/reference/ip__basic_address_range_lt__address_v6__gt_/find.html +++ b/doc/html/boost_asio/reference/ip__basic_address_range_lt__address_v6__gt_/find.html @@ -37,7 +37,7 @@ Find an address in the range.
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_address_range_lt__address_v6__gt_/iterator.html b/doc/html/boost_asio/reference/ip__basic_address_range_lt__address_v6__gt_/iterator.html index b352e1b6e6..208f8a97a6 100644 --- a/doc/html/boost_asio/reference/ip__basic_address_range_lt__address_v6__gt_/iterator.html +++ b/doc/html/boost_asio/reference/ip__basic_address_range_lt__address_v6__gt_/iterator.html @@ -35,539 +35,6 @@ The type of an iterator that points into the range.
    - Types -
    -
    ---- - - - - - - - - -
    -

    - Name -

    -     		-

    - Description -

    -
    -

    - bytes_type -

    -     		-

    - The type used to represent an address as an array of bytes. -

    -
    -
    - - Member - Functions -
    -
    ---- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
    -

    - Name -

    -     		-

    - Description -

    -
    -

    - address_v6 -

    -     		-

    - Default constructor. -

    -

    - Construct an address from raw bytes and scope ID. -

    -

    - Copy constructor. -

    -
    -

    - any -

    -     		-

    - Obtain an address object that represents any address. -

    -
    -

    - from_string -

    -     		-

    - (Deprecated: Use make_address_v6().) Create an IPv6 address from - an IP address string. -

    -
    -

    - is_link_local -

    -     		-

    - Determine whether the address is link local. -

    -
    -

    - is_loopback -

    -     		-

    - Determine whether the address is a loopback address. -

    -
    -

    - is_multicast -

    -     		-

    - Determine whether the address is a multicast address. -

    -
    -

    - is_multicast_global -

    -     		-

    - Determine whether the address is a global multicast address. -

    -
    -

    - is_multicast_link_local -

    -     		-

    - Determine whether the address is a link-local multicast address. -

    -
    -

    - is_multicast_node_local -

    -     		-

    - Determine whether the address is a node-local multicast address. -

    -
    -

    - is_multicast_org_local -

    -     		-

    - Determine whether the address is a org-local multicast address. -

    -
    -

    - is_multicast_site_local -

    -     		-

    - Determine whether the address is a site-local multicast address. -

    -
    -

    - is_site_local -

    -     		-

    - Determine whether the address is site local. -

    -
    -

    - is_unspecified -

    -     		-

    - Determine whether the address is unspecified. -

    -
    -

    - is_v4_compatible -

    -     		-

    - (Deprecated: No replacement.) Determine whether the address is - an IPv4-compatible address. -

    -
    -

    - is_v4_mapped -

    -     		-

    - Determine whether the address is a mapped IPv4 address. -

    -
    -

    - loopback -

    -     		-

    - Obtain an address object that represents the loopback address. -

    -
    -

    - operator= -

    -     		-

    - Assign from another address. -

    -
    -

    - scope_id -

    -     		-

    - The scope ID of the address. -

    -
    -

    - to_bytes -

    -     		-

    - Get the address in bytes, in network byte order. -

    -
    -

    - to_string -

    -     		-

    - Get the address as a string. -

    -

    - (Deprecated: Use other overload.) Get the address as a string. -

    -
    -

    - to_v4 -

    -     		-

    - (Deprecated: Use make_address_v4().) Converts an IPv4-mapped - or IPv4-compatible address to an IPv4 address. -

    -
    -

    - v4_compatible -

    -     		-

    - (Deprecated: No replacement.) Create an IPv4-compatible IPv6 - address. -

    -
    -

    - v4_mapped -

    -     		-

    - (Deprecated: Use make_address_v6().) Create an IPv4-mapped IPv6 - address. -

    -
    -
    - - Friends -
    -
    ---- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
    -

    - Name -

    -     		-

    - Description -

    -
    -

    - operator!= -

    -     		-

    - Compare two addresses for inequality. -

    -
    -

    - operator< -

    -     		-

    - Compare addresses for ordering. -

    -
    -

    - operator<= -

    -     		-

    - Compare addresses for ordering. -

    -
    -

    - operator== -

    -     		-

    - Compare two addresses for equality. -

    -
    -

    - operator> -

    -     		-

    - Compare addresses for ordering. -

    -
    -

    - operator>= -

    -     		-

    - Compare addresses for ordering. -

    -
    -
    - - Related - Functions -
    -
    ---- - - - - - - - - - - - - - - - - - - -
    -

    - Name -

    -     		-

    - Description -

    -
    -

    - make_address_v6 -

    -     		-

    - Create an IPv6 address from raw bytes and scope ID. -

    -

    - Create an IPv6 address from an IP address string. -

    -

    - Createan IPv6 address from an IP address string. -

    -

    - Create an IPv4-mapped IPv6 address from an IPv4 address. -

    -
    -

    - make_network_v6 -

    -     		-

    - Create an IPv6 network from an address and prefix length. -

    -
    -

    - operator<< -

    -     		-

    - Output an address as a string. -

    -

    - Output a network as a string. -

    -
    -

    - The ip::address_v6 - class provides the ability to use and manipulate IP version 6 addresses. -

    -
    - - Thread - Safety -
    -

    - Distinct objects: Safe. -

    -

    - Shared objects: Unsafe. -

    -
    - Requirements

    @@ -579,7 +46,7 @@ The type of an iterator that points into the range.

    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_address_range_lt__address_v6__gt_/operator_eq_.html b/doc/html/boost_asio/reference/ip__basic_address_range_lt__address_v6__gt_/operator_eq_.html index 0a64849bf4..11f4637e22 100644 --- a/doc/html/boost_asio/reference/ip__basic_address_range_lt__address_v6__gt_/operator_eq_.html +++ b/doc/html/boost_asio/reference/ip__basic_address_range_lt__address_v6__gt_/operator_eq_.html @@ -37,7 +37,7 @@ Assignment operator.
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_endpoint.html b/doc/html/boost_asio/reference/ip__basic_endpoint.html index 24ed6c85ce..1f723666e7 100644 --- a/doc/html/boost_asio/reference/ip__basic_endpoint.html +++ b/doc/html/boost_asio/reference/ip__basic_endpoint.html @@ -402,7 +402,7 @@ class basic_endpoint
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_endpoint/address.html b/doc/html/boost_asio/reference/ip__basic_endpoint/address.html index 7d0abd26d1..4a273243fb 100644 --- a/doc/html/boost_asio/reference/ip__basic_endpoint/address.html +++ b/doc/html/boost_asio/reference/ip__basic_endpoint/address.html @@ -44,7 +44,7 @@ Get
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_endpoint/address/overload1.html b/doc/html/boost_asio/reference/ip__basic_endpoint/address/overload1.html index a99ecd5591..c28a52ca81 100644 --- a/doc/html/boost_asio/reference/ip__basic_endpoint/address/overload1.html +++ b/doc/html/boost_asio/reference/ip__basic_endpoint/address/overload1.html @@ -35,7 +35,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_endpoint/address/overload2.html b/doc/html/boost_asio/reference/ip__basic_endpoint/address/overload2.html index 09b2beeb9e..d12d523a57 100644 --- a/doc/html/boost_asio/reference/ip__basic_endpoint/address/overload2.html +++ b/doc/html/boost_asio/reference/ip__basic_endpoint/address/overload2.html @@ -36,7 +36,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_endpoint/basic_endpoint.html b/doc/html/boost_asio/reference/ip__basic_endpoint/basic_endpoint.html index 2b62843040..9209a55573 100644 --- a/doc/html/boost_asio/reference/ip__basic_endpoint/basic_endpoint.html +++ b/doc/html/boost_asio/reference/ip__basic_endpoint/basic_endpoint.html @@ -71,7 +71,7 @@ Default
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_endpoint/basic_endpoint/overload1.html b/doc/html/boost_asio/reference/ip__basic_endpoint/basic_endpoint/overload1.html index 638c03fc47..67434419d5 100644 --- a/doc/html/boost_asio/reference/ip__basic_endpoint/basic_endpoint/overload1.html +++ b/doc/html/boost_asio/reference/ip__basic_endpoint/basic_endpoint/overload1.html @@ -35,7 +35,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_endpoint/basic_endpoint/overload2.html b/doc/html/boost_asio/reference/ip__basic_endpoint/basic_endpoint/overload2.html index d7afbabca3..a4d5660112 100644 --- a/doc/html/boost_asio/reference/ip__basic_endpoint/basic_endpoint/overload2.html +++ b/doc/html/boost_asio/reference/ip__basic_endpoint/basic_endpoint/overload2.html @@ -53,7 +53,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_endpoint/basic_endpoint/overload3.html b/doc/html/boost_asio/reference/ip__basic_endpoint/basic_endpoint/overload3.html index b26be1fd79..9a4f6d022b 100644 --- a/doc/html/boost_asio/reference/ip__basic_endpoint/basic_endpoint/overload3.html +++ b/doc/html/boost_asio/reference/ip__basic_endpoint/basic_endpoint/overload3.html @@ -39,7 +39,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_endpoint/basic_endpoint/overload4.html b/doc/html/boost_asio/reference/ip__basic_endpoint/basic_endpoint/overload4.html index 02b1c7d3f9..6ebfbd480e 100644 --- a/doc/html/boost_asio/reference/ip__basic_endpoint/basic_endpoint/overload4.html +++ b/doc/html/boost_asio/reference/ip__basic_endpoint/basic_endpoint/overload4.html @@ -36,7 +36,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_endpoint/basic_endpoint/overload5.html b/doc/html/boost_asio/reference/ip__basic_endpoint/basic_endpoint/overload5.html index 8549049f7c..22147b8574 100644 --- a/doc/html/boost_asio/reference/ip__basic_endpoint/basic_endpoint/overload5.html +++ b/doc/html/boost_asio/reference/ip__basic_endpoint/basic_endpoint/overload5.html @@ -36,7 +36,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_endpoint/capacity.html b/doc/html/boost_asio/reference/ip__basic_endpoint/capacity.html index 42d1ab793a..ebb333b8d9 100644 --- a/doc/html/boost_asio/reference/ip__basic_endpoint/capacity.html +++ b/doc/html/boost_asio/reference/ip__basic_endpoint/capacity.html @@ -36,7 +36,7 @@ Get
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_endpoint/data.html b/doc/html/boost_asio/reference/ip__basic_endpoint/data.html index 4c8b614562..c01e0b0a3a 100644 --- a/doc/html/boost_asio/reference/ip__basic_endpoint/data.html +++ b/doc/html/boost_asio/reference/ip__basic_endpoint/data.html @@ -40,7 +40,7 @@ const data_type *
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_endpoint/data/overload1.html b/doc/html/boost_asio/reference/ip__basic_endpoint/data/overload1.html index 9fec7718f0..9c44fbaa0e 100644 --- a/doc/html/boost_asio/reference/ip__basic_endpoint/data/overload1.html +++ b/doc/html/boost_asio/reference/ip__basic_endpoint/data/overload1.html @@ -35,7 +35,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_endpoint/data/overload2.html b/doc/html/boost_asio/reference/ip__basic_endpoint/data/overload2.html index 4fa39a0ea9..2c5d0b9579 100644 --- a/doc/html/boost_asio/reference/ip__basic_endpoint/data/overload2.html +++ b/doc/html/boost_asio/reference/ip__basic_endpoint/data/overload2.html @@ -35,7 +35,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_endpoint/data_type.html b/doc/html/boost_asio/reference/ip__basic_endpoint/data_type.html index 836c89b302..145a7d401d 100644 --- a/doc/html/boost_asio/reference/ip__basic_endpoint/data_type.html +++ b/doc/html/boost_asio/reference/ip__basic_endpoint/data_type.html @@ -47,7 +47,7 @@ The
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_endpoint/operator_eq_.html b/doc/html/boost_asio/reference/ip__basic_endpoint/operator_eq_.html index b76eabe8fd..878fbf3565 100644 --- a/doc/html/boost_asio/reference/ip__basic_endpoint/operator_eq_.html +++ b/doc/html/boost_asio/reference/ip__basic_endpoint/operator_eq_.html @@ -45,7 +45,7 @@ Assign
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_endpoint/operator_eq_/overload1.html b/doc/html/boost_asio/reference/ip__basic_endpoint/operator_eq_/overload1.html index 263f3b2cbb..95d4b989fe 100644 --- a/doc/html/boost_asio/reference/ip__basic_endpoint/operator_eq_/overload1.html +++ b/doc/html/boost_asio/reference/ip__basic_endpoint/operator_eq_/overload1.html @@ -36,7 +36,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_endpoint/operator_eq_/overload2.html b/doc/html/boost_asio/reference/ip__basic_endpoint/operator_eq_/overload2.html index cc90f123c7..8e9c58731a 100644 --- a/doc/html/boost_asio/reference/ip__basic_endpoint/operator_eq_/overload2.html +++ b/doc/html/boost_asio/reference/ip__basic_endpoint/operator_eq_/overload2.html @@ -36,7 +36,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_endpoint/operator_eq__eq_.html b/doc/html/boost_asio/reference/ip__basic_endpoint/operator_eq__eq_.html index f7a32d083a..e5a6be317d 100644 --- a/doc/html/boost_asio/reference/ip__basic_endpoint/operator_eq__eq_.html +++ b/doc/html/boost_asio/reference/ip__basic_endpoint/operator_eq__eq_.html @@ -48,7 +48,7 @@ Compare
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_endpoint/operator_gt_.html b/doc/html/boost_asio/reference/ip__basic_endpoint/operator_gt_.html index a014e4df6a..29e044da68 100644 --- a/doc/html/boost_asio/reference/ip__basic_endpoint/operator_gt_.html +++ b/doc/html/boost_asio/reference/ip__basic_endpoint/operator_gt_.html @@ -48,7 +48,7 @@ Compare
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_endpoint/operator_gt__eq_.html b/doc/html/boost_asio/reference/ip__basic_endpoint/operator_gt__eq_.html index d81da85796..05f83f5824 100644 --- a/doc/html/boost_asio/reference/ip__basic_endpoint/operator_gt__eq_.html +++ b/doc/html/boost_asio/reference/ip__basic_endpoint/operator_gt__eq_.html @@ -48,7 +48,7 @@ Compare
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_endpoint/operator_lt_.html b/doc/html/boost_asio/reference/ip__basic_endpoint/operator_lt_.html index 436e46b97e..a3c402a9c7 100644 --- a/doc/html/boost_asio/reference/ip__basic_endpoint/operator_lt_.html +++ b/doc/html/boost_asio/reference/ip__basic_endpoint/operator_lt_.html @@ -48,7 +48,7 @@ Compare
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_endpoint/operator_lt__eq_.html b/doc/html/boost_asio/reference/ip__basic_endpoint/operator_lt__eq_.html index ff59f137d7..89da2cb474 100644 --- a/doc/html/boost_asio/reference/ip__basic_endpoint/operator_lt__eq_.html +++ b/doc/html/boost_asio/reference/ip__basic_endpoint/operator_lt__eq_.html @@ -48,7 +48,7 @@ Compare
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_endpoint/operator_lt__lt_.html b/doc/html/boost_asio/reference/ip__basic_endpoint/operator_lt__lt_.html index ebc7ca0cd8..0d6d056647 100644 --- a/doc/html/boost_asio/reference/ip__basic_endpoint/operator_lt__lt_.html +++ b/doc/html/boost_asio/reference/ip__basic_endpoint/operator_lt__lt_.html @@ -66,7 +66,7 @@ Output
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_endpoint/operator_not__eq_.html b/doc/html/boost_asio/reference/ip__basic_endpoint/operator_not__eq_.html index 8c4574b3d0..c910a0b31e 100644 --- a/doc/html/boost_asio/reference/ip__basic_endpoint/operator_not__eq_.html +++ b/doc/html/boost_asio/reference/ip__basic_endpoint/operator_not__eq_.html @@ -48,7 +48,7 @@ Compare
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_endpoint/port.html b/doc/html/boost_asio/reference/ip__basic_endpoint/port.html index 556ae21212..1279f14e12 100644 --- a/doc/html/boost_asio/reference/ip__basic_endpoint/port.html +++ b/doc/html/boost_asio/reference/ip__basic_endpoint/port.html @@ -46,7 +46,7 @@ Get the
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_endpoint/port/overload1.html b/doc/html/boost_asio/reference/ip__basic_endpoint/port/overload1.html index 1458e21643..57a95558ab 100644 --- a/doc/html/boost_asio/reference/ip__basic_endpoint/port/overload1.html +++ b/doc/html/boost_asio/reference/ip__basic_endpoint/port/overload1.html @@ -36,7 +36,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_endpoint/port/overload2.html b/doc/html/boost_asio/reference/ip__basic_endpoint/port/overload2.html index 2c617faf37..7acf694469 100644 --- a/doc/html/boost_asio/reference/ip__basic_endpoint/port/overload2.html +++ b/doc/html/boost_asio/reference/ip__basic_endpoint/port/overload2.html @@ -37,7 +37,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_endpoint/protocol.html b/doc/html/boost_asio/reference/ip__basic_endpoint/protocol.html index e5036c3bf8..43ad2d34be 100644 --- a/doc/html/boost_asio/reference/ip__basic_endpoint/protocol.html +++ b/doc/html/boost_asio/reference/ip__basic_endpoint/protocol.html @@ -36,7 +36,7 @@ The
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_endpoint/protocol_type.html b/doc/html/boost_asio/reference/ip__basic_endpoint/protocol_type.html index 0f78582673..86653580c4 100644 --- a/doc/html/boost_asio/reference/ip__basic_endpoint/protocol_type.html +++ b/doc/html/boost_asio/reference/ip__basic_endpoint/protocol_type.html @@ -46,7 +46,7 @@ The
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_endpoint/resize.html b/doc/html/boost_asio/reference/ip__basic_endpoint/resize.html index 2f8c3967b1..980b8f7bb5 100644 --- a/doc/html/boost_asio/reference/ip__basic_endpoint/resize.html +++ b/doc/html/boost_asio/reference/ip__basic_endpoint/resize.html @@ -37,7 +37,7 @@ Set
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_endpoint/size.html b/doc/html/boost_asio/reference/ip__basic_endpoint/size.html index 47d62304b5..a8534d75ed 100644 --- a/doc/html/boost_asio/reference/ip__basic_endpoint/size.html +++ b/doc/html/boost_asio/reference/ip__basic_endpoint/size.html @@ -36,7 +36,7 @@ Get the
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_resolver.html b/doc/html/boost_asio/reference/ip__basic_resolver.html index f57b5c1534..6a0c7f03ec 100644 --- a/doc/html/boost_asio/reference/ip__basic_resolver.html +++ b/doc/html/boost_asio/reference/ip__basic_resolver.html @@ -437,7 +437,7 @@ class basic_resolver :
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_resolver/_basic_resolver.html b/doc/html/boost_asio/reference/ip__basic_resolver/_basic_resolver.html index ac1a3c6cdf..01b622c355 100644 --- a/doc/html/boost_asio/reference/ip__basic_resolver/_basic_resolver.html +++ b/doc/html/boost_asio/reference/ip__basic_resolver/_basic_resolver.html @@ -40,7 +40,7 @@ Destroys
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_resolver/address_configured.html b/doc/html/boost_asio/reference/ip__basic_resolver/address_configured.html index 8e323a6ed5..e08e109604 100644 --- a/doc/html/boost_asio/reference/ip__basic_resolver/address_configured.html +++ b/doc/html/boost_asio/reference/ip__basic_resolver/address_configured.html @@ -41,7 +41,7 @@ Only
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_resolver/all_matching.html b/doc/html/boost_asio/reference/ip__basic_resolver/all_matching.html index bd823fcc57..8847c2143c 100644 --- a/doc/html/boost_asio/reference/ip__basic_resolver/all_matching.html +++ b/doc/html/boost_asio/reference/ip__basic_resolver/all_matching.html @@ -39,7 +39,7 @@ If
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_resolver/async_resolve.html b/doc/html/boost_asio/reference/ip__basic_resolver/async_resolve.html index 27089c1ef2..cabb5ea085 100644 --- a/doc/html/boost_asio/reference/ip__basic_resolver/async_resolve.html +++ b/doc/html/boost_asio/reference/ip__basic_resolver/async_resolve.html @@ -90,7 +90,7 @@ template<
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_resolver/async_resolve/overload1.html b/doc/html/boost_asio/reference/ip__basic_resolver/async_resolve/overload1.html index 4938958d26..22e6c49e45 100644 --- a/doc/html/boost_asio/reference/ip__basic_resolver/async_resolve/overload1.html +++ b/doc/html/boost_asio/reference/ip__basic_resolver/async_resolve/overload1.html @@ -80,7 +80,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_resolver/async_resolve/overload2.html b/doc/html/boost_asio/reference/ip__basic_resolver/async_resolve/overload2.html index 0e88546722..2e3522610b 100644 --- a/doc/html/boost_asio/reference/ip__basic_resolver/async_resolve/overload2.html +++ b/doc/html/boost_asio/reference/ip__basic_resolver/async_resolve/overload2.html @@ -108,7 +108,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_resolver/async_resolve/overload3.html b/doc/html/boost_asio/reference/ip__basic_resolver/async_resolve/overload3.html index aa38e381a4..4c61d82929 100644 --- a/doc/html/boost_asio/reference/ip__basic_resolver/async_resolve/overload3.html +++ b/doc/html/boost_asio/reference/ip__basic_resolver/async_resolve/overload3.html @@ -114,7 +114,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_resolver/async_resolve/overload4.html b/doc/html/boost_asio/reference/ip__basic_resolver/async_resolve/overload4.html index 6871a6da38..156632bb9e 100644 --- a/doc/html/boost_asio/reference/ip__basic_resolver/async_resolve/overload4.html +++ b/doc/html/boost_asio/reference/ip__basic_resolver/async_resolve/overload4.html @@ -114,7 +114,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_resolver/async_resolve/overload5.html b/doc/html/boost_asio/reference/ip__basic_resolver/async_resolve/overload5.html index ef44c6eabb..819b37e777 100644 --- a/doc/html/boost_asio/reference/ip__basic_resolver/async_resolve/overload5.html +++ b/doc/html/boost_asio/reference/ip__basic_resolver/async_resolve/overload5.html @@ -120,7 +120,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_resolver/async_resolve/overload6.html b/doc/html/boost_asio/reference/ip__basic_resolver/async_resolve/overload6.html index ab1bb09df5..adb06a9778 100644 --- a/doc/html/boost_asio/reference/ip__basic_resolver/async_resolve/overload6.html +++ b/doc/html/boost_asio/reference/ip__basic_resolver/async_resolve/overload6.html @@ -80,7 +80,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_resolver/basic_resolver.html b/doc/html/boost_asio/reference/ip__basic_resolver/basic_resolver.html index dfdcc511cf..8b65ffacec 100644 --- a/doc/html/boost_asio/reference/ip__basic_resolver/basic_resolver.html +++ b/doc/html/boost_asio/reference/ip__basic_resolver/basic_resolver.html @@ -45,7 +45,7 @@ Constructor.
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_resolver/basic_resolver/overload1.html b/doc/html/boost_asio/reference/ip__basic_resolver/basic_resolver/overload1.html index bc3aa57f69..27c0dd53bb 100644 --- a/doc/html/boost_asio/reference/ip__basic_resolver/basic_resolver/overload1.html +++ b/doc/html/boost_asio/reference/ip__basic_resolver/basic_resolver/overload1.html @@ -54,7 +54,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_resolver/basic_resolver/overload2.html b/doc/html/boost_asio/reference/ip__basic_resolver/basic_resolver/overload2.html index 10f4cfbc61..476f327c45 100644 --- a/doc/html/boost_asio/reference/ip__basic_resolver/basic_resolver/overload2.html +++ b/doc/html/boost_asio/reference/ip__basic_resolver/basic_resolver/overload2.html @@ -62,7 +62,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_resolver/cancel.html b/doc/html/boost_asio/reference/ip__basic_resolver/cancel.html index d5ee925efb..06298cb0c1 100644 --- a/doc/html/boost_asio/reference/ip__basic_resolver/cancel.html +++ b/doc/html/boost_asio/reference/ip__basic_resolver/cancel.html @@ -42,7 +42,7 @@ Cancel
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_resolver/canonical_name.html b/doc/html/boost_asio/reference/ip__basic_resolver/canonical_name.html index f2e78dbafd..c2780dbfb7 100644 --- a/doc/html/boost_asio/reference/ip__basic_resolver/canonical_name.html +++ b/doc/html/boost_asio/reference/ip__basic_resolver/canonical_name.html @@ -39,7 +39,7 @@ Determine
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_resolver/endpoint_type.html b/doc/html/boost_asio/reference/ip__basic_resolver/endpoint_type.html index 7df64b68d2..c5c07ce77d 100644 --- a/doc/html/boost_asio/reference/ip__basic_resolver/endpoint_type.html +++ b/doc/html/boost_asio/reference/ip__basic_resolver/endpoint_type.html @@ -46,7 +46,7 @@ The
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_resolver/executor_type.html b/doc/html/boost_asio/reference/ip__basic_resolver/executor_type.html index 8b0c65a231..285fe317e6 100644 --- a/doc/html/boost_asio/reference/ip__basic_resolver/executor_type.html +++ b/doc/html/boost_asio/reference/ip__basic_resolver/executor_type.html @@ -203,7 +203,7 @@ The
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_resolver/flags.html b/doc/html/boost_asio/reference/ip__basic_resolver/flags.html index 380ee41d94..51a5fe6e98 100644 --- a/doc/html/boost_asio/reference/ip__basic_resolver/flags.html +++ b/doc/html/boost_asio/reference/ip__basic_resolver/flags.html @@ -49,7 +49,7 @@ A bitmask
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_resolver/get_executor.html b/doc/html/boost_asio/reference/ip__basic_resolver/get_executor.html index 4f17dc1a2d..c09899a63d 100644 --- a/doc/html/boost_asio/reference/ip__basic_resolver/get_executor.html +++ b/doc/html/boost_asio/reference/ip__basic_resolver/get_executor.html @@ -36,7 +36,7 @@ Get
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_resolver/get_io_context.html b/doc/html/boost_asio/reference/ip__basic_resolver/get_io_context.html index 2c97d29da1..47c9459d81 100644 --- a/doc/html/boost_asio/reference/ip__basic_resolver/get_io_context.html +++ b/doc/html/boost_asio/reference/ip__basic_resolver/get_io_context.html @@ -51,7 +51,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_resolver/get_io_service.html b/doc/html/boost_asio/reference/ip__basic_resolver/get_io_service.html index 42142d6983..ad7df92f8c 100644 --- a/doc/html/boost_asio/reference/ip__basic_resolver/get_io_service.html +++ b/doc/html/boost_asio/reference/ip__basic_resolver/get_io_service.html @@ -51,7 +51,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_resolver/iterator.html b/doc/html/boost_asio/reference/ip__basic_resolver/iterator.html index 130c8f04d0..6bdd328117 100644 --- a/doc/html/boost_asio/reference/ip__basic_resolver/iterator.html +++ b/doc/html/boost_asio/reference/ip__basic_resolver/iterator.html @@ -392,7 +392,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_resolver/numeric_host.html b/doc/html/boost_asio/reference/ip__basic_resolver/numeric_host.html index 9519183453..744e83c3d9 100644 --- a/doc/html/boost_asio/reference/ip__basic_resolver/numeric_host.html +++ b/doc/html/boost_asio/reference/ip__basic_resolver/numeric_host.html @@ -40,7 +40,7 @@ Host
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_resolver/numeric_service.html b/doc/html/boost_asio/reference/ip__basic_resolver/numeric_service.html index 1e59ad124d..c01fd72ce7 100644 --- a/doc/html/boost_asio/reference/ip__basic_resolver/numeric_service.html +++ b/doc/html/boost_asio/reference/ip__basic_resolver/numeric_service.html @@ -40,7 +40,7 @@ Service
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_resolver/operator_eq_.html b/doc/html/boost_asio/reference/ip__basic_resolver/operator_eq_.html index 0cbd91fe05..4b01ad8d0a 100644 --- a/doc/html/boost_asio/reference/ip__basic_resolver/operator_eq_.html +++ b/doc/html/boost_asio/reference/ip__basic_resolver/operator_eq_.html @@ -64,7 +64,7 @@ Move-assign
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_resolver/passive.html b/doc/html/boost_asio/reference/ip__basic_resolver/passive.html index a10f7f6296..2a6c01d074 100644 --- a/doc/html/boost_asio/reference/ip__basic_resolver/passive.html +++ b/doc/html/boost_asio/reference/ip__basic_resolver/passive.html @@ -39,7 +39,7 @@ Indicate
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_resolver/protocol_type.html b/doc/html/boost_asio/reference/ip__basic_resolver/protocol_type.html index 1d952edf79..f0a3ea52fc 100644 --- a/doc/html/boost_asio/reference/ip__basic_resolver/protocol_type.html +++ b/doc/html/boost_asio/reference/ip__basic_resolver/protocol_type.html @@ -46,7 +46,7 @@ The
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_resolver/query.html b/doc/html/boost_asio/reference/ip__basic_resolver/query.html index 20eaa0c3dc..fa33861f32 100644 --- a/doc/html/boost_asio/reference/ip__basic_resolver/query.html +++ b/doc/html/boost_asio/reference/ip__basic_resolver/query.html @@ -307,7 +307,7 @@
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_resolver/resolve.html b/doc/html/boost_asio/reference/ip__basic_resolver/resolve.html index e9940dfddf..b5ecd6a7e9 100644 --- a/doc/html/boost_asio/reference/ip__basic_resolver/resolve.html +++ b/doc/html/boost_asio/reference/ip__basic_resolver/resolve.html @@ -110,7 +110,7 @@ results_type
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_resolver/resolve/overload1.html b/doc/html/boost_asio/reference/ip__basic_resolver/resolve/overload1.html index 645ecefacc..9b428e5ce1 100644 --- a/doc/html/boost_asio/reference/ip__basic_resolver/resolve/overload1.html +++ b/doc/html/boost_asio/reference/ip__basic_resolver/resolve/overload1.html @@ -74,7 +74,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_resolver/resolve/overload10.html b/doc/html/boost_asio/reference/ip__basic_resolver/resolve/overload10.html index ac7c7c045b..3c6848bc86 100644 --- a/doc/html/boost_asio/reference/ip__basic_resolver/resolve/overload10.html +++ b/doc/html/boost_asio/reference/ip__basic_resolver/resolve/overload10.html @@ -109,7 +109,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_resolver/resolve/overload11.html b/doc/html/boost_asio/reference/ip__basic_resolver/resolve/overload11.html index 31197ece9d..45fe474b82 100644 --- a/doc/html/boost_asio/reference/ip__basic_resolver/resolve/overload11.html +++ b/doc/html/boost_asio/reference/ip__basic_resolver/resolve/overload11.html @@ -75,7 +75,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_resolver/resolve/overload12.html b/doc/html/boost_asio/reference/ip__basic_resolver/resolve/overload12.html index 95c3a9063c..ed8b298bcf 100644 --- a/doc/html/boost_asio/reference/ip__basic_resolver/resolve/overload12.html +++ b/doc/html/boost_asio/reference/ip__basic_resolver/resolve/overload12.html @@ -68,7 +68,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_resolver/resolve/overload2.html b/doc/html/boost_asio/reference/ip__basic_resolver/resolve/overload2.html index 2d2377dbca..b89f3781d9 100644 --- a/doc/html/boost_asio/reference/ip__basic_resolver/resolve/overload2.html +++ b/doc/html/boost_asio/reference/ip__basic_resolver/resolve/overload2.html @@ -67,7 +67,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_resolver/resolve/overload3.html b/doc/html/boost_asio/reference/ip__basic_resolver/resolve/overload3.html index 332df27883..34101db8f8 100644 --- a/doc/html/boost_asio/reference/ip__basic_resolver/resolve/overload3.html +++ b/doc/html/boost_asio/reference/ip__basic_resolver/resolve/overload3.html @@ -104,7 +104,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_resolver/resolve/overload4.html b/doc/html/boost_asio/reference/ip__basic_resolver/resolve/overload4.html index a91de7231d..fbdd31b0b9 100644 --- a/doc/html/boost_asio/reference/ip__basic_resolver/resolve/overload4.html +++ b/doc/html/boost_asio/reference/ip__basic_resolver/resolve/overload4.html @@ -97,7 +97,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_resolver/resolve/overload5.html b/doc/html/boost_asio/reference/ip__basic_resolver/resolve/overload5.html index f0f5ccf9f6..3e982e7214 100644 --- a/doc/html/boost_asio/reference/ip__basic_resolver/resolve/overload5.html +++ b/doc/html/boost_asio/reference/ip__basic_resolver/resolve/overload5.html @@ -110,7 +110,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_resolver/resolve/overload6.html b/doc/html/boost_asio/reference/ip__basic_resolver/resolve/overload6.html index fd916963e3..b43456a496 100644 --- a/doc/html/boost_asio/reference/ip__basic_resolver/resolve/overload6.html +++ b/doc/html/boost_asio/reference/ip__basic_resolver/resolve/overload6.html @@ -103,7 +103,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_resolver/resolve/overload7.html b/doc/html/boost_asio/reference/ip__basic_resolver/resolve/overload7.html index 93f71fe24d..6208dfffba 100644 --- a/doc/html/boost_asio/reference/ip__basic_resolver/resolve/overload7.html +++ b/doc/html/boost_asio/reference/ip__basic_resolver/resolve/overload7.html @@ -110,7 +110,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_resolver/resolve/overload8.html b/doc/html/boost_asio/reference/ip__basic_resolver/resolve/overload8.html index 188c3da9fb..45773984a5 100644 --- a/doc/html/boost_asio/reference/ip__basic_resolver/resolve/overload8.html +++ b/doc/html/boost_asio/reference/ip__basic_resolver/resolve/overload8.html @@ -103,7 +103,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_resolver/resolve/overload9.html b/doc/html/boost_asio/reference/ip__basic_resolver/resolve/overload9.html index 15941a8e38..b7f97372fb 100644 --- a/doc/html/boost_asio/reference/ip__basic_resolver/resolve/overload9.html +++ b/doc/html/boost_asio/reference/ip__basic_resolver/resolve/overload9.html @@ -116,7 +116,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_resolver/results_type.html b/doc/html/boost_asio/reference/ip__basic_resolver/results_type.html index 31c59eabdc..73f7d37cbe 100644 --- a/doc/html/boost_asio/reference/ip__basic_resolver/results_type.html +++ b/doc/html/boost_asio/reference/ip__basic_resolver/results_type.html @@ -570,7 +570,7 @@ The
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_resolver/v4_mapped.html b/doc/html/boost_asio/reference/ip__basic_resolver/v4_mapped.html index 087c591bda..0798c4bd95 100644 --- a/doc/html/boost_asio/reference/ip__basic_resolver/v4_mapped.html +++ b/doc/html/boost_asio/reference/ip__basic_resolver/v4_mapped.html @@ -40,7 +40,7 @@ If
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_resolver_entry.html b/doc/html/boost_asio/reference/ip__basic_resolver_entry.html index aa1c400505..b364da5304 100644 --- a/doc/html/boost_asio/reference/ip__basic_resolver_entry.html +++ b/doc/html/boost_asio/reference/ip__basic_resolver_entry.html @@ -197,7 +197,7 @@ class basic_resolver_entry
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_resolver_entry/basic_resolver_entry.html b/doc/html/boost_asio/reference/ip__basic_resolver_entry/basic_resolver_entry.html index 5c37a93931..b90f799962 100644 --- a/doc/html/boost_asio/reference/ip__basic_resolver_entry/basic_resolver_entry.html +++ b/doc/html/boost_asio/reference/ip__basic_resolver_entry/basic_resolver_entry.html @@ -46,7 +46,7 @@ Default
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_resolver_entry/basic_resolver_entry/overload1.html b/doc/html/boost_asio/reference/ip__basic_resolver_entry/basic_resolver_entry/overload1.html index 440824b9e3..a45fe0a2c5 100644 --- a/doc/html/boost_asio/reference/ip__basic_resolver_entry/basic_resolver_entry/overload1.html +++ b/doc/html/boost_asio/reference/ip__basic_resolver_entry/basic_resolver_entry/overload1.html @@ -35,7 +35,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_resolver_entry/basic_resolver_entry/overload2.html b/doc/html/boost_asio/reference/ip__basic_resolver_entry/basic_resolver_entry/overload2.html index e9e4faa72a..407b57e900 100644 --- a/doc/html/boost_asio/reference/ip__basic_resolver_entry/basic_resolver_entry/overload2.html +++ b/doc/html/boost_asio/reference/ip__basic_resolver_entry/basic_resolver_entry/overload2.html @@ -38,7 +38,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_resolver_entry/endpoint.html b/doc/html/boost_asio/reference/ip__basic_resolver_entry/endpoint.html index 2a6c72997a..f4f04ce8c9 100644 --- a/doc/html/boost_asio/reference/ip__basic_resolver_entry/endpoint.html +++ b/doc/html/boost_asio/reference/ip__basic_resolver_entry/endpoint.html @@ -36,7 +36,7 @@ Get
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_resolver_entry/endpoint_type.html b/doc/html/boost_asio/reference/ip__basic_resolver_entry/endpoint_type.html index f124ee108d..4eb7ccd79c 100644 --- a/doc/html/boost_asio/reference/ip__basic_resolver_entry/endpoint_type.html +++ b/doc/html/boost_asio/reference/ip__basic_resolver_entry/endpoint_type.html @@ -46,7 +46,7 @@ The
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_resolver_entry/host_name.html b/doc/html/boost_asio/reference/ip__basic_resolver_entry/host_name.html index 2a92056421..d5f1babe98 100644 --- a/doc/html/boost_asio/reference/ip__basic_resolver_entry/host_name.html +++ b/doc/html/boost_asio/reference/ip__basic_resolver_entry/host_name.html @@ -43,7 +43,7 @@ std::basic_string< char, std::char_traits< char >, Allocator > -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_resolver_entry/host_name/overload1.html b/doc/html/boost_asio/reference/ip__basic_resolver_entry/host_name/overload1.html index 457b61c21b..da74edd2c5 100644 --- a/doc/html/boost_asio/reference/ip__basic_resolver_entry/host_name/overload1.html +++ b/doc/html/boost_asio/reference/ip__basic_resolver_entry/host_name/overload1.html @@ -35,7 +35,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_resolver_entry/host_name/overload2.html b/doc/html/boost_asio/reference/ip__basic_resolver_entry/host_name/overload2.html index cbbb3953f9..55e6b79278 100644 --- a/doc/html/boost_asio/reference/ip__basic_resolver_entry/host_name/overload2.html +++ b/doc/html/boost_asio/reference/ip__basic_resolver_entry/host_name/overload2.html @@ -38,7 +38,7 @@ std::basic_string< char, std::char_traits< char >, Allocator > host_
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_resolver_entry/operator_endpoint_type.html b/doc/html/boost_asio/reference/ip__basic_resolver_entry/operator_endpoint_type.html index 9ab5b1a8e6..67fe5e5be3 100644 --- a/doc/html/boost_asio/reference/ip__basic_resolver_entry/operator_endpoint_type.html +++ b/doc/html/boost_asio/reference/ip__basic_resolver_entry/operator_endpoint_type.html @@ -37,7 +37,7 @@ Convert to the endpoint associated
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_resolver_entry/protocol_type.html b/doc/html/boost_asio/reference/ip__basic_resolver_entry/protocol_type.html index 23c63e98fc..1ee10d2380 100644 --- a/doc/html/boost_asio/reference/ip__basic_resolver_entry/protocol_type.html +++ b/doc/html/boost_asio/reference/ip__basic_resolver_entry/protocol_type.html @@ -46,7 +46,7 @@ The
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_resolver_entry/service_name.html b/doc/html/boost_asio/reference/ip__basic_resolver_entry/service_name.html index e7e7a8f80d..ee08e76e98 100644 --- a/doc/html/boost_asio/reference/ip__basic_resolver_entry/service_name.html +++ b/doc/html/boost_asio/reference/ip__basic_resolver_entry/service_name.html @@ -43,7 +43,7 @@ std::basic_string< char, std::char_traits< char >, Allocator > -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_resolver_entry/service_name/overload1.html b/doc/html/boost_asio/reference/ip__basic_resolver_entry/service_name/overload1.html index e45d0d0e75..4225f21a39 100644 --- a/doc/html/boost_asio/reference/ip__basic_resolver_entry/service_name/overload1.html +++ b/doc/html/boost_asio/reference/ip__basic_resolver_entry/service_name/overload1.html @@ -35,7 +35,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_resolver_entry/service_name/overload2.html b/doc/html/boost_asio/reference/ip__basic_resolver_entry/service_name/overload2.html index e0d861f367..809cc20b6f 100644 --- a/doc/html/boost_asio/reference/ip__basic_resolver_entry/service_name/overload2.html +++ b/doc/html/boost_asio/reference/ip__basic_resolver_entry/service_name/overload2.html @@ -38,7 +38,7 @@ std::basic_string< char, std::char_traits< char >, Allocator > servi
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_resolver_iterator.html b/doc/html/boost_asio/reference/ip__basic_resolver_iterator.html index 3ab4a7582d..ccbe650bb7 100644 --- a/doc/html/boost_asio/reference/ip__basic_resolver_iterator.html +++ b/doc/html/boost_asio/reference/ip__basic_resolver_iterator.html @@ -391,7 +391,7 @@ class basic_resolver_iterator
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_resolver_iterator/basic_resolver_iterator.html b/doc/html/boost_asio/reference/ip__basic_resolver_iterator/basic_resolver_iterator.html index e8a3b9832a..82786135b8 100644 --- a/doc/html/boost_asio/reference/ip__basic_resolver_iterator/basic_resolver_iterator.html +++ b/doc/html/boost_asio/reference/ip__basic_resolver_iterator/basic_resolver_iterator.html @@ -51,7 +51,7 @@ Default
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_resolver_iterator/basic_resolver_iterator/overload1.html b/doc/html/boost_asio/reference/ip__basic_resolver_iterator/basic_resolver_iterator/overload1.html index 011a26f96f..033a3ed9af 100644 --- a/doc/html/boost_asio/reference/ip__basic_resolver_iterator/basic_resolver_iterator/overload1.html +++ b/doc/html/boost_asio/reference/ip__basic_resolver_iterator/basic_resolver_iterator/overload1.html @@ -35,7 +35,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_resolver_iterator/basic_resolver_iterator/overload2.html b/doc/html/boost_asio/reference/ip__basic_resolver_iterator/basic_resolver_iterator/overload2.html index e1f45547d3..3a465200be 100644 --- a/doc/html/boost_asio/reference/ip__basic_resolver_iterator/basic_resolver_iterator/overload2.html +++ b/doc/html/boost_asio/reference/ip__basic_resolver_iterator/basic_resolver_iterator/overload2.html @@ -36,7 +36,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_resolver_iterator/basic_resolver_iterator/overload3.html b/doc/html/boost_asio/reference/ip__basic_resolver_iterator/basic_resolver_iterator/overload3.html index 354d650068..a68498c4b8 100644 --- a/doc/html/boost_asio/reference/ip__basic_resolver_iterator/basic_resolver_iterator/overload3.html +++ b/doc/html/boost_asio/reference/ip__basic_resolver_iterator/basic_resolver_iterator/overload3.html @@ -36,7 +36,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_resolver_iterator/dereference.html b/doc/html/boost_asio/reference/ip__basic_resolver_iterator/dereference.html index 073ebc28b8..53cb65e292 100644 --- a/doc/html/boost_asio/reference/ip__basic_resolver_iterator/dereference.html +++ b/doc/html/boost_asio/reference/ip__basic_resolver_iterator/dereference.html @@ -34,7 +34,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_resolver_iterator/difference_type.html b/doc/html/boost_asio/reference/ip__basic_resolver_iterator/difference_type.html index f425bb3823..23e09f8e70 100644 --- a/doc/html/boost_asio/reference/ip__basic_resolver_iterator/difference_type.html +++ b/doc/html/boost_asio/reference/ip__basic_resolver_iterator/difference_type.html @@ -46,7 +46,7 @@ The
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_resolver_iterator/equal.html b/doc/html/boost_asio/reference/ip__basic_resolver_iterator/equal.html index b84943dec8..8fada2300a 100644 --- a/doc/html/boost_asio/reference/ip__basic_resolver_iterator/equal.html +++ b/doc/html/boost_asio/reference/ip__basic_resolver_iterator/equal.html @@ -35,7 +35,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_resolver_iterator/increment.html b/doc/html/boost_asio/reference/ip__basic_resolver_iterator/increment.html index d96c662976..ec7b016689 100644 --- a/doc/html/boost_asio/reference/ip__basic_resolver_iterator/increment.html +++ b/doc/html/boost_asio/reference/ip__basic_resolver_iterator/increment.html @@ -34,7 +34,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_resolver_iterator/index_.html b/doc/html/boost_asio/reference/ip__basic_resolver_iterator/index_.html index ca7d99ee15..0e09d1b4b7 100644 --- a/doc/html/boost_asio/reference/ip__basic_resolver_iterator/index_.html +++ b/doc/html/boost_asio/reference/ip__basic_resolver_iterator/index_.html @@ -34,7 +34,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_resolver_iterator/iterator_category.html b/doc/html/boost_asio/reference/ip__basic_resolver_iterator/iterator_category.html index 83d6e15dc7..c01bc472a8 100644 --- a/doc/html/boost_asio/reference/ip__basic_resolver_iterator/iterator_category.html +++ b/doc/html/boost_asio/reference/ip__basic_resolver_iterator/iterator_category.html @@ -46,7 +46,7 @@ The
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_resolver_iterator/operator__star_.html b/doc/html/boost_asio/reference/ip__basic_resolver_iterator/operator__star_.html index 2e0d64982d..b54b589cea 100644 --- a/doc/html/boost_asio/reference/ip__basic_resolver_iterator/operator__star_.html +++ b/doc/html/boost_asio/reference/ip__basic_resolver_iterator/operator__star_.html @@ -36,7 +36,7 @@ Dereference an iterator.
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_resolver_iterator/operator_arrow_.html b/doc/html/boost_asio/reference/ip__basic_resolver_iterator/operator_arrow_.html index 695a0e4d72..e4b08299d3 100644 --- a/doc/html/boost_asio/reference/ip__basic_resolver_iterator/operator_arrow_.html +++ b/doc/html/boost_asio/reference/ip__basic_resolver_iterator/operator_arrow_.html @@ -36,7 +36,7 @@ Dereference
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_resolver_iterator/operator_eq_.html b/doc/html/boost_asio/reference/ip__basic_resolver_iterator/operator_eq_.html index d2900a95bf..15984ced35 100644 --- a/doc/html/boost_asio/reference/ip__basic_resolver_iterator/operator_eq_.html +++ b/doc/html/boost_asio/reference/ip__basic_resolver_iterator/operator_eq_.html @@ -45,7 +45,7 @@ Assignment
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_resolver_iterator/operator_eq_/overload1.html b/doc/html/boost_asio/reference/ip__basic_resolver_iterator/operator_eq_/overload1.html index ee61ab5037..1db21ba333 100644 --- a/doc/html/boost_asio/reference/ip__basic_resolver_iterator/operator_eq_/overload1.html +++ b/doc/html/boost_asio/reference/ip__basic_resolver_iterator/operator_eq_/overload1.html @@ -36,7 +36,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_resolver_iterator/operator_eq_/overload2.html b/doc/html/boost_asio/reference/ip__basic_resolver_iterator/operator_eq_/overload2.html index 17c588c4f9..b4d2794943 100644 --- a/doc/html/boost_asio/reference/ip__basic_resolver_iterator/operator_eq_/overload2.html +++ b/doc/html/boost_asio/reference/ip__basic_resolver_iterator/operator_eq_/overload2.html @@ -36,7 +36,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_resolver_iterator/operator_eq__eq_.html b/doc/html/boost_asio/reference/ip__basic_resolver_iterator/operator_eq__eq_.html index 84383090d3..9c1d9d2784 100644 --- a/doc/html/boost_asio/reference/ip__basic_resolver_iterator/operator_eq__eq_.html +++ b/doc/html/boost_asio/reference/ip__basic_resolver_iterator/operator_eq__eq_.html @@ -48,7 +48,7 @@ Test
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_resolver_iterator/operator_not__eq_.html b/doc/html/boost_asio/reference/ip__basic_resolver_iterator/operator_not__eq_.html index a4d24cb94a..5c3eb7d0e3 100644 --- a/doc/html/boost_asio/reference/ip__basic_resolver_iterator/operator_not__eq_.html +++ b/doc/html/boost_asio/reference/ip__basic_resolver_iterator/operator_not__eq_.html @@ -48,7 +48,7 @@ Test
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_resolver_iterator/operator_plus__plus_.html b/doc/html/boost_asio/reference/ip__basic_resolver_iterator/operator_plus__plus_.html index 70a3c72f9c..ff9cd8e023 100644 --- a/doc/html/boost_asio/reference/ip__basic_resolver_iterator/operator_plus__plus_.html +++ b/doc/html/boost_asio/reference/ip__basic_resolver_iterator/operator_plus__plus_.html @@ -44,7 +44,7 @@ Increment
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_resolver_iterator/operator_plus__plus_/overload1.html b/doc/html/boost_asio/reference/ip__basic_resolver_iterator/operator_plus__plus_/overload1.html index 2a693b62e8..012ec32faf 100644 --- a/doc/html/boost_asio/reference/ip__basic_resolver_iterator/operator_plus__plus_/overload1.html +++ b/doc/html/boost_asio/reference/ip__basic_resolver_iterator/operator_plus__plus_/overload1.html @@ -35,7 +35,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_resolver_iterator/operator_plus__plus_/overload2.html b/doc/html/boost_asio/reference/ip__basic_resolver_iterator/operator_plus__plus_/overload2.html index e7e17a5b3e..955beeb6de 100644 --- a/doc/html/boost_asio/reference/ip__basic_resolver_iterator/operator_plus__plus_/overload2.html +++ b/doc/html/boost_asio/reference/ip__basic_resolver_iterator/operator_plus__plus_/overload2.html @@ -36,7 +36,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_resolver_iterator/pointer.html b/doc/html/boost_asio/reference/ip__basic_resolver_iterator/pointer.html index 30d9ac3424..ae6f0b0105 100644 --- a/doc/html/boost_asio/reference/ip__basic_resolver_iterator/pointer.html +++ b/doc/html/boost_asio/reference/ip__basic_resolver_iterator/pointer.html @@ -46,7 +46,7 @@ The
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_resolver_iterator/reference.html b/doc/html/boost_asio/reference/ip__basic_resolver_iterator/reference.html index b0d9249e21..40ef090c71 100644 --- a/doc/html/boost_asio/reference/ip__basic_resolver_iterator/reference.html +++ b/doc/html/boost_asio/reference/ip__basic_resolver_iterator/reference.html @@ -197,7 +197,7 @@ The
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_resolver_iterator/value_type.html b/doc/html/boost_asio/reference/ip__basic_resolver_iterator/value_type.html index faa47426b5..098b000a22 100644 --- a/doc/html/boost_asio/reference/ip__basic_resolver_iterator/value_type.html +++ b/doc/html/boost_asio/reference/ip__basic_resolver_iterator/value_type.html @@ -197,7 +197,7 @@ The
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_resolver_iterator/values_.html b/doc/html/boost_asio/reference/ip__basic_resolver_iterator/values_.html index 233ef91d01..0bfacefd1c 100644 --- a/doc/html/boost_asio/reference/ip__basic_resolver_iterator/values_.html +++ b/doc/html/boost_asio/reference/ip__basic_resolver_iterator/values_.html @@ -34,7 +34,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_resolver_query.html b/doc/html/boost_asio/reference/ip__basic_resolver_query.html index 0310e55574..09fe0cff84 100644 --- a/doc/html/boost_asio/reference/ip__basic_resolver_query.html +++ b/doc/html/boost_asio/reference/ip__basic_resolver_query.html @@ -308,7 +308,7 @@ class basic_resolver_query :
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_resolver_query/address_configured.html b/doc/html/boost_asio/reference/ip__basic_resolver_query/address_configured.html index 91c1fce115..1f1d1a2def 100644 --- a/doc/html/boost_asio/reference/ip__basic_resolver_query/address_configured.html +++ b/doc/html/boost_asio/reference/ip__basic_resolver_query/address_configured.html @@ -41,7 +41,7 @@ Only
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_resolver_query/all_matching.html b/doc/html/boost_asio/reference/ip__basic_resolver_query/all_matching.html index 7e2ab27206..ba6043ee00 100644 --- a/doc/html/boost_asio/reference/ip__basic_resolver_query/all_matching.html +++ b/doc/html/boost_asio/reference/ip__basic_resolver_query/all_matching.html @@ -39,7 +39,7 @@ If
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_resolver_query/basic_resolver_query.html b/doc/html/boost_asio/reference/ip__basic_resolver_query/basic_resolver_query.html index 3c99407f3f..31a9cf1456 100644 --- a/doc/html/boost_asio/reference/ip__basic_resolver_query/basic_resolver_query.html +++ b/doc/html/boost_asio/reference/ip__basic_resolver_query/basic_resolver_query.html @@ -67,7 +67,7 @@ Construct
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_resolver_query/basic_resolver_query/overload1.html b/doc/html/boost_asio/reference/ip__basic_resolver_query/basic_resolver_query/overload1.html index dd400b98f0..47188f2e29 100644 --- a/doc/html/boost_asio/reference/ip__basic_resolver_query/basic_resolver_query/overload1.html +++ b/doc/html/boost_asio/reference/ip__basic_resolver_query/basic_resolver_query/overload1.html @@ -70,7 +70,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_resolver_query/basic_resolver_query/overload2.html b/doc/html/boost_asio/reference/ip__basic_resolver_query/basic_resolver_query/overload2.html index 554009926b..c0f217392e 100644 --- a/doc/html/boost_asio/reference/ip__basic_resolver_query/basic_resolver_query/overload2.html +++ b/doc/html/boost_asio/reference/ip__basic_resolver_query/basic_resolver_query/overload2.html @@ -76,7 +76,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_resolver_query/basic_resolver_query/overload3.html b/doc/html/boost_asio/reference/ip__basic_resolver_query/basic_resolver_query/overload3.html index fc9ddeff96..e115b475f6 100644 --- a/doc/html/boost_asio/reference/ip__basic_resolver_query/basic_resolver_query/overload3.html +++ b/doc/html/boost_asio/reference/ip__basic_resolver_query/basic_resolver_query/overload3.html @@ -88,7 +88,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_resolver_query/basic_resolver_query/overload4.html b/doc/html/boost_asio/reference/ip__basic_resolver_query/basic_resolver_query/overload4.html index ca0aee51ff..58a0d2d5b8 100644 --- a/doc/html/boost_asio/reference/ip__basic_resolver_query/basic_resolver_query/overload4.html +++ b/doc/html/boost_asio/reference/ip__basic_resolver_query/basic_resolver_query/overload4.html @@ -94,7 +94,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_resolver_query/canonical_name.html b/doc/html/boost_asio/reference/ip__basic_resolver_query/canonical_name.html index 5465ec547a..e7de6e77fa 100644 --- a/doc/html/boost_asio/reference/ip__basic_resolver_query/canonical_name.html +++ b/doc/html/boost_asio/reference/ip__basic_resolver_query/canonical_name.html @@ -39,7 +39,7 @@ Determine
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_resolver_query/flags.html b/doc/html/boost_asio/reference/ip__basic_resolver_query/flags.html index 44acb5682c..f901c2b2cd 100644 --- a/doc/html/boost_asio/reference/ip__basic_resolver_query/flags.html +++ b/doc/html/boost_asio/reference/ip__basic_resolver_query/flags.html @@ -49,7 +49,7 @@ A
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_resolver_query/hints.html b/doc/html/boost_asio/reference/ip__basic_resolver_query/hints.html index e3f4225e06..b0a5061696 100644 --- a/doc/html/boost_asio/reference/ip__basic_resolver_query/hints.html +++ b/doc/html/boost_asio/reference/ip__basic_resolver_query/hints.html @@ -36,7 +36,7 @@ Get
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_resolver_query/host_name.html b/doc/html/boost_asio/reference/ip__basic_resolver_query/host_name.html index 8c009f6bcc..8c7899a5dd 100644 --- a/doc/html/boost_asio/reference/ip__basic_resolver_query/host_name.html +++ b/doc/html/boost_asio/reference/ip__basic_resolver_query/host_name.html @@ -36,7 +36,7 @@ Get
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_resolver_query/numeric_host.html b/doc/html/boost_asio/reference/ip__basic_resolver_query/numeric_host.html index b08e6a56da..863616c6bc 100644 --- a/doc/html/boost_asio/reference/ip__basic_resolver_query/numeric_host.html +++ b/doc/html/boost_asio/reference/ip__basic_resolver_query/numeric_host.html @@ -40,7 +40,7 @@ Host
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_resolver_query/numeric_service.html b/doc/html/boost_asio/reference/ip__basic_resolver_query/numeric_service.html index 7abc2158e2..67c034a33d 100644 --- a/doc/html/boost_asio/reference/ip__basic_resolver_query/numeric_service.html +++ b/doc/html/boost_asio/reference/ip__basic_resolver_query/numeric_service.html @@ -40,7 +40,7 @@ Service
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_resolver_query/passive.html b/doc/html/boost_asio/reference/ip__basic_resolver_query/passive.html index 9e4abe66da..633b20860c 100644 --- a/doc/html/boost_asio/reference/ip__basic_resolver_query/passive.html +++ b/doc/html/boost_asio/reference/ip__basic_resolver_query/passive.html @@ -39,7 +39,7 @@ Indicate
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_resolver_query/protocol_type.html b/doc/html/boost_asio/reference/ip__basic_resolver_query/protocol_type.html index 9620a5d94c..610ce07a90 100644 --- a/doc/html/boost_asio/reference/ip__basic_resolver_query/protocol_type.html +++ b/doc/html/boost_asio/reference/ip__basic_resolver_query/protocol_type.html @@ -46,7 +46,7 @@ The
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_resolver_query/service_name.html b/doc/html/boost_asio/reference/ip__basic_resolver_query/service_name.html index 84a43262dd..bd97fecfe0 100644 --- a/doc/html/boost_asio/reference/ip__basic_resolver_query/service_name.html +++ b/doc/html/boost_asio/reference/ip__basic_resolver_query/service_name.html @@ -36,7 +36,7 @@ Get
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_resolver_query/v4_mapped.html b/doc/html/boost_asio/reference/ip__basic_resolver_query/v4_mapped.html index 2381fd628b..fd9ca928b3 100644 --- a/doc/html/boost_asio/reference/ip__basic_resolver_query/v4_mapped.html +++ b/doc/html/boost_asio/reference/ip__basic_resolver_query/v4_mapped.html @@ -40,7 +40,7 @@ If
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_resolver_results.html b/doc/html/boost_asio/reference/ip__basic_resolver_results.html index d8aa6609f2..d6feda6101 100644 --- a/doc/html/boost_asio/reference/ip__basic_resolver_results.html +++ b/doc/html/boost_asio/reference/ip__basic_resolver_results.html @@ -570,7 +570,7 @@ class basic_resolver_results :
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_resolver_results/basic_resolver_results.html b/doc/html/boost_asio/reference/ip__basic_resolver_results/basic_resolver_results.html index b97a9d4fe5..5dbd3d9618 100644 --- a/doc/html/boost_asio/reference/ip__basic_resolver_results/basic_resolver_results.html +++ b/doc/html/boost_asio/reference/ip__basic_resolver_results/basic_resolver_results.html @@ -51,7 +51,7 @@ Default
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_resolver_results/basic_resolver_results/overload1.html b/doc/html/boost_asio/reference/ip__basic_resolver_results/basic_resolver_results/overload1.html index d120b48b40..a6e529dc38 100644 --- a/doc/html/boost_asio/reference/ip__basic_resolver_results/basic_resolver_results/overload1.html +++ b/doc/html/boost_asio/reference/ip__basic_resolver_results/basic_resolver_results/overload1.html @@ -35,7 +35,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_resolver_results/basic_resolver_results/overload2.html b/doc/html/boost_asio/reference/ip__basic_resolver_results/basic_resolver_results/overload2.html index 6dd5191aa9..7fb2f1272d 100644 --- a/doc/html/boost_asio/reference/ip__basic_resolver_results/basic_resolver_results/overload2.html +++ b/doc/html/boost_asio/reference/ip__basic_resolver_results/basic_resolver_results/overload2.html @@ -36,7 +36,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_resolver_results/basic_resolver_results/overload3.html b/doc/html/boost_asio/reference/ip__basic_resolver_results/basic_resolver_results/overload3.html index aea19de560..6f8029d061 100644 --- a/doc/html/boost_asio/reference/ip__basic_resolver_results/basic_resolver_results/overload3.html +++ b/doc/html/boost_asio/reference/ip__basic_resolver_results/basic_resolver_results/overload3.html @@ -36,7 +36,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_resolver_results/begin.html b/doc/html/boost_asio/reference/ip__basic_resolver_results/begin.html index 1a2f6c48a8..fdc378c076 100644 --- a/doc/html/boost_asio/reference/ip__basic_resolver_results/begin.html +++ b/doc/html/boost_asio/reference/ip__basic_resolver_results/begin.html @@ -36,7 +36,7 @@ Obtain
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_resolver_results/cbegin.html b/doc/html/boost_asio/reference/ip__basic_resolver_results/cbegin.html index 0132199b6b..ada2f516d8 100644 --- a/doc/html/boost_asio/reference/ip__basic_resolver_results/cbegin.html +++ b/doc/html/boost_asio/reference/ip__basic_resolver_results/cbegin.html @@ -36,7 +36,7 @@ Obtain
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_resolver_results/cend.html b/doc/html/boost_asio/reference/ip__basic_resolver_results/cend.html index 8ee54ceb20..0dd9e9865e 100644 --- a/doc/html/boost_asio/reference/ip__basic_resolver_results/cend.html +++ b/doc/html/boost_asio/reference/ip__basic_resolver_results/cend.html @@ -36,7 +36,7 @@ Obtain
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_resolver_results/const_iterator.html b/doc/html/boost_asio/reference/ip__basic_resolver_results/const_iterator.html index 4a38ae9bfb..8a5afe6690 100644 --- a/doc/html/boost_asio/reference/ip__basic_resolver_results/const_iterator.html +++ b/doc/html/boost_asio/reference/ip__basic_resolver_results/const_iterator.html @@ -392,7 +392,7 @@ The
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_resolver_results/const_reference.html b/doc/html/boost_asio/reference/ip__basic_resolver_results/const_reference.html index 04bf169bca..5e71f42e28 100644 --- a/doc/html/boost_asio/reference/ip__basic_resolver_results/const_reference.html +++ b/doc/html/boost_asio/reference/ip__basic_resolver_results/const_reference.html @@ -197,7 +197,7 @@ The
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_resolver_results/dereference.html b/doc/html/boost_asio/reference/ip__basic_resolver_results/dereference.html index 771d21a0be..f946b63bec 100644 --- a/doc/html/boost_asio/reference/ip__basic_resolver_results/dereference.html +++ b/doc/html/boost_asio/reference/ip__basic_resolver_results/dereference.html @@ -37,7 +37,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_resolver_results/difference_type.html b/doc/html/boost_asio/reference/ip__basic_resolver_results/difference_type.html index 74c137baba..d349c63fe6 100644 --- a/doc/html/boost_asio/reference/ip__basic_resolver_results/difference_type.html +++ b/doc/html/boost_asio/reference/ip__basic_resolver_results/difference_type.html @@ -46,7 +46,7 @@ Type
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_resolver_results/empty.html b/doc/html/boost_asio/reference/ip__basic_resolver_results/empty.html index ff2916fc77..511bf6b914 100644 --- a/doc/html/boost_asio/reference/ip__basic_resolver_results/empty.html +++ b/doc/html/boost_asio/reference/ip__basic_resolver_results/empty.html @@ -36,7 +36,7 @@ Determine
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_resolver_results/end.html b/doc/html/boost_asio/reference/ip__basic_resolver_results/end.html index 67b5f28e2c..09e57a5aa6 100644 --- a/doc/html/boost_asio/reference/ip__basic_resolver_results/end.html +++ b/doc/html/boost_asio/reference/ip__basic_resolver_results/end.html @@ -36,7 +36,7 @@ Obtain
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_resolver_results/endpoint_type.html b/doc/html/boost_asio/reference/ip__basic_resolver_results/endpoint_type.html index 36566f5967..e99957065d 100644 --- a/doc/html/boost_asio/reference/ip__basic_resolver_results/endpoint_type.html +++ b/doc/html/boost_asio/reference/ip__basic_resolver_results/endpoint_type.html @@ -46,7 +46,7 @@ The
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_resolver_results/equal.html b/doc/html/boost_asio/reference/ip__basic_resolver_results/equal.html index 51134f5ed2..2035ca4733 100644 --- a/doc/html/boost_asio/reference/ip__basic_resolver_results/equal.html +++ b/doc/html/boost_asio/reference/ip__basic_resolver_results/equal.html @@ -38,7 +38,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_resolver_results/increment.html b/doc/html/boost_asio/reference/ip__basic_resolver_results/increment.html index fbd5880a03..2d4a200e8d 100644 --- a/doc/html/boost_asio/reference/ip__basic_resolver_results/increment.html +++ b/doc/html/boost_asio/reference/ip__basic_resolver_results/increment.html @@ -37,7 +37,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_resolver_results/index_.html b/doc/html/boost_asio/reference/ip__basic_resolver_results/index_.html index 83e6e7231e..d0c7b98301 100644 --- a/doc/html/boost_asio/reference/ip__basic_resolver_results/index_.html +++ b/doc/html/boost_asio/reference/ip__basic_resolver_results/index_.html @@ -37,7 +37,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_resolver_results/iterator.html b/doc/html/boost_asio/reference/ip__basic_resolver_results/iterator.html index 9472bf56cc..05dbecd522 100644 --- a/doc/html/boost_asio/reference/ip__basic_resolver_results/iterator.html +++ b/doc/html/boost_asio/reference/ip__basic_resolver_results/iterator.html @@ -392,7 +392,7 @@ The
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_resolver_results/iterator_category.html b/doc/html/boost_asio/reference/ip__basic_resolver_results/iterator_category.html index 5086f83bc0..fe62faad5e 100644 --- a/doc/html/boost_asio/reference/ip__basic_resolver_results/iterator_category.html +++ b/doc/html/boost_asio/reference/ip__basic_resolver_results/iterator_category.html @@ -49,7 +49,7 @@ The
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_resolver_results/max_size.html b/doc/html/boost_asio/reference/ip__basic_resolver_results/max_size.html index fbb28c30d8..66d8d6980d 100644 --- a/doc/html/boost_asio/reference/ip__basic_resolver_results/max_size.html +++ b/doc/html/boost_asio/reference/ip__basic_resolver_results/max_size.html @@ -36,7 +36,7 @@ Get
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_resolver_results/operator__star_.html b/doc/html/boost_asio/reference/ip__basic_resolver_results/operator__star_.html index 61c09fa9f1..86fd08e80b 100644 --- a/doc/html/boost_asio/reference/ip__basic_resolver_results/operator__star_.html +++ b/doc/html/boost_asio/reference/ip__basic_resolver_results/operator__star_.html @@ -39,7 +39,7 @@ Dereference an iterator.
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_resolver_results/operator_arrow_.html b/doc/html/boost_asio/reference/ip__basic_resolver_results/operator_arrow_.html index 23ea6e54c4..53dd1c3b0f 100644 --- a/doc/html/boost_asio/reference/ip__basic_resolver_results/operator_arrow_.html +++ b/doc/html/boost_asio/reference/ip__basic_resolver_results/operator_arrow_.html @@ -39,7 +39,7 @@ Dereference
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_resolver_results/operator_eq_.html b/doc/html/boost_asio/reference/ip__basic_resolver_results/operator_eq_.html index 0118c8f4ca..6d1daa6af4 100644 --- a/doc/html/boost_asio/reference/ip__basic_resolver_results/operator_eq_.html +++ b/doc/html/boost_asio/reference/ip__basic_resolver_results/operator_eq_.html @@ -45,7 +45,7 @@ Assignment
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_resolver_results/operator_eq_/overload1.html b/doc/html/boost_asio/reference/ip__basic_resolver_results/operator_eq_/overload1.html index 7c8ddeb3d1..1e1f62f693 100644 --- a/doc/html/boost_asio/reference/ip__basic_resolver_results/operator_eq_/overload1.html +++ b/doc/html/boost_asio/reference/ip__basic_resolver_results/operator_eq_/overload1.html @@ -36,7 +36,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_resolver_results/operator_eq_/overload2.html b/doc/html/boost_asio/reference/ip__basic_resolver_results/operator_eq_/overload2.html index fbbcb4f033..75e766403a 100644 --- a/doc/html/boost_asio/reference/ip__basic_resolver_results/operator_eq_/overload2.html +++ b/doc/html/boost_asio/reference/ip__basic_resolver_results/operator_eq_/overload2.html @@ -36,7 +36,7 @@
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_resolver_results/operator_eq__eq_.html b/doc/html/boost_asio/reference/ip__basic_resolver_results/operator_eq__eq_.html index e713c7f7a9..8c181fbe00 100644 --- a/doc/html/boost_asio/reference/ip__basic_resolver_results/operator_eq__eq_.html +++ b/doc/html/boost_asio/reference/ip__basic_resolver_results/operator_eq__eq_.html @@ -44,7 +44,7 @@ friend bool
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_resolver_results/operator_eq__eq_/overload1.html b/doc/html/boost_asio/reference/ip__basic_resolver_results/operator_eq__eq_/overload1.html index da9a9557d0..5e1ed285f1 100644 --- a/doc/html/boost_asio/reference/ip__basic_resolver_results/operator_eq__eq_/overload1.html +++ b/doc/html/boost_asio/reference/ip__basic_resolver_results/operator_eq__eq_/overload1.html @@ -47,7 +47,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_resolver_results/operator_eq__eq_/overload2.html b/doc/html/boost_asio/reference/ip__basic_resolver_results/operator_eq__eq_/overload2.html index a971727b2f..c69e42eb42 100644 --- a/doc/html/boost_asio/reference/ip__basic_resolver_results/operator_eq__eq_/overload2.html +++ b/doc/html/boost_asio/reference/ip__basic_resolver_results/operator_eq__eq_/overload2.html @@ -50,7 +50,7 @@
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_resolver_results/operator_not__eq_.html b/doc/html/boost_asio/reference/ip__basic_resolver_results/operator_not__eq_.html index 6f4a51c1e0..2ce4fd323c 100644 --- a/doc/html/boost_asio/reference/ip__basic_resolver_results/operator_not__eq_.html +++ b/doc/html/boost_asio/reference/ip__basic_resolver_results/operator_not__eq_.html @@ -44,7 +44,7 @@ friend bool
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_resolver_results/operator_not__eq_/overload1.html b/doc/html/boost_asio/reference/ip__basic_resolver_results/operator_not__eq_/overload1.html index 2fcb0860ec..cb29483b65 100644 --- a/doc/html/boost_asio/reference/ip__basic_resolver_results/operator_not__eq_/overload1.html +++ b/doc/html/boost_asio/reference/ip__basic_resolver_results/operator_not__eq_/overload1.html @@ -47,7 +47,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_resolver_results/operator_not__eq_/overload2.html b/doc/html/boost_asio/reference/ip__basic_resolver_results/operator_not__eq_/overload2.html index 6919039188..f249f1c6a2 100644 --- a/doc/html/boost_asio/reference/ip__basic_resolver_results/operator_not__eq_/overload2.html +++ b/doc/html/boost_asio/reference/ip__basic_resolver_results/operator_not__eq_/overload2.html @@ -50,7 +50,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_resolver_results/operator_plus__plus_.html b/doc/html/boost_asio/reference/ip__basic_resolver_results/operator_plus__plus_.html index bf6f4a3570..aa457fb2ac 100644 --- a/doc/html/boost_asio/reference/ip__basic_resolver_results/operator_plus__plus_.html +++ b/doc/html/boost_asio/reference/ip__basic_resolver_results/operator_plus__plus_.html @@ -44,7 +44,7 @@ Increment
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_resolver_results/operator_plus__plus_/overload1.html b/doc/html/boost_asio/reference/ip__basic_resolver_results/operator_plus__plus_/overload1.html index ac1865d866..c568c265b8 100644 --- a/doc/html/boost_asio/reference/ip__basic_resolver_results/operator_plus__plus_/overload1.html +++ b/doc/html/boost_asio/reference/ip__basic_resolver_results/operator_plus__plus_/overload1.html @@ -38,7 +38,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_resolver_results/operator_plus__plus_/overload2.html b/doc/html/boost_asio/reference/ip__basic_resolver_results/operator_plus__plus_/overload2.html index d76124fd9d..6a5d804f7b 100644 --- a/doc/html/boost_asio/reference/ip__basic_resolver_results/operator_plus__plus_/overload2.html +++ b/doc/html/boost_asio/reference/ip__basic_resolver_results/operator_plus__plus_/overload2.html @@ -39,7 +39,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_resolver_results/pointer.html b/doc/html/boost_asio/reference/ip__basic_resolver_results/pointer.html index 16f0608855..fccf4d9f82 100644 --- a/doc/html/boost_asio/reference/ip__basic_resolver_results/pointer.html +++ b/doc/html/boost_asio/reference/ip__basic_resolver_results/pointer.html @@ -49,7 +49,7 @@ The
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_resolver_results/protocol_type.html b/doc/html/boost_asio/reference/ip__basic_resolver_results/protocol_type.html index dedf7ebc65..37f02e163e 100644 --- a/doc/html/boost_asio/reference/ip__basic_resolver_results/protocol_type.html +++ b/doc/html/boost_asio/reference/ip__basic_resolver_results/protocol_type.html @@ -46,7 +46,7 @@ The
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_resolver_results/reference.html b/doc/html/boost_asio/reference/ip__basic_resolver_results/reference.html index 56379b9e50..b173cf5689 100644 --- a/doc/html/boost_asio/reference/ip__basic_resolver_results/reference.html +++ b/doc/html/boost_asio/reference/ip__basic_resolver_results/reference.html @@ -197,7 +197,7 @@ The
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_resolver_results/size.html b/doc/html/boost_asio/reference/ip__basic_resolver_results/size.html index 1cb37c74fc..e814646e61 100644 --- a/doc/html/boost_asio/reference/ip__basic_resolver_results/size.html +++ b/doc/html/boost_asio/reference/ip__basic_resolver_results/size.html @@ -36,7 +36,7 @@ Get
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_resolver_results/size_type.html b/doc/html/boost_asio/reference/ip__basic_resolver_results/size_type.html index 7ce44535aa..2bde6c81ed 100644 --- a/doc/html/boost_asio/reference/ip__basic_resolver_results/size_type.html +++ b/doc/html/boost_asio/reference/ip__basic_resolver_results/size_type.html @@ -46,7 +46,7 @@ Type
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_resolver_results/swap.html b/doc/html/boost_asio/reference/ip__basic_resolver_results/swap.html index 1ccfb23fcf..7d88964d74 100644 --- a/doc/html/boost_asio/reference/ip__basic_resolver_results/swap.html +++ b/doc/html/boost_asio/reference/ip__basic_resolver_results/swap.html @@ -37,7 +37,7 @@ Swap
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_resolver_results/value_type.html b/doc/html/boost_asio/reference/ip__basic_resolver_results/value_type.html index c610378a46..b98cf85d07 100644 --- a/doc/html/boost_asio/reference/ip__basic_resolver_results/value_type.html +++ b/doc/html/boost_asio/reference/ip__basic_resolver_results/value_type.html @@ -31,7 +31,7 @@ The type of a value in the results range.

    -
    typedef basic_resolver_entry< endpoint_type > value_type;
+
    typedef basic_resolver_entry< protocol_type > value_type;
 
    
 
    
 
@@ -197,7 +197,7 @@ The
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__basic_resolver_results/values_.html b/doc/html/boost_asio/reference/ip__basic_resolver_results/values_.html index 63923b4652..3a59895e9a 100644 --- a/doc/html/boost_asio/reference/ip__basic_resolver_results/values_.html +++ b/doc/html/boost_asio/reference/ip__basic_resolver_results/values_.html @@ -37,7 +37,7 @@
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__host_name.html b/doc/html/boost_asio/reference/ip__host_name.html index c06c99a3b8..4287c0929c 100644 --- a/doc/html/boost_asio/reference/ip__host_name.html +++ b/doc/html/boost_asio/reference/ip__host_name.html @@ -50,7 +50,7 @@ std::string
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__host_name/overload1.html b/doc/html/boost_asio/reference/ip__host_name/overload1.html index 72d9bd311d..e1e8e3a239 100644 --- a/doc/html/boost_asio/reference/ip__host_name/overload1.html +++ b/doc/html/boost_asio/reference/ip__host_name/overload1.html @@ -35,7 +35,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__host_name/overload2.html b/doc/html/boost_asio/reference/ip__host_name/overload2.html index 4f6475a521..b926ec7bab 100644 --- a/doc/html/boost_asio/reference/ip__host_name/overload2.html +++ b/doc/html/boost_asio/reference/ip__host_name/overload2.html @@ -36,7 +36,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__icmp.html b/doc/html/boost_asio/reference/ip__icmp.html index 01d31a6cda..ff01f5464f 100644 --- a/doc/html/boost_asio/reference/ip__icmp.html +++ b/doc/html/boost_asio/reference/ip__icmp.html @@ -252,7 +252,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__icmp/endpoint.html b/doc/html/boost_asio/reference/ip__icmp/endpoint.html index d3fe9328da..28bcb1f538 100644 --- a/doc/html/boost_asio/reference/ip__icmp/endpoint.html +++ b/doc/html/boost_asio/reference/ip__icmp/endpoint.html @@ -402,7 +402,7 @@ The type of a ICMP
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__icmp/family.html b/doc/html/boost_asio/reference/ip__icmp/family.html index 1649390841..3c33ef9bb0 100644 --- a/doc/html/boost_asio/reference/ip__icmp/family.html +++ b/doc/html/boost_asio/reference/ip__icmp/family.html @@ -36,7 +36,7 @@ Obtain an identifier
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__icmp/operator_eq__eq_.html b/doc/html/boost_asio/reference/ip__icmp/operator_eq__eq_.html index 2bbc6aca34..a7f5b6207e 100644 --- a/doc/html/boost_asio/reference/ip__icmp/operator_eq__eq_.html +++ b/doc/html/boost_asio/reference/ip__icmp/operator_eq__eq_.html @@ -48,7 +48,7 @@ Compare
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__icmp/operator_not__eq_.html b/doc/html/boost_asio/reference/ip__icmp/operator_not__eq_.html index c1d6dd52ba..1db65a4190 100644 --- a/doc/html/boost_asio/reference/ip__icmp/operator_not__eq_.html +++ b/doc/html/boost_asio/reference/ip__icmp/operator_not__eq_.html @@ -48,7 +48,7 @@ Compare
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__icmp/protocol.html b/doc/html/boost_asio/reference/ip__icmp/protocol.html index 13e63e5702..c96b8e130e 100644 --- a/doc/html/boost_asio/reference/ip__icmp/protocol.html +++ b/doc/html/boost_asio/reference/ip__icmp/protocol.html @@ -36,7 +36,7 @@ Obtain an identifier
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__icmp/resolver.html b/doc/html/boost_asio/reference/ip__icmp/resolver.html index e51d0a868f..9f1d0f401c 100644 --- a/doc/html/boost_asio/reference/ip__icmp/resolver.html +++ b/doc/html/boost_asio/reference/ip__icmp/resolver.html @@ -436,7 +436,7 @@ The ICMP resolver
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__icmp/socket.html b/doc/html/boost_asio/reference/ip__icmp/socket.html index f5159e1223..8a4e89c467 100644 --- a/doc/html/boost_asio/reference/ip__icmp/socket.html +++ b/doc/html/boost_asio/reference/ip__icmp/socket.html @@ -940,7 +940,7 @@ The ICMP socket type.
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__icmp/type.html b/doc/html/boost_asio/reference/ip__icmp/type.html index db51b16687..1ec1a50c7b 100644 --- a/doc/html/boost_asio/reference/ip__icmp/type.html +++ b/doc/html/boost_asio/reference/ip__icmp/type.html @@ -36,7 +36,7 @@ Obtain an identifier for
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__icmp/v4.html b/doc/html/boost_asio/reference/ip__icmp/v4.html index 9c40547dc2..6dc9a34f07 100644 --- a/doc/html/boost_asio/reference/ip__icmp/v4.html +++ b/doc/html/boost_asio/reference/ip__icmp/v4.html @@ -36,7 +36,7 @@ Construct to represent the IPv4
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__icmp/v6.html b/doc/html/boost_asio/reference/ip__icmp/v6.html index 5592a07e57..af79f4ba46 100644 --- a/doc/html/boost_asio/reference/ip__icmp/v6.html +++ b/doc/html/boost_asio/reference/ip__icmp/v6.html @@ -36,7 +36,7 @@ Construct to represent the IPv6
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__multicast__enable_loopback.html b/doc/html/boost_asio/reference/ip__multicast__enable_loopback.html index d9a8d64da2..65f98b27ac 100644 --- a/doc/html/boost_asio/reference/ip__multicast__enable_loopback.html +++ b/doc/html/boost_asio/reference/ip__multicast__enable_loopback.html @@ -71,7 +71,7 @@ bool is_set = option.value();
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__multicast__hops.html b/doc/html/boost_asio/reference/ip__multicast__hops.html index 95b7bd338e..7573672105 100644 --- a/doc/html/boost_asio/reference/ip__multicast__hops.html +++ b/doc/html/boost_asio/reference/ip__multicast__hops.html @@ -70,7 +70,7 @@ int ttl = option.value();
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__multicast__join_group.html b/doc/html/boost_asio/reference/ip__multicast__join_group.html index 641ea8f9ee..e09b247029 100644 --- a/doc/html/boost_asio/reference/ip__multicast__join_group.html +++ b/doc/html/boost_asio/reference/ip__multicast__join_group.html @@ -63,7 +63,7 @@ socket.set_option(option);
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__multicast__leave_group.html b/doc/html/boost_asio/reference/ip__multicast__leave_group.html index 1000e2a4f8..044af79002 100644 --- a/doc/html/boost_asio/reference/ip__multicast__leave_group.html +++ b/doc/html/boost_asio/reference/ip__multicast__leave_group.html @@ -63,7 +63,7 @@ socket.set_option(option);
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__multicast__outbound_interface.html b/doc/html/boost_asio/reference/ip__multicast__outbound_interface.html index 32c5f81134..154fea4155 100644 --- a/doc/html/boost_asio/reference/ip__multicast__outbound_interface.html +++ b/doc/html/boost_asio/reference/ip__multicast__outbound_interface.html @@ -63,7 +63,7 @@ socket.set_option(option);
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__network_v4.html b/doc/html/boost_asio/reference/ip__network_v4.html index 7c89f4faf7..011b6eccbc 100644 --- a/doc/html/boost_asio/reference/ip__network_v4.html +++ b/doc/html/boost_asio/reference/ip__network_v4.html @@ -323,7 +323,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__network_v4/address.html b/doc/html/boost_asio/reference/ip__network_v4/address.html index 68396fa2a8..ea160de143 100644 --- a/doc/html/boost_asio/reference/ip__network_v4/address.html +++ b/doc/html/boost_asio/reference/ip__network_v4/address.html @@ -36,7 +36,7 @@ Obtain
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__network_v4/broadcast.html b/doc/html/boost_asio/reference/ip__network_v4/broadcast.html index 5e67a58a91..a0e0ad5c7f 100644 --- a/doc/html/boost_asio/reference/ip__network_v4/broadcast.html +++ b/doc/html/boost_asio/reference/ip__network_v4/broadcast.html @@ -36,7 +36,7 @@ Obtain
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__network_v4/canonical.html b/doc/html/boost_asio/reference/ip__network_v4/canonical.html index 97e7a27f4a..a8b72279ac 100644 --- a/doc/html/boost_asio/reference/ip__network_v4/canonical.html +++ b/doc/html/boost_asio/reference/ip__network_v4/canonical.html @@ -36,7 +36,7 @@ Obtain
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__network_v4/hosts.html b/doc/html/boost_asio/reference/ip__network_v4/hosts.html index 70a1442b0f..1de670cfe1 100644 --- a/doc/html/boost_asio/reference/ip__network_v4/hosts.html +++ b/doc/html/boost_asio/reference/ip__network_v4/hosts.html @@ -36,7 +36,7 @@ Obtain an address
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__network_v4/is_host.html b/doc/html/boost_asio/reference/ip__network_v4/is_host.html index 8895744444..732c2b2c93 100644 --- a/doc/html/boost_asio/reference/ip__network_v4/is_host.html +++ b/doc/html/boost_asio/reference/ip__network_v4/is_host.html @@ -36,7 +36,7 @@ Test if
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__network_v4/is_subnet_of.html b/doc/html/boost_asio/reference/ip__network_v4/is_subnet_of.html index f2befc8a50..4d7d74c789 100644 --- a/doc/html/boost_asio/reference/ip__network_v4/is_subnet_of.html +++ b/doc/html/boost_asio/reference/ip__network_v4/is_subnet_of.html @@ -37,7 +37,7 @@ Test
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__network_v4/make_network_v4.html b/doc/html/boost_asio/reference/ip__network_v4/make_network_v4.html index 2e0cb2cdf1..5fc4d79c0a 100644 --- a/doc/html/boost_asio/reference/ip__network_v4/make_network_v4.html +++ b/doc/html/boost_asio/reference/ip__network_v4/make_network_v4.html @@ -61,7 +61,7 @@ network_v4
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__network_v4/make_network_v4/overload1.html b/doc/html/boost_asio/reference/ip__network_v4/make_network_v4/overload1.html index 4f9563ec9b..032649f39f 100644 --- a/doc/html/boost_asio/reference/ip__network_v4/make_network_v4/overload1.html +++ b/doc/html/boost_asio/reference/ip__network_v4/make_network_v4/overload1.html @@ -37,7 +37,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__network_v4/make_network_v4/overload2.html b/doc/html/boost_asio/reference/ip__network_v4/make_network_v4/overload2.html index aa083f1a25..ce8c31e224 100644 --- a/doc/html/boost_asio/reference/ip__network_v4/make_network_v4/overload2.html +++ b/doc/html/boost_asio/reference/ip__network_v4/make_network_v4/overload2.html @@ -38,7 +38,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__network_v4/make_network_v4/overload3.html b/doc/html/boost_asio/reference/ip__network_v4/make_network_v4/overload3.html index ce62f0cf0f..5440396aad 100644 --- a/doc/html/boost_asio/reference/ip__network_v4/make_network_v4/overload3.html +++ b/doc/html/boost_asio/reference/ip__network_v4/make_network_v4/overload3.html @@ -37,7 +37,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__network_v4/make_network_v4/overload4.html b/doc/html/boost_asio/reference/ip__network_v4/make_network_v4/overload4.html index 2eab48716e..d4df2ea80c 100644 --- a/doc/html/boost_asio/reference/ip__network_v4/make_network_v4/overload4.html +++ b/doc/html/boost_asio/reference/ip__network_v4/make_network_v4/overload4.html @@ -38,7 +38,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__network_v4/make_network_v4/overload5.html b/doc/html/boost_asio/reference/ip__network_v4/make_network_v4/overload5.html index 0761d7d7a2..297e9a0634 100644 --- a/doc/html/boost_asio/reference/ip__network_v4/make_network_v4/overload5.html +++ b/doc/html/boost_asio/reference/ip__network_v4/make_network_v4/overload5.html @@ -37,7 +37,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__network_v4/make_network_v4/overload6.html b/doc/html/boost_asio/reference/ip__network_v4/make_network_v4/overload6.html index 85f87d3858..9ab4ea1337 100644 --- a/doc/html/boost_asio/reference/ip__network_v4/make_network_v4/overload6.html +++ b/doc/html/boost_asio/reference/ip__network_v4/make_network_v4/overload6.html @@ -38,7 +38,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__network_v4/netmask.html b/doc/html/boost_asio/reference/ip__network_v4/netmask.html index 4b34a5a044..9e33783074 100644 --- a/doc/html/boost_asio/reference/ip__network_v4/netmask.html +++ b/doc/html/boost_asio/reference/ip__network_v4/netmask.html @@ -36,7 +36,7 @@ Obtain
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__network_v4/network.html b/doc/html/boost_asio/reference/ip__network_v4/network.html index d89f0c3a0b..54553c8561 100644 --- a/doc/html/boost_asio/reference/ip__network_v4/network.html +++ b/doc/html/boost_asio/reference/ip__network_v4/network.html @@ -36,7 +36,7 @@ Obtain
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__network_v4/network_v4.html b/doc/html/boost_asio/reference/ip__network_v4/network_v4.html index 3344f43715..da2c9c18ab 100644 --- a/doc/html/boost_asio/reference/ip__network_v4/network_v4.html +++ b/doc/html/boost_asio/reference/ip__network_v4/network_v4.html @@ -60,7 +60,7 @@ Default
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__network_v4/network_v4/overload1.html b/doc/html/boost_asio/reference/ip__network_v4/network_v4/overload1.html index 45ec53091d..4bae4b998a 100644 --- a/doc/html/boost_asio/reference/ip__network_v4/network_v4/overload1.html +++ b/doc/html/boost_asio/reference/ip__network_v4/network_v4/overload1.html @@ -35,7 +35,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__network_v4/network_v4/overload2.html b/doc/html/boost_asio/reference/ip__network_v4/network_v4/overload2.html index 6c122d76ea..d275234cf2 100644 --- a/doc/html/boost_asio/reference/ip__network_v4/network_v4/overload2.html +++ b/doc/html/boost_asio/reference/ip__network_v4/network_v4/overload2.html @@ -37,7 +37,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__network_v4/network_v4/overload3.html b/doc/html/boost_asio/reference/ip__network_v4/network_v4/overload3.html index cd3a9dab99..087a3b5c68 100644 --- a/doc/html/boost_asio/reference/ip__network_v4/network_v4/overload3.html +++ b/doc/html/boost_asio/reference/ip__network_v4/network_v4/overload3.html @@ -37,7 +37,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__network_v4/network_v4/overload4.html b/doc/html/boost_asio/reference/ip__network_v4/network_v4/overload4.html index 52a5788106..0f7ebd5aab 100644 --- a/doc/html/boost_asio/reference/ip__network_v4/network_v4/overload4.html +++ b/doc/html/boost_asio/reference/ip__network_v4/network_v4/overload4.html @@ -36,7 +36,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__network_v4/operator_eq_.html b/doc/html/boost_asio/reference/ip__network_v4/operator_eq_.html index 45e4234d85..21996ef797 100644 --- a/doc/html/boost_asio/reference/ip__network_v4/operator_eq_.html +++ b/doc/html/boost_asio/reference/ip__network_v4/operator_eq_.html @@ -37,7 +37,7 @@ Assign
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__network_v4/operator_eq__eq_.html b/doc/html/boost_asio/reference/ip__network_v4/operator_eq__eq_.html index c224754540..7f38447c00 100644 --- a/doc/html/boost_asio/reference/ip__network_v4/operator_eq__eq_.html +++ b/doc/html/boost_asio/reference/ip__network_v4/operator_eq__eq_.html @@ -48,7 +48,7 @@ Compare
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__network_v4/operator_not__eq_.html b/doc/html/boost_asio/reference/ip__network_v4/operator_not__eq_.html index 0369ef6e1e..7a311c9656 100644 --- a/doc/html/boost_asio/reference/ip__network_v4/operator_not__eq_.html +++ b/doc/html/boost_asio/reference/ip__network_v4/operator_not__eq_.html @@ -48,7 +48,7 @@ Compare
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__network_v4/prefix_length.html b/doc/html/boost_asio/reference/ip__network_v4/prefix_length.html index 83f0111f29..2d5de5e1dd 100644 --- a/doc/html/boost_asio/reference/ip__network_v4/prefix_length.html +++ b/doc/html/boost_asio/reference/ip__network_v4/prefix_length.html @@ -36,7 +36,7 @@ Obtain
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__network_v4/to_string.html b/doc/html/boost_asio/reference/ip__network_v4/to_string.html index d6182a6801..aa2d447444 100644 --- a/doc/html/boost_asio/reference/ip__network_v4/to_string.html +++ b/doc/html/boost_asio/reference/ip__network_v4/to_string.html @@ -41,7 +41,7 @@ std::string
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__network_v4/to_string/overload1.html b/doc/html/boost_asio/reference/ip__network_v4/to_string/overload1.html index 0ce398a4ee..86e40a9819 100644 --- a/doc/html/boost_asio/reference/ip__network_v4/to_string/overload1.html +++ b/doc/html/boost_asio/reference/ip__network_v4/to_string/overload1.html @@ -35,7 +35,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__network_v4/to_string/overload2.html b/doc/html/boost_asio/reference/ip__network_v4/to_string/overload2.html index 964fdff895..3de06b03fb 100644 --- a/doc/html/boost_asio/reference/ip__network_v4/to_string/overload2.html +++ b/doc/html/boost_asio/reference/ip__network_v4/to_string/overload2.html @@ -36,7 +36,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__network_v6.html b/doc/html/boost_asio/reference/ip__network_v6.html index 54dcefb6c7..0dc8a39ee3 100644 --- a/doc/html/boost_asio/reference/ip__network_v6.html +++ b/doc/html/boost_asio/reference/ip__network_v6.html @@ -294,7 +294,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__network_v6/address.html b/doc/html/boost_asio/reference/ip__network_v6/address.html index b8e8a342d0..b69b1a3db3 100644 --- a/doc/html/boost_asio/reference/ip__network_v6/address.html +++ b/doc/html/boost_asio/reference/ip__network_v6/address.html @@ -36,7 +36,7 @@ Obtain
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__network_v6/canonical.html b/doc/html/boost_asio/reference/ip__network_v6/canonical.html index 008e087b5a..4a7c049dc0 100644 --- a/doc/html/boost_asio/reference/ip__network_v6/canonical.html +++ b/doc/html/boost_asio/reference/ip__network_v6/canonical.html @@ -36,7 +36,7 @@ Obtain
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__network_v6/hosts.html b/doc/html/boost_asio/reference/ip__network_v6/hosts.html index a405601c6b..7122664d01 100644 --- a/doc/html/boost_asio/reference/ip__network_v6/hosts.html +++ b/doc/html/boost_asio/reference/ip__network_v6/hosts.html @@ -36,7 +36,7 @@ Obtain an address
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__network_v6/is_host.html b/doc/html/boost_asio/reference/ip__network_v6/is_host.html index 8334331ad8..b9a991dbc0 100644 --- a/doc/html/boost_asio/reference/ip__network_v6/is_host.html +++ b/doc/html/boost_asio/reference/ip__network_v6/is_host.html @@ -36,7 +36,7 @@ Test if
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__network_v6/is_subnet_of.html b/doc/html/boost_asio/reference/ip__network_v6/is_subnet_of.html index 16d183af59..a98639f13c 100644 --- a/doc/html/boost_asio/reference/ip__network_v6/is_subnet_of.html +++ b/doc/html/boost_asio/reference/ip__network_v6/is_subnet_of.html @@ -37,7 +37,7 @@ Test
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__network_v6/make_network_v6.html b/doc/html/boost_asio/reference/ip__network_v6/make_network_v6.html index 1ca0575747..9c5277a70b 100644 --- a/doc/html/boost_asio/reference/ip__network_v6/make_network_v6.html +++ b/doc/html/boost_asio/reference/ip__network_v6/make_network_v6.html @@ -61,7 +61,7 @@ network_v6
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__network_v6/make_network_v6/overload1.html b/doc/html/boost_asio/reference/ip__network_v6/make_network_v6/overload1.html index a4bdccc6d3..18c59b735a 100644 --- a/doc/html/boost_asio/reference/ip__network_v6/make_network_v6/overload1.html +++ b/doc/html/boost_asio/reference/ip__network_v6/make_network_v6/overload1.html @@ -37,7 +37,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__network_v6/make_network_v6/overload2.html b/doc/html/boost_asio/reference/ip__network_v6/make_network_v6/overload2.html index 88790f204b..7265bcf429 100644 --- a/doc/html/boost_asio/reference/ip__network_v6/make_network_v6/overload2.html +++ b/doc/html/boost_asio/reference/ip__network_v6/make_network_v6/overload2.html @@ -38,7 +38,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__network_v6/make_network_v6/overload3.html b/doc/html/boost_asio/reference/ip__network_v6/make_network_v6/overload3.html index 972cab1fea..92d0983f3a 100644 --- a/doc/html/boost_asio/reference/ip__network_v6/make_network_v6/overload3.html +++ b/doc/html/boost_asio/reference/ip__network_v6/make_network_v6/overload3.html @@ -37,7 +37,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__network_v6/make_network_v6/overload4.html b/doc/html/boost_asio/reference/ip__network_v6/make_network_v6/overload4.html index 75334afc8f..11460e0ec8 100644 --- a/doc/html/boost_asio/reference/ip__network_v6/make_network_v6/overload4.html +++ b/doc/html/boost_asio/reference/ip__network_v6/make_network_v6/overload4.html @@ -38,7 +38,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__network_v6/make_network_v6/overload5.html b/doc/html/boost_asio/reference/ip__network_v6/make_network_v6/overload5.html index f23e026e03..a245e4b908 100644 --- a/doc/html/boost_asio/reference/ip__network_v6/make_network_v6/overload5.html +++ b/doc/html/boost_asio/reference/ip__network_v6/make_network_v6/overload5.html @@ -37,7 +37,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__network_v6/make_network_v6/overload6.html b/doc/html/boost_asio/reference/ip__network_v6/make_network_v6/overload6.html index 1776f9b47b..fa85579fa8 100644 --- a/doc/html/boost_asio/reference/ip__network_v6/make_network_v6/overload6.html +++ b/doc/html/boost_asio/reference/ip__network_v6/make_network_v6/overload6.html @@ -38,7 +38,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__network_v6/network.html b/doc/html/boost_asio/reference/ip__network_v6/network.html index d7f881331c..b7b675406f 100644 --- a/doc/html/boost_asio/reference/ip__network_v6/network.html +++ b/doc/html/boost_asio/reference/ip__network_v6/network.html @@ -36,7 +36,7 @@ Obtain
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__network_v6/network_v6.html b/doc/html/boost_asio/reference/ip__network_v6/network_v6.html index 1d35dd2292..ad9a971942 100644 --- a/doc/html/boost_asio/reference/ip__network_v6/network_v6.html +++ b/doc/html/boost_asio/reference/ip__network_v6/network_v6.html @@ -52,7 +52,7 @@ Default
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__network_v6/network_v6/overload1.html b/doc/html/boost_asio/reference/ip__network_v6/network_v6/overload1.html index 44b89a6b21..2068c79b67 100644 --- a/doc/html/boost_asio/reference/ip__network_v6/network_v6/overload1.html +++ b/doc/html/boost_asio/reference/ip__network_v6/network_v6/overload1.html @@ -35,7 +35,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__network_v6/network_v6/overload2.html b/doc/html/boost_asio/reference/ip__network_v6/network_v6/overload2.html index 86d809bef6..a0a3fffdb3 100644 --- a/doc/html/boost_asio/reference/ip__network_v6/network_v6/overload2.html +++ b/doc/html/boost_asio/reference/ip__network_v6/network_v6/overload2.html @@ -37,7 +37,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__network_v6/network_v6/overload3.html b/doc/html/boost_asio/reference/ip__network_v6/network_v6/overload3.html index 2f43d8b478..f89916c9c2 100644 --- a/doc/html/boost_asio/reference/ip__network_v6/network_v6/overload3.html +++ b/doc/html/boost_asio/reference/ip__network_v6/network_v6/overload3.html @@ -36,7 +36,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__network_v6/operator_eq_.html b/doc/html/boost_asio/reference/ip__network_v6/operator_eq_.html index 80e1d92a38..5ae72da044 100644 --- a/doc/html/boost_asio/reference/ip__network_v6/operator_eq_.html +++ b/doc/html/boost_asio/reference/ip__network_v6/operator_eq_.html @@ -37,7 +37,7 @@ Assign
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__network_v6/operator_eq__eq_.html b/doc/html/boost_asio/reference/ip__network_v6/operator_eq__eq_.html index 4456625c1f..97dc3e335f 100644 --- a/doc/html/boost_asio/reference/ip__network_v6/operator_eq__eq_.html +++ b/doc/html/boost_asio/reference/ip__network_v6/operator_eq__eq_.html @@ -48,7 +48,7 @@ Compare
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__network_v6/operator_not__eq_.html b/doc/html/boost_asio/reference/ip__network_v6/operator_not__eq_.html index 49092f711e..7a590be3e0 100644 --- a/doc/html/boost_asio/reference/ip__network_v6/operator_not__eq_.html +++ b/doc/html/boost_asio/reference/ip__network_v6/operator_not__eq_.html @@ -48,7 +48,7 @@ Compare
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__network_v6/prefix_length.html b/doc/html/boost_asio/reference/ip__network_v6/prefix_length.html index f5013d73d5..a2581bd171 100644 --- a/doc/html/boost_asio/reference/ip__network_v6/prefix_length.html +++ b/doc/html/boost_asio/reference/ip__network_v6/prefix_length.html @@ -36,7 +36,7 @@ Obtain
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__network_v6/to_string.html b/doc/html/boost_asio/reference/ip__network_v6/to_string.html index 34e2df76c3..02b7cc7add 100644 --- a/doc/html/boost_asio/reference/ip__network_v6/to_string.html +++ b/doc/html/boost_asio/reference/ip__network_v6/to_string.html @@ -41,7 +41,7 @@ std::string
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__network_v6/to_string/overload1.html b/doc/html/boost_asio/reference/ip__network_v6/to_string/overload1.html index ef036cccd8..65ee9ac8d3 100644 --- a/doc/html/boost_asio/reference/ip__network_v6/to_string/overload1.html +++ b/doc/html/boost_asio/reference/ip__network_v6/to_string/overload1.html @@ -35,7 +35,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__network_v6/to_string/overload2.html b/doc/html/boost_asio/reference/ip__network_v6/to_string/overload2.html index 3e41a59b10..8dc4274b38 100644 --- a/doc/html/boost_asio/reference/ip__network_v6/to_string/overload2.html +++ b/doc/html/boost_asio/reference/ip__network_v6/to_string/overload2.html @@ -36,7 +36,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__resolver_base.html b/doc/html/boost_asio/reference/ip__resolver_base.html index 2c8a61b343..c45b113e9d 100644 --- a/doc/html/boost_asio/reference/ip__resolver_base.html +++ b/doc/html/boost_asio/reference/ip__resolver_base.html @@ -230,7 +230,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__resolver_base/_resolver_base.html b/doc/html/boost_asio/reference/ip__resolver_base/_resolver_base.html index 81cf0faed7..5bd934f4c9 100644 --- a/doc/html/boost_asio/reference/ip__resolver_base/_resolver_base.html +++ b/doc/html/boost_asio/reference/ip__resolver_base/_resolver_base.html @@ -36,7 +36,7 @@ Protected
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__resolver_base/address_configured.html b/doc/html/boost_asio/reference/ip__resolver_base/address_configured.html index 01ee4b5973..768f22335e 100644 --- a/doc/html/boost_asio/reference/ip__resolver_base/address_configured.html +++ b/doc/html/boost_asio/reference/ip__resolver_base/address_configured.html @@ -38,7 +38,7 @@ Only
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__resolver_base/all_matching.html b/doc/html/boost_asio/reference/ip__resolver_base/all_matching.html index fe2c27c647..5b47eb37f3 100644 --- a/doc/html/boost_asio/reference/ip__resolver_base/all_matching.html +++ b/doc/html/boost_asio/reference/ip__resolver_base/all_matching.html @@ -36,7 +36,7 @@ If
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__resolver_base/canonical_name.html b/doc/html/boost_asio/reference/ip__resolver_base/canonical_name.html index 6cf279caaf..1405661de1 100644 --- a/doc/html/boost_asio/reference/ip__resolver_base/canonical_name.html +++ b/doc/html/boost_asio/reference/ip__resolver_base/canonical_name.html @@ -36,7 +36,7 @@ Determine
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__resolver_base/flags.html b/doc/html/boost_asio/reference/ip__resolver_base/flags.html index 59de46f274..2941f910d4 100644 --- a/doc/html/boost_asio/reference/ip__resolver_base/flags.html +++ b/doc/html/boost_asio/reference/ip__resolver_base/flags.html @@ -46,7 +46,7 @@ A bitmask
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__resolver_base/numeric_host.html b/doc/html/boost_asio/reference/ip__resolver_base/numeric_host.html index 07d51022b4..6fd3363981 100644 --- a/doc/html/boost_asio/reference/ip__resolver_base/numeric_host.html +++ b/doc/html/boost_asio/reference/ip__resolver_base/numeric_host.html @@ -37,7 +37,7 @@ Host
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__resolver_base/numeric_service.html b/doc/html/boost_asio/reference/ip__resolver_base/numeric_service.html index 8e279246aa..802617318c 100644 --- a/doc/html/boost_asio/reference/ip__resolver_base/numeric_service.html +++ b/doc/html/boost_asio/reference/ip__resolver_base/numeric_service.html @@ -37,7 +37,7 @@ Service
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__resolver_base/passive.html b/doc/html/boost_asio/reference/ip__resolver_base/passive.html index 72767c6aee..e64cd603a0 100644 --- a/doc/html/boost_asio/reference/ip__resolver_base/passive.html +++ b/doc/html/boost_asio/reference/ip__resolver_base/passive.html @@ -36,7 +36,7 @@ Indicate
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__resolver_base/v4_mapped.html b/doc/html/boost_asio/reference/ip__resolver_base/v4_mapped.html index b1d1b4be01..5a951f2e82 100644 --- a/doc/html/boost_asio/reference/ip__resolver_base/v4_mapped.html +++ b/doc/html/boost_asio/reference/ip__resolver_base/v4_mapped.html @@ -37,7 +37,7 @@ If
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__resolver_query_base.html b/doc/html/boost_asio/reference/ip__resolver_query_base.html index 4633e45aeb..04f415ca19 100644 --- a/doc/html/boost_asio/reference/ip__resolver_query_base.html +++ b/doc/html/boost_asio/reference/ip__resolver_query_base.html @@ -231,7 +231,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__resolver_query_base/_resolver_query_base.html b/doc/html/boost_asio/reference/ip__resolver_query_base/_resolver_query_base.html index 13b3832992..716a276884 100644 --- a/doc/html/boost_asio/reference/ip__resolver_query_base/_resolver_query_base.html +++ b/doc/html/boost_asio/reference/ip__resolver_query_base/_resolver_query_base.html @@ -36,7 +36,7 @@ Protected
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__resolver_query_base/address_configured.html b/doc/html/boost_asio/reference/ip__resolver_query_base/address_configured.html index ec6f710e53..8932d2c00d 100644 --- a/doc/html/boost_asio/reference/ip__resolver_query_base/address_configured.html +++ b/doc/html/boost_asio/reference/ip__resolver_query_base/address_configured.html @@ -41,7 +41,7 @@ Only
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__resolver_query_base/all_matching.html b/doc/html/boost_asio/reference/ip__resolver_query_base/all_matching.html index 72bd576219..cb1cacbdb9 100644 --- a/doc/html/boost_asio/reference/ip__resolver_query_base/all_matching.html +++ b/doc/html/boost_asio/reference/ip__resolver_query_base/all_matching.html @@ -39,7 +39,7 @@ If
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__resolver_query_base/canonical_name.html b/doc/html/boost_asio/reference/ip__resolver_query_base/canonical_name.html index 96bc5154ec..07e217b3df 100644 --- a/doc/html/boost_asio/reference/ip__resolver_query_base/canonical_name.html +++ b/doc/html/boost_asio/reference/ip__resolver_query_base/canonical_name.html @@ -39,7 +39,7 @@ Determine
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__resolver_query_base/flags.html b/doc/html/boost_asio/reference/ip__resolver_query_base/flags.html index dc09b333be..0781ff3612 100644 --- a/doc/html/boost_asio/reference/ip__resolver_query_base/flags.html +++ b/doc/html/boost_asio/reference/ip__resolver_query_base/flags.html @@ -49,7 +49,7 @@ A
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__resolver_query_base/numeric_host.html b/doc/html/boost_asio/reference/ip__resolver_query_base/numeric_host.html index 6e702e2506..0fff5e5e82 100644 --- a/doc/html/boost_asio/reference/ip__resolver_query_base/numeric_host.html +++ b/doc/html/boost_asio/reference/ip__resolver_query_base/numeric_host.html @@ -40,7 +40,7 @@ Host
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__resolver_query_base/numeric_service.html b/doc/html/boost_asio/reference/ip__resolver_query_base/numeric_service.html index eafd0ab9d7..3554f398f5 100644 --- a/doc/html/boost_asio/reference/ip__resolver_query_base/numeric_service.html +++ b/doc/html/boost_asio/reference/ip__resolver_query_base/numeric_service.html @@ -40,7 +40,7 @@ Service
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__resolver_query_base/passive.html b/doc/html/boost_asio/reference/ip__resolver_query_base/passive.html index e29f65ffe9..782f903682 100644 --- a/doc/html/boost_asio/reference/ip__resolver_query_base/passive.html +++ b/doc/html/boost_asio/reference/ip__resolver_query_base/passive.html @@ -39,7 +39,7 @@ Indicate
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__resolver_query_base/v4_mapped.html b/doc/html/boost_asio/reference/ip__resolver_query_base/v4_mapped.html index f27cdac159..60e643aeb2 100644 --- a/doc/html/boost_asio/reference/ip__resolver_query_base/v4_mapped.html +++ b/doc/html/boost_asio/reference/ip__resolver_query_base/v4_mapped.html @@ -40,7 +40,7 @@ If
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__tcp.html b/doc/html/boost_asio/reference/ip__tcp.html index fe47dfda0f..3463bd912d 100644 --- a/doc/html/boost_asio/reference/ip__tcp.html +++ b/doc/html/boost_asio/reference/ip__tcp.html @@ -288,7 +288,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__tcp/acceptor.html b/doc/html/boost_asio/reference/ip__tcp/acceptor.html index b194a8e998..4bdec8f8fa 100644 --- a/doc/html/boost_asio/reference/ip__tcp/acceptor.html +++ b/doc/html/boost_asio/reference/ip__tcp/acceptor.html @@ -797,7 +797,7 @@ acceptor.listen();
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__tcp/endpoint.html b/doc/html/boost_asio/reference/ip__tcp/endpoint.html index 786c445b6f..0b324e8f71 100644 --- a/doc/html/boost_asio/reference/ip__tcp/endpoint.html +++ b/doc/html/boost_asio/reference/ip__tcp/endpoint.html @@ -401,7 +401,7 @@ The type of a TCP endpoint.
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__tcp/family.html b/doc/html/boost_asio/reference/ip__tcp/family.html index e265c65664..be6d9e3676 100644 --- a/doc/html/boost_asio/reference/ip__tcp/family.html +++ b/doc/html/boost_asio/reference/ip__tcp/family.html @@ -36,7 +36,7 @@ Obtain an identifier for
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__tcp/iostream.html b/doc/html/boost_asio/reference/ip__tcp/iostream.html index 8cfb528d8e..7fc8ffe575 100644 --- a/doc/html/boost_asio/reference/ip__tcp/iostream.html +++ b/doc/html/boost_asio/reference/ip__tcp/iostream.html @@ -330,7 +330,7 @@ The TCP iostream type.
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__tcp/no_delay.html b/doc/html/boost_asio/reference/ip__tcp/no_delay.html index e9381c5200..b8146d61c8 100644 --- a/doc/html/boost_asio/reference/ip__tcp/no_delay.html +++ b/doc/html/boost_asio/reference/ip__tcp/no_delay.html @@ -70,7 +70,7 @@ bool is_set = option.value();
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__tcp/operator_eq__eq_.html b/doc/html/boost_asio/reference/ip__tcp/operator_eq__eq_.html index 3a057edde3..4fd5528b0b 100644 --- a/doc/html/boost_asio/reference/ip__tcp/operator_eq__eq_.html +++ b/doc/html/boost_asio/reference/ip__tcp/operator_eq__eq_.html @@ -48,7 +48,7 @@ Compare two
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__tcp/operator_not__eq_.html b/doc/html/boost_asio/reference/ip__tcp/operator_not__eq_.html index 63e62d4a0e..b228fd9739 100644 --- a/doc/html/boost_asio/reference/ip__tcp/operator_not__eq_.html +++ b/doc/html/boost_asio/reference/ip__tcp/operator_not__eq_.html @@ -48,7 +48,7 @@ Compare
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__tcp/protocol.html b/doc/html/boost_asio/reference/ip__tcp/protocol.html index 049a207862..de77201129 100644 --- a/doc/html/boost_asio/reference/ip__tcp/protocol.html +++ b/doc/html/boost_asio/reference/ip__tcp/protocol.html @@ -36,7 +36,7 @@ Obtain an identifier
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__tcp/resolver.html b/doc/html/boost_asio/reference/ip__tcp/resolver.html index f7845f759f..362a10d591 100644 --- a/doc/html/boost_asio/reference/ip__tcp/resolver.html +++ b/doc/html/boost_asio/reference/ip__tcp/resolver.html @@ -435,7 +435,7 @@ The TCP resolver type.
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__tcp/socket.html b/doc/html/boost_asio/reference/ip__tcp/socket.html index 6d752a5e05..983950e513 100644 --- a/doc/html/boost_asio/reference/ip__tcp/socket.html +++ b/doc/html/boost_asio/reference/ip__tcp/socket.html @@ -944,7 +944,7 @@ The TCP socket type.
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__tcp/type.html b/doc/html/boost_asio/reference/ip__tcp/type.html index 7f8269c813..e23c185c7e 100644 --- a/doc/html/boost_asio/reference/ip__tcp/type.html +++ b/doc/html/boost_asio/reference/ip__tcp/type.html @@ -36,7 +36,7 @@ Obtain an identifier for the
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__tcp/v4.html b/doc/html/boost_asio/reference/ip__tcp/v4.html index fe33a25488..98d0d2232a 100644 --- a/doc/html/boost_asio/reference/ip__tcp/v4.html +++ b/doc/html/boost_asio/reference/ip__tcp/v4.html @@ -36,7 +36,7 @@ Construct to represent the IPv4
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__tcp/v6.html b/doc/html/boost_asio/reference/ip__tcp/v6.html index d4e7497a53..f55cc617f7 100644 --- a/doc/html/boost_asio/reference/ip__tcp/v6.html +++ b/doc/html/boost_asio/reference/ip__tcp/v6.html @@ -36,7 +36,7 @@ Construct to represent the IPv6
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__udp.html b/doc/html/boost_asio/reference/ip__udp.html index a6a904be6b..631f817435 100644 --- a/doc/html/boost_asio/reference/ip__udp.html +++ b/doc/html/boost_asio/reference/ip__udp.html @@ -252,7 +252,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__udp/endpoint.html b/doc/html/boost_asio/reference/ip__udp/endpoint.html index 879f785b07..8a4c90a514 100644 --- a/doc/html/boost_asio/reference/ip__udp/endpoint.html +++ b/doc/html/boost_asio/reference/ip__udp/endpoint.html @@ -401,7 +401,7 @@ The type of a UDP endpoint.
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__udp/family.html b/doc/html/boost_asio/reference/ip__udp/family.html index b9e0f15520..83e0bea665 100644 --- a/doc/html/boost_asio/reference/ip__udp/family.html +++ b/doc/html/boost_asio/reference/ip__udp/family.html @@ -36,7 +36,7 @@ Obtain an identifier for
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__udp/operator_eq__eq_.html b/doc/html/boost_asio/reference/ip__udp/operator_eq__eq_.html index f15ef269d8..8e56cb2a67 100644 --- a/doc/html/boost_asio/reference/ip__udp/operator_eq__eq_.html +++ b/doc/html/boost_asio/reference/ip__udp/operator_eq__eq_.html @@ -48,7 +48,7 @@ Compare two
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__udp/operator_not__eq_.html b/doc/html/boost_asio/reference/ip__udp/operator_not__eq_.html index e3009a01b8..cb4998c10b 100644 --- a/doc/html/boost_asio/reference/ip__udp/operator_not__eq_.html +++ b/doc/html/boost_asio/reference/ip__udp/operator_not__eq_.html @@ -48,7 +48,7 @@ Compare
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__udp/protocol.html b/doc/html/boost_asio/reference/ip__udp/protocol.html index 570374679b..bae1a42748 100644 --- a/doc/html/boost_asio/reference/ip__udp/protocol.html +++ b/doc/html/boost_asio/reference/ip__udp/protocol.html @@ -36,7 +36,7 @@ Obtain an identifier
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__udp/resolver.html b/doc/html/boost_asio/reference/ip__udp/resolver.html index a288fefd53..56225fe920 100644 --- a/doc/html/boost_asio/reference/ip__udp/resolver.html +++ b/doc/html/boost_asio/reference/ip__udp/resolver.html @@ -435,7 +435,7 @@ The UDP resolver type.
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__udp/socket.html b/doc/html/boost_asio/reference/ip__udp/socket.html index f41b3f1b15..b0efb8a8da 100644 --- a/doc/html/boost_asio/reference/ip__udp/socket.html +++ b/doc/html/boost_asio/reference/ip__udp/socket.html @@ -941,7 +941,7 @@ The UDP socket type.
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__udp/type.html b/doc/html/boost_asio/reference/ip__udp/type.html index 284c7c43ee..60d47c331f 100644 --- a/doc/html/boost_asio/reference/ip__udp/type.html +++ b/doc/html/boost_asio/reference/ip__udp/type.html @@ -36,7 +36,7 @@ Obtain an identifier for the
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__udp/v4.html b/doc/html/boost_asio/reference/ip__udp/v4.html index e02e7493a3..afe1a610cb 100644 --- a/doc/html/boost_asio/reference/ip__udp/v4.html +++ b/doc/html/boost_asio/reference/ip__udp/v4.html @@ -36,7 +36,7 @@ Construct to represent the IPv4
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__udp/v6.html b/doc/html/boost_asio/reference/ip__udp/v6.html index 81e7622fed..b607f8a179 100644 --- a/doc/html/boost_asio/reference/ip__udp/v6.html +++ b/doc/html/boost_asio/reference/ip__udp/v6.html @@ -36,7 +36,7 @@ Construct to represent the IPv6
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__unicast__hops.html b/doc/html/boost_asio/reference/ip__unicast__hops.html index 8b7a6b33f2..0f21e87a7b 100644 --- a/doc/html/boost_asio/reference/ip__unicast__hops.html +++ b/doc/html/boost_asio/reference/ip__unicast__hops.html @@ -70,7 +70,7 @@ int ttl = option.value();
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__v4_mapped_t.html b/doc/html/boost_asio/reference/ip__v4_mapped_t.html index f439fb1901..43b751700a 100644 --- a/doc/html/boost_asio/reference/ip__v4_mapped_t.html +++ b/doc/html/boost_asio/reference/ip__v4_mapped_t.html @@ -60,7 +60,7 @@ Tag type used for distinguishing
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ip__v6_only.html b/doc/html/boost_asio/reference/ip__v6_only.html index 6530a4b3b8..fa29f98d84 100644 --- a/doc/html/boost_asio/reference/ip__v6_only.html +++ b/doc/html/boost_asio/reference/ip__v6_only.html @@ -70,7 +70,7 @@ bool v6_only = option.value();
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/is_const_buffer_sequence.html b/doc/html/boost_asio/reference/is_const_buffer_sequence.html index 91a3ee829c..fd4bcfeb96 100644 --- a/doc/html/boost_asio/reference/is_const_buffer_sequence.html +++ b/doc/html/boost_asio/reference/is_const_buffer_sequence.html @@ -46,7 +46,7 @@ struct is_const_buffer_sequence
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/is_dynamic_buffer.html b/doc/html/boost_asio/reference/is_dynamic_buffer.html index 840e4b80c7..d36c91af26 100644 --- a/doc/html/boost_asio/reference/is_dynamic_buffer.html +++ b/doc/html/boost_asio/reference/is_dynamic_buffer.html @@ -46,7 +46,7 @@ struct is_dynamic_buffer
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/is_endpoint_sequence.html b/doc/html/boost_asio/reference/is_endpoint_sequence.html index aadf011c78..d1710952ce 100644 --- a/doc/html/boost_asio/reference/is_endpoint_sequence.html +++ b/doc/html/boost_asio/reference/is_endpoint_sequence.html @@ -82,7 +82,7 @@ struct is_endpoint_sequence
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/is_endpoint_sequence/value.html b/doc/html/boost_asio/reference/is_endpoint_sequence/value.html index 404176e0bf..65d2911ff2 100644 --- a/doc/html/boost_asio/reference/is_endpoint_sequence/value.html +++ b/doc/html/boost_asio/reference/is_endpoint_sequence/value.html @@ -36,7 +36,7 @@ The
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/is_error_code_enum_lt__addrinfo_errors__gt_.html b/doc/html/boost_asio/reference/is_error_code_enum_lt__addrinfo_errors__gt_.html index 7742fb8c32..bdfa9d4a0e 100644 --- a/doc/html/boost_asio/reference/is_error_code_enum_lt__addrinfo_errors__gt_.html +++ b/doc/html/boost_asio/reference/is_error_code_enum_lt__addrinfo_errors__gt_.html @@ -75,7 +75,7 @@ struct boost::system::is_error_code_enum< boost::asio::error::addrinfo_errors
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/is_error_code_enum_lt__addrinfo_errors__gt_/value.html b/doc/html/boost_asio/reference/is_error_code_enum_lt__addrinfo_errors__gt_/value.html index b44bff8218..9f5081bc65 100644 --- a/doc/html/boost_asio/reference/is_error_code_enum_lt__addrinfo_errors__gt_/value.html +++ b/doc/html/boost_asio/reference/is_error_code_enum_lt__addrinfo_errors__gt_/value.html @@ -35,7 +35,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/is_error_code_enum_lt__basic_errors__gt_.html b/doc/html/boost_asio/reference/is_error_code_enum_lt__basic_errors__gt_.html index b53f1a8144..468726d0ce 100644 --- a/doc/html/boost_asio/reference/is_error_code_enum_lt__basic_errors__gt_.html +++ b/doc/html/boost_asio/reference/is_error_code_enum_lt__basic_errors__gt_.html @@ -75,7 +75,7 @@ struct boost::system::is_error_code_enum< boost::asio::error::basic_errors &g
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/is_error_code_enum_lt__basic_errors__gt_/value.html b/doc/html/boost_asio/reference/is_error_code_enum_lt__basic_errors__gt_/value.html index a286c12d0d..1bf02ab881 100644 --- a/doc/html/boost_asio/reference/is_error_code_enum_lt__basic_errors__gt_/value.html +++ b/doc/html/boost_asio/reference/is_error_code_enum_lt__basic_errors__gt_/value.html @@ -35,7 +35,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/is_error_code_enum_lt__boost__asio__ssl__error__stream_errors__gt_.html b/doc/html/boost_asio/reference/is_error_code_enum_lt__boost__asio__ssl__error__stream_errors__gt_.html index 40bd630342..b44ff6cdc0 100644 --- a/doc/html/boost_asio/reference/is_error_code_enum_lt__boost__asio__ssl__error__stream_errors__gt_.html +++ b/doc/html/boost_asio/reference/is_error_code_enum_lt__boost__asio__ssl__error__stream_errors__gt_.html @@ -75,7 +75,7 @@ struct boost::system::is_error_code_enum< boost::asio::ssl::error::stream_err
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/is_error_code_enum_lt__boost__asio__ssl__error__stream_errors__gt_/value.html b/doc/html/boost_asio/reference/is_error_code_enum_lt__boost__asio__ssl__error__stream_errors__gt_/value.html index 2ceaf032a3..474e0a1ad4 100644 --- a/doc/html/boost_asio/reference/is_error_code_enum_lt__boost__asio__ssl__error__stream_errors__gt_/value.html +++ b/doc/html/boost_asio/reference/is_error_code_enum_lt__boost__asio__ssl__error__stream_errors__gt_/value.html @@ -35,7 +35,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/is_error_code_enum_lt__misc_errors__gt_.html b/doc/html/boost_asio/reference/is_error_code_enum_lt__misc_errors__gt_.html index 5cf2da10f3..395d910077 100644 --- a/doc/html/boost_asio/reference/is_error_code_enum_lt__misc_errors__gt_.html +++ b/doc/html/boost_asio/reference/is_error_code_enum_lt__misc_errors__gt_.html @@ -75,7 +75,7 @@ struct boost::system::is_error_code_enum< boost::asio::error::misc_errors >
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/is_error_code_enum_lt__misc_errors__gt_/value.html b/doc/html/boost_asio/reference/is_error_code_enum_lt__misc_errors__gt_/value.html index 7836794209..a9bb28a384 100644 --- a/doc/html/boost_asio/reference/is_error_code_enum_lt__misc_errors__gt_/value.html +++ b/doc/html/boost_asio/reference/is_error_code_enum_lt__misc_errors__gt_/value.html @@ -35,7 +35,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/is_error_code_enum_lt__netdb_errors__gt_.html b/doc/html/boost_asio/reference/is_error_code_enum_lt__netdb_errors__gt_.html index 89b1f9892e..8d247462f7 100644 --- a/doc/html/boost_asio/reference/is_error_code_enum_lt__netdb_errors__gt_.html +++ b/doc/html/boost_asio/reference/is_error_code_enum_lt__netdb_errors__gt_.html @@ -75,7 +75,7 @@ struct boost::system::is_error_code_enum< boost::asio::error::netdb_errors &g
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/is_error_code_enum_lt__netdb_errors__gt_/value.html b/doc/html/boost_asio/reference/is_error_code_enum_lt__netdb_errors__gt_/value.html index 9354be2fa7..9d68228d73 100644 --- a/doc/html/boost_asio/reference/is_error_code_enum_lt__netdb_errors__gt_/value.html +++ b/doc/html/boost_asio/reference/is_error_code_enum_lt__netdb_errors__gt_/value.html @@ -35,7 +35,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/is_error_code_enum_lt__ssl_errors__gt_.html b/doc/html/boost_asio/reference/is_error_code_enum_lt__ssl_errors__gt_.html index 858c58572a..cb074dc32f 100644 --- a/doc/html/boost_asio/reference/is_error_code_enum_lt__ssl_errors__gt_.html +++ b/doc/html/boost_asio/reference/is_error_code_enum_lt__ssl_errors__gt_.html @@ -75,7 +75,7 @@ struct boost::system::is_error_code_enum< boost::asio::error::ssl_errors >
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/is_error_code_enum_lt__ssl_errors__gt_/value.html b/doc/html/boost_asio/reference/is_error_code_enum_lt__ssl_errors__gt_/value.html index 18c97be51c..3af62273bb 100644 --- a/doc/html/boost_asio/reference/is_error_code_enum_lt__ssl_errors__gt_/value.html +++ b/doc/html/boost_asio/reference/is_error_code_enum_lt__ssl_errors__gt_/value.html @@ -35,7 +35,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/is_executor.html b/doc/html/boost_asio/reference/is_executor.html index 9e7c3fc0aa..43017a8f23 100644 --- a/doc/html/boost_asio/reference/is_executor.html +++ b/doc/html/boost_asio/reference/is_executor.html @@ -52,7 +52,7 @@ struct is_executor
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/is_match_condition.html b/doc/html/boost_asio/reference/is_match_condition.html index de91677eff..311a9cf9c9 100644 --- a/doc/html/boost_asio/reference/is_match_condition.html +++ b/doc/html/boost_asio/reference/is_match_condition.html @@ -81,7 +81,7 @@ struct is_match_condition
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/is_match_condition/value.html b/doc/html/boost_asio/reference/is_match_condition/value.html index 28042912b4..d4b6f3673a 100644 --- a/doc/html/boost_asio/reference/is_match_condition/value.html +++ b/doc/html/boost_asio/reference/is_match_condition/value.html @@ -36,7 +36,7 @@ The
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/is_mutable_buffer_sequence.html b/doc/html/boost_asio/reference/is_mutable_buffer_sequence.html index 3fc1123658..3f346abba4 100644 --- a/doc/html/boost_asio/reference/is_mutable_buffer_sequence.html +++ b/doc/html/boost_asio/reference/is_mutable_buffer_sequence.html @@ -46,7 +46,7 @@ struct is_mutable_buffer_sequence
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/is_read_buffered.html b/doc/html/boost_asio/reference/is_read_buffered.html index b1487b1938..122d0bd908 100644 --- a/doc/html/boost_asio/reference/is_read_buffered.html +++ b/doc/html/boost_asio/reference/is_read_buffered.html @@ -84,7 +84,7 @@ class is_read_buffered
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/is_read_buffered/value.html b/doc/html/boost_asio/reference/is_read_buffered/value.html index e8106b5a62..c8616719f6 100644 --- a/doc/html/boost_asio/reference/is_read_buffered/value.html +++ b/doc/html/boost_asio/reference/is_read_buffered/value.html @@ -36,7 +36,7 @@ The value
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/is_write_buffered.html b/doc/html/boost_asio/reference/is_write_buffered.html index c3667d1096..7bb8842fdd 100644 --- a/doc/html/boost_asio/reference/is_write_buffered.html +++ b/doc/html/boost_asio/reference/is_write_buffered.html @@ -84,7 +84,7 @@ class is_write_buffered
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/is_write_buffered/value.html b/doc/html/boost_asio/reference/is_write_buffered/value.html index 75f77345a0..108e93d7d7 100644 --- a/doc/html/boost_asio/reference/is_write_buffered/value.html +++ b/doc/html/boost_asio/reference/is_write_buffered/value.html @@ -36,7 +36,7 @@ The value
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/local__basic_endpoint.html b/doc/html/boost_asio/reference/local__basic_endpoint.html index 4fa39b0647..4d66af2f05 100644 --- a/doc/html/boost_asio/reference/local__basic_endpoint.html +++ b/doc/html/boost_asio/reference/local__basic_endpoint.html @@ -372,7 +372,7 @@ class basic_endpoint
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/local__basic_endpoint/basic_endpoint.html b/doc/html/boost_asio/reference/local__basic_endpoint/basic_endpoint.html index aa95900a53..fa4c913725 100644 --- a/doc/html/boost_asio/reference/local__basic_endpoint/basic_endpoint.html +++ b/doc/html/boost_asio/reference/local__basic_endpoint/basic_endpoint.html @@ -55,7 +55,7 @@ Default
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/local__basic_endpoint/basic_endpoint/overload1.html b/doc/html/boost_asio/reference/local__basic_endpoint/basic_endpoint/overload1.html index 38cb4b8d11..e0aeb74011 100644 --- a/doc/html/boost_asio/reference/local__basic_endpoint/basic_endpoint/overload1.html +++ b/doc/html/boost_asio/reference/local__basic_endpoint/basic_endpoint/overload1.html @@ -35,7 +35,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/local__basic_endpoint/basic_endpoint/overload2.html b/doc/html/boost_asio/reference/local__basic_endpoint/basic_endpoint/overload2.html index 3ff8994b98..ca33a2cacd 100644 --- a/doc/html/boost_asio/reference/local__basic_endpoint/basic_endpoint/overload2.html +++ b/doc/html/boost_asio/reference/local__basic_endpoint/basic_endpoint/overload2.html @@ -36,7 +36,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/local__basic_endpoint/basic_endpoint/overload3.html b/doc/html/boost_asio/reference/local__basic_endpoint/basic_endpoint/overload3.html index 5f303c726d..0650c834a3 100644 --- a/doc/html/boost_asio/reference/local__basic_endpoint/basic_endpoint/overload3.html +++ b/doc/html/boost_asio/reference/local__basic_endpoint/basic_endpoint/overload3.html @@ -36,7 +36,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/local__basic_endpoint/basic_endpoint/overload4.html b/doc/html/boost_asio/reference/local__basic_endpoint/basic_endpoint/overload4.html index 4748ed93bb..8f6a8c5f2a 100644 --- a/doc/html/boost_asio/reference/local__basic_endpoint/basic_endpoint/overload4.html +++ b/doc/html/boost_asio/reference/local__basic_endpoint/basic_endpoint/overload4.html @@ -36,7 +36,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/local__basic_endpoint/capacity.html b/doc/html/boost_asio/reference/local__basic_endpoint/capacity.html index 0ea7412f79..8e886c9c49 100644 --- a/doc/html/boost_asio/reference/local__basic_endpoint/capacity.html +++ b/doc/html/boost_asio/reference/local__basic_endpoint/capacity.html @@ -36,7 +36,7 @@ Get
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/local__basic_endpoint/data.html b/doc/html/boost_asio/reference/local__basic_endpoint/data.html index 30c187d04f..24f79e13b4 100644 --- a/doc/html/boost_asio/reference/local__basic_endpoint/data.html +++ b/doc/html/boost_asio/reference/local__basic_endpoint/data.html @@ -40,7 +40,7 @@ const data_type *
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/local__basic_endpoint/data/overload1.html b/doc/html/boost_asio/reference/local__basic_endpoint/data/overload1.html index 086ccbc374..4d4527d1a3 100644 --- a/doc/html/boost_asio/reference/local__basic_endpoint/data/overload1.html +++ b/doc/html/boost_asio/reference/local__basic_endpoint/data/overload1.html @@ -35,7 +35,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/local__basic_endpoint/data/overload2.html b/doc/html/boost_asio/reference/local__basic_endpoint/data/overload2.html index f93f0c5de2..dea0e6d64f 100644 --- a/doc/html/boost_asio/reference/local__basic_endpoint/data/overload2.html +++ b/doc/html/boost_asio/reference/local__basic_endpoint/data/overload2.html @@ -35,7 +35,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/local__basic_endpoint/data_type.html b/doc/html/boost_asio/reference/local__basic_endpoint/data_type.html index 6ca1bc0861..b4bb5602ab 100644 --- a/doc/html/boost_asio/reference/local__basic_endpoint/data_type.html +++ b/doc/html/boost_asio/reference/local__basic_endpoint/data_type.html @@ -47,7 +47,7 @@ The
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/local__basic_endpoint/operator_eq_.html b/doc/html/boost_asio/reference/local__basic_endpoint/operator_eq_.html index 9e984c8370..f63290f4a8 100644 --- a/doc/html/boost_asio/reference/local__basic_endpoint/operator_eq_.html +++ b/doc/html/boost_asio/reference/local__basic_endpoint/operator_eq_.html @@ -37,7 +37,7 @@ Assign
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/local__basic_endpoint/operator_eq__eq_.html b/doc/html/boost_asio/reference/local__basic_endpoint/operator_eq__eq_.html index 07aaddfb63..24b6d4b24e 100644 --- a/doc/html/boost_asio/reference/local__basic_endpoint/operator_eq__eq_.html +++ b/doc/html/boost_asio/reference/local__basic_endpoint/operator_eq__eq_.html @@ -48,7 +48,7 @@ Compare
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/local__basic_endpoint/operator_gt_.html b/doc/html/boost_asio/reference/local__basic_endpoint/operator_gt_.html index b03efe9706..3f7b760523 100644 --- a/doc/html/boost_asio/reference/local__basic_endpoint/operator_gt_.html +++ b/doc/html/boost_asio/reference/local__basic_endpoint/operator_gt_.html @@ -48,7 +48,7 @@ Compare
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/local__basic_endpoint/operator_gt__eq_.html b/doc/html/boost_asio/reference/local__basic_endpoint/operator_gt__eq_.html index 8febe19c09..058e52409f 100644 --- a/doc/html/boost_asio/reference/local__basic_endpoint/operator_gt__eq_.html +++ b/doc/html/boost_asio/reference/local__basic_endpoint/operator_gt__eq_.html @@ -48,7 +48,7 @@ Compare
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/local__basic_endpoint/operator_lt_.html b/doc/html/boost_asio/reference/local__basic_endpoint/operator_lt_.html index 91dc694d9a..1b7a49adcb 100644 --- a/doc/html/boost_asio/reference/local__basic_endpoint/operator_lt_.html +++ b/doc/html/boost_asio/reference/local__basic_endpoint/operator_lt_.html @@ -48,7 +48,7 @@ Compare
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/local__basic_endpoint/operator_lt__eq_.html b/doc/html/boost_asio/reference/local__basic_endpoint/operator_lt__eq_.html index 0cd04ef96c..b7afda82c8 100644 --- a/doc/html/boost_asio/reference/local__basic_endpoint/operator_lt__eq_.html +++ b/doc/html/boost_asio/reference/local__basic_endpoint/operator_lt__eq_.html @@ -48,7 +48,7 @@ Compare
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/local__basic_endpoint/operator_lt__lt_.html b/doc/html/boost_asio/reference/local__basic_endpoint/operator_lt__lt_.html index 31350f26d8..8acea5faa0 100644 --- a/doc/html/boost_asio/reference/local__basic_endpoint/operator_lt__lt_.html +++ b/doc/html/boost_asio/reference/local__basic_endpoint/operator_lt__lt_.html @@ -66,7 +66,7 @@ Output
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/local__basic_endpoint/operator_not__eq_.html b/doc/html/boost_asio/reference/local__basic_endpoint/operator_not__eq_.html index ca9199b08a..b474eecea2 100644 --- a/doc/html/boost_asio/reference/local__basic_endpoint/operator_not__eq_.html +++ b/doc/html/boost_asio/reference/local__basic_endpoint/operator_not__eq_.html @@ -48,7 +48,7 @@ Compare
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/local__basic_endpoint/path.html b/doc/html/boost_asio/reference/local__basic_endpoint/path.html index eafb03b674..b69c8e23ba 100644 --- a/doc/html/boost_asio/reference/local__basic_endpoint/path.html +++ b/doc/html/boost_asio/reference/local__basic_endpoint/path.html @@ -48,7 +48,7 @@ void
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/local__basic_endpoint/path/overload1.html b/doc/html/boost_asio/reference/local__basic_endpoint/path/overload1.html index b0c48ded19..da2e18d8d3 100644 --- a/doc/html/boost_asio/reference/local__basic_endpoint/path/overload1.html +++ b/doc/html/boost_asio/reference/local__basic_endpoint/path/overload1.html @@ -35,7 +35,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/local__basic_endpoint/path/overload2.html b/doc/html/boost_asio/reference/local__basic_endpoint/path/overload2.html index 8d39bd532a..f6a80326c6 100644 --- a/doc/html/boost_asio/reference/local__basic_endpoint/path/overload2.html +++ b/doc/html/boost_asio/reference/local__basic_endpoint/path/overload2.html @@ -36,7 +36,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/local__basic_endpoint/path/overload3.html b/doc/html/boost_asio/reference/local__basic_endpoint/path/overload3.html index 9c3012679f..0c5f429b40 100644 --- a/doc/html/boost_asio/reference/local__basic_endpoint/path/overload3.html +++ b/doc/html/boost_asio/reference/local__basic_endpoint/path/overload3.html @@ -36,7 +36,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/local__basic_endpoint/protocol.html b/doc/html/boost_asio/reference/local__basic_endpoint/protocol.html index 220b927692..462b6db771 100644 --- a/doc/html/boost_asio/reference/local__basic_endpoint/protocol.html +++ b/doc/html/boost_asio/reference/local__basic_endpoint/protocol.html @@ -36,7 +36,7 @@ The
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/local__basic_endpoint/protocol_type.html b/doc/html/boost_asio/reference/local__basic_endpoint/protocol_type.html index d0e2f68ce8..3ec17fda22 100644 --- a/doc/html/boost_asio/reference/local__basic_endpoint/protocol_type.html +++ b/doc/html/boost_asio/reference/local__basic_endpoint/protocol_type.html @@ -46,7 +46,7 @@ The
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/local__basic_endpoint/resize.html b/doc/html/boost_asio/reference/local__basic_endpoint/resize.html index 0c4b0ed5b5..01ff01d0ec 100644 --- a/doc/html/boost_asio/reference/local__basic_endpoint/resize.html +++ b/doc/html/boost_asio/reference/local__basic_endpoint/resize.html @@ -37,7 +37,7 @@ Set
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/local__basic_endpoint/size.html b/doc/html/boost_asio/reference/local__basic_endpoint/size.html index 2ddaeee7e2..b7b7fe3128 100644 --- a/doc/html/boost_asio/reference/local__basic_endpoint/size.html +++ b/doc/html/boost_asio/reference/local__basic_endpoint/size.html @@ -36,7 +36,7 @@ Get
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/local__connect_pair.html b/doc/html/boost_asio/reference/local__connect_pair.html index 46c2895e3a..2ef21eda76 100644 --- a/doc/html/boost_asio/reference/local__connect_pair.html +++ b/doc/html/boost_asio/reference/local__connect_pair.html @@ -59,7 +59,7 @@ void
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/local__connect_pair/overload1.html b/doc/html/boost_asio/reference/local__connect_pair/overload1.html index 2a7575acdf..cb1ea4bcb7 100644 --- a/doc/html/boost_asio/reference/local__connect_pair/overload1.html +++ b/doc/html/boost_asio/reference/local__connect_pair/overload1.html @@ -39,7 +39,7 @@ void connect_pair(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/local__connect_pair/overload2.html b/doc/html/boost_asio/reference/local__connect_pair/overload2.html index 12f5f2e6c2..6f5925af93 100644 --- a/doc/html/boost_asio/reference/local__connect_pair/overload2.html +++ b/doc/html/boost_asio/reference/local__connect_pair/overload2.html @@ -40,7 +40,7 @@ void connect_pair(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/local__datagram_protocol.html b/doc/html/boost_asio/reference/local__datagram_protocol.html index 896c2baf73..4df8eab1e7 100644 --- a/doc/html/boost_asio/reference/local__datagram_protocol.html +++ b/doc/html/boost_asio/reference/local__datagram_protocol.html @@ -168,7 +168,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/local__datagram_protocol/endpoint.html b/doc/html/boost_asio/reference/local__datagram_protocol/endpoint.html index a235a6c58a..2df2571059 100644 --- a/doc/html/boost_asio/reference/local__datagram_protocol/endpoint.html +++ b/doc/html/boost_asio/reference/local__datagram_protocol/endpoint.html @@ -372,7 +372,7 @@ The
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/local__datagram_protocol/family.html b/doc/html/boost_asio/reference/local__datagram_protocol/family.html index 16e64f857c..26f9b6b75b 100644 --- a/doc/html/boost_asio/reference/local__datagram_protocol/family.html +++ b/doc/html/boost_asio/reference/local__datagram_protocol/family.html @@ -36,7 +36,7 @@ Obtain
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/local__datagram_protocol/protocol.html b/doc/html/boost_asio/reference/local__datagram_protocol/protocol.html index 76d49a56d0..72a1b60565 100644 --- a/doc/html/boost_asio/reference/local__datagram_protocol/protocol.html +++ b/doc/html/boost_asio/reference/local__datagram_protocol/protocol.html @@ -36,7 +36,7 @@ Obtain
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/local__datagram_protocol/socket.html b/doc/html/boost_asio/reference/local__datagram_protocol/socket.html index ce29b1c6a4..24d6ab8369 100644 --- a/doc/html/boost_asio/reference/local__datagram_protocol/socket.html +++ b/doc/html/boost_asio/reference/local__datagram_protocol/socket.html @@ -943,7 +943,7 @@ The
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/local__datagram_protocol/type.html b/doc/html/boost_asio/reference/local__datagram_protocol/type.html index 7762cac803..421a8796b1 100644 --- a/doc/html/boost_asio/reference/local__datagram_protocol/type.html +++ b/doc/html/boost_asio/reference/local__datagram_protocol/type.html @@ -36,7 +36,7 @@ Obtain
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/local__stream_protocol.html b/doc/html/boost_asio/reference/local__stream_protocol.html index 6f72583330..a4671482dc 100644 --- a/doc/html/boost_asio/reference/local__stream_protocol.html +++ b/doc/html/boost_asio/reference/local__stream_protocol.html @@ -192,7 +192,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/local__stream_protocol/acceptor.html b/doc/html/boost_asio/reference/local__stream_protocol/acceptor.html index a8f44dbd6e..16637f0757 100644 --- a/doc/html/boost_asio/reference/local__stream_protocol/acceptor.html +++ b/doc/html/boost_asio/reference/local__stream_protocol/acceptor.html @@ -800,7 +800,7 @@ acceptor.listen();
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/local__stream_protocol/endpoint.html b/doc/html/boost_asio/reference/local__stream_protocol/endpoint.html index 5520c817d7..78babcbb5f 100644 --- a/doc/html/boost_asio/reference/local__stream_protocol/endpoint.html +++ b/doc/html/boost_asio/reference/local__stream_protocol/endpoint.html @@ -372,7 +372,7 @@ The
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/local__stream_protocol/family.html b/doc/html/boost_asio/reference/local__stream_protocol/family.html index 1c70a74f57..c70cce9233 100644 --- a/doc/html/boost_asio/reference/local__stream_protocol/family.html +++ b/doc/html/boost_asio/reference/local__stream_protocol/family.html @@ -36,7 +36,7 @@ Obtain
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/local__stream_protocol/iostream.html b/doc/html/boost_asio/reference/local__stream_protocol/iostream.html index da8718f699..cdb601dfa4 100644 --- a/doc/html/boost_asio/reference/local__stream_protocol/iostream.html +++ b/doc/html/boost_asio/reference/local__stream_protocol/iostream.html @@ -331,7 +331,7 @@ The
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/local__stream_protocol/protocol.html b/doc/html/boost_asio/reference/local__stream_protocol/protocol.html index 63d933c05a..b46a6ff285 100644 --- a/doc/html/boost_asio/reference/local__stream_protocol/protocol.html +++ b/doc/html/boost_asio/reference/local__stream_protocol/protocol.html @@ -36,7 +36,7 @@ Obtain
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/local__stream_protocol/socket.html b/doc/html/boost_asio/reference/local__stream_protocol/socket.html index eed3b56185..08fa43dd21 100644 --- a/doc/html/boost_asio/reference/local__stream_protocol/socket.html +++ b/doc/html/boost_asio/reference/local__stream_protocol/socket.html @@ -946,7 +946,7 @@ The
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/local__stream_protocol/type.html b/doc/html/boost_asio/reference/local__stream_protocol/type.html index da697a2b93..edd0db6936 100644 --- a/doc/html/boost_asio/reference/local__stream_protocol/type.html +++ b/doc/html/boost_asio/reference/local__stream_protocol/type.html @@ -36,7 +36,7 @@ Obtain
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/make_work_guard.html b/doc/html/boost_asio/reference/make_work_guard.html index ff66271236..b4cc9a41c9 100644 --- a/doc/html/boost_asio/reference/make_work_guard.html +++ b/doc/html/boost_asio/reference/make_work_guard.html @@ -67,7 +67,7 @@ template< executor_work_guard< typename associated_executor< T, typename ExecutionContext::executor_type >::type > make_work_guard( const T & t, ExecutionContext & ctx, - typename enable_if<!is_executor< T >::value &&!is_convertible< T &, execution_context & >::value >::type * = 0); + typename enable_if<!is_executor< T >::value &&!is_convertible< T &, execution_context & >::value &&is_convertible< ExecutionContext &, execution_context & >::value >::type * = 0); » more...
    @@ -83,7 +83,7 @@ executor_work_guard< typename associated_executor< T, typename ExecutionCo
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/make_work_guard/overload1.html b/doc/html/boost_asio/reference/make_work_guard/overload1.html index a4bdeebee5..00825fb574 100644 --- a/doc/html/boost_asio/reference/make_work_guard/overload1.html +++ b/doc/html/boost_asio/reference/make_work_guard/overload1.html @@ -40,7 +40,7 @@ executor_work_guard< Executor > make_work_guard(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/make_work_guard/overload2.html b/doc/html/boost_asio/reference/make_work_guard/overload2.html index a0c09a1af8..7b7e99e936 100644 --- a/doc/html/boost_asio/reference/make_work_guard/overload2.html +++ b/doc/html/boost_asio/reference/make_work_guard/overload2.html @@ -40,7 +40,7 @@ executor_work_guard< typename ExecutionContext::executor_type > make_work_
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/make_work_guard/overload3.html b/doc/html/boost_asio/reference/make_work_guard/overload3.html index 53f9bb198e..996f8cb0ef 100644 --- a/doc/html/boost_asio/reference/make_work_guard/overload3.html +++ b/doc/html/boost_asio/reference/make_work_guard/overload3.html @@ -40,7 +40,7 @@ executor_work_guard< typename associated_executor< T >::type > make_
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/make_work_guard/overload4.html b/doc/html/boost_asio/reference/make_work_guard/overload4.html index 966b8d0a8c..cfca11a3be 100644 --- a/doc/html/boost_asio/reference/make_work_guard/overload4.html +++ b/doc/html/boost_asio/reference/make_work_guard/overload4.html @@ -42,7 +42,7 @@ executor_work_guard< typename associated_executor< T, Executor >::type
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/make_work_guard/overload5.html b/doc/html/boost_asio/reference/make_work_guard/overload5.html index b4c5cc30dc..c925a23222 100644 --- a/doc/html/boost_asio/reference/make_work_guard/overload5.html +++ b/doc/html/boost_asio/reference/make_work_guard/overload5.html @@ -37,12 +37,12 @@ executor_work_guard< typename associated_executor< T, typename ExecutionContext::executor_type >::type > make_work_guard( const T & t, ExecutionContext & ctx, - typename enable_if<!is_executor< T >::value &&!is_convertible< T &, execution_context & >::value >::type * = 0); + typename enable_if<!is_executor< T >::value &&!is_convertible< T &, execution_context & >::value &&is_convertible< ExecutionContext &, execution_context & >::value >::type * = 0);
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/mutable_buffer.html b/doc/html/boost_asio/reference/mutable_buffer.html index 10c92e7f31..83ae34c6fe 100644 --- a/doc/html/boost_asio/reference/mutable_buffer.html +++ b/doc/html/boost_asio/reference/mutable_buffer.html @@ -176,7 +176,7 @@ unsigned char* p1 = static_cast<unsigned char*>(b1.data());
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/mutable_buffer/data.html b/doc/html/boost_asio/reference/mutable_buffer/data.html index 198d11a507..3942701288 100644 --- a/doc/html/boost_asio/reference/mutable_buffer/data.html +++ b/doc/html/boost_asio/reference/mutable_buffer/data.html @@ -36,7 +36,7 @@ Get a pointer
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/mutable_buffer/mutable_buffer.html b/doc/html/boost_asio/reference/mutable_buffer/mutable_buffer.html index 67b6898284..5a46594c0c 100644 --- a/doc/html/boost_asio/reference/mutable_buffer/mutable_buffer.html +++ b/doc/html/boost_asio/reference/mutable_buffer/mutable_buffer.html @@ -45,7 +45,7 @@ Construct
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/mutable_buffer/mutable_buffer/overload1.html b/doc/html/boost_asio/reference/mutable_buffer/mutable_buffer/overload1.html index b1b9a5b374..c9d2f9a669 100644 --- a/doc/html/boost_asio/reference/mutable_buffer/mutable_buffer/overload1.html +++ b/doc/html/boost_asio/reference/mutable_buffer/mutable_buffer/overload1.html @@ -35,7 +35,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/mutable_buffer/mutable_buffer/overload2.html b/doc/html/boost_asio/reference/mutable_buffer/mutable_buffer/overload2.html index a69f151430..184aa9062b 100644 --- a/doc/html/boost_asio/reference/mutable_buffer/mutable_buffer/overload2.html +++ b/doc/html/boost_asio/reference/mutable_buffer/mutable_buffer/overload2.html @@ -37,7 +37,7 @@
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/mutable_buffer/operator_plus_.html b/doc/html/boost_asio/reference/mutable_buffer/operator_plus_.html index 4cb5705821..f0612d219a 100644 --- a/doc/html/boost_asio/reference/mutable_buffer/operator_plus_.html +++ b/doc/html/boost_asio/reference/mutable_buffer/operator_plus_.html @@ -44,7 +44,7 @@ mutable_buffer
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/mutable_buffer/operator_plus_/overload1.html b/doc/html/boost_asio/reference/mutable_buffer/operator_plus_/overload1.html index 4eaf4ad0d9..de8de400e0 100644 --- a/doc/html/boost_asio/reference/mutable_buffer/operator_plus_/overload1.html +++ b/doc/html/boost_asio/reference/mutable_buffer/operator_plus_/overload1.html @@ -37,7 +37,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/mutable_buffer/operator_plus_/overload2.html b/doc/html/boost_asio/reference/mutable_buffer/operator_plus_/overload2.html index 501051d16c..747f368f34 100644 --- a/doc/html/boost_asio/reference/mutable_buffer/operator_plus_/overload2.html +++ b/doc/html/boost_asio/reference/mutable_buffer/operator_plus_/overload2.html @@ -37,7 +37,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/mutable_buffer/operator_plus__eq_.html b/doc/html/boost_asio/reference/mutable_buffer/operator_plus__eq_.html index aafd016a9b..ff5ba3d6e0 100644 --- a/doc/html/boost_asio/reference/mutable_buffer/operator_plus__eq_.html +++ b/doc/html/boost_asio/reference/mutable_buffer/operator_plus__eq_.html @@ -37,7 +37,7 @@ Move
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/mutable_buffer/size.html b/doc/html/boost_asio/reference/mutable_buffer/size.html index cdbe42b3a3..d8044f9259 100644 --- a/doc/html/boost_asio/reference/mutable_buffer/size.html +++ b/doc/html/boost_asio/reference/mutable_buffer/size.html @@ -36,7 +36,7 @@ Get the size
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/mutable_buffers_1.html b/doc/html/boost_asio/reference/mutable_buffers_1.html index 6eca0aee6e..9aea0d8d09 100644 --- a/doc/html/boost_asio/reference/mutable_buffers_1.html +++ b/doc/html/boost_asio/reference/mutable_buffers_1.html @@ -231,7 +231,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/mutable_buffers_1/begin.html b/doc/html/boost_asio/reference/mutable_buffers_1/begin.html index dc0e48b608..c7bdd5c4c4 100644 --- a/doc/html/boost_asio/reference/mutable_buffers_1/begin.html +++ b/doc/html/boost_asio/reference/mutable_buffers_1/begin.html @@ -36,7 +36,7 @@ Get a
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/mutable_buffers_1/const_iterator.html b/doc/html/boost_asio/reference/mutable_buffers_1/const_iterator.html index d6e68f7961..9213bf38c9 100644 --- a/doc/html/boost_asio/reference/mutable_buffers_1/const_iterator.html +++ b/doc/html/boost_asio/reference/mutable_buffers_1/const_iterator.html @@ -46,7 +46,7 @@ A
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/mutable_buffers_1/data.html b/doc/html/boost_asio/reference/mutable_buffers_1/data.html index 952b42335a..f577e456e1 100644 --- a/doc/html/boost_asio/reference/mutable_buffers_1/data.html +++ b/doc/html/boost_asio/reference/mutable_buffers_1/data.html @@ -39,7 +39,7 @@ Get a pointer
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/mutable_buffers_1/end.html b/doc/html/boost_asio/reference/mutable_buffers_1/end.html index c9db0066fc..c48adcc251 100644 --- a/doc/html/boost_asio/reference/mutable_buffers_1/end.html +++ b/doc/html/boost_asio/reference/mutable_buffers_1/end.html @@ -36,7 +36,7 @@ Get a random-access
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/mutable_buffers_1/mutable_buffers_1.html b/doc/html/boost_asio/reference/mutable_buffers_1/mutable_buffers_1.html index 6e4f6eec4d..1f77edc5e9 100644 --- a/doc/html/boost_asio/reference/mutable_buffers_1/mutable_buffers_1.html +++ b/doc/html/boost_asio/reference/mutable_buffers_1/mutable_buffers_1.html @@ -46,7 +46,7 @@ Construct
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/mutable_buffers_1/mutable_buffers_1/overload1.html b/doc/html/boost_asio/reference/mutable_buffers_1/mutable_buffers_1/overload1.html index 110de496d2..67f05321dd 100644 --- a/doc/html/boost_asio/reference/mutable_buffers_1/mutable_buffers_1/overload1.html +++ b/doc/html/boost_asio/reference/mutable_buffers_1/mutable_buffers_1/overload1.html @@ -37,7 +37,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/mutable_buffers_1/mutable_buffers_1/overload2.html b/doc/html/boost_asio/reference/mutable_buffers_1/mutable_buffers_1/overload2.html index 4bd6941a70..e2f049a4fa 100644 --- a/doc/html/boost_asio/reference/mutable_buffers_1/mutable_buffers_1/overload2.html +++ b/doc/html/boost_asio/reference/mutable_buffers_1/mutable_buffers_1/overload2.html @@ -36,7 +36,7 @@
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/mutable_buffers_1/operator_plus_.html b/doc/html/boost_asio/reference/mutable_buffers_1/operator_plus_.html index 87283c1dda..0dedcbfbc1 100644 --- a/doc/html/boost_asio/reference/mutable_buffers_1/operator_plus_.html +++ b/doc/html/boost_asio/reference/mutable_buffers_1/operator_plus_.html @@ -44,7 +44,7 @@ mutable_buffer
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/mutable_buffers_1/operator_plus_/overload1.html b/doc/html/boost_asio/reference/mutable_buffers_1/operator_plus_/overload1.html index 158b28c92c..7a7eff30ac 100644 --- a/doc/html/boost_asio/reference/mutable_buffers_1/operator_plus_/overload1.html +++ b/doc/html/boost_asio/reference/mutable_buffers_1/operator_plus_/overload1.html @@ -40,7 +40,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/mutable_buffers_1/operator_plus_/overload2.html b/doc/html/boost_asio/reference/mutable_buffers_1/operator_plus_/overload2.html index b5099f5c6d..404cebc73b 100644 --- a/doc/html/boost_asio/reference/mutable_buffers_1/operator_plus_/overload2.html +++ b/doc/html/boost_asio/reference/mutable_buffers_1/operator_plus_/overload2.html @@ -40,7 +40,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/mutable_buffers_1/operator_plus__eq_.html b/doc/html/boost_asio/reference/mutable_buffers_1/operator_plus__eq_.html index 78b86234f9..c0c7886314 100644 --- a/doc/html/boost_asio/reference/mutable_buffers_1/operator_plus__eq_.html +++ b/doc/html/boost_asio/reference/mutable_buffers_1/operator_plus__eq_.html @@ -40,7 +40,7 @@ Move
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/mutable_buffers_1/size.html b/doc/html/boost_asio/reference/mutable_buffers_1/size.html index 871af9bfdb..b608e37749 100644 --- a/doc/html/boost_asio/reference/mutable_buffers_1/size.html +++ b/doc/html/boost_asio/reference/mutable_buffers_1/size.html @@ -39,7 +39,7 @@ Get the
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/mutable_buffers_1/value_type.html b/doc/html/boost_asio/reference/mutable_buffers_1/value_type.html index 145c980be8..95da46e6cc 100644 --- a/doc/html/boost_asio/reference/mutable_buffers_1/value_type.html +++ b/doc/html/boost_asio/reference/mutable_buffers_1/value_type.html @@ -180,7 +180,7 @@ unsigned char* p1 = static_cast<unsigned char*>(b1.data());
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/null_buffers.html b/doc/html/boost_asio/reference/null_buffers.html index d4eda00b4b..3c29d8b2b7 100644 --- a/doc/html/boost_asio/reference/null_buffers.html +++ b/doc/html/boost_asio/reference/null_buffers.html @@ -143,7 +143,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/null_buffers/begin.html b/doc/html/boost_asio/reference/null_buffers/begin.html index 71b8cb8310..8131fc8ce0 100644 --- a/doc/html/boost_asio/reference/null_buffers/begin.html +++ b/doc/html/boost_asio/reference/null_buffers/begin.html @@ -36,7 +36,7 @@ Get a random-access
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/null_buffers/const_iterator.html b/doc/html/boost_asio/reference/null_buffers/const_iterator.html index 7c6146b82f..030acf5db9 100644 --- a/doc/html/boost_asio/reference/null_buffers/const_iterator.html +++ b/doc/html/boost_asio/reference/null_buffers/const_iterator.html @@ -46,7 +46,7 @@ A
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/null_buffers/end.html b/doc/html/boost_asio/reference/null_buffers/end.html index 4061bafd60..39e0ed1dab 100644 --- a/doc/html/boost_asio/reference/null_buffers/end.html +++ b/doc/html/boost_asio/reference/null_buffers/end.html @@ -36,7 +36,7 @@ Get a random-access
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/null_buffers/value_type.html b/doc/html/boost_asio/reference/null_buffers/value_type.html index 8b8be14072..2d315f3d41 100644 --- a/doc/html/boost_asio/reference/null_buffers/value_type.html +++ b/doc/html/boost_asio/reference/null_buffers/value_type.html @@ -180,7 +180,7 @@ unsigned char* p1 = static_cast<unsigned char*>(b1.data());
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/placeholders__bytes_transferred.html b/doc/html/boost_asio/reference/placeholders__bytes_transferred.html index 7718c50148..7c60d1e74d 100644 --- a/doc/html/boost_asio/reference/placeholders__bytes_transferred.html +++ b/doc/html/boost_asio/reference/placeholders__bytes_transferred.html @@ -48,7 +48,7 @@ An
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/placeholders__endpoint.html b/doc/html/boost_asio/reference/placeholders__endpoint.html index 461b39d980..8bc439a2a7 100644 --- a/doc/html/boost_asio/reference/placeholders__endpoint.html +++ b/doc/html/boost_asio/reference/placeholders__endpoint.html @@ -47,7 +47,7 @@ An argument
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/placeholders__error.html b/doc/html/boost_asio/reference/placeholders__error.html index 74acdf627b..a74cd4e8c6 100644 --- a/doc/html/boost_asio/reference/placeholders__error.html +++ b/doc/html/boost_asio/reference/placeholders__error.html @@ -47,7 +47,7 @@ An argument placeholder,
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/placeholders__iterator.html b/doc/html/boost_asio/reference/placeholders__iterator.html index e3cc8907dd..134f33dd4b 100644 --- a/doc/html/boost_asio/reference/placeholders__iterator.html +++ b/doc/html/boost_asio/reference/placeholders__iterator.html @@ -47,7 +47,7 @@ An argument
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/placeholders__results.html b/doc/html/boost_asio/reference/placeholders__results.html index 332456394c..04af1220e8 100644 --- a/doc/html/boost_asio/reference/placeholders__results.html +++ b/doc/html/boost_asio/reference/placeholders__results.html @@ -47,7 +47,7 @@ An argument
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/placeholders__signal_number.html b/doc/html/boost_asio/reference/placeholders__signal_number.html index ebdabf52f3..90f22946dd 100644 --- a/doc/html/boost_asio/reference/placeholders__signal_number.html +++ b/doc/html/boost_asio/reference/placeholders__signal_number.html @@ -47,7 +47,7 @@ An
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/posix__descriptor.html b/doc/html/boost_asio/reference/posix__descriptor.html index cce9a5bf9e..e17d15be57 100644 --- a/doc/html/boost_asio/reference/posix__descriptor.html +++ b/doc/html/boost_asio/reference/posix__descriptor.html @@ -427,7 +427,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/posix__descriptor/_descriptor.html b/doc/html/boost_asio/reference/posix__descriptor/_descriptor.html index c672895547..db5b2d9028 100644 --- a/doc/html/boost_asio/reference/posix__descriptor/_descriptor.html +++ b/doc/html/boost_asio/reference/posix__descriptor/_descriptor.html @@ -40,7 +40,7 @@ Protected
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/posix__descriptor/assign.html b/doc/html/boost_asio/reference/posix__descriptor/assign.html index 6de00e35e1..94d6560652 100644 --- a/doc/html/boost_asio/reference/posix__descriptor/assign.html +++ b/doc/html/boost_asio/reference/posix__descriptor/assign.html @@ -43,7 +43,7 @@ void
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/posix__descriptor/assign/overload1.html b/doc/html/boost_asio/reference/posix__descriptor/assign/overload1.html index 7422b4eb93..df1ac5124c 100644 --- a/doc/html/boost_asio/reference/posix__descriptor/assign/overload1.html +++ b/doc/html/boost_asio/reference/posix__descriptor/assign/overload1.html @@ -36,7 +36,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/posix__descriptor/assign/overload2.html b/doc/html/boost_asio/reference/posix__descriptor/assign/overload2.html index 121a198426..88a0be65a8 100644 --- a/doc/html/boost_asio/reference/posix__descriptor/assign/overload2.html +++ b/doc/html/boost_asio/reference/posix__descriptor/assign/overload2.html @@ -37,7 +37,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/posix__descriptor/async_wait.html b/doc/html/boost_asio/reference/posix__descriptor/async_wait.html index 87c4836614..d414d1ed49 100644 --- a/doc/html/boost_asio/reference/posix__descriptor/async_wait.html +++ b/doc/html/boost_asio/reference/posix__descriptor/async_wait.html @@ -96,7 +96,7 @@ descriptor.async_wait(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/posix__descriptor/bytes_readable.html b/doc/html/boost_asio/reference/posix__descriptor/bytes_readable.html index aa992f0c48..52d94c196a 100644 --- a/doc/html/boost_asio/reference/posix__descriptor/bytes_readable.html +++ b/doc/html/boost_asio/reference/posix__descriptor/bytes_readable.html @@ -59,7 +59,7 @@ std::size_t bytes_readable = command.get();
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/posix__descriptor/cancel.html b/doc/html/boost_asio/reference/posix__descriptor/cancel.html index 62dab458e9..514fb9047d 100644 --- a/doc/html/boost_asio/reference/posix__descriptor/cancel.html +++ b/doc/html/boost_asio/reference/posix__descriptor/cancel.html @@ -41,7 +41,7 @@ void
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/posix__descriptor/cancel/overload1.html b/doc/html/boost_asio/reference/posix__descriptor/cancel/overload1.html index 00c6fc3f93..4b6c6315ff 100644 --- a/doc/html/boost_asio/reference/posix__descriptor/cancel/overload1.html +++ b/doc/html/boost_asio/reference/posix__descriptor/cancel/overload1.html @@ -53,7 +53,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/posix__descriptor/cancel/overload2.html b/doc/html/boost_asio/reference/posix__descriptor/cancel/overload2.html index 19fb8a12e1..e50fa9c317 100644 --- a/doc/html/boost_asio/reference/posix__descriptor/cancel/overload2.html +++ b/doc/html/boost_asio/reference/posix__descriptor/cancel/overload2.html @@ -54,7 +54,7 @@
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/posix__descriptor/close.html b/doc/html/boost_asio/reference/posix__descriptor/close.html index 41f34a3ccb..6b909221c5 100644 --- a/doc/html/boost_asio/reference/posix__descriptor/close.html +++ b/doc/html/boost_asio/reference/posix__descriptor/close.html @@ -41,7 +41,7 @@ void
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/posix__descriptor/close/overload1.html b/doc/html/boost_asio/reference/posix__descriptor/close/overload1.html index 5f3e46567b..f2a73f6cdf 100644 --- a/doc/html/boost_asio/reference/posix__descriptor/close/overload1.html +++ b/doc/html/boost_asio/reference/posix__descriptor/close/overload1.html @@ -54,7 +54,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/posix__descriptor/close/overload2.html b/doc/html/boost_asio/reference/posix__descriptor/close/overload2.html index c6d47f4f1c..fb7306225d 100644 --- a/doc/html/boost_asio/reference/posix__descriptor/close/overload2.html +++ b/doc/html/boost_asio/reference/posix__descriptor/close/overload2.html @@ -55,7 +55,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/posix__descriptor/descriptor.html b/doc/html/boost_asio/reference/posix__descriptor/descriptor.html index 56214607f5..929b66a1f2 100644 --- a/doc/html/boost_asio/reference/posix__descriptor/descriptor.html +++ b/doc/html/boost_asio/reference/posix__descriptor/descriptor.html @@ -53,7 +53,7 @@ Construct
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/posix__descriptor/descriptor/overload1.html b/doc/html/boost_asio/reference/posix__descriptor/descriptor/overload1.html index 2c8ea0b072..0d6c79fd78 100644 --- a/doc/html/boost_asio/reference/posix__descriptor/descriptor/overload1.html +++ b/doc/html/boost_asio/reference/posix__descriptor/descriptor/overload1.html @@ -54,7 +54,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/posix__descriptor/descriptor/overload2.html b/doc/html/boost_asio/reference/posix__descriptor/descriptor/overload2.html index aa5929f3e7..588b7fcdc6 100644 --- a/doc/html/boost_asio/reference/posix__descriptor/descriptor/overload2.html +++ b/doc/html/boost_asio/reference/posix__descriptor/descriptor/overload2.html @@ -73,7 +73,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/posix__descriptor/descriptor/overload3.html b/doc/html/boost_asio/reference/posix__descriptor/descriptor/overload3.html index f01d660f4b..d584cb7638 100644 --- a/doc/html/boost_asio/reference/posix__descriptor/descriptor/overload3.html +++ b/doc/html/boost_asio/reference/posix__descriptor/descriptor/overload3.html @@ -60,7 +60,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/posix__descriptor/executor_type.html b/doc/html/boost_asio/reference/posix__descriptor/executor_type.html index eecc09e6b1..24c20b975f 100644 --- a/doc/html/boost_asio/reference/posix__descriptor/executor_type.html +++ b/doc/html/boost_asio/reference/posix__descriptor/executor_type.html @@ -203,7 +203,7 @@ The
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/posix__descriptor/get_executor.html b/doc/html/boost_asio/reference/posix__descriptor/get_executor.html index b074cd962e..46c2409083 100644 --- a/doc/html/boost_asio/reference/posix__descriptor/get_executor.html +++ b/doc/html/boost_asio/reference/posix__descriptor/get_executor.html @@ -36,7 +36,7 @@ Get
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/posix__descriptor/get_io_context.html b/doc/html/boost_asio/reference/posix__descriptor/get_io_context.html index b90b5df7e4..ce2943bd6f 100644 --- a/doc/html/boost_asio/reference/posix__descriptor/get_io_context.html +++ b/doc/html/boost_asio/reference/posix__descriptor/get_io_context.html @@ -51,7 +51,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/posix__descriptor/get_io_service.html b/doc/html/boost_asio/reference/posix__descriptor/get_io_service.html index be2e60fed9..d752dd9a68 100644 --- a/doc/html/boost_asio/reference/posix__descriptor/get_io_service.html +++ b/doc/html/boost_asio/reference/posix__descriptor/get_io_service.html @@ -51,7 +51,7 @@
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/posix__descriptor/io_control.html b/doc/html/boost_asio/reference/posix__descriptor/io_control.html index be045faecc..9ca893ec9d 100644 --- a/doc/html/boost_asio/reference/posix__descriptor/io_control.html +++ b/doc/html/boost_asio/reference/posix__descriptor/io_control.html @@ -47,7 +47,7 @@ void
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/posix__descriptor/io_control/overload1.html b/doc/html/boost_asio/reference/posix__descriptor/io_control/overload1.html index 397b309455..9c6dbd0064 100644 --- a/doc/html/boost_asio/reference/posix__descriptor/io_control/overload1.html +++ b/doc/html/boost_asio/reference/posix__descriptor/io_control/overload1.html @@ -80,7 +80,7 @@ std::size_t bytes_readable = command.get();
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/posix__descriptor/io_control/overload2.html b/doc/html/boost_asio/reference/posix__descriptor/io_control/overload2.html index 92e6706330..3c2a6ebaa3 100644 --- a/doc/html/boost_asio/reference/posix__descriptor/io_control/overload2.html +++ b/doc/html/boost_asio/reference/posix__descriptor/io_control/overload2.html @@ -77,7 +77,7 @@ std::size_t bytes_readable = command.get();
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/posix__descriptor/is_open.html b/doc/html/boost_asio/reference/posix__descriptor/is_open.html index 3568a7f813..5046a7bc5d 100644 --- a/doc/html/boost_asio/reference/posix__descriptor/is_open.html +++ b/doc/html/boost_asio/reference/posix__descriptor/is_open.html @@ -36,7 +36,7 @@ Determine
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/posix__descriptor/lowest_layer.html b/doc/html/boost_asio/reference/posix__descriptor/lowest_layer.html index 06380eb4d3..2da0ee70cc 100644 --- a/doc/html/boost_asio/reference/posix__descriptor/lowest_layer.html +++ b/doc/html/boost_asio/reference/posix__descriptor/lowest_layer.html @@ -43,7 +43,7 @@ Get
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/posix__descriptor/lowest_layer/overload1.html b/doc/html/boost_asio/reference/posix__descriptor/lowest_layer/overload1.html index 20789aa9af..3ad0031f14 100644 --- a/doc/html/boost_asio/reference/posix__descriptor/lowest_layer/overload1.html +++ b/doc/html/boost_asio/reference/posix__descriptor/lowest_layer/overload1.html @@ -49,7 +49,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/posix__descriptor/lowest_layer/overload2.html b/doc/html/boost_asio/reference/posix__descriptor/lowest_layer/overload2.html index eff4b0d10c..292f191f28 100644 --- a/doc/html/boost_asio/reference/posix__descriptor/lowest_layer/overload2.html +++ b/doc/html/boost_asio/reference/posix__descriptor/lowest_layer/overload2.html @@ -49,7 +49,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/posix__descriptor/lowest_layer_type.html b/doc/html/boost_asio/reference/posix__descriptor/lowest_layer_type.html index 52cc535a3e..22f2caa100 100644 --- a/doc/html/boost_asio/reference/posix__descriptor/lowest_layer_type.html +++ b/doc/html/boost_asio/reference/posix__descriptor/lowest_layer_type.html @@ -429,7 +429,7 @@ A
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/posix__descriptor/native_handle.html b/doc/html/boost_asio/reference/posix__descriptor/native_handle.html index 450322f9b5..8207fafa60 100644 --- a/doc/html/boost_asio/reference/posix__descriptor/native_handle.html +++ b/doc/html/boost_asio/reference/posix__descriptor/native_handle.html @@ -41,7 +41,7 @@ Get
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/posix__descriptor/native_handle_type.html b/doc/html/boost_asio/reference/posix__descriptor/native_handle_type.html index de890f7ff7..27500a8cdf 100644 --- a/doc/html/boost_asio/reference/posix__descriptor/native_handle_type.html +++ b/doc/html/boost_asio/reference/posix__descriptor/native_handle_type.html @@ -46,7 +46,7 @@ The
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/posix__descriptor/native_non_blocking.html b/doc/html/boost_asio/reference/posix__descriptor/native_non_blocking.html index 18296f9b76..0a99a42d9e 100644 --- a/doc/html/boost_asio/reference/posix__descriptor/native_non_blocking.html +++ b/doc/html/boost_asio/reference/posix__descriptor/native_non_blocking.html @@ -49,7 +49,7 @@ void
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/posix__descriptor/native_non_blocking/overload1.html b/doc/html/boost_asio/reference/posix__descriptor/native_non_blocking/overload1.html index f6faa239e2..b81db322d8 100644 --- a/doc/html/boost_asio/reference/posix__descriptor/native_non_blocking/overload1.html +++ b/doc/html/boost_asio/reference/posix__descriptor/native_non_blocking/overload1.html @@ -59,7 +59,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/posix__descriptor/native_non_blocking/overload2.html b/doc/html/boost_asio/reference/posix__descriptor/native_non_blocking/overload2.html index c688c467bd..4d5faf29c3 100644 --- a/doc/html/boost_asio/reference/posix__descriptor/native_non_blocking/overload2.html +++ b/doc/html/boost_asio/reference/posix__descriptor/native_non_blocking/overload2.html @@ -72,7 +72,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/posix__descriptor/native_non_blocking/overload3.html b/doc/html/boost_asio/reference/posix__descriptor/native_non_blocking/overload3.html index 93b1860803..5b6623494a 100644 --- a/doc/html/boost_asio/reference/posix__descriptor/native_non_blocking/overload3.html +++ b/doc/html/boost_asio/reference/posix__descriptor/native_non_blocking/overload3.html @@ -64,7 +64,7 @@
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/posix__descriptor/non_blocking.html b/doc/html/boost_asio/reference/posix__descriptor/non_blocking.html index d62baa616e..450cffd15e 100644 --- a/doc/html/boost_asio/reference/posix__descriptor/non_blocking.html +++ b/doc/html/boost_asio/reference/posix__descriptor/non_blocking.html @@ -49,7 +49,7 @@ void
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/posix__descriptor/non_blocking/overload1.html b/doc/html/boost_asio/reference/posix__descriptor/non_blocking/overload1.html index 563032468e..e6601ddaba 100644 --- a/doc/html/boost_asio/reference/posix__descriptor/non_blocking/overload1.html +++ b/doc/html/boost_asio/reference/posix__descriptor/non_blocking/overload1.html @@ -54,7 +54,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/posix__descriptor/non_blocking/overload2.html b/doc/html/boost_asio/reference/posix__descriptor/non_blocking/overload2.html index e3322f1fdd..74b8f65f19 100644 --- a/doc/html/boost_asio/reference/posix__descriptor/non_blocking/overload2.html +++ b/doc/html/boost_asio/reference/posix__descriptor/non_blocking/overload2.html @@ -73,7 +73,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/posix__descriptor/non_blocking/overload3.html b/doc/html/boost_asio/reference/posix__descriptor/non_blocking/overload3.html index de78792850..f6b8e986e9 100644 --- a/doc/html/boost_asio/reference/posix__descriptor/non_blocking/overload3.html +++ b/doc/html/boost_asio/reference/posix__descriptor/non_blocking/overload3.html @@ -65,7 +65,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/posix__descriptor/operator_eq_.html b/doc/html/boost_asio/reference/posix__descriptor/operator_eq_.html index fc4d7daa6b..e6e99100ac 100644 --- a/doc/html/boost_asio/reference/posix__descriptor/operator_eq_.html +++ b/doc/html/boost_asio/reference/posix__descriptor/operator_eq_.html @@ -61,7 +61,7 @@ Move-assign
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/posix__descriptor/release.html b/doc/html/boost_asio/reference/posix__descriptor/release.html index 849b30e8ed..899f84704d 100644 --- a/doc/html/boost_asio/reference/posix__descriptor/release.html +++ b/doc/html/boost_asio/reference/posix__descriptor/release.html @@ -46,7 +46,7 @@ Release
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/posix__descriptor/wait.html b/doc/html/boost_asio/reference/posix__descriptor/wait.html index 92c31ec343..bf5bef12bf 100644 --- a/doc/html/boost_asio/reference/posix__descriptor/wait.html +++ b/doc/html/boost_asio/reference/posix__descriptor/wait.html @@ -44,7 +44,7 @@ void
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/posix__descriptor/wait/overload1.html b/doc/html/boost_asio/reference/posix__descriptor/wait/overload1.html index b66e932c28..80f6def3d3 100644 --- a/doc/html/boost_asio/reference/posix__descriptor/wait/overload1.html +++ b/doc/html/boost_asio/reference/posix__descriptor/wait/overload1.html @@ -65,7 +65,7 @@ descriptor.wait(boost::asio::posix::stream_descriptor::wait_read);
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/posix__descriptor/wait/overload2.html b/doc/html/boost_asio/reference/posix__descriptor/wait/overload2.html index 8878ac32ae..96006f082f 100644 --- a/doc/html/boost_asio/reference/posix__descriptor/wait/overload2.html +++ b/doc/html/boost_asio/reference/posix__descriptor/wait/overload2.html @@ -71,7 +71,7 @@ descriptor.wait(boost::asio::posix::stream_descriptor::wait_read, ec);
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/posix__descriptor/wait_type.html b/doc/html/boost_asio/reference/posix__descriptor/wait_type.html index 2635b04299..3f17ae46a4 100644 --- a/doc/html/boost_asio/reference/posix__descriptor/wait_type.html +++ b/doc/html/boost_asio/reference/posix__descriptor/wait_type.html @@ -65,7 +65,7 @@ Wait
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/posix__descriptor_base.html b/doc/html/boost_asio/reference/posix__descriptor_base.html index e364c10550..e77972ab4a 100644 --- a/doc/html/boost_asio/reference/posix__descriptor_base.html +++ b/doc/html/boost_asio/reference/posix__descriptor_base.html @@ -130,7 +130,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/posix__descriptor_base/_descriptor_base.html b/doc/html/boost_asio/reference/posix__descriptor_base/_descriptor_base.html index ca96ee2fd4..09bfae5323 100644 --- a/doc/html/boost_asio/reference/posix__descriptor_base/_descriptor_base.html +++ b/doc/html/boost_asio/reference/posix__descriptor_base/_descriptor_base.html @@ -36,7 +36,7 @@ Protected
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/posix__descriptor_base/bytes_readable.html b/doc/html/boost_asio/reference/posix__descriptor_base/bytes_readable.html index b25c135ccd..c45ea45c33 100644 --- a/doc/html/boost_asio/reference/posix__descriptor_base/bytes_readable.html +++ b/doc/html/boost_asio/reference/posix__descriptor_base/bytes_readable.html @@ -59,7 +59,7 @@ std::size_t bytes_readable = command.get();
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/posix__descriptor_base/wait_type.html b/doc/html/boost_asio/reference/posix__descriptor_base/wait_type.html index 6f47ae4259..f2c61d624a 100644 --- a/doc/html/boost_asio/reference/posix__descriptor_base/wait_type.html +++ b/doc/html/boost_asio/reference/posix__descriptor_base/wait_type.html @@ -65,7 +65,7 @@ Wait
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/posix__stream_descriptor.html b/doc/html/boost_asio/reference/posix__stream_descriptor.html index 6df28a9be4..a9a0f87dbd 100644 --- a/doc/html/boost_asio/reference/posix__stream_descriptor.html +++ b/doc/html/boost_asio/reference/posix__stream_descriptor.html @@ -442,7 +442,7 @@
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/posix__stream_descriptor/assign.html b/doc/html/boost_asio/reference/posix__stream_descriptor/assign.html index 4a9c4141c4..61098091a3 100644 --- a/doc/html/boost_asio/reference/posix__stream_descriptor/assign.html +++ b/doc/html/boost_asio/reference/posix__stream_descriptor/assign.html @@ -43,7 +43,7 @@ void
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/posix__stream_descriptor/assign/overload1.html b/doc/html/boost_asio/reference/posix__stream_descriptor/assign/overload1.html index 8ee3105450..dfb304a266 100644 --- a/doc/html/boost_asio/reference/posix__stream_descriptor/assign/overload1.html +++ b/doc/html/boost_asio/reference/posix__stream_descriptor/assign/overload1.html @@ -39,7 +39,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/posix__stream_descriptor/assign/overload2.html b/doc/html/boost_asio/reference/posix__stream_descriptor/assign/overload2.html index c303ae9a12..446d855b8f 100644 --- a/doc/html/boost_asio/reference/posix__stream_descriptor/assign/overload2.html +++ b/doc/html/boost_asio/reference/posix__stream_descriptor/assign/overload2.html @@ -40,7 +40,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/posix__stream_descriptor/async_read_some.html b/doc/html/boost_asio/reference/posix__stream_descriptor/async_read_some.html index de2c51076d..2474a30288 100644 --- a/doc/html/boost_asio/reference/posix__stream_descriptor/async_read_some.html +++ b/doc/html/boost_asio/reference/posix__stream_descriptor/async_read_some.html @@ -105,7 +105,7 @@ Start
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/posix__stream_descriptor/async_wait.html b/doc/html/boost_asio/reference/posix__stream_descriptor/async_wait.html index 90e5da83e4..75f36e7976 100644 --- a/doc/html/boost_asio/reference/posix__stream_descriptor/async_wait.html +++ b/doc/html/boost_asio/reference/posix__stream_descriptor/async_wait.html @@ -99,7 +99,7 @@ descriptor.async_wait(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/posix__stream_descriptor/async_write_some.html b/doc/html/boost_asio/reference/posix__stream_descriptor/async_write_some.html index b9e3f70df7..6ad68feb84 100644 --- a/doc/html/boost_asio/reference/posix__stream_descriptor/async_write_some.html +++ b/doc/html/boost_asio/reference/posix__stream_descriptor/async_write_some.html @@ -105,7 +105,7 @@ Start
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/posix__stream_descriptor/bytes_readable.html b/doc/html/boost_asio/reference/posix__stream_descriptor/bytes_readable.html index 12507c7f47..6376f90609 100644 --- a/doc/html/boost_asio/reference/posix__stream_descriptor/bytes_readable.html +++ b/doc/html/boost_asio/reference/posix__stream_descriptor/bytes_readable.html @@ -62,7 +62,7 @@ std::size_t bytes_readable = command.get();
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/posix__stream_descriptor/cancel.html b/doc/html/boost_asio/reference/posix__stream_descriptor/cancel.html index 2a85ede9a5..690bbace02 100644 --- a/doc/html/boost_asio/reference/posix__stream_descriptor/cancel.html +++ b/doc/html/boost_asio/reference/posix__stream_descriptor/cancel.html @@ -41,7 +41,7 @@ void
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/posix__stream_descriptor/cancel/overload1.html b/doc/html/boost_asio/reference/posix__stream_descriptor/cancel/overload1.html index 289afcc82b..2891b7c469 100644 --- a/doc/html/boost_asio/reference/posix__stream_descriptor/cancel/overload1.html +++ b/doc/html/boost_asio/reference/posix__stream_descriptor/cancel/overload1.html @@ -56,7 +56,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/posix__stream_descriptor/cancel/overload2.html b/doc/html/boost_asio/reference/posix__stream_descriptor/cancel/overload2.html index 1738e6c3c2..dae88ec6e6 100644 --- a/doc/html/boost_asio/reference/posix__stream_descriptor/cancel/overload2.html +++ b/doc/html/boost_asio/reference/posix__stream_descriptor/cancel/overload2.html @@ -57,7 +57,7 @@
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/posix__stream_descriptor/close.html b/doc/html/boost_asio/reference/posix__stream_descriptor/close.html index b28d4e7599..18bfe8c998 100644 --- a/doc/html/boost_asio/reference/posix__stream_descriptor/close.html +++ b/doc/html/boost_asio/reference/posix__stream_descriptor/close.html @@ -41,7 +41,7 @@ void
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/posix__stream_descriptor/close/overload1.html b/doc/html/boost_asio/reference/posix__stream_descriptor/close/overload1.html index d33cfecf3e..e2ab794077 100644 --- a/doc/html/boost_asio/reference/posix__stream_descriptor/close/overload1.html +++ b/doc/html/boost_asio/reference/posix__stream_descriptor/close/overload1.html @@ -57,7 +57,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/posix__stream_descriptor/close/overload2.html b/doc/html/boost_asio/reference/posix__stream_descriptor/close/overload2.html index 05a6043f92..1455e9e5b6 100644 --- a/doc/html/boost_asio/reference/posix__stream_descriptor/close/overload2.html +++ b/doc/html/boost_asio/reference/posix__stream_descriptor/close/overload2.html @@ -58,7 +58,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/posix__stream_descriptor/executor_type.html b/doc/html/boost_asio/reference/posix__stream_descriptor/executor_type.html index 463d32cfb3..4a714bc585 100644 --- a/doc/html/boost_asio/reference/posix__stream_descriptor/executor_type.html +++ b/doc/html/boost_asio/reference/posix__stream_descriptor/executor_type.html @@ -206,7 +206,7 @@ The
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/posix__stream_descriptor/get_executor.html b/doc/html/boost_asio/reference/posix__stream_descriptor/get_executor.html index bf858ef858..7c6bc032e7 100644 --- a/doc/html/boost_asio/reference/posix__stream_descriptor/get_executor.html +++ b/doc/html/boost_asio/reference/posix__stream_descriptor/get_executor.html @@ -39,7 +39,7 @@ Get
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/posix__stream_descriptor/get_io_context.html b/doc/html/boost_asio/reference/posix__stream_descriptor/get_io_context.html index 5c1e0050c5..dcba6d100c 100644 --- a/doc/html/boost_asio/reference/posix__stream_descriptor/get_io_context.html +++ b/doc/html/boost_asio/reference/posix__stream_descriptor/get_io_context.html @@ -54,7 +54,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/posix__stream_descriptor/get_io_service.html b/doc/html/boost_asio/reference/posix__stream_descriptor/get_io_service.html index 6b513a7360..7c4056252f 100644 --- a/doc/html/boost_asio/reference/posix__stream_descriptor/get_io_service.html +++ b/doc/html/boost_asio/reference/posix__stream_descriptor/get_io_service.html @@ -54,7 +54,7 @@
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/posix__stream_descriptor/io_control.html b/doc/html/boost_asio/reference/posix__stream_descriptor/io_control.html index 9d5799301e..230c75d4ca 100644 --- a/doc/html/boost_asio/reference/posix__stream_descriptor/io_control.html +++ b/doc/html/boost_asio/reference/posix__stream_descriptor/io_control.html @@ -47,7 +47,7 @@ void
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/posix__stream_descriptor/io_control/overload1.html b/doc/html/boost_asio/reference/posix__stream_descriptor/io_control/overload1.html index a68e49d5d6..331e0aad7a 100644 --- a/doc/html/boost_asio/reference/posix__stream_descriptor/io_control/overload1.html +++ b/doc/html/boost_asio/reference/posix__stream_descriptor/io_control/overload1.html @@ -83,7 +83,7 @@ std::size_t bytes_readable = command.get();
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/posix__stream_descriptor/io_control/overload2.html b/doc/html/boost_asio/reference/posix__stream_descriptor/io_control/overload2.html index 4a97d39b61..1f311f5090 100644 --- a/doc/html/boost_asio/reference/posix__stream_descriptor/io_control/overload2.html +++ b/doc/html/boost_asio/reference/posix__stream_descriptor/io_control/overload2.html @@ -80,7 +80,7 @@ std::size_t bytes_readable = command.get();
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/posix__stream_descriptor/is_open.html b/doc/html/boost_asio/reference/posix__stream_descriptor/is_open.html index ea05e5b601..3d1b046fe7 100644 --- a/doc/html/boost_asio/reference/posix__stream_descriptor/is_open.html +++ b/doc/html/boost_asio/reference/posix__stream_descriptor/is_open.html @@ -39,7 +39,7 @@ Determine
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/posix__stream_descriptor/lowest_layer.html b/doc/html/boost_asio/reference/posix__stream_descriptor/lowest_layer.html index e2d22a3551..805d860da7 100644 --- a/doc/html/boost_asio/reference/posix__stream_descriptor/lowest_layer.html +++ b/doc/html/boost_asio/reference/posix__stream_descriptor/lowest_layer.html @@ -43,7 +43,7 @@ Get
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/posix__stream_descriptor/lowest_layer/overload1.html b/doc/html/boost_asio/reference/posix__stream_descriptor/lowest_layer/overload1.html index a4881cc067..da1c2ec8ba 100644 --- a/doc/html/boost_asio/reference/posix__stream_descriptor/lowest_layer/overload1.html +++ b/doc/html/boost_asio/reference/posix__stream_descriptor/lowest_layer/overload1.html @@ -52,7 +52,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/posix__stream_descriptor/lowest_layer/overload2.html b/doc/html/boost_asio/reference/posix__stream_descriptor/lowest_layer/overload2.html index d8f98dd277..f93a4f989c 100644 --- a/doc/html/boost_asio/reference/posix__stream_descriptor/lowest_layer/overload2.html +++ b/doc/html/boost_asio/reference/posix__stream_descriptor/lowest_layer/overload2.html @@ -52,7 +52,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/posix__stream_descriptor/lowest_layer_type.html b/doc/html/boost_asio/reference/posix__stream_descriptor/lowest_layer_type.html index e4cf4c2797..272f7febf0 100644 --- a/doc/html/boost_asio/reference/posix__stream_descriptor/lowest_layer_type.html +++ b/doc/html/boost_asio/reference/posix__stream_descriptor/lowest_layer_type.html @@ -432,7 +432,7 @@ A
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/posix__stream_descriptor/native_handle.html b/doc/html/boost_asio/reference/posix__stream_descriptor/native_handle.html index 8edab270e4..2276a6ea2d 100644 --- a/doc/html/boost_asio/reference/posix__stream_descriptor/native_handle.html +++ b/doc/html/boost_asio/reference/posix__stream_descriptor/native_handle.html @@ -44,7 +44,7 @@ Get
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/posix__stream_descriptor/native_handle_type.html b/doc/html/boost_asio/reference/posix__stream_descriptor/native_handle_type.html index 2a9879da68..369eea7fcd 100644 --- a/doc/html/boost_asio/reference/posix__stream_descriptor/native_handle_type.html +++ b/doc/html/boost_asio/reference/posix__stream_descriptor/native_handle_type.html @@ -49,7 +49,7 @@ The
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/posix__stream_descriptor/native_non_blocking.html b/doc/html/boost_asio/reference/posix__stream_descriptor/native_non_blocking.html index 04c301704d..e087b01c87 100644 --- a/doc/html/boost_asio/reference/posix__stream_descriptor/native_non_blocking.html +++ b/doc/html/boost_asio/reference/posix__stream_descriptor/native_non_blocking.html @@ -49,7 +49,7 @@ void
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/posix__stream_descriptor/native_non_blocking/overload1.html b/doc/html/boost_asio/reference/posix__stream_descriptor/native_non_blocking/overload1.html index 5d8b9267fb..b319cd9647 100644 --- a/doc/html/boost_asio/reference/posix__stream_descriptor/native_non_blocking/overload1.html +++ b/doc/html/boost_asio/reference/posix__stream_descriptor/native_non_blocking/overload1.html @@ -62,7 +62,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/posix__stream_descriptor/native_non_blocking/overload2.html b/doc/html/boost_asio/reference/posix__stream_descriptor/native_non_blocking/overload2.html index 329e2d183a..5974491a4a 100644 --- a/doc/html/boost_asio/reference/posix__stream_descriptor/native_non_blocking/overload2.html +++ b/doc/html/boost_asio/reference/posix__stream_descriptor/native_non_blocking/overload2.html @@ -75,7 +75,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/posix__stream_descriptor/native_non_blocking/overload3.html b/doc/html/boost_asio/reference/posix__stream_descriptor/native_non_blocking/overload3.html index 0257ca2fab..f0818609dc 100644 --- a/doc/html/boost_asio/reference/posix__stream_descriptor/native_non_blocking/overload3.html +++ b/doc/html/boost_asio/reference/posix__stream_descriptor/native_non_blocking/overload3.html @@ -67,7 +67,7 @@
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/posix__stream_descriptor/non_blocking.html b/doc/html/boost_asio/reference/posix__stream_descriptor/non_blocking.html index 4f35257f67..439143f2d7 100644 --- a/doc/html/boost_asio/reference/posix__stream_descriptor/non_blocking.html +++ b/doc/html/boost_asio/reference/posix__stream_descriptor/non_blocking.html @@ -49,7 +49,7 @@ void
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/posix__stream_descriptor/non_blocking/overload1.html b/doc/html/boost_asio/reference/posix__stream_descriptor/non_blocking/overload1.html index 3ff2907dc6..4e21473f30 100644 --- a/doc/html/boost_asio/reference/posix__stream_descriptor/non_blocking/overload1.html +++ b/doc/html/boost_asio/reference/posix__stream_descriptor/non_blocking/overload1.html @@ -57,7 +57,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/posix__stream_descriptor/non_blocking/overload2.html b/doc/html/boost_asio/reference/posix__stream_descriptor/non_blocking/overload2.html index f78ee43c25..d02f348723 100644 --- a/doc/html/boost_asio/reference/posix__stream_descriptor/non_blocking/overload2.html +++ b/doc/html/boost_asio/reference/posix__stream_descriptor/non_blocking/overload2.html @@ -76,7 +76,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/posix__stream_descriptor/non_blocking/overload3.html b/doc/html/boost_asio/reference/posix__stream_descriptor/non_blocking/overload3.html index 48bcafa08e..621a27c3d4 100644 --- a/doc/html/boost_asio/reference/posix__stream_descriptor/non_blocking/overload3.html +++ b/doc/html/boost_asio/reference/posix__stream_descriptor/non_blocking/overload3.html @@ -68,7 +68,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/posix__stream_descriptor/operator_eq_.html b/doc/html/boost_asio/reference/posix__stream_descriptor/operator_eq_.html index aa7237dddd..d84d198047 100644 --- a/doc/html/boost_asio/reference/posix__stream_descriptor/operator_eq_.html +++ b/doc/html/boost_asio/reference/posix__stream_descriptor/operator_eq_.html @@ -63,7 +63,7 @@ Move-assign
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/posix__stream_descriptor/read_some.html b/doc/html/boost_asio/reference/posix__stream_descriptor/read_some.html index 9dab4a5960..933d4b3fb3 100644 --- a/doc/html/boost_asio/reference/posix__stream_descriptor/read_some.html +++ b/doc/html/boost_asio/reference/posix__stream_descriptor/read_some.html @@ -47,7 +47,7 @@ std::size_t
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/posix__stream_descriptor/read_some/overload1.html b/doc/html/boost_asio/reference/posix__stream_descriptor/read_some/overload1.html index 48610a4c44..7a77edb665 100644 --- a/doc/html/boost_asio/reference/posix__stream_descriptor/read_some/overload1.html +++ b/doc/html/boost_asio/reference/posix__stream_descriptor/read_some/overload1.html @@ -103,7 +103,7 @@ std::size_t read_some(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/posix__stream_descriptor/read_some/overload2.html b/doc/html/boost_asio/reference/posix__stream_descriptor/read_some/overload2.html index 33dc7ae60a..cc4bb4ec4d 100644 --- a/doc/html/boost_asio/reference/posix__stream_descriptor/read_some/overload2.html +++ b/doc/html/boost_asio/reference/posix__stream_descriptor/read_some/overload2.html @@ -79,7 +79,7 @@ std::size_t read_some(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/posix__stream_descriptor/release.html b/doc/html/boost_asio/reference/posix__stream_descriptor/release.html index 9942412369..d68e3aad67 100644 --- a/doc/html/boost_asio/reference/posix__stream_descriptor/release.html +++ b/doc/html/boost_asio/reference/posix__stream_descriptor/release.html @@ -49,7 +49,7 @@ Release
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/posix__stream_descriptor/stream_descriptor.html b/doc/html/boost_asio/reference/posix__stream_descriptor/stream_descriptor.html index 384b6504c0..773147a0ff 100644 --- a/doc/html/boost_asio/reference/posix__stream_descriptor/stream_descriptor.html +++ b/doc/html/boost_asio/reference/posix__stream_descriptor/stream_descriptor.html @@ -56,7 +56,7 @@ Construct
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/posix__stream_descriptor/stream_descriptor/overload1.html b/doc/html/boost_asio/reference/posix__stream_descriptor/stream_descriptor/overload1.html index 216d6f1ae0..c0187274af 100644 --- a/doc/html/boost_asio/reference/posix__stream_descriptor/stream_descriptor/overload1.html +++ b/doc/html/boost_asio/reference/posix__stream_descriptor/stream_descriptor/overload1.html @@ -57,7 +57,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/posix__stream_descriptor/stream_descriptor/overload2.html b/doc/html/boost_asio/reference/posix__stream_descriptor/stream_descriptor/overload2.html index 709fff1912..d2084fd35c 100644 --- a/doc/html/boost_asio/reference/posix__stream_descriptor/stream_descriptor/overload2.html +++ b/doc/html/boost_asio/reference/posix__stream_descriptor/stream_descriptor/overload2.html @@ -74,7 +74,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/posix__stream_descriptor/stream_descriptor/overload3.html b/doc/html/boost_asio/reference/posix__stream_descriptor/stream_descriptor/overload3.html index d3098a4db8..66647d673c 100644 --- a/doc/html/boost_asio/reference/posix__stream_descriptor/stream_descriptor/overload3.html +++ b/doc/html/boost_asio/reference/posix__stream_descriptor/stream_descriptor/overload3.html @@ -62,7 +62,7 @@
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/posix__stream_descriptor/wait.html b/doc/html/boost_asio/reference/posix__stream_descriptor/wait.html index b16d7fe409..f980588a85 100644 --- a/doc/html/boost_asio/reference/posix__stream_descriptor/wait.html +++ b/doc/html/boost_asio/reference/posix__stream_descriptor/wait.html @@ -44,7 +44,7 @@ void
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/posix__stream_descriptor/wait/overload1.html b/doc/html/boost_asio/reference/posix__stream_descriptor/wait/overload1.html index 98ed7c1e78..37c996b82b 100644 --- a/doc/html/boost_asio/reference/posix__stream_descriptor/wait/overload1.html +++ b/doc/html/boost_asio/reference/posix__stream_descriptor/wait/overload1.html @@ -68,7 +68,7 @@ descriptor.wait(boost::asio::posix::stream_descriptor::wait_read);
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/posix__stream_descriptor/wait/overload2.html b/doc/html/boost_asio/reference/posix__stream_descriptor/wait/overload2.html index 47b4084acf..ea4d144a71 100644 --- a/doc/html/boost_asio/reference/posix__stream_descriptor/wait/overload2.html +++ b/doc/html/boost_asio/reference/posix__stream_descriptor/wait/overload2.html @@ -74,7 +74,7 @@ descriptor.wait(boost::asio::posix::stream_descriptor::wait_read, ec);
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/posix__stream_descriptor/wait_type.html b/doc/html/boost_asio/reference/posix__stream_descriptor/wait_type.html index 4263ce17ca..673ff7d8b1 100644 --- a/doc/html/boost_asio/reference/posix__stream_descriptor/wait_type.html +++ b/doc/html/boost_asio/reference/posix__stream_descriptor/wait_type.html @@ -68,7 +68,7 @@ Wait
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/posix__stream_descriptor/write_some.html b/doc/html/boost_asio/reference/posix__stream_descriptor/write_some.html index 821b787409..4a00a86e4f 100644 --- a/doc/html/boost_asio/reference/posix__stream_descriptor/write_some.html +++ b/doc/html/boost_asio/reference/posix__stream_descriptor/write_some.html @@ -47,7 +47,7 @@ std::size_t
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/posix__stream_descriptor/write_some/overload1.html b/doc/html/boost_asio/reference/posix__stream_descriptor/write_some/overload1.html index 276d3823d4..0d64f48571 100644 --- a/doc/html/boost_asio/reference/posix__stream_descriptor/write_some/overload1.html +++ b/doc/html/boost_asio/reference/posix__stream_descriptor/write_some/overload1.html @@ -103,7 +103,7 @@ std::size_t write_some(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/posix__stream_descriptor/write_some/overload2.html b/doc/html/boost_asio/reference/posix__stream_descriptor/write_some/overload2.html index 6fe6a27c8c..9517ac4dc0 100644 --- a/doc/html/boost_asio/reference/posix__stream_descriptor/write_some/overload2.html +++ b/doc/html/boost_asio/reference/posix__stream_descriptor/write_some/overload2.html @@ -79,7 +79,7 @@ std::size_t write_some(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/post.html b/doc/html/boost_asio/reference/post.html index 2af327cd8d..5c3da3a3c3 100644 --- a/doc/html/boost_asio/reference/post.html +++ b/doc/html/boost_asio/reference/post.html @@ -68,7 +68,7 @@ template<
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/post/overload1.html b/doc/html/boost_asio/reference/post/overload1.html index fd5d80bd8e..8d54e69afa 100644 --- a/doc/html/boost_asio/reference/post/overload1.html +++ b/doc/html/boost_asio/reference/post/overload1.html @@ -69,7 +69,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/post/overload2.html b/doc/html/boost_asio/reference/post/overload2.html index 4083bda109..472865ccdd 100644 --- a/doc/html/boost_asio/reference/post/overload2.html +++ b/doc/html/boost_asio/reference/post/overload2.html @@ -80,7 +80,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/post/overload3.html b/doc/html/boost_asio/reference/post/overload3.html index 2849447f6c..e78e65c713 100644 --- a/doc/html/boost_asio/reference/post/overload3.html +++ b/doc/html/boost_asio/reference/post/overload3.html @@ -48,7 +48,7 @@
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/read.html b/doc/html/boost_asio/reference/read.html index a0d205a162..e19dbf749c 100644 --- a/doc/html/boost_asio/reference/read.html +++ b/doc/html/boost_asio/reference/read.html @@ -79,7 +79,7 @@ template< std::size_t read( SyncReadStream & s, DynamicBuffer && buffers, - typename enable_if< is_dynamic_buffer< DynamicBuffer >::value >::type * = 0); + typename enable_if< is_dynamic_buffer< typename decay< DynamicBuffer >::type >::value >::type * = 0); » more... template< @@ -89,7 +89,7 @@ std::size_t » more... template< @@ -100,7 +100,7 @@ std::size_t » more... template< @@ -112,7 +112,7 @@ std::size_t » more... template< @@ -166,7 +166,7 @@ std::size_t
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/read/overload1.html b/doc/html/boost_asio/reference/read/overload1.html index 6e7b7ae442..415cfa2b64 100644 --- a/doc/html/boost_asio/reference/read/overload1.html +++ b/doc/html/boost_asio/reference/read/overload1.html @@ -125,7 +125,7 @@ std::size_t read(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/read/overload10.html b/doc/html/boost_asio/reference/read/overload10.html index cff2aa6ba1..a1aef32aa0 100644 --- a/doc/html/boost_asio/reference/read/overload10.html +++ b/doc/html/boost_asio/reference/read/overload10.html @@ -99,7 +99,7 @@ std::size_t read(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/read/overload11.html b/doc/html/boost_asio/reference/read/overload11.html index 7db66a08a8..a4e848582b 100644 --- a/doc/html/boost_asio/reference/read/overload11.html +++ b/doc/html/boost_asio/reference/read/overload11.html @@ -118,7 +118,7 @@ std::size_t read(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/read/overload12.html b/doc/html/boost_asio/reference/read/overload12.html index e4106b791f..6b57813c6e 100644 --- a/doc/html/boost_asio/reference/read/overload12.html +++ b/doc/html/boost_asio/reference/read/overload12.html @@ -111,7 +111,7 @@ std::size_t read(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/read/overload2.html b/doc/html/boost_asio/reference/read/overload2.html index 6a0bdcbed1..fc5669dbe1 100644 --- a/doc/html/boost_asio/reference/read/overload2.html +++ b/doc/html/boost_asio/reference/read/overload2.html @@ -117,7 +117,7 @@ std::size_t read(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/read/overload3.html b/doc/html/boost_asio/reference/read/overload3.html index 94c6c72aa5..880ed38e39 100644 --- a/doc/html/boost_asio/reference/read/overload3.html +++ b/doc/html/boost_asio/reference/read/overload3.html @@ -137,7 +137,7 @@ std::size_t read(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/read/overload4.html b/doc/html/boost_asio/reference/read/overload4.html index b96762bf22..b6700332fa 100644 --- a/doc/html/boost_asio/reference/read/overload4.html +++ b/doc/html/boost_asio/reference/read/overload4.html @@ -114,7 +114,7 @@ std::size_t read(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/read/overload5.html b/doc/html/boost_asio/reference/read/overload5.html index c69270de3b..6d6a270edc 100644 --- a/doc/html/boost_asio/reference/read/overload5.html +++ b/doc/html/boost_asio/reference/read/overload5.html @@ -36,7 +36,7 @@ std::size_t read( SyncReadStream & s, DynamicBuffer && buffers, - typename enable_if< is_dynamic_buffer< DynamicBuffer >::value >::type * = 0); + typename enable_if< is_dynamic_buffer< typename decay< DynamicBuffer >::type >::value >::type * = 0);

    This function is used to read a certain number of bytes of data from a @@ -108,7 +108,7 @@ std::size_t read(

    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/read/overload6.html b/doc/html/boost_asio/reference/read/overload6.html index 251a790c08..15a75a1b95 100644 --- a/doc/html/boost_asio/reference/read/overload6.html +++ b/doc/html/boost_asio/reference/read/overload6.html @@ -37,7 +37,7 @@ std::size_t read( SyncReadStream & s, DynamicBuffer && buffers, boost::system::error_code & ec, - typename enable_if< is_dynamic_buffer< DynamicBuffer >::value >::type * = 0); + typename enable_if< is_dynamic_buffer< typename decay< DynamicBuffer >::type >::value >::type * = 0);

    This function is used to read a certain number of bytes of data from a @@ -99,7 +99,7 @@ std::size_t read(

    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/read/overload7.html b/doc/html/boost_asio/reference/read/overload7.html index 58417ed596..20f8a737ec 100644 --- a/doc/html/boost_asio/reference/read/overload7.html +++ b/doc/html/boost_asio/reference/read/overload7.html @@ -38,7 +38,7 @@ std::size_t read( SyncReadStream & s, DynamicBuffer && buffers, CompletionCondition completion_condition, - typename enable_if< is_dynamic_buffer< DynamicBuffer >::value >::type * = 0); + typename enable_if< is_dynamic_buffer< typename decay< DynamicBuffer >::type >::value >::type * = 0);

    This function is used to read a certain number of bytes of data from a @@ -119,7 +119,7 @@ std::size_t read(

    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/read/overload8.html b/doc/html/boost_asio/reference/read/overload8.html index c2f854e407..b6963727e6 100644 --- a/doc/html/boost_asio/reference/read/overload8.html +++ b/doc/html/boost_asio/reference/read/overload8.html @@ -39,7 +39,7 @@ std::size_t read( DynamicBuffer && buffers, CompletionCondition completion_condition, boost::system::error_code & ec, - typename enable_if< is_dynamic_buffer< DynamicBuffer >::value >::type * = 0); + typename enable_if< is_dynamic_buffer< typename decay< DynamicBuffer >::type >::value >::type * = 0);

    This function is used to read a certain number of bytes of data from a @@ -112,7 +112,7 @@ std::size_t read(

    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/read/overload9.html b/doc/html/boost_asio/reference/read/overload9.html index 3c66a674a5..1433f1c429 100644 --- a/doc/html/boost_asio/reference/read/overload9.html +++ b/doc/html/boost_asio/reference/read/overload9.html @@ -107,7 +107,7 @@ std::size_t read(
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/read_at.html b/doc/html/boost_asio/reference/read_at.html index 6b6c5f10fa..72c49ca895 100644 --- a/doc/html/boost_asio/reference/read_at.html +++ b/doc/html/boost_asio/reference/read_at.html @@ -128,7 +128,7 @@ std::size_t
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/read_at/overload1.html b/doc/html/boost_asio/reference/read_at/overload1.html index 4f5d59ea84..e48cd6bfe7 100644 --- a/doc/html/boost_asio/reference/read_at/overload1.html +++ b/doc/html/boost_asio/reference/read_at/overload1.html @@ -130,7 +130,7 @@ std::size_t read_at(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/read_at/overload2.html b/doc/html/boost_asio/reference/read_at/overload2.html index a14fd0863d..eb192b54c2 100644 --- a/doc/html/boost_asio/reference/read_at/overload2.html +++ b/doc/html/boost_asio/reference/read_at/overload2.html @@ -123,7 +123,7 @@ std::size_t read_at(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/read_at/overload3.html b/doc/html/boost_asio/reference/read_at/overload3.html index 1c6c63d0ab..201593f8d9 100644 --- a/doc/html/boost_asio/reference/read_at/overload3.html +++ b/doc/html/boost_asio/reference/read_at/overload3.html @@ -142,7 +142,7 @@ std::size_t read_at(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/read_at/overload4.html b/doc/html/boost_asio/reference/read_at/overload4.html index 01952832b7..981282b20c 100644 --- a/doc/html/boost_asio/reference/read_at/overload4.html +++ b/doc/html/boost_asio/reference/read_at/overload4.html @@ -119,7 +119,7 @@ std::size_t read_at(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/read_at/overload5.html b/doc/html/boost_asio/reference/read_at/overload5.html index ce60f472c8..4ffad9b3f9 100644 --- a/doc/html/boost_asio/reference/read_at/overload5.html +++ b/doc/html/boost_asio/reference/read_at/overload5.html @@ -108,7 +108,7 @@ std::size_t read_at(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/read_at/overload6.html b/doc/html/boost_asio/reference/read_at/overload6.html index cf93afc4bf..c2005465f9 100644 --- a/doc/html/boost_asio/reference/read_at/overload6.html +++ b/doc/html/boost_asio/reference/read_at/overload6.html @@ -100,7 +100,7 @@ std::size_t read_at(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/read_at/overload7.html b/doc/html/boost_asio/reference/read_at/overload7.html index ea0b96d941..b178d4c370 100644 --- a/doc/html/boost_asio/reference/read_at/overload7.html +++ b/doc/html/boost_asio/reference/read_at/overload7.html @@ -119,7 +119,7 @@ std::size_t read_at(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/read_at/overload8.html b/doc/html/boost_asio/reference/read_at/overload8.html index e61c6e3ecf..14dcc51db3 100644 --- a/doc/html/boost_asio/reference/read_at/overload8.html +++ b/doc/html/boost_asio/reference/read_at/overload8.html @@ -112,7 +112,7 @@ std::size_t read_at(
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/read_until.html b/doc/html/boost_asio/reference/read_until.html index 534e3e45c2..d90bdd075c 100644 --- a/doc/html/boost_asio/reference/read_until.html +++ b/doc/html/boost_asio/reference/read_until.html @@ -205,7 +205,7 @@ std::size_t
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/read_until/overload1.html b/doc/html/boost_asio/reference/read_until/overload1.html index 6ec9efd626..0bca8c53cd 100644 --- a/doc/html/boost_asio/reference/read_until/overload1.html +++ b/doc/html/boost_asio/reference/read_until/overload1.html @@ -150,7 +150,7 @@ data.erase(0, n);
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/read_until/overload10.html b/doc/html/boost_asio/reference/read_until/overload10.html index 721e7a3b1a..6570ca16ea 100644 --- a/doc/html/boost_asio/reference/read_until/overload10.html +++ b/doc/html/boost_asio/reference/read_until/overload10.html @@ -104,7 +104,7 @@ std::size_t read_until(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/read_until/overload11.html b/doc/html/boost_asio/reference/read_until/overload11.html index e232318cc9..4f0e0ba626 100644 --- a/doc/html/boost_asio/reference/read_until/overload11.html +++ b/doc/html/boost_asio/reference/read_until/overload11.html @@ -147,7 +147,7 @@ std::getline(is, line);
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/read_until/overload12.html b/doc/html/boost_asio/reference/read_until/overload12.html index a9c44acede..c191240d8a 100644 --- a/doc/html/boost_asio/reference/read_until/overload12.html +++ b/doc/html/boost_asio/reference/read_until/overload12.html @@ -104,7 +104,7 @@ std::size_t read_until(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/read_until/overload13.html b/doc/html/boost_asio/reference/read_until/overload13.html index e49ec691f2..c150aed895 100644 --- a/doc/html/boost_asio/reference/read_until/overload13.html +++ b/doc/html/boost_asio/reference/read_until/overload13.html @@ -149,7 +149,7 @@ std::getline(is, line);
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/read_until/overload14.html b/doc/html/boost_asio/reference/read_until/overload14.html index 11f79f3de6..d7d2e1b3aa 100644 --- a/doc/html/boost_asio/reference/read_until/overload14.html +++ b/doc/html/boost_asio/reference/read_until/overload14.html @@ -106,7 +106,7 @@ std::size_t read_until(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/read_until/overload15.html b/doc/html/boost_asio/reference/read_until/overload15.html index d9fd158734..b93d79a6c1 100644 --- a/doc/html/boost_asio/reference/read_until/overload15.html +++ b/doc/html/boost_asio/reference/read_until/overload15.html @@ -197,7 +197,7 @@ boost::asio::read_until(s, b, match_char('a'));
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/read_until/overload16.html b/doc/html/boost_asio/reference/read_until/overload16.html index 07bb54f6d2..e751a23904 100644 --- a/doc/html/boost_asio/reference/read_until/overload16.html +++ b/doc/html/boost_asio/reference/read_until/overload16.html @@ -135,7 +135,7 @@ std::size_t read_until(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/read_until/overload2.html b/doc/html/boost_asio/reference/read_until/overload2.html index cc6174f971..6c978bcc64 100644 --- a/doc/html/boost_asio/reference/read_until/overload2.html +++ b/doc/html/boost_asio/reference/read_until/overload2.html @@ -107,7 +107,7 @@ std::size_t read_until(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/read_until/overload3.html b/doc/html/boost_asio/reference/read_until/overload3.html index 2b4f81134f..9ddb6f0b6d 100644 --- a/doc/html/boost_asio/reference/read_until/overload3.html +++ b/doc/html/boost_asio/reference/read_until/overload3.html @@ -138,7 +138,7 @@ data.erase(0, n);
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/read_until/overload4.html b/doc/html/boost_asio/reference/read_until/overload4.html index c95ea48982..d9406dde8c 100644 --- a/doc/html/boost_asio/reference/read_until/overload4.html +++ b/doc/html/boost_asio/reference/read_until/overload4.html @@ -107,7 +107,7 @@ std::size_t read_until(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/read_until/overload5.html b/doc/html/boost_asio/reference/read_until/overload5.html index 427662288a..2e900796bc 100644 --- a/doc/html/boost_asio/reference/read_until/overload5.html +++ b/doc/html/boost_asio/reference/read_until/overload5.html @@ -152,7 +152,7 @@ data.erase(0, n);
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/read_until/overload6.html b/doc/html/boost_asio/reference/read_until/overload6.html index c960b671bb..90b4da87f6 100644 --- a/doc/html/boost_asio/reference/read_until/overload6.html +++ b/doc/html/boost_asio/reference/read_until/overload6.html @@ -109,7 +109,7 @@ std::size_t read_until(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/read_until/overload7.html b/doc/html/boost_asio/reference/read_until/overload7.html index 24844fd051..eeb5989e56 100644 --- a/doc/html/boost_asio/reference/read_until/overload7.html +++ b/doc/html/boost_asio/reference/read_until/overload7.html @@ -199,7 +199,7 @@ boost::asio::read_until(s, data, match_char('a'));
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/read_until/overload8.html b/doc/html/boost_asio/reference/read_until/overload8.html index 3a4415b09e..1d9bd9e35c 100644 --- a/doc/html/boost_asio/reference/read_until/overload8.html +++ b/doc/html/boost_asio/reference/read_until/overload8.html @@ -136,7 +136,7 @@ std::size_t read_until(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/read_until/overload9.html b/doc/html/boost_asio/reference/read_until/overload9.html index bd79b24b7e..49eb64910a 100644 --- a/doc/html/boost_asio/reference/read_until/overload9.html +++ b/doc/html/boost_asio/reference/read_until/overload9.html @@ -147,7 +147,7 @@ std::getline(is, line);
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/read_write_operations.html b/doc/html/boost_asio/reference/read_write_operations.html index a3a951ffa5..0325e5968f 100644 --- a/doc/html/boost_asio/reference/read_write_operations.html +++ b/doc/html/boost_asio/reference/read_write_operations.html @@ -60,7 +60,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/resolver_errc__try_again.html b/doc/html/boost_asio/reference/resolver_errc__try_again.html index 05df208c8e..0b40c4659c 100644 --- a/doc/html/boost_asio/reference/resolver_errc__try_again.html +++ b/doc/html/boost_asio/reference/resolver_errc__try_again.html @@ -44,7 +44,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/serial_port.html b/doc/html/boost_asio/reference/serial_port.html index 4fd2a514e2..0123170538 100644 --- a/doc/html/boost_asio/reference/serial_port.html +++ b/doc/html/boost_asio/reference/serial_port.html @@ -399,7 +399,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/serial_port/_serial_port.html b/doc/html/boost_asio/reference/serial_port/_serial_port.html index e9760e6393..32e49768b4 100644 --- a/doc/html/boost_asio/reference/serial_port/_serial_port.html +++ b/doc/html/boost_asio/reference/serial_port/_serial_port.html @@ -40,7 +40,7 @@ Destroys
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/serial_port/assign.html b/doc/html/boost_asio/reference/serial_port/assign.html index 83f0af673a..ab12cc344d 100644 --- a/doc/html/boost_asio/reference/serial_port/assign.html +++ b/doc/html/boost_asio/reference/serial_port/assign.html @@ -43,7 +43,7 @@ void
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/serial_port/assign/overload1.html b/doc/html/boost_asio/reference/serial_port/assign/overload1.html index f71176bf28..8c0080aa0b 100644 --- a/doc/html/boost_asio/reference/serial_port/assign/overload1.html +++ b/doc/html/boost_asio/reference/serial_port/assign/overload1.html @@ -36,7 +36,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/serial_port/assign/overload2.html b/doc/html/boost_asio/reference/serial_port/assign/overload2.html index a9403ff056..e7a0de0b06 100644 --- a/doc/html/boost_asio/reference/serial_port/assign/overload2.html +++ b/doc/html/boost_asio/reference/serial_port/assign/overload2.html @@ -37,7 +37,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/serial_port/async_read_some.html b/doc/html/boost_asio/reference/serial_port/async_read_some.html index 6a3eaceec5..783952d474 100644 --- a/doc/html/boost_asio/reference/serial_port/async_read_some.html +++ b/doc/html/boost_asio/reference/serial_port/async_read_some.html @@ -105,7 +105,7 @@ Start
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/serial_port/async_write_some.html b/doc/html/boost_asio/reference/serial_port/async_write_some.html index fe34f90e89..ed773665eb 100644 --- a/doc/html/boost_asio/reference/serial_port/async_write_some.html +++ b/doc/html/boost_asio/reference/serial_port/async_write_some.html @@ -105,7 +105,7 @@ Start
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/serial_port/cancel.html b/doc/html/boost_asio/reference/serial_port/cancel.html index 6b99edb36c..3fafadc51a 100644 --- a/doc/html/boost_asio/reference/serial_port/cancel.html +++ b/doc/html/boost_asio/reference/serial_port/cancel.html @@ -41,7 +41,7 @@ void
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/serial_port/cancel/overload1.html b/doc/html/boost_asio/reference/serial_port/cancel/overload1.html index 6604b3d3bf..c40fd39283 100644 --- a/doc/html/boost_asio/reference/serial_port/cancel/overload1.html +++ b/doc/html/boost_asio/reference/serial_port/cancel/overload1.html @@ -53,7 +53,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/serial_port/cancel/overload2.html b/doc/html/boost_asio/reference/serial_port/cancel/overload2.html index b57600caee..523ca745a3 100644 --- a/doc/html/boost_asio/reference/serial_port/cancel/overload2.html +++ b/doc/html/boost_asio/reference/serial_port/cancel/overload2.html @@ -54,7 +54,7 @@
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/serial_port/close.html b/doc/html/boost_asio/reference/serial_port/close.html index 88b5763578..9500d6e25f 100644 --- a/doc/html/boost_asio/reference/serial_port/close.html +++ b/doc/html/boost_asio/reference/serial_port/close.html @@ -41,7 +41,7 @@ void
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/serial_port/close/overload1.html b/doc/html/boost_asio/reference/serial_port/close/overload1.html index 0d966317ba..4de4264198 100644 --- a/doc/html/boost_asio/reference/serial_port/close/overload1.html +++ b/doc/html/boost_asio/reference/serial_port/close/overload1.html @@ -53,7 +53,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/serial_port/close/overload2.html b/doc/html/boost_asio/reference/serial_port/close/overload2.html index a267cb8727..2eea2407a9 100644 --- a/doc/html/boost_asio/reference/serial_port/close/overload2.html +++ b/doc/html/boost_asio/reference/serial_port/close/overload2.html @@ -54,7 +54,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/serial_port/executor_type.html b/doc/html/boost_asio/reference/serial_port/executor_type.html index e6b1f4502e..d2f019d0fa 100644 --- a/doc/html/boost_asio/reference/serial_port/executor_type.html +++ b/doc/html/boost_asio/reference/serial_port/executor_type.html @@ -203,7 +203,7 @@ The
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/serial_port/get_executor.html b/doc/html/boost_asio/reference/serial_port/get_executor.html index 27bb0f2575..3289552487 100644 --- a/doc/html/boost_asio/reference/serial_port/get_executor.html +++ b/doc/html/boost_asio/reference/serial_port/get_executor.html @@ -36,7 +36,7 @@ Get
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/serial_port/get_io_context.html b/doc/html/boost_asio/reference/serial_port/get_io_context.html index 352208fc86..d428e14c70 100644 --- a/doc/html/boost_asio/reference/serial_port/get_io_context.html +++ b/doc/html/boost_asio/reference/serial_port/get_io_context.html @@ -51,7 +51,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/serial_port/get_io_service.html b/doc/html/boost_asio/reference/serial_port/get_io_service.html index a52cbf1691..ea558b7da9 100644 --- a/doc/html/boost_asio/reference/serial_port/get_io_service.html +++ b/doc/html/boost_asio/reference/serial_port/get_io_service.html @@ -51,7 +51,7 @@
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/serial_port/get_option.html b/doc/html/boost_asio/reference/serial_port/get_option.html index e1099b2f48..cdc4ff90f7 100644 --- a/doc/html/boost_asio/reference/serial_port/get_option.html +++ b/doc/html/boost_asio/reference/serial_port/get_option.html @@ -47,7 +47,7 @@ void
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/serial_port/get_option/overload1.html b/doc/html/boost_asio/reference/serial_port/get_option/overload1.html index ed1146cc29..81ef3173f2 100644 --- a/doc/html/boost_asio/reference/serial_port/get_option/overload1.html +++ b/doc/html/boost_asio/reference/serial_port/get_option/overload1.html @@ -68,7 +68,7 @@ void get_option(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/serial_port/get_option/overload2.html b/doc/html/boost_asio/reference/serial_port/get_option/overload2.html index 4b72720c39..97d7835adc 100644 --- a/doc/html/boost_asio/reference/serial_port/get_option/overload2.html +++ b/doc/html/boost_asio/reference/serial_port/get_option/overload2.html @@ -60,7 +60,7 @@ void get_option(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/serial_port/is_open.html b/doc/html/boost_asio/reference/serial_port/is_open.html index e6c42c56b2..ffe329e5d9 100644 --- a/doc/html/boost_asio/reference/serial_port/is_open.html +++ b/doc/html/boost_asio/reference/serial_port/is_open.html @@ -36,7 +36,7 @@ Determine whether
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/serial_port/lowest_layer.html b/doc/html/boost_asio/reference/serial_port/lowest_layer.html index 7ed12e6e90..a327922e38 100644 --- a/doc/html/boost_asio/reference/serial_port/lowest_layer.html +++ b/doc/html/boost_asio/reference/serial_port/lowest_layer.html @@ -43,7 +43,7 @@ Get
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/serial_port/lowest_layer/overload1.html b/doc/html/boost_asio/reference/serial_port/lowest_layer/overload1.html index 969bcb7276..e5fff452ca 100644 --- a/doc/html/boost_asio/reference/serial_port/lowest_layer/overload1.html +++ b/doc/html/boost_asio/reference/serial_port/lowest_layer/overload1.html @@ -49,7 +49,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/serial_port/lowest_layer/overload2.html b/doc/html/boost_asio/reference/serial_port/lowest_layer/overload2.html index df66680d8e..95471aac1f 100644 --- a/doc/html/boost_asio/reference/serial_port/lowest_layer/overload2.html +++ b/doc/html/boost_asio/reference/serial_port/lowest_layer/overload2.html @@ -49,7 +49,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/serial_port/lowest_layer_type.html b/doc/html/boost_asio/reference/serial_port/lowest_layer_type.html index 045236c8c4..fcdc43983f 100644 --- a/doc/html/boost_asio/reference/serial_port/lowest_layer_type.html +++ b/doc/html/boost_asio/reference/serial_port/lowest_layer_type.html @@ -401,7 +401,7 @@ A
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/serial_port/native_handle.html b/doc/html/boost_asio/reference/serial_port/native_handle.html index 83e870e7fe..3d7db5a0ec 100644 --- a/doc/html/boost_asio/reference/serial_port/native_handle.html +++ b/doc/html/boost_asio/reference/serial_port/native_handle.html @@ -41,7 +41,7 @@ Get
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/serial_port/native_handle_type.html b/doc/html/boost_asio/reference/serial_port/native_handle_type.html index 28af706fdf..ed8b5f082f 100644 --- a/doc/html/boost_asio/reference/serial_port/native_handle_type.html +++ b/doc/html/boost_asio/reference/serial_port/native_handle_type.html @@ -46,7 +46,7 @@ The
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/serial_port/open.html b/doc/html/boost_asio/reference/serial_port/open.html index ee4dd1465e..00b8818aa1 100644 --- a/doc/html/boost_asio/reference/serial_port/open.html +++ b/doc/html/boost_asio/reference/serial_port/open.html @@ -43,7 +43,7 @@ void
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/serial_port/open/overload1.html b/doc/html/boost_asio/reference/serial_port/open/overload1.html index b2d5385239..3a1402b161 100644 --- a/doc/html/boost_asio/reference/serial_port/open/overload1.html +++ b/doc/html/boost_asio/reference/serial_port/open/overload1.html @@ -65,7 +65,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/serial_port/open/overload2.html b/doc/html/boost_asio/reference/serial_port/open/overload2.html index 328377e551..724997f8eb 100644 --- a/doc/html/boost_asio/reference/serial_port/open/overload2.html +++ b/doc/html/boost_asio/reference/serial_port/open/overload2.html @@ -58,7 +58,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/serial_port/operator_eq_.html b/doc/html/boost_asio/reference/serial_port/operator_eq_.html index 6711ed4089..a3a88a2e36 100644 --- a/doc/html/boost_asio/reference/serial_port/operator_eq_.html +++ b/doc/html/boost_asio/reference/serial_port/operator_eq_.html @@ -63,7 +63,7 @@ Move-assign
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/serial_port/read_some.html b/doc/html/boost_asio/reference/serial_port/read_some.html index c818ac5e86..de93ad8002 100644 --- a/doc/html/boost_asio/reference/serial_port/read_some.html +++ b/doc/html/boost_asio/reference/serial_port/read_some.html @@ -47,7 +47,7 @@ std::size_t
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/serial_port/read_some/overload1.html b/doc/html/boost_asio/reference/serial_port/read_some/overload1.html index 7f556a19ae..28905ebb34 100644 --- a/doc/html/boost_asio/reference/serial_port/read_some/overload1.html +++ b/doc/html/boost_asio/reference/serial_port/read_some/overload1.html @@ -103,7 +103,7 @@ std::size_t read_some(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/serial_port/read_some/overload2.html b/doc/html/boost_asio/reference/serial_port/read_some/overload2.html index 6d9a647fdf..24ae5934c1 100644 --- a/doc/html/boost_asio/reference/serial_port/read_some/overload2.html +++ b/doc/html/boost_asio/reference/serial_port/read_some/overload2.html @@ -79,7 +79,7 @@ std::size_t read_some(
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/serial_port/send_break.html b/doc/html/boost_asio/reference/serial_port/send_break.html index 50982d432c..ff2a2dbd99 100644 --- a/doc/html/boost_asio/reference/serial_port/send_break.html +++ b/doc/html/boost_asio/reference/serial_port/send_break.html @@ -41,7 +41,7 @@ void
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/serial_port/send_break/overload1.html b/doc/html/boost_asio/reference/serial_port/send_break/overload1.html index 86ddbdcab9..f93281968e 100644 --- a/doc/html/boost_asio/reference/serial_port/send_break/overload1.html +++ b/doc/html/boost_asio/reference/serial_port/send_break/overload1.html @@ -52,7 +52,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/serial_port/send_break/overload2.html b/doc/html/boost_asio/reference/serial_port/send_break/overload2.html index 8753282b44..9776ffb520 100644 --- a/doc/html/boost_asio/reference/serial_port/send_break/overload2.html +++ b/doc/html/boost_asio/reference/serial_port/send_break/overload2.html @@ -53,7 +53,7 @@
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/serial_port/serial_port.html b/doc/html/boost_asio/reference/serial_port/serial_port.html index b3ee71732b..7101307c61 100644 --- a/doc/html/boost_asio/reference/serial_port/serial_port.html +++ b/doc/html/boost_asio/reference/serial_port/serial_port.html @@ -69,7 +69,7 @@ explicit
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/serial_port/serial_port/overload1.html b/doc/html/boost_asio/reference/serial_port/serial_port/overload1.html index 25cd7bd0ee..57aafe6061 100644 --- a/doc/html/boost_asio/reference/serial_port/serial_port/overload1.html +++ b/doc/html/boost_asio/reference/serial_port/serial_port/overload1.html @@ -55,7 +55,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/serial_port/serial_port/overload2.html b/doc/html/boost_asio/reference/serial_port/serial_port/overload2.html index 4abee403ff..fc7cf28124 100644 --- a/doc/html/boost_asio/reference/serial_port/serial_port/overload2.html +++ b/doc/html/boost_asio/reference/serial_port/serial_port/overload2.html @@ -60,7 +60,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/serial_port/serial_port/overload3.html b/doc/html/boost_asio/reference/serial_port/serial_port/overload3.html index 2152735b08..e6173d5a7b 100644 --- a/doc/html/boost_asio/reference/serial_port/serial_port/overload3.html +++ b/doc/html/boost_asio/reference/serial_port/serial_port/overload3.html @@ -60,7 +60,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/serial_port/serial_port/overload4.html b/doc/html/boost_asio/reference/serial_port/serial_port/overload4.html index cb5dd2b1fc..bb23058d73 100644 --- a/doc/html/boost_asio/reference/serial_port/serial_port/overload4.html +++ b/doc/html/boost_asio/reference/serial_port/serial_port/overload4.html @@ -74,7 +74,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/serial_port/serial_port/overload5.html b/doc/html/boost_asio/reference/serial_port/serial_port/overload5.html index 3b6e0464bc..a3a3b01174 100644 --- a/doc/html/boost_asio/reference/serial_port/serial_port/overload5.html +++ b/doc/html/boost_asio/reference/serial_port/serial_port/overload5.html @@ -62,7 +62,7 @@
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/serial_port/set_option.html b/doc/html/boost_asio/reference/serial_port/set_option.html index 04556d6602..07c72e91ea 100644 --- a/doc/html/boost_asio/reference/serial_port/set_option.html +++ b/doc/html/boost_asio/reference/serial_port/set_option.html @@ -47,7 +47,7 @@ void
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/serial_port/set_option/overload1.html b/doc/html/boost_asio/reference/serial_port/set_option/overload1.html index 9b08ee592d..4ba909f230 100644 --- a/doc/html/boost_asio/reference/serial_port/set_option/overload1.html +++ b/doc/html/boost_asio/reference/serial_port/set_option/overload1.html @@ -67,7 +67,7 @@ void set_option(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/serial_port/set_option/overload2.html b/doc/html/boost_asio/reference/serial_port/set_option/overload2.html index 49847f316d..6814684ca5 100644 --- a/doc/html/boost_asio/reference/serial_port/set_option/overload2.html +++ b/doc/html/boost_asio/reference/serial_port/set_option/overload2.html @@ -59,7 +59,7 @@ void set_option(
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/serial_port/write_some.html b/doc/html/boost_asio/reference/serial_port/write_some.html index 53166680fd..81f0180c64 100644 --- a/doc/html/boost_asio/reference/serial_port/write_some.html +++ b/doc/html/boost_asio/reference/serial_port/write_some.html @@ -47,7 +47,7 @@ std::size_t
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/serial_port/write_some/overload1.html b/doc/html/boost_asio/reference/serial_port/write_some/overload1.html index e8967f70da..9909bfb415 100644 --- a/doc/html/boost_asio/reference/serial_port/write_some/overload1.html +++ b/doc/html/boost_asio/reference/serial_port/write_some/overload1.html @@ -103,7 +103,7 @@ std::size_t write_some(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/serial_port/write_some/overload2.html b/doc/html/boost_asio/reference/serial_port/write_some/overload2.html index 812479a213..e5261dc6fa 100644 --- a/doc/html/boost_asio/reference/serial_port/write_some/overload2.html +++ b/doc/html/boost_asio/reference/serial_port/write_some/overload2.html @@ -79,7 +79,7 @@ std::size_t write_some(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/serial_port_base.html b/doc/html/boost_asio/reference/serial_port_base.html index 9cd8bea429..aebb51c43e 100644 --- a/doc/html/boost_asio/reference/serial_port_base.html +++ b/doc/html/boost_asio/reference/serial_port_base.html @@ -165,7 +165,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/serial_port_base/_serial_port_base.html b/doc/html/boost_asio/reference/serial_port_base/_serial_port_base.html index 067681b8e4..fdcce2a926 100644 --- a/doc/html/boost_asio/reference/serial_port_base/_serial_port_base.html +++ b/doc/html/boost_asio/reference/serial_port_base/_serial_port_base.html @@ -36,7 +36,7 @@ Protected
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/serial_port_base__baud_rate.html b/doc/html/boost_asio/reference/serial_port_base__baud_rate.html index dfd73355ef..3e835f6cca 100644 --- a/doc/html/boost_asio/reference/serial_port_base__baud_rate.html +++ b/doc/html/boost_asio/reference/serial_port_base__baud_rate.html @@ -108,7 +108,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/serial_port_base__baud_rate/baud_rate.html b/doc/html/boost_asio/reference/serial_port_base__baud_rate/baud_rate.html index 941ea2e84e..6094483a1b 100644 --- a/doc/html/boost_asio/reference/serial_port_base__baud_rate/baud_rate.html +++ b/doc/html/boost_asio/reference/serial_port_base__baud_rate/baud_rate.html @@ -35,7 +35,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/serial_port_base__baud_rate/load.html b/doc/html/boost_asio/reference/serial_port_base__baud_rate/load.html index 9f2647e4ad..181eba370e 100644 --- a/doc/html/boost_asio/reference/serial_port_base__baud_rate/load.html +++ b/doc/html/boost_asio/reference/serial_port_base__baud_rate/load.html @@ -36,7 +36,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/serial_port_base__baud_rate/store.html b/doc/html/boost_asio/reference/serial_port_base__baud_rate/store.html index c56c821fc5..3408e11180 100644 --- a/doc/html/boost_asio/reference/serial_port_base__baud_rate/store.html +++ b/doc/html/boost_asio/reference/serial_port_base__baud_rate/store.html @@ -36,7 +36,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/serial_port_base__baud_rate/value.html b/doc/html/boost_asio/reference/serial_port_base__baud_rate/value.html index aaae822095..2acee62db7 100644 --- a/doc/html/boost_asio/reference/serial_port_base__baud_rate/value.html +++ b/doc/html/boost_asio/reference/serial_port_base__baud_rate/value.html @@ -34,7 +34,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/serial_port_base__character_size.html b/doc/html/boost_asio/reference/serial_port_base__character_size.html index fea5eac037..3bbb242823 100644 --- a/doc/html/boost_asio/reference/serial_port_base__character_size.html +++ b/doc/html/boost_asio/reference/serial_port_base__character_size.html @@ -108,7 +108,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/serial_port_base__character_size/character_size.html b/doc/html/boost_asio/reference/serial_port_base__character_size/character_size.html index 03c8ac285d..0ce225dff2 100644 --- a/doc/html/boost_asio/reference/serial_port_base__character_size/character_size.html +++ b/doc/html/boost_asio/reference/serial_port_base__character_size/character_size.html @@ -35,7 +35,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/serial_port_base__character_size/load.html b/doc/html/boost_asio/reference/serial_port_base__character_size/load.html index 7bfa0b21e1..aac14820a6 100644 --- a/doc/html/boost_asio/reference/serial_port_base__character_size/load.html +++ b/doc/html/boost_asio/reference/serial_port_base__character_size/load.html @@ -36,7 +36,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/serial_port_base__character_size/store.html b/doc/html/boost_asio/reference/serial_port_base__character_size/store.html index eda66f628c..31b9b2e6af 100644 --- a/doc/html/boost_asio/reference/serial_port_base__character_size/store.html +++ b/doc/html/boost_asio/reference/serial_port_base__character_size/store.html @@ -36,7 +36,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/serial_port_base__character_size/value.html b/doc/html/boost_asio/reference/serial_port_base__character_size/value.html index e460fce1a9..72008a2a57 100644 --- a/doc/html/boost_asio/reference/serial_port_base__character_size/value.html +++ b/doc/html/boost_asio/reference/serial_port_base__character_size/value.html @@ -34,7 +34,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/serial_port_base__flow_control.html b/doc/html/boost_asio/reference/serial_port_base__flow_control.html index b00f4c9933..0d45124639 100644 --- a/doc/html/boost_asio/reference/serial_port_base__flow_control.html +++ b/doc/html/boost_asio/reference/serial_port_base__flow_control.html @@ -139,7 +139,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/serial_port_base__flow_control/flow_control.html b/doc/html/boost_asio/reference/serial_port_base__flow_control/flow_control.html index 08d718156d..206851ac63 100644 --- a/doc/html/boost_asio/reference/serial_port_base__flow_control/flow_control.html +++ b/doc/html/boost_asio/reference/serial_port_base__flow_control/flow_control.html @@ -35,7 +35,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/serial_port_base__flow_control/load.html b/doc/html/boost_asio/reference/serial_port_base__flow_control/load.html index 9cc213b6c6..9ff8bc6fdd 100644 --- a/doc/html/boost_asio/reference/serial_port_base__flow_control/load.html +++ b/doc/html/boost_asio/reference/serial_port_base__flow_control/load.html @@ -36,7 +36,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/serial_port_base__flow_control/store.html b/doc/html/boost_asio/reference/serial_port_base__flow_control/store.html index ded2e9cfb1..a9ab07ec87 100644 --- a/doc/html/boost_asio/reference/serial_port_base__flow_control/store.html +++ b/doc/html/boost_asio/reference/serial_port_base__flow_control/store.html @@ -36,7 +36,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/serial_port_base__flow_control/type.html b/doc/html/boost_asio/reference/serial_port_base__flow_control/type.html index 121a41b66f..b2dab45c27 100644 --- a/doc/html/boost_asio/reference/serial_port_base__flow_control/type.html +++ b/doc/html/boost_asio/reference/serial_port_base__flow_control/type.html @@ -54,7 +54,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/serial_port_base__flow_control/value.html b/doc/html/boost_asio/reference/serial_port_base__flow_control/value.html index e4f70584b9..603220dd24 100644 --- a/doc/html/boost_asio/reference/serial_port_base__flow_control/value.html +++ b/doc/html/boost_asio/reference/serial_port_base__flow_control/value.html @@ -34,7 +34,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/serial_port_base__parity.html b/doc/html/boost_asio/reference/serial_port_base__parity.html index 4764ac6170..ce958b4864 100644 --- a/doc/html/boost_asio/reference/serial_port_base__parity.html +++ b/doc/html/boost_asio/reference/serial_port_base__parity.html @@ -139,7 +139,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/serial_port_base__parity/load.html b/doc/html/boost_asio/reference/serial_port_base__parity/load.html index 6e5a1b858d..9bce76b13e 100644 --- a/doc/html/boost_asio/reference/serial_port_base__parity/load.html +++ b/doc/html/boost_asio/reference/serial_port_base__parity/load.html @@ -36,7 +36,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/serial_port_base__parity/parity.html b/doc/html/boost_asio/reference/serial_port_base__parity/parity.html index b0262178ef..95543ff2f3 100644 --- a/doc/html/boost_asio/reference/serial_port_base__parity/parity.html +++ b/doc/html/boost_asio/reference/serial_port_base__parity/parity.html @@ -35,7 +35,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/serial_port_base__parity/store.html b/doc/html/boost_asio/reference/serial_port_base__parity/store.html index e7d143afdd..eb2a29d287 100644 --- a/doc/html/boost_asio/reference/serial_port_base__parity/store.html +++ b/doc/html/boost_asio/reference/serial_port_base__parity/store.html @@ -36,7 +36,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/serial_port_base__parity/type.html b/doc/html/boost_asio/reference/serial_port_base__parity/type.html index 389ed2554f..888b3c55a2 100644 --- a/doc/html/boost_asio/reference/serial_port_base__parity/type.html +++ b/doc/html/boost_asio/reference/serial_port_base__parity/type.html @@ -54,7 +54,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/serial_port_base__parity/value.html b/doc/html/boost_asio/reference/serial_port_base__parity/value.html index 76252043c2..a0b42365f7 100644 --- a/doc/html/boost_asio/reference/serial_port_base__parity/value.html +++ b/doc/html/boost_asio/reference/serial_port_base__parity/value.html @@ -34,7 +34,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/serial_port_base__stop_bits.html b/doc/html/boost_asio/reference/serial_port_base__stop_bits.html index 026ff0c045..7e64a6504e 100644 --- a/doc/html/boost_asio/reference/serial_port_base__stop_bits.html +++ b/doc/html/boost_asio/reference/serial_port_base__stop_bits.html @@ -139,7 +139,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/serial_port_base__stop_bits/load.html b/doc/html/boost_asio/reference/serial_port_base__stop_bits/load.html index c66bf9310c..482385c93a 100644 --- a/doc/html/boost_asio/reference/serial_port_base__stop_bits/load.html +++ b/doc/html/boost_asio/reference/serial_port_base__stop_bits/load.html @@ -36,7 +36,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/serial_port_base__stop_bits/stop_bits.html b/doc/html/boost_asio/reference/serial_port_base__stop_bits/stop_bits.html index 814ff79a0b..643ad6a7de 100644 --- a/doc/html/boost_asio/reference/serial_port_base__stop_bits/stop_bits.html +++ b/doc/html/boost_asio/reference/serial_port_base__stop_bits/stop_bits.html @@ -35,7 +35,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/serial_port_base__stop_bits/store.html b/doc/html/boost_asio/reference/serial_port_base__stop_bits/store.html index 4c1659b485..d592368181 100644 --- a/doc/html/boost_asio/reference/serial_port_base__stop_bits/store.html +++ b/doc/html/boost_asio/reference/serial_port_base__stop_bits/store.html @@ -36,7 +36,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/serial_port_base__stop_bits/type.html b/doc/html/boost_asio/reference/serial_port_base__stop_bits/type.html index 77e195fbbc..07c1802d87 100644 --- a/doc/html/boost_asio/reference/serial_port_base__stop_bits/type.html +++ b/doc/html/boost_asio/reference/serial_port_base__stop_bits/type.html @@ -54,7 +54,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/serial_port_base__stop_bits/value.html b/doc/html/boost_asio/reference/serial_port_base__stop_bits/value.html index 313964f94f..94b3db6ee5 100644 --- a/doc/html/boost_asio/reference/serial_port_base__stop_bits/value.html +++ b/doc/html/boost_asio/reference/serial_port_base__stop_bits/value.html @@ -34,7 +34,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/service_already_exists.html b/doc/html/boost_asio/reference/service_already_exists.html index 04d51b6368..5fdaf52659 100644 --- a/doc/html/boost_asio/reference/service_already_exists.html +++ b/doc/html/boost_asio/reference/service_already_exists.html @@ -76,7 +76,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/service_already_exists/service_already_exists.html b/doc/html/boost_asio/reference/service_already_exists/service_already_exists.html index bbfd43f8a5..5176f20c5b 100644 --- a/doc/html/boost_asio/reference/service_already_exists/service_already_exists.html +++ b/doc/html/boost_asio/reference/service_already_exists/service_already_exists.html @@ -34,7 +34,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/signal_set.html b/doc/html/boost_asio/reference/signal_set.html index 194a1acef5..f2508548d4 100644 --- a/doc/html/boost_asio/reference/signal_set.html +++ b/doc/html/boost_asio/reference/signal_set.html @@ -319,7 +319,7 @@ signals.async_wait(handler);
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/signal_set/_signal_set.html b/doc/html/boost_asio/reference/signal_set/_signal_set.html index cfa7f6d732..1295b9d97b 100644 --- a/doc/html/boost_asio/reference/signal_set/_signal_set.html +++ b/doc/html/boost_asio/reference/signal_set/_signal_set.html @@ -40,7 +40,7 @@ Destroys
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/signal_set/add.html b/doc/html/boost_asio/reference/signal_set/add.html index d468adec36..45338b741c 100644 --- a/doc/html/boost_asio/reference/signal_set/add.html +++ b/doc/html/boost_asio/reference/signal_set/add.html @@ -42,7 +42,7 @@ void
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/signal_set/add/overload1.html b/doc/html/boost_asio/reference/signal_set/add/overload1.html index 45f83605ec..6f08f9fc17 100644 --- a/doc/html/boost_asio/reference/signal_set/add/overload1.html +++ b/doc/html/boost_asio/reference/signal_set/add/overload1.html @@ -66,7 +66,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/signal_set/add/overload2.html b/doc/html/boost_asio/reference/signal_set/add/overload2.html index 44eb46133e..06e17ef81e 100644 --- a/doc/html/boost_asio/reference/signal_set/add/overload2.html +++ b/doc/html/boost_asio/reference/signal_set/add/overload2.html @@ -58,7 +58,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/signal_set/async_wait.html b/doc/html/boost_asio/reference/signal_set/async_wait.html index 49c5c4797c..e4794758b6 100644 --- a/doc/html/boost_asio/reference/signal_set/async_wait.html +++ b/doc/html/boost_asio/reference/signal_set/async_wait.html @@ -84,7 +84,7 @@ Start an
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/signal_set/cancel.html b/doc/html/boost_asio/reference/signal_set/cancel.html index ce66e44210..aca9495c62 100644 --- a/doc/html/boost_asio/reference/signal_set/cancel.html +++ b/doc/html/boost_asio/reference/signal_set/cancel.html @@ -41,7 +41,7 @@ void
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/signal_set/cancel/overload1.html b/doc/html/boost_asio/reference/signal_set/cancel/overload1.html index a774353d43..4e2012df20 100644 --- a/doc/html/boost_asio/reference/signal_set/cancel/overload1.html +++ b/doc/html/boost_asio/reference/signal_set/cancel/overload1.html @@ -77,7 +77,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/signal_set/cancel/overload2.html b/doc/html/boost_asio/reference/signal_set/cancel/overload2.html index 2d2920d9e2..0c79ab0b32 100644 --- a/doc/html/boost_asio/reference/signal_set/cancel/overload2.html +++ b/doc/html/boost_asio/reference/signal_set/cancel/overload2.html @@ -78,7 +78,7 @@
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/signal_set/clear.html b/doc/html/boost_asio/reference/signal_set/clear.html index ffb08bef48..b8dfede7d7 100644 --- a/doc/html/boost_asio/reference/signal_set/clear.html +++ b/doc/html/boost_asio/reference/signal_set/clear.html @@ -41,7 +41,7 @@ void
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/signal_set/clear/overload1.html b/doc/html/boost_asio/reference/signal_set/clear/overload1.html index fae9d15025..4c71758702 100644 --- a/doc/html/boost_asio/reference/signal_set/clear/overload1.html +++ b/doc/html/boost_asio/reference/signal_set/clear/overload1.html @@ -59,7 +59,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/signal_set/clear/overload2.html b/doc/html/boost_asio/reference/signal_set/clear/overload2.html index 2866a29de4..c019e969c1 100644 --- a/doc/html/boost_asio/reference/signal_set/clear/overload2.html +++ b/doc/html/boost_asio/reference/signal_set/clear/overload2.html @@ -60,7 +60,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/signal_set/executor_type.html b/doc/html/boost_asio/reference/signal_set/executor_type.html index 27bac9b680..0af26b137c 100644 --- a/doc/html/boost_asio/reference/signal_set/executor_type.html +++ b/doc/html/boost_asio/reference/signal_set/executor_type.html @@ -203,7 +203,7 @@ The
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/signal_set/get_executor.html b/doc/html/boost_asio/reference/signal_set/get_executor.html index f9ace8cc80..469d713405 100644 --- a/doc/html/boost_asio/reference/signal_set/get_executor.html +++ b/doc/html/boost_asio/reference/signal_set/get_executor.html @@ -36,7 +36,7 @@ Get the
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/signal_set/get_io_context.html b/doc/html/boost_asio/reference/signal_set/get_io_context.html index d98ab31880..ffc6cefa11 100644 --- a/doc/html/boost_asio/reference/signal_set/get_io_context.html +++ b/doc/html/boost_asio/reference/signal_set/get_io_context.html @@ -51,7 +51,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/signal_set/get_io_service.html b/doc/html/boost_asio/reference/signal_set/get_io_service.html index 69cbc41179..89fe69becf 100644 --- a/doc/html/boost_asio/reference/signal_set/get_io_service.html +++ b/doc/html/boost_asio/reference/signal_set/get_io_service.html @@ -51,7 +51,7 @@
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/signal_set/remove.html b/doc/html/boost_asio/reference/signal_set/remove.html index f460edde28..3ade33572b 100644 --- a/doc/html/boost_asio/reference/signal_set/remove.html +++ b/doc/html/boost_asio/reference/signal_set/remove.html @@ -43,7 +43,7 @@ void
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/signal_set/remove/overload1.html b/doc/html/boost_asio/reference/signal_set/remove/overload1.html index 3c3f1479ef..2776418cd2 100644 --- a/doc/html/boost_asio/reference/signal_set/remove/overload1.html +++ b/doc/html/boost_asio/reference/signal_set/remove/overload1.html @@ -74,7 +74,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/signal_set/remove/overload2.html b/doc/html/boost_asio/reference/signal_set/remove/overload2.html index 11759d49e3..aa4c9cd8f3 100644 --- a/doc/html/boost_asio/reference/signal_set/remove/overload2.html +++ b/doc/html/boost_asio/reference/signal_set/remove/overload2.html @@ -66,7 +66,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/signal_set/signal_set.html b/doc/html/boost_asio/reference/signal_set/signal_set.html index 51c84cfd17..1343abb45d 100644 --- a/doc/html/boost_asio/reference/signal_set/signal_set.html +++ b/doc/html/boost_asio/reference/signal_set/signal_set.html @@ -65,7 +65,7 @@ Construct
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/signal_set/signal_set/overload1.html b/doc/html/boost_asio/reference/signal_set/signal_set/overload1.html index 397872a6d7..56e9d027e8 100644 --- a/doc/html/boost_asio/reference/signal_set/signal_set/overload1.html +++ b/doc/html/boost_asio/reference/signal_set/signal_set/overload1.html @@ -54,7 +54,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/signal_set/signal_set/overload2.html b/doc/html/boost_asio/reference/signal_set/signal_set/overload2.html index 7b9a3ee491..b4859c2077 100644 --- a/doc/html/boost_asio/reference/signal_set/signal_set/overload2.html +++ b/doc/html/boost_asio/reference/signal_set/signal_set/overload2.html @@ -69,7 +69,7 @@ signals.add(signal_number_1);
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/signal_set/signal_set/overload3.html b/doc/html/boost_asio/reference/signal_set/signal_set/overload3.html index 9db680783d..535c83103b 100644 --- a/doc/html/boost_asio/reference/signal_set/signal_set/overload3.html +++ b/doc/html/boost_asio/reference/signal_set/signal_set/overload3.html @@ -75,7 +75,7 @@ signals.add(signal_number_2);
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/signal_set/signal_set/overload4.html b/doc/html/boost_asio/reference/signal_set/signal_set/overload4.html index efa6bb557b..7633ff3ce6 100644 --- a/doc/html/boost_asio/reference/signal_set/signal_set/overload4.html +++ b/doc/html/boost_asio/reference/signal_set/signal_set/overload4.html @@ -81,7 +81,7 @@ signals.add(signal_number_3);
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/socket_base.html b/doc/html/boost_asio/reference/socket_base.html index 46335edc44..ba4aa59c41 100644 --- a/doc/html/boost_asio/reference/socket_base.html +++ b/doc/html/boost_asio/reference/socket_base.html @@ -400,7 +400,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/socket_base/_socket_base.html b/doc/html/boost_asio/reference/socket_base/_socket_base.html index 31194eea47..f1bc9813d0 100644 --- a/doc/html/boost_asio/reference/socket_base/_socket_base.html +++ b/doc/html/boost_asio/reference/socket_base/_socket_base.html @@ -36,7 +36,7 @@ Protected
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/socket_base/broadcast.html b/doc/html/boost_asio/reference/socket_base/broadcast.html index ddca9dd2a3..c1d5536b10 100644 --- a/doc/html/boost_asio/reference/socket_base/broadcast.html +++ b/doc/html/boost_asio/reference/socket_base/broadcast.html @@ -70,7 +70,7 @@ bool is_set = option.value();
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/socket_base/bytes_readable.html b/doc/html/boost_asio/reference/socket_base/bytes_readable.html index 71ed142849..dd23273c6e 100644 --- a/doc/html/boost_asio/reference/socket_base/bytes_readable.html +++ b/doc/html/boost_asio/reference/socket_base/bytes_readable.html @@ -59,7 +59,7 @@ std::size_t bytes_readable = command.get();
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/socket_base/debug.html b/doc/html/boost_asio/reference/socket_base/debug.html index b3a05d94ce..d63ad56528 100644 --- a/doc/html/boost_asio/reference/socket_base/debug.html +++ b/doc/html/boost_asio/reference/socket_base/debug.html @@ -70,7 +70,7 @@ bool is_set = option.value();
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/socket_base/do_not_route.html b/doc/html/boost_asio/reference/socket_base/do_not_route.html index 2e9c7923d2..5b7fbf713b 100644 --- a/doc/html/boost_asio/reference/socket_base/do_not_route.html +++ b/doc/html/boost_asio/reference/socket_base/do_not_route.html @@ -70,7 +70,7 @@ bool is_set = option.value();
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/socket_base/enable_connection_aborted.html b/doc/html/boost_asio/reference/socket_base/enable_connection_aborted.html index 31ff809ba4..035e5b9e59 100644 --- a/doc/html/boost_asio/reference/socket_base/enable_connection_aborted.html +++ b/doc/html/boost_asio/reference/socket_base/enable_connection_aborted.html @@ -72,7 +72,7 @@ bool is_set = option.value();
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/socket_base/keep_alive.html b/doc/html/boost_asio/reference/socket_base/keep_alive.html index ecad39f300..fc9a70c3fe 100644 --- a/doc/html/boost_asio/reference/socket_base/keep_alive.html +++ b/doc/html/boost_asio/reference/socket_base/keep_alive.html @@ -70,7 +70,7 @@ bool is_set = option.value();
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/socket_base/linger.html b/doc/html/boost_asio/reference/socket_base/linger.html index f024b3bf6b..c688fe601e 100644 --- a/doc/html/boost_asio/reference/socket_base/linger.html +++ b/doc/html/boost_asio/reference/socket_base/linger.html @@ -71,7 +71,7 @@ unsigned short timeout = option.timeout();
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/socket_base/max_connections.html b/doc/html/boost_asio/reference/socket_base/max_connections.html index 04fc793b00..ae3937d015 100644 --- a/doc/html/boost_asio/reference/socket_base/max_connections.html +++ b/doc/html/boost_asio/reference/socket_base/max_connections.html @@ -37,7 +37,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/socket_base/max_listen_connections.html b/doc/html/boost_asio/reference/socket_base/max_listen_connections.html index 07b1ac1daa..a75b048059 100644 --- a/doc/html/boost_asio/reference/socket_base/max_listen_connections.html +++ b/doc/html/boost_asio/reference/socket_base/max_listen_connections.html @@ -36,7 +36,7 @@ The
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/socket_base/message_do_not_route.html b/doc/html/boost_asio/reference/socket_base/message_do_not_route.html index e92e580176..cc9674ec7d 100644 --- a/doc/html/boost_asio/reference/socket_base/message_do_not_route.html +++ b/doc/html/boost_asio/reference/socket_base/message_do_not_route.html @@ -36,7 +36,7 @@ Specify
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/socket_base/message_end_of_record.html b/doc/html/boost_asio/reference/socket_base/message_end_of_record.html index 87a9cbbd5d..a69fb969ae 100644 --- a/doc/html/boost_asio/reference/socket_base/message_end_of_record.html +++ b/doc/html/boost_asio/reference/socket_base/message_end_of_record.html @@ -36,7 +36,7 @@ Specifies
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/socket_base/message_flags.html b/doc/html/boost_asio/reference/socket_base/message_flags.html index 35206ae1e4..b9fceefea0 100644 --- a/doc/html/boost_asio/reference/socket_base/message_flags.html +++ b/doc/html/boost_asio/reference/socket_base/message_flags.html @@ -46,7 +46,7 @@ Bitmask
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/socket_base/message_out_of_band.html b/doc/html/boost_asio/reference/socket_base/message_out_of_band.html index 3ebfa27ba4..73518b7884 100644 --- a/doc/html/boost_asio/reference/socket_base/message_out_of_band.html +++ b/doc/html/boost_asio/reference/socket_base/message_out_of_band.html @@ -36,7 +36,7 @@ Process
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/socket_base/message_peek.html b/doc/html/boost_asio/reference/socket_base/message_peek.html index 0444ab5c51..f1134fd827 100644 --- a/doc/html/boost_asio/reference/socket_base/message_peek.html +++ b/doc/html/boost_asio/reference/socket_base/message_peek.html @@ -36,7 +36,7 @@ Peek
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/socket_base/out_of_band_inline.html b/doc/html/boost_asio/reference/socket_base/out_of_band_inline.html index 31ce69ec36..983b4ecc8e 100644 --- a/doc/html/boost_asio/reference/socket_base/out_of_band_inline.html +++ b/doc/html/boost_asio/reference/socket_base/out_of_band_inline.html @@ -70,7 +70,7 @@ bool value = option.value();
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/socket_base/receive_buffer_size.html b/doc/html/boost_asio/reference/socket_base/receive_buffer_size.html index a683c1af6d..211c7d0f67 100644 --- a/doc/html/boost_asio/reference/socket_base/receive_buffer_size.html +++ b/doc/html/boost_asio/reference/socket_base/receive_buffer_size.html @@ -70,7 +70,7 @@ int size = option.value();
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/socket_base/receive_low_watermark.html b/doc/html/boost_asio/reference/socket_base/receive_low_watermark.html index 6f7ffe2910..a48b011292 100644 --- a/doc/html/boost_asio/reference/socket_base/receive_low_watermark.html +++ b/doc/html/boost_asio/reference/socket_base/receive_low_watermark.html @@ -70,7 +70,7 @@ int size = option.value();
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/socket_base/reuse_address.html b/doc/html/boost_asio/reference/socket_base/reuse_address.html index e1b9026ead..f28a9d07db 100644 --- a/doc/html/boost_asio/reference/socket_base/reuse_address.html +++ b/doc/html/boost_asio/reference/socket_base/reuse_address.html @@ -71,7 +71,7 @@ bool is_set = option.value();
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/socket_base/send_buffer_size.html b/doc/html/boost_asio/reference/socket_base/send_buffer_size.html index 48aee0c52f..1a2d7ab292 100644 --- a/doc/html/boost_asio/reference/socket_base/send_buffer_size.html +++ b/doc/html/boost_asio/reference/socket_base/send_buffer_size.html @@ -70,7 +70,7 @@ int size = option.value();
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/socket_base/send_low_watermark.html b/doc/html/boost_asio/reference/socket_base/send_low_watermark.html index a0999cec71..e97d3929ad 100644 --- a/doc/html/boost_asio/reference/socket_base/send_low_watermark.html +++ b/doc/html/boost_asio/reference/socket_base/send_low_watermark.html @@ -70,7 +70,7 @@ int size = option.value();
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/socket_base/shutdown_type.html b/doc/html/boost_asio/reference/socket_base/shutdown_type.html index f1f178e937..7973a51d7f 100644 --- a/doc/html/boost_asio/reference/socket_base/shutdown_type.html +++ b/doc/html/boost_asio/reference/socket_base/shutdown_type.html @@ -62,7 +62,7 @@ Different
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/socket_base/wait_type.html b/doc/html/boost_asio/reference/socket_base/wait_type.html index d416a8345f..b9002429b4 100644 --- a/doc/html/boost_asio/reference/socket_base/wait_type.html +++ b/doc/html/boost_asio/reference/socket_base/wait_type.html @@ -64,7 +64,7 @@ Wait types.
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/spawn.html b/doc/html/boost_asio/reference/spawn.html index 6f422effb4..8195d677cd 100644 --- a/doc/html/boost_asio/reference/spawn.html +++ b/doc/html/boost_asio/reference/spawn.html @@ -136,7 +136,7 @@ void do_echo(boost::asio::yield_context yield)
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/spawn/overload1.html b/doc/html/boost_asio/reference/spawn/overload1.html index 0d32eb2009..8db441b1b8 100644 --- a/doc/html/boost_asio/reference/spawn/overload1.html +++ b/doc/html/boost_asio/reference/spawn/overload1.html @@ -65,7 +65,7 @@ void spawn(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/spawn/overload2.html b/doc/html/boost_asio/reference/spawn/overload2.html index 926ea4f76b..d5d18700d1 100644 --- a/doc/html/boost_asio/reference/spawn/overload2.html +++ b/doc/html/boost_asio/reference/spawn/overload2.html @@ -80,7 +80,7 @@ void spawn(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/spawn/overload3.html b/doc/html/boost_asio/reference/spawn/overload3.html index 13b5729358..93a0ceeccd 100644 --- a/doc/html/boost_asio/reference/spawn/overload3.html +++ b/doc/html/boost_asio/reference/spawn/overload3.html @@ -75,7 +75,7 @@ void spawn(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/spawn/overload4.html b/doc/html/boost_asio/reference/spawn/overload4.html index 67bdb5ca60..ed69827386 100644 --- a/doc/html/boost_asio/reference/spawn/overload4.html +++ b/doc/html/boost_asio/reference/spawn/overload4.html @@ -73,7 +73,7 @@ void spawn(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/spawn/overload5.html b/doc/html/boost_asio/reference/spawn/overload5.html index 25816f0be6..35d50bc5e9 100644 --- a/doc/html/boost_asio/reference/spawn/overload5.html +++ b/doc/html/boost_asio/reference/spawn/overload5.html @@ -71,7 +71,7 @@ void spawn(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/spawn/overload6.html b/doc/html/boost_asio/reference/spawn/overload6.html index e545e356a1..2e108ad1f4 100644 --- a/doc/html/boost_asio/reference/spawn/overload6.html +++ b/doc/html/boost_asio/reference/spawn/overload6.html @@ -72,7 +72,7 @@ void spawn(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/spawn/overload7.html b/doc/html/boost_asio/reference/spawn/overload7.html index e7ab0e2466..feba5f09aa 100644 --- a/doc/html/boost_asio/reference/spawn/overload7.html +++ b/doc/html/boost_asio/reference/spawn/overload7.html @@ -74,7 +74,7 @@ void spawn(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ssl__context.html b/doc/html/boost_asio/reference/ssl__context.html index 029f5cf2a8..78d24d87b6 100644 --- a/doc/html/boost_asio/reference/ssl__context.html +++ b/doc/html/boost_asio/reference/ssl__context.html @@ -567,7 +567,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ssl__context/_context.html b/doc/html/boost_asio/reference/ssl__context/_context.html index c040eae058..1bef5e7778 100644 --- a/doc/html/boost_asio/reference/ssl__context/_context.html +++ b/doc/html/boost_asio/reference/ssl__context/_context.html @@ -35,7 +35,7 @@ Destructor.
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ssl__context/add_certificate_authority.html b/doc/html/boost_asio/reference/ssl__context/add_certificate_authority.html index c7ace4f9ed..f170d9036a 100644 --- a/doc/html/boost_asio/reference/ssl__context/add_certificate_authority.html +++ b/doc/html/boost_asio/reference/ssl__context/add_certificate_authority.html @@ -43,7 +43,7 @@ void
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ssl__context/add_certificate_authority/overload1.html b/doc/html/boost_asio/reference/ssl__context/add_certificate_authority/overload1.html index 3f8a666f9f..cc7cadcbd8 100644 --- a/doc/html/boost_asio/reference/ssl__context/add_certificate_authority/overload1.html +++ b/doc/html/boost_asio/reference/ssl__context/add_certificate_authority/overload1.html @@ -74,7 +74,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ssl__context/add_certificate_authority/overload2.html b/doc/html/boost_asio/reference/ssl__context/add_certificate_authority/overload2.html index 9da80b7b6d..663f72c6a1 100644 --- a/doc/html/boost_asio/reference/ssl__context/add_certificate_authority/overload2.html +++ b/doc/html/boost_asio/reference/ssl__context/add_certificate_authority/overload2.html @@ -66,7 +66,7 @@
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ssl__context/add_verify_path.html b/doc/html/boost_asio/reference/ssl__context/add_verify_path.html index 047b231218..e65d3e6724 100644 --- a/doc/html/boost_asio/reference/ssl__context/add_verify_path.html +++ b/doc/html/boost_asio/reference/ssl__context/add_verify_path.html @@ -44,7 +44,7 @@ void
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ssl__context/add_verify_path/overload1.html b/doc/html/boost_asio/reference/ssl__context/add_verify_path/overload1.html index 893a371ea3..cb7aa88528 100644 --- a/doc/html/boost_asio/reference/ssl__context/add_verify_path/overload1.html +++ b/doc/html/boost_asio/reference/ssl__context/add_verify_path/overload1.html @@ -76,7 +76,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ssl__context/add_verify_path/overload2.html b/doc/html/boost_asio/reference/ssl__context/add_verify_path/overload2.html index 0126493760..9a23672f11 100644 --- a/doc/html/boost_asio/reference/ssl__context/add_verify_path/overload2.html +++ b/doc/html/boost_asio/reference/ssl__context/add_verify_path/overload2.html @@ -68,7 +68,7 @@
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ssl__context/clear_options.html b/doc/html/boost_asio/reference/ssl__context/clear_options.html index 3702ebec85..429854b317 100644 --- a/doc/html/boost_asio/reference/ssl__context/clear_options.html +++ b/doc/html/boost_asio/reference/ssl__context/clear_options.html @@ -43,7 +43,7 @@ void
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ssl__context/clear_options/overload1.html b/doc/html/boost_asio/reference/ssl__context/clear_options/overload1.html index 7d493231de..eeb4ad5d92 100644 --- a/doc/html/boost_asio/reference/ssl__context/clear_options/overload1.html +++ b/doc/html/boost_asio/reference/ssl__context/clear_options/overload1.html @@ -75,7 +75,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ssl__context/clear_options/overload2.html b/doc/html/boost_asio/reference/ssl__context/clear_options/overload2.html index 99ad76989f..dfd82d396d 100644 --- a/doc/html/boost_asio/reference/ssl__context/clear_options/overload2.html +++ b/doc/html/boost_asio/reference/ssl__context/clear_options/overload2.html @@ -67,7 +67,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ssl__context/context.html b/doc/html/boost_asio/reference/ssl__context/context.html index 5b5233d5ef..05feb7f144 100644 --- a/doc/html/boost_asio/reference/ssl__context/context.html +++ b/doc/html/boost_asio/reference/ssl__context/context.html @@ -44,7 +44,7 @@ Constructor.
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ssl__context/context/overload1.html b/doc/html/boost_asio/reference/ssl__context/context/overload1.html index 6c80242a69..49cdea485a 100644 --- a/doc/html/boost_asio/reference/ssl__context/context/overload1.html +++ b/doc/html/boost_asio/reference/ssl__context/context/overload1.html @@ -36,7 +36,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ssl__context/context/overload2.html b/doc/html/boost_asio/reference/ssl__context/context/overload2.html index 5e38667932..77f98aecc9 100644 --- a/doc/html/boost_asio/reference/ssl__context/context/overload2.html +++ b/doc/html/boost_asio/reference/ssl__context/context/overload2.html @@ -63,7 +63,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ssl__context/default_workarounds.html b/doc/html/boost_asio/reference/ssl__context/default_workarounds.html index 8a8f6ad3f8..7e1b5613d3 100644 --- a/doc/html/boost_asio/reference/ssl__context/default_workarounds.html +++ b/doc/html/boost_asio/reference/ssl__context/default_workarounds.html @@ -36,7 +36,7 @@ Implement
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ssl__context/file_format.html b/doc/html/boost_asio/reference/ssl__context/file_format.html index 9b02f253f8..a3f109962b 100644 --- a/doc/html/boost_asio/reference/ssl__context/file_format.html +++ b/doc/html/boost_asio/reference/ssl__context/file_format.html @@ -57,7 +57,7 @@ File
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ssl__context/load_verify_file.html b/doc/html/boost_asio/reference/ssl__context/load_verify_file.html index dc8097ed3e..1a5c3f14b2 100644 --- a/doc/html/boost_asio/reference/ssl__context/load_verify_file.html +++ b/doc/html/boost_asio/reference/ssl__context/load_verify_file.html @@ -43,7 +43,7 @@ void
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ssl__context/load_verify_file/overload1.html b/doc/html/boost_asio/reference/ssl__context/load_verify_file/overload1.html index 4b7650b17b..aa956ad3a8 100644 --- a/doc/html/boost_asio/reference/ssl__context/load_verify_file/overload1.html +++ b/doc/html/boost_asio/reference/ssl__context/load_verify_file/overload1.html @@ -74,7 +74,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ssl__context/load_verify_file/overload2.html b/doc/html/boost_asio/reference/ssl__context/load_verify_file/overload2.html index 657faa2b6a..50dc47e986 100644 --- a/doc/html/boost_asio/reference/ssl__context/load_verify_file/overload2.html +++ b/doc/html/boost_asio/reference/ssl__context/load_verify_file/overload2.html @@ -66,7 +66,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ssl__context/method.html b/doc/html/boost_asio/reference/ssl__context/method.html index 0c61b14ac5..1d15482e4a 100644 --- a/doc/html/boost_asio/reference/ssl__context/method.html +++ b/doc/html/boost_asio/reference/ssl__context/method.html @@ -152,7 +152,7 @@ Different methods
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ssl__context/native_handle.html b/doc/html/boost_asio/reference/ssl__context/native_handle.html index 0e34647940..0ecc480ece 100644 --- a/doc/html/boost_asio/reference/ssl__context/native_handle.html +++ b/doc/html/boost_asio/reference/ssl__context/native_handle.html @@ -41,7 +41,7 @@ Get
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ssl__context/native_handle_type.html b/doc/html/boost_asio/reference/ssl__context/native_handle_type.html index 587a81619f..c591c67c25 100644 --- a/doc/html/boost_asio/reference/ssl__context/native_handle_type.html +++ b/doc/html/boost_asio/reference/ssl__context/native_handle_type.html @@ -46,7 +46,7 @@ The
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ssl__context/no_compression.html b/doc/html/boost_asio/reference/ssl__context/no_compression.html index ee2f70745d..81fad3ba31 100644 --- a/doc/html/boost_asio/reference/ssl__context/no_compression.html +++ b/doc/html/boost_asio/reference/ssl__context/no_compression.html @@ -36,7 +36,7 @@ Disable
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ssl__context/no_sslv2.html b/doc/html/boost_asio/reference/ssl__context/no_sslv2.html index c412025318..ced2a609c6 100644 --- a/doc/html/boost_asio/reference/ssl__context/no_sslv2.html +++ b/doc/html/boost_asio/reference/ssl__context/no_sslv2.html @@ -36,7 +36,7 @@ Disable SSL
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ssl__context/no_sslv3.html b/doc/html/boost_asio/reference/ssl__context/no_sslv3.html index f9c23b57f2..5cde652de1 100644 --- a/doc/html/boost_asio/reference/ssl__context/no_sslv3.html +++ b/doc/html/boost_asio/reference/ssl__context/no_sslv3.html @@ -36,7 +36,7 @@ Disable SSL
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ssl__context/no_tlsv1.html b/doc/html/boost_asio/reference/ssl__context/no_tlsv1.html index d70180a3b2..47f0820494 100644 --- a/doc/html/boost_asio/reference/ssl__context/no_tlsv1.html +++ b/doc/html/boost_asio/reference/ssl__context/no_tlsv1.html @@ -36,7 +36,7 @@ Disable TLS
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ssl__context/no_tlsv1_1.html b/doc/html/boost_asio/reference/ssl__context/no_tlsv1_1.html index fbeb494796..3530c0b8b8 100644 --- a/doc/html/boost_asio/reference/ssl__context/no_tlsv1_1.html +++ b/doc/html/boost_asio/reference/ssl__context/no_tlsv1_1.html @@ -36,7 +36,7 @@ Disable
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ssl__context/no_tlsv1_2.html b/doc/html/boost_asio/reference/ssl__context/no_tlsv1_2.html index 84fad9290d..f2d67e782c 100644 --- a/doc/html/boost_asio/reference/ssl__context/no_tlsv1_2.html +++ b/doc/html/boost_asio/reference/ssl__context/no_tlsv1_2.html @@ -36,7 +36,7 @@ Disable
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ssl__context/operator_eq_.html b/doc/html/boost_asio/reference/ssl__context/operator_eq_.html index 2689ee21f1..9a48c58ddc 100644 --- a/doc/html/boost_asio/reference/ssl__context/operator_eq_.html +++ b/doc/html/boost_asio/reference/ssl__context/operator_eq_.html @@ -64,7 +64,7 @@ Move-assign
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ssl__context/options.html b/doc/html/boost_asio/reference/ssl__context/options.html index a4ff880dad..764117ba45 100644 --- a/doc/html/boost_asio/reference/ssl__context/options.html +++ b/doc/html/boost_asio/reference/ssl__context/options.html @@ -46,7 +46,7 @@ Bitmask type
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ssl__context/password_purpose.html b/doc/html/boost_asio/reference/ssl__context/password_purpose.html index 0b75791584..38c3fffdcc 100644 --- a/doc/html/boost_asio/reference/ssl__context/password_purpose.html +++ b/doc/html/boost_asio/reference/ssl__context/password_purpose.html @@ -57,7 +57,7 @@ Purpose
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ssl__context/set_default_verify_paths.html b/doc/html/boost_asio/reference/ssl__context/set_default_verify_paths.html index ff4dde3aef..12ef153572 100644 --- a/doc/html/boost_asio/reference/ssl__context/set_default_verify_paths.html +++ b/doc/html/boost_asio/reference/ssl__context/set_default_verify_paths.html @@ -42,7 +42,7 @@ void
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ssl__context/set_default_verify_paths/overload1.html b/doc/html/boost_asio/reference/ssl__context/set_default_verify_paths/overload1.html index a04cb230f7..0fdb84d308 100644 --- a/doc/html/boost_asio/reference/ssl__context/set_default_verify_paths/overload1.html +++ b/doc/html/boost_asio/reference/ssl__context/set_default_verify_paths/overload1.html @@ -60,7 +60,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ssl__context/set_default_verify_paths/overload2.html b/doc/html/boost_asio/reference/ssl__context/set_default_verify_paths/overload2.html index 6b870eccff..4ea6eb29cb 100644 --- a/doc/html/boost_asio/reference/ssl__context/set_default_verify_paths/overload2.html +++ b/doc/html/boost_asio/reference/ssl__context/set_default_verify_paths/overload2.html @@ -61,7 +61,7 @@
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ssl__context/set_options.html b/doc/html/boost_asio/reference/ssl__context/set_options.html index 4d557b190c..219d4066da 100644 --- a/doc/html/boost_asio/reference/ssl__context/set_options.html +++ b/doc/html/boost_asio/reference/ssl__context/set_options.html @@ -43,7 +43,7 @@ void
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ssl__context/set_options/overload1.html b/doc/html/boost_asio/reference/ssl__context/set_options/overload1.html index 288e568ae3..d9e1fb91a5 100644 --- a/doc/html/boost_asio/reference/ssl__context/set_options/overload1.html +++ b/doc/html/boost_asio/reference/ssl__context/set_options/overload1.html @@ -75,7 +75,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ssl__context/set_options/overload2.html b/doc/html/boost_asio/reference/ssl__context/set_options/overload2.html index 15f298a3c5..26c3b026fd 100644 --- a/doc/html/boost_asio/reference/ssl__context/set_options/overload2.html +++ b/doc/html/boost_asio/reference/ssl__context/set_options/overload2.html @@ -67,7 +67,7 @@
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ssl__context/set_password_callback.html b/doc/html/boost_asio/reference/ssl__context/set_password_callback.html index e985e1ab3a..cd8b35912f 100644 --- a/doc/html/boost_asio/reference/ssl__context/set_password_callback.html +++ b/doc/html/boost_asio/reference/ssl__context/set_password_callback.html @@ -47,7 +47,7 @@ void
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ssl__context/set_password_callback/overload1.html b/doc/html/boost_asio/reference/ssl__context/set_password_callback/overload1.html index 54860e5138..0bd07455a0 100644 --- a/doc/html/boost_asio/reference/ssl__context/set_password_callback/overload1.html +++ b/doc/html/boost_asio/reference/ssl__context/set_password_callback/overload1.html @@ -86,7 +86,7 @@ void set_password_callback(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ssl__context/set_password_callback/overload2.html b/doc/html/boost_asio/reference/ssl__context/set_password_callback/overload2.html index b8d20bd3fa..a71816e68a 100644 --- a/doc/html/boost_asio/reference/ssl__context/set_password_callback/overload2.html +++ b/doc/html/boost_asio/reference/ssl__context/set_password_callback/overload2.html @@ -78,7 +78,7 @@ void set_password_callback(
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ssl__context/set_verify_callback.html b/doc/html/boost_asio/reference/ssl__context/set_verify_callback.html index 5699de5ca7..b14781d43b 100644 --- a/doc/html/boost_asio/reference/ssl__context/set_verify_callback.html +++ b/doc/html/boost_asio/reference/ssl__context/set_verify_callback.html @@ -47,7 +47,7 @@ void
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ssl__context/set_verify_callback/overload1.html b/doc/html/boost_asio/reference/ssl__context/set_verify_callback/overload1.html index c6d0c6f7cc..9967bf8cf4 100644 --- a/doc/html/boost_asio/reference/ssl__context/set_verify_callback/overload1.html +++ b/doc/html/boost_asio/reference/ssl__context/set_verify_callback/overload1.html @@ -87,7 +87,7 @@ void set_verify_callback(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ssl__context/set_verify_callback/overload2.html b/doc/html/boost_asio/reference/ssl__context/set_verify_callback/overload2.html index 87fff56f28..d860ae52f1 100644 --- a/doc/html/boost_asio/reference/ssl__context/set_verify_callback/overload2.html +++ b/doc/html/boost_asio/reference/ssl__context/set_verify_callback/overload2.html @@ -79,7 +79,7 @@ void set_verify_callback(
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ssl__context/set_verify_depth.html b/doc/html/boost_asio/reference/ssl__context/set_verify_depth.html index cc0d1159c9..234f23e737 100644 --- a/doc/html/boost_asio/reference/ssl__context/set_verify_depth.html +++ b/doc/html/boost_asio/reference/ssl__context/set_verify_depth.html @@ -43,7 +43,7 @@ void
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ssl__context/set_verify_depth/overload1.html b/doc/html/boost_asio/reference/ssl__context/set_verify_depth/overload1.html index afb51c511d..b72111cc0c 100644 --- a/doc/html/boost_asio/reference/ssl__context/set_verify_depth/overload1.html +++ b/doc/html/boost_asio/reference/ssl__context/set_verify_depth/overload1.html @@ -74,7 +74,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ssl__context/set_verify_depth/overload2.html b/doc/html/boost_asio/reference/ssl__context/set_verify_depth/overload2.html index 6ee54e77d1..1237ad73f6 100644 --- a/doc/html/boost_asio/reference/ssl__context/set_verify_depth/overload2.html +++ b/doc/html/boost_asio/reference/ssl__context/set_verify_depth/overload2.html @@ -66,7 +66,7 @@
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ssl__context/set_verify_mode.html b/doc/html/boost_asio/reference/ssl__context/set_verify_mode.html index 34d1cc46e8..57a6924655 100644 --- a/doc/html/boost_asio/reference/ssl__context/set_verify_mode.html +++ b/doc/html/boost_asio/reference/ssl__context/set_verify_mode.html @@ -43,7 +43,7 @@ void
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ssl__context/set_verify_mode/overload1.html b/doc/html/boost_asio/reference/ssl__context/set_verify_mode/overload1.html index 81ef3c30c7..59103b7c35 100644 --- a/doc/html/boost_asio/reference/ssl__context/set_verify_mode/overload1.html +++ b/doc/html/boost_asio/reference/ssl__context/set_verify_mode/overload1.html @@ -74,7 +74,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ssl__context/set_verify_mode/overload2.html b/doc/html/boost_asio/reference/ssl__context/set_verify_mode/overload2.html index 23614f4f54..7c4bac37ac 100644 --- a/doc/html/boost_asio/reference/ssl__context/set_verify_mode/overload2.html +++ b/doc/html/boost_asio/reference/ssl__context/set_verify_mode/overload2.html @@ -66,7 +66,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ssl__context/single_dh_use.html b/doc/html/boost_asio/reference/ssl__context/single_dh_use.html index 8b843a242d..e92f1bfa77 100644 --- a/doc/html/boost_asio/reference/ssl__context/single_dh_use.html +++ b/doc/html/boost_asio/reference/ssl__context/single_dh_use.html @@ -36,7 +36,7 @@ Always
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ssl__context/use_certificate.html b/doc/html/boost_asio/reference/ssl__context/use_certificate.html index ef7a37f0a7..b2e9ea342f 100644 --- a/doc/html/boost_asio/reference/ssl__context/use_certificate.html +++ b/doc/html/boost_asio/reference/ssl__context/use_certificate.html @@ -45,7 +45,7 @@ void
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ssl__context/use_certificate/overload1.html b/doc/html/boost_asio/reference/ssl__context/use_certificate/overload1.html index efd8670a5c..febb1709ec 100644 --- a/doc/html/boost_asio/reference/ssl__context/use_certificate/overload1.html +++ b/doc/html/boost_asio/reference/ssl__context/use_certificate/overload1.html @@ -77,7 +77,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ssl__context/use_certificate/overload2.html b/doc/html/boost_asio/reference/ssl__context/use_certificate/overload2.html index 3f839a14d5..0f57ae4d7a 100644 --- a/doc/html/boost_asio/reference/ssl__context/use_certificate/overload2.html +++ b/doc/html/boost_asio/reference/ssl__context/use_certificate/overload2.html @@ -69,7 +69,7 @@
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ssl__context/use_certificate_chain.html b/doc/html/boost_asio/reference/ssl__context/use_certificate_chain.html index dbc7910a15..fbd6f06d73 100644 --- a/doc/html/boost_asio/reference/ssl__context/use_certificate_chain.html +++ b/doc/html/boost_asio/reference/ssl__context/use_certificate_chain.html @@ -43,7 +43,7 @@ void
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ssl__context/use_certificate_chain/overload1.html b/doc/html/boost_asio/reference/ssl__context/use_certificate_chain/overload1.html index a4fd083261..ca04bb58a0 100644 --- a/doc/html/boost_asio/reference/ssl__context/use_certificate_chain/overload1.html +++ b/doc/html/boost_asio/reference/ssl__context/use_certificate_chain/overload1.html @@ -74,7 +74,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ssl__context/use_certificate_chain/overload2.html b/doc/html/boost_asio/reference/ssl__context/use_certificate_chain/overload2.html index 027e7ad766..e873bdd587 100644 --- a/doc/html/boost_asio/reference/ssl__context/use_certificate_chain/overload2.html +++ b/doc/html/boost_asio/reference/ssl__context/use_certificate_chain/overload2.html @@ -66,7 +66,7 @@
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ssl__context/use_certificate_chain_file.html b/doc/html/boost_asio/reference/ssl__context/use_certificate_chain_file.html index b5fd34a2c2..ffca3f42b5 100644 --- a/doc/html/boost_asio/reference/ssl__context/use_certificate_chain_file.html +++ b/doc/html/boost_asio/reference/ssl__context/use_certificate_chain_file.html @@ -43,7 +43,7 @@ void
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ssl__context/use_certificate_chain_file/overload1.html b/doc/html/boost_asio/reference/ssl__context/use_certificate_chain_file/overload1.html index 2c058b4634..df88543ae1 100644 --- a/doc/html/boost_asio/reference/ssl__context/use_certificate_chain_file/overload1.html +++ b/doc/html/boost_asio/reference/ssl__context/use_certificate_chain_file/overload1.html @@ -74,7 +74,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ssl__context/use_certificate_chain_file/overload2.html b/doc/html/boost_asio/reference/ssl__context/use_certificate_chain_file/overload2.html index 3fb1768555..cafb38ee34 100644 --- a/doc/html/boost_asio/reference/ssl__context/use_certificate_chain_file/overload2.html +++ b/doc/html/boost_asio/reference/ssl__context/use_certificate_chain_file/overload2.html @@ -66,7 +66,7 @@
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ssl__context/use_certificate_file.html b/doc/html/boost_asio/reference/ssl__context/use_certificate_file.html index e45f2fd2fe..e36929122f 100644 --- a/doc/html/boost_asio/reference/ssl__context/use_certificate_file.html +++ b/doc/html/boost_asio/reference/ssl__context/use_certificate_file.html @@ -45,7 +45,7 @@ void
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ssl__context/use_certificate_file/overload1.html b/doc/html/boost_asio/reference/ssl__context/use_certificate_file/overload1.html index 08aaaafdfd..50cfce3573 100644 --- a/doc/html/boost_asio/reference/ssl__context/use_certificate_file/overload1.html +++ b/doc/html/boost_asio/reference/ssl__context/use_certificate_file/overload1.html @@ -77,7 +77,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ssl__context/use_certificate_file/overload2.html b/doc/html/boost_asio/reference/ssl__context/use_certificate_file/overload2.html index d5a1a3c699..cd454bd415 100644 --- a/doc/html/boost_asio/reference/ssl__context/use_certificate_file/overload2.html +++ b/doc/html/boost_asio/reference/ssl__context/use_certificate_file/overload2.html @@ -69,7 +69,7 @@
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ssl__context/use_private_key.html b/doc/html/boost_asio/reference/ssl__context/use_private_key.html index 415dd326f6..54a9d04458 100644 --- a/doc/html/boost_asio/reference/ssl__context/use_private_key.html +++ b/doc/html/boost_asio/reference/ssl__context/use_private_key.html @@ -45,7 +45,7 @@ void
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ssl__context/use_private_key/overload1.html b/doc/html/boost_asio/reference/ssl__context/use_private_key/overload1.html index d38297ab33..ec8a8e1b25 100644 --- a/doc/html/boost_asio/reference/ssl__context/use_private_key/overload1.html +++ b/doc/html/boost_asio/reference/ssl__context/use_private_key/overload1.html @@ -77,7 +77,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ssl__context/use_private_key/overload2.html b/doc/html/boost_asio/reference/ssl__context/use_private_key/overload2.html index 73789cd7d9..efd6232126 100644 --- a/doc/html/boost_asio/reference/ssl__context/use_private_key/overload2.html +++ b/doc/html/boost_asio/reference/ssl__context/use_private_key/overload2.html @@ -69,7 +69,7 @@
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ssl__context/use_private_key_file.html b/doc/html/boost_asio/reference/ssl__context/use_private_key_file.html index 8d7706f477..0d35bc980c 100644 --- a/doc/html/boost_asio/reference/ssl__context/use_private_key_file.html +++ b/doc/html/boost_asio/reference/ssl__context/use_private_key_file.html @@ -45,7 +45,7 @@ void
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ssl__context/use_private_key_file/overload1.html b/doc/html/boost_asio/reference/ssl__context/use_private_key_file/overload1.html index 4f1114c825..09c7b1ed25 100644 --- a/doc/html/boost_asio/reference/ssl__context/use_private_key_file/overload1.html +++ b/doc/html/boost_asio/reference/ssl__context/use_private_key_file/overload1.html @@ -77,7 +77,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ssl__context/use_private_key_file/overload2.html b/doc/html/boost_asio/reference/ssl__context/use_private_key_file/overload2.html index 936c3bb5dd..d9f4108541 100644 --- a/doc/html/boost_asio/reference/ssl__context/use_private_key_file/overload2.html +++ b/doc/html/boost_asio/reference/ssl__context/use_private_key_file/overload2.html @@ -69,7 +69,7 @@
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ssl__context/use_rsa_private_key.html b/doc/html/boost_asio/reference/ssl__context/use_rsa_private_key.html index 9e73414e92..6ef25c76cd 100644 --- a/doc/html/boost_asio/reference/ssl__context/use_rsa_private_key.html +++ b/doc/html/boost_asio/reference/ssl__context/use_rsa_private_key.html @@ -45,7 +45,7 @@ void
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ssl__context/use_rsa_private_key/overload1.html b/doc/html/boost_asio/reference/ssl__context/use_rsa_private_key/overload1.html index 87f14c3ba7..5781361a41 100644 --- a/doc/html/boost_asio/reference/ssl__context/use_rsa_private_key/overload1.html +++ b/doc/html/boost_asio/reference/ssl__context/use_rsa_private_key/overload1.html @@ -78,7 +78,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ssl__context/use_rsa_private_key/overload2.html b/doc/html/boost_asio/reference/ssl__context/use_rsa_private_key/overload2.html index 506a18b97c..883ebfba9c 100644 --- a/doc/html/boost_asio/reference/ssl__context/use_rsa_private_key/overload2.html +++ b/doc/html/boost_asio/reference/ssl__context/use_rsa_private_key/overload2.html @@ -70,7 +70,7 @@
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ssl__context/use_rsa_private_key_file.html b/doc/html/boost_asio/reference/ssl__context/use_rsa_private_key_file.html index eefbc564c6..c46f9e37a7 100644 --- a/doc/html/boost_asio/reference/ssl__context/use_rsa_private_key_file.html +++ b/doc/html/boost_asio/reference/ssl__context/use_rsa_private_key_file.html @@ -45,7 +45,7 @@ void
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ssl__context/use_rsa_private_key_file/overload1.html b/doc/html/boost_asio/reference/ssl__context/use_rsa_private_key_file/overload1.html index 686ed147db..782d2668ef 100644 --- a/doc/html/boost_asio/reference/ssl__context/use_rsa_private_key_file/overload1.html +++ b/doc/html/boost_asio/reference/ssl__context/use_rsa_private_key_file/overload1.html @@ -78,7 +78,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ssl__context/use_rsa_private_key_file/overload2.html b/doc/html/boost_asio/reference/ssl__context/use_rsa_private_key_file/overload2.html index c0a4a17a98..8836b11d9c 100644 --- a/doc/html/boost_asio/reference/ssl__context/use_rsa_private_key_file/overload2.html +++ b/doc/html/boost_asio/reference/ssl__context/use_rsa_private_key_file/overload2.html @@ -70,7 +70,7 @@
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ssl__context/use_tmp_dh.html b/doc/html/boost_asio/reference/ssl__context/use_tmp_dh.html index 547a6a9156..2e1e964a81 100644 --- a/doc/html/boost_asio/reference/ssl__context/use_tmp_dh.html +++ b/doc/html/boost_asio/reference/ssl__context/use_tmp_dh.html @@ -43,7 +43,7 @@ void
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ssl__context/use_tmp_dh/overload1.html b/doc/html/boost_asio/reference/ssl__context/use_tmp_dh/overload1.html index 0a8dfffba4..cf30bab247 100644 --- a/doc/html/boost_asio/reference/ssl__context/use_tmp_dh/overload1.html +++ b/doc/html/boost_asio/reference/ssl__context/use_tmp_dh/overload1.html @@ -75,7 +75,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ssl__context/use_tmp_dh/overload2.html b/doc/html/boost_asio/reference/ssl__context/use_tmp_dh/overload2.html index d7e0dc935f..8144211686 100644 --- a/doc/html/boost_asio/reference/ssl__context/use_tmp_dh/overload2.html +++ b/doc/html/boost_asio/reference/ssl__context/use_tmp_dh/overload2.html @@ -67,7 +67,7 @@
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ssl__context/use_tmp_dh_file.html b/doc/html/boost_asio/reference/ssl__context/use_tmp_dh_file.html index 434af3197c..1c2266ab30 100644 --- a/doc/html/boost_asio/reference/ssl__context/use_tmp_dh_file.html +++ b/doc/html/boost_asio/reference/ssl__context/use_tmp_dh_file.html @@ -43,7 +43,7 @@ void
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ssl__context/use_tmp_dh_file/overload1.html b/doc/html/boost_asio/reference/ssl__context/use_tmp_dh_file/overload1.html index db1391c185..cecd45d8de 100644 --- a/doc/html/boost_asio/reference/ssl__context/use_tmp_dh_file/overload1.html +++ b/doc/html/boost_asio/reference/ssl__context/use_tmp_dh_file/overload1.html @@ -74,7 +74,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ssl__context/use_tmp_dh_file/overload2.html b/doc/html/boost_asio/reference/ssl__context/use_tmp_dh_file/overload2.html index d450c86783..6eff2d247b 100644 --- a/doc/html/boost_asio/reference/ssl__context/use_tmp_dh_file/overload2.html +++ b/doc/html/boost_asio/reference/ssl__context/use_tmp_dh_file/overload2.html @@ -66,7 +66,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ssl__context_base.html b/doc/html/boost_asio/reference/ssl__context_base.html index 4c8ff9e923..bcd9008edd 100644 --- a/doc/html/boost_asio/reference/ssl__context_base.html +++ b/doc/html/boost_asio/reference/ssl__context_base.html @@ -274,7 +274,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ssl__context_base/_context_base.html b/doc/html/boost_asio/reference/ssl__context_base/_context_base.html index 0a0e06e5f9..8707df0ebd 100644 --- a/doc/html/boost_asio/reference/ssl__context_base/_context_base.html +++ b/doc/html/boost_asio/reference/ssl__context_base/_context_base.html @@ -36,7 +36,7 @@ Protected
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ssl__context_base/default_workarounds.html b/doc/html/boost_asio/reference/ssl__context_base/default_workarounds.html index 4ce1fcc5bb..1ec5579a33 100644 --- a/doc/html/boost_asio/reference/ssl__context_base/default_workarounds.html +++ b/doc/html/boost_asio/reference/ssl__context_base/default_workarounds.html @@ -36,7 +36,7 @@ Implement
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ssl__context_base/file_format.html b/doc/html/boost_asio/reference/ssl__context_base/file_format.html index d4e6ebd149..f248d449b9 100644 --- a/doc/html/boost_asio/reference/ssl__context_base/file_format.html +++ b/doc/html/boost_asio/reference/ssl__context_base/file_format.html @@ -57,7 +57,7 @@ File
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ssl__context_base/method.html b/doc/html/boost_asio/reference/ssl__context_base/method.html index cebdd0b255..a03ca209ee 100644 --- a/doc/html/boost_asio/reference/ssl__context_base/method.html +++ b/doc/html/boost_asio/reference/ssl__context_base/method.html @@ -152,7 +152,7 @@ Different
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ssl__context_base/no_compression.html b/doc/html/boost_asio/reference/ssl__context_base/no_compression.html index fdf139c4be..3aa75d0289 100644 --- a/doc/html/boost_asio/reference/ssl__context_base/no_compression.html +++ b/doc/html/boost_asio/reference/ssl__context_base/no_compression.html @@ -36,7 +36,7 @@ Disable
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ssl__context_base/no_sslv2.html b/doc/html/boost_asio/reference/ssl__context_base/no_sslv2.html index 09a4a2f337..89b1174ce8 100644 --- a/doc/html/boost_asio/reference/ssl__context_base/no_sslv2.html +++ b/doc/html/boost_asio/reference/ssl__context_base/no_sslv2.html @@ -36,7 +36,7 @@ Disable
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ssl__context_base/no_sslv3.html b/doc/html/boost_asio/reference/ssl__context_base/no_sslv3.html index 55aa8f461f..58785145ca 100644 --- a/doc/html/boost_asio/reference/ssl__context_base/no_sslv3.html +++ b/doc/html/boost_asio/reference/ssl__context_base/no_sslv3.html @@ -36,7 +36,7 @@ Disable
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ssl__context_base/no_tlsv1.html b/doc/html/boost_asio/reference/ssl__context_base/no_tlsv1.html index 983cb4e759..796e9610da 100644 --- a/doc/html/boost_asio/reference/ssl__context_base/no_tlsv1.html +++ b/doc/html/boost_asio/reference/ssl__context_base/no_tlsv1.html @@ -36,7 +36,7 @@ Disable
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ssl__context_base/no_tlsv1_1.html b/doc/html/boost_asio/reference/ssl__context_base/no_tlsv1_1.html index 6381692395..8132588cda 100644 --- a/doc/html/boost_asio/reference/ssl__context_base/no_tlsv1_1.html +++ b/doc/html/boost_asio/reference/ssl__context_base/no_tlsv1_1.html @@ -36,7 +36,7 @@ Disable
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ssl__context_base/no_tlsv1_2.html b/doc/html/boost_asio/reference/ssl__context_base/no_tlsv1_2.html index 611a61da04..14503e2c99 100644 --- a/doc/html/boost_asio/reference/ssl__context_base/no_tlsv1_2.html +++ b/doc/html/boost_asio/reference/ssl__context_base/no_tlsv1_2.html @@ -36,7 +36,7 @@ Disable
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ssl__context_base/options.html b/doc/html/boost_asio/reference/ssl__context_base/options.html index 293f472417..9e10e697f7 100644 --- a/doc/html/boost_asio/reference/ssl__context_base/options.html +++ b/doc/html/boost_asio/reference/ssl__context_base/options.html @@ -46,7 +46,7 @@ Bitmask
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ssl__context_base/password_purpose.html b/doc/html/boost_asio/reference/ssl__context_base/password_purpose.html index 63ea5571fe..d547fa7e6d 100644 --- a/doc/html/boost_asio/reference/ssl__context_base/password_purpose.html +++ b/doc/html/boost_asio/reference/ssl__context_base/password_purpose.html @@ -57,7 +57,7 @@ Purpose
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ssl__context_base/single_dh_use.html b/doc/html/boost_asio/reference/ssl__context_base/single_dh_use.html index e0eb84a2e0..6601a27e29 100644 --- a/doc/html/boost_asio/reference/ssl__context_base/single_dh_use.html +++ b/doc/html/boost_asio/reference/ssl__context_base/single_dh_use.html @@ -36,7 +36,7 @@ Always
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ssl__error__get_stream_category.html b/doc/html/boost_asio/reference/ssl__error__get_stream_category.html index b4a5b7fc1d..fec2af5266 100644 --- a/doc/html/boost_asio/reference/ssl__error__get_stream_category.html +++ b/doc/html/boost_asio/reference/ssl__error__get_stream_category.html @@ -44,7 +44,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ssl__error__make_error_code.html b/doc/html/boost_asio/reference/ssl__error__make_error_code.html index a104436f85..4de1dae08c 100644 --- a/doc/html/boost_asio/reference/ssl__error__make_error_code.html +++ b/doc/html/boost_asio/reference/ssl__error__make_error_code.html @@ -45,7 +45,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ssl__error__stream_category.html b/doc/html/boost_asio/reference/ssl__error__stream_category.html index 36cb3f7a7d..d98eddd976 100644 --- a/doc/html/boost_asio/reference/ssl__error__stream_category.html +++ b/doc/html/boost_asio/reference/ssl__error__stream_category.html @@ -44,7 +44,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ssl__error__stream_errors.html b/doc/html/boost_asio/reference/ssl__error__stream_errors.html index 154a03be1c..3446236aa2 100644 --- a/doc/html/boost_asio/reference/ssl__error__stream_errors.html +++ b/doc/html/boost_asio/reference/ssl__error__stream_errors.html @@ -61,7 +61,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ssl__rfc2818_verification.html b/doc/html/boost_asio/reference/ssl__rfc2818_verification.html index 41255d908e..58cf99aeea 100644 --- a/doc/html/boost_asio/reference/ssl__rfc2818_verification.html +++ b/doc/html/boost_asio/reference/ssl__rfc2818_verification.html @@ -159,7 +159,7 @@ sock.handshake(ssl_socket::client);
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ssl__rfc2818_verification/operator_lp__rp_.html b/doc/html/boost_asio/reference/ssl__rfc2818_verification/operator_lp__rp_.html index 6f190bb750..f4304ccbb4 100644 --- a/doc/html/boost_asio/reference/ssl__rfc2818_verification/operator_lp__rp_.html +++ b/doc/html/boost_asio/reference/ssl__rfc2818_verification/operator_lp__rp_.html @@ -38,7 +38,7 @@ Perform
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ssl__rfc2818_verification/result_type.html b/doc/html/boost_asio/reference/ssl__rfc2818_verification/result_type.html index a603aac653..9ac1a77a73 100644 --- a/doc/html/boost_asio/reference/ssl__rfc2818_verification/result_type.html +++ b/doc/html/boost_asio/reference/ssl__rfc2818_verification/result_type.html @@ -46,7 +46,7 @@ The
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ssl__rfc2818_verification/rfc2818_verification.html b/doc/html/boost_asio/reference/ssl__rfc2818_verification/rfc2818_verification.html index ca194f0631..f05d0676ec 100644 --- a/doc/html/boost_asio/reference/ssl__rfc2818_verification/rfc2818_verification.html +++ b/doc/html/boost_asio/reference/ssl__rfc2818_verification/rfc2818_verification.html @@ -36,7 +36,7 @@ Constructor.
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ssl__stream.html b/doc/html/boost_asio/reference/ssl__stream.html index 9d2b22f44f..4108578ed6 100644 --- a/doc/html/boost_asio/reference/ssl__stream.html +++ b/doc/html/boost_asio/reference/ssl__stream.html @@ -428,7 +428,7 @@ boost::asio::ssl::stream<asio:ip::tcp::socket> sock(io_context, ctx);
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ssl__stream/_stream.html b/doc/html/boost_asio/reference/ssl__stream/_stream.html index dcf33d4066..a97275fd64 100644 --- a/doc/html/boost_asio/reference/ssl__stream/_stream.html +++ b/doc/html/boost_asio/reference/ssl__stream/_stream.html @@ -43,7 +43,7 @@ Destructor.
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ssl__stream/async_handshake.html b/doc/html/boost_asio/reference/ssl__stream/async_handshake.html index cdf6abdd21..9e8da20bd8 100644 --- a/doc/html/boost_asio/reference/ssl__stream/async_handshake.html +++ b/doc/html/boost_asio/reference/ssl__stream/async_handshake.html @@ -50,7 +50,7 @@ template<
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ssl__stream/async_handshake/overload1.html b/doc/html/boost_asio/reference/ssl__stream/async_handshake/overload1.html index fb7fe277fe..8a6459b013 100644 --- a/doc/html/boost_asio/reference/ssl__stream/async_handshake/overload1.html +++ b/doc/html/boost_asio/reference/ssl__stream/async_handshake/overload1.html @@ -71,7 +71,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ssl__stream/async_handshake/overload2.html b/doc/html/boost_asio/reference/ssl__stream/async_handshake/overload2.html index ad9df6b0c8..3110164a5c 100644 --- a/doc/html/boost_asio/reference/ssl__stream/async_handshake/overload2.html +++ b/doc/html/boost_asio/reference/ssl__stream/async_handshake/overload2.html @@ -81,7 +81,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ssl__stream/async_read_some.html b/doc/html/boost_asio/reference/ssl__stream/async_read_some.html index 1dfb988f4d..2f3f2bc050 100644 --- a/doc/html/boost_asio/reference/ssl__stream/async_read_some.html +++ b/doc/html/boost_asio/reference/ssl__stream/async_read_some.html @@ -86,7 +86,7 @@ Start
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ssl__stream/async_shutdown.html b/doc/html/boost_asio/reference/ssl__stream/async_shutdown.html index 8098270daa..d70ea66c53 100644 --- a/doc/html/boost_asio/reference/ssl__stream/async_shutdown.html +++ b/doc/html/boost_asio/reference/ssl__stream/async_shutdown.html @@ -66,7 +66,7 @@ Asynchronously
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ssl__stream/async_write_some.html b/doc/html/boost_asio/reference/ssl__stream/async_write_some.html index 2945530cfe..db66dbfd1f 100644 --- a/doc/html/boost_asio/reference/ssl__stream/async_write_some.html +++ b/doc/html/boost_asio/reference/ssl__stream/async_write_some.html @@ -86,7 +86,7 @@ Start
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ssl__stream/executor_type.html b/doc/html/boost_asio/reference/ssl__stream/executor_type.html index 6b4dc85a3f..d485a1eeab 100644 --- a/doc/html/boost_asio/reference/ssl__stream/executor_type.html +++ b/doc/html/boost_asio/reference/ssl__stream/executor_type.html @@ -46,7 +46,7 @@ The
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ssl__stream/get_executor.html b/doc/html/boost_asio/reference/ssl__stream/get_executor.html index 124c6b9482..5b3b096533 100644 --- a/doc/html/boost_asio/reference/ssl__stream/get_executor.html +++ b/doc/html/boost_asio/reference/ssl__stream/get_executor.html @@ -48,7 +48,7 @@ Get
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ssl__stream/get_io_context.html b/doc/html/boost_asio/reference/ssl__stream/get_io_context.html index ea400b4f39..3007fd24a4 100644 --- a/doc/html/boost_asio/reference/ssl__stream/get_io_context.html +++ b/doc/html/boost_asio/reference/ssl__stream/get_io_context.html @@ -37,7 +37,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ssl__stream/get_io_service.html b/doc/html/boost_asio/reference/ssl__stream/get_io_service.html index 365a7162d2..20a7862f20 100644 --- a/doc/html/boost_asio/reference/ssl__stream/get_io_service.html +++ b/doc/html/boost_asio/reference/ssl__stream/get_io_service.html @@ -37,7 +37,7 @@
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ssl__stream/handshake.html b/doc/html/boost_asio/reference/ssl__stream/handshake.html index 90788e9874..017e3efa01 100644 --- a/doc/html/boost_asio/reference/ssl__stream/handshake.html +++ b/doc/html/boost_asio/reference/ssl__stream/handshake.html @@ -58,7 +58,7 @@ void
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ssl__stream/handshake/overload1.html b/doc/html/boost_asio/reference/ssl__stream/handshake/overload1.html index b65786222b..c8ea3d82dc 100644 --- a/doc/html/boost_asio/reference/ssl__stream/handshake/overload1.html +++ b/doc/html/boost_asio/reference/ssl__stream/handshake/overload1.html @@ -67,7 +67,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ssl__stream/handshake/overload2.html b/doc/html/boost_asio/reference/ssl__stream/handshake/overload2.html index dc7976f896..e87b32567d 100644 --- a/doc/html/boost_asio/reference/ssl__stream/handshake/overload2.html +++ b/doc/html/boost_asio/reference/ssl__stream/handshake/overload2.html @@ -59,7 +59,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ssl__stream/handshake/overload3.html b/doc/html/boost_asio/reference/ssl__stream/handshake/overload3.html index 19d49240b3..1f642f8113 100644 --- a/doc/html/boost_asio/reference/ssl__stream/handshake/overload3.html +++ b/doc/html/boost_asio/reference/ssl__stream/handshake/overload3.html @@ -74,7 +74,7 @@ void handshake(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ssl__stream/handshake/overload4.html b/doc/html/boost_asio/reference/ssl__stream/handshake/overload4.html index d4d84cbc57..1265ff4cf6 100644 --- a/doc/html/boost_asio/reference/ssl__stream/handshake/overload4.html +++ b/doc/html/boost_asio/reference/ssl__stream/handshake/overload4.html @@ -66,7 +66,7 @@ void handshake(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ssl__stream/handshake_type.html b/doc/html/boost_asio/reference/ssl__stream/handshake_type.html index 6362dcbac4..1f8334f672 100644 --- a/doc/html/boost_asio/reference/ssl__stream/handshake_type.html +++ b/doc/html/boost_asio/reference/ssl__stream/handshake_type.html @@ -57,7 +57,7 @@ Different
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ssl__stream/lowest_layer.html b/doc/html/boost_asio/reference/ssl__stream/lowest_layer.html index d53d5c6628..70d9387b56 100644 --- a/doc/html/boost_asio/reference/ssl__stream/lowest_layer.html +++ b/doc/html/boost_asio/reference/ssl__stream/lowest_layer.html @@ -40,7 +40,7 @@ const lowest_layer_type & -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ssl__stream/lowest_layer/overload1.html b/doc/html/boost_asio/reference/ssl__stream/lowest_layer/overload1.html index ba48fe0320..d171cd63cc 100644 --- a/doc/html/boost_asio/reference/ssl__stream/lowest_layer/overload1.html +++ b/doc/html/boost_asio/reference/ssl__stream/lowest_layer/overload1.html @@ -48,7 +48,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ssl__stream/lowest_layer/overload2.html b/doc/html/boost_asio/reference/ssl__stream/lowest_layer/overload2.html index cf1cb23afe..07646127b5 100644 --- a/doc/html/boost_asio/reference/ssl__stream/lowest_layer/overload2.html +++ b/doc/html/boost_asio/reference/ssl__stream/lowest_layer/overload2.html @@ -48,7 +48,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ssl__stream/lowest_layer_type.html b/doc/html/boost_asio/reference/ssl__stream/lowest_layer_type.html index c50cb26e02..d94db3a2c0 100644 --- a/doc/html/boost_asio/reference/ssl__stream/lowest_layer_type.html +++ b/doc/html/boost_asio/reference/ssl__stream/lowest_layer_type.html @@ -46,7 +46,7 @@ The
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ssl__stream/native_handle.html b/doc/html/boost_asio/reference/ssl__stream/native_handle.html index b44bc5b21e..d0bf2bdde9 100644 --- a/doc/html/boost_asio/reference/ssl__stream/native_handle.html +++ b/doc/html/boost_asio/reference/ssl__stream/native_handle.html @@ -62,7 +62,7 @@ if (X509* cert = SSL_get_peer_certificate(sock.native_handle()))
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ssl__stream/native_handle_type.html b/doc/html/boost_asio/reference/ssl__stream/native_handle_type.html index a7bd59908c..a4bb899244 100644 --- a/doc/html/boost_asio/reference/ssl__stream/native_handle_type.html +++ b/doc/html/boost_asio/reference/ssl__stream/native_handle_type.html @@ -46,7 +46,7 @@ The
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ssl__stream/next_layer.html b/doc/html/boost_asio/reference/ssl__stream/next_layer.html index 1fa83494da..198188fc63 100644 --- a/doc/html/boost_asio/reference/ssl__stream/next_layer.html +++ b/doc/html/boost_asio/reference/ssl__stream/next_layer.html @@ -40,7 +40,7 @@ next_layer_type &
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ssl__stream/next_layer/overload1.html b/doc/html/boost_asio/reference/ssl__stream/next_layer/overload1.html index c1eb01d4c7..7149c68bc1 100644 --- a/doc/html/boost_asio/reference/ssl__stream/next_layer/overload1.html +++ b/doc/html/boost_asio/reference/ssl__stream/next_layer/overload1.html @@ -48,7 +48,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ssl__stream/next_layer/overload2.html b/doc/html/boost_asio/reference/ssl__stream/next_layer/overload2.html index 1690860297..7ef4e7cca8 100644 --- a/doc/html/boost_asio/reference/ssl__stream/next_layer/overload2.html +++ b/doc/html/boost_asio/reference/ssl__stream/next_layer/overload2.html @@ -48,7 +48,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ssl__stream/next_layer_type.html b/doc/html/boost_asio/reference/ssl__stream/next_layer_type.html index 8aa33ae106..b334e99d44 100644 --- a/doc/html/boost_asio/reference/ssl__stream/next_layer_type.html +++ b/doc/html/boost_asio/reference/ssl__stream/next_layer_type.html @@ -46,7 +46,7 @@ The
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ssl__stream/read_some.html b/doc/html/boost_asio/reference/ssl__stream/read_some.html index 3e0fffc408..198c0ea95b 100644 --- a/doc/html/boost_asio/reference/ssl__stream/read_some.html +++ b/doc/html/boost_asio/reference/ssl__stream/read_some.html @@ -47,7 +47,7 @@ std::size_t
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ssl__stream/read_some/overload1.html b/doc/html/boost_asio/reference/ssl__stream/read_some/overload1.html index 5dc0378f00..e112e33854 100644 --- a/doc/html/boost_asio/reference/ssl__stream/read_some/overload1.html +++ b/doc/html/boost_asio/reference/ssl__stream/read_some/overload1.html @@ -87,7 +87,7 @@ std::size_t read_some(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ssl__stream/read_some/overload2.html b/doc/html/boost_asio/reference/ssl__stream/read_some/overload2.html index 8e47caf716..bddcf3c91d 100644 --- a/doc/html/boost_asio/reference/ssl__stream/read_some/overload2.html +++ b/doc/html/boost_asio/reference/ssl__stream/read_some/overload2.html @@ -79,7 +79,7 @@ std::size_t read_some(
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ssl__stream/set_verify_callback.html b/doc/html/boost_asio/reference/ssl__stream/set_verify_callback.html index a91e2e93f5..8f1ee28e64 100644 --- a/doc/html/boost_asio/reference/ssl__stream/set_verify_callback.html +++ b/doc/html/boost_asio/reference/ssl__stream/set_verify_callback.html @@ -47,7 +47,7 @@ void
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ssl__stream/set_verify_callback/overload1.html b/doc/html/boost_asio/reference/ssl__stream/set_verify_callback/overload1.html index 12b2a7eb12..bc56110f21 100644 --- a/doc/html/boost_asio/reference/ssl__stream/set_verify_callback/overload1.html +++ b/doc/html/boost_asio/reference/ssl__stream/set_verify_callback/overload1.html @@ -87,7 +87,7 @@ void set_verify_callback(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ssl__stream/set_verify_callback/overload2.html b/doc/html/boost_asio/reference/ssl__stream/set_verify_callback/overload2.html index 706cb0da51..dcddbf1c92 100644 --- a/doc/html/boost_asio/reference/ssl__stream/set_verify_callback/overload2.html +++ b/doc/html/boost_asio/reference/ssl__stream/set_verify_callback/overload2.html @@ -79,7 +79,7 @@ void set_verify_callback(
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ssl__stream/set_verify_depth.html b/doc/html/boost_asio/reference/ssl__stream/set_verify_depth.html index 22cd2e176a..1892e2ab33 100644 --- a/doc/html/boost_asio/reference/ssl__stream/set_verify_depth.html +++ b/doc/html/boost_asio/reference/ssl__stream/set_verify_depth.html @@ -43,7 +43,7 @@ void
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ssl__stream/set_verify_depth/overload1.html b/doc/html/boost_asio/reference/ssl__stream/set_verify_depth/overload1.html index f8a656f4bc..4119918ed2 100644 --- a/doc/html/boost_asio/reference/ssl__stream/set_verify_depth/overload1.html +++ b/doc/html/boost_asio/reference/ssl__stream/set_verify_depth/overload1.html @@ -74,7 +74,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ssl__stream/set_verify_depth/overload2.html b/doc/html/boost_asio/reference/ssl__stream/set_verify_depth/overload2.html index f4a0ee2e4a..bd6305f078 100644 --- a/doc/html/boost_asio/reference/ssl__stream/set_verify_depth/overload2.html +++ b/doc/html/boost_asio/reference/ssl__stream/set_verify_depth/overload2.html @@ -66,7 +66,7 @@
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ssl__stream/set_verify_mode.html b/doc/html/boost_asio/reference/ssl__stream/set_verify_mode.html index 2151c6795e..1ae7b12363 100644 --- a/doc/html/boost_asio/reference/ssl__stream/set_verify_mode.html +++ b/doc/html/boost_asio/reference/ssl__stream/set_verify_mode.html @@ -43,7 +43,7 @@ void
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ssl__stream/set_verify_mode/overload1.html b/doc/html/boost_asio/reference/ssl__stream/set_verify_mode/overload1.html index 4c8466274e..bb7ceb9928 100644 --- a/doc/html/boost_asio/reference/ssl__stream/set_verify_mode/overload1.html +++ b/doc/html/boost_asio/reference/ssl__stream/set_verify_mode/overload1.html @@ -75,7 +75,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ssl__stream/set_verify_mode/overload2.html b/doc/html/boost_asio/reference/ssl__stream/set_verify_mode/overload2.html index 711764cf8d..87ac3d5299 100644 --- a/doc/html/boost_asio/reference/ssl__stream/set_verify_mode/overload2.html +++ b/doc/html/boost_asio/reference/ssl__stream/set_verify_mode/overload2.html @@ -67,7 +67,7 @@
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ssl__stream/shutdown.html b/doc/html/boost_asio/reference/ssl__stream/shutdown.html index ae852d1348..c9e19d2091 100644 --- a/doc/html/boost_asio/reference/ssl__stream/shutdown.html +++ b/doc/html/boost_asio/reference/ssl__stream/shutdown.html @@ -41,7 +41,7 @@ void
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ssl__stream/shutdown/overload1.html b/doc/html/boost_asio/reference/ssl__stream/shutdown/overload1.html index 1eb7e42071..10f43be194 100644 --- a/doc/html/boost_asio/reference/ssl__stream/shutdown/overload1.html +++ b/doc/html/boost_asio/reference/ssl__stream/shutdown/overload1.html @@ -52,7 +52,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ssl__stream/shutdown/overload2.html b/doc/html/boost_asio/reference/ssl__stream/shutdown/overload2.html index 2fc0ac836f..0bdbed8531 100644 --- a/doc/html/boost_asio/reference/ssl__stream/shutdown/overload2.html +++ b/doc/html/boost_asio/reference/ssl__stream/shutdown/overload2.html @@ -53,7 +53,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ssl__stream/stream.html b/doc/html/boost_asio/reference/ssl__stream/stream.html index 5c26557424..1996aa6bdb 100644 --- a/doc/html/boost_asio/reference/ssl__stream/stream.html +++ b/doc/html/boost_asio/reference/ssl__stream/stream.html @@ -60,7 +60,7 @@ stream(
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ssl__stream/write_some.html b/doc/html/boost_asio/reference/ssl__stream/write_some.html index 36978cfddb..973a85da82 100644 --- a/doc/html/boost_asio/reference/ssl__stream/write_some.html +++ b/doc/html/boost_asio/reference/ssl__stream/write_some.html @@ -47,7 +47,7 @@ std::size_t
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ssl__stream/write_some/overload1.html b/doc/html/boost_asio/reference/ssl__stream/write_some/overload1.html index ff8d44b3e9..855ae6a9aa 100644 --- a/doc/html/boost_asio/reference/ssl__stream/write_some/overload1.html +++ b/doc/html/boost_asio/reference/ssl__stream/write_some/overload1.html @@ -87,7 +87,7 @@ std::size_t write_some(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ssl__stream/write_some/overload2.html b/doc/html/boost_asio/reference/ssl__stream/write_some/overload2.html index 822a5c2bd4..d0f7fbfc73 100644 --- a/doc/html/boost_asio/reference/ssl__stream/write_some/overload2.html +++ b/doc/html/boost_asio/reference/ssl__stream/write_some/overload2.html @@ -79,7 +79,7 @@ std::size_t write_some(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ssl__stream__impl_struct.html b/doc/html/boost_asio/reference/ssl__stream__impl_struct.html index b423cd8738..a3214c019b 100644 --- a/doc/html/boost_asio/reference/ssl__stream__impl_struct.html +++ b/doc/html/boost_asio/reference/ssl__stream__impl_struct.html @@ -76,7 +76,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ssl__stream__impl_struct/ssl.html b/doc/html/boost_asio/reference/ssl__stream__impl_struct/ssl.html index babfc81390..0cb2073e63 100644 --- a/doc/html/boost_asio/reference/ssl__stream__impl_struct/ssl.html +++ b/doc/html/boost_asio/reference/ssl__stream__impl_struct/ssl.html @@ -34,7 +34,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ssl__stream_base.html b/doc/html/boost_asio/reference/ssl__stream_base.html index 14938bf090..d3f31bbf7e 100644 --- a/doc/html/boost_asio/reference/ssl__stream_base.html +++ b/doc/html/boost_asio/reference/ssl__stream_base.html @@ -115,7 +115,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ssl__stream_base/_stream_base.html b/doc/html/boost_asio/reference/ssl__stream_base/_stream_base.html index 2daea2dd4b..da8c911c5d 100644 --- a/doc/html/boost_asio/reference/ssl__stream_base/_stream_base.html +++ b/doc/html/boost_asio/reference/ssl__stream_base/_stream_base.html @@ -36,7 +36,7 @@ Protected
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ssl__stream_base/handshake_type.html b/doc/html/boost_asio/reference/ssl__stream_base/handshake_type.html index ec15aaaf7d..c6fa8b8f94 100644 --- a/doc/html/boost_asio/reference/ssl__stream_base/handshake_type.html +++ b/doc/html/boost_asio/reference/ssl__stream_base/handshake_type.html @@ -57,7 +57,7 @@ Different
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ssl__verify_client_once.html b/doc/html/boost_asio/reference/ssl__verify_client_once.html index 43446aeb0c..1671150387 100644 --- a/doc/html/boost_asio/reference/ssl__verify_client_once.html +++ b/doc/html/boost_asio/reference/ssl__verify_client_once.html @@ -47,7 +47,7 @@ Do not
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ssl__verify_context.html b/doc/html/boost_asio/reference/ssl__verify_context.html index 96db8c1b07..363a99caf7 100644 --- a/doc/html/boost_asio/reference/ssl__verify_context.html +++ b/doc/html/boost_asio/reference/ssl__verify_context.html @@ -137,7 +137,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ssl__verify_context/native_handle.html b/doc/html/boost_asio/reference/ssl__verify_context/native_handle.html index 05e8165773..c38be7a559 100644 --- a/doc/html/boost_asio/reference/ssl__verify_context/native_handle.html +++ b/doc/html/boost_asio/reference/ssl__verify_context/native_handle.html @@ -41,7 +41,7 @@ Get
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ssl__verify_context/native_handle_type.html b/doc/html/boost_asio/reference/ssl__verify_context/native_handle_type.html index efe96279b2..08b88046d2 100644 --- a/doc/html/boost_asio/reference/ssl__verify_context/native_handle_type.html +++ b/doc/html/boost_asio/reference/ssl__verify_context/native_handle_type.html @@ -46,7 +46,7 @@ The
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ssl__verify_context/verify_context.html b/doc/html/boost_asio/reference/ssl__verify_context/verify_context.html index 89e0cdef54..a7423cb126 100644 --- a/doc/html/boost_asio/reference/ssl__verify_context/verify_context.html +++ b/doc/html/boost_asio/reference/ssl__verify_context/verify_context.html @@ -36,7 +36,7 @@ Constructor.
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ssl__verify_fail_if_no_peer_cert.html b/doc/html/boost_asio/reference/ssl__verify_fail_if_no_peer_cert.html index 282b8393d6..8ab12b996a 100644 --- a/doc/html/boost_asio/reference/ssl__verify_fail_if_no_peer_cert.html +++ b/doc/html/boost_asio/reference/ssl__verify_fail_if_no_peer_cert.html @@ -47,7 +47,7 @@ Fail
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ssl__verify_mode.html b/doc/html/boost_asio/reference/ssl__verify_mode.html index 436b8d6e89..946169b63f 100644 --- a/doc/html/boost_asio/reference/ssl__verify_mode.html +++ b/doc/html/boost_asio/reference/ssl__verify_mode.html @@ -63,7 +63,7 @@ Bitmask type for peer
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ssl__verify_none.html b/doc/html/boost_asio/reference/ssl__verify_none.html index 2d0c8c39c6..afe52fe3dc 100644 --- a/doc/html/boost_asio/reference/ssl__verify_none.html +++ b/doc/html/boost_asio/reference/ssl__verify_none.html @@ -45,7 +45,7 @@ No verification.
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/ssl__verify_peer.html b/doc/html/boost_asio/reference/ssl__verify_peer.html index 9e5fde4070..08a015b2ce 100644 --- a/doc/html/boost_asio/reference/ssl__verify_peer.html +++ b/doc/html/boost_asio/reference/ssl__verify_peer.html @@ -45,7 +45,7 @@ Verify the peer.
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/steady_timer.html b/doc/html/boost_asio/reference/steady_timer.html index b1e43a5998..e13c4bcc17 100644 --- a/doc/html/boost_asio/reference/steady_timer.html +++ b/doc/html/boost_asio/reference/steady_timer.html @@ -479,7 +479,7 @@ void on_timeout(const boost::system::error_code& e)
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/strand.html b/doc/html/boost_asio/reference/strand.html index 50e592c6df..da683dd4a9 100644 --- a/doc/html/boost_asio/reference/strand.html +++ b/doc/html/boost_asio/reference/strand.html @@ -309,7 +309,7 @@ class strand
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/strand/_strand.html b/doc/html/boost_asio/reference/strand/_strand.html index 7e0cff6efb..b30f142385 100644 --- a/doc/html/boost_asio/reference/strand/_strand.html +++ b/doc/html/boost_asio/reference/strand/_strand.html @@ -35,7 +35,7 @@ Destructor.
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/strand/context.html b/doc/html/boost_asio/reference/strand/context.html index 145573c44a..fc90bc00bd 100644 --- a/doc/html/boost_asio/reference/strand/context.html +++ b/doc/html/boost_asio/reference/strand/context.html @@ -36,7 +36,7 @@ Obtain the underlying execution
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/strand/defer.html b/doc/html/boost_asio/reference/strand/defer.html index 975ab9a4a8..1395933888 100644 --- a/doc/html/boost_asio/reference/strand/defer.html +++ b/doc/html/boost_asio/reference/strand/defer.html @@ -72,7 +72,7 @@ void defer(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/strand/dispatch.html b/doc/html/boost_asio/reference/strand/dispatch.html index 9bfdd571ec..a29d621492 100644 --- a/doc/html/boost_asio/reference/strand/dispatch.html +++ b/doc/html/boost_asio/reference/strand/dispatch.html @@ -74,7 +74,7 @@ void dispatch(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/strand/get_inner_executor.html b/doc/html/boost_asio/reference/strand/get_inner_executor.html index 86df34dd74..2eec6ae0ac 100644 --- a/doc/html/boost_asio/reference/strand/get_inner_executor.html +++ b/doc/html/boost_asio/reference/strand/get_inner_executor.html @@ -36,7 +36,7 @@ Obtain
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/strand/inner_executor_type.html b/doc/html/boost_asio/reference/strand/inner_executor_type.html index fe664523f0..c5c0b987c2 100644 --- a/doc/html/boost_asio/reference/strand/inner_executor_type.html +++ b/doc/html/boost_asio/reference/strand/inner_executor_type.html @@ -46,7 +46,7 @@ The
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/strand/on_work_finished.html b/doc/html/boost_asio/reference/strand/on_work_finished.html index 496f56c35f..098580b97c 100644 --- a/doc/html/boost_asio/reference/strand/on_work_finished.html +++ b/doc/html/boost_asio/reference/strand/on_work_finished.html @@ -39,7 +39,7 @@ Inform
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/strand/on_work_started.html b/doc/html/boost_asio/reference/strand/on_work_started.html index f56997b817..0e23ea6278 100644 --- a/doc/html/boost_asio/reference/strand/on_work_started.html +++ b/doc/html/boost_asio/reference/strand/on_work_started.html @@ -39,7 +39,7 @@ Inform
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/strand/operator_eq_.html b/doc/html/boost_asio/reference/strand/operator_eq_.html index dc97744d0b..3158658bc9 100644 --- a/doc/html/boost_asio/reference/strand/operator_eq_.html +++ b/doc/html/boost_asio/reference/strand/operator_eq_.html @@ -62,7 +62,7 @@ strand &
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/strand/operator_eq_/overload1.html b/doc/html/boost_asio/reference/strand/operator_eq_/overload1.html index c1dbf73677..8c00604ae2 100644 --- a/doc/html/boost_asio/reference/strand/operator_eq_/overload1.html +++ b/doc/html/boost_asio/reference/strand/operator_eq_/overload1.html @@ -36,7 +36,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/strand/operator_eq_/overload2.html b/doc/html/boost_asio/reference/strand/operator_eq_/overload2.html index 0ca462d68a..129a2675ee 100644 --- a/doc/html/boost_asio/reference/strand/operator_eq_/overload2.html +++ b/doc/html/boost_asio/reference/strand/operator_eq_/overload2.html @@ -42,7 +42,7 @@ strand & operator=(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/strand/operator_eq_/overload3.html b/doc/html/boost_asio/reference/strand/operator_eq_/overload3.html index bb61e327ae..602b963350 100644 --- a/doc/html/boost_asio/reference/strand/operator_eq_/overload3.html +++ b/doc/html/boost_asio/reference/strand/operator_eq_/overload3.html @@ -36,7 +36,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/strand/operator_eq_/overload4.html b/doc/html/boost_asio/reference/strand/operator_eq_/overload4.html index 73a7b39176..599bdbf2c7 100644 --- a/doc/html/boost_asio/reference/strand/operator_eq_/overload4.html +++ b/doc/html/boost_asio/reference/strand/operator_eq_/overload4.html @@ -42,7 +42,7 @@ strand & operator=(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/strand/operator_eq__eq_.html b/doc/html/boost_asio/reference/strand/operator_eq__eq_.html index 20a6971e7b..72655520b7 100644 --- a/doc/html/boost_asio/reference/strand/operator_eq__eq_.html +++ b/doc/html/boost_asio/reference/strand/operator_eq__eq_.html @@ -52,7 +52,7 @@ Compare two
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/strand/operator_not__eq_.html b/doc/html/boost_asio/reference/strand/operator_not__eq_.html index 18bc214d46..fe70f55ba6 100644 --- a/doc/html/boost_asio/reference/strand/operator_not__eq_.html +++ b/doc/html/boost_asio/reference/strand/operator_not__eq_.html @@ -52,7 +52,7 @@ Compare two
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/strand/post.html b/doc/html/boost_asio/reference/strand/post.html index 46c949b404..87a10bbf0e 100644 --- a/doc/html/boost_asio/reference/strand/post.html +++ b/doc/html/boost_asio/reference/strand/post.html @@ -72,7 +72,7 @@ void post(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/strand/running_in_this_thread.html b/doc/html/boost_asio/reference/strand/running_in_this_thread.html index 7ec1d4abfd..59d79694cd 100644 --- a/doc/html/boost_asio/reference/strand/running_in_this_thread.html +++ b/doc/html/boost_asio/reference/strand/running_in_this_thread.html @@ -46,7 +46,7 @@ Determine
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/strand/strand.html b/doc/html/boost_asio/reference/strand/strand.html index 3361751b86..2b2d6c4c6d 100644 --- a/doc/html/boost_asio/reference/strand/strand.html +++ b/doc/html/boost_asio/reference/strand/strand.html @@ -75,7 +75,7 @@ Default constructor.
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/strand/strand/overload1.html b/doc/html/boost_asio/reference/strand/strand/overload1.html index 12963fc6a8..6a9b4a81f9 100644 --- a/doc/html/boost_asio/reference/strand/strand/overload1.html +++ b/doc/html/boost_asio/reference/strand/strand/overload1.html @@ -39,7 +39,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/strand/strand/overload2.html b/doc/html/boost_asio/reference/strand/strand/overload2.html index 42b765fc3a..df8fde8dac 100644 --- a/doc/html/boost_asio/reference/strand/strand/overload2.html +++ b/doc/html/boost_asio/reference/strand/strand/overload2.html @@ -36,7 +36,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/strand/strand/overload3.html b/doc/html/boost_asio/reference/strand/strand/overload3.html index d852bd124b..b006c95a1e 100644 --- a/doc/html/boost_asio/reference/strand/strand/overload3.html +++ b/doc/html/boost_asio/reference/strand/strand/overload3.html @@ -36,7 +36,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/strand/strand/overload4.html b/doc/html/boost_asio/reference/strand/strand/overload4.html index 653b6f3d8f..cbdec548cf 100644 --- a/doc/html/boost_asio/reference/strand/strand/overload4.html +++ b/doc/html/boost_asio/reference/strand/strand/overload4.html @@ -42,7 +42,7 @@ strand(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/strand/strand/overload5.html b/doc/html/boost_asio/reference/strand/strand/overload5.html index 90e6d3ac2c..ba855df0ea 100644 --- a/doc/html/boost_asio/reference/strand/strand/overload5.html +++ b/doc/html/boost_asio/reference/strand/strand/overload5.html @@ -36,7 +36,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/strand/strand/overload6.html b/doc/html/boost_asio/reference/strand/strand/overload6.html index 8fac259a76..2ad167cdf1 100644 --- a/doc/html/boost_asio/reference/strand/strand/overload6.html +++ b/doc/html/boost_asio/reference/strand/strand/overload6.html @@ -42,7 +42,7 @@ strand(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/streambuf.html b/doc/html/boost_asio/reference/streambuf.html index f6d0ad487d..7b8b290c7f 100644 --- a/doc/html/boost_asio/reference/streambuf.html +++ b/doc/html/boost_asio/reference/streambuf.html @@ -355,7 +355,7 @@ is >> s;
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/synchronous_socket_operations.html b/doc/html/boost_asio/reference/synchronous_socket_operations.html index c2dc90cbeb..1ecaa9270b 100644 --- a/doc/html/boost_asio/reference/synchronous_socket_operations.html +++ b/doc/html/boost_asio/reference/synchronous_socket_operations.html @@ -69,7 +69,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/system_context.html b/doc/html/boost_asio/reference/system_context.html index 1f37c8d249..c6a5ed4c40 100644 --- a/doc/html/boost_asio/reference/system_context.html +++ b/doc/html/boost_asio/reference/system_context.html @@ -311,7 +311,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/system_context/_system_context.html b/doc/html/boost_asio/reference/system_context/_system_context.html index 0d0ed8aa11..2cdf9e1675 100644 --- a/doc/html/boost_asio/reference/system_context/_system_context.html +++ b/doc/html/boost_asio/reference/system_context/_system_context.html @@ -36,7 +36,7 @@ Destructor
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/system_context/add_service.html b/doc/html/boost_asio/reference/system_context/add_service.html index f0c2e350d3..97d5a56fce 100644 --- a/doc/html/boost_asio/reference/system_context/add_service.html +++ b/doc/html/boost_asio/reference/system_context/add_service.html @@ -103,7 +103,7 @@ friend void add_service(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/system_context/destroy.html b/doc/html/boost_asio/reference/system_context/destroy.html index bcc6c00cdb..b9fe1808c2 100644 --- a/doc/html/boost_asio/reference/system_context/destroy.html +++ b/doc/html/boost_asio/reference/system_context/destroy.html @@ -47,7 +47,7 @@ Destroys
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/system_context/executor_type.html b/doc/html/boost_asio/reference/system_context/executor_type.html index a31bb74a8c..17bc5638db 100644 --- a/doc/html/boost_asio/reference/system_context/executor_type.html +++ b/doc/html/boost_asio/reference/system_context/executor_type.html @@ -197,7 +197,7 @@ The
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/system_context/fork_event.html b/doc/html/boost_asio/reference/system_context/fork_event.html index 9ea83b968e..515f3f49b3 100644 --- a/doc/html/boost_asio/reference/system_context/fork_event.html +++ b/doc/html/boost_asio/reference/system_context/fork_event.html @@ -65,7 +65,7 @@ Fork-related
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/system_context/get_executor.html b/doc/html/boost_asio/reference/system_context/get_executor.html index 367e4eedb3..df912c65af 100644 --- a/doc/html/boost_asio/reference/system_context/get_executor.html +++ b/doc/html/boost_asio/reference/system_context/get_executor.html @@ -36,7 +36,7 @@ Obtain
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/system_context/has_service.html b/doc/html/boost_asio/reference/system_context/has_service.html index e98da81049..87e767ecca 100644 --- a/doc/html/boost_asio/reference/system_context/has_service.html +++ b/doc/html/boost_asio/reference/system_context/has_service.html @@ -80,7 +80,7 @@ friend bool has_service(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/system_context/join.html b/doc/html/boost_asio/reference/system_context/join.html index e3b0991b42..fce08903a6 100644 --- a/doc/html/boost_asio/reference/system_context/join.html +++ b/doc/html/boost_asio/reference/system_context/join.html @@ -36,7 +36,7 @@ Join all threads
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/system_context/make_service.html b/doc/html/boost_asio/reference/system_context/make_service.html index f7dc250703..998b6e2dbb 100644 --- a/doc/html/boost_asio/reference/system_context/make_service.html +++ b/doc/html/boost_asio/reference/system_context/make_service.html @@ -89,7 +89,7 @@ friend Service & make_service(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/system_context/notify_fork.html b/doc/html/boost_asio/reference/system_context/notify_fork.html index ffff73c564..6429d2c9b7 100644 --- a/doc/html/boost_asio/reference/system_context/notify_fork.html +++ b/doc/html/boost_asio/reference/system_context/notify_fork.html @@ -114,7 +114,7 @@ else
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/system_context/shutdown.html b/doc/html/boost_asio/reference/system_context/shutdown.html index 884696e9f8..d27844ed6d 100644 --- a/doc/html/boost_asio/reference/system_context/shutdown.html +++ b/doc/html/boost_asio/reference/system_context/shutdown.html @@ -47,7 +47,7 @@ Shuts
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/system_context/stop.html b/doc/html/boost_asio/reference/system_context/stop.html index 6874fb96ac..092c58c693 100644 --- a/doc/html/boost_asio/reference/system_context/stop.html +++ b/doc/html/boost_asio/reference/system_context/stop.html @@ -36,7 +36,7 @@ Signal all threads
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/system_context/stopped.html b/doc/html/boost_asio/reference/system_context/stopped.html index 12392bc805..2adecd27b8 100644 --- a/doc/html/boost_asio/reference/system_context/stopped.html +++ b/doc/html/boost_asio/reference/system_context/stopped.html @@ -36,7 +36,7 @@ Determine
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/system_context/use_service.html b/doc/html/boost_asio/reference/system_context/use_service.html index 1c864acf4a..ae6f0b3f17 100644 --- a/doc/html/boost_asio/reference/system_context/use_service.html +++ b/doc/html/boost_asio/reference/system_context/use_service.html @@ -46,7 +46,7 @@ friend Service &
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/system_context/use_service/overload1.html b/doc/html/boost_asio/reference/system_context/use_service/overload1.html index 7562c965eb..0d42aac050 100644 --- a/doc/html/boost_asio/reference/system_context/use_service/overload1.html +++ b/doc/html/boost_asio/reference/system_context/use_service/overload1.html @@ -80,7 +80,7 @@ friend Service & use_service(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/system_context/use_service/overload2.html b/doc/html/boost_asio/reference/system_context/use_service/overload2.html index ca79068a48..0f62962597 100644 --- a/doc/html/boost_asio/reference/system_context/use_service/overload2.html +++ b/doc/html/boost_asio/reference/system_context/use_service/overload2.html @@ -88,7 +88,7 @@ friend Service & use_service(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/system_executor.html b/doc/html/boost_asio/reference/system_executor.html index 947c20933e..1ada55ccc3 100644 --- a/doc/html/boost_asio/reference/system_executor.html +++ b/doc/html/boost_asio/reference/system_executor.html @@ -194,7 +194,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/system_executor/context.html b/doc/html/boost_asio/reference/system_executor/context.html index 64e9c64c43..203534cb78 100644 --- a/doc/html/boost_asio/reference/system_executor/context.html +++ b/doc/html/boost_asio/reference/system_executor/context.html @@ -36,7 +36,7 @@ Obtain
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/system_executor/defer.html b/doc/html/boost_asio/reference/system_executor/defer.html index 2a37e8759b..52d29db1c4 100644 --- a/doc/html/boost_asio/reference/system_executor/defer.html +++ b/doc/html/boost_asio/reference/system_executor/defer.html @@ -72,7 +72,7 @@ void defer(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/system_executor/dispatch.html b/doc/html/boost_asio/reference/system_executor/dispatch.html index a56adc4c27..363c63705e 100644 --- a/doc/html/boost_asio/reference/system_executor/dispatch.html +++ b/doc/html/boost_asio/reference/system_executor/dispatch.html @@ -71,7 +71,7 @@ void dispatch(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/system_executor/on_work_finished.html b/doc/html/boost_asio/reference/system_executor/on_work_finished.html index 2210cd5ea0..8cc5aa1960 100644 --- a/doc/html/boost_asio/reference/system_executor/on_work_finished.html +++ b/doc/html/boost_asio/reference/system_executor/on_work_finished.html @@ -39,7 +39,7 @@ Inform
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/system_executor/on_work_started.html b/doc/html/boost_asio/reference/system_executor/on_work_started.html index 1534e73cd2..8d7309c9bd 100644 --- a/doc/html/boost_asio/reference/system_executor/on_work_started.html +++ b/doc/html/boost_asio/reference/system_executor/on_work_started.html @@ -39,7 +39,7 @@ Inform
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/system_executor/operator_eq__eq_.html b/doc/html/boost_asio/reference/system_executor/operator_eq__eq_.html index 80240f426e..5015a5684f 100644 --- a/doc/html/boost_asio/reference/system_executor/operator_eq__eq_.html +++ b/doc/html/boost_asio/reference/system_executor/operator_eq__eq_.html @@ -51,7 +51,7 @@ Compare
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/system_executor/operator_not__eq_.html b/doc/html/boost_asio/reference/system_executor/operator_not__eq_.html index cfcc971056..d4d2567763 100644 --- a/doc/html/boost_asio/reference/system_executor/operator_not__eq_.html +++ b/doc/html/boost_asio/reference/system_executor/operator_not__eq_.html @@ -51,7 +51,7 @@ Compare
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/system_executor/post.html b/doc/html/boost_asio/reference/system_executor/post.html index 9845ae1594..080704ed4a 100644 --- a/doc/html/boost_asio/reference/system_executor/post.html +++ b/doc/html/boost_asio/reference/system_executor/post.html @@ -72,7 +72,7 @@ void post(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/system_timer.html b/doc/html/boost_asio/reference/system_timer.html index f248e8eaf1..9cfb084c69 100644 --- a/doc/html/boost_asio/reference/system_timer.html +++ b/doc/html/boost_asio/reference/system_timer.html @@ -479,7 +479,7 @@ void on_timeout(const boost::system::error_code& e)
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/thread_pool.html b/doc/html/boost_asio/reference/thread_pool.html index e960e81ceb..9208d8ea91 100644 --- a/doc/html/boost_asio/reference/thread_pool.html +++ b/doc/html/boost_asio/reference/thread_pool.html @@ -357,7 +357,7 @@ pool.join();
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/thread_pool/_thread_pool.html b/doc/html/boost_asio/reference/thread_pool/_thread_pool.html index c611a18806..2ab1de633e 100644 --- a/doc/html/boost_asio/reference/thread_pool/_thread_pool.html +++ b/doc/html/boost_asio/reference/thread_pool/_thread_pool.html @@ -38,7 +38,7 @@ Destructor.
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/thread_pool/add_service.html b/doc/html/boost_asio/reference/thread_pool/add_service.html index cbe46459a7..add4fb14cc 100644 --- a/doc/html/boost_asio/reference/thread_pool/add_service.html +++ b/doc/html/boost_asio/reference/thread_pool/add_service.html @@ -103,7 +103,7 @@ friend void add_service(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/thread_pool/destroy.html b/doc/html/boost_asio/reference/thread_pool/destroy.html index d49c7bb8fd..8d1c153114 100644 --- a/doc/html/boost_asio/reference/thread_pool/destroy.html +++ b/doc/html/boost_asio/reference/thread_pool/destroy.html @@ -47,7 +47,7 @@ Destroys all
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/thread_pool/fork_event.html b/doc/html/boost_asio/reference/thread_pool/fork_event.html index fb2ffa87bf..989c26bbf4 100644 --- a/doc/html/boost_asio/reference/thread_pool/fork_event.html +++ b/doc/html/boost_asio/reference/thread_pool/fork_event.html @@ -65,7 +65,7 @@ Fork-related
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/thread_pool/get_executor.html b/doc/html/boost_asio/reference/thread_pool/get_executor.html index 0deabe683b..02b424675d 100644 --- a/doc/html/boost_asio/reference/thread_pool/get_executor.html +++ b/doc/html/boost_asio/reference/thread_pool/get_executor.html @@ -36,7 +36,7 @@ Obtains
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/thread_pool/has_service.html b/doc/html/boost_asio/reference/thread_pool/has_service.html index 4a47ae26e1..6733a12ccd 100644 --- a/doc/html/boost_asio/reference/thread_pool/has_service.html +++ b/doc/html/boost_asio/reference/thread_pool/has_service.html @@ -80,7 +80,7 @@ friend bool has_service(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/thread_pool/join.html b/doc/html/boost_asio/reference/thread_pool/join.html index 53b1b15207..236fb99b8b 100644 --- a/doc/html/boost_asio/reference/thread_pool/join.html +++ b/doc/html/boost_asio/reference/thread_pool/join.html @@ -40,7 +40,7 @@ Joins the threads.
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/thread_pool/make_service.html b/doc/html/boost_asio/reference/thread_pool/make_service.html index cedbd85a49..a253553aee 100644 --- a/doc/html/boost_asio/reference/thread_pool/make_service.html +++ b/doc/html/boost_asio/reference/thread_pool/make_service.html @@ -89,7 +89,7 @@ friend Service & make_service(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/thread_pool/notify_fork.html b/doc/html/boost_asio/reference/thread_pool/notify_fork.html index 1683ac5c14..41752ca276 100644 --- a/doc/html/boost_asio/reference/thread_pool/notify_fork.html +++ b/doc/html/boost_asio/reference/thread_pool/notify_fork.html @@ -114,7 +114,7 @@ else
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/thread_pool/shutdown.html b/doc/html/boost_asio/reference/thread_pool/shutdown.html index 406ef451c5..256c2c1515 100644 --- a/doc/html/boost_asio/reference/thread_pool/shutdown.html +++ b/doc/html/boost_asio/reference/thread_pool/shutdown.html @@ -47,7 +47,7 @@ Shuts down
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/thread_pool/stop.html b/doc/html/boost_asio/reference/thread_pool/stop.html index 01cc67622b..ced33a1bf5 100644 --- a/doc/html/boost_asio/reference/thread_pool/stop.html +++ b/doc/html/boost_asio/reference/thread_pool/stop.html @@ -39,7 +39,7 @@ Stops the threads.
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/thread_pool/thread_pool.html b/doc/html/boost_asio/reference/thread_pool/thread_pool.html index 6503293a55..ba4a9e9b0b 100644 --- a/doc/html/boost_asio/reference/thread_pool/thread_pool.html +++ b/doc/html/boost_asio/reference/thread_pool/thread_pool.html @@ -44,7 +44,7 @@ Constructs
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/thread_pool/thread_pool/overload1.html b/doc/html/boost_asio/reference/thread_pool/thread_pool/overload1.html index 34dffc1d24..652eaa7e4c 100644 --- a/doc/html/boost_asio/reference/thread_pool/thread_pool/overload1.html +++ b/doc/html/boost_asio/reference/thread_pool/thread_pool/overload1.html @@ -35,7 +35,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/thread_pool/thread_pool/overload2.html b/doc/html/boost_asio/reference/thread_pool/thread_pool/overload2.html index 4042ee8221..febac09d29 100644 --- a/doc/html/boost_asio/reference/thread_pool/thread_pool/overload2.html +++ b/doc/html/boost_asio/reference/thread_pool/thread_pool/overload2.html @@ -36,7 +36,7 @@
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/thread_pool/use_service.html b/doc/html/boost_asio/reference/thread_pool/use_service.html index 5fba572c6f..01e4d91ec2 100644 --- a/doc/html/boost_asio/reference/thread_pool/use_service.html +++ b/doc/html/boost_asio/reference/thread_pool/use_service.html @@ -46,7 +46,7 @@ friend Service &
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/thread_pool/use_service/overload1.html b/doc/html/boost_asio/reference/thread_pool/use_service/overload1.html index 1346781ace..dc3e61be1b 100644 --- a/doc/html/boost_asio/reference/thread_pool/use_service/overload1.html +++ b/doc/html/boost_asio/reference/thread_pool/use_service/overload1.html @@ -80,7 +80,7 @@ friend Service & use_service(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/thread_pool/use_service/overload2.html b/doc/html/boost_asio/reference/thread_pool/use_service/overload2.html index 599f2a28cd..ba101d1049 100644 --- a/doc/html/boost_asio/reference/thread_pool/use_service/overload2.html +++ b/doc/html/boost_asio/reference/thread_pool/use_service/overload2.html @@ -88,7 +88,7 @@ friend Service & use_service(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/thread_pool__executor_type.html b/doc/html/boost_asio/reference/thread_pool__executor_type.html index cdd6cfcaf0..6f798d703d 100644 --- a/doc/html/boost_asio/reference/thread_pool__executor_type.html +++ b/doc/html/boost_asio/reference/thread_pool__executor_type.html @@ -201,7 +201,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/thread_pool__executor_type/context.html b/doc/html/boost_asio/reference/thread_pool__executor_type/context.html index a9f5e145d4..f1ff2bea08 100644 --- a/doc/html/boost_asio/reference/thread_pool__executor_type/context.html +++ b/doc/html/boost_asio/reference/thread_pool__executor_type/context.html @@ -36,7 +36,7 @@ Obtain
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/thread_pool__executor_type/defer.html b/doc/html/boost_asio/reference/thread_pool__executor_type/defer.html index 8eb7d5ffe9..f2eee10450 100644 --- a/doc/html/boost_asio/reference/thread_pool__executor_type/defer.html +++ b/doc/html/boost_asio/reference/thread_pool__executor_type/defer.html @@ -77,7 +77,7 @@ void defer(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/thread_pool__executor_type/dispatch.html b/doc/html/boost_asio/reference/thread_pool__executor_type/dispatch.html index dd90418d63..05e44e8074 100644 --- a/doc/html/boost_asio/reference/thread_pool__executor_type/dispatch.html +++ b/doc/html/boost_asio/reference/thread_pool__executor_type/dispatch.html @@ -73,7 +73,7 @@ void dispatch(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/thread_pool__executor_type/on_work_finished.html b/doc/html/boost_asio/reference/thread_pool__executor_type/on_work_finished.html index 77017a7407..eea4800529 100644 --- a/doc/html/boost_asio/reference/thread_pool__executor_type/on_work_finished.html +++ b/doc/html/boost_asio/reference/thread_pool__executor_type/on_work_finished.html @@ -41,7 +41,7 @@ Inform
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/thread_pool__executor_type/on_work_started.html b/doc/html/boost_asio/reference/thread_pool__executor_type/on_work_started.html index 2530b560c2..43ec100c5c 100644 --- a/doc/html/boost_asio/reference/thread_pool__executor_type/on_work_started.html +++ b/doc/html/boost_asio/reference/thread_pool__executor_type/on_work_started.html @@ -41,7 +41,7 @@ Inform
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/thread_pool__executor_type/operator_eq__eq_.html b/doc/html/boost_asio/reference/thread_pool__executor_type/operator_eq__eq_.html index 09a20e94a8..2c79e7c972 100644 --- a/doc/html/boost_asio/reference/thread_pool__executor_type/operator_eq__eq_.html +++ b/doc/html/boost_asio/reference/thread_pool__executor_type/operator_eq__eq_.html @@ -51,7 +51,7 @@ Compare
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/thread_pool__executor_type/operator_not__eq_.html b/doc/html/boost_asio/reference/thread_pool__executor_type/operator_not__eq_.html index 7bca84de79..ab422c590a 100644 --- a/doc/html/boost_asio/reference/thread_pool__executor_type/operator_not__eq_.html +++ b/doc/html/boost_asio/reference/thread_pool__executor_type/operator_not__eq_.html @@ -51,7 +51,7 @@ Compare
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/thread_pool__executor_type/post.html b/doc/html/boost_asio/reference/thread_pool__executor_type/post.html index f2e2c5c8f4..6b4815268d 100644 --- a/doc/html/boost_asio/reference/thread_pool__executor_type/post.html +++ b/doc/html/boost_asio/reference/thread_pool__executor_type/post.html @@ -72,7 +72,7 @@ void post(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/thread_pool__executor_type/running_in_this_thread.html b/doc/html/boost_asio/reference/thread_pool__executor_type/running_in_this_thread.html index 661879ca97..580b1d6502 100644 --- a/doc/html/boost_asio/reference/thread_pool__executor_type/running_in_this_thread.html +++ b/doc/html/boost_asio/reference/thread_pool__executor_type/running_in_this_thread.html @@ -45,7 +45,7 @@ Determine
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/time_traits_lt__ptime__gt_.html b/doc/html/boost_asio/reference/time_traits_lt__ptime__gt_.html index ad02f36aa5..8e708f6791 100644 --- a/doc/html/boost_asio/reference/time_traits_lt__ptime__gt_.html +++ b/doc/html/boost_asio/reference/time_traits_lt__ptime__gt_.html @@ -179,7 +179,7 @@ struct time_traits< boost::posix_time::ptime >
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/time_traits_lt__ptime__gt_/add.html b/doc/html/boost_asio/reference/time_traits_lt__ptime__gt_/add.html index 7e6f020c15..772b7d135b 100644 --- a/doc/html/boost_asio/reference/time_traits_lt__ptime__gt_/add.html +++ b/doc/html/boost_asio/reference/time_traits_lt__ptime__gt_/add.html @@ -38,7 +38,7 @@ Add a duration to a time.
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/time_traits_lt__ptime__gt_/duration_type.html b/doc/html/boost_asio/reference/time_traits_lt__ptime__gt_/duration_type.html index fdd8ac3024..c15f578a05 100644 --- a/doc/html/boost_asio/reference/time_traits_lt__ptime__gt_/duration_type.html +++ b/doc/html/boost_asio/reference/time_traits_lt__ptime__gt_/duration_type.html @@ -46,7 +46,7 @@ The duration type.
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/time_traits_lt__ptime__gt_/less_than.html b/doc/html/boost_asio/reference/time_traits_lt__ptime__gt_/less_than.html index fc2bb293c9..c6d595ff92 100644 --- a/doc/html/boost_asio/reference/time_traits_lt__ptime__gt_/less_than.html +++ b/doc/html/boost_asio/reference/time_traits_lt__ptime__gt_/less_than.html @@ -38,7 +38,7 @@ Test whether one time is less than another.
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/time_traits_lt__ptime__gt_/now.html b/doc/html/boost_asio/reference/time_traits_lt__ptime__gt_/now.html index 229fa27dd0..0d3713228d 100644 --- a/doc/html/boost_asio/reference/time_traits_lt__ptime__gt_/now.html +++ b/doc/html/boost_asio/reference/time_traits_lt__ptime__gt_/now.html @@ -36,7 +36,7 @@ Get the current time.
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/time_traits_lt__ptime__gt_/subtract.html b/doc/html/boost_asio/reference/time_traits_lt__ptime__gt_/subtract.html index cef51f4566..6ffba3fe73 100644 --- a/doc/html/boost_asio/reference/time_traits_lt__ptime__gt_/subtract.html +++ b/doc/html/boost_asio/reference/time_traits_lt__ptime__gt_/subtract.html @@ -38,7 +38,7 @@ Subtract one time from another.
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/time_traits_lt__ptime__gt_/time_type.html b/doc/html/boost_asio/reference/time_traits_lt__ptime__gt_/time_type.html index 7b9bdaf9ea..d896835058 100644 --- a/doc/html/boost_asio/reference/time_traits_lt__ptime__gt_/time_type.html +++ b/doc/html/boost_asio/reference/time_traits_lt__ptime__gt_/time_type.html @@ -46,7 +46,7 @@ The time type.
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/time_traits_lt__ptime__gt_/to_posix_duration.html b/doc/html/boost_asio/reference/time_traits_lt__ptime__gt_/to_posix_duration.html index c67da0cb10..066b274b02 100644 --- a/doc/html/boost_asio/reference/time_traits_lt__ptime__gt_/to_posix_duration.html +++ b/doc/html/boost_asio/reference/time_traits_lt__ptime__gt_/to_posix_duration.html @@ -37,7 +37,7 @@ Convert to POSIX duration type.
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/transfer_all.html b/doc/html/boost_asio/reference/transfer_all.html index 08efe0db15..653a178db4 100644 --- a/doc/html/boost_asio/reference/transfer_all.html +++ b/doc/html/boost_asio/reference/transfer_all.html @@ -72,7 +72,7 @@ else
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/transfer_at_least.html b/doc/html/boost_asio/reference/transfer_at_least.html index c48f81eca4..ac96d345bb 100644 --- a/doc/html/boost_asio/reference/transfer_at_least.html +++ b/doc/html/boost_asio/reference/transfer_at_least.html @@ -74,7 +74,7 @@ else
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/transfer_exactly.html b/doc/html/boost_asio/reference/transfer_exactly.html index 31d2696262..823a24a20b 100644 --- a/doc/html/boost_asio/reference/transfer_exactly.html +++ b/doc/html/boost_asio/reference/transfer_exactly.html @@ -74,7 +74,7 @@ else
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/use_future.html b/doc/html/boost_asio/reference/use_future.html index 90db0b7739..32e80b2ff4 100644 --- a/doc/html/boost_asio/reference/use_future.html +++ b/doc/html/boost_asio/reference/use_future.html @@ -49,7 +49,7 @@ A special value, similar to std::nothrow.
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/use_future_t.html b/doc/html/boost_asio/reference/use_future_t.html index a55c72f84f..d57d94c0f7 100644 --- a/doc/html/boost_asio/reference/use_future_t.html +++ b/doc/html/boost_asio/reference/use_future_t.html @@ -185,7 +185,7 @@ class use_future_t
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/use_future_t/allocator_type.html b/doc/html/boost_asio/reference/use_future_t/allocator_type.html index 68e45f34bf..0561355218 100644 --- a/doc/html/boost_asio/reference/use_future_t/allocator_type.html +++ b/doc/html/boost_asio/reference/use_future_t/allocator_type.html @@ -47,7 +47,7 @@ The
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/use_future_t/get_allocator.html b/doc/html/boost_asio/reference/use_future_t/get_allocator.html index a0ea54cbeb..17d76bc42c 100644 --- a/doc/html/boost_asio/reference/use_future_t/get_allocator.html +++ b/doc/html/boost_asio/reference/use_future_t/get_allocator.html @@ -36,7 +36,7 @@ Obtain
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/use_future_t/operator_lb__rb_.html b/doc/html/boost_asio/reference/use_future_t/operator_lb__rb_.html index 600d08f838..815131bf56 100644 --- a/doc/html/boost_asio/reference/use_future_t/operator_lb__rb_.html +++ b/doc/html/boost_asio/reference/use_future_t/operator_lb__rb_.html @@ -39,7 +39,7 @@ use_future_t< OtherAllocator > operator[](
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/use_future_t/operator_lp__rp_.html b/doc/html/boost_asio/reference/use_future_t/operator_lp__rp_.html index d234bcc6e5..dc73ceba39 100644 --- a/doc/html/boost_asio/reference/use_future_t/operator_lp__rp_.html +++ b/doc/html/boost_asio/reference/use_future_t/operator_lp__rp_.html @@ -58,7 +58,7 @@ std::size_t n = fut.get();
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/use_future_t/rebind.html b/doc/html/boost_asio/reference/use_future_t/rebind.html index d6627d6105..55c2e97998 100644 --- a/doc/html/boost_asio/reference/use_future_t/rebind.html +++ b/doc/html/boost_asio/reference/use_future_t/rebind.html @@ -39,7 +39,7 @@ use_future_t< OtherAllocator > rebind(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/use_future_t/use_future_t.html b/doc/html/boost_asio/reference/use_future_t/use_future_t.html index 1ebd5064b4..17baea66fc 100644 --- a/doc/html/boost_asio/reference/use_future_t/use_future_t.html +++ b/doc/html/boost_asio/reference/use_future_t/use_future_t.html @@ -44,7 +44,7 @@ Construct
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/use_future_t/use_future_t/overload1.html b/doc/html/boost_asio/reference/use_future_t/use_future_t/overload1.html index b4080817b7..712e380b4b 100644 --- a/doc/html/boost_asio/reference/use_future_t/use_future_t/overload1.html +++ b/doc/html/boost_asio/reference/use_future_t/use_future_t/overload1.html @@ -35,7 +35,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/use_future_t/use_future_t/overload2.html b/doc/html/boost_asio/reference/use_future_t/use_future_t/overload2.html index dda78cf235..2c4e06b8bf 100644 --- a/doc/html/boost_asio/reference/use_future_t/use_future_t/overload2.html +++ b/doc/html/boost_asio/reference/use_future_t/use_future_t/overload2.html @@ -36,7 +36,7 @@
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/use_service.html b/doc/html/boost_asio/reference/use_service.html index b5662af09b..222a7f2094 100644 --- a/doc/html/boost_asio/reference/use_service.html +++ b/doc/html/boost_asio/reference/use_service.html @@ -54,7 +54,7 @@ Service &
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/use_service/overload1.html b/doc/html/boost_asio/reference/use_service/overload1.html index 9c1f0dcd6e..8d92953b0b 100644 --- a/doc/html/boost_asio/reference/use_service/overload1.html +++ b/doc/html/boost_asio/reference/use_service/overload1.html @@ -64,7 +64,7 @@ Service & use_service(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/use_service/overload2.html b/doc/html/boost_asio/reference/use_service/overload2.html index 6405d04b64..c6a017bb5a 100644 --- a/doc/html/boost_asio/reference/use_service/overload2.html +++ b/doc/html/boost_asio/reference/use_service/overload2.html @@ -72,7 +72,7 @@ Service & use_service(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/uses_executor.html b/doc/html/boost_asio/reference/uses_executor.html index 0d5f3a7822..5b251344fc 100644 --- a/doc/html/boost_asio/reference/uses_executor.html +++ b/doc/html/boost_asio/reference/uses_executor.html @@ -56,7 +56,7 @@ struct uses_executor
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/wait_traits.html b/doc/html/boost_asio/reference/wait_traits.html index c070a94ab6..9c5de9f893 100644 --- a/doc/html/boost_asio/reference/wait_traits.html +++ b/doc/html/boost_asio/reference/wait_traits.html @@ -82,7 +82,7 @@ struct wait_traits
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/wait_traits/to_wait_duration.html b/doc/html/boost_asio/reference/wait_traits/to_wait_duration.html index 93d020a80c..ca3d9e7657 100644 --- a/doc/html/boost_asio/reference/wait_traits/to_wait_duration.html +++ b/doc/html/boost_asio/reference/wait_traits/to_wait_duration.html @@ -42,7 +42,7 @@ static Clock::duration -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/wait_traits/to_wait_duration/overload1.html b/doc/html/boost_asio/reference/wait_traits/to_wait_duration/overload1.html index 5dfb2532c1..577dbe13a2 100644 --- a/doc/html/boost_asio/reference/wait_traits/to_wait_duration/overload1.html +++ b/doc/html/boost_asio/reference/wait_traits/to_wait_duration/overload1.html @@ -44,7 +44,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/wait_traits/to_wait_duration/overload2.html b/doc/html/boost_asio/reference/wait_traits/to_wait_duration/overload2.html index 8e45f6e15b..06fc68bd48 100644 --- a/doc/html/boost_asio/reference/wait_traits/to_wait_duration/overload2.html +++ b/doc/html/boost_asio/reference/wait_traits/to_wait_duration/overload2.html @@ -44,7 +44,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/windows__object_handle.html b/doc/html/boost_asio/reference/windows__object_handle.html index d646456879..0f76295d6c 100644 --- a/doc/html/boost_asio/reference/windows__object_handle.html +++ b/doc/html/boost_asio/reference/windows__object_handle.html @@ -311,7 +311,7 @@
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/windows__object_handle/assign.html b/doc/html/boost_asio/reference/windows__object_handle/assign.html index 03d56cdd22..c7d437110e 100644 --- a/doc/html/boost_asio/reference/windows__object_handle/assign.html +++ b/doc/html/boost_asio/reference/windows__object_handle/assign.html @@ -43,7 +43,7 @@ void
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/windows__object_handle/assign/overload1.html b/doc/html/boost_asio/reference/windows__object_handle/assign/overload1.html index 3d17e8fea4..25c7ad1d4f 100644 --- a/doc/html/boost_asio/reference/windows__object_handle/assign/overload1.html +++ b/doc/html/boost_asio/reference/windows__object_handle/assign/overload1.html @@ -36,7 +36,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/windows__object_handle/assign/overload2.html b/doc/html/boost_asio/reference/windows__object_handle/assign/overload2.html index 133ab7b424..c8ec8fa7cc 100644 --- a/doc/html/boost_asio/reference/windows__object_handle/assign/overload2.html +++ b/doc/html/boost_asio/reference/windows__object_handle/assign/overload2.html @@ -37,7 +37,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/windows__object_handle/async_wait.html b/doc/html/boost_asio/reference/windows__object_handle/async_wait.html index c35472adc8..3b113a0cd1 100644 --- a/doc/html/boost_asio/reference/windows__object_handle/async_wait.html +++ b/doc/html/boost_asio/reference/windows__object_handle/async_wait.html @@ -70,7 +70,7 @@ Start
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/windows__object_handle/cancel.html b/doc/html/boost_asio/reference/windows__object_handle/cancel.html index b5ba5396dc..48d359318c 100644 --- a/doc/html/boost_asio/reference/windows__object_handle/cancel.html +++ b/doc/html/boost_asio/reference/windows__object_handle/cancel.html @@ -41,7 +41,7 @@ void
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/windows__object_handle/cancel/overload1.html b/doc/html/boost_asio/reference/windows__object_handle/cancel/overload1.html index 6d05b2dde0..570eabdc4e 100644 --- a/doc/html/boost_asio/reference/windows__object_handle/cancel/overload1.html +++ b/doc/html/boost_asio/reference/windows__object_handle/cancel/overload1.html @@ -53,7 +53,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/windows__object_handle/cancel/overload2.html b/doc/html/boost_asio/reference/windows__object_handle/cancel/overload2.html index 7365832449..f4f5a148a7 100644 --- a/doc/html/boost_asio/reference/windows__object_handle/cancel/overload2.html +++ b/doc/html/boost_asio/reference/windows__object_handle/cancel/overload2.html @@ -54,7 +54,7 @@
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/windows__object_handle/close.html b/doc/html/boost_asio/reference/windows__object_handle/close.html index 18b06df3fe..1162f854f7 100644 --- a/doc/html/boost_asio/reference/windows__object_handle/close.html +++ b/doc/html/boost_asio/reference/windows__object_handle/close.html @@ -41,7 +41,7 @@ void
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/windows__object_handle/close/overload1.html b/doc/html/boost_asio/reference/windows__object_handle/close/overload1.html index d9dd7c0bca..16f8a1b0ab 100644 --- a/doc/html/boost_asio/reference/windows__object_handle/close/overload1.html +++ b/doc/html/boost_asio/reference/windows__object_handle/close/overload1.html @@ -53,7 +53,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/windows__object_handle/close/overload2.html b/doc/html/boost_asio/reference/windows__object_handle/close/overload2.html index d5f2a343f7..5dc7043c02 100644 --- a/doc/html/boost_asio/reference/windows__object_handle/close/overload2.html +++ b/doc/html/boost_asio/reference/windows__object_handle/close/overload2.html @@ -54,7 +54,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/windows__object_handle/executor_type.html b/doc/html/boost_asio/reference/windows__object_handle/executor_type.html index 004d7ebc9e..889d6de13d 100644 --- a/doc/html/boost_asio/reference/windows__object_handle/executor_type.html +++ b/doc/html/boost_asio/reference/windows__object_handle/executor_type.html @@ -203,7 +203,7 @@ The
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/windows__object_handle/get_executor.html b/doc/html/boost_asio/reference/windows__object_handle/get_executor.html index a07ab17787..fc9a65a811 100644 --- a/doc/html/boost_asio/reference/windows__object_handle/get_executor.html +++ b/doc/html/boost_asio/reference/windows__object_handle/get_executor.html @@ -36,7 +36,7 @@ Get
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/windows__object_handle/get_io_context.html b/doc/html/boost_asio/reference/windows__object_handle/get_io_context.html index 89e2a1427d..6bf8fcec0c 100644 --- a/doc/html/boost_asio/reference/windows__object_handle/get_io_context.html +++ b/doc/html/boost_asio/reference/windows__object_handle/get_io_context.html @@ -51,7 +51,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/windows__object_handle/get_io_service.html b/doc/html/boost_asio/reference/windows__object_handle/get_io_service.html index 142b91a846..b2daa38a13 100644 --- a/doc/html/boost_asio/reference/windows__object_handle/get_io_service.html +++ b/doc/html/boost_asio/reference/windows__object_handle/get_io_service.html @@ -51,7 +51,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/windows__object_handle/is_open.html b/doc/html/boost_asio/reference/windows__object_handle/is_open.html index 6e908057e8..c599197c70 100644 --- a/doc/html/boost_asio/reference/windows__object_handle/is_open.html +++ b/doc/html/boost_asio/reference/windows__object_handle/is_open.html @@ -36,7 +36,7 @@ Determine
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/windows__object_handle/lowest_layer.html b/doc/html/boost_asio/reference/windows__object_handle/lowest_layer.html index d2fbb36ac4..a5e3a41774 100644 --- a/doc/html/boost_asio/reference/windows__object_handle/lowest_layer.html +++ b/doc/html/boost_asio/reference/windows__object_handle/lowest_layer.html @@ -43,7 +43,7 @@ Get
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/windows__object_handle/lowest_layer/overload1.html b/doc/html/boost_asio/reference/windows__object_handle/lowest_layer/overload1.html index 98feb34846..cd685beaad 100644 --- a/doc/html/boost_asio/reference/windows__object_handle/lowest_layer/overload1.html +++ b/doc/html/boost_asio/reference/windows__object_handle/lowest_layer/overload1.html @@ -49,7 +49,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/windows__object_handle/lowest_layer/overload2.html b/doc/html/boost_asio/reference/windows__object_handle/lowest_layer/overload2.html index bfd9343a9e..ff5203fb60 100644 --- a/doc/html/boost_asio/reference/windows__object_handle/lowest_layer/overload2.html +++ b/doc/html/boost_asio/reference/windows__object_handle/lowest_layer/overload2.html @@ -49,7 +49,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/windows__object_handle/lowest_layer_type.html b/doc/html/boost_asio/reference/windows__object_handle/lowest_layer_type.html index 969faa886b..12a28b07b7 100644 --- a/doc/html/boost_asio/reference/windows__object_handle/lowest_layer_type.html +++ b/doc/html/boost_asio/reference/windows__object_handle/lowest_layer_type.html @@ -314,7 +314,7 @@ An
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/windows__object_handle/native_handle.html b/doc/html/boost_asio/reference/windows__object_handle/native_handle.html index 0f1cdc58cb..5a96c8d3fe 100644 --- a/doc/html/boost_asio/reference/windows__object_handle/native_handle.html +++ b/doc/html/boost_asio/reference/windows__object_handle/native_handle.html @@ -41,7 +41,7 @@ Get
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/windows__object_handle/native_handle_type.html b/doc/html/boost_asio/reference/windows__object_handle/native_handle_type.html index 61a1f9a42b..c5778b64e5 100644 --- a/doc/html/boost_asio/reference/windows__object_handle/native_handle_type.html +++ b/doc/html/boost_asio/reference/windows__object_handle/native_handle_type.html @@ -46,7 +46,7 @@ The
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/windows__object_handle/object_handle.html b/doc/html/boost_asio/reference/windows__object_handle/object_handle.html index 7220df40c0..8c31786a72 100644 --- a/doc/html/boost_asio/reference/windows__object_handle/object_handle.html +++ b/doc/html/boost_asio/reference/windows__object_handle/object_handle.html @@ -56,7 +56,7 @@ Construct
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/windows__object_handle/object_handle/overload1.html b/doc/html/boost_asio/reference/windows__object_handle/object_handle/overload1.html index 767d3184c6..ee36c38d5a 100644 --- a/doc/html/boost_asio/reference/windows__object_handle/object_handle/overload1.html +++ b/doc/html/boost_asio/reference/windows__object_handle/object_handle/overload1.html @@ -55,7 +55,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/windows__object_handle/object_handle/overload2.html b/doc/html/boost_asio/reference/windows__object_handle/object_handle/overload2.html index ff40fe7d63..5f4908d85d 100644 --- a/doc/html/boost_asio/reference/windows__object_handle/object_handle/overload2.html +++ b/doc/html/boost_asio/reference/windows__object_handle/object_handle/overload2.html @@ -74,7 +74,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/windows__object_handle/object_handle/overload3.html b/doc/html/boost_asio/reference/windows__object_handle/object_handle/overload3.html index 2a2af83878..94b3d0a745 100644 --- a/doc/html/boost_asio/reference/windows__object_handle/object_handle/overload3.html +++ b/doc/html/boost_asio/reference/windows__object_handle/object_handle/overload3.html @@ -62,7 +62,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/windows__object_handle/operator_eq_.html b/doc/html/boost_asio/reference/windows__object_handle/operator_eq_.html index dc3e81bcd1..158dd65f26 100644 --- a/doc/html/boost_asio/reference/windows__object_handle/operator_eq_.html +++ b/doc/html/boost_asio/reference/windows__object_handle/operator_eq_.html @@ -63,7 +63,7 @@ Move-assign
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/windows__object_handle/wait.html b/doc/html/boost_asio/reference/windows__object_handle/wait.html index 62dcd55237..fb0c736ee2 100644 --- a/doc/html/boost_asio/reference/windows__object_handle/wait.html +++ b/doc/html/boost_asio/reference/windows__object_handle/wait.html @@ -41,7 +41,7 @@ void
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/windows__object_handle/wait/overload1.html b/doc/html/boost_asio/reference/windows__object_handle/wait/overload1.html index e2cddafad5..86d38268ad 100644 --- a/doc/html/boost_asio/reference/windows__object_handle/wait/overload1.html +++ b/doc/html/boost_asio/reference/windows__object_handle/wait/overload1.html @@ -53,7 +53,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/windows__object_handle/wait/overload2.html b/doc/html/boost_asio/reference/windows__object_handle/wait/overload2.html index a928347d74..33368404ea 100644 --- a/doc/html/boost_asio/reference/windows__object_handle/wait/overload2.html +++ b/doc/html/boost_asio/reference/windows__object_handle/wait/overload2.html @@ -54,7 +54,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/windows__overlapped_handle.html b/doc/html/boost_asio/reference/windows__overlapped_handle.html index e9eef8ab82..2140d537a8 100644 --- a/doc/html/boost_asio/reference/windows__overlapped_handle.html +++ b/doc/html/boost_asio/reference/windows__overlapped_handle.html @@ -324,7 +324,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/windows__overlapped_handle/_overlapped_handle.html b/doc/html/boost_asio/reference/windows__overlapped_handle/_overlapped_handle.html index f629033c44..c7638c30a9 100644 --- a/doc/html/boost_asio/reference/windows__overlapped_handle/_overlapped_handle.html +++ b/doc/html/boost_asio/reference/windows__overlapped_handle/_overlapped_handle.html @@ -40,7 +40,7 @@ Protected
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/windows__overlapped_handle/assign.html b/doc/html/boost_asio/reference/windows__overlapped_handle/assign.html index 4998eeab1a..2594cfcd6c 100644 --- a/doc/html/boost_asio/reference/windows__overlapped_handle/assign.html +++ b/doc/html/boost_asio/reference/windows__overlapped_handle/assign.html @@ -43,7 +43,7 @@ void
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/windows__overlapped_handle/assign/overload1.html b/doc/html/boost_asio/reference/windows__overlapped_handle/assign/overload1.html index 0ef3f5b974..5e12036f71 100644 --- a/doc/html/boost_asio/reference/windows__overlapped_handle/assign/overload1.html +++ b/doc/html/boost_asio/reference/windows__overlapped_handle/assign/overload1.html @@ -36,7 +36,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/windows__overlapped_handle/assign/overload2.html b/doc/html/boost_asio/reference/windows__overlapped_handle/assign/overload2.html index 8aecdb7143..cd32e51a47 100644 --- a/doc/html/boost_asio/reference/windows__overlapped_handle/assign/overload2.html +++ b/doc/html/boost_asio/reference/windows__overlapped_handle/assign/overload2.html @@ -37,7 +37,7 @@
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/windows__overlapped_handle/cancel.html b/doc/html/boost_asio/reference/windows__overlapped_handle/cancel.html index da5dcc9acf..5a6342df1b 100644 --- a/doc/html/boost_asio/reference/windows__overlapped_handle/cancel.html +++ b/doc/html/boost_asio/reference/windows__overlapped_handle/cancel.html @@ -41,7 +41,7 @@ void
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/windows__overlapped_handle/cancel/overload1.html b/doc/html/boost_asio/reference/windows__overlapped_handle/cancel/overload1.html index 651bceddfa..a21b4e29ec 100644 --- a/doc/html/boost_asio/reference/windows__overlapped_handle/cancel/overload1.html +++ b/doc/html/boost_asio/reference/windows__overlapped_handle/cancel/overload1.html @@ -53,7 +53,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/windows__overlapped_handle/cancel/overload2.html b/doc/html/boost_asio/reference/windows__overlapped_handle/cancel/overload2.html index 3784af4c76..3f255a5d93 100644 --- a/doc/html/boost_asio/reference/windows__overlapped_handle/cancel/overload2.html +++ b/doc/html/boost_asio/reference/windows__overlapped_handle/cancel/overload2.html @@ -54,7 +54,7 @@
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/windows__overlapped_handle/close.html b/doc/html/boost_asio/reference/windows__overlapped_handle/close.html index fcfd3c7e40..262da9da66 100644 --- a/doc/html/boost_asio/reference/windows__overlapped_handle/close.html +++ b/doc/html/boost_asio/reference/windows__overlapped_handle/close.html @@ -41,7 +41,7 @@ void
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/windows__overlapped_handle/close/overload1.html b/doc/html/boost_asio/reference/windows__overlapped_handle/close/overload1.html index c4d2b26a0d..3f9561bf40 100644 --- a/doc/html/boost_asio/reference/windows__overlapped_handle/close/overload1.html +++ b/doc/html/boost_asio/reference/windows__overlapped_handle/close/overload1.html @@ -53,7 +53,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/windows__overlapped_handle/close/overload2.html b/doc/html/boost_asio/reference/windows__overlapped_handle/close/overload2.html index d28086133a..f6fde9fe64 100644 --- a/doc/html/boost_asio/reference/windows__overlapped_handle/close/overload2.html +++ b/doc/html/boost_asio/reference/windows__overlapped_handle/close/overload2.html @@ -54,7 +54,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/windows__overlapped_handle/executor_type.html b/doc/html/boost_asio/reference/windows__overlapped_handle/executor_type.html index 8c59609701..b3b884953b 100644 --- a/doc/html/boost_asio/reference/windows__overlapped_handle/executor_type.html +++ b/doc/html/boost_asio/reference/windows__overlapped_handle/executor_type.html @@ -203,7 +203,7 @@ The
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/windows__overlapped_handle/get_executor.html b/doc/html/boost_asio/reference/windows__overlapped_handle/get_executor.html index 4a80d8c118..4a75de70a3 100644 --- a/doc/html/boost_asio/reference/windows__overlapped_handle/get_executor.html +++ b/doc/html/boost_asio/reference/windows__overlapped_handle/get_executor.html @@ -36,7 +36,7 @@ Get
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/windows__overlapped_handle/get_io_context.html b/doc/html/boost_asio/reference/windows__overlapped_handle/get_io_context.html index 4f559da41f..18eb8c0451 100644 --- a/doc/html/boost_asio/reference/windows__overlapped_handle/get_io_context.html +++ b/doc/html/boost_asio/reference/windows__overlapped_handle/get_io_context.html @@ -51,7 +51,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/windows__overlapped_handle/get_io_service.html b/doc/html/boost_asio/reference/windows__overlapped_handle/get_io_service.html index a2631091d9..00ae7796f6 100644 --- a/doc/html/boost_asio/reference/windows__overlapped_handle/get_io_service.html +++ b/doc/html/boost_asio/reference/windows__overlapped_handle/get_io_service.html @@ -51,7 +51,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/windows__overlapped_handle/is_open.html b/doc/html/boost_asio/reference/windows__overlapped_handle/is_open.html index 5fca142260..53b327b548 100644 --- a/doc/html/boost_asio/reference/windows__overlapped_handle/is_open.html +++ b/doc/html/boost_asio/reference/windows__overlapped_handle/is_open.html @@ -36,7 +36,7 @@ Determine
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/windows__overlapped_handle/lowest_layer.html b/doc/html/boost_asio/reference/windows__overlapped_handle/lowest_layer.html index b4abcb507b..1f949a805e 100644 --- a/doc/html/boost_asio/reference/windows__overlapped_handle/lowest_layer.html +++ b/doc/html/boost_asio/reference/windows__overlapped_handle/lowest_layer.html @@ -43,7 +43,7 @@ Get
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/windows__overlapped_handle/lowest_layer/overload1.html b/doc/html/boost_asio/reference/windows__overlapped_handle/lowest_layer/overload1.html index acf27bbb3f..6001b90d7f 100644 --- a/doc/html/boost_asio/reference/windows__overlapped_handle/lowest_layer/overload1.html +++ b/doc/html/boost_asio/reference/windows__overlapped_handle/lowest_layer/overload1.html @@ -49,7 +49,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/windows__overlapped_handle/lowest_layer/overload2.html b/doc/html/boost_asio/reference/windows__overlapped_handle/lowest_layer/overload2.html index 3ef6e7134a..656d657286 100644 --- a/doc/html/boost_asio/reference/windows__overlapped_handle/lowest_layer/overload2.html +++ b/doc/html/boost_asio/reference/windows__overlapped_handle/lowest_layer/overload2.html @@ -49,7 +49,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/windows__overlapped_handle/lowest_layer_type.html b/doc/html/boost_asio/reference/windows__overlapped_handle/lowest_layer_type.html index a0625249a7..fe949db4d3 100644 --- a/doc/html/boost_asio/reference/windows__overlapped_handle/lowest_layer_type.html +++ b/doc/html/boost_asio/reference/windows__overlapped_handle/lowest_layer_type.html @@ -326,7 +326,7 @@ An
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/windows__overlapped_handle/native_handle.html b/doc/html/boost_asio/reference/windows__overlapped_handle/native_handle.html index 4453753c00..f407d4014b 100644 --- a/doc/html/boost_asio/reference/windows__overlapped_handle/native_handle.html +++ b/doc/html/boost_asio/reference/windows__overlapped_handle/native_handle.html @@ -41,7 +41,7 @@ Get
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/windows__overlapped_handle/native_handle_type.html b/doc/html/boost_asio/reference/windows__overlapped_handle/native_handle_type.html index 2ecf44700b..87f096f20c 100644 --- a/doc/html/boost_asio/reference/windows__overlapped_handle/native_handle_type.html +++ b/doc/html/boost_asio/reference/windows__overlapped_handle/native_handle_type.html @@ -46,7 +46,7 @@ The
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/windows__overlapped_handle/operator_eq_.html b/doc/html/boost_asio/reference/windows__overlapped_handle/operator_eq_.html index c5885c123e..07aadc1575 100644 --- a/doc/html/boost_asio/reference/windows__overlapped_handle/operator_eq_.html +++ b/doc/html/boost_asio/reference/windows__overlapped_handle/operator_eq_.html @@ -63,7 +63,7 @@ Move-assign
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/windows__overlapped_handle/overlapped_handle.html b/doc/html/boost_asio/reference/windows__overlapped_handle/overlapped_handle.html index cc0029d0da..7197929e2a 100644 --- a/doc/html/boost_asio/reference/windows__overlapped_handle/overlapped_handle.html +++ b/doc/html/boost_asio/reference/windows__overlapped_handle/overlapped_handle.html @@ -56,7 +56,7 @@ Construct
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/windows__overlapped_handle/overlapped_handle/overload1.html b/doc/html/boost_asio/reference/windows__overlapped_handle/overlapped_handle/overload1.html index 93cb53095d..51e8fbb1dd 100644 --- a/doc/html/boost_asio/reference/windows__overlapped_handle/overlapped_handle/overload1.html +++ b/doc/html/boost_asio/reference/windows__overlapped_handle/overlapped_handle/overload1.html @@ -55,7 +55,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/windows__overlapped_handle/overlapped_handle/overload2.html b/doc/html/boost_asio/reference/windows__overlapped_handle/overlapped_handle/overload2.html index 8f80eff284..ba228a609b 100644 --- a/doc/html/boost_asio/reference/windows__overlapped_handle/overlapped_handle/overload2.html +++ b/doc/html/boost_asio/reference/windows__overlapped_handle/overlapped_handle/overload2.html @@ -73,7 +73,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/windows__overlapped_handle/overlapped_handle/overload3.html b/doc/html/boost_asio/reference/windows__overlapped_handle/overlapped_handle/overload3.html index 71182beb9c..24fc295ccd 100644 --- a/doc/html/boost_asio/reference/windows__overlapped_handle/overlapped_handle/overload3.html +++ b/doc/html/boost_asio/reference/windows__overlapped_handle/overlapped_handle/overload3.html @@ -62,7 +62,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/windows__overlapped_ptr.html b/doc/html/boost_asio/reference/windows__overlapped_ptr.html index 7d305f163d..6c470fe062 100644 --- a/doc/html/boost_asio/reference/windows__overlapped_ptr.html +++ b/doc/html/boost_asio/reference/windows__overlapped_ptr.html @@ -165,7 +165,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/windows__overlapped_ptr/_overlapped_ptr.html b/doc/html/boost_asio/reference/windows__overlapped_ptr/_overlapped_ptr.html index 44bc85e4f4..292a34e8e1 100644 --- a/doc/html/boost_asio/reference/windows__overlapped_ptr/_overlapped_ptr.html +++ b/doc/html/boost_asio/reference/windows__overlapped_ptr/_overlapped_ptr.html @@ -36,7 +36,7 @@ Destructor
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/windows__overlapped_ptr/complete.html b/doc/html/boost_asio/reference/windows__overlapped_ptr/complete.html index 85f00c8869..86732bc292 100644 --- a/doc/html/boost_asio/reference/windows__overlapped_ptr/complete.html +++ b/doc/html/boost_asio/reference/windows__overlapped_ptr/complete.html @@ -38,7 +38,7 @@ Post
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/windows__overlapped_ptr/get.html b/doc/html/boost_asio/reference/windows__overlapped_ptr/get.html index 44e79eb06c..3c41f8bdc6 100644 --- a/doc/html/boost_asio/reference/windows__overlapped_ptr/get.html +++ b/doc/html/boost_asio/reference/windows__overlapped_ptr/get.html @@ -40,7 +40,7 @@ const OVERLAPPED *
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/windows__overlapped_ptr/get/overload1.html b/doc/html/boost_asio/reference/windows__overlapped_ptr/get/overload1.html index f6cdd9f8cd..cf7be2711c 100644 --- a/doc/html/boost_asio/reference/windows__overlapped_ptr/get/overload1.html +++ b/doc/html/boost_asio/reference/windows__overlapped_ptr/get/overload1.html @@ -35,7 +35,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/windows__overlapped_ptr/get/overload2.html b/doc/html/boost_asio/reference/windows__overlapped_ptr/get/overload2.html index 299b46a09d..2a30c8de59 100644 --- a/doc/html/boost_asio/reference/windows__overlapped_ptr/get/overload2.html +++ b/doc/html/boost_asio/reference/windows__overlapped_ptr/get/overload2.html @@ -35,7 +35,7 @@
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/windows__overlapped_ptr/overlapped_ptr.html b/doc/html/boost_asio/reference/windows__overlapped_ptr/overlapped_ptr.html index 67d4f4b877..3c2056f5ce 100644 --- a/doc/html/boost_asio/reference/windows__overlapped_ptr/overlapped_ptr.html +++ b/doc/html/boost_asio/reference/windows__overlapped_ptr/overlapped_ptr.html @@ -48,7 +48,7 @@ explicit
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/windows__overlapped_ptr/overlapped_ptr/overload1.html b/doc/html/boost_asio/reference/windows__overlapped_ptr/overlapped_ptr/overload1.html index 65fbf5e577..3ec6acf70f 100644 --- a/doc/html/boost_asio/reference/windows__overlapped_ptr/overlapped_ptr/overload1.html +++ b/doc/html/boost_asio/reference/windows__overlapped_ptr/overlapped_ptr/overload1.html @@ -35,7 +35,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/windows__overlapped_ptr/overlapped_ptr/overload2.html b/doc/html/boost_asio/reference/windows__overlapped_ptr/overlapped_ptr/overload2.html index 4b2c101ef2..99c614c327 100644 --- a/doc/html/boost_asio/reference/windows__overlapped_ptr/overlapped_ptr/overload2.html +++ b/doc/html/boost_asio/reference/windows__overlapped_ptr/overlapped_ptr/overload2.html @@ -40,7 +40,7 @@ overlapped_ptr(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/windows__overlapped_ptr/release.html b/doc/html/boost_asio/reference/windows__overlapped_ptr/release.html index 3c04e0fee7..ba6b9fd7d8 100644 --- a/doc/html/boost_asio/reference/windows__overlapped_ptr/release.html +++ b/doc/html/boost_asio/reference/windows__overlapped_ptr/release.html @@ -36,7 +36,7 @@ Release
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/windows__overlapped_ptr/reset.html b/doc/html/boost_asio/reference/windows__overlapped_ptr/reset.html index 0327357241..2807cdde75 100644 --- a/doc/html/boost_asio/reference/windows__overlapped_ptr/reset.html +++ b/doc/html/boost_asio/reference/windows__overlapped_ptr/reset.html @@ -48,7 +48,7 @@ void
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/windows__overlapped_ptr/reset/overload1.html b/doc/html/boost_asio/reference/windows__overlapped_ptr/reset/overload1.html index 5ec8ec1456..b86d15ca7e 100644 --- a/doc/html/boost_asio/reference/windows__overlapped_ptr/reset/overload1.html +++ b/doc/html/boost_asio/reference/windows__overlapped_ptr/reset/overload1.html @@ -35,7 +35,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/windows__overlapped_ptr/reset/overload2.html b/doc/html/boost_asio/reference/windows__overlapped_ptr/reset/overload2.html index 807e493ba3..c7711dc649 100644 --- a/doc/html/boost_asio/reference/windows__overlapped_ptr/reset/overload2.html +++ b/doc/html/boost_asio/reference/windows__overlapped_ptr/reset/overload2.html @@ -40,7 +40,7 @@ void reset(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/windows__random_access_handle.html b/doc/html/boost_asio/reference/windows__random_access_handle.html index 54028881ce..7cda63fac6 100644 --- a/doc/html/boost_asio/reference/windows__random_access_handle.html +++ b/doc/html/boost_asio/reference/windows__random_access_handle.html @@ -336,7 +336,7 @@
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/windows__random_access_handle/assign.html b/doc/html/boost_asio/reference/windows__random_access_handle/assign.html index 89d9c2361b..d281dd35c0 100644 --- a/doc/html/boost_asio/reference/windows__random_access_handle/assign.html +++ b/doc/html/boost_asio/reference/windows__random_access_handle/assign.html @@ -43,7 +43,7 @@ void
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/windows__random_access_handle/assign/overload1.html b/doc/html/boost_asio/reference/windows__random_access_handle/assign/overload1.html index 2f7f55e765..e559dd037f 100644 --- a/doc/html/boost_asio/reference/windows__random_access_handle/assign/overload1.html +++ b/doc/html/boost_asio/reference/windows__random_access_handle/assign/overload1.html @@ -39,7 +39,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/windows__random_access_handle/assign/overload2.html b/doc/html/boost_asio/reference/windows__random_access_handle/assign/overload2.html index 7a472e9716..fb2259fbe6 100644 --- a/doc/html/boost_asio/reference/windows__random_access_handle/assign/overload2.html +++ b/doc/html/boost_asio/reference/windows__random_access_handle/assign/overload2.html @@ -40,7 +40,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/windows__random_access_handle/async_read_some_at.html b/doc/html/boost_asio/reference/windows__random_access_handle/async_read_some_at.html index ef4bea7b6f..d84dfd99b0 100644 --- a/doc/html/boost_asio/reference/windows__random_access_handle/async_read_some_at.html +++ b/doc/html/boost_asio/reference/windows__random_access_handle/async_read_some_at.html @@ -110,7 +110,7 @@ Start
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/windows__random_access_handle/async_write_some_at.html b/doc/html/boost_asio/reference/windows__random_access_handle/async_write_some_at.html index 250ecd1eae..26ce2594ec 100644 --- a/doc/html/boost_asio/reference/windows__random_access_handle/async_write_some_at.html +++ b/doc/html/boost_asio/reference/windows__random_access_handle/async_write_some_at.html @@ -110,7 +110,7 @@ Start
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/windows__random_access_handle/cancel.html b/doc/html/boost_asio/reference/windows__random_access_handle/cancel.html index 3637137132..82739b41c9 100644 --- a/doc/html/boost_asio/reference/windows__random_access_handle/cancel.html +++ b/doc/html/boost_asio/reference/windows__random_access_handle/cancel.html @@ -41,7 +41,7 @@ void
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/windows__random_access_handle/cancel/overload1.html b/doc/html/boost_asio/reference/windows__random_access_handle/cancel/overload1.html index d7adbc50c9..502f6152ba 100644 --- a/doc/html/boost_asio/reference/windows__random_access_handle/cancel/overload1.html +++ b/doc/html/boost_asio/reference/windows__random_access_handle/cancel/overload1.html @@ -56,7 +56,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/windows__random_access_handle/cancel/overload2.html b/doc/html/boost_asio/reference/windows__random_access_handle/cancel/overload2.html index 1b08e898bf..9bb076adc7 100644 --- a/doc/html/boost_asio/reference/windows__random_access_handle/cancel/overload2.html +++ b/doc/html/boost_asio/reference/windows__random_access_handle/cancel/overload2.html @@ -57,7 +57,7 @@
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/windows__random_access_handle/close.html b/doc/html/boost_asio/reference/windows__random_access_handle/close.html index c2a86b3092..2ec1a41a90 100644 --- a/doc/html/boost_asio/reference/windows__random_access_handle/close.html +++ b/doc/html/boost_asio/reference/windows__random_access_handle/close.html @@ -41,7 +41,7 @@ void
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/windows__random_access_handle/close/overload1.html b/doc/html/boost_asio/reference/windows__random_access_handle/close/overload1.html index f1e84fcb0c..5101f1be44 100644 --- a/doc/html/boost_asio/reference/windows__random_access_handle/close/overload1.html +++ b/doc/html/boost_asio/reference/windows__random_access_handle/close/overload1.html @@ -56,7 +56,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/windows__random_access_handle/close/overload2.html b/doc/html/boost_asio/reference/windows__random_access_handle/close/overload2.html index 7f256a022e..978bc21666 100644 --- a/doc/html/boost_asio/reference/windows__random_access_handle/close/overload2.html +++ b/doc/html/boost_asio/reference/windows__random_access_handle/close/overload2.html @@ -57,7 +57,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/windows__random_access_handle/executor_type.html b/doc/html/boost_asio/reference/windows__random_access_handle/executor_type.html index e3eabfa50d..469051e0b9 100644 --- a/doc/html/boost_asio/reference/windows__random_access_handle/executor_type.html +++ b/doc/html/boost_asio/reference/windows__random_access_handle/executor_type.html @@ -206,7 +206,7 @@ The
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/windows__random_access_handle/get_executor.html b/doc/html/boost_asio/reference/windows__random_access_handle/get_executor.html index 93025c4c13..2270782e24 100644 --- a/doc/html/boost_asio/reference/windows__random_access_handle/get_executor.html +++ b/doc/html/boost_asio/reference/windows__random_access_handle/get_executor.html @@ -39,7 +39,7 @@ Get
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/windows__random_access_handle/get_io_context.html b/doc/html/boost_asio/reference/windows__random_access_handle/get_io_context.html index f901b9ec5e..67b9d9341c 100644 --- a/doc/html/boost_asio/reference/windows__random_access_handle/get_io_context.html +++ b/doc/html/boost_asio/reference/windows__random_access_handle/get_io_context.html @@ -54,7 +54,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/windows__random_access_handle/get_io_service.html b/doc/html/boost_asio/reference/windows__random_access_handle/get_io_service.html index a76de78b92..a3853bcc8d 100644 --- a/doc/html/boost_asio/reference/windows__random_access_handle/get_io_service.html +++ b/doc/html/boost_asio/reference/windows__random_access_handle/get_io_service.html @@ -54,7 +54,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/windows__random_access_handle/is_open.html b/doc/html/boost_asio/reference/windows__random_access_handle/is_open.html index c24e3d5325..52361cb1f7 100644 --- a/doc/html/boost_asio/reference/windows__random_access_handle/is_open.html +++ b/doc/html/boost_asio/reference/windows__random_access_handle/is_open.html @@ -39,7 +39,7 @@ Determine
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/windows__random_access_handle/lowest_layer.html b/doc/html/boost_asio/reference/windows__random_access_handle/lowest_layer.html index 2a0dd265db..5216bac287 100644 --- a/doc/html/boost_asio/reference/windows__random_access_handle/lowest_layer.html +++ b/doc/html/boost_asio/reference/windows__random_access_handle/lowest_layer.html @@ -43,7 +43,7 @@ Get
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/windows__random_access_handle/lowest_layer/overload1.html b/doc/html/boost_asio/reference/windows__random_access_handle/lowest_layer/overload1.html index 6b9bfd8c66..3f6e44a21e 100644 --- a/doc/html/boost_asio/reference/windows__random_access_handle/lowest_layer/overload1.html +++ b/doc/html/boost_asio/reference/windows__random_access_handle/lowest_layer/overload1.html @@ -52,7 +52,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/windows__random_access_handle/lowest_layer/overload2.html b/doc/html/boost_asio/reference/windows__random_access_handle/lowest_layer/overload2.html index 0f94c3c6d6..4d62d69b51 100644 --- a/doc/html/boost_asio/reference/windows__random_access_handle/lowest_layer/overload2.html +++ b/doc/html/boost_asio/reference/windows__random_access_handle/lowest_layer/overload2.html @@ -52,7 +52,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/windows__random_access_handle/lowest_layer_type.html b/doc/html/boost_asio/reference/windows__random_access_handle/lowest_layer_type.html index 9e3596f992..e9419ee376 100644 --- a/doc/html/boost_asio/reference/windows__random_access_handle/lowest_layer_type.html +++ b/doc/html/boost_asio/reference/windows__random_access_handle/lowest_layer_type.html @@ -329,7 +329,7 @@ An
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/windows__random_access_handle/native_handle.html b/doc/html/boost_asio/reference/windows__random_access_handle/native_handle.html index f42acb507a..3371e69dc5 100644 --- a/doc/html/boost_asio/reference/windows__random_access_handle/native_handle.html +++ b/doc/html/boost_asio/reference/windows__random_access_handle/native_handle.html @@ -44,7 +44,7 @@ Get
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/windows__random_access_handle/native_handle_type.html b/doc/html/boost_asio/reference/windows__random_access_handle/native_handle_type.html index 72db947bd8..9c0b4d0741 100644 --- a/doc/html/boost_asio/reference/windows__random_access_handle/native_handle_type.html +++ b/doc/html/boost_asio/reference/windows__random_access_handle/native_handle_type.html @@ -49,7 +49,7 @@ The
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/windows__random_access_handle/operator_eq_.html b/doc/html/boost_asio/reference/windows__random_access_handle/operator_eq_.html index 6f78728e99..253f190381 100644 --- a/doc/html/boost_asio/reference/windows__random_access_handle/operator_eq_.html +++ b/doc/html/boost_asio/reference/windows__random_access_handle/operator_eq_.html @@ -64,7 +64,7 @@ Move-assign
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/windows__random_access_handle/random_access_handle.html b/doc/html/boost_asio/reference/windows__random_access_handle/random_access_handle.html index 7883e72616..26e6c60476 100644 --- a/doc/html/boost_asio/reference/windows__random_access_handle/random_access_handle.html +++ b/doc/html/boost_asio/reference/windows__random_access_handle/random_access_handle.html @@ -56,7 +56,7 @@ Construct
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/windows__random_access_handle/random_access_handle/overload1.html b/doc/html/boost_asio/reference/windows__random_access_handle/random_access_handle/overload1.html index 976413b2d7..7873fcca2d 100644 --- a/doc/html/boost_asio/reference/windows__random_access_handle/random_access_handle/overload1.html +++ b/doc/html/boost_asio/reference/windows__random_access_handle/random_access_handle/overload1.html @@ -57,7 +57,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/windows__random_access_handle/random_access_handle/overload2.html b/doc/html/boost_asio/reference/windows__random_access_handle/random_access_handle/overload2.html index 09261d7db9..bf60813303 100644 --- a/doc/html/boost_asio/reference/windows__random_access_handle/random_access_handle/overload2.html +++ b/doc/html/boost_asio/reference/windows__random_access_handle/random_access_handle/overload2.html @@ -74,7 +74,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/windows__random_access_handle/random_access_handle/overload3.html b/doc/html/boost_asio/reference/windows__random_access_handle/random_access_handle/overload3.html index db1d9611a9..f98d45e434 100644 --- a/doc/html/boost_asio/reference/windows__random_access_handle/random_access_handle/overload3.html +++ b/doc/html/boost_asio/reference/windows__random_access_handle/random_access_handle/overload3.html @@ -63,7 +63,7 @@
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/windows__random_access_handle/read_some_at.html b/doc/html/boost_asio/reference/windows__random_access_handle/read_some_at.html index 8580fc90f6..cf8a0977ea 100644 --- a/doc/html/boost_asio/reference/windows__random_access_handle/read_some_at.html +++ b/doc/html/boost_asio/reference/windows__random_access_handle/read_some_at.html @@ -49,7 +49,7 @@ std::size_t
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/windows__random_access_handle/read_some_at/overload1.html b/doc/html/boost_asio/reference/windows__random_access_handle/read_some_at/overload1.html index 9f6646c399..3c47bcb7e6 100644 --- a/doc/html/boost_asio/reference/windows__random_access_handle/read_some_at/overload1.html +++ b/doc/html/boost_asio/reference/windows__random_access_handle/read_some_at/overload1.html @@ -108,7 +108,7 @@ std::size_t read_some_at(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/windows__random_access_handle/read_some_at/overload2.html b/doc/html/boost_asio/reference/windows__random_access_handle/read_some_at/overload2.html index 17ac053e5f..8d8c8932cc 100644 --- a/doc/html/boost_asio/reference/windows__random_access_handle/read_some_at/overload2.html +++ b/doc/html/boost_asio/reference/windows__random_access_handle/read_some_at/overload2.html @@ -84,7 +84,7 @@ std::size_t read_some_at(
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/windows__random_access_handle/write_some_at.html b/doc/html/boost_asio/reference/windows__random_access_handle/write_some_at.html index dced6f7384..571380c150 100644 --- a/doc/html/boost_asio/reference/windows__random_access_handle/write_some_at.html +++ b/doc/html/boost_asio/reference/windows__random_access_handle/write_some_at.html @@ -49,7 +49,7 @@ std::size_t
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/windows__random_access_handle/write_some_at/overload1.html b/doc/html/boost_asio/reference/windows__random_access_handle/write_some_at/overload1.html index 1d13689d35..b9eb343eae 100644 --- a/doc/html/boost_asio/reference/windows__random_access_handle/write_some_at/overload1.html +++ b/doc/html/boost_asio/reference/windows__random_access_handle/write_some_at/overload1.html @@ -108,7 +108,7 @@ std::size_t write_some_at(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/windows__random_access_handle/write_some_at/overload2.html b/doc/html/boost_asio/reference/windows__random_access_handle/write_some_at/overload2.html index c1f4d3d3f3..e7194e9bd7 100644 --- a/doc/html/boost_asio/reference/windows__random_access_handle/write_some_at/overload2.html +++ b/doc/html/boost_asio/reference/windows__random_access_handle/write_some_at/overload2.html @@ -84,7 +84,7 @@ std::size_t write_some_at(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/windows__stream_handle.html b/doc/html/boost_asio/reference/windows__stream_handle.html index 56f520cbbb..a862a266ab 100644 --- a/doc/html/boost_asio/reference/windows__stream_handle.html +++ b/doc/html/boost_asio/reference/windows__stream_handle.html @@ -336,7 +336,7 @@
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/windows__stream_handle/assign.html b/doc/html/boost_asio/reference/windows__stream_handle/assign.html index b789b0b53e..fb671f043b 100644 --- a/doc/html/boost_asio/reference/windows__stream_handle/assign.html +++ b/doc/html/boost_asio/reference/windows__stream_handle/assign.html @@ -43,7 +43,7 @@ void
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/windows__stream_handle/assign/overload1.html b/doc/html/boost_asio/reference/windows__stream_handle/assign/overload1.html index 2e1b9cf2d3..51064803b5 100644 --- a/doc/html/boost_asio/reference/windows__stream_handle/assign/overload1.html +++ b/doc/html/boost_asio/reference/windows__stream_handle/assign/overload1.html @@ -39,7 +39,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/windows__stream_handle/assign/overload2.html b/doc/html/boost_asio/reference/windows__stream_handle/assign/overload2.html index 8b4fe3c42e..98b9587586 100644 --- a/doc/html/boost_asio/reference/windows__stream_handle/assign/overload2.html +++ b/doc/html/boost_asio/reference/windows__stream_handle/assign/overload2.html @@ -40,7 +40,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/windows__stream_handle/async_read_some.html b/doc/html/boost_asio/reference/windows__stream_handle/async_read_some.html index cb39e01e3d..3568f56176 100644 --- a/doc/html/boost_asio/reference/windows__stream_handle/async_read_some.html +++ b/doc/html/boost_asio/reference/windows__stream_handle/async_read_some.html @@ -105,7 +105,7 @@ Start
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/windows__stream_handle/async_write_some.html b/doc/html/boost_asio/reference/windows__stream_handle/async_write_some.html index e08ad625c9..6b072332e1 100644 --- a/doc/html/boost_asio/reference/windows__stream_handle/async_write_some.html +++ b/doc/html/boost_asio/reference/windows__stream_handle/async_write_some.html @@ -105,7 +105,7 @@ Start
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/windows__stream_handle/cancel.html b/doc/html/boost_asio/reference/windows__stream_handle/cancel.html index e490c1d23c..c47bde2779 100644 --- a/doc/html/boost_asio/reference/windows__stream_handle/cancel.html +++ b/doc/html/boost_asio/reference/windows__stream_handle/cancel.html @@ -41,7 +41,7 @@ void
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/windows__stream_handle/cancel/overload1.html b/doc/html/boost_asio/reference/windows__stream_handle/cancel/overload1.html index c1923c9225..9cc6f8efe3 100644 --- a/doc/html/boost_asio/reference/windows__stream_handle/cancel/overload1.html +++ b/doc/html/boost_asio/reference/windows__stream_handle/cancel/overload1.html @@ -56,7 +56,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/windows__stream_handle/cancel/overload2.html b/doc/html/boost_asio/reference/windows__stream_handle/cancel/overload2.html index 63d51ef4d3..e0740ced99 100644 --- a/doc/html/boost_asio/reference/windows__stream_handle/cancel/overload2.html +++ b/doc/html/boost_asio/reference/windows__stream_handle/cancel/overload2.html @@ -57,7 +57,7 @@
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/windows__stream_handle/close.html b/doc/html/boost_asio/reference/windows__stream_handle/close.html index 4cceef8a3c..108b6916d6 100644 --- a/doc/html/boost_asio/reference/windows__stream_handle/close.html +++ b/doc/html/boost_asio/reference/windows__stream_handle/close.html @@ -41,7 +41,7 @@ void
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/windows__stream_handle/close/overload1.html b/doc/html/boost_asio/reference/windows__stream_handle/close/overload1.html index 1df22ef498..4be8a3e27d 100644 --- a/doc/html/boost_asio/reference/windows__stream_handle/close/overload1.html +++ b/doc/html/boost_asio/reference/windows__stream_handle/close/overload1.html @@ -56,7 +56,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/windows__stream_handle/close/overload2.html b/doc/html/boost_asio/reference/windows__stream_handle/close/overload2.html index cf04d4056d..d4736ebed2 100644 --- a/doc/html/boost_asio/reference/windows__stream_handle/close/overload2.html +++ b/doc/html/boost_asio/reference/windows__stream_handle/close/overload2.html @@ -57,7 +57,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/windows__stream_handle/executor_type.html b/doc/html/boost_asio/reference/windows__stream_handle/executor_type.html index 45fd0101cc..6086f39183 100644 --- a/doc/html/boost_asio/reference/windows__stream_handle/executor_type.html +++ b/doc/html/boost_asio/reference/windows__stream_handle/executor_type.html @@ -206,7 +206,7 @@ The
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/windows__stream_handle/get_executor.html b/doc/html/boost_asio/reference/windows__stream_handle/get_executor.html index 0a6291e54a..43202ec43b 100644 --- a/doc/html/boost_asio/reference/windows__stream_handle/get_executor.html +++ b/doc/html/boost_asio/reference/windows__stream_handle/get_executor.html @@ -39,7 +39,7 @@ Get
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/windows__stream_handle/get_io_context.html b/doc/html/boost_asio/reference/windows__stream_handle/get_io_context.html index 40db3f8d37..230ee69281 100644 --- a/doc/html/boost_asio/reference/windows__stream_handle/get_io_context.html +++ b/doc/html/boost_asio/reference/windows__stream_handle/get_io_context.html @@ -54,7 +54,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/windows__stream_handle/get_io_service.html b/doc/html/boost_asio/reference/windows__stream_handle/get_io_service.html index 46e0e8938e..c39477b08b 100644 --- a/doc/html/boost_asio/reference/windows__stream_handle/get_io_service.html +++ b/doc/html/boost_asio/reference/windows__stream_handle/get_io_service.html @@ -54,7 +54,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/windows__stream_handle/is_open.html b/doc/html/boost_asio/reference/windows__stream_handle/is_open.html index 6f4b081d65..4f7f15785a 100644 --- a/doc/html/boost_asio/reference/windows__stream_handle/is_open.html +++ b/doc/html/boost_asio/reference/windows__stream_handle/is_open.html @@ -39,7 +39,7 @@ Determine
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/windows__stream_handle/lowest_layer.html b/doc/html/boost_asio/reference/windows__stream_handle/lowest_layer.html index 3122ade1bc..9ea41d24f4 100644 --- a/doc/html/boost_asio/reference/windows__stream_handle/lowest_layer.html +++ b/doc/html/boost_asio/reference/windows__stream_handle/lowest_layer.html @@ -43,7 +43,7 @@ Get
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/windows__stream_handle/lowest_layer/overload1.html b/doc/html/boost_asio/reference/windows__stream_handle/lowest_layer/overload1.html index 1bf9b2aa77..e57f775740 100644 --- a/doc/html/boost_asio/reference/windows__stream_handle/lowest_layer/overload1.html +++ b/doc/html/boost_asio/reference/windows__stream_handle/lowest_layer/overload1.html @@ -52,7 +52,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/windows__stream_handle/lowest_layer/overload2.html b/doc/html/boost_asio/reference/windows__stream_handle/lowest_layer/overload2.html index 354a3db296..948c4c033b 100644 --- a/doc/html/boost_asio/reference/windows__stream_handle/lowest_layer/overload2.html +++ b/doc/html/boost_asio/reference/windows__stream_handle/lowest_layer/overload2.html @@ -52,7 +52,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/windows__stream_handle/lowest_layer_type.html b/doc/html/boost_asio/reference/windows__stream_handle/lowest_layer_type.html index 53d1dbef43..af85cc55cd 100644 --- a/doc/html/boost_asio/reference/windows__stream_handle/lowest_layer_type.html +++ b/doc/html/boost_asio/reference/windows__stream_handle/lowest_layer_type.html @@ -329,7 +329,7 @@ An
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/windows__stream_handle/native_handle.html b/doc/html/boost_asio/reference/windows__stream_handle/native_handle.html index b27ec4f133..93d32f23f5 100644 --- a/doc/html/boost_asio/reference/windows__stream_handle/native_handle.html +++ b/doc/html/boost_asio/reference/windows__stream_handle/native_handle.html @@ -44,7 +44,7 @@ Get
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/windows__stream_handle/native_handle_type.html b/doc/html/boost_asio/reference/windows__stream_handle/native_handle_type.html index 30952e0e26..b0f3498b82 100644 --- a/doc/html/boost_asio/reference/windows__stream_handle/native_handle_type.html +++ b/doc/html/boost_asio/reference/windows__stream_handle/native_handle_type.html @@ -49,7 +49,7 @@ The
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/windows__stream_handle/operator_eq_.html b/doc/html/boost_asio/reference/windows__stream_handle/operator_eq_.html index fec755b99f..5595f4c23e 100644 --- a/doc/html/boost_asio/reference/windows__stream_handle/operator_eq_.html +++ b/doc/html/boost_asio/reference/windows__stream_handle/operator_eq_.html @@ -63,7 +63,7 @@ Move-assign
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/windows__stream_handle/read_some.html b/doc/html/boost_asio/reference/windows__stream_handle/read_some.html index d639033881..e7036cef2a 100644 --- a/doc/html/boost_asio/reference/windows__stream_handle/read_some.html +++ b/doc/html/boost_asio/reference/windows__stream_handle/read_some.html @@ -47,7 +47,7 @@ std::size_t
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/windows__stream_handle/read_some/overload1.html b/doc/html/boost_asio/reference/windows__stream_handle/read_some/overload1.html index 4824a19b72..35896e1fc6 100644 --- a/doc/html/boost_asio/reference/windows__stream_handle/read_some/overload1.html +++ b/doc/html/boost_asio/reference/windows__stream_handle/read_some/overload1.html @@ -103,7 +103,7 @@ std::size_t read_some(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/windows__stream_handle/read_some/overload2.html b/doc/html/boost_asio/reference/windows__stream_handle/read_some/overload2.html index 6e91388fd7..4cf162fd1b 100644 --- a/doc/html/boost_asio/reference/windows__stream_handle/read_some/overload2.html +++ b/doc/html/boost_asio/reference/windows__stream_handle/read_some/overload2.html @@ -79,7 +79,7 @@ std::size_t read_some(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/windows__stream_handle/stream_handle.html b/doc/html/boost_asio/reference/windows__stream_handle/stream_handle.html index 693b8ec744..b93df724ca 100644 --- a/doc/html/boost_asio/reference/windows__stream_handle/stream_handle.html +++ b/doc/html/boost_asio/reference/windows__stream_handle/stream_handle.html @@ -56,7 +56,7 @@ Construct
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/windows__stream_handle/stream_handle/overload1.html b/doc/html/boost_asio/reference/windows__stream_handle/stream_handle/overload1.html index 4754d72d1c..b2e68bda35 100644 --- a/doc/html/boost_asio/reference/windows__stream_handle/stream_handle/overload1.html +++ b/doc/html/boost_asio/reference/windows__stream_handle/stream_handle/overload1.html @@ -57,7 +57,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/windows__stream_handle/stream_handle/overload2.html b/doc/html/boost_asio/reference/windows__stream_handle/stream_handle/overload2.html index aabebf2b85..34411d7975 100644 --- a/doc/html/boost_asio/reference/windows__stream_handle/stream_handle/overload2.html +++ b/doc/html/boost_asio/reference/windows__stream_handle/stream_handle/overload2.html @@ -74,7 +74,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/windows__stream_handle/stream_handle/overload3.html b/doc/html/boost_asio/reference/windows__stream_handle/stream_handle/overload3.html index f29b2b47c6..ca2205d6fb 100644 --- a/doc/html/boost_asio/reference/windows__stream_handle/stream_handle/overload3.html +++ b/doc/html/boost_asio/reference/windows__stream_handle/stream_handle/overload3.html @@ -62,7 +62,7 @@
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/windows__stream_handle/write_some.html b/doc/html/boost_asio/reference/windows__stream_handle/write_some.html index aaff294131..489f4ab7ba 100644 --- a/doc/html/boost_asio/reference/windows__stream_handle/write_some.html +++ b/doc/html/boost_asio/reference/windows__stream_handle/write_some.html @@ -47,7 +47,7 @@ std::size_t
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/windows__stream_handle/write_some/overload1.html b/doc/html/boost_asio/reference/windows__stream_handle/write_some/overload1.html index 088716f023..02fcf8d4c0 100644 --- a/doc/html/boost_asio/reference/windows__stream_handle/write_some/overload1.html +++ b/doc/html/boost_asio/reference/windows__stream_handle/write_some/overload1.html @@ -103,7 +103,7 @@ std::size_t write_some(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/windows__stream_handle/write_some/overload2.html b/doc/html/boost_asio/reference/windows__stream_handle/write_some/overload2.html index aebde612d2..c7a395174c 100644 --- a/doc/html/boost_asio/reference/windows__stream_handle/write_some/overload2.html +++ b/doc/html/boost_asio/reference/windows__stream_handle/write_some/overload2.html @@ -79,7 +79,7 @@ std::size_t write_some(
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/write.html b/doc/html/boost_asio/reference/write.html index 6e14ddfe53..399866bac7 100644 --- a/doc/html/boost_asio/reference/write.html +++ b/doc/html/boost_asio/reference/write.html @@ -79,7 +79,7 @@ template< std::size_t write( SyncWriteStream & s, DynamicBuffer && buffers, - typename enable_if< is_dynamic_buffer< DynamicBuffer >::value >::type * = 0); + typename enable_if< is_dynamic_buffer< typename decay< DynamicBuffer >::type >::value >::type * = 0); » more... template< @@ -89,7 +89,7 @@ std::size_t » more... template< @@ -100,7 +100,7 @@ std::size_t » more... template< @@ -112,7 +112,7 @@ std::size_t » more... template< @@ -166,7 +166,7 @@ std::size_t
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/write/overload1.html b/doc/html/boost_asio/reference/write/overload1.html index 9e38f550dd..8992035d06 100644 --- a/doc/html/boost_asio/reference/write/overload1.html +++ b/doc/html/boost_asio/reference/write/overload1.html @@ -125,7 +125,7 @@ std::size_t write(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/write/overload10.html b/doc/html/boost_asio/reference/write/overload10.html index e15b607da6..ed5d569482 100644 --- a/doc/html/boost_asio/reference/write/overload10.html +++ b/doc/html/boost_asio/reference/write/overload10.html @@ -99,7 +99,7 @@ std::size_t write(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/write/overload11.html b/doc/html/boost_asio/reference/write/overload11.html index 4e3c156ccb..5003fd86b9 100644 --- a/doc/html/boost_asio/reference/write/overload11.html +++ b/doc/html/boost_asio/reference/write/overload11.html @@ -118,7 +118,7 @@ std::size_t write(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/write/overload12.html b/doc/html/boost_asio/reference/write/overload12.html index bdf97cbdad..2154c52bcb 100644 --- a/doc/html/boost_asio/reference/write/overload12.html +++ b/doc/html/boost_asio/reference/write/overload12.html @@ -111,7 +111,7 @@ std::size_t write(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/write/overload2.html b/doc/html/boost_asio/reference/write/overload2.html index d3b1f5b104..793452c812 100644 --- a/doc/html/boost_asio/reference/write/overload2.html +++ b/doc/html/boost_asio/reference/write/overload2.html @@ -117,7 +117,7 @@ std::size_t write(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/write/overload3.html b/doc/html/boost_asio/reference/write/overload3.html index 27bb74acce..1ee5510c50 100644 --- a/doc/html/boost_asio/reference/write/overload3.html +++ b/doc/html/boost_asio/reference/write/overload3.html @@ -137,7 +137,7 @@ std::size_t write(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/write/overload4.html b/doc/html/boost_asio/reference/write/overload4.html index 8647382d31..0f7cac5ab3 100644 --- a/doc/html/boost_asio/reference/write/overload4.html +++ b/doc/html/boost_asio/reference/write/overload4.html @@ -114,7 +114,7 @@ std::size_t write(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/write/overload5.html b/doc/html/boost_asio/reference/write/overload5.html index d3f220281e..ee87c49faf 100644 --- a/doc/html/boost_asio/reference/write/overload5.html +++ b/doc/html/boost_asio/reference/write/overload5.html @@ -36,7 +36,7 @@ std::size_t write( SyncWriteStream & s, DynamicBuffer && buffers, - typename enable_if< is_dynamic_buffer< DynamicBuffer >::value >::type * = 0); + typename enable_if< is_dynamic_buffer< typename decay< DynamicBuffer >::type >::value >::type * = 0);

    This function is used to write a certain number of bytes of data to a stream. @@ -108,7 +108,7 @@ std::size_t write(

    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/write/overload6.html b/doc/html/boost_asio/reference/write/overload6.html index d4d8e1019f..815d9432c0 100644 --- a/doc/html/boost_asio/reference/write/overload6.html +++ b/doc/html/boost_asio/reference/write/overload6.html @@ -37,7 +37,7 @@ std::size_t write( SyncWriteStream & s, DynamicBuffer && buffers, boost::system::error_code & ec, - typename enable_if< is_dynamic_buffer< DynamicBuffer >::value >::type * = 0); + typename enable_if< is_dynamic_buffer< typename decay< DynamicBuffer >::type >::value >::type * = 0);

    This function is used to write a certain number of bytes of data to a stream. @@ -100,7 +100,7 @@ std::size_t write(

    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/write/overload7.html b/doc/html/boost_asio/reference/write/overload7.html index d241b8a68b..80783aa37d 100644 --- a/doc/html/boost_asio/reference/write/overload7.html +++ b/doc/html/boost_asio/reference/write/overload7.html @@ -38,7 +38,7 @@ std::size_t write( SyncWriteStream & s, DynamicBuffer && buffers, CompletionCondition completion_condition, - typename enable_if< is_dynamic_buffer< DynamicBuffer >::value >::type * = 0); + typename enable_if< is_dynamic_buffer< typename decay< DynamicBuffer >::type >::value >::type * = 0);

    This function is used to write a certain number of bytes of data to a stream. @@ -119,7 +119,7 @@ std::size_t write(

    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/write/overload8.html b/doc/html/boost_asio/reference/write/overload8.html index b526eb50e3..af34274212 100644 --- a/doc/html/boost_asio/reference/write/overload8.html +++ b/doc/html/boost_asio/reference/write/overload8.html @@ -39,7 +39,7 @@ std::size_t write( DynamicBuffer && buffers, CompletionCondition completion_condition, boost::system::error_code & ec, - typename enable_if< is_dynamic_buffer< DynamicBuffer >::value >::type * = 0); + typename enable_if< is_dynamic_buffer< typename decay< DynamicBuffer >::type >::value >::type * = 0);

    This function is used to write a certain number of bytes of data to a stream. @@ -112,7 +112,7 @@ std::size_t write(

    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/write/overload9.html b/doc/html/boost_asio/reference/write/overload9.html index 90f5d7e995..43af4e26f0 100644 --- a/doc/html/boost_asio/reference/write/overload9.html +++ b/doc/html/boost_asio/reference/write/overload9.html @@ -108,7 +108,7 @@ std::size_t write(
    - -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/write_at.html b/doc/html/boost_asio/reference/write_at.html index d78f617654..dbbf424fda 100644 --- a/doc/html/boost_asio/reference/write_at.html +++ b/doc/html/boost_asio/reference/write_at.html @@ -128,7 +128,7 @@ std::size_t
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/write_at/overload1.html b/doc/html/boost_asio/reference/write_at/overload1.html index 5719a5b151..a20838feec 100644 --- a/doc/html/boost_asio/reference/write_at/overload1.html +++ b/doc/html/boost_asio/reference/write_at/overload1.html @@ -129,7 +129,7 @@ std::size_t write_at(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/write_at/overload2.html b/doc/html/boost_asio/reference/write_at/overload2.html index 0d3dac4dc4..40e91dc7a2 100644 --- a/doc/html/boost_asio/reference/write_at/overload2.html +++ b/doc/html/boost_asio/reference/write_at/overload2.html @@ -122,7 +122,7 @@ std::size_t write_at(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/write_at/overload3.html b/doc/html/boost_asio/reference/write_at/overload3.html index f6522ca9fc..5dd4f895f4 100644 --- a/doc/html/boost_asio/reference/write_at/overload3.html +++ b/doc/html/boost_asio/reference/write_at/overload3.html @@ -141,7 +141,7 @@ std::size_t write_at(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/write_at/overload4.html b/doc/html/boost_asio/reference/write_at/overload4.html index e8a5ee8d85..c215f9a052 100644 --- a/doc/html/boost_asio/reference/write_at/overload4.html +++ b/doc/html/boost_asio/reference/write_at/overload4.html @@ -118,7 +118,7 @@ std::size_t write_at(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/write_at/overload5.html b/doc/html/boost_asio/reference/write_at/overload5.html index f48fb5d443..cbb2542f58 100644 --- a/doc/html/boost_asio/reference/write_at/overload5.html +++ b/doc/html/boost_asio/reference/write_at/overload5.html @@ -113,7 +113,7 @@ std::size_t write_at(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/write_at/overload6.html b/doc/html/boost_asio/reference/write_at/overload6.html index 5fff9570c1..e81a100615 100644 --- a/doc/html/boost_asio/reference/write_at/overload6.html +++ b/doc/html/boost_asio/reference/write_at/overload6.html @@ -105,7 +105,7 @@ std::size_t write_at(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/write_at/overload7.html b/doc/html/boost_asio/reference/write_at/overload7.html index 1869ba01b0..990b71e98b 100644 --- a/doc/html/boost_asio/reference/write_at/overload7.html +++ b/doc/html/boost_asio/reference/write_at/overload7.html @@ -124,7 +124,7 @@ std::size_t write_at(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/write_at/overload8.html b/doc/html/boost_asio/reference/write_at/overload8.html index d0317ef7bf..18be9c8638 100644 --- a/doc/html/boost_asio/reference/write_at/overload8.html +++ b/doc/html/boost_asio/reference/write_at/overload8.html @@ -117,7 +117,7 @@ std::size_t write_at(
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/reference/yield_context.html b/doc/html/boost_asio/reference/yield_context.html index 18c6acd538..ada91b81a0 100644 --- a/doc/html/boost_asio/reference/yield_context.html +++ b/doc/html/boost_asio/reference/yield_context.html @@ -165,7 +165,7 @@ void my_coroutine(basic_yield_context<Handler> yield)
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/tutorial.html b/doc/html/boost_asio/tutorial.html index e89703c8b3..0e43459435 100644 --- a/doc/html/boost_asio/tutorial.html +++ b/doc/html/boost_asio/tutorial.html @@ -112,7 +112,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/tutorial/tutdaytime1.html b/doc/html/boost_asio/tutorial/tutdaytime1.html index b7e03da6df..07e197b2ce 100644 --- a/doc/html/boost_asio/tutorial/tutdaytime1.html +++ b/doc/html/boost_asio/tutorial/tutdaytime1.html @@ -55,14 +55,18 @@ int main(int argc, char* argv[]) }

    - All programs that use asio need to have at least one boost::asio::io_service + All programs that use asio need to have at least one io_context object.

    +
        boost::asio::io_context io_context;
+

    We need to turn the server name that was specified as a parameter to the application, into a TCP endpoint. To do this we use an ip::tcp::resolver object.

    +
        tcp::resolver resolver(io_context);
+

    A resolver takes a query object and turns it into a list of endpoints. We construct a query using the name of the server, specified in argv[1], @@ -111,7 +115,7 @@ int main(int argc, char* argv[])

    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/tutorial/tutdaytime1/src.html b/doc/html/boost_asio/tutorial/tutdaytime1/src.html index 512d48c7b3..222aefdbe5 100644 --- a/doc/html/boost_asio/tutorial/tutdaytime1/src.html +++ b/doc/html/boost_asio/tutorial/tutdaytime1/src.html @@ -31,7 +31,7 @@ // client.cpp // ~~~~~~~~~~ // -// Copyright (c) 2003-2017 Christopher M. Kohlhoff (chris at kohlhoff dot com) +// Copyright (c) 2003-2018 Christopher M. Kohlhoff (chris at kohlhoff dot com) // // Distributed under the Boost Software License, Version 1.0. (See accompanying // file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) @@ -92,7 +92,7 @@ int main(int argc, char* argv[])
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/tutorial/tutdaytime2.html b/doc/html/boost_asio/tutorial/tutdaytime2.html index 09ecfa11a1..0ab6e4bfb0 100644 --- a/doc/html/boost_asio/tutorial/tutdaytime2.html +++ b/doc/html/boost_asio/tutorial/tutdaytime2.html @@ -43,23 +43,58 @@ using boost::asio::ip::tcp; to be sent back to the client. This function will be reused in all of our daytime server applications.

    +
    std::string make_daytime_string()
+{
+  using namespace std; // For time_t, time and ctime;
+  time_t now = time(0);
+  return ctime(&now);
+}
+
+int main()
+{
+  try
+  {
+    boost::asio::io_context io_context;
+

    A ip::tcp::acceptor object needs to be created to listen for new connections. It is initialised to listen on TCP port 13, for IP version 4.

    +
        tcp::acceptor acceptor(io_context, tcp::endpoint(tcp::v4(), 13));
+

    This is an iterative server, which means that it will handle one connection at a time. Create a socket that will represent the connection to the client, and then wait for a connection.

    +
        for (;;)
+    {
+      tcp::socket socket(io_context);
+      acceptor.accept(socket);
+

    A client is accessing our service. Determine the current time and transfer this information to the client.

    +
          std::string message = make_daytime_string();
+
+      boost::system::error_code ignored_error;
+      boost::asio::write(socket, boost::asio::buffer(message), ignored_error);
+    }
+  }
+

    Finally, handle any exceptions.

    +
      catch (std::exception& e)
+  {
+    std::cerr << e.what() << std::endl;
+  }
+
+  return 0;
+}
+

    See the full source listing

    @@ -77,7 +112,7 @@ using boost::asio::ip::tcp;
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/tutorial/tutdaytime2/src.html b/doc/html/boost_asio/tutorial/tutdaytime2/src.html index 051829b788..2335af13bd 100644 --- a/doc/html/boost_asio/tutorial/tutdaytime2/src.html +++ b/doc/html/boost_asio/tutorial/tutdaytime2/src.html @@ -31,7 +31,7 @@ // server.cpp // ~~~~~~~~~~ // -// Copyright (c) 2003-2017 Christopher M. Kohlhoff (chris at kohlhoff dot com) +// Copyright (c) 2003-2018 Christopher M. Kohlhoff (chris at kohlhoff dot com) // // Distributed under the Boost Software License, Version 1.0. (See accompanying // file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) @@ -85,7 +85,7 @@ int main()
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/tutorial/tutdaytime3.html b/doc/html/boost_asio/tutorial/tutdaytime3.html index 4939e9da54..c583197b48 100644 --- a/doc/html/boost_asio/tutorial/tutdaytime3.html +++ b/doc/html/boost_asio/tutorial/tutdaytime3.html @@ -39,15 +39,15 @@

    We need to create a server object to accept incoming client connections. - The boost::asio::io_service object provides I/O services, such as sockets, - that the server object will use. + The io_context object + provides I/O services, such as sockets, that the server object will use. 

        boost::asio::io_context io_context;
     tcp_server server(io_context);

    - Run the boost::asio::io_service object so that it will perform asynchronous - operations on your behalf. + Run the io_context + object so that it will perform asynchronous operations on your behalf. 

        io_context.run();
   }
@@ -223,7 +223,7 @@ private:
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/tutorial/tutdaytime3/src.html b/doc/html/boost_asio/tutorial/tutdaytime3/src.html index 41b1943336..25ea528de7 100644 --- a/doc/html/boost_asio/tutorial/tutdaytime3/src.html +++ b/doc/html/boost_asio/tutorial/tutdaytime3/src.html @@ -31,7 +31,7 @@ // server.cpp // ~~~~~~~~~~ // -// Copyright (c) 2003-2017 Christopher M. Kohlhoff (chris at kohlhoff dot com) +// Copyright (c) 2003-2018 Christopher M. Kohlhoff (chris at kohlhoff dot com) // // Distributed under the Boost Software License, Version 1.0. (See accompanying // file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) @@ -152,7 +152,7 @@ int main()
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/tutorial/tutdaytime4.html b/doc/html/boost_asio/tutorial/tutdaytime4.html index decf55c5e1..23c5dbbfd9 100644 --- a/doc/html/boost_asio/tutorial/tutdaytime4.html +++ b/doc/html/boost_asio/tutorial/tutdaytime4.html @@ -41,16 +41,41 @@ using boost::asio::ip::udp; The start of the application is essentially the same as for the TCP daytime client.

    +
    int main(int argc, char* argv[])
+{
+  try
+  {
+    if (argc != 2)
+    {
+      std::cerr << "Usage: client <host>" << std::endl;
+      return 1;
+    }
+
+    boost::asio::io_context io_context;
+

    We use an ip::udp::resolver object to find the correct remote endpoint to use based on the host and service names. The query is restricted to return only IPv4 endpoints by the ip::udp::v4() argument.

    +
        udp::resolver resolver(io_context);
+    udp::endpoint receiver_endpoint =
+      *resolver.resolve(udp::v4(), argv[1], "daytime").begin();
+

    The ip::udp::resolver::resolve() function is guaranteed to return at least one endpoint in the list if it does not fail. This means it is safe to dereference the return value directly.

    +
        udp::socket socket(io_context);
+    socket.open(udp::v4());
+
+    boost::array<char, 1> send_buf  = {{ 0 }};
+    socket.send_to(boost::asio::buffer(send_buf), receiver_endpoint);
+
+    boost::array<char, 128> recv_buf;
+    udp::endpoint sender_endpoint;
+

    Since UDP is datagram-oriented, we will not be using a stream socket. Create an ip::udp::socket @@ -81,7 +106,7 @@ using boost::asio::ip::udp;

    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/tutorial/tutdaytime4/src.html b/doc/html/boost_asio/tutorial/tutdaytime4/src.html index 91797e47a5..801d96ec80 100644 --- a/doc/html/boost_asio/tutorial/tutdaytime4/src.html +++ b/doc/html/boost_asio/tutorial/tutdaytime4/src.html @@ -31,7 +31,7 @@ // client.cpp // ~~~~~~~~~~ // -// Copyright (c) 2003-2017 Christopher M. Kohlhoff (chris at kohlhoff dot com) +// Copyright (c) 2003-2018 Christopher M. Kohlhoff (chris at kohlhoff dot com) // // Distributed under the Boost Software License, Version 1.0. (See accompanying // file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) @@ -87,7 +87,7 @@ int main(int argc, char* argv[])
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/tutorial/tutdaytime5.html b/doc/html/boost_asio/tutorial/tutdaytime5.html index 2cab7f3426..809498b07e 100644 --- a/doc/html/boost_asio/tutorial/tutdaytime5.html +++ b/doc/html/boost_asio/tutorial/tutdaytime5.html @@ -31,10 +31,18 @@ This tutorial program shows how to use asio to implement a server application with UDP.

    +
    int main()
+{
+  try
+  {
+    boost::asio::io_context io_context;
+

    Create an ip::udp::socket object to receive requests on UDP port 13.

    +
        udp::socket socket(io_context, udp::endpoint(udp::v4(), 13));
+

    Wait for a client to initiate contact with us. The remote_endpoint object will be populated by ip::udp::socket::receive_from(). @@ -65,7 +73,7 @@

    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/tutorial/tutdaytime5/src.html b/doc/html/boost_asio/tutorial/tutdaytime5/src.html index e52a95e4d2..7d10834f51 100644 --- a/doc/html/boost_asio/tutorial/tutdaytime5/src.html +++ b/doc/html/boost_asio/tutorial/tutdaytime5/src.html @@ -31,7 +31,7 @@ // server.cpp // ~~~~~~~~~~ // -// Copyright (c) 2003-2017 Christopher M. Kohlhoff (chris at kohlhoff dot com) +// Copyright (c) 2003-2018 Christopher M. Kohlhoff (chris at kohlhoff dot com) // // Distributed under the Boost Software License, Version 1.0. (See accompanying // file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) @@ -65,11 +65,7 @@ int main() boost::array<char, 1> recv_buf; udp::endpoint remote_endpoint; boost::system::error_code error; - socket.receive_from(boost::asio::buffer(recv_buf), - remote_endpoint, 0, error); - - if (error && error != boost::asio::error::message_size) - throw boost::system::system_error(error); + socket.receive_from(boost::asio::buffer(recv_buf), remote_endpoint); std::string message = make_daytime_string(); @@ -93,7 +89,7 @@ int main()
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/tutorial/tutdaytime6.html b/doc/html/boost_asio/tutorial/tutdaytime6.html index 9bd29bd914..446018d79e 100644 --- a/doc/html/boost_asio/tutorial/tutdaytime6.html +++ b/doc/html/boost_asio/tutorial/tutdaytime6.html @@ -38,8 +38,7 @@ {

    - Create a server object to accept incoming client requests, and run the boost::asio::io_service - object. + Create a server object to accept incoming client requests, and run the io_context object. 

        boost::asio::io_context io_context;
     udp_server server(io_context);
@@ -78,10 +77,10 @@ private:
 
    
         The function ip::udp::socket::async_receive_from()
         will cause the application to listen in the background for a new request.
-        When such a request is received, the boost::asio::io_service object will
-        invoke the handle_receive() function with two arguments: a value
-        of type boost::system::error_code indicating whether the operation succeeded
-        or failed, and a size_t value bytes_transferred
+        When such a request is received, the io_context
+        object will invoke the handle_receive() function with two arguments:
+        a value of type boost::system::error_code indicating whether the operation
+        succeeded or failed, and a size_t value bytes_transferred
         specifying the number of bytes received.
       
    
 
        socket_.async_receive_from(
@@ -101,11 +100,11 @@ private:
 
    
         The error parameter contains the result of the asynchronous
         operation. Since we only provide the 1-byte recv_buffer_ to
-        contain the client's request, the boost::asio::io_service object would return
-        an error if the client sent anything larger. We can ignore such an error
-        if it comes up.
+        contain the client's request, the io_context
+        object would return an error if the client sent anything larger. We can ignore
+        such an error if it comes up.
       
    
-
        if (!error || error == boost::asio::error::message_size)
+
        if (!error)
     {
 
    
 
    
@@ -174,7 +173,7 @@ private:
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/tutorial/tutdaytime6/src.html b/doc/html/boost_asio/tutorial/tutdaytime6/src.html index 39c68db620..80db1c2cf9 100644 --- a/doc/html/boost_asio/tutorial/tutdaytime6/src.html +++ b/doc/html/boost_asio/tutorial/tutdaytime6/src.html @@ -31,7 +31,7 @@ // server.cpp // ~~~~~~~~~~ // -// Copyright (c) 2003-2017 Christopher M. Kohlhoff (chris at kohlhoff dot com) +// Copyright (c) 2003-2018 Christopher M. Kohlhoff (chris at kohlhoff dot com) // // Distributed under the Boost Software License, Version 1.0. (See accompanying // file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) @@ -76,7 +76,7 @@ private: void handle_receive(const boost::system::error_code& error, std::size_t /*bytes_transferred*/) { - if (!error || error == boost::asio::error::message_size) + if (!error) { boost::shared_ptr<std::string> message( new std::string(make_daytime_string())); @@ -124,7 +124,7 @@ int main()
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/tutorial/tutdaytime7.html b/doc/html/boost_asio/tutorial/tutdaytime7.html index 3236f5661a..2f0edbbeee 100644 --- a/doc/html/boost_asio/tutorial/tutdaytime7.html +++ b/doc/html/boost_asio/tutorial/tutdaytime7.html @@ -36,16 +36,36 @@ The main() function +
    int main()
+{
+  try
+  {
+    boost::asio::io_context io_context;
+

    We will begin by creating a server object to accept a TCP client connection.

    +
        tcp_server server1(io_context);
+

    We also need a server object to accept a UDP client request.

    +
        udp_server server2(io_context);
+

    - We have created two lots of work for the boost::asio::io_service object to - do. + We have created two lots of work for the io_context + object to do.

    +
        io_context.run();
+  }
+  catch (std::exception& e)
+  {
+    std::cerr << e.what() << std::endl;
+  }
+
+  return 0;
+}
+
    The @@ -156,7 +176,7 @@ private: void handle_receive(const boost::system::error_code& error) { - if (!error || error == boost::asio::error::message_size) + if (!error) { boost::shared_ptr<std::string> message( new std::string(make_daytime_string())); @@ -190,7 +210,7 @@ private:
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/tutorial/tutdaytime7/src.html b/doc/html/boost_asio/tutorial/tutdaytime7/src.html index f879065a08..b83a8a18fe 100644 --- a/doc/html/boost_asio/tutorial/tutdaytime7/src.html +++ b/doc/html/boost_asio/tutorial/tutdaytime7/src.html @@ -31,7 +31,7 @@ // server.cpp // ~~~~~~~~~~ // -// Copyright (c) 2003-2017 Christopher M. Kohlhoff (chris at kohlhoff dot com) +// Copyright (c) 2003-2018 Christopher M. Kohlhoff (chris at kohlhoff dot com) // // Distributed under the Boost Software License, Version 1.0. (See accompanying // file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) @@ -148,7 +148,7 @@ private: void handle_receive(const boost::system::error_code& error) { - if (!error || error == boost::asio::error::message_size) + if (!error) { boost::shared_ptr<std::string> message( new std::string(make_daytime_string())); @@ -193,7 +193,7 @@ int main()
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/tutorial/tuttimer1.html b/doc/html/boost_asio/tutorial/tuttimer1.html index a06bcbf9a3..92a11a65f3 100644 --- a/doc/html/boost_asio/tutorial/tuttimer1.html +++ b/doc/html/boost_asio/tutorial/tuttimer1.html @@ -42,38 +42,45 @@ #include <boost/asio.hpp>

    - Since this example uses timers, we need to include the appropriate Boost.Date_Time - header file for manipulating times. -

    -
    #include <boost/date_time/posix_time/posix_time.hpp>
-
    -

    - All programs that use asio need to have at least one boost::asio::io_service + All programs that use asio need to have at least one io_context object. This class provides access to I/O functionality. We declare an object of this type first thing in the main function.

    +
    int main()
+{
+  boost::asio::io_context io;
+

    - Next we declare an object of type boost::asio::deadline_timer. The core asio + Next we declare an object of type boost::asio::steady_timer. The core asio classes that provide I/O functionality (or as in this case timer functionality) - always take a reference to an io_service as their first constructor argument. + always take a reference to an io_context as their first constructor argument. The second argument to the constructor sets the timer to expire 5 seconds from now.

    +
      boost::asio::steady_timer t(io, boost::asio::chrono::seconds(5));
+

    In this simple example we perform a blocking wait on the timer. That is, - the call to deadline_timer::wait() + the call to steady_timer::wait() will not return until the timer has expired, 5 seconds after it was created (i.e. not from when the wait starts).

    - A deadline timer is always in one of two states: "expired" or "not - expired". If the deadline_timer::wait() + A timer is always in one of two states: "expired" or "not + expired". If the steady_timer::wait() function is called on an expired timer, it will return immediately.

    +
      t.wait();
+

    Finally we print the obligatory "Hello, world!" message to show when the timer has expired.

    +
      std::cout << "Hello, world!" << std::endl;
+
+  return 0;
+}
+

    See the full source listing

    @@ -87,7 +94,7 @@
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/tutorial/tuttimer1/src.html b/doc/html/boost_asio/tutorial/tuttimer1/src.html index 4ea730d45b..cee7f88e20 100644 --- a/doc/html/boost_asio/tutorial/tuttimer1/src.html +++ b/doc/html/boost_asio/tutorial/tuttimer1/src.html @@ -31,7 +31,7 @@ // timer.cpp // ~~~~~~~~~ // -// Copyright (c) 2003-2017 Christopher M. Kohlhoff (chris at kohlhoff dot com) +// Copyright (c) 2003-2018 Christopher M. Kohlhoff (chris at kohlhoff dot com) // // Distributed under the Boost Software License, Version 1.0. (See accompanying // file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) @@ -39,13 +39,12 @@ #include <iostream> #include <boost/asio.hpp> -#include <boost/date_time/posix_time/posix_time.hpp> int main() { boost::asio::io_context io; - boost::asio::deadline_timer t(io, boost::posix_time::seconds(5)); + boost::asio::steady_timer t(io, boost::asio::chrono::seconds(5)); t.wait(); std::cout << "Hello, world!" << std::endl; @@ -60,7 +59,7 @@ int main()
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/tutorial/tuttimer2.html b/doc/html/boost_asio/tutorial/tuttimer2.html index 6dbb1d6782..c3e02b4710 100644 --- a/doc/html/boost_asio/tutorial/tuttimer2.html +++ b/doc/html/boost_asio/tutorial/tuttimer2.html @@ -34,7 +34,6 @@ 

    #include <iostream>
 #include <boost/asio.hpp>
-#include <boost/date_time/posix_time/posix_time.hpp>

    Using asio's asynchronous functionality means having a callback function @@ -51,39 +50,39 @@ int main() { boost::asio::io_context io; - boost::asio::deadline_timer t(io, boost::posix_time::seconds(5)); + boost::asio::steady_timer t(io, boost::asio::chrono::seconds(5));

    Next, instead of doing a blocking wait as in tutorial Timer.1, we call the - deadline_timer::async_wait() + steady_timer::async_wait() function to perform an asynchronous wait. When calling this function we pass the print callback handler that was defined above. 

      t.async_wait(&print);

    - Finally, we must call the io_service::run() - member function on the io_service object. + Finally, we must call the io_context::run() + member function on the io_context object.

    The asio library provides a guarantee that callback handlers will only be - called from threads that are currently calling io_service::run(). - Therefore unless the io_service::run() + called from threads that are currently calling io_context::run(). + Therefore unless the io_context::run() function is called the callback for the asynchronous wait completion will never be invoked.

    - The io_service::run() + The io_context::run() function will also continue to run while there is still "work" to do. In this example, the work is the asynchronous wait on the timer, so the call will not return until the timer has expired and the callback has completed.

    - It is important to remember to give the io_service some work to do before - calling io_service::run(). - For example, if we had omitted the above call to deadline_timer::async_wait(), - the io_service would not have had any work to do, and consequently io_service::run() would + It is important to remember to give the io_context some work to do before + calling io_context::run(). + For example, if we had omitted the above call to steady_timer::async_wait(), + the io_context would not have had any work to do, and consequently io_context::run() would have returned immediately. 

      io.run();
@@ -108,7 +107,7 @@ int main()
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/tutorial/tuttimer2/src.html b/doc/html/boost_asio/tutorial/tuttimer2/src.html index a4485c2378..35f75d475c 100644 --- a/doc/html/boost_asio/tutorial/tuttimer2/src.html +++ b/doc/html/boost_asio/tutorial/tuttimer2/src.html @@ -31,7 +31,7 @@ // timer.cpp // ~~~~~~~~~ // -// Copyright (c) 2003-2017 Christopher M. Kohlhoff (chris at kohlhoff dot com) +// Copyright (c) 2003-2018 Christopher M. Kohlhoff (chris at kohlhoff dot com) // // Distributed under the Boost Software License, Version 1.0. (See accompanying // file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) @@ -39,7 +39,6 @@ #include <iostream> #include <boost/asio.hpp> -#include <boost/date_time/posix_time/posix_time.hpp> void print(const boost::system::error_code& /*e*/) { @@ -50,7 +49,7 @@ int main() { boost::asio::io_context io; - boost::asio::deadline_timer t(io, boost::posix_time::seconds(5)); + boost::asio::steady_timer t(io, boost::asio::chrono::seconds(5)); t.async_wait(&print); io.run(); @@ -65,7 +64,7 @@ int main()
    -
    Copyright © 2003-2017 Christopher M. Kohlhoff

    +

    Copyright © 2003-2018 Christopher M. Kohlhoff

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/boost_asio/tutorial/tuttimer3.html b/doc/html/boost_asio/tutorial/tuttimer3.html index f5c0b55b10..307da92c45 100644 --- a/doc/html/boost_asio/tutorial/tuttimer3.html +++ b/doc/html/boost_asio/tutorial/tuttimer3.html @@ -35,7 +35,6 @@ 
    #include <iostream>
 #include <boost/asio.hpp>
 #include <boost/bind.hpp>
-#include <boost/date_time/posix_time/posix_time.hpp>

    To implement a repeating timer using asio you need to change the timer's @@ -54,17 +53,17 @@ 

    void print(const boost::system::error_code& /*e*/,
-    boost::asio::deadline_timer* t, int* count)
+    boost::asio::steady_timer* t, int* count)
 {

    As mentioned above, this tutorial program uses a counter to stop running when the timer fires for the sixth time. However you will observe that there - is no explicit call to ask the io_service to stop. Recall that in tutorial - Timer.2 we learnt that the io_service::run() + is no explicit call to ask the io_context to stop. Recall that in tutorial + Timer.2 we learnt that the io_context::run() function completes when there is no more "work" to do. By not starting a new asynchronous wait on the timer when count reaches 5, the - io_service will run out of work and stop running. + io_context will run out of work and stop running. 

      if (*count < 5)
   {
@@ -77,12 +76,12 @@
         ensure that the timer does not drift away from the whole-second mark due
         to any delays in processing the handler.
       
    
-
        t->expires_at(t->expires_at() + boost::posix_time::seconds(1));
+
        t->expires_at(t->expiry() + boost::asio::chrono::seconds(1));
 
    
 
    
         Then we start a new asynchronous wait on the timer. As you can see, the boost::bind()
         function is used to associate the extra parameters with your callback handler.
-        The deadline_timer::async_wait()
+        The steady_timer::async_wait()
         function expects a handler function (or function object) with the signature
         void(const boost::system::error_code&). Binding the additional
         parameters converts your print function into a function object
@@ -100,19 +99,41 @@
         you will see that this placeholder may be elided if the parameter is not
         needed by the callback handler.
       
    
+
        t->async_wait(boost::bind(print,
+          boost::asio::placeholders::error, t, count));
+  }
+}
+
+int main()
+{
+  boost::asio::io_context io;
+
    
 
    
         A new count variable is added so that we can stop the program
         when the timer fires for the sixth time.
       
    
+
      int count = 0;
+  boost::asio::steady_timer t(io, boost::asio::chrono::seconds(1));
+
    
 
    
-        As in Step 4, when making the call to deadline_timer::async_wait()
+        As in Step 4, when making the call to steady_timer::async_wait()
         from main we bind the additional parameters needed for the
         print function.
       
    
+
      t.async_wait(boost::bind(print,
+        boost::asio::placeholders::error, &t, &count));
+
+  io.run();
+
    
 
    
         Finally, just to prove that the count variable was being used
         in the print handler function, we will print out its new value.
       
    
+
      std::cout << "Final count is " << count << std::endl;
+
+  return 0;
+}
+
    
 
    
         See the full source listing
       
    
@@ -130,7 +151,7 @@
 
 
-
    
 
    Copyright © 2003-2017 Christopher M. Kohlhoff
    
+
    Copyright © 2003-2018 Christopher M. Kohlhoff
    
         Distributed under the Boost Software License, Version 1.0. (See accompanying
         file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
       
    
diff --git a/doc/html/boost_asio/tutorial/tuttimer3/src.html b/doc/html/boost_asio/tutorial/tuttimer3/src.html
index 9f929a0a16..499bb75b01 100644
--- a/doc/html/boost_asio/tutorial/tuttimer3/src.html
+++ b/doc/html/boost_asio/tutorial/tuttimer3/src.html
@@ -31,7 +31,7 @@
 // timer.cpp
 // ~~~~~~~~~
 //
-// Copyright (c) 2003-2017 Christopher M. Kohlhoff (chris at kohlhoff dot com)
+// Copyright (c) 2003-2018 Christopher M. Kohlhoff (chris at kohlhoff dot com)
 //
 // Distributed under the Boost Software License, Version 1.0. (See accompanying
 // file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
@@ -40,17 +40,16 @@
 #include <iostream>
 #include <boost/asio.hpp>
 #include <boost/bind.hpp>
-#include <boost/date_time/posix_time/posix_time.hpp>
 
 void print(const boost::system::error_code& /*e*/,
-    boost::asio::deadline_timer* t, int* count)
+    boost::asio::steady_timer* t, int* count)
 {
   if (*count < 5)
   {
     std::cout << *count << std::endl;
     ++(*count);
 
-    t->expires_at(t->expires_at() + boost::posix_time::seconds(1));
+    t->expires_at(t->expiry() + boost::asio::chrono::seconds(1));
     t->async_wait(boost::bind(print,
           boost::asio::placeholders::error, t, count));
   }
@@ -61,7 +60,7 @@ int main()
   boost::asio::io_context io;
 
   int count = 0;
-  boost::asio::deadline_timer t(io, boost::posix_time::seconds(1));
+  boost::asio::steady_timer t(io, boost::asio::chrono::seconds(1));
   t.async_wait(boost::bind(print,
         boost::asio::placeholders::error, &t, &count));
 
@@ -79,7 +78,7 @@ int main()
 
    
 
-
    
 
    Copyright © 2003-2017 Christopher M. Kohlhoff
    
+
    Copyright © 2003-2018 Christopher M. Kohlhoff
    
         Distributed under the Boost Software License, Version 1.0. (See accompanying
         file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
       
    
diff --git a/doc/html/boost_asio/tutorial/tuttimer4.html b/doc/html/boost_asio/tutorial/tuttimer4.html
index 842e9c84ad..5418eb9472 100644
--- a/doc/html/boost_asio/tutorial/tuttimer4.html
+++ b/doc/html/boost_asio/tutorial/tuttimer4.html
@@ -35,7 +35,6 @@
 
    #include <iostream>
 #include <boost/asio.hpp>
 #include <boost/bind.hpp>
-#include <boost/date_time/posix_time/posix_time.hpp>
 
    
 
    
         Instead of defining a free function print as the callback handler,
@@ -47,12 +46,12 @@
 public:
 
 
    
-        The constructor of this class will take a reference to the io_service object
+        The constructor of this class will take a reference to the io_context object
         and use it when initialising the timer_ member. The counter
         used to shut down the program is now also a member of the class.
       
    
 
      printer(boost::asio::io_context& io)
-    : timer_(io, boost::posix_time::seconds(1)),
+    : timer_(io, boost::asio::chrono::seconds(1)),
       count_(0)
   {
 
    
@@ -92,19 +91,19 @@ public:
       std::cout << count_ << std::endl;
       ++count_;
 
-      timer_.expires_at(timer_.expires_at() + boost::posix_time::seconds(1));
+      timer_.expires_at(timer_.expiry() + boost::asio::chrono::seconds(1));
       timer_.async_wait(boost::bind(&printer::print, this));
     }
   }
 
 private:
-  boost::asio::deadline_timer timer_;
+  boost::asio::steady_timer timer_;
   int count_;
 };
 
 
    
         The main function is much simpler than before, as it now declares
-        a local printer object before running the io_service as normal.
+        a local printer object before running the io_context as normal.
       
    
 
    int main()
 {
@@ -132,7 +131,7 @@ private:
 
    
 
-
    
 
    Copyright © 2003-2017 Christopher M. Kohlhoff
    
+
    Copyright © 2003-2018 Christopher M. Kohlhoff
    
         Distributed under the Boost Software License, Version 1.0. (See accompanying
         file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
       
    
diff --git a/doc/html/boost_asio/tutorial/tuttimer4/src.html b/doc/html/boost_asio/tutorial/tuttimer4/src.html
index 019076f974..4ba86370f9 100644
--- a/doc/html/boost_asio/tutorial/tuttimer4/src.html
+++ b/doc/html/boost_asio/tutorial/tuttimer4/src.html
@@ -31,7 +31,7 @@
 // timer.cpp
 // ~~~~~~~~~
 //
-// Copyright (c) 2003-2017 Christopher M. Kohlhoff (chris at kohlhoff dot com)
+// Copyright (c) 2003-2018 Christopher M. Kohlhoff (chris at kohlhoff dot com)
 //
 // Distributed under the Boost Software License, Version 1.0. (See accompanying
 // file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
@@ -40,13 +40,12 @@
 #include <iostream>
 #include <boost/asio.hpp>
 #include <boost/bind.hpp>
-#include <boost/date_time/posix_time/posix_time.hpp>
 
 class printer
 {
 public:
   printer(boost::asio::io_context& io)
-    : timer_(io, boost::posix_time::seconds(1)),
+    : timer_(io, boost::asio::chrono::seconds(1)),
       count_(0)
   {
     timer_.async_wait(boost::bind(&printer::print, this));
@@ -64,13 +63,13 @@ public:
       std::cout << count_ << std::endl;
       ++count_;
 
-      timer_.expires_at(timer_.expires_at() + boost::posix_time::seconds(1));
+      timer_.expires_at(timer_.expiry() + boost::asio::chrono::seconds(1));
       timer_.async_wait(boost::bind(&printer::print, this));
     }
   }
 
 private:
-  boost::asio::deadline_timer timer_;
+  boost::asio::steady_timer timer_;
   int count_;
 };
 
@@ -90,7 +89,7 @@ int main()
 
    
 
-
    
 
    Copyright © 2003-2017 Christopher M. Kohlhoff
    
+
    Copyright © 2003-2018 Christopher M. Kohlhoff
    
         Distributed under the Boost Software License, Version 1.0. (See accompanying
         file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
       
    
diff --git a/doc/html/boost_asio/tutorial/tuttimer5.html b/doc/html/boost_asio/tutorial/tuttimer5.html
index be3dd76165..3e50a8a265 100644
--- a/doc/html/boost_asio/tutorial/tuttimer5.html
+++ b/doc/html/boost_asio/tutorial/tuttimer5.html
@@ -28,16 +28,16 @@
       handlers in multithreaded programs
 
    
 
    
-        This tutorial demonstrates the use of the boost::asio::io_service::strand
+        This tutorial demonstrates the use of the io_context::strand
         class to synchronise callback handlers in a multithreaded program.
       
    
 
    
         The previous four tutorials avoided the issue of handler synchronisation
-        by calling the io_service::run()
+        by calling the io_context::run()
         function from one thread only. As you already know, the asio library provides
         a guarantee that callback handlers will only be called from threads that
-        are currently calling io_service::run().
-        Consequently, calling io_service::run()
+        are currently calling io_context::run().
+        Consequently, calling io_context::run()
         from only one thread ensures that callback handlers cannot run concurrently.
       
    
 
    
@@ -55,7 +55,7 @@
 
 
    
         If you find yourself running into these limitations, an alternative approach
-        is to have a pool of threads calling io_service::run().
+        is to have a pool of threads calling io_context::run().
         However, as this allows handlers to execute concurrently, we need a method
         of synchronisation when handlers might be accessing a shared, thread-unsafe
         resource.
@@ -64,7 +64,6 @@
 #include <boost/asio.hpp>
 #include <boost/thread/thread.hpp>
 #include <boost/bind.hpp>
-#include <boost/date_time/posix_time/posix_time.hpp>
 
 
    
         We start by defining a class called printer, similar to the
@@ -76,33 +75,36 @@
 public:
 
 
    
-        In addition to initialising a pair of boost::asio::deadline_timer members,
+        In addition to initialising a pair of boost::asio::steady_timer members,
         the constructor initialises the strand_ member, an object of
-        type boost::asio::io_service::strand.
+        type io_context::strand.
       
    
 
    
-        An boost::asio::io_service::strand is an executor that guarantees that, for
-        those handlers that are dispatched through it, an executing handler will
-        be allowed to complete before the next one is started. This is guaranteed
-        irrespective of the number of threads that are calling io_service::run().
+        An io_context::strand
+        is an executor that guarantees that, for those handlers that are dispatched
+        through it, an executing handler will be allowed to complete before the next
+        one is started. This is guaranteed irrespective of the number of threads
+        that are calling io_context::run().
         Of course, the handlers may still execute concurrently with other handlers
-        that were not dispatched through an boost::asio::io_service::strand, or were
-        dispatched through a different boost::asio::io_service::strand object.
+        that were not dispatched through an io_context::strand,
+        or were dispatched through a different io_context::strand
+        object.
       
    
 
      printer(boost::asio::io_context& io)
     : strand_(io),
-      timer1_(io, boost::posix_time::seconds(1)),
-      timer2_(io, boost::posix_time::seconds(1)),
+      timer1_(io, boost::asio::chrono::seconds(1)),
+      timer2_(io, boost::asio::chrono::seconds(1)),
       count_(0)
   {
 
    
 
    
         When initiating the asynchronous operations, each callback handler is "bound"
-        to an boost::asio::io_service::strand object. The boost::asio::io_service::strand::bind_executor()
-        function returns a new handler that automatically dispatches its contained
-        handler through the boost::asio::io_service::strand object. By binding the
-        handlers to the same boost::asio::io_service::strand, we are ensuring that
-        they cannot execute concurrently.
+        to an io_context::strand
+        object. The boost::asio::io_context::strand::bind_executor() function returns
+        a new handler that automatically dispatches its contained handler through
+        the io_context::strand
+        object. By binding the handlers to the same io_context::strand,
+        we are ensuring that they cannot execute concurrently.
       
    
 
        timer1_.async_wait(boost::asio::bind_executor(strand_,
           boost::bind(&printer::print1, this)));
@@ -129,7 +131,7 @@ public:
       std::cout << "Timer 1: " << count_ << std::endl;
       ++count_;
 
-      timer1_.expires_at(timer1_.expires_at() + boost::posix_time::seconds(1));
+      timer1_.expires_at(timer1_.expiry() + boost::asio::chrono::seconds(1));
 
       timer1_.async_wait(boost::asio::bind_executor(strand_,
             boost::bind(&printer::print1, this)));
@@ -143,7 +145,7 @@ public:
       std::cout << "Timer 2: " << count_ << std::endl;
       ++count_;
 
-      timer2_.expires_at(timer2_.expires_at() + boost::posix_time::seconds(1));
+      timer2_.expires_at(timer2_.expiry() + boost::asio::chrono::seconds(1));
 
       timer2_.async_wait(boost::asio::bind_executor(strand_,
             boost::bind(&printer::print2, this)));
@@ -152,18 +154,18 @@ public:
 
 private:
   boost::asio::io_context::strand strand_;
-  boost::asio::deadline_timer timer1_;
-  boost::asio::deadline_timer timer2_;
+  boost::asio::steady_timer timer1_;
+  boost::asio::steady_timer timer2_;
   int count_;
 };
 
    
 
    
-        The main function now causes io_service::run()
+        The main function now causes io_context::run()
         to be called from two threads: the main thread and one additional thread.
         This is accomplished using an boost::thread object.
       
    
 
    
-        Just as it would with a call from a single thread, concurrent calls to io_service::run() will
+        Just as it would with a call from a single thread, concurrent calls to io_context::run() will
         continue to execute while there is "work" left to do. The background
         thread will not exit until all asynchronous operations have completed.
       
    
@@ -191,7 +193,7 @@ private:
 
 
-
    
 
    Copyright © 2003-2017 Christopher M. Kohlhoff
    
+
    Copyright © 2003-2018 Christopher M. Kohlhoff
    
         Distributed under the Boost Software License, Version 1.0. (See accompanying
         file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
       
    
diff --git a/doc/html/boost_asio/tutorial/tuttimer5/src.html b/doc/html/boost_asio/tutorial/tuttimer5/src.html
index 1476f247f5..3a9c4aebce 100644
--- a/doc/html/boost_asio/tutorial/tuttimer5/src.html
+++ b/doc/html/boost_asio/tutorial/tuttimer5/src.html
@@ -31,7 +31,7 @@
 // timer.cpp
 // ~~~~~~~~~
 //
-// Copyright (c) 2003-2017 Christopher M. Kohlhoff (chris at kohlhoff dot com)
+// Copyright (c) 2003-2018 Christopher M. Kohlhoff (chris at kohlhoff dot com)
 //
 // Distributed under the Boost Software License, Version 1.0. (See accompanying
 // file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
@@ -41,15 +41,14 @@
 #include <boost/asio.hpp>
 #include <boost/thread/thread.hpp>
 #include <boost/bind.hpp>
-#include <boost/date_time/posix_time/posix_time.hpp>
 
 class printer
 {
 public:
   printer(boost::asio::io_context& io)
     : strand_(io),
-      timer1_(io, boost::posix_time::seconds(1)),
-      timer2_(io, boost::posix_time::seconds(1)),
+      timer1_(io, boost::asio::chrono::seconds(1)),
+      timer2_(io, boost::asio::chrono::seconds(1)),
       count_(0)
   {
     timer1_.async_wait(boost::asio::bind_executor(strand_,
@@ -71,7 +70,7 @@ public:
       std::cout << "Timer 1: " << count_ << std::endl;
       ++count_;
 
-      timer1_.expires_at(timer1_.expires_at() + boost::posix_time::seconds(1));
+      timer1_.expires_at(timer1_.expiry() + boost::asio::chrono::seconds(1));
 
       timer1_.async_wait(boost::asio::bind_executor(strand_,
             boost::bind(&printer::print1, this)));
@@ -85,7 +84,7 @@ public:
       std::cout << "Timer 2: " << count_ << std::endl;
       ++count_;
 
-      timer2_.expires_at(timer2_.expires_at() + boost::posix_time::seconds(1));
+      timer2_.expires_at(timer2_.expiry() + boost::asio::chrono::seconds(1));
 
       timer2_.async_wait(boost::asio::bind_executor(strand_,
             boost::bind(&printer::print2, this)));
@@ -94,8 +93,8 @@ public:
 
 private:
   boost::asio::io_context::strand strand_;
-  boost::asio::deadline_timer timer1_;
-  boost::asio::deadline_timer timer2_;
+  boost::asio::steady_timer timer1_;
+  boost::asio::steady_timer timer2_;
   int count_;
 };
 
@@ -117,7 +116,7 @@ int main()
 
    
 
-
    
 
    Copyright © 2003-2017 Christopher M. Kohlhoff
    
+
    Copyright © 2003-2018 Christopher M. Kohlhoff
    
         Distributed under the Boost Software License, Version 1.0. (See accompanying
         file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
       
    
diff --git a/doc/html/boost_asio/using.html b/doc/html/boost_asio/using.html
index fd99e59bba..388b0106f3 100644
--- a/doc/html/boost_asio/using.html
+++ b/doc/html/boost_asio/using.html
@@ -480,7 +480,7 @@
 
    
 
-
    
 
    Copyright © 2003-2017 Christopher M. Kohlhoff
    
+
    Copyright © 2003-2018 Christopher M. Kohlhoff
    
         Distributed under the Boost Software License, Version 1.0. (See accompanying
         file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
       
    
diff --git a/doc/html/boost_circular_buffer_c___reference.html b/doc/html/boost_circular_buffer_c___reference.html
index 1179b50c8f..e0c02e568b 100644
--- a/doc/html/boost_circular_buffer_c___reference.html
+++ b/doc/html/boost_circular_buffer_c___reference.html
@@ -41,7 +41,7 @@
 BOOST_CB_ENABLE_DEBUG
 BOOST_CB_ASSERT(Expr)
 BOOST_CB_IS_CONVERTIBLE(Iterator, Type)
-BOOST_CB_ASSERT_TEMPLATED_ITERATOR_CONSTRUCTORS
+BOOST_CB_ASSERT_TEMPLATED_ITERATOR_CONSTRUCTORS
 
    
 
    
 
    
@@ -49,25 +49,25 @@
 
    namespace boost {
   template<typename T, typename Alloc> class circular_buffer;
   template<typename T, typename Alloc> 
-    bool operator==(const circular_buffer< T, Alloc > &, 
+    bool operator==(const circular_buffer< T, Alloc > &, 
                     const circular_buffer< T, Alloc > &);
   template<typename T, typename Alloc> 
-    bool operator<(const circular_buffer< T, Alloc > &, 
+    bool operator<(const circular_buffer< T, Alloc > &, 
                    const circular_buffer< T, Alloc > &);
   template<typename T, typename Alloc> 
-    bool operator!=(const circular_buffer< T, Alloc > &, 
+    bool operator!=(const circular_buffer< T, Alloc > &, 
                     const circular_buffer< T, Alloc > &);
   template<typename T, typename Alloc> 
-    bool operator>(const circular_buffer< T, Alloc > &, 
+    bool operator>(const circular_buffer< T, Alloc > &, 
                    const circular_buffer< T, Alloc > &);
   template<typename T, typename Alloc> 
-    bool operator<=(const circular_buffer< T, Alloc > &, 
+    bool operator<=(const circular_buffer< T, Alloc > &, 
                     const circular_buffer< T, Alloc > &);
   template<typename T, typename Alloc> 
-    bool operator>=(const circular_buffer< T, Alloc > &, 
+    bool operator>=(const circular_buffer< T, Alloc > &, 
                     const circular_buffer< T, Alloc > &);
   template<typename T, typename Alloc> 
-    void swap(circular_buffer< T, Alloc > &, circular_buffer< T, Alloc > &);
+    void swap(circular_buffer< T, Alloc > &, circular_buffer< T, Alloc > &);
 }
    
 
    
 
    
@@ -78,42 +78,42 @@
 
    
 
    namespace boost {
-  template<typename T, typename Alloc> class circular_buffer_space_optimized;
+  template<typename T, typename Alloc> class circular_buffer_space_optimized;
 
   // Test two space optimized circular buffers for equality. 
   template<typename T, typename Alloc> 
-    bool operator==(const circular_buffer_space_optimized< T, Alloc > & lhs, 
-                    const circular_buffer_space_optimized< T, Alloc > & rhs);
+    bool operator==(const circular_buffer_space_optimized< T, Alloc > & lhs, 
+                    const circular_buffer_space_optimized< T, Alloc > & rhs);
 
   // Lexicographical comparison. 
   template<typename T, typename Alloc> 
-    bool operator<(const circular_buffer_space_optimized< T, Alloc > & lhs, 
-                   const circular_buffer_space_optimized< T, Alloc > & rhs);
+    bool operator<(const circular_buffer_space_optimized< T, Alloc > & lhs, 
+                   const circular_buffer_space_optimized< T, Alloc > & rhs);
 
   // Test two space optimized circular buffers for non-equality. 
   template<typename T, typename Alloc> 
-    bool operator!=(const circular_buffer_space_optimized< T, Alloc > & lhs, 
-                    const circular_buffer_space_optimized< T, Alloc > & rhs);
+    bool operator!=(const circular_buffer_space_optimized< T, Alloc > & lhs, 
+                    const circular_buffer_space_optimized< T, Alloc > & rhs);
 
   // Lexicographical comparison. 
   template<typename T, typename Alloc> 
-    bool operator>(const circular_buffer_space_optimized< T, Alloc > & lhs, 
-                   const circular_buffer_space_optimized< T, Alloc > & rhs);
+    bool operator>(const circular_buffer_space_optimized< T, Alloc > & lhs, 
+                   const circular_buffer_space_optimized< T, Alloc > & rhs);
 
   // Lexicographical comparison. 
   template<typename T, typename Alloc> 
-    bool operator<=(const circular_buffer_space_optimized< T, Alloc > & lhs, 
-                    const circular_buffer_space_optimized< T, Alloc > & rhs);
+    bool operator<=(const circular_buffer_space_optimized< T, Alloc > & lhs, 
+                    const circular_buffer_space_optimized< T, Alloc > & rhs);
 
   // Lexicographical comparison. 
   template<typename T, typename Alloc> 
-    bool operator>=(const circular_buffer_space_optimized< T, Alloc > & lhs, 
-                    const circular_buffer_space_optimized< T, Alloc > & rhs);
+    bool operator>=(const circular_buffer_space_optimized< T, Alloc > & lhs, 
+                    const circular_buffer_space_optimized< T, Alloc > & rhs);
 
   // Swap the contents of two space optimized circular buffers. 
   template<typename T, typename Alloc> 
-    void swap(circular_buffer_space_optimized< T, Alloc > & lhs, 
-              circular_buffer_space_optimized< T, Alloc > & rhs);
+    void swap(circular_buffer_space_optimized< T, Alloc > & lhs, 
+              circular_buffer_space_optimized< T, Alloc > & rhs);
 }
    
 
    
 
    
diff --git a/doc/html/boost_container_header_reference.html b/doc/html/boost_container_header_reference.html
index 77bfc4fc95..da0dc1fd2b 100644
--- a/doc/html/boost_container_header_reference.html
+++ b/doc/html/boost_container_header_reference.html
@@ -143,7 +143,7 @@
 
  • boost::container::pmr::polymorphic_allocator
    • 
 
  • boost::container::pmr::monotonic_buffer_resource
    • 
 
  • boost::container::pmr::pool_options
    • 
-
  • boost::container::pmr::unsynchronized_pool_resource
    • 
+
  • boost::container::pmr::unsynchronized_pool_resource
    • 
 
  • boost::container::pmr::synchronized_pool_resource
    • 
 
    
 
    
@@ -155,9 +155,6 @@
     struct ordered_unique_range_t;
     struct default_init_t;
 
-    enum tree_type_enum;
-    typedef implementation_defined tree_assoc_defaults;
-
     static const ordered_range_t ordered_range;
     static const ordered_unique_range_t ordered_unique_range;
     static const default_init_t default_init;
@@ -206,11 +203,9 @@
 
    namespace boost {
   namespace container {
     namespace pmr {
-      template<typename Key, typename T, typename Compare = std::less<Key>, 
-               typename Options = tree_assoc_defaults> 
+      template<typename Key, typename T, typename Compare = std::less<Key> > 
         struct flat_map_of;
-      template<typename Key, typename T, typename Compare = std::less<Key>, 
-               typename Options = tree_assoc_defaults> 
+      template<typename Key, typename T, typename Compare = std::less<Key> > 
         struct flat_multimap_of;
 
       typedef boost::container::flat_map< Key, T, Compare, polymorphic_allocator< std::pair< Key, T > > > flat_map;
@@ -239,11 +234,9 @@
 
    namespace boost {
   namespace container {
     namespace pmr {
-      template<typename Key, typename Compare = std::less<Key>, 
-               typename Options = tree_assoc_defaults> 
+      template<typename Key, typename Compare = std::less<Key> > 
         struct flat_set_of;
-      template<typename Key, typename Compare = std::less<Key>, 
-               typename Options = tree_assoc_defaults> 
+      template<typename Key, typename Compare = std::less<Key> > 
         struct flat_multiset_of;
 
       typedef boost::container::flat_set< Key, Compare, polymorphic_allocator< Key > > flat_set;
@@ -297,10 +290,10 @@
   namespace container {
     namespace pmr {
       template<typename Key, typename T, typename Compare = std::less<Key>, 
-               typename Options = tree_assoc_defaults> 
+               typename Options = void> 
         struct map_of;
       template<typename Key, typename T, typename Compare = std::less<Key>, 
-               typename Options = tree_assoc_defaults> 
+               typename Options = void> 
         struct multimap_of;
 
       typedef boost::container::map< Key, T, Compare, polymorphic_allocator< std::pair< const Key, T > >, Options > map;
@@ -314,7 +307,7 @@
 Header <boost/container/new_allocator.hpp>
    
 
    namespace boost {
   namespace container {
-    template<> class new_allocator<void>;
+    template<> class new_allocator<void>;
 
     template<typename T> class new_allocator;
   }
@@ -352,6 +345,16 @@
     template<tree_type_enum TreeType> struct tree_type;
     template<bool Enabled> struct optimize_size;
     template<class... Options> struct tree_assoc_options;
+    struct growth_factor_50;
+    struct growth_factor_60;
+    struct growth_factor_100;
+    template<typename GrowthFactor> struct growth_factor;
+    template<typename StoredSizeType> struct stored_size;
+    template<class... Options> struct vector_options;
+
+    enum tree_type_enum;
+    typedef typename boost::container::tree_assoc_options< Options...>::type tree_assoc_options_t;
+    typedef typename boost::container::vector_options< Options...>::type vector_options_t;
   }
 }
    
 
    
@@ -448,7 +451,7 @@
 
    namespace boost {
   namespace container {
     namespace pmr {
-      class unsynchronized_pool_resource;
+      class unsynchronized_pool_resource;
     }
   }
 }
    
@@ -462,11 +465,11 @@
       class scoped_allocator_adaptor;
     template<typename OuterA1, typename OuterA2, 
              BOOST_CONTAINER_SCOPEDALLOC_ALLINNERCLASS > 
-      bool operator==(const scoped_allocator_adaptor< OuterA1, InnerAllocs...> & a, 
+      bool operator==(const scoped_allocator_adaptor< OuterA1, InnerAllocs...> & a, 
                       const scoped_allocator_adaptor< OuterA2, InnerAllocs...> & b);
     template<typename OuterA1, typename OuterA2, 
              BOOST_CONTAINER_SCOPEDALLOC_ALLINNERCLASS > 
-      bool operator!=(const scoped_allocator_adaptor< OuterA1, InnerAllocs...> & a, 
+      bool operator!=(const scoped_allocator_adaptor< OuterA1, InnerAllocs...> & a, 
                       const scoped_allocator_adaptor< OuterA2, InnerAllocs...> & b);
   }
 }
@@ -483,7 +486,7 @@
   namespace container {
     template<typename Key, typename Compare = std::less<Key>, 
              typename Allocator = new_allocator<Key>, 
-             typename Options = tree_assoc_defaults> 
+             typename Options = void> 
       class set;
     template<typename Key, typename Compare = std::less<Key>, 
              typename Allocator = new_allocator<Key>, 
@@ -499,10 +502,10 @@
   namespace container {
     namespace pmr {
       template<typename Key, typename Compare = std::less<Key>, 
-               typename Options = tree_assoc_defaults> 
+               typename Options = void> 
         struct set_of;
       template<typename Key, typename Compare = std::less<Key>, 
-               typename Options = tree_assoc_defaults> 
+               typename Options = void> 
         struct multiset_of;
 
       typedef boost::container::set< Key, Compare, polymorphic_allocator< Key >, Options > set;
@@ -520,7 +523,7 @@
   }
 }namespace std {
   template<typename T, typename Allocator> 
-    class insert_iterator<boost::container::slist< T, Allocator >>;
+    class insert_iterator<boost::container::slist< T, Allocator >>;
 }
 
 
    
@@ -592,25 +595,25 @@
   namespace container {
     template<typename Value, std::size_t Capacity> class static_vector;
     template<typename V, std::size_t C1, std::size_t C2> 
-      bool operator==(static_vector< V, C1 > const &, 
+      bool operator==(static_vector< V, C1 > const &, 
                       static_vector< V, C2 > const &);
     template<typename V, std::size_t C1, std::size_t C2> 
-      bool operator!=(static_vector< V, C1 > const &, 
+      bool operator!=(static_vector< V, C1 > const &, 
                       static_vector< V, C2 > const &);
     template<typename V, std::size_t C1, std::size_t C2> 
-      bool operator<(static_vector< V, C1 > const &, 
+      bool operator<(static_vector< V, C1 > const &, 
                      static_vector< V, C2 > const &);
     template<typename V, std::size_t C1, std::size_t C2> 
-      bool operator>(static_vector< V, C1 > const &, 
+      bool operator>(static_vector< V, C1 > const &, 
                      static_vector< V, C2 > const &);
     template<typename V, std::size_t C1, std::size_t C2> 
-      bool operator<=(static_vector< V, C1 > const &, 
+      bool operator<=(static_vector< V, C1 > const &, 
                       static_vector< V, C2 > const &);
     template<typename V, std::size_t C1, std::size_t C2> 
-      bool operator>=(static_vector< V, C1 > const &, 
+      bool operator>=(static_vector< V, C1 > const &, 
                       static_vector< V, C2 > const &);
     template<typename V, std::size_t C1, std::size_t C2> 
-      void swap(static_vector< V, C1 > &, static_vector< V, C2 > &);
+      void swap(static_vector< V, C1 > &, static_vector< V, C2 > &);
   }
 }
 
    
@@ -626,152 +629,152 @@
     typedef basic_string< wchar_t,std::char_traits< wchar_t >,new_allocator< wchar_t > > wstring;
     template<typename CharT, typename Traits, typename Allocator> 
       basic_string< CharT, Traits, Allocator > 
-      operator+(const basic_string< CharT, Traits, Allocator > & x, 
+      operator+(const basic_string< CharT, Traits, Allocator > & x, 
                 const basic_string< CharT, Traits, Allocator > & y);
     template<typename CharT, typename Traits, typename Allocator> 
       basic_string< CharT, Traits, Allocator > 
-      operator+(basic_string< CharT, Traits, Allocator > && x, 
+      operator+(basic_string< CharT, Traits, Allocator > && x, 
                 basic_string< CharT, Traits, Allocator > && y);
     template<typename CharT, typename Traits, typename Allocator> 
       basic_string< CharT, Traits, Allocator > 
-      operator+(basic_string< CharT, Traits, Allocator > && x, 
+      operator+(basic_string< CharT, Traits, Allocator > && x, 
                 const basic_string< CharT, Traits, Allocator > & y);
     template<typename CharT, typename Traits, typename Allocator> 
       basic_string< CharT, Traits, Allocator > 
-      operator+(const basic_string< CharT, Traits, Allocator > & x, 
+      operator+(const basic_string< CharT, Traits, Allocator > & x, 
                 basic_string< CharT, Traits, Allocator > && y);
     template<typename CharT, typename Traits, typename Allocator> 
       basic_string< CharT, Traits, Allocator > 
-      operator+(const CharT * s, basic_string< CharT, Traits, Allocator > y);
+      operator+(const CharT * s, basic_string< CharT, Traits, Allocator > y);
     template<typename CharT, typename Traits, typename Allocator> 
       basic_string< CharT, Traits, Allocator > 
-      operator+(basic_string< CharT, Traits, Allocator > x, const CharT * s);
+      operator+(basic_string< CharT, Traits, Allocator > x, const CharT * s);
     template<typename CharT, typename Traits, typename Allocator> 
       basic_string< CharT, Traits, Allocator > 
-      operator+(CharT c, basic_string< CharT, Traits, Allocator > y);
+      operator+(CharT c, basic_string< CharT, Traits, Allocator > y);
     template<typename CharT, typename Traits, typename Allocator> 
       basic_string< CharT, Traits, Allocator > 
-      operator+(basic_string< CharT, Traits, Allocator > x, const CharT c);
+      operator+(basic_string< CharT, Traits, Allocator > x, const CharT c);
     template<typename CharT, typename Traits, typename Allocator> 
-      bool operator==(const basic_string< CharT, Traits, Allocator > & x, 
+      bool operator==(const basic_string< CharT, Traits, Allocator > & x, 
                       const basic_string< CharT, Traits, Allocator > & y);
     template<typename CharT, typename Traits, typename Allocator> 
-      bool operator==(const CharT * s, 
+      bool operator==(const CharT * s, 
                       const basic_string< CharT, Traits, Allocator > & y);
     template<typename CharT, typename Traits, typename Allocator> 
-      bool operator==(const basic_string< CharT, Traits, Allocator > & x, 
+      bool operator==(const basic_string< CharT, Traits, Allocator > & x, 
                       const CharT * s);
     template<typename CharT, typename Traits, typename Allocator, 
              template< class, class > class BasicStringView> 
-      bool operator==(BasicStringView< CharT, Traits > x, 
+      bool operator==(BasicStringView< CharT, Traits > x, 
                       const basic_string< CharT, Traits, Allocator > & y);
     template<typename CharT, typename Traits, typename Allocator, 
              template< class, class > class BasicStringView> 
-      bool operator==(const basic_string< CharT, Traits, Allocator > & x, 
+      bool operator==(const basic_string< CharT, Traits, Allocator > & x, 
                       BasicStringView< CharT, Traits > y);
     template<typename CharT, typename Traits, typename Allocator> 
-      bool operator!=(const basic_string< CharT, Traits, Allocator > & x, 
+      bool operator!=(const basic_string< CharT, Traits, Allocator > & x, 
                       const basic_string< CharT, Traits, Allocator > & y);
     template<typename CharT, typename Traits, typename Allocator> 
-      bool operator!=(const CharT * s, 
+      bool operator!=(const CharT * s, 
                       const basic_string< CharT, Traits, Allocator > & y);
     template<typename CharT, typename Traits, typename Allocator> 
-      bool operator!=(const basic_string< CharT, Traits, Allocator > & x, 
+      bool operator!=(const basic_string< CharT, Traits, Allocator > & x, 
                       const CharT * s);
     template<typename CharT, typename Traits, typename Allocator, 
              template< class, class > class BasicStringView> 
-      bool operator!=(BasicStringView< CharT, Traits > x, 
+      bool operator!=(BasicStringView< CharT, Traits > x, 
                       const basic_string< CharT, Traits, Allocator > & y);
     template<typename CharT, typename Traits, typename Allocator, 
              template< class, class > class BasicStringView> 
-      bool operator!=(const basic_string< CharT, Traits, Allocator > & x, 
+      bool operator!=(const basic_string< CharT, Traits, Allocator > & x, 
                       BasicStringView< CharT, Traits > y);
     template<typename CharT, typename Traits, typename Allocator> 
-      bool operator<(const basic_string< CharT, Traits, Allocator > & x, 
+      bool operator<(const basic_string< CharT, Traits, Allocator > & x, 
                      const basic_string< CharT, Traits, Allocator > & y);
     template<typename CharT, typename Traits, typename Allocator> 
-      bool operator<(const CharT * s, 
+      bool operator<(const CharT * s, 
                      const basic_string< CharT, Traits, Allocator > & y);
     template<typename CharT, typename Traits, typename Allocator> 
-      bool operator<(const basic_string< CharT, Traits, Allocator > & x, 
+      bool operator<(const basic_string< CharT, Traits, Allocator > & x, 
                      const CharT * s);
     template<typename CharT, typename Traits, typename Allocator, 
              template< class, class > class BasicStringView> 
-      bool operator<(BasicStringView< CharT, Traits > x, 
+      bool operator<(BasicStringView< CharT, Traits > x, 
                      const basic_string< CharT, Traits, Allocator > & y);
     template<typename CharT, typename Traits, typename Allocator, 
              template< class, class > class BasicStringView> 
-      bool operator<(const basic_string< CharT, Traits, Allocator > & x, 
+      bool operator<(const basic_string< CharT, Traits, Allocator > & x, 
                      BasicStringView< CharT, Traits > y);
     template<typename CharT, typename Traits, typename Allocator> 
-      bool operator>(const basic_string< CharT, Traits, Allocator > & x, 
+      bool operator>(const basic_string< CharT, Traits, Allocator > & x, 
                      const basic_string< CharT, Traits, Allocator > & y);
     template<typename CharT, typename Traits, typename Allocator> 
-      bool operator>(const CharT * s, 
+      bool operator>(const CharT * s, 
                      const basic_string< CharT, Traits, Allocator > & y);
     template<typename CharT, typename Traits, typename Allocator> 
-      bool operator>(const basic_string< CharT, Traits, Allocator > & x, 
+      bool operator>(const basic_string< CharT, Traits, Allocator > & x, 
                      const CharT * s);
     template<typename CharT, typename Traits, typename Allocator, 
              template< class, class > class BasicStringView> 
-      bool operator>(BasicStringView< CharT, Traits > x, 
+      bool operator>(BasicStringView< CharT, Traits > x, 
                      const basic_string< CharT, Traits, Allocator > & y);
     template<typename CharT, typename Traits, typename Allocator, 
              template< class, class > class BasicStringView> 
-      bool operator>(const basic_string< CharT, Traits, Allocator > & x, 
+      bool operator>(const basic_string< CharT, Traits, Allocator > & x, 
                      BasicStringView< CharT, Traits > y);
     template<typename CharT, typename Traits, typename Allocator> 
-      bool operator<=(const basic_string< CharT, Traits, Allocator > & x, 
+      bool operator<=(const basic_string< CharT, Traits, Allocator > & x, 
                       const basic_string< CharT, Traits, Allocator > & y);
     template<typename CharT, typename Traits, typename Allocator> 
-      bool operator<=(const CharT * s, 
+      bool operator<=(const CharT * s, 
                       const basic_string< CharT, Traits, Allocator > & y);
     template<typename CharT, typename Traits, typename Allocator> 
-      bool operator<=(const basic_string< CharT, Traits, Allocator > & x, 
+      bool operator<=(const basic_string< CharT, Traits, Allocator > & x, 
                       const CharT * s);
     template<typename CharT, typename Traits, typename Allocator, 
              template< class, class > class BasicStringView> 
-      bool operator<=(BasicStringView< CharT, Traits > x, 
+      bool operator<=(BasicStringView< CharT, Traits > x, 
                       const basic_string< CharT, Traits, Allocator > & y);
     template<typename CharT, typename Traits, typename Allocator, 
              template< class, class > class BasicStringView> 
-      bool operator<=(const basic_string< CharT, Traits, Allocator > & x, 
+      bool operator<=(const basic_string< CharT, Traits, Allocator > & x, 
                       BasicStringView< CharT, Traits > y);
     template<typename CharT, typename Traits, typename Allocator> 
-      bool operator>=(const basic_string< CharT, Traits, Allocator > & x, 
+      bool operator>=(const basic_string< CharT, Traits, Allocator > & x, 
                       const basic_string< CharT, Traits, Allocator > & y);
     template<typename CharT, typename Traits, typename Allocator> 
-      bool operator>=(const CharT * s, 
+      bool operator>=(const CharT * s, 
                       const basic_string< CharT, Traits, Allocator > & y);
     template<typename CharT, typename Traits, typename Allocator> 
-      bool operator>=(const basic_string< CharT, Traits, Allocator > & x, 
+      bool operator>=(const basic_string< CharT, Traits, Allocator > & x, 
                       const CharT * s);
     template<typename CharT, typename Traits, typename Allocator, 
              template< class, class > class BasicStringView> 
-      bool operator>=(BasicStringView< CharT, Traits > x, 
+      bool operator>=(BasicStringView< CharT, Traits > x, 
                       const basic_string< CharT, Traits, Allocator > & y);
     template<typename CharT, typename Traits, typename Allocator, 
              template< class, class > class BasicStringView> 
-      bool operator>=(const basic_string< CharT, Traits, Allocator > & x, 
+      bool operator>=(const basic_string< CharT, Traits, Allocator > & x, 
                       BasicStringView< CharT, Traits > y);
     template<typename CharT, typename Traits, typename Allocator> 
-      void swap(basic_string< CharT, Traits, Allocator > & x, 
+      void swap(basic_string< CharT, Traits, Allocator > & x, 
                 basic_string< CharT, Traits, Allocator > & y);
     template<typename CharT, typename Traits, typename Allocator> 
       std::basic_ostream< CharT, Traits > & 
-      operator<<(std::basic_ostream< CharT, Traits > & os, 
+      operator<<(std::basic_ostream< CharT, Traits > & os, 
                  const basic_string< CharT, Traits, Allocator > & s);
     template<typename CharT, typename Traits, typename Allocator> 
       std::basic_istream< CharT, Traits > & 
-      operator>>(std::basic_istream< CharT, Traits > & is, 
+      operator>>(std::basic_istream< CharT, Traits > & is, 
                  basic_string< CharT, Traits, Allocator > & s);
     template<typename CharT, typename Traits, typename Allocator> 
       std::basic_istream< CharT, Traits > & 
-      getline(std::istream & is, basic_string< CharT, Traits, Allocator > & s, 
+      getline(std::istream & is, basic_string< CharT, Traits, Allocator > & s, 
               CharT delim);
     template<typename CharT, typename Traits, typename Allocator> 
       std::basic_istream< CharT, Traits > & 
-      getline(std::basic_istream< CharT, Traits > & is, 
+      getline(std::basic_istream< CharT, Traits > & is, 
               basic_string< CharT, Traits, Allocator > & s);
     template<typename Ch, typename Allocator> 
       std::size_t hash_value(basic_string< Ch, std::char_traits< Ch >, Allocator > const & v);
@@ -812,8 +815,8 @@
 Header <boost/container/uses_allocator.hpp>
 
    namespace boost {
   namespace container {
-    template<typename T> struct constructible_with_allocator_suffix;
-    template<typename T> struct constructible_with_allocator_prefix;
+    template<typename T> struct constructible_with_allocator_suffix;
+    template<typename T> struct constructible_with_allocator_prefix;
     template<typename T, typename Allocator> struct uses_allocator;
   }
 }
    
@@ -821,7 +824,7 @@
 
    
 
    
-
    This header forward declares boost::container::constructible_with_allocator_prefix, boost::container::constructible_with_allocator_suffix and boost::container::uses_allocator. Also defines the following types: 
    
+
    This header forward declares boost::container::constructible_with_allocator_prefix, boost::container::constructible_with_allocator_suffix and boost::container::uses_allocator. Also defines the following types: 
    
 
    namespace boost {
   namespace container {
     struct erased_type;
@@ -836,7 +839,9 @@
 Header <boost/container/vector.hpp>
    
 
    namespace boost {
   namespace container {
-    template<typename T, typename Allocator = new_allocator<T> > class vector;
+    template<typename T, typename Allocator = new_allocator<T>, 
+             typename Options = void> 
+      class vector;
   }
 }
    
 
@@ -856,7 +861,8 @@
 
 
-
    
 
    Copyright © 2009-2015 Ion Gaztanaga
    
+
    Copyright © 2009-2017 Ion
+      Gaztanaga
    
         Distributed under the Boost Software License, Version 1.0. (See accompanying
         file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
       
    
diff --git a/doc/html/boost_dll.html b/doc/html/boost_dll.html
index f92b5541f0..659453346e 100644
--- a/doc/html/boost_dll.html
+++ b/doc/html/boost_dll.html
@@ -2,7 +2,7 @@
 
 
 
-Chapter 12. Boost.DLL
+Chapter 13. Boost.DLL
 
 
 
@@ -26,7 +26,7 @@
 
    
 
    
 
    
-Chapter 12. Boost.DLL
    
+Chapter 13. Boost.DLL
    
 
    
 Renato Forti
 
    
@@ -151,7 +151,7 @@
 
    
 
    
 
-
+
    Last revised: December 14, 2017 at 00:08:10 GMT
    Last revised: April 11, 2018 at 14:10:08 GMT
    		
 
    		
 
    
 
    
diff --git a/doc/html/boost_dll/acknowledgements.html b/doc/html/boost_dll/acknowledgements.html
index f823f49fce..673903df49 100644
--- a/doc/html/boost_dll/acknowledgements.html
+++ b/doc/html/boost_dll/acknowledgements.html
@@ -6,9 +6,9 @@
 
 
 
-
+
 
-
+
 
 
 
diff --git a/doc/html/boost_dll/dependencies.html b/doc/html/boost_dll/dependencies.html
index 9308b73383..b5e068eb1f 100644
--- a/doc/html/boost_dll/dependencies.html
+++ b/doc/html/boost_dll/dependencies.html
@@ -6,7 +6,7 @@
 
-
+
diff --git a/doc/html/boost_dll/design_rationale.html b/doc/html/boost_dll/design_rationale.html
index 7cdff2b699..307a91cc9d 100644
--- a/doc/html/boost_dll/design_rationale.html
+++ b/doc/html/boost_dll/design_rationale.html
@@ -6,7 +6,7 @@
 
-
+
diff --git a/doc/html/boost_dll/f_a_q_.html b/doc/html/boost_dll/f_a_q_.html
index 27504191c5..50227f4f8c 100644
--- a/doc/html/boost_dll/f_a_q_.html
+++ b/doc/html/boost_dll/f_a_q_.html
@@ -6,7 +6,7 @@
 
-
+
diff --git a/doc/html/boost_dll/getting_started.html b/doc/html/boost_dll/getting_started.html
index 6fb5c014b4..e0432390f9 100644
--- a/doc/html/boost_dll/getting_started.html
+++ b/doc/html/boost_dll/getting_started.html
@@ -6,8 +6,8 @@
 
-
-
+
+
diff --git a/doc/html/boost_dll/limitations.html b/doc/html/boost_dll/limitations.html
index 66f0ef2462..72fe502232 100644
--- a/doc/html/boost_dll/limitations.html
+++ b/doc/html/boost_dll/limitations.html
@@ -6,7 +6,7 @@
 
-
+
@@ -59,11 +59,11 @@
       
    
         Unit that must hold an instance of BOOST_DLL_ALIAS
-        must define BOOST_DLL_FORCE_ALIAS_INSTANTIATION
+        must define BOOST_DLL_FORCE_ALIAS_INSTANTIATION
         before including any of the Boost.DLL library headers.
       
    
-        You may explicitly disable export of weak symbols using BOOST_DLL_FORCE_NO_WEAK_EXPORTS.
+        You may explicitly disable export of weak symbols using BOOST_DLL_FORCE_NO_WEAK_EXPORTS.
         This may be usefull for working around linker problems or to test your program
         for compatability with linkers that do not support exporting weak symbols.
       
    
diff --git a/doc/html/boost_dll/mangled_import.html b/doc/html/boost_dll/mangled_import.html
index cf440f7e4c..1101a1b8f9 100644
--- a/doc/html/boost_dll/mangled_import.html
+++ b/doc/html/boost_dll/mangled_import.html
@@ -6,7 +6,7 @@
 
-
+
diff --git a/doc/html/boost_dll/missuses.html b/doc/html/boost_dll/missuses.html
index 7d9f91a2e6..db58905124 100644
--- a/doc/html/boost_dll/missuses.html
+++ b/doc/html/boost_dll/missuses.html
@@ -6,7 +6,7 @@
 
-
+
diff --git a/doc/html/boost_dll/reference.html b/doc/html/boost_dll/reference.html
index 7fd03ac532..7b3ea0d083 100644
--- a/doc/html/boost_dll/reference.html
+++ b/doc/html/boost_dll/reference.html
@@ -6,9 +6,9 @@
 
-
+
-
+
    
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
    
@@ -21,7 +21,7 @@
 
    
 
    
 
    
-PrevUpHomeNext
+PrevUpHomeNext
 
    
 
    
 
    
@@ -48,8 +48,8 @@
 
    Includes alias methods and macro. You can include this header or boost/dll/shared_library.hpp to reduce dependencies in case you do not use the refcountable functions. 
    
 
     
-BOOST_DLL_FORCE_ALIAS_INSTANTIATION
-BOOST_DLL_FORCE_NO_WEAK_EXPORTS
+BOOST_DLL_FORCE_ALIAS_INSTANTIATION
+BOOST_DLL_FORCE_NO_WEAK_EXPORTS
 BOOST_DLL_SELECTANY
 BOOST_DLL_SECTION(SectionName, Permissions)
 BOOST_DLL_ALIAS(FunctionOrVar, AliasName)
@@ -102,7 +102,7 @@
     bool operator!=(const shared_library & lhs, const shared_library & rhs);
 
     // Compare the actual DLL/DSO objects without any guarantee to be stable between runs. Throws nothing. 
-    bool operator<(const shared_library & lhs, const shared_library & rhs);
+    bool operator<(const shared_library & lhs, const shared_library & rhs);
 
     // Swaps two shared libraries. Does not invalidate symbols and functions loaded from libraries. Throws nothing. 
     void swap(shared_library & lhs, shared_library & rhs);
@@ -119,8 +119,8 @@
       enum type;
 
       // Free operators for load_mode::type flag manipulation. 
-      BOOST_CONSTEXPR type operator|(type left, type right);
-      BOOST_CXX14_CONSTEXPR type & operator|=(type & left, type right);
+      BOOST_CONSTEXPR type operator|(type left, type right);
+      BOOST_CXX14_CONSTEXPR type & operator|=(type & left, type right);
       BOOST_CONSTEXPR type operator&(type left, type right);
       BOOST_CXX14_CONSTEXPR type & operator&=(type & left, type right);
       BOOST_CONSTEXPR type operator^(type left, type right);
@@ -155,20 +155,20 @@
       bool operator!=(const smart_library & lhs, const smart_library & rhs);
 
       // Compare the actual DLL/DSO objects without any guarantee to be stable between runs. Throws nothing. 
-      bool operator<(const smart_library & lhs, const smart_library & rhs);
+      bool operator<(const smart_library & lhs, const smart_library & rhs);
 
       // Swaps two shared libraries. Does not invalidate symbols and functions loaded from libraries. Throws nothing. 
       void swap(smart_library & lhs, smart_library & rhs);
       template<typename T, typename T2> 
-        void get(const smart_library &, const std::string &);
+        void get(const smart_library &, const std::string &);
       template<typename T> 
-        T & get(const smart_library & sm, const std::string & name, 
+        T & get(const smart_library & sm, const std::string & name, 
                 typename boost::enable_if< boost::is_object< T >, T >::type * = nullptr);
       template<typename T> 
-        auto get(const smart_library & sm, const std::string & name, 
+        auto get(const smart_library & sm, const std::string & name, 
                  typename boost::enable_if< boost::is_function< T >>::type * = nullptr);
       template<typename Class, typename Signature> 
-        auto get(const smart_library &, const std::string &);
+        auto get(const smart_library &, const std::string &);
     }
   }
 }
    
@@ -228,47 +228,47 @@
       template<typename T> class imported_class;
       template<typename T, typename... Args> 
         imported_class< T > 
-        import_class(const smart_library &, std::size_t, Args...);
+        import_class(const smart_library &, std::size_t, Args...);
       template<typename T, typename... Args> 
         imported_class< T > 
-        import_class(const smart_library &, std::size_t, const std::string &, 
+        import_class(const smart_library &, std::size_t, const std::string &, 
                      Args...);
       template<typename T, typename... Args> 
         imported_class< T > 
-        import_class(const smart_library &, const std::string &, std::size_t, 
+        import_class(const smart_library &, const std::string &, std::size_t, 
                      Args...);
       template<typename T, typename... Args> 
-        imported_class< T > import_class(smart_library &&, Args...);
+        imported_class< T > import_class(smart_library &&, Args...);
       template<typename T, typename... Args> 
         imported_class< T > 
-        import_class(smart_library &&, const std::string &, Args...);
+        import_class(smart_library &&, const std::string &, Args...);
       template<typename T, typename... Args> 
         imported_class< T > 
-        import_class(smart_library &&, std::size_t, Args...);
+        import_class(smart_library &&, std::size_t, Args...);
       template<typename T, typename... Args> 
         imported_class< T > 
-        import_class(smart_library &&, std::size_t, const std::string &, 
+        import_class(smart_library &&, std::size_t, const std::string &, 
                      Args...);
       template<typename T, typename... Args> 
         imported_class< T > 
-        import_class(smart_library &&, const std::string &, std::size_t, 
+        import_class(smart_library &&, const std::string &, std::size_t, 
                      Args...);
       template<typename T, typename... Args> 
-        imported_class< T > import_class(smart_library & lib, Args... args);
+        imported_class< T > import_class(smart_library & lib, Args... args);
       template<typename T, typename... Args> 
         imported_class< T > 
-        import_class(smart_library & lib, const std::string & alias_name, 
+        import_class(smart_library & lib, const std::string & alias_name, 
                      Args... args);
       template<typename T, typename... Args> 
         imported_class< T > 
-        import_class(smart_library & lib, std::size_t size, Args... args);
+        import_class(smart_library & lib, std::size_t size, Args... args);
       template<typename T, typename... Args> 
         imported_class< T > 
-        import_class(smart_library & lib, std::size_t size, 
+        import_class(smart_library & lib, std::size_t size, 
                      const std::string & alias_name, Args... args);
       template<typename T, typename... Args> 
         imported_class< T > 
-        import_class(smart_library & lib, const std::string & alias_name, 
+        import_class(smart_library & lib, const std::string & alias_name, 
                      std::size_t size, Args... args);
     }
   }
@@ -321,7 +321,7 @@
 
    
 
    
 
    
-PrevUpHomeNext
+PrevUpHomeNext
 
    
 
 
diff --git a/doc/html/boost_dll/revision_history.html b/doc/html/boost_dll/revision_history.html
index 1c88566f8c..5f97edbaed 100644
--- a/doc/html/boost_dll/revision_history.html
+++ b/doc/html/boost_dll/revision_history.html
@@ -6,7 +6,7 @@
 
 
 
-
+
 
 
 
diff --git a/doc/html/boost_dll/tutorial.html b/doc/html/boost_dll/tutorial.html
index 4e8b17f63f..7a69ab876e 100644
--- a/doc/html/boost_dll/tutorial.html
+++ b/doc/html/boost_dll/tutorial.html
@@ -6,7 +6,7 @@
 
 
 
-
+
 
 
 
diff --git a/doc/html/boost_lexical_cast.html b/doc/html/boost_lexical_cast.html
index 369dd97df3..5277219745 100644
--- a/doc/html/boost_lexical_cast.html
+++ b/doc/html/boost_lexical_cast.html
@@ -156,7 +156,7 @@
 
 
 
-
+
    Last revised: December 14, 2017 at 00:06:09 GMT
    Last revised: April 11, 2018 at 14:08:08 GMT
    		
 
    		
 
    
 
    
diff --git a/doc/html/boost_process/acknowledgements.html b/doc/html/boost_process/acknowledgements.html
index b85fc8c7fc..1d2503a6ed 100644
--- a/doc/html/boost_process/acknowledgements.html
+++ b/doc/html/boost_process/acknowledgements.html
@@ -7,7 +7,7 @@
 
 
 
-
+
 
 
 
@@ -21,7 +21,7 @@
 
    
 
    
 
    
-PrevUpHomeNext
+PrevUpHomeNext
 
    
 
    
 
    
@@ -63,7 +63,7 @@
 
    
 
    
 
    
-PrevUpHomeNext
+PrevUpHomeNext
 
    
 
 
diff --git a/doc/html/boost_process/extend.html b/doc/html/boost_process/extend.html
index ed171636a1..ca70d511a9 100644
--- a/doc/html/boost_process/extend.html
+++ b/doc/html/boost_process/extend.html
@@ -201,16 +201,6 @@
 
 
    
       
    
-
    
-
-
-
-
-
-
    [Caution]Caution
    
-          All async_handlers use one signal(SIGCHLD) on posix, which is only guaranteed
-          to work when all use the same boost::asio::io_service
-        
    
 
    
@@ -266,6 +256,18 @@
           is inherited.
         
    
 
    
 [Note]
    
 
    
+
    
+
+
+
+
+
+
    [Caution]Caution
    
+          on_exit_handler uses boost::asio::signal_set to listen for SIGCHLD on posix.
+          The application must not also register a signal handler for SIGCHLD using
+          functions such as signal() or sigaction() (but using boost::asio::signal_set
+          is fine).
+        
    
 
 
    
 
    
diff --git a/doc/html/boost_process/tutorial.html b/doc/html/boost_process/tutorial.html
index f428bc8abc..074300ecf5 100644
--- a/doc/html/boost_process/tutorial.html
+++ b/doc/html/boost_process/tutorial.html
@@ -138,9 +138,9 @@
 Launch functions
 
    
 
    
-        Given that in our example used the system
+        Given that our example used the system
         function, our program will wait until the child process is completed. This
-        maybe unwanted, especially since compiling can take a while.
+        may be unwanted, especially since compiling can take a while.
       
    
 
    
         In order to avoid that, boost.process provides several ways to launch a process.
@@ -170,18 +170,18 @@
 
    
 
    bp::child c(bp::search_path("g++"), "main.cpp");
 
-while (c.running())
+while (c.running())
     do_some_stuff();
 
-c.wait(); //wait for the process to exit   
-int result = c.exit_code();
+c.wait(); //wait for the process to exit   
+int result = c.exit_code();
 
    
 
    
       
    
 
    
         So we launch the process, by calling the child constructor. Then we check
         and do other things while the process is running and afterwards get the exit
-        code. The call to wait
+        code. The call to wait
         is necessary, to obtain it and tell the operating system, that no one is
         waiting for the process anymore.
       
    
@@ -191,7 +191,7 @@
 
    		Note
 
    
 
    
-          You can also wait for a time span or a until a time point with wait_for and wait_until
+          You can also wait for a time span or a until a time point with wait_for and wait_until
         
    
 
    
 
    
@@ -201,7 +201,7 @@
 
    
 
    
           If you don't call wait on a child object, it will be terminated on destruction.
-          This can be avoided by calling detach
+          This can be avoided by calling detach
           beforehand
         
    
 
    
@@ -213,10 +213,10 @@
 
    
         Until now, we have assumed that everything works out, but it is not impossible,
         that "g++" is not present. That will cause the launch of the process
-        to fail. The default behaviour of all functions is to throw an std::system_error
+        to fail. The default behaviour of all functions is to throw a std::system_error
         on failure. As with many other functions in this library, passing an std::error_code
         will change the behaviour, so that instead of throwing an exception, the
-        error will be a assigned to the error code.
+        error will be assigned to the error code.
       
    
 
    
 
    
@@ -285,10 +285,10 @@
     std::vector<std::string> data;
     std::string line;
 
-    while (c.running() && std::getline(is, line) && !line.empty())
+    while (c.running() && std::getline(is, line) && !line.empty())
         data.push_back(line);
 
-    c.wait();
+    c.wait();
 
     return data;
 }
@@ -334,7 +334,7 @@
 std::string value;
 out >> value;
 
-c.terminate();
+c.terminate();
 
 
    
       
    
@@ -359,7 +359,7 @@
     while (filt.running() && std::getline(is, line)) //when nm finished the pipe closes and c++filt exits
         outline.push_back(line);
 
-    nm.wait();
+    nm.wait();
     filt.wait();
 }
 
@@ -404,7 +404,6 @@
                 [](const boost::system::error_code &ec, std::size_t size){});
 
 ios.run();
-c.wait();
 int result = c.exit_code();
 
 
    
@@ -422,7 +421,6 @@
 bp::child c(bp::search_path("g++"), "main.cpp", bp::std_out > boost::asio::buffer(buf), ios);
 
 ios.run();
-c.wait();
 int result = c.exit_code();
 
 
    
@@ -435,7 +433,7 @@
 
    
           Passing an instance of boost::asio::io_service
           to the launching function automatically cause it to wait asynchronously
-          for the exit, so no call of wait
+          for the exit, so no call of wait
           is needed
         
    
 
    
@@ -494,7 +492,7 @@
 
 
    
         If we have program like make,
-        which does launch its own child processes, a call of terminate
+        which does launch its own child processes, a call of terminate
         might not suffice. I.e. if we have a makefile launching gcc
         and use the following code, the gcc
         process will still run afterwards:
@@ -502,8 +500,8 @@
 
    
 
    
 
    bp::child c("make");
-if (!c.wait_for(std::chrono::seconds(10)) //give it 10 seconds
-    c.terminate(); //then terminate
+if (!c.wait_for(std::chrono::seconds(10)) //give it 10 seconds
+    c.terminate(); //then terminate
 
    
 
    
       
    
@@ -515,15 +513,15 @@
 
    
 
    bp::group g;
 bp::child c("make", g);
-if (!g.wait_for(std::chrono::seconds(10))
-    g.terminate();
+if (!g.wait_for(std::chrono::seconds(10))
+    g.terminate();
 
-c.wait(); //to avoid a zombie process & get the exit code
+c.wait(); //to avoid a zombie process & get the exit code
 
    
 
    
       
    
 
    
-        Now given the example, we still call wait
+        Now given the example, we still call wait
         to avoid a zombie process. An easier solution for that might be to use spawn.
       
    
 
    
@@ -541,7 +539,7 @@
 
     do_something();
 
-    g.wait();
+    g.wait();
 };
 
 
    
diff --git a/doc/html/boost_random.html b/doc/html/boost_random.html
index c9ca848cbc..460b2b9209 100644
--- a/doc/html/boost_random.html
+++ b/doc/html/boost_random.html
@@ -93,7 +93,7 @@
 
 
 
-
+
    Last revised: December 14, 2017 at 00:06:01 GMT
    Last revised: April 11, 2018 at 14:08:03 GMT
    		
 
    		
 
    
 
    
diff --git a/doc/html/boost_random/tutorial.html b/doc/html/boost_random/tutorial.html
index aedc40161c..4e76fc1444 100644
--- a/doc/html/boost_random/tutorial.html
+++ b/doc/html/boost_random/tutorial.html
@@ -201,6 +201,7 @@
 
    
 
    #include <boost/random/random_device.hpp>
 #include <boost/random/uniform_int_distribution.hpp>
+#include <iostream>
 
 int main() {
     1std::string chars(
diff --git a/doc/html/boost_typeerasure.html b/doc/html/boost_typeerasure.html
index 7d9a86d1c0..08060ce5b0 100644
--- a/doc/html/boost_typeerasure.html
+++ b/doc/html/boost_typeerasure.html
@@ -203,7 +203,7 @@
 
 
 
-
+
    Last revised: December 14, 2017 at 00:05:59 GMT
    Last revised: April 11, 2018 at 14:08:02 GMT
    		
 
    		
 
    
 
    
diff --git a/doc/html/boost_typeerasure/basic.html b/doc/html/boost_typeerasure/basic.html
index f73b5c92c8..129886b9be 100644
--- a/doc/html/boost_typeerasure/basic.html
+++ b/doc/html/boost_typeerasure/basic.html
@@ -92,7 +92,7 @@
     
    
 
    
 
    
-
    BOOST_TYPE_ERASURE_MEMBER((has_push_back), push_back, 1)
+
    BOOST_TYPE_ERASURE_MEMBER(push_back)
 
 void append_many(any<has_push_back<void(int)>, _self&> container) {
     for(int i = 0; i < 10; ++i)
@@ -104,11 +104,8 @@
 
    
       We use the macro BOOST_TYPE_ERASURE_MEMBER
       to define a concept called has_push_back.
-      The second parameter is the name of the member function and the last macro
-      parameter indicates the number of arguments which is 1
-      since push_back is unary. When
-      we use has_push_back, we have
-      to tell it the signature of the function, void(int).
+      When we use has_push_back,
+      we have to tell it the signature of the function, void(int).
       This means that the type we store in the any has to have a member that looks
       like:
     
    
@@ -135,16 +132,12 @@
       stores a reference to an external object instead of allocating its own object.
     
    
 
    
-      There's actually another placeholder
-      here. The second parameter of has_push_back
-      defaults to _self. If we wanted
-      to define a const member function, we would have to change it to const _self,
-      as shown below.
+      Member functions can be const.
     
    
 
    
 
    
-
    BOOST_TYPE_ERASURE_MEMBER((has_empty), empty, 0)
-bool is_empty(any<has_empty<bool(), const _self>, const _self&> x) {
+
    BOOST_TYPE_ERASURE_MEMBER(empty)
+bool is_empty(any<has_empty<bool() const>, const _self&> x) {
     return x.empty();
 }
 
    
@@ -155,7 +148,7 @@
     
    
 
    
 
    
-
    BOOST_TYPE_ERASURE_FREE((has_getline), getline, 2)
+
    BOOST_TYPE_ERASURE_FREE(getline)
 std::vector<std::string> read_lines(any<has_getline<bool(_self&, std::string&)>, _self&> stream)
 {
     std::vector<std::string> result;
diff --git a/doc/html/boost_typeerasure/predef.html b/doc/html/boost_typeerasure/predef.html
index d77bfd815c..cc202085d2 100644
--- a/doc/html/boost_typeerasure/predef.html
+++ b/doc/html/boost_typeerasure/predef.html
@@ -105,7 +105,8 @@
 
    
 
               
    
-                assignable<T, U = T>
+                assignable<T, U = const
+                T&>
               
    
                 		
 
diff --git a/doc/html/boost_typeerasure/reference.html b/doc/html/boost_typeerasure/reference.html
index c4cf733440..85dfb8709a 100644
--- a/doc/html/boost_typeerasure/reference.html
+++ b/doc/html/boost_typeerasure/reference.html
@@ -8,7 +8,7 @@
 
 
 
-
+
 
 
 
@@ -21,7 +21,7 @@
 
    
 
    
 
    
-PrevUpHomeNext
+PrevUpHomeNext
 
    
 
    
 
    
-
    
+
    
+
    
+
    namespace boost {
+  namespace type_erasure {
+    template<typename Concept, typename T = _self> class any;
+
+    template<typename Concept, typename T> class any<Concept, T &>;
+    template<typename Concept, typename T> class any<Concept, const T &>;
+    template<typename Concept, typename T> class any<Concept, T &&>;
+
+    typedef any< Concept, T & > any_ref;
+    typedef any< Concept, const T & > any_cref;
+    typedef any< Concept, T && > any_rvref;
+  }
+}
    
+
    
 
    
 
    
@@ -81,8 +96,15 @@
   }
 }
 
    
-
    
+
    
+
    
+
    namespace boost {
+  namespace type_erasure {
+    template<typename Concept> class binding;
+  }
+}
    
+
    
 
    
 
    
@@ -100,7 +122,8 @@
   namespace type_erasure {
     template<typename T = _self> struct destructible;
     template<typename T = _self> struct copy_constructible;
-    template<typename T = _self, typename U = T> struct assignable;
+    template<typename T = _self, typename U = const T&> struct assignable;
+    template<typename T = _self> struct typeid_;
   }
 }
 
    
@@ -129,7 +152,6 @@
 Header <boost/type_erasure/check_match.hpp>
    
 
    namespace boost {
   namespace type_erasure {
-    template<typename T> struct typeid_;
     template<typename Concept, typename Op, class... U> 
       bool check_match(const binding< Concept > &, const Op &, U &&...);
     template<typename Op, class... U> bool check_match(const Op &, U &&...);
@@ -153,6 +175,8 @@
 
    namespace boost {
   namespace type_erasure {
     template<typename T> struct concept_of;
+
+    typedef typename::boost::type_erasure::concept_of< T >::type concept_of_t;
   }
 }
    
 
@@ -189,6 +213,8 @@
 
    namespace boost {
   namespace type_erasure {
     template<typename T> struct derived;
+
+    typedef typename T::_boost_type_erasure_derived_type derived_t;
   }
 }
    
 
@@ -227,7 +253,7 @@
 Header <boost/type_erasure/free.hpp>
 
     
-BOOST_TYPE_ERASURE_FREE(qualified_name, function_name, N)
    
+BOOST_TYPE_ERASURE_FREE(concept_name, function_name)
    
 
 
    
 
    
@@ -284,7 +310,7 @@
 Header <boost/type_erasure/member.hpp>
    
 
     
-BOOST_TYPE_ERASURE_MEMBER(qualified_name, member, N)
    
+BOOST_TYPE_ERASURE_MEMBER(concept_name, member)
 
    
 
    
 
    
@@ -338,7 +364,11 @@
 Header <boost/type_erasure/param.hpp>
    
 
    namespace boost {
   namespace type_erasure {
+    template<typename Concept, typename T> class param;
+
     template<typename Any, typename T> struct as_param;
+
+    typedef typename::boost::type_erasure::as_param< Any, T >::type as_param_t;
   }
 }
    
 
    
@@ -364,9 +394,9 @@
 Header <boost/type_erasure/placeholder_of.hpp>
 
    namespace boost {
   namespace type_erasure {
-    template<typename Concept, typename T> class param;
-
     template<typename T> struct placeholder_of;
+
+    typedef typename::boost::type_erasure::placeholder_of< T >::type placeholder_of_t;
   }
 }
    
 
@@ -375,9 +405,9 @@
 Header <boost/type_erasure/rebind_any.hpp>
 
    namespace boost {
   namespace type_erasure {
-    template<typename Concept, typename T> class any;
-
     template<typename Any, typename T> struct rebind_any;
+
+    typedef typename::boost::type_erasure::rebind_any< Any, T >::type rebind_any_t;
   }
 }
    
 
@@ -407,7 +437,6 @@
 Header <boost/type_erasure/require_match.hpp>
 
    namespace boost {
   namespace type_erasure {
-    template<typename Concept> class binding;
     template<typename Concept, typename Op, class... U> 
       void require_match(const binding< Concept > &, const Op &, U &&...);
     template<typename Op, class... U> void require_match(const Op &, U &&...);
@@ -469,7 +498,7 @@
 
    
 
    
 
    
-PrevUpHomeNext
+PrevUpHomeNext
 
    
 
 
diff --git a/doc/html/boost_typeindex.html b/doc/html/boost_typeindex.html
index 4207c2175a..252d2f263b 100644
--- a/doc/html/boost_typeindex.html
+++ b/doc/html/boost_typeindex.html
@@ -157,7 +157,7 @@
 
 
 
-
+
    Last revised: December 14, 2017 at 00:05:59 GMT
    Last revised: April 11, 2018 at 14:08:01 GMT
    		
 
    		
 
    
 
    
diff --git a/doc/html/boost_typeindex/making_a_custom_type_index.html b/doc/html/boost_typeindex/making_a_custom_type_index.html
index 0585123ec5..62aef8c297 100644
--- a/doc/html/boost_typeindex/making_a_custom_type_index.html
+++ b/doc/html/boost_typeindex/making_a_custom_type_index.html
@@ -113,9 +113,9 @@
         could be also useful.
       
    
 
    
-        Since we are not going to override type_index_facade::hash_code() we must additionally include <boost/functional/hash.hpp>.
+        Since we are not going to override type_index_facade::hash_code() we must additionally include <boost/container_hash/hash.hpp>.
       
    
-
    #include <boost/functional/hash.hpp>
+
    #include <boost/container_hash/hash.hpp>
 
    
 
    
         See implementation of my_type_index:
diff --git a/doc/html/boost_typeindex_header_reference.html b/doc/html/boost_typeindex_header_reference.html
index 7ca57d10fa..7b7ab5709e 100644
--- a/doc/html/boost_typeindex_header_reference.html
+++ b/doc/html/boost_typeindex_header_reference.html
@@ -156,7 +156,6 @@
 
    
 
    namespace boost {
-  template<typename It> std::size_t hash_range(It, It);
   namespace typeindex {
     template<typename Derived, typename TypeInfo> class type_index_facade;
 
diff --git a/doc/html/boost_units.html b/doc/html/boost_units.html
index 68fe6f29e3..f54b8c80de 100644
--- a/doc/html/boost_units.html
+++ b/doc/html/boost_units.html
@@ -210,7 +210,7 @@
 
 
 
-
+
    Last revised: December 14, 2017 at 00:05:58 GMT
    Last revised: April 11, 2018 at 14:08:01 GMT
    		
 
    		
 
    
 
    
diff --git a/doc/html/boost_units/Examples.html b/doc/html/boost_units/Examples.html
index d07cae4e53..b896ced22a 100644
--- a/doc/html/boost_units/Examples.html
+++ b/doc/html/boost_units/Examples.html
@@ -381,6 +381,7 @@
 
    
 
    /// the physical definition of work - computed for an arbitrary unit system 
 template<class System,class Y>
+constexpr
 quantity<unit<energy_dimension,System>,Y>
 work(quantity<unit<force_dimension,System>,Y> F,
      quantity<unit<length_dimension,System>,Y> dx)
@@ -417,6 +418,7 @@
 
    
 
    /// the ideal gas law in si units
 template<class Y>
+constexpr
 quantity<si::amount,Y>
 idealGasLaw(const quantity<si::pressure,Y>& P,
             const quantity<si::volume,Y>& V,
@@ -906,10 +908,10 @@
     public:
         typedef complex<T>  this_type;
 
-        complex(const T& r = 0,const T& i = 0) : r_(r),i_(i) { }
-        complex(const this_type& source) : r_(source.r_),i_(source.i_) { }
+        constexpr complex(const T& r = 0,const T& i = 0) : r_(r),i_(i) { }
+        constexpr complex(const this_type& source) : r_(source.r_),i_(source.i_) { }
 
-        this_type& operator=(const this_type& source)
+        constexpr this_type& operator=(const this_type& source)
         {
             if (this == &source) return *this;
 
@@ -919,59 +921,59 @@
             return *this;
         }
 
-        T& real()                   { return r_; }
-        T& imag()                   { return i_; }
+        constexpr T& real()             { return r_; }
+        constexpr T& imag()             { return i_; }
 
-        const T& real() const       { return r_; }
-        const T& imag() const       { return i_; }
+        constexpr const T& real() const       { return r_; }
+        constexpr const T& imag() const       { return i_; }
 
-        this_type& operator+=(const T& val)
+        constexpr this_type& operator+=(const T& val)
         {
             r_ += val;
             return *this;
         }
 
-        this_type& operator-=(const T& val)
+        constexpr this_type& operator-=(const T& val)
         {
             r_ -= val;
             return *this;
         }
 
-        this_type& operator*=(const T& val)
+        constexpr this_type& operator*=(const T& val)
         {
             r_ *= val;
             i_ *= val;
             return *this;
         }
 
-        this_type& operator/=(const T& val)
+        constexpr this_type& operator/=(const T& val)
         {
             r_ /= val;
             i_ /= val;
             return *this;
         }
 
-        this_type& operator+=(const this_type& source)
+        constexpr this_type& operator+=(const this_type& source)
         {
             r_ += source.r_;
             i_ += source.i_;
             return *this;
         }
 
-        this_type& operator-=(const this_type& source)
+        constexpr this_type& operator-=(const this_type& source)
         {
             r_ -= source.r_;
             i_ -= source.i_;
             return *this;
         }
 
-        this_type& operator*=(const this_type& source)
+        constexpr this_type& operator*=(const this_type& source)
         {
             *this = *this * source;
             return *this;
         }
 
-        this_type& operator/=(const this_type& source)
+        constexpr this_type& operator/=(const this_type& source)
         {
             *this = *this / source;
             return *this;
@@ -998,6 +1000,7 @@
 namespace units {
 
 template<class X>
+constexpr
 complex<typename unary_plus_typeof_helper<X>::type>
 operator+(const complex<X>& x)
 {
@@ -1007,6 +1010,7 @@
 }
 
 template<class X>
+constexpr
 complex<typename unary_minus_typeof_helper<X>::type>
 operator-(const complex<X>& x)
 {
@@ -1016,6 +1020,7 @@
 }
 
 template<class X,class Y>
+constexpr
 complex<typename add_typeof_helper<X,Y>::type>
 operator+(const complex<X>& x,const complex<Y>& y)
 {
@@ -1025,6 +1030,7 @@
 }
 
 template<class X,class Y>
+constexpr
 complex<typename boost::units::subtract_typeof_helper<X,Y>::type>
 operator-(const complex<X>& x,const complex<Y>& y)
 {
@@ -1034,6 +1040,7 @@
 }
 
 template<class X,class Y>
+constexpr
 complex<typename boost::units::multiply_typeof_helper<X,Y>::type>
 operator*(const complex<X>& x,const complex<Y>& y)
 {
@@ -1060,6 +1067,7 @@
 }
 
 template<class X,class Y>
+constexpr
 complex<typename boost::units::divide_typeof_helper<X,Y>::type>
 operator/(const complex<X>& x,const complex<Y>& y)
 {
@@ -1209,7 +1217,7 @@
 
    
 
    typedef quantity<length,complex<double> >     length_dimension;
 
-length_dimension    L(complex<double>(2.0,1.0)*meters);
+const length_dimension    L(complex<double>(2.0,1.0)*meters);
 
    
 
    
       
    
@@ -1240,7 +1248,7 @@
 
    
 
    typedef complex<quantity<length> >     length_dimension;
 
-length_dimension    L(2.0*meters,1.0*meters);
+const length_dimension    L(2.0*meters,1.0*meters);
 
    
 
    
       
    
@@ -1361,6 +1369,7 @@
 
    
 
    
 
    template<class System,typename T>
+constexpr
 quantity<unit<boost::units::length_dimension,System>,T>
 radar_beam_height(const quantity<unit<length_dimension,System>,T>& radar_range,
                   const quantity<unit<length_dimension,System>,T>& earth_radius,
@@ -1379,16 +1388,15 @@
 
    
 
    
 
    template<class return_type,class System1,class System2,typename T>
+constexpr
 return_type
 radar_beam_height(const quantity<unit<length_dimension,System1>,T>& radar_range,
                   const quantity<unit<length_dimension,System2>,T>& earth_radius,
                   T k = 4.0/3.0)
 {
     // need to decide which system to use for calculation
-    const return_type   rr(radar_range),
-                        er(earth_radius);
-
-    return return_type(pow<2>(rr)/(2.0*k*er));
+    return pow<2>(static_cast<return_type>(radar_range))
+            / (2.0*k*static_cast<return_type>(earth_radius));
 }
 
    
 
    
@@ -1401,7 +1409,8 @@
       
    
 
    
 
    
-
    quantity<imperial::length>
+
    constexpr
+quantity<imperial::length>
 radar_beam_height(const quantity<nautical::length>& range)
 {
     return quantity<imperial::length>
diff --git a/doc/html/boost_units/FAQ.html b/doc/html/boost_units/FAQ.html
index e10eb2c716..85f31ae2a4 100644
--- a/doc/html/boost_units/FAQ.html
+++ b/doc/html/boost_units/FAQ.html
@@ -86,11 +86,11 @@
 
    
         Consider the following code:
       
    
-
    cout << sin(asin(180.0 * degrees));
+
    cout << asin(sin(90.0 * degrees));
 
    
 
    
         What should this print? If only heterogeneous systems are available it would
-        print 3.14159+ rad Why? Well, asin
+        print 1.5708 rad Why? Well, sin
         would return a quantity<dimensionless>
         effectively losing the information that degrees are being used. In order
         to propogate this extra information we need homogeneous systems.
diff --git a/doc/html/boost_units/Quick_Start.html b/doc/html/boost_units/Quick_Start.html
index 83aa804a9d..6ee25f2866 100644
--- a/doc/html/boost_units/Quick_Start.html
+++ b/doc/html/boost_units/Quick_Start.html
@@ -107,6 +107,7 @@
 using namespace boost::units;
 using namespace boost::units::si;
 
+constexpr
 quantity<energy>
 work(const quantity<force>& F, const quantity<length>& dx)
 {
diff --git a/doc/html/boost_units/Reference.html b/doc/html/boost_units/Reference.html
index b733ee0b0b..ab48f05379 100644
--- a/doc/html/boost_units/Reference.html
+++ b/doc/html/boost_units/Reference.html
@@ -102,28 +102,32 @@
 
     // add a relative value to an absolute one 
     template<typename Y> 
-      absolute< Y > operator+(const absolute< Y > & aval, const Y & rval);
+      BOOST_CONSTEXPR absolute< Y > 
+      operator+(const absolute< Y > & aval, const Y & rval);
 
     // add a relative value to an absolute one 
     template<typename Y> 
-      absolute< Y > operator+(const Y & rval, const absolute< Y > & aval);
+      BOOST_CONSTEXPR absolute< Y > 
+      operator+(const Y & rval, const absolute< Y > & aval);
 
     // subtract a relative value from an absolute one 
     template<typename Y> 
-      absolute< Y > operator-(const absolute< Y > & aval, const Y & rval);
+      BOOST_CONSTEXPR absolute< Y > 
+      operator-(const absolute< Y > & aval, const Y & rval);
 
     // subtracting two absolutes gives a difference 
     template<typename Y> 
-      Y operator-(const absolute< Y > & aval1, const absolute< Y > & aval2);
+      BOOST_CONSTEXPR Y 
+      operator-(const absolute< Y > & aval1, const absolute< Y > & aval2);
 
     // creates a quantity from an absolute unit and a raw value 
     template<typename D, typename S, typename T> 
-      quantity< absolute< unit< D, S > >, T > 
+      BOOST_CONSTEXPR quantity< absolute< unit< D, S > >, T > 
       operator*(const T & t, const absolute< unit< D, S > > &);
 
     // creates a quantity from an absolute unit and a raw value 
     template<typename D, typename S, typename T> 
-      quantity< absolute< unit< D, S > >, T > 
+      BOOST_CONSTEXPR quantity< absolute< unit< D, S > >, T > 
       operator*(const absolute< unit< D, S > > &, const T & t);
 
     // Print an absolute unit. 
@@ -164,166 +168,173 @@
 
    namespace boost {
   namespace units {
     template<typename Unit, typename Y> 
-      bool isfinite(const quantity< Unit, Y > & q);
+      BOOST_CONSTEXPR bool isfinite(const quantity< Unit, Y > & q);
     template<typename Unit, typename Y> 
-      bool isinf(const quantity< Unit, Y > & q);
+      BOOST_CONSTEXPR bool isinf(const quantity< Unit, Y > & q);
     template<typename Unit, typename Y> 
-      bool isnan(const quantity< Unit, Y > & q);
+      BOOST_CONSTEXPR bool isnan(const quantity< Unit, Y > & q);
     template<typename Unit, typename Y> 
-      bool isnormal(const quantity< Unit, Y > & q);
+      BOOST_CONSTEXPR bool isnormal(const quantity< Unit, Y > & q);
     template<typename Unit, typename Y> 
-      bool isgreater(const quantity< Unit, Y > & q1, 
+      BOOST_CONSTEXPR bool 
+      isgreater(const quantity< Unit, Y > & q1, 
+                const quantity< Unit, Y > & q2);
+    template<typename Unit, typename Y> 
+      BOOST_CONSTEXPR bool 
+      isgreaterequal(const quantity< Unit, Y > & q1, 
                      const quantity< Unit, Y > & q2);
     template<typename Unit, typename Y> 
-      bool isgreaterequal(const quantity< Unit, Y > & q1, 
-                          const quantity< Unit, Y > & q2);
+      BOOST_CONSTEXPR bool 
+      isless(const quantity< Unit, Y > & q1, const quantity< Unit, Y > & q2);
     template<typename Unit, typename Y> 
-      bool isless(const quantity< Unit, Y > & q1, 
+      BOOST_CONSTEXPR bool 
+      islessequal(const quantity< Unit, Y > & q1, 
                   const quantity< Unit, Y > & q2);
     template<typename Unit, typename Y> 
-      bool islessequal(const quantity< Unit, Y > & q1, 
-                       const quantity< Unit, Y > & q2);
+      BOOST_CONSTEXPR bool 
+      islessgreater(const quantity< Unit, Y > & q1, 
+                    const quantity< Unit, Y > & q2);
     template<typename Unit, typename Y> 
-      bool islessgreater(const quantity< Unit, Y > & q1, 
-                         const quantity< Unit, Y > & q2);
-    template<typename Unit, typename Y> 
-      bool isunordered(const quantity< Unit, Y > & q1, 
-                       const quantity< Unit, Y > & q2);
+      BOOST_CONSTEXPR bool 
+      isunordered(const quantity< Unit, Y > & q1, 
+                  const quantity< Unit, Y > & q2);
     template<typename Unit, typename Y> 
-      quantity< Unit, Y > abs(const quantity< Unit, Y > & q);
+      BOOST_CONSTEXPR quantity< Unit, Y > abs(const quantity< Unit, Y > & q);
     template<typename Unit, typename Y> 
-      quantity< Unit, Y > ceil(const quantity< Unit, Y > & q);
+      BOOST_CONSTEXPR quantity< Unit, Y > ceil(const quantity< Unit, Y > & q);
     template<typename Unit, typename Y> 
-      quantity< Unit, Y > 
+      BOOST_CONSTEXPR quantity< Unit, Y > 
       copysign(const quantity< Unit, Y > & q1, const quantity< Unit, Y > & q2);
     template<typename Unit, typename Y> 
-      quantity< Unit, Y > fabs(const quantity< Unit, Y > & q);
+      BOOST_CONSTEXPR quantity< Unit, Y > fabs(const quantity< Unit, Y > & q);
     template<typename Unit, typename Y> 
-      quantity< Unit, Y > floor(const quantity< Unit, Y > & q);
+      BOOST_CONSTEXPR quantity< Unit, Y > floor(const quantity< Unit, Y > & q);
     template<typename Unit, typename Y> 
-      quantity< Unit, Y > 
+      BOOST_CONSTEXPR quantity< Unit, Y > 
       fdim(const quantity< Unit, Y > & q1, const quantity< Unit, Y > & q2);
     template<typename Unit, typename Y> 
-      quantity< Unit, Y > 
+      BOOST_CONSTEXPR quantity< Unit, Y > 
       fmax(const quantity< Unit, Y > & q1, const quantity< Unit, Y > & q2);
     template<typename Unit, typename Y> 
-      quantity< Unit, Y > 
+      BOOST_CONSTEXPR quantity< Unit, Y > 
       fmin(const quantity< Unit, Y > & q1, const quantity< Unit, Y > & q2);
     template<typename Unit, typename Y> 
-      int fpclassify(const quantity< Unit, Y > & q);
+      BOOST_CONSTEXPR int fpclassify(const quantity< Unit, Y > & q);
     template<typename Unit, typename Y> 
-      root_typeof_helper< typename add_typeof_helper< typename power_typeof_helper< quantity< Unit, Y >, static_rational< 2 > >::type, typename power_typeof_helper< quantity< Unit, Y >, static_rational< 2 > >::type >::type, static_rational< 2 > >::type 
+      BOOST_CONSTEXPR root_typeof_helper< typename add_typeof_helper< typename power_typeof_helper< quantity< Unit, Y >, static_rational< 2 > >::type, typename power_typeof_helper< quantity< Unit, Y >, static_rational< 2 > >::type >::type, static_rational< 2 > >::type 
       hypot(const quantity< Unit, Y > & q1, const quantity< Unit, Y > & q2);
     template<typename Unit, typename Y> 
-      quantity< Unit, Y > 
+      BOOST_CONSTEXPR quantity< Unit, Y > 
       nextafter(const quantity< Unit, Y > & q1, 
                 const quantity< Unit, Y > & q2);
     template<typename Unit, typename Y> 
-      quantity< Unit, Y > 
+      BOOST_CONSTEXPR quantity< Unit, Y > 
       nexttoward(const quantity< Unit, Y > & q1, 
                  const quantity< Unit, Y > & q2);
     template<typename Unit, typename Y> 
-      quantity< Unit, Y > round(const quantity< Unit, Y > & q);
+      BOOST_CONSTEXPR quantity< Unit, Y > round(const quantity< Unit, Y > & q);
     template<typename Unit, typename Y> 
-      int signbit(const quantity< Unit, Y > & q);
+      BOOST_CONSTEXPR int signbit(const quantity< Unit, Y > & q);
     template<typename Unit, typename Y> 
-      quantity< Unit, Y > trunc(const quantity< Unit, Y > & q);
+      BOOST_CONSTEXPR quantity< Unit, Y > trunc(const quantity< Unit, Y > & q);
     template<typename Unit, typename Y> 
-      quantity< Unit, Y > 
+      BOOST_CONSTEXPR quantity< Unit, Y > 
       fmod(const quantity< Unit, Y > & q1, const quantity< Unit, Y > & q2);
     template<typename Unit, typename Y> 
-      quantity< Unit, Y > 
+      BOOST_CONSTEXPR quantity< Unit, Y > 
       modf(const quantity< Unit, Y > & q1, quantity< Unit, Y > * q2);
     template<typename Unit, typename Y, typename Int> 
-      quantity< Unit, Y > frexp(const quantity< Unit, Y > & q, Int * ex);
+      BOOST_CONSTEXPR quantity< Unit, Y > 
+      frexp(const quantity< Unit, Y > & q, Int * ex);
     template<typename S, typename Y> 
-      quantity< BOOST_UNITS_DIMENSIONLESS_UNIT(S), Y > 
+      BOOST_CONSTEXPR quantity< BOOST_UNITS_DIMENSIONLESS_UNIT(S), Y > 
       pow(const quantity< BOOST_UNITS_DIMENSIONLESS_UNIT(S), Y > &, 
           const quantity< BOOST_UNITS_DIMENSIONLESS_UNIT(S), Y > &);
     template<typename S, typename Y> 
-      quantity< BOOST_UNITS_DIMENSIONLESS_UNIT(S), Y > 
+      BOOST_CONSTEXPR quantity< BOOST_UNITS_DIMENSIONLESS_UNIT(S), Y > 
       exp(const quantity< BOOST_UNITS_DIMENSIONLESS_UNIT(S), Y > & q);
     template<typename Unit, typename Y, typename Int> 
-      quantity< Unit, Y > ldexp(const quantity< Unit, Y > & q, const Int & ex);
+      BOOST_CONSTEXPR quantity< Unit, Y > 
+      ldexp(const quantity< Unit, Y > & q, const Int & ex);
     template<typename S, typename Y> 
-      quantity< BOOST_UNITS_DIMENSIONLESS_UNIT(S), Y > 
+      BOOST_CONSTEXPR quantity< BOOST_UNITS_DIMENSIONLESS_UNIT(S), Y > 
       log(const quantity< BOOST_UNITS_DIMENSIONLESS_UNIT(S), Y > & q);
     template<typename S, typename Y> 
-      quantity< BOOST_UNITS_DIMENSIONLESS_UNIT(S), Y > 
+      BOOST_CONSTEXPR quantity< BOOST_UNITS_DIMENSIONLESS_UNIT(S), Y > 
       log10(const quantity< BOOST_UNITS_DIMENSIONLESS_UNIT(S), Y > & q);
     template<typename Unit, typename Y> 
-      root_typeof_helper< quantity< Unit, Y >, static_rational< 2 > >::type 
+      BOOST_CONSTEXPR root_typeof_helper< quantity< Unit, Y >, static_rational< 2 > >::type 
       sqrt(const quantity< Unit, Y > & q);
 
     // cos of theta in radians 
     template<typename Y> 
-      dimensionless_quantity< si::system, Y >::type 
+      BOOST_CONSTEXPR dimensionless_quantity< si::system, Y >::type 
       cos(const quantity< si::plane_angle, Y > & theta);
 
     // sin of theta in radians 
     template<typename Y> 
-      dimensionless_quantity< si::system, Y >::type 
+      BOOST_CONSTEXPR dimensionless_quantity< si::system, Y >::type 
       sin(const quantity< si::plane_angle, Y > & theta);
 
     // tan of theta in radians 
     template<typename Y> 
-      dimensionless_quantity< si::system, Y >::type 
+      BOOST_CONSTEXPR dimensionless_quantity< si::system, Y >::type 
       tan(const quantity< si::plane_angle, Y > & theta);
 
     // cos of theta in other angular units 
     template<typename System, typename Y> 
-      dimensionless_quantity< System, Y >::type 
+      BOOST_CONSTEXPR dimensionless_quantity< System, Y >::type 
       cos(const quantity< unit< plane_angle_dimension, System >, Y > & theta);
 
     // sin of theta in other angular units 
     template<typename System, typename Y> 
-      dimensionless_quantity< System, Y >::type 
+      BOOST_CONSTEXPR dimensionless_quantity< System, Y >::type 
       sin(const quantity< unit< plane_angle_dimension, System >, Y > & theta);
 
     // tan of theta in other angular units 
     template<typename System, typename Y> 
-      dimensionless_quantity< System, Y >::type 
+      BOOST_CONSTEXPR dimensionless_quantity< System, Y >::type 
       tan(const quantity< unit< plane_angle_dimension, System >, Y > & theta);
 
     // acos of dimensionless quantity returning angle in same system 
     template<typename Y, typename System> 
-      quantity< unit< plane_angle_dimension, homogeneous_system< System > >, Y > 
+      BOOST_CONSTEXPR quantity< unit< plane_angle_dimension, homogeneous_system< System > >, Y > 
       acos(const quantity< unit< dimensionless_type, homogeneous_system< System > >, Y > & val);
 
     // acos of dimensionless quantity returning angle in radians 
     template<typename Y> 
-      quantity< angle::radian_base_unit::unit_type, Y > 
+      BOOST_CONSTEXPR quantity< angle::radian_base_unit::unit_type, Y > 
       acos(const quantity< unit< dimensionless_type, heterogeneous_dimensionless_system >, Y > & val);
 
     // asin of dimensionless quantity returning angle in same system 
     template<typename Y, typename System> 
-      quantity< unit< plane_angle_dimension, homogeneous_system< System > >, Y > 
+      BOOST_CONSTEXPR quantity< unit< plane_angle_dimension, homogeneous_system< System > >, Y > 
       asin(const quantity< unit< dimensionless_type, homogeneous_system< System > >, Y > & val);
 
     // asin of dimensionless quantity returning angle in radians 
     template<typename Y> 
-      quantity< angle::radian_base_unit::unit_type, Y > 
+      BOOST_CONSTEXPR quantity< angle::radian_base_unit::unit_type, Y > 
       asin(const quantity< unit< dimensionless_type, heterogeneous_dimensionless_system >, Y > & val);
 
     // atan of dimensionless quantity returning angle in same system 
     template<typename Y, typename System> 
-      quantity< unit< plane_angle_dimension, homogeneous_system< System > >, Y > 
+      BOOST_CONSTEXPR quantity< unit< plane_angle_dimension, homogeneous_system< System > >, Y > 
       atan(const quantity< unit< dimensionless_type, homogeneous_system< System > >, Y > & val);
 
     // atan of dimensionless quantity returning angle in radians 
     template<typename Y> 
-      quantity< angle::radian_base_unit::unit_type, Y > 
+      BOOST_CONSTEXPR quantity< angle::radian_base_unit::unit_type, Y > 
       atan(const quantity< unit< dimensionless_type, heterogeneous_dimensionless_system >, Y > & val);
 
     // atan2 of value_type returning angle in radians 
     template<typename Y, typename Dimension, typename System> 
-      quantity< unit< plane_angle_dimension, homogeneous_system< System > >, Y > 
+      BOOST_CONSTEXPR quantity< unit< plane_angle_dimension, homogeneous_system< System > >, Y > 
       atan2(const quantity< unit< Dimension, homogeneous_system< System > >, Y > & y, 
             const quantity< unit< Dimension, homogeneous_system< System > >, Y > & x);
 
     // atan2 of value_type returning angle in radians 
     template<typename Y, typename Dimension, typename System> 
-      quantity< angle::radian_base_unit::unit_type, Y > 
+      BOOST_CONSTEXPR quantity< angle::radian_base_unit::unit_type, Y > 
       atan2(const quantity< unit< Dimension, heterogeneous_system< System > >, Y > & y, 
             const quantity< unit< Dimension, heterogeneous_system< System > >, Y > & x);
   }
@@ -900,19 +911,21 @@ Boost.Lambda's return type deduction system is extented to make use of Boost.Uni
 
     // raise a value to a static_rational power. 
     template<typename Rat, typename Y> 
-      power_typeof_helper< Y, Rat >::type pow(const Y & x);
+      BOOST_CONSTEXPR power_typeof_helper< Y, Rat >::type pow(const Y & x);
 
     // raise a value to an integer power. 
     template<long N, typename Y> 
-      power_typeof_helper< Y, static_rational< N > >::type pow(const Y & x);
+      BOOST_CONSTEXPR power_typeof_helper< Y, static_rational< N > >::type 
+      pow(const Y & x);
 
     // take the static_rational root of a value. 
     template<typename Rat, typename Y> 
-      root_typeof_helper< Y, Rat >::type root(const Y & x);
+      BOOST_CONSTEXPR root_typeof_helper< Y, Rat >::type root(const Y & x);
 
     // take the integer root of a value. 
     template<long N, typename Y> 
-      root_typeof_helper< Y, static_rational< N > >::type root(const Y & x);
+      BOOST_CONSTEXPR root_typeof_helper< Y, static_rational< N > >::type 
+      root(const Y & x);
   }
 }
    
 
@@ -938,8 +951,10 @@ Boost.Lambda's return type deduction system is extented to make use of Boost.Uni
       struct subtract_typeof_helper<quantity< unit< Dim, System >, X >, quantity< unit< Dim, System >, Y >>;
 
     // quantity_cast provides mutating access to underlying quantity value_type 
-    template<typename X, typename Y> X quantity_cast(Y & source);
-    template<typename X, typename Y> X quantity_cast(const Y & source);
+    template<typename X, typename Y> 
+      BOOST_CONSTEXPR X quantity_cast(Y & source);
+    template<typename X, typename Y> 
+      BOOST_CONSTEXPR X quantity_cast(const Y & source);
 
     // swap quantities 
     template<typename Unit, typename Y> 
@@ -947,126 +962,132 @@ Boost.Lambda's return type deduction system is extented to make use of Boost.Uni
 
     // runtime unit divided by scalar 
     template<typename System, typename Dim, typename Y> 
-      divide_typeof_helper< unit< Dim, System >, Y >::type 
+      BOOST_CONSTEXPR divide_typeof_helper< unit< Dim, System >, Y >::type 
       operator/(const unit< Dim, System > &, const Y & rhs);
 
     // runtime scalar times unit 
     template<typename System, typename Dim, typename Y> 
-      multiply_typeof_helper< Y, unit< Dim, System > >::type 
+      BOOST_CONSTEXPR multiply_typeof_helper< Y, unit< Dim, System > >::type 
       operator*(const Y & lhs, const unit< Dim, System > &);
 
     // runtime scalar divided by unit 
     template<typename System, typename Dim, typename Y> 
-      divide_typeof_helper< Y, unit< Dim, System > >::type 
+      BOOST_CONSTEXPR divide_typeof_helper< Y, unit< Dim, System > >::type 
       operator/(const Y & lhs, const unit< Dim, System > &);
 
     // runtime quantity times scalar 
     template<typename Unit, typename X> 
-      multiply_typeof_helper< quantity< Unit, X >, X >::type 
+      BOOST_CONSTEXPR multiply_typeof_helper< quantity< Unit, X >, X >::type 
       operator*(const quantity< Unit, X > & lhs, const X & rhs);
 
     // runtime scalar times quantity 
     template<typename Unit, typename X> 
-      multiply_typeof_helper< X, quantity< Unit, X > >::type 
+      BOOST_CONSTEXPR multiply_typeof_helper< X, quantity< Unit, X > >::type 
       operator*(const X & lhs, const quantity< Unit, X > & rhs);
 
     // runtime quantity divided by scalar 
     template<typename Unit, typename X> 
-      divide_typeof_helper< quantity< Unit, X >, X >::type 
+      BOOST_CONSTEXPR divide_typeof_helper< quantity< Unit, X >, X >::type 
       operator/(const quantity< Unit, X > & lhs, const X & rhs);
 
     // runtime scalar divided by quantity 
     template<typename Unit, typename X> 
-      divide_typeof_helper< X, quantity< Unit, X > >::type 
+      BOOST_CONSTEXPR divide_typeof_helper< X, quantity< Unit, X > >::type 
       operator/(const X & lhs, const quantity< Unit, X > & rhs);
 
     // runtime unit times quantity 
     template<typename System1, typename Dim1, typename Unit2, typename Y> 
-      multiply_typeof_helper< unit< Dim1, System1 >, quantity< Unit2, Y > >::type 
+      BOOST_CONSTEXPR multiply_typeof_helper< unit< Dim1, System1 >, quantity< Unit2, Y > >::type 
       operator*(const unit< Dim1, System1 > &, 
                 const quantity< Unit2, Y > & rhs);
 
     // runtime unit divided by quantity 
     template<typename System1, typename Dim1, typename Unit2, typename Y> 
-      divide_typeof_helper< unit< Dim1, System1 >, quantity< Unit2, Y > >::type 
+      BOOST_CONSTEXPR divide_typeof_helper< unit< Dim1, System1 >, quantity< Unit2, Y > >::type 
       operator/(const unit< Dim1, System1 > &, 
                 const quantity< Unit2, Y > & rhs);
 
     // runtime quantity times unit 
     template<typename Unit1, typename System2, typename Dim2, typename Y> 
-      multiply_typeof_helper< quantity< Unit1, Y >, unit< Dim2, System2 > >::type 
+      BOOST_CONSTEXPR multiply_typeof_helper< quantity< Unit1, Y >, unit< Dim2, System2 > >::type 
       operator*(const quantity< Unit1, Y > & lhs, 
                 const unit< Dim2, System2 > &);
 
     // runtime quantity divided by unit 
     template<typename Unit1, typename System2, typename Dim2, typename Y> 
-      divide_typeof_helper< quantity< Unit1, Y >, unit< Dim2, System2 > >::type 
+      BOOST_CONSTEXPR divide_typeof_helper< quantity< Unit1, Y >, unit< Dim2, System2 > >::type 
       operator/(const quantity< Unit1, Y > & lhs, 
                 const unit< Dim2, System2 > &);
 
     // runtime unary plus quantity 
     template<typename Unit, typename Y> 
-      unary_plus_typeof_helper< quantity< Unit, Y > >::type 
+      BOOST_CONSTEXPR unary_plus_typeof_helper< quantity< Unit, Y > >::type 
       operator+(const quantity< Unit, Y > & val);
 
     // runtime unary minus quantity 
     template<typename Unit, typename Y> 
-      unary_minus_typeof_helper< quantity< Unit, Y > >::type 
+      BOOST_CONSTEXPR unary_minus_typeof_helper< quantity< Unit, Y > >::type 
       operator-(const quantity< Unit, Y > & val);
 
     // runtime quantity plus quantity 
     template<typename Unit1, typename Unit2, typename X, typename Y> 
-      add_typeof_helper< quantity< Unit1, X >, quantity< Unit2, Y > >::type 
+      BOOST_CONSTEXPR add_typeof_helper< quantity< Unit1, X >, quantity< Unit2, Y > >::type 
       operator+(const quantity< Unit1, X > & lhs, 
                 const quantity< Unit2, Y > & rhs);
 
     // runtime quantity minus quantity 
     template<typename Unit1, typename Unit2, typename X, typename Y> 
-      subtract_typeof_helper< quantity< Unit1, X >, quantity< Unit2, Y > >::type 
+      BOOST_CONSTEXPR subtract_typeof_helper< quantity< Unit1, X >, quantity< Unit2, Y > >::type 
       operator-(const quantity< Unit1, X > & lhs, 
                 const quantity< Unit2, Y > & rhs);
 
     // runtime quantity times quantity 
     template<typename Unit1, typename Unit2, typename X, typename Y> 
-      multiply_typeof_helper< quantity< Unit1, X >, quantity< Unit2, Y > >::type 
+      BOOST_CONSTEXPR multiply_typeof_helper< quantity< Unit1, X >, quantity< Unit2, Y > >::type 
       operator*(const quantity< Unit1, X > & lhs, 
                 const quantity< Unit2, Y > & rhs);
 
     // runtime quantity divided by quantity 
     template<typename Unit1, typename Unit2, typename X, typename Y> 
-      divide_typeof_helper< quantity< Unit1, X >, quantity< Unit2, Y > >::type 
+      BOOST_CONSTEXPR divide_typeof_helper< quantity< Unit1, X >, quantity< Unit2, Y > >::type 
       operator/(const quantity< Unit1, X > & lhs, 
                 const quantity< Unit2, Y > & rhs);
 
     // runtime operator== 
     template<typename Unit, typename X, typename Y> 
-      bool operator==(const quantity< Unit, X > & val1, 
-                      const quantity< Unit, Y > & val2);
+      BOOST_CONSTEXPR bool 
+      operator==(const quantity< Unit, X > & val1, 
+                 const quantity< Unit, Y > & val2);
 
     // runtime operator!= 
     template<typename Unit, typename X, typename Y> 
-      bool operator!=(const quantity< Unit, X > & val1, 
-                      const quantity< Unit, Y > & val2);
+      BOOST_CONSTEXPR bool 
+      operator!=(const quantity< Unit, X > & val1, 
+                 const quantity< Unit, Y > & val2);
 
     // runtime operator< 
     template<typename Unit, typename X, typename Y> 
-      bool operator<(const quantity< Unit, X > & val1, 
-                     const quantity< Unit, Y > & val2);
+      BOOST_CONSTEXPR bool 
+      operator<(const quantity< Unit, X > & val1, 
+                const quantity< Unit, Y > & val2);
 
     // runtime operator<= 
     template<typename Unit, typename X, typename Y> 
-      bool operator<=(const quantity< Unit, X > & val1, 
-                      const quantity< Unit, Y > & val2);
+      BOOST_CONSTEXPR bool 
+      operator<=(const quantity< Unit, X > & val1, 
+                 const quantity< Unit, Y > & val2);
 
     // runtime operator> 
     template<typename Unit, typename X, typename Y> 
-      bool operator>(const quantity< Unit, X > & val1, 
-                     const quantity< Unit, Y > & val2);
+      BOOST_CONSTEXPR bool 
+      operator>(const quantity< Unit, X > & val1, 
+                const quantity< Unit, Y > & val2);
 
     // runtime operator>= 
     template<typename Unit, typename X, typename Y> 
-      bool operator>=(const quantity< Unit, X > & val1, 
-                      const quantity< Unit, Y > & val2);
+      BOOST_CONSTEXPR bool 
+      operator>=(const quantity< Unit, X > & val1, 
+                 const quantity< Unit, Y > & val2);
   }
 }
    
 
@@ -1126,7 +1147,7 @@ Boost.Lambda's return type deduction system is extented to make use of Boost.Uni
 
     // get decimal value of static_rational
     template<typename T, integer_type N, integer_type D> 
-      divide_typeof_helper< T, T >::type 
+      BOOST_CONSTEXPR divide_typeof_helper< T, T >::type 
       value(const static_rational< N, D > &);
   }
 }
    
@@ -1147,43 +1168,43 @@ Boost.Lambda's return type deduction system is extented to make use of Boost.Uni
 
     // unit runtime unary plus 
     template<typename Dim, typename System> 
-      unary_plus_typeof_helper< unit< Dim, System > >::type 
+      BOOST_CONSTEXPR unary_plus_typeof_helper< unit< Dim, System > >::type 
       operator+(const unit< Dim, System > &);
 
     // unit runtime unary minus 
     template<typename Dim, typename System> 
-      unary_minus_typeof_helper< unit< Dim, System > >::type 
+      BOOST_CONSTEXPR unary_minus_typeof_helper< unit< Dim, System > >::type 
       operator-(const unit< Dim, System > &);
 
     // runtime add two units 
     template<typename Dim1, typename Dim2, typename System1, typename System2> 
-      add_typeof_helper< unit< Dim1, System1 >, unit< Dim2, System2 > >::type 
+      BOOST_CONSTEXPR add_typeof_helper< unit< Dim1, System1 >, unit< Dim2, System2 > >::type 
       operator+(const unit< Dim1, System1 > &, const unit< Dim2, System2 > &);
 
     // runtime subtract two units 
     template<typename Dim1, typename Dim2, typename System1, typename System2> 
-      subtract_typeof_helper< unit< Dim1, System1 >, unit< Dim2, System2 > >::type 
+      BOOST_CONSTEXPR subtract_typeof_helper< unit< Dim1, System1 >, unit< Dim2, System2 > >::type 
       operator-(const unit< Dim1, System1 > &, const unit< Dim2, System2 > &);
 
     // runtime multiply two units 
     template<typename Dim1, typename Dim2, typename System1, typename System2> 
-      multiply_typeof_helper< unit< Dim1, System1 >, unit< Dim2, System2 > >::type 
+      BOOST_CONSTEXPR multiply_typeof_helper< unit< Dim1, System1 >, unit< Dim2, System2 > >::type 
       operator*(const unit< Dim1, System1 > &, const unit< Dim2, System2 > &);
 
     // runtime divide two units 
     template<typename Dim1, typename Dim2, typename System1, typename System2> 
-      divide_typeof_helper< unit< Dim1, System1 >, unit< Dim2, System2 > >::type 
+      BOOST_CONSTEXPR divide_typeof_helper< unit< Dim1, System1 >, unit< Dim2, System2 > >::type 
       operator/(const unit< Dim1, System1 > &, const unit< Dim2, System2 > &);
 
     // unit runtime operator==
     template<typename Dim1, typename Dim2, typename System1, typename System2> 
-      bool operator==(const unit< Dim1, System1 > &, 
-                      const unit< Dim2, System2 > &);
+      BOOST_CONSTEXPR bool 
+      operator==(const unit< Dim1, System1 > &, const unit< Dim2, System2 > &);
 
     // unit runtime operator!=
     template<typename Dim1, typename Dim2, typename System1, typename System2> 
-      bool operator!=(const unit< Dim1, System1 > &, 
-                      const unit< Dim2, System2 > &);
+      BOOST_CONSTEXPR bool 
+      operator!=(const unit< Dim1, System1 > &, const unit< Dim2, System2 > &);
   }
 }
    
 
diff --git a/doc/html/boost_units/version_id.html b/doc/html/boost_units/version_id.html
index 1d73001880..c76f294662 100644
--- a/doc/html/boost_units/version_id.html
+++ b/doc/html/boost_units/version_id.html
@@ -31,7 +31,7 @@
       Boost root
     
    
 
    
-      Last edit to Quickbook file units.qbk was at 12:05:58 AM on 2017-Dec-14.
+      Last edit to Quickbook file units.qbk was at 02:08:01 PM on 2018-Apr-11.
     
    
 
    
diff --git a/doc/html/boostbook/together.html b/doc/html/boostbook/together.html
index bbfc722a24..92ec23edca 100644
--- a/doc/html/boostbook/together.html
+++ b/doc/html/boostbook/together.html
@@ -77,7 +77,7 @@
     text. For instance, we can link to the Function library with
     <libraryname>Function</libraryname>,
     which results in the following:
-    Function. In cases where the displayed
+    Function. In cases where the displayed
     text is different from the actual name, the alt
     attribute can be specified. For instance, the following XML
     element references the boost::function
diff --git a/doc/html/chrono.html b/doc/html/chrono.html
index 4de2fd4565..fcbf733ea7 100644
--- a/doc/html/chrono.html
+++ b/doc/html/chrono.html
@@ -318,7 +318,7 @@
 
    
 
    
 
 
    
-
+
    Last revised: December 14, 2017 at 00:08:22 GMT
    Last revised: April 11, 2018 at 14:10:22 GMT
    		
 
    		
 
    
 
    
diff --git a/doc/html/circular_buffer.html b/doc/html/circular_buffer.html
index 1cd58290fa..cdc1b5ad41 100644
--- a/doc/html/circular_buffer.html
+++ b/doc/html/circular_buffer.html
@@ -117,14 +117,14 @@
       
     
    
 
    
-      There is also a circular_buffer_space_optimized
+      There is also a circular_buffer_space_optimized
       version available.
     
    
 
    
       
     
    
 
    
-      circular_buffer_space_optimized
+      circular_buffer_space_optimized
       is an adaptation of the circular_buffer
       which does not allocate memory all at once when created,
       instead it allocates memory as needed.
@@ -150,7 +150,7 @@
 
    
 
 
-
+
    Last revised: December 14, 2017 at 00:08:17 GMT
    Last revised: April 11, 2018 at 14:10:16 GMT
    		
 
    		
 
    
 
    
diff --git a/doc/html/circular_buffer/example.html b/doc/html/circular_buffer/example.html
index ba1caf8ade..0ba2336e91 100644
--- a/doc/html/circular_buffer/example.html
+++ b/doc/html/circular_buffer/example.html
@@ -41,7 +41,7 @@
 
    // Create a circular buffer with a capacity for 3 integers.
 boost::circular_buffer<int> cb(3);
 
-// Insert threee elements into the buffer.
+// Insert three elements into the buffer.
 cb.push_back(1);
 cb.push_back(2);
 cb.push_back(3);
diff --git a/doc/html/circular_buffer/examples.html b/doc/html/circular_buffer/examples.html
index d5e6e3f10f..5ca6a6d426 100644
--- a/doc/html/circular_buffer/examples.html
+++ b/doc/html/circular_buffer/examples.html
@@ -177,7 +177,7 @@
       Boost.call_traits utility.
     
    
 
    
-      The push_front()
+      The push_front()
       method is called by the producer thread in order to insert a new item into
       the buffer. The method locks the mutex and waits until there is a space for
       the new item. (The mutex is unlocked during the waiting stage and has to be
@@ -190,7 +190,7 @@
       consumer threads waiting for a new item to be inserted into the buffer.
     
    
 
    
-      The pop_back()
+      The pop_back()
       method is called by the consumer thread in order to read the next item from
       the buffer. The method locks the mutex and waits until there is an unread item
       in the buffer. If there is at least one unread item, the method decrements
@@ -203,7 +203,7 @@
       the item but the item is left in the circular_buffer which then
       replaces it with a new one (inserted by a
       producer) when the circular_buffer is full. This technique is more effective
-      than removing the item explicitly by calling the circular_buffer::pop_back()
+      than removing the item explicitly by calling the circular_buffer::pop_back()
       method of the circular_buffer.
     
    
 
    
diff --git a/doc/html/circular_buffer/headers.html b/doc/html/circular_buffer/headers.html
index a88fbd8888..ea31d4eb09 100644
--- a/doc/html/circular_buffer/headers.html
+++ b/doc/html/circular_buffer/headers.html
@@ -41,7 +41,7 @@
       defined in the file base.hpp.
     
    
 
    
-      The circular_buffer_space_optimized
+      The circular_buffer_space_optimized
       is defined in the file space_optimized.hpp.
     
    
 
diff --git a/doc/html/circular_buffer/implementation.html b/doc/html/circular_buffer/implementation.html
index 3d519bcc27..2fff818e01 100644
--- a/doc/html/circular_buffer/implementation.html
+++ b/doc/html/circular_buffer/implementation.html
@@ -147,13 +147,13 @@
 
 
    
       It is considered to be a bug to read or remove an element (e.g. by calling
-      front() or
-      pop_back())
+      front() or
+      pop_back())
       from an empty std container and from an empty circular_buffer
       as well. The data consumer has to test if the container is not empty before
-      reading/removing from it by testing empty().
+      reading/removing from it by testing empty().
       However, when reading from the circular_buffer,
-      there is an option to rely on the at()
+      there is an option to rely on the at()
       method which throws an exception when the index is out of range.
     
    
 
    
diff --git a/doc/html/circular_buffer/rationale.html b/doc/html/circular_buffer/rationale.html
index 245bcad131..56cdafad7e 100644
--- a/doc/html/circular_buffer/rationale.html
+++ b/doc/html/circular_buffer/rationale.html
@@ -48,7 +48,7 @@
         
 
  • 
           Suitable for specialization by means of adaptors.
-          (The circular_buffer_space_optimized
+          (The circular_buffer_space_optimized
           is such an example of the adaptor.)
         
    • 
 
  • 
@@ -57,7 +57,7 @@
 
 
    
       In order to achieve maximum efficiency, the circular_buffer
-      and circular_buffer_space_optimized
+      and circular_buffer_space_optimized
       store their elements in a contiguous region of memory,
       which then enables:
     
    
diff --git a/doc/html/circular_buffer/s14.html b/doc/html/circular_buffer/s14.html
index 7c4c3f7c4d..d2d223bd09 100644
--- a/doc/html/circular_buffer/s14.html
+++ b/doc/html/circular_buffer/s14.html
@@ -7,7 +7,7 @@
 
 
 
-
+
 
 
 
@@ -21,7 +21,7 @@
 
    • 
 
    
 
    
-PrevUpHomeNext
+PrevUpHomeNext
 
    
 
    
 
    
@@ -38,7 +38,7 @@
 
 
  • 
 
    adjust_min_capacity
    
-
    
+
    
 
    • 
 
  • 
 
    allocate
    
@@ -48,7 +48,7 @@
 
    allocator_type
    
 
    
 
    • 
 
  • 
@@ -59,14 +59,14 @@
 
    array_range
    
 
    
 
    • 
 
  • 
 
    assign
    
 
    
 
    • 
 
  • 
@@ -82,7 +82,7 @@
 
    begin
    
 
    
 
    • 
 
  • 
@@ -114,18 +114,18 @@
 
    capacity
    
 
    
 
    • 
 
  • 
 
    capacity_control
    
-
    
+
    
 
    • 
 
  • 
 
    capacity_type
    
 
    
 
    • 
 
  • 
@@ -138,11 +138,11 @@
 
    • 
 
  • 
 
    check_high_capacity
    
-
    
+
    
 
    • 
 
  • 
 
    check_low_capacity
    
-
    
+
    
 
    • 
 
  • 
 
    circular_buffer
    
@@ -157,7 +157,7 @@
 
    • 
 
  • 
 
    circular_buffer_space_optimized
    
-
    
+
    
 
    • 
 
  • 
 
    Class template circular_buffer
    
@@ -233,50 +233,50 @@
 
  • 
 
    Class template circular_buffer_space_optimized
    
 
    
 
    • 
 
  • 
 
    Constant
    
 
    
 
    • 
 
  • 
@@ -287,35 +287,35 @@
 
    const_array_range
    
 
    
 
    • 
 
  • 
 
    const_iterator
    
 
    
 
    • 
 
  • 
 
    const_pointer
    
 
    
 
    • 
 
  • 
 
    const_reference
    
 
    
 
    • 
 
  • 
 
    const_reverse_iterator
    
 
    
 
    • 
 
  • 
@@ -363,7 +363,7 @@
 
    difference_type
    
 
    
 
    • 
 
    
@@ -382,7 +382,7 @@
 
    end
    
 
    
 
 
  • 
@@ -403,7 +403,7 @@
 
    exhausted
    
 
    
 
    • 
 
    
@@ -413,31 +413,31 @@
 
    
 
    
@@ -473,13 +473,13 @@
 
 
  • 
 
    init_capacity
    
-
    
+
    
 
    • 
 
  • 
 
    insert
    
 
    
 
    • 
 
  • 
@@ -510,7 +510,7 @@
 
    iterator
    
 
    
 
    • 
 
    
@@ -522,13 +522,13 @@
 
    Linear
    
 
    
 
 
  • 
@@ -586,7 +586,7 @@
 
    param_value_type
    
 
    
 
    • 
 
  • 
@@ -597,14 +597,14 @@
 
    pointer
    
 
    
 
    • 
 
  • 
 
    pop_back
    
 
    
@@ -621,7 +621,7 @@
 
    push_front
    
 
    
 
    • 
@@ -644,13 +644,13 @@
 
 
  • 
 
    reduce_capacity
    
-
    
+
    
 
    • 
 
  • 
 
    reference
    
 
    
 
    • 
 
  • 
@@ -674,21 +674,21 @@
 
    resize
    
 
    
 
    • 
 
  • 
 
    reverse_iterator
    
 
    
 
    • 
 
  • 
 
    rinsert
    
 
    
 
    • 
 
  • 
@@ -710,7 +710,7 @@
 
    rvalue_type
    
 
    
 
    • 
 
    
@@ -722,7 +722,7 @@
 
    size_type
    
 
    
 
@@ -751,7 +751,7 @@
 
    value_type
    
 
    
 
@@ -774,7 +774,7 @@
 
    
 
    
 
    
-PrevUpHomeNext
+PrevUpHomeNext
 
    
 
 
diff --git a/doc/html/circular_buffer/version_id.html b/doc/html/circular_buffer/version_id.html
index 138528fd59..b54a2fb455 100644
--- a/doc/html/circular_buffer/version_id.html
+++ b/doc/html/circular_buffer/version_id.html
@@ -28,7 +28,7 @@
 Documentation Version Info
 
 
    
-      Last edit to Quickbook file circular_buffer.qbk was at 12:08:17 AM on 2017-Dec-14.
+      Last edit to Quickbook file circular_buffer.qbk was at 02:10:16 PM on 2018-Apr-11.
     
    
 
    
diff --git a/doc/html/container.html b/doc/html/container.html
index 103772acb6..282fd02ee7 100644
--- a/doc/html/container.html
+++ b/doc/html/container.html
@@ -30,7 +30,8 @@
 
    
 Ion Gaztanaga
 
    
-
    Copyright © 2009-2015 Ion Gaztanaga
    
+
    Copyright © 2009-2017 Ion
+      Gaztanaga
    
 
    
         Distributed under the Boost Software License, Version 1.0. (See accompanying
@@ -65,22 +66,29 @@
 
    static_vector
    
 
    small_vector
    
 
-
    Extended functionality
    
+
    Extended functionality:
+    Basic extensions
    
 
    
 
    Default
       initialization for vector-like containers
    
 
    Ordered
       range insertion for associative containers (ordered_unique_range,
       ordered_range) 
    
-
    Configurable
-      tree-based associative ordered containers
    
 
    Constant-time
       range splice for (s)list
    
-
    Extended
-      allocators
    
-
    Polymorphic
-      Memory Resources 
    
 
    
+
    Extended functionality:
+    Configurable containers
    
+
    
+
    Configurable
+      tree-based associative ordered containers
    
+
    Configurable
+      vectors
    
+
    
+
    Extended functionality:
+    Extended allocators
    
+
    Extended Functionality:
+    Polymorphic Memory Resources 
    
 
    C++11/C++14 Conformance
    
 
    
 
    Move and Emplace
    
@@ -117,9 +125,9 @@
 
    
 
    Indexes
    
 
    
-
    Class Index
    
-
    Typedef Index
    
-
    Function Index
    
+
    Class Index
    
+
    Typedef Index
    
+
    Function Index
    
 
    
 
    Boost.Container Header Reference
    
 
    
@@ -172,6 +180,8 @@
     and links
 
    Release Notes
    
 
    
+
    Boost
+      1.67 Release
    
 
    Boost
       1.66 Release
    
 
    Boost
@@ -234,17 +244,25 @@
     
    
 
    
 
    
 
    
 
    
-
+
    Last revised: December 14, 2017 at 00:08:13 GMT
    Last revised: April 11, 2018 at 14:10:10 GMT
    		
 
    		
 
    
 
    
diff --git a/doc/html/container/Cpp11_conformance.html b/doc/html/container/Cpp11_conformance.html
index 02e5519b6e..d5a248c163 100644
--- a/doc/html/container/Cpp11_conformance.html
+++ b/doc/html/container/Cpp11_conformance.html
@@ -7,7 +7,7 @@
 
 
 
-
+
 
 
 
@@ -21,7 +21,7 @@
    -PrevUpHomeNext +PrevUpHomeNext

    @@ -140,8 +140,8 @@ class and backports this feature also to C++03 compilers. Due to C++03 limitations, in those compilers the allocator propagation implemented by scoped_allocator_adaptor::construct - functions will be based on traits (constructible_with_allocator_suffix - and constructible_with_allocator_prefix) + functions will be based on traits (constructible_with_allocator_suffix + and constructible_with_allocator_prefix) proposed in N2554: The Scoped Allocator Model (Rev 2) proposal. In conforming C++11 compilers or compilers supporting SFINAE expressions (when BOOST_NO_SFINAE_EXPR is NOT defined), traits @@ -242,7 +242,7 @@

    This strong exception guarantee also precludes the possibility of using some type of in-place reallocations that can further improve the insertion performance - of vector See Extended + of vector See Extended Allocators to know more about these optimizations.

    @@ -400,7 +400,8 @@

    -
    Copyright © 2009-2015 Ion Gaztanaga

    +

    Copyright © 2009-2017 Ion + Gaztanaga

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    @@ -408,7 +409,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/container/acknowledgements_notes.html b/doc/html/container/acknowledgements_notes.html index d99c3cebf0..693f9a4604 100644 --- a/doc/html/container/acknowledgements_notes.html +++ b/doc/html/container/acknowledgements_notes.html @@ -68,7 +68,8 @@
    - @@ -255,60 +255,60 @@
    -

    - Overloadable hash implementation (Boost extension).

    +

    + Overloadable hash implementation (Boost extension).

    1. -

      -
      std::size_t hash_value(bool val);
-std::size_t hash_value(char val);
-std::size_t hash_value(signed char val);
-std::size_t hash_value(unsigned char val);
-std::size_t hash_value(wchar_t val);
-std::size_t hash_value(char16_t val);
-std::size_t hash_value(char32_t val);
-std::size_t hash_value(short val);
-std::size_t hash_value(unsigned short val);
-std::size_t hash_value(int val);
-std::size_t hash_value(unsigned int val);
-std::size_t hash_value(long val);
-std::size_t hash_value(unsigned long val);
-std::size_t hash_value(long long val);
-std::size_t hash_value(unsigned long long val);
-std::size_t hash_value(float val);
-std::size_t hash_value(double val);
-std::size_t hash_value(long double val);
-template<typename T> std::size_t hash_value(T* const& val);
-template<typename T, unsigned N> std::size_t hash_value(T (&val)[N]);
-template<typename T, unsigned N> std::size_t hash_value(const T (&val)[N]);
+
      
+
      std::size_t hash_value(bool val);
+std::size_t hash_value(char val);
+std::size_t hash_value(signed char val);
+std::size_t hash_value(unsigned char val);
+std::size_t hash_value(wchar_t val);
+std::size_t hash_value(char16_t val);
+std::size_t hash_value(char32_t val);
+std::size_t hash_value(short val);
+std::size_t hash_value(unsigned short val);
+std::size_t hash_value(int val);
+std::size_t hash_value(unsigned int val);
+std::size_t hash_value(long val);
+std::size_t hash_value(unsigned long val);
+std::size_t hash_value(long long val);
+std::size_t hash_value(unsigned long long val);
+std::size_t hash_value(float val);
+std::size_t hash_value(double val);
+std::size_t hash_value(long double val);
+template<typename T> std::size_t hash_value(T* const& val);
+template<typename T, unsigned N> std::size_t hash_value(T (&val)[N]);
+template<typename T, unsigned N> std::size_t hash_value(const T (&val)[N]);
 template<typename Ch, typename A> 
-  std::size_t hash_value(std::basic_string<Ch, std::char_traits<Ch>, A> const& val);
+  std::size_t hash_value(std::basic_string<Ch, std::char_traits<Ch>, A> const& val);
 template<typename A, typename B> 
-  std::size_t hash_value(std::pair<A, B> const& val);
+  std::size_t hash_value(std::pair<A, B> const& val);
 template<typename T, typename A> 
-  std::size_t hash_value(std::vector<T, A> const& val);
+  std::size_t hash_value(std::vector<T, A> const& val);
 template<typename T, typename A> 
-  std::size_t hash_value(std::list<T, A> const& val);
+  std::size_t hash_value(std::list<T, A> const& val);
 template<typename T, typename A> 
-  std::size_t hash_value(std::deque<T, A> const& val);
+  std::size_t hash_value(std::deque<T, A> const& val);
 template<typename K, typename C, typename A> 
-  std::size_t hash_value(std::set<K, C, A> const& val);
+  std::size_t hash_value(std::set<K, C, A> const& val);
 template<typename K, typename C, typename A> 
-  std::size_t hash_value(std::multiset<K, C, A> const& val);
+  std::size_t hash_value(std::multiset<K, C, A> const& val);
 template<typename K, typename T, typename C, typename A> 
-  std::size_t hash_value(std::map<K, T, C, A> const& val);
+  std::size_t hash_value(std::map<K, T, C, A> const& val);
 template<typename K, typename T, typename C, typename A> 
-  std::size_t hash_value(std::multimap<K, T, C, A> const& val);
-template<typename T> std::size_t hash_value(std::complex<T> const& val);
-std::size_t hash_value(std::type_index val);
+  std::size_t hash_value(std::multimap<K, T, C, A> const& val);
+template<typename T> std::size_t hash_value(std::complex<T> const& val);
+std::size_t hash_value(std::type_index val);
 template<typename T, std::size_t N> 
-  std::size_t hash_value(std::array<T, N> const& val);
-template<typename... T> std::size_t hash_value(std::tuple<T...> val);
      
+  std::size_t hash_value(std::array<T, N> const& val);
+template<typename... T> std::size_t hash_value(std::tuple<T...> val);

      Implementation of the hash function.

      Generally shouldn't be called directly by users, instead they should use - boost::hash, boost::hash_range + boost::hash, boost::hash_range or boost::hash_combine which call hash_value without namespace qualification so that overloads for custom types are found via ADL. @@ -334,7 +334,7 @@

    diff --git a/doc/html/hash/tutorial.html b/doc/html/hash/tutorial.html index 5b650e67a5..cd9728c369 100644 --- a/doc/html/hash/tutorial.html +++ b/doc/html/hash/tutorial.html @@ -6,8 +6,8 @@ - - + + @@ -51,7 +51,7 @@ To use boost::hash directly, create an instance and call it as a function:

    -
    #include <boost/functional/hash.hpp>
+
    #include <boost/container_hash/hash.hpp>
 
 int main()
 {
@@ -68,8 +68,8 @@
 std::vector<std::size_t> get_hashes(Container const& x)
 {
     std::vector<std::size_t> hashes;
-    std::transform(x.begin(), x.end(), std::insert_iterator(hashes),
-        boost::hash<typename Container::value_type>());
+    std::transform(x.begin(), x.end(), std::back_inserter(hashes),
+        boost::hash<typename Container::value_type>());
 
     return hashes;
 }
diff --git a/doc/html/heap.html b/doc/html/heap.html
index 222580db38..7d6c7f5f0f 100644
--- a/doc/html/heap.html
+++ b/doc/html/heap.html
@@ -7,7 +7,7 @@
 
 
 
-
+
 
 
 
@@ -21,7 +21,7 @@
    Copyright © 2009-2015 Ion Gaztanaga

    +

    Copyright © 2009-2017 Ion + Gaztanaga

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/container/configurable_containers.html b/doc/html/container/configurable_containers.html new file mode 100644 index 0000000000..ec3b440d27 --- /dev/null +++ b/doc/html/container/configurable_containers.html @@ -0,0 +1,267 @@ + + + + +Extended functionality: Configurable containers + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +
    Configurable + tree-based associative ordered containers
    +
    Configurable + vectors
    +
    +
    +
    +

    + set, multiset, + map and multimap + associative containers are implemented as binary search trees which offer + the needed complexity and stability guarantees required by the C++ standard + for associative containers. +

    +

    + Boost.Container offers the possibility to + configure at compile time some parameters of the binary search tree implementation. + This configuration is passed as the last template parameter and defined using + the utility class tree_assoc_options. + The following parameters can be configured: +

    +
      +
    • + The underlying tree implementation type + (tree_type). + By default these containers use a red-black tree but the user can use + other tree types: +
        +
      • + Red-Black + Tree +
        • +
      • + AVL tree +
        • +
      • + Scapegoat + tree. In this case Insertion and Deletion are amortized + O(log n) instead of O(log n). +
        • +
      • + Splay tree. + In this case Searches, Insertions and Deletions are amortized O(log + n) instead of O(log n). +
        • +
      +
      • +
    • + Whether the size saving mechanisms are + used to implement the tree nodes (optimize_size). + By default this option is activated and is only meaningful to red-black + and avl trees (in other cases, this option will be ignored). This option + will try to put rebalancing metadata inside the "parent" pointer + of the node if the pointer type has enough alignment. Usually, due to + alignment issues, the metadata uses the size of a pointer yielding to + four pointer size overhead per node, whereas activating this option usually + leads to 3 pointer size overhead. Although some mask operations must + be performed to extract data from this special "parent" pointer, + in several systems this option also improves performance due to the improved + cache usage produced by the node size reduction. +
      • +
    +

    + See the following example to see how tree_assoc_options + can be used to customize these containers: +

    +

    +

    +
    #include <boost/container/set.hpp>
+
+//Make sure assertions are active
+#ifdef NDEBUG
+#undef NDEBUG
+#endif
+#include <cassert>
+
+int main ()
+{
+   using namespace boost::container;
+
+   //First define several options
+   //
+
+   //This option specifies an AVL tree based associative container
+   typedef tree_assoc_options< tree_type<avl_tree> >::type AVLTree;
+
+   //This option specifies an AVL tree based associative container
+   //disabling node size optimization.
+   typedef tree_assoc_options< tree_type<avl_tree>
+                             , optimize_size<false> >::type AVLTreeNoSizeOpt;
+
+   //This option specifies an Splay tree based associative container
+   typedef tree_assoc_options< tree_type<splay_tree> >::type SplayTree;
+
+   //Now define new tree-based associative containers
+   //
+
+   //AVLTree based set container
+   typedef set<int, std::less<int>, std::allocator<int>, AVLTree> AvlSet;
+
+   //AVLTree based set container without size optimization
+   typedef set<int, std::less<int>, std::allocator<int>, AVLTreeNoSizeOpt> AvlSetNoSizeOpt;
+
+   //Splay tree based multiset container
+   typedef multiset<int, std::less<int>, std::allocator<int>, SplayTree> SplayMultiset;
+
+   //Use them
+   //
+   AvlSet avl_set;
+   avl_set.insert(0);
+   assert(avl_set.find(0) != avl_set.end());
+
+   AvlSetNoSizeOpt avl_set_no_szopt;
+   avl_set_no_szopt.insert(1);
+   avl_set_no_szopt.insert(1);
+   assert(avl_set_no_szopt.count(1) == 1);
+
+   SplayMultiset splay_mset;
+   splay_mset.insert(2);
+   splay_mset.insert(2);
+   assert(splay_mset.count(2) == 2);
+   return 0;
+}
+
    +

    +

    +
    +
    +
    +

    + Boost.Container offers the possibility to + configure at compile time some parameters of vector + implementation. This configuration is passed as the last template parameter + and defined using the utility class vector_options. + The following parameters can be configured: +

    +
      +
    • + growth_factor: + the growth policy of the vector. The rate at which the capacity of a + vector grows is implementation dependent and implementations choose exponential + growth in order to meet the amortized constant time requirement for push_back. + A higher growth factor will make it faster as it will require less data + movement, but it will have a greater memory impact (on average, more + memory will be unused). A user can provide it's own implementation and + some predefined policies are available: growth_factor_50, + growth_factor_60 + and growth_factor_100. +
      • +
    • + stored_size: + the type that will be used to store size-related parameters inside of + the vector. Sometimes, when the maximum capacity to be used is much less + than the theoretical maximum that a vector can hold, it's interesting + to use smaller unsigned integer types to represent size() and capacity() inside vector, so that the size of + an empty vector is minimized and cache performance might be improved. + See stored_size + for more details. +
      • +
    +

    + See the following example to see how vector_options + can be used to customize vector + container: +

    +

    +

    +
    #include <boost/container/vector.hpp>
+#include <boost/static_assert.hpp>
+
+//Make sure assertions are active
+#ifdef NDEBUG
+#undef NDEBUG
+#endif
+#include <cassert>
+
+int main ()
+{
+   using namespace boost::container;
+
+   //This option specifies that a vector that will use "unsigned char" as
+   //the type to store capacity or size internally.
+   typedef vector_options< stored_size<unsigned char> >::type size_option_t;
+
+   //Size-optimized vector is smaller than the default one.
+   typedef vector<int, new_allocator<int>, size_option_t > size_optimized_vector_t;
+   BOOST_STATIC_ASSERT(( sizeof(size_optimized_vector_t) < sizeof(vector<int>) ));
+
+   //Requesting capacity for more elements than representable by "unsigned char"
+   //is an error in the size optimized vector.
+   bool exception_thrown = false;
+   try       { size_optimized_vector_t v(256); }
+   catch(...){ exception_thrown = true;        }
+   assert(exception_thrown == true);
+
+   //This option specifies that a vector will increase its capacity 50%
+   //each time the previous capacity was exhausted.
+   typedef vector_options< growth_factor<growth_factor_50> >::type growth_50_option_t;
+
+   //Fill the vector until full capacity is reached
+   vector<int, new_allocator<int>, growth_50_option_t > growth_50_vector(5, 0);
+   const std::size_t old_cap = growth_50_vector.capacity();
+   growth_50_vector.resize(old_cap);
+
+   //Now insert an additional item and check the new buffer is 50% bigger
+   growth_50_vector.push_back(1);
+   assert(growth_50_vector.capacity() == old_cap*3/2);
+
+   return 0;
+}
+
    +

    +

    +
    +
    + + + +
    Copyright © 2009-2017 Ion + Gaztanaga

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/container/exception_handling.html b/doc/html/container/exception_handling.html index c8b4c62e26..453629fecc 100644 --- a/doc/html/container/exception_handling.html +++ b/doc/html/container/exception_handling.html @@ -127,7 +127,8 @@
    -
    Copyright © 2009-2015 Ion Gaztanaga

    +

    Copyright © 2009-2017 Ion + Gaztanaga

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/container/extended_allocators.html b/doc/html/container/extended_allocators.html new file mode 100644 index 0000000000..6ceb017ea6 --- /dev/null +++ b/doc/html/container/extended_allocators.html @@ -0,0 +1,160 @@ + + + + +Extended functionality: Extended allocators + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +

    + Many C++ programmers have ever wondered where does good old realloc fit in + C++. And that's a good question. Could we improve vector + performance using memory expansion mechanisms to avoid too many copies? But + vector is not the only + container that could benefit from an improved allocator interface: we could + take advantage of the insertion of multiple elements in list + using a burst allocation mechanism that could amortize costs (mutex locks, + free memory searches...) that can't be amortized when using single node allocation + strategies. +

    +

    + These improvements require extending the STL allocator interface and use make + use of a new general purpose allocator since new and delete don't offer expansion + and burst capabilities. +

    +
      +
    • + Boost.Container containers support an + extended allocator interface based on an evolution of proposals N1953: + Upgrading the Interface of Allocators using API Versioning, N2045: + Improving STL allocators and the article Applying + classic memory allocation strategies to C++ containers. The extended + allocator interface is implemented by allocator, + adaptive_pool + and node_allocator + classes. +
      • +
    • + Extended allocators use a modified Doug + Lea Malloc (DLMalloc) low-level allocator and offers an C API to + implement memory expansion and burst allocations. DLmalloc is known to + be very size and speed efficient, and this allocator is used as the basis + of many malloc implementations, including multithreaded allocators built + above DLmalloc (See ptmalloc2, ptmalloc3 + or nedmalloc). + This low-level allocator is implemented as a separately compiled library + and the following extended allocators depend on the library: +
      • +
    • + allocator: This + extended allocator offers expansion, shrink-in place and burst allocation + capabilities implemented as a thin wrapper around the modified DLMalloc. + It can be used with all containers and it should be the default choice + when the programmer wants to use extended allocator capabilities. +
      • +
    • + node_allocator: + It's a Simple + Segregated Storage allocator, similar to Boost.Pool + that takes advantage of the modified DLMalloc burst interface. It does + not return memory to the DLMalloc allocator (and thus, to the system), + unless explicitly requested. It does offer a very small memory overhead + so it's suitable for node containers ([boost::container::list list], [boost::container::slist + slist] [boost::container::set set]...) that allocate very small value_types and it offers improved node + allocation times for single node allocations with respecto to allocator. +
      • +
    • + adaptive_pool: + It's a low-overhead node allocator that can return memory to the system. + The overhead can be very low (< 5% for small nodes) and it's nearly + as fast as node_allocator. + It's also suitable for node containers. +
      • +
    +

    + Use them simply specifying the new allocator in the corresponding template + argument of your favourite container: +

    +

    +

    +
    #include <boost/container/vector.hpp>
+#include <boost/container/flat_set.hpp>
+#include <boost/container/list.hpp>
+#include <boost/container/set.hpp>
+
+//"allocator" is a general purpose allocator that can reallocate
+//memory, something useful for vector and flat associative containers
+#include <boost/container/allocator.hpp>
+
+//"adaptive_pool" is a node allocator, specially suited for
+//node-based containers
+#include <boost/container/adaptive_pool.hpp>
+
+int main ()
+{
+   using namespace boost::container;
+
+   //A vector that can reallocate memory to implement faster insertions
+   vector<int, allocator<int> > extended_alloc_vector;
+
+   //A flat set that can reallocate memory to implement faster insertions
+   flat_set<int, std::less<int>, allocator<int> > extended_alloc_flat_set;
+
+   //A list that can manages nodes to implement faster
+   //range insertions and deletions
+   list<int, adaptive_pool<int> > extended_alloc_list;
+
+   //A set that can recycle nodes to implement faster
+   //range insertions and deletions
+   set<int, std::less<int>, adaptive_pool<int> > extended_alloc_set;
+
+   //Now user them as always
+   extended_alloc_vector.push_back(0);
+   extended_alloc_flat_set.insert(0);
+   extended_alloc_list.push_back(0);
+   extended_alloc_set.insert(0);
+
+   //...
+   return 0;
+}
+
    +

    +

    +
    + + + +
    Copyright © 2009-2017 Ion + Gaztanaga

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/container/extended_functionality.html b/doc/html/container/extended_functionality.html index ceb6a35387..6f3107210b 100644 --- a/doc/html/container/extended_functionality.html +++ b/doc/html/container/extended_functionality.html @@ -2,13 +2,13 @@ -Extended functionality +Extended functionality: Basic extensions - + @@ -21,11 +21,12 @@
    -PrevUpHomeNext +PrevUpHomeNext
    Default @@ -33,14 +34,8 @@
    Ordered range insertion for associative containers (ordered_unique_range, ordered_range)
    -
    Configurable - tree-based associative ordered containers
    Constant-time range splice for (s)list
    -
    Extended - allocators
    -
    Polymorphic - Memory Resources

    @@ -97,128 +92,6 @@

    -

    - set, multiset, - map and multimap - associative containers are implemented as binary search trees which offer - the needed complexity and stability guarantees required by the C++ standard - for associative containers. -

    -

    - Boost.Container offers the possibility to - configure at compile time some parameters of the binary search tree implementation. - This configuration is passed as the last template parameter and defined using - the utility class tree_assoc_options. -

    -

    - The following parameters can be configured: -

    -
      -
    • - The underlying tree implementation type - (tree_type). - By default these containers use a red-black tree but the user can use - other tree types: -
        -
      • - Red-Black - Tree -
        • -
      • - AVL tree -
        • -
      • - Scapegoat - tree. In this case Insertion and Deletion are amortized - O(log n) instead of O(log n). -
        • -
      • - Splay tree. - In this case Searches, Insertions and Deletions are amortized O(log - n) instead of O(log n). -
        • -
      -
      • -
    • - Whether the size saving mechanisms are - used to implement the tree nodes (optimize_size). - By default this option is activated and is only meaningful to red-black - and avl trees (in other cases, this option will be ignored). This option - will try to put rebalancing metadata inside the "parent" pointer - of the node if the pointer type has enough alignment. Usually, due to - alignment issues, the metadata uses the size of a pointer yielding to - four pointer size overhead per node, whereas activating this option usually - leads to 3 pointer size overhead. Although some mask operations must - be performed to extract data from this special "parent" pointer, - in several systems this option also improves performance due to the improved - cache usage produced by the node size reduction. -
      • -
    -

    - See the following example to see how tree_assoc_options - can be used to customize these containers: -

    -

    -

    -
    #include <boost/container/set.hpp>
-#include <cassert>
-
-int main ()
-{
-   using namespace boost::container;
-
-   //First define several options
-   //
-
-   //This option specifies an AVL tree based associative container
-   typedef tree_assoc_options< tree_type<avl_tree> >::type AVLTree;
-
-   //This option specifies an AVL tree based associative container
-   //disabling node size optimization.
-   typedef tree_assoc_options< tree_type<avl_tree>
-                             , optimize_size<false> >::type AVLTreeNoSizeOpt;
-
-   //This option specifies an Splay tree based associative container
-   typedef tree_assoc_options< tree_type<splay_tree> >::type SplayTree;
-
-   //Now define new tree-based associative containers
-   //
-
-   //AVLTree based set container
-   typedef set<int, std::less<int>, std::allocator<int>, AVLTree> AvlSet;
-
-   //AVLTree based set container without size optimization
-   typedef set<int, std::less<int>, std::allocator<int>, AVLTreeNoSizeOpt> AvlSetNoSizeOpt;
-
-   //Splay tree based multiset container
-   typedef multiset<int, std::less<int>, std::allocator<int>, SplayTree> SplayMultiset;
-
-   //Use them
-   //
-   AvlSet avl_set;
-   avl_set.insert(0);
-   assert(avl_set.find(0) != avl_set.end());
-
-   AvlSetNoSizeOpt avl_set_no_szopt;
-   avl_set_no_szopt.insert(1);
-   avl_set_no_szopt.insert(1);
-   assert(avl_set_no_szopt.count(1) == 1);
-
-   SplayMultiset splay_mset;
-   splay_mset.insert(2);
-   splay_mset.insert(2);
-   assert(splay_mset.count(2) == 2);
-   return 0;
-}
-
    -

    -

    -
    -
    -
    @@ -286,394 +159,11 @@ is also O(1)).

    -
    -
    -

    - Many C++ programmers have ever wondered where does good old realloc fit in - C++. And that's a good question. Could we improve vector - performance using memory expansion mechanisms to avoid too many copies? But - vector is not the only - container that could benefit from an improved allocator interface: we could - take advantage of the insertion of multiple elements in list - using a burst allocation mechanism that could amortize costs (mutex locks, - free memory searches...) that can't be amortized when using single node allocation - strategies. -

    -

    - These improvements require extending the STL allocator interface and use - make use of a new general purpose allocator since new and delete don't offer - expansion and burst capabilities. -

    -
      -
    • - Boost.Container containers support an - extended allocator interface based on an evolution of proposals N1953: - Upgrading the Interface of Allocators using API Versioning, - N2045: - Improving STL allocators and the article Applying - classic memory allocation strategies to C++ containers. The extended - allocator interface is implemented by allocator, - adaptive_pool - and node_allocator - classes. -
      • -
    • - Extended allocators use a modified Doug - Lea Malloc (DLMalloc) low-level allocator and offers an C API - to implement memory expansion and burst allocations. DLmalloc is known - to be very size and speed efficient, and this allocator is used as the - basis of many malloc implementations, including multithreaded allocators - built above DLmalloc (See ptmalloc2, - ptmalloc3 or nedmalloc). - This low-level allocator is implemented as a separately compiled library - and the following extended allocators depend on the library: -
      • -
    • - allocator: This - extended allocator offers expansion, shrink-in place and burst allocation - capabilities implemented as a thin wrapper around the modified DLMalloc. - It can be used with all containers and it should be the default choice - when the programmer wants to use extended allocator capabilities. -
      • -
    • - node_allocator: - It's a Simple - Segregated Storage allocator, similar to Boost.Pool - that takes advantage of the modified DLMalloc burst interface. It does - not return memory to the DLMalloc allocator (and thus, to the system), - unless explicitly requested. It does offer a very small memory overhead - so it's suitable for node containers ([boost::container::list list], - [boost::container::slist slist] [boost::container::set set]...) that - allocate very small value_types - and it offers improved node allocation times for single node allocations - with respecto to allocator. -
      • -
    • - adaptive_pool: - It's a low-overhead node allocator that can return memory to the system. - The overhead can be very low (< 5% for small nodes) and it's nearly - as fast as node_allocator. - It's also suitable for node containers. -
      • -
    -

    - Use them simply specifying the new allocator in the corresponding template - argument of your favourite container: -

    -

    -

    -
    #include <boost/container/vector.hpp>
-#include <boost/container/flat_set.hpp>
-#include <boost/container/list.hpp>
-#include <boost/container/set.hpp>
-
-//"allocator" is a general purpose allocator that can reallocate
-//memory, something useful for vector and flat associative containers
-#include <boost/container/allocator.hpp>
-
-//"adaptive_pool" is a node allocator, specially suited for
-//node-based containers
-#include <boost/container/adaptive_pool.hpp>
-
-int main ()
-{
-   using namespace boost::container;
-
-   //A vector that can reallocate memory to implement faster insertions
-   vector<int, allocator<int> > extended_alloc_vector;
-
-   //A flat set that can reallocate memory to implement faster insertions
-   flat_set<int, std::less<int>, allocator<int> > extended_alloc_flat_set;
-
-   //A list that can manages nodes to implement faster
-   //range insertions and deletions
-   list<int, adaptive_pool<int> > extended_alloc_list;
-
-   //A set that can recycle nodes to implement faster
-   //range insertions and deletions
-   set<int, std::less<int>, adaptive_pool<int> > extended_alloc_set;
-
-   //Now user them as always
-   extended_alloc_vector.push_back(0);
-   extended_alloc_flat_set.insert(0);
-   extended_alloc_list.push_back(0);
-   extended_alloc_set.insert(0);
-
-   //...
-   return 0;
-}
-
    -

    -

    -
    -
    -
    -

    - The document C++ - Extensions for Library Fundamentals (Final draft: N4480) includes - classes that provide allocator type erasure and runtime polymorphism. As - Pablo Halpern, the author of the proposal, explains in the paper (N3916 Polymorphic Memory - Resources (r2)): -

    -

    - “A significant impediment to effective memory management - in C++ has been the inability to use allocators in non-generic contexts. - In large software systems, most of the application program consists of non-generic - procedural or object-oriented code that is compiled once and linked many - times.” -

    -

    - “Allocators in C++, however, have historically relied solely - on compile-time polymorphism, and therefore have not been suitable for use - in vocabulary types, which are passed through interfaces between separately-compiled - modules, because the allocator type necessarily affects the type of the object - that uses it. This proposal builds upon the improvements made to allocators - in C++11 and describes a set of facilities for runtime polymorphic memory - resources that interoperate with the existing compile-time polymorphic allocators.” -

    -

    - Boost.Container implements nearly all classes - of the proposal under the namespace boost::container::pmr. - There are two groups, -

    -
    -

    - Boost.Container's polymorphic resource library - is usable from C++03 containers, and offers some alternative utilities if - the required C++11 features of the Library Fundamentals - specification are not available. -

    -

    - Let's review the usage example given in N3916 - and see how it can be implemented using Boost.Container: - Suppose we are processing a series of shopping lists, where a shopping - list is a container of strings, and storing them in a collection (a list) - of shopping lists. Each shopping list being processed uses a bounded amount - of memory that is needed for a short period of time, while the collection - of shopping lists uses an unbounded amount of memory and will exist for a - longer period of time. For efficiency, we can use a more time-efficient memory - allocator based on a finite buffer for the temporary shopping lists. -

    -

    - Let's see how ShoppingList - can be defined to support an polymorphic memory resource that can allocate - memory from different underlying mechanisms. The most important details are: -

    -
      -
    • - It should declare that supports an allocator defining an allocator_type typedef. This allocator_type will be of type memory_resource *, - which is a base class for polymorphic resources. -
      • -
    • - It must define constructors that take the the allocator as argument. - It can be implemented in two ways: -
      -
      • -
    -

    - Note: In C++03 compilers, it is - required that the programmer specializes as true - constructible_with_allocator_suffix - or constructible_with_allocator_prefix - as in C++03 there is no way to automatically detect the chosen option at - compile time. If no specialization is done, Boost.Container - assumes the suffix option. -

    -

    -

    -
    //ShoppingList.hpp
-#include <boost/container/pmr/vector.hpp>
-#include <boost/container/pmr/string.hpp>
-
-class ShoppingList
-{
-   // A vector of strings using polymorphic allocators. Every element
-   // of the vector will use the same allocator as the vector itself.
-   boost::container::pmr::vector_of
-      <boost::container::pmr::string>::type m_strvec;
-   //Alternatively in compilers that support template aliases:
-   //    boost::container::pmr::vector<boost::container::pmr::string> m_strvec;
-   public:
-
-   // This makes uses_allocator<ShoppingList, memory_resource*>::value true
-   typedef boost::container::pmr::memory_resource* allocator_type;
-
-   // If the allocator is not specified, "m_strvec" uses pmr::get_default_resource().
-   explicit ShoppingList(allocator_type alloc = 0)
-      : m_strvec(alloc) {}
-
-   // Copy constructor. As allocator is not specified,
-   // "m_strvec" uses pmr::get_default_resource().
-   ShoppingList(const ShoppingList& other)
-      : m_strvec(other.m_strvec) {}
-
-   // Copy construct using the given memory_resource.
-   ShoppingList(const ShoppingList& other, allocator_type a)
-      : m_strvec(other.m_strvec, a) {}
-
-   allocator_type get_allocator() const
-   { return m_strvec.get_allocator().resource(); }
-
-   void add_item(const char *item)
-   { m_strvec.emplace_back(item); }
-
-   //...
-};
-
    -

    -

    -

    - However, this time-efficient allocator is not appropriate for the - longer lived collection of shopping lists. This example shows how those temporary - shopping lists, using a time-efficient allocator, can be used to populate - the long lived collection of shopping lists, using a general purpose allocator, - something that would be annoyingly difficult without the polymorphic allocators. -

    -

    - In Boost.Container for the time-efficient - allocation we can use monotonic_buffer_resource, - providing an external buffer that will be used until it's exhausted. In the - default configuration, when the buffer is exhausted, the default memory resource - will be used instead. -

    -

    -

    -
    #include "ShoppingList.hpp"
-#include <cassert>
-#include <boost/container/pmr/list.hpp>
-#include <boost/container/pmr/monotonic_buffer_resource.hpp>
-
-void processShoppingList(const ShoppingList&)
-{  /**/   }
-
-int main()
-{
-   using namespace boost::container;
-   //All memory needed by folder and its contained objects will
-   //be allocated from the default memory resource (usually new/delete) 
-   pmr::list_of<ShoppingList>::type folder; // Default allocator resource
-   //Alternatively in compilers that support template aliases:
-   //    boost::container::pmr::list<ShoppingList> folder;
-   {
-      char buffer[1024];
-      pmr::monotonic_buffer_resource buf_rsrc(&buffer, 1024);
-
-      //All memory needed by temporaryShoppingList will be allocated
-      //from the local buffer (speeds up "processShoppingList")
-      ShoppingList temporaryShoppingList(&buf_rsrc);
-      assert(&buf_rsrc == temporaryShoppingList.get_allocator());
-
-      //list nodes, and strings "salt" and "pepper" will be allocated
-      //in the stack thanks to "monotonic_buffer_resource".
-      temporaryShoppingList.add_item("salt");
-      temporaryShoppingList.add_item("pepper");
-      //...
-
-      //All modifications and additions to "temporaryShoppingList"
-      //will use memory from "buffer" until it's exhausted.
-      processShoppingList(temporaryShoppingList);
-
-      //Processing done, now insert it in "folder",
-      //which uses the default memory resource
-      folder.push_back(temporaryShoppingList);
-      assert(pmr::get_default_resource() == folder.back().get_allocator());
-      //temporaryShoppingList, buf_rsrc, and buffer go out of scope
-   }
-   return 0;
-}
-
    -

    -

    -

    - Notice that the shopping lists within folder - use the default allocator resource whereas the shopping list temporaryShoppingList uses the short-lived - but very fast buf_rsrc. Despite - using different allocators, you can insert temporaryShoppingList - into folder because they have the same ShoppingList - type. Also, while ShoppingList - uses memory_resource directly, pmr::list, - pmr::vector and - pmr::string all - use polymorphic_allocator. -

    -

    - The resource passed to the ShoppingList - constructor is propagated to the vector and each string within that ShoppingList. Similarly, the resource used - to construct folder is propagated - to the constructors of the ShoppingLists that are inserted into the list - (and to the strings within those ShoppingLists). - The polymorphic_allocator - template is designed to be almost interchangeable with a pointer to memory_resource, - thus producing a bridge between the template-policy - style of allocator and the polymorphic-base-class style of allocator. -

    -

    - This example actually shows how easy is to use Boost.Container - to write type-erasured allocator-capable classes even in C++03 compilers. -

    -
    -
    Copyright © 2009-2015 Ion Gaztanaga

    +

    Copyright © 2009-2017 Ion + Gaztanaga

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    @@ -681,7 +171,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/container/history_and_reasons.html b/doc/html/container/history_and_reasons.html index f1c79064eb..c33c8b4f61 100644 --- a/doc/html/container/history_and_reasons.html +++ b/doc/html/container/history_and_reasons.html @@ -106,7 +106,7 @@
  • - Extended functionality + Extended functionality beyond the standard based on user feedback to improve code performance.
  • @@ -119,7 +119,8 @@
    • -
    Copyright © 2009-2015 Ion Gaztanaga

    +

    Copyright © 2009-2017 Ion + Gaztanaga

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/container/index.html b/doc/html/container/index.html index 28591ae8e8..c1cec9b86f 100644 --- a/doc/html/container/index.html +++ b/doc/html/container/index.html @@ -28,14 +28,14 @@ Indexes
    -
    Class Index
    -
    Typedef Index
    -
    Function Index
    +
    Class Index
    +
    Typedef Index
    +
    Function Index

    -Class Index

    -

    A B C D E F I L N O P R S T U V

    +Class Index
    +

    A B C D E F G I L N O P R S T U V

    A @@ -49,9 +49,9 @@

    allocator

  • @@ -62,21 +62,27 @@
    B
    -
    C
    @@ -120,12 +126,39 @@
    • +G +
    +
    +
    I
    -
    L
    @@ -140,7 +173,7 @@

  • new_allocator

    • @@ -186,7 +219,7 @@

    A C D I K M N O P R S T V W

    @@ -315,10 +369,10 @@

  • Class template slist

  • Class template stable_vector

  • Class template vector

    • -

  • Polymorphic Memory Resources

    • +

  • Extended Functionality: Polymorphic Memory Resources

  • Struct template allocator_traits

    • -

  • Struct template constructible_with_allocator_prefix

    • -

  • Struct template constructible_with_allocator_suffix

    • +

  • Struct template constructible_with_allocator_prefix

    • +

  • Struct template constructible_with_allocator_suffix

    • @@ -349,7 +403,7 @@

  • const_pointer

    @@ -450,7 +504,7 @@

  • Class template flat_multimap

  • Class template flat_multiset

  • Class template flat_set

    • -

  • Class template insert_iterator<boost::container::slist< T, Allocator >>

    • +

  • Class template insert_iterator<boost::container::slist< T, Allocator >>

  • Class template list

  • Class template map

  • Class template multimap

    • @@ -489,7 +543,7 @@

  • is_always_equal

    @@ -612,7 +666,7 @@

  • other

    A B C D E F G H I L M N O P R S T U V Y

    @@ -984,9 +1032,9 @@
    • @@ -1089,6 +1137,8 @@

  • Class template stable_vector

  • Class template static_vector

  • Class template vector

    • +

  • Configurable vectors

    • +

  • Struct template stored_size

  • @@ -1499,7 +1549,7 @@

    list

  • @@ -1607,7 +1657,7 @@

  • nodes

    -
    +

  • node_handle

    @@ -1621,27 +1671,31 @@

  • O

  • operator

    -
    +

  • outer_allocator

    @@ -1735,10 +1789,11 @@

  • release

  • @@ -1832,6 +1887,7 @@

  • Class template stable_vector

  • Class template static_vector

  • Class template vector

    • +

  • Configurable vectors

  • Constant-time range splice for ( s ) list

  • Introduction

  • slist

    • @@ -1844,6 +1900,7 @@

  • Class template node_allocator

  • Class template polymorphic_allocator

  • stable_vector

    • +

  • Struct template stored_size

  • @@ -1892,7 +1949,7 @@

    swap

    @@ -1983,7 +2040,10 @@

  • types

    -
    +
    • @@ -2027,14 +2087,15 @@
    -
    Copyright © 2009-2015 Ion Gaztanaga

    +

    Copyright © 2009-2017 Ion + Gaztanaga

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/container/known_issues.html b/doc/html/container/known_issues.html index d6ef9e2088..5ee9c87c66 100644 --- a/doc/html/container/known_issues.html +++ b/doc/html/container/known_issues.html @@ -66,7 +66,8 @@
    -
    Copyright © 2009-2015 Ion Gaztanaga

    +

    Copyright © 2009-2017 Ion + Gaztanaga

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/container/main_features.html b/doc/html/container/main_features.html index 762036b8a5..d7274e6ed8 100644 --- a/doc/html/container/main_features.html +++ b/doc/html/container/main_features.html @@ -233,10 +233,12 @@

    Fortunately all Boost.Container containers except static_vector + and small_vector and basic_string are designed to support incomplete types. static_vector - is special because it statically allocates memory for value_type - and this requires complete types and basic_string + and small_vector + are special because they statically allocates memory for value_type + and this requires complete types. basic_string implements Small String Optimization which also requires complete types.

    @@ -487,7 +489,8 @@

    -
    Copyright © 2009-2015 Ion Gaztanaga

    +

    Copyright © 2009-2017 Ion + Gaztanaga

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/container/non_standard_containers.html b/doc/html/container/non_standard_containers.html index 0352bef316..e752d180a2 100644 --- a/doc/html/container/non_standard_containers.html +++ b/doc/html/container/non_standard_containers.html @@ -8,7 +8,7 @@ - + @@ -71,7 +71,7 @@ data structure upon which to base the design of a stable vector:

    - stable_vector + stable_vector

    Each element is stored in its own separate node. All the nodes are referenced @@ -494,7 +494,8 @@

    -
    Copyright © 2009-2015 Ion Gaztanaga

    +

    Copyright © 2009-2017 Ion + Gaztanaga

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    diff --git a/doc/html/container/polymorphic_memory_resources.html b/doc/html/container/polymorphic_memory_resources.html new file mode 100644 index 0000000000..9544211884 --- /dev/null +++ b/doc/html/container/polymorphic_memory_resources.html @@ -0,0 +1,300 @@ + + + + +Extended Functionality: Polymorphic Memory Resources + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +

    + The document C++ + Extensions for Library Fundamentals (Final draft: N4480) includes classes + that provide allocator type erasure and runtime polymorphism. As Pablo Halpern, + the author of the proposal, explains in the paper (N3916 + Polymorphic Memory Resources (r2)): +

    +

    + “A significant impediment to effective memory management in + C++ has been the inability to use allocators in non-generic contexts. In large + software systems, most of the application program consists of non-generic procedural + or object-oriented code that is compiled once and linked many times.” +

    +

    + “Allocators in C++, however, have historically relied solely + on compile-time polymorphism, and therefore have not been suitable for use + in vocabulary types, which are passed through interfaces between separately-compiled + modules, because the allocator type necessarily affects the type of the object + that uses it. This proposal builds upon the improvements made to allocators + in C++11 and describes a set of facilities for runtime polymorphic memory resources + that interoperate with the existing compile-time polymorphic allocators.” +

    +

    + Boost.Container implements nearly all classes + of the proposal under the namespace boost::container::pmr. There + are two groups, +

    +
    +

    + Boost.Container's polymorphic resource library + is usable from C++03 containers, and offers some alternative utilities if the + required C++11 features of the Library Fundamentals specification + are not available. +

    +

    + Let's review the usage example given in N3916 + and see how it can be implemented using Boost.Container: + Suppose we are processing a series of shopping lists, where a shopping + list is a container of strings, and storing them in a collection (a list) of + shopping lists. Each shopping list being processed uses a bounded amount of + memory that is needed for a short period of time, while the collection of shopping + lists uses an unbounded amount of memory and will exist for a longer period + of time. For efficiency, we can use a more time-efficient memory allocator + based on a finite buffer for the temporary shopping lists. +

    +

    + Let's see how ShoppingList + can be defined to support an polymorphic memory resource that can allocate + memory from different underlying mechanisms. The most important details are: +

    +
      +
    • + It should declare that supports an allocator defining an allocator_type typedef. This allocator_type will be of type memory_resource *, + which is a base class for polymorphic resources. +
      • +
    • + It must define constructors that take the the allocator as argument. It + can be implemented in two ways: +
      +
      • +
    +

    + Note: In C++03 compilers, it is + required that the programmer specializes as true + constructible_with_allocator_suffix + or constructible_with_allocator_prefix + as in C++03 there is no way to automatically detect the chosen option at compile + time. If no specialization is done, Boost.Container + assumes the suffix option. +

    +

    +

    +
    //ShoppingList.hpp
+#include <boost/container/pmr/vector.hpp>
+#include <boost/container/pmr/string.hpp>
+
+class ShoppingList
+{
+   // A vector of strings using polymorphic allocators. Every element
+   // of the vector will use the same allocator as the vector itself.
+   boost::container::pmr::vector_of
+      <boost::container::pmr::string>::type m_strvec;
+   //Alternatively in compilers that support template aliases:
+   //    boost::container::pmr::vector<boost::container::pmr::string> m_strvec;
+   public:
+
+   // This makes uses_allocator<ShoppingList, memory_resource*>::value true
+   typedef boost::container::pmr::memory_resource* allocator_type;
+
+   // If the allocator is not specified, "m_strvec" uses pmr::get_default_resource().
+   explicit ShoppingList(allocator_type alloc = 0)
+      : m_strvec(alloc) {}
+
+   // Copy constructor. As allocator is not specified,
+   // "m_strvec" uses pmr::get_default_resource().
+   ShoppingList(const ShoppingList& other)
+      : m_strvec(other.m_strvec) {}
+
+   // Copy construct using the given memory_resource.
+   ShoppingList(const ShoppingList& other, allocator_type a)
+      : m_strvec(other.m_strvec, a) {}
+
+   allocator_type get_allocator() const
+   { return m_strvec.get_allocator().resource(); }
+
+   void add_item(const char *item)
+   { m_strvec.emplace_back(item); }
+
+   //...
+};
+
    +

    +

    +

    + However, this time-efficient allocator is not appropriate for the + longer lived collection of shopping lists. This example shows how those temporary + shopping lists, using a time-efficient allocator, can be used to populate the + long lived collection of shopping lists, using a general purpose allocator, + something that would be annoyingly difficult without the polymorphic allocators. +

    +

    + In Boost.Container for the time-efficient + allocation we can use monotonic_buffer_resource, + providing an external buffer that will be used until it's exhausted. In the + default configuration, when the buffer is exhausted, the default memory resource + will be used instead. +

    +

    +

    +
    #include "ShoppingList.hpp"
+#include <cassert>
+#include <boost/container/pmr/list.hpp>
+#include <boost/container/pmr/monotonic_buffer_resource.hpp>
+
+void processShoppingList(const ShoppingList&)
+{  /**/   }
+
+int main()
+{
+   using namespace boost::container;
+   //All memory needed by folder and its contained objects will
+   //be allocated from the default memory resource (usually new/delete) 
+   pmr::list_of<ShoppingList>::type folder; // Default allocator resource
+   //Alternatively in compilers that support template aliases:
+   //    boost::container::pmr::list<ShoppingList> folder;
+   {
+      char buffer[1024];
+      pmr::monotonic_buffer_resource buf_rsrc(&buffer, 1024);
+
+      //All memory needed by temporaryShoppingList will be allocated
+      //from the local buffer (speeds up "processShoppingList")
+      ShoppingList temporaryShoppingList(&buf_rsrc);
+      assert(&buf_rsrc == temporaryShoppingList.get_allocator());
+
+      //list nodes, and strings "salt" and "pepper" will be allocated
+      //in the stack thanks to "monotonic_buffer_resource".
+      temporaryShoppingList.add_item("salt");
+      temporaryShoppingList.add_item("pepper");
+      //...
+
+      //All modifications and additions to "temporaryShoppingList"
+      //will use memory from "buffer" until it's exhausted.
+      processShoppingList(temporaryShoppingList);
+
+      //Processing done, now insert it in "folder",
+      //which uses the default memory resource
+      folder.push_back(temporaryShoppingList);
+      assert(pmr::get_default_resource() == folder.back().get_allocator());
+      //temporaryShoppingList, buf_rsrc, and buffer go out of scope
+   }
+   return 0;
+}
+
    +

    +

    +

    + Notice that the shopping lists within folder + use the default allocator resource whereas the shopping list temporaryShoppingList uses the short-lived + but very fast buf_rsrc. Despite + using different allocators, you can insert temporaryShoppingList + into folder because they have the same ShoppingList + type. Also, while ShoppingList + uses memory_resource directly, pmr::list, + pmr::vector and + pmr::string all + use polymorphic_allocator. +

    +

    + The resource passed to the ShoppingList + constructor is propagated to the vector and each string within that ShoppingList. Similarly, the resource used + to construct folder is propagated + to the constructors of the ShoppingLists that are inserted into the list (and + to the strings within those ShoppingLists). + The polymorphic_allocator + template is designed to be almost interchangeable with a pointer to memory_resource, thus + producing a bridge between the template-policy style of + allocator and the polymorphic-base-class style of allocator. +

    +

    + This example actually shows how easy is to use Boost.Container + to write type-erasured allocator-capable classes even in C++03 compilers. +

    +
    + + + +
    Copyright © 2009-2017 Ion + Gaztanaga

    + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/container/release_notes.html b/doc/html/container/release_notes.html index af8798a86d..954efa8c94 100644 --- a/doc/html/container/release_notes.html +++ b/doc/html/container/release_notes.html @@ -8,7 +8,7 @@ - + @@ -21,13 +21,15 @@
    -PrevUpHomeNext +PrevUpHomeNext
    +
    Boost + 1.67 Release
    Boost 1.66 Release
    Boost @@ -69,6 +71,45 @@
    +
    +
    +
    +
    @@ -354,7 +395,7 @@
    -
    Copyright © 2009-2015 Ion Gaztanaga

    +

    Copyright © 2009-2017 Ion + Gaztanaga

    Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    @@ -788,7 +830,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/conversion.html b/doc/html/conversion.html index d69a15aadd..30f0bac87d 100644 --- a/doc/html/conversion.html +++ b/doc/html/conversion.html @@ -2,12 +2,12 @@ -Chapter 10. The Conversion Library 1.6 +Chapter 11. The Conversion Library 1.6 - + @@ -21,12 +21,12 @@
    -PrevUpHomeNext +PrevUpHomeNext

    -Chapter 10. The Conversion Library 1.6

    +Chapter 11. The Conversion Library 1.6

    Bjarne Stroustrup @@ -110,7 +110,7 @@

    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/conversion/_polymorphic_cast____polymorphic_downcast____polymorphic_pointer_cast__and__polymorphic_pointer_downcast__synopsis.html b/doc/html/conversion/_polymorphic_cast____polymorphic_downcast____polymorphic_pointer_cast__and__polymorphic_pointer_downcast__synopsis.html index 46fd0cb5aa..12f1dc69ea 100644 --- a/doc/html/conversion/_polymorphic_cast____polymorphic_downcast____polymorphic_pointer_cast__and__polymorphic_pointer_downcast__synopsis.html +++ b/doc/html/conversion/_polymorphic_cast____polymorphic_downcast____polymorphic_pointer_cast__and__polymorphic_pointer_downcast__synopsis.html @@ -6,7 +6,7 @@ - + diff --git a/doc/html/conversion/_polymorphic_downcast__example.html b/doc/html/conversion/_polymorphic_downcast__example.html index 88aa538384..b942a73933 100644 --- a/doc/html/conversion/_polymorphic_downcast__example.html +++ b/doc/html/conversion/_polymorphic_downcast__example.html @@ -6,7 +6,7 @@ - + diff --git a/doc/html/conversion/_polymorphic_pointer_downcast__example.html b/doc/html/conversion/_polymorphic_pointer_downcast__example.html index fc9ead9334..c40015482a 100644 --- a/doc/html/conversion/_polymorphic_pointer_downcast__example.html +++ b/doc/html/conversion/_polymorphic_pointer_downcast__example.html @@ -6,7 +6,7 @@ - + diff --git a/doc/html/conversion/history.html b/doc/html/conversion/history.html index b62f83d19e..1ff9cac8a0 100644 --- a/doc/html/conversion/history.html +++ b/doc/html/conversion/history.html @@ -6,9 +6,9 @@ - + - + diff --git a/doc/html/conversion/polymorphic_casts.html b/doc/html/conversion/polymorphic_casts.html index f484970538..3982c3264a 100644 --- a/doc/html/conversion/polymorphic_casts.html +++ b/doc/html/conversion/polymorphic_casts.html @@ -6,8 +6,8 @@ - - + + diff --git a/doc/html/date_time.html b/doc/html/date_time.html index ca9dbf9759..8d0e82ff04 100644 --- a/doc/html/date_time.html +++ b/doc/html/date_time.html @@ -2,7 +2,7 @@ -Chapter 11. Boost.Date_Time +Chapter 12. Boost.Date_Time @@ -26,13 +26,13 @@

    -Chapter 11. Boost.Date_Time

    +Chapter 12. Boost.Date_Time

    Jeff Garland

    Copyright © 2001-2005 CrystalClear Software, Inc

    -

    Subject to the Boost Software License, Version 1.0. (See accompanying file +

    Subject to the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

    @@ -124,7 +124,7 @@

    -Introduction

    +Introduction

    A set of date-time libraries based on generic programming concepts.

    diff --git a/doc/html/date_time/date_time_io.html b/doc/html/date_time/date_time_io.html index 605d177e0a..5f5231fb10 100644 --- a/doc/html/date_time/date_time_io.html +++ b/doc/html/date_time/date_time_io.html @@ -6,7 +6,7 @@ - + @@ -36,7 +36,7 @@
    Date Time IO Tutorial

    -Date Time IO System

    +Date Time IO System

    Exception Handling on Streams

    @@ -45,7 +45,7 @@

    It is important to note, that while all the examples shown here use narrow streams, there are wide stream facets available as well (see IO Objects for a complete list).

    It should be further noted that not all compilers are capable of using this IO system. For those compilers the IO system used in previous date_time versions is still available. The "legacy IO" is automatically selected for these compilers, however, the legacy IO system can be manually selected by defining USE_DATE_TIME_PRE_1_33_FACET_IO. See the Build-Compiler Information for more information.

    -Exception Handling on Streams
    +Exception Handling on Streams

    When an error occurs during the input streaming process, the std::ios_base::failbit will (always) be set on the stream. It is also possible to have exceptions thrown when an error occurs. To "turn on" these exceptions, call the stream's exceptions function with a parameter of std::ios_base::failbit.

    // "Turning on" exceptions
 date d(not_a_date_time);
@@ -54,7 +54,7 @@ ss.exceptions(std::ios_base::failbit);
 ss.str("204-Jan-01");
 ss >> d; // throws bad_year exception AND sets failbit on stream
    -A simple example of this new system:
    +A simple example of this new system:
    //example to customize output to be "LongWeekday LongMonthname day, year"
 //                                  "%A %b %d, %Y"
 date d(2005,Jun,25);
@@ -117,7 +117,9 @@ std::cout << d << std::endl;
    - + @@ -127,7 +129,10 @@ std::cout << d << std::endl; - + @@ -414,7 +419,7 @@ cout << pt; // "31.10.2005 20:00:00"

    The following table lists the available facets.

    -IO Objects

    +IO Objects

    
 
    
 
    %d
    		Day of the month as decimal 01 to 31
+              Day of the month as decimal 01 to 31.  When used to parse input, the leading zero is optional.
+            
 
    
 
    
 
    
 
    
 
    %e #
    		Like %d, the day of the month as a decimal number, but a leading zero is replaced by a space
+              Like %d, the day of the month as a decimal number, but a leading zero is replaced by a space.
+              When used to parse input, the leading space is optional.
+            
 
    
 
    
 
    
 
 
 
 
 
    
@@ -461,7 +466,7 @@ cout << pt; // "31.10.2005 20:00:00"
     * These links lead to the time_facet and time_input_facet reference sections. They are not actual classes but typedefs.
   
    
-Formatter/Parser Objects
    
+Formatter/Parser Objects
    To implement the new i/o facets the date-time library uses a number of new parsers and formatters. These classes are available for users that want to implement specialized input/output routines.
    
     
    
@@ -501,11 +506,11 @@ cout << pt; // "31.10.2005 20:00:00"Introduction -
   Construction -
   Accessors
    
-Introduction
    
+Introduction
    The boost::date_time::date_facet enables users to have significant control over the output streaming of dates (and other gregorian objects). The date_facet is typedef'd in the gregorian namespace as date_facet and wdate_facet. 
   
    
-Construction
    
+Construction
    
     
    
 
 
 
 
 
 
 
 
    
@@ -543,7 +548,7 @@ cout << pt; // "31.10.2005 20:00:00"
    
   
    
-Accessors
    
+Accessors
    
     
    
 
 
 
 
    
@@ -734,11 +739,11 @@ ss << greg_weekday(2); // "Tue"Introduction -
   Construction -
   Accessors
    
-Introduction
    
+Introduction
    The boost::date_time::date_input_facet enables users to have significant control how dates (and other gregorian objects) are streamed in. The date_input_facet is typedef'd in the gregorian namespace as date_input_facet and wdate_input_facet. 
   
    
-Construction
    
+Construction
    
     
    
 
 
 
 
 
    
@@ -774,7 +779,7 @@ ss << greg_weekday(2); // "Tue"
    
   
    
-Accessors
    
+Accessors
    
     
    
 
 
 
 
    
@@ -983,11 +988,11 @@ ss >> dys; // a full yearIntroduction -
   Construction -
   Accessors
    
-Introduction
    
+Introduction
    The boost::date_time::time_facet is an extension of the boost::date_time::date_facet. The time_facet is typedef'ed in the posix_time namespace as time_facet and wtime_facet. It is typedef'd in the local_time namespace as local_time_facet and wlocal_time_facet.
   
    
-Construction
    
+Construction
    
     
    
 
 
 
 
 
    
@@ -1018,7 +1023,7 @@ ss >> dys; // a full year
    
   
    
-Accessors
    
+Accessors
    
     The time_facet inherits all the public date_facet methods. Therefore, the date_facet methods are not listed here. Instead, they can be found by following this link.
     
    
@@ -1098,11 +1103,11 @@ ss << td2; // "-12:25:56"
 Introduction -
   Construction -
   Accessors
    
-Introduction
    
+Introduction
    The boost::date_time::time_input_facet is an extension of the date_input_facet. It is typedef'ed in the boost::posix_time namespace as time_input_facet and wtime_input_facet. It is typedef'ed in the boost::local_time namespace as local_time_input_facet and wlocal_time_input_facet.
   
    
-Construction
    
+Construction
    
     
    
 
 
 
 
 
 
 
    
@@ -1138,7 +1143,7 @@ ss << td2; // "-12:25:56"
 
    
   
    
-Accessors
    
+Accessors
    
     The time_input_facet inherits all the public date_input_facet methods. Therefore, the date_input_facet methods are not listed here. Instead, they can be found by following this link.
     
    
@@ -1215,20 +1220,20 @@ ss >> td; // default format
    
 Date Time Formatter/Parser Objects
    
-Date Time Formatter/Parser Objects
    
+Date Time Formatter/Parser ObjectsPeriods |
   Date Generators |
   Special Values |
   Format Date Parser
    
-Periods
    
+Periods
    The period_formatter and period_parser provide a uniform interface for the input and output of date_periods, time_periods, and in a future release, local_date_time_periods. The user has control over the delimiters, formats of the date/time components, and the form the period takes. The format of the date/time components is controlled via the date_time input and output facets.
    
-Period Form
    
+Period Form
    Periods are constructed with open ranged parameters. The first value is the starting point, and is included in the period. The end value is not included but immediately follows the last value: [begin/end). However, a period can be streamed as either an open range or a closed range.
    [2003-Jan-01/2003-Dec-31] <-- period holding 365 days
 [2003-Jan-01/2004-Jan-01) <-- period holding 365 days
    
-Delimiters
    
+Delimiters
    There are four delimiters. The default values are
    
 
 
 
 
 
 
 
 
 
 
 
 
    
@@ -1238,14 +1243,14 @@ ss >> td; // default format
    
 
    "\" - separator
    
 
    
 
    A user can provide a custom set of delimiters. Custom delimiters may contain spaces.
    
 
    
-Customization
    
+Customization
 
    The period form and delimiters can be set as construction parameters or by means of accessor functions. A custom period parser/formatter can then be used as a construction parameter to a new facet, or can be set in an existing facet via an accessor function.
    
 
    
-Period Formatter/Parser Reference
    
+Period Formatter/Parser Reference
   The complete class reference can be found here: Period Formatter Doxygen Reference and here: Period Parser Doxygen Reference
    
     
    
 
    
-Period Formatter Construction
    
+Period Formatter Construction
 
    
     
    
 
    
@@ -1271,7 +1276,7 @@ ss >> td; // default format
    
     
    
-Period Formatter Accessors
    
+Period Formatter Accessors
    
     
    
 
 
 
 
    
@@ -1359,7 +1364,7 @@ pf.delimiter_strings(beg, sep,
 
    
     
    
-Period Parser Construction
    
+Period Parser Construction
    
     
    
 
 
 
    
@@ -1391,7 +1396,7 @@ pf.delimiter_strings(beg, sep,
 
    
     
    
-Period Parser Accessors
    
+Period Parser Accessors
    
     
    
 
 
 
    
@@ -1457,10 +1462,10 @@ pp.delimiter_strings(beg, sep,
   
    _____________________________________________________
    
-Date Generators
    
+Date Generators
    The date_generator formatter and parser provide flexibility by allowing the user to use custom "phrase elements". These phrase elements are the "in-between" words in the date_generators. For example, in the date_generator "Second Monday of March", "Second" and "of" are the phrase elements, where "Monday" and "March" are the date elements. Customization of the date elements is done with the facet. The order of the date and phrase elements cannot be changed. When parsing, all elements of the date_generator phrase must parse correctly or an ios_base::failure exception will be thrown.
    
-Customization
    
+Customization
    The default "phrase_strings" are:
     
    
 
 
 
 
 
 
    
@@ -1485,11 +1490,11 @@ pp.delimiter_strings(beg, sep,
 
    The custom set of phrase elements can be set as construction parameters or through an accessor function.A custom date_generator parser/formatter can then be used as a construction parameter to a new facet, or can be set in an existing facet via an accessor function.
    IMPORTANT NOTE: Prior to 1.33, partial_date was output as "1 Jan" with a single *or* double digit number for the day. The new behavior is to *always* place a double digit number for the day - "01 Jan".
    
-Date Generator Reference
    
+Date Generator Reference
   The complete class references can be found here: Date Generator Formatter Doxygen Reference and here: Date Generator Parser Doxygen Reference
    
     
    
-Date Generator Formatter Construction
    
+Date Generator Formatter Construction
    
     
    
 
 
 
 
 
    
@@ -1525,7 +1530,7 @@ pp.delimiter_strings(beg, sep,
 
    
     
    
-Date Generator Formatter Accessors
    
+Date Generator Formatter Accessors
    
     
    
 
 
 
    
@@ -1643,7 +1648,7 @@ formatter.elements(col, dgf::last);
 
    
     
    
-Date Generator Parser Construction
    
+Date Generator Parser Construction
    
     
    
 
 
 
    
@@ -1685,7 +1690,7 @@ formatter.elements(col, dgf::last);
 
    
     
    
-Date Generator Parser Accessors
    
+Date Generator Parser Accessors
    
     
    
 
 
 
    
@@ -1801,7 +1806,7 @@ formatter.elements(col, dgf::last);
   
    _____________________________________________________
    
-Special Values
    
+Special Values
    The date_time library uses five special_values. They are:
     
    
 
 
 
 
    
@@ -1815,14 +1820,14 @@ formatter.elements(col, dgf::last);
   
    The default set of strings used to represent these types are: "not-a-date-time", "-infinity", "+infinity", "minimum-date-time", "maximum-date-time". When output, the min_date-time and max_date_time appear as normal date/time representations: "1400-Jan-01" and "9999-Dec-31" repectively.
    
-Customization
    
+Customization
    The special values parser/formatter allows the user to set custom strings for these special values. These strings can be set as construction parameters to a new facet, or can be set in an existing facet via an accessor function.
    
-Special Values Formatter/Parser Reference
    
+Special Values Formatter/Parser Reference
   The complete class references can be found here: Special Values Formatter Doxygen Reference and here: Special Values Parser Doxygen Reference
    
     
    
-Special Values Formatter Constructor
    
+Special Values Formatter Constructor
    
     
    
 
 
 
 
 
 
 
    
@@ -1860,7 +1865,7 @@ formatter.elements(col, dgf::last);
 
    
     
    
-Special Values Formatter Accessors
    
+Special Values Formatter Accessors
    
     
    
 
 
 
    
@@ -1897,7 +1902,7 @@ formatter.put_special(itr, d2);
 
    
     
    
-Special Values Parser Constructor
    
+Special Values Parser Constructor
    
     
    
 
 
 
    
@@ -1944,7 +1949,7 @@ formatter.put_special(itr, d2);
 
    
     
    
-Special Values Parser Accessors
    
+Special Values Parser Accessors
    
     
    
 
 
 
    
@@ -1996,14 +2001,14 @@ if(parser.match(itr, str_end, mr)) {
   
    _____________________________________________________
    
-Format Date Parser
    
+Format Date Parser
    The format date parser is the object that holds the strings for months and weekday names, as well as their abbreviations. Custom sets of strings can be set at construction time, or, the strings in an existing format_date_parser can be replaced through accessor functions. Both the constructor and the accessor functions take a vector of strings as their arguments.
    
-Format Date Parser Reference
    
+Format Date Parser Reference
   The complete class reference can be found here: Doxygen Reference
    
     
    
-Format Date Parser Constructor
    
+Format Date Parser Constructor
    
     
    
 
 
 
 
 
 
 
    
@@ -2046,7 +2051,7 @@ if(parser.match(itr, str_end, mr)) {
 
    
     
    
-Format Date Parser Accessors
    
+Format Date Parser Accessors
    
     
    
 
 
 
    
@@ -2219,17 +2224,17 @@ y = parser.parse_year(itr,
 
    
 Date Time IO Tutorial
    
-Date Time IO Tutorial
    
+Date Time IO TutorialBasic Use |
   Format Strings |
   Content Strings |
   Special Values |
   Date/Time Periods |
   Date Generators
    
-Basic Use
    
+Basic Use
    Facets are automatically imbued when operators '>>' and '<<' are called. The list of date_time objects that can be streamed are:
    
-Gregorian
    
+Gregorian
    
     date, 
     days, 
@@ -2245,14 +2250,14 @@ y = parser.parse_year(itr,
     first_day_of_the_week_before
   
    
-Posix_time
    
+Posix_time
    
     ptime, 
     time_period, 
     time_duration
   
    
-Local_time
    
+Local_time
    
     local_date_time
   
    
@@ -2278,7 +2283,7 @@ y = parser.parse_year(itr,
   
    This example used the default settings for the input and output facets. The default formats are such that interoperability like that shown in the example is possible. NOTE: Input streaming of local_date_time can only be done with a posix time zone string. The default output format uses a time zone abbreviation. The format can be changed so out and in match (as we will see later in this tutorial).
    
-Format Strings
    
+Format Strings
    The format strings control the order, type, and style of the date/time elements used. The facets provide some predefined formats (iso_format_specifier, iso_format_extended_specifier, and default_date_format) but the user can easily create their own.
    
   (continued from previous example)
   
    @@ -2325,11 +2330,11 @@ y = parser.parse_year(itr,
     
   
    
-Content Strings
    
+Content Strings
    So far we've shown how a user can achieve a great deal of customization with very little effort by using formats. Further customization can be achieved through user defined elements (ie strings). The elements that can be customized are: Special value names, month names, month abbreviations, weekday names, weekday abbreviations, delimiters of the date/time periods, and the phrase elements of the date_generators.
    The default values for these are as follows:
    
-Special values
    
+Special values
    
     not-a-date-time, 
     -infinity, 
@@ -2338,17 +2343,17 @@ y = parser.parse_year(itr,
     maximum-date-time
   
    
-Months
    
+Months
    
     English calendar and three letter abbreviations
   
    
-Weekdays
    
+Weekdays
    
     English calendar and three letter abbreviations
   
    
-Date generator phrase elements
    
+Date generator phrase elements
    
     first, 
     second, 
@@ -2362,7 +2367,7 @@ y = parser.parse_year(itr,
   
    NOTE: We've shown earlier that the components of a date/time representation can be re-ordered via the format string. This is not the case with date_generators. The elements themselves can be customized but their order cannot be changed.
    
-Content Strings
    
+Content Strings
    To illustrate the customization possibilities we will use custom strings for months and weekdays (we will only use long names, is all lowercase, for this example).
    
   (continued from previous example)
   
    @@ -2412,7 +2417,7 @@ y = parser.parse_year(itr,
     
   
    
-Special Values
    
+Special Values
    Customizing the input and output of special values is best done by creating a new special_values_parser and special_values_formatter. The new strings can be set at construction time (as in the example below).
    
   (continued from previous example)
   
    @@ -2444,7 +2449,7 @@ y = parser.parse_year(itr,
   
    NOTE: even though we sent in strings for min and max to the formatter, they are ignored because those special values construct to actual dates (as shown above).
    
-Date/Time Periods
    
+Date/Time Periods
    Customizing the input and output of periods is best done by creating a new period_parser and period_formatter. The new strings can be set at construction time (as in the example below).
    
   (continued from previous example)
   
    @@ -2476,7 +2481,7 @@ y = parser.parse_year(itr,
     
   
    
-Date Generators
    
+Date Generators
    Customizing the input and output of date_generators is done by replacing the existing strings (in the facet) with new strings.
    NOTE: We've shown earlier that the components of a date/time representation can be re-ordered via the format string. This is not the case with date_generators. The elements themselves can be customized but their order cannot be changed.
    
   (continued from previous example)
diff --git a/doc/html/date_time/details.html b/doc/html/date_time/details.html
index 817fb80de2..b8ced19ea8 100644
--- a/doc/html/date_time/details.html
+++ b/doc/html/date_time/details.html
@@ -6,7 +6,7 @@
 
-
+
@@ -47,7 +47,7 @@
     Special Value Handling
    
-Timepoints
    
+Timepoints
    
     This section describes some of basic arithmetic rules that can be performed with timepoints. In general, Timepoints support basic arithmetic in conjunction with Durations as follows:
     
    
@@ -67,7 +67,7 @@
 
    
   
    
-Durations
    
+Durations
    
     Durations represent a length of time and can have positive and negative values. It is frequently useful to be able to perform calculations with other durations and with simple integral values. The following describes these calculations:
     
    
@@ -82,7 +82,7 @@
 
    
   
    
-Intervals (Periods)
    
+Intervals (Periods)
    
     Interval logic is extremely useful for simplifying many 'calculations' for dates and times. The following describes the operations provided by periods which are based on half-open range. The following operations calculate new time periods based on two input time periods: 
     
    
@@ -115,7 +115,7 @@ Timeperiod shift Duration          --> Timeperiod
 
    
   
    
-Special Value Handling
    
+Special Value Handling
    
     For many temporal problems it is useful for Duration and Timepoint types to support special values such as Not A Date Time (NADT) and infinity. In general special values such as Not A Date Time (NADT) and infinity should follow rules like floating point values. Note that it should be possible to configure NADT based systems to throw an exception instead of result in NADT. 
     
    
@@ -241,7 +241,7 @@ Timeperiod shift Duration          --> Timeperiod
 
    
 Tradeoffs: Stability, Predictability, and Approximations
    
-
+
     Unavoidable Trade-offs
   
    
@@ -265,14 +265,14 @@ Timeperiod shift Duration          --> Timeperiod
     If you want accurate calculations with future times, you will have to use TAI or an equivalent, but the mapping from TAI to UTC or local time depends on leap seconds, so you will not have exact agreement with wall-clock time. 
   
    
-
+
     Stability, Predictability, and Approximations
   
    
     Here is some underlying theory that helps to explain what's going on. Remember that a temporal type, like any abstract data type (ADT), is a set of values together with operations on those values. 
   
    
-
+
     Stability
   
    
@@ -282,7 +282,7 @@ Timeperiod shift Duration          --> Timeperiod
     An operation on a type is stable if the result of applying the operation to a particular operand(s) does not change over time. 
   
    
-
+
     Predictability
   
    
@@ -321,7 +321,7 @@ Timeperiod shift Duration          --> Timeperiod
     Ill-formed sets are not of much practical use, so we will not discuss them further. In plain english the above simply says that all the values of a predictable type are known ahead of time, but some values of an unpredictable type are not known until some particular time. 
   
    
-
+
     Stability of Operations
   
    
@@ -352,7 +352,7 @@ Timeperiod shift Duration          --> Timeperiod
     We can refine this a little by saying that a range within an unpredicatable type can be predictable, and operations performed entirely on values within that range will be stable. For example, the range of UTC timepoints from 1970-01-01 through the present is predictable, so calculations of durations within that range will be stable. 
   
    
-
+
     Approximations
   
    
@@ -445,7 +445,7 @@ Timeperiod shift Duration          --> Timeperiod
 
    
   
    
-Date Calendar References
    
+Date Calendar References
    
     
      
@@ -464,7 +464,7 @@ Timeperiod shift Duration          --> Timeperiod
 
      
   
      
 
      
-Time
      
+Time
 
      
     
      
 
        
@@ -488,7 +488,7 @@ Timeperiod shift Duration          --> Timeperiod
 
        
   
        
 
        
-Other C/C++ Libraries
        
+Other C/C++ Libraries
 
        
     
        
 
          
@@ -515,7 +515,7 @@ Timeperiod shift Duration          --> Timeperiod
 
          
   
          
 
          
-JAVA Date & Time Library Quick Reference
          
+JAVA Date & Time Library Quick Reference
 
          
     
          
 
            
@@ -531,7 +531,7 @@ Timeperiod shift Duration          --> Timeperiod
 
            
   
            
 
            
-Scripting Language Libraries
            
+Scripting Language Libraries
 
            
     
            
 
              
@@ -550,7 +550,7 @@ Timeperiod shift Duration          --> Timeperiod
 
              
   
              
 
              
-Related Commercial and Fanciful Pages
              
+Related Commercial and Fanciful Pages
 
              
     
              
 
                
@@ -566,7 +566,7 @@ Timeperiod shift Duration          --> Timeperiod
 
                
   
                
 
                
-Resolution, Precision, and Accuracy
                
+Resolution, Precision, and Accuracy
 
                
     
                
 
                  
@@ -589,12 +589,12 @@ Timeperiod shift Duration          --> Timeperiod
     Required Boost Libraries
   
                  
 
                  
-Overview
                  
+Overview
 
                  
     The library has a few functions that require the creation of a library file (mostly to_string, from_string functions).  Most library users can make effective use of the library WITHOUT building the library, but simply including the required headers. If the library is needed, the Jamfile in the build directory will produce a "static" library (libboost_date_time) and a "dynamic/shared" library (boost_date_time) that contains these functions. Note that to use the library without the library (particularly on windows) may require using the BOOST_DATE_TIME_NO_LIB flag to the compilation options.
   
                  
 
                  
-Compilation Options
                  
+Compilation Options
 
                  
     By default the posix_time system uses a single 64 bit integer internally to provide a microsecond level resolution. As an alternative, a combination of a 64 bit integer and a 32 bit integer (96 bit resolution) can be used to provide nano-second level resolutions. The default implementation may provide better performance and more compact memory usage for many applications that do not require nano-second resolutions. 
   
                  
@@ -605,7 +605,7 @@ Timeperiod shift Duration          --> Timeperiod
 
                  As a convenience, date_time has provided some additional duration types. Use of these types may have unexpected results due to the snap-to-end-of-month behavior (see Reversibility of Operations Pitfall for complete details and examples). These types are enabled by default. To disable these types, simply undefine BOOST_DATE_TIME_OPTIONAL_GREGORIAN_TYPES in your project file.
                  
 
                  Another convenience is the default constructors for date, and ptime. These constructors are enabled by default. To disable them, simply define DATE_TIME_NO_DEFAULT_CONSTRUCTOR in your project file.
                  
 
                  
-Compiler/Portability Notes
                  
+Compiler/Portability Notes
 
                  
     The Boost Date-Time library has been built and tested with many compilers and platforms. However, some compilers and standard libraries have issues. While some of these issues can be worked around, others are difficult to work around. The following compilers are known to fully support all aspects of the library:
     
                  
@@ -666,7 +666,7 @@ Timeperiod shift Duration          --> Timeperiod
 
                  
   
                  
 
                  
-Visual Studio & STLPort
                  
+Visual Studio & STLPort
 
                  There is a known issue with Visual Studio (7.0 & 7.1) and STLPort. The build errors typically make reference to a type issue or 'no acceptable conversion' and are attempting to instantiate a template with wchar_t. The default build of STLPort does not support wchar_t. There are two possible workarounds for this issue. The simplest is the user can build date_time with no wide stream/string etc. The other is to rebuild STLPort with wchar_t support.
   
                  
 
                  To build date_time with no wide stream/string etc, execute the following command from $BOOST_ROOT:
@@ -686,7 +686,7 @@ Timeperiod shift Duration          --> Timeperiod
     (replace the ellipsis with the correct paths for the build system and adjust the TOOLS to the proper toolset if necessary)
   
                  
 
                  
-Directory Structure
                  
+Directory Structure
 
                  
     The directory tree has the following structure:
     
                  
@@ -707,7 +707,7 @@ Timeperiod shift Duration          --> Timeperiod
 
                  
   
                  
 
                  
-Required Boost Libraries
                  
+Required Boost Libraries
 
                  
     Various parts of date-time depend on other boost libraries.  These include:
     
                  
@@ -744,7 +744,7 @@ Timeperiod shift Duration          --> Timeperiod
 
                  
 Change History
                  
 
                  
-Changes from Boost 1.41 to 1.44 (date_time 1.08 to 1.09)
                  
+Changes from Boost 1.41 to 1.44 (date_time 1.08 to 1.09)
 
    
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
   
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
    @@ -764,7 +764,7 @@ Timeperiod shift Duration          --> Timeperiod
 
    
 
 

 
    
 
    
-Changes from Boost 1.40 to 1.41 (date_time 1.07 to 1.08)
    
+Changes from Boost 1.40 to 1.41 (date_time 1.07 to 1.08)
 
    @@ -796,7 +796,7 @@ Timeperiod shift Duration          --> Timeperiod
 
    
 
 

 
    
 
    
-Changes from Boost 1.38 to 1.40 (date_time 1.06 to 1.07)
    
+Changes from Boost 1.38 to 1.40 (date_time 1.06 to 1.07)
 
    @@ -817,7 +817,7 @@ Timeperiod shift Duration          --> Timeperiod
 
    
 
 

 
    
 
    
-Changes from Boost 1.34 to 1.38 (date_time 1.05 to 1.06)
    
+Changes from Boost 1.34 to 1.38 (date_time 1.05 to 1.06)
 
    @@ -931,7 +931,7 @@ Timeperiod shift Duration          --> Timeperiod
 
    
 
 

 
    
 
    
-Changes from Boost 1.33 to 1.34 (date_time 1.04 to 1.05)
    
+Changes from Boost 1.33 to 1.34 (date_time 1.04 to 1.05)
 
    @@ -1019,7 +1019,7 @@ Timeperiod shift Duration          --> Timeperiod
 
    
 
 

 
    
 
    
-Changes from Boost 1.32 to 1.33 (date_time 1.03 to 1.04)
    
+Changes from Boost 1.32 to 1.33 (date_time 1.03 to 1.04)
 
    @@ -1159,7 +1159,7 @@ void save_to(archive_type& ar,
 
    
 
 

 
    
 
    
-Changes from Boost 1.31 to 1.32 (date_time 1.02 to 1.03)
    
+Changes from Boost 1.31 to 1.32 (date_time 1.02 to 1.03)
 
    @@ -1354,7 +1354,7 @@ ws >> d; //Feb 29th, 2000
    
 
 

 
 
    
 
    
-Changes from Boost 1.30 to 1.31 (date_time 1.01 to 1.02)
    
+Changes from Boost 1.30 to 1.31 (date_time 1.01 to 1.02)
 
    @@ -1443,7 +1443,7 @@ td = -td; //-5 hours
    
 
 

 
 
    
 
    
-Changes from Boost 1.29 to 1.30 (date_time 1.00 to 1.01)
    
+Changes from Boost 1.29 to 1.30 (date_time 1.00 to 1.01)
 
    
     Notice: The interface to the partial_date class (see date_algorithms) was changed. The order of construction parameters was changed which will cause some code to fail execution. This change was made to facilitate more generic local time adjustment code. Thus instead of specifying partial_date pd(Dec,25) the code needs to be changed to partial_date pd(25, Dec);
   
    
diff --git a/doc/html/date_time/doxy.html b/doc/html/date_time/doxy.html
index c95fee5d28..6b6e53529e 100644
--- a/doc/html/date_time/doxy.html
+++ b/doc/html/date_time/doxy.html
@@ -6,7 +6,7 @@
 
 
 
-
+
 
 
 
@@ -227,7 +227,7 @@
   namespace date_time {
     template<typename charT> class simple_format;
 
-    template<> class simple_format<wchar_t>;
+    template<> class simple_format<wchar_t>;
   }
 }
 
@@ -358,15 +358,15 @@
     template<typename date_type> 
       date_type parse_undelimited_date(const std::string & s);
     template<typename date_type, typename iterator_type> 
-      date_type from_stream_type(iterator_type &, iterator_type const &, char);
+      date_type from_stream_type(iterator_type &, iterator_type const &, char);
     template<typename date_type, typename iterator_type> 
-      date_type from_stream_type(iterator_type &, iterator_type const &, 
+      date_type from_stream_type(iterator_type &, iterator_type const &, 
                                  std::string const &);
     template<typename date_type, typename iterator_type> 
-      date_type from_stream_type(iterator_type &, iterator_type const &, 
+      date_type from_stream_type(iterator_type &, iterator_type const &, 
                                  wchar_t);
     template<typename date_type, typename iterator_type> 
-      date_type from_stream_type(iterator_type &, iterator_type const &, 
+      date_type from_stream_type(iterator_type &, iterator_type const &, 
                                  std::wstring const &);
 
     // function called by wrapper functions: date_period_from_(w)string() 
@@ -428,12 +428,12 @@
   namespace date_time {
     template<typename date_type, typename charT> class format_date_parser;
     template<typename int_type, typename charT> 
-      int_type fixed_string_to_int(std::istreambuf_iterator< charT > &, 
+      int_type fixed_string_to_int(std::istreambuf_iterator< charT > &, 
                                    std::istreambuf_iterator< charT > &, 
                                    parse_match_result< charT > &, 
                                    unsigned int, const charT &);
     template<typename int_type, typename charT> 
-      int_type fixed_string_to_int(std::istreambuf_iterator< charT > &, 
+      int_type fixed_string_to_int(std::istreambuf_iterator< charT > &, 
                                    std::istreambuf_iterator< charT > &, 
                                    parse_match_result< charT > &, 
                                    unsigned int);
@@ -462,7 +462,7 @@
     template<typename int_type_> class int_adapter;
     template<typename charT, typename traits, typename int_type> 
       std::basic_ostream< charT, traits > & 
-      operator<<(std::basic_ostream< charT, traits > &, 
+      operator<<(std::basic_ostream< charT, traits > &, 
                  const int_adapter< int_type > &);
   }
 }
@@ -474,7 +474,7 @@
   namespace date_time {
     template<typename charT> class iso_format_base;
 
-    template<> class iso_format_base<wchar_t>;
+    template<> class iso_format_base<wchar_t>;
 
     template<typename charT> class iso_format;
     template<typename charT> class iso_extended_format;
@@ -491,7 +491,7 @@
              unsigned short minutes = 0> 
       class utc_adjustment;
     template<typename time_type, typename dst_rules> 
-      class dynamic_local_time_adjustor;
+      class dynamic_local_time_adjustor;
     template<typename time_type, typename dst_rules, 
              typename utc_offset_rules> 
       class static_local_time_adjustor;
@@ -618,7 +618,7 @@
     template<typename charT> struct string_parse_tree;
     template<typename charT> 
       std::basic_ostream< charT > & 
-      operator<<(std::basic_ostream< charT > & os, 
+      operator<<(std::basic_ostream< charT > & os, 
                  parse_match_result< charT > & mr);
   }
 }
@@ -707,11 +707,11 @@
 
    namespace boost {
   namespace date_time {
     template<typename time_duration_type, typename charT = char> 
-      class ostream_time_duration_formatter;
+      class ostream_time_duration_formatter;
     template<typename time_type, typename charT = char> 
       class ostream_time_formatter;
     template<typename time_period_type, typename charT = char> 
-      class ostream_time_period_formatter;
+      class ostream_time_period_formatter;
   }
 }
    
 
@@ -735,9 +735,9 @@
       int_type power(int_type base, int_type exponent);
     template<typename time_duration, typename char_type> 
       time_duration 
-      str_from_delimited_time_duration(const std::basic_string< char_type > &);
+      str_from_delimited_time_duration(const std::basic_string< char_type > &);
     template<typename time_duration> 
-      time_duration parse_delimited_time_duration(const std::string &);
+      time_duration parse_delimited_time_duration(const std::string &);
 
     // Utility function to split appart string. 
     bool split(const std::string & s, char sep, std::string & first, 
@@ -747,7 +747,7 @@
 
     // Parse time duration part of an iso time of form: [-]hhmmss.fff...
     template<typename time_duration> 
-      time_duration parse_undelimited_time_duration(const std::string & s);
+      time_duration parse_undelimited_time_duration(const std::string & s);
 
     // Parse time string of form YYYYMMDDThhmmss where T is delimeter between date and time. 
     template<typename time_type> 
@@ -760,21 +760,21 @@
 Header <boost/date_time/time_resolution_traits.hpp>
 
    namespace boost {
   namespace date_time {
-    struct time_resolution_traits_bi32_impl;
-    struct time_resolution_traits_adapted32_impl;
-    struct time_resolution_traits_bi64_impl;
-    struct time_resolution_traits_adapted64_impl;
+    struct time_resolution_traits_bi32_impl;
+    struct time_resolution_traits_adapted32_impl;
+    struct time_resolution_traits_bi64_impl;
+    struct time_resolution_traits_adapted64_impl;
 
     template<typename frac_sec_type, time_resolutions res, 
              #if(defined(BOOST_MSVC)&&(_MSC_VER< 1300)) boost::int64_t resolution_adjust, 
              #else typename frac_sec_type::int_type resolution_adjust, 
              #endif unsigned short frac_digits, 
-             typename var_type = std::time_t> 
+             typename var_type = boost::int64_t> 
       class time_resolution_traits;
 
-    typedef time_resolution_traits< time_resolution_traits_adapted32_impl, milli, 1000, 3 > milli_res;
-    typedef time_resolution_traits< time_resolution_traits_adapted64_impl, micro, 1000000, 6 > micro_res;
-    typedef time_resolution_traits< time_resolution_traits_adapted64_impl, nano, 1000000000, 9 > nano_res;
+    typedef time_resolution_traits< time_resolution_traits_adapted32_impl, milli, 1000, 3 > milli_res;
+    typedef time_resolution_traits< time_resolution_traits_adapted64_impl, micro, 1000000, 6 > micro_res;
+    typedef time_resolution_traits< time_resolution_traits_adapted64_impl, nano, 1000000000, 9 > nano_res;
 
     // Simple function to calculate absolute value of a numeric type. 
     template<typename T> T absolute_value(T x);
@@ -900,32 +900,32 @@
 
    namespace boost {
   namespace gregorian {
     template<typename charT> 
-      std::basic_string< charT > to_simple_string_type(const date & d);
+      std::basic_string< charT > to_simple_string_type(const date & d);
     template<typename charT> 
-      std::basic_string< charT > to_simple_string_type(const date_period & d);
+      std::basic_string< charT > to_simple_string_type(const date_period & d);
     template<typename charT> 
-      std::basic_string< charT > to_iso_string_type(const date_period & d);
+      std::basic_string< charT > to_iso_string_type(const date_period & d);
     template<typename charT> 
-      std::basic_string< charT > to_iso_extended_string_type(const date & d);
+      std::basic_string< charT > to_iso_extended_string_type(const date & d);
     template<typename charT> 
-      std::basic_string< charT > to_iso_string_type(const date & d);
+      std::basic_string< charT > to_iso_string_type(const date & d);
     template<typename charT> 
       std::basic_string< charT > to_sql_string_type(const date & d);
 
     // Convert date period to simple string. Example: [2002-Jan-01/2002-Jan-02]. 
-    std::wstring to_simple_wstring(const date_period & d);
+    std::wstring to_simple_wstring(const date_period & d);
 
     // To YYYY-mmm-DD string where mmm 3 char month name. Example: 2002-Jan-01. 
-    std::wstring to_simple_wstring(const date & d);
+    std::wstring to_simple_wstring(const date & d);
 
     // Date period to iso standard format CCYYMMDD/CCYYMMDD. Example: 20021225/20021231. 
-    std::wstring to_iso_wstring(const date_period & d);
+    std::wstring to_iso_wstring(const date_period & d);
 
     // Convert to iso extended format string CCYY-MM-DD. Example 2002-12-31. 
     std::wstring to_iso_extended_wstring(const date & d);
 
     // Convert to iso standard string YYYYMMDD. Example: 20021231. 
-    std::wstring to_iso_wstring(const date & d);
+    std::wstring to_iso_wstring(const date & d);
     std::wstring to_sql_wstring(const date & d);
   }
 }
    
@@ -937,19 +937,19 @@
   namespace gregorian {
 
     // To YYYY-mmm-DD string where mmm 3 char month name. Example: 2002-Jan-01. 
-    std::string to_simple_string(const date & d);
+    std::string to_simple_string(const date & d);
 
     // Convert date period to simple string. Example: [2002-Jan-01/2002-Jan-02]. 
-    std::string to_simple_string(const date_period & d);
+    std::string to_simple_string(const date_period & d);
 
     // Date period to iso standard format CCYYMMDD/CCYYMMDD. Example: 20021225/20021231. 
-    std::string to_iso_string(const date_period & d);
+    std::string to_iso_string(const date_period & d);
 
     // Convert to iso extended format string CCYY-MM-DD. Example 2002-12-31. 
     std::string to_iso_extended_string(const date & d);
 
     // Convert to iso standard string YYYYMMDD. Example: 20021231. 
-    std::string to_iso_string(const date & d);
+    std::string to_iso_string(const date & d);
     std::string to_sql_string(const date & d);
   }
 }
    
@@ -1037,97 +1037,97 @@
     typedef boost::date_time::date_names_put< greg_facet_config > greg_base_facet;  // Create the base facet type for gregorian::date. 
     template<typename charT, typename traits> 
       std::basic_ostream< charT, traits > & 
-      operator<<(std::basic_ostream< charT, traits > &, const date &);
+      operator<<(std::basic_ostream< charT, traits > &, const date &);
     template<typename charT, typename traits> 
       std::basic_ostream< charT, traits > & 
-      operator<<(std::basic_ostream< charT, traits > &, const greg_month &);
+      operator<<(std::basic_ostream< charT, traits > &, const greg_month &);
     template<typename charT, typename traits> 
       std::basic_ostream< charT, traits > & 
-      operator<<(std::basic_ostream< charT, traits > &, const greg_weekday &);
+      operator<<(std::basic_ostream< charT, traits > &, const greg_weekday &);
     template<typename charT, typename traits> 
       std::basic_ostream< charT, traits > & 
-      operator<<(std::basic_ostream< charT, traits > &, const date_period &);
+      operator<<(std::basic_ostream< charT, traits > &, const date_period &);
     template<typename charT, typename traits> 
       std::basic_ostream< charT, traits > & 
-      operator<<(std::basic_ostream< charT, traits > & os, 
+      operator<<(std::basic_ostream< charT, traits > & os, 
                  const date_duration & dd);
 
     // operator<< for gregorian::partial_date. Output: "Jan 1" 
     template<typename charT, typename traits> 
       std::basic_ostream< charT, traits > & 
-      operator<<(std::basic_ostream< charT, traits > & os, 
+      operator<<(std::basic_ostream< charT, traits > & os, 
                  const partial_date & pd);
 
     // operator<< for gregorian::nth_kday_of_month. Output: "first Mon of Jun" 
     template<typename charT, typename traits> 
       std::basic_ostream< charT, traits > & 
-      operator<<(std::basic_ostream< charT, traits > & os, 
+      operator<<(std::basic_ostream< charT, traits > & os, 
                  const nth_kday_of_month & nkd);
 
     // operator<< for gregorian::first_kday_of_month. Output: "first Mon of Jun" 
     template<typename charT, typename traits> 
       std::basic_ostream< charT, traits > & 
-      operator<<(std::basic_ostream< charT, traits > & os, 
+      operator<<(std::basic_ostream< charT, traits > & os, 
                  const first_kday_of_month & fkd);
 
     // operator<< for gregorian::last_kday_of_month. Output: "last Mon of Jun" 
     template<typename charT, typename traits> 
       std::basic_ostream< charT, traits > & 
-      operator<<(std::basic_ostream< charT, traits > & os, 
+      operator<<(std::basic_ostream< charT, traits > & os, 
                  const last_kday_of_month & lkd);
 
     // operator<< for gregorian::first_kday_after. Output: "first Mon after" 
     template<typename charT, typename traits> 
       std::basic_ostream< charT, traits > & 
-      operator<<(std::basic_ostream< charT, traits > & os, 
+      operator<<(std::basic_ostream< charT, traits > & os, 
                  const first_kday_after & fka);
 
     // operator<< for gregorian::first_kday_before. Output: "first Mon before" 
     template<typename charT, typename traits> 
       std::basic_ostream< charT, traits > & 
-      operator<<(std::basic_ostream< charT, traits > & os, 
+      operator<<(std::basic_ostream< charT, traits > & os, 
                  const first_kday_before & fkb);
 
     // operator>> for gregorian::date
     template<typename charT> 
       std::basic_istream< charT > & 
-      operator>>(std::basic_istream< charT > & is, date & d);
+      operator>>(std::basic_istream< charT > & is, date & d);
 
     // operator>> for gregorian::date_duration
     template<typename charT> 
       std::basic_istream< charT > & 
-      operator>>(std::basic_istream< charT > & is, date_duration & dd);
+      operator>>(std::basic_istream< charT > & is, date_duration & dd);
 
     // operator>> for gregorian::date_period 
     template<typename charT> 
       std::basic_istream< charT > & 
-      operator>>(std::basic_istream< charT > & is, date_period & dp);
+      operator>>(std::basic_istream< charT > & is, date_period & dp);
 
     // generates a locale with the set of gregorian name-strings of type char* 
     BOOST_DATE_TIME_DECL std::locale 
-    generate_locale(std::locale & loc, char type);
+    generate_locale(std::locale & loc, char type);
 
     // Returns a pointer to a facet with a default set of names (English) 
     BOOST_DATE_TIME_DECL boost::date_time::all_date_names_put< greg_facet_config, char > * 
-    create_facet_def(char type);
+    create_facet_def(char type);
 
     // generates a locale with the set of gregorian name-strings of type wchar_t* 
     BOOST_DATE_TIME_DECL std::locale 
-    generate_locale(std::locale & loc, wchar_t type);
+    generate_locale(std::locale & loc, wchar_t type);
 
     // Returns a pointer to a facet with a default set of names (English) 
     BOOST_DATE_TIME_DECL boost::date_time::all_date_names_put< greg_facet_config, wchar_t > * 
-    create_facet_def(wchar_t type);
+    create_facet_def(wchar_t type);
 
     // operator>> for gregorian::greg_month - throws exception if invalid month given 
     template<typename charT> 
       std::basic_istream< charT > & 
-      operator>>(std::basic_istream< charT > & is, greg_month & m);
+      operator>>(std::basic_istream< charT > & is, greg_month & m);
 
     // operator>> for gregorian::greg_weekday - throws exception if invalid weekday given 
     template<typename charT> 
       std::basic_istream< charT > & 
-      operator>>(std::basic_istream< charT > & is, greg_weekday & wd);
+      operator>>(std::basic_istream< charT > & is, greg_weekday & wd);
   }
 }
 
@@ -1153,167 +1153,167 @@
   template<typename Archive> 
     void serialize(Archive &, ::boost::gregorian::date &, const unsigned int);
   template<typename Archive> 
-    void save(Archive &, const ::boost::gregorian::date &, unsigned);
+    void save(Archive &, const ::boost::gregorian::date &, unsigned);
   template<typename Archive> 
-    void load(Archive &, ::boost::gregorian::date &, unsigned);
+    void load(Archive &, ::boost::gregorian::date &, unsigned);
 
   // override needed b/c no default constructor 
   template<typename Archive> 
-    void load_construct_data(Archive &, ::boost::gregorian::date * dp, 
+    void load_construct_data(Archive &, ::boost::gregorian::date * dp, 
                              const unsigned int);
 
   // Function to save gregorian::date_duration objects using serialization lib. 
   template<typename Archive> 
-    void save(Archive & ar, const gregorian::date_duration & dd, unsigned int);
+    void save(Archive & ar, const gregorian::date_duration & dd, unsigned int);
 
   // Function to load gregorian::date_duration objects using serialization lib. 
   template<typename Archive> 
-    void load(Archive & ar, gregorian::date_duration & dd, unsigned int);
+    void load(Archive & ar, gregorian::date_duration & dd, unsigned int);
 
   // override needed b/c no default constructor 
   template<typename Archive> 
-    void load_construct_data(Archive &, gregorian::date_duration * dd, 
+    void load_construct_data(Archive &, gregorian::date_duration * dd, 
                              const unsigned int);
 
   // helper unction to save date_duration objects using serialization lib 
   template<typename Archive> 
-    void save(Archive & ar, const gregorian::date_duration::duration_rep & dr, 
+    void save(Archive & ar, const gregorian::date_duration::duration_rep & dr, 
               unsigned int);
 
   // helper function to load date_duration objects using serialization lib 
   template<typename Archive> 
-    void load(Archive & ar, gregorian::date_duration::duration_rep & dr, 
+    void load(Archive & ar, gregorian::date_duration::duration_rep & dr, 
               unsigned int);
 
   // override needed b/c no default constructor 
   template<typename Archive> 
-    void load_construct_data(Archive &, 
+    void load_construct_data(Archive &, 
                              gregorian::date_duration::duration_rep * dr, 
                              const unsigned int);
   template<typename Archive> 
-    void save(Archive &, const gregorian::date_period &, unsigned);
+    void save(Archive &, const gregorian::date_period &, unsigned);
   template<typename Archive> 
-    void load(Archive &, gregorian::date_period &, unsigned);
+    void load(Archive &, gregorian::date_period &, unsigned);
 
   // override needed b/c no default constructor 
   template<typename Archive> 
-    void load_construct_data(Archive &, gregorian::date_period * dp, 
+    void load_construct_data(Archive &, gregorian::date_period * dp, 
                              const unsigned int);
 
   // Function to save gregorian::greg_year objects using serialization lib. 
   template<typename Archive> 
-    void save(Archive & ar, const gregorian::greg_year & gy, unsigned int);
+    void save(Archive & ar, const gregorian::greg_year & gy, unsigned int);
 
   // Function to load gregorian::greg_year objects using serialization lib. 
   template<typename Archive> 
-    void load(Archive & ar, gregorian::greg_year & gy, unsigned int);
+    void load(Archive & ar, gregorian::greg_year & gy, unsigned int);
 
   // override needed b/c no default constructor 
   template<typename Archive> 
-    void load_construct_data(Archive &, gregorian::greg_year * gy, 
+    void load_construct_data(Archive &, gregorian::greg_year * gy, 
                              const unsigned int);
 
   // Function to save gregorian::greg_month objects using serialization lib. 
   template<typename Archive> 
-    void save(Archive & ar, const gregorian::greg_month & gm, unsigned int);
+    void save(Archive & ar, const gregorian::greg_month & gm, unsigned int);
 
   // Function to load gregorian::greg_month objects using serialization lib. 
   template<typename Archive> 
-    void load(Archive & ar, gregorian::greg_month & gm, unsigned int);
+    void load(Archive & ar, gregorian::greg_month & gm, unsigned int);
 
   // override needed b/c no default constructor 
   template<typename Archive> 
-    void load_construct_data(Archive &, gregorian::greg_month * gm, 
+    void load_construct_data(Archive &, gregorian::greg_month * gm, 
                              const unsigned int);
 
   // Function to save gregorian::greg_day objects using serialization lib. 
   template<typename Archive> 
-    void save(Archive & ar, const gregorian::greg_day & gd, unsigned int);
+    void save(Archive & ar, const gregorian::greg_day & gd, unsigned int);
 
   // Function to load gregorian::greg_day objects using serialization lib. 
   template<typename Archive> 
-    void load(Archive & ar, gregorian::greg_day & gd, unsigned int);
+    void load(Archive & ar, gregorian::greg_day & gd, unsigned int);
 
   // override needed b/c no default constructor 
   template<typename Archive> 
-    void load_construct_data(Archive &, gregorian::greg_day * gd, 
+    void load_construct_data(Archive &, gregorian::greg_day * gd, 
                              const unsigned int);
 
   // Function to save gregorian::greg_weekday objects using serialization lib. 
   template<typename Archive> 
-    void save(Archive & ar, const gregorian::greg_weekday & gd, unsigned int);
+    void save(Archive & ar, const gregorian::greg_weekday & gd, unsigned int);
 
   // Function to load gregorian::greg_weekday objects using serialization lib. 
   template<typename Archive> 
-    void load(Archive & ar, gregorian::greg_weekday & gd, unsigned int);
+    void load(Archive & ar, gregorian::greg_weekday & gd, unsigned int);
 
   // override needed b/c no default constructor 
   template<typename Archive> 
-    void load_construct_data(Archive &, gregorian::greg_weekday * gd, 
+    void load_construct_data(Archive &, gregorian::greg_weekday * gd, 
                              const unsigned int);
   template<typename Archive> 
-    void save(Archive &, const gregorian::partial_date &, unsigned);
+    void save(Archive &, const gregorian::partial_date &, unsigned);
   template<typename Archive> 
-    void load(Archive &, gregorian::partial_date &, unsigned);
+    void load(Archive &, gregorian::partial_date &, unsigned);
 
   // override needed b/c no default constructor 
   template<typename Archive> 
-    void load_construct_data(Archive &, gregorian::partial_date * pd, 
+    void load_construct_data(Archive &, gregorian::partial_date * pd, 
                              const unsigned int);
   template<typename Archive> 
-    void save(Archive &, const gregorian::nth_kday_of_month &, unsigned);
+    void save(Archive &, const gregorian::nth_kday_of_month &, unsigned);
   template<typename Archive> 
-    void load(Archive &, gregorian::nth_kday_of_month &, unsigned);
+    void load(Archive &, gregorian::nth_kday_of_month &, unsigned);
 
   // override needed b/c no default constructor 
   template<typename Archive> 
-    void load_construct_data(Archive &, gregorian::nth_kday_of_month * nkd, 
+    void load_construct_data(Archive &, gregorian::nth_kday_of_month * nkd, 
                              const unsigned int);
   template<typename Archive> 
-    void save(Archive &, const gregorian::first_kday_of_month &, unsigned);
+    void save(Archive &, const gregorian::first_kday_of_month &, unsigned);
   template<typename Archive> 
-    void load(Archive &, gregorian::first_kday_of_month &, unsigned);
+    void load(Archive &, gregorian::first_kday_of_month &, unsigned);
 
   // override needed b/c no default constructor 
   template<typename Archive> 
-    void load_construct_data(Archive &, gregorian::first_kday_of_month * fkd, 
+    void load_construct_data(Archive &, gregorian::first_kday_of_month * fkd, 
                              const unsigned int);
   template<typename Archive> 
-    void save(Archive &, const gregorian::last_kday_of_month &, unsigned);
+    void save(Archive &, const gregorian::last_kday_of_month &, unsigned);
   template<typename Archive> 
-    void load(Archive &, gregorian::last_kday_of_month &, unsigned);
+    void load(Archive &, gregorian::last_kday_of_month &, unsigned);
 
   // override needed b/c no default constructor 
   template<typename Archive> 
-    void load_construct_data(Archive &, gregorian::last_kday_of_month * lkd, 
+    void load_construct_data(Archive &, gregorian::last_kday_of_month * lkd, 
                              const unsigned int);
 
   // Function to save first_day_of_the_week_before objects using serialization lib. 
   template<typename Archive> 
-    void save(Archive & ar, const gregorian::first_kday_before & fkdb, 
+    void save(Archive & ar, const gregorian::first_kday_before & fkdb, 
               unsigned int);
 
   // Function to load first_day_of_the_week_before objects using serialization lib. 
   template<typename Archive> 
-    void load(Archive & ar, gregorian::first_kday_before & fkdb, unsigned int);
+    void load(Archive & ar, gregorian::first_kday_before & fkdb, unsigned int);
 
   // override needed b/c no default constructor 
   template<typename Archive> 
-    void load_construct_data(Archive &, gregorian::first_kday_before * fkdb, 
+    void load_construct_data(Archive &, gregorian::first_kday_before * fkdb, 
                              const unsigned int);
 
   // Function to save first_day_of_the_week_after objects using serialization lib. 
   template<typename Archive> 
-    void save(Archive & ar, const gregorian::first_kday_after & fkda, 
+    void save(Archive & ar, const gregorian::first_kday_after & fkda, 
               unsigned int);
 
   // Function to load first_day_of_the_week_after objects using serialization lib. 
   template<typename Archive> 
-    void load(Archive & ar, gregorian::first_kday_after & fkda, unsigned int);
+    void load(Archive & ar, gregorian::first_kday_after & fkda, unsigned int);
 
   // override needed b/c no default constructor 
   template<typename Archive> 
-    void load_construct_data(Archive &, gregorian::first_kday_after * fkda, 
+    void load_construct_data(Archive &, gregorian::first_kday_after * fkda, 
                              const unsigned int);
 }
 
@@ -1340,7 +1340,7 @@
 
     class greg_year;
 
-    typedef CV::simple_exception_policy< unsigned short, 1400, 10000, bad_year > greg_year_policies;  // Policy class that declares error handling gregorian year type. 
+    typedef CV::simple_exception_policy< unsigned short, 1400, 9999, bad_year > greg_year_policies;  // Policy class that declares error handling gregorian year type. 
     typedef CV::constrained_value< greg_year_policies > greg_year_rep;  // Generated representation for gregorian year. 
   }
 }
@@ -1378,117 +1378,117 @@
     typedef boost::date_time::date_input_facet< date, wchar_t > wdate_input_facet;
     template<typename CharT, typename TraitsT> 
       std::basic_ostream< CharT, TraitsT > & 
-      operator<<(std::basic_ostream< CharT, TraitsT > & os, 
+      operator<<(std::basic_ostream< CharT, TraitsT > & os, 
                  const boost::gregorian::date & d);
 
     // input operator for date 
     template<typename CharT, typename Traits> 
       std::basic_istream< CharT, Traits > & 
-      operator>>(std::basic_istream< CharT, Traits > & is, date & d);
+      operator>>(std::basic_istream< CharT, Traits > & is, date & d);
     template<typename CharT, typename TraitsT> 
       std::basic_ostream< CharT, TraitsT > & 
-      operator<<(std::basic_ostream< CharT, TraitsT > & os, 
+      operator<<(std::basic_ostream< CharT, TraitsT > & os, 
                  const boost::gregorian::date_duration & dd);
 
     // input operator for date_duration
     template<typename CharT, typename Traits> 
       std::basic_istream< CharT, Traits > & 
-      operator>>(std::basic_istream< CharT, Traits > & is, date_duration & dd);
+      operator>>(std::basic_istream< CharT, Traits > & is, date_duration & dd);
     template<typename CharT, typename TraitsT> 
       std::basic_ostream< CharT, TraitsT > & 
-      operator<<(std::basic_ostream< CharT, TraitsT > & os, 
+      operator<<(std::basic_ostream< CharT, TraitsT > & os, 
                  const boost::gregorian::date_period & dp);
 
     // input operator for date_period 
     template<typename CharT, typename Traits> 
       std::basic_istream< CharT, Traits > & 
-      operator>>(std::basic_istream< CharT, Traits > & is, date_period & dp);
+      operator>>(std::basic_istream< CharT, Traits > & is, date_period & dp);
     template<typename CharT, typename TraitsT> 
       std::basic_ostream< CharT, TraitsT > & 
-      operator<<(std::basic_ostream< CharT, TraitsT > & os, 
+      operator<<(std::basic_ostream< CharT, TraitsT > & os, 
                  const boost::gregorian::greg_month & gm);
 
     // input operator for greg_month
     template<typename CharT, typename Traits> 
       std::basic_istream< CharT, Traits > & 
-      operator>>(std::basic_istream< CharT, Traits > & is, greg_month & m);
+      operator>>(std::basic_istream< CharT, Traits > & is, greg_month & m);
     template<typename CharT, typename TraitsT> 
       std::basic_ostream< CharT, TraitsT > & 
-      operator<<(std::basic_ostream< CharT, TraitsT > & os, 
+      operator<<(std::basic_ostream< CharT, TraitsT > & os, 
                  const boost::gregorian::greg_weekday & gw);
 
     // input operator for greg_weekday
     template<typename CharT, typename Traits> 
       std::basic_istream< CharT, Traits > & 
-      operator>>(std::basic_istream< CharT, Traits > & is, greg_weekday & wd);
+      operator>>(std::basic_istream< CharT, Traits > & is, greg_weekday & wd);
 
     // input operator for greg_day
     template<typename CharT, typename Traits> 
       std::basic_istream< CharT, Traits > & 
-      operator>>(std::basic_istream< CharT, Traits > & is, greg_day & gd);
+      operator>>(std::basic_istream< CharT, Traits > & is, greg_day & gd);
 
     // input operator for greg_year
     template<typename CharT, typename Traits> 
       std::basic_istream< CharT, Traits > & 
-      operator>>(std::basic_istream< CharT, Traits > & is, greg_year & gy);
+      operator>>(std::basic_istream< CharT, Traits > & is, greg_year & gy);
     template<typename CharT, typename TraitsT> 
       std::basic_ostream< CharT, TraitsT > & 
-      operator<<(std::basic_ostream< CharT, TraitsT > & os, 
+      operator<<(std::basic_ostream< CharT, TraitsT > & os, 
                  const boost::gregorian::partial_date & pd);
 
     // input operator for partial_date 
     template<typename CharT, typename Traits> 
       std::basic_istream< CharT, Traits > & 
-      operator>>(std::basic_istream< CharT, Traits > & is, partial_date & pd);
+      operator>>(std::basic_istream< CharT, Traits > & is, partial_date & pd);
     template<typename CharT, typename TraitsT> 
       std::basic_ostream< CharT, TraitsT > & 
-      operator<<(std::basic_ostream< CharT, TraitsT > & os, 
+      operator<<(std::basic_ostream< CharT, TraitsT > & os, 
                  const boost::gregorian::nth_day_of_the_week_in_month & nkd);
 
     // input operator for nth_day_of_the_week_in_month 
     template<typename CharT, typename Traits> 
       std::basic_istream< CharT, Traits > & 
-      operator>>(std::basic_istream< CharT, Traits > & is, 
+      operator>>(std::basic_istream< CharT, Traits > & is, 
                  nth_day_of_the_week_in_month & nday);
     template<typename CharT, typename TraitsT> 
       std::basic_ostream< CharT, TraitsT > & 
-      operator<<(std::basic_ostream< CharT, TraitsT > & os, 
+      operator<<(std::basic_ostream< CharT, TraitsT > & os, 
                  const boost::gregorian::first_day_of_the_week_in_month & fkd);
 
     // input operator for first_day_of_the_week_in_month 
     template<typename CharT, typename Traits> 
       std::basic_istream< CharT, Traits > & 
-      operator>>(std::basic_istream< CharT, Traits > & is, 
+      operator>>(std::basic_istream< CharT, Traits > & is, 
                  first_day_of_the_week_in_month & fkd);
     template<typename CharT, typename TraitsT> 
       std::basic_ostream< CharT, TraitsT > & 
-      operator<<(std::basic_ostream< CharT, TraitsT > & os, 
+      operator<<(std::basic_ostream< CharT, TraitsT > & os, 
                  const boost::gregorian::last_day_of_the_week_in_month & lkd);
 
     // input operator for last_day_of_the_week_in_month 
     template<typename CharT, typename Traits> 
       std::basic_istream< CharT, Traits > & 
-      operator>>(std::basic_istream< CharT, Traits > & is, 
+      operator>>(std::basic_istream< CharT, Traits > & is, 
                  last_day_of_the_week_in_month & lkd);
     template<typename CharT, typename TraitsT> 
       std::basic_ostream< CharT, TraitsT > & 
-      operator<<(std::basic_ostream< CharT, TraitsT > & os, 
+      operator<<(std::basic_ostream< CharT, TraitsT > & os, 
                  const boost::gregorian::first_day_of_the_week_after & fda);
 
     // input operator for first_day_of_the_week_after 
     template<typename CharT, typename Traits> 
       std::basic_istream< CharT, Traits > & 
-      operator>>(std::basic_istream< CharT, Traits > & is, 
+      operator>>(std::basic_istream< CharT, Traits > & is, 
                  first_day_of_the_week_after & fka);
     template<typename CharT, typename TraitsT> 
       std::basic_ostream< CharT, TraitsT > & 
-      operator<<(std::basic_ostream< CharT, TraitsT > & os, 
+      operator<<(std::basic_ostream< CharT, TraitsT > & os, 
                  const boost::gregorian::first_day_of_the_week_before & fdb);
 
     // input operator for first_day_of_the_week_before 
     template<typename CharT, typename Traits> 
       std::basic_istream< CharT, Traits > & 
-      operator>>(std::basic_istream< CharT, Traits > & is, 
+      operator>>(std::basic_istream< CharT, Traits > & is, 
                  first_day_of_the_week_before & fkb);
   }
 }
@@ -1503,15 +1503,15 @@
     typedef date_time::year_based_generator< date > year_based_generator;
     typedef date_time::partial_date< date > partial_date;  // A date generation object type. 
     typedef date_time::nth_kday_of_month< date > nth_kday_of_month;
-    typedef nth_kday_of_month nth_day_of_the_week_in_month;
+    typedef nth_kday_of_month nth_day_of_the_week_in_month;
     typedef date_time::first_kday_of_month< date > first_kday_of_month;
-    typedef first_kday_of_month first_day_of_the_week_in_month;
+    typedef first_kday_of_month first_day_of_the_week_in_month;
     typedef date_time::last_kday_of_month< date > last_kday_of_month;
-    typedef last_kday_of_month last_day_of_the_week_in_month;
+    typedef last_kday_of_month last_day_of_the_week_in_month;
     typedef date_time::first_kday_after< date > first_kday_after;
-    typedef first_kday_after first_day_of_the_week_after;
+    typedef first_kday_after first_day_of_the_week_after;
     typedef date_time::first_kday_before< date > first_kday_before;
-    typedef first_kday_before first_day_of_the_week_before;
+    typedef first_kday_before first_day_of_the_week_before;
     typedef date_time::day_clock< date > day_clock;  // A clock to get the current day from the local computer. 
     typedef date_time::date_itr_base< date > date_iterator;  // Base date_iterator type for gregorian types. 
     typedef date_time::date_itr< date_time::day_functor< date >, date > day_iterator;  // A day level iterator. 
@@ -1593,10 +1593,10 @@
     std::time_t to_time_t(ptime pt);
 
     // Convert a time to a tm structure truncating any fractional seconds. 
-    std::tm to_tm(const boost::posix_time::ptime & t);
+    std::tm to_tm(const boost::posix_time::ptime & t);
 
     // Convert a time_duration to a tm structure truncating any fractional seconds and zeroing fields for date components. 
-    std::tm to_tm(const boost::posix_time::time_duration & td);
+    std::tm to_tm(const boost::posix_time::time_duration & td);
 
     // Convert a tm struct to a ptime ignoring is_dst flag. 
     ptime ptime_from_tm(const std::tm & timetm);
@@ -1611,14 +1611,14 @@
 
    Operators for ptime and optional gregorian types. Operators use snap-to-end-of-month behavior. Further details on this behavior can be found in reference for date_time/date_duration_types.hpp and documentation for month and year iterators. 
    
 
    namespace boost {
   namespace posix_time {
-    ptime operator+(const ptime &, const boost::gregorian::months &);
-    ptime operator+=(ptime &, const boost::gregorian::months &);
-    ptime operator-(const ptime &, const boost::gregorian::months &);
-    ptime operator-=(ptime &, const boost::gregorian::months &);
-    ptime operator+(const ptime &, const boost::gregorian::years &);
-    ptime operator+=(ptime &, const boost::gregorian::years &);
-    ptime operator-(const ptime &, const boost::gregorian::years &);
-    ptime operator-=(ptime &, const boost::gregorian::years &);
+    ptime operator+(const ptime &, const boost::gregorian::months &);
+    ptime operator+=(ptime &, const boost::gregorian::months &);
+    ptime operator-(const ptime &, const boost::gregorian::months &);
+    ptime operator-=(ptime &, const boost::gregorian::months &);
+    ptime operator+(const ptime &, const boost::gregorian::years &);
+    ptime operator+=(ptime &, const boost::gregorian::years &);
+    ptime operator-(const ptime &, const boost::gregorian::years &);
+    ptime operator-=(ptime &, const boost::gregorian::years &);
   }
 }
    
 
@@ -1637,7 +1637,7 @@
     struct simple_time_rep;
 
     class posix_time_system_config;
-    class millisec_posix_time_system_config;
+    class millisec_posix_time_system_config;
 
     typedef date_time::time_resolution_traits< boost::date_time::time_resolution_traits_adapted64_impl, boost::date_time::nano, 1000000000, 9 > time_res_traits;
   }
@@ -1672,32 +1672,32 @@
     typedef boost::date_time::time_input_facet< ptime, char > time_input_facet;
     template<typename CharT, typename TraitsT> 
       std::basic_ostream< CharT, TraitsT > & 
-      operator<<(std::basic_ostream< CharT, TraitsT > & os, const ptime & p);
+      operator<<(std::basic_ostream< CharT, TraitsT > & os, const ptime & p);
 
     // input operator for ptime 
     template<typename CharT, typename Traits> 
       std::basic_istream< CharT, Traits > & 
-      operator>>(std::basic_istream< CharT, Traits > & is, ptime & pt);
+      operator>>(std::basic_istream< CharT, Traits > & is, ptime & pt);
     template<typename CharT, typename TraitsT> 
       std::basic_ostream< CharT, TraitsT > & 
-      operator<<(std::basic_ostream< CharT, TraitsT > & os, 
+      operator<<(std::basic_ostream< CharT, TraitsT > & os, 
                  const boost::posix_time::time_period & p);
 
     // input operator for time_period 
     template<typename CharT, typename Traits> 
       std::basic_istream< CharT, Traits > & 
-      operator>>(std::basic_istream< CharT, Traits > & is, time_period & tp);
+      operator>>(std::basic_istream< CharT, Traits > & is, time_period & tp);
 
     // ostream operator for posix_time::time_duration
     template<typename CharT, typename Traits> 
       std::basic_ostream< CharT, Traits > & 
-      operator<<(std::basic_ostream< CharT, Traits > & os, 
+      operator<<(std::basic_ostream< CharT, Traits > & os, 
                  const time_duration & td);
 
     // input operator for time_duration
     template<typename CharT, typename Traits> 
       std::basic_istream< CharT, Traits > & 
-      operator>>(std::basic_istream< CharT, Traits > & is, time_duration & td);
+      operator>>(std::basic_istream< CharT, Traits > & is, time_duration & td);
   }
 }
 
@@ -1710,28 +1710,28 @@
     // ostream operator for posix_time::time_duration
     template<typename charT, typename traits> 
       std::basic_ostream< charT, traits > & 
-      operator<<(std::basic_ostream< charT, traits > & os, 
+      operator<<(std::basic_ostream< charT, traits > & os, 
                  const time_duration & td);
 
     // ostream operator for posix_time::ptime
     template<typename charT, typename traits> 
       std::basic_ostream< charT, traits > & 
-      operator<<(std::basic_ostream< charT, traits > & os, const ptime & t);
+      operator<<(std::basic_ostream< charT, traits > & os, const ptime & t);
 
     // ostream operator for posix_time::time_period 
     template<typename charT, typename traits> 
       std::basic_ostream< charT, traits > & 
-      operator<<(std::basic_ostream< charT, traits > & os, 
+      operator<<(std::basic_ostream< charT, traits > & os, 
                  const time_period & tp);
     template<typename charT> 
       std::basic_istream< charT > & 
-      operator>>(std::basic_istream< charT > & is, time_duration & td);
+      operator>>(std::basic_istream< charT > & is, time_duration & td);
     template<typename charT> 
       std::basic_istream< charT > & 
-      operator>>(std::basic_istream< charT > & is, ptime & pt);
+      operator>>(std::basic_istream< charT > & is, ptime & pt);
     template<typename charT> 
       std::basic_istream< charT > & 
-      operator>>(std::basic_istream< charT > &, time_period &);
+      operator>>(std::basic_istream< charT > &, time_period &);
   }
 }
 
@@ -1741,7 +1741,7 @@
 
    namespace boost {
   namespace posix_time {
     typedef date_time::split_timedate_system< posix_time_system_config, 1000000000 > posix_time_system;
-    typedef date_time::counted_time_rep< millisec_posix_time_system_config > int64_time_rep;
+    typedef date_time::counted_time_rep< millisec_posix_time_system_config > int64_time_rep;
   }
 }
    
 
@@ -1773,32 +1773,32 @@
 
    namespace boost {
   namespace posix_time {
     template<typename charT> 
-      std::basic_string< charT > to_simple_string_type(time_duration td);
+      std::basic_string< charT > to_simple_string_type(time_duration td);
     template<typename charT> 
-      std::basic_string< charT > to_iso_string_type(time_duration td);
+      std::basic_string< charT > to_iso_string_type(time_duration td);
 
     // Time to simple format CCYY-mmm-dd hh:mm:ss.fffffff. 
     template<typename charT> 
-      std::basic_string< charT > to_simple_string_type(ptime t);
+      std::basic_string< charT > to_simple_string_type(ptime t);
     template<typename charT> 
-      std::basic_string< charT > to_simple_string_type(time_period tp);
+      std::basic_string< charT > to_simple_string_type(time_period tp);
     template<typename charT> 
-      std::basic_string< charT > to_iso_string_type(ptime t);
+      std::basic_string< charT > to_iso_string_type(ptime t);
     template<typename charT> 
-      std::basic_string< charT > to_iso_extended_string_type(ptime t);
+      std::basic_string< charT > to_iso_extended_string_type(ptime t);
 
     // Time duration to wstring -hh::mm::ss.fffffff. Example: 10:09:03.0123456. 
-    std::wstring to_simple_wstring(time_duration td);
+    std::wstring to_simple_wstring(time_duration td);
 
     // Time duration in iso format -hhmmss,fffffff Example: 10:09:03,0123456. 
-    std::wstring to_iso_wstring(time_duration td);
-    std::wstring to_simple_wstring(ptime t);
+    std::wstring to_iso_wstring(time_duration td);
+    std::wstring to_simple_wstring(ptime t);
 
     // Convert to wstring of form [YYYY-mmm-DD HH:MM::SS.ffffff/YYYY-mmm-DD HH:MM::SS.fffffff]. 
-    std::wstring to_simple_wstring(time_period tp);
+    std::wstring to_simple_wstring(time_period tp);
 
     // Convert iso short form YYYYMMDDTHHMMSS where T is the date-time separator. 
-    std::wstring to_iso_wstring(ptime t);
+    std::wstring to_iso_wstring(ptime t);
 
     // Convert to form YYYY-MM-DDTHH:MM:SS where T is the date-time separator. 
     std::wstring to_iso_extended_wstring(ptime t);
@@ -1812,19 +1812,19 @@
   namespace posix_time {
 
     // Time duration to string -hh::mm::ss.fffffff. Example: 10:09:03.0123456. 
-    std::string to_simple_string(time_duration td);
+    std::string to_simple_string(time_duration td);
 
     // Time duration in iso format -hhmmss,fffffff Example: 10:09:03,0123456. 
-    std::string to_iso_string(time_duration td);
+    std::string to_iso_string(time_duration td);
 
     // Time to simple format CCYY-mmm-dd hh:mm:ss.fffffff. 
-    std::string to_simple_string(ptime t);
+    std::string to_simple_string(ptime t);
 
     // Convert to string of form [YYYY-mmm-DD HH:MM::SS.ffffff/YYYY-mmm-DD HH:MM::SS.fffffff]. 
-    std::string to_simple_string(time_period tp);
+    std::string to_simple_string(time_period tp);
 
     // Convert iso short form YYYYMMDDTHHMMSS where T is the date-time separator. 
-    std::string to_iso_string(ptime t);
+    std::string to_iso_string(ptime t);
 
     // Convert to form YYYY-MM-DDTHH:MM:SS where T is the date-time separator. 
     std::string to_iso_extended_string(ptime t);
@@ -1856,25 +1856,31 @@
 
    
 
    - BOOST_SERIALIZATION_SPLIT_FREE(boost::posix_time::ptime);
+ BOOST_SERIALIZATION_SPLIT_FREE(boost::posix_time::ptime);
 template<typename Archive> 
-  void load(Archive &, posix_time::time_duration &, unsigned);
+  void save(Archive & ar, const posix_time::time_duration & td, 
+            unsigned int version);
+template<typename TimeResTraitsSize, typename Archive> 
+  void load_td(Archive &, posix_time::time_duration &);
 template<typename Archive> 
-  void save(Archive &, const posix_time::ptime &, unsigned);
-template<typename Archive> void load(Archive &, posix_time::ptime &, unsigned);
+  void load(Archive & ar, posix_time::time_duration & td, 
+            unsigned int version);
+template<typename Archive> 
+  void save(Archive &, const posix_time::ptime &, unsigned);
+template<typename Archive> void load(Archive &, posix_time::ptime &, unsigned);
 
 // override needed b/c no default constructor 
 template<typename Archive> 
-  void load_construct_data(Archive &, posix_time::ptime * pt, 
+  void load_construct_data(Archive &, posix_time::ptime * pt, 
                            const unsigned int);
 template<typename Archive> 
-  void save(Archive &, const posix_time::time_period &, unsigned);
+  void save(Archive &, const posix_time::time_period &, unsigned);
 template<typename Archive> 
-  void load(Archive &, boost::posix_time::time_period &, unsigned);
+  void load(Archive &, boost::posix_time::time_period &, unsigned);
 
 // override needed b/c no default constructor 
 template<typename Archive> 
-  void load_construct_data(Archive &, boost::posix_time::time_period * tp, 
+  void load_construct_data(Archive &, boost::posix_time::time_period * tp, 
                            const unsigned int);
    
 
 
@@ -1922,21 +1928,21 @@
 
    namespace boost {
   namespace local_time {
     local_date_time 
-    operator+(const local_date_time &, const boost::gregorian::months &);
+    operator+(const local_date_time &, const boost::gregorian::months &);
     local_date_time 
-    operator+=(local_date_time &, const boost::gregorian::months &);
+    operator+=(local_date_time &, const boost::gregorian::months &);
     local_date_time 
-    operator-(const local_date_time &, const boost::gregorian::months &);
+    operator-(const local_date_time &, const boost::gregorian::months &);
     local_date_time 
-    operator-=(local_date_time &, const boost::gregorian::months &);
+    operator-=(local_date_time &, const boost::gregorian::months &);
     local_date_time 
-    operator+(const local_date_time &, const boost::gregorian::years &);
+    operator+(const local_date_time &, const boost::gregorian::years &);
     local_date_time 
-    operator+=(local_date_time &, const boost::gregorian::years &);
+    operator+=(local_date_time &, const boost::gregorian::years &);
     local_date_time 
-    operator-(const local_date_time &, const boost::gregorian::years &);
+    operator-(const local_date_time &, const boost::gregorian::years &);
     local_date_time 
-    operator-=(local_date_time &, const boost::gregorian::years &);
+    operator-=(local_date_time &, const boost::gregorian::years &);
   }
 }
    
 
@@ -1957,7 +1963,7 @@
     typedef date_time::day_calc_dst_rule< last_last_rule_spec > last_last_dst_rule;  // Provides rule of the form last Sunday in April, last Saturday in Oct. 
     typedef date_time::day_calc_dst_rule< nth_last_rule_spec > nth_last_dst_rule;  // Provides rule in form of [1st|2nd|3rd|4th] Sunday in April, last Sunday in Oct. 
     typedef date_time::day_calc_dst_rule< nth_kday_rule_spec > nth_kday_dst_rule;  // Provides rule in form of [1st|2nd|3rd|4th] Sunday in April/October. 
-    typedef date_time::day_calc_dst_rule< nth_kday_rule_spec > nth_day_of_the_week_in_month_dst_rule;  // Provides rule in form of [1st|2nd|3rd|4th] Sunday in April/October. 
+    typedef date_time::day_calc_dst_rule< nth_kday_rule_spec > nth_day_of_the_week_in_month_dst_rule;  // Provides rule in form of [1st|2nd|3rd|4th] Sunday in April/October. 
   }
 }
    
 
@@ -1991,25 +1997,25 @@
     // operator<< for local_date_time - see local_time docs for formatting details 
     template<typename CharT, typename TraitsT> 
       std::basic_ostream< CharT, TraitsT > & 
-      operator<<(std::basic_ostream< CharT, TraitsT > & os, 
+      operator<<(std::basic_ostream< CharT, TraitsT > & os, 
                  const local_date_time & ldt);
 
     // input operator for local_date_time 
     template<typename CharT, typename Traits> 
       std::basic_istream< CharT, Traits > & 
-      operator>>(std::basic_istream< CharT, Traits > & is, 
+      operator>>(std::basic_istream< CharT, Traits > & is, 
                  local_date_time & ldt);
 
     // output operator for local_time_period 
     template<typename CharT, typename TraitsT> 
       std::basic_ostream< CharT, TraitsT > & 
-      operator<<(std::basic_ostream< CharT, TraitsT > & os, 
+      operator<<(std::basic_ostream< CharT, TraitsT > & os, 
                  const boost::local_time::local_time_period & p);
 
     // input operator for local_time_period 
     template<typename CharT, typename Traits> 
       std::basic_istream< CharT, Traits > & 
-      operator>>(std::basic_istream< CharT, Traits > & is, 
+      operator>>(std::basic_istream< CharT, Traits > & is, 
                  boost::local_time::local_time_period & tp);
   }
 }
diff --git a/doc/html/date_time/examples.html b/doc/html/date_time/examples.html
index 16734a7aff..d78b11a7ed 100644
--- a/doc/html/date_time/examples.html
+++ b/doc/html/date_time/examples.html
@@ -6,7 +6,7 @@
 
 
 
-
+
 
 
 
diff --git a/doc/html/date_time/examples/general_usage_examples.html b/doc/html/date_time/examples/general_usage_examples.html
index 1038c2ac05..789f5f4b1d 100644
--- a/doc/html/date_time/examples/general_usage_examples.html
+++ b/doc/html/date_time/examples/general_usage_examples.html
@@ -6,8 +6,8 @@
 
 
 
-
-
+
+
 
 
 
diff --git a/doc/html/date_time/gregorian.html b/doc/html/date_time/gregorian.html
index a96c9254b3..b9047e0bce 100644
--- a/doc/html/date_time/gregorian.html
+++ b/doc/html/date_time/gregorian.html
@@ -6,7 +6,7 @@
 
 
 
-
+
 
 
 
@@ -35,13 +35,13 @@
 
    Gregorian Calendar
    
 
 
    
-Gregorian Date System
    
+Gregorian Date System
 
    
     Introduction -- 
     Usage Examples
   
    
 
    
-Introduction
    
+Introduction
 
    The gregorian date system provides a date programming system based the Gregorian Calendar. The first introduction of the Gregorian calendar was in 1582 to fix an error in the Julian Calendar. However, many local jurisdictions did not adopt this change until much later. Thus there is potential confusion with historical dates. 
   
    
 
    The implemented calendar is a "proleptic Gregorian calendar" which extends dates back prior to the Gregorian Calendar's first adoption in 1582. The current implementation supports dates in the range 1400-Jan-01 to 9999-Dec-31. Many references will represent dates prior to 1582 using the Julian Calendar, so caution is in order if accurate calculations are required on historic dates. See Calendrical Calculations by Reingold & Dershowitz for more details. Date information from Calendrical Calculations has been used to cross-test the correctness of the Gregorian calendar implementation. 
@@ -51,7 +51,7 @@
 
    The class boost::gregorian::date is the primary temporal type for users. If you are interested in learning about writing programs that do specialized date calculations such as finding the "first sunday in april" see the date generators and algorithms page. 
   
    
 
    
-Usage Examples
    
+Usage Examples
 
    
     
    
 
    
@@ -102,7 +102,7 @@
   Convert to String --
   Operators --
   Struct tm Functions
    
-Introduction
    
+Introduction
    
     The class boost::gregorian::date is the primary interface for date programming. In general, 
     the date class is immutable once constructed although it does allow assignment from another 
@@ -125,7 +125,7 @@
     special value not-a-date-time can be used as 'invalid' or 'null' date if so desired.
   
    
-Header
    
+Header
    
     
    #include "boost/date_time/gregorian/gregorian.hpp" //include all types plus i/o
@@ -134,7 +134,7 @@ or
 
    
   
    
 
    
-Construction
    
+Construction
 
    
 
 
 
 
    @@ -175,7 +175,7 @@ date d5(min_date_time);
    
 
 

 
 
    
 
    
-Construct from String
    
+Construct from String
 
    @@ -204,7 +204,7 @@ date d(from_undelimited_string(ds));
    
 
 

 
 
    
 
    
-Construct from Clock
    
+Construct from Clock
 
    @@ -231,7 +231,7 @@ date d(from_undelimited_string(ds));
    
 
 

 
 
    
 
    
-Accessors
    
+Accessors
 
    @@ -277,7 +277,7 @@ date::ymd_type ymd = d.year_month_day();
 
+d.day_of_week(); // --> Thursday
@@ -306,7 +306,7 @@ d.is_neg_infinity(); // --> true
-
@@ -355,7 +355,7 @@ date eom = d.end_of_month();
    
 
 

    Get the day of the week (Sunday, Monday, etc.)
 
    
 
    date d(2002,Jan,10);
-d.day(); // --> Thursday
    
 
    
 
    greg_day_of_year day_of_year() const
    		
 Get the day of the year. Number from 1 to 366 
    
 
    bool is_pos_infinity() const
    		
 Returns true if date is positive infinity
 
    date d(neg_infin); 
+
    date d(pos_infin); 
 d.is_pos_infinity(); // --> true
    
 
    
 
    bool is_not_a_date() const
    
     
 
    
 
    
-Convert to String
    
+Convert to String
 
    @@ -387,7 +387,7 @@ date eom = d.end_of_month();
    
 
 

 
 
    
 
    
-Operators
    
+Operators
 
    @@ -455,7 +455,7 @@ date_duration dd = d2-d1;
    
 
 

 
 
    
 
    
-Struct tm Functions
    
+Struct tm Functions
 
    Functions for converting a date object to, and from, a tm struct are provided.
    
 
    @@ -511,7 +511,7 @@ date d = date_from_tm(d_tm);
   Accessors --
   Operators --
   Additional Duration Types
    
-Introduction
    
+Introduction
    
     The class boost::gregorian::date_duration is a simple day count used for arithmetic with gregorian::date. A duration can be either positive or negative. 
   
    
@@ -519,7 +519,7 @@ date d = date_from_tm(d_tm);
     As of version 1_32 the date_duration class has been typedef'd as days in the boost::gregorian namespace. Throughout the examples you will find days used instead of date_duration.
   
    
-Header
    
+Header
    
     
    #include "boost/date_time/gregorian/gregorian.hpp" //include all types plus i/o
@@ -528,7 +528,7 @@ or
 
    
   
    
 
    
-Construction
    
+Construction
 
    
 

 
 
 
 
    @@ -559,7 +559,7 @@ days dd5(min_date_time);
    
 
 

 
 
    
 
    
-Accessors
    
+Accessors
 
    @@ -602,7 +602,7 @@ dd3.is_special(); // --> false
    
 
 

 
 
    
 
    
-Operators
    
+Operators
 
    @@ -657,7 +657,7 @@ date_duration dd3 = dd1 - dd2;
    
 
 

 
 
    
 
    
-Additional Duration Types
    
+Additional Duration Types
 
    These additional types are logical representations of spans of days.
    
 
    @@ -705,7 +705,7 @@ date(2005,Jan,1) + single; // => 2005-Jan-08
    
-Reversibility of Operations Pitfall
    
+Reversibility of Operations Pitfall
    
 
    A natural expectation when adding a number of months to a date, and then subtracting the same number of months, is to end up exactly where you started. This is most often the result the date_time library provides but there is one significant exception: The snap-to-end-of-month behavior implemented by the months duration type. The months duration type may provide unexpected results when the starting day is the 28th, 29th, or 30th in a 31 day month. The month_iterator is not affected by this issue and is therefore included in the examples to illustrate a possible alternative.
@@ -771,7 +771,7 @@ date(2005,Jan,1) + single; // => 2005-Jan-08
   Accessors --
   Convert to String --
   Operators
    
-Introduction
    
+Introduction
    
     The class boost::gregorian::date_period provides direct representation for ranges between two dates. Periods provide the ability to simplify some types of calculations by simplifying the conditional logic of the program. For example, testing if a date is within an irregular schedule such as a weekend or holiday can be accomplished using collections of date periods. This is facilitated by several methods that allow evaluation if a date_period intersects with another date period, and to generate the period resulting from the intersection. The date period calculation example provides an example of this.
   
    
@@ -782,7 +782,7 @@ date(2005,Jan,1) + single; // => 2005-Jan-08
     Date periods used in combination with infinity values have the ability to represent complex concepts such as 'until further notice'. 
   
    
-Header
    
+Header
    
     
    #include "boost/date_time/gregorian/gregorian.hpp" //include all types plus i/o
@@ -791,7 +791,7 @@ or
 
    
   
    
 
    
-Construction
    
+Construction
 
    
 

 
 
 
 
 
 
 
 
 
    @@ -825,7 +825,7 @@ or
 
    
 
 

 
    
 
    
-Mutators
    
+Mutators
 
    
     
    
 
    
@@ -868,7 +868,7 @@ dp.expand(days(1));
 
    
   
    
-Accessors
    
+Accessors
    
 
 
    @@ -1050,7 +1050,7 @@ dp1.expand(days(2));
 
    
 
 

 
    
 
    
-Convert to String
    
+Convert to String
 
    @@ -1072,7 +1072,7 @@ dp1.expand(days(2));
 
    
 
 

 
    
 
    
-Operators
    
+Operators
 
    @@ -1123,7 +1123,7 @@ operator>, operator<Introduction --
   Header --
   Overview
    
-Introduction
    
+Introduction
    
     Date iterators provide a standard mechanism for iteration through dates. Date iterators are a model of Bidirectional Iterator and can be used to populate collections with dates and other date generation tasks. For example, the print month example iterates through all the days in a month and prints them.  
   
    
@@ -1131,7 +1131,7 @@ operator>, operator<
     All of the iterators here derive from boost::gregorian::date_iterator. 
   
    
-Header
    
+Header
    
     
    #include "boost/date_time/gregorian/gregorian.hpp" //include all types plus i/o
@@ -1140,7 +1140,7 @@ or
 
    
   
    
 
    
-Overview
    
+Overview
 
    
 
 

 
 
 
 
 
    @@ -1207,12 +1207,12 @@ year_iterator 2y_itr(date(2005,Feb,1),2);
 
    
 Date Generators/Algorithms
    
-Date Generators/Algorithms
    
+Date Generators/AlgorithmsIntroduction --
   Header --
   Class Overview --
   Function Overview
    
-Introduction
    
+Introduction
     
     Date algorithms or generators are tools for generating other dates or schedules of dates. A generator function starts with some part of a date such as a month and day and is supplied another part to then generate a concrete date. This allows the programmer to represent concepts such as "The first Sunday in February" and then create a concrete set of dates when provided with one or more years.
     Note: As of boost version 1_31_0, date generator names have been changed. Old names are still available but are no longer documented and may someday be deprecated
@@ -1225,12 +1225,12 @@ year_iterator 2y_itr(date(2005,Feb,1),2);
     The print holidays example shows a detailed usage example. 
   
    
-Header
    
+Header
    #include "boost/date_time/gregorian/gregorian.hpp"
    
   
    
-Overview
    
+Overview
    
 
 

 
 
 
 
 
 
 
 
    @@ -1319,7 +1319,7 @@ date d = fdbf.get_date(date(2002,Feb,1));
 
    
 
 

 
    
 
    
-Function Overview
    
+Function Overview
 
    @@ -1384,7 +1384,7 @@ previous_weekday(d, gw2); // 2004-Jun-1
 Introduction --
   Header --
   Functions
    
-Introduction
    
+Introduction
    
     The class boost::gregorian::gregorian_calendar implements the functions necessary to create the gregorian date system. It converts to the year-month-day form of a date to a day number representation and back. 
   
    
@@ -1395,7 +1395,7 @@ previous_weekday(d, gw2); // 2004-Jun-1
     The print month example demonstrates this. 
   
    
-Header
    
+Header
    
     
    #include "boost/date_time/gregorian/gregorian.hpp" //include all types plus i/o
@@ -1404,7 +1404,7 @@ or
 
    
   
    
 
    
-Functions
    
+Functions
 
    
 
 

 
 
 
 
    diff --git a/doc/html/date_time/local_time.html b/doc/html/date_time/local_time.html
index b5216ba264..1afa27b58c 100644
--- a/doc/html/date_time/local_time.html
+++ b/doc/html/date_time/local_time.html
@@ -6,7 +6,7 @@
 
-
+
@@ -35,13 +35,13 @@
 
    Local Time Period
    
-Local Time System
    
+Local Time System
    
     Introduction -- 
     Usage Examples
   
    
-Introduction
    
+Introduction
    
     The library supports 4 main extensions for the management of local times. This includes 
     
    
@@ -60,7 +60,7 @@
     The phrase "wall-clock" refers to the time that would be shown on a wall clock in a particular time zone at any point in time. Local_time uses a time zone object to account for differences in time zones and daylight savings adjustments. For example: While 5:00 pm, October 10, 2004 in Sydney Australia occurs at exactly the same instant as 3:00 am, October 10, 2004 in New York USA, it is a 14 hour difference in wall-clock times. However, a point in time just one day later will result in a 16 hour difference in wall-clock time due to daylight savings adjustments in both time zones. The local_time system tracks these by means of a time point, stored as UTC, and time_zone objects that contain all the necessary data to correctly calculate wall-clock times.
   
    
-Usage Examples
    
+Usage Examples
    
     
    
 
 

 
 
 
 
 
 
 
 
 
 
 
 
 
    
@@ -96,7 +96,7 @@
   Header --
   Construction --
   Accessors
    
-Introduction
    
+Introduction
    
     The time_zone_base class is an abstract base class template for representing time zones. Time zones are a set of data and rules that provide information about a time zone. The date_time library handles time_zones by means of a boost::shared_ptr<time_zone_base>. A user's custom time zone class will work in the date_time library by means of this shared_ptr.
   
    
@@ -104,7 +104,7 @@
     For convienience, the time_zone_base class is typedef'd as time_zone. All references in the documentation to time_zone, are referring to this typedef.
   
    
-Header
    
+Header
    
     The time_zone_base class is defined in the header:
     
    
@@ -113,7 +113,7 @@
 
    
   
    
-Construction
    
+Construction
    
     A default constructor is provided in the time_zone_base class. There are no private data members in this base class to initialize.
   
    
@@ -121,7 +121,7 @@
     Template parameters are time_type (typically posix_time::ptime) and CharT (defaults to char).
   
    
-Accessors
    
+Accessors
    
     All of the accessors listed here are pure virtual functions.
   
    
@@ -199,7 +199,7 @@ std::string to_posix_string();Header --
   Construction --
   Accessors
    
-Introduction
    
+Introduction
    
     A posix_time_zone object is a set of data and rules that provide information about a time zone. Information such as the offset from UTC, it's name and abbreviation, as well as daylight savings rules, called dst_calc_rules. These rules are stored as a boost::shared_ptr<dst_calc_rules>.
   
    
@@ -279,14 +279,14 @@ leap_day.dst_local_start_time(2003); // Exception thrown
     See Simple time zone for a side by side example of time_zone and posix_time_zone usage.
   
    
-Important Notes
    
+Important Notes
      
 
    • posix_time_zone objects use the standard and daylight savings abbreviations in place of the full names (see Accessors below).
      • 
 
    • 'Jn' and 'n' date specifications can not be mixed in a specification string. Ex: "FST+3FDT,59,J304" 
      • 
 
    • 'n' date specification of 59 represents Feb-29. Do not attempt to access in a non-leap year or an exception will be thrown.
      • 
 
    
-Header
    
+Header
    
     The inclusion of a single header will bring in all boost::local_time types, functions, and IO operators.
     
    
@@ -294,7 +294,7 @@ leap_day.dst_local_start_time(2003); // Exception thrown
    
   
    
-Construction
    
+Construction
    
     
    
 
 
 
 
 
 
 
   
 
 
 
 
 
 
 
 
 
    
@@ -317,7 +317,7 @@ time_zone_ptr zone(new posix_time_zone(nyc));
    
   
    
-Accessors
    
+Accessors
    
     
    
 
 
 
 
    
@@ -408,14 +408,14 @@ phx_zone_sh_ptr->to_posix_string();
   Construction --
   Accessors --
   Data File Details
    
-Introduction
    
+Introduction
    
     The local_time system depends on the ability to store time zone information. Our Time Zone Database (tz_database) is a means of permanently storing that data. The specifications for many time zones (377 at this time) are provided. These specifications are based on data found in the zoneinfo datebase. The specifications are stored in the file:
    libs/date_time/data/date_time_zonespec.csv
    . While this file already contains specifications for many time zones, it's real intent is for the user to modify it by adding (or removing) time zones to fit their application. See Data File Details to learn how this is accomplished.
   
    
-Header
    
+Header
    
     The inclusion of a single header will bring in all boost::local_time types, functions, and IO operators.
     
    
@@ -424,7 +424,7 @@ phx_zone_sh_ptr->to_posix_string();
 
    
   
    
-Construction
    
+Construction
    
     The only constructor takes no arguments and creates an empty database. It is up to the user to populate the database. This is typically achieved by loading the desired datafile, but can also be accomplished by means of the add_record(...) function (see the Accessors table). A local_time::data_not_accessible exception will be thrown if given zonespec file cannot be found. local_time::bad_field_count exception will be thrown if the number of fields in given zonespec file is incorrect.
   
    
@@ -458,7 +458,7 @@ tz_db.load_from_file("./date_time_zonespec.csv");
    
   
    
-Accessors
    
+Accessors
    
     
    
 
 
 
 
 
 
 
 
 
 
 
    
@@ -509,7 +509,7 @@ regions = tz_db.region_list();
    
   
    
-Data File Details
    
+Data File DetailsField Description/Details
    
     The csv file containing the zone_specs used by the boost::local_time::tz_database is intended to be customized by the library user. When customizing this file (or creating your own) the file must follow a specific format.
   
    
@@ -540,7 +540,7 @@ not processed by the tz_database.
     Since some time zones do not use daylight savings it is not always necessary for every field in a zone_spec to contain a value. All zone_specs must have at least ID and GMT offset. Zones that use daylight savings must have all fields filled except: STD ABBR, STD NAME, DST NAME. You should take note that DST ABBR is mandatory for zones that use daylight savings (see field descriptions for further details).
   
    
-Field Description/Details
    
+Field Description/Details
    
     
      
@@ -630,7 +630,7 @@ not processed by the tz_database.
   Construction --
   Accessors --
   Dependent Types
      
-Introduction
      
+Introduction
 
      
     A custom_time_zone object is a set of data and rules that provide information about a time zone. Information such as the offset from UTC, it's name and abbreviation, as well as daylight savings rules, called dst_calc_rules. These rules are handled via a boost::shared_ptr<dst_calc_rules>. Not all time zones utilize daylight savings, therefore, time_zone objects can be used with a NULL-assigned shared_ptr.
   
      
@@ -647,7 +647,7 @@ not processed by the tz_database.
 
      
   
      
 
      
-Header
      
+Header
 
      
     The inclusion of a single header will bring in all boost::local_time types, functions, and IO operators.
     
      
@@ -655,7 +655,7 @@ not processed by the tz_database.
 
      
   
      
 
      
-Construction
      
+Construction
 
      
     Construction of a custom_time_zone is dependent on four objects: a 
     time_duration, a time_zone_names, a dst_adjustment_offsets, and a shared_ptr to a dst_calc_rule.
@@ -684,7 +684,7 @@ not processed by the tz_database.
 
      
   
      
 
      
-Accessors
      
+Accessors
 
      
     
      
 
    
 
 
 
 
 
 
    
@@ -780,11 +780,11 @@ phx_ptr->to_posix_string();
 
    
   
    
-Dependent Types
    
+Dependent TypesTime Zone Names --
   Dst Adjustment Offsets --
   Daylight Savings Calc Rules
    
-Time Zone Names
    
+Time Zone Names
    
     The time_zone_names_base type is an immutable template class of four strings. One each for the name and abbreviation in standard time and daylight savings time. The time_zone_names type is a typedef of time_zone_names_base<char>.
   
    
@@ -849,7 +849,7 @@ time_zone_names nyc_names(sn, sa,
 
    
   
    
-Dst Adjustment Offsets
    
+Dst Adjustment Offsets
    
     The dst_adjustment_offsets type is a collection of three time_duration objects.
   
    
@@ -885,7 +885,7 @@ dst_adjustment_offsets(hours(1),
 
    
   
    
-Daylight Savings Calc Rules
    
+Daylight Savings Calc Rules
    
     Daylight savings calc rules, named dst_calc_rules, are a series of objects that group appropriate date_generators together to form rule sets. The individual rules objects are used via dst_calc_rule_ptr.
   
    
@@ -962,12 +962,12 @@ dst_adjustment_offsets(hours(1),
   Accessors --
   Operators --
   Struct tm Functions
    
-Introduction
    
+Introduction
    
     A local_date_time object is a point in time and an associated time zone. The time is represented internally as UTC.
   
    
-Header
    
+Header
    
     The inclusion of a single header will bring in all boost::local_time types,
 functions, and IO operators.
@@ -978,7 +978,7 @@ functions, and IO operators.
 
    
   
    
-Construct From Clock
    
+Construct From Clock
    
     Creation of a local_date_time object from clock is possible with either second, or sub second resolution.
   
    
@@ -1028,7 +1028,7 @@ local_date_time ldt =
 
    
   
    
-Construction
    
+Construction
    
     Construction of a local_date_time object can be done with a ptime and a time_zone_ptr where the ptime represents UTC time. Construction with a wall-clock representation takes the form of a date, a time_duration, a time_zone_ptr, and a fourth parameter that addresses the following complication.
   
    
@@ -1134,7 +1134,7 @@ local_date_time nadt(pos_infin);
    
   
    
-Accessors
    
+Accessors
    
     
    
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
    
@@ -1239,7 +1239,7 @@ ldt3.is_special(); // --> false
    
   
    
-Operators
    
+Operators
    
 
 
 
    @@ -1295,7 +1295,7 @@ operator-, operator-=
    
 
 

 
 
    
 
    
-Struct tm Functions
    
+Struct tm Functions
 
    Function for converting a local_date_time object to a tm struct is provided.
    
 
    @@ -1344,7 +1344,7 @@ tm ldt_tm = to_tm(ldt);
   Construction --
   Accessors --
   Operators
    
-Introduction
    
+Introduction
    
     The class boost::local_time::local_time_period provides direct representation for ranges between two local times. Periods provide the ability to simplify some types of calculations by simplifying the conditional logic of the program. 
   
    
@@ -1352,7 +1352,7 @@ tm ldt_tm = to_tm(ldt);
     A period that is created with beginning and end points being equal, or with a duration of zero, is known as a zero length period. Zero length periods are considered invalid (it is perfectly legal to construct an invalid period). For these periods, the last point will always be one unit less that the begin point.
   
    
-Header
    
+Header
    
     
    #include "boost/date_time/local_time/local_time.hpp" //include all types plus i/o
@@ -1361,7 +1361,7 @@ or
 
    
   
    
 
    
-Construction
    
+Construction
 
    
     
    
 
    
 

 
 
 
 
    
@@ -1419,7 +1419,7 @@ local_time_period ltp(beg, hours(24));
    
   
    
-Accessors
    
+Accessors
    
     
    
 
 
 
 
    
@@ -1602,7 +1602,7 @@ mar_mst.shift(hours(48));
 
    
   
    
-Operators
    
+Operators
    
     
    
 
 
 
    
diff --git a/doc/html/date_time/posix_time.html b/doc/html/date_time/posix_time.html
index 5948a09cfe..9c6f10c317 100644
--- a/doc/html/date_time/posix_time.html
+++ b/doc/html/date_time/posix_time.html
@@ -6,7 +6,7 @@
 
-
+
@@ -33,18 +33,18 @@
 
    Time Iterators
    
-Posix Time System
    
+Posix Time System
    
     Introduction -- 
     Usage Examples
   
    
-Introduction
    
+Introduction
    
     Defines a non-adjusted time system with nano-second/micro-second resolution and stable calculation properties.  The nano-second resolution option uses 96 bits of underlying storage for each ptime while the micro-second resolution uses 64 bits per ptime (see Build Options for details). This time system uses the Gregorian calendar to implement the date portion of the time representation. 
   
    
-Usage Examples
    
+Usage Examples
    
     
    
 
 
 
 
 
 
 
 
 
 
 
 
 
    
@@ -90,7 +90,7 @@
   Conversion To String --
   Operators --
   Struct tm, time_t, and FILETIME Functions
    
-Introduction
    
+Introduction
    
     The class boost::posix_time::ptime is the primary interface for time point manipulation. In general, the ptime class is immutable once constructed although it does allow assignment. 
   
    
@@ -101,7 +101,7 @@
     Other techniques for creating times include time iterators. 
   
    
-Header
    
+Header
    
     
    #include "boost/date_time/posix_time/posix_time.hpp" //include all types plus i/o
@@ -110,7 +110,7 @@ or
 
    
   
    
 
    
-Construction
    
+Construction
 
    
     
    
 
    
 
 
 
 
    
@@ -160,7 +160,7 @@ ptime d5(min_date_time);
    
   
    
-Construct from String
    
+Construct from String
    
     
    
 
 
 
 
    
@@ -193,7 +193,7 @@ ptime t(from_iso_string(ts))
    
   
    
-Construct from Clock
    
+Construct from Clock
    
     
    
 
 
 
 
    
@@ -234,7 +234,7 @@ ptime t(from_iso_string(ts))
    
   
    
-Construct using Conversion Functions
    
+Construct using Conversion Functions
    
     
    
 
 
 
 
    
@@ -265,7 +265,7 @@ ptime t(from_iso_string(ts))
    
   
    
-Accessors
    
+Accessors
    
     
    
 
 
 
 
    
@@ -339,7 +339,7 @@ pt3.is_special(); // --> false
    
   
    
-Conversion to String
    
+Conversion to String
    
     
    
 
 
 
 
    
@@ -375,7 +375,7 @@ pt3.is_special(); // --> false
    
   
    
-Operators
    
+Operators
    
     
    
 
 
 
 
    
@@ -464,7 +464,7 @@ time_duration t3 = t2 - t1;//negative result
    
   
    
-Struct tm, time_t, and FILETIME Functions
    
+Struct tm, time_t, and FILETIME Functions
    Functions for converting posix_time objects to, and from, tm structs are provided as well as conversion from time_t and FILETIME.
    
 
 
 
 
    @@ -561,7 +561,7 @@ ptime pt = from_ftime<ptime>(ft);
   Conversion To String --
   Operators --
   Struct tm Functions
    
-Introduction
    
+Introduction
    
     The class boost::posix_time::time_duration the base type responsible for representing a length of time. A duration can be either positive or negative. The general time_duration class provides a constructor that takes a count of the number of hours, minutes, seconds, and fractional seconds count as shown in the code fragment below. The resolution of the time_duration is configure able at compile time. See Build-Compiler Information for more information. 
   
    
@@ -609,7 +609,7 @@ time_duration td(1,2,3,count); //01:02:03.5 //no matter the resolution settings
 
    
   
    
-Header
    
+Header
    
     
    #include "boost/date_time/posix_time/posix_time.hpp" //include all types plus i/o
@@ -618,7 +618,7 @@ or
 
    
   
    
 
    
-Construction
    
+Construction
 
    
     
    
 
    
 

 
 
 
 
    
@@ -663,7 +663,7 @@ total_seconds()The remaining accessor functions will work as expected.
    
-Count Based Construction
    
+Count Based Construction
    
     
    
   
 
 
 
    
@@ -714,7 +714,7 @@ total_seconds()The remaining accessor functions will work as expected.
    
-Construct from String
    
+Construct from String
    
     
    
   
 
 
 
    
@@ -743,7 +743,7 @@ time_duration td(duration_from_string(ts));
    
   
    
-Accessors
    
+Accessors
    
     
    
 
 
 
 
    
@@ -760,7 +760,7 @@ time_duration td(duration_from_string(ts));
-
+
-
+
-
+
-
+
-
+
-
+
-
+
-
+
    
   
    
-Conversion To String
    
+Conversion To String
    
     
    
 
 
 
    long hours()
    boost::int64_t hours()
    		
 Get the number of normalized hours (will give unpredictable results if calling time_duration is a special_value).
 
    
 
    time_duration td(1,2,3); 
@@ -768,7 +768,7 @@ time_duration neg_td(-1,2,3);
 td.hours(); // --> 1
 neg_td.hours(); // --> -1
    
 
    long minutes()
    boost::int64_t minutes()
    		
 Get the number of minutes normalized +/-(0..59) (will give unpredictable results if calling time_duration is a special_value).
 
    
 
    time_duration td(1,2,3);
@@ -776,7 +776,7 @@ time_duration neg_td(-1,2,3);
 td.minutes(); // --> 2
 neg_td.minutes(); // --> -2
    
 
    long seconds()
    boost::int64_t seconds()
    		
 Get the normalized number of second +/-(0..59) (will give unpredictable results if calling time_duration is a special_value).
 
    
 
    time_duration td(1,2,3); 
@@ -784,7 +784,7 @@ time_duration neg_td(-1,2,3);
 td.seconds(); // --> 3
 neg_td.seconds(); // --> -3
    
 
    long total_seconds()
    boost::int64_t total_seconds()
    		
 Get the total number of seconds truncating any fractional seconds (will give unpredictable results if calling time_duration is a special_value).
 
    
 
    
@@ -793,7 +793,7 @@ td.total_seconds();
 // --> (1*3600) + (2*60) + 3 == 3723
 	    
    
 
    long total_milliseconds()
    boost::int64_t total_milliseconds()
    		
 Get the total number of milliseconds truncating any remaining digits (will give unpredictable results if calling time_duration is a special_value).
 
    
 
    
@@ -804,7 +804,7 @@ td.total_milliseconds();
 // (3723 * 1000) + 123 == 3723123
 	    
    
 
    long total_microseconds()
    boost::int64_t total_microseconds()
    		
 Get the total number of microseconds truncating any remaining digits (will give unpredictable results if calling time_duration is a special_value).
 
    
 
    
@@ -815,7 +815,7 @@ td.total_microseconds();
 // (3723 * 1000000) + 123456 == 3723123456
 	    
    
 
    long total_nanoseconds()
    boost::int64_t total_nanoseconds()
    		
 Get the total number of nanoseconds truncating any remaining digits (will give unpredictable results if calling time_duration is a special_value).
 
    
 
    
@@ -827,7 +827,7 @@ td.total_nanoseconds();
 //                              == 3723123456789
 	    
    
 
    long fractional_seconds()
    boost::int64_t fractional_seconds()
    		
 Get the number of fractional seconds (will give unpredictable results if calling time_duration is a special_value).
 
    
 
    time_duration td(1,2,3, 1000);
@@ -906,7 +906,7 @@ td3.is_special(); // --> false
    
 
 
 
 
    
@@ -937,7 +937,7 @@ td3.is_special(); // --> false
    
   
    
-Operators
    
+Operators
    
     
    
 
 
 
 
    
@@ -1008,7 +1008,7 @@ nanosecond(3)/2 == nanosecond(1);
    
   
    
-Struct tm, time_t, and FILETIME Functions
    
+Struct tm, time_t, and FILETIME Functions
    Function for converting a time_duration to a tm struct is provided.
    
 
 
 
 
    @@ -1053,7 +1053,7 @@ tm td_tm = to_tm(td);
   Accessors --
   Conversion To String --
   Operators
    
-Introduction
    
+Introduction
    
     The class boost::posix_time::time_period provides direct representation for ranges between two times. Periods provide the ability to simplify some types of calculations by simplifying the conditional logic of the program. 
   
    
@@ -1064,7 +1064,7 @@ tm td_tm = to_tm(td);
     The time periods example provides an example of using time periods. 
   
    
-Header
    
+Header
    
     
    #include "boost/date_time/posix_time/posix_time.hpp" //include all types plus i/o
@@ -1073,7 +1073,7 @@ or
 
    
   
    
 
    
-Construction
    
+Construction
 
    
     
    
 
    
 

 
 
 
 
    
@@ -1120,7 +1120,7 @@ time_period tp(t, hours(3));
    
   
    
-Mutators
    
+Mutators
    
     
    
 
 
 
 
    
@@ -1163,7 +1163,7 @@ tp.expand(minutes(5));
 
    
   
    
-Accessors
    
+Accessors
    
     
    
 
 
 
    
@@ -1290,7 +1290,7 @@ tp2.intersects(tp1); // --> true
    
   
    
-Conversion To String
    
+Conversion To String
    
     
    
 
 
 
 
    
@@ -1319,7 +1319,7 @@ tp2.intersects(tp1); // --> true
    
   
    
-Operators
    
+Operators
    
     
    
 
 
 
 
    
@@ -1379,7 +1379,7 @@ tp2.intersects(tp1); // --> trueHeader --
   Overview --
   Operators
    
-Introduction
    
+Introduction
    
     Time iterators provide a mechanism for iteration through times. Time iterators are similar to Bidirectional Iterators. However, time_iterators are different than standard iterators in that there is no underlying sequence, just a calculation function. In addition, time_iterators are directly comparable against instances of class ptime. Thus a second iterator for the end point of the iteration is not required, but rather a point in time can be used directly. For example, the following code iterates using a 15 minute iteration interval. The print hours example also illustrates the use of the time_iterator. 
   
    
@@ -1417,7 +1417,7 @@ tp2.intersects(tp1); // --> true
    
   
    
-Header
    
+Header
    
     
    #include "boost/date_time/posix_time/posix_time.hpp" //include all types plus i/o
@@ -1426,7 +1426,7 @@ or
 
    
   
    
 
    
-Overview
    
+Overview
 
    
     
    
 
    
   
 
 
 
 
 
    
@@ -1452,7 +1452,7 @@ or
 
    
   
    
-Operators
    
+Operators
    
     
    
 
 
 
    
diff --git a/doc/html/date_time/serialization.html b/doc/html/date_time/serialization.html
index d5941fe594..3b2b4a6f00 100644
--- a/doc/html/date_time/serialization.html
+++ b/doc/html/date_time/serialization.html
@@ -6,7 +6,7 @@
 
-
+
@@ -30,7 +30,7 @@
     The boost::date_time library is compatible with the boost::serialization library's text and xml archives. The list of classes that are serializable are:
   
    
-boost::gregorian
    
+boost::gregorian
    
 
 
 
 
 
 
 
    @@ -61,7 +61,7 @@
 
    
 
 

 
    
 
    
-boost::posix_time
    
+boost::posix_time
 
    diff --git a/doc/html/doc_HTML.manifest b/doc/html/doc_HTML.manifest
index ff4ec34833..9228a1fff4 100644
--- a/doc/html/doc_HTML.manifest
+++ b/doc/html/doc_HTML.manifest
@@ -804,22 +804,25 @@ boost_circular_buffer_c___reference.html
 BOOST_CB_ENABLE_DEBUG.html
 BOOST_CB_ASSERT.html
 BOOST_CB_IS_CONVERTIBLE.html
-BOOST_CB_ASSER_idp14364704.html
+BOOST_CB_ASSER_idp33239264.html
 boost/circular_buffer.html
-boost/operator___idp24460448.html
-boost/operator_idp24473872.html
-boost/operator___idp24487216.html
-boost/operator_idp24501376.html
-boost/operator___idp24515552.html
-boost/operator___idp24529728.html
-boost/swap_idp24543920.html
-boost/circular_buffe_idp24565232.html
+boost/operator___idp43338976.html
+boost/operator_idp43352400.html
+boost/operator___idp43365744.html
+boost/operator_idp43379904.html
+boost/operator___idp43394080.html
+boost/operator___idp43408256.html
+boost/swap_idp43422448.html
+boost/circular_buffe_idp43443760.html
 circular_buffer/s14.html
 container.html
 container/main_features.html
 container/exception_handling.html
 container/non_standard_containers.html
 container/extended_functionality.html
+container/configurable_containers.html
+container/extended_allocators.html
+container/polymorphic_memory_resources.html
 container/Cpp11_conformance.html
 container/known_issues.html
 container/history_and_reasons.html
@@ -834,8 +837,6 @@ boost/container/allocator_traits/portable_rebind_alloc.html
 boost/container/ordered_range_t.html
 boost/container/ordered_unique_range_t.html
 boost/container/default_init_t.html
-boost/container/tree_type_enum.html
-boost/container/tree_assoc_defaults.html
 boost/container/ordered_range.html
 boost/container/ordered_unique_range.html
 boost/container/default_init.html
@@ -855,8 +856,8 @@ boost/container/map.html
 boost/container/multimap.html
 boost/container/pmr/map_of.html
 boost/container/pmr/multimap_of.html
-boost/container/new_allocator__idp62944752.html
-boost/container/new_allocator__idp62944752/rebind.html
+boost/container/new_allocator__idp55809792.html
+boost/container/new_allocator__idp55809792/rebind.html
 boost/container/new_allocator.html
 boost/container/new_allocator/rebind.html
 boost/container/node_allocator.html
@@ -866,6 +867,15 @@ boost/container/insert_return_type_base.html
 boost/container/tree_type.html
 boost/container/optimize_size.html
 boost/container/tree_assoc_options.html
+boost/container/growth_factor_50.html
+boost/container/growth_factor_60.html
+boost/container/growth_factor_100.html
+boost/container/growth_factor.html
+boost/container/stored_size.html
+boost/container/vector_options.html
+boost/container/tree_type_enum.html
+boost/container/tree_assoc_options_t.html
+boost/container/vector_options_t.html
 boost/container/pmr/new_delete_resource.html
 boost/container/pmr/null_memory_resource.html
 boost/container/pmr/set_default_resource.html
@@ -879,7 +889,7 @@ boost/container/pmr/pool_options.html
 boost/container/pmr/resource_adaptor_imp.html
 boost/container/pmr/resource_adaptor.html
 boost/container/pmr/synchronized_pool_resource.html
-boost/container/pmr/unsynchronized_idp63576512.html
+boost/container/pmr/unsynchronized_idp56479344.html
 boost/container/scoped_allocator_adaptor.html
 boost/container/scoped_allocator_adaptor/rebind.html
 boost/container/set.html
@@ -887,7 +897,7 @@ boost/container/multiset.html
 boost/container/pmr/set_of.html
 boost/container/pmr/multiset_of.html
 boost/container/slist.html
-std/insert_iterato_idp65191984.html
+std/insert_iterato_idp58095904.html
 boost/container/pmr/slist_of.html
 boost/container/small_vector_allocator.html
 boost/container/small_vector_allocator/rebind.html
@@ -897,13 +907,13 @@ boost/container/pmr/small_vector_of.html
 boost/container/stable_vector.html
 boost/container/pmr/stable_vector_of.html
 boost/container/static_vector.html
-boost/container/operator___idp66288880.html
-boost/container/operator___idp66298896.html
-boost/container/operator_idp66308928.html
-boost/container/operator_idp66318912.html
-boost/container/operator___idp66328896.html
-boost/container/operator___idp66338880.html
-boost/container/swap_idp66348864.html
+boost/container/operator___idp59193360.html
+boost/container/operator___idp59203376.html
+boost/container/operator_idp59213408.html
+boost/container/operator_idp59223392.html
+boost/container/operator___idp59233376.html
+boost/container/operator___idp59243360.html
+boost/container/swap_idp59253344.html
 boost/container/basic_string.html
 boost/container/string.html
 boost/container/wstring.html
@@ -913,8 +923,8 @@ boost/container/throw_out_of_range.html
 boost/container/throw_length_error.html
 boost/container/throw_logic_error.html
 boost/container/throw_runtime_error.html
-boost/container/constructible__idp67492240.html
-boost/container/constructible__idp67501632.html
+boost/container/constructible__idp60397280.html
+boost/container/constructible__idp60406672.html
 boost/container/uses_allocator.html
 boost/container/erased_type.html
 boost/container/allocator_arg_t.html
@@ -923,6 +933,42 @@ boost/container/vector.html
 boost/container/pmr/vector_of.html
 container/acknowledgements_notes.html
 container/release_notes.html
+hash.html
+hash/tutorial.html
+hash/custom.html
+hash/combine.html
+hash/portability.html
+hash/disable.html
+hash/changes.html
+hash/rationale.html
+hash/reference.html
+boost/hash.html
+boost/hash_bool_1_3_11_11_2_2_2.html
+boost/hash_char_1_3_11_11_2_2_3.html
+boost/hash_signe_1_3_11_11_2_2_4.html
+boost/hash_unsig_1_3_11_11_2_2_5.html
+boost/hash_wchar_1_3_11_11_2_2_6.html
+boost/hash_char1_1_3_11_11_2_2_7.html
+boost/hash_char3_1_3_11_11_2_2_8.html
+boost/hash_short_1_3_11_11_2_2_9.html
+boost/hash_unsi_1_3_11_11_2_2_10.html
+boost/hash_int_1_3_11_11_2_2_11.html
+boost/hash_unsi_1_3_11_11_2_2_12.html
+boost/hash_long_1_3_11_11_2_2_13.html
+boost/hash_unsi_1_3_11_11_2_2_14.html
+boost/hash_long_1_3_11_11_2_2_15.html
+boost/hash_unsi_1_3_11_11_2_2_16.html
+boost/hash_floa_1_3_11_11_2_2_17.html
+boost/hash_doub_1_3_11_11_2_2_18.html
+boost/hash_long_1_3_11_11_2_2_19.html
+boost/hash_std__1_3_11_11_2_2_20.html
+boost/hash_std__1_3_11_11_2_2_21.html
+boost/hash_std__1_3_11_11_2_2_22.html
+boost/hash_std__1_3_11_11_2_2_23.html
+boost/hash_T_1_3_11_11_2_2_24.html
+boost/hash_std__1_3_11_11_2_2_25.html
+hash/links.html
+hash/acknowledgements.html
 conversion.html
 conversion/polymorphic_casts.html
 conversion/_polymorphic_cast____polymorphic_downcast____polymorphic_pointer_cast__and__polymorphic_pointer_downcast__synopsis.html
@@ -960,7 +1006,7 @@ boost/date_time/years_duration.html
 boost/date_time/date_facet.html
 boost/date_time/date_input_facet.html
 boost/date_time/simple_format.html
-boost/date_time/simpl_1_3_12_15_3_13_1_1_2.html
+boost/date_time/simpl_1_3_13_15_3_13_1_1_2.html
 boost/date_time/month_formatter.html
 boost/date_time/ymd_formatter.html
 boost/date_time/date_formatter.html
@@ -988,10 +1034,10 @@ boost/date_time/all_date_names_put.html
 boost/date_time/convert_to_lower.html
 boost/date_time/find_match.html
 boost/date_time/parse_date.html
-boost/date_time/from__1_3_12_15_3_22_1_1_6.html
-boost/date_time/from__1_3_12_15_3_22_1_1_7.html
-boost/date_time/from__1_3_12_15_3_22_1_1_8.html
-boost/date_time/from__1_3_12_15_3_22_1_1_9.html
+boost/date_time/from__1_3_13_15_3_22_1_1_6.html
+boost/date_time/from__1_3_13_15_3_22_1_1_7.html
+boost/date_time/from__1_3_13_15_3_22_1_1_8.html
+boost/date_time/from__1_3_13_15_3_22_1_1_9.html
 boost/date_time/dst_calculator.html
 boost/date_time/dst_calc_engine.html
 boost/date_time/us_dst_rules.html
@@ -1000,18 +1046,18 @@ boost/date_time/dst_day_calc_rule.html
 boost/date_time/day_calc_dst_rule.html
 boost/date_time/time_from_ftime.html
 boost/date_time/format_date_parser.html
-boost/date_time/fixed_1_3_12_15_3_26_2_1_2.html
-boost/date_time/fixed_1_3_12_15_3_26_2_1_3.html
+boost/date_time/fixed_1_3_13_15_3_26_2_1_2.html
+boost/date_time/fixed_1_3_13_15_3_26_2_1_3.html
 boost/date_time/var_string_to_int.html
 boost/date_time/gregorian_calendar_base.html
 boost/date_time/int_adapter.html
-boost/date_time/opera_1_3_12_15_3_28_1_1_2.html
+boost/date_time/opera_1_3_13_15_3_28_1_1_2.html
 boost/date_time/iso_format_base.html
-boost/date_time/iso_f_1_3_12_15_3_29_1_1_2.html
+boost/date_time/iso_f_1_3_13_15_3_29_1_1_2.html
 boost/date_time/iso_format.html
 boost/date_time/iso_extended_format.html
 boost/date_time/utc_adjustment.html
-boost/date_time/dynam_1_3_12_15_3_30_2_1_2.html
+boost/date_time/dynam_1_3_13_15_3_30_2_1_2.html
 boost/date_time/static_local_time_adjustor.html
 boost/date_time/local_adjustor.html
 boost/date_time/us_dst_trait.html
@@ -1037,16 +1083,16 @@ boost/date_time/subsecond_duration.html
 boost/date_time/time_formats.html
 boost/date_time/time_facet.html
 boost/date_time/time_input_facet.html
-boost/date_time/ostre_1_3_12_15_3_49_1_1_1.html
+boost/date_time/ostre_1_3_13_15_3_49_1_1_1.html
 boost/date_time/ostream_time_formatter.html
-boost/date_time/ostre_1_3_12_15_3_49_1_1_3.html
+boost/date_time/ostre_1_3_13_15_3_49_1_1_3.html
 boost/date_time/time_itr.html
-boost/date_time/str_f_1_3_12_15_3_51_1_1_2.html
-boost/date_time/parse_1_3_12_15_3_51_1_1_3.html
-boost/date_time/time__1_3_12_15_3_52_1_1_1.html
-boost/date_time/time__1_3_12_15_3_52_1_1_2.html
-boost/date_time/time__1_3_12_15_3_52_1_1_3.html
-boost/date_time/time__1_3_12_15_3_52_1_1_4.html
+boost/date_time/str_f_1_3_13_15_3_51_1_1_2.html
+boost/date_time/parse_1_3_13_15_3_51_1_1_3.html
+boost/date_time/time__1_3_13_15_3_52_1_1_1.html
+boost/date_time/time__1_3_13_15_3_52_1_1_2.html
+boost/date_time/time__1_3_13_15_3_52_1_1_3.html
+boost/date_time/time__1_3_13_15_3_52_1_1_4.html
 boost/date_time/time_resolution_traits.html
 boost/date_time/counted_time_rep.html
 boost/date_time/counted_time_system.html
@@ -1070,25 +1116,25 @@ boost/gregorian/date_duration.html
 boost/gregorian/greg_durations_config.html
 boost/gregorian/weeks_duration.html
 boost/gregorian/greg_facet_config.html
-boost/gregorian/opera_1_3_12_15_4_11_1_1_3.html
-boost/gregorian/opera_1_3_12_15_4_11_1_1_4.html
-boost/gregorian/opera_1_3_12_15_4_11_1_1_5.html
-boost/gregorian/opera_1_3_12_15_4_11_1_1_6.html
+boost/gregorian/opera_1_3_13_15_4_11_1_1_3.html
+boost/gregorian/opera_1_3_13_15_4_11_1_1_4.html
+boost/gregorian/opera_1_3_13_15_4_11_1_1_5.html
+boost/gregorian/opera_1_3_13_15_4_11_1_1_6.html
 boost/gregorian/bad_month.html
 boost/gregorian/greg_month.html
 serialization/serialize.html
-serialization/save_1_3_12_15_4_13_1_2.html
-serialization/load_1_3_12_15_4_13_1_3.html
-serialization/save_1_3_12_15_4_13_1_11.html
-serialization/load_1_3_12_15_4_13_1_12.html
-serialization/save_1_3_12_15_4_13_1_26.html
-serialization/load_1_3_12_15_4_13_1_27.html
-serialization/save_1_3_12_15_4_13_1_29.html
-serialization/load_1_3_12_15_4_13_1_30.html
-serialization/save_1_3_12_15_4_13_1_32.html
-serialization/load_1_3_12_15_4_13_1_33.html
-serialization/save_1_3_12_15_4_13_1_35.html
-serialization/load_1_3_12_15_4_13_1_36.html
+serialization/save_1_3_13_15_4_13_1_2.html
+serialization/load_1_3_13_15_4_13_1_3.html
+serialization/save_1_3_13_15_4_13_1_11.html
+serialization/load_1_3_13_15_4_13_1_12.html
+serialization/save_1_3_13_15_4_13_1_26.html
+serialization/load_1_3_13_15_4_13_1_27.html
+serialization/save_1_3_13_15_4_13_1_29.html
+serialization/load_1_3_13_15_4_13_1_30.html
+serialization/save_1_3_13_15_4_13_1_32.html
+serialization/load_1_3_13_15_4_13_1_33.html
+serialization/save_1_3_13_15_4_13_1_35.html
+serialization/load_1_3_13_15_4_13_1_36.html
 boost/gregorian/bad_weekday.html
 boost/gregorian/greg_weekday.html
 boost/gregorian/bad_year.html
@@ -1096,40 +1142,40 @@ boost/gregorian/greg_year.html
 boost/gregorian/year_based_generator.html
 boost/gregorian/special_value_from_string.html
 boost/posix_time/from_ftime.html
-boost/posix_time/operat_1_3_12_15_5_3_2_1_1.html
-boost/posix_time/operat_1_3_12_15_5_3_2_1_2.html
-boost/posix_time/operat_1_3_12_15_5_3_2_1_3.html
-boost/posix_time/operat_1_3_12_15_5_3_2_1_4.html
-boost/posix_time/operat_1_3_12_15_5_3_2_1_5.html
-boost/posix_time/operat_1_3_12_15_5_3_2_1_6.html
-boost/posix_time/operat_1_3_12_15_5_3_2_1_7.html
-boost/posix_time/operat_1_3_12_15_5_3_2_1_8.html
+boost/posix_time/operat_1_3_13_15_5_3_2_1_1.html
+boost/posix_time/operat_1_3_13_15_5_3_2_1_2.html
+boost/posix_time/operat_1_3_13_15_5_3_2_1_3.html
+boost/posix_time/operat_1_3_13_15_5_3_2_1_4.html
+boost/posix_time/operat_1_3_13_15_5_3_2_1_5.html
+boost/posix_time/operat_1_3_13_15_5_3_2_1_6.html
+boost/posix_time/operat_1_3_13_15_5_3_2_1_7.html
+boost/posix_time/operat_1_3_13_15_5_3_2_1_8.html
 boost/posix_time/time_duration.html
 boost/posix_time/simple_time_rep.html
 boost/posix_time/posix_time_system_config.html
-boost/posix_time/millis_1_3_12_15_5_5_1_1_4.html
+boost/posix_time/millis_1_3_13_15_5_5_1_1_4.html
 boost/posix_time/hours.html
 boost/posix_time/minutes.html
 boost/posix_time/seconds.html
 boost/posix_time/wtime_facet.html
-boost/posix_time/operat_1_3_12_15_5_8_1_1_6.html
+boost/posix_time/operat_1_3_13_15_5_8_1_1_6.html
 boost/posix_time/ptime.html
 boost/posix_time/duration_from_string.html
-BOOST_SER_1_3_12_15_5_16_1.html
-load_1_3_12_15_5_16_2.html
-save_1_3_12_15_5_16_3.html
-load_1_3_12_15_5_16_4.html
-save_1_3_12_15_5_16_6.html
-load_1_3_12_15_5_16_7.html
+BOOST_SER_1_3_13_15_5_16_1.html
+load_td.html
+save_1_3_13_15_5_16_5.html
+load_1_3_13_15_5_16_6.html
+save_1_3_13_15_5_16_8.html
+load_1_3_13_15_5_16_9.html
 boost/local_time/custom_time_zone_base.html
-boost/local_time/operat_1_3_12_15_6_4_2_1_1.html
-boost/local_time/operat_1_3_12_15_6_4_2_1_2.html
-boost/local_time/operat_1_3_12_15_6_4_2_1_3.html
-boost/local_time/operat_1_3_12_15_6_4_2_1_4.html
-boost/local_time/operat_1_3_12_15_6_4_2_1_5.html
-boost/local_time/operat_1_3_12_15_6_4_2_1_6.html
-boost/local_time/operat_1_3_12_15_6_4_2_1_7.html
-boost/local_time/operat_1_3_12_15_6_4_2_1_8.html
+boost/local_time/operat_1_3_13_15_6_4_2_1_1.html
+boost/local_time/operat_1_3_13_15_6_4_2_1_2.html
+boost/local_time/operat_1_3_13_15_6_4_2_1_3.html
+boost/local_time/operat_1_3_13_15_6_4_2_1_4.html
+boost/local_time/operat_1_3_13_15_6_4_2_1_5.html
+boost/local_time/operat_1_3_13_15_6_4_2_1_6.html
+boost/local_time/operat_1_3_13_15_6_4_2_1_7.html
+boost/local_time/operat_1_3_13_15_6_4_2_1_8.html
 boost/local_time/partial_date_rule_spec.html
 boost/local_time/first_last_rule_spec.html
 boost/local_time/last_last_rule_spec.html
@@ -1149,8 +1195,8 @@ boost_dll/tutorial.html
 boost_dll/mangled_import.html
 boost_dll/missuses.html
 boost_dll/reference.html
-BOOST_DLL_FORC_idp27662112.html
-BOOST_DLL_FORC_idp27664016.html
+BOOST_DLL_FORC_idp36961376.html
+BOOST_DLL_FORC_idp36963232.html
 BOOST_DLL_SELECTANY.html
 BOOST_DLL_SECTION.html
 BOOST_DLL_ALIAS.html
@@ -1164,12 +1210,12 @@ boost/dll/program_location.html
 boost/dll/shared_library.html
 boost/dll/load_mode/type.html
 boost/dll/experimental/smart_library.html
-boost/dll/experimental/get_idp28753888.html
-boost/dll/experimental/get_idp28770608.html
+boost/dll/experimental/get_idp38057568.html
+boost/dll/experimental/get_idp38074288.html
 boost/dll/import.html
 boost/dll/import_alias.html
 boost/dll/experimental/imported_class.html
-boost/dll/experimental/import_class_idp28282208.html
+boost/dll/experimental/import_class_idp37573920.html
 boost/dll/experimental/import_mangled.html
 boost_dll/limitations.html
 boost_dll/f_a_q_.html
@@ -1196,42 +1242,6 @@ boost/function_equal.html
 function/faq.html
 function/misc.html
 function/testsuite.html
-hash.html
-hash/tutorial.html
-hash/custom.html
-hash/combine.html
-hash/portability.html
-hash/disable.html
-hash/changes.html
-hash/rationale.html
-hash/reference.html
-boost/hash.html
-boost/hash_bool_1_3_16_11_2_2_2.html
-boost/hash_char_1_3_16_11_2_2_3.html
-boost/hash_signe_1_3_16_11_2_2_4.html
-boost/hash_unsig_1_3_16_11_2_2_5.html
-boost/hash_wchar_1_3_16_11_2_2_6.html
-boost/hash_char1_1_3_16_11_2_2_7.html
-boost/hash_char3_1_3_16_11_2_2_8.html
-boost/hash_short_1_3_16_11_2_2_9.html
-boost/hash_unsi_1_3_16_11_2_2_10.html
-boost/hash_int_1_3_16_11_2_2_11.html
-boost/hash_unsi_1_3_16_11_2_2_12.html
-boost/hash_long_1_3_16_11_2_2_13.html
-boost/hash_unsi_1_3_16_11_2_2_14.html
-boost/hash_long_1_3_16_11_2_2_15.html
-boost/hash_unsi_1_3_16_11_2_2_16.html
-boost/hash_floa_1_3_16_11_2_2_17.html
-boost/hash_doub_1_3_16_11_2_2_18.html
-boost/hash_long_1_3_16_11_2_2_19.html
-boost/hash_std__1_3_16_11_2_2_20.html
-boost/hash_std__1_3_16_11_2_2_21.html
-boost/hash_std__1_3_16_11_2_2_22.html
-boost/hash_std__1_3_16_11_2_2_23.html
-boost/hash_T_1_3_16_11_2_2_24.html
-boost/hash_std__1_3_16_11_2_2_25.html
-hash/links.html
-hash/acknowledgements.html
 heap.html
 heap/concepts.html
 heap/data_structures.html
@@ -1255,6 +1265,8 @@ boost/heap/arity.html
 boost/heap/priority_queue.html
 boost/heap/skew_heap.html
 boost/heap/skew_heap/implementation_defined.html
+boost/heap/skew_heap/push_handle.html
+boost/heap/skew_heap/push_void.html
 heap/acknowledgements.html
 interprocess.html
 interprocess/quick_guide.html
@@ -1273,32 +1285,32 @@ interprocess/acknowledgements_notes.html
 interprocess/indexes_reference.html
 boost/interprocess/adaptive_pool.html
 boost/interprocess/adaptive_pool/rebind.html
-boost/interprocess/operator___idp54401248.html
-boost/interprocess/operator___idp54409520.html
+boost/interprocess/operator___idp38496176.html
+boost/interprocess/operator___idp38504448.html
 boost/interprocess/allocator.html
 boost/interprocess/allocator/rebind.html
-boost/interprocess/operator___idp54489968.html
-boost/interprocess/operator___idp54494944.html
+boost/interprocess/operator___idp38584608.html
+boost/interprocess/operator___idp38589584.html
 boost/interprocess/cached_adaptive_pool.html
 boost/interprocess/cached_adaptive_pool/rebind.html
-boost/interprocess/operator___idp54596912.html
-boost/interprocess/operator___idp54605200.html
+boost/interprocess/operator___idp38691552.html
+boost/interprocess/operator___idp38699840.html
 boost/interprocess/cached_node_allocator.html
 boost/interprocess/cached_node_allocator/rebind.html
-boost/interprocess/operator___idp54704144.html
-boost/interprocess/operator___idp54710704.html
+boost/interprocess/operator___idp38798784.html
+boost/interprocess/operator___idp38805344.html
 boost/interprocess/node_allocator.html
 boost/interprocess/node_allocator/rebind.html
-boost/interprocess/operator___idp54804064.html
-boost/interprocess/operator___idp54810608.html
+boost/interprocess/operator___idp38898704.html
+boost/interprocess/operator___idp38905248.html
 boost/interprocess/private_adaptive_pool.html
 boost/interprocess/private_adaptive_pool/rebind.html
-boost/interprocess/operator___idp54910016.html
-boost/interprocess/operator___idp54918304.html
+boost/interprocess/operator___idp39004656.html
+boost/interprocess/operator___idp39012944.html
 boost/interprocess/private_node_allocator.html
 boost/interprocess/private_node_allocator/rebind.html
-boost/interprocess/operator___idp55015136.html
-boost/interprocess/operator___idp55023424.html
+boost/interprocess/operator___idp39109776.html
+boost/interprocess/operator___idp39118064.html
 boost/interprocess/anonymous_shared_memory.html
 boost/interprocess/allocate_new.html
 boost/interprocess/expand_fwd.html
@@ -1330,7 +1342,7 @@ boost/interprocess/null_index.html
 boost/interprocess/unordered_map_index.html
 boost/interprocess/message_queue_t.html
 boost/interprocess/message_queue.html
-boost/interprocess/basic_managed__idp55379840.html
+boost/interprocess/basic_managed__idp39474400.html
 boost/interprocess/managed_external_buffer.html
 boost/interprocess/wmanaged_external_buffer.html
 boost/interprocess/basic_managed_heap_memory.html
@@ -1339,15 +1351,15 @@ boost/interprocess/wmanaged_heap_memory.html
 boost/interprocess/basic_managed_mapped_file.html
 boost/interprocess/managed_mapped_file.html
 boost/interprocess/wmanaged_mapped_file.html
-boost/interprocess/basic_managed__idp55488352.html
+boost/interprocess/basic_managed__idp39582912.html
 boost/interprocess/managed_shared_memory.html
 boost/interprocess/wmanaged_shared_memory.html
-boost/interprocess/fixed_managed__idp55536416.html
-boost/interprocess/wfixed_managed_idp55540144.html
-boost/interprocess/basic_managed__idp55546096.html
-boost/interprocess/managed_window_idp55585168.html
-boost/interprocess/wmanaged_windo_idp55588880.html
-boost/interprocess/basic_managed__idp55594816.html
+boost/interprocess/fixed_managed__idp39630976.html
+boost/interprocess/wfixed_managed_idp39634704.html
+boost/interprocess/basic_managed__idp39640656.html
+boost/interprocess/managed_window_idp39679728.html
+boost/interprocess/wmanaged_windo_idp39683440.html
+boost/interprocess/basic_managed__idp39689376.html
 boost/interprocess/managed_xsi_shared_memory.html
 boost/interprocess/wmanaged_xsi_shared_memory.html
 boost/interprocess/mapped_region.html
@@ -1355,8 +1367,8 @@ boost/interprocess/mapped_region/advice_types.html
 boost/interprocess/rbtree_best_fit.html
 boost/interprocess/simple_seq_fit.html
 boost/interprocess/offset_ptr.html
-boost/interprocess/operator_idp55877088.html
-boost/interprocess/operator_idp55884000.html
+boost/interprocess/operator_idp39971568.html
+boost/interprocess/operator_idp39978480.html
 boost/interprocess/permissions.html
 boost/interprocess/segment_manager_base.html
 boost/interprocess/segment_manager.html
@@ -1365,23 +1377,23 @@ boost/interprocess/segment_manager/deleter.html
 boost/interprocess/shared_memory_object.html
 boost/interprocess/deleter.html
 boost/interprocess/intrusive_ptr.html
-boost/interprocess/operator___idp56174768.html
-boost/interprocess/operator___idp56179984.html
-boost/interprocess/operator___idp56185200.html
-boost/interprocess/operator___idp56190000.html
-boost/interprocess/operator___idp56194800.html
-boost/interprocess/operator___idp56199600.html
-boost/interprocess/operator_idp56204400.html
-boost/interprocess/swap_idp56209056.html
-boost/interprocess/to_raw_pointer_idp56218800.html
+boost/interprocess/operator___idp40278064.html
+boost/interprocess/operator___idp40283280.html
+boost/interprocess/operator___idp40288496.html
+boost/interprocess/operator___idp40293296.html
+boost/interprocess/operator___idp40298096.html
+boost/interprocess/operator___idp40302896.html
+boost/interprocess/operator_idp40307696.html
+boost/interprocess/swap_idp40312352.html
+boost/interprocess/to_raw_pointer_idp40322096.html
 boost/interprocess/scoped_ptr.html
-boost/interprocess/swap_idp56259376.html
-boost/interprocess/to_raw_pointer_idp56264768.html
+boost/interprocess/swap_idp40362672.html
+boost/interprocess/to_raw_pointer_idp40368064.html
 boost/interprocess/enable_shared_from_this.html
 boost/interprocess/shared_ptr.html
 boost/interprocess/managed_shared_ptr.html
-boost/interprocess/make_managed_s_idp56405680.html
-boost/interprocess/make_managed_s_idp56410192.html
+boost/interprocess/make_managed_s_idp40508976.html
+boost/interprocess/make_managed_s_idp40513488.html
 boost/interprocess/managed_unique_ptr.html
 boost/interprocess/make_managed_unique_ptr.html
 boost/interprocess/weak_ptr.html
@@ -1399,10 +1411,10 @@ boost/interprocess/file_lock.html
 boost/interprocess/interprocess_condition.html
 boost/interprocess/interprocess_condition_any.html
 boost/interprocess/interprocess_mutex.html
-boost/interprocess/interprocess_r_idp56793568.html
+boost/interprocess/interprocess_r_idp40896864.html
 boost/interprocess/interprocess_semaphore.html
-boost/interprocess/interprocess_s_idp56838960.html
-boost/interprocess/interprocess_u_idp56869776.html
+boost/interprocess/interprocess_s_idp40942256.html
+boost/interprocess/interprocess_u_idp40973072.html
 boost/interprocess/defer_lock_type.html
 boost/interprocess/try_to_lock_type.html
 boost/interprocess/accept_ownership_type.html
@@ -1540,31 +1552,31 @@ boost/intrusive/cache_begin.html
 boost/intrusive/compare_hash.html
 boost/intrusive/incremental.html
 boost/intrusive/pack_options.html
-BOOST_INTRUSIV_idp55099840.html
-BOOST_INTRUSIV_idp55106064.html
-boost/intrusive/get_parent_fro_idp55114128.html
-boost/intrusive/get_parent_fro_idp55118400.html
+BOOST_INTRUSIV_idp55880560.html
+BOOST_INTRUSIV_idp55886784.html
+boost/intrusive/get_parent_fro_idp55894848.html
+boost/intrusive/get_parent_fro_idp55899120.html
 boost/intrusive/max_pointer_plus_bits.html
-boost/intrusive/max_pointer_pl_idp55128640.html
+boost/intrusive/max_pointer_pl_idp55909360.html
 boost/intrusive/pointer_plus_bits.html
-boost/intrusive/pointer_plus_b_idp55135712.html
+boost/intrusive/pointer_plus_b_idp55916432.html
 boost/intrusive/pointer_has_rebind.html
 boost/intrusive/pointer_has_rebind/any.html
 boost/intrusive/pointer_has_rebind_other.html
 boost/intrusive/pointer_has_rebind_other/any.html
 boost/intrusive/pointer_rebind_mode.html
 boost/intrusive/pointer_rebinder.html
-boost/intrusive/pointer_rebind_idp55187168.html
-boost/intrusive/pointer_rebind_idp55190832.html
-boost/intrusive/pointer_rebind_idp55194496.html
-boost/intrusive/pointer_rebind_idp55200144.html
+boost/intrusive/pointer_rebind_idp55967888.html
+boost/intrusive/pointer_rebind_idp55971552.html
+boost/intrusive/pointer_rebind_idp55975216.html
+boost/intrusive/pointer_rebind_idp55980864.html
 boost/intrusive/pointer_rebind.html
-boost/intrusive/pointer_rebind_idp55207392.html
+boost/intrusive/pointer_rebind_idp55988112.html
 boost/intrusive/pointer_traits.html
-boost/intrusive/pointer_traits_idp55252544.html
-boost/intrusive/pointer_traits_idp55252544/rebind_pointer.html
+boost/intrusive/pointer_traits_idp56033264.html
+boost/intrusive/pointer_traits_idp56033264/rebind_pointer.html
 boost/intrusive/priority_compare.html
-boost/intrusive/priority_compa_idp55286240.html
+boost/intrusive/priority_compa_idp56066960.html
 boost/intrusive/rbtree.html
 boost/intrusive/make_rbtree.html
 boost/intrusive/rbtree_algorithms.html
@@ -1610,9 +1622,9 @@ boost/intrusive/unordered_set.html
 boost/intrusive/make_unordered_set.html
 boost/intrusive/unordered_multiset.html
 boost/intrusive/make_unordered_multiset.html
-boost/intrusive/make_unordered_idp65807072.html
+boost/intrusive/make_unordered_idp66587792.html
 boost/intrusive/unordered_set_base_hook.html
-boost/intrusive/make_unordered_idp65862816.html
+boost/intrusive/make_unordered_idp66643536.html
 boost/intrusive/unordered_set_member_hook.html
 lambda.html
 lambda/getting_started.html
@@ -1639,6 +1651,7 @@ boost/lockfree/capacity.html
 boost/lockfree/allocator.html
 boost/lockfree/queue.html
 boost/lockfree/spsc_queue.html
+boost/lockfree/spsc_queue/implementation_defined.html
 boost/lockfree/stack.html
 boost/lockfree/stack/implementation_defined.html
 boost/lockfree/stack/node.html
@@ -1651,15 +1664,15 @@ boost/logic/tribool/value_t.html
 boost/logic/indeterminate.html
 boost/logic/operator_.html
 boost/logic/operator__.html
-boost/logic/operator_idp39616176.html
+boost/logic/operator_idp31661568.html
 boost/logic/operator__.html
 boost/logic/operator__.html
 BOOST_TRIBOOL_THIRD_STATE.html
 boost/logic/indeterminate_name.html
-boost/logic/get_default_in_idp39719728.html
-boost/logic/operator_idp39725328.html
-boost/logic/operator_idp39733888.html
-boost/logic/operator_idp39740160.html
+boost/logic/get_default_in_idp31765120.html
+boost/logic/operator_idp31770720.html
+boost/logic/operator_idp31779280.html
+boost/logic/operator_idp31785552.html
 tribool/tests.html
 metaparse.html
 metaparse/related_publications_and_blogs.html
@@ -1763,13 +1776,17 @@ boost/move_if_n_1_3_25_20_16_2_4.html
 mpi.html
 mpi/getting_started.html
 mpi/tutorial.html
-mpi/reference.html
 boost/mpi/allocator.html
 boost/mpi/allocator/rebind.html
-boost/mpi/allocator_1_3_26_6_2_2_1_2.html
-boost/mpi/allocator_1_3_26_6_2_2_1_2/rebind.html
-boost/mpi/operator__1_3_26_6_2_2_1_3.html
-boost/mpi/operator__1_3_26_6_2_2_1_4.html
+boost/mpi/alloca_1_3_26_5_14_2_2_1_2.html
+boost/mpi/alloca_1_3_26_5_14_2_2_1_2/rebind.html
+boost/mpi/operat_1_3_26_5_14_2_2_1_3.html
+boost/mpi/operat_1_3_26_5_14_2_2_1_4.html
+boost/mpi/cartesian_dimension.html
+boost/mpi/is_mpi_1_3_26_5_14_3_2_1_2.html
+boost/mpi/cartesian_topology.html
+boost/mpi/cartesian_communicator.html
+boost/mpi/cartesian_dimensions.html
 boost/mpi/all_gather.html
 boost/mpi/all_reduce.html
 boost/mpi/all_to_all.html
@@ -1784,43 +1801,43 @@ boost/mpi/communicator.html
 boost/mpi/comm_create_kind.html
 boost/mpi/any_source.html
 boost/mpi/any_tag.html
-boost/mpi/operator__1_3_26_6_5_2_1_5.html
-boost/mpi/operator__1_3_26_6_5_2_1_6.html
+boost/mpi/operat_1_3_26_5_14_6_2_1_5.html
+boost/mpi/operat_1_3_26_5_14_6_2_1_6.html
 MPICH_IGNORE_CXX_SEEK.html
 BOOST_MPI_HOMOGENEOUS.html
-BOOST_MPI_HAS_1_3_26_6_6_4.html
-BOOST_MPI_HAS_1_3_26_6_6_5.html
-BOOST_MPI_CAL_1_3_26_6_6_6.html
-BOOST_MPI_BCA_1_3_26_6_6_7.html
+BOOST_MPI__1_3_26_5_14_7_4.html
+BOOST_MPI__1_3_26_5_14_7_5.html
+BOOST_MPI__1_3_26_5_14_7_6.html
+BOOST_MPI__1_3_26_5_14_7_7.html
 BOOST_MPI_DECL.html
 boost/mpi/is_mpi_integer_datatype.html
-boost/mpi/is_mpi_fl_1_3_26_6_7_2_1_2.html
+boost/mpi/is_mpi_1_3_26_5_14_8_2_1_2.html
 boost/mpi/is_mpi_logical_datatype.html
 boost/mpi/is_mpi_complex_datatype.html
 boost/mpi/is_mpi_byte_datatype.html
 boost/mpi/is_mpi_builtin_datatype.html
 boost/mpi/is_mpi_datatype.html
-boost/mpi/get_mpi_d_1_3_26_6_7_2_1_8.html
+boost/mpi/get_mp_1_3_26_5_14_8_2_1_8.html
 BOOST_IS_MPI_DATATYPE.html
 boost/mpi/packed.html
 boost/mpi/threading/level.html
-boost/mpi/threading/operato_1_3_26_6_9_2_1_2_2.html
-boost/mpi/threading/operato_1_3_26_6_9_2_1_2_3.html
+boost/mpi/threading/ope_1_3_26_5_14_10_2_1_2_2.html
+boost/mpi/threading/ope_1_3_26_5_14_10_2_1_2_3.html
 boost/mpi/environment.html
 boost/mpi/exception.html
 BOOST_MPI_CHECK_RESULT.html
 boost/mpi/graph_communicator.html
-boost/mpi/get_1_3_26_6_11_2_2_11.html
-boost/mpi/get_1_3_26_6_11_2_2_12.html
-boost/graph_trai_1_3_26_6_11_2_1.html
+boost/mpi/get_1_3_26_5_14_12_2_2_11.html
+boost/mpi/get_1_3_26_5_14_12_2_2_12.html
+boost/graph_t_1_3_26_5_14_12_2_1.html
 boost/mpi/group.html
-boost/mpi/operator_1_3_26_6_12_2_1_2.html
-boost/mpi/operator_1_3_26_6_12_2_1_3.html
-boost/mpi/operator_1_3_26_6_12_2_1_4.html
+boost/mpi/opera_1_3_26_5_14_13_2_1_2.html
+boost/mpi/opera_1_3_26_5_14_13_2_1_3.html
+boost/mpi/opera_1_3_26_5_14_13_2_1_4.html
 boost/mpi/operator_.html
 boost/mpi/operator-.html
 boost/mpi/inplace_t.html
-boost/mpi/inplace__1_3_26_6_13_2_1_2.html
+boost/mpi/inpla_1_3_26_5_14_14_2_1_2.html
 boost/mpi/inplace.html
 boost/mpi/intercommunicator.html
 boost/mpi/wait_any.html
@@ -1840,7 +1857,7 @@ boost/mpi/bitwise_xor.html
 boost/mpi/packed_iarchive.html
 boost/mpi/packed_oarchive.html
 boost/mpi/python/register_serialized.html
-boost/mpi/python/regist_1_3_26_6_19_2_1_1_2.html
+boost/mpi/python/reg_1_3_26_5_14_20_2_1_1_2.html
 boost/mpi/request.html
 boost/mpi/skeleton_proxy.html
 boost/mpi/content.html
@@ -1850,7 +1867,6 @@ boost/mpi/skeleton.html
 boost/mpi/get_content.html
 boost/mpi/status.html
 boost/mpi/timer.html
-mpi/python.html
 multi_array.html
 MultiArray.html
 array_types.html
@@ -1938,6 +1954,7 @@ boost/process/windows/minimized_not_active.html
 boost/process/windows/not_active.html
 boost/process/windows/show.html
 boost/process/windows/show_normal.html
+boost/process/windows/create_no_window.html
 boost_process/acknowledgements.html
 program_options.html
 program_options/tutorial.html
@@ -2709,17 +2726,19 @@ boost_typeerasure/examples.html
 boost_typeerasure/conceptdef.html
 boost_typeerasure/predef.html
 boost_typeerasure/reference.html
-boost/type_erasure/any_Conc_1_3_41_13_1_1_1_1.html
+boost/type_erasure/any.html
 boost/type_erasure/any_Conc_1_3_41_13_1_1_1_2.html
 boost/type_erasure/any_Conc_1_3_41_13_1_1_1_3.html
+boost/type_erasure/any_Conc_1_3_41_13_1_1_1_4.html
 boost/type_erasure/any_cast.html
+boost/type_erasure/binding.html
 boost/type_erasure/binding_of.html
 boost/type_erasure/destructible.html
 boost/type_erasure/copy_constructible.html
 boost/type_erasure/assignable.html
+boost/type_erasure/typeid_.html
 boost/type_erasure/call.html
 boost/type_erasure/callable.html
-boost/type_erasure/typeid_.html
 boost/type_erasure/check_match.html
 boost/type_erasure/concept_interface.html
 boost/type_erasure/concept_of.html
@@ -2772,6 +2791,7 @@ boost/type_erasure/less_than_comparable.html
 boost/type_erasure/subscriptable.html
 boost/type_erasure/ostreamable.html
 boost/type_erasure/istreamable.html
+boost/type_erasure/param.html
 boost/type_erasure/as_param.html
 boost/type_erasure/placeholder.html
 boost/type_erasure/_a.html
@@ -2782,14 +2802,11 @@ boost/type_erasure/_e.html
 boost/type_erasure/_f.html
 boost/type_erasure/_g.html
 boost/type_erasure/_self.html
-boost/type_erasure/param.html
 boost/type_erasure/placeholder_of.html
-boost/type_erasure/any.html
 boost/type_erasure/rebind_any.html
 boost/type_erasure/register_binding.html
 boost/type_erasure/is_relaxed.html
 boost/type_erasure/relaxed.html
-boost/type_erasure/binding.html
 boost/type_erasure/require_match.html
 boost/type_erasure/same_type.html
 boost/type_erasure/static_binding.html
diff --git a/doc/html/foreach.html b/doc/html/foreach.html
index 8e200a70c3..e0309a2fe1 100644
--- a/doc/html/foreach.html
+++ b/doc/html/foreach.html
@@ -2,7 +2,7 @@
 
-Chapter 13. Boost.Foreach
+Chapter 14. Boost.Foreach
@@ -26,7 +26,7 @@
 
    
 
    
 
    
-Chapter 13. Boost.Foreach
    
+Chapter 14. Boost.Foreach
    
 
    
 Eric Niebler
 
    
@@ -304,7 +304,7 @@
 
    
 
    
 
 

 
 
 
 
 
 
    
-
+
    Last revised: December 14, 2017 at 00:08:10 GMT
    Last revised: April 11, 2018 at 14:10:08 GMT
    		
 
    		
 
    
 
    
diff --git a/doc/html/foreach/extensibility.html b/doc/html/foreach/extensibility.html
index d87337129b..e41fe48377 100644
--- a/doc/html/foreach/extensibility.html
+++ b/doc/html/foreach/extensibility.html
@@ -6,8 +6,8 @@
 
 
 
-
-
+
+
 
 
 
diff --git a/doc/html/foreach/history_and_acknowledgements.html b/doc/html/foreach/history_and_acknowledgements.html
index ff4e34df42..84bcca0298 100644
--- a/doc/html/foreach/history_and_acknowledgements.html
+++ b/doc/html/foreach/history_and_acknowledgements.html
@@ -6,9 +6,9 @@
 
 
 
-
+
 
-
+
 
 
 
diff --git a/doc/html/foreach/pitfalls.html b/doc/html/foreach/pitfalls.html
index f43860930c..0056ccca3d 100644
--- a/doc/html/foreach/pitfalls.html
+++ b/doc/html/foreach/pitfalls.html
@@ -6,7 +6,7 @@
 
-
+
diff --git a/doc/html/foreach/portability.html b/doc/html/foreach/portability.html
index a7c3d35658..1ca4b8a507 100644
--- a/doc/html/foreach/portability.html
+++ b/doc/html/foreach/portability.html
@@ -6,7 +6,7 @@
 
-
+
@@ -45,7 +45,7 @@
       defines three levels of compliance, described below:
     
    
-
    Table 13.1. BOOST_FOREACH Compliance Levels
    
+
    Table 14.1. BOOST_FOREACH Compliance Levels
    
 
    
 
 
 
 
 
 
 
 
 
 
 
    @@ -117,7 +117,7 @@
       for them.
     
    
-
    Table 13.2. Compiler Compliance Level
    
+
    Table 14.2. Compiler Compliance Level
    
 
    
 
 

 
    diff --git a/doc/html/function.html b/doc/html/function.html
index 7b8311fa21..623c775175 100644
--- a/doc/html/function.html
+++ b/doc/html/function.html
@@ -2,7 +2,7 @@
 
-Chapter 14. Boost.Function
+Chapter 15. Boost.Function
@@ -26,7 +26,7 @@
 
    
 
    
 
    
-Chapter 14. Boost.Function
    
+Chapter 15. Boost.Function
    
 
    
 
    
 Douglas Gregor
@@ -35,7 +35,7 @@
 
    
 
    Copyright © 2001-2004 Douglas Gregor
    
 
    
-
    Use, modification and distribution is subject to the Boost
+
    Use, modification and distribution is subject to the Boost
     Software License, Version 1.0. (See accompanying file
     LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
    
 
    
@@ -47,11 +47,11 @@
 
    History & Compatibility Notes
    
 
    Tutorial
    
 
    
-
    Basic Usage
    
-
    Free functions
    
-
    Member functions
    
-
    References to Function Objects
    
-
    Comparing Boost.Function function objects
    
+
    Basic Usage
    
+
    Free functions
    
+
    Member functions
    
+
    References to Function Objects
    
+
    Comparing Boost.Function function objects
    
 
    
 
    Reference
    
 
    
@@ -62,10 +62,10 @@
 
    Frequently Asked Questions
    
 
    Miscellaneous Notes
    
 
    
-
    Boost.Function vs. Function Pointers
    
-
    Performance
    
-
    Combatting virtual function "bloat"
    
-
    Acknowledgements
    
+
    Boost.Function vs. Function Pointers
    
+
    Performance
    
+
    Combatting virtual function "bloat"
    
+
    Acknowledgements
    
 
    
 
    Testsuite
    
 
    
diff --git a/doc/html/function/faq.html b/doc/html/function/faq.html
index 308c3ec1c5..75842b48f4 100644
--- a/doc/html/function/faq.html
+++ b/doc/html/function/faq.html
@@ -6,7 +6,7 @@
 
 
 
-
+
 
 
 
@@ -27,19 +27,19 @@
 
    
 Frequently Asked Questions
    
 
    
-
    
-
    1. Why can't I compare
+
    
+
    1. Why can't I compare
     boost::function objects with
     operator== or
     operator!=?
 
    
-
    2. I see void pointers; is this [mess] type safe?
+
    2. I see void pointers; is this [mess] type safe?
 
    
-
    3. Why are there workarounds for void returns? C++ allows them!
+
    3. Why are there workarounds for void returns? C++ allows them!
 
    
-
    4. Why (function) cloning?
+
    4. Why (function) cloning?
 
    
-
    5. How much overhead does a call through boost::function incur?
+
    5. How much overhead does a call through boost::function incur?
 
    
 
    
 
    
 
 

 
 
 
 
 
    
@@ -50,7 +50,7 @@
 
@@ -147,7 +147,7 @@ invoke a function pointer with the wrong type).  
    
@@ -174,7 +174,7 @@ function objects with parameters that don't exactly match.
    
@@ -188,7 +188,7 @@ function objects with parameters that don't exactly match.
    
diff --git a/doc/html/function/history.html b/doc/html/function/history.html
index e1efb42532..874d2ae1b5 100644
--- a/doc/html/function/history.html
+++ b/doc/html/function/history.html
@@ -6,8 +6,8 @@
 
-
-
+
+
@@ -42,7 +42,7 @@
       contributed by Niels Dekker.
  • Added a new header <boost/function/function_typeof.hpp> that provides support for using the Boost.Typeof library on Boost.Function objects.
  • Added a new header <boost/function/function_fwd.hpp> that provides support for using the Boost.Typeof library on Boost.Function objects.
    • 
-
  • The target()
+
  • The target()
       function now respects the cv-qualifiers of function objects
       stored by reference
       (using boost::reference_wrapper), such
@@ -77,9 +77,9 @@
 
  • boost::function
       and boost::functionN objects
       can be assigned to 0 (semantically equivalent to calling
-      clear()) and
+      clear()) and
       compared against 0 (semantically equivalent to calling
-      empty()).
    • 
+      empty()).
  • The Boost.Function code is now generated
       entirely by the Preprocessor library,
       so it is now possible to generate
diff --git a/doc/html/function/misc.html b/doc/html/function/misc.html
index 93781ad610..a6e6c48bfd 100644
--- a/doc/html/function/misc.html
+++ b/doc/html/function/misc.html
@@ -6,7 +6,7 @@
 
 
 
-
+
 
 
 
@@ -27,14 +27,14 @@
 
    
 Miscellaneous Notes
    
 
    
-
    Boost.Function vs. Function Pointers
    
-
    Performance
    
-
    Combatting virtual function "bloat"
    
-
    Acknowledgements
    
+
    Boost.Function vs. Function Pointers
    
+
    Performance
    
+
    Combatting virtual function "bloat"
    
+
    Acknowledgements
    
 
    
 
    
 
    
-Boost.Function vs. Function Pointers
    
+Boost.Function vs. Function Pointers
    
 
    Boost.Function has several advantages over function pointers, namely:
 
 
    
@@ -57,37 +57,37 @@
 
 
    
 
    
-Performance
    
+Performance
    
 
    
-
    Function object wrapper size
    
-
    Copying efficiency
    
-
    Invocation efficiency
    
+
    Function object wrapper size
    
+
    Copying efficiency
    
+
    Invocation efficiency
    
 
    
 
    
 
    
-Function object wrapper size
    
+Function object wrapper size
    
 
     Function object wrappers will be the size of a struct containing a member function pointer and two data pointers. The actual size can vary significantly depending on the underlying platform; on 32-bit Mac OS X with GCC, this amounts to 16 bytes, while it is 32 bytes Windows with Visual C++. Additionally, the function object target may be allocated on the heap, if it cannot be placed into the small-object buffer in the boost::function object.
    
 
 
    
 
    
-Copying efficiency
    
+Copying efficiency
    
 
     Copying function object wrappers may require allocating memory for a copy of the function object target. The default allocator may be replaced with a faster custom allocator or one may choose to allow the function object wrappers to only store function object targets by reference (using ref) if the cost of this cloning becomes prohibitive. Small function objects can be stored within the boost::function object itself, improving copying efficiency.
    
 
 
    
 
    
-Invocation efficiency
    
+Invocation efficiency
    
 
     With a properly inlining compiler, an invocation of a function object requires one call through a function pointer. If the call is to a free function pointer, an additional call must be made to that function pointer (unless the compiler has very powerful interprocedural analysis).
    
 
 
 
    
 
    
-Combatting virtual function "bloat"
    
+Combatting virtual function "bloat"
    
 
     The use of virtual functions tends to cause 'code bloat' on many compilers. When a class contains a virtual function, it is necessary to emit an additional function that classifies the type of the object. It has been our experience that these auxiliary functions increase the size of the executable significantly when many boost::function objects are used. 
    
 
     In Boost.Function, an alternative but equivalent approach was taken using free functions instead of virtual functions. The Boost.Function object essentially holds two pointers to make a valid target call: a void pointer to the function object it contains and a void pointer to an "invoker" that can call the function object, given the function pointer. This invoker function performs the argument and return value conversions Boost.Function provides. A third pointer points to a free function called the "manager", which handles the cloning and destruction of function objects. The scheme is typesafe because the only functions that actually handle the function object, the invoker and the manager, are instantiated given the type of the function object, so they can safely cast the incoming void pointer (the function object pointer) to the appropriate type.
    
 
 
    
 
    
-Acknowledgements
    
+Acknowledgements
    
 
     Many people were involved in the construction of this
     library. William Kempf, Jesse Jones and Karl Nelson were all
     extremely helpful in isolating an interface and scope for the
diff --git a/doc/html/function/reference.html b/doc/html/function/reference.html
index acd0405709..38f735d37b 100644
--- a/doc/html/function/reference.html
+++ b/doc/html/function/reference.html
@@ -6,7 +6,7 @@
 
 
 
-
+
 
 
 
@@ -101,56 +101,56 @@
   template<typename T1, typename T2, ..., typename TN> 
     void swap(functionN<T1, T2, ..., TN>&, functionN<T1, T2, ..., TN>&);
   template<typename T1, typename T2, ..., typename TN, typename Functor> 
-    bool operator==(const functionN<T1, T2, ..., TN>&, Functor);
+    bool operator==(const functionN<T1, T2, ..., TN>&, Functor);
   template<typename T1, typename T2, ..., typename TN, typename Functor> 
-    bool operator==(Functor, const functionN<T1, T2, ..., TN>&);
+    bool operator==(Functor, const functionN<T1, T2, ..., TN>&);
   template<typename T1, typename T2, ..., typename TN, typename Functor> 
-    bool operator==(const functionN<T1, T2, ..., TN>&, 
+    bool operator==(const functionN<T1, T2, ..., TN>&, 
                     reference_wrapper<Functor>);
   template<typename T1, typename T2, ..., typename TN, typename Functor> 
-    bool operator==(reference_wrapper<Functor>, 
+    bool operator==(reference_wrapper<Functor>, 
                     const functionN<T1, T2, ..., TN>&);
   template<typename T1, typename T2, ..., typename TN, typename U1, 
            typename U2, ..., typename UN> 
-    void operator==(const functionN<T1, T2, ..., TN>&, 
+    void operator==(const functionN<T1, T2, ..., TN>&, 
                     const functionN<U1, U2, ..., UN>&);
   template<typename T1, typename T2, ..., typename TN, typename Functor> 
-    bool operator!=(const functionN<T1, T2, ..., TN>&, Functor);
+    bool operator!=(const functionN<T1, T2, ..., TN>&, Functor);
   template<typename T1, typename T2, ..., typename TN, typename Functor> 
-    bool operator!=(Functor, const functionN<T1, T2, ..., TN>&);
+    bool operator!=(Functor, const functionN<T1, T2, ..., TN>&);
   template<typename T1, typename T2, ..., typename TN, typename Functor> 
-    bool operator!=(const functionN<T1, T2, ..., TN>&, 
+    bool operator!=(const functionN<T1, T2, ..., TN>&, 
                     reference_wrapper<Functor>);
   template<typename T1, typename T2, ..., typename TN, typename Functor> 
-    bool operator!=(reference_wrapper<Functor>, 
+    bool operator!=(reference_wrapper<Functor>, 
                     const functionN<T1, T2, ..., TN>&);
   template<typename T1, typename T2, ..., typename TN, typename U1, 
            typename U2, ..., typename UN> 
-    void operator!=(const functionN<T1, T2, ..., TN>&, 
+    void operator!=(const functionN<T1, T2, ..., TN>&, 
                     const functionN<U1, U2, ..., UN>&);
   template<typename Signature> class function;
   template<typename Signature> 
     void swap(function<Signature>&, function<Signature>&);
   template<typename Signature, typename Functor> 
-    bool operator==(const function<Signature>&, Functor);
+    bool operator==(const function<Signature>&, Functor);
   template<typename Signature, typename Functor> 
-    bool operator==(Functor, const function<Signature>&);
+    bool operator==(Functor, const function<Signature>&);
   template<typename Signature, typename Functor> 
-    bool operator==(const function<Signature>&, reference_wrapper<Functor>);
+    bool operator==(const function<Signature>&, reference_wrapper<Functor>);
   template<typename Signature, typename Functor> 
-    bool operator==(reference_wrapper<Functor>, const function<Signature>&);
+    bool operator==(reference_wrapper<Functor>, const function<Signature>&);
   template<typename Signature1, typename Signature2> 
-    void operator==(const function<Signature1>&, const function<Signature2>&);
+    void operator==(const function<Signature1>&, const function<Signature2>&);
   template<typename Signature, typename Functor> 
-    bool operator!=(const function<Signature>&, Functor);
+    bool operator!=(const function<Signature>&, Functor);
   template<typename Signature, typename Functor> 
-    bool operator!=(Functor, const function<Signature>&);
+    bool operator!=(Functor, const function<Signature>&);
   template<typename Signature, typename Functor> 
-    bool operator!=(const function<Signature>&, reference_wrapper<Functor>);
+    bool operator!=(const function<Signature>&, reference_wrapper<Functor>);
   template<typename Signature, typename Functor> 
-    bool operator!=(reference_wrapper<Functor>, const function<Signature>&);
+    bool operator!=(reference_wrapper<Functor>, const function<Signature>&);
   template<typename Signature1, typename Signature2> 
-    void operator!=(const function<Signature1>&, const function<Signature2>&);
+    void operator!=(const function<Signature1>&, const function<Signature2>&);
 }
 
 
    
diff --git a/doc/html/function/testsuite.html b/doc/html/function/testsuite.html
index dadcb5aa91..b3eabad90d 100644
--- a/doc/html/function/testsuite.html
+++ b/doc/html/function/testsuite.html
@@ -6,9 +6,9 @@
 
 
 
-
+
 
-
+
 
 
 
    • 
 
    
 
-
    1.
    
+
    1.
    
     		
 
    Why can't I compare
     boost::function objects with
@@ -128,7 +128,7 @@
 
    
 
    
 
-
    2.
    
+
    2.
    
     		
 
    I see void pointers; is this [mess] type safe?
    		
 
    
 
 
    
 
-
    3.
    
+
    3.
    
     		
 
    Why are there workarounds for void returns? C++ allows them!
    		
 
    
 
 
    
 
-
    4.
    
+
    4.
    
     		
 
    Why (function) cloning?
    		
 
    
 
 
    
 
-
    5.
    
+
    5.
    
     		
 
    How much overhead does a call through boost::function incur?
    		
 
    
 
 
 
 
 
 
 
 
    
@@ -21,7 +21,7 @@
 
    
 
    
 
    
-PrevUpHomeNext
+PrevUpHomeNext
 
    
 
    
 
    
@@ -194,7 +194,7 @@
 
    
 
    
 
    
-PrevUpHomeNext
+PrevUpHomeNext
 
    
 
 
diff --git a/doc/html/function/tutorial.html b/doc/html/function/tutorial.html
index 36addac46f..185a66503d 100644
--- a/doc/html/function/tutorial.html
+++ b/doc/html/function/tutorial.html
@@ -6,7 +6,7 @@
 
 
 
-
+
 
 
 
@@ -27,11 +27,11 @@
 
    
 Tutorial
    
 
    
-
    Basic Usage
    
-
    Free functions
    
-
    Member functions
    
-
    References to Function Objects
    
-
    Comparing Boost.Function function objects
    
+
    Basic Usage
    
+
    Free functions
    
+
    Member functions
    
+
    References to Function Objects
    
+
    Comparing Boost.Function function objects
    
 
    
 
     Boost.Function has two syntactical forms: the preferred form
 and the portable form. The preferred form fits more closely with the
@@ -80,7 +80,7 @@ form to use for your compiler.
 
     If your compiler does not appear in this list, please try the preferred syntax and report your results to the Boost list so that we can keep this table up-to-date.
    
 
    
 
    
-Basic Usage
    
+Basic Usage
    
 
     A function wrapper is defined simply
 by instantiating the function class
 template with the desired return type and argument types, formulated
@@ -186,9 +186,9 @@ else
 
    
 
    
 
     Alternatively,
-empty()
+empty()
 method will return whether or not the wrapper is empty.  
    
-
     Finally, we can clear out a function target by assigning it to 0 or by calling the clear() member function, e.g., 
+
     Finally, we can clear out a function target by assigning it to 0 or by calling the clear() member function, e.g., 
 
    
 
    f = 0;
    
 
    
@@ -196,7 +196,7 @@ method will return whether or not the wrapper is empty.  
    
 
 
    
 
    
-Free functions
    
+Free functions
    
 
     Free function pointers can be considered singleton function objects with const function call operators, and can therefore be directly used with the function object wrappers: 
 
    
 
    float mul_ints(int x, int y) { return ((float)x) * y; }
    
@@ -209,7 +209,7 @@ method will return whether or not the wrapper is empty.  
    
 
 
    
 
    
-Member functions
    
+Member functions
    
 
     In many systems, callbacks often call to member functions of a
 particular object. This is often referred to as "argument binding",
 and is beyond the scope of Boost.Function. The use of member functions
@@ -302,7 +302,7 @@ f(5); // Call x.foo(5)
 
 
    
 
    
-References to Function Objects
    
+References to Function Objects
    
 
     In some cases it is
   expensive (or semantically incorrect) to have Boost.Function clone a
   function object. In such cases, it is possible to request that
@@ -351,7 +351,7 @@ exceptions during assignment or construction.
 
 
    
 
    
-Comparing Boost.Function function objects
    
+Comparing Boost.Function function objects
    
 
    Function object wrappers can be compared via ==
   or != against any function object that can be stored
   within the wrapper. If the function object wrapper contains a
diff --git a/doc/html/hash.html b/doc/html/hash.html
index b6c58985ba..204f2a798f 100644
--- a/doc/html/hash.html
+++ b/doc/html/hash.html
@@ -2,12 +2,12 @@
 
 
 
-Chapter 15. Boost.Functional/Hash
+Chapter 10. Boost.ContainerHash
 
 
 
 
-
+
 
 
 
@@ -21,12 +21,12 @@
 
    
 
    
 
    
-PrevUpHomeNext
+PrevUpHomeNext
 
    
 
    
 
    
 
    
-Chapter 15. Boost.Functional/Hash
    
+Chapter 10. Boost.ContainerHash
    
 
    
 Daniel James
 
    
@@ -53,7 +53,7 @@
 
    Reference
    
 
    
 
    
-
    Header <boost/functional/hash.hpp>
    
+
    Header <boost/container_hash/hash.hpp>
    
 
    
 
    Links
    
 
    Acknowledgements
    
@@ -126,12 +126,12 @@
 
    
 
    
 
-
+
    Last revised: December 14, 2017 at 00:08:10 GMT
    Last revised: April 11, 2018 at 14:10:10 GMT
    		
 
    		
 
    
 
    
 
    
-PrevUpHomeNext
+PrevUpHomeNext
 
    
 
 
diff --git a/doc/html/hash/acknowledgements.html b/doc/html/hash/acknowledgements.html
index 663943732b..374dd10e38 100644
--- a/doc/html/hash/acknowledgements.html
+++ b/doc/html/hash/acknowledgements.html
@@ -6,9 +6,9 @@
 
 
 
-
+
 
-
+
 
 
 
@@ -21,7 +21,7 @@
 
    
 
    
 
    
-PrevUpHomeNext
+PrevUpHomeNext
 
    
 
    
 
    
@@ -64,7 +64,7 @@
 
    
 
    
 
    
-PrevUpHomeNext
+PrevUpHomeNext
 
    
 
 
diff --git a/doc/html/hash/changes.html b/doc/html/hash/changes.html
index cacafe6fd0..f7485d01c2 100644
--- a/doc/html/hash/changes.html
+++ b/doc/html/hash/changes.html
@@ -6,7 +6,7 @@
 
 
 
-
+
 
 
 
@@ -55,7 +55,7 @@
         
 
  • 
           Deprecated the <boost/functional/hash/*.hpp> headers. Now a single header,
-          <boost/functional/hash.hpp>
+          <boost/functional/hash.hpp>
           is used.
         
    • 
 
  • 
@@ -177,9 +177,8 @@
           will be removed in a future version of Boost.
         
    • 
 
  • 
-          Moved detail headers out of boost/functional/detail,
-          since they are part of functional/hash, not functional. boost/functional/detail/container_fwd.hpp
-          has been moved to boost/detail/container_fwd.hpp
+          Moved detail headers out of boost/container_hash/detail,
+          since they are part of functional/hash, not container_hash. boost/container_hash/detail/container_fwd.hpp has been moved to boost/detail/container_fwd.hpp
           as it's used outside of this library, the others have been moved to boost/functional/hash/detail.
         
    • 
 
    
@@ -294,7 +293,7 @@
           when available.
         
 
  • 
-          Add deprecation warning to the long deprecated boost/functional/detail/container_fwd.hpp.
+          Add deprecation warning to the long deprecated boost/container_hash/detail/container_fwd.hpp.
         
    • 
 
    
 
    
@@ -393,7 +392,7 @@
       1.58.0
     
    
 
    
 
    
@@ -440,6 +439,44 @@
           in place for GCC, and was used when Clang pretends to be GCC, but the warning
           was appearing when running Clang in other contexts.
         
+
    
+
+      Boost
+      1.67.0
+    
    
+
      
+
    • 
+          Moved library into its own module, container_hash.
+        
      • 
+
    • 
+          Moved headers for new module name, now at: <boost/container_hash/hash.hpp>,
+          <boost/container_hash/hash_fwd.hpp>, <boost/container_hash/extensions.hpp>.
+        
      • 
+
    • 
+          Added forwarding headers to support the old headers locations.
+        
      • 
+
    • 
+          Support std::string_view, std::error_code,
+          std::error_condition std::optional,
+          std::variant, std::monostate
+          where available.
+        
      • 
+
    • 
+          Update include paths from other Boost libraries.
+        
      • 
+
    • 
+          Manually write out tuple overloads, rather than using the preprocessor
+          to generate them. Should improve usability, due to better error messages,
+          and easier debugging.
+        
      • 
+
    • 
+          Fix tutorial example (#11017).
+        
      • 
+
    • 
+          Quick fix for hashing vector<bool> when using libc++. Will try to introduce
+          a more general fix in the next release.
+        
      • 
+
    
 
 
diff --git a/doc/html/hash/combine.html b/doc/html/hash/combine.html
index d3b9bc76f5..fb936ae2bd 100644
--- a/doc/html/hash/combine.html
+++ b/doc/html/hash/combine.html
@@ -6,7 +6,7 @@
 
-
+
@@ -70,11 +70,11 @@
 
    
       Calls to hash_combine incrementally build the hash from the different members
       of point, it can be repeatedly called for any number of elements. It calls
-      hash_value on the supplied
+      hash_value on the supplied
       element, and combines it with the seed.
     
    
-      Full code for this example is at /libs/functional/hash/examples/point.cpp.
+      Full code for this example is at /libs/container_hash/examples/point.cpp.
     
    
 
 
 
 
 
 
 
 
    
@@ -106,23 +106,23 @@ If you are calculating a hash value for data
 
    
 
    
 
    
 
    
-      To calculate the hash of an iterator range you can use boost::hash_range:
+      To calculate the hash of an iterator range you can use boost::hash_range:
     
    
 
    std::vector<std::string> some_strings;
-std::size_t hash = boost::hash_range(some_strings.begin(), some_strings.end());
+std::size_t hash = boost::hash_range(some_strings.begin(), some_strings.end());
 
    
 
    
       Note that when writing template classes, you might not want to include the
       main hash header as it's quite an expensive include that brings in a lot of
-      other headers, so instead you can include the <boost/functional/hash_fwd.hpp>
+      other headers, so instead you can include the <boost/container_hash/hash_fwd.hpp>
       header which forward declares boost::hash,
-      boost::hash_range and
+      boost::hash_range and
       boost::hash_combine.
       You'll need to include the main header before instantiating boost::hash.
       When using a container that uses boost::hash
       it should do that for you, so your type will work fine with the boost hash
-      containers. There's an example of this in template.hpp
-      and template.cpp.
+      containers. There's an example of this in template.hpp
+      and template.cpp.
     
    
 
 
diff --git a/doc/html/hash/custom.html b/doc/html/hash/custom.html
index 6bb4485e71..db04c81560 100644
--- a/doc/html/hash/custom.html
+++ b/doc/html/hash/custom.html
@@ -6,7 +6,7 @@
 
-
+
@@ -29,7 +29,7 @@
 
    
       boost::hash is implemented by calling
-      the function hash_value.
+      the function hash_value.
       The namespace isn't specified so that it can detect overloads via argument
       dependant lookup. So if there is a free function hash_value
       in the same namespace as a custom type, it will get called.
@@ -90,8 +90,8 @@
 assert(books.find(dandelion) == books.end());
 
 
    
-      The full example can be found in: /libs/functional/hash/examples/books.hpp
-      and /libs/functional/hash/examples/books.cpp.
+      The full example can be found in: /libs/container_hash/examples/books.hpp
+      and /libs/container_hash/examples/books.cpp.
     
    
 
 
 
 
 
 
 
    
diff --git a/doc/html/hash/disable.html b/doc/html/hash/disable.html
index ee97db3a93..a02c77d3e8 100644
--- a/doc/html/hash/disable.html
+++ b/doc/html/hash/disable.html
@@ -6,7 +6,7 @@
 
-
+
@@ -33,7 +33,7 @@
       code will work with other implementations of TR1. To do this define the macro
       BOOST_HASH_NO_EXTENSIONS. When
       this macro is defined, only the specialisations detailed in TR1 will be declared.
-      But, if you later undefine the macro and include <boost/functional/hash.hpp>
+      But, if you later undefine the macro and include <boost/container_hash/hash.hpp>
       then the non-specialised form will be defined - activating the extensions.
     
    
diff --git a/doc/html/hash/links.html b/doc/html/hash/links.html
index 8c6d3fd0bd..4434dfc2d9 100644
--- a/doc/html/hash/links.html
+++ b/doc/html/hash/links.html
@@ -6,8 +6,8 @@
 
 
 
-
-
+
+
 
 
 
@@ -21,7 +21,7 @@
 
    
 
    
 
 
 
 
 
 
    
 
    
 
    
-PrevUpHomeNext
+PrevUpHomeNext
 
    
 
    
 
    
@@ -61,7 +61,7 @@
 
    
 
    
 
    
-PrevUpHomeNext
+PrevUpHomeNext
 
    
 
 
diff --git a/doc/html/hash/portability.html b/doc/html/hash/portability.html
index 2d42f23f11..bb90f0016f 100644
--- a/doc/html/hash/portability.html
+++ b/doc/html/hash/portability.html
@@ -6,7 +6,7 @@
 
 
 
-
+
 
 
 
@@ -117,7 +117,7 @@
 }
 
 
    
-      Full code for this example is at /libs/functional/hash/examples/portable.cpp.
+      Full code for this example is at /libs/container_hash/examples/portable.cpp.
     
    
 
 
diff --git a/doc/html/hash/rationale.html b/doc/html/hash/rationale.html
index c4f6b9e74b..ec7126e932 100644
--- a/doc/html/hash/rationale.html
+++ b/doc/html/hash/rationale.html
@@ -6,7 +6,7 @@
 
-
+
diff --git a/doc/html/hash/reference.html b/doc/html/hash/reference.html
index 2b7de45a5b..1a4ed24311 100644
--- a/doc/html/hash/reference.html
+++ b/doc/html/hash/reference.html
@@ -6,7 +6,7 @@
 
-
+
@@ -28,7 +28,7 @@
 Reference
    
 
    
-
    Header <boost/functional/hash.hpp>
    
+
    Header <boost/container_hash/hash.hpp>
    
 
    
 
    
@@ -40,7 +40,7 @@
 
    
 
    
+Header <boost/container_hash/hash.hpp>
    
       Defines boost::hash,
       and helper functions.
@@ -48,85 +48,85 @@
 
    namespace boost {
   template<typename T> struct hash;
 
-  template<> struct hash<bool>;
-  template<> struct hash<char>;
-  template<> struct hash<signed char>;
-  template<> struct hash<unsigned char>;
-  template<> struct hash<wchar_t>;
-  template<> struct hash<char16_t>;
-  template<> struct hash<char32_t>;
-  template<> struct hash<short>;
-  template<> struct hash<unsigned short>;
-  template<> struct hash<int>;
-  template<> struct hash<unsigned int>;
-  template<> struct hash<long>;
-  template<> struct hash<unsigned long>;
-  template<> struct hash<long long>;
-  template<> struct hash<unsigned long long>;
-  template<> struct hash<float>;
-  template<> struct hash<double>;
-  template<> struct hash<long double>;
-  template<> struct hash<std::string>;
-  template<> struct hash<std::wstring>;
-  template<> struct hash<std::u16string>;
-  template<> struct hash<std::u32string>;
-  template<typename T> struct hash<T*>;
-  template<> struct hash<std::type_index>;
+  template<> struct hash<bool>;
+  template<> struct hash<char>;
+  template<> struct hash<signed char>;
+  template<> struct hash<unsigned char>;
+  template<> struct hash<wchar_t>;
+  template<> struct hash<char16_t>;
+  template<> struct hash<char32_t>;
+  template<> struct hash<short>;
+  template<> struct hash<unsigned short>;
+  template<> struct hash<int>;
+  template<> struct hash<unsigned int>;
+  template<> struct hash<long>;
+  template<> struct hash<unsigned long>;
+  template<> struct hash<long long>;
+  template<> struct hash<unsigned long long>;
+  template<> struct hash<float>;
+  template<> struct hash<double>;
+  template<> struct hash<long double>;
+  template<> struct hash<std::string>;
+  template<> struct hash<std::wstring>;
+  template<> struct hash<std::u16string>;
+  template<> struct hash<std::u32string>;
+  template<typename T> struct hash<T*>;
+  template<> struct hash<std::type_index>;
 
-  // Support functions (Boost extension).
+  // Support functions (Boost extension).
   template<typename T> void hash_combine(size_t &, T const&);
-  template<typename It> std::size_t hash_range(It, It);
-  template<typename It> void hash_range(std::size_t&, It, It);
+  template<typename It> std::size_t hash_range(It, It);
+  template<typename It> void hash_range(std::size_t&, It, It);
 
-  // Overloadable hash implementation (Boost extension).
-  std::size_t hash_value(bool);
-  std::size_t hash_value(char);
-  std::size_t hash_value(signed char);
-  std::size_t hash_value(unsigned char);
-  std::size_t hash_value(wchar_t);
-  std::size_t hash_value(char16_t);
-  std::size_t hash_value(char32_t);
-  std::size_t hash_value(short);
-  std::size_t hash_value(unsigned short);
-  std::size_t hash_value(int);
-  std::size_t hash_value(unsigned int);
-  std::size_t hash_value(long);
-  std::size_t hash_value(unsigned long);
-  std::size_t hash_value(long long);
-  std::size_t hash_value(unsigned long long);
-  std::size_t hash_value(float);
-  std::size_t hash_value(double);
-  std::size_t hash_value(long double);
-  template<typename T> std::size_t hash_value(T* const&);
-  template<typename T, unsigned N> std::size_t hash_value(T (&val)[N]);
-  template<typename T, unsigned N> std::size_t hash_value(const T (&val)[N]);
+  // Overloadable hash implementation (Boost extension).
+  std::size_t hash_value(bool);
+  std::size_t hash_value(char);
+  std::size_t hash_value(signed char);
+  std::size_t hash_value(unsigned char);
+  std::size_t hash_value(wchar_t);
+  std::size_t hash_value(char16_t);
+  std::size_t hash_value(char32_t);
+  std::size_t hash_value(short);
+  std::size_t hash_value(unsigned short);
+  std::size_t hash_value(int);
+  std::size_t hash_value(unsigned int);
+  std::size_t hash_value(long);
+  std::size_t hash_value(unsigned long);
+  std::size_t hash_value(long long);
+  std::size_t hash_value(unsigned long long);
+  std::size_t hash_value(float);
+  std::size_t hash_value(double);
+  std::size_t hash_value(long double);
+  template<typename T> std::size_t hash_value(T* const&);
+  template<typename T, unsigned N> std::size_t hash_value(T (&val)[N]);
+  template<typename T, unsigned N> std::size_t hash_value(const T (&val)[N]);
   template<typename Ch, typename A> 
-    std::size_t hash_value(std::basic_string<Ch, std::char_traits<Ch>, A> const&);
+    std::size_t hash_value(std::basic_string<Ch, std::char_traits<Ch>, A> const&);
   template<typename A, typename B> 
-    std::size_t hash_value(std::pair<A, B> const&);
+    std::size_t hash_value(std::pair<A, B> const&);
   template<typename T, typename A> 
-    std::size_t hash_value(std::vector<T, A> const&);
+    std::size_t hash_value(std::vector<T, A> const&);
   template<typename T, typename A> 
-    std::size_t hash_value(std::list<T, A> const&);
+    std::size_t hash_value(std::list<T, A> const&);
   template<typename T, typename A> 
-    std::size_t hash_value(std::deque<T, A> const&);
+    std::size_t hash_value(std::deque<T, A> const&);
   template<typename K, typename C, typename A> 
-    std::size_t hash_value(std::set<K, C, A> const&);
+    std::size_t hash_value(std::set<K, C, A> const&);
   template<typename K, typename C, typename A> 
-    std::size_t hash_value(std::multiset<K, C, A> const&);
+    std::size_t hash_value(std::multiset<K, C, A> const&);
   template<typename K, typename T, typename C, typename A> 
-    std::size_t hash_value(std::map<K, T, C, A> const&);
+    std::size_t hash_value(std::map<K, T, C, A> const&);
   template<typename K, typename T, typename C, typename A> 
-    std::size_t hash_value(std::multimap<K, T, C, A> const&);
-  template<typename T> std::size_t hash_value(std::complex<T> const&);
-  std::size_t hash_value(std::type_index);
+    std::size_t hash_value(std::multimap<K, T, C, A> const&);
+  template<typename T> std::size_t hash_value(std::complex<T> const&);
+  std::size_t hash_value(std::type_index);
   template<typename T, std::size_t N> 
-    std::size_t hash_value(std::array<T, N> const&);
-  template<typename... T> std::size_t hash_value(std::tuple<T...>);
+    std::size_t hash_value(std::array<T, N> const&);
+  template<typename... T> std::size_t hash_value(std::tuple<T...>);
 }
    
-
    
- Support functions (Boost extension).
    
+
    
+ Support functions (Boost extension).
    
 
      
 
    1. 
 
      template<typename T> void hash_combine(size_t & seed, T const& v);
      
@@ -145,22 +145,22 @@
 
    
@@ -181,9 +181,9 @@
 
    
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
             Updates seed with a new hash value generated by
             combining it with the result of
-            hash_value(v). Will
+            hash_value(v). Will
             always produce the same result for the same combination of
             seed and
-            hash_value(v) during
+            hash_value(v) during
             the single run of a program.
         
 
    
 
    
 
    Notes:
    		
 
-
    hash_value is called without
+
    hash_value is called without
           qualification, so that overloads can be found via ADL.
    
 
    This is an extension to TR1
    
 
    
             Forward declared in
-            <boost/functional/hash_fwd.hpp>
+            <boost/container_hash/hash_fwd.hpp>
           
    
 
    
             This hash function is not intended for general use, and isn't
@@ -172,8 +172,8 @@
 
    
 
    Throws:
    		
 
-          Only throws if hash_value(T) throws.
-          Strong exception safety, as long as hash_value(T)
+          Only throws if hash_value(T) throws.
+          Strong exception safety, as long as hash_value(T)
           also has strong exception safety.
         
 
    
 
 
  • 
-
    
-
    template<typename It> std::size_t hash_range(It first, It last);
-template<typename It> void hash_range(std::size_t& seed, It first, It last);
    
+
    
+
    template<typename It> std::size_t hash_range(It first, It last);
+template<typename It> void hash_range(std::size_t& seed, It first, It last);
    
 
    
             Calculate the combined hash value of the elements of an iterator
             range.
@@ -231,7 +231,7 @@
 
    This is an extension to TR1
    
 
    
             Forward declared in
-            <boost/functional/hash_fwd.hpp>
+            <boost/container_hash/hash_fwd.hpp>
           
    
 
    
             This hash function is not intended for general use, and isn't
@@ -243,9 +243,9 @@
 
    • 
 
    Throws:
    		
 
    
-          Only throws if hash_value(std::iterator_traits<It>::value_type)
+          Only throws if hash_value(std::iterator_traits<It>::value_type)
           throws. hash_range(std::size_t&, It, It) has basic exception safety as long as
-          hash_value(std::iterator_traits<It>::value_type)
+          hash_value(std::iterator_traits<It>::value_type)
           has basic exception safety.
         
    		
 
    
 
 
    Throws:
    		
 
             Only throws if a user supplied version of
-            hash_value
+            hash_value
             throws for an element of a container, or
             one of the types stored in a pair.
         
 
 
 
 
 
    
 
    
 
    
-PrevUpHomeNext
+PrevUpHomeNext
 
    
 
    
 
    
@@ -108,12 +108,12 @@
 
    
 
    
 
-
+
    Last revised: December 14, 2017 at 00:08:09 GMT
    Last revised: April 11, 2018 at 14:10:07 GMT
    		
 
    		
 
    
 
    
 
    
-PrevUpHomeNext
+PrevUpHomeNext
 
    
 
 
diff --git a/doc/html/heap/acknowledgements.html b/doc/html/heap/acknowledgements.html
index 0a3b5061e5..6b4197b542 100644
--- a/doc/html/heap/acknowledgements.html
+++ b/doc/html/heap/acknowledgements.html
@@ -7,7 +7,7 @@
 
 
 
-
+
 
 
 
@@ -21,7 +21,7 @@
 
    
 
    
 
    
-PrevUpHomeNext
+PrevUpHomeNext
 
    
 
    
 
    
@@ -52,7 +52,7 @@
 
    
 
    
 
    
-PrevUpHomeNext
+PrevUpHomeNext
 
    
 
 
diff --git a/doc/html/index.html b/doc/html/index.html
index 0023e6fc1c..e8d3c2790b 100644
--- a/doc/html/index.html
+++ b/doc/html/index.html
@@ -40,12 +40,12 @@
 
    7. Boost.Chrono 2.0.5
    
 
    8. Boost.Circular Buffer
    
 
    9. Boost.Container
    
-
    10. The Conversion Library 1.6
    
-
    11. Boost.Date_Time
    
-
    12. Boost.DLL
    
-
    13. Boost.Foreach
    
-
    14. Boost.Function
    
-
    15. Boost.Functional/Hash
    
+
    10. Boost.ContainerHash
    
+
    11. The Conversion Library 1.6
    
+
    12. Boost.Date_Time
    
+
    13. Boost.DLL
    
+
    14. Boost.Foreach
    
+
    15. Boost.Function
    
 
    16. Boost.Heap
    
 
    17. Boost.Interprocess
    
 
    18. Boost.Intrusive
    
diff --git a/doc/html/interprocess.html b/doc/html/interprocess.html
index 45c5c2873e..43c3b53db1 100644
--- a/doc/html/interprocess.html
+++ b/doc/html/interprocess.html
@@ -312,7 +312,7 @@
 
 
 
-
+
    Last revised: December 14, 2017 at 00:07:32 GMT
    Last revised: April 11, 2018 at 14:09:38 GMT
    		
 
    		
 
    
 
    
diff --git a/doc/html/interprocess/acknowledgements_notes.html b/doc/html/interprocess/acknowledgements_notes.html
index 98955e4a97..51b213ed73 100644
--- a/doc/html/interprocess/acknowledgements_notes.html
+++ b/doc/html/interprocess/acknowledgements_notes.html
@@ -288,6 +288,8 @@
       Notes
 
 
    
+
    Boost
+        1.67 Release
    
 
    Boost
         1.66 Release
    
 
    Boost
@@ -347,6 +349,25 @@
 
    
 
    
 
    
+
    
+
    
+
    
+
    
@@ -412,7 +433,7 @@
             
 
  • 
               New experimental option BOOST_INTERPROCESS_BOOTSTAMP_IS_SESSION_MANAGER_BASED
-              from Windows systems. This option derives the unique booststamp used
+              from Windows systems. This option derives the unique bootstamp used
               to name the folder where shared memory is placed from registry values
               associated with the session manager. This option only works on Vista
               and later systems and might be more stable than the default version.
diff --git a/doc/html/interprocess/architecture.html b/doc/html/interprocess/architecture.html
index e442d0000f..de20b14354 100644
--- a/doc/html/interprocess/architecture.html
+++ b/doc/html/interprocess/architecture.html
@@ -265,7 +265,7 @@
           The Boost.Interprocess managed memory
           segments that construct the shared memory/memory mapped file, place there
           the segment manager and forward the user requests to the segment manager.
-          For example, basic_managed_shared_memory
+          For example, basic_managed_shared_memory
           is a Boost.Interprocess managed memory
           segment that works with shared memory. basic_managed_mapped_file
           works with memory mapped files, etc...
@@ -299,7 +299,7 @@
         
    
 
    
diff --git a/doc/html/interprocess/indexes_reference.html b/doc/html/interprocess/indexes_reference.html
index 78e312f6ec..cb78a23d5a 100644
--- a/doc/html/interprocess/indexes_reference.html
+++ b/doc/html/interprocess/indexes_reference.html
@@ -80,7 +80,7 @@
 
    • 
 
  • 
 
    basic_managed_external_buffer
    
-
    
+
    
 
    • 
 
  • 
 
    basic_managed_heap_memory
    
@@ -88,15 +88,15 @@
 
    • 
 
  • 
 
    basic_managed_shared_memory
    
-
    
+
    
 
    • 
 
  • 
 
    basic_managed_windows_shared_memory
    
-
    
+
    
 
    • 
 
  • 
 
    basic_managed_xsi_shared_memory
    
-
    
+
    
 
    • 
 
  • 
 
    basic_vectorbuf
    
@@ -180,7 +180,7 @@
 
    • 
 
  • 
 
    interprocess_recursive_mutex
    
-
    
+
    
 
    • 
 
  • 
 
    interprocess_semaphore
    
@@ -188,11 +188,11 @@
 
    • 
 
  • 
 
    interprocess_sharable_mutex
    
-
    
+
    
 
    • 
 
  • 
 
    interprocess_upgradable_mutex
    
-
    
+
    
 
    • 
 
  • 
 
    intrusive_ptr
    
@@ -618,7 +618,7 @@
 
    
 
    • 
 
    
@@ -725,7 +725,7 @@
 
    managed_windows_shared_memory
    
 
    
 
 
  • 
@@ -930,11 +930,11 @@
 
    
 
    namespace boost {
   namespace intrusive {
-    template<class... Options> struct make_unordered_set_base_hook;
+    template<class... Options> struct make_unordered_set_base_hook;
 
     template<class... Options> class unordered_set_base_hook;
 
-    template<class... Options> struct make_unordered_set_member_hook;
+    template<class... Options> struct make_unordered_set_member_hook;
 
     template<class... Options> class unordered_set_member_hook;
   }
diff --git a/doc/html/intrusive/release_notes.html b/doc/html/intrusive/release_notes.html
index 5d0324cd21..d5d1a565cd 100644
--- a/doc/html/intrusive/release_notes.html
+++ b/doc/html/intrusive/release_notes.html
@@ -28,6 +28,8 @@
 Release Notes
 
 
    
+
    Boost
+      1.67 Release
    
 
    Boost
       1.65 Release
    
 
    Boost
@@ -77,6 +79,19 @@
 
    
 
    
 
    
+
    
+
    
+
    
+
    
diff --git a/doc/html/libraries.html b/doc/html/libraries.html
index 9eadf53b00..ad9a163adf 100644
--- a/doc/html/libraries.html
+++ b/doc/html/libraries.html
@@ -114,7 +114,14 @@
 
    Main features
    
 
    Boost.Container and C++ exceptions
    
 
    Non-standard containers
    
-
    Extended functionality
    
+
    Extended functionality:
+    Basic extensions
    
+
    Extended functionality:
+    Configurable containers
    
+
    Extended functionality:
+    Extended allocators
    
+
    Extended Functionality:
+    Polymorphic Memory Resources 
    
 
    C++11/C++14 Conformance
    
 
    Known Issues
    
 
    History and reasons to use
@@ -125,7 +132,21 @@
     and links
    
 
    Release Notes
    
 
-
    10. The Conversion Library 1.6
    
+
    10. Boost.ContainerHash
    
+
    
+
    Introduction
    
+
    Tutorial
    
+
    Extending boost::hash for a custom data type
    
+
    Combining hash values
    
+
    Portability
    
+
    Disabling The Extensions
    
+
    Change Log
    
+
    Rationale
    
+
    Reference
    
+
    Links
    
+
    Acknowledgements
    
+
    
+
    11. The Conversion Library 1.6
    
 
    
 
    Description
    
 
    Polymorphic casts
    
@@ -138,7 +159,7 @@
     example
    • 
 
    History
    
 
-
    11. Boost.Date_Time
    
+
    12. Boost.Date_Time
    
 
    
 
    Conceptual
    
 
    General Usage Examples
    
@@ -151,7 +172,7 @@
 
    Examples
    
 
    Library Reference
    
 
    
-
    12. Boost.DLL
    
+
    13. Boost.DLL
    
 
    
 
    Motivation
    
 
    Getting started
    
@@ -166,7 +187,7 @@
 
    Revision History
    
 
    Acknowledgements
    
 
    
-
    13. Boost.Foreach
    
+
    14. Boost.Foreach
    
 
    
 
    Introduction
    
 
    Extensibility
    
@@ -174,7 +195,7 @@
 
    Pitfalls
    
 
    History and Acknowledgements
    
 
    
-
    14. Boost.Function
    
+
    15. Boost.Function
    
 
    
 
    Introduction
    
 
    History & Compatibility Notes
    
@@ -184,20 +205,6 @@
 
    Miscellaneous Notes
    
 
    Testsuite
    
 
    
-
    15. Boost.Functional/Hash
    
-
    
-
    Introduction
    
-
    Tutorial
    
-
    Extending boost::hash for a custom data type
    
-
    Combining hash values
    
-
    Portability
    
-
    Disabling The Extensions
    
-
    Change Log
    
-
    Rationale
    
-
    Reference
    
-
    Links
    
-
    Acknowledgements
    
-
    
 
    16. Boost.Heap
    
 
    
 
    Introduction & Motivation
    
@@ -374,8 +381,6 @@
 
    Introduction
    
 
    Getting started
    
 
    Tutorial
    
-
    Reference
    
-
    Python Bindings
    
 
    
 
    26. Boost.MultiArray Reference Manual
    
 
    
diff --git a/doc/html/load_1_3_12_15_5_16_2.html b/doc/html/load_1_3_12_15_5_16_2.html
deleted file mode 100644
index 461066169d..0000000000
--- a/doc/html/load_1_3_12_15_5_16_2.html
+++ /dev/null
@@ -1,54 +0,0 @@
-
-
-
-
-Function template load
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    
-
    
-
    
-PrevUpHomeNext
-
    
-
    
-
    
-
    
-
    Function template load
    
-
    load — Function to load posix_time::time_duration objects using serialization lib. 
    
-
    
-
    Synopsis
    
-
    // In header: <boost/date_time/posix_time/time_serialize.hpp>
-
-
-template<typename Archive> 
-  void load(Archive & ar, posix_time::time_duration & td, unsigned int);
    
-
    
-
    Description
    
-
    time_duration objects are broken down into 4 parts for serialization: types are hour_type, min_type, sec_type, and fractional_seconds_type as defined in the time_duration class 
    
-
    
-
    
-
-
-
-
    Copyright © 2001-2005 CrystalClear Software, Inc
    Subject to the Boost Software License, Version 1.0. (See accompanying file
-    LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
    
-
    
-
    
-
    
-PrevUpHomeNext
-
    
-
-
diff --git a/doc/html/load_1_3_12_15_5_16_4.html b/doc/html/load_1_3_12_15_5_16_4.html
deleted file mode 100644
index d2b3d93cf4..0000000000
--- a/doc/html/load_1_3_12_15_5_16_4.html
+++ /dev/null
@@ -1,54 +0,0 @@
-
-
-
-
-Function template load
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    
-
    
-
    
-PrevUpHomeNext
-
    
-
    
-
    
-
    
-
    Function template load
    
-
    load — Function to load posix_time::ptime objects using serialization lib. 
    
-
    
-
    Synopsis
    
-
    // In header: <boost/date_time/posix_time/time_serialize.hpp>
-
-
-template<typename Archive> 
-  void load(Archive & ar, posix_time::ptime & pt, unsigned int);
    
-
    
-
    Description
    
-
    ptime objects are broken down into 2 parts for serialization: a date object and a time_duration onject 
    
-
    
-
    
-
-
-
-
    Copyright © 2001-2005 CrystalClear Software, Inc
    Subject to the Boost Software License, Version 1.0. (See accompanying file
-    LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
    
-
    
-
    
-
    
-PrevUpHomeNext
-
    
-
-
diff --git a/doc/html/load_1_3_12_15_5_16_7.html b/doc/html/load_1_3_12_15_5_16_7.html
deleted file mode 100644
index d3e8ddc2c3..0000000000
--- a/doc/html/load_1_3_12_15_5_16_7.html
+++ /dev/null
@@ -1,54 +0,0 @@
-
-
-
-
-Function template load
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    
-
    
-
    
-PrevUpHomeNext
-
    
-
    
-
    
-
    
-
    Function template load
    
-
    load — Function to load posix_time::time_period objects using serialization lib. 
    
-
    
-
    Synopsis
    
-
    // In header: <boost/date_time/posix_time/time_serialize.hpp>
-
-
-template<typename Archive> 
-  void load(Archive & ar, boost::posix_time::time_period & tp, unsigned int);
    
-
    
-
    Description
    
-
    time_period objects are broken down into 2 parts for serialization: a begining ptime object and an ending ptime object 
    
-
    
-
    
-
-
-
-
    Copyright © 2001-2005 CrystalClear Software, Inc
    Subject to the Boost Software License, Version 1.0. (See accompanying file
-    LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
    
-
    
-
    
-
    
-PrevUpHomeNext
-
    
-
-
diff --git a/doc/html/load_1_3_13_15_5_16_6.html b/doc/html/load_1_3_13_15_5_16_6.html
new file mode 100644
index 0000000000..fb9ae461e6
--- /dev/null
+++ b/doc/html/load_1_3_13_15_5_16_6.html
@@ -0,0 +1,54 @@
+
+
+
+
+Function template load
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    
+
    
+
    
+PrevUpHomeNext
+
    
+
    
+
    
+
    
+
    Function template load
    
+
    load — Function to load posix_time::ptime objects using serialization lib. 
    
+
    
+
    Synopsis
    
+
    // In header: <boost/date_time/posix_time/time_serialize.hpp>
+
+
+template<typename Archive> 
+  void load(Archive & ar, posix_time::ptime & pt, unsigned int);
    
+
    
+
    Description
    
+
    ptime objects are broken down into 2 parts for serialization: a date object and a time_duration onject 
    
+
    
+
    
+
+
+
+
    Copyright © 2001-2005 CrystalClear Software, Inc
    Subject to the Boost Software License, Version 1.0. (See accompanying file
+    LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
    
+
    
+
    
+
    
+PrevUpHomeNext
+
    
+
+
diff --git a/doc/html/load_1_3_13_15_5_16_9.html b/doc/html/load_1_3_13_15_5_16_9.html
new file mode 100644
index 0000000000..3bbff9c1b9
--- /dev/null
+++ b/doc/html/load_1_3_13_15_5_16_9.html
@@ -0,0 +1,54 @@
+
+
+
+
+Function template load
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    
+
    
+
    
+PrevUpHomeNext
+
    
+
    
+
    
+
    
+
    Function template load
    
+
    load — Function to load posix_time::time_period objects using serialization lib. 
    
+
    
+
    Synopsis
    
+
    // In header: <boost/date_time/posix_time/time_serialize.hpp>
+
+
+template<typename Archive> 
+  void load(Archive & ar, boost::posix_time::time_period & tp, unsigned int);
    
+
    
+
    Description
    
+
    time_period objects are broken down into 2 parts for serialization: a begining ptime object and an ending ptime object 
    
+
    
+
    
+
+
+
+
    Copyright © 2001-2005 CrystalClear Software, Inc
    Subject to the Boost Software License, Version 1.0. (See accompanying file
+    LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
    
+
    
+
    
+
    
+PrevUpHomeNext
+
    
+
+
diff --git a/doc/html/load_td.html b/doc/html/load_td.html
new file mode 100644
index 0000000000..587ed016c6
--- /dev/null
+++ b/doc/html/load_td.html
@@ -0,0 +1,54 @@
+
+
+
+
+Function template load_td
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    
+
    
+
    
+PrevUpHomeNext
+
    
+
    
+
    
+
    
+
    Function template load_td
    
+
    load_td — Function to load posix_time::time_duration objects using serialization lib. 
    
+
    
+
    Synopsis
    
+
    // In header: <boost/date_time/posix_time/time_serialize.hpp>
+
+
+template<typename TimeResTraitsSize, typename Archive> 
+  void load_td(Archive & ar, posix_time::time_duration & td);
    
+
    
+
    Description
    
+
    time_duration objects are broken down into 4 parts for serialization: types are hour_type, min_type, sec_type, and fractional_seconds_type as defined in the time_duration class 
    
+
    
+
    
+
+
+
+
    Copyright © 2001-2005 CrystalClear Software, Inc
    Subject to the Boost Software License, Version 1.0. (See accompanying file
+    LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
    
+
    
+
    
+
    
+PrevUpHomeNext
+
    
+
+
diff --git a/doc/html/lockfree.html b/doc/html/lockfree.html
index 503dad21de..cf48d1904f 100644
--- a/doc/html/lockfree.html
+++ b/doc/html/lockfree.html
@@ -271,7 +271,7 @@
 
 
 
-
+
    Last revised: December 14, 2017 at 00:06:08 GMT
    Last revised: April 11, 2018 at 14:08:08 GMT
    		
 
    		
 
    
 
    
diff --git a/doc/html/lockfree/reference.html b/doc/html/lockfree/reference.html
index 3b7870acac..d7d140c345 100644
--- a/doc/html/lockfree/reference.html
+++ b/doc/html/lockfree/reference.html
@@ -57,7 +57,7 @@
 Header <boost/lockfree/spsc_queue.hpp>
 
    namespace boost {
   namespace lockfree {
-    template<typename T, typename... Options> class spsc_queue;
+    template<typename T, typename A0, typename A1> class spsc_queue;
   }
 }
    
 
diff --git a/doc/html/metaparse.html b/doc/html/metaparse.html
index a475037a3f..2a2f3bb2c0 100644
--- a/doc/html/metaparse.html
+++ b/doc/html/metaparse.html
@@ -179,7 +179,7 @@
 
 
 
-
+
    Last revised: December 14, 2017 at 00:06:07 GMT
    Last revised: April 11, 2018 at 14:08:07 GMT
    		
 
    		
 
    
 
    
diff --git a/doc/html/move.html b/doc/html/move.html
index 559c670560..ce04eb9b33 100644
--- a/doc/html/move.html
+++ b/doc/html/move.html
@@ -77,6 +77,8 @@
 
    Thanks and credits
    
 
    Release Notes
    
 
    
+
    Boost 1.67
+      Release
    
 
    Boost 1.66
       Release
    
 
    Boost 1.65
@@ -164,7 +166,7 @@
 
 
 
-
+
    Last revised: December 14, 2017 at 00:06:07 GMT
    Last revised: April 11, 2018 at 14:08:07 GMT
    		
 
    		
 
    
 
    
diff --git a/doc/html/move/reference.html b/doc/html/move/reference.html
index fb76d509d5..a220185a49 100644
--- a/doc/html/move/reference.html
+++ b/doc/html/move/reference.html
@@ -54,6 +54,8 @@
   template<typename BidirIt1, typename BidirIt2> 
     BidirIt2     adl_move_swap_ranges_backward(BidirIt1 first1, BidirIt1 last1, 
                                            BidirIt2 last2);
+  template<typename ForwardIt1, typename ForwardIt2> 
+    void adl_move_iter_swap(ForwardIt1 a, ForwardIt2 b);
 }
 
 
    
diff --git a/doc/html/move/release_notes.html b/doc/html/move/release_notes.html
index 9db75a0882..f918f3fe51 100644
--- a/doc/html/move/release_notes.html
+++ b/doc/html/move/release_notes.html
@@ -28,6 +28,8 @@
 Release Notes
 
    
 
    
+
    Boost 1.67
+      Release
    
 
    Boost 1.66
       Release
    
 
    Boost 1.65
@@ -61,6 +63,16 @@
 
    
 
    
 
    
+
    • 
+            Added pdqsort and heap_sort implementations, initially as a detail, they
+            will be official in the future once better tested.
+          
    
+
    
+
    
+
    
diff --git a/doc/html/move/thanks_to.html b/doc/html/move/thanks_to.html
index 256239e000..3c8bf32b18 100644
--- a/doc/html/move/thanks_to.html
+++ b/doc/html/move/thanks_to.html
@@ -38,6 +38,19 @@
 
    
       Many thanks to all boosters that have tested, reviewed and improved the library.
     
    
+
    
+      Special thanks to:
+    
    
+
    
 
    
 
diff --git a/doc/html/mpi.html b/doc/html/mpi.html
index 2645c10dd8..00f210dd7b 100644
--- a/doc/html/mpi.html
+++ b/doc/html/mpi.html
@@ -58,48 +58,9 @@
 
    Point-to-Point communication
    Collective operations
    Managing communicators
    
-
    Separating structure from content
    
-
    Performance optimizations
    
-
    Mapping from C MPI to Boost.MPI
    
-
-
    Reference
    
-
    
-
    Header <boost/mpi.hpp>
    
-
    Header <boost/mpi/allocator.hpp>
    
-
    Header <boost/mpi/collectives.hpp>
    
-
    Header <boost/mpi/collectives_fwd.hpp>
    
-
    Header <boost/mpi/communicator.hpp>
    
-
    Header <boost/mpi/config.hpp>
    
-
    Header <boost/mpi/datatype.hpp>
    
-
    Header <boost/mpi/datatype_fwd.hpp>
    
-
    Header <boost/mpi/environment.hpp>
    
-
    Header <boost/mpi/exception.hpp>
    
-
    Header <boost/mpi/graph_communicator.hpp>
    
-
    Header <boost/mpi/group.hpp>
    
-
    Header <boost/mpi/inplace.hpp>
    
-
    Header <boost/mpi/intercommunicator.hpp>
    
-
    Header <boost/mpi/nonblocking.hpp>
    
-
    Header <boost/mpi/operations.hpp>
    
-
    Header <boost/mpi/packed_iarchive.hpp>
    
-
    Header <boost/mpi/packed_oarchive.hpp>
    
-
    Header <boost/mpi/python.hpp>
    
-
    Header <boost/mpi/request.hpp>
    
-
    Header <boost/mpi/skeleton_and_content.hpp>
    
-
    Header <boost/mpi/skeleton_and_content_fwd.hpp>
    
-
    Header <boost/mpi/status.hpp>
    
-
    Header <boost/mpi/timer.hpp>
    
-
    
-
    Python Bindings
    
-
    
-
    Quickstart
    
-
    Transmitting User-Defined Data
    
-
    Collectives
    
-
    Skeleton/Content Mechanism
    
-
    Design Philosophy
    
-
    Threads
    
-
    Performance Evaluation
    
-
    Revision History
    
-
    Acknowledgments
    
+
    Cartesian communicator
    
+
    Reference
    
+
    Python Bindings
    
 
    
@@ -163,12 +124,12 @@
 
    
       Boost.MPI can be accessed either through its native C++ bindings, or through
-      its alternative, Python interface.
+      its alternative, Python interface.
     
    
 
 
 
 
 
 
 
 
 
    
-
+
    Last revised: December 14, 2017 at 00:06:07 GMT
    Last revised: April 11, 2018 at 14:08:07 GMT
    		
 
    		
 
    
 
    
diff --git a/doc/html/mpi/getting_started.html b/doc/html/mpi/getting_started.html
index 2ef10a1e5b..8c9807d7c2 100644
--- a/doc/html/mpi/getting_started.html
+++ b/doc/html/mpi/getting_started.html
@@ -339,11 +339,11 @@ $....../b2
   -lboost_mpi-gcc-mt-1_35 -lboost_serialization-gcc-d-1_35.a
 
 
    
-        If you plan to use the Python bindings
+        If you plan to use the Python bindings
         for Boost.MPI in conjunction with the C++ Boost.MPI, you will also need to
         link against the boost_mpi_python library, e.g., by adding -lboost_mpi_python-gcc-mt-1_35 to your link command. This step will
-        only be necessary if you intend to register
-        C++ types or use the skeleton/content
+        only be necessary if you intend to register
+        C++ types or use the skeleton/content
         mechanism from within Python.
       
    
 
diff --git a/doc/html/mpi/python.html b/doc/html/mpi/python.html
deleted file mode 100644
index 48206dca9a..0000000000
--- a/doc/html/mpi/python.html
+++ /dev/null
@@ -1,477 +0,0 @@
-
-
-
-
-Python Bindings
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    
-
    
-
    
-PrevUpHomeNext
-
    
-
    
-
    
-Python Bindings
    
-
    
-
    Quickstart
    
-
    Transmitting User-Defined Data
    
-
    Collectives
    
-
    Skeleton/Content Mechanism
    
-
    Design Philosophy
    
-
    Threads
    
-
    Performance Evaluation
    
-
    Revision History
    
-
    Acknowledgments
    
-
    
-
    
-      Boost.MPI provides an alternative MPI interface from the Python
-      programming language via the boost.mpi module.
-      The Boost.MPI Python bindings, built on top of the C++ Boost.MPI using the
-      Boost.Python library,
-      provide nearly all of the functionality of Boost.MPI within a dynamic, object-oriented
-      language.
-    
    
-
    
-      The Boost.MPI Python module can be built and installed from the libs/mpi/build directory.
-      Just follow the configuration and installation
-      instructions for the C++ Boost.MPI. Once you have installed the Python module,
-      be sure that the installation location is in your PYTHONPATH.
-    
    
-
    
-
    
-Quickstart
    
-
    
-        Getting started with the Boost.MPI Python module is as easy as importing
-        boost.mpi. Our first "Hello, World!"
-        program is just two lines long:
-      
    
-
    import boost.mpi as mpi
-print "I am process %d of %d." % (mpi.rank, mpi.size)
-
    
-
    
-        Go ahead and run this program with several processes. Be sure to invoke the
-        python interpreter from
-        mpirun, e.g.,
-      
    
-
    mpirun -np 5 python hello_world.py
-
    
-
    
-        This will return output such as:
-      
    
-
    I am process 1 of 5.
-I am process 3 of 5.
-I am process 2 of 5.
-I am process 4 of 5.
-I am process 0 of 5.
-
    
-
    
-        Point-to-point operations in Boost.MPI have nearly the same syntax in Python
-        as in C++. We can write a simple two-process Python program that prints "Hello,
-        world!" by transmitting Python strings:
-      
    
-
    import boost.mpi as mpi
-
-if mpi.world.rank == 0:
-  mpi.world.send(1, 0, 'Hello')
-  msg = mpi.world.recv(1, 1)
-  print msg,'!'
-else:
-  msg = mpi.world.recv(0, 0)
-  print (msg + ', '),
-  mpi.world.send(0, 1, 'world')
-
    
-
    
-        There are only a few notable differences between this Python code and the
-        example in the C++ tutorial. First
-        of all, we don't need to write any initialization code in Python: just loading
-        the boost.mpi module makes the appropriate MPI_Init and MPI_Finalize
-        calls. Second, we're passing Python objects from one process to another through
-        MPI. Any Python object that can be pickled can be transmitted; the next section
-        will describe in more detail how the Boost.MPI Python layer transmits objects.
-        Finally, when we receive objects with recv,
-        we don't need to specify the type because transmission of Python objects
-        is polymorphic.
-      
    
-
    
-        When experimenting with Boost.MPI in Python, don't forget that help is always
-        available via pydoc: just
-        pass the name of the module or module entity on the command line (e.g.,
-        pydoc boost.mpi.communicator) to receive complete reference
-        documentation. When in doubt, try it!
-      
    
-
    
-
    
-
    
-Transmitting User-Defined Data
    
-
    
-        Boost.MPI can transmit user-defined data in several different ways. Most
-        importantly, it can transmit arbitrary Python
-        objects by pickling them at the sender and unpickling them at the receiver,
-        allowing arbitrarily complex Python data structures to interoperate with
-        MPI.
-      
    
-
    
-        Boost.MPI also supports efficient serialization and transmission of C++ objects
-        (that have been exposed to Python) through its C++ interface. Any C++ type
-        that provides (de-)serialization routines that meet the requirements of the
-        Boost.Serialization library is eligible for this optimization, but the type
-        must be registered in advance. To register a C++ type, invoke the C++ function
-        register_serialized.
-        If your C++ types come from other Python modules (they probably will!), those
-        modules will need to link against the boost_mpi
-        and boost_mpi_python libraries
-        as described in the installation section.
-        Note that you do not need to link against
-        the Boost.MPI Python extension module.
-      
    
-
    
-        Finally, Boost.MPI supports separation of the structure of an object from
-        the data it stores, allowing the two pieces to be transmitted separately.
-        This "skeleton/content" mechanism, described in more detail in
-        a later section, is a communication optimization suitable for problems with
-        fixed data structures whose internal data changes frequently.
-      
    
-
    
-
    
-
    
-Collectives
    
-
    
-        Boost.MPI supports all of the MPI collectives (scatter,
-        reduce, scan,
-        broadcast, etc.) for any
-        type of data that can be transmitted with the point-to-point communication
-        operations. For the MPI collectives that require a user-specified operation
-        (e.g., reduce and scan), the operation can be an arbitrary
-        Python function. For instance, one could concatenate strings with all_reduce:
-      
    
-
    mpi.all_reduce(my_string, lambda x,y: x + y)
-
    
-
    
-        The following module-level functions implement MPI collectives: all_gather
-        Gather the values from all processes. all_reduce Combine the results from
-        all processes. all_to_all Every process sends data to every other process.
-        broadcast Broadcast data from one process to all other processes. gather
-        Gather the values from all processes to the root. reduce Combine the results
-        from all processes to the root. scan Prefix reduction of the values from
-        all processes. scatter Scatter the values stored at the root to all processes.
-      
    
-
    
-
    
-
    
-Skeleton/Content Mechanism
    
-
    
-
    C++/Python MPI Compatibility
    
-
    Reference
    
-
    
-
    
-        Boost.MPI provides a skeleton/content mechanism that allows the transfer
-        of large data structures to be split into two separate stages, with the skeleton
-        (or, "shape") of the data structure sent first and the content
-        (or, "data") of the data structure sent later, potentially several
-        times, so long as the structure has not changed since the skeleton was transferred.
-        The skeleton/content mechanism can improve performance when the data structure
-        is large and its shape is fixed, because while the skeleton requires serialization
-        (it has an unknown size), the content transfer is fixed-size and can be done
-        without extra copies.
-      
    
-
    
-        To use the skeleton/content mechanism from Python, you must first register
-        the type of your data structure with the skeleton/content mechanism from C++. The registration function is register_skeleton_and_content
-        and resides in the <boost/mpi/python.hpp>
-        header.
-      
    
-
    
-        Once you have registered your C++ data structures, you can extract the skeleton
-        for an instance of that data structure with skeleton(). The resulting skeleton_proxy
-        can be transmitted via the normal send routine, e.g.,
-      
    
-
    mpi.world.send(1, 0, skeleton(my_data_structure))
-
    
-
    
-        skeleton_proxy objects can
-        be received on the other end via recv(), which stores a newly-created instance
-        of your data structure with the same "shape" as the sender in its
-        "object" attribute:
-      
    
-
    shape = mpi.world.recv(0, 0)
-my_data_structure = shape.object
-
    
-
    
-        Once the skeleton has been transmitted, the content (accessed via get_content) can be transmitted in much
-        the same way. Note, however, that the receiver also specifies get_content(my_data_structure)
-        in its call to receive:
-      
    
-
    if mpi.rank == 0:
-  mpi.world.send(1, 0, get_content(my_data_structure))
-else:
-  mpi.world.recv(0, 0, get_content(my_data_structure))
-
    
-
    
-        Of course, this transmission of content can occur repeatedly, if the values
-        in the data structure--but not its shape--changes.
-      
    
-
    
-        The skeleton/content mechanism is a structured way to exploit the interaction
-        between custom-built MPI datatypes and MPI_BOTTOM,
-        to eliminate extra buffer copies.
-      
    
-
    
-
    
-C++/Python MPI Compatibility
    
-
    
-          Boost.MPI is a C++ library whose facilities have been exposed to Python
-          via the Boost.Python library. Since the Boost.MPI Python bindings are build
-          directly on top of the C++ library, and nearly every feature of C++ library
-          is available in Python, hybrid C++/Python programs using Boost.MPI can
-          interact, e.g., sending a value from Python but receiving that value in
-          C++ (or vice versa). However, doing so requires some care. Because Python
-          objects are dynamically typed, Boost.MPI transfers type information along
-          with the serialized form of the object, so that the object can be received
-          even when its type is not known. This mechanism differs from its C++ counterpart,
-          where the static types of transmitted values are always known.
-        
    
-
    
-          The only way to communicate between the C++ and Python views on Boost.MPI
-          is to traffic entirely in Python objects. For Python, this is the normal
-          state of affairs, so nothing will change. For C++, this means sending and
-          receiving values of type boost::python::object,
-          from the Boost.Python
-          library. For instance, say we want to transmit an integer value from Python:
-        
    
-
    comm.send(1, 0, 17)
-
    
-
    
-          In C++, we would receive that value into a Python object and then extract an integer value:
-        
    
-
    boost::python::object value;
-comm.recv(0, 0, value);
-int int_value = boost::python::extract<int>(value);
-
    
-
    
-          In the future, Boost.MPI will be extended to allow improved interoperability
-          with the C++ Boost.MPI and the C MPI bindings.
-        
    
-
    
-
    
-
    
-Reference
    
-
    
-          The Boost.MPI Python module, boost.mpi,
-          has its own reference documentation,
-          which is also available using pydoc
-          (from the command line) or help(boost.mpi) (from the Python interpreter).
-        
    
-
    
-
    
-
    
-
    
-Design Philosophy
    
-
    
-        The design philosophy of the Parallel MPI library is very simple: be both
-        convenient and efficient. MPI is a library built for high-performance applications,
-        but it's FORTRAN-centric, performance-minded design makes it rather inflexible
-        from the C++ point of view: passing a string from one process to another
-        is inconvenient, requiring several messages and explicit buffering; passing
-        a container of strings from one process to another requires an extra level
-        of manual bookkeeping; and passing a map from strings to containers of strings
-        is positively infuriating. The Parallel MPI library allows all of these data
-        types to be passed using the same simple send() and recv() primitives. Likewise, collective operations
-        such as reduce() allow arbitrary data types
-        and function objects, much like the C++ Standard Library would.
-      
    
-
    
-        The higher-level abstractions provided for convenience must not have an impact
-        on the performance of the application. For instance, sending an integer via
-        send must be as efficient
-        as a call to MPI_Send, which
-        means that it must be implemented by a simple call to MPI_Send;
-        likewise, an integer reduce()
-        using std::plus<int> must
-        be implemented with a call to MPI_Reduce
-        on integers using the MPI_SUM
-        operation: anything less will impact performance. In essence, this is the
-        "don't pay for what you don't use" principle: if the user is not
-        transmitting strings, s/he should not pay the overhead associated with strings.
-      
    
-
    
-        Sometimes, achieving maximal performance means foregoing convenient abstractions
-        and implementing certain functionality using lower-level primitives. For
-        this reason, it is always possible to extract enough information from the
-        abstractions in Boost.MPI to minimize the amount of effort required to interface
-        between Boost.MPI and the C MPI library.
-      
    
-
    
-
    
-
    
-Threads
    
-
    
-        There are an increasing number of hybrid parallel applications that mix distributed
-        and shared memory parallelism. To know how to support that model, one need
-        to know what level of threading support is guaranteed by the MPI implementation.
-        There are 4 ordered level of possible threading support described by mpi::threading::level. At the
-        lowest level, you should not use threads at all, at the highest level, any
-        thread can perform MPI call.
-      
    
-
    
-        If you want to use multi-threading in your MPI application, you should indicate
-        in the environment constructor your preferred threading support. Then probe
-        the one the library did provide, and decide what you can do with it (it could
-        be nothing, then aborting is a valid option):
-      
    
-
    #include <boost/mpi/environment.hpp>
-#include <boost/mpi/communicator.hpp>
-#include <iostream>
-namespace mpi = boost::mpi;
-namespace mt  = mpi::threading;
-
-int main()
-{
-  mpi::environment env(mt::funneled);
-  if (env.thread_level() < mt::funneled) {
-     env.abort(-1);
-  }
-  mpi::communicator world;
-  std::cout << "I am process " << world.rank() << " of " << world.size()
-            << "." << std::endl;
-  return 0;
-}
-
    
-
    
-
    
-
    
-Performance Evaluation
    
-
    
-        Message-passing performance is crucial in high-performance distributed computing.
-        To evaluate the performance of Boost.MPI, we modified the standard NetPIPE benchmark (version
-        3.6.2) to use Boost.MPI and compared its performance against raw MPI. We
-        ran five different variants of the NetPIPE benchmark:
-      
    
-
      
-
    1. 
-            MPI: The unmodified NetPIPE benchmark.
-          
      2. 
-
    2. 
-            Boost.MPI: NetPIPE modified to use Boost.MPI calls for communication.
-          
      3. 
-
    3. 
-            MPI (Datatypes): NetPIPE modified to use a derived datatype (which itself
-            contains a single MPI_BYTE)
-            rather than a fundamental datatype.
-          
      4. 
-
    4. 
-            Boost.MPI (Datatypes): NetPIPE modified to use a user-defined type Char in place of the fundamental char type. The Char
-            type contains a single char,
-            a serialize()
-            method to make it serializable, and specializes is_mpi_datatype
-            to force Boost.MPI to build a derived MPI data type for it.
-          
      5. 
-
    5. 
-            Boost.MPI (Serialized): NetPIPE modified to use a user-defined type
-            Char in place of the
-            fundamental char type. This
-            Char type contains a
-            single char and is serializable.
-            Unlike the Datatypes case, is_mpi_datatype
-            is not specialized, forcing Boost.MPI
-            to perform many, many serialization calls.
-          
      6. 
-
    
-
    
-        The actual tests were performed on the Odin cluster in the Department
-        of Computer Science at Indiana University,
-        which contains 128 nodes connected via Infiniband. Each node contains 4GB
-        memory and two AMD Opteron processors. The NetPIPE benchmarks were compiled
-        with Intel's C++ Compiler, version 9.0, Boost 1.35.0 (prerelease), and Open MPI version 1.1. The NetPIPE
-        results follow:
-      
    
-
    
-        netpipe
-      
    
-
    
-        There are a some observations we can make about these NetPIPE results. First
-        of all, the top two plots show that Boost.MPI performs on par with MPI for
-        fundamental types. The next two plots show that Boost.MPI performs on par
-        with MPI for derived data types, even though Boost.MPI provides a much more
-        abstract, completely transparent approach to building derived data types
-        than raw MPI. Overall performance for derived data types is significantly
-        worse than for fundamental data types, but the bottleneck is in the underlying
-        MPI implementation itself. Finally, when forcing Boost.MPI to serialize characters
-        individually, performance suffers greatly. This particular instance is the
-        worst possible case for Boost.MPI, because we are serializing millions of
-        individual characters. Overall, the additional abstraction provided by Boost.MPI
-        does not impair its performance.
-      
    
-
    
-
    
-
    
-Revision History
    
-
      
-
    • 
-            Boost 1.36.0:
-            
      • 
-                  Support for non-blocking operations in Python, from Andreas Klöckner
-                
      
-          
      • 
-
    • 
-            Boost 1.35.0: Initial release, containing
-            the following post-review changes
-            
        
-
      • 
-                  Support for arrays in all collective operations
-                
        • 
-
      • 
-                  Support default-construction of environment
-                
        • 
-
      
-          
      • 
-
    • 
-            2006-09-21: Boost.MPI accepted into
-            Boost.
-          
      • 
-
    
-
    
-
    
-
    
-Acknowledgments
    
-
    
-        Boost.MPI was developed with support from Zurcher Kantonalbank. Daniel Egloff
-        and Michael Gauckler contributed many ideas to Boost.MPI's design, particularly
-        in the design of its abstractions for MPI data types and the novel skeleton/context
-        mechanism for large data structures. Prabhanjan (Anju) Kambadur developed
-        the predecessor to Boost.MPI that proved the usefulness of the Serialization
-        library in an MPI setting and the performance benefits of specialization
-        in a C++ abstraction layer for MPI. Jeremy Siek managed the formal review
-        of Boost.MPI.
-      
    
-
    
-
    
-
-
-
-
    Copyright © 2005-2007 Douglas Gregor,
-      Matthias Troyer, Trustees of Indiana University
    
-        Distributed under the Boost Software License, Version 1.0. (See accompanying
-        file LICENSE_1_0.txt or copy at 
-        http://www.boost.org/LICENSE_1_0.txt )
-      
    
-
    
-
    
-
    
-PrevUpHomeNext
-
    
-
-
diff --git a/doc/html/mpi/reference.html b/doc/html/mpi/reference.html
deleted file mode 100644
index 449c98e8ae..0000000000
--- a/doc/html/mpi/reference.html
+++ /dev/null
@@ -1,524 +0,0 @@
-
-
-
-
-Reference
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    
-
    
-
    
-PrevUpHomeNext
-
    
-
    
-
    
-Reference
    
-
    
-
    Header <boost/mpi.hpp>
    
-
    Header <boost/mpi/allocator.hpp>
    
-
    Header <boost/mpi/collectives.hpp>
    
-
    Header <boost/mpi/collectives_fwd.hpp>
    
-
    Header <boost/mpi/communicator.hpp>
    
-
    Header <boost/mpi/config.hpp>
    
-
    Header <boost/mpi/datatype.hpp>
    
-
    Header <boost/mpi/datatype_fwd.hpp>
    
-
    Header <boost/mpi/environment.hpp>
    
-
    Header <boost/mpi/exception.hpp>
    
-
    Header <boost/mpi/graph_communicator.hpp>
    
-
    Header <boost/mpi/group.hpp>
    
-
    Header <boost/mpi/inplace.hpp>
    
-
    Header <boost/mpi/intercommunicator.hpp>
    
-
    Header <boost/mpi/nonblocking.hpp>
    
-
    Header <boost/mpi/operations.hpp>
    
-
    Header <boost/mpi/packed_iarchive.hpp>
    
-
    Header <boost/mpi/packed_oarchive.hpp>
    
-
    Header <boost/mpi/python.hpp>
    
-
    Header <boost/mpi/request.hpp>
    
-
    Header <boost/mpi/skeleton_and_content.hpp>
    
-
    Header <boost/mpi/skeleton_and_content_fwd.hpp>
    
-
    Header <boost/mpi/status.hpp>
    
-
    Header <boost/mpi/timer.hpp>
    
-
    
-
    
-
    
-Header <boost/mpi.hpp>
    
-
    This file is a top-level convenience header that includes all of the Boost.MPI library headers. Users concerned about compile time may wish to include only specific headers from the Boost.MPI library. 
    
-
    
-
    
-
    
-
    This header provides an STL-compliant allocator that uses the MPI-2 memory allocation facilities. 
    
-
    namespace boost {
-  namespace mpi {
-    template<typename T> class allocator;
-
-    template<> class allocator<void>;
-    template<typename T1, typename T2> 
-      bool operator==(const allocator< T1 > &, const allocator< T2 > &);
-    template<typename T1, typename T2> 
-      bool operator!=(const allocator< T1 > &, const allocator< T2 > &);
-  }
-}
    
-
    
-
    
-
    
-
    This header contains MPI collective operations, which implement various parallel algorithms that require the coordination of all processes within a communicator. The header collectives_fwd.hpp provides forward declarations for each of these operations. To include only specific collective algorithms, use the headers boost/mpi/collectives/algorithm_name.hpp. 
    
-
    namespace boost {
-  namespace mpi {
-    template<typename T> 
-      void all_gather(const communicator &, const T &, std::vector< T > &);
-    template<typename T> void all_gather(const communicator &, const T &, T *);
-    template<typename T> 
-      void all_gather(const communicator &, const T *, int, 
-                      std::vector< T > &);
-    template<typename T> 
-      void all_gather(const communicator &, const T *, int, T *);
-    template<typename T, typename Op> 
-      void all_reduce(const communicator &, const T *, int, T *, Op);
-    template<typename T, typename Op> 
-      void all_reduce(const communicator &, const T &, T &, Op);
-    template<typename T, typename Op> 
-      T all_reduce(const communicator &, const T &, Op);
-    template<typename T, typename Op> 
-      void all_reduce(const communicator &, inplace_t< T * >, int, Op);
-    template<typename T, typename Op> 
-      void all_reduce(const communicator &, inplace_t< T >, Op);
-    template<typename T> 
-      void all_to_all(const communicator &, const std::vector< T > &, 
-                      std::vector< T > &);
-    template<typename T> void all_to_all(const communicator &, const T *, T *);
-    template<typename T> 
-      void all_to_all(const communicator &, const std::vector< T > &, int, 
-                      std::vector< T > &);
-    template<typename T> 
-      void all_to_all(const communicator &, const T *, int, T *);
-    template<typename T> void broadcast(const communicator &, T &, int);
-    template<typename T> void broadcast(const communicator &, T *, int, int);
-    template<typename T> 
-      void broadcast(const communicator &, skeleton_proxy< T > &, int);
-    template<typename T> 
-      void broadcast(const communicator &, const skeleton_proxy< T > &, int);
-    template<typename T> 
-      void gather(const communicator &, const T &, std::vector< T > &, int);
-    template<typename T> 
-      void gather(const communicator &, const T &, T *, int);
-    template<typename T> void gather(const communicator &, const T &, int);
-    template<typename T> 
-      void gather(const communicator &, const T *, int, std::vector< T > &, 
-                  int);
-    template<typename T> 
-      void gather(const communicator &, const T *, int, T *, int);
-    template<typename T> 
-      void gather(const communicator &, const T *, int, int);
-    template<typename T> 
-      void gatherv(const communicator &, const std::vector< T > &, T *, 
-                   const std::vector< int > &, const std::vector< int > &, 
-                   int);
-    template<typename T> 
-      void gatherv(const communicator &, const T *, int, T *, 
-                   const std::vector< int > &, const std::vector< int > &, 
-                   int);
-    template<typename T> 
-      void gatherv(const communicator &, const std::vector< T > &, int);
-    template<typename T> 
-      void gatherv(const communicator &, const T *, int, int);
-    template<typename T> 
-      void gatherv(const communicator &, const T *, int, T *, 
-                   const std::vector< int > &, int);
-    template<typename T> 
-      void gatherv(const communicator &, const std::vector< T > &, T *, 
-                   const std::vector< int > &, int);
-    template<typename T> 
-      void scatter(const communicator &, const std::vector< T > &, T &, int);
-    template<typename T> 
-      void scatter(const communicator &, const T *, T &, int);
-    template<typename T> void scatter(const communicator &, T &, int);
-    template<typename T> 
-      void scatter(const communicator &, const std::vector< T > &, T *, int, 
-                   int);
-    template<typename T> 
-      void scatter(const communicator &, const T *, T *, int, int);
-    template<typename T> void scatter(const communicator &, T *, int, int);
-    template<typename T> 
-      void scatterv(const communicator &, const std::vector< T > &, 
-                    const std::vector< int > &, const std::vector< int > &, 
-                    T *, int, int);
-    template<typename T> 
-      void scatterv(const communicator &, const T *, 
-                    const std::vector< int > &, const std::vector< int > &, 
-                    T *, int, int);
-    template<typename T> void scatterv(const communicator &, T *, int, int);
-    template<typename T> 
-      void scatterv(const communicator &, const T *, 
-                    const std::vector< int > &, T *, int);
-    template<typename T> 
-      void scatterv(const communicator &, const std::vector< T > &, 
-                    const std::vector< int > &, T *, int);
-    template<typename T, typename Op> 
-      void reduce(const communicator &, const T &, T &, Op, int);
-    template<typename T, typename Op> 
-      void reduce(const communicator &, const T &, Op, int);
-    template<typename T, typename Op> 
-      void reduce(const communicator &, const T *, int, T *, Op, int);
-    template<typename T, typename Op> 
-      void reduce(const communicator &, const T *, int, Op, int);
-    template<typename T, typename Op> 
-      void scan(const communicator &, const T &, T &, Op);
-    template<typename T, typename Op> 
-      T scan(const communicator &, const T &, Op);
-    template<typename T, typename Op> 
-      void scan(const communicator &, const T *, int, T *, Op);
-  }
-}
    
-
    
-
    
-
    
-
    This header provides forward declarations for all of the collective operations contained in the header collectives.hpp. 
    
-
    
-
    
-
    
-
    This header defines the communicator class, which is the basis of all communication within Boost.MPI, and provides point-to-point communication operations. 
    
-
    namespace boost {
-  namespace mpi {
-    class communicator;
-
-    enum comm_create_kind;
-
-    const int any_source;    // A constant representing "any process.". 
-    const int any_tag;    // A constant representing "any tag.". 
-    BOOST_MPI_DECL bool operator==(const communicator &, const communicator &);
-    bool operator!=(const communicator &, const communicator &);
-  }
-}
    
-
    
-
    
-
    
-
    This header provides MPI configuration details that expose the capabilities of the underlying MPI implementation, and provides auto-linking support on Windows. 
    
-
    -
-MPICH_IGNORE_CXX_SEEK
-BOOST_MPI_HOMOGENEOUS
-BOOST_MPI_HAS_MEMORY_ALLOCATION
-BOOST_MPI_HAS_NOARG_INITIALIZATION
-BOOST_MPI_CALLING_CONVENTION
-BOOST_MPI_BCAST_BOTTOM_WORKS_FINE
-BOOST_MPI_DECL
    
-
    
-
    
-
    
-
    This header provides the mapping from C++ types to MPI data types. 
    
-
    -
-BOOST_IS_MPI_DATATYPE(T)
    
-
    namespace boost {
-  namespace mpi {
-    template<typename T> struct is_mpi_integer_datatype;
-    template<typename T> struct is_mpi_floating_point_datatype;
-    template<typename T> struct is_mpi_logical_datatype;
-    template<typename T> struct is_mpi_complex_datatype;
-    template<typename T> struct is_mpi_byte_datatype;
-    template<typename T> struct is_mpi_builtin_datatype;
-    template<typename T> struct is_mpi_datatype;
-    template<typename T> MPI_Datatype get_mpi_datatype(const T &);
-  }
-}
    
-
    
-
    
-
    
-
    This header provides forward declarations for the contents of the header datatype.hpp. It is expected to be used primarily by user-defined C++ classes that need to specialize is_mpi_datatype. 
    
-
    namespace boost {
-  namespace mpi {
-    struct packed;
-    template<typename T> MPI_Datatype get_mpi_datatype();
-  }
-}
    
-
    
-
    
-
    
-
    This header provides the environment class, which provides routines to initialize, finalization, and query the status of the Boost MPI environment. 
    
-
    namespace boost {
-  namespace mpi {
-    class environment;
-    namespace threading {
-      enum level;
-      std::ostream & operator<<(std::ostream &, level);
-      std::istream & operator>>(std::istream &, level &);
-    }
-  }
-}
    
-
    
-
    
-
    
-
    This header provides exception classes that report MPI errors to the user and macros that translate MPI error codes into Boost.MPI exceptions. 
    
-
    -
-BOOST_MPI_CHECK_RESULT(MPIFunc, Args)
    
-
    namespace boost {
-  namespace mpi {
-    class exception;
-  }
-}
    
-
    
-
    
-
    
-
    This header defines facilities to support MPI communicators with graph topologies, using the graph interface defined by the Boost Graph Library. One can construct a communicator whose topology is described by any graph meeting the requirements of the Boost Graph Library's graph concepts. Likewise, any communicator that has a graph topology can be viewed as a graph by the Boost Graph Library, permitting one to use the BGL's graph algorithms on the process topology. 
    
-
    namespace boost {
-  template<> struct graph_traits<mpi::graph_communicator>;
-  namespace mpi {
-    class graph_communicator;
-
-    // Returns the source vertex from an edge in the graph topology of a communicator. 
-    int source(const std::pair< int, int > & edge, const graph_communicator &);
-
-    // Returns the target vertex from an edge in the graph topology of a communicator. 
-    int target(const std::pair< int, int > & edge, const graph_communicator &);
-
-    // Returns an iterator range containing all of the edges outgoing from the given vertex in a graph topology of a communicator. 
-    unspecified out_edges(int vertex, const graph_communicator & comm);
-
-    // Returns the out-degree of a vertex in the graph topology of a communicator. 
-    int out_degree(int vertex, const graph_communicator & comm);
-
-    // Returns an iterator range containing all of the neighbors of the given vertex in the communicator's graph topology. 
-    unspecified adjacent_vertices(int vertex, const graph_communicator & comm);
-
-    // Returns an iterator range that contains all of the vertices with the communicator's graph topology, i.e., all of the process ranks in the communicator. 
-    std::pair< counting_iterator< int >, counting_iterator< int > > 
-    vertices(const graph_communicator & comm);
-
-    // Returns the number of vertices within the graph topology of the communicator, i.e., the number of processes in the communicator. 
-    int num_vertices(const graph_communicator & comm);
-
-    // Returns an iterator range that contains all of the edges with the communicator's graph topology. 
-    unspecified edges(const graph_communicator & comm);
-
-    // Returns the number of edges in the communicator's graph topology. 
-    int num_edges(const graph_communicator & comm);
-    identity_property_map get(vertex_index_t, const graph_communicator &);
-    int get(vertex_index_t, const graph_communicator &, int);
-  }
-}
    
-
    
-
    
-
    
-
    This header defines the group class, which allows one to manipulate and query groups of processes. 
    
-
    namespace boost {
-  namespace mpi {
-    class group;
-    BOOST_MPI_DECL bool operator==(const group &, const group &);
-    bool operator!=(const group &, const group &);
-    BOOST_MPI_DECL group operator|(const group &, const group &);
-    BOOST_MPI_DECL group operator&(const group &, const group &);
-    BOOST_MPI_DECL group operator-(const group &, const group &);
-  }
-}
    
-
    
-
    
-
    
-
    This header provides helpers to indicate to MPI collective operation that a buffer can be use both as an input and output. 
    
-
    namespace boost {
-  namespace mpi {
-    template<typename T> struct inplace_t;
-
-    template<typename T> struct inplace_t<T *>;
-    template<typename T> inplace_t< T > inplace(T &);
-    template<typename T> inplace_t< T * > inplace(T *);
-  }
-}
    
-
    
-
    
-
    
-
    This header defines the intercommunicator class, which permits communication between different process groups. 
    
-
    namespace boost {
-  namespace mpi {
-    class intercommunicator;
-  }
-}
    
-
    
-
    
-
    
-
    This header defines operations for completing non-blocking communication requests. 
    
-
    namespace boost {
-  namespace mpi {
-    template<typename ForwardIterator> 
-      std::pair< status, ForwardIterator > 
-      wait_any(ForwardIterator, ForwardIterator);
-    template<typename ForwardIterator> 
-      optional< std::pair< status, ForwardIterator > > 
-      test_any(ForwardIterator, ForwardIterator);
-    template<typename ForwardIterator, typename OutputIterator> 
-      OutputIterator 
-      wait_all(ForwardIterator, ForwardIterator, OutputIterator);
-    template<typename ForwardIterator> 
-      void wait_all(ForwardIterator, ForwardIterator);
-    template<typename ForwardIterator, typename OutputIterator> 
-      optional< OutputIterator > 
-      test_all(ForwardIterator, ForwardIterator, OutputIterator);
-    template<typename ForwardIterator> 
-      bool test_all(ForwardIterator, ForwardIterator);
-    template<typename BidirectionalIterator, typename OutputIterator> 
-      std::pair< OutputIterator, BidirectionalIterator > 
-      wait_some(BidirectionalIterator, BidirectionalIterator, OutputIterator);
-    template<typename BidirectionalIterator> 
-      BidirectionalIterator 
-      wait_some(BidirectionalIterator, BidirectionalIterator);
-    template<typename BidirectionalIterator, typename OutputIterator> 
-      std::pair< OutputIterator, BidirectionalIterator > 
-      test_some(BidirectionalIterator, BidirectionalIterator, OutputIterator);
-    template<typename BidirectionalIterator> 
-      BidirectionalIterator 
-      test_some(BidirectionalIterator, BidirectionalIterator);
-  }
-}
    
-
    
-
    
-
    
-
    This header provides a mapping from function objects to MPI_Op constants used in MPI collective operations. It also provides several new function object types not present in the standard  <functional> header that have direct mappings to MPI_Op. 
    
-
    namespace boost {
-  namespace mpi {
-    template<typename Op, typename T> struct is_mpi_op;
-    template<typename Op, typename T> struct is_commutative;
-    template<typename T> struct maximum;
-    template<typename T> struct minimum;
-    template<typename T> struct bitwise_and;
-    template<typename T> struct bitwise_or;
-    template<typename T> struct logical_xor;
-    template<typename T> struct bitwise_xor;
-  }
-}
    
-
    
-
    
-
    
-
    This header provides the facilities for packing Serializable data types into a buffer using MPI_Pack. The buffers can then be transmitted via MPI and then be unpacked either via the facilities in packed_oarchive.hpp or MPI_Unpack. 
    
-
    namespace boost {
-  namespace mpi {
-    class packed_iarchive;
-
-    typedef packed_iprimitive iprimitive;
-  }
-}
    
-
    
-
    
-
    
-
    This header provides the facilities for unpacking Serializable data types from a buffer using MPI_Unpack. The buffers are typically received via MPI and have been packed either by via the facilities in packed_iarchive.hpp or MPI_Pack. 
    
-
    namespace boost {
-  namespace mpi {
-    class packed_oarchive;
-
-    typedef packed_oprimitive oprimitive;
-  }
-}
    
-
    
-
    
-
    
-
    This header interacts with the Python bindings for Boost.MPI. The routines in this header can be used to register user-defined and library-defined data types with Boost.MPI for efficient (de-)serialization and separate transmission of skeletons and content. 
    
-
    namespace boost {
-  namespace mpi {
-    namespace python {
-      template<typename T> 
-        void register_serialized(const T & = T(), PyTypeObject * = 0);
-      template<typename T> 
-        void register_skeleton_and_content(const T & = T(), 
-                                           PyTypeObject * = 0);
-    }
-  }
-}
    
-
    
-
    
-
    
-
    This header defines the class request, which contains a request for non-blocking communication. 
    
-
    namespace boost {
-  namespace mpi {
-    class request;
-  }
-}
    
-
    
-
    
-
    
-
    This header provides facilities that allow the structure of data types (called the "skeleton") to be transmitted and received separately from the content stored in those data types. These facilities are useful when the data in a stable data structure (e.g., a mesh or a graph) will need to be transmitted repeatedly. In this case, transmitting the skeleton only once saves both communication effort (it need not be sent again) and local computation (serialization need only be performed once for the content). 
    
-
    namespace boost {
-  namespace mpi {
-    template<typename T> struct skeleton_proxy;
-
-    class content;
-    class packed_skeleton_iarchive;
-    class packed_skeleton_oarchive;
-    template<typename T> const skeleton_proxy< T > skeleton(T &);
-    template<typename T> const content get_content(const T &);
-  }
-}
    
-
    
-
    
-
    
-
    This header contains all of the forward declarations required to use transmit skeletons of data structures and the content of data structures separately. To actually transmit skeletons or content, include the header boost/mpi/skeleton_and_content.hpp. 
    
-
    
-
    
-
    
-
    This header defines the class status, which reports on the results of point-to-point communication. 
    
-
    namespace boost {
-  namespace mpi {
-    class status;
-  }
-}
    
-
    
-
    
-
    
-
    This header provides the timer class, which provides access to the MPI timers. 
    
-
    namespace boost {
-  namespace mpi {
-    class timer;
-  }
-}
    
-
    
-
    
-
-
-
-
    Copyright © 2005-2007 Douglas Gregor,
-      Matthias Troyer, Trustees of Indiana University
    
-        Distributed under the Boost Software License, Version 1.0. (See accompanying
-        file LICENSE_1_0.txt or copy at 
-        http://www.boost.org/LICENSE_1_0.txt )
-      
    
-
    
-
    
-
    
-PrevUpHomeNext
-
    
-
-
diff --git a/doc/html/mpi/tutorial.html b/doc/html/mpi/tutorial.html
index d7cf1796e0..ff60b0df1d 100644
--- a/doc/html/mpi/tutorial.html
+++ b/doc/html/mpi/tutorial.html
@@ -8,7 +8,7 @@
 
 
 
-
+
 
 
 
@@ -21,7 +21,7 @@
 
    
 
    
 
    
-PrevUpHomeNext
+PrevUpHomeNext
 
    
 
    
 
    
 
    
       A Boost.MPI program consists of many cooperating processes (possibly running
@@ -160,8 +160,8 @@ I am process 3 of 7.
         it receives, along with a comma, then passes the message "world"
         back to processor 0 with a different tag. The first processor then writes
         this message with the "!" and exits. All sends are accomplished
-        with the communicator::send
-        method and all receives use a corresponding communicator::recv
+        with the communicator::send
+        method and all receives use a corresponding communicator::recv
         call.
       
    
 
    
@@ -232,15 +232,15 @@ I am process 3 of 7.
 }
 
 
    
-          We have replaced calls to the communicator::send
-          and communicator::recv
-          members with similar calls to their non-blocking counterparts, communicator::isend
-          and communicator::irecv.
+          We have replaced calls to the communicator::send
+          and communicator::recv
+          members with similar calls to their non-blocking counterparts, communicator::isend
+          and communicator::irecv.
           The prefix i indicates that the operations
           return immediately with a mpi::request
           object, which allows one to query the status of a communication request
-          (see the test
-          method) or wait until it has completed (see the wait
+          (see the test
+          method) or wait until it has completed (see the wait
           method). Multiple requests can be completed at the same time with the
           wait_all operation.
         
    
@@ -392,6 +392,7 @@ I am process 3 of 7.
 
    
 
    Broadcast
    
 
    Gather
    
+
    Scatter
    
 
    Reduce
    
 
    
 
    
@@ -456,11 +457,11 @@ Process #6 says Hello, World!
           collective gathers the values produced by every process in a communicator
           into a vector of values on the "root" process (specified by an
           argument to gather). The
-          /i/th element in the vector will correspond to the value gathered fro mthe
-          /i/th process. For instance, in the following program each process computes
-          its own random number. All of these random numbers are gathered at process
-          0 (the "root" in this case), which prints out the values that
-          correspond to each processor. (random_gather.cpp)
+          /i/th element in the vector will correspond to the value gathered from
+          the /i/th process. For instance, in the following program each process
+          computes its own random number. All of these random numbers are gathered
+          at process 0 (the "root" in this case), which prints out the
+          values that correspond to each processor. (random_gather.cpp)
         
    
 
    #include <boost/mpi.hpp>
 #include <iostream>
@@ -514,6 +515,63 @@ Process #6 thought of 650073868
 
    
 
    
 
    
+Scatter
    
+
    
+          The scatter
+          collective scatters the values from a vector in the "root" process
+          in a communicator into values in all the processes of the communicator.
+          The /i/th element in the vector will correspond to the value received by
+          the /i/th process. For instance, in the following program, the root process
+          produces a vector of random nomber and send one value to each process that
+          will print it. (random_scatter.cpp)
+        
    
+
    #include <boost/mpi.hpp>
+#include <boost/mpi/collectives.hpp>
+#include <iostream>
+#include <cstdlib>
+#include <vector>
+
+namespace mpi = boost::mpi;
+
+int main(int argc, char* argv[])
+{
+  mpi::environment env(argc, argv);
+  mpi::communicator world;
+
+  std::srand(time(0) + world.rank());
+  std::vector<int> all;
+  int mine = -1;
+  if (world.rank() == 0) {
+    all.resize(world.size());
+    std::generate(all.begin(), all.end(), std::rand);
+  }
+  mpi::scatter(world, all, mine, 0);
+  for (int r = 0; r < world.size(); ++r) {
+    world.barrier();
+    if (r == world.rank()) {
+      std::cout << "Rank " << r << " got " << mine << '\n';
+    }
+  }
+  return 0;
+}
+
    
+
    
+          Executing this program with seven processes will result in output such
+          as the following. Although the random values will change from one run to
+          the next, the order of the processes in the output will remain the same
+          because of the barrier.
+        
    
+
    Rank 0 got 1409381269
+Rank 1 got 17045268
+Rank 2 got 440120016
+Rank 3 got 936998224
+Rank 4 got 1827129182
+Rank 5 got 1951746047
+Rank 6 got 2117359639
+
    
+
    
+
    
+
    
 Reduce
    
 
    
           The reduce
@@ -805,43 +863,85 @@ Process #6 thought of 650073868
 
    
 
    
 
    
-Separating structure from content
    
-
    
-        When communicating data types over MPI that are not fundamental to MPI (such
-        as strings, lists, and user-defined data types), Boost.MPI must first serialize
-        these data types into a buffer and then communicate them; the receiver then
-        copies the results into a buffer before deserializing into an object on the
-        other end. For some data types, this overhead can be eliminated by using
-        is_mpi_datatype.
-        However, variable-length data types such as strings and lists cannot be MPI
-        data types.
-      
    
+Cartesian communicator
    
+
    
+
    Separating structure from content
    
+
    Performance optimizations
    
+
    Mapping from C MPI to Boost.MPI
    
+
    
 
    
-        Boost.MPI supports a second technique for improving performance by separating
-        the structure of these variable-length data structures from the content stored
-        in the data structures. This feature is only beneficial when the shape of
-        the data structure remains the same but the content of the data structure
-        will need to be communicated several times. For instance, in a finite element
-        analysis the structure of the mesh may be fixed at the beginning of computation
-        but the various variables on the cells of the mesh (temperature, stress,
-        etc.) will be communicated many times within the iterative analysis process.
-        In this case, Boost.MPI allows one to first send the "skeleton"
-        of the mesh once, then transmit the "content" multiple times. Since
-        the content need not contain any information about the structure of the data
-        type, it can be transmitted without creating separate communication buffers.
+        A communicator can be organised as a cartesian grid, here a basic example:
       
    
+
    #include <vector>
+#include <iostream>
+
+#include <boost/mpi/communicator.hpp>
+#include <boost/mpi/collectives.hpp>
+#include <boost/mpi/environment.hpp>
+#include <boost/mpi/cartesian_communicator.hpp>
+
+#include <boost/test/minimal.hpp>
+
+namespace mpi = boost::mpi;
+int test_main(int argc, char* argv[])
+{
+  mpi::environment  env;
+  mpi::communicator world;
+
+  if (world.size() != 24)  return -1;
+  mpi::cartesian_dimension dims[] = {{2, true}, {3,true}, {4,true}};
+  mpi::cartesian_communicator cart(world, mpi::cartesian_topology(dims));
+  for (int r = 0; r < cart.size(); ++r) {
+    cart.barrier();
+    if (r == cart.rank()) {
+      std::vector<int> c = cart.coordinates(r);
+      std::cout << "rk :" << r << " coords: "
+                << c[0] << ' ' << c[1] << ' ' << c[2] << '\n';
+    }
+  }
+  return 0;
+}
+
    
+
    
+
    
+Separating structure from content
    
 
    
-        To illustrate the use of skeletons and content, we will take a somewhat more
-        limited example wherein a master process generates random number sequences
-        into a list and transmits them to several slave processes. The length of
-        the list will be fixed at program startup, so the content of the list (i.e.,
-        the current sequence of numbers) can be transmitted efficiently. The complete
-        example is available in example/random_content.cpp. We
-        being with the master process (rank 0), which builds a list, communicates
-        its structure via a skeleton, then repeatedly
-        generates random number sequences to be broadcast to the slave processes
-        via content:
-      
    
+          When communicating data types over MPI that are not fundamental to MPI
+          (such as strings, lists, and user-defined data types), Boost.MPI must first
+          serialize these data types into a buffer and then communicate them; the
+          receiver then copies the results into a buffer before deserializing into
+          an object on the other end. For some data types, this overhead can be eliminated
+          by using is_mpi_datatype.
+          However, variable-length data types such as strings and lists cannot be
+          MPI data types.
+        
    
+
    
+          Boost.MPI supports a second technique for improving performance by separating
+          the structure of these variable-length data structures from the content
+          stored in the data structures. This feature is only beneficial when the
+          shape of the data structure remains the same but the content of the data
+          structure will need to be communicated several times. For instance, in
+          a finite element analysis the structure of the mesh may be fixed at the
+          beginning of computation but the various variables on the cells of the
+          mesh (temperature, stress, etc.) will be communicated many times within
+          the iterative analysis process. In this case, Boost.MPI allows one to first
+          send the "skeleton" of the mesh once, then transmit the "content"
+          multiple times. Since the content need not contain any information about
+          the structure of the data type, it can be transmitted without creating
+          separate communication buffers.
+        
    
+
    
+          To illustrate the use of skeletons and content, we will take a somewhat
+          more limited example wherein a master process generates random number sequences
+          into a list and transmits them to several slave processes. The length of
+          the list will be fixed at program startup, so the content of the list (i.e.,
+          the current sequence of numbers) can be transmitted efficiently. The complete
+          example is available in example/random_content.cpp.
+          We being with the master process (rank 0), which builds a list, communicates
+          its structure via a skeleton, then repeatedly
+          generates random number sequences to be broadcast to the slave processes
+          via content:
+        
    
 
    // Generate the list and broadcast its structure
 std::list<int> l(list_len);
 broadcast(world, mpi::skeleton(l), 0);
@@ -861,12 +961,12 @@ Process #6 thought of 650073868
 broadcast(world, c, 0);
 
    
 
    
-        The slave processes have a very similar structure to the master. They receive
-        (via the broadcast() call) the skeleton of the
-        data structure, then use it to build their own lists of integers. In each
-        iteration, they receive via another broadcast() the new content in the data structure and
-        compute some property of the data:
-      
    
+          The slave processes have a very similar structure to the master. They receive
+          (via the broadcast() call) the skeleton of
+          the data structure, then use it to build their own lists of integers. In
+          each iteration, they receive via another broadcast() the new content in the data structure
+          and compute some property of the data:
+        
    
 
    // Receive the content and build up our own list
 std::list<int> l;
 broadcast(world, mpi::skeleton(l), 0);
@@ -887,89 +987,89 @@ Process #6 thought of 650073868
 } while (true);
 
    
 
    
-        The skeletons and content of any Serializable data type can be transmitted
-        either via the send and recv members of the communicator
-        class (for point-to-point communicators) or broadcast via the broadcast() collective. When separating
-        a data structure into a skeleton and content, be careful not to modify the
-        data structure (either on the sender side or the receiver side) without transmitting
-        the skeleton again. Boost.MPI can not detect these accidental modifications
-        to the data structure, which will likely result in incorrect data being transmitted
-        or unstable programs.
-      
    
+          The skeletons and content of any Serializable data type can be transmitted
+          either via the send and recv members of the communicator
+          class (for point-to-point communicators) or broadcast via the broadcast() collective. When separating
+          a data structure into a skeleton and content, be careful not to modify
+          the data structure (either on the sender side or the receiver side) without
+          transmitting the skeleton again. Boost.MPI can not detect these accidental
+          modifications to the data structure, which will likely result in incorrect
+          data being transmitted or unstable programs.
+        
    
 
    
 
    
-
    
-Performance optimizations
    
+
    
+Performance optimizations
    
 
    
 
    Serialization optimizations
    
 
    Homogeneous Machines
    
 
    
 
    
-
    
-Serialization optimizations
    
+
    
+Serialization optimizations
    
 
    
-          To obtain optimal performance for small fixed-length data types not containing
-          any pointers it is very important to mark them using the type traits of
-          Boost.MPI and Boost.Serialization.
-        
    
+            To obtain optimal performance for small fixed-length data types not containing
+            any pointers it is very important to mark them using the type traits
+            of Boost.MPI and Boost.Serialization.
+          
    
 
    
-          It was already discussed that fixed length types containing no pointers
-          can be using as is_mpi_datatype, e.g.:
-        
    
+            It was already discussed that fixed length types containing no pointers
+            can be using as is_mpi_datatype, e.g.:
+          
    
 
    namespace boost { namespace mpi {
   template <>
   struct is_mpi_datatype<gps_position> : mpl::true_ { };
 } }
 
    
 
    
-          or the equivalent macro
-        
    
+            or the equivalent macro
+          
    
 
    BOOST_IS_MPI_DATATYPE(gps_position)
 
    
 
    
-          In addition it can give a substantial performance gain to turn off tracking
-          and versioning for these types, if no pointers to these types are used,
-          by using the traits classes or helper macros of Boost.Serialization:
-        
    
+            In addition it can give a substantial performance gain to turn off tracking
+            and versioning for these types, if no pointers to these types are used,
+            by using the traits classes or helper macros of Boost.Serialization:
+          
    
 
    BOOST_CLASS_TRACKING(gps_position,track_never)
 BOOST_CLASS_IMPLEMENTATION(gps_position,object_serializable)
 
    
 
    
 
    
-
    
-Homogeneous Machines
    
+
    
+Homogeneous Machines
    
 
    
-          More optimizations are possible on homogeneous machines, by avoiding MPI_Pack/MPI_Unpack
-          calls but using direct bitwise copy. This feature is enabled by default
-          by defining the macro BOOST_MPI_HOMOGENEOUS
-          in the include file boost/mpi/config.hpp.
-          That definition must be consistent when building Boost.MPI and when building
-          the application.
-        
    
+            More optimizations are possible on homogeneous machines, by avoiding
+            MPI_Pack/MPI_Unpack calls but using direct bitwise copy. This feature
+            is enabled by default by defining the macro BOOST_MPI_HOMOGENEOUS
+            in the include file boost/mpi/config.hpp.
+            That definition must be consistent when building Boost.MPI and when building
+            the application.
+          
    
 
    
-          In addition all classes need to be marked both as is_mpi_datatype and as
-          is_bitwise_serializable, by using the helper macro of Boost.Serialization:
-        
    
+            In addition all classes need to be marked both as is_mpi_datatype and
+            as is_bitwise_serializable, by using the helper macro of Boost.Serialization:
+          
    
 
    BOOST_IS_BITWISE_SERIALIZABLE(gps_position)
 
    
 
    
-          Usually it is safe to serialize a class for which is_mpi_datatype is true
-          by using binary copy of the bits. The exception are classes for which some
-          members should be skipped for serialization.
-        
    
+            Usually it is safe to serialize a class for which is_mpi_datatype is
+            true by using binary copy of the bits. The exception are classes for
+            which some members should be skipped for serialization.
+          
    
 
    
 
    
 
    
-
    
-Mapping from C MPI to Boost.MPI
    
+
    
+Mapping from C MPI to Boost.MPI
    
 
    
-        This section provides tables that map from the functions and constants of
-        the standard C MPI to their Boost.MPI equivalents. It will be most useful
-        for users that are already familiar with the C or Fortran interfaces to MPI,
-        or for porting existing parallel programs to Boost.MPI.
-      
    
+          This section provides tables that map from the functions and constants
+          of the standard C MPI to their Boost.MPI equivalents. It will be most useful
+          for users that are already familiar with the C or Fortran interfaces to
+          MPI, or for porting existing parallel programs to Boost.MPI.
+        
    
 
    
-
    Table 25.1. Point-to-point communication
    
+
    Table 25.1. Point-to-point communication
    
 
    @@ -977,483 +1077,483 @@ Process #6 thought of 650073868
 
+                  
    
+                    C Function/Constant
+                  
    
+                
+                  
    
+                    Boost.MPI Equivalent
+                  
    
+                
+                  
    
+                    MPI_ANY_SOURCE
+                  
    
+                
+                  
    
+                    any_source
+                  
    
+                
+                  
    
+                    MPI_ANY_TAG
+                  
    
+                
+                  
    
+                    any_tag
+                  
    
+                
+                  
    
+                    MPI_Bsend
+                  
    
+                
+                  
    
+                    unsupported
+                  
    
+                
+                  
    
+                    MPI_Bsend_init
+                  
    
+                
+                  
    
+                    unsupported
+                  
    
+                
+                  
    
+                    MPI_Buffer_attach
+                  
    
+                
+                  
    
+                    unsupported
+                  
    
+                
+                  
    
+                    MPI_Buffer_detach
+                  
    
+                
+                  
    
+                    unsupported
+                  
    
+                
+                  
    
+                    MPI_Cancel
+                  
    
+                
+                  
    
+                    request::cancel
+                  
    
+                
+                  
    
+                    MPI_Get_count
+                  
    
+                
+                  
    
+                    status::count
+                  
    
+                
+                  
    
+                    MPI_Ibsend
+                  
    
+                
+                  
    
+                    unsupported
+                  
    
+                
+                  
    
+                    MPI_Iprobe
+                  
    
+                
+                  
    
+                    communicator::iprobe
+                  
    
+                
+                  
    
+                    MPI_Irsend
+                  
    
+                
+                  
    
+                    unsupported
+                  
    
+                
+                  
    
+                    MPI_Isend
+                  
    
+                
+                  
    
+                    communicator::isend
+                  
    
+                
+                  
    
+                    MPI_Issend
+                  
    
+                
+                  
    
+                    unsupported
+                  
    
+                
+                  
    
+                    MPI_Irecv
+                  
    
+                
+                  
    
+                    communicator::irecv
+                  
    
+                
+                  
    
+                    MPI_Probe
+                  
    
+                
+                  
    
+                    communicator::probe
+                  
    
+                
+                  
    
+                    MPI_PROC_NULL
+                  
    
+                
+                  
    
+                    unsupported
+                  
    
+                
+                  
    
+                    MPI_Recv
+                  
    
+                
+                  
    
+                    communicator::recv
+                  
    
+                
+                  
    
+                    MPI_Recv_init
+                  
    
+                
+                  
    
+                    unsupported
+                  
    
+                
+                  
    
+                    MPI_Request_free
+                  
    
+                
+                  
    
+                    unsupported
+                  
    
+                
+                  
    
+                    MPI_Rsend
+                  
    
+                
+                  
    
+                    unsupported
+                  
    
+                
+                  
    
+                    MPI_Rsend_init
+                  
    
+                
+                  
    
+                    unsupported
+                  
    
+                
+                  
    
+                    MPI_Send
+                  
    
+                
+                  
    
+                    communicator::send
+                  
    
+                
+                  
    
+                    MPI_Sendrecv
+                  
    
+                
+                  
    
+                    unsupported
+                  
    
+                
+                  
    
+                    MPI_Sendrecv_replace
+                  
    
+                
+                  
    
+                    unsupported
+                  
    
+                
+                  
    
+                    MPI_Send_init
+                  
    
+                
+                  
    
+                    unsupported
+                  
    
+                
+                  
    
+                    MPI_Ssend
+                  
    
+                
+                  
    
+                    unsupported
+                  
    
+                
+                  
    
+                    MPI_Ssend_init
+                  
    
+                
+                  
    
+                    unsupported
+                  
    
+                
+                  
    
+                    MPI_Start
+                  
    
+                
+                  
    
+                    unsupported
+                  
    
+                
+                  
    
+                    MPI_Startall
+                  
    
+                
+                  
    
+                    unsupported
+                  
    
+                
+                  
    
+                    MPI_Test
+                  
    
+                
+                  
    
+                    request::test
+                  
    
+                
+                  
    
+                    MPI_Testall
+                  
    
+                
+                  
    
+                    test_all
+                  
    
+                
+                  
    
+                    MPI_Testany
+                  
    
+                
+                  
    
+                    test_any
+                  
    
+                
+                  
    
+                    MPI_Testsome
+                  
    
+                
+                  
    
+                    test_some
+                  
    
+                
+                  
    
+                    MPI_Test_cancelled
+                  
    
+                
+                  
    
+                    status::cancelled
+                  
    
+                
+                  
    
+                    MPI_Wait
+                  
    
+                
+                  
    
+                    request::wait
+                  
    
+                
+                  
    
+                    MPI_Waitall
+                  
    
+                
+                  
    
+                    wait_all
+                  
    
+                
+                  
    
+                    MPI_Waitany
+                  
    
+                
+                  
    
+                    wait_any
+                  
    
+                
+                  
    
+                    MPI_Waitsome
+                  
    
+                
+                  
    
+                    wait_some
+                  
    
+                
    
 
 

 
    
 
-                
    
-                  C Function/Constant
-                
    
-                  		
 
-                
    
-                  Boost.MPI Equivalent
-                
    
-                  		
 
    
 
 
    
 
-                
    
-                  MPI_ANY_SOURCE
-                
    
-                  		
 
-                
    
-                  any_source
-                
    
-                  		
 
    
 
    
 
-                
    
-                  MPI_ANY_TAG
-                
    
-                  		
 
-                
    
-                  any_tag
-                
    
-                  		
 
    
 
    
 
-                
    
-                  MPI_Bsend
-                
    
-                  		
 
-                
    
-                  unsupported
-                
    
-                  		
 
    
 
    
 
-                
    
-                  MPI_Bsend_init
-                
    
-                  		
 
-                
    
-                  unsupported
-                
    
-                  		
 
    
 
    
 
-                
    
-                  MPI_Buffer_attach
-                
    
-                  		
 
-                
    
-                  unsupported
-                
    
-                  		
 
    
 
    
 
-                
    
-                  MPI_Buffer_detach
-                
    
-                  		
 
-                
    
-                  unsupported
-                
    
-                  		
 
    
 
    
 
-                
    
-                  MPI_Cancel
-                
    
-                  		
 
-                
    
-                  request::cancel
-                
    
-                  		
 
    
 
    
 
-                
    
-                  MPI_Get_count
-                
    
-                  		
 
-                
    
-                  status::count
-                
    
-                  		
 
    
 
    
 
-                
    
-                  MPI_Ibsend
-                
    
-                  		
 
-                
    
-                  unsupported
-                
    
-                  		
 
    
 
    
 
-                
    
-                  MPI_Iprobe
-                
    
-                  		
 
-                
    
-                  communicator::iprobe
-                
    
-                  		
 
    
 
    
 
-                
    
-                  MPI_Irsend
-                
    
-                  		
 
-                
    
-                  unsupported
-                
    
-                  		
 
    
 
    
 
-                
    
-                  MPI_Isend
-                
    
-                  		
 
-                
    
-                  communicator::isend
-                
    
-                  		
 
    
 
    
 
-                
    
-                  MPI_Issend
-                
    
-                  		
 
-                
    
-                  unsupported
-                
    
-                  		
 
    
 
    
 
-                
    
-                  MPI_Irecv
-                
    
-                  		
 
-                
    
-                  communicator::irecv
-                
    
-                  		
 
    
 
    
 
-                
    
-                  MPI_Probe
-                
    
-                  		
 
-                
    
-                  communicator::probe
-                
    
-                  		
 
    
 
    
 
-                
    
-                  MPI_PROC_NULL
-                
    
-                  		
 
-                
    
-                  unsupported
-                
    
-                  		
 
    
 
    
 
-                
    
-                  MPI_Recv
-                
    
-                  		
 
-                
    
-                  communicator::recv
-                
    
-                  		
 
    
 
    
 
-                
    
-                  MPI_Recv_init
-                
    
-                  		
 
-                
    
-                  unsupported
-                
    
-                  		
 
    
 
    
 
-                
    
-                  MPI_Request_free
-                
    
-                  		
 
-                
    
-                  unsupported
-                
    
-                  		
 
    
 
    
 
-                
    
-                  MPI_Rsend
-                
    
-                  		
 
-                
    
-                  unsupported
-                
    
-                  		
 
    
 
    
 
-                
    
-                  MPI_Rsend_init
-                
    
-                  		
 
-                
    
-                  unsupported
-                
    
-                  		
 
    
 
    
 
-                
    
-                  MPI_Send
-                
    
-                  		
 
-                
    
-                  communicator::send
-                
    
-                  		
 
    
 
    
 
-                
    
-                  MPI_Sendrecv
-                
    
-                  		
 
-                
    
-                  unsupported
-                
    
-                  		
 
    
 
    
 
-                
    
-                  MPI_Sendrecv_replace
-                
    
-                  		
 
-                
    
-                  unsupported
-                
    
-                  		
 
    
 
    
 
-                
    
-                  MPI_Send_init
-                
    
-                  		
 
-                
    
-                  unsupported
-                
    
-                  		
 
    
 
    
 
-                
    
-                  MPI_Ssend
-                
    
-                  		
 
-                
    
-                  unsupported
-                
    
-                  		
 
    
 
    
 
-                
    
-                  MPI_Ssend_init
-                
    
-                  		
 
-                
    
-                  unsupported
-                
    
-                  		
 
    
 
    
 
-                
    
-                  MPI_Start
-                
    
-                  		
 
-                
    
-                  unsupported
-                
    
-                  		
 
    
 
    
 
-                
    
-                  MPI_Startall
-                
    
-                  		
 
-                
    
-                  unsupported
-                
    
-                  		
 
    
 
    
 
-                
    
-                  MPI_Test
-                
    
-                  		
 
-                
    
-                  request::test
-                
    
-                  		
 
    
 
    
 
-                
    
-                  MPI_Testall
-                
    
-                  		
 
-                
    
-                  test_all
-                
    
-                  		
 
    
 
    
 
-                
    
-                  MPI_Testany
-                
    
-                  		
 
-                
    
-                  test_any
-                
    
-                  		
 
    
 
    
 
-                
    
-                  MPI_Testsome
-                
    
-                  		
 
-                
    
-                  test_some
-                
    
-                  		
 
    
 
    
 
-                
    
-                  MPI_Test_cancelled
-                
    
-                  		
 
-                
    
-                  status::cancelled
-                
    
-                  		
 
    
 
    
 
-                
    
-                  MPI_Wait
-                
    
-                  		
 
-                
    
-                  request::wait
-                
    
-                  		
 
    
 
    
 
-                
    
-                  MPI_Waitall
-                
    
-                  		
 
-                
    
-                  wait_all
-                
    
-                  		
 
    
 
    
 
-                
    
-                  MPI_Waitany
-                
    
-                  		
 
-                
    
-                  wait_any
-                
    
-                  		
 
    
 
    
 
-                
    
-                  MPI_Waitsome
-                
    
-                  		
 
-                
    
-                  wait_some
-                
    
-                  		
 
    
     
 
    
 
    
 
    
-        Boost.MPI automatically maps C and C++ data types to their MPI equivalents.
-        The following table illustrates the mappings between C++ types and MPI datatype
-        constants.
-      
    
+          Boost.MPI automatically maps C and C++ data types to their MPI equivalents.
+          The following table illustrates the mappings between C++ types and MPI
+          datatype constants.
+        
    
 
    
-
    Table 25.2. Datatypes
    
+
    Table 25.2. Datatypes
    
 
    @@ -1461,301 +1561,303 @@ Process #6 thought of 650073868
 
+                  
    
+                    C Constant
+                  
    
+                
+                  
    
+                    Boost.MPI Equivalent
+                  
    
+                
+                  
    
+                    MPI_CHAR
+                  
    
+                
+                  
    
+                    signed char
+                  
    
+                
+                  
    
+                    MPI_SHORT
+                  
    
+                
+                  
    
+                    signed short
+                    int
+                  
    
+                
+                  
    
+                    MPI_INT
+                  
    
+                
+                  
    
+                    signed int
+                  
    
+                
+                  
    
+                    MPI_LONG
+                  
    
+                
+                  
    
+                    signed long
+                    int
+                  
    
+                
+                  
    
+                    MPI_UNSIGNED_CHAR
+                  
    
+                
+                  
    
+                    unsigned char
+                  
    
+                
+                  
    
+                    MPI_UNSIGNED_SHORT
+                  
    
+                
+                  
    
+                    unsigned short
+                    int
+                  
    
+                
+                  
    
+                    MPI_UNSIGNED_INT
+                  
    
+                
+                  
    
+                    unsigned int
+                  
    
+                
+                  
    
+                    MPI_UNSIGNED_LONG
+                  
    
+                
+                  
    
+                    unsigned long
+                    int
+                  
    
+                
+                  
    
+                    MPI_FLOAT
+                  
    
+                
+                  
    
+                    float
+                  
    
+                
+                  
    
+                    MPI_DOUBLE
+                  
    
+                
+                  
    
+                    double
+                  
    
+                
+                  
    
+                    MPI_LONG_DOUBLE
+                  
    
+                
+                  
    
+                    long double
+                  
    
+                
+                  
    
+                    MPI_BYTE
+                  
    
+                
+                  
    
+                    unused
+                  
    
+                
+                  
    
+                    MPI_PACKED
+                  
    
+                
+                  
    
+                    used internally for serialized
+                    data types
+                  
    
+                
+                  
    
+                    MPI_LONG_LONG_INT
+                  
    
+                
+                  
    
+                    long long
+                    int, if supported by compiler
+                  
    
+                
+                  
    
+                    MPI_UNSIGNED_LONG_LONG_INT
+                  
    
+                
+                  
    
+                    unsigned long
+                    long int,
+                    if supported by compiler
+                  
    
+                
+                  
    
+                    MPI_FLOAT_INT
+                  
    
+                
+                  
    
+                    std::pair<float,
+                    int>
+                  
    
+                
+                  
    
+                    MPI_DOUBLE_INT
+                  
    
+                
+                  
    
+                    std::pair<double,
+                    int>
+                  
    
+                
+                  
    
+                    MPI_LONG_INT
+                  
    
+                
+                  
    
+                    std::pair<long,
+                    int>
+                  
    
+                
+                  
    
+                    MPI_2INT
+                  
    
+                
+                  
    
+                    std::pair<int,
+                    int>
+                  
    
+                
+                  
    
+                    MPI_SHORT_INT
+                  
    
+                
+                  
    
+                    std::pair<short,
+                    int>
+                  
    
+                
+                  
    
+                    MPI_LONG_DOUBLE_INT
+                  
    
+                
+                  
    
+                    std::pair<long double, int>
+                  
    
+                
    
 
 

 
    
 
-                
    
-                  C Constant
-                
    
-                  		
 
-                
    
-                  Boost.MPI Equivalent
-                
    
-                  		
 
    
 
 
    
 
-                
    
-                  MPI_CHAR
-                
    
-                  		
 
-                
    
-                  signed char
-                
    
-                  		
 
    
 
    
 
-                
    
-                  MPI_SHORT
-                
    
-                  		
 
-                
    
-                  signed short
-                  int
-                
    
-                  		
 
    
 
    
 
-                
    
-                  MPI_INT
-                
    
-                  		
 
-                
    
-                  signed int
-                
    
-                  		
 
    
 
    
 
-                
    
-                  MPI_LONG
-                
    
-                  		
 
-                
    
-                  signed long
-                  int
-                
    
-                  		
 
    
 
    
 
-                
    
-                  MPI_UNSIGNED_CHAR
-                
    
-                  		
 
-                
    
-                  unsigned char
-                
    
-                  		
 
    
 
    
 
-                
    
-                  MPI_UNSIGNED_SHORT
-                
    
-                  		
 
-                
    
-                  unsigned short
-                  int
-                
    
-                  		
 
    
 
    
 
-                
    
-                  MPI_UNSIGNED_INT
-                
    
-                  		
 
-                
    
-                  unsigned int
-                
    
-                  		
 
    
 
    
 
-                
    
-                  MPI_UNSIGNED_LONG
-                
    
-                  		
 
-                
    
-                  unsigned long
-                  int
-                
    
-                  		
 
    
 
    
 
-                
    
-                  MPI_FLOAT
-                
    
-                  		
 
-                
    
-                  float
-                
    
-                  		
 
    
 
    
 
-                
    
-                  MPI_DOUBLE
-                
    
-                  		
 
-                
    
-                  double
-                
    
-                  		
 
    
 
    
 
-                
    
-                  MPI_LONG_DOUBLE
-                
    
-                  		
 
-                
    
-                  long double
-                
    
-                  		
 
    
 
    
 
-                
    
-                  MPI_BYTE
-                
    
-                  		
 
-                
    
-                  unused
-                
    
-                  		
 
    
 
    
 
-                
    
-                  MPI_PACKED
-                
    
-                  		
 
-                
    
-                  used internally for serialized
-                  data types
-                
    
-                  		
 
    
 
    
 
-                
    
-                  MPI_LONG_LONG_INT
-                
    
-                  		
 
-                
    
-                  long long
-                  int, if supported by compiler
-                
    
-                  		
 
    
 
    
 
-                
    
-                  MPI_UNSIGNED_LONG_LONG_INT
-                
    
-                  		
 
-                
    
-                  unsigned long
-                  long int,
-                  if supported by compiler
-                
    
-                  		
 
    
 
    
 
-                
    
-                  MPI_FLOAT_INT
-                
    
-                  		
 
-                
    
-                  std::pair<float,
-                  int>
-                
    
-                  		
 
    
 
    
 
-                
    
-                  MPI_DOUBLE_INT
-                
    
-                  		
 
-                
    
-                  std::pair<double,
-                  int>
-                
    
-                  		
 
    
 
    
 
-                
    
-                  MPI_LONG_INT
-                
    
-                  		
 
-                
    
-                  std::pair<long,
-                  int>
-                
    
-                  		
 
    
 
    
 
-                
    
-                  MPI_2INT
-                
    
-                  		
 
-                
    
-                  std::pair<int, int>
-                
    
-                  		
 
    
 
    
 
-                
    
-                  MPI_SHORT_INT
-                
    
-                  		
 
-                
    
-                  std::pair<short,
-                  int>
-                
    
-                  		
 
    
 
    
 
-                
    
-                  MPI_LONG_DOUBLE_INT
-                
    
-                  		
 
-                
    
-                  std::pair<long double, int>
-                
    
-                  		
 
    
     
 
    
 
    
 
    
-        Boost.MPI does not provide direct wrappers to the MPI derived datatypes functionality.
-        Instead, Boost.MPI relies on the Boost.Serialization
-        library to construct MPI datatypes for user-defined classes. The section
-        on user-defined data types describes
-        this mechanism, which is used for types that marked as "MPI datatypes"
-        using is_mpi_datatype.
-      
    
+          Boost.MPI does not provide direct wrappers to the MPI derived datatypes
+          functionality. Instead, Boost.MPI relies on the Boost.Serialization
+          library to construct MPI datatypes for user-defined classes. The section
+          on user-defined data types describes
+          this mechanism, which is used for types that marked as "MPI datatypes"
+          using is_mpi_datatype.
+        
    
 
    
-        The derived datatypes table that follows describes which C++ types correspond
-        to the functionality of the C MPI's datatype constructor. Boost.MPI may not
-        actually use the C MPI function listed when building datatypes of a certain
-        form. Since the actual datatypes built by Boost.MPI are typically hidden
-        from the user, many of these operations are called internally by Boost.MPI.
-      
    
+          The derived datatypes table that follows describes which C++ types correspond
+          to the functionality of the C MPI's datatype constructor. Boost.MPI may
+          not actually use the C MPI function listed when building datatypes of a
+          certain form. Since the actual datatypes built by Boost.MPI are typically
+          hidden from the user, many of these operations are called internally by
+          Boost.MPI.
+        
    
 
    
-
    Table 25.3. Derived datatypes
    
+
    Table 25.3. Derived datatypes
    
 
    @@ -1763,211 +1865,210 @@ Process #6 thought of 650073868
 
+                  
    
+                    C Function/Constant
+                  
    
+                
+                  
    
+                    Boost.MPI Equivalent
+                  
    
+                
+                  
    
+                    MPI_Address
+                  
    
+                
+                  
    
+                    used automatically in Boost.MPI for MPI version 1.x
+                  
    
+                
+                  
    
+                    MPI_Get_address
+                  
    
+                
+                  
    
+                    used automatically in Boost.MPI for MPI version 2.0 and higher
+                  
    
+                
+                  
    
+                    MPI_Type_commit
+                  
    
+                
+                  
    
+                    used automatically in Boost.MPI
+                  
    
+                
+                  
    
+                    MPI_Type_contiguous
+                  
    
+                
+                  
    
+                    arrays
+                  
    
+                
+                  
    
+                    MPI_Type_extent
+                  
    
+                
+                  
    
+                    used automatically in Boost.MPI
+                  
    
+                
+                  
    
+                    MPI_Type_free
+                  
    
+                
+                  
    
+                    used automatically in Boost.MPI
+                  
    
+                
+                  
    
+                    MPI_Type_hindexed
+                  
    
+                
+                  
    
+                    any type used as a subobject
+                  
    
+                
+                  
    
+                    MPI_Type_hvector
+                  
    
+                
+                  
    
+                    unused
+                  
    
+                
+                  
    
+                    MPI_Type_indexed
+                  
    
+                
+                  
    
+                    any type used as a subobject
+                  
    
+                
+                  
    
+                    MPI_Type_lb
+                  
    
+                
+                  
    
+                    unsupported
+                  
    
+                
+                  
    
+                    MPI_Type_size
+                  
    
+                
+                  
    
+                    used automatically in Boost.MPI
+                  
    
+                
+                  
    
+                    MPI_Type_struct
+                  
    
+                
+                  
    
+                    user-defined classes and structs with MPI 1.x
+                  
    
+                
+                  
    
+                    MPI_Type_create_struct
+                  
    
+                
+                  
    
+                    user-defined classes and structs with MPI 2.0 and higher
+                  
    
+                
+                  
    
+                    MPI_Type_ub
+                  
    
+                
+                  
    
+                    unsupported
+                  
    
+                
+                  
    
+                    MPI_Type_vector
+                  
    
+                
+                  
    
+                    used automatically in Boost.MPI
+                  
    
+                
    
 
 

 
    
 
-                
    
-                  C Function/Constant
-                
    
-                  		
 
-                
    
-                  Boost.MPI Equivalent
-                
    
-                  		
 
    
 
 
    
 
-                
    
-                  MPI_Address
-                
    
-                  		
 
-                
    
-                  used automatically in Boost.MPI for MPI version 1.x
-                
    
-                  		
 
    
 
    
 
-                
    
-                  MPI_Get_address
-                
    
-                  		
 
-                
    
-                  used automatically in Boost.MPI for MPI version 2.0 and higher
-                
    
-                  		
 
    
 
    
 
-                
    
-                  MPI_Type_commit
-                
    
-                  		
 
-                
    
-                  used automatically in Boost.MPI
-                
    
-                  		
 
    
 
    
 
-                
    
-                  MPI_Type_contiguous
-                
    
-                  		
 
-                
    
-                  arrays
-                
    
-                  		
 
    
 
    
 
-                
    
-                  MPI_Type_extent
-                
    
-                  		
 
-                
    
-                  used automatically in Boost.MPI
-                
    
-                  		
 
    
 
    
 
-                
    
-                  MPI_Type_free
-                
    
-                  		
 
-                
    
-                  used automatically in Boost.MPI
-                
    
-                  		
 
    
 
    
 
-                
    
-                  MPI_Type_hindexed
-                
    
-                  		
 
-                
    
-                  any type used as a subobject
-                
    
-                  		
 
    
 
    
 
-                
    
-                  MPI_Type_hvector
-                
    
-                  		
 
-                
    
-                  unused
-                
    
-                  		
 
    
 
    
 
-                
    
-                  MPI_Type_indexed
-                
    
-                  		
 
-                
    
-                  any type used as a subobject
-                
    
-                  		
 
    
 
    
 
-                
    
-                  MPI_Type_lb
-                
    
-                  		
 
-                
    
-                  unsupported
-                
    
-                  		
 
    
 
    
 
-                
    
-                  MPI_Type_size
-                
    
-                  		
 
-                
    
-                  used automatically in Boost.MPI
-                
    
-                  		
 
    
 
    
 
-                
    
-                  MPI_Type_struct
-                
    
-                  		
 
-                
    
-                  user-defined classes and structs with MPI 1.x
-                
    
-                  		
 
    
 
    
 
-                
    
-                  MPI_Type_create_struct
-                
    
-                  		
 
-                
    
-                  user-defined classes and structs with MPI 2.0 and higher
-                
    
-                  		
 
    
 
    
 
-                
    
-                  MPI_Type_ub
-                
    
-                  		
 
-                
    
-                  unsupported
-                
    
-                  		
 
    
 
    
 
-                
    
-                  MPI_Type_vector
-                
    
-                  		
 
-                
    
-                  used automatically in Boost.MPI
-                
    
-                  		
 
    
     
 
    
 
    
 
    
-        MPI's packing facilities store values into a contiguous buffer, which can
-        later be transmitted via MPI and unpacked into separate values via MPI's
-        unpacking facilities. As with datatypes, Boost.MPI provides an abstract interface
-        to MPI's packing and unpacking facilities. In particular, the two archive
-        classes packed_oarchive
-        and packed_iarchive
-        can be used to pack or unpack a contiguous buffer using MPI's facilities.
-      
    
+          MPI's packing facilities store values into a contiguous buffer, which can
+          later be transmitted via MPI and unpacked into separate values via MPI's
+          unpacking facilities. As with datatypes, Boost.MPI provides an abstract
+          interface to MPI's packing and unpacking facilities. In particular, the
+          two archive classes packed_oarchive and packed_iarchive
+          can be used to pack or unpack a contiguous buffer using MPI's facilities.
+        
    
 
    
-
    Table 25.4. Packing and unpacking
    
+
    Table 25.4. Packing and unpacking
    
 
    @@ -1975,63 +2076,63 @@ Process #6 thought of 650073868
 
+                  
    
+                    C Function
+                  
    
+                
+                  
    
+                    Boost.MPI Equivalent
+                  
    
+                
+                  
    
+                    MPI_Pack
+                  
    
+                
+                  
    
+                    packed_oarchive
+                  
    
+                
+                  
    
+                    MPI_Pack_size
+                  
    
+                
+                  
    
+                    used internally by Boost.MPI
+                  
    
+                
+                  
    
+                    MPI_Unpack
+                  
    
+                
+                  
    
+                    packed_iarchive
+                  
    
+                
    
 
 

 
    
 
-                
    
-                  C Function
-                
    
-                  		
 
-                
    
-                  Boost.MPI Equivalent
-                
    
-                  		
 
    
 
 
    
 
-                
    
-                  MPI_Pack
-                
    
-                  		
 
-                
    
-                  packed_oarchive
-                
    
-                  		
 
    
 
    
 
-                
    
-                  MPI_Pack_size
-                
    
-                  		
 
-                
    
-                  used internally by Boost.MPI
-                
    
-                  		
 
    
 
    
 
-                
    
-                  MPI_Unpack
-                
    
-                  		
 
-                
    
-                  packed_iarchive
-                
    
-                  		
 
    
     
 
    
 
    
 
    
-        Boost.MPI supports a one-to-one mapping for most of the MPI collectives.
-        For each collective provided by Boost.MPI, the underlying C MPI collective
-        will be invoked when it is possible (and efficient) to do so.
-      
    
+          Boost.MPI supports a one-to-one mapping for most of the MPI collectives.
+          For each collective provided by Boost.MPI, the underlying C MPI collective
+          will be invoked when it is possible (and efficient) to do so.
+        
    
 
    
-
    Table 25.5. Collectives
    
+
    Table 25.5. Collectives
    
 
    @@ -2039,213 +2140,213 @@ Process #6 thought of 650073868
 
+                  
    
+                    C Function
+                  
    
+                
+                  
    
+                    Boost.MPI Equivalent
+                  
    
+                
+                  
    
+                    MPI_Allgather
+                  
    
+                
+                  
    
+                    all_gather
+                  
    
+                
+                  
    
+                    MPI_Allgatherv
+                  
    
+                
+                  
    
+                    most uses supported by all_gather
+                  
    
+                
+                  
    
+                    MPI_Allreduce
+                  
    
+                
+                  
    
+                    all_reduce
+                  
    
+                
+                  
    
+                    MPI_Alltoall
+                  
    
+                
+                  
    
+                    all_to_all
+                  
    
+                
+                  
    
+                    MPI_Alltoallv
+                  
    
+                
+                  
    
+                    most uses supported by all_to_all
+                  
    
+                
+                  
    
+                    MPI_Barrier
+                  
    
+                
+                  
    
+                    communicator::barrier
+                  
    
+                
+                  
    
+                    MPI_Bcast
+                  
    
+                
+                  
    
+                    broadcast
+                  
    
+                
+                  
    
+                    MPI_Gather
+                  
    
+                
+                  
    
+                    gather
+                  
    
+                
+                  
    
+                    MPI_Gatherv
+                  
    
+                
+                  
    
+                    most uses supported by gather, other
+                    usages supported by gatherv
+                  
    
+                
+                  
    
+                    MPI_Reduce
+                  
    
+                
+                  
    
+                    reduce
+                  
    
+                
+                  
    
+                    MPI_Reduce_scatter
+                  
    
+                
+                  
    
+                    unsupported
+                  
    
+                
+                  
    
+                    MPI_Scan
+                  
    
+                
+                  
    
+                    scan
+                  
    
+                
+                  
    
+                    MPI_Scatter
+                  
    
+                
+                  
    
+                    scatter
+                  
    
+                
+                  
    
+                    MPI_Scatterv
+                  
    
+                
+                  
    
+                    most uses supported by scatter, other
+                    uses supported by scatterv
+                  
    
+                
+                  
    
+                    MPI_IN_PLACE
+                  
    
+                
+                  
    
+                    supported implicitly by all_reduce by omitting the
+                    output value
+                  
    
+                
    
 
 

 
    
 
-                
    
-                  C Function
-                
    
-                  		
 
-                
    
-                  Boost.MPI Equivalent
-                
    
-                  		
 
    
 
 
    
 
-                
    
-                  MPI_Allgather
-                
    
-                  		
 
-                
    
-                  all_gather
-                
    
-                  		
 
    
 
    
 
-                
    
-                  MPI_Allgatherv
-                
    
-                  		
 
-                
    
-                  most uses supported by all_gather
-                
    
-                  		
 
    
 
    
 
-                
    
-                  MPI_Allreduce
-                
    
-                  		
 
-                
    
-                  all_reduce
-                
    
-                  		
 
    
 
    
 
-                
    
-                  MPI_Alltoall
-                
    
-                  		
 
-                
    
-                  all_to_all
-                
    
-                  		
 
    
 
    
 
-                
    
-                  MPI_Alltoallv
-                
    
-                  		
 
-                
    
-                  most uses supported by all_to_all
-                
    
-                  		
 
    
 
    
 
-                
    
-                  MPI_Barrier
-                
    
-                  		
 
-                
    
-                  communicator::barrier
-                
    
-                  		
 
    
 
    
 
-                
    
-                  MPI_Bcast
-                
    
-                  		
 
-                
    
-                  broadcast
-                
    
-                  		
 
    
 
    
 
-                
    
-                  MPI_Gather
-                
    
-                  		
 
-                
    
-                  gather
-                
    
-                  		
 
    
 
    
 
-                
    
-                  MPI_Gatherv
-                
    
-                  		
 
-                
    
-                  most uses supported by gather, other
-                  usages supported by gatherv
-                
    
-                  		
 
    
 
    
 
-                
    
-                  MPI_Reduce
-                
    
-                  		
 
-                
    
-                  reduce
-                
    
-                  		
 
    
 
    
 
-                
    
-                  MPI_Reduce_scatter
-                
    
-                  		
 
-                
    
-                  unsupported
-                
    
-                  		
 
    
 
    
 
-                
    
-                  MPI_Scan
-                
    
-                  		
 
-                
    
-                  scan
-                
    
-                  		
 
    
 
    
 
-                
    
-                  MPI_Scatter
-                
    
-                  		
 
-                
    
-                  scatter
-                
    
-                  		
 
    
 
    
 
-                
    
-                  MPI_Scatterv
-                
    
-                  		
 
-                
    
-                  most uses supported by scatter, other
-                  uses supported by scatterv
-                
    
-                  		
 
    
 
    
 
-                
    
-                  MPI_IN_PLACE
-                
    
-                  		
 
-                
    
-                  supported implicitly by all_reduce by omitting the output
-                  value
-                
    
-                  		
 
    
     
 
    
 
    
 
    
-        Boost.MPI uses function objects to specify how reductions should occur in
-        its equivalents to MPI_Allreduce,
-        MPI_Reduce, and MPI_Scan. The following table illustrates
-        how predefined
-        and user-defined
-        reduction operations can be mapped between the C MPI and Boost.MPI.
-      
    
+          Boost.MPI uses function objects to specify how reductions should occur
+          in its equivalents to MPI_Allreduce,
+          MPI_Reduce, and MPI_Scan. The following table illustrates
+          how predefined
+          and user-defined
+          reduction operations can be mapped between the C MPI and Boost.MPI.
+        
    
 
    
-
    Table 25.6. Reduction operations
    
+
    Table 25.6. Reduction operations
    
 
    @@ -2253,198 +2354,199 @@ Process #6 thought of 650073868
 
+                  
    
+                    C Constant
+                  
    
+                
+                  
    
+                    Boost.MPI Equivalent
+                  
    
+                
+                  
    
+                    MPI_BAND
+                  
    
+                
+                  
    
+                    bitwise_and
+                  
    
+                
+                  
    
+                    MPI_BOR
+                  
    
+                
+                  
    
+                    bitwise_or
+                  
    
+                
+                  
    
+                    MPI_BXOR
+                  
    
+                
+                  
    
+                    bitwise_xor
+                  
    
+                
+                  
    
+                    MPI_LAND
+                  
    
+                
+                  
    
+                    std::logical_and
+                  
    
+                
+                  
    
+                    MPI_LOR
+                  
    
+                
+                  
    
+                    std::logical_or
+                  
    
+                
+                  
    
+                    MPI_LXOR
+                  
    
+                
+                  
    
+                    logical_xor
+                  
    
+                
+                  
    
+                    MPI_MAX
+                  
    
+                
+                  
    
+                    maximum
+                  
    
+                
+                  
    
+                    MPI_MAXLOC
+                  
    
+                
+                  
    
+                    unsupported
+                  
    
+                
+                  
    
+                    MPI_MIN
+                  
    
+                
+                  
    
+                    minimum
+                  
    
+                
+                  
    
+                    MPI_MINLOC
+                  
    
+                
+                  
    
+                    unsupported
+                  
    
+                
+                  
    
+                    MPI_Op_create
+                  
    
+                
+                  
    
+                    used internally by Boost.MPI
+                  
    
+                
+                  
    
+                    MPI_Op_free
+                  
    
+                
+                  
    
+                    used internally by Boost.MPI
+                  
    
+                
+                  
    
+                    MPI_PROD
+                  
    
+                
+                  
    
+                    std::multiplies
+                  
    
+                
+                  
    
+                    MPI_SUM
+                  
    
+                
+                  
    
+                    std::plus
+                  
    
+                
    
 
 

 
    
 
-                
    
-                  C Constant
-                
    
-                  		
 
-                
    
-                  Boost.MPI Equivalent
-                
    
-                  		
 
    
 
 
    
 
-                
    
-                  MPI_BAND
-                
    
-                  		
 
-                
    
-                  bitwise_and
-                
    
-                  		
 
    
 
    
 
-                
    
-                  MPI_BOR
-                
    
-                  		
 
-                
    
-                  bitwise_or
-                
    
-                  		
 
    
 
    
 
-                
    
-                  MPI_BXOR
-                
    
-                  		
 
-                
    
-                  bitwise_xor
-                
    
-                  		
 
    
 
    
 
-                
    
-                  MPI_LAND
-                
    
-                  		
 
-                
    
-                  std::logical_and
-                
    
-                  		
 
    
 
    
 
-                
    
-                  MPI_LOR
-                
    
-                  		
 
-                
    
-                  std::logical_or
-                
    
-                  		
 
    
 
    
 
-                
    
-                  MPI_LXOR
-                
    
-                  		
 
-                
    
-                  logical_xor
-                
    
-                  		
 
    
 
    
 
-                
    
-                  MPI_MAX
-                
    
-                  		
 
-                
    
-                  maximum
-                
    
-                  		
 
    
 
    
 
-                
    
-                  MPI_MAXLOC
-                
    
-                  		
 
-                
    
-                  unsupported
-                
    
-                  		
 
    
 
    
 
-                
    
-                  MPI_MIN
-                
    
-                  		
 
-                
    
-                  minimum
-                
    
-                  		
 
    
 
    
 
-                
    
-                  MPI_MINLOC
-                
    
-                  		
 
-                
    
-                  unsupported
-                
    
-                  		
 
    
 
    
 
-                
    
-                  MPI_Op_create
-                
    
-                  		
 
-                
    
-                  used internally by Boost.MPI
-                
    
-                  		
 
    
 
    
 
-                
    
-                  MPI_Op_free
-                
    
-                  		
 
-                
    
-                  used internally by Boost.MPI
-                
    
-                  		
 
    
 
    
 
-                
    
-                  MPI_PROD
-                
    
-                  		
 
-                
    
-                  std::multiplies
-                
    
-                  		
 
    
 
    
 
-                
    
-                  MPI_SUM
-                
    
-                  		
 
-                
    
-                  std::plus
-                
    
-                  		
 
    
     
 
    
 
    
 
    
-        MPI defines several special communicators, including MPI_COMM_WORLD
-        (including all processes that the local process can communicate with), MPI_COMM_SELF (including only the local
-        process), and MPI_COMM_EMPTY
-        (including no processes). These special communicators are all instances of
-        the communicator
-        class in Boost.MPI.
-      
    
+          MPI defines several special communicators, including MPI_COMM_WORLD
+          (including all processes that the local process can communicate with),
+          MPI_COMM_SELF (including
+          only the local process), and MPI_COMM_EMPTY
+          (including no processes). These special communicators are all instances
+          of the communicator
+          class in Boost.MPI.
+        
    
 
    
-
    Table 25.7. Predefined communicators
    
+
    Table 25.7. Predefined communicators
    
 
    @@ -2452,63 +2554,63 @@ Process #6 thought of 650073868
 
+                  
    
+                    C Constant
+                  
    
+                
+                  
    
+                    Boost.MPI Equivalent
+                  
    
+                
+                  
    
+                    MPI_COMM_WORLD
+                  
    
+                
+                  
    
+                    a default-constructed communicator
+                  
    
+                
+                  
    
+                    MPI_COMM_SELF
+                  
    
+                
+                  
    
+                    a communicator
+                    that contains only the current process
+                  
    
+                
+                  
    
+                    MPI_COMM_EMPTY
+                  
    
+                
+                  
    
+                    a communicator
+                    that evaluates false
+                  
    
+                
    
 
 

 
    
 
-                
    
-                  C Constant
-                
    
-                  		
 
-                
    
-                  Boost.MPI Equivalent
-                
    
-                  		
 
    
 
 
    
 
-                
    
-                  MPI_COMM_WORLD
-                
    
-                  		
 
-                
    
-                  a default-constructed communicator
-                
    
-                  		
 
    
 
    
 
-                
    
-                  MPI_COMM_SELF
-                
    
-                  		
 
-                
    
-                  a communicator
-                  that contains only the current process
-                
    
-                  		
 
    
 
    
 
-                
    
-                  MPI_COMM_EMPTY
-                
    
-                  		
 
-                
    
-                  a communicator
-                  that evaluates false
-                
    
-                  		
 
    
     
 
    
 
    
 
    
-        Boost.MPI supports groups of processes through its group class.
-      
    
+          Boost.MPI supports groups of processes through its group class.
+        
    
 
    
-
    Table 25.8. Group operations and constants
    
+
    Table 25.8. Group operations and constants
    
 
    @@ -2516,234 +2618,235 @@ Process #6 thought of 650073868
 
+                  
    
+                    C Function/Constant
+                  
    
+                
+                  
    
+                    Boost.MPI Equivalent
+                  
    
+                
+                  
    
+                    MPI_GROUP_EMPTY
+                  
    
+                
+                  
    
+                    a default-constructed group
+                  
    
+                
+                  
    
+                    MPI_Group_size
+                  
    
+                
+                  
    
+                    group::size
+                  
    
+                
+                  
    
+                    MPI_Group_rank
+                  
    
+                
+                  
    
+                    memberref boost::mpi::group::rank group::rank
+                  
    
+                
+                  
    
+                    MPI_Group_translate_ranks
+                  
    
+                
+                  
    
+                    memberref boost::mpi::group::translate_ranks group::translate_ranks
+                  
    
+                
+                  
    
+                    MPI_Group_compare
+                  
    
+                
+                  
    
+                    operators == and
+                    !=
+                  
    
+                
+                  
    
+                    MPI_IDENT
+                  
    
+                
+                  
    
+                    operators == and
+                    !=
+                  
    
+                
+                  
    
+                    MPI_SIMILAR
+                  
    
+                
+                  
    
+                    operators == and
+                    !=
+                  
    
+                
+                  
    
+                    MPI_UNEQUAL
+                  
    
+                
+                  
    
+                    operators == and
+                    !=
+                  
    
+                
+                  
    
+                    MPI_Comm_group
+                  
    
+                
+                  
    
+                    communicator::group
+                  
    
+                
+                  
    
+                    MPI_Group_union
+                  
    
+                
+                  
    
+                    operator | for groups
+                  
    
+                
+                  
    
+                    MPI_Group_intersection
+                  
    
+                
+                  
    
+                    operator & for
+                    groups
+                  
    
+                
+                  
    
+                    MPI_Group_difference
+                  
    
+                
+                  
    
+                    operator - for groups
+                  
    
+                
+                  
    
+                    MPI_Group_incl
+                  
    
+                
+                  
    
+                    group::include
+                  
    
+                
+                  
    
+                    MPI_Group_excl
+                  
    
+                
+                  
    
+                    group::exclude
+                  
    
+                
+                  
    
+                    MPI_Group_range_incl
+                  
    
+                
+                  
    
+                    unsupported
+                  
    
+                
+                  
    
+                    MPI_Group_range_excl
+                  
    
+                
+                  
    
+                    unsupported
+                  
    
+                
+                  
    
+                    MPI_Group_free
+                  
    
+                
+                  
    
+                    used automatically in Boost.MPI
+                  
    
+                
    
 
 

 
    
 
-                
    
-                  C Function/Constant
-                
    
-                  		
 
-                
    
-                  Boost.MPI Equivalent
-                
    
-                  		
 
    
 
 
    
 
-                
    
-                  MPI_GROUP_EMPTY
-                
    
-                  		
 
-                
    
-                  a default-constructed group
-                
    
-                  		
 
    
 
    
 
-                
    
-                  MPI_Group_size
-                
    
-                  		
 
-                
    
-                  group::size
-                
    
-                  		
 
    
 
    
 
-                
    
-                  MPI_Group_rank
-                
    
-                  		
 
-                
    
-                  memberref boost::mpi::group::rank group::rank
-                
    
-                  		
 
    
 
    
 
-                
    
-                  MPI_Group_translate_ranks
-                
    
-                  		
 
-                
    
-                  memberref boost::mpi::group::translate_ranks group::translate_ranks
-                
    
-                  		
 
    
 
    
 
-                
    
-                  MPI_Group_compare
-                
    
-                  		
 
-                
    
-                  operators == and
-                  !=
-                
    
-                  		
 
    
 
    
 
-                
    
-                  MPI_IDENT
-                
    
-                  		
 
-                
    
-                  operators == and
-                  !=
-                
    
-                  		
 
    
 
    
 
-                
    
-                  MPI_SIMILAR
-                
    
-                  		
 
-                
    
-                  operators == and
-                  !=
-                
    
-                  		
 
    
 
    
 
-                
    
-                  MPI_UNEQUAL
-                
    
-                  		
 
-                
    
-                  operators == and
-                  !=
-                
    
-                  		
 
    
 
    
 
-                
    
-                  MPI_Comm_group
-                
    
-                  		
 
-                
    
-                  communicator::group
-                
    
-                  		
 
    
 
    
 
-                
    
-                  MPI_Group_union
-                
    
-                  		
 
-                
    
-                  operator | for groups
-                
    
-                  		
 
    
 
    
 
-                
    
-                  MPI_Group_intersection
-                
    
-                  		
 
-                
    
-                  operator & for
-                  groups
-                
    
-                  		
 
    
 
    
 
-                
    
-                  MPI_Group_difference
-                
    
-                  		
 
-                
    
-                  operator - for groups
-                
    
-                  		
 
    
 
    
 
-                
    
-                  MPI_Group_incl
-                
    
-                  		
 
-                
    
-                  group::include
-                
    
-                  		
 
    
 
    
 
-                
    
-                  MPI_Group_excl
-                
    
-                  		
 
-                
    
-                  group::exclude
-                
    
-                  		
 
    
 
    
 
-                
    
-                  MPI_Group_range_incl
-                
    
-                  		
 
-                
    
-                  unsupported
-                
    
-                  		
 
    
 
    
 
-                
    
-                  MPI_Group_range_excl
-                
    
-                  		
 
-                
    
-                  unsupported
-                
    
-                  		
 
    
 
    
 
-                
    
-                  MPI_Group_free
-                
    
-                  		
 
-                
    
-                  used automatically in Boost.MPI
-                
    
-                  		
 
    
     
 
    
 
    
 
    
-        Boost.MPI provides manipulation of communicators through the communicator class.
-      
    
+          Boost.MPI provides manipulation of communicators through the communicator
+          class.
+        
    
 
    
-
    Table 25.9. Communicator operations
    
+
    Table 25.9. Communicator operations
    
 
    @@ -2751,113 +2854,113 @@ Process #6 thought of 650073868
 
+                  
    
+                    C Function
+                  
    
+                
+                  
    
+                    Boost.MPI Equivalent
+                  
    
+                
+                  
    
+                    MPI_Comm_size
+                  
    
+                
+                  
    
+                    communicator::size
+                  
    
+                
+                  
    
+                    MPI_Comm_rank
+                  
    
+                
+                  
    
+                    communicator::rank
+                  
    
+                
+                  
    
+                    MPI_Comm_compare
+                  
    
+                
+                  
    
+                    operators == and
+                    !=
+                  
    
+                
+                  
    
+                    MPI_Comm_dup
+                  
    
+                
+                  
    
+                    communicator
+                    class constructor using comm_duplicate
+                  
    
+                
+                  
    
+                    MPI_Comm_create
+                  
    
+                
+                  
    
+                    communicator
+                    constructor
+                  
    
+                
+                  
    
+                    MPI_Comm_split
+                  
    
+                
+                  
    
+                    communicator::split
+                  
    
+                
+                  
    
+                    MPI_Comm_free
+                  
    
+                
+                  
    
+                    used automatically in Boost.MPI
+                  
    
+                
    
 
 

 
    
 
-                
    
-                  C Function
-                
    
-                  		
 
-                
    
-                  Boost.MPI Equivalent
-                
    
-                  		
 
    
 
 
    
 
-                
    
-                  MPI_Comm_size
-                
    
-                  		
 
-                
    
-                  communicator::size
-                
    
-                  		
 
    
 
    
 
-                
    
-                  MPI_Comm_rank
-                
    
-                  		
 
-                
    
-                  communicator::rank
-                
    
-                  		
 
    
 
    
 
-                
    
-                  MPI_Comm_compare
-                
    
-                  		
 
-                
    
-                  operators == and
-                  !=
-                
    
-                  		
 
    
 
    
 
-                
    
-                  MPI_Comm_dup
-                
    
-                  		
 
-                
    
-                  communicator
-                  class constructor using comm_duplicate
-                
    
-                  		
 
    
 
    
 
-                
    
-                  MPI_Comm_create
-                
    
-                  		
 
-                
    
-                  communicator
-                  constructor
-                
    
-                  		
 
    
 
    
 
-                
    
-                  MPI_Comm_split
-                
    
-                  		
 
-                
    
-                  communicator::split
-                
    
-                  		
 
    
 
    
 
-                
    
-                  MPI_Comm_free
-                
    
-                  		
 
-                
    
-                  used automatically in Boost.MPI
-                
    
-                  		
 
    
     
 
    
 
    
 
    
-        Boost.MPI currently provides support for inter-communicators via the intercommunicator
-        class.
-      
    
+          Boost.MPI currently provides support for inter-communicators via the intercommunicator
+          class.
+        
    
 
    
-
    Table 25.10. Inter-communicator operations
    
+
    Table 25.10. Inter-communicator operations
    
 
    @@ -2865,87 +2968,87 @@ Process #6 thought of 650073868
 
+                  
    
+                    C Function
+                  
    
+                
+                  
    
+                    Boost.MPI Equivalent
+                  
    
+                
+                  
    
+                    MPI_Comm_test_inter
+                  
    
+                
+                  
    
+                    use communicator::as_intercommunicator
+                  
    
+                
+                  
    
+                    MPI_Comm_remote_size
+                  
    
+                
+                  
    
+                    boost::mpi::intercommunicator::remote_size
+                    intercommunicator::remote_size
+                  
    
+                
+                  
    
+                    MPI_Comm_remote_group
+                  
    
+                
+                  
    
+                    intercommunicator::remote_group
+                  
    
+                
+                  
    
+                    MPI_Intercomm_create
+                  
    
+                
+                  
    
+                    intercommunicator
+                    constructor
+                  
    
+                
+                  
    
+                    MPI_Intercomm_merge
+                  
    
+                
+                  
    
+                    intercommunicator::merge
+                  
    
+                
    
 
 

 
    
 
-                
    
-                  C Function
-                
    
-                  		
 
-                
    
-                  Boost.MPI Equivalent
-                
    
-                  		
 
    
 
 
    
 
-                
    
-                  MPI_Comm_test_inter
-                
    
-                  		
 
-                
    
-                  use communicator::as_intercommunicator
-                
    
-                  		
 
    
 
    
 
-                
    
-                  MPI_Comm_remote_size
-                
    
-                  		
 
-                
    
-                  boost::mpi::intercommunicator::remote_size
-                  intercommunicator::remote_size
-                
    
-                  		
 
    
 
    
 
-                
    
-                  MPI_Comm_remote_group
-                
    
-                  		
 
-                
    
-                  intercommunicator::remote_group
-                
    
-                  		
 
    
 
    
 
-                
    
-                  MPI_Intercomm_create
-                
    
-                  		
 
-                
    
-                  intercommunicator
-                  constructor
-                
    
-                  		
 
    
 
    
 
-                
    
-                  MPI_Intercomm_merge
-                
    
-                  		
 
-                
    
-                  intercommunicator::merge
-                
    
-                  		
 
    
     
 
    
 
    
 
    
-        Boost.MPI currently provides no support for attribute caching.
-      
    
+          Boost.MPI currently provides no support for attribute caching.
+        
    
 
    
-
    Table 25.11. Attributes and caching
    
+
    Table 25.11. Attributes and caching
    
 
    @@ -2953,150 +3056,150 @@ Process #6 thought of 650073868
 
+                  
    
+                    C Function/Constant
+                  
    
+                
+                  
    
+                    Boost.MPI Equivalent
+                  
    
+                
+                  
    
+                    MPI_NULL_COPY_FN
+                  
    
+                
+                  
    
+                    unsupported
+                  
    
+                
+                  
    
+                    MPI_NULL_DELETE_FN
+                  
    
+                
+                  
    
+                    unsupported
+                  
    
+                
+                  
    
+                    MPI_KEYVAL_INVALID
+                  
    
+                
+                  
    
+                    unsupported
+                  
    
+                
+                  
    
+                    MPI_Keyval_create
+                  
    
+                
+                  
    
+                    unsupported
+                  
    
+                
+                  
    
+                    MPI_Copy_function
+                  
    
+                
+                  
    
+                    unsupported
+                  
    
+                
+                  
    
+                    MPI_Delete_function
+                  
    
+                
+                  
    
+                    unsupported
+                  
    
+                
+                  
    
+                    MPI_Keyval_free
+                  
    
+                
+                  
    
+                    unsupported
+                  
    
+                
+                  
    
+                    MPI_Attr_put
+                  
    
+                
+                  
    
+                    unsupported
+                  
    
+                
+                  
    
+                    MPI_Attr_get
+                  
    
+                
+                  
    
+                    unsupported
+                  
    
+                
+                  
    
+                    MPI_Attr_delete
+                  
    
+                
+                  
    
+                    unsupported
+                  
    
+                
    
 
 

 
    
 
-                
    
-                  C Function/Constant
-                
    
-                  		
 
-                
    
-                  Boost.MPI Equivalent
-                
    
-                  		
 
    
 
 
    
 
-                
    
-                  MPI_NULL_COPY_FN
-                
    
-                  		
 
-                
    
-                  unsupported
-                
    
-                  		
 
    
 
    
 
-                
    
-                  MPI_NULL_DELETE_FN
-                
    
-                  		
 
-                
    
-                  unsupported
-                
    
-                  		
 
    
 
    
 
-                
    
-                  MPI_KEYVAL_INVALID
-                
    
-                  		
 
-                
    
-                  unsupported
-                
    
-                  		
 
    
 
    
 
-                
    
-                  MPI_Keyval_create
-                
    
-                  		
 
-                
    
-                  unsupported
-                
    
-                  		
 
    
 
    
 
-                
    
-                  MPI_Copy_function
-                
    
-                  		
 
-                
    
-                  unsupported
-                
    
-                  		
 
    
 
    
 
-                
    
-                  MPI_Delete_function
-                
    
-                  		
 
-                
    
-                  unsupported
-                
    
-                  		
 
    
 
    
 
-                
    
-                  MPI_Keyval_free
-                
    
-                  		
 
-                
    
-                  unsupported
-                
    
-                  		
 
    
 
    
 
-                
    
-                  MPI_Attr_put
-                
    
-                  		
 
-                
    
-                  unsupported
-                
    
-                  		
 
    
 
    
 
-                
    
-                  MPI_Attr_get
-                
    
-                  		
 
-                
    
-                  unsupported
-                
    
-                  		
 
    
 
    
 
-                
    
-                  MPI_Attr_delete
-                
    
-                  		
 
-                
    
-                  unsupported
-                
    
-                  		
 
    
     
 
    
 
    
 
    
-        Boost.MPI will provide complete support for creating communicators with different
-        topologies and later querying those topologies. Support for graph topologies
-        is provided via an interface to the Boost
-        Graph Library (BGL), where a communicator can be created which matches
-        the structure of any BGL graph, and the graph topology of a communicator
-        can be viewed as a BGL graph for use in existing, generic graph algorithms.
-      
    
+          Boost.MPI will provide complete support for creating communicators with
+          different topologies and later querying those topologies. Support for graph
+          topologies is provided via an interface to the Boost
+          Graph Library (BGL), where a communicator can be created which
+          matches the structure of any BGL graph, and the graph topology of a communicator
+          can be viewed as a BGL graph for use in existing, generic graph algorithms.
+        
    
 
    
-
    Table 25.12. Process topologies
    
+
    Table 25.12. Process topologies
    
 
    @@ -3104,246 +3207,247 @@ Process #6 thought of 650073868
 
+                  
    
+                    C Function/Constant
+                  
    
+                
+                  
    
+                    Boost.MPI Equivalent
+                  
    
+                
+                  
    
+                    MPI_GRAPH
+                  
    
+                
+                  
    
+                    unnecessary; use communicator::as_graph_communicator
+                  
    
+                
+                  
    
+                    MPI_CART
+                  
    
+                
+                  
    
+                    unnecessary; use communicator::has_cartesian_topology
+                  
    
+                
+                  
    
+                    MPI_Cart_create
+                  
    
+                
+                  
    
+                    cartesian_communicator
+                    constructor
+                  
    
+                
+                  
    
+                    MPI_Dims_create
+                  
    
+                
+                  
    
+                    cartesian_dimensions
+                  
    
+                
+                  
    
+                    MPI_Graph_create
+                  
    
+                
+                  
    
+                    graph_communicator ctors
+                  
    
+                
+                  
    
+                    MPI_Topo_test
+                  
    
+                
+                  
    
+                    communicator::as_graph_communicator,
+                    communicator::has_cartesian_topology
+                  
    
+                
+                  
    
+                    MPI_Graphdims_get
+                  
    
+                
+                  
    
+                    num_vertices,
+                    num_edges
+                  
    
+                
+                  
    
+                    MPI_Graph_get
+                  
    
+                
+                  
    
+                    vertices,
+                    edges
+                  
    
+                
+                  
    
+                    MPI_Cartdim_get
+                  
    
+                
+                  
    
+                    cartesian_communicator::ndims 
+                  
    
+                
+                  
    
+                    MPI_Cart_get
+                  
    
+                
+                  
    
+                    cartesian_communicator::topology 
+                  
    
+                
+                  
    
+                    MPI_Cart_rank
+                  
    
+                
+                  
    
+                    cartesian_communicator::rank 
+                  
    
+                
+                  
    
+                    MPI_Cart_coords
+                  
    
+                
+                  
    
+                    cartesian_communicator::coordinates 
+                  
    
+                
+                  
    
+                    MPI_Graph_neighbors_count
+                  
    
+                
+                  
    
+                    out_degree
+                  
    
+                
+                  
    
+                    MPI_Graph_neighbors
+                  
    
+                
+                  
    
+                    out_edges,
+                    adjacent_vertices
+                  
    
+                
+                  
    
+                    MPI_Cart_shift
+                  
    
+                
+                  
    
+                    unsupported
+                  
    
+                
+                  
    
+                    MPI_Cart_sub
+                  
    
+                
+                  
    
+                    cartesian_communicator
+                    constructor
+                  
    
+                
+                  
    
+                    MPI_Cart_map
+                  
    
+                
+                  
    
+                    unsupported
+                  
    
+                
+                  
    
+                    MPI_Graph_map
+                  
    
+                
+                  
    
+                    unsupported
+                  
    
+                
    
 
 

 
    
 
-                
    
-                  C Function/Constant
-                
    
-                  		
 
-                
    
-                  Boost.MPI Equivalent
-                
    
-                  		
 
    
 
 
    
 
-                
    
-                  MPI_GRAPH
-                
    
-                  		
 
-                
    
-                  unnecessary; use communicator::as_graph_communicator
-                
    
-                  		
 
    
 
    
 
-                
    
-                  MPI_CART
-                
    
-                  		
 
-                
    
-                  unnecessary; use communicator::has_cartesian_topology
-                
    
-                  		
 
    
 
    
 
-                
    
-                  MPI_Cart_create
-                
    
-                  		
 
-                
    
-                  unsupported
-                
    
-                  		
 
    
 
    
 
-                
    
-                  MPI_Dims_create
-                
    
-                  		
 
-                
    
-                  unsupported
-                
    
-                  		
 
    
 
    
 
-                
    
-                  MPI_Graph_create
-                
    
-                  		
 
-                
    
-                  graph_communicator
-                  ctors
-                
    
-                  		
 
    
 
    
 
-                
    
-                  MPI_Topo_test
-                
    
-                  		
 
-                
    
-                  communicator::as_graph_communicator,
-                  communicator::has_cartesian_topology
-                
    
-                  		
 
    
 
    
 
-                
    
-                  MPI_Graphdims_get
-                
    
-                  		
 
-                
    
-                  num_vertices,
-                  num_edges
-                
    
-                  		
 
    
 
    
 
-                
    
-                  MPI_Graph_get
-                
    
-                  		
 
-                
    
-                  vertices,
-                  edges
-                
    
-                  		
 
    
 
    
 
-                
    
-                  MPI_Cartdim_get
-                
    
-                  		
 
-                
    
-                  unsupported
-                
    
-                  		
 
    
 
    
 
-                
    
-                  MPI_Cart_get
-                
    
-                  		
 
-                
    
-                  unsupported
-                
    
-                  		
 
    
 
    
 
-                
    
-                  MPI_Cart_rank
-                
    
-                  		
 
-                
    
-                  unsupported
-                
    
-                  		
 
    
 
    
 
-                
    
-                  MPI_Cart_coords
-                
    
-                  		
 
-                
    
-                  unsupported
-                
    
-                  		
 
    
 
    
 
-                
    
-                  MPI_Graph_neighbors_count
-                
    
-                  		
 
-                
    
-                  out_degree
-                
    
-                  		
 
    
 
    
 
-                
    
-                  MPI_Graph_neighbors
-                
    
-                  		
 
-                
    
-                  out_edges,
-                  adjacent_vertices
-                
    
-                  		
 
    
 
    
 
-                
    
-                  MPI_Cart_shift
-                
    
-                  		
 
-                
    
-                  unsupported
-                
    
-                  		
 
    
 
    
 
-                
    
-                  MPI_Cart_sub
-                
    
-                  		
 
-                
    
-                  unsupported
-                
    
-                  		
 
    
 
    
 
-                
    
-                  MPI_Cart_map
-                
    
-                  		
 
-                
    
-                  unsupported
-                
    
-                  		
 
    
 
    
 
-                
    
-                  MPI_Graph_map
-                
    
-                  		
 
-                
    
-                  unsupported
-                
    
-                  		
 
    
     
 
    
 
    
 
    
-        Boost.MPI supports environmental inquires through the environment class.
-      
    
+          Boost.MPI supports environmental inquires through the environment class.
+        
    
 
    
-
    Table 25.13. Environmental inquiries
    
+
    Table 25.13. Environmental inquiries
    
 
    @@ -3351,74 +3455,74 @@ Process #6 thought of 650073868
 
+                  
    
+                    C Function/Constant
+                  
    
+                
+                  
    
+                    Boost.MPI Equivalent
+                  
    
+                
+                  
    
+                    MPI_TAG_UB
+                  
    
+                
+                  
    
+                    unnecessary; use environment::max_tag
+                  
    
+                
+                  
    
+                    MPI_HOST
+                  
    
+                
+                  
    
+                    unnecessary; use environment::host_rank
+                  
    
+                
+                  
    
+                    MPI_IO
+                  
    
+                
+                  
    
+                    unnecessary; use environment::io_rank
+                  
    
+                
+                  
    
+                    MPI_Get_processor_name
+                  
    
+                
+                  
    
+                    environment::processor_name
+                  
    
+                
    
 
 

 
    
 
-                
    
-                  C Function/Constant
-                
    
-                  		
 
-                
    
-                  Boost.MPI Equivalent
-                
    
-                  		
 
    
 
 
    
 
-                
    
-                  MPI_TAG_UB
-                
    
-                  		
 
-                
    
-                  unnecessary; use environment::max_tag
-                
    
-                  		
 
    
 
    
 
-                
    
-                  MPI_HOST
-                
    
-                  		
 
-                
    
-                  unnecessary; use environment::host_rank
-                
    
-                  		
 
    
 
    
 
-                
    
-                  MPI_IO
-                
    
-                  		
 
-                
    
-                  unnecessary; use environment::io_rank
-                
    
-                  		
 
    
 
    
 
-                
    
-                  MPI_Get_processor_name
-                
    
-                  		
 
-                
    
-                  environment::processor_name
-                
    
-                  		
 
    
     
 
    
 
    
 
    
-        Boost.MPI translates MPI errors into exceptions, reported via the exception
-        class.
-      
    
+          Boost.MPI translates MPI errors into exceptions, reported via the exception
+          class.
+        
    
 
    
-
    Table 25.14. Error handling
    
+
    Table 25.14. Error handling
    
 
    @@ -3426,123 +3530,123 @@ Process #6 thought of 650073868
 
+                  
    
+                    C Function/Constant
+                  
    
+                
+                  
    
+                    Boost.MPI Equivalent
+                  
    
+                
+                  
    
+                    MPI_ERRORS_ARE_FATAL
+                  
    
+                
+                  
    
+                    unused; errors are translated into Boost.MPI exceptions
+                  
    
+                
+                  
    
+                    MPI_ERRORS_RETURN
+                  
    
+                
+                  
    
+                    unused; errors are translated into Boost.MPI exceptions
+                  
    
+                
+                  
    
+                    MPI_errhandler_create
+                  
    
+                
+                  
    
+                    unused; errors are translated into Boost.MPI exceptions
+                  
    
+                
+                  
    
+                    MPI_errhandler_set
+                  
    
+                
+                  
    
+                    unused; errors are translated into Boost.MPI exceptions
+                  
    
+                
+                  
    
+                    MPI_errhandler_get
+                  
    
+                
+                  
    
+                    unused; errors are translated into Boost.MPI exceptions
+                  
    
+                
+                  
    
+                    MPI_errhandler_free
+                  
    
+                
+                  
    
+                    unused; errors are translated into Boost.MPI exceptions
+                  
    
+                
+                  
    
+                    MPI_Error_string
+                  
    
+                
+                  
    
+                    used internally by Boost.MPI
+                  
    
+                
+                  
    
+                    MPI_Error_class
+                  
    
+                
+                  
    
+                    exception::error_class
+                  
    
+                
    
 
 

 
    
 
-                
    
-                  C Function/Constant
-                
    
-                  		
 
-                
    
-                  Boost.MPI Equivalent
-                
    
-                  		
 
    
 
 
    
 
-                
    
-                  MPI_ERRORS_ARE_FATAL
-                
    
-                  		
 
-                
    
-                  unused; errors are translated into Boost.MPI exceptions
-                
    
-                  		
 
    
 
    
 
-                
    
-                  MPI_ERRORS_RETURN
-                
    
-                  		
 
-                
    
-                  unused; errors are translated into Boost.MPI exceptions
-                
    
-                  		
 
    
 
    
 
-                
    
-                  MPI_errhandler_create
-                
    
-                  		
 
-                
    
-                  unused; errors are translated into Boost.MPI exceptions
-                
    
-                  		
 
    
 
    
 
-                
    
-                  MPI_errhandler_set
-                
    
-                  		
 
-                
    
-                  unused; errors are translated into Boost.MPI exceptions
-                
    
-                  		
 
    
 
    
 
-                
    
-                  MPI_errhandler_get
-                
    
-                  		
 
-                
    
-                  unused; errors are translated into Boost.MPI exceptions
-                
    
-                  		
 
    
 
    
 
-                
    
-                  MPI_errhandler_free
-                
    
-                  		
 
-                
    
-                  unused; errors are translated into Boost.MPI exceptions
-                
    
-                  		
 
    
 
    
 
-                
    
-                  MPI_Error_string
-                
    
-                  		
 
-                
    
-                  used internally by Boost.MPI
-                
    
-                  		
 
    
 
    
 
-                
    
-                  MPI_Error_class
-                
    
-                  		
 
-                
    
-                  exception::error_class
-                
    
-                  		
 
    
     
 
    
 
    
 
    
-        The MPI timing facilities are exposed via the Boost.MPI timer class, which provides
-        an interface compatible with the Boost
-        Timer library.
-      
    
+          The MPI timing facilities are exposed via the Boost.MPI timer class, which provides
+          an interface compatible with the Boost
+          Timer library.
+        
    
 
    
-
    Table 25.15. Timing facilities
    
+
    Table 25.15. Timing facilities
    
 
    @@ -3550,64 +3654,63 @@ Process #6 thought of 650073868
 
+                  
    
+                    C Function/Constant
+                  
    
+                
+                  
    
+                    Boost.MPI Equivalent
+                  
    
+                
+                  
    
+                    MPI_WTIME_IS_GLOBAL
+                  
    
+                
+                  
    
+                    unnecessary; use timer::time_is_global
+                  
    
+                
+                  
    
+                    MPI_Wtime
+                  
    
+                
+                  
    
+                    use timer::elapsed to determine
+                    the time elapsed from some specific starting point
+                  
    
+                
+                  
    
+                    MPI_Wtick
+                  
    
+                
+                  
    
+                    timer::elapsed_min
+                  
    
+                
    
 
 

 
    
 
-                
    
-                  C Function/Constant
-                
    
-                  		
 
-                
    
-                  Boost.MPI Equivalent
-                
    
-                  		
 
    
 
 
    
 
-                
    
-                  MPI_WTIME_IS_GLOBAL
-                
    
-                  		
 
-                
    
-                  unnecessary; use timer::time_is_global
-                
    
-                  		
 
    
 
    
 
-                
    
-                  MPI_Wtime
-                
    
-                  		
 
-                
    
-                  use timer::elapsed to determine
-                  the time elapsed from some specific starting point
-                
    
-                  		
 
    
 
    
 
-                
    
-                  MPI_Wtick
-                
    
-                  		
 
-                
    
-                  timer::elapsed_min
-                
    
-                  		
 
    
     
 
    
 
    
 
    
-        MPI startup and shutdown are managed by the construction and destruction
-        of the Boost.MPI environment
-        class.
-      
    
+          MPI startup and shutdown are managed by the construction and destruction
+          of the Boost.MPI environment class.
+        
    
 
    
-
    Table 25.16. Startup/shutdown facilities
    
+
    Table 25.16. Startup/shutdown facilities
    
 
    @@ -3615,76 +3718,76 @@ Process #6 thought of 650073868
 
+                  
    
+                    C Function
+                  
    
+                
+                  
    
+                    Boost.MPI Equivalent
+                  
    
+                
+                  
    
+                    MPI_Init
+                  
    
+                
+                  
    
+                    environment
+                    constructor
+                  
    
+                
+                  
    
+                    MPI_Finalize
+                  
    
+                
+                  
    
+                    environment
+                    destructor
+                  
    
+                
+                  
    
+                    MPI_Initialized
+                  
    
+                
+                  
    
+                    environment::initialized
+                  
    
+                
+                  
    
+                    MPI_Abort
+                  
    
+                
+                  
    
+                    environment::abort
+                  
    
+                
    
 
 

 
    
 
-                
    
-                  C Function
-                
    
-                  		
 
-                
    
-                  Boost.MPI Equivalent
-                
    
-                  		
 
    
 
 
    
 
-                
    
-                  MPI_Init
-                
    
-                  		
 
-                
    
-                  environment
-                  constructor
-                
    
-                  		
 
    
 
    
 
-                
    
-                  MPI_Finalize
-                
    
-                  		
 
-                
    
-                  environment
-                  destructor
-                
    
-                  		
 
    
 
    
 
-                
    
-                  MPI_Initialized
-                
    
-                  		
 
-                
    
-                  environment::initialized
-                
    
-                  		
 
    
 
    
 
-                
    
-                  MPI_Abort
-                
    
-                  		
 
-                
    
-                  environment::abort
-                
    
-                  		
 
    
     
 
    
 
    
 
    
-        Boost.MPI does not provide any support for the profiling facilities in MPI
-        1.1.
-      
    
+          Boost.MPI does not provide any support for the profiling facilities in
+          MPI 1.1.
+        
    
 
    
-
    Table 25.17. Profiling interface
    
+
    Table 25.17. Profiling interface
    
 
    @@ -3692,41 +3795,41 @@ Process #6 thought of 650073868
 
+                  
    
+                    C Function
+                  
    
+                
+                  
    
+                    Boost.MPI Equivalent
+                  
    
+                
+                  
    
+                    PMPI_*
+                    routines
+                  
    
+                
+                  
    
+                    unsupported
+                  
    
+                
+                  
    
+                    MPI_Pcontrol
+                  
    
+                
+                  
    
+                    unsupported
+                  
    
+                
    
 
 

 
    
 
-                
    
-                  C Function
-                
    
-                  		
 
-                
    
-                  Boost.MPI Equivalent
-                
    
-                  		
 
    
 
 
    
 
-                
    
-                  PMPI_*
-                  routines
-                
    
-                  		
 
-                
    
-                  unsupported
-                
    
-                  		
 
    
 
    
 
-                
    
-                  MPI_Pcontrol
-                
    
-                  		
 
-                
    
-                  unsupported
-                
    
-                  		
 
    
     
 
    
@@ -3734,6 +3837,971 @@ Process #6 thought of 650073868
 
    
 
    
 
    
+
    
+
    
+Reference
    
+
    
+
    Header <boost/mpi.hpp>
    
+
    Header <boost/mpi/allocator.hpp>
    
+
    Header <boost/mpi/cartesian_communicator.hpp>
    
+
    Header <boost/mpi/collectives.hpp>
    
+
    Header <boost/mpi/collectives_fwd.hpp>
    
+
    Header <boost/mpi/communicator.hpp>
    
+
    Header <boost/mpi/config.hpp>
    
+
    Header <boost/mpi/datatype.hpp>
    
+
    Header <boost/mpi/datatype_fwd.hpp>
    
+
    Header <boost/mpi/environment.hpp>
    
+
    Header <boost/mpi/exception.hpp>
    
+
    Header <boost/mpi/graph_communicator.hpp>
    
+
    Header <boost/mpi/group.hpp>
    
+
    Header <boost/mpi/inplace.hpp>
    
+
    Header <boost/mpi/intercommunicator.hpp>
    
+
    Header <boost/mpi/nonblocking.hpp>
    
+
    Header <boost/mpi/operations.hpp>
    
+
    Header <boost/mpi/packed_iarchive.hpp>
    
+
    Header <boost/mpi/packed_oarchive.hpp>
    
+
    Header <boost/mpi/python.hpp>
    
+
    Header <boost/mpi/request.hpp>
    
+
    Header <boost/mpi/skeleton_and_content.hpp>
    
+
    Header <boost/mpi/skeleton_and_content_fwd.hpp>
    
+
    Header <boost/mpi/status.hpp>
    
+
    Header <boost/mpi/timer.hpp>
    
+
    
+
    
+
    
+Header <boost/mpi.hpp>
    
+
    This file is a top-level convenience header that includes all of the Boost.MPI library headers. Users concerned about compile time may wish to include only specific headers from the Boost.MPI library. 
    
+
    
+
    
+
    
+
    This header provides an STL-compliant allocator that uses the MPI-2 memory allocation facilities. 
    
+
    namespace boost {
+  namespace mpi {
+    template<typename T> class allocator;
+
+    template<> class allocator<void>;
+    template<typename T1, typename T2> 
+      bool operator==(const allocator< T1 > &, const allocator< T2 > &);
+    template<typename T1, typename T2> 
+      bool operator!=(const allocator< T1 > &, const allocator< T2 > &);
+  }
+}
    
+
    
+
    
+
    
+
    This header defines facilities to support MPI communicators with cartesian topologies. If known at compiled time, the dimension of the implied grid can be statically enforced, through the templatized communicator class. Otherwise, a non template, dynamic, base class is provided. 
    
+
    namespace boost {
+  namespace mpi {
+    struct cartesian_dimension;
+
+    template<> struct is_mpi_datatype<cartesian_dimension>;
+
+    class cartesian_topology;
+    class cartesian_communicator;
+
+    // Test if the dimensions values are identical. 
+    bool operator==(cartesian_dimension const & d1, 
+                    cartesian_dimension const & d2);
+
+    // Test if the dimension values are different. 
+    bool operator!=(cartesian_dimension const & d1, 
+                    cartesian_dimension const & d2);
+
+    // Pretty printing of a cartesian dimension (size, periodic) 
+    std::ostream & 
+    operator<<(std::ostream & out, cartesian_dimension const & d);
+    bool operator==(cartesian_topology const & t1, 
+                    cartesian_topology const & t2);
+    bool operator!=(cartesian_topology const & t1, 
+                    cartesian_topology const & t2);
+
+    // Pretty printing of a cartesian topology. 
+    std::ostream & 
+    operator<<(std::ostream & out, cartesian_topology const & t);
+    std::vector< int > & cartesian_dimensions(int, std::vector< int > &);
+  }
+}
    
+
    
+
    
+
    
+
    This header contains MPI collective operations, which implement various parallel algorithms that require the coordination of all processes within a communicator. The header collectives_fwd.hpp provides forward declarations for each of these operations. To include only specific collective algorithms, use the headers boost/mpi/collectives/algorithm_name.hpp. 
    
+
    namespace boost {
+  namespace mpi {
+    template<typename T> 
+      void all_gather(const communicator &, const T &, std::vector< T > &);
+    template<typename T> void all_gather(const communicator &, const T &, T *);
+    template<typename T> 
+      void all_gather(const communicator &, const T *, int, 
+                      std::vector< T > &);
+    template<typename T> 
+      void all_gather(const communicator &, const T *, int, T *);
+    template<typename T, typename Op> 
+      void all_reduce(const communicator &, const T *, int, T *, Op);
+    template<typename T, typename Op> 
+      void all_reduce(const communicator &, const T &, T &, Op);
+    template<typename T, typename Op> 
+      T all_reduce(const communicator &, const T &, Op);
+    template<typename T, typename Op> 
+      void all_reduce(const communicator &, inplace_t< T * >, int, Op);
+    template<typename T, typename Op> 
+      void all_reduce(const communicator &, inplace_t< T >, Op);
+    template<typename T> 
+      void all_to_all(const communicator &, const std::vector< T > &, 
+                      std::vector< T > &);
+    template<typename T> void all_to_all(const communicator &, const T *, T *);
+    template<typename T> 
+      void all_to_all(const communicator &, const std::vector< T > &, int, 
+                      std::vector< T > &);
+    template<typename T> 
+      void all_to_all(const communicator &, const T *, int, T *);
+    template<typename T> void broadcast(const communicator &, T &, int);
+    template<typename T> void broadcast(const communicator &, T *, int, int);
+    template<typename T> 
+      void broadcast(const communicator &, skeleton_proxy< T > &, int);
+    template<typename T> 
+      void broadcast(const communicator &, const skeleton_proxy< T > &, int);
+    template<typename T> 
+      void gather(const communicator &, const T &, std::vector< T > &, int);
+    template<typename T> 
+      void gather(const communicator &, const T &, T *, int);
+    template<typename T> void gather(const communicator &, const T &, int);
+    template<typename T> 
+      void gather(const communicator &, const T *, int, std::vector< T > &, 
+                  int);
+    template<typename T> 
+      void gather(const communicator &, const T *, int, T *, int);
+    template<typename T> 
+      void gather(const communicator &, const T *, int, int);
+    template<typename T> 
+      void gatherv(const communicator &, const std::vector< T > &, T *, 
+                   const std::vector< int > &, const std::vector< int > &, 
+                   int);
+    template<typename T> 
+      void gatherv(const communicator &, const T *, int, T *, 
+                   const std::vector< int > &, const std::vector< int > &, 
+                   int);
+    template<typename T> 
+      void gatherv(const communicator &, const std::vector< T > &, int);
+    template<typename T> 
+      void gatherv(const communicator &, const T *, int, int);
+    template<typename T> 
+      void gatherv(const communicator &, const T *, int, T *, 
+                   const std::vector< int > &, int);
+    template<typename T> 
+      void gatherv(const communicator &, const std::vector< T > &, T *, 
+                   const std::vector< int > &, int);
+    template<typename T> 
+      void scatter(const communicator &, const std::vector< T > &, T &, int);
+    template<typename T> 
+      void scatter(const communicator &, const T *, T &, int);
+    template<typename T> void scatter(const communicator &, T &, int);
+    template<typename T> 
+      void scatter(const communicator &, const std::vector< T > &, T *, int, 
+                   int);
+    template<typename T> 
+      void scatter(const communicator &, const T *, T *, int, int);
+    template<typename T> void scatter(const communicator &, T *, int, int);
+    template<typename T> 
+      void scatterv(const communicator &, const std::vector< T > &, 
+                    const std::vector< int > &, const std::vector< int > &, 
+                    T *, int, int);
+    template<typename T> 
+      void scatterv(const communicator &, const T *, 
+                    const std::vector< int > &, const std::vector< int > &, 
+                    T *, int, int);
+    template<typename T> void scatterv(const communicator &, T *, int, int);
+    template<typename T> 
+      void scatterv(const communicator &, const T *, 
+                    const std::vector< int > &, T *, int);
+    template<typename T> 
+      void scatterv(const communicator &, const std::vector< T > &, 
+                    const std::vector< int > &, T *, int);
+    template<typename T, typename Op> 
+      void reduce(const communicator &, const T &, T &, Op, int);
+    template<typename T, typename Op> 
+      void reduce(const communicator &, const T &, Op, int);
+    template<typename T, typename Op> 
+      void reduce(const communicator &, const T *, int, T *, Op, int);
+    template<typename T, typename Op> 
+      void reduce(const communicator &, const T *, int, Op, int);
+    template<typename T, typename Op> 
+      void scan(const communicator &, const T &, T &, Op);
+    template<typename T, typename Op> 
+      T scan(const communicator &, const T &, Op);
+    template<typename T, typename Op> 
+      void scan(const communicator &, const T *, int, T *, Op);
+  }
+}
    
+
    
+
    
+
    
+
    This header provides forward declarations for all of the collective operations contained in the header collectives.hpp. 
    
+
    
+
    
+
    
+
    This header defines the communicator class, which is the basis of all communication within Boost.MPI, and provides point-to-point communication operations. 
    
+
    namespace boost {
+  namespace mpi {
+    class communicator;
+
+    enum comm_create_kind;
+
+    const int any_source;    // A constant representing "any process.". 
+    const int any_tag;    // A constant representing "any tag.". 
+    BOOST_MPI_DECL bool operator==(const communicator &, const communicator &);
+    bool operator!=(const communicator &, const communicator &);
+  }
+}
    
+
    
+
    
+
    
+
    This header provides MPI configuration details that expose the capabilities of the underlying MPI implementation, and provides auto-linking support on Windows. 
    
+
    +
+MPICH_IGNORE_CXX_SEEK
+BOOST_MPI_HOMOGENEOUS
+BOOST_MPI_HAS_MEMORY_ALLOCATION
+BOOST_MPI_HAS_NOARG_INITIALIZATION
+BOOST_MPI_CALLING_CONVENTION
+BOOST_MPI_BCAST_BOTTOM_WORKS_FINE
+BOOST_MPI_DECL
    
+
    
+
    
+
    
+
    This header provides the mapping from C++ types to MPI data types. 
    
+
    +
+BOOST_IS_MPI_DATATYPE(T)
    
+
    namespace boost {
+  namespace mpi {
+    template<typename T> struct is_mpi_integer_datatype;
+    template<typename T> struct is_mpi_floating_point_datatype;
+    template<typename T> struct is_mpi_logical_datatype;
+    template<typename T> struct is_mpi_complex_datatype;
+    template<typename T> struct is_mpi_byte_datatype;
+    template<typename T> struct is_mpi_builtin_datatype;
+    template<typename T> struct is_mpi_datatype;
+    template<typename T> MPI_Datatype get_mpi_datatype(const T &);
+  }
+}
    
+
    
+
    
+
    
+
    This header provides forward declarations for the contents of the header datatype.hpp. It is expected to be used primarily by user-defined C++ classes that need to specialize is_mpi_datatype. 
    
+
    namespace boost {
+  namespace mpi {
+    struct packed;
+    template<typename T> MPI_Datatype get_mpi_datatype();
+  }
+}
    
+
    
+
    
+
    
+
    This header provides the environment class, which provides routines to initialize, finalization, and query the status of the Boost MPI environment. 
    
+
    namespace boost {
+  namespace mpi {
+    class environment;
+    namespace threading {
+      enum level;
+      std::ostream & operator<<(std::ostream &, level);
+      std::istream & operator>>(std::istream &, level &);
+    }
+  }
+}
    
+
    
+
    
+
    
+
    This header provides exception classes that report MPI errors to the user and macros that translate MPI error codes into Boost.MPI exceptions. 
    
+
    +
+BOOST_MPI_CHECK_RESULT(MPIFunc, Args)
    
+
    namespace boost {
+  namespace mpi {
+    class exception;
+  }
+}
    
+
    
+
    
+
    
+
    This header defines facilities to support MPI communicators with graph topologies, using the graph interface defined by the Boost Graph Library. One can construct a communicator whose topology is described by any graph meeting the requirements of the Boost Graph Library's graph concepts. Likewise, any communicator that has a graph topology can be viewed as a graph by the Boost Graph Library, permitting one to use the BGL's graph algorithms on the process topology. 
    
+
    namespace boost {
+  template<> struct graph_traits<mpi::graph_communicator>;
+  namespace mpi {
+    class graph_communicator;
+
+    // Returns the source vertex from an edge in the graph topology of a communicator. 
+    int source(const std::pair< int, int > & edge, const graph_communicator &);
+
+    // Returns the target vertex from an edge in the graph topology of a communicator. 
+    int target(const std::pair< int, int > & edge, const graph_communicator &);
+
+    // Returns an iterator range containing all of the edges outgoing from the given vertex in a graph topology of a communicator. 
+    unspecified out_edges(int vertex, const graph_communicator & comm);
+
+    // Returns the out-degree of a vertex in the graph topology of a communicator. 
+    int out_degree(int vertex, const graph_communicator & comm);
+
+    // Returns an iterator range containing all of the neighbors of the given vertex in the communicator's graph topology. 
+    unspecified adjacent_vertices(int vertex, const graph_communicator & comm);
+
+    // Returns an iterator range that contains all of the vertices with the communicator's graph topology, i.e., all of the process ranks in the communicator. 
+    std::pair< counting_iterator< int >, counting_iterator< int > > 
+    vertices(const graph_communicator & comm);
+
+    // Returns the number of vertices within the graph topology of the communicator, i.e., the number of processes in the communicator. 
+    int num_vertices(const graph_communicator & comm);
+
+    // Returns an iterator range that contains all of the edges with the communicator's graph topology. 
+    unspecified edges(const graph_communicator & comm);
+
+    // Returns the number of edges in the communicator's graph topology. 
+    int num_edges(const graph_communicator & comm);
+    identity_property_map get(vertex_index_t, const graph_communicator &);
+    int get(vertex_index_t, const graph_communicator &, int);
+  }
+}
    
+
    
+
    
+
    
+
    This header defines the group class, which allows one to manipulate and query groups of processes. 
    
+
    namespace boost {
+  namespace mpi {
+    class group;
+    BOOST_MPI_DECL bool operator==(const group &, const group &);
+    bool operator!=(const group &, const group &);
+    BOOST_MPI_DECL group operator|(const group &, const group &);
+    BOOST_MPI_DECL group operator&(const group &, const group &);
+    BOOST_MPI_DECL group operator-(const group &, const group &);
+  }
+}
    
+
    
+
    
+
    
+
    This header provides helpers to indicate to MPI collective operation that a buffer can be use both as an input and output. 
    
+
    namespace boost {
+  namespace mpi {
+    template<typename T> struct inplace_t;
+
+    template<typename T> struct inplace_t<T *>;
+    template<typename T> inplace_t< T > inplace(T &);
+    template<typename T> inplace_t< T * > inplace(T *);
+  }
+}
    
+
    
+
    
+
    
+
    This header defines the intercommunicator class, which permits communication between different process groups. 
    
+
    namespace boost {
+  namespace mpi {
+    class intercommunicator;
+  }
+}
    
+
    
+
    
+
    
+
    This header defines operations for completing non-blocking communication requests. 
    
+
    namespace boost {
+  namespace mpi {
+    template<typename ForwardIterator> 
+      std::pair< status, ForwardIterator > 
+      wait_any(ForwardIterator, ForwardIterator);
+    template<typename ForwardIterator> 
+      optional< std::pair< status, ForwardIterator > > 
+      test_any(ForwardIterator, ForwardIterator);
+    template<typename ForwardIterator, typename OutputIterator> 
+      OutputIterator 
+      wait_all(ForwardIterator, ForwardIterator, OutputIterator);
+    template<typename ForwardIterator> 
+      void wait_all(ForwardIterator, ForwardIterator);
+    template<typename ForwardIterator, typename OutputIterator> 
+      optional< OutputIterator > 
+      test_all(ForwardIterator, ForwardIterator, OutputIterator);
+    template<typename ForwardIterator> 
+      bool test_all(ForwardIterator, ForwardIterator);
+    template<typename BidirectionalIterator, typename OutputIterator> 
+      std::pair< OutputIterator, BidirectionalIterator > 
+      wait_some(BidirectionalIterator, BidirectionalIterator, OutputIterator);
+    template<typename BidirectionalIterator> 
+      BidirectionalIterator 
+      wait_some(BidirectionalIterator, BidirectionalIterator);
+    template<typename BidirectionalIterator, typename OutputIterator> 
+      std::pair< OutputIterator, BidirectionalIterator > 
+      test_some(BidirectionalIterator, BidirectionalIterator, OutputIterator);
+    template<typename BidirectionalIterator> 
+      BidirectionalIterator 
+      test_some(BidirectionalIterator, BidirectionalIterator);
+  }
+}
    
+
    
+
    
+
    
+
    This header provides a mapping from function objects to MPI_Op constants used in MPI collective operations. It also provides several new function object types not present in the standard  <functional> header that have direct mappings to MPI_Op. 
    
+
    namespace boost {
+  namespace mpi {
+    template<typename Op, typename T> struct is_mpi_op;
+    template<typename Op, typename T> struct is_commutative;
+    template<typename T> struct maximum;
+    template<typename T> struct minimum;
+    template<typename T> struct bitwise_and;
+    template<typename T> struct bitwise_or;
+    template<typename T> struct logical_xor;
+    template<typename T> struct bitwise_xor;
+  }
+}
    
+
    
+
    
+
    
+
    This header provides the facilities for packing Serializable data types into a buffer using MPI_Pack. The buffers can then be transmitted via MPI and then be unpacked either via the facilities in packed_oarchive.hpp or MPI_Unpack. 
    
+
    namespace boost {
+  namespace mpi {
+    class packed_iarchive;
+
+    typedef packed_iprimitive iprimitive;
+  }
+}
    
+
    
+
    
+
    
+
    This header provides the facilities for unpacking Serializable data types from a buffer using MPI_Unpack. The buffers are typically received via MPI and have been packed either by via the facilities in packed_iarchive.hpp or MPI_Pack. 
    
+
    namespace boost {
+  namespace mpi {
+    class packed_oarchive;
+
+    typedef packed_oprimitive oprimitive;
+  }
+}
    
+
    
+
    
+
    
+
    This header interacts with the Python bindings for Boost.MPI. The routines in this header can be used to register user-defined and library-defined data types with Boost.MPI for efficient (de-)serialization and separate transmission of skeletons and content. 
    
+
    namespace boost {
+  namespace mpi {
+    namespace python {
+      template<typename T> 
+        void register_serialized(const T & = T(), PyTypeObject * = 0);
+      template<typename T> 
+        void register_skeleton_and_content(const T & = T(), 
+                                           PyTypeObject * = 0);
+    }
+  }
+}
    
+
    
+
    
+
    
+
    This header defines the class request, which contains a request for non-blocking communication. 
    
+
    namespace boost {
+  namespace mpi {
+    class request;
+  }
+}
    
+
    
+
    
+
    
+
    This header provides facilities that allow the structure of data types (called the "skeleton") to be transmitted and received separately from the content stored in those data types. These facilities are useful when the data in a stable data structure (e.g., a mesh or a graph) will need to be transmitted repeatedly. In this case, transmitting the skeleton only once saves both communication effort (it need not be sent again) and local computation (serialization need only be performed once for the content). 
    
+
    namespace boost {
+  namespace mpi {
+    template<typename T> struct skeleton_proxy;
+
+    class content;
+    class packed_skeleton_iarchive;
+    class packed_skeleton_oarchive;
+    template<typename T> const skeleton_proxy< T > skeleton(T &);
+    template<typename T> const content get_content(const T &);
+  }
+}
    
+
    
+
    
+
    
+
    This header contains all of the forward declarations required to use transmit skeletons of data structures and the content of data structures separately. To actually transmit skeletons or content, include the header boost/mpi/skeleton_and_content.hpp. 
    
+
    
+
    
+
    
+
    This header defines the class status, which reports on the results of point-to-point communication. 
    
+
    namespace boost {
+  namespace mpi {
+    class status;
+  }
+}
    
+
    
+
    
+
    
+
    This header provides the timer class, which provides access to the MPI timers. 
    
+
    namespace boost {
+  namespace mpi {
+    class timer;
+  }
+}
    
+
    
+
    
+
    
+
    
+Python Bindings
    
+
    
+
    Quickstart
    
+
    Transmitting User-Defined Data
    
+
    Collectives
    
+
    Skeleton/Content Mechanism
    
+
    Design Philosophy
    
+
    Threads
    
+
    Performance Evaluation
    
+
    Revision History
    
+
    Acknowledgments
    
+
    
+
    
+        Boost.MPI provides an alternative MPI interface from the Python
+        programming language via the boost.mpi module.
+        The Boost.MPI Python bindings, built on top of the C++ Boost.MPI using the
+        Boost.Python library,
+        provide nearly all of the functionality of Boost.MPI within a dynamic, object-oriented
+        language.
+      
    
+
    
+        The Boost.MPI Python module can be built and installed from the libs/mpi/build
+        directory. Just follow the configuration
+        and installation instructions for
+        the C++ Boost.MPI. Once you have installed the Python module, be sure that
+        the installation location is in your PYTHONPATH.
+      
    
+
    
+
    
+Quickstart
    
+
    
+          Getting started with the Boost.MPI Python module is as easy as importing
+          boost.mpi. Our first "Hello, World!"
+          program is just two lines long:
+        
    
+
    import boost.mpi as mpi
+print "I am process %d of %d." % (mpi.rank, mpi.size)
+
    
+
    
+          Go ahead and run this program with several processes. Be sure to invoke
+          the python interpreter
+          from mpirun, e.g.,
+        
    
+
    mpirun -np 5 python hello_world.py
+
    
+
    
+          This will return output such as:
+        
    
+
    I am process 1 of 5.
+I am process 3 of 5.
+I am process 2 of 5.
+I am process 4 of 5.
+I am process 0 of 5.
+
    
+
    
+          Point-to-point operations in Boost.MPI have nearly the same syntax in Python
+          as in C++. We can write a simple two-process Python program that prints
+          "Hello, world!" by transmitting Python strings:
+        
    
+
    import boost.mpi as mpi
+
+if mpi.world.rank == 0:
+  mpi.world.send(1, 0, 'Hello')
+  msg = mpi.world.recv(1, 1)
+  print msg,'!'
+else:
+  msg = mpi.world.recv(0, 0)
+  print (msg + ', '),
+  mpi.world.send(0, 1, 'world')
+
    
+
    
+          There are only a few notable differences between this Python code and the
+          example in the C++ tutorial.
+          First of all, we don't need to write any initialization code in Python:
+          just loading the boost.mpi
+          module makes the appropriate MPI_Init
+          and MPI_Finalize calls.
+          Second, we're passing Python objects from one process to another through
+          MPI. Any Python object that can be pickled can be transmitted; the next
+          section will describe in more detail how the Boost.MPI Python layer transmits
+          objects. Finally, when we receive objects with recv,
+          we don't need to specify the type because transmission of Python objects
+          is polymorphic.
+        
    
+
    
+          When experimenting with Boost.MPI in Python, don't forget that help is
+          always available via pydoc:
+          just pass the name of the module or module entity on the command line (e.g.,
+          pydoc boost.mpi.communicator)
+          to receive complete reference documentation. When in doubt, try it!
+        
    
+
    
+
    
+
    
+Transmitting User-Defined Data
    
+
    
+          Boost.MPI can transmit user-defined data in several different ways. Most
+          importantly, it can transmit arbitrary Python
+          objects by pickling them at the sender and unpickling them at the receiver,
+          allowing arbitrarily complex Python data structures to interoperate with
+          MPI.
+        
    
+
    
+          Boost.MPI also supports efficient serialization and transmission of C++
+          objects (that have been exposed to Python) through its C++ interface. Any
+          C++ type that provides (de-)serialization routines that meet the requirements
+          of the Boost.Serialization library is eligible for this optimization, but
+          the type must be registered in advance. To register a C++ type, invoke
+          the C++ function register_serialized.
+          If your C++ types come from other Python modules (they probably will!),
+          those modules will need to link against the boost_mpi
+          and boost_mpi_python libraries
+          as described in the installation section.
+          Note that you do not need to link against
+          the Boost.MPI Python extension module.
+        
    
+
    
+          Finally, Boost.MPI supports separation of the structure of an object from
+          the data it stores, allowing the two pieces to be transmitted separately.
+          This "skeleton/content" mechanism, described in more detail in
+          a later section, is a communication optimization suitable for problems
+          with fixed data structures whose internal data changes frequently.
+        
    
+
    
+
    
+
    
+Collectives
    
+
    
+          Boost.MPI supports all of the MPI collectives (scatter,
+          reduce, scan,
+          broadcast, etc.) for any
+          type of data that can be transmitted with the point-to-point communication
+          operations. For the MPI collectives that require a user-specified operation
+          (e.g., reduce and scan), the operation can be an arbitrary
+          Python function. For instance, one could concatenate strings with all_reduce:
+        
    
+
    mpi.all_reduce(my_string, lambda x,y: x + y)
+
    
+
    
+          The following module-level functions implement MPI collectives: all_gather
+          Gather the values from all processes. all_reduce Combine the results from
+          all processes. all_to_all Every process sends data to every other process.
+          broadcast Broadcast data from one process to all other processes. gather
+          Gather the values from all processes to the root. reduce Combine the results
+          from all processes to the root. scan Prefix reduction of the values from
+          all processes. scatter Scatter the values stored at the root to all processes.
+        
    
+
    
+
    
+
    
+Skeleton/Content Mechanism
    
+
    
+
    C++/Python MPI Compatibility
    
+
    Reference
    
+
    
+
    
+          Boost.MPI provides a skeleton/content mechanism that allows the transfer
+          of large data structures to be split into two separate stages, with the
+          skeleton (or, "shape") of the data structure sent first and the
+          content (or, "data") of the data structure sent later, potentially
+          several times, so long as the structure has not changed since the skeleton
+          was transferred. The skeleton/content mechanism can improve performance
+          when the data structure is large and its shape is fixed, because while
+          the skeleton requires serialization (it has an unknown size), the content
+          transfer is fixed-size and can be done without extra copies.
+        
    
+
    
+          To use the skeleton/content mechanism from Python, you must first register
+          the type of your data structure with the skeleton/content mechanism from C++. The registration function is register_skeleton_and_content
+          and resides in the <boost/mpi/python.hpp>
+          header.
+        
    
+
    
+          Once you have registered your C++ data structures, you can extract the
+          skeleton for an instance of that data structure with skeleton(). The resulting skeleton_proxy
+          can be transmitted via the normal send routine, e.g.,
+        
    
+
    mpi.world.send(1, 0, skeleton(my_data_structure))
+
    
+
    
+          skeleton_proxy objects
+          can be received on the other end via recv(), which stores a newly-created instance
+          of your data structure with the same "shape" as the sender in
+          its "object" attribute:
+        
    
+
    shape = mpi.world.recv(0, 0)
+my_data_structure = shape.object
+
    
+
    
+          Once the skeleton has been transmitted, the content (accessed via get_content) can be transmitted in much
+          the same way. Note, however, that the receiver also specifies get_content(my_data_structure)
+          in its call to receive:
+        
    
+
    if mpi.rank == 0:
+  mpi.world.send(1, 0, get_content(my_data_structure))
+else:
+  mpi.world.recv(0, 0, get_content(my_data_structure))
+
    
+
    
+          Of course, this transmission of content can occur repeatedly, if the values
+          in the data structure--but not its shape--changes.
+        
    
+
    
+          The skeleton/content mechanism is a structured way to exploit the interaction
+          between custom-built MPI datatypes and MPI_BOTTOM,
+          to eliminate extra buffer copies.
+        
    
+
    
+
    
+C++/Python MPI Compatibility
    
+
    
+            Boost.MPI is a C++ library whose facilities have been exposed to Python
+            via the Boost.Python library. Since the Boost.MPI Python bindings are
+            build directly on top of the C++ library, and nearly every feature of
+            C++ library is available in Python, hybrid C++/Python programs using
+            Boost.MPI can interact, e.g., sending a value from Python but receiving
+            that value in C++ (or vice versa). However, doing so requires some care.
+            Because Python objects are dynamically typed, Boost.MPI transfers type
+            information along with the serialized form of the object, so that the
+            object can be received even when its type is not known. This mechanism
+            differs from its C++ counterpart, where the static types of transmitted
+            values are always known.
+          
    
+
    
+            The only way to communicate between the C++ and Python views on Boost.MPI
+            is to traffic entirely in Python objects. For Python, this is the normal
+            state of affairs, so nothing will change. For C++, this means sending
+            and receiving values of type boost::python::object,
+            from the Boost.Python
+            library. For instance, say we want to transmit an integer value from
+            Python:
+          
    
+
    comm.send(1, 0, 17)
+
    
+
    
+            In C++, we would receive that value into a Python object and then extract an integer value:
+          
    
+
    boost::python::object value;
+comm.recv(0, 0, value);
+int int_value = boost::python::extract<int>(value);
+
    
+
    
+            In the future, Boost.MPI will be extended to allow improved interoperability
+            with the C++ Boost.MPI and the C MPI bindings.
+          
    
+
    
+
    
+
    
+Reference
    
+
    
+            The Boost.MPI Python module, boost.mpi,
+            has its own reference documentation,
+            which is also available using pydoc
+            (from the command line) or help(boost.mpi) (from the Python interpreter).
+          
    
+
    
+
    
+
    
+
    
+Design Philosophy
    
+
    
+          The design philosophy of the Parallel MPI library is very simple: be both
+          convenient and efficient. MPI is a library built for high-performance applications,
+          but it's FORTRAN-centric, performance-minded design makes it rather inflexible
+          from the C++ point of view: passing a string from one process to another
+          is inconvenient, requiring several messages and explicit buffering; passing
+          a container of strings from one process to another requires an extra level
+          of manual bookkeeping; and passing a map from strings to containers of
+          strings is positively infuriating. The Parallel MPI library allows all
+          of these data types to be passed using the same simple send() and recv() primitives. Likewise, collective operations
+          such as reduce() allow arbitrary data types
+          and function objects, much like the C++ Standard Library would.
+        
    
+
    
+          The higher-level abstractions provided for convenience must not have an
+          impact on the performance of the application. For instance, sending an
+          integer via send must be
+          as efficient as a call to MPI_Send,
+          which means that it must be implemented by a simple call to MPI_Send; likewise, an integer reduce() using std::plus<int> must be implemented with a call to
+          MPI_Reduce on integers
+          using the MPI_SUM operation:
+          anything less will impact performance. In essence, this is the "don't
+          pay for what you don't use" principle: if the user is not transmitting
+          strings, s/he should not pay the overhead associated with strings.
+        
    
+
    
+          Sometimes, achieving maximal performance means foregoing convenient abstractions
+          and implementing certain functionality using lower-level primitives. For
+          this reason, it is always possible to extract enough information from the
+          abstractions in Boost.MPI to minimize the amount of effort required to
+          interface between Boost.MPI and the C MPI library.
+        
    
+
    
+
    
+
    
+Threads
    
+
    
+          There are an increasing number of hybrid parallel applications that mix
+          distributed and shared memory parallelism. To know how to support that
+          model, one need to know what level of threading support is guaranteed by
+          the MPI implementation. There are 4 ordered level of possible threading
+          support described by mpi::threading::level.
+          At the lowest level, you should not use threads at all, at the highest
+          level, any thread can perform MPI call.
+        
    
+
    
+          If you want to use multi-threading in your MPI application, you should
+          indicate in the environment constructor your preferred threading support.
+          Then probe the one the library did provide, and decide what you can do
+          with it (it could be nothing, then aborting is a valid option):
+        
    
+
    #include <boost/mpi/environment.hpp>
+#include <boost/mpi/communicator.hpp>
+#include <iostream>
+namespace mpi = boost::mpi;
+namespace mt  = mpi::threading;
+
+int main()
+{
+  mpi::environment env(mt::funneled);
+  if (env.thread_level() < mt::funneled) {
+     env.abort(-1);
+  }
+  mpi::communicator world;
+  std::cout << "I am process " << world.rank() << " of " << world.size()
+            << "." << std::endl;
+  return 0;
+}
+
    
+
    
+
    
+
    
+Performance Evaluation
    
+
    
+          Message-passing performance is crucial in high-performance distributed
+          computing. To evaluate the performance of Boost.MPI, we modified the standard
+          NetPIPE benchmark
+          (version 3.6.2) to use Boost.MPI and compared its performance against raw
+          MPI. We ran five different variants of the NetPIPE benchmark:
+        
    
+
      
+
    1. 
+              MPI: The unmodified NetPIPE benchmark.
+            
      2. 
+
    2. 
+              Boost.MPI: NetPIPE modified to use Boost.MPI calls for communication.
+            
      3. 
+
    3. 
+              MPI (Datatypes): NetPIPE modified to use a derived datatype (which
+              itself contains a single MPI_BYTE)
+              rather than a fundamental datatype.
+            
      4. 
+
    4. 
+              Boost.MPI (Datatypes): NetPIPE modified to use a user-defined type
+              Char in place of the
+              fundamental char type.
+              The Char type contains
+              a single char, a serialize()
+              method to make it serializable, and specializes is_mpi_datatype
+              to force Boost.MPI to build a derived MPI data type for it.
+            
      5. 
+
    5. 
+              Boost.MPI (Serialized): NetPIPE modified to use a user-defined type
+              Char in place of the
+              fundamental char type.
+              This Char type contains
+              a single char and is serializable.
+              Unlike the Datatypes case, is_mpi_datatype
+              is not specialized, forcing Boost.MPI
+              to perform many, many serialization calls.
+            
      6. 
+
    
+
    
+          The actual tests were performed on the Odin cluster in the Department
+          of Computer Science at Indiana
+          University, which contains 128 nodes connected via Infiniband.
+          Each node contains 4GB memory and two AMD Opteron processors. The NetPIPE
+          benchmarks were compiled with Intel's C++ Compiler, version 9.0, Boost
+          1.35.0 (prerelease), and Open MPI
+          version 1.1. The NetPIPE results follow:
+        
    
+
    
+          netpipe
+        
    
+
    
+          There are a some observations we can make about these NetPIPE results.
+          First of all, the top two plots show that Boost.MPI performs on par with
+          MPI for fundamental types. The next two plots show that Boost.MPI performs
+          on par with MPI for derived data types, even though Boost.MPI provides
+          a much more abstract, completely transparent approach to building derived
+          data types than raw MPI. Overall performance for derived data types is
+          significantly worse than for fundamental data types, but the bottleneck
+          is in the underlying MPI implementation itself. Finally, when forcing Boost.MPI
+          to serialize characters individually, performance suffers greatly. This
+          particular instance is the worst possible case for Boost.MPI, because we
+          are serializing millions of individual characters. Overall, the additional
+          abstraction provided by Boost.MPI does not impair its performance.
+        
    
+
    
+
    
+
    
+Revision History
    
+
      
+
    • 
+              Boost 1.36.0:
+              
      • 
+                    Support for non-blocking operations in Python, from Andreas Klöckner
+                  
      
+            
      • 
+
    • 
+              Boost 1.35.0: Initial release, containing
+              the following post-review changes
+              
        
+
      • 
+                    Support for arrays in all collective operations
+                  
        • 
+
      • 
+                    Support default-construction of environment
+                  
        • 
+
      
+            
      • 
+
    • 
+              2006-09-21: Boost.MPI accepted into
+              Boost.
+            
      • 
+
    
+
    
+
    
+
    
+Acknowledgments
    
+
    
+          Boost.MPI was developed with support from Zurcher Kantonalbank. Daniel
+          Egloff and Michael Gauckler contributed many ideas to Boost.MPI's design,
+          particularly in the design of its abstractions for MPI data types and the
+          novel skeleton/context mechanism for large data structures. Prabhanjan
+          (Anju) Kambadur developed the predecessor to Boost.MPI that proved the
+          usefulness of the Serialization library in an MPI setting and the performance
+          benefits of specialization in a C++ abstraction layer for MPI. Jeremy Siek
+          managed the formal review of Boost.MPI.
+        
    
+
    
+
    
+
 
    
 
 
    Copyright © 2005-2007 Douglas Gregor,
@@ -3746,7 +4814,7 @@ Process #6 thought of 650073868
 
    
 
    
 
    
-PrevUpHomeNext
+PrevUpHomeNext
 
    
 
 
diff --git a/doc/html/multi_array.html b/doc/html/multi_array.html
index 668600c178..629b74e335 100644
--- a/doc/html/multi_array.html
+++ b/doc/html/multi_array.html
@@ -7,7 +7,7 @@
 
 
 
-
+
 
 
 
@@ -21,7 +21,7 @@
 
    
 
    
 
    
-PrevUpHomeNext
+PrevUpHomeNext
 
    
 
    
 
    
@@ -137,7 +137,7 @@ namespace boost {
 
    
 
    
 
    
-PrevUpHomeNext
+PrevUpHomeNext
 
    
 
 
diff --git a/doc/html/poly_collection.html b/doc/html/poly_collection.html
index 5451c171bf..ba90a10b33 100644
--- a/doc/html/poly_collection.html
+++ b/doc/html/poly_collection.html
@@ -30,7 +30,8 @@
 
    
 Joaquín M López Muñoz
 
    
-
    Copyright © 2016, 2017 Joaquín M López Muñoz
    
+
    Copyright © 2016-2018 Joaquín M López
+      Muñoz
    
 
    
 
    
         Distributed under the Boost Software License, Version 1.0. (See accompanying
@@ -107,6 +108,7 @@
 
 
    Release notes
    
 
    
+
    Boost 1.67
    
 
    Boost 1.66
    
 
    Boost 1.65
    
 
    
@@ -193,7 +195,7 @@
 
    
 
    
 
-
+
    Last revised: December 14, 2017 at 00:06:06 GMT
    Last revised: April 11, 2018 at 14:08:06 GMT
    		
 
    		
 
    
 
    
diff --git a/doc/html/poly_collection/acknowledgments.html b/doc/html/poly_collection/acknowledgments.html
index b5f27ba5a5..2955b448f5 100644
--- a/doc/html/poly_collection/acknowledgments.html
+++ b/doc/html/poly_collection/acknowledgments.html
@@ -58,7 +58,8 @@
 
 
-
    
 
    Copyright © 2016, 2017 Joaquín M López Muñoz
    
+
    Copyright © 2016-2018 Joaquín M López
+      Muñoz
    
         Distributed under the Boost Software License, Version 1.0. (See accompanying
         file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
       
    
diff --git a/doc/html/poly_collection/an_efficient_polymorphic_data_st.html b/doc/html/poly_collection/an_efficient_polymorphic_data_st.html
index bc72ad124b..bc57637d18 100644
--- a/doc/html/poly_collection/an_efficient_polymorphic_data_st.html
+++ b/doc/html/poly_collection/an_efficient_polymorphic_data_st.html
@@ -148,7 +148,8 @@
 
    
 
-
    
 
    Copyright © 2016, 2017 Joaquín M López Muñoz
    
+
    Copyright © 2016-2018 Joaquín M López
+      Muñoz
    
         Distributed under the Boost Software License, Version 1.0. (See accompanying
         file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
       
    
diff --git a/doc/html/poly_collection/future_work.html b/doc/html/poly_collection/future_work.html
index d52ae58179..bc9aee0151 100644
--- a/doc/html/poly_collection/future_work.html
+++ b/doc/html/poly_collection/future_work.html
@@ -130,7 +130,8 @@
 
    
 
-
    
 
    Copyright © 2016, 2017 Joaquín M López Muñoz
    
+
    Copyright © 2016-2018 Joaquín M López
+      Muñoz
    
         Distributed under the Boost Software License, Version 1.0. (See accompanying
         file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
       
    
diff --git a/doc/html/poly_collection/performance.html b/doc/html/poly_collection/performance.html
index e856d41083..af3ce6b851 100644
--- a/doc/html/poly_collection/performance.html
+++ b/doc/html/poly_collection/performance.html
@@ -721,7 +721,8 @@
 
    
 
-
    
 
    Copyright © 2016, 2017 Joaquín M López Muñoz
    
+
    Copyright © 2016-2018 Joaquín M López
+      Muñoz
    
         Distributed under the Boost Software License, Version 1.0. (See accompanying
         file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
       
    
diff --git a/doc/html/poly_collection/reference.html b/doc/html/poly_collection/reference.html
index fe39036e80..33fb453867 100644
--- a/doc/html/poly_collection/reference.html
+++ b/doc/html/poly_collection/reference.html
@@ -2368,7 +2368,8 @@
 
    
 
-
    
 
    Copyright © 2016, 2017 Joaquín M López Muñoz
    
+
    Copyright © 2016-2018 Joaquín M López
+      Muñoz
    
         Distributed under the Boost Software License, Version 1.0. (See accompanying
         file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
       
    
diff --git a/doc/html/poly_collection/release_notes.html b/doc/html/poly_collection/release_notes.html
index 0a9336bf89..fd6cfb0af2 100644
--- a/doc/html/poly_collection/release_notes.html
+++ b/doc/html/poly_collection/release_notes.html
@@ -28,11 +28,20 @@
 Release notes
 
    
 
    
+
    Boost 1.67
    
 
    Boost 1.66
    
 
    Boost 1.65
    
 
    
 
    
 
    
+
    • 
+            Maintenance fixes.
+          
    
+
    
+
    
+
    
 
      
@@ -71,7 +80,8 @@
 
    
 
-
    
 
    Copyright © 2016, 2017 Joaquín M López Muñoz
    
+
    Copyright © 2016-2018 Joaquín M López
+      Muñoz
    
         Distributed under the Boost Software License, Version 1.0. (See accompanying
         file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
       
    
diff --git a/doc/html/poly_collection/tutorial.html b/doc/html/poly_collection/tutorial.html
index 0cc74c5c28..3e62784b56 100644
--- a/doc/html/poly_collection/tutorial.html
+++ b/doc/html/poly_collection/tutorial.html
@@ -1208,7 +1208,7 @@ juggernaut 7,goblin 1,goblin 3,goblin 5,"stamina: 10,000","game over"
           For any other type of iterator, it is guaranteed not to compile.
         
    
 
    [13] 
-          For example, algorithms requiring bidrectional iterators or a higher category
+          For example, algorithms requiring bidirectional iterators or a higher category
           are not provided because polymorphic collections have forward-only iterators.
         
    
 
    [14] 
@@ -1220,7 +1220,8 @@ juggernaut 7,goblin 1,goblin 3,goblin 5,"stamina: 10,000","game over"
 
    
 
-
    
 
    Copyright © 2016, 2017 Joaquín M López Muñoz
    
+
    Copyright © 2016-2018 Joaquín M López
+      Muñoz
    
         Distributed under the Boost Software License, Version 1.0. (See accompanying
         file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
       
    
diff --git a/doc/html/process.html b/doc/html/process.html
index e66034fac4..459adb641e 100644
--- a/doc/html/process.html
+++ b/doc/html/process.html
@@ -165,7 +165,7 @@
 
    
 
 
-
+
    Last revised: December 14, 2017 at 00:06:03 GMT
    Last revised: April 11, 2018 at 14:08:04 GMT
    		
 
    		
 
    
 
    
diff --git a/doc/html/process/reference.html b/doc/html/process/reference.html
index 7ac96e6577..67beb4c2c9 100644
--- a/doc/html/process/reference.html
+++ b/doc/html/process/reference.html
@@ -512,6 +512,7 @@ Streams can be redirected to null, which means, that written date will be discar
       unspecified not_active;
       unspecified show;
       unspecified show_normal;
+      unspecified create_no_window;
     }
   }
 }
diff --git a/doc/html/program_options/howto.html b/doc/html/program_options/howto.html
index 435ea0d0e0..838f5f425c 100644
--- a/doc/html/program_options/howto.html
+++ b/doc/html/program_options/howto.html
@@ -482,7 +482,7 @@ po::variables_map vm;
 po::store(po::parse_command_line(ac, av, desc), vm);
 po::notify(vm);
 
-if (compression)) {
+if (compression) {
     cout << "Compression level was set to " << *compression << ".\n";
 } else {
     cout << "Compression level was not set.\n";
diff --git a/doc/html/property_tree.html b/doc/html/property_tree.html
index 3d59707758..f1a49834f2 100644
--- a/doc/html/property_tree.html
+++ b/doc/html/property_tree.html
@@ -118,7 +118,7 @@
 
 
 
-
+
    Last revised: December 14, 2017 at 00:06:02 GMT
    Last revised: April 11, 2018 at 14:08:04 GMT
    		
 
    		
 
    
 
    
diff --git a/doc/html/proto.html b/doc/html/proto.html
index b4fcffdcf0..37172b5f5c 100644
--- a/doc/html/proto.html
+++ b/doc/html/proto.html
@@ -263,7 +263,7 @@
 
 
 
-
+
    Last revised: December 14, 2017 at 00:06:01 GMT
    Last revised: April 11, 2018 at 14:08:03 GMT
    		
 
    		
 
    
 
    
diff --git a/doc/html/quickbook/change_log.html b/doc/html/quickbook/change_log.html
index 3906c75982..5fca2373f0 100644
--- a/doc/html/quickbook/change_log.html
+++ b/doc/html/quickbook/change_log.html
@@ -918,6 +918,22 @@ blah...
           Fix xmlbase when it's the same directory as the existing xinclude base.
         
 
+
    
+
+      Version
+      1.7.1 - Boost 1.67
+    
    
+
      
+
    • 
+          Now uses C++11, no longer tested with C++03 compilers.
+        
      • 
+
    • 
+          Fix parsing escaped docbook with the new version of Spirit.
+        
      • 
+
    • 
+          Reformatted code with clang-format.
+        
      • 
+
    
 
 
diff --git a/doc/html/quickbook/syntax/block.html b/doc/html/quickbook/syntax/block.html
index 8e93ef4ea7..31550442b9 100644
--- a/doc/html/quickbook/syntax/block.html
+++ b/doc/html/quickbook/syntax/block.html
@@ -911,7 +911,7 @@ sf_logo
               
@@ -928,7 +928,7 @@ sf_logo
               
diff --git a/doc/html/ratio.html b/doc/html/ratio.html
index 430722b4ad..c8894daf98 100644
--- a/doc/html/ratio.html
+++ b/doc/html/ratio.html
@@ -183,7 +183,7 @@
 
    
 
 
                 
    
-                  2017-Dec-14
+                  2018-Apr-11
                 
    
                   		
 
    
 
    
                 
    
-                  12:08:24 AM
+                  02:10:23 PM
                 
    
                   		
 
    
 
 
    
-
+
    Last revised: December 14, 2017 at 00:06:01 GMT
    Last revised: April 11, 2018 at 14:08:03 GMT
    		
 
    		
 
    
 
    
diff --git a/doc/html/save_1_3_12_15_5_16_3.html b/doc/html/save_1_3_12_15_5_16_3.html
deleted file mode 100644
index cb2c0df208..0000000000
--- a/doc/html/save_1_3_12_15_5_16_3.html
+++ /dev/null
@@ -1,54 +0,0 @@
-
-
-
-
-Function template save
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    
-
    
-
    
-PrevUpHomeNext
-
    
-
    
-
    
-
    
-
    Function template save
    
-
    save — Function to save posix_time::ptime objects using serialization lib. 
    
-
    
-
    Synopsis
    
-
    // In header: <boost/date_time/posix_time/time_serialize.hpp>
-
-
-template<typename Archive> 
-  void save(Archive & ar, const posix_time::ptime & pt, unsigned int);
    
-
    
-
    Description
    
-
    ptime objects are broken down into 2 parts for serialization: a date object and a time_duration onject 
    
-
    
-
    
-
-
-
-
    Copyright © 2001-2005 CrystalClear Software, Inc
    Subject to the Boost Software License, Version 1.0. (See accompanying file
-    LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
    
-
    
-
    
-
    
-PrevUpHomeNext
-
    
-
-
diff --git a/doc/html/save_1_3_12_15_5_16_6.html b/doc/html/save_1_3_12_15_5_16_6.html
deleted file mode 100644
index eb17e4d6f9..0000000000
--- a/doc/html/save_1_3_12_15_5_16_6.html
+++ /dev/null
@@ -1,54 +0,0 @@
-
-
-
-
-Function template save
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    
-
    
-
    
-PrevUpHomeNext
-
    
-
    
-
    
-
    
-
    Function template save
    
-
    save — Function to save posix_time::time_period objects using serialization lib. 
    
-
    
-
    Synopsis
    
-
    // In header: <boost/date_time/posix_time/time_serialize.hpp>
-
-
-template<typename Archive> 
-  void save(Archive & ar, const posix_time::time_period & tp, unsigned int);
    
-
    
-
    Description
    
-
    time_period objects are broken down into 2 parts for serialization: a begining ptime object and an ending ptime object 
    
-
    
-
    
-
-
-
-
    Copyright © 2001-2005 CrystalClear Software, Inc
    Subject to the Boost Software License, Version 1.0. (See accompanying file
-    LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
    
-
    
-
    
-
    
-PrevUpHomeNext
-
    
-
-
diff --git a/doc/html/save_1_3_13_15_5_16_5.html b/doc/html/save_1_3_13_15_5_16_5.html
new file mode 100644
index 0000000000..1c543d7643
--- /dev/null
+++ b/doc/html/save_1_3_13_15_5_16_5.html
@@ -0,0 +1,54 @@
+
+
+
+
+Function template save
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    
+
    
+
    
+PrevUpHomeNext
+
    
+
    
+
    
+
    
+
    Function template save
    
+
    save — Function to save posix_time::ptime objects using serialization lib. 
    
+
    
+
    Synopsis
    
+
    // In header: <boost/date_time/posix_time/time_serialize.hpp>
+
+
+template<typename Archive> 
+  void save(Archive & ar, const posix_time::ptime & pt, unsigned int);
    
+
    
+
    Description
    
+
    ptime objects are broken down into 2 parts for serialization: a date object and a time_duration onject 
    
+
    
+
    
+
+
+
+
    Copyright © 2001-2005 CrystalClear Software, Inc
    Subject to the Boost Software License, Version 1.0. (See accompanying file
+    LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
    
+
    
+
    
+
    
+PrevUpHomeNext
+
    
+
+
diff --git a/doc/html/save_1_3_13_15_5_16_8.html b/doc/html/save_1_3_13_15_5_16_8.html
new file mode 100644
index 0000000000..9d8ca6284e
--- /dev/null
+++ b/doc/html/save_1_3_13_15_5_16_8.html
@@ -0,0 +1,54 @@
+
+
+
+
+Function template save
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    
+
    
+
    
+PrevUpHomeNext
+
    
+
    
+
    
+
    
+
    Function template save
    
+
    save — Function to save posix_time::time_period objects using serialization lib. 
    
+
    
+
    Synopsis
    
+
    // In header: <boost/date_time/posix_time/time_serialize.hpp>
+
+
+template<typename Archive> 
+  void save(Archive & ar, const posix_time::time_period & tp, unsigned int);
    
+
    
+
    Description
    
+
    time_period objects are broken down into 2 parts for serialization: a begining ptime object and an ending ptime object 
    
+
    
+
    
+
+
+
+
    Copyright © 2001-2005 CrystalClear Software, Inc
    Subject to the Boost Software License, Version 1.0. (See accompanying file
+    LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
    
+
    
+
    
+
    
+PrevUpHomeNext
+
    
+
+
diff --git a/doc/html/serialization/load_1_3_12_15_4_13_1_12.html b/doc/html/serialization/load_1_3_12_15_4_13_1_12.html
deleted file mode 100644
index 0eb030dd60..0000000000
--- a/doc/html/serialization/load_1_3_12_15_4_13_1_12.html
+++ /dev/null
@@ -1,54 +0,0 @@
-
-
-
-
-Function template load
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    
-
    
-
    
-PrevUpHomeNext
-
    
-
    
-
    
-
    
-
    Function template load
    
-
    serialization::load — Function to load gregorian::date_period objects using serialization lib. 
    
-
    
-
    Synopsis
    
-
    // In header: <boost/date_time/gregorian/greg_serialize.hpp>
-
-
-template<typename Archive> 
-  void load(Archive & ar, gregorian::date_period & dp, unsigned int);
    
-
    
-
    Description
    
-
    date_period objects are broken down into 2 parts for serialization: the begining date object and the end date object 
    
-
    
-
    
-
-
-
-
    Copyright © 2001-2005 CrystalClear Software, Inc
    Subject to the Boost Software License, Version 1.0. (See accompanying file
-    LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
    
-
    
-
    
-
    
-PrevUpHomeNext
-
    
-
-
diff --git a/doc/html/serialization/load_1_3_12_15_4_13_1_27.html b/doc/html/serialization/load_1_3_12_15_4_13_1_27.html
deleted file mode 100644
index 2fa36181aa..0000000000
--- a/doc/html/serialization/load_1_3_12_15_4_13_1_27.html
+++ /dev/null
@@ -1,54 +0,0 @@
-
-
-
-
-Function template load
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    
-
    
-
    
-PrevUpHomeNext
-
    
-
    
-
    
-
    
-
    Function template load
    
-
    serialization::load — Function to load gregorian::partial_date objects using serialization lib. 
    
-
    
-
    Synopsis
    
-
    // In header: <boost/date_time/gregorian/greg_serialize.hpp>
-
-
-template<typename Archive> 
-  void load(Archive & ar, gregorian::partial_date & pd, unsigned int);
    
-
    
-
    Description
    
-
    partial_date objects are broken down into 2 parts for serialization: the day (greg_day) and month (greg_month) objects 
    
-
    
-
    
-
-
-
-
    Copyright © 2001-2005 CrystalClear Software, Inc
    Subject to the Boost Software License, Version 1.0. (See accompanying file
-    LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
    
-
    
-
    
-
    
-PrevUpHomeNext
-
    
-
-
diff --git a/doc/html/serialization/load_1_3_12_15_4_13_1_3.html b/doc/html/serialization/load_1_3_12_15_4_13_1_3.html
deleted file mode 100644
index ccd3c4d166..0000000000
--- a/doc/html/serialization/load_1_3_12_15_4_13_1_3.html
+++ /dev/null
@@ -1,54 +0,0 @@
-
-
-
-
-Function template load
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    
-
    
-
    
-PrevUpHomeNext
-
    
-
    
-
    
-
    
-
    Function template load
    
-
    serialization::load — Function to load gregorian::date objects using serialization lib. 
    
-
    
-
    Synopsis
    
-
    // In header: <boost/date_time/gregorian/greg_serialize.hpp>
-
-
-template<typename Archive> 
-  void load(Archive & ar, ::boost::gregorian::date & d, unsigned int);
    
-
    
-
    Description
    
-
    Dates are serialized into a string for transport and storage. While it would be more efficient to store the internal integer used to manipulate the dates, it is an unstable solution. 
    
-
    
-
    
-
-
-
-
    Copyright © 2001-2005 CrystalClear Software, Inc
    Subject to the Boost Software License, Version 1.0. (See accompanying file
-    LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
    
-
    
-
    
-
    
-PrevUpHomeNext
-
    
-
-
diff --git a/doc/html/serialization/load_1_3_12_15_4_13_1_30.html b/doc/html/serialization/load_1_3_12_15_4_13_1_30.html
deleted file mode 100644
index e93b3e3622..0000000000
--- a/doc/html/serialization/load_1_3_12_15_4_13_1_30.html
+++ /dev/null
@@ -1,54 +0,0 @@
-
-
-
-
-Function template load
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    
-
    
-
    
-PrevUpHomeNext
-
    
-
    
-
    
-
    
-
    Function template load
    
-
    serialization::load — Function to load nth_day_of_the_week_in_month objects using serialization lib. 
    
-
    
-
    Synopsis
    
-
    // In header: <boost/date_time/gregorian/greg_serialize.hpp>
-
-
-template<typename Archive> 
-  void load(Archive & ar, gregorian::nth_kday_of_month & nkd, unsigned int);
    
-
    
-
    Description
    
-
    nth_day_of_the_week_in_month objects are broken down into 3 parts for serialization: the week number, the day of the week, and the month 
    
-
    
-
    
-
-
-
-
    Copyright © 2001-2005 CrystalClear Software, Inc
    Subject to the Boost Software License, Version 1.0. (See accompanying file
-    LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
    
-
    
-
    
-
    
-PrevUpHomeNext
-
    
-
-
diff --git a/doc/html/serialization/load_1_3_12_15_4_13_1_33.html b/doc/html/serialization/load_1_3_12_15_4_13_1_33.html
deleted file mode 100644
index 66f54ff192..0000000000
--- a/doc/html/serialization/load_1_3_12_15_4_13_1_33.html
+++ /dev/null
@@ -1,54 +0,0 @@
-
-
-
-
-Function template load
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    
-
    
-
    
-PrevUpHomeNext
-
    
-
    
-
    
-
    
-
    Function template load
    
-
    serialization::load — Function to load first_day_of_the_week_in_month objects using serialization lib. 
    
-
    
-
    Synopsis
    
-
    // In header: <boost/date_time/gregorian/greg_serialize.hpp>
-
-
-template<typename Archive> 
-  void load(Archive & ar, gregorian::first_kday_of_month & fkd, unsigned int);
    
-
    
-
    Description
    
-
    first_day_of_the_week_in_month objects are broken down into 2 parts for serialization: the day of the week, and the month 
    
-
    
-
    
-
-
-
-
    Copyright © 2001-2005 CrystalClear Software, Inc
    Subject to the Boost Software License, Version 1.0. (See accompanying file
-    LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
    
-
    
-
    
-
    
-PrevUpHomeNext
-
    
-
-
diff --git a/doc/html/serialization/load_1_3_12_15_4_13_1_36.html b/doc/html/serialization/load_1_3_12_15_4_13_1_36.html
deleted file mode 100644
index c06fd336f0..0000000000
--- a/doc/html/serialization/load_1_3_12_15_4_13_1_36.html
+++ /dev/null
@@ -1,54 +0,0 @@
-
-
-
-
-Function template load
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    
-
    
-
    
-PrevUpHomeNext
-
    
-
    
-
    
-
    
-
    Function template load
    
-
    serialization::load — Function to load last_day_of_the_week_in_month objects using serialization lib. 
    
-
    
-
    Synopsis
    
-
    // In header: <boost/date_time/gregorian/greg_serialize.hpp>
-
-
-template<typename Archive> 
-  void load(Archive & ar, gregorian::last_kday_of_month & lkd, unsigned int);
    
-
    
-
    Description
    
-
    last_day_of_the_week_in_month objects are broken down into 2 parts for serialization: the day of the week, and the month 
    
-
    
-
    
-
-
-
-
    Copyright © 2001-2005 CrystalClear Software, Inc
    Subject to the Boost Software License, Version 1.0. (See accompanying file
-    LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
    
-
    
-
    
-
    
-PrevUpHomeNext
-
    
-
-
diff --git a/doc/html/serialization/load_1_3_13_15_4_13_1_12.html b/doc/html/serialization/load_1_3_13_15_4_13_1_12.html
new file mode 100644
index 0000000000..775762846b
--- /dev/null
+++ b/doc/html/serialization/load_1_3_13_15_4_13_1_12.html
@@ -0,0 +1,54 @@
+
+
+
+
+Function template load
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    
+
    
+
    
+PrevUpHomeNext
+
    
+
    
+
    
+
    
+
    Function template load
    
+
    serialization::load — Function to load gregorian::date_period objects using serialization lib. 
    
+
    
+
    Synopsis
    
+
    // In header: <boost/date_time/gregorian/greg_serialize.hpp>
+
+
+template<typename Archive> 
+  void load(Archive & ar, gregorian::date_period & dp, unsigned int);
    
+
    
+
    Description
    
+
    date_period objects are broken down into 2 parts for serialization: the begining date object and the end date object 
    
+
    
+
    
+
+
+
+
    Copyright © 2001-2005 CrystalClear Software, Inc
    Subject to the Boost Software License, Version 1.0. (See accompanying file
+    LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
    
+
    
+
    
+
    
+PrevUpHomeNext
+
    
+
+
diff --git a/doc/html/serialization/load_1_3_13_15_4_13_1_27.html b/doc/html/serialization/load_1_3_13_15_4_13_1_27.html
new file mode 100644
index 0000000000..bd4281fafc
--- /dev/null
+++ b/doc/html/serialization/load_1_3_13_15_4_13_1_27.html
@@ -0,0 +1,54 @@
+
+
+
+
+Function template load
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    
+
    
+
    
+PrevUpHomeNext
+
    
+
    
+
    
+
    
+
    Function template load
    
+
    serialization::load — Function to load gregorian::partial_date objects using serialization lib. 
    
+
    
+
    Synopsis
    
+
    // In header: <boost/date_time/gregorian/greg_serialize.hpp>
+
+
+template<typename Archive> 
+  void load(Archive & ar, gregorian::partial_date & pd, unsigned int);
    
+
    
+
    Description
    
+
    partial_date objects are broken down into 2 parts for serialization: the day (greg_day) and month (greg_month) objects 
    
+
    
+
    
+
+
+
+
    Copyright © 2001-2005 CrystalClear Software, Inc
    Subject to the Boost Software License, Version 1.0. (See accompanying file
+    LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
    
+
    
+
    
+
    
+PrevUpHomeNext
+
    
+
+
diff --git a/doc/html/serialization/load_1_3_13_15_4_13_1_3.html b/doc/html/serialization/load_1_3_13_15_4_13_1_3.html
new file mode 100644
index 0000000000..ddb39f3890
--- /dev/null
+++ b/doc/html/serialization/load_1_3_13_15_4_13_1_3.html
@@ -0,0 +1,54 @@
+
+
+
+
+Function template load
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    
+
    
+
    
+PrevUpHomeNext
+
    
+
    
+
    
+
    
+
    Function template load
    
+
    serialization::load — Function to load gregorian::date objects using serialization lib. 
    
+
    
+
    Synopsis
    
+
    // In header: <boost/date_time/gregorian/greg_serialize.hpp>
+
+
+template<typename Archive> 
+  void load(Archive & ar, ::boost::gregorian::date & d, unsigned int);
    
+
    
+
    Description
    
+
    Dates are serialized into a string for transport and storage. While it would be more efficient to store the internal integer used to manipulate the dates, it is an unstable solution. 
    
+
    
+
    
+
+
+
+
    Copyright © 2001-2005 CrystalClear Software, Inc
    Subject to the Boost Software License, Version 1.0. (See accompanying file
+    LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
    
+
    
+
    
+
    
+PrevUpHomeNext
+
    
+
+
diff --git a/doc/html/serialization/load_1_3_13_15_4_13_1_30.html b/doc/html/serialization/load_1_3_13_15_4_13_1_30.html
new file mode 100644
index 0000000000..654b6cf95f
--- /dev/null
+++ b/doc/html/serialization/load_1_3_13_15_4_13_1_30.html
@@ -0,0 +1,54 @@
+
+
+
+
+Function template load
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    
+
    
+
    
+PrevUpHomeNext
+
    
+
    
+
    
+
    
+
    Function template load
    
+
    serialization::load — Function to load nth_day_of_the_week_in_month objects using serialization lib. 
    
+
    
+
    Synopsis
    
+
    // In header: <boost/date_time/gregorian/greg_serialize.hpp>
+
+
+template<typename Archive> 
+  void load(Archive & ar, gregorian::nth_kday_of_month & nkd, unsigned int);
    
+
    
+
    Description
    
+
    nth_day_of_the_week_in_month objects are broken down into 3 parts for serialization: the week number, the day of the week, and the month 
    
+
    
+
    
+
+
+
+
    Copyright © 2001-2005 CrystalClear Software, Inc
    Subject to the Boost Software License, Version 1.0. (See accompanying file
+    LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
    
+
    
+
    
+
    
+PrevUpHomeNext
+
    
+
+
diff --git a/doc/html/serialization/load_1_3_13_15_4_13_1_33.html b/doc/html/serialization/load_1_3_13_15_4_13_1_33.html
new file mode 100644
index 0000000000..7c592ba44b
--- /dev/null
+++ b/doc/html/serialization/load_1_3_13_15_4_13_1_33.html
@@ -0,0 +1,54 @@
+
+
+
+
+Function template load
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    
+
    
+
    
+PrevUpHomeNext
+
    
+
    
+
    
+
    
+
    Function template load
    
+
    serialization::load — Function to load first_day_of_the_week_in_month objects using serialization lib. 
    
+
    
+
    Synopsis
    
+
    // In header: <boost/date_time/gregorian/greg_serialize.hpp>
+
+
+template<typename Archive> 
+  void load(Archive & ar, gregorian::first_kday_of_month & fkd, unsigned int);
    
+
    
+
    Description
    
+
    first_day_of_the_week_in_month objects are broken down into 2 parts for serialization: the day of the week, and the month 
    
+
    
+
    
+
+
+
+
    Copyright © 2001-2005 CrystalClear Software, Inc
    Subject to the Boost Software License, Version 1.0. (See accompanying file
+    LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
    
+
    
+
    
+
    
+PrevUpHomeNext
+
    
+
+
diff --git a/doc/html/serialization/load_1_3_13_15_4_13_1_36.html b/doc/html/serialization/load_1_3_13_15_4_13_1_36.html
new file mode 100644
index 0000000000..ba6bf18694
--- /dev/null
+++ b/doc/html/serialization/load_1_3_13_15_4_13_1_36.html
@@ -0,0 +1,54 @@
+
+
+
+
+Function template load
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    
+
    
+
    
+PrevUpHomeNext
+
    
+
    
+
    
+
    
+
    Function template load
    
+
    serialization::load — Function to load last_day_of_the_week_in_month objects using serialization lib. 
    
+
    
+
    Synopsis
    
+
    // In header: <boost/date_time/gregorian/greg_serialize.hpp>
+
+
+template<typename Archive> 
+  void load(Archive & ar, gregorian::last_kday_of_month & lkd, unsigned int);
    
+
    
+
    Description
    
+
    last_day_of_the_week_in_month objects are broken down into 2 parts for serialization: the day of the week, and the month 
    
+
    
+
    
+
+
+
+
    Copyright © 2001-2005 CrystalClear Software, Inc
    Subject to the Boost Software License, Version 1.0. (See accompanying file
+    LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
    
+
    
+
    
+
    
+PrevUpHomeNext
+
    
+
+
diff --git a/doc/html/serialization/save_1_3_12_15_4_13_1_11.html b/doc/html/serialization/save_1_3_12_15_4_13_1_11.html
deleted file mode 100644
index fec36df30e..0000000000
--- a/doc/html/serialization/save_1_3_12_15_4_13_1_11.html
+++ /dev/null
@@ -1,54 +0,0 @@
-
-
-
-
-Function template save
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    
-
    
-
    
-PrevUpHomeNext
-
    
-
    
-
    
-
    
-
    Function template save
    
-
    serialization::save — Function to save gregorian::date_period objects using serialization lib. 
    
-
    
-
    Synopsis
    
-
    // In header: <boost/date_time/gregorian/greg_serialize.hpp>
-
-
-template<typename Archive> 
-  void save(Archive & ar, const gregorian::date_period & dp, unsigned int);
    
-
    
-
    Description
    
-
    date_period objects are broken down into 2 parts for serialization: the begining date object and the end date object 
    
-
    
-
    
-
-
-
-
    Copyright © 2001-2005 CrystalClear Software, Inc
    Subject to the Boost Software License, Version 1.0. (See accompanying file
-    LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
    
-
    
-
    
-
    
-PrevUpHomeNext
-
    
-
-
diff --git a/doc/html/serialization/save_1_3_12_15_4_13_1_2.html b/doc/html/serialization/save_1_3_12_15_4_13_1_2.html
deleted file mode 100644
index 7402487a3a..0000000000
--- a/doc/html/serialization/save_1_3_12_15_4_13_1_2.html
+++ /dev/null
@@ -1,54 +0,0 @@
-
-
-
-
-Function template save
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    
-
    
-
    
-PrevUpHomeNext
-
    
-
    
-
    
-
    
-
    Function template save
    
-
    serialization::save — Function to save gregorian::date objects using serialization lib. 
    
-
    
-
    Synopsis
    
-
    // In header: <boost/date_time/gregorian/greg_serialize.hpp>
-
-
-template<typename Archive> 
-  void save(Archive & ar, const ::boost::gregorian::date & d, unsigned int);
    
-
    
-
    Description
    
-
    Dates are serialized into a string for transport and storage. While it would be more efficient to store the internal integer used to manipulate the dates, it is an unstable solution. 
    
-
    
-
    
-
-
-
-
    Copyright © 2001-2005 CrystalClear Software, Inc
    Subject to the Boost Software License, Version 1.0. (See accompanying file
-    LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
    
-
    
-
    
-
    
-PrevUpHomeNext
-
    
-
-
diff --git a/doc/html/serialization/save_1_3_12_15_4_13_1_26.html b/doc/html/serialization/save_1_3_12_15_4_13_1_26.html
deleted file mode 100644
index f771745d78..0000000000
--- a/doc/html/serialization/save_1_3_12_15_4_13_1_26.html
+++ /dev/null
@@ -1,54 +0,0 @@
-
-
-
-
-Function template save
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    
-
    
-
    
-PrevUpHomeNext
-
    
-
    
-
    
-
    
-
    Function template save
    
-
    serialization::save — Function to save gregorian::partial_date objects using serialization lib. 
    
-
    
-
    Synopsis
    
-
    // In header: <boost/date_time/gregorian/greg_serialize.hpp>
-
-
-template<typename Archive> 
-  void save(Archive & ar, const gregorian::partial_date & pd, unsigned int);
    
-
    
-
    Description
    
-
    partial_date objects are broken down into 2 parts for serialization: the day (typically greg_day) and month (typically greg_month) objects 
    
-
    
-
    
-
-
-
-
    Copyright © 2001-2005 CrystalClear Software, Inc
    Subject to the Boost Software License, Version 1.0. (See accompanying file
-    LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
    
-
    
-
    
-
    
-PrevUpHomeNext
-
    
-
-
diff --git a/doc/html/serialization/save_1_3_12_15_4_13_1_29.html b/doc/html/serialization/save_1_3_12_15_4_13_1_29.html
deleted file mode 100644
index b1c76a6882..0000000000
--- a/doc/html/serialization/save_1_3_12_15_4_13_1_29.html
+++ /dev/null
@@ -1,55 +0,0 @@
-
-
-
-
-Function template save
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    
-
    
-
    
-PrevUpHomeNext
-
    
-
    
-
    
-
    
-
    Function template save
    
-
    serialization::save — Function to save nth_day_of_the_week_in_month objects using serialization lib. 
    
-
    
-
    Synopsis
    
-
    // In header: <boost/date_time/gregorian/greg_serialize.hpp>
-
-
-template<typename Archive> 
-  void save(Archive & ar, const gregorian::nth_kday_of_month & nkd, 
-            unsigned int);
    
-
    
-
    Description
    
-
    nth_day_of_the_week_in_month objects are broken down into 3 parts for serialization: the week number, the day of the week, and the month 
    
-
    
-
    
-
-
-
-
    Copyright © 2001-2005 CrystalClear Software, Inc
    Subject to the Boost Software License, Version 1.0. (See accompanying file
-    LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
    
-
    
-
    
-
    
-PrevUpHomeNext
-
    
-
-
diff --git a/doc/html/serialization/save_1_3_12_15_4_13_1_32.html b/doc/html/serialization/save_1_3_12_15_4_13_1_32.html
deleted file mode 100644
index 0dab92971e..0000000000
--- a/doc/html/serialization/save_1_3_12_15_4_13_1_32.html
+++ /dev/null
@@ -1,55 +0,0 @@
-
-
-
-
-Function template save
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    
-
    
-
    
-PrevUpHomeNext
-
    
-
    
-
    
-
    
-
    Function template save
    
-
    serialization::save — Function to save first_day_of_the_week_in_month objects using serialization lib. 
    
-
    
-
    Synopsis
    
-
    // In header: <boost/date_time/gregorian/greg_serialize.hpp>
-
-
-template<typename Archive> 
-  void save(Archive & ar, const gregorian::first_kday_of_month & fkd, 
-            unsigned int);
    
-
    
-
    Description
    
-
    first_day_of_the_week_in_month objects are broken down into 2 parts for serialization: the day of the week, and the month 
    
-
    
-
    
-
-
-
-
    Copyright © 2001-2005 CrystalClear Software, Inc
    Subject to the Boost Software License, Version 1.0. (See accompanying file
-    LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
    
-
    
-
    
-
    
-PrevUpHomeNext
-
    
-
-
diff --git a/doc/html/serialization/save_1_3_12_15_4_13_1_35.html b/doc/html/serialization/save_1_3_12_15_4_13_1_35.html
deleted file mode 100644
index d3d835206e..0000000000
--- a/doc/html/serialization/save_1_3_12_15_4_13_1_35.html
+++ /dev/null
@@ -1,55 +0,0 @@
-
-
-
-
-Function template save
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    
-
    
-
    
-PrevUpHomeNext
-
    
-
    
-
    
-
    
-
    Function template save
    
-
    serialization::save — Function to save last_day_of_the_week_in_month objects using serialization lib. 
    
-
    
-
    Synopsis
    
-
    // In header: <boost/date_time/gregorian/greg_serialize.hpp>
-
-
-template<typename Archive> 
-  void save(Archive & ar, const gregorian::last_kday_of_month & lkd, 
-            unsigned int);
    
-
    
-
    Description
    
-
    last_day_of_the_week_in_month objects are broken down into 2 parts for serialization: the day of the week, and the month 
    
-
    
-
    
-
-
-
-
    Copyright © 2001-2005 CrystalClear Software, Inc
    Subject to the Boost Software License, Version 1.0. (See accompanying file
-    LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
    
-
    
-
    
-
    
-PrevUpHomeNext
-
    
-
-
diff --git a/doc/html/serialization/save_1_3_13_15_4_13_1_11.html b/doc/html/serialization/save_1_3_13_15_4_13_1_11.html
new file mode 100644
index 0000000000..de9ca4a617
--- /dev/null
+++ b/doc/html/serialization/save_1_3_13_15_4_13_1_11.html
@@ -0,0 +1,54 @@
+
+
+
+
+Function template save
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    
+
    
+
    
+PrevUpHomeNext
+
    
+
    
+
    
+
    
+
    Function template save
    
+
    serialization::save — Function to save gregorian::date_period objects using serialization lib. 
    
+
    
+
    Synopsis
    
+
    // In header: <boost/date_time/gregorian/greg_serialize.hpp>
+
+
+template<typename Archive> 
+  void save(Archive & ar, const gregorian::date_period & dp, unsigned int);
    
+
    
+
    Description
    
+
    date_period objects are broken down into 2 parts for serialization: the begining date object and the end date object 
    
+
    
+
    
+
+
+
+
    Copyright © 2001-2005 CrystalClear Software, Inc
    Subject to the Boost Software License, Version 1.0. (See accompanying file
+    LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
    
+
    
+
    
+
    
+PrevUpHomeNext
+
    
+
+
diff --git a/doc/html/serialization/save_1_3_13_15_4_13_1_2.html b/doc/html/serialization/save_1_3_13_15_4_13_1_2.html
new file mode 100644
index 0000000000..7025cee733
--- /dev/null
+++ b/doc/html/serialization/save_1_3_13_15_4_13_1_2.html
@@ -0,0 +1,54 @@
+
+
+
+
+Function template save
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    
+
    
+
    
+PrevUpHomeNext
+
    
+
    
+
    
+
    
+
    Function template save
    
+
    serialization::save — Function to save gregorian::date objects using serialization lib. 
    
+
    
+
    Synopsis
    
+
    // In header: <boost/date_time/gregorian/greg_serialize.hpp>
+
+
+template<typename Archive> 
+  void save(Archive & ar, const ::boost::gregorian::date & d, unsigned int);
    
+
    
+
    Description
    
+
    Dates are serialized into a string for transport and storage. While it would be more efficient to store the internal integer used to manipulate the dates, it is an unstable solution. 
    
+
    
+
    
+
+
+
+
    Copyright © 2001-2005 CrystalClear Software, Inc
    Subject to the Boost Software License, Version 1.0. (See accompanying file
+    LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
    
+
    
+
    
+
    
+PrevUpHomeNext
+
    
+
+
diff --git a/doc/html/serialization/save_1_3_13_15_4_13_1_26.html b/doc/html/serialization/save_1_3_13_15_4_13_1_26.html
new file mode 100644
index 0000000000..1899eb3aa5
--- /dev/null
+++ b/doc/html/serialization/save_1_3_13_15_4_13_1_26.html
@@ -0,0 +1,54 @@
+
+
+
+
+Function template save
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    
+
    
+
    
+PrevUpHomeNext
+
    
+
    
+
    
+
    
+
    Function template save
    
+
    serialization::save — Function to save gregorian::partial_date objects using serialization lib. 
    
+
    
+
    Synopsis
    
+
    // In header: <boost/date_time/gregorian/greg_serialize.hpp>
+
+
+template<typename Archive> 
+  void save(Archive & ar, const gregorian::partial_date & pd, unsigned int);
    
+
    
+
    Description
    
+
    partial_date objects are broken down into 2 parts for serialization: the day (typically greg_day) and month (typically greg_month) objects 
    
+
    
+
    
+
+
+
+
    Copyright © 2001-2005 CrystalClear Software, Inc
    Subject to the Boost Software License, Version 1.0. (See accompanying file
+    LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
    
+
    
+
    
+
    
+PrevUpHomeNext
+
    
+
+
diff --git a/doc/html/serialization/save_1_3_13_15_4_13_1_29.html b/doc/html/serialization/save_1_3_13_15_4_13_1_29.html
new file mode 100644
index 0000000000..f99d47c03c
--- /dev/null
+++ b/doc/html/serialization/save_1_3_13_15_4_13_1_29.html
@@ -0,0 +1,55 @@
+
+
+
+
+Function template save
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    
+
    
+
    
+PrevUpHomeNext
+
    
+
    
+
    
+
    
+
    Function template save
    
+
    serialization::save — Function to save nth_day_of_the_week_in_month objects using serialization lib. 
    
+
    
+
    Synopsis
    
+
    // In header: <boost/date_time/gregorian/greg_serialize.hpp>
+
+
+template<typename Archive> 
+  void save(Archive & ar, const gregorian::nth_kday_of_month & nkd, 
+            unsigned int);
    
+
    
+
    Description
    
+
    nth_day_of_the_week_in_month objects are broken down into 3 parts for serialization: the week number, the day of the week, and the month 
    
+
    
+
    
+
+
+
+
    Copyright © 2001-2005 CrystalClear Software, Inc
    Subject to the Boost Software License, Version 1.0. (See accompanying file
+    LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
    
+
    
+
    
+
    
+PrevUpHomeNext
+
    
+
+
diff --git a/doc/html/serialization/save_1_3_13_15_4_13_1_32.html b/doc/html/serialization/save_1_3_13_15_4_13_1_32.html
new file mode 100644
index 0000000000..e96130a384
--- /dev/null
+++ b/doc/html/serialization/save_1_3_13_15_4_13_1_32.html
@@ -0,0 +1,55 @@
+
+
+
+
+Function template save
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    
+
    
+
    
+PrevUpHomeNext
+
    
+
    
+
    
+
    
+
    Function template save
    
+
    serialization::save — Function to save first_day_of_the_week_in_month objects using serialization lib. 
    
+
    
+
    Synopsis
    
+
    // In header: <boost/date_time/gregorian/greg_serialize.hpp>
+
+
+template<typename Archive> 
+  void save(Archive & ar, const gregorian::first_kday_of_month & fkd, 
+            unsigned int);
    
+
    
+
    Description
    
+
    first_day_of_the_week_in_month objects are broken down into 2 parts for serialization: the day of the week, and the month 
    
+
    
+
    
+
+
+
+
    Copyright © 2001-2005 CrystalClear Software, Inc
    Subject to the Boost Software License, Version 1.0. (See accompanying file
+    LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
    
+
    
+
    
+
    
+PrevUpHomeNext
+
    
+
+
diff --git a/doc/html/serialization/save_1_3_13_15_4_13_1_35.html b/doc/html/serialization/save_1_3_13_15_4_13_1_35.html
new file mode 100644
index 0000000000..223a6e24eb
--- /dev/null
+++ b/doc/html/serialization/save_1_3_13_15_4_13_1_35.html
@@ -0,0 +1,55 @@
+
+
+
+
+Function template save
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    
+
    
+
    
+PrevUpHomeNext
+
    
+
    
+
    
+
    
+
    Function template save
    
+
    serialization::save — Function to save last_day_of_the_week_in_month objects using serialization lib. 
    
+
    
+
    Synopsis
    
+
    // In header: <boost/date_time/gregorian/greg_serialize.hpp>
+
+
+template<typename Archive> 
+  void save(Archive & ar, const gregorian::last_kday_of_month & lkd, 
+            unsigned int);
    
+
    
+
    Description
    
+
    last_day_of_the_week_in_month objects are broken down into 2 parts for serialization: the day of the week, and the month 
    
+
    
+
    
+
+
+
+
    Copyright © 2001-2005 CrystalClear Software, Inc
    Subject to the Boost Software License, Version 1.0. (See accompanying file
+    LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
    
+
    
+
    
+
    
+PrevUpHomeNext
+
    
+
+
diff --git a/doc/html/serialization/serialize.html b/doc/html/serialization/serialize.html
index 8addc1553c..c2a8f4b14a 100644
--- a/doc/html/serialization/serialize.html
+++ b/doc/html/serialization/serialize.html
@@ -8,7 +8,7 @@
 
 
 
-
+
 
 
 
@@ -21,7 +21,7 @@
 
    
 
    
 
    
-PrevUpHomeNext
+PrevUpHomeNext
 
    
 
    
 
    
@@ -37,7 +37,7 @@
   void serialize(Archive & ar, ::boost::gregorian::date & d, 
                  const unsigned int file_version);
    
 
    
-
    Description
    
+
    Description
    
 
    Method that does serialization for gregorian::date – splits to load/save 
    
 
    
 
@@ -49,7 +49,7 @@
 
    
 
    
 
    
-PrevUpHomeNext
+PrevUpHomeNext
 
    
 
 
diff --git a/doc/html/stacktrace.html b/doc/html/stacktrace.html
index 4f87133a48..8aef5a9625 100644
--- a/doc/html/stacktrace.html
+++ b/doc/html/stacktrace.html
@@ -86,7 +86,7 @@
 
 
 
-
+
    Last revised: December 14, 2017 at 00:06:01 GMT
    Last revised: April 11, 2018 at 14:08:03 GMT
    		
 
    		
 
    
 
    
diff --git a/doc/html/stacktrace/getting_started.html b/doc/html/stacktrace/getting_started.html
index 8ffb76fac1..aa32e575ca 100644
--- a/doc/html/stacktrace/getting_started.html
+++ b/doc/html/stacktrace/getting_started.html
@@ -126,6 +126,16 @@
           parse it on program restart.
         
    
 
    
+
    
+
+
+
+
+
+
    [Warning]Warning
    
+          Not all the platforms provide means for even getting stacktrace in async
+          signal safe way. No stack trace will be saved on such platforms.
+        
    
 
    
         Let's write a handler to safely dump stacktrace:
       
    
diff --git a/doc/html/std/insert_iterato_idp58095904.html b/doc/html/std/insert_iterato_idp58095904.html
new file mode 100644
index 0000000000..84f289b0e4
--- /dev/null
+++ b/doc/html/std/insert_iterato_idp58095904.html
@@ -0,0 +1,96 @@
+
+
+
+
+Class template insert_iterator<boost::container::slist< T, Allocator >>
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    
+
    
+
    
+PrevUpHomeNext
+
    
+
    
+
    
+
    
+
    Class template insert_iterator<boost::container::slist< T, Allocator >>
    
+
    std::insert_iterator<boost::container::slist< T, Allocator >>
    
+
    
+
    Synopsis
    
+
    // In header: <boost/container/slist.hpp>
+
+template<typename T, typename Allocator> 
+class insert_iterator<boost::container::slist< T, Allocator >> {
+public:
+  // types
+  typedef Container           container_type;   
+  typedef output_iterator_tag iterator_category;
+  typedef void                value_type;       
+  typedef void                difference_type;  
+  typedef void                pointer;          
+  typedef void                reference;        
+
+  // construct/copy/destruct
+  insert_iterator(Container &, typename Container::iterator, bool = false);
+  insert_iterator< Container > & 
+  operator=(const typename Container::value_type &);
+
+  // public member functions
+  insert_iterator< Container > & operator*();
+  insert_iterator< Container > & operator++();
+  insert_iterator< Container > & operator++(int);
+};
    
+
    
+
    Description
    
+
    A specialization of insert_iterator that works with slist 
    
+
    
+
    
+insert_iterator 
+        public
+       construct/copy/destruct
    
+
      
+
    1. insert_iterator(Container & x, typename Container::iterator i, 
+                bool is_previous = false);
      2. 
+
    2. insert_iterator< Container > & 
+operator=(const typename Container::value_type & value);
      3. 
+
    
+
    
+
    
+
    
+insert_iterator public member functions
    
+
      
+
    1. insert_iterator< Container > & operator*();
      2. 
+
    2. insert_iterator< Container > & operator++();
      3. 
+
    3. insert_iterator< Container > & operator++(int);
      4. 
+
    
+
    
+
    
+
    
+
+
+
+
    Copyright © 2009-2017 Ion
+      Gaztanaga
    
+        Distributed under the Boost Software License, Version 1.0. (See accompanying
+        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+      
    
+
    
+
    
+
    
+PrevUpHomeNext
+
    
+
+
diff --git a/doc/html/std/insert_iterato_idp65191984.html b/doc/html/std/insert_iterato_idp65191984.html
deleted file mode 100644
index 2513a2516e..0000000000
--- a/doc/html/std/insert_iterato_idp65191984.html
+++ /dev/null
@@ -1,95 +0,0 @@
-
-
-
-
-Class template insert_iterator<boost::container::slist< T, Allocator >>
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    
-
    
-
    
-PrevUpHomeNext
-
    
-
    
-
    
-
    
-
    Class template insert_iterator<boost::container::slist< T, Allocator >>
    
-
    std::insert_iterator<boost::container::slist< T, Allocator >>
    
-
    
-
    Synopsis
    
-
    // In header: <boost/container/slist.hpp>
-
-template<typename T, typename Allocator> 
-class insert_iterator<boost::container::slist< T, Allocator >> {
-public:
-  // types
-  typedef Container           container_type;   
-  typedef output_iterator_tag iterator_category;
-  typedef void                value_type;       
-  typedef void                difference_type;  
-  typedef void                pointer;          
-  typedef void                reference;        
-
-  // construct/copy/destruct
-  insert_iterator(Container &, typename Container::iterator, bool = false);
-  insert_iterator< Container > & 
-  operator=(const typename Container::value_type &);
-
-  // public member functions
-  insert_iterator< Container > & operator*();
-  insert_iterator< Container > & operator++();
-  insert_iterator< Container > & operator++(int);
-};
    
-
    
-
    Description
    
-
    A specialization of insert_iterator that works with slist 
    
-
    
-
    
-insert_iterator 
-        public
-       construct/copy/destruct
    
-
      
-
    1. insert_iterator(Container & x, typename Container::iterator i, 
-                bool is_previous = false);
      2. 
-
    2. insert_iterator< Container > & 
-operator=(const typename Container::value_type & value);
      3. 
-
    
-
    
-
    
-
    
-insert_iterator public member functions
    
-
      
-
    1. insert_iterator< Container > & operator*();
      2. 
-
    2. insert_iterator< Container > & operator++();
      3. 
-
    3. insert_iterator< Container > & operator++(int);
      4. 
-
    
-
    
-
    
-
    
-
-
-
-
    Copyright © 2009-2015 Ion Gaztanaga
    
-        Distributed under the Boost Software License, Version 1.0. (See accompanying
-        file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-      
    
-
    
-
    
-
    
-PrevUpHomeNext
-
    
-
-
diff --git a/doc/html/std/numeric_1_3_44_10_2_31_2_1.html b/doc/html/std/numeric_1_3_44_10_2_31_2_1.html
index 38873bf2bb..f24e6815b5 100644
--- a/doc/html/std/numeric_1_3_44_10_2_31_2_1.html
+++ b/doc/html/std/numeric_1_3_44_10_2_31_2_1.html
@@ -39,40 +39,40 @@
   typedef ::boost::units::quantity< Unit, T > quantity_type;
 
   // public static functions
-  static quantity_type() min();
-  static quantity_type() max();
-  static quantity_type() lowest();
-  static quantity_type epsilon();
-  static quantity_type round_error();
-  static quantity_type infinity();
-  static quantity_type quiet_NaN();
-  static quantity_type signaling_NaN();
-  static quantity_type denorm_min();
+  static BOOST_CONSTEXPR quantity_type() min();
+  static BOOST_CONSTEXPR quantity_type() max();
+  static BOOST_CONSTEXPR quantity_type() lowest();
+  static BOOST_CONSTEXPR quantity_type epsilon();
+  static BOOST_CONSTEXPR quantity_type round_error();
+  static BOOST_CONSTEXPR quantity_type infinity();
+  static BOOST_CONSTEXPR quantity_type quiet_NaN();
+  static BOOST_CONSTEXPR quantity_type signaling_NaN();
+  static BOOST_CONSTEXPR quantity_type denorm_min();
 
   // public data members
-  static const bool is_specialized;
-  static const int digits;
-  static const int digits10;
-  static const int max_digits10;
-  static const bool is_signed;
-  static const bool is_integer;
-  static const bool is_exact;
-  static const int radix;
-  static const int min_exponent;
-  static const int min_exponent10;
-  static const int max_exponent;
-  static const int max_exponent10;
-  static const bool has_infinity;
-  static const bool has_quiet_NaN;
-  static const bool has_signaling_NaN;
-  static const bool has_denorm_loss;
-  static const bool is_iec559;
-  static const bool is_bounded;
-  static const bool is_modulo;
-  static const bool traps;
-  static const bool tinyness_before;
-  static const float_denorm_style has_denorm;
-  static const float_round_style round_style;
+  BOOST_STATIC_CONSTEXPR bool is_specialized;
+  BOOST_STATIC_CONSTEXPR int digits;
+  BOOST_STATIC_CONSTEXPR int digits10;
+  BOOST_STATIC_CONSTEXPR int max_digits10;
+  BOOST_STATIC_CONSTEXPR bool is_signed;
+  BOOST_STATIC_CONSTEXPR bool is_integer;
+  BOOST_STATIC_CONSTEXPR bool is_exact;
+  BOOST_STATIC_CONSTEXPR int radix;
+  BOOST_STATIC_CONSTEXPR int min_exponent;
+  BOOST_STATIC_CONSTEXPR int min_exponent10;
+  BOOST_STATIC_CONSTEXPR int max_exponent;
+  BOOST_STATIC_CONSTEXPR int max_exponent10;
+  BOOST_STATIC_CONSTEXPR bool has_infinity;
+  BOOST_STATIC_CONSTEXPR bool has_quiet_NaN;
+  BOOST_STATIC_CONSTEXPR bool has_signaling_NaN;
+  BOOST_STATIC_CONSTEXPR bool has_denorm_loss;
+  BOOST_STATIC_CONSTEXPR bool is_iec559;
+  BOOST_STATIC_CONSTEXPR bool is_bounded;
+  BOOST_STATIC_CONSTEXPR bool is_modulo;
+  BOOST_STATIC_CONSTEXPR bool traps;
+  BOOST_STATIC_CONSTEXPR bool tinyness_before;
+  BOOST_STATIC_CONSTEXPR float_denorm_style has_denorm;
+  BOOST_STATIC_CONSTEXPR float_round_style round_style;
 };
 
    
 
    Description
    
@@ -80,15 +80,15 @@
 
    
 numeric_limits public static functions
    
 
      
-
    1. static quantity_type() min();
      2. 
-
    2. static quantity_type() max();
      3. 
-
    3. static quantity_type() lowest();
      4. 
-
    4. static quantity_type epsilon();
      5. 
-
    5. static quantity_type round_error();
      6. 
-
    6. static quantity_type infinity();
      7. 
-
    7. static quantity_type quiet_NaN();
      8. 
-
    8. static quantity_type signaling_NaN();
      9. 
-
    9. static quantity_type denorm_min();
      10. 
+
    10. static BOOST_CONSTEXPR quantity_type() min();
      11. 
+
    11. static BOOST_CONSTEXPR quantity_type() max();
      12. 
+
    12. static BOOST_CONSTEXPR quantity_type() lowest();
      13. 
+
    13. static BOOST_CONSTEXPR quantity_type epsilon();
      14. 
+
    14. static BOOST_CONSTEXPR quantity_type round_error();
      15. 
+
    15. static BOOST_CONSTEXPR quantity_type infinity();
      16. 
+
    16. static BOOST_CONSTEXPR quantity_type quiet_NaN();
      17. 
+
    17. static BOOST_CONSTEXPR quantity_type signaling_NaN();
      18. 
+
    18. static BOOST_CONSTEXPR quantity_type denorm_min();
      19. 
 
    
 
    
 
diff --git a/doc/html/thread.html b/doc/html/thread.html
index 4ffaeec6c0..b6107ae0dd 100644
--- a/doc/html/thread.html
+++ b/doc/html/thread.html
@@ -177,7 +177,7 @@
 
 
 
-
+
    Last revised: December 14, 2017 at 00:06:00 GMT
    Last revised: April 11, 2018 at 14:08:02 GMT
    		
 
    		
 
    
 
    
diff --git a/doc/html/thread/build.html b/doc/html/thread/build.html
index 22300fa14a..0199642d09 100644
--- a/doc/html/thread/build.html
+++ b/doc/html/thread/build.html
@@ -810,7 +810,7 @@
 
 
    
           The Boost.DateTime time related functions introduced in Boost 1.35.0, using
-          the Boost.Date_Time library are deprecated.
+          the Boost.Date_Time library are deprecated.
           These include (but are not limited to):
         
    
 
      
diff --git a/doc/html/thread/changes.html b/doc/html/thread/changes.html
index c02ca2b054..6ea6c9d533 100644
--- a/doc/html/thread/changes.html
+++ b/doc/html/thread/changes.html
@@ -57,6 +57,15 @@
       Fixed Bugs:
     
      
 
        
+
      • 
+          #12323
+          windows - boost/thread/win32/mfc_thread_init.hpp has wrong signature for
+          _pRawDllMainOrig
+        
        • 
+
      • 
+          #12730
+          windows - static threads library is incompatible with MSVC 2017 RC
+        
        • 
 
      • 
           #12976
           Boost Thread Executors documentation mistakes
@@ -71,14 +80,59 @@
           #13019
           ABI compatibility for BOOST_THREAD_PROVIDES_INTERRUPTIONS incomplete
         
        • 
+
      • 
+          #13069
+          Boost unit test "sync_pq_multi_thread_p_lib.exe" hung in thread
+          library
+        
        • 
 
      • 
           #13163
           boost::detail::heap_new does not have a variadic variant
         
        • 
+
      • 
+          #13226
+          getpagesize() is deprecated since 199506L
+        
        • 
+
      • 
+          #132
+          VS 2017.4 Preview deadlocks on Test 10964
+        
        • 
+
      • 
+          #133
+          windows - Spurious timing test failures on windows
+        
        • 
+
      • 
+          #134
+          VS 2017.4 Preview deadlock in sync_pq_multi_thread_p_lib.exe
+        
        • 
+
      • 
+          #135
+          VS 2017.4 Preview test_scheduled_tp_p.exe deadlock
+        
        • 
+
      • 
+          #136
+          VS 2017.4 Preview test_scheduler_p.exe deadlock
+        
        • 
+
      • 
+          #137
+          VS 2017.4 Preview executor_ex.exe deadlock
+        
        • 
+
      • 
+          #143
+          Failures on msvc-12.0
+        
        • 
+
      • 
+          #145
+          Clang build error with BOOST_THREAD_ATTRIBUTE_MAY_ALIAS
+        
        • 
 
      
 
      
       New Experimental Features:
     
      
+
      • 
+          #116
+          [Proposal] Add APIs for deferred set_value/exception
+        
      
 
      
 
       Version
diff --git a/doc/html/thread/time.html b/doc/html/thread/time.html
index b534a4e624..1b0d7095a9 100644
--- a/doc/html/thread/time.html
+++ b/doc/html/thread/time.html
@@ -75,7 +75,7 @@
         function get_system_time()
 
    
 
    
-        The time related functions introduced in Boost 1.35.0, using the Boost.Date_Time
+        The time related functions introduced in Boost 1.35.0, using the Boost.Date_Time
         library are deprecated. These include (but are not limited to):
       
    
 
    
diff --git a/doc/html/tribool/tests.html b/doc/html/tribool/tests.html
index 2e8a3372c0..06a8e75a34 100644
--- a/doc/html/tribool/tests.html
+++ b/doc/html/tribool/tests.html
@@ -7,7 +7,7 @@
 
 
 
-
+
 
 
 
@@ -21,7 +21,7 @@
 
    
 
    
 
    
-PrevUpHomeNext
+PrevUpHomeNext
 
    
 
    
 
    
@@ -78,7 +78,7 @@
 
    
 
    
 
    
-PrevUpHomeNext
+PrevUpHomeNext
 
    
 
 
diff --git a/doc/html/unordered.html b/doc/html/unordered.html
index 72493c6af7..ede438d86f 100644
--- a/doc/html/unordered.html
+++ b/doc/html/unordered.html
@@ -183,7 +183,7 @@
 
 
 
-
+
    Last revised: December 14, 2017 at 00:05:58 GMT
    Last revised: April 11, 2018 at 14:08:01 GMT
    		
 
    		
 
    
 
    
diff --git a/doc/html/unordered/changes.html b/doc/html/unordered/changes.html
index 29392d9c45..fc77474e62 100644
--- a/doc/html/unordered/changes.html
+++ b/doc/html/unordered/changes.html
@@ -690,6 +690,73 @@
           #6).
         
 
+
    
+
+      Boost
+      1.67.0
+    
    
+
      
+
    • 
+          Improved C++17 support:
+          
        
+
      • 
+                Add template deduction guides from the standard.
+              
        • 
+
      • 
+                Use a simple implementation of optional
+                in node handles, so that they're closer to the standard.
+              
        • 
+
      • 
+                Add missing noexcept
+                specifications to swap,
+                operator=
+                and node handles, and change the implementation to match. Using
+                std::allocator_traits::is_always_equal, or our own implementation
+                when not available, and boost::is_nothrow_swappable
+                in the implementation.
+              
        • 
+
      
+        
      • 
+
    • 
+          Improved C++20 support:
+          
      • 
+                Use boost::to_address, which has the proposed
+                C++20 semantics, rather than the old custom implementation.
+              
      
+        
      • 
+
    • 
+          Add element_type to iterators,
+          so that std::pointer_traits will work.
+        
      • 
+
    • 
+          Use std::piecewise_construct on recent versions
+          of Visual C++, and other uses of the Dinkumware standard library, now using
+          Boost.Predef to check compiler and library versions.
+        
      • 
+
    • 
+          Use std::iterator_traits rather than the boost
+          iterator traits in order to remove dependency on Boost.Iterator.
+        
      • 
+
    • 
+          Remove iterators' inheritance from std::iterator,
+          which is deprecated in C++17, thanks to Daniela Engert (PR#7).
+        
      • 
+
    • 
+          Stop using BOOST_DEDUCED_TYPENAME.
+        
      • 
+
    • 
+          Update some Boost include paths.
+        
      • 
+
    • 
+          Rename some internal methods, and variables.
+        
      • 
+
    • 
+          Various testing improvements.
+        
      • 
+
    • 
+          Miscellaneous internal changes.
+        
      • 
+
    
 
 
diff --git a/doc/html/unordered/hash_equality.html b/doc/html/unordered/hash_equality.html
index 4818b73ca5..aa52062ce5 100644
--- a/doc/html/unordered/hash_equality.html
+++ b/doc/html/unordered/hash_equality.html
@@ -141,7 +141,7 @@
 boost::unordered_multiset<point,point_hash>points;
    
-      Since the default hash function is Boost.Hash,
+      Since the default hash function is Boost.Hash,
       we can extend it to support the type so
       that the hash function doesn't need to be explicitly given:
     
    
diff --git a/doc/html/xpressive.html b/doc/html/xpressive.html
index 50b9deabf5..012fd56c80 100644
--- a/doc/html/xpressive.html
+++ b/doc/html/xpressive.html
@@ -189,7 +189,7 @@
 
    
   
 
 
 
 
    
-
+
    Last revised: December 14, 2017 at 00:05:58 GMT
    Last revised: April 11, 2018 at 14:08:01 GMT
    		
 
    		
 
    
 
    
-- 
cgit v1.2.3