From 4fadd968fa12130524c8380f33fcfe25d4de79e5 Mon Sep 17 00:00:00 2001 From: DongHun Kwak Date: Wed, 13 Sep 2017 11:24:46 +0900 Subject: Imported Upstream version 1.65.0 Change-Id: Icf8400b375482cb11bcf77440a6934ba360d6ba4 Signed-off-by: DongHun Kwak --- doc/html/boost/algorithm/FinderConcept.html | 12 +-- doc/html/boost/algorithm/FormatterConcept.html | 12 +-- doc/html/boost/algorithm/all.html | 2 +- .../boost/algorithm/all_of_equal_idp422738128.html | 102 ------------------- .../boost/algorithm/all_of_equal_idp422744432.html | 98 ------------------ doc/html/boost/algorithm/all_of_idp422726016.html | 111 -------------------- doc/html/boost/algorithm/all_of_idp422732832.html | 98 ------------------ .../boost/algorithm/any_of_equal_idp422763968.html | 102 ------------------- .../boost/algorithm/any_of_equal_idp422770272.html | 98 ------------------ doc/html/boost/algorithm/any_of_idp422752368.html | 102 ------------------- doc/html/boost/algorithm/any_of_idp422758672.html | 98 ------------------ doc/html/boost/algorithm/boyer_moore.html | 89 ---------------- .../algorithm/boyer_moore_h_idp423347248.html | 92 ----------------- doc/html/boost/algorithm/boyer_moore_horspool.html | 89 ---------------- .../algorithm/boyer_moore_s_idp423312736.html | 92 ----------------- doc/html/boost/algorithm/clamp_idp422683472.html | 100 ------------------ doc/html/boost/algorithm/clamp_idp422690464.html | 95 ----------------- .../boost/algorithm/clamp_range_idp422701072.html | 100 ------------------ .../boost/algorithm/clamp_range_idp422714480.html | 105 ------------------- doc/html/boost/algorithm/const_formatter.html | 2 +- doc/html/boost/algorithm/contains.html | 2 +- doc/html/boost/algorithm/copy_if_idp422778208.html | 108 -------------------- doc/html/boost/algorithm/copy_if_idp422786384.html | 93 ----------------- doc/html/boost/algorithm/copy_n.html | 102 ------------------- .../boost/algorithm/copy_until_idp422807392.html | 99 ------------------ .../boost/algorithm/copy_until_idp422815072.html | 94 ----------------- .../boost/algorithm/copy_while_idp422793040.html | 99 ------------------ .../boost/algorithm/copy_while_idp422800720.html | 94 ----------------- doc/html/boost/algorithm/dissect_formatter.html | 2 +- doc/html/boost/algorithm/empty_formatter.html | 2 +- doc/html/boost/algorithm/ends_with.html | 2 +- doc/html/boost/algorithm/equal_idp423084448.html | 104 ------------------- doc/html/boost/algorithm/equal_idp423092752.html | 98 ------------------ doc/html/boost/algorithm/equals.html | 2 +- doc/html/boost/algorithm/erase_all.html | 2 +- doc/html/boost/algorithm/erase_all_copy.html | 2 +- doc/html/boost/algorithm/erase_all_regex.html | 2 +- doc/html/boost/algorithm/erase_all_regex_copy.html | 2 +- doc/html/boost/algorithm/erase_first.html | 2 +- doc/html/boost/algorithm/erase_first_copy.html | 2 +- doc/html/boost/algorithm/erase_head.html | 2 +- doc/html/boost/algorithm/erase_head_copy.html | 2 +- doc/html/boost/algorithm/erase_last.html | 2 +- doc/html/boost/algorithm/erase_last_copy.html | 2 +- doc/html/boost/algorithm/erase_nth.html | 2 +- doc/html/boost/algorithm/erase_nth_copy.html | 2 +- doc/html/boost/algorithm/erase_range.html | 2 +- doc/html/boost/algorithm/erase_range_copy.html | 2 +- doc/html/boost/algorithm/erase_regex.html | 2 +- doc/html/boost/algorithm/erase_regex_copy.html | 2 +- doc/html/boost/algorithm/erase_tail.html | 2 +- doc/html/boost/algorithm/erase_tail_copy.html | 2 +- doc/html/boost/algorithm/find.html | 2 +- doc/html/boost/algorithm/find_all.html | 2 +- doc/html/boost/algorithm/find_all_regex.html | 2 +- doc/html/boost/algorithm/find_first.html | 2 +- doc/html/boost/algorithm/find_format.html | 2 +- doc/html/boost/algorithm/find_format_all.html | 2 +- doc/html/boost/algorithm/find_format_all_copy.html | 2 +- doc/html/boost/algorithm/find_format_copy.html | 2 +- doc/html/boost/algorithm/find_head.html | 2 +- .../boost/algorithm/find_if_not_idp422834192.html | 103 ------------------- .../boost/algorithm/find_if_not_idp422840752.html | 90 ---------------- doc/html/boost/algorithm/find_iterator.html | 48 ++++----- doc/html/boost/algorithm/find_last.html | 2 +- doc/html/boost/algorithm/find_nth.html | 2 +- doc/html/boost/algorithm/find_regex.html | 2 +- doc/html/boost/algorithm/find_tail.html | 2 +- doc/html/boost/algorithm/find_token.html | 2 +- doc/html/boost/algorithm/first_finder.html | 2 +- doc/html/boost/algorithm/has_const_time_erase.html | 2 +- .../boost/algorithm/has_const_time_insert.html | 2 +- doc/html/boost/algorithm/has_native_replace.html | 2 +- doc/html/boost/algorithm/has_stable_iterators.html | 2 +- doc/html/boost/algorithm/head_finder.html | 2 +- doc/html/boost/algorithm/hex_decode_error.html | 52 ---------- doc/html/boost/algorithm/hex_idp423135952.html | 102 ------------------- doc/html/boost/algorithm/hex_idp423149440.html | 99 ------------------ doc/html/boost/algorithm/hex_idp423160656.html | 98 ------------------ doc/html/boost/algorithm/hex_idp423189792.html | 82 --------------- .../boost/algorithm/hex_lower_idp423142640.html | 103 ------------------- .../boost/algorithm/hex_lower_idp423154992.html | 99 ------------------ .../boost/algorithm/hex_lower_idp423166336.html | 98 ------------------ .../boost/algorithm/hex_lower_idp423193328.html | 82 --------------- doc/html/boost/algorithm/icontains.html | 2 +- doc/html/boost/algorithm/identity_formatter.html | 2 +- doc/html/boost/algorithm/iends_with.html | 2 +- doc/html/boost/algorithm/iequals.html | 2 +- doc/html/boost/algorithm/ierase_all.html | 2 +- doc/html/boost/algorithm/ierase_all_copy.html | 2 +- doc/html/boost/algorithm/ierase_first.html | 2 +- doc/html/boost/algorithm/ierase_first_copy.html | 2 +- doc/html/boost/algorithm/ierase_last.html | 2 +- doc/html/boost/algorithm/ierase_last_copy.html | 2 +- doc/html/boost/algorithm/ierase_nth.html | 2 +- doc/html/boost/algorithm/ierase_nth_copy.html | 2 +- doc/html/boost/algorithm/ifind_all.html | 8 +- doc/html/boost/algorithm/ifind_first.html | 2 +- doc/html/boost/algorithm/ifind_last.html | 2 +- doc/html/boost/algorithm/ifind_nth.html | 2 +- .../boost/algorithm/ilexicographical_compare.html | 2 +- doc/html/boost/algorithm/iota_idp422848432.html | 95 ----------------- doc/html/boost/algorithm/iota_idp422854608.html | 81 --------------- doc/html/boost/algorithm/iota_n.html | 86 ---------------- doc/html/boost/algorithm/ireplace_all.html | 2 +- doc/html/boost/algorithm/ireplace_all_copy.html | 2 +- doc/html/boost/algorithm/ireplace_first.html | 2 +- doc/html/boost/algorithm/ireplace_first_copy.html | 2 +- doc/html/boost/algorithm/ireplace_last.html | 2 +- doc/html/boost/algorithm/ireplace_last_copy.html | 2 +- doc/html/boost/algorithm/ireplace_nth.html | 2 +- doc/html/boost/algorithm/ireplace_nth_copy.html | 2 +- doc/html/boost/algorithm/is_alnum.html | 2 +- doc/html/boost/algorithm/is_alpha.html | 2 +- doc/html/boost/algorithm/is_any_of.html | 2 +- doc/html/boost/algorithm/is_classified.html | 2 +- doc/html/boost/algorithm/is_cntrl.html | 8 +- .../algorithm/is_decreasing_idp422971024.html | 98 ------------------ .../algorithm/is_decreasing_idp422976112.html | 91 ----------------- .../boost/algorithm/is_digit_idp418685568.html | 83 --------------- .../boost/algorithm/is_digit_idp440233520.html | 83 +++++++++++++++ doc/html/boost/algorithm/is_equal.html | 18 ++-- doc/html/boost/algorithm/is_from_range.html | 8 +- doc/html/boost/algorithm/is_graph.html | 8 +- doc/html/boost/algorithm/is_iequal.html | 18 ++-- doc/html/boost/algorithm/is_iless.html | 18 ++-- .../algorithm/is_increasing_idp422961856.html | 98 ------------------ .../algorithm/is_increasing_idp422966944.html | 91 ----------------- doc/html/boost/algorithm/is_less.html | 12 +-- doc/html/boost/algorithm/is_lower.html | 2 +- doc/html/boost/algorithm/is_not_greater.html | 12 +-- doc/html/boost/algorithm/is_not_igreater.html | 18 ++-- .../algorithm/is_palindrome_idp423203264.html | 103 ------------------- .../algorithm/is_palindrome_idp423209728.html | 98 ------------------ .../algorithm/is_palindrome_idp423214688.html | 91 ----------------- .../algorithm/is_palindrome_idp423218640.html | 98 ------------------ .../algorithm/is_palindrome_idp423224096.html | 91 ----------------- .../algorithm/is_palindrome_idp423227296.html | 97 ------------------ .../algorithm/is_partitione_idp422867568.html | 96 ----------------- .../algorithm/is_partitione_idp422873744.html | 82 --------------- .../algorithm/is_permutatio_idp422880272.html | 101 ------------------ .../algorithm/is_permutatio_idp422888064.html | 92 ----------------- .../algorithm/is_permutatio_idp422893968.html | 82 --------------- .../algorithm/is_permutatio_idp422898736.html | 88 ---------------- .../algorithm/is_permutatio_idp422907008.html | 100 ------------------ .../algorithm/is_permutatio_idp422914304.html | 106 ------------------- doc/html/boost/algorithm/is_print.html | 2 +- doc/html/boost/algorithm/is_punct.html | 2 +- .../boost/algorithm/is_sorted_idp422935184.html | 93 ----------------- .../boost/algorithm/is_sorted_idp422940976.html | 89 ---------------- .../boost/algorithm/is_sorted_idp422953568.html | 90 ---------------- .../boost/algorithm/is_sorted_idp422958576.html | 82 --------------- .../algorithm/is_sorted_unt_idp422924976.html | 94 ----------------- .../algorithm/is_sorted_unt_idp422930896.html | 89 ---------------- .../algorithm/is_sorted_unt_idp422945264.html | 90 ---------------- .../algorithm/is_sorted_unt_idp422950288.html | 83 --------------- doc/html/boost/algorithm/is_space.html | 2 +- .../algorithm/is_strictly_d_idp422989360.html | 98 ------------------ .../algorithm/is_strictly_d_idp422994448.html | 91 ----------------- .../algorithm/is_strictly_i_idp422980192.html | 98 ------------------ .../algorithm/is_strictly_i_idp422985280.html | 91 ----------------- doc/html/boost/algorithm/is_upper.html | 2 +- doc/html/boost/algorithm/is_xdigit.html | 2 +- doc/html/boost/algorithm/istarts_with.html | 2 +- doc/html/boost/algorithm/iter_find.html | 2 +- doc/html/boost/algorithm/iter_split.html | 2 +- doc/html/boost/algorithm/join.html | 8 +- doc/html/boost/algorithm/join_if_idp419281968.html | 105 ------------------- doc/html/boost/algorithm/join_if_idp419514736.html | 112 -------------------- doc/html/boost/algorithm/join_if_idp440829920.html | 105 +++++++++++++++++++ doc/html/boost/algorithm/join_if_idp441062688.html | 112 ++++++++++++++++++++ .../algorithm/knuth_morris__idp423381008.html | 92 ----------------- doc/html/boost/algorithm/knuth_morris_pratt.html | 89 ---------------- doc/html/boost/algorithm/last_finder.html | 2 +- .../boost/algorithm/lexicographical_compare.html | 2 +- doc/html/boost/algorithm/make_find_iterator.html | 2 +- doc/html/boost/algorithm/make_split_iterator.html | 2 +- .../boost/algorithm/mismatch_idp423102320.html | 104 ------------------- .../boost/algorithm/mismatch_idp423110624.html | 99 ------------------ doc/html/boost/algorithm/non_hex_input.html | 52 ---------- .../algorithm/none_of_equal_idp423012880.html | 102 ------------------- .../algorithm/none_of_equal_idp423019184.html | 98 ------------------ doc/html/boost/algorithm/none_of_idp423001280.html | 102 ------------------- doc/html/boost/algorithm/none_of_idp423007584.html | 98 ------------------ doc/html/boost/algorithm/not_enough_input.html | 52 ---------- doc/html/boost/algorithm/nth_finder.html | 2 +- .../boost/algorithm/one_of_equal_idp423037808.html | 93 ----------------- .../boost/algorithm/one_of_equal_idp423043600.html | 89 ---------------- doc/html/boost/algorithm/one_of_idp423027232.html | 93 ----------------- doc/html/boost/algorithm/one_of_idp423033024.html | 89 ---------------- .../boost/algorithm/operator___idp418728224.html | 91 ----------------- .../boost/algorithm/operator___idp440276176.html | 91 +++++++++++++++++ .../boost/algorithm/operator__idp418741600.html | 84 --------------- .../boost/algorithm/operator__idp440289552.html | 84 +++++++++++++++ .../boost/algorithm/operator_idp418734912.html | 91 ----------------- .../boost/algorithm/operator_idp440282864.html | 91 +++++++++++++++++ .../algorithm/partition_cop_idp423051136.html | 107 ------------------- .../algorithm/partition_cop_idp423060544.html | 93 ----------------- .../algorithm/partition_poi_idp423070720.html | 96 ----------------- .../algorithm/partition_poi_idp423077024.html | 82 --------------- doc/html/boost/algorithm/power_idp422669008.html | 90 ---------------- doc/html/boost/algorithm/power_idp422673792.html | 94 ----------------- doc/html/boost/algorithm/range_finder.html | 2 +- doc/html/boost/algorithm/regex_finder.html | 8 +- doc/html/boost/algorithm/regex_formatter.html | 2 +- doc/html/boost/algorithm/replace_all.html | 2 +- doc/html/boost/algorithm/replace_all_copy.html | 2 +- doc/html/boost/algorithm/replace_all_regex.html | 2 +- .../boost/algorithm/replace_all_regex_copy.html | 2 +- doc/html/boost/algorithm/replace_first.html | 2 +- doc/html/boost/algorithm/replace_first_copy.html | 2 +- doc/html/boost/algorithm/replace_head.html | 2 +- doc/html/boost/algorithm/replace_head_copy.html | 2 +- doc/html/boost/algorithm/replace_last.html | 2 +- doc/html/boost/algorithm/replace_last_copy.html | 2 +- doc/html/boost/algorithm/replace_nth.html | 2 +- doc/html/boost/algorithm/replace_nth_copy.html | 2 +- doc/html/boost/algorithm/replace_range.html | 2 +- doc/html/boost/algorithm/replace_range_copy.html | 2 +- doc/html/boost/algorithm/replace_regex.html | 2 +- doc/html/boost/algorithm/replace_regex_copy.html | 2 +- doc/html/boost/algorithm/replace_tail.html | 2 +- doc/html/boost/algorithm/replace_tail_copy.html | 2 +- doc/html/boost/algorithm/split_idp419821760.html | 113 --------------------- doc/html/boost/algorithm/split_idp441369712.html | 113 +++++++++++++++++++++ doc/html/boost/algorithm/split_iterator.html | 48 ++++----- doc/html/boost/algorithm/split_regex.html | 8 +- doc/html/boost/algorithm/starts_with.html | 8 +- doc/html/boost/algorithm/tail_finder.html | 2 +- doc/html/boost/algorithm/to_lower.html | 2 +- doc/html/boost/algorithm/to_lower_copy.html | 2 +- doc/html/boost/algorithm/to_upper.html | 2 +- doc/html/boost/algorithm/to_upper_copy.html | 2 +- .../boost/algorithm/token_compress_mode_type.html | 2 +- doc/html/boost/algorithm/token_finder.html | 2 +- doc/html/boost/algorithm/trim.html | 2 +- doc/html/boost/algorithm/trim_all.html | 2 +- doc/html/boost/algorithm/trim_all_copy.html | 2 +- doc/html/boost/algorithm/trim_all_copy_if.html | 2 +- doc/html/boost/algorithm/trim_all_if.html | 2 +- doc/html/boost/algorithm/trim_copy.html | 2 +- doc/html/boost/algorithm/trim_copy_if.html | 2 +- doc/html/boost/algorithm/trim_fill.html | 2 +- doc/html/boost/algorithm/trim_fill_copy.html | 2 +- doc/html/boost/algorithm/trim_fill_copy_if.html | 2 +- doc/html/boost/algorithm/trim_fill_if.html | 2 +- doc/html/boost/algorithm/trim_if.html | 2 +- doc/html/boost/algorithm/trim_left.html | 2 +- doc/html/boost/algorithm/trim_left_copy.html | 2 +- doc/html/boost/algorithm/trim_left_copy_if.html | 8 +- doc/html/boost/algorithm/trim_left_if.html | 2 +- doc/html/boost/algorithm/trim_right.html | 2 +- doc/html/boost/algorithm/trim_right_copy.html | 2 +- doc/html/boost/algorithm/trim_right_copy_if.html | 2 +- doc/html/boost/algorithm/trim_right_if.html | 2 +- doc/html/boost/algorithm/unhex_idp423172128.html | 103 ------------------- doc/html/boost/algorithm/unhex_idp423178688.html | 98 ------------------ doc/html/boost/algorithm/unhex_idp423184240.html | 98 ------------------ doc/html/boost/algorithm/unhex_idp423196976.html | 82 --------------- 259 files changed, 956 insertions(+), 9674 deletions(-) delete mode 100644 doc/html/boost/algorithm/all_of_equal_idp422738128.html delete mode 100644 doc/html/boost/algorithm/all_of_equal_idp422744432.html delete mode 100644 doc/html/boost/algorithm/all_of_idp422726016.html delete mode 100644 doc/html/boost/algorithm/all_of_idp422732832.html delete mode 100644 doc/html/boost/algorithm/any_of_equal_idp422763968.html delete mode 100644 doc/html/boost/algorithm/any_of_equal_idp422770272.html delete mode 100644 doc/html/boost/algorithm/any_of_idp422752368.html delete mode 100644 doc/html/boost/algorithm/any_of_idp422758672.html delete mode 100644 doc/html/boost/algorithm/boyer_moore.html delete mode 100644 doc/html/boost/algorithm/boyer_moore_h_idp423347248.html delete mode 100644 doc/html/boost/algorithm/boyer_moore_horspool.html delete mode 100644 doc/html/boost/algorithm/boyer_moore_s_idp423312736.html delete mode 100644 doc/html/boost/algorithm/clamp_idp422683472.html delete mode 100644 doc/html/boost/algorithm/clamp_idp422690464.html delete mode 100644 doc/html/boost/algorithm/clamp_range_idp422701072.html delete mode 100644 doc/html/boost/algorithm/clamp_range_idp422714480.html delete mode 100644 doc/html/boost/algorithm/copy_if_idp422778208.html delete mode 100644 doc/html/boost/algorithm/copy_if_idp422786384.html delete mode 100644 doc/html/boost/algorithm/copy_n.html delete mode 100644 doc/html/boost/algorithm/copy_until_idp422807392.html delete mode 100644 doc/html/boost/algorithm/copy_until_idp422815072.html delete mode 100644 doc/html/boost/algorithm/copy_while_idp422793040.html delete mode 100644 doc/html/boost/algorithm/copy_while_idp422800720.html delete mode 100644 doc/html/boost/algorithm/equal_idp423084448.html delete mode 100644 doc/html/boost/algorithm/equal_idp423092752.html delete mode 100644 doc/html/boost/algorithm/find_if_not_idp422834192.html delete mode 100644 doc/html/boost/algorithm/find_if_not_idp422840752.html delete mode 100644 doc/html/boost/algorithm/hex_decode_error.html delete mode 100644 doc/html/boost/algorithm/hex_idp423135952.html delete mode 100644 doc/html/boost/algorithm/hex_idp423149440.html delete mode 100644 doc/html/boost/algorithm/hex_idp423160656.html delete mode 100644 doc/html/boost/algorithm/hex_idp423189792.html delete mode 100644 doc/html/boost/algorithm/hex_lower_idp423142640.html delete mode 100644 doc/html/boost/algorithm/hex_lower_idp423154992.html delete mode 100644 doc/html/boost/algorithm/hex_lower_idp423166336.html delete mode 100644 doc/html/boost/algorithm/hex_lower_idp423193328.html delete mode 100644 doc/html/boost/algorithm/iota_idp422848432.html delete mode 100644 doc/html/boost/algorithm/iota_idp422854608.html delete mode 100644 doc/html/boost/algorithm/iota_n.html delete mode 100644 doc/html/boost/algorithm/is_decreasing_idp422971024.html delete mode 100644 doc/html/boost/algorithm/is_decreasing_idp422976112.html delete mode 100644 doc/html/boost/algorithm/is_digit_idp418685568.html create mode 100644 doc/html/boost/algorithm/is_digit_idp440233520.html delete mode 100644 doc/html/boost/algorithm/is_increasing_idp422961856.html delete mode 100644 doc/html/boost/algorithm/is_increasing_idp422966944.html delete mode 100644 doc/html/boost/algorithm/is_palindrome_idp423203264.html delete mode 100644 doc/html/boost/algorithm/is_palindrome_idp423209728.html delete mode 100644 doc/html/boost/algorithm/is_palindrome_idp423214688.html delete mode 100644 doc/html/boost/algorithm/is_palindrome_idp423218640.html delete mode 100644 doc/html/boost/algorithm/is_palindrome_idp423224096.html delete mode 100644 doc/html/boost/algorithm/is_palindrome_idp423227296.html delete mode 100644 doc/html/boost/algorithm/is_partitione_idp422867568.html delete mode 100644 doc/html/boost/algorithm/is_partitione_idp422873744.html delete mode 100644 doc/html/boost/algorithm/is_permutatio_idp422880272.html delete mode 100644 doc/html/boost/algorithm/is_permutatio_idp422888064.html delete mode 100644 doc/html/boost/algorithm/is_permutatio_idp422893968.html delete mode 100644 doc/html/boost/algorithm/is_permutatio_idp422898736.html delete mode 100644 doc/html/boost/algorithm/is_permutatio_idp422907008.html delete mode 100644 doc/html/boost/algorithm/is_permutatio_idp422914304.html delete mode 100644 doc/html/boost/algorithm/is_sorted_idp422935184.html delete mode 100644 doc/html/boost/algorithm/is_sorted_idp422940976.html delete mode 100644 doc/html/boost/algorithm/is_sorted_idp422953568.html delete mode 100644 doc/html/boost/algorithm/is_sorted_idp422958576.html delete mode 100644 doc/html/boost/algorithm/is_sorted_unt_idp422924976.html delete mode 100644 doc/html/boost/algorithm/is_sorted_unt_idp422930896.html delete mode 100644 doc/html/boost/algorithm/is_sorted_unt_idp422945264.html delete mode 100644 doc/html/boost/algorithm/is_sorted_unt_idp422950288.html delete mode 100644 doc/html/boost/algorithm/is_strictly_d_idp422989360.html delete mode 100644 doc/html/boost/algorithm/is_strictly_d_idp422994448.html delete mode 100644 doc/html/boost/algorithm/is_strictly_i_idp422980192.html delete mode 100644 doc/html/boost/algorithm/is_strictly_i_idp422985280.html delete mode 100644 doc/html/boost/algorithm/join_if_idp419281968.html delete mode 100644 doc/html/boost/algorithm/join_if_idp419514736.html create mode 100644 doc/html/boost/algorithm/join_if_idp440829920.html create mode 100644 doc/html/boost/algorithm/join_if_idp441062688.html delete mode 100644 doc/html/boost/algorithm/knuth_morris__idp423381008.html delete mode 100644 doc/html/boost/algorithm/knuth_morris_pratt.html delete mode 100644 doc/html/boost/algorithm/mismatch_idp423102320.html delete mode 100644 doc/html/boost/algorithm/mismatch_idp423110624.html delete mode 100644 doc/html/boost/algorithm/non_hex_input.html delete mode 100644 doc/html/boost/algorithm/none_of_equal_idp423012880.html delete mode 100644 doc/html/boost/algorithm/none_of_equal_idp423019184.html delete mode 100644 doc/html/boost/algorithm/none_of_idp423001280.html delete mode 100644 doc/html/boost/algorithm/none_of_idp423007584.html delete mode 100644 doc/html/boost/algorithm/not_enough_input.html delete mode 100644 doc/html/boost/algorithm/one_of_equal_idp423037808.html delete mode 100644 doc/html/boost/algorithm/one_of_equal_idp423043600.html delete mode 100644 doc/html/boost/algorithm/one_of_idp423027232.html delete mode 100644 doc/html/boost/algorithm/one_of_idp423033024.html delete mode 100644 doc/html/boost/algorithm/operator___idp418728224.html create mode 100644 doc/html/boost/algorithm/operator___idp440276176.html delete mode 100644 doc/html/boost/algorithm/operator__idp418741600.html create mode 100644 doc/html/boost/algorithm/operator__idp440289552.html delete mode 100644 doc/html/boost/algorithm/operator_idp418734912.html create mode 100644 doc/html/boost/algorithm/operator_idp440282864.html delete mode 100644 doc/html/boost/algorithm/partition_cop_idp423051136.html delete mode 100644 doc/html/boost/algorithm/partition_cop_idp423060544.html delete mode 100644 doc/html/boost/algorithm/partition_poi_idp423070720.html delete mode 100644 doc/html/boost/algorithm/partition_poi_idp423077024.html delete mode 100644 doc/html/boost/algorithm/power_idp422669008.html delete mode 100644 doc/html/boost/algorithm/power_idp422673792.html delete mode 100644 doc/html/boost/algorithm/split_idp419821760.html create mode 100644 doc/html/boost/algorithm/split_idp441369712.html delete mode 100644 doc/html/boost/algorithm/unhex_idp423172128.html delete mode 100644 doc/html/boost/algorithm/unhex_idp423178688.html delete mode 100644 doc/html/boost/algorithm/unhex_idp423184240.html delete mode 100644 doc/html/boost/algorithm/unhex_idp423196976.html (limited to 'doc/html/boost/algorithm') diff --git a/doc/html/boost/algorithm/FinderConcept.html b/doc/html/boost/algorithm/FinderConcept.html index 9dfd3b7ad0..a7911aa042 100644 --- a/doc/html/boost/algorithm/FinderConcept.html +++ b/doc/html/boost/algorithm/FinderConcept.html @@ -35,17 +35,17 @@ template<typename FinderT, typename IteratorT> struct FinderConcept { - // public member functions - void constraints(); + // public member functions + void constraints(); };
-

Description

+

Description

Defines the Finder concept. Finder is a functor which selects an arbitrary part of a string. Search is performed on the range specified by starting and ending iterators.

Result of the find operation must be convertible to iterator_range.

-

-FinderConcept public member functions

-
  1. void constraints();
+

+FinderConcept public member functions

+
  1. void constraints();
diff --git a/doc/html/boost/algorithm/FormatterConcept.html b/doc/html/boost/algorithm/FormatterConcept.html index cb66710c38..028e9d16a6 100644 --- a/doc/html/boost/algorithm/FormatterConcept.html +++ b/doc/html/boost/algorithm/FormatterConcept.html @@ -35,17 +35,17 @@ template<typename FormatterT, typename FinderT, typename IteratorT> struct FormatterConcept { - // public member functions - void constraints(); + // public member functions + void constraints(); };
-

Description

+

Description

Defines the Formatter concept. Formatter is a functor, which takes a result from a finder operation and transforms it in a specific way.

Result must be a container supported by container_traits, or a reference to it.

-

-FormatterConcept public member functions

-
  1. void constraints();
+

+FormatterConcept public member functions

+
  1. void constraints();
diff --git a/doc/html/boost/algorithm/all.html b/doc/html/boost/algorithm/all.html index 3504040751..dbac5bc5ed 100644 --- a/doc/html/boost/algorithm/all.html +++ b/doc/html/boost/algorithm/all.html @@ -36,7 +36,7 @@ template<typename RangeT, typename PredicateT> bool all(const RangeT & Input, PredicateT Pred);
-

Description

+

Description

This predicate holds it all its elements satisfy a given condition, represented by the predicate.

diff --git a/doc/html/boost/algorithm/all_of_equal_idp422738128.html b/doc/html/boost/algorithm/all_of_equal_idp422738128.html deleted file mode 100644 index 7d326368ab..0000000000 --- a/doc/html/boost/algorithm/all_of_equal_idp422738128.html +++ /dev/null @@ -1,102 +0,0 @@ - - - - -Function template all_of_equal - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-

-
-PrevUpHomeNext -
-
-
-
-

Function template all_of_equal

-

boost::algorithm::all_of_equal

-
-

Synopsis

-
// In header: <boost/algorithm/cxx11/all_of.hpp>
-
-
-template<typename InputIterator, typename T> 
-  bool all_of_equal(InputIterator first, InputIterator last, const T & val);
-
-

Description

-

-

-
- - - - - -
[Note]Note

returns true on an empty range

-

- -

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

Parameters:

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

first

The start of the input sequence

last

One past the end of the input sequence

val

A value to compare against

Returns:

true if all elements in [first, last) are equal to 'val'

-
-
- - - -
Copyright © 2010-2012 Marshall Clow

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

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/algorithm/all_of_equal_idp422744432.html b/doc/html/boost/algorithm/all_of_equal_idp422744432.html deleted file mode 100644 index 5830fab53b..0000000000 --- a/doc/html/boost/algorithm/all_of_equal_idp422744432.html +++ /dev/null @@ -1,98 +0,0 @@ - - - - -Function template all_of_equal - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Function template all_of_equal

-

boost::algorithm::all_of_equal

-
-

Synopsis

-
// In header: <boost/algorithm/cxx11/all_of.hpp>
-
-
-template<typename Range, typename T> 
-  bool all_of_equal(const Range & r, const T & val);
-
-

Description

-

-

-
- - - - - -
[Note]Note

returns true on an empty range

-

- -

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

Parameters:

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

r

The input range

val

A value to compare against

Returns:

true if all elements in the range are equal to 'val'

-
-
- - - -
Copyright © 2010-2012 Marshall Clow

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

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/algorithm/all_of_idp422726016.html b/doc/html/boost/algorithm/all_of_idp422726016.html deleted file mode 100644 index 4ac98a031c..0000000000 --- a/doc/html/boost/algorithm/all_of_idp422726016.html +++ /dev/null @@ -1,111 +0,0 @@ - - - - -Function template all_of - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Function template all_of

-

boost::algorithm::all_of

-
-

Synopsis

-
// In header: <boost/algorithm/cxx11/all_of.hpp>
-
-
-template<typename InputIterator, typename Predicate> 
-  bool all_of(InputIterator first, InputIterator last, Predicate p);
-
-

Description

-

-

-
- - - - - -
[Note]Note

returns true on an empty range

-

- -

-
- - - - - -
[Note]Note

This function is part of the C++2011 standard library.

-

-

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

Parameters:

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

first

The start of the input sequence

last

One past the end of the input sequence

p

A predicate for testing the elements of the sequence

Returns:

true if all elements in [first, last) satisfy the predicate 'p'

-
-
- - - -
Copyright © 2010-2012 Marshall Clow

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

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/algorithm/all_of_idp422732832.html b/doc/html/boost/algorithm/all_of_idp422732832.html deleted file mode 100644 index 959f1b190e..0000000000 --- a/doc/html/boost/algorithm/all_of_idp422732832.html +++ /dev/null @@ -1,98 +0,0 @@ - - - - -Function template all_of - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Function template all_of

-

boost::algorithm::all_of

-
-

Synopsis

-
// In header: <boost/algorithm/cxx11/all_of.hpp>
-
-
-template<typename Range, typename Predicate> 
-  bool all_of(const Range & r, Predicate p);
-
-

Description

-

-

-
- - - - - -
[Note]Note

returns true on an empty range

-

- -

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

Parameters:

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

p

A predicate for testing the elements of the range

r

The input range

Returns:

true if all elements in the range satisfy the predicate 'p'

-
-
- - - -
Copyright © 2010-2012 Marshall Clow

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

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/algorithm/any_of_equal_idp422763968.html b/doc/html/boost/algorithm/any_of_equal_idp422763968.html deleted file mode 100644 index 7c0d0803bd..0000000000 --- a/doc/html/boost/algorithm/any_of_equal_idp422763968.html +++ /dev/null @@ -1,102 +0,0 @@ - - - - -Function template any_of_equal - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Function template any_of_equal

-

boost::algorithm::any_of_equal

-
-

Synopsis

-
// In header: <boost/algorithm/cxx11/any_of.hpp>
-
-
-template<typename InputIterator, typename V> 
-  bool any_of_equal(InputIterator first, InputIterator last, const V & val);
-
-

Description

-

-

-
- - - - - -
[Note]Note

returns false on an empty range

-

- -

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

Parameters:

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

first

The start of the input sequence

last

One past the end of the input sequence

val

A value to compare against

Returns:

true if any of the elements in [first, last) are equal to 'val'

-
-
- - - -
Copyright © 2010-2012 Marshall Clow

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

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/algorithm/any_of_equal_idp422770272.html b/doc/html/boost/algorithm/any_of_equal_idp422770272.html deleted file mode 100644 index d1957acfd6..0000000000 --- a/doc/html/boost/algorithm/any_of_equal_idp422770272.html +++ /dev/null @@ -1,98 +0,0 @@ - - - - -Function template any_of_equal - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Function template any_of_equal

-

boost::algorithm::any_of_equal

-
-

Synopsis

-
// In header: <boost/algorithm/cxx11/any_of.hpp>
-
-
-template<typename Range, typename V> 
-  bool any_of_equal(const Range & r, const V & val);
-
-

Description

-

-

-
- - - - - -
[Note]Note

returns false on an empty range

-

- -

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

Parameters:

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

r

The input range

val

A value to compare against

Returns:

true if any of the elements in the range are equal to 'val'

-
-
- - - -
Copyright © 2010-2012 Marshall Clow

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

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/algorithm/any_of_idp422752368.html b/doc/html/boost/algorithm/any_of_idp422752368.html deleted file mode 100644 index 853e734dd9..0000000000 --- a/doc/html/boost/algorithm/any_of_idp422752368.html +++ /dev/null @@ -1,102 +0,0 @@ - - - - -Function template any_of - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Function template any_of

-

boost::algorithm::any_of

-
-

Synopsis

-
// In header: <boost/algorithm/cxx11/any_of.hpp>
-
-
-template<typename InputIterator, typename Predicate> 
-  bool any_of(InputIterator first, InputIterator last, Predicate p);
-
-

Description

-

-

-
- - - - - -
[Note]Note

returns false on an empty range

-

- -

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

Parameters:

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

first

The start of the input sequence

last

One past the end of the input sequence

p

A predicate for testing the elements of the sequence

Returns:

true if any of the elements in [first, last) satisfy the predicate

-
-
- - - -
Copyright © 2010-2012 Marshall Clow

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

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/algorithm/any_of_idp422758672.html b/doc/html/boost/algorithm/any_of_idp422758672.html deleted file mode 100644 index d26099f486..0000000000 --- a/doc/html/boost/algorithm/any_of_idp422758672.html +++ /dev/null @@ -1,98 +0,0 @@ - - - - -Function template any_of - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Function template any_of

-

boost::algorithm::any_of

-
-

Synopsis

-
// In header: <boost/algorithm/cxx11/any_of.hpp>
-
-
-template<typename Range, typename Predicate> 
-  bool any_of(const Range & r, Predicate p);
-
-

Description

-

-

-
- - - - - -
[Note]Note

returns false on an empty range

-

- -

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

Parameters:

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

p

A predicate for testing the elements of the range

r

The input range

Returns:

true if any elements in the range satisfy the predicate 'p'

-
-
- - - -
Copyright © 2010-2012 Marshall Clow

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

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/algorithm/boyer_moore.html b/doc/html/boost/algorithm/boyer_moore.html deleted file mode 100644 index eed4b7484c..0000000000 --- a/doc/html/boost/algorithm/boyer_moore.html +++ /dev/null @@ -1,89 +0,0 @@ - - - - -Class template boyer_moore - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Class template boyer_moore

-

boost::algorithm::boyer_moore

-
-

Synopsis

-
// In header: <boost/algorithm/searching/boyer_moore.hpp>
-
-template<typename patIter, typename traits = detail::BM_traits<patIter> > 
-class boyer_moore {
-public:
-  // construct/copy/destruct
-  boyer_moore(patIter, patIter);
-  ~boyer_moore();
-
-  // public member functions
-  template<typename corpusIter> 
-    std::pair< corpusIter, corpusIter > 
-    operator()(corpusIter, corpusIter) const;
-  template<typename Range> 
-    std::pair< typename boost::range_iterator< Range >::type, typename boost::range_iterator< Range >::type > 
-    operator()(Range &) const;
-};
-
-

Description

-
-

-boyer_moore - public - construct/copy/destruct

-
    -
  1. boyer_moore(patIter first, patIter last);
    2. -
  2. ~boyer_moore();
    3. -
-
-
-

-boyer_moore public member functions

-
    -
  1. template<typename corpusIter> 
-  std::pair< corpusIter, corpusIter > 
-  operator()(corpusIter corpus_first, corpusIter corpus_last) const;
    2. -
  2. template<typename Range> 
-  std::pair< typename boost::range_iterator< Range >::type, typename boost::range_iterator< Range >::type > 
-  operator()(Range & r) const;
    3. -
-
-
-
- - - -
Copyright © 2010-2012 Marshall Clow

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

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/algorithm/boyer_moore_h_idp423347248.html b/doc/html/boost/algorithm/boyer_moore_h_idp423347248.html deleted file mode 100644 index 3add0e8a02..0000000000 --- a/doc/html/boost/algorithm/boyer_moore_h_idp423347248.html +++ /dev/null @@ -1,92 +0,0 @@ - - - - -Function template boyer_moore_horspool_search - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Function template boyer_moore_horspool_search

-

boost::algorithm::boyer_moore_horspool_search — Searches the corpus for the pattern.

-
-

Synopsis

-
// In header: <boost/algorithm/searching/boyer_moore_horspool.hpp>
-
-
-template<typename patIter, typename corpusIter> 
-  std::pair< corpusIter, corpusIter > 
-  boyer_moore_horspool_search(corpusIter corpus_first, corpusIter corpus_last, 
-                              patIter pat_first, patIter pat_last);
-
-

Description

-

-

-
---- - - - - -

Parameters:

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

corpus_first

The start of the data to search (Random Access Iterator)

corpus_last

One past the end of the data to search

pat_first

The start of the pattern to search for (Random Access Iterator)

pat_last

One past the end of the data to search for

-
-
- - - -
Copyright © 2010-2012 Marshall Clow

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

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/algorithm/boyer_moore_horspool.html b/doc/html/boost/algorithm/boyer_moore_horspool.html deleted file mode 100644 index d23ec64ee2..0000000000 --- a/doc/html/boost/algorithm/boyer_moore_horspool.html +++ /dev/null @@ -1,89 +0,0 @@ - - - - -Class template boyer_moore_horspool - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Class template boyer_moore_horspool

-

boost::algorithm::boyer_moore_horspool

-
-

Synopsis

-
// In header: <boost/algorithm/searching/boyer_moore_horspool.hpp>
-
-template<typename patIter, typename traits = detail::BM_traits<patIter> > 
-class boyer_moore_horspool {
-public:
-  // construct/copy/destruct
-  boyer_moore_horspool(patIter, patIter);
-  ~boyer_moore_horspool();
-
-  // public member functions
-  template<typename corpusIter> 
-    std::pair< corpusIter, corpusIter > 
-    operator()(corpusIter, corpusIter) const;
-  template<typename Range> 
-    std::pair< typename boost::range_iterator< Range >::type, typename boost::range_iterator< Range >::type > 
-    operator()(Range &) const;
-};
-
-

Description

-
-

-boyer_moore_horspool - public - construct/copy/destruct

-
    -
  1. boyer_moore_horspool(patIter first, patIter last);
    2. -
  2. ~boyer_moore_horspool();
    3. -
-
-
-

-boyer_moore_horspool public member functions

-
    -
  1. template<typename corpusIter> 
-  std::pair< corpusIter, corpusIter > 
-  operator()(corpusIter corpus_first, corpusIter corpus_last) const;
    2. -
  2. template<typename Range> 
-  std::pair< typename boost::range_iterator< Range >::type, typename boost::range_iterator< Range >::type > 
-  operator()(Range & r) const;
    3. -
-
-
-
- - - -
Copyright © 2010-2012 Marshall Clow

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

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/algorithm/boyer_moore_s_idp423312736.html b/doc/html/boost/algorithm/boyer_moore_s_idp423312736.html deleted file mode 100644 index 28c463396c..0000000000 --- a/doc/html/boost/algorithm/boyer_moore_s_idp423312736.html +++ /dev/null @@ -1,92 +0,0 @@ - - - - -Function template boyer_moore_search - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Function template boyer_moore_search

-

boost::algorithm::boyer_moore_search — Searches the corpus for the pattern.

-
-

Synopsis

-
// In header: <boost/algorithm/searching/boyer_moore.hpp>
-
-
-template<typename patIter, typename corpusIter> 
-  std::pair< corpusIter, corpusIter > 
-  boyer_moore_search(corpusIter corpus_first, corpusIter corpus_last, 
-                     patIter pat_first, patIter pat_last);
-
-

Description

-

-

-
---- - - - - -

Parameters:

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

corpus_first

The start of the data to search (Random Access Iterator)

corpus_last

One past the end of the data to search

pat_first

The start of the pattern to search for (Random Access Iterator)

pat_last

One past the end of the data to search for

-
-
- - - -
Copyright © 2010-2012 Marshall Clow

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

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/algorithm/clamp_idp422683472.html b/doc/html/boost/algorithm/clamp_idp422683472.html deleted file mode 100644 index ed7499d33a..0000000000 --- a/doc/html/boost/algorithm/clamp_idp422683472.html +++ /dev/null @@ -1,100 +0,0 @@ - - - - -Function template clamp - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Function template clamp

-

boost::algorithm::clamp

-
-

Synopsis

-
// In header: <boost/algorithm/clamp.hpp>
-
-
-template<typename T, typename Pred> 
-  T const & clamp(T const & val, 
-                  typename boost::mpl::identity< T >::type const & lo, 
-                  typename boost::mpl::identity< T >::type const & hi, 
-                  Pred p);
-
-

Description

-

- -

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

Parameters:

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

hi

The upper bound of the range to be clamped to

lo

The lower bound of the range to be clamped to

p

A predicate to use to compare the values. p ( a, b ) returns a boolean.

val

The value to be clamped

Returns:

the value "val" brought into the range [ lo, hi ] using the comparison predicate p. If p ( val, lo ) return lo. If p ( hi, val ) return hi. Otherwise, return the original value.

-
-
- - - -
Copyright © 2010-2012 Marshall Clow

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

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/algorithm/clamp_idp422690464.html b/doc/html/boost/algorithm/clamp_idp422690464.html deleted file mode 100644 index 305f1905ff..0000000000 --- a/doc/html/boost/algorithm/clamp_idp422690464.html +++ /dev/null @@ -1,95 +0,0 @@ - - - - -Function template clamp - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Function template clamp

-

boost::algorithm::clamp

-
-

Synopsis

-
// In header: <boost/algorithm/clamp.hpp>
-
-
-template<typename T> 
-  T const & clamp(const T & val, 
-                  typename boost::mpl::identity< T >::type const & lo, 
-                  typename boost::mpl::identity< T >::type const & hi);
-
-

Description

-

- -

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

Parameters:

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

hi

The upper bound of the range to be clamped to

lo

The lower bound of the range to be clamped to

val

The value to be clamped

Returns:

the value "val" brought into the range [ lo, hi ]. If the value is less than lo, return lo. If the value is greater than "hi", return hi. Otherwise, return the original value.

-
-
- - - -
Copyright © 2010-2012 Marshall Clow

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

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/algorithm/clamp_range_idp422701072.html b/doc/html/boost/algorithm/clamp_range_idp422701072.html deleted file mode 100644 index 308dd4eb4d..0000000000 --- a/doc/html/boost/algorithm/clamp_range_idp422701072.html +++ /dev/null @@ -1,100 +0,0 @@ - - - - -Function template clamp_range - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Function template clamp_range

-

boost::algorithm::clamp_range

-
-

Synopsis

-
// In header: <boost/algorithm/clamp.hpp>
-
-
-template<typename Range, typename OutputIterator> 
-  boost::disable_if_c< boost::is_same< Range, OutputIterator >::value, OutputIterator >::type 
-  clamp_range(const Range & r, OutputIterator out, 
-              typename std::iterator_traits< typename boost::range_iterator< const Range >::type >::value_type const & lo, 
-              typename std::iterator_traits< typename boost::range_iterator< const Range >::type >::value_type const & hi);
-
-

Description

-

- -

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

Parameters:

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

hi

The upper bound of the range to be clamped to

lo

The lower bound of the range to be clamped to

out

An output iterator to write the clamped values into

r

The range of values to be clamped

Returns:

clamp the sequence of values [first, last) into [ lo, hi ]

-
-
- - - -
Copyright © 2010-2012 Marshall Clow

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

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/algorithm/clamp_range_idp422714480.html b/doc/html/boost/algorithm/clamp_range_idp422714480.html deleted file mode 100644 index 2ce3c64d9f..0000000000 --- a/doc/html/boost/algorithm/clamp_range_idp422714480.html +++ /dev/null @@ -1,105 +0,0 @@ - - - - -Function template clamp_range - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Function template clamp_range

-

boost::algorithm::clamp_range

-
-

Synopsis

-
// In header: <boost/algorithm/clamp.hpp>
-
-
-template<typename Range, typename OutputIterator, typename Pred> 
-  boost::disable_if_c< boost::is_same< Range, OutputIterator >::value, OutputIterator >::type 
-  clamp_range(const Range & r, OutputIterator out, 
-              typename std::iterator_traits< typename boost::range_iterator< const Range >::type >::value_type const & lo, 
-              typename std::iterator_traits< typename boost::range_iterator< const Range >::type >::value_type const & hi, 
-              Pred p);
-
-

Description

-

- -

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

Parameters:

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

hi

The upper bound of the range to be clamped to

lo

The lower bound of the range to be clamped to

out

An output iterator to write the clamped values into

p

A predicate to use to compare the values. p ( a, b ) returns a boolean.

r

The range of values to be clamped

Returns:

clamp the sequence of values [first, last) into [ lo, hi ] using the comparison predicate p.

-
-
- - - -
Copyright © 2010-2012 Marshall Clow

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

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/algorithm/const_formatter.html b/doc/html/boost/algorithm/const_formatter.html index aad82dcf8d..0af79cac60 100644 --- a/doc/html/boost/algorithm/const_formatter.html +++ b/doc/html/boost/algorithm/const_formatter.html @@ -35,7 +35,7 @@ template<typename RangeT> unspecified const_formatter(const RangeT & Format);
-

Description

+

Description

Constructs a const_formatter. Const formatter always returns the same value, regardless of the parameter.

diff --git a/doc/html/boost/algorithm/contains.html b/doc/html/boost/algorithm/contains.html index d6ba8c05fe..37b3f23b40 100644 --- a/doc/html/boost/algorithm/contains.html +++ b/doc/html/boost/algorithm/contains.html @@ -38,7 +38,7 @@ template<typename Range1T, typename Range2T> bool contains(const Range1T & Input, const Range2T & Test);

-

Description

+

Description

This predicate holds when the test container is contained in the Input. When the optional predicate is specified, it is used for character-wise comparison.

diff --git a/doc/html/boost/algorithm/copy_if_idp422778208.html b/doc/html/boost/algorithm/copy_if_idp422778208.html deleted file mode 100644 index 3e309518dd..0000000000 --- a/doc/html/boost/algorithm/copy_if_idp422778208.html +++ /dev/null @@ -1,108 +0,0 @@ - - - - -Function template copy_if - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-

-
-PrevUpHomeNext -
-
-
-
-

Function template copy_if

-

boost::algorithm::copy_if — Copies all the elements from the input range that satisfy the predicate to the output range.

-
-

Synopsis

-
// In header: <boost/algorithm/cxx11/copy_if.hpp>
-
-
-template<typename InputIterator, typename OutputIterator, typename Predicate> 
-  OutputIterator 
-  copy_if(InputIterator first, InputIterator last, OutputIterator result, 
-          Predicate p);
-
-

Description

-

- -

-
- - - - - -
[Note]Note

This function is part of the C++2011 standard library.

-

-

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

Parameters:

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

first

The start of the input sequence

last

One past the end of the input sequence

p

A predicate for testing the elements of the range

result

An output iterator to write the results into

Returns:

The updated output iterator

-
-
- - - -
Copyright © 2010-2012 Marshall Clow

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

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/algorithm/copy_if_idp422786384.html b/doc/html/boost/algorithm/copy_if_idp422786384.html deleted file mode 100644 index 57eb575a3d..0000000000 --- a/doc/html/boost/algorithm/copy_if_idp422786384.html +++ /dev/null @@ -1,93 +0,0 @@ - - - - -Function template copy_if - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Function template copy_if

-

boost::algorithm::copy_if — Copies all the elements from the input range that satisfy the predicate to the output range.

-
-

Synopsis

-
// In header: <boost/algorithm/cxx11/copy_if.hpp>
-
-
-template<typename Range, typename OutputIterator, typename Predicate> 
-  OutputIterator copy_if(const Range & r, OutputIterator result, Predicate p);
-
-

Description

-

- -

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

Parameters:

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

p

A predicate for testing the elements of the range

r

The input range

result

An output iterator to write the results into

Returns:

The updated output iterator

-
-
- - - -
Copyright © 2010-2012 Marshall Clow

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

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/algorithm/copy_n.html b/doc/html/boost/algorithm/copy_n.html deleted file mode 100644 index 4969bd5054..0000000000 --- a/doc/html/boost/algorithm/copy_n.html +++ /dev/null @@ -1,102 +0,0 @@ - - - - -Function template copy_n - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Function template copy_n

-

boost::algorithm::copy_n — Copies exactly n (n > 0) elements from the range starting at first to the range starting at result.

-
-

Synopsis

-
// In header: <boost/algorithm/cxx11/copy_n.hpp>
-
-
-template<typename InputIterator, typename Size, typename OutputIterator> 
-  OutputIterator copy_n(InputIterator first, Size n, OutputIterator result);
-
-

Description

-

- -

-
- - - - - -
[Note]Note

This function is part of the C++2011 standard library.

-

-

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

Parameters:

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

first

The start of the input sequence

n

The number of elements to copy

result

An output iterator to write the results into

Returns:

The updated output iterator

-
-
- - - -
Copyright © 2010-2012 Marshall Clow

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

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/algorithm/copy_until_idp422807392.html b/doc/html/boost/algorithm/copy_until_idp422807392.html deleted file mode 100644 index d4858997e8..0000000000 --- a/doc/html/boost/algorithm/copy_until_idp422807392.html +++ /dev/null @@ -1,99 +0,0 @@ - - - - -Function template copy_until - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Function template copy_until

-

boost::algorithm::copy_until — Copies all the elements at the start of the input range that do not satisfy the predicate to the output range.

-
-

Synopsis

-
// In header: <boost/algorithm/cxx11/copy_if.hpp>
-
-
-template<typename InputIterator, typename OutputIterator, typename Predicate> 
-  std::pair< InputIterator, OutputIterator > 
-  copy_until(InputIterator first, InputIterator last, OutputIterator result, 
-             Predicate p);
-
-

Description

-

- -

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

Parameters:

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

first

The start of the input sequence

last

One past the end of the input sequence

p

A predicate for testing the elements of the range

result

An output iterator to write the results into

Returns:

The updated output iterator

-
-
- - - -
Copyright © 2010-2012 Marshall Clow

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

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/algorithm/copy_until_idp422815072.html b/doc/html/boost/algorithm/copy_until_idp422815072.html deleted file mode 100644 index b2557faa20..0000000000 --- a/doc/html/boost/algorithm/copy_until_idp422815072.html +++ /dev/null @@ -1,94 +0,0 @@ - - - - -Function template copy_until - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Function template copy_until

-

boost::algorithm::copy_until — Copies all the elements at the start of the input range that do not satisfy the predicate to the output range.

-
-

Synopsis

-
// In header: <boost/algorithm/cxx11/copy_if.hpp>
-
-
-template<typename Range, typename OutputIterator, typename Predicate> 
-  std::pair< typename boost::range_iterator< const Range >::type, OutputIterator > 
-  copy_until(const Range & r, OutputIterator result, Predicate p);
-
-

Description

-

- -

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

Parameters:

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

p

A predicate for testing the elements of the range

r

The input range

result

An output iterator to write the results into

Returns:

The updated output iterator

-
-
- - - -
Copyright © 2010-2012 Marshall Clow

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

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/algorithm/copy_while_idp422793040.html b/doc/html/boost/algorithm/copy_while_idp422793040.html deleted file mode 100644 index 0efc698e1d..0000000000 --- a/doc/html/boost/algorithm/copy_while_idp422793040.html +++ /dev/null @@ -1,99 +0,0 @@ - - - - -Function template copy_while - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Function template copy_while

-

boost::algorithm::copy_while — Copies all the elements at the start of the input range that satisfy the predicate to the output range.

-
-

Synopsis

-
// In header: <boost/algorithm/cxx11/copy_if.hpp>
-
-
-template<typename InputIterator, typename OutputIterator, typename Predicate> 
-  std::pair< InputIterator, OutputIterator > 
-  copy_while(InputIterator first, InputIterator last, OutputIterator result, 
-             Predicate p);
-
-

Description

-

- -

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

Parameters:

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

first

The start of the input sequence

last

One past the end of the input sequence

p

A predicate for testing the elements of the range

result

An output iterator to write the results into

Returns:

The updated input and output iterators

-
-
- - - -
Copyright © 2010-2012 Marshall Clow

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

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/algorithm/copy_while_idp422800720.html b/doc/html/boost/algorithm/copy_while_idp422800720.html deleted file mode 100644 index 6fc7374549..0000000000 --- a/doc/html/boost/algorithm/copy_while_idp422800720.html +++ /dev/null @@ -1,94 +0,0 @@ - - - - -Function template copy_while - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Function template copy_while

-

boost::algorithm::copy_while — Copies all the elements at the start of the input range that satisfy the predicate to the output range.

-
-

Synopsis

-
// In header: <boost/algorithm/cxx11/copy_if.hpp>
-
-
-template<typename Range, typename OutputIterator, typename Predicate> 
-  std::pair< typename boost::range_iterator< const Range >::type, OutputIterator > 
-  copy_while(const Range & r, OutputIterator result, Predicate p);
-
-

Description

-

- -

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

Parameters:

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

p

A predicate for testing the elements of the range

r

The input range

result

An output iterator to write the results into

Returns:

The updated input and output iterators

-
-
- - - -
Copyright © 2010-2012 Marshall Clow

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

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/algorithm/dissect_formatter.html b/doc/html/boost/algorithm/dissect_formatter.html index ad3c4a3696..a9174139a6 100644 --- a/doc/html/boost/algorithm/dissect_formatter.html +++ b/doc/html/boost/algorithm/dissect_formatter.html @@ -36,7 +36,7 @@ template<typename FinderT> unspecified dissect_formatter(const FinderT & Finder);
-

Description

+

Description

Constructs a dissect_formatter. Dissect formatter uses a specified finder to extract a portion of the formatted sequence. The first finder's match is returned as a result

diff --git a/doc/html/boost/algorithm/empty_formatter.html b/doc/html/boost/algorithm/empty_formatter.html index 39f213c3a8..3059d5f483 100644 --- a/doc/html/boost/algorithm/empty_formatter.html +++ b/doc/html/boost/algorithm/empty_formatter.html @@ -35,7 +35,7 @@ template<typename RangeT> unspecified empty_formatter(const RangeT &);

-

Description

+

Description

Constructs an empty_formatter. Empty formatter always returns an empty sequence.

diff --git a/doc/html/boost/algorithm/ends_with.html b/doc/html/boost/algorithm/ends_with.html index e959d13dc8..8104c2e752 100644 --- a/doc/html/boost/algorithm/ends_with.html +++ b/doc/html/boost/algorithm/ends_with.html @@ -38,7 +38,7 @@ template<typename Range1T, typename Range2T> bool ends_with(const Range1T & Input, const Range2T & Test);

-

Description

+

Description

This predicate holds when the test string is a suffix of the Input. In other words, if the input ends with the test. When the optional predicate is specified, it is used for character-wise comparison.

diff --git a/doc/html/boost/algorithm/equal_idp423084448.html b/doc/html/boost/algorithm/equal_idp423084448.html deleted file mode 100644 index 09563193e4..0000000000 --- a/doc/html/boost/algorithm/equal_idp423084448.html +++ /dev/null @@ -1,104 +0,0 @@ - - - - -Function template equal - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-

-
-PrevUpHomeNext -
-
-
-
-

Function template equal

-

boost::algorithm::equal

-
-

Synopsis

-
// In header: <boost/algorithm/cxx14/equal.hpp>
-
-
-template<typename InputIterator1, typename InputIterator2, 
-         typename BinaryPredicate> 
-  bool equal(InputIterator1 first1, InputIterator1 last1, 
-             InputIterator2 first2, InputIterator2 last2, 
-             BinaryPredicate pred);
-
-

Description

-

- -

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

Parameters:

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

first1

The start of the first range.

first2

The start of the second range.

last1

One past the end of the first range.

last2

One past the end of the second range.

pred

A predicate for comparing the elements of the ranges

Returns:

true if all elements in the two ranges are equal

-
-
- - - -
Copyright © 2010-2012 Marshall Clow

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

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/algorithm/equal_idp423092752.html b/doc/html/boost/algorithm/equal_idp423092752.html deleted file mode 100644 index ea4252fba6..0000000000 --- a/doc/html/boost/algorithm/equal_idp423092752.html +++ /dev/null @@ -1,98 +0,0 @@ - - - - -Function template equal - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Function template equal

-

boost::algorithm::equal

-
-

Synopsis

-
// In header: <boost/algorithm/cxx14/equal.hpp>
-
-
-template<typename InputIterator1, typename InputIterator2> 
-  bool equal(InputIterator1 first1, InputIterator1 last1, 
-             InputIterator2 first2, InputIterator2 last2);
-
-

Description

-

- -

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

Parameters:

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

first1

The start of the first range.

first2

The start of the second range.

last1

One past the end of the first range.

last2

One past the end of the second range.

Returns:

true if all elements in the two ranges are equal

-
-
- - - -
Copyright © 2010-2012 Marshall Clow

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

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/algorithm/equals.html b/doc/html/boost/algorithm/equals.html index 05b7476680..d94a791a70 100644 --- a/doc/html/boost/algorithm/equals.html +++ b/doc/html/boost/algorithm/equals.html @@ -38,7 +38,7 @@ template<typename Range1T, typename Range2T> bool equals(const Range1T & Input, const Range2T & Test);
-

Description

+

Description

This predicate holds when the test container is equal to the input container i.e. all elements in both containers are same. When the optional predicate is specified, it is used for character-wise comparison.

diff --git a/doc/html/boost/algorithm/erase_all.html b/doc/html/boost/algorithm/erase_all.html index 6e658ef538..898f4a784b 100644 --- a/doc/html/boost/algorithm/erase_all.html +++ b/doc/html/boost/algorithm/erase_all.html @@ -36,7 +36,7 @@ template<typename SequenceT, typename RangeT> void erase_all(SequenceT & Input, const RangeT & Search);

-

Description

+

Description

Remove all the occurrences of the string from the input. The input sequence is modified in-place.

diff --git a/doc/html/boost/algorithm/erase_all_copy.html b/doc/html/boost/algorithm/erase_all_copy.html index 07110ebdb0..7bfb154c56 100644 --- a/doc/html/boost/algorithm/erase_all_copy.html +++ b/doc/html/boost/algorithm/erase_all_copy.html @@ -40,7 +40,7 @@ template<typename SequenceT, typename RangeT> SequenceT erase_all_copy(const SequenceT & Input, const RangeT & Search);
-

Description

+

Description

Remove all the occurrences of the string from the input. The result is a modified copy of the input. It is returned as a sequence or copied to the output iterator.

diff --git a/doc/html/boost/algorithm/erase_all_regex.html b/doc/html/boost/algorithm/erase_all_regex.html index 374d60f867..aa79884192 100644 --- a/doc/html/boost/algorithm/erase_all_regex.html +++ b/doc/html/boost/algorithm/erase_all_regex.html @@ -38,7 +38,7 @@ const basic_regex< CharT, RegexTraitsT > & Rx, match_flag_type Flags = match_default);

-

Description

+

Description

Erase all substrings, matching given regex, from the input. The input string is modified in-place.

diff --git a/doc/html/boost/algorithm/erase_all_regex_copy.html b/doc/html/boost/algorithm/erase_all_regex_copy.html index e3d3e7449e..3741ce57ee 100644 --- a/doc/html/boost/algorithm/erase_all_regex_copy.html +++ b/doc/html/boost/algorithm/erase_all_regex_copy.html @@ -44,7 +44,7 @@ const basic_regex< CharT, RegexTraitsT > & Rx, match_flag_type Flags = match_default);
-

Description

+

Description

Erase all substrings, matching given regex, from the input. The result is a modified copy of the input. It is returned as a sequence or copied to the output iterator.

diff --git a/doc/html/boost/algorithm/erase_first.html b/doc/html/boost/algorithm/erase_first.html index f2ad4121b1..5a62981e18 100644 --- a/doc/html/boost/algorithm/erase_first.html +++ b/doc/html/boost/algorithm/erase_first.html @@ -36,7 +36,7 @@ template<typename SequenceT, typename RangeT> void erase_first(SequenceT & Input, const RangeT & Search);

-

Description

+

Description

Remove the first occurrence of the substring from the input. The input sequence is modified in-place.

diff --git a/doc/html/boost/algorithm/erase_first_copy.html b/doc/html/boost/algorithm/erase_first_copy.html index ee712d24a0..2e9b4182a2 100644 --- a/doc/html/boost/algorithm/erase_first_copy.html +++ b/doc/html/boost/algorithm/erase_first_copy.html @@ -40,7 +40,7 @@ template<typename SequenceT, typename RangeT> SequenceT erase_first_copy(const SequenceT & Input, const RangeT & Search);
-

Description

+

Description

Remove the first occurrence of the substring from the input. The result is a modified copy of the input. It is returned as a sequence or copied to the output iterator.

diff --git a/doc/html/boost/algorithm/erase_head.html b/doc/html/boost/algorithm/erase_head.html index 2467864e39..d1a7b5f1b4 100644 --- a/doc/html/boost/algorithm/erase_head.html +++ b/doc/html/boost/algorithm/erase_head.html @@ -35,7 +35,7 @@ template<typename SequenceT> void erase_head(SequenceT & Input, int N);

-

Description

+

Description

Remove the head from the input. The head is a prefix of a sequence of given size. If the sequence is shorter then required, the whole string is considered to be the head. The input sequence is modified in-place.

diff --git a/doc/html/boost/algorithm/erase_head_copy.html b/doc/html/boost/algorithm/erase_head_copy.html index a842f05be5..4655e8e386 100644 --- a/doc/html/boost/algorithm/erase_head_copy.html +++ b/doc/html/boost/algorithm/erase_head_copy.html @@ -39,7 +39,7 @@ template<typename SequenceT> SequenceT erase_head_copy(const SequenceT & Input, int N);
-

Description

+

Description

Remove the head from the input. The head is a prefix of a sequence of given size. If the sequence is shorter then required, the whole string is considered to be the head. The result is a modified copy of the input. It is returned as a sequence or copied to the output iterator.

diff --git a/doc/html/boost/algorithm/erase_last.html b/doc/html/boost/algorithm/erase_last.html index 5dddfff465..d76b4194ae 100644 --- a/doc/html/boost/algorithm/erase_last.html +++ b/doc/html/boost/algorithm/erase_last.html @@ -36,7 +36,7 @@ template<typename SequenceT, typename RangeT> void erase_last(SequenceT & Input, const RangeT & Search);

-

Description

+

Description

Remove the last occurrence of the substring from the input. The input sequence is modified in-place.

diff --git a/doc/html/boost/algorithm/erase_last_copy.html b/doc/html/boost/algorithm/erase_last_copy.html index 436ffe5d65..e644b977f4 100644 --- a/doc/html/boost/algorithm/erase_last_copy.html +++ b/doc/html/boost/algorithm/erase_last_copy.html @@ -40,7 +40,7 @@ template<typename SequenceT, typename RangeT> SequenceT erase_last_copy(const SequenceT & Input, const RangeT & Search);
-

Description

+

Description

Remove the last occurrence of the substring from the input. The result is a modified copy of the input. It is returned as a sequence or copied to the output iterator.

diff --git a/doc/html/boost/algorithm/erase_nth.html b/doc/html/boost/algorithm/erase_nth.html index 67c4ce7b2d..f41eb7dd99 100644 --- a/doc/html/boost/algorithm/erase_nth.html +++ b/doc/html/boost/algorithm/erase_nth.html @@ -36,7 +36,7 @@ template<typename SequenceT, typename RangeT> void erase_nth(SequenceT & Input, const RangeT & Search, int Nth);

-

Description

+

Description

Remove the Nth occurrence of the substring in the input. The input sequence is modified in-place.

diff --git a/doc/html/boost/algorithm/erase_nth_copy.html b/doc/html/boost/algorithm/erase_nth_copy.html index 1578d25342..061d9992f1 100644 --- a/doc/html/boost/algorithm/erase_nth_copy.html +++ b/doc/html/boost/algorithm/erase_nth_copy.html @@ -41,7 +41,7 @@ SequenceT erase_nth_copy(const SequenceT & Input, const RangeT & Search, int Nth);
-

Description

+

Description

Remove the Nth occurrence of the substring in the input. The result is a modified copy of the input. It is returned as a sequence or copied to the output iterator.

diff --git a/doc/html/boost/algorithm/erase_range.html b/doc/html/boost/algorithm/erase_range.html index da282cc3bd..d0d4272d0b 100644 --- a/doc/html/boost/algorithm/erase_range.html +++ b/doc/html/boost/algorithm/erase_range.html @@ -37,7 +37,7 @@ void erase_range(SequenceT & Input, const iterator_range< typename range_iterator< SequenceT >::type > & SearchRange);

-

Description

+

Description

Remove the given range from the input. The input sequence is modified in-place.

diff --git a/doc/html/boost/algorithm/erase_range_copy.html b/doc/html/boost/algorithm/erase_range_copy.html index 7d3e41c4dc..e18f7379cd 100644 --- a/doc/html/boost/algorithm/erase_range_copy.html +++ b/doc/html/boost/algorithm/erase_range_copy.html @@ -41,7 +41,7 @@ SequenceT erase_range_copy(const SequenceT & Input, const iterator_range< typename range_const_iterator< SequenceT >::type > & SearchRange);
-

Description

+

Description

Remove the given range from the input. The result is a modified copy of the input. It is returned as a sequence or copied to the output iterator.

diff --git a/doc/html/boost/algorithm/erase_regex.html b/doc/html/boost/algorithm/erase_regex.html index 0abd3a37ec..0c27d62852 100644 --- a/doc/html/boost/algorithm/erase_regex.html +++ b/doc/html/boost/algorithm/erase_regex.html @@ -38,7 +38,7 @@ const basic_regex< CharT, RegexTraitsT > & Rx, match_flag_type Flags = match_default);

-

Description

+

Description

Remove a substring matching given regex from the input. The input string is modified in-place.

diff --git a/doc/html/boost/algorithm/erase_regex_copy.html b/doc/html/boost/algorithm/erase_regex_copy.html index cf86196702..fbaba03ca1 100644 --- a/doc/html/boost/algorithm/erase_regex_copy.html +++ b/doc/html/boost/algorithm/erase_regex_copy.html @@ -44,7 +44,7 @@ const basic_regex< CharT, RegexTraitsT > & Rx, match_flag_type Flags = match_default);
-

Description

+

Description

Remove a substring matching given regex from the input. The result is a modified copy of the input. It is returned as a sequence or copied to the output iterator.

diff --git a/doc/html/boost/algorithm/erase_tail.html b/doc/html/boost/algorithm/erase_tail.html index fd82de60dd..33c5926b32 100644 --- a/doc/html/boost/algorithm/erase_tail.html +++ b/doc/html/boost/algorithm/erase_tail.html @@ -35,7 +35,7 @@ template<typename SequenceT> void erase_tail(SequenceT & Input, int N);

-

Description

+

Description

Remove the tail from the input. The tail is a suffix of a sequence of given size. If the sequence is shorter then required, the whole string is considered to be the tail. The input sequence is modified in-place.

diff --git a/doc/html/boost/algorithm/erase_tail_copy.html b/doc/html/boost/algorithm/erase_tail_copy.html index 077c0f8098..36dbc56907 100644 --- a/doc/html/boost/algorithm/erase_tail_copy.html +++ b/doc/html/boost/algorithm/erase_tail_copy.html @@ -39,7 +39,7 @@ template<typename SequenceT> SequenceT erase_tail_copy(const SequenceT & Input, int N);
-

Description

+

Description

Remove the tail from the input. The tail is a suffix of a sequence of given size. If the sequence is shorter then required, the whole string is considered to be the tail. The result is a modified copy of the input. It is returned as a sequence or copied to the output iterator.

diff --git a/doc/html/boost/algorithm/find.html b/doc/html/boost/algorithm/find.html index 341dc2566c..8122f8dd2e 100644 --- a/doc/html/boost/algorithm/find.html +++ b/doc/html/boost/algorithm/find.html @@ -37,7 +37,7 @@ iterator_range< typename range_iterator< RangeT >::type > find(RangeT & Input, const FinderT & Finder);

-

Description

+

Description

Search the input using the given finder.

diff --git a/doc/html/boost/algorithm/find_all.html b/doc/html/boost/algorithm/find_all.html index c688f6982e..9dbbfc2743 100644 --- a/doc/html/boost/algorithm/find_all.html +++ b/doc/html/boost/algorithm/find_all.html @@ -38,7 +38,7 @@ find_all(SequenceSequenceT & Result, Range1T & Input, const Range2T & Search);

-

Description

+

Description

This algorithm finds all occurrences of the search string in the input.

Each part is copied and added as a new element to the output container. Thus the result container must be able to hold copies of the matches (in a compatible structure like std::string) or a reference to it (e.g. using the iterator range class). Examples of such a container are std::vector<std::string> or std::list<boost::iterator_range<std::string::iterator>>

diff --git a/doc/html/boost/algorithm/find_all_regex.html b/doc/html/boost/algorithm/find_all_regex.html index 95cb0d21c5..1673b9c834 100644 --- a/doc/html/boost/algorithm/find_all_regex.html +++ b/doc/html/boost/algorithm/find_all_regex.html @@ -40,7 +40,7 @@ const basic_regex< CharT, RegexTraitsT > & Rx, match_flag_type Flags = match_default);

-

Description

+

Description

This algorithm finds all substrings matching the give regex in the input.

Each part is copied and added as a new element to the output container. Thus the result container must be able to hold copies of the matches (in a compatible structure like std::string) or a reference to it (e.g. using the iterator range class). Examples of such a container are std::vector<std::string> or std::list<boost::iterator_range<std::string::iterator>>

diff --git a/doc/html/boost/algorithm/find_first.html b/doc/html/boost/algorithm/find_first.html index 21af3523cd..539623979c 100644 --- a/doc/html/boost/algorithm/find_first.html +++ b/doc/html/boost/algorithm/find_first.html @@ -37,7 +37,7 @@ iterator_range< typename range_iterator< Range1T >::type > find_first(Range1T & Input, const Range2T & Search);

-

Description

+

Description

Search for the first occurrence of the substring in the input.

diff --git a/doc/html/boost/algorithm/find_format.html b/doc/html/boost/algorithm/find_format.html index a1a93557de..b6f512059b 100644 --- a/doc/html/boost/algorithm/find_format.html +++ b/doc/html/boost/algorithm/find_format.html @@ -36,7 +36,7 @@ template<typename SequenceT, typename FinderT, typename FormatterT> void find_format(SequenceT & Input, FinderT Finder, FormatterT Formatter);

-

Description

+

Description

Use the Finder to search for a substring. Use the Formatter to format this substring and replace it in the input. The input is modified in-place.

diff --git a/doc/html/boost/algorithm/find_format_all.html b/doc/html/boost/algorithm/find_format_all.html index 2cd2b61706..e632c5a038 100644 --- a/doc/html/boost/algorithm/find_format_all.html +++ b/doc/html/boost/algorithm/find_format_all.html @@ -37,7 +37,7 @@ void find_format_all(SequenceT & Input, FinderT Finder, FormatterT Formatter);
-

Description

+

Description

Use the Finder to search for a substring. Use the Formatter to format this substring and replace it in the input. Repeat this for all matching substrings.The input is modified in-place.

diff --git a/doc/html/boost/algorithm/find_format_all_copy.html b/doc/html/boost/algorithm/find_format_all_copy.html index d2df52795f..746ddb9a73 100644 --- a/doc/html/boost/algorithm/find_format_all_copy.html +++ b/doc/html/boost/algorithm/find_format_all_copy.html @@ -42,7 +42,7 @@ SequenceT find_format_all_copy(const SequenceT & Input, FinderT Finder, FormatterT Formatter);
-

Description

+

Description

Use the Finder to search for a substring. Use the Formatter to format this substring and replace it in the input. Repeat this for all matching substrings. The result is a modified copy of the input. It is returned as a sequence or copied to the output iterator.

diff --git a/doc/html/boost/algorithm/find_format_copy.html b/doc/html/boost/algorithm/find_format_copy.html index 040e261af1..926c1fa9ad 100644 --- a/doc/html/boost/algorithm/find_format_copy.html +++ b/doc/html/boost/algorithm/find_format_copy.html @@ -42,7 +42,7 @@ SequenceT find_format_copy(const SequenceT & Input, FinderT Finder, FormatterT Formatter);

-

Description

+

Description

Use the Finder to search for a substring. Use the Formatter to format this substring and replace it in the input. The result is a modified copy of the input. It is returned as a sequence or copied to the output iterator.

diff --git a/doc/html/boost/algorithm/find_head.html b/doc/html/boost/algorithm/find_head.html index cb418f618f..a88db6c60a 100644 --- a/doc/html/boost/algorithm/find_head.html +++ b/doc/html/boost/algorithm/find_head.html @@ -37,7 +37,7 @@ iterator_range< typename range_iterator< RangeT >::type > find_head(RangeT & Input, int N);

-

Description

+

Description

Get the head of the input. Head is a prefix of the string of the given size. If the input is shorter then required, whole input is considered to be the head.

diff --git a/doc/html/boost/algorithm/find_if_not_idp422834192.html b/doc/html/boost/algorithm/find_if_not_idp422834192.html deleted file mode 100644 index cf81489550..0000000000 --- a/doc/html/boost/algorithm/find_if_not_idp422834192.html +++ /dev/null @@ -1,103 +0,0 @@ - - - - -Function template find_if_not - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-

-
-PrevUpHomeNext -
-
-
-
-

Function template find_if_not

-

boost::algorithm::find_if_not — Finds the first element in the sequence that does not satisfy the predicate.

-
-

Synopsis

-
// In header: <boost/algorithm/cxx11/find_if_not.hpp>
-
-
-template<typename InputIterator, typename Predicate> 
-  InputIterator 
-  find_if_not(InputIterator first, InputIterator last, Predicate p);
-
-

Description

-

- -

-
- - - - - -
[Note]Note

This function is part of the C++2011 standard library.

-

-

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

Parameters:

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

first

The start of the input sequence

last

One past the end of the input sequence

p

A predicate for testing the elements of the range

Returns:

The iterator pointing to the desired element.

-
-
- - - -
Copyright © 2010-2012 Marshall Clow

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

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/algorithm/find_if_not_idp422840752.html b/doc/html/boost/algorithm/find_if_not_idp422840752.html deleted file mode 100644 index 0e0b479d97..0000000000 --- a/doc/html/boost/algorithm/find_if_not_idp422840752.html +++ /dev/null @@ -1,90 +0,0 @@ - - - - -Function template find_if_not - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Function template find_if_not

-

boost::algorithm::find_if_not — Finds the first element in the sequence that does not satisfy the predicate.

-
-

Synopsis

-
// In header: <boost/algorithm/cxx11/find_if_not.hpp>
-
-
-template<typename Range, typename Predicate> 
-  boost::range_iterator< const Range >::type 
-  find_if_not(const Range & r, Predicate p);
-
-

Description

-

- -

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

Parameters:

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

p

A predicate for testing the elements of the range

r

The input range

Returns:

The iterator pointing to the desired element.

-
-
- - - -
Copyright © 2010-2012 Marshall Clow

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

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/algorithm/find_iterator.html b/doc/html/boost/algorithm/find_iterator.html index e1bdba1635..152e2e4519 100644 --- a/doc/html/boost/algorithm/find_iterator.html +++ b/doc/html/boost/algorithm/find_iterator.html @@ -37,32 +37,32 @@ { public: // construct/copy/destruct - find_iterator(); - find_iterator(const find_iterator &); - template<typename FinderT> find_iterator(IteratorT, IteratorT, FinderT); - template<typename FinderT, typename RangeT> find_iterator(RangeT &, FinderT); + find_iterator(); + find_iterator(const find_iterator &); + template<typename FinderT> find_iterator(IteratorT, IteratorT, FinderT); + template<typename FinderT, typename RangeT> find_iterator(RangeT &, FinderT); - // public member functions - bool eof() const; + // public member functions + bool eof() const; - // private member functions - const match_type & dereference() const; - void increment(); - bool equal(const find_iterator &) const; + // private member functions + const match_type & dereference() const; + void increment(); + bool equal(const find_iterator &) const; };
-

Description

+

Description

Find iterator encapsulates a Finder and allows for incremental searching in a string. Each increment moves the iterator to the next match.

Find iterator is a readable forward traversal iterator.

Dereferencing the iterator yields an iterator_range delimiting the current match.

-

+

find_iterator public construct/copy/destruct

  1. -
    find_iterator();
    Default constructor.

    Construct null iterator. All null iterators are equal.

    +
    find_iterator();
    Default constructor.

    Construct null iterator. All null iterators are equal.

    @@ -77,32 +77,32 @@
  2. -
    find_iterator(const find_iterator & Other);
    Copy constructor.

    Construct a copy of the find_iterator

    +
    find_iterator(const find_iterator & Other);
    Copy constructor.

    Construct a copy of the find_iterator 

  3. template<typename FinderT> 
-  find_iterator(IteratorT Begin, IteratorT End, FinderT Finder);
    Constructor.

    Construct new find_iterator for a given finder and a range.

    + find_iterator(IteratorT Begin, IteratorT End, FinderT Finder);Constructor.

    Construct new find_iterator for a given finder and a range. 

  4. template<typename FinderT, typename RangeT> 
-  find_iterator(RangeT & Col, FinderT Finder);
    Constructor.

    Construct new find_iterator for a given finder and a range.

    + find_iterator(RangeT & Col, FinderT Finder);Constructor.

    Construct new find_iterator for a given finder and a range.

-

-find_iterator public member functions

+

+find_iterator public member functions

  1. -
    bool eof() const;
    Eof check.

    Check the eof condition. Eof condition means that there is nothing more to be searched i.e. find_iterator is after the last match.

    +
    bool eof() const;
    Eof check.

    Check the eof condition. Eof condition means that there is nothing more to be searched i.e. find_iterator is after the last match.

-

-find_iterator private member functions

+

+find_iterator private member functions

    -
  1. const match_type & dereference() const;
    2. -
  2. void increment();
    3. -
  3. bool equal(const find_iterator & Other) const;
    4. +
  4. const match_type & dereference() const;
    5. +
  5. void increment();
    6. +
  6. bool equal(const find_iterator & Other) const;
diff --git a/doc/html/boost/algorithm/find_last.html b/doc/html/boost/algorithm/find_last.html index 1d6ca80686..4c88f0dc4c 100644 --- a/doc/html/boost/algorithm/find_last.html +++ b/doc/html/boost/algorithm/find_last.html @@ -37,7 +37,7 @@ iterator_range< typename range_iterator< Range1T >::type > find_last(Range1T & Input, const Range2T & Search);
-

Description

+

Description

Search for the last occurrence of the substring in the input.

diff --git a/doc/html/boost/algorithm/find_nth.html b/doc/html/boost/algorithm/find_nth.html index 5fd13eb534..c8cbd29212 100644 --- a/doc/html/boost/algorithm/find_nth.html +++ b/doc/html/boost/algorithm/find_nth.html @@ -37,7 +37,7 @@ iterator_range< typename range_iterator< Range1T >::type > find_nth(Range1T & Input, const Range2T & Search, int Nth);

-

Description

+

Description

Search for the n-th (zero-indexed) occurrence of the substring in the input.

diff --git a/doc/html/boost/algorithm/find_regex.html b/doc/html/boost/algorithm/find_regex.html index 0c9e047a9e..b3f6b05c67 100644 --- a/doc/html/boost/algorithm/find_regex.html +++ b/doc/html/boost/algorithm/find_regex.html @@ -38,7 +38,7 @@ find_regex(RangeT & Input, const basic_regex< CharT, RegexTraitsT > & Rx, match_flag_type Flags = match_default);

-

Description

+

Description

Search for a substring matching the given regex in the input.

diff --git a/doc/html/boost/algorithm/find_tail.html b/doc/html/boost/algorithm/find_tail.html index 07475fe5ce..48c5054db3 100644 --- a/doc/html/boost/algorithm/find_tail.html +++ b/doc/html/boost/algorithm/find_tail.html @@ -37,7 +37,7 @@ iterator_range< typename range_iterator< RangeT >::type > find_tail(RangeT & Input, int N);

-

Description

+

Description

Get the tail of the input. Tail is a suffix of the string of the given size. If the input is shorter then required, whole input is considered to be the tail.

diff --git a/doc/html/boost/algorithm/find_token.html b/doc/html/boost/algorithm/find_token.html index f7260bd8e1..fa5d1e4f5e 100644 --- a/doc/html/boost/algorithm/find_token.html +++ b/doc/html/boost/algorithm/find_token.html @@ -38,7 +38,7 @@ find_token(RangeT & Input, PredicateT Pred, token_compress_mode_type eCompress = token_compress_off);

-

Description

+

Description

Look for a given token in the string. Token is a character that matches the given predicate. If the "token compress mode" is enabled, adjacent tokens are considered to be one match.

diff --git a/doc/html/boost/algorithm/first_finder.html b/doc/html/boost/algorithm/first_finder.html index d54776c5c8..5e6a7998c3 100644 --- a/doc/html/boost/algorithm/first_finder.html +++ b/doc/html/boost/algorithm/first_finder.html @@ -37,7 +37,7 @@ template<typename RangeT, typename PredicateT> unspecified first_finder(const RangeT & Search, PredicateT Comp);

-

Description

+

Description

Construct the first_finder. The finder searches for the first occurrence of the string in a given input. The result is given as an iterator_range delimiting the match.

diff --git a/doc/html/boost/algorithm/has_const_time_erase.html b/doc/html/boost/algorithm/has_const_time_erase.html index 6faacb84d3..30bd951f99 100644 --- a/doc/html/boost/algorithm/has_const_time_erase.html +++ b/doc/html/boost/algorithm/has_const_time_erase.html @@ -42,7 +42,7 @@ static const bool value; };

-

Description

+

Description

This trait specifies that the sequence's erase method has constant time complexity.

diff --git a/doc/html/boost/algorithm/has_const_time_insert.html b/doc/html/boost/algorithm/has_const_time_insert.html index 91bd8429df..55ccb6aa8c 100644 --- a/doc/html/boost/algorithm/has_const_time_insert.html +++ b/doc/html/boost/algorithm/has_const_time_insert.html @@ -42,7 +42,7 @@ static const bool value; };
-

Description

+

Description

This trait specifies that the sequence's insert method has constant time complexity.

diff --git a/doc/html/boost/algorithm/has_native_replace.html b/doc/html/boost/algorithm/has_native_replace.html index d892bc91b3..78d4b59ba2 100644 --- a/doc/html/boost/algorithm/has_native_replace.html +++ b/doc/html/boost/algorithm/has_native_replace.html @@ -42,7 +42,7 @@ static const bool value; };
-

Description

+

Description

This trait specifies that the sequence has std::string like replace method

diff --git a/doc/html/boost/algorithm/has_stable_iterators.html b/doc/html/boost/algorithm/has_stable_iterators.html index 0f0139e0f3..4b284b37ff 100644 --- a/doc/html/boost/algorithm/has_stable_iterators.html +++ b/doc/html/boost/algorithm/has_stable_iterators.html @@ -42,7 +42,7 @@ static const bool value; };
-

Description

+

Description

This trait specifies that the sequence has stable iterators. It means that operations like insert/erase/replace do not invalidate iterators.

diff --git a/doc/html/boost/algorithm/head_finder.html b/doc/html/boost/algorithm/head_finder.html index 95aaadecf2..91bfa39910 100644 --- a/doc/html/boost/algorithm/head_finder.html +++ b/doc/html/boost/algorithm/head_finder.html @@ -35,7 +35,7 @@ unspecified head_finder(int N);
-

Description

+

Description

Construct the head_finder. The finder returns a head of a given input. The head is a prefix of a string up to n elements in size. If an input has less then n elements, whole input is considered a head. The result is given as an iterator_range delimiting the match.

diff --git a/doc/html/boost/algorithm/hex_decode_error.html b/doc/html/boost/algorithm/hex_decode_error.html deleted file mode 100644 index 213ed72f31..0000000000 --- a/doc/html/boost/algorithm/hex_decode_error.html +++ /dev/null @@ -1,52 +0,0 @@ - - - - -Struct hex_decode_error - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-

-
-PrevUpHomeNext -
-
-
-
-

Struct hex_decode_error

-

boost::algorithm::hex_decode_error — Base exception class for all hex decoding errors.

-
-

Synopsis

-
// In header: <boost/algorithm/hex.hpp>
-
-
-struct hex_decode_error : public exception, public exception {
-};
-
- - - -
Copyright © 2010-2012 Marshall Clow

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

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/algorithm/hex_idp423135952.html b/doc/html/boost/algorithm/hex_idp423135952.html deleted file mode 100644 index 083a9c1fc5..0000000000 --- a/doc/html/boost/algorithm/hex_idp423135952.html +++ /dev/null @@ -1,102 +0,0 @@ - - - - -Function template hex - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Function template hex

-

boost::algorithm::hex — Converts a sequence of integral types into a hexadecimal sequence of characters.

-
-

Synopsis

-
// In header: <boost/algorithm/hex.hpp>
-
-
-template<typename InputIterator, typename OutputIterator> 
-  unspecified hex(InputIterator first, InputIterator last, OutputIterator out);
-
-

Description

-

- -

-
- - - - - -
[Note]Note

Based on the MySQL function of the same name

-

-

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

Parameters:

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

first

The start of the input sequence

last

One past the end of the input sequence

out

An output iterator to the results into

Returns:

The updated output iterator

-
-
- - - -
Copyright © 2010-2012 Marshall Clow

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

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/algorithm/hex_idp423149440.html b/doc/html/boost/algorithm/hex_idp423149440.html deleted file mode 100644 index 6937c4d983..0000000000 --- a/doc/html/boost/algorithm/hex_idp423149440.html +++ /dev/null @@ -1,99 +0,0 @@ - - - - -Function template hex - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Function template hex

-

boost::algorithm::hex — Converts a sequence of integral types into a hexadecimal sequence of characters.

-
-

Synopsis

-
// In header: <boost/algorithm/hex.hpp>
-
-
-template<typename T, typename OutputIterator> 
-  boost::enable_if< boost::is_integral< T >, OutputIterator >::type 
-  hex(const T * ptr, OutputIterator out);
-
-

Description

-

- -

-
- - - - - -
[Note]Note

Based on the MySQL function of the same name

-

-

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

Parameters:

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

out

An output iterator to the results into

ptr

A pointer to a 0-terminated sequence of data.

Returns:

The updated output iterator

-
-
- - - -
Copyright © 2010-2012 Marshall Clow

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

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/algorithm/hex_idp423160656.html b/doc/html/boost/algorithm/hex_idp423160656.html deleted file mode 100644 index 5c2a9ef544..0000000000 --- a/doc/html/boost/algorithm/hex_idp423160656.html +++ /dev/null @@ -1,98 +0,0 @@ - - - - -Function template hex - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Function template hex

-

boost::algorithm::hex — Converts a sequence of integral types into a hexadecimal sequence of characters.

-
-

Synopsis

-
// In header: <boost/algorithm/hex.hpp>
-
-
-template<typename Range, typename OutputIterator> 
-  unspecified hex(const Range & r, OutputIterator out);
-
-

Description

-

- -

-
- - - - - -
[Note]Note

Based on the MySQL function of the same name

-

-

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

Parameters:

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

out

An output iterator to the results into

r

The input range

Returns:

The updated output iterator

-
-
- - - -
Copyright © 2010-2012 Marshall Clow

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

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/algorithm/hex_idp423189792.html b/doc/html/boost/algorithm/hex_idp423189792.html deleted file mode 100644 index 9a22d7180a..0000000000 --- a/doc/html/boost/algorithm/hex_idp423189792.html +++ /dev/null @@ -1,82 +0,0 @@ - - - - -Function template hex - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Function template hex

-

boost::algorithm::hex — Converts a sequence of integral types into a hexadecimal sequence of characters.

-
-

Synopsis

-
// In header: <boost/algorithm/hex.hpp>
-
-
-template<typename String> String hex(const String & input);
-
-

Description

-

- -

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

Parameters:

---- - - - - -

input

A container to be converted

Returns:

A container with the encoded text

-
-
- - - -
Copyright © 2010-2012 Marshall Clow

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

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/algorithm/hex_lower_idp423142640.html b/doc/html/boost/algorithm/hex_lower_idp423142640.html deleted file mode 100644 index e905725770..0000000000 --- a/doc/html/boost/algorithm/hex_lower_idp423142640.html +++ /dev/null @@ -1,103 +0,0 @@ - - - - -Function template hex_lower - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Function template hex_lower

-

boost::algorithm::hex_lower — Converts a sequence of integral types into a lower case hexadecimal sequence of characters.

-
-

Synopsis

-
// In header: <boost/algorithm/hex.hpp>
-
-
-template<typename InputIterator, typename OutputIterator> 
-  unspecified hex_lower(InputIterator first, InputIterator last, 
-                        OutputIterator out);
-
-

Description

-

- -

-
- - - - - -
[Note]Note

Based on the MySQL function of the same name

-

-

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

Parameters:

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

first

The start of the input sequence

last

One past the end of the input sequence

out

An output iterator to the results into

Returns:

The updated output iterator

-
-
- - - -
Copyright © 2010-2012 Marshall Clow

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

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/algorithm/hex_lower_idp423154992.html b/doc/html/boost/algorithm/hex_lower_idp423154992.html deleted file mode 100644 index cd8c6bf532..0000000000 --- a/doc/html/boost/algorithm/hex_lower_idp423154992.html +++ /dev/null @@ -1,99 +0,0 @@ - - - - -Function template hex_lower - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Function template hex_lower

-

boost::algorithm::hex_lower — Converts a sequence of integral types into a lower case hexadecimal sequence of characters.

-
-

Synopsis

-
// In header: <boost/algorithm/hex.hpp>
-
-
-template<typename T, typename OutputIterator> 
-  boost::enable_if< boost::is_integral< T >, OutputIterator >::type 
-  hex_lower(const T * ptr, OutputIterator out);
-
-

Description

-

- -

-
- - - - - -
[Note]Note

Based on the MySQL function of the same name

-

-

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

Parameters:

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

out

An output iterator to the results into

ptr

A pointer to a 0-terminated sequence of data.

Returns:

The updated output iterator

-
-
- - - -
Copyright © 2010-2012 Marshall Clow

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

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/algorithm/hex_lower_idp423166336.html b/doc/html/boost/algorithm/hex_lower_idp423166336.html deleted file mode 100644 index 3dbd8e1963..0000000000 --- a/doc/html/boost/algorithm/hex_lower_idp423166336.html +++ /dev/null @@ -1,98 +0,0 @@ - - - - -Function template hex_lower - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Function template hex_lower

-

boost::algorithm::hex_lower — Converts a sequence of integral types into a lower case hexadecimal sequence of characters.

-
-

Synopsis

-
// In header: <boost/algorithm/hex.hpp>
-
-
-template<typename Range, typename OutputIterator> 
-  unspecified hex_lower(const Range & r, OutputIterator out);
-
-

Description

-

- -

-
- - - - - -
[Note]Note

Based on the MySQL function of the same name

-

-

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

Parameters:

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

out

An output iterator to the results into

r

The input range

Returns:

The updated output iterator

-
-
- - - -
Copyright © 2010-2012 Marshall Clow

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

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/algorithm/hex_lower_idp423193328.html b/doc/html/boost/algorithm/hex_lower_idp423193328.html deleted file mode 100644 index cae02bbd02..0000000000 --- a/doc/html/boost/algorithm/hex_lower_idp423193328.html +++ /dev/null @@ -1,82 +0,0 @@ - - - - -Function template hex_lower - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Function template hex_lower

-

boost::algorithm::hex_lower — Converts a sequence of integral types into a lower case hexadecimal sequence of characters.

-
-

Synopsis

-
// In header: <boost/algorithm/hex.hpp>
-
-
-template<typename String> String hex_lower(const String & input);
-
-

Description

-

- -

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

Parameters:

---- - - - - -

input

A container to be converted

Returns:

A container with the encoded text

-
-
- - - -
Copyright © 2010-2012 Marshall Clow

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

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/algorithm/icontains.html b/doc/html/boost/algorithm/icontains.html index c93c8fb255..e10ee7ab09 100644 --- a/doc/html/boost/algorithm/icontains.html +++ b/doc/html/boost/algorithm/icontains.html @@ -37,7 +37,7 @@ bool icontains(const Range1T & Input, const Range2T & Test, const std::locale & Loc = std::locale());
-

Description

+

Description

This predicate holds when the test container is contained in the Input. Elements are compared case insensitively.

diff --git a/doc/html/boost/algorithm/identity_formatter.html b/doc/html/boost/algorithm/identity_formatter.html index b7b3092cf6..b58549592d 100644 --- a/doc/html/boost/algorithm/identity_formatter.html +++ b/doc/html/boost/algorithm/identity_formatter.html @@ -35,7 +35,7 @@ template<typename RangeT> unspecified identity_formatter();

-

Description

+

Description

Constructs an identity_formatter. Identity formatter always returns the parameter.

diff --git a/doc/html/boost/algorithm/iends_with.html b/doc/html/boost/algorithm/iends_with.html index 7fcdbf125d..ab0d8cd29b 100644 --- a/doc/html/boost/algorithm/iends_with.html +++ b/doc/html/boost/algorithm/iends_with.html @@ -37,7 +37,7 @@ bool iends_with(const Range1T & Input, const Range2T & Test, const std::locale & Loc = std::locale());
-

Description

+

Description

This predicate holds when the test container is a suffix of the Input. In other words, if the input ends with the test. Elements are compared case insensitively.

diff --git a/doc/html/boost/algorithm/iequals.html b/doc/html/boost/algorithm/iequals.html index 88261fe09d..192c62b8e4 100644 --- a/doc/html/boost/algorithm/iequals.html +++ b/doc/html/boost/algorithm/iequals.html @@ -37,7 +37,7 @@ bool iequals(const Range1T & Input, const Range2T & Test, const std::locale & Loc = std::locale());

-

Description

+

Description

This predicate holds when the test container is equal to the input container i.e. all elements in both containers are same. Elements are compared case insensitively.

diff --git a/doc/html/boost/algorithm/ierase_all.html b/doc/html/boost/algorithm/ierase_all.html index 51ef3e9db0..3433096569 100644 --- a/doc/html/boost/algorithm/ierase_all.html +++ b/doc/html/boost/algorithm/ierase_all.html @@ -37,7 +37,7 @@ void ierase_all(SequenceT & Input, const RangeT & Search, const std::locale & Loc = std::locale());

-

Description

+

Description

Remove all the occurrences of the string from the input. The input sequence is modified in-place. Searching is case insensitive.

diff --git a/doc/html/boost/algorithm/ierase_all_copy.html b/doc/html/boost/algorithm/ierase_all_copy.html index 0c1506a9f0..7224fd3c3c 100644 --- a/doc/html/boost/algorithm/ierase_all_copy.html +++ b/doc/html/boost/algorithm/ierase_all_copy.html @@ -42,7 +42,7 @@ SequenceT ierase_all_copy(const SequenceT & Input, const RangeT & Search, const std::locale & Loc = std::locale());
-

Description

+

Description

Remove all the occurrences of the string from the input. The result is a modified copy of the input. It is returned as a sequence or copied to the output iterator. Searching is case insensitive.

diff --git a/doc/html/boost/algorithm/ierase_first.html b/doc/html/boost/algorithm/ierase_first.html index 6d20c78ac6..585585444c 100644 --- a/doc/html/boost/algorithm/ierase_first.html +++ b/doc/html/boost/algorithm/ierase_first.html @@ -37,7 +37,7 @@ void ierase_first(SequenceT & Input, const RangeT & Search, const std::locale & Loc = std::locale());

-

Description

+

Description

Remove the first occurrence of the substring from the input. The input sequence is modified in-place. Searching is case insensitive.

diff --git a/doc/html/boost/algorithm/ierase_first_copy.html b/doc/html/boost/algorithm/ierase_first_copy.html index fc452ad8b4..0ee0630fb7 100644 --- a/doc/html/boost/algorithm/ierase_first_copy.html +++ b/doc/html/boost/algorithm/ierase_first_copy.html @@ -42,7 +42,7 @@ SequenceT ierase_first_copy(const SequenceT & Input, const RangeT & Search, const std::locale & Loc = std::locale());
-

Description

+

Description

Remove the first occurrence of the substring from the input. The result is a modified copy of the input. It is returned as a sequence or copied to the output iterator. Searching is case insensitive.

diff --git a/doc/html/boost/algorithm/ierase_last.html b/doc/html/boost/algorithm/ierase_last.html index 5832985890..772ff55c79 100644 --- a/doc/html/boost/algorithm/ierase_last.html +++ b/doc/html/boost/algorithm/ierase_last.html @@ -37,7 +37,7 @@ void ierase_last(SequenceT & Input, const RangeT & Search, const std::locale & Loc = std::locale());

-

Description

+

Description

Remove the last occurrence of the substring from the input. The input sequence is modified in-place. Searching is case insensitive.

diff --git a/doc/html/boost/algorithm/ierase_last_copy.html b/doc/html/boost/algorithm/ierase_last_copy.html index 2523c8390d..8da210d4da 100644 --- a/doc/html/boost/algorithm/ierase_last_copy.html +++ b/doc/html/boost/algorithm/ierase_last_copy.html @@ -42,7 +42,7 @@ SequenceT ierase_last_copy(const SequenceT & Input, const RangeT & Search, const std::locale & Loc = std::locale());
-

Description

+

Description

Remove the last occurrence of the substring from the input. The result is a modified copy of the input. It is returned as a sequence or copied to the output iterator. Searching is case insensitive.

diff --git a/doc/html/boost/algorithm/ierase_nth.html b/doc/html/boost/algorithm/ierase_nth.html index 0608fb4f46..c1c677a730 100644 --- a/doc/html/boost/algorithm/ierase_nth.html +++ b/doc/html/boost/algorithm/ierase_nth.html @@ -37,7 +37,7 @@ void ierase_nth(SequenceT & Input, const RangeT & Search, int Nth, const std::locale & Loc = std::locale());

-

Description

+

Description

Remove the Nth occurrence of the substring in the input. The input sequence is modified in-place. Searching is case insensitive.

diff --git a/doc/html/boost/algorithm/ierase_nth_copy.html b/doc/html/boost/algorithm/ierase_nth_copy.html index 52299ccafa..d70750d724 100644 --- a/doc/html/boost/algorithm/ierase_nth_copy.html +++ b/doc/html/boost/algorithm/ierase_nth_copy.html @@ -42,7 +42,7 @@ SequenceT ierase_nth_copy(const SequenceT & Input, const RangeT & Search, int Nth, const std::locale & Loc = std::locale());
-

Description

+

Description

Remove the Nth occurrence of the substring in the input. The result is a modified copy of the input. It is returned as a sequence or copied to the output iterator. Searching is case insensitive.

diff --git a/doc/html/boost/algorithm/ifind_all.html b/doc/html/boost/algorithm/ifind_all.html index 42ebb0e3c8..486d92beea 100644 --- a/doc/html/boost/algorithm/ifind_all.html +++ b/doc/html/boost/algorithm/ifind_all.html @@ -8,7 +8,7 @@ - + @@ -21,7 +21,7 @@

-PrevUpHomeNext +PrevUpHomeNext
@@ -38,7 +38,7 @@ ifind_all(SequenceSequenceT & Result, Range1T & Input, const Range2T & Search, const std::locale & Loc = std::locale());
-

Description

+

Description

This algorithm finds all occurrences of the search string in the input. Each part is copied and added as a new element to the output container. Thus the result container must be able to hold copies of the matches (in a compatible structure like std::string) or a reference to it (e.g. using the iterator range class). Examples of such a container are std::vector<std::string> or std::list<boost::iterator_range<std::string::iterator>>

Searching is case insensitive.

@@ -107,7 +107,7 @@

-PrevUpHomeNext +PrevUpHomeNext
diff --git a/doc/html/boost/algorithm/ifind_first.html b/doc/html/boost/algorithm/ifind_first.html index 8850675dee..387811ae46 100644 --- a/doc/html/boost/algorithm/ifind_first.html +++ b/doc/html/boost/algorithm/ifind_first.html @@ -38,7 +38,7 @@ ifind_first(Range1T & Input, const Range2T & Search, const std::locale & Loc = std::locale());
-

Description

+

Description

Search for the first occurrence of the substring in the input. Searching is case insensitive.

diff --git a/doc/html/boost/algorithm/ifind_last.html b/doc/html/boost/algorithm/ifind_last.html index 79a05df603..0abae8d97e 100644 --- a/doc/html/boost/algorithm/ifind_last.html +++ b/doc/html/boost/algorithm/ifind_last.html @@ -38,7 +38,7 @@ ifind_last(Range1T & Input, const Range2T & Search, const std::locale & Loc = std::locale());

-

Description

+

Description

Search for the last match a string in the input. Searching is case insensitive.

diff --git a/doc/html/boost/algorithm/ifind_nth.html b/doc/html/boost/algorithm/ifind_nth.html index 5bba93018b..a7ef18c8c8 100644 --- a/doc/html/boost/algorithm/ifind_nth.html +++ b/doc/html/boost/algorithm/ifind_nth.html @@ -38,7 +38,7 @@ ifind_nth(Range1T & Input, const Range2T & Search, int Nth, const std::locale & Loc = std::locale());

-

Description

+

Description

Search for the n-th (zero-indexed) occurrence of the substring in the input. Searching is case insensitive.

diff --git a/doc/html/boost/algorithm/ilexicographical_compare.html b/doc/html/boost/algorithm/ilexicographical_compare.html index dc2d7d5b61..f7fa3d1c1c 100644 --- a/doc/html/boost/algorithm/ilexicographical_compare.html +++ b/doc/html/boost/algorithm/ilexicographical_compare.html @@ -37,7 +37,7 @@ bool ilexicographical_compare(const Range1T & Arg1, const Range2T & Arg2, const std::locale & Loc = std::locale());

-

Description

+

Description

This predicate is an overload of std::lexicographical_compare for range arguments. It check whether the first argument is lexicographically less then the second one. Elements are compared case insensitively

diff --git a/doc/html/boost/algorithm/iota_idp422848432.html b/doc/html/boost/algorithm/iota_idp422848432.html deleted file mode 100644 index 0d625ead85..0000000000 --- a/doc/html/boost/algorithm/iota_idp422848432.html +++ /dev/null @@ -1,95 +0,0 @@ - - - - -Function template iota - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-

-
-PrevUpHomeNext -
-
-
-
-

Function template iota

-

boost::algorithm::iota — Generates an increasing sequence of values, and stores them in [first, last)

-
-

Synopsis

-
// In header: <boost/algorithm/cxx11/iota.hpp>
-
-
-template<typename ForwardIterator, typename T> 
-  void iota(ForwardIterator first, ForwardIterator last, T value);
-
-

Description

-

-

-
- - - - - -
[Note]Note

This function is part of the C++2011 standard library.

-

-

-
---- - - - - -

Parameters:

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

first

The start of the input sequence

last

One past the end of the input sequence

value

The initial value of the sequence to be generated

-
-
- - - -
Copyright © 2010-2012 Marshall Clow

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

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/algorithm/iota_idp422854608.html b/doc/html/boost/algorithm/iota_idp422854608.html deleted file mode 100644 index 015b05a8fe..0000000000 --- a/doc/html/boost/algorithm/iota_idp422854608.html +++ /dev/null @@ -1,81 +0,0 @@ - - - - -Function template iota - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Function template iota

-

boost::algorithm::iota — Generates an increasing sequence of values, and stores them in the input Range.

-
-

Synopsis

-
// In header: <boost/algorithm/cxx11/iota.hpp>
-
-
-template<typename Range, typename T> void iota(Range & r, T value);
-
-

Description

-

-

-
---- - - - - -

Parameters:

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

r

The input range

value

The initial value of the sequence to be generated

-
-
- - - -
Copyright © 2010-2012 Marshall Clow

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

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/algorithm/iota_n.html b/doc/html/boost/algorithm/iota_n.html deleted file mode 100644 index 0f0487836a..0000000000 --- a/doc/html/boost/algorithm/iota_n.html +++ /dev/null @@ -1,86 +0,0 @@ - - - - -Function template iota_n - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Function template iota_n

-

boost::algorithm::iota_n — Generates an increasing sequence of values, and stores them in the input Range.

-
-

Synopsis

-
// In header: <boost/algorithm/cxx11/iota.hpp>
-
-
-template<typename OutputIterator, typename T> 
-  OutputIterator iota_n(OutputIterator out, T value, std::size_t n);
-
-

Description

-

-

-
---- - - - - -

Parameters:

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

n

The number of items to write

out

An output iterator to write the results into

value

The initial value of the sequence to be generated

-
-
- - - -
Copyright © 2010-2012 Marshall Clow

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

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/algorithm/ireplace_all.html b/doc/html/boost/algorithm/ireplace_all.html index 49875d0b69..863fc85671 100644 --- a/doc/html/boost/algorithm/ireplace_all.html +++ b/doc/html/boost/algorithm/ireplace_all.html @@ -38,7 +38,7 @@ const Range2T & Format, const std::locale & Loc = std::locale());
-

Description

+

Description

Replace all occurrences of the search string in the input with the format string.The input sequence is modified in-place. Searching is case insensitive.

diff --git a/doc/html/boost/algorithm/ireplace_all_copy.html b/doc/html/boost/algorithm/ireplace_all_copy.html index b278b455cc..0847fb20d2 100644 --- a/doc/html/boost/algorithm/ireplace_all_copy.html +++ b/doc/html/boost/algorithm/ireplace_all_copy.html @@ -44,7 +44,7 @@ const Range2T & Format, const std::locale & Loc = std::locale());
-

Description

+

Description

Replace all occurrences of the search string in the input with the format string. The result is a modified copy of the input. It is returned as a sequence or copied to the output iterator. Searching is case insensitive.

diff --git a/doc/html/boost/algorithm/ireplace_first.html b/doc/html/boost/algorithm/ireplace_first.html index eb7a20c46f..9b309a5025 100644 --- a/doc/html/boost/algorithm/ireplace_first.html +++ b/doc/html/boost/algorithm/ireplace_first.html @@ -38,7 +38,7 @@ const Range2T & Format, const std::locale & Loc = std::locale());

-

Description

+

Description

Replace the first match of the search substring in the input with the format string. Input sequence is modified in-place. Searching is case insensitive.

diff --git a/doc/html/boost/algorithm/ireplace_first_copy.html b/doc/html/boost/algorithm/ireplace_first_copy.html index 109a26bf2d..e8b0a25252 100644 --- a/doc/html/boost/algorithm/ireplace_first_copy.html +++ b/doc/html/boost/algorithm/ireplace_first_copy.html @@ -45,7 +45,7 @@ const Range1T & Format, const std::locale & Loc = std::locale());
-

Description

+

Description

Replace the first match of the search substring in the input with the format string. The result is a modified copy of the input. It is returned as a sequence or copied to the output iterator. Searching is case insensitive.

diff --git a/doc/html/boost/algorithm/ireplace_last.html b/doc/html/boost/algorithm/ireplace_last.html index b093599da9..6eae4b9ba2 100644 --- a/doc/html/boost/algorithm/ireplace_last.html +++ b/doc/html/boost/algorithm/ireplace_last.html @@ -38,7 +38,7 @@ const Range2T & Format, const std::locale & Loc = std::locale());

-

Description

+

Description

Replace the last match of the search string in the input with the format string.The input sequence is modified in-place. Searching is case insensitive.

diff --git a/doc/html/boost/algorithm/ireplace_last_copy.html b/doc/html/boost/algorithm/ireplace_last_copy.html index 547887a2e8..603f633a8a 100644 --- a/doc/html/boost/algorithm/ireplace_last_copy.html +++ b/doc/html/boost/algorithm/ireplace_last_copy.html @@ -45,7 +45,7 @@ const Range2T & Format, const std::locale & Loc = std::locale());
-

Description

+

Description

Replace the last match of the search string in the input with the format string. The result is a modified copy of the input. It is returned as a sequence or copied to the output iterator. Searching is case insensitive.

diff --git a/doc/html/boost/algorithm/ireplace_nth.html b/doc/html/boost/algorithm/ireplace_nth.html index 12630b79e7..e5a86851c5 100644 --- a/doc/html/boost/algorithm/ireplace_nth.html +++ b/doc/html/boost/algorithm/ireplace_nth.html @@ -38,7 +38,7 @@ const Range2T & Format, const std::locale & Loc = std::locale());

-

Description

+

Description

Replace an Nth (zero-indexed) match of the search string in the input with the format string. Input sequence is modified in-place. Searching is case insensitive.

diff --git a/doc/html/boost/algorithm/ireplace_nth_copy.html b/doc/html/boost/algorithm/ireplace_nth_copy.html index ad3430fcb9..8e692ddf9c 100644 --- a/doc/html/boost/algorithm/ireplace_nth_copy.html +++ b/doc/html/boost/algorithm/ireplace_nth_copy.html @@ -44,7 +44,7 @@ int Nth, const Range2T & Format, const std::locale & Loc = std::locale());
-

Description

+

Description

Replace an Nth (zero-indexed) match of the search string in the input with the format string. The result is a modified copy of the input. It is returned as a sequence or copied to the output iterator. Searching is case insensitive.

diff --git a/doc/html/boost/algorithm/is_alnum.html b/doc/html/boost/algorithm/is_alnum.html index fa970b1665..94963cd403 100644 --- a/doc/html/boost/algorithm/is_alnum.html +++ b/doc/html/boost/algorithm/is_alnum.html @@ -35,7 +35,7 @@ unspecified is_alnum(const std::locale & Loc = std::locale());

-

Description

+

Description

Construct the is_classified predicate for the ctype_base::alnum category.

diff --git a/doc/html/boost/algorithm/is_alpha.html b/doc/html/boost/algorithm/is_alpha.html index 4e2cfb2bf2..9b798718d6 100644 --- a/doc/html/boost/algorithm/is_alpha.html +++ b/doc/html/boost/algorithm/is_alpha.html @@ -35,7 +35,7 @@ unspecified is_alpha(const std::locale & Loc = std::locale());

-

Description

+

Description

Construct the is_classified predicate for the ctype_base::alpha category.

diff --git a/doc/html/boost/algorithm/is_any_of.html b/doc/html/boost/algorithm/is_any_of.html index 01c7c5bf82..aa22d86a73 100644 --- a/doc/html/boost/algorithm/is_any_of.html +++ b/doc/html/boost/algorithm/is_any_of.html @@ -35,7 +35,7 @@ template<typename RangeT> unspecified is_any_of(const RangeT & Set);

-

Description

+

Description

Construct the is_any_of predicate. The predicate holds if the input is included in the specified set of characters.

diff --git a/doc/html/boost/algorithm/is_classified.html b/doc/html/boost/algorithm/is_classified.html index 39d5db974b..de9007ee1e 100644 --- a/doc/html/boost/algorithm/is_classified.html +++ b/doc/html/boost/algorithm/is_classified.html @@ -36,7 +36,7 @@ unspecified is_classified(std::ctype_base::mask Type, const std::locale & Loc = std::locale());

-

Description

+

Description

Construct the is_classified predicate. This predicate holds if the input is of specified std::ctype category.

diff --git a/doc/html/boost/algorithm/is_cntrl.html b/doc/html/boost/algorithm/is_cntrl.html index 9ff1c0973f..9fe9a9f6e3 100644 --- a/doc/html/boost/algorithm/is_cntrl.html +++ b/doc/html/boost/algorithm/is_cntrl.html @@ -8,7 +8,7 @@ - + @@ -21,7 +21,7 @@

-PrevUpHomeNext +PrevUpHomeNext
@@ -35,7 +35,7 @@ unspecified is_cntrl(const std::locale & Loc = std::locale());
-

Description

+

Description

Construct the is_classified predicate for the ctype_base::cntrl category.

@@ -77,7 +77,7 @@

-PrevUpHomeNext +PrevUpHomeNext
diff --git a/doc/html/boost/algorithm/is_decreasing_idp422971024.html b/doc/html/boost/algorithm/is_decreasing_idp422971024.html deleted file mode 100644 index 36babc9c95..0000000000 --- a/doc/html/boost/algorithm/is_decreasing_idp422971024.html +++ /dev/null @@ -1,98 +0,0 @@ - - - - -Function template is_decreasing - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Function template is_decreasing

-

boost::algorithm::is_decreasing

-
-

Synopsis

-
// In header: <boost/algorithm/cxx11/is_sorted.hpp>
-
-
-template<typename ForwardIterator> 
-  bool is_decreasing(ForwardIterator first, ForwardIterator last);
-
-

Description

-

- -

-
- - - - - -
[Note]Note

This function will return true for sequences that contain items that compare equal. If that is not what you intended, you should use is_strictly_decreasing instead.

-

-

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

Parameters:

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

first

The start of the sequence to be tested.

last

One past the end of the sequence

Returns:

true if the entire sequence is decreasing; i.e, each item is less than or equal to the previous one.

-
-
- - - -
Copyright © 2010-2012 Marshall Clow

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

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/algorithm/is_decreasing_idp422976112.html b/doc/html/boost/algorithm/is_decreasing_idp422976112.html deleted file mode 100644 index 8118a7f738..0000000000 --- a/doc/html/boost/algorithm/is_decreasing_idp422976112.html +++ /dev/null @@ -1,91 +0,0 @@ - - - - -Function template is_decreasing - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Function template is_decreasing

-

boost::algorithm::is_decreasing

-
-

Synopsis

-
// In header: <boost/algorithm/cxx11/is_sorted.hpp>
-
-
-template<typename R> bool is_decreasing(const R & range);
-
-

Description

-

- -

-
- - - - - -
[Note]Note

This function will return true for sequences that contain items that compare equal. If that is not what you intended, you should use is_strictly_decreasing instead.

-

-

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

Parameters:

---- - - - - -

range

The range to be tested.

Returns:

true if the entire sequence is decreasing; i.e, each item is less than or equal to the previous one.

-
-
- - - -
Copyright © 2010-2012 Marshall Clow

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

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/algorithm/is_digit_idp418685568.html b/doc/html/boost/algorithm/is_digit_idp418685568.html deleted file mode 100644 index e81a668b88..0000000000 --- a/doc/html/boost/algorithm/is_digit_idp418685568.html +++ /dev/null @@ -1,83 +0,0 @@ - - - - -Function is_digit - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Function is_digit

-

boost::algorithm::is_digit — is_digit predicate

-
-

Synopsis

-
// In header: <boost/algorithm/string/classification.hpp>
-
-
-unspecified is_digit(const std::locale & Loc = std::locale());
-
-

Description

-

Construct the is_classified predicate for the ctype_base::digit category.

-

- -

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

Parameters:

---- - - - - -

Loc

A locale used for classification

Returns:

An instance of the is_classified predicate

-
-
- - - -
Copyright © 2002-2004 Pavol Droba

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/algorithm/is_digit_idp440233520.html b/doc/html/boost/algorithm/is_digit_idp440233520.html new file mode 100644 index 0000000000..829c0f540d --- /dev/null +++ b/doc/html/boost/algorithm/is_digit_idp440233520.html @@ -0,0 +1,83 @@ + + + + +Function is_digit + + + + + + + + + + + + + + + +
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
+
+
+PrevUpHomeNext +
+
+
+
+

Function is_digit

+

boost::algorithm::is_digit — is_digit predicate

+
+

Synopsis

+
// In header: <boost/algorithm/string/classification.hpp>
+
+
+unspecified is_digit(const std::locale & Loc = std::locale());
+
+

Description

+

Construct the is_classified predicate for the ctype_base::digit category.

+

+ +

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

Parameters:

++++ + + + + +

Loc

A locale used for classification

Returns:

An instance of the is_classified predicate

+
+
+ + + +
Copyright © 2002-2004 Pavol Droba

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/algorithm/is_equal.html b/doc/html/boost/algorithm/is_equal.html index 794c0f12e1..93bbcbf934 100644 --- a/doc/html/boost/algorithm/is_equal.html +++ b/doc/html/boost/algorithm/is_equal.html @@ -7,7 +7,7 @@ - + @@ -21,7 +21,7 @@
-PrevUpHomeNext +PrevUpHomeNext
@@ -35,19 +35,19 @@ struct is_equal { - // public member functions + // public member functions template<typename T1, typename T2> - bool operator()(const T1 &, const T2 &) const; + bool operator()(const T1 &, const T2 &) const; };
-

Description

+

Description

Standard STL equal_to only handle comparison between arguments of the same type. This is a less restrictive version which wraps operator ==.

-

-is_equal public member functions

+

+is_equal public member functions

  1. template<typename T1, typename T2> 
-  bool operator()(const T1 & Arg1, const T2 & Arg2) const;
    Function operator.

    Compare two operands for equality

    + bool operator()(const T1 & Arg1, const T2 & Arg2) const;Function operator.

    Compare two operands for equality

@@ -62,7 +62,7 @@
-PrevUpHomeNext +PrevUpHomeNext
diff --git a/doc/html/boost/algorithm/is_from_range.html b/doc/html/boost/algorithm/is_from_range.html index 006561bfd5..1887b1b517 100644 --- a/doc/html/boost/algorithm/is_from_range.html +++ b/doc/html/boost/algorithm/is_from_range.html @@ -8,7 +8,7 @@ - + @@ -21,7 +21,7 @@
-PrevUpHomeNext +PrevUpHomeNext
@@ -35,7 +35,7 @@ template<typename CharT> unspecified is_from_range(CharT From, CharT To);
-

Description

+

Description

Construct the is_from_range predicate. The predicate holds if the input is included in the specified range. (i.e. From <= Ch <= To )

@@ -83,7 +83,7 @@

-PrevUpHomeNext +PrevUpHomeNext
diff --git a/doc/html/boost/algorithm/is_graph.html b/doc/html/boost/algorithm/is_graph.html index 867ef6b735..35e569b5cb 100644 --- a/doc/html/boost/algorithm/is_graph.html +++ b/doc/html/boost/algorithm/is_graph.html @@ -7,7 +7,7 @@ - + @@ -21,7 +21,7 @@
-PrevUpHomeNext +PrevUpHomeNext
@@ -35,7 +35,7 @@ unspecified is_graph(const std::locale & Loc = std::locale());
-

Description

+

Description

Construct the is_classified predicate for the ctype_base::graph category.

@@ -77,7 +77,7 @@

-PrevUpHomeNext +PrevUpHomeNext
diff --git a/doc/html/boost/algorithm/is_iequal.html b/doc/html/boost/algorithm/is_iequal.html index 09c2bb7d5d..1958949abe 100644 --- a/doc/html/boost/algorithm/is_iequal.html +++ b/doc/html/boost/algorithm/is_iequal.html @@ -35,22 +35,22 @@ struct is_iequal { // construct/copy/destruct - is_iequal(const std::locale & = std::locale()); + is_iequal(const std::locale & = std::locale()); - // public member functions + // public member functions template<typename T1, typename T2> - bool operator()(const T1 &, const T2 &) const; + bool operator()(const T1 &, const T2 &) const; };
-

Description

+

Description

Case insensitive comparison predicate. Comparison is done using specified locales.

-

+

is_iequal public construct/copy/destruct

  1. -
    is_iequal(const std::locale & Loc = std::locale());
    Constructor.

    +

    is_iequal(const std::locale & Loc = std::locale());
    Constructor.

    @@ -74,11 +74,11 @@
    -

    -is_iequal public member functions

    +

    +is_iequal public member functions

    1. template<typename T1, typename T2> 
-  bool operator()(const T1 & Arg1, const T2 & Arg2) const;
      Function operator.

      Compare two operands. Case is ignored.

      + bool operator()(const T1 & Arg1, const T2 & Arg2) const;Function operator.

      Compare two operands. Case is ignored.

    diff --git a/doc/html/boost/algorithm/is_iless.html b/doc/html/boost/algorithm/is_iless.html index 0769795aea..9214eece91 100644 --- a/doc/html/boost/algorithm/is_iless.html +++ b/doc/html/boost/algorithm/is_iless.html @@ -35,22 +35,22 @@ structis_iless{// construct/copy/destruct - is_iless(conststd::locale&=std::locale()); + is_iless(conststd::locale&=std::locale()); - // public member functions + // public member functionstemplate<typename T1,typename T2> - booloperator()(constT1&,constT2&)const; + booloperator()(constT1&,constT2&)const;};
    -

    Description

    +

    Description

    Case insensitive comparison predicate. Comparison is done using specified locales.

    -

    +

    is_iless public construct/copy/destruct

    1. -
      is_iless(const std::locale & Loc = std::locale());
      Constructor.

      +

      is_iless(const std::locale & Loc = std::locale());
      Constructor.

    @@ -74,11 +74,11 @@
    -

    -is_iless public member functions

    +

    +is_iless public member functions

    1. template<typename T1, typename T2> 
-  bool operator()(const T1 & Arg1, const T2 & Arg2) const;
      Function operator.

      Compare two operands. Case is ignored.

      + bool operator()(const T1 & Arg1, const T2 & Arg2) const;Function operator.

      Compare two operands. Case is ignored.

    diff --git a/doc/html/boost/algorithm/is_increasing_idp422961856.html b/doc/html/boost/algorithm/is_increasing_idp422961856.html deleted file mode 100644 index 1a7b28d57a..0000000000 --- a/doc/html/boost/algorithm/is_increasing_idp422961856.html +++ /dev/null @@ -1,98 +0,0 @@ - - - - -Function template is_increasing - - - - - - - - -
    - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Function template is_increasing

    -

    boost::algorithm::is_increasing

    -
    -

    Synopsis

    -
    // In header: <boost/algorithm/cxx11/is_sorted.hpp>
-
-
-template<typename ForwardIterator> 
-  bool is_increasing(ForwardIterator first, ForwardIterator last);
    -
    -

    Description

    -

    – Range based versions of the C++11 functions - -

    -
    - - - - - -
    [Note]Note

    This function will return true for sequences that contain items that compare equal. If that is not what you intended, you should use is_strictly_increasing instead.

    -

    -

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

    Parameters:

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

    first

    The start of the sequence to be tested.

    last

    One past the end of the sequence

    Returns:

    true if the entire sequence is increasing; i.e, each item is greater than or equal to the previous one.

    -
    -
    - - - -
    Copyright © 2010-2012 Marshall Clow

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

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/algorithm/is_increasing_idp422966944.html b/doc/html/boost/algorithm/is_increasing_idp422966944.html deleted file mode 100644 index abcf27e9e7..0000000000 --- a/doc/html/boost/algorithm/is_increasing_idp422966944.html +++ /dev/null @@ -1,91 +0,0 @@ - - - - -Function template is_increasing - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Function template is_increasing

    -

    boost::algorithm::is_increasing

    -
    -

    Synopsis

    -
    // In header: <boost/algorithm/cxx11/is_sorted.hpp>
-
-
-template<typename R> bool is_increasing(const R & range);
    -
    -

    Description

    -

    - -

    -
    - - - - - -
    [Note]Note

    This function will return true for sequences that contain items that compare equal. If that is not what you intended, you should use is_strictly_increasing instead.

    -

    -

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

    Parameters:

    ---- - - - - -

    range

    The range to be tested.

    Returns:

    true if the entire sequence is increasing; i.e, each item is greater than or equal to the previous one.

    -
    -
    - - - -
    Copyright © 2010-2012 Marshall Clow

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

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/algorithm/is_less.html b/doc/html/boost/algorithm/is_less.html index 568ff72db0..a4ea812430 100644 --- a/doc/html/boost/algorithm/is_less.html +++ b/doc/html/boost/algorithm/is_less.html @@ -35,19 +35,19 @@ struct is_less { - // public member functions + // public member functions template<typename T1, typename T2> - bool operator()(const T1 &, const T2 &) const; + bool operator()(const T1 &, const T2 &) const; };
    -

    Description

    +

    Description

    Convenient version of standard std::less. Operation is templated, therefore it is not required to specify the exact types upon the construction

    -

    -is_less public member functions

    +

    +is_less public member functions

    1. template<typename T1, typename T2> 
-  bool operator()(const T1 & Arg1, const T2 & Arg2) const;
      Functor operation.

      Compare two operands using > operator

      + bool operator()(const T1 & Arg1, const T2 & Arg2) const;Functor operation.

      Compare two operands using > operator

    diff --git a/doc/html/boost/algorithm/is_lower.html b/doc/html/boost/algorithm/is_lower.html index d832d8ce0f..8f1c2a9d20 100644 --- a/doc/html/boost/algorithm/is_lower.html +++ b/doc/html/boost/algorithm/is_lower.html @@ -35,7 +35,7 @@ unspecified is_lower(const std::locale & Loc = std::locale());
-

Description

+

Description

Construct the is_classified predicate for the ctype_base::lower category.

diff --git a/doc/html/boost/algorithm/is_not_greater.html b/doc/html/boost/algorithm/is_not_greater.html index 9580bbcb7f..bdfb87621d 100644 --- a/doc/html/boost/algorithm/is_not_greater.html +++ b/doc/html/boost/algorithm/is_not_greater.html @@ -35,19 +35,19 @@ struct is_not_greater { - // public member functions + // public member functions template<typename T1, typename T2> - bool operator()(const T1 &, const T2 &) const; + bool operator()(const T1 &, const T2 &) const; };

-

Description

+

Description

Convenient version of standard std::not_greater_to. Operation is templated, therefore it is not required to specify the exact types upon the construction

-

-is_not_greater public member functions

+

+is_not_greater public member functions

  1. template<typename T1, typename T2> 
-  bool operator()(const T1 & Arg1, const T2 & Arg2) const;
    Functor operation.

    Compare two operands using > operator

    + bool operator()(const T1 & Arg1, const T2 & Arg2) const;Functor operation.

    Compare two operands using > operator

diff --git a/doc/html/boost/algorithm/is_not_igreater.html b/doc/html/boost/algorithm/is_not_igreater.html index 2b363f4de4..129ab77eb3 100644 --- a/doc/html/boost/algorithm/is_not_igreater.html +++ b/doc/html/boost/algorithm/is_not_igreater.html @@ -35,22 +35,22 @@ struct is_not_igreater { // construct/copy/destruct - is_not_igreater(const std::locale & = std::locale()); + is_not_igreater(const std::locale & = std::locale()); - // public member functions + // public member functions template<typename T1, typename T2> - bool operator()(const T1 &, const T2 &) const; + bool operator()(const T1 &, const T2 &) const; };
-

Description

+

Description

Case insensitive comparison predicate. Comparison is done using specified locales.

-

+

is_not_igreater public construct/copy/destruct

  1. -
    is_not_igreater(const std::locale & Loc = std::locale());
    Constructor.

    +

    is_not_igreater(const std::locale & Loc = std::locale());
    Constructor.

    @@ -74,11 +74,11 @@
    -

    -is_not_igreater public member functions

    +

    +is_not_igreater public member functions

    1. template<typename T1, typename T2> 
-  bool operator()(const T1 & Arg1, const T2 & Arg2) const;
      Function operator.

      Compare two operands. Case is ignored.

      + bool operator()(const T1 & Arg1, const T2 & Arg2) const;Function operator.

      Compare two operands. Case is ignored.

    diff --git a/doc/html/boost/algorithm/is_palindrome_idp423203264.html b/doc/html/boost/algorithm/is_palindrome_idp423203264.html deleted file mode 100644 index 2f9fc9b9f2..0000000000 --- a/doc/html/boost/algorithm/is_palindrome_idp423203264.html +++ /dev/null @@ -1,103 +0,0 @@ - - - - -Function template is_palindrome - - - - - - - - -
    - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Function template is_palindrome

    -

    boost::algorithm::is_palindrome

    -
    -

    Synopsis

    -
    // In header: <boost/algorithm/is_palindrome.hpp>
-
-
-template<typename BidirectionalIterator, typename Predicate> 
-  bool is_palindrome(BidirectionalIterator begin, BidirectionalIterator end, 
-                     Predicate p);
    -
    -

    Description

    -

    - -

    -
    - - - - - -
    [Note]Note

    This function will return true for empty sequences and for palindromes. For other sequences function will return false. Complexity: O(N).

    -

    -

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

    Parameters:

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

    begin

    The start of the input sequence

    end

    One past the end of the input sequence

    p

    A predicate used to compare the values.

    Returns:

    true if the entire sequence is palindrome

    -
    -
    - - - -
    Copyright © 2010-2012 Marshall Clow

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

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/algorithm/is_palindrome_idp423209728.html b/doc/html/boost/algorithm/is_palindrome_idp423209728.html deleted file mode 100644 index 378c746aab..0000000000 --- a/doc/html/boost/algorithm/is_palindrome_idp423209728.html +++ /dev/null @@ -1,98 +0,0 @@ - - - - -Function template is_palindrome - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Function template is_palindrome

    -

    boost::algorithm::is_palindrome

    -
    -

    Synopsis

    -
    // In header: <boost/algorithm/is_palindrome.hpp>
-
-
-template<typename BidirectionalIterator> 
-  bool is_palindrome(BidirectionalIterator begin, BidirectionalIterator end);
    -
    -

    Description

    -

    - -

    -
    - - - - - -
    [Note]Note

    This function will return true for empty sequences and for palindromes. For other sequences function will return false. Complexity: O(N).

    -

    -

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

    Parameters:

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

    begin

    The start of the input sequence

    end

    One past the end of the input sequence

    Returns:

    true if the entire sequence is palindrome

    -
    -
    - - - -
    Copyright © 2010-2012 Marshall Clow

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

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/algorithm/is_palindrome_idp423214688.html b/doc/html/boost/algorithm/is_palindrome_idp423214688.html deleted file mode 100644 index 5014ebffc5..0000000000 --- a/doc/html/boost/algorithm/is_palindrome_idp423214688.html +++ /dev/null @@ -1,91 +0,0 @@ - - - - -Function template is_palindrome - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Function template is_palindrome

    -

    boost::algorithm::is_palindrome

    -
    -

    Synopsis

    -
    // In header: <boost/algorithm/is_palindrome.hpp>
-
-
-template<typename R> bool is_palindrome(const R & range);
    -
    -

    Description

    -

    - -

    -
    - - - - - -
    [Note]Note

    This function will return true for empty sequences and for palindromes. For other sequences function will return false. Complexity: O(N).

    -

    -

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

    Parameters:

    ---- - - - - -

    range

    The range to be tested.

    Returns:

    true if the entire sequence is palindrome

    -
    -
    - - - -
    Copyright © 2010-2012 Marshall Clow

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

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/algorithm/is_palindrome_idp423218640.html b/doc/html/boost/algorithm/is_palindrome_idp423218640.html deleted file mode 100644 index 3e7d8c7407..0000000000 --- a/doc/html/boost/algorithm/is_palindrome_idp423218640.html +++ /dev/null @@ -1,98 +0,0 @@ - - - - -Function template is_palindrome - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Function template is_palindrome

    -

    boost::algorithm::is_palindrome

    -
    -

    Synopsis

    -
    // In header: <boost/algorithm/is_palindrome.hpp>
-
-
-template<typename R, typename Predicate> 
-  bool is_palindrome(const R & range, Predicate p);
    -
    -

    Description

    -

    - -

    -
    - - - - - -
    [Note]Note

    This function will return true for empty sequences and for palindromes. For other sequences function will return false. Complexity: O(N).

    -

    -

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

    Parameters:

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

    p

    A predicate used to compare the values.

    range

    The range to be tested.

    Returns:

    true if the entire sequence is palindrome

    -
    -
    - - - -
    Copyright © 2010-2012 Marshall Clow

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

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/algorithm/is_palindrome_idp423224096.html b/doc/html/boost/algorithm/is_palindrome_idp423224096.html deleted file mode 100644 index 1b6d4326f6..0000000000 --- a/doc/html/boost/algorithm/is_palindrome_idp423224096.html +++ /dev/null @@ -1,91 +0,0 @@ - - - - -Function is_palindrome - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Function is_palindrome

    -

    boost::algorithm::is_palindrome

    -
    -

    Synopsis

    -
    // In header: <boost/algorithm/is_palindrome.hpp>
-
-
-bool is_palindrome(const char * str);
    -
    -

    Description

    -

    - -

    -
    - - - - - -
    [Note]Note

    This function will return true for empty sequences and for palindromes. For other sequences function will return false. Complexity: O(N).

    -

    -

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

    Parameters:

    ---- - - - - -

    str

    C-string to be tested.

    Returns:

    true if the entire sequence is palindrome

    -
    -
    - - - -
    Copyright © 2010-2012 Marshall Clow

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

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/algorithm/is_palindrome_idp423227296.html b/doc/html/boost/algorithm/is_palindrome_idp423227296.html deleted file mode 100644 index f0aaffb62d..0000000000 --- a/doc/html/boost/algorithm/is_palindrome_idp423227296.html +++ /dev/null @@ -1,97 +0,0 @@ - - - - -Function template is_palindrome - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Function template is_palindrome

    -

    boost::algorithm::is_palindrome

    -
    -

    Synopsis

    -
    // In header: <boost/algorithm/is_palindrome.hpp>
-
-
-template<typename Predicate> bool is_palindrome(const char * str, Predicate p);
    -
    -

    Description

    -

    - -

    -
    - - - - - -
    [Note]Note

    This function will return true for empty sequences and for palindromes. For other sequences function will return false. Complexity: O(N).

    -

    -

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

    Parameters:

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

    p

    A predicate used to compare the values.

    str

    C-string to be tested.

    Returns:

    true if the entire sequence is palindrome

    -
    -
    - - - -
    Copyright © 2010-2012 Marshall Clow

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

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/algorithm/is_partitione_idp422867568.html b/doc/html/boost/algorithm/is_partitione_idp422867568.html deleted file mode 100644 index fe610c6371..0000000000 --- a/doc/html/boost/algorithm/is_partitione_idp422867568.html +++ /dev/null @@ -1,96 +0,0 @@ - - - - -Function template is_partitioned - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Function template is_partitioned

    -

    boost::algorithm::is_partitioned — Tests to see if a sequence is partitioned according to a predicate.

    -
    -

    Synopsis

    -
    // In header: <boost/algorithm/cxx11/is_partitioned.hpp>
-
-
-template<typename InputIterator, typename UnaryPredicate> 
-  bool is_partitioned(InputIterator first, InputIterator last, 
-                      UnaryPredicate p);
    -
    -

    Description

    -

    -

    -
    - - - - - -
    [Note]Note

    This function is part of the C++2011 standard library.

    -

    -

    -
    ---- - - - - -

    Parameters:

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

    first

    The start of the input sequence

    last

    One past the end of the input sequence

    p

    The predicate to test the values with

    -
    -
    - - - -
    Copyright © 2010-2012 Marshall Clow

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

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/algorithm/is_partitione_idp422873744.html b/doc/html/boost/algorithm/is_partitione_idp422873744.html deleted file mode 100644 index a3bee89606..0000000000 --- a/doc/html/boost/algorithm/is_partitione_idp422873744.html +++ /dev/null @@ -1,82 +0,0 @@ - - - - -Function template is_partitioned - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Function template is_partitioned

    -

    boost::algorithm::is_partitioned — Generates an increasing sequence of values, and stores them in the input Range.

    -
    -

    Synopsis

    -
    // In header: <boost/algorithm/cxx11/is_partitioned.hpp>
-
-
-template<typename Range, typename UnaryPredicate> 
-  bool is_partitioned(const Range & r, UnaryPredicate p);
    -
    -

    Description

    -

    -

    -
    ---- - - - - -

    Parameters:

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

    p

    The predicate to test the values with

    r

    The input range

    -
    -
    - - - -
    Copyright © 2010-2012 Marshall Clow

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

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/algorithm/is_permutatio_idp422880272.html b/doc/html/boost/algorithm/is_permutatio_idp422880272.html deleted file mode 100644 index 3404fab120..0000000000 --- a/doc/html/boost/algorithm/is_permutatio_idp422880272.html +++ /dev/null @@ -1,101 +0,0 @@ - - - - -Function template is_permutation - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Function template is_permutation

    -

    boost::algorithm::is_permutation — Tests to see if the sequence [first,last) is a permutation of the sequence starting at first2.

    -
    -

    Synopsis

    -
    // In header: <boost/algorithm/cxx11/is_permutation.hpp>
-
-
-template<typename ForwardIterator1, typename ForwardIterator2, 
-         typename BinaryPredicate> 
-  bool is_permutation(ForwardIterator1 first1, ForwardIterator1 last1, 
-                      ForwardIterator2 first2, BinaryPredicate p);
    -
    -

    Description

    -

    -

    -
    - - - - - -
    [Note]Note

    This function is part of the C++2011 standard library.

    -

    -

    -
    ---- - - - - -

    Parameters:

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

    first1

    The start of the input sequence

    first2

    The start of the second sequence

    last1

    One past the end of the input sequence

    p

    The predicate to compare elements with

    -
    -
    - - - -
    Copyright © 2010-2012 Marshall Clow

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

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/algorithm/is_permutatio_idp422888064.html b/doc/html/boost/algorithm/is_permutatio_idp422888064.html deleted file mode 100644 index eb796b0957..0000000000 --- a/doc/html/boost/algorithm/is_permutatio_idp422888064.html +++ /dev/null @@ -1,92 +0,0 @@ - - - - -Function template is_permutation - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Function template is_permutation

    -

    boost::algorithm::is_permutation — Tests to see if the sequence [first,last) is a permutation of the sequence starting at first2.

    -
    -

    Synopsis

    -
    // In header: <boost/algorithm/cxx11/is_permutation.hpp>
-
-
-template<typename ForwardIterator1, typename ForwardIterator2> 
-  bool is_permutation(ForwardIterator1 first1, ForwardIterator1 last1, 
-                      ForwardIterator2 first2);
    -
    -

    Description

    -

    -

    -
    - - - - - -
    [Note]Note

    This function is part of the C++2011 standard library.

    -

    -

    -
    ---- - - - - -

    Parameters:

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

    first1

    The start of the input sequence

    first2

    The start of the second sequence

    -
    -
    - - - -
    Copyright © 2010-2012 Marshall Clow

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

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/algorithm/is_permutatio_idp422893968.html b/doc/html/boost/algorithm/is_permutatio_idp422893968.html deleted file mode 100644 index 79cbda2d0b..0000000000 --- a/doc/html/boost/algorithm/is_permutatio_idp422893968.html +++ /dev/null @@ -1,82 +0,0 @@ - - - - -Function template is_permutation - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Function template is_permutation

    -

    boost::algorithm::is_permutation — Tests to see if the sequence [first,last) is a permutation of the sequence starting at first2.

    -
    -

    Synopsis

    -
    // In header: <boost/algorithm/cxx11/is_permutation.hpp>
-
-
-template<typename Range, typename ForwardIterator> 
-  bool is_permutation(const Range & r, ForwardIterator first2);
    -
    -

    Description

    -

    -

    -
    ---- - - - - -

    Parameters:

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

    first2

    The start of the second sequence

    r

    The input range

    -
    -
    - - - -
    Copyright © 2010-2012 Marshall Clow

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

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/algorithm/is_permutatio_idp422898736.html b/doc/html/boost/algorithm/is_permutatio_idp422898736.html deleted file mode 100644 index 546eb8f9cb..0000000000 --- a/doc/html/boost/algorithm/is_permutatio_idp422898736.html +++ /dev/null @@ -1,88 +0,0 @@ - - - - -Function template is_permutation - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Function template is_permutation

    -

    boost::algorithm::is_permutation — Tests to see if the sequence [first,last) is a permutation of the sequence starting at first2.

    -
    -

    Synopsis

    -
    // In header: <boost/algorithm/cxx11/is_permutation.hpp>
-
-
-template<typename Range, typename ForwardIterator, typename BinaryPredicate> 
-  boost::disable_if_c< boost::is_same< Range, ForwardIterator >::value, bool >::type 
-  is_permutation(const Range & r, ForwardIterator first2, 
-                 BinaryPredicate pred);
    -
    -

    Description

    -

    -

    -
    ---- - - - - -

    Parameters:

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

    first2

    The start of the second sequence

    pred

    The predicate to compare elements with

    r

    The input range

    -
    -
    - - - -
    Copyright © 2010-2012 Marshall Clow

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

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/algorithm/is_permutatio_idp422907008.html b/doc/html/boost/algorithm/is_permutatio_idp422907008.html deleted file mode 100644 index fe27c01945..0000000000 --- a/doc/html/boost/algorithm/is_permutatio_idp422907008.html +++ /dev/null @@ -1,100 +0,0 @@ - - - - -Function template is_permutation - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Function template is_permutation

    -

    boost::algorithm::is_permutation — Tests to see if the sequence [first,last) is a permutation of the sequence starting at first2.

    -
    -

    Synopsis

    -
    // In header: <boost/algorithm/cxx14/is_permutation.hpp>
-
-
-template<typename ForwardIterator1, typename ForwardIterator2> 
-  bool is_permutation(ForwardIterator1 first1, ForwardIterator1 last1, 
-                      ForwardIterator2 first2, ForwardIterator2 last2);
    -
    -

    Description

    -

    -

    -
    - - - - - -
    [Note]Note

    This function is part of the C++2014 standard library.

    -

    -

    -
    ---- - - - - -

    Parameters:

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

    first1

    The start of the input sequence

    first2

    The start of the second sequence

    last1

    One past the end of the second sequence

    last2

    One past the end of the input sequence

    -
    -
    - - - -
    Copyright © 2010-2012 Marshall Clow

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

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/algorithm/is_permutatio_idp422914304.html b/doc/html/boost/algorithm/is_permutatio_idp422914304.html deleted file mode 100644 index 967b6b08de..0000000000 --- a/doc/html/boost/algorithm/is_permutatio_idp422914304.html +++ /dev/null @@ -1,106 +0,0 @@ - - - - -Function template is_permutation - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Function template is_permutation

    -

    boost::algorithm::is_permutation — Tests to see if the sequence [first,last) is a permutation of the sequence starting at first2.

    -
    -

    Synopsis

    -
    // In header: <boost/algorithm/cxx14/is_permutation.hpp>
-
-
-template<typename ForwardIterator1, typename ForwardIterator2, 
-         typename BinaryPredicate> 
-  bool is_permutation(ForwardIterator1 first1, ForwardIterator1 last1, 
-                      ForwardIterator2 first2, ForwardIterator2 last2, 
-                      BinaryPredicate pred);
    -
    -

    Description

    -

    -

    -
    - - - - - -
    [Note]Note

    This function is part of the C++2014 standard library.

    -

    -

    -
    ---- - - - - -

    Parameters:

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

    first1

    The start of the input sequence

    first2

    The start of the second sequence

    last1

    One past the end of the input sequence

    last2

    One past the end of the second sequence

    pred

    The predicate to compare elements with

    -
    -
    - - - -
    Copyright © 2010-2012 Marshall Clow

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

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/algorithm/is_print.html b/doc/html/boost/algorithm/is_print.html index 8aad2c4566..62841684c9 100644 --- a/doc/html/boost/algorithm/is_print.html +++ b/doc/html/boost/algorithm/is_print.html @@ -35,7 +35,7 @@ unspecified is_print(const std::locale & Loc = std::locale());
    -

    Description

    +

    Description

    Construct the is_classified predicate for the ctype_base::print category.

    diff --git a/doc/html/boost/algorithm/is_punct.html b/doc/html/boost/algorithm/is_punct.html index ab3485344d..86c33ba848 100644 --- a/doc/html/boost/algorithm/is_punct.html +++ b/doc/html/boost/algorithm/is_punct.html @@ -35,7 +35,7 @@ unspecified is_punct(const std::locale & Loc = std::locale());

    -

    Description

    +

    Description

    Construct the is_classified predicate for the ctype_base::punct category.

    diff --git a/doc/html/boost/algorithm/is_sorted_idp422935184.html b/doc/html/boost/algorithm/is_sorted_idp422935184.html deleted file mode 100644 index 7428bd2188..0000000000 --- a/doc/html/boost/algorithm/is_sorted_idp422935184.html +++ /dev/null @@ -1,93 +0,0 @@ - - - - -Function template is_sorted - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -

    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Function template is_sorted

    -

    boost::algorithm::is_sorted

    -
    -

    Synopsis

    -
    // In header: <boost/algorithm/cxx11/is_sorted.hpp>
-
-
-template<typename ForwardIterator, typename Pred> 
-  bool is_sorted(ForwardIterator first, ForwardIterator last, Pred p);
    -
    -

    Description

    -

    - -

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

    Parameters:

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

    first

    The start of the sequence to be tested.

    last

    One past the end of the sequence

    p

    A binary predicate that returns true if two elements are ordered.

    Returns:

    whether or not the entire sequence is sorted

    -
    -
    - - - -
    Copyright © 2010-2012 Marshall Clow

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

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/algorithm/is_sorted_idp422940976.html b/doc/html/boost/algorithm/is_sorted_idp422940976.html deleted file mode 100644 index 2f7f1f37ee..0000000000 --- a/doc/html/boost/algorithm/is_sorted_idp422940976.html +++ /dev/null @@ -1,89 +0,0 @@ - - - - -Function template is_sorted - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Function template is_sorted

    -

    boost::algorithm::is_sorted

    -
    -

    Synopsis

    -
    // In header: <boost/algorithm/cxx11/is_sorted.hpp>
-
-
-template<typename ForwardIterator> 
-  bool is_sorted(ForwardIterator first, ForwardIterator last);
    -
    -

    Description

    -

    - -

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

    Parameters:

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

    first

    The start of the sequence to be tested.

    last

    One past the end of the sequence

    Returns:

    whether or not the entire sequence is sorted

    -
    -
    - - - -
    Copyright © 2010-2012 Marshall Clow

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

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/algorithm/is_sorted_idp422953568.html b/doc/html/boost/algorithm/is_sorted_idp422953568.html deleted file mode 100644 index 536663d8a7..0000000000 --- a/doc/html/boost/algorithm/is_sorted_idp422953568.html +++ /dev/null @@ -1,90 +0,0 @@ - - - - -Function template is_sorted - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Function template is_sorted

    -

    boost::algorithm::is_sorted

    -
    -

    Synopsis

    -
    // In header: <boost/algorithm/cxx11/is_sorted.hpp>
-
-
-template<typename R, typename Pred> 
-  boost::lazy_disable_if_c< boost::is_same< R, Pred >::value, boost::mpl::identity< bool > >::type 
-  is_sorted(const R & range, Pred p);
    -
    -

    Description

    -

    - -

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

    Parameters:

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

    p

    A binary predicate that returns true if two elements are ordered.

    range

    The range to be tested.

    Returns:

    whether or not the entire range R is sorted (according to the comparison predicate 'p').

    -
    -
    - - - -
    Copyright © 2010-2012 Marshall Clow

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

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/algorithm/is_sorted_idp422958576.html b/doc/html/boost/algorithm/is_sorted_idp422958576.html deleted file mode 100644 index da1a2f877f..0000000000 --- a/doc/html/boost/algorithm/is_sorted_idp422958576.html +++ /dev/null @@ -1,82 +0,0 @@ - - - - -Function template is_sorted - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Function template is_sorted

    -

    boost::algorithm::is_sorted

    -
    -

    Synopsis

    -
    // In header: <boost/algorithm/cxx11/is_sorted.hpp>
-
-
-template<typename R> bool is_sorted(const R & range);
    -
    -

    Description

    -

    - -

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

    Parameters:

    ---- - - - - -

    range

    The range to be tested.

    Returns:

    whether or not the entire range R is sorted

    -
    -
    - - - -
    Copyright © 2010-2012 Marshall Clow

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

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/algorithm/is_sorted_unt_idp422924976.html b/doc/html/boost/algorithm/is_sorted_unt_idp422924976.html deleted file mode 100644 index 60dc710a32..0000000000 --- a/doc/html/boost/algorithm/is_sorted_unt_idp422924976.html +++ /dev/null @@ -1,94 +0,0 @@ - - - - -Function template is_sorted_until - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Function template is_sorted_until

    -

    boost::algorithm::is_sorted_until

    -
    -

    Synopsis

    -
    // In header: <boost/algorithm/cxx11/is_sorted.hpp>
-
-
-template<typename ForwardIterator, typename Pred> 
-  ForwardIterator 
-  is_sorted_until(ForwardIterator first, ForwardIterator last, Pred p);
    -
    -

    Description

    -

    - -

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

    Parameters:

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

    first

    The start of the sequence to be tested.

    last

    One past the end of the sequence

    p

    A binary predicate that returns true if two elements are ordered.

    Returns:

    the point in the sequence [first, last) where the elements are unordered (according to the comparison predicate 'p').

    -
    -
    - - - -
    Copyright © 2010-2012 Marshall Clow

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

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/algorithm/is_sorted_unt_idp422930896.html b/doc/html/boost/algorithm/is_sorted_unt_idp422930896.html deleted file mode 100644 index 9f8c3384ab..0000000000 --- a/doc/html/boost/algorithm/is_sorted_unt_idp422930896.html +++ /dev/null @@ -1,89 +0,0 @@ - - - - -Function template is_sorted_until - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Function template is_sorted_until

    -

    boost::algorithm::is_sorted_until

    -
    -

    Synopsis

    -
    // In header: <boost/algorithm/cxx11/is_sorted.hpp>
-
-
-template<typename ForwardIterator> 
-  ForwardIterator is_sorted_until(ForwardIterator first, ForwardIterator last);
    -
    -

    Description

    -

    - -

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

    Parameters:

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

    first

    The start of the sequence to be tested.

    last

    One past the end of the sequence

    Returns:

    the point in the sequence [first, last) where the elements are unordered

    -
    -
    - - - -
    Copyright © 2010-2012 Marshall Clow

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

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/algorithm/is_sorted_unt_idp422945264.html b/doc/html/boost/algorithm/is_sorted_unt_idp422945264.html deleted file mode 100644 index c154e5202a..0000000000 --- a/doc/html/boost/algorithm/is_sorted_unt_idp422945264.html +++ /dev/null @@ -1,90 +0,0 @@ - - - - -Function template is_sorted_until - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Function template is_sorted_until

    -

    boost::algorithm::is_sorted_until

    -
    -

    Synopsis

    -
    // In header: <boost/algorithm/cxx11/is_sorted.hpp>
-
-
-template<typename R, typename Pred> 
-  boost::lazy_disable_if_c< boost::is_same< R, Pred >::value, typename boost::range_iterator< const R > >::type 
-  is_sorted_until(const R & range, Pred p);
    -
    -

    Description

    -

    – Range based versions of the C++11 functions - -

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

    Parameters:

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

    p

    A binary predicate that returns true if two elements are ordered.

    range

    The range to be tested.

    Returns:

    the point in the range R where the elements are unordered (according to the comparison predicate 'p').

    -
    -
    - - - -
    Copyright © 2010-2012 Marshall Clow

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

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/algorithm/is_sorted_unt_idp422950288.html b/doc/html/boost/algorithm/is_sorted_unt_idp422950288.html deleted file mode 100644 index 35427cd08d..0000000000 --- a/doc/html/boost/algorithm/is_sorted_unt_idp422950288.html +++ /dev/null @@ -1,83 +0,0 @@ - - - - -Function template is_sorted_until - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Function template is_sorted_until

    -

    boost::algorithm::is_sorted_until

    -
    -

    Synopsis

    -
    // In header: <boost/algorithm/cxx11/is_sorted.hpp>
-
-
-template<typename R> 
-  boost::range_iterator< const R >::type is_sorted_until(const R & range);
    -
    -

    Description

    -

    - -

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

    Parameters:

    ---- - - - - -

    range

    The range to be tested.

    Returns:

    the point in the range R where the elements are unordered

    -
    -
    - - - -
    Copyright © 2010-2012 Marshall Clow

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

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/algorithm/is_space.html b/doc/html/boost/algorithm/is_space.html index 42adc83518..6d3f4c5178 100644 --- a/doc/html/boost/algorithm/is_space.html +++ b/doc/html/boost/algorithm/is_space.html @@ -35,7 +35,7 @@ unspecified is_space(const std::locale & Loc = std::locale());
    -

    Description

    +

    Description

    Construct the is_classified predicate for the ctype_base::space category.

    diff --git a/doc/html/boost/algorithm/is_strictly_d_idp422989360.html b/doc/html/boost/algorithm/is_strictly_d_idp422989360.html deleted file mode 100644 index 822e37fb43..0000000000 --- a/doc/html/boost/algorithm/is_strictly_d_idp422989360.html +++ /dev/null @@ -1,98 +0,0 @@ - - - - -Function template is_strictly_decreasing - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -

    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Function template is_strictly_decreasing

    -

    boost::algorithm::is_strictly_decreasing

    -
    -

    Synopsis

    -
    // In header: <boost/algorithm/cxx11/is_sorted.hpp>
-
-
-template<typename ForwardIterator> 
-  bool is_strictly_decreasing(ForwardIterator first, ForwardIterator last);
    -
    -

    Description

    -

    - -

    -
    - - - - - -
    [Note]Note

    This function will return false for sequences that contain items that compare equal. If that is not what you intended, you should use is_decreasing instead.

    -

    -

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

    Parameters:

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

    first

    The start of the sequence to be tested.

    last

    One past the end of the sequence

    Returns:

    true if the entire sequence is strictly decreasing; i.e, each item is less than the previous one

    -
    -
    - - - -
    Copyright © 2010-2012 Marshall Clow

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

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/algorithm/is_strictly_d_idp422994448.html b/doc/html/boost/algorithm/is_strictly_d_idp422994448.html deleted file mode 100644 index dcc4a71681..0000000000 --- a/doc/html/boost/algorithm/is_strictly_d_idp422994448.html +++ /dev/null @@ -1,91 +0,0 @@ - - - - -Function template is_strictly_decreasing - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Function template is_strictly_decreasing

    -

    boost::algorithm::is_strictly_decreasing

    -
    -

    Synopsis

    -
    // In header: <boost/algorithm/cxx11/is_sorted.hpp>
-
-
-template<typename R> bool is_strictly_decreasing(const R & range);
    -
    -

    Description

    -

    - -

    -
    - - - - - -
    [Note]Note

    This function will return false for sequences that contain items that compare equal. If that is not what you intended, you should use is_decreasing instead.

    -

    -

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

    Parameters:

    ---- - - - - -

    range

    The range to be tested.

    Returns:

    true if the entire sequence is strictly decreasing; i.e, each item is less than the previous one

    -
    -
    - - - -
    Copyright © 2010-2012 Marshall Clow

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

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/algorithm/is_strictly_i_idp422980192.html b/doc/html/boost/algorithm/is_strictly_i_idp422980192.html deleted file mode 100644 index f0f9a1be41..0000000000 --- a/doc/html/boost/algorithm/is_strictly_i_idp422980192.html +++ /dev/null @@ -1,98 +0,0 @@ - - - - -Function template is_strictly_increasing - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Function template is_strictly_increasing

    -

    boost::algorithm::is_strictly_increasing

    -
    -

    Synopsis

    -
    // In header: <boost/algorithm/cxx11/is_sorted.hpp>
-
-
-template<typename ForwardIterator> 
-  bool is_strictly_increasing(ForwardIterator first, ForwardIterator last);
    -
    -

    Description

    -

    - -

    -
    - - - - - -
    [Note]Note

    This function will return false for sequences that contain items that compare equal. If that is not what you intended, you should use is_increasing instead.

    -

    -

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

    Parameters:

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

    first

    The start of the sequence to be tested.

    last

    One past the end of the sequence

    Returns:

    true if the entire sequence is strictly increasing; i.e, each item is greater than the previous one

    -
    -
    - - - -
    Copyright © 2010-2012 Marshall Clow

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

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/algorithm/is_strictly_i_idp422985280.html b/doc/html/boost/algorithm/is_strictly_i_idp422985280.html deleted file mode 100644 index e933e4b083..0000000000 --- a/doc/html/boost/algorithm/is_strictly_i_idp422985280.html +++ /dev/null @@ -1,91 +0,0 @@ - - - - -Function template is_strictly_increasing - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Function template is_strictly_increasing

    -

    boost::algorithm::is_strictly_increasing

    -
    -

    Synopsis

    -
    // In header: <boost/algorithm/cxx11/is_sorted.hpp>
-
-
-template<typename R> bool is_strictly_increasing(const R & range);
    -
    -

    Description

    -

    - -

    -
    - - - - - -
    [Note]Note

    This function will return false for sequences that contain items that compare equal. If that is not what you intended, you should use is_increasing instead.

    -

    -

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

    Parameters:

    ---- - - - - -

    range

    The range to be tested.

    Returns:

    true if the entire sequence is strictly increasing; i.e, each item is greater than the previous one

    -
    -
    - - - -
    Copyright © 2010-2012 Marshall Clow

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

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/algorithm/is_upper.html b/doc/html/boost/algorithm/is_upper.html index cb4136bff6..bca2ccceba 100644 --- a/doc/html/boost/algorithm/is_upper.html +++ b/doc/html/boost/algorithm/is_upper.html @@ -35,7 +35,7 @@ unspecified is_upper(const std::locale & Loc = std::locale());
    -

    Description

    +

    Description

    Construct the is_classified predicate for the ctype_base::upper category.

    diff --git a/doc/html/boost/algorithm/is_xdigit.html b/doc/html/boost/algorithm/is_xdigit.html index a6350fea50..c9813f97dd 100644 --- a/doc/html/boost/algorithm/is_xdigit.html +++ b/doc/html/boost/algorithm/is_xdigit.html @@ -35,7 +35,7 @@ unspecified is_xdigit(const std::locale & Loc = std::locale());

    -

    Description

    +

    Description

    Construct the is_classified predicate for the ctype_base::xdigit category.

    diff --git a/doc/html/boost/algorithm/istarts_with.html b/doc/html/boost/algorithm/istarts_with.html index b18497753b..fa82d6ad54 100644 --- a/doc/html/boost/algorithm/istarts_with.html +++ b/doc/html/boost/algorithm/istarts_with.html @@ -37,7 +37,7 @@ bool istarts_with(const Range1T & Input, const Range2T & Test, const std::locale & Loc = std::locale());

    -

    Description

    +

    Description

    This predicate holds when the test string is a prefix of the Input. In other words, if the input starts with the test. Elements are compared case insensitively.

    diff --git a/doc/html/boost/algorithm/iter_find.html b/doc/html/boost/algorithm/iter_find.html index b1362935d6..f9b8afcf9f 100644 --- a/doc/html/boost/algorithm/iter_find.html +++ b/doc/html/boost/algorithm/iter_find.html @@ -37,7 +37,7 @@ SequenceSequenceT & iter_find(SequenceSequenceT & Result, RangeT & Input, FinderT Finder);

    -

    Description

    +

    Description

    This algorithm executes a given finder in iteration on the input, until the end of input is reached, or no match is found. Iteration is done using built-in find_iterator, so the real searching is performed only when needed. In each iteration new match is found and added to the result.

    diff --git a/doc/html/boost/algorithm/iter_split.html b/doc/html/boost/algorithm/iter_split.html index 72e671cbe6..02a8bdf315 100644 --- a/doc/html/boost/algorithm/iter_split.html +++ b/doc/html/boost/algorithm/iter_split.html @@ -37,7 +37,7 @@ SequenceSequenceT & iter_split(SequenceSequenceT & Result, RangeT & Input, FinderT Finder);

    -

    Description

    +

    Description

    This algorithm executes a given finder in iteration on the input, until the end of input is reached, or no match is found. Iteration is done using built-in find_iterator, so the real searching is performed only when needed. Each match is used as a separator of segments. These segments are then returned in the result.

    diff --git a/doc/html/boost/algorithm/join.html b/doc/html/boost/algorithm/join.html index 6c6e25de0d..37a03c4ccf 100644 --- a/doc/html/boost/algorithm/join.html +++ b/doc/html/boost/algorithm/join.html @@ -8,7 +8,7 @@ - + @@ -21,7 +21,7 @@

    -PrevUpHomeNext +PrevUpHomeNext
    @@ -37,7 +37,7 @@ range_value< SequenceSequenceT >::type join(const SequenceSequenceT & Input, const Range1T & Separator);
    -

    Description

    +

    Description

    This algorithm joins all strings in a 'list' into one long string. Segments are concatenated by given separator.

    @@ -94,7 +94,7 @@

    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/boost/algorithm/join_if_idp419281968.html b/doc/html/boost/algorithm/join_if_idp419281968.html deleted file mode 100644 index 9090985da7..0000000000 --- a/doc/html/boost/algorithm/join_if_idp419281968.html +++ /dev/null @@ -1,105 +0,0 @@ - - - - -Function template join_if - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Function template join_if

    -

    boost::algorithm::join_if — Conditional join algorithm.

    -
    -

    Synopsis

    -
    // In header: <boost/algorithm/string/join.hpp>
-
-
-template<typename SequenceSequenceT, typename Range1T, typename PredicateT> 
-  range_value< SequenceSequenceT >::type 
-  join_if(const SequenceSequenceT & Input, const Range1T & Separator, 
-          PredicateT Pred);
    -
    -

    Description

    -

    This algorithm joins all strings in a 'list' into one long string. Segments are concatenated by given separator. Only segments that satisfy the predicate will be added to the result.

    -

    - -

    -
    - - - - - -
    [Note]Note

    This function provides the strong exception-safety guarantee

    -

    -

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

    Parameters:

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

    Input

    A container that holds the input strings. It must be a container-of-containers.

    Pred

    A segment selection predicate

    Separator

    A string that will separate the joined segments.

    Returns:

    Concatenated string.

    -
    -
    - - - -
    Copyright © 2002-2004 Pavol Droba

    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/algorithm/join_if_idp419514736.html b/doc/html/boost/algorithm/join_if_idp419514736.html deleted file mode 100644 index 590fd8b45c..0000000000 --- a/doc/html/boost/algorithm/join_if_idp419514736.html +++ /dev/null @@ -1,112 +0,0 @@ - - - - -Function template join_if - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Function template join_if

    -

    boost::algorithm::join_if — Conditional join algorithm.

    -
    -

    Synopsis

    -
    // In header: <boost/algorithm/string/regex.hpp>
-
-
-template<typename SequenceSequenceT, typename Range1T, typename CharT, 
-         typename RegexTraitsT> 
-  range_value< SequenceSequenceT >::type 
-  join_if(const SequenceSequenceT & Input, const Range1T & Separator, 
-          const basic_regex< CharT, RegexTraitsT > & Rx, 
-          match_flag_type Flags = match_default);
    -
    -

    Description

    -

    This algorithm joins all strings in a 'list' into one long string. Segments are concatenated by given separator. Only segments that match the given regular expression will be added to the result

    -

    This is a specialization of join_if algorithm.

    -

    - -

    -
    - - - - - -
    [Note]Note

    This function provides the strong exception-safety guarantee

    -

    -

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

    Parameters:

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

    Flags

    Regex options

    Input

    A container that holds the input strings. It must be a container-of-containers.

    Rx

    A regular expression

    Separator

    A string that will separate the joined segments.

    Returns:

    Concatenated string.

    -
    -
    - - - -
    Copyright © 2002-2004 Pavol Droba

    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/algorithm/join_if_idp440829920.html b/doc/html/boost/algorithm/join_if_idp440829920.html new file mode 100644 index 0000000000..0d3250e112 --- /dev/null +++ b/doc/html/boost/algorithm/join_if_idp440829920.html @@ -0,0 +1,105 @@ + + + + +Function template join_if + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Function template join_if

    +

    boost::algorithm::join_if — Conditional join algorithm.

    +
    +

    Synopsis

    +
    // In header: <boost/algorithm/string/join.hpp>
+
+
+template<typename SequenceSequenceT, typename Range1T, typename PredicateT> 
+  range_value< SequenceSequenceT >::type 
+  join_if(const SequenceSequenceT & Input, const Range1T & Separator, 
+          PredicateT Pred);
    +
    +

    Description

    +

    This algorithm joins all strings in a 'list' into one long string. Segments are concatenated by given separator. Only segments that satisfy the predicate will be added to the result.

    +

    + +

    +
    + + + + + +
    [Note]Note

    This function provides the strong exception-safety guarantee

    +

    +

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

    Parameters:

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

    Input

    A container that holds the input strings. It must be a container-of-containers.

    Pred

    A segment selection predicate

    Separator

    A string that will separate the joined segments.

    Returns:

    Concatenated string.

    +
    +
    + + + +
    Copyright © 2002-2004 Pavol Droba

    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/algorithm/join_if_idp441062688.html b/doc/html/boost/algorithm/join_if_idp441062688.html new file mode 100644 index 0000000000..3589f54ed4 --- /dev/null +++ b/doc/html/boost/algorithm/join_if_idp441062688.html @@ -0,0 +1,112 @@ + + + + +Function template join_if + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +
    +

    Function template join_if

    +

    boost::algorithm::join_if — Conditional join algorithm.

    +
    +

    Synopsis

    +
    // In header: <boost/algorithm/string/regex.hpp>
+
+
+template<typename SequenceSequenceT, typename Range1T, typename CharT, 
+         typename RegexTraitsT> 
+  range_value< SequenceSequenceT >::type 
+  join_if(const SequenceSequenceT & Input, const Range1T & Separator, 
+          const basic_regex< CharT, RegexTraitsT > & Rx, 
+          match_flag_type Flags = match_default);
    +
    +

    Description

    +

    This algorithm joins all strings in a 'list' into one long string. Segments are concatenated by given separator. Only segments that match the given regular expression will be added to the result

    +

    This is a specialization of join_if algorithm.

    +

    + +

    +
    + + + + + +
    [Note]Note

    This function provides the strong exception-safety guarantee

    +

    +

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

    Parameters:

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

    Flags

    Regex options

    Input

    A container that holds the input strings. It must be a container-of-containers.

    Rx

    A regular expression

    Separator

    A string that will separate the joined segments.

    Returns:

    Concatenated string.

    +
    +
    + + + +
    Copyright © 2002-2004 Pavol Droba

    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/algorithm/knuth_morris__idp423381008.html b/doc/html/boost/algorithm/knuth_morris__idp423381008.html deleted file mode 100644 index 7f9632be5c..0000000000 --- a/doc/html/boost/algorithm/knuth_morris__idp423381008.html +++ /dev/null @@ -1,92 +0,0 @@ - - - - -Function template knuth_morris_pratt_search - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Function template knuth_morris_pratt_search

    -

    boost::algorithm::knuth_morris_pratt_search — Searches the corpus for the pattern.

    -
    -

    Synopsis

    -
    // In header: <boost/algorithm/searching/knuth_morris_pratt.hpp>
-
-
-template<typename patIter, typename corpusIter> 
-  std::pair< corpusIter, corpusIter > 
-  knuth_morris_pratt_search(corpusIter corpus_first, corpusIter corpus_last, 
-                            patIter pat_first, patIter pat_last);
    -
    -

    Description

    -

    -

    -
    ---- - - - - -

    Parameters:

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

    corpus_first

    The start of the data to search (Random Access Iterator)

    corpus_last

    One past the end of the data to search

    pat_first

    The start of the pattern to search for (Random Access Iterator)

    pat_last

    One past the end of the data to search for

    -
    -
    - - - -
    Copyright © 2010-2012 Marshall Clow

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

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/algorithm/knuth_morris_pratt.html b/doc/html/boost/algorithm/knuth_morris_pratt.html deleted file mode 100644 index 786aa0a273..0000000000 --- a/doc/html/boost/algorithm/knuth_morris_pratt.html +++ /dev/null @@ -1,89 +0,0 @@ - - - - -Class template knuth_morris_pratt - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    -

    Class template knuth_morris_pratt

    -

    boost::algorithm::knuth_morris_pratt

    -
    -

    Synopsis

    -
    // In header: <boost/algorithm/searching/knuth_morris_pratt.hpp>
-
-template<typename patIter> 
-class knuth_morris_pratt {
-public:
-  // construct/copy/destruct
-  knuth_morris_pratt(patIter, patIter);
-  ~knuth_morris_pratt();
-
-  // public member functions
-  template<typename corpusIter> 
-    std::pair< corpusIter, corpusIter > 
-    operator()(corpusIter, corpusIter) const;
-  template<typename Range> 
-    std::pair< typename boost::range_iterator< Range >::type, typename boost::range_iterator< Range >::type > 
-    operator()(Range &) const;
-};
    -
    -

    Description

    -
    -

    -knuth_morris_pratt - public - construct/copy/destruct

    -
      -
    1. knuth_morris_pratt(patIter first, patIter last);
      2. -
    2. ~knuth_morris_pratt();
      3. -
    -
    -
    -

    -knuth_morris_pratt public member functions

    -
      -
    1. template<typename corpusIter> 
-  std::pair< corpusIter, corpusIter > 
-  operator()(corpusIter corpus_first, corpusIter corpus_last) const;
      2. -
    2. template<typename Range> 
-  std::pair< typename boost::range_iterator< Range >::type, typename boost::range_iterator< Range >::type > 
-  operator()(Range & r) const;
      3. -
    -
    -
    -
    - - - -
    Copyright © 2010-2012 Marshall Clow

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

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/boost/algorithm/last_finder.html b/doc/html/boost/algorithm/last_finder.html index c38409b239..a5a4e3f352 100644 --- a/doc/html/boost/algorithm/last_finder.html +++ b/doc/html/boost/algorithm/last_finder.html @@ -37,7 +37,7 @@ template<typename RangeT, typename PredicateT> unspecified last_finder(const RangeT & Search, PredicateT Comp);
    -

    Description

    +

    Description

    Construct the last_finder. The finder searches for the last occurrence of the string in a given input. The result is given as an iterator_range delimiting the match.

    diff --git a/doc/html/boost/algorithm/lexicographical_compare.html b/doc/html/boost/algorithm/lexicographical_compare.html index 368c70dee7..989c98a335 100644 --- a/doc/html/boost/algorithm/lexicographical_compare.html +++ b/doc/html/boost/algorithm/lexicographical_compare.html @@ -39,7 +39,7 @@ template<typename Range1T, typename Range2T> bool lexicographical_compare(const Range1T & Arg1, const Range2T & Arg2);

    -

    Description

    +

    Description

    This predicate is an overload of std::lexicographical_compare for range arguments

    It check whether the first argument is lexicographically less then the second one.

    If the optional predicate is specified, it is used for character-wise comparison

    diff --git a/doc/html/boost/algorithm/make_find_iterator.html b/doc/html/boost/algorithm/make_find_iterator.html index 6ccfef4014..cb8dfd7566 100644 --- a/doc/html/boost/algorithm/make_find_iterator.html +++ b/doc/html/boost/algorithm/make_find_iterator.html @@ -37,7 +37,7 @@ find_iterator< typename range_iterator< RangeT >::type > make_find_iterator(RangeT & Collection, FinderT Finder);
    -

    Description

    +

    Description

    Construct a find iterator to iterate through the specified string

    diff --git a/doc/html/boost/algorithm/make_split_iterator.html b/doc/html/boost/algorithm/make_split_iterator.html index 71ad421eed..670e04705d 100644 --- a/doc/html/boost/algorithm/make_split_iterator.html +++ b/doc/html/boost/algorithm/make_split_iterator.html @@ -37,7 +37,7 @@ split_iterator< typename range_iterator< RangeT >::type > make_split_iterator(RangeT & Collection, FinderT Finder);
-

Description

+

Description

Construct a split iterator to iterate through the specified collection

diff --git a/doc/html/boost/algorithm/mismatch_idp423102320.html b/doc/html/boost/algorithm/mismatch_idp423102320.html deleted file mode 100644 index d3e0b9eb74..0000000000 --- a/doc/html/boost/algorithm/mismatch_idp423102320.html +++ /dev/null @@ -1,104 +0,0 @@ - - - - -Function template mismatch - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Function template mismatch

-

boost::algorithm::mismatch

-
-

Synopsis

-
// In header: <boost/algorithm/cxx14/mismatch.hpp>
-
-
-template<typename InputIterator1, typename InputIterator2, 
-         typename BinaryPredicate> 
-  std::pair< InputIterator1, InputIterator2 > 
-  mismatch(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, 
-           InputIterator2 last2, BinaryPredicate pred);
-
-

Description

-

- -

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

Parameters:

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

first1

The start of the first range.

first2

The start of the second range.

last1

One past the end of the first range.

last2

One past the end of the second range.

pred

A predicate for comparing the elements of the ranges

Returns:

a pair of iterators pointing to the first elements in the sequence that do not match

-
-
- - - -
Copyright © 2010-2012 Marshall Clow

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

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/algorithm/mismatch_idp423110624.html b/doc/html/boost/algorithm/mismatch_idp423110624.html deleted file mode 100644 index 90d22d6839..0000000000 --- a/doc/html/boost/algorithm/mismatch_idp423110624.html +++ /dev/null @@ -1,99 +0,0 @@ - - - - -Function template mismatch - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Function template mismatch

-

boost::algorithm::mismatch

-
-

Synopsis

-
// In header: <boost/algorithm/cxx14/mismatch.hpp>
-
-
-template<typename InputIterator1, typename InputIterator2> 
-  std::pair< InputIterator1, InputIterator2 > 
-  mismatch(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, 
-           InputIterator2 last2);
-
-

Description

-

- -

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

Parameters:

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

first1

The start of the first range.

first2

The start of the second range.

last1

One past the end of the first range.

last2

One past the end of the second range.

Returns:

a pair of iterators pointing to the first elements in the sequence that do not match

-
-
- - - -
Copyright © 2010-2012 Marshall Clow

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

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/algorithm/non_hex_input.html b/doc/html/boost/algorithm/non_hex_input.html deleted file mode 100644 index 414fa32c8c..0000000000 --- a/doc/html/boost/algorithm/non_hex_input.html +++ /dev/null @@ -1,52 +0,0 @@ - - - - -Struct non_hex_input - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct non_hex_input

-

boost::algorithm::non_hex_input — Thrown when a non-hex value (0-9, A-F) encountered when decoding. Contains the offending character.

-
-

Synopsis

-
// In header: <boost/algorithm/hex.hpp>
-
-
-struct non_hex_input : public boost::algorithm::hex_decode_error {
-};
-
- - - -
Copyright © 2010-2012 Marshall Clow

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

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/algorithm/none_of_equal_idp423012880.html b/doc/html/boost/algorithm/none_of_equal_idp423012880.html deleted file mode 100644 index 70392b897c..0000000000 --- a/doc/html/boost/algorithm/none_of_equal_idp423012880.html +++ /dev/null @@ -1,102 +0,0 @@ - - - - -Function template none_of_equal - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Function template none_of_equal

-

boost::algorithm::none_of_equal

-
-

Synopsis

-
// In header: <boost/algorithm/cxx11/none_of.hpp>
-
-
-template<typename InputIterator, typename V> 
-  bool none_of_equal(InputIterator first, InputIterator last, const V & val);
-
-

Description

-

-

-
- - - - - -
[Note]Note

returns true on an empty range

-

- -

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

Parameters:

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

first

The start of the input sequence

last

One past the end of the input sequence

val

A value to compare against

Returns:

true if none of the elements in [first, last) are equal to 'val'

-
-
- - - -
Copyright © 2010-2012 Marshall Clow

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

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/algorithm/none_of_equal_idp423019184.html b/doc/html/boost/algorithm/none_of_equal_idp423019184.html deleted file mode 100644 index b6ec386479..0000000000 --- a/doc/html/boost/algorithm/none_of_equal_idp423019184.html +++ /dev/null @@ -1,98 +0,0 @@ - - - - -Function template none_of_equal - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Function template none_of_equal

-

boost::algorithm::none_of_equal

-
-

Synopsis

-
// In header: <boost/algorithm/cxx11/none_of.hpp>
-
-
-template<typename Range, typename V> 
-  bool none_of_equal(const Range & r, const V & val);
-
-

Description

-

-

-
- - - - - -
[Note]Note

returns true on an empty range

-

- -

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

Parameters:

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

r

The input range

val

A value to compare against

Returns:

true if none of the elements in the range are equal to 'val'

-
-
- - - -
Copyright © 2010-2012 Marshall Clow

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

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/algorithm/none_of_idp423001280.html b/doc/html/boost/algorithm/none_of_idp423001280.html deleted file mode 100644 index d9ab92a98b..0000000000 --- a/doc/html/boost/algorithm/none_of_idp423001280.html +++ /dev/null @@ -1,102 +0,0 @@ - - - - -Function template none_of - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Function template none_of

-

boost::algorithm::none_of

-
-

Synopsis

-
// In header: <boost/algorithm/cxx11/none_of.hpp>
-
-
-template<typename InputIterator, typename Predicate> 
-  bool none_of(InputIterator first, InputIterator last, Predicate p);
-
-

Description

-

-

-
- - - - - -
[Note]Note

returns true on an empty range

-

- -

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

Parameters:

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

first

The start of the input sequence

last

One past the end of the input sequence

p

A predicate for testing the elements of the sequence

Returns:

true if none of the elements in [first, last) satisfy the predicate 'p'

-
-
- - - -
Copyright © 2010-2012 Marshall Clow

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

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/algorithm/none_of_idp423007584.html b/doc/html/boost/algorithm/none_of_idp423007584.html deleted file mode 100644 index ec2dfd4f7c..0000000000 --- a/doc/html/boost/algorithm/none_of_idp423007584.html +++ /dev/null @@ -1,98 +0,0 @@ - - - - -Function template none_of - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Function template none_of

-

boost::algorithm::none_of

-
-

Synopsis

-
// In header: <boost/algorithm/cxx11/none_of.hpp>
-
-
-template<typename Range, typename Predicate> 
-  bool none_of(const Range & r, Predicate p);
-
-

Description

-

-

-
- - - - - -
[Note]Note

returns true on an empty range

-

- -

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

Parameters:

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

p

A predicate for testing the elements of the range

r

The input range

Returns:

true if none of the elements in the range satisfy the predicate 'p'

-
-
- - - -
Copyright © 2010-2012 Marshall Clow

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

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/algorithm/not_enough_input.html b/doc/html/boost/algorithm/not_enough_input.html deleted file mode 100644 index 5a4d25e1ef..0000000000 --- a/doc/html/boost/algorithm/not_enough_input.html +++ /dev/null @@ -1,52 +0,0 @@ - - - - -Struct not_enough_input - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Struct not_enough_input

-

boost::algorithm::not_enough_input — Thrown when the input sequence unexpectedly ends.

-
-

Synopsis

-
// In header: <boost/algorithm/hex.hpp>
-
-
-struct not_enough_input : public boost::algorithm::hex_decode_error {
-};
-
- - - -
Copyright © 2010-2012 Marshall Clow

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

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/algorithm/nth_finder.html b/doc/html/boost/algorithm/nth_finder.html index ca265e85a0..fca528ca94 100644 --- a/doc/html/boost/algorithm/nth_finder.html +++ b/doc/html/boost/algorithm/nth_finder.html @@ -38,7 +38,7 @@ template<typename RangeT, typename PredicateT> unspecified nth_finder(const RangeT & Search, int Nth, PredicateT Comp);
-

Description

+

Description

Construct the nth_finder. The finder searches for the n-th (zero-indexed) occurrence of the string in a given input. The result is given as an iterator_range delimiting the match.

diff --git a/doc/html/boost/algorithm/one_of_equal_idp423037808.html b/doc/html/boost/algorithm/one_of_equal_idp423037808.html deleted file mode 100644 index b3b7fc6ea5..0000000000 --- a/doc/html/boost/algorithm/one_of_equal_idp423037808.html +++ /dev/null @@ -1,93 +0,0 @@ - - - - -Function template one_of_equal - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-

-
-PrevUpHomeNext -
-
-
-
-

Function template one_of_equal

-

boost::algorithm::one_of_equal

-
-

Synopsis

-
// In header: <boost/algorithm/cxx11/one_of.hpp>
-
-
-template<typename InputIterator, typename V> 
-  bool one_of_equal(InputIterator first, InputIterator last, const V & val);
-
-

Description

-

- -

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

Parameters:

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

first

The start of the input sequence

last

One past the end of the input sequence

val

A value to compare against

Returns:

true if the value 'val' exists only once in [first, last).

-
-
- - - -
Copyright © 2010-2012 Marshall Clow

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

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/algorithm/one_of_equal_idp423043600.html b/doc/html/boost/algorithm/one_of_equal_idp423043600.html deleted file mode 100644 index a4bb1006b6..0000000000 --- a/doc/html/boost/algorithm/one_of_equal_idp423043600.html +++ /dev/null @@ -1,89 +0,0 @@ - - - - -Function template one_of_equal - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Function template one_of_equal

-

boost::algorithm::one_of_equal

-
-

Synopsis

-
// In header: <boost/algorithm/cxx11/one_of.hpp>
-
-
-template<typename Range, typename V> 
-  bool one_of_equal(const Range & r, const V & val);
-
-

Description

-

- -

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

Parameters:

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

r

The input range

val

A value to compare against

Returns:

true if the value 'val' exists only once in the range.

-
-
- - - -
Copyright © 2010-2012 Marshall Clow

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

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/algorithm/one_of_idp423027232.html b/doc/html/boost/algorithm/one_of_idp423027232.html deleted file mode 100644 index 3d473cbf39..0000000000 --- a/doc/html/boost/algorithm/one_of_idp423027232.html +++ /dev/null @@ -1,93 +0,0 @@ - - - - -Function template one_of - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Function template one_of

-

boost::algorithm::one_of

-
-

Synopsis

-
// In header: <boost/algorithm/cxx11/one_of.hpp>
-
-
-template<typename InputIterator, typename Predicate> 
-  bool one_of(InputIterator first, InputIterator last, Predicate p);
-
-

Description

-

- -

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

Parameters:

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

first

The start of the input sequence

last

One past the end of the input sequence

p

A predicate for testing the elements of the sequence

Returns:

true if the predicate 'p' is true for exactly one item in [first, last).

-
-
- - - -
Copyright © 2010-2012 Marshall Clow

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

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/algorithm/one_of_idp423033024.html b/doc/html/boost/algorithm/one_of_idp423033024.html deleted file mode 100644 index 95f42da1f5..0000000000 --- a/doc/html/boost/algorithm/one_of_idp423033024.html +++ /dev/null @@ -1,89 +0,0 @@ - - - - -Function template one_of - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Function template one_of

-

boost::algorithm::one_of

-
-

Synopsis

-
// In header: <boost/algorithm/cxx11/one_of.hpp>
-
-
-template<typename Range, typename Predicate> 
-  bool one_of(const Range & r, Predicate p);
-
-

Description

-

- -

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

Parameters:

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

p

A predicate for testing the elements of the range

r

The input range

Returns:

true if the predicate 'p' is true for exactly one item in the range.

-
-
- - - -
Copyright © 2010-2012 Marshall Clow

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

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/algorithm/operator___idp418728224.html b/doc/html/boost/algorithm/operator___idp418728224.html deleted file mode 100644 index 3846c5f3b0..0000000000 --- a/doc/html/boost/algorithm/operator___idp418728224.html +++ /dev/null @@ -1,91 +0,0 @@ - - - - -Function template operator&& - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Function template operator&&

-

boost::algorithm::operator&& — predicate 'and' composition predicate

-
-

Synopsis

-
// In header: <boost/algorithm/string/classification.hpp>
-
-
-template<typename Pred1T, typename Pred2T> 
-  unspecified operator&&(const predicate_facade< Pred1T > & Pred1, 
-                         const predicate_facade< Pred2T > & Pred2);
-
-

Description

-

Construct the class_and predicate. This predicate can be used to logically combine two classification predicates. class_and holds, if both predicates return true.

-

- -

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

Parameters:

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

Pred1

The first predicate

Pred2

The second predicate

Returns:

An instance of the class_and predicate

-
-
- - - -
Copyright © 2002-2004 Pavol Droba

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/algorithm/operator___idp440276176.html b/doc/html/boost/algorithm/operator___idp440276176.html new file mode 100644 index 0000000000..a4d347266e --- /dev/null +++ b/doc/html/boost/algorithm/operator___idp440276176.html @@ -0,0 +1,91 @@ + + + + +Function template operator&& + + + + + + + + + + + + + + + +
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
+
+
+PrevUpHomeNext +
+
+
+
+

Function template operator&&

+

boost::algorithm::operator&& — predicate 'and' composition predicate

+
+

Synopsis

+
// In header: <boost/algorithm/string/classification.hpp>
+
+
+template<typename Pred1T, typename Pred2T> 
+  unspecified operator&&(const predicate_facade< Pred1T > & Pred1, 
+                         const predicate_facade< Pred2T > & Pred2);
+
+

Description

+

Construct the class_and predicate. This predicate can be used to logically combine two classification predicates. class_and holds, if both predicates return true.

+

+ +

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

Parameters:

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

Pred1

The first predicate

Pred2

The second predicate

Returns:

An instance of the class_and predicate

+
+
+ + + +
Copyright © 2002-2004 Pavol Droba

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/algorithm/operator__idp418741600.html b/doc/html/boost/algorithm/operator__idp418741600.html deleted file mode 100644 index a759008dc3..0000000000 --- a/doc/html/boost/algorithm/operator__idp418741600.html +++ /dev/null @@ -1,84 +0,0 @@ - - - - -Function template operator! - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Function template operator!

-

boost::algorithm::operator! — predicate negation operator

-
-

Synopsis

-
// In header: <boost/algorithm/string/classification.hpp>
-
-
-template<typename PredT> 
-  unspecified operator!(const predicate_facade< PredT > & Pred);
-
-

Description

-

Construct the class_not predicate. This predicate represents a negation. class_or holds if of the predicates return false.

-

- -

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

Parameters:

---- - - - - -

Pred

The predicate to be negated

Returns:

An instance of the class_not predicate

-
-
- - - -
Copyright © 2002-2004 Pavol Droba

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/algorithm/operator__idp440289552.html b/doc/html/boost/algorithm/operator__idp440289552.html new file mode 100644 index 0000000000..33fa643749 --- /dev/null +++ b/doc/html/boost/algorithm/operator__idp440289552.html @@ -0,0 +1,84 @@ + + + + +Function template operator! + + + + + + + + + + + + + + + +
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
+
+
+PrevUpHomeNext +
+
+
+
+

Function template operator!

+

boost::algorithm::operator! — predicate negation operator

+
+

Synopsis

+
// In header: <boost/algorithm/string/classification.hpp>
+
+
+template<typename PredT> 
+  unspecified operator!(const predicate_facade< PredT > & Pred);
+
+

Description

+

Construct the class_not predicate. This predicate represents a negation. class_or holds if of the predicates return false.

+

+ +

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

Parameters:

++++ + + + + +

Pred

The predicate to be negated

Returns:

An instance of the class_not predicate

+
+
+ + + +
Copyright © 2002-2004 Pavol Droba

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/algorithm/operator_idp418734912.html b/doc/html/boost/algorithm/operator_idp418734912.html deleted file mode 100644 index ddd29877ea..0000000000 --- a/doc/html/boost/algorithm/operator_idp418734912.html +++ /dev/null @@ -1,91 +0,0 @@ - - - - -Function template operator|| - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Function template operator||

-

boost::algorithm::operator|| — predicate 'or' composition predicate

-
-

Synopsis

-
// In header: <boost/algorithm/string/classification.hpp>
-
-
-template<typename Pred1T, typename Pred2T> 
-  unspecified operator||(const predicate_facade< Pred1T > & Pred1, 
-                         const predicate_facade< Pred2T > & Pred2);
-
-

Description

-

Construct the class_or predicate. This predicate can be used to logically combine two classification predicates. class_or holds, if one of the predicates return true.

-

- -

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

Parameters:

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

Pred1

The first predicate

Pred2

The second predicate

Returns:

An instance of the class_or predicate

-
-
- - - -
Copyright © 2002-2004 Pavol Droba

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/algorithm/operator_idp440282864.html b/doc/html/boost/algorithm/operator_idp440282864.html new file mode 100644 index 0000000000..b99df88b69 --- /dev/null +++ b/doc/html/boost/algorithm/operator_idp440282864.html @@ -0,0 +1,91 @@ + + + + +Function template operator|| + + + + + + + + + + + + + + + +
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
+
+
+PrevUpHomeNext +
+
+
+
+

Function template operator||

+

boost::algorithm::operator|| — predicate 'or' composition predicate

+
+

Synopsis

+
// In header: <boost/algorithm/string/classification.hpp>
+
+
+template<typename Pred1T, typename Pred2T> 
+  unspecified operator||(const predicate_facade< Pred1T > & Pred1, 
+                         const predicate_facade< Pred2T > & Pred2);
+
+

Description

+

Construct the class_or predicate. This predicate can be used to logically combine two classification predicates. class_or holds, if one of the predicates return true.

+

+ +

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

Parameters:

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

Pred1

The first predicate

Pred2

The second predicate

Returns:

An instance of the class_or predicate

+
+
+ + + +
Copyright © 2002-2004 Pavol Droba

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/algorithm/partition_cop_idp423051136.html b/doc/html/boost/algorithm/partition_cop_idp423051136.html deleted file mode 100644 index a62f81ef26..0000000000 --- a/doc/html/boost/algorithm/partition_cop_idp423051136.html +++ /dev/null @@ -1,107 +0,0 @@ - - - - -Function template partition_copy - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Function template partition_copy

-

boost::algorithm::partition_copy — Copies the elements that satisfy the predicate p from the range [first, last) to the range beginning at d_first_true, and copies the elements that do not satisfy p to the range beginning at d_first_false.

-
-

Synopsis

-
// In header: <boost/algorithm/cxx11/partition_copy.hpp>
-
-
-template<typename InputIterator, typename OutputIterator1, 
-         typename OutputIterator2, typename UnaryPredicate> 
-  std::pair< OutputIterator1, OutputIterator2 > 
-  partition_copy(InputIterator first, InputIterator last, 
-                 OutputIterator1 out_true, OutputIterator2 out_false, 
-                 UnaryPredicate p);
-
-

Description

-

-

-
- - - - - -
[Note]Note

This function is part of the C++2011 standard library.

-

-

-
---- - - - - -

Parameters:

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

first

The start of the input sequence

last

One past the end of the input sequence

out_false

An output iterator to write the elements that do not satisfy the predicate into

out_true

An output iterator to write the elements that satisfy the predicate into

p

A predicate for dividing the elements of the input sequence.

-
-
- - - -
Copyright © 2010-2012 Marshall Clow

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

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/algorithm/partition_cop_idp423060544.html b/doc/html/boost/algorithm/partition_cop_idp423060544.html deleted file mode 100644 index 0a5b0fccb6..0000000000 --- a/doc/html/boost/algorithm/partition_cop_idp423060544.html +++ /dev/null @@ -1,93 +0,0 @@ - - - - -Function template partition_copy - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Function template partition_copy

-

boost::algorithm::partition_copy

-
-

Synopsis

-
// In header: <boost/algorithm/cxx11/partition_copy.hpp>
-
-
-template<typename Range, typename OutputIterator1, typename OutputIterator2, 
-         typename UnaryPredicate> 
-  std::pair< OutputIterator1, OutputIterator2 > 
-  partition_copy(const Range & r, OutputIterator1 out_true, 
-                 OutputIterator2 out_false, UnaryPredicate p);
-
-

Description

-

-

-
---- - - - - -

Parameters:

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

out_false

An output iterator to write the elements that do not satisfy the predicate into

out_true

An output iterator to write the elements that satisfy the predicate into

p

A predicate for dividing the elements of the input sequence.

r

The input range

-
-
- - - -
Copyright © 2010-2012 Marshall Clow

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

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/algorithm/partition_poi_idp423070720.html b/doc/html/boost/algorithm/partition_poi_idp423070720.html deleted file mode 100644 index af5d185940..0000000000 --- a/doc/html/boost/algorithm/partition_poi_idp423070720.html +++ /dev/null @@ -1,96 +0,0 @@ - - - - -Function template partition_point - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Function template partition_point

-

boost::algorithm::partition_point — Given a partitioned range, returns the partition point, i.e, the first element that does not satisfy p.

-
-

Synopsis

-
// In header: <boost/algorithm/cxx11/partition_point.hpp>
-
-
-template<typename ForwardIterator, typename Predicate> 
-  ForwardIterator 
-  partition_point(ForwardIterator first, ForwardIterator last, Predicate p);
-
-

Description

-

-

-
- - - - - -
[Note]Note

This function is part of the C++2011 standard library.

-

-

-
---- - - - - -

Parameters:

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

first

The start of the input sequence

last

One past the end of the input sequence

p

The predicate to test the values with

-
-
- - - -
Copyright © 2010-2012 Marshall Clow

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

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/algorithm/partition_poi_idp423077024.html b/doc/html/boost/algorithm/partition_poi_idp423077024.html deleted file mode 100644 index 9111988f85..0000000000 --- a/doc/html/boost/algorithm/partition_poi_idp423077024.html +++ /dev/null @@ -1,82 +0,0 @@ - - - - -Function template partition_point - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Function template partition_point

-

boost::algorithm::partition_point — Given a partitioned range, returns the partition point.

-
-

Synopsis

-
// In header: <boost/algorithm/cxx11/partition_point.hpp>
-
-
-template<typename Range, typename Predicate> 
-  boost::range_iterator< Range >::type partition_point(Range & r, Predicate p);
-
-

Description

-

-

-
---- - - - - -

Parameters:

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

p

The predicate to test the values with

r

The input range

-
-
- - - -
Copyright © 2010-2012 Marshall Clow

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

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/algorithm/power_idp422669008.html b/doc/html/boost/algorithm/power_idp422669008.html deleted file mode 100644 index 64d54f7147..0000000000 --- a/doc/html/boost/algorithm/power_idp422669008.html +++ /dev/null @@ -1,90 +0,0 @@ - - - - -Function template power - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Function template power

-

boost::algorithm::power

-
-

Synopsis

-
// In header: <boost/algorithm/algorithm.hpp>
-
-
-template<typename T, typename Integer> 
-  boost::enable_if< boost::is_integral< Integer >, T >::type 
-  power(T x, Integer n);
-
-

Description

-

- -

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

Parameters:

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

n

The exponent (must be >= 0)

x

The value to be exponentiated

Returns:

the value "x" raised to the power "n"

-
-
- - - -
Copyright © 2010-2012 Marshall Clow

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

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/algorithm/power_idp422673792.html b/doc/html/boost/algorithm/power_idp422673792.html deleted file mode 100644 index a271a03882..0000000000 --- a/doc/html/boost/algorithm/power_idp422673792.html +++ /dev/null @@ -1,94 +0,0 @@ - - - - -Function template power - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Function template power

-

boost::algorithm::power

-
-

Synopsis

-
// In header: <boost/algorithm/algorithm.hpp>
-
-
-template<typename T, typename Integer, typename Operation> 
-  boost::enable_if< boost::is_integral< Integer >, T >::type 
-  power(T x, Integer n, Operation op);
-
-

Description

-

- -

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

Parameters:

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

n

The exponent (must be >= 0)

op

The operation used

x

The value to be exponentiated

Returns:

the value "x" raised to the power "n" using the operation "op".

-
-
- - - -
Copyright © 2010-2012 Marshall Clow

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

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/algorithm/range_finder.html b/doc/html/boost/algorithm/range_finder.html index 89cf4f2143..b1814db8d7 100644 --- a/doc/html/boost/algorithm/range_finder.html +++ b/doc/html/boost/algorithm/range_finder.html @@ -38,7 +38,7 @@ template<typename ForwardIteratorT> unspecified range_finder(iterator_range< ForwardIteratorT > Range);
-

Description

+

Description

Construct the range_finder. The finder does not perform any operation. It simply returns the given range for any input.

diff --git a/doc/html/boost/algorithm/regex_finder.html b/doc/html/boost/algorithm/regex_finder.html index 94397f42fd..c66796d504 100644 --- a/doc/html/boost/algorithm/regex_finder.html +++ b/doc/html/boost/algorithm/regex_finder.html @@ -7,7 +7,7 @@ - + @@ -21,7 +21,7 @@

-PrevUpHomeNext +PrevUpHomeNext
@@ -37,7 +37,7 @@ unspecified regex_finder(const basic_regex< CharT, RegexTraitsT > & Rx, match_flag_type MatchFlags = match_default);
-

Description

+

Description

Construct the regex_finder. Finder uses the regex engine to search for a match. Result is given in regex_search_result. This is an extension of the iterator_range. In addition it contains match results from the regex_search algorithm.

@@ -85,7 +85,7 @@

-PrevUpHomeNext +PrevUpHomeNext
diff --git a/doc/html/boost/algorithm/regex_formatter.html b/doc/html/boost/algorithm/regex_formatter.html index 00a061e07c..da9a010d4d 100644 --- a/doc/html/boost/algorithm/regex_formatter.html +++ b/doc/html/boost/algorithm/regex_formatter.html @@ -37,7 +37,7 @@ unspecified regex_formatter(const std::basic_string< CharT, TraitsT, AllocT > & Format, match_flag_type Flags = format_default);
-

Description

+

Description

Construct the regex_formatter. Regex formatter uses the regex engine to format a match found by the regex_finder. This formatted it designed to closely cooperate with regex_finder.

diff --git a/doc/html/boost/algorithm/replace_all.html b/doc/html/boost/algorithm/replace_all.html index a3f994df21..665449ec0e 100644 --- a/doc/html/boost/algorithm/replace_all.html +++ b/doc/html/boost/algorithm/replace_all.html @@ -37,7 +37,7 @@ void replace_all(SequenceT & Input, const Range1T & Search, const Range2T & Format);

-

Description

+

Description

Replace all occurrences of the search string in the input with the format string. The input sequence is modified in-place.

diff --git a/doc/html/boost/algorithm/replace_all_copy.html b/doc/html/boost/algorithm/replace_all_copy.html index 84a6f974b8..9f730c2e8a 100644 --- a/doc/html/boost/algorithm/replace_all_copy.html +++ b/doc/html/boost/algorithm/replace_all_copy.html @@ -42,7 +42,7 @@ SequenceT replace_all_copy(const SequenceT & Input, const Range1T & Search, const Range2T & Format);
-

Description

+

Description

Replace all occurrences of the search string in the input with the format string. The result is a modified copy of the input. It is returned as a sequence or copied to the output iterator.

diff --git a/doc/html/boost/algorithm/replace_all_regex.html b/doc/html/boost/algorithm/replace_all_regex.html index 3f332996bf..2b4d0d3737 100644 --- a/doc/html/boost/algorithm/replace_all_regex.html +++ b/doc/html/boost/algorithm/replace_all_regex.html @@ -40,7 +40,7 @@ const std::basic_string< CharT, FormatStringTraitsT, FormatStringAllocatorT > & Format, match_flag_type Flags = match_default|format_default);

-

Description

+

Description

Format all substrings, matching given regex, with the specified format. The input string is modified in-place.

diff --git a/doc/html/boost/algorithm/replace_all_regex_copy.html b/doc/html/boost/algorithm/replace_all_regex_copy.html index 3b5f42e94b..40939b4677 100644 --- a/doc/html/boost/algorithm/replace_all_regex_copy.html +++ b/doc/html/boost/algorithm/replace_all_regex_copy.html @@ -48,7 +48,7 @@ const std::basic_string< CharT, FormatStringTraitsT, FormatStringAllocatorT > & Format, match_flag_type Flags = match_default|format_default);
-

Description

+

Description

Format all substrings, matching given regex, with the specified format. The result is a modified copy of the input. It is returned as a sequence or copied to the output iterator.

diff --git a/doc/html/boost/algorithm/replace_first.html b/doc/html/boost/algorithm/replace_first.html index 5f4c99d13b..d955238793 100644 --- a/doc/html/boost/algorithm/replace_first.html +++ b/doc/html/boost/algorithm/replace_first.html @@ -37,7 +37,7 @@ void replace_first(SequenceT & Input, const Range1T & Search, const Range2T & Format);

-

Description

+

Description

replace the first match of the search substring in the input with the format string. The input sequence is modified in-place.

diff --git a/doc/html/boost/algorithm/replace_first_copy.html b/doc/html/boost/algorithm/replace_first_copy.html index 4fc99e7f3c..176a64efb0 100644 --- a/doc/html/boost/algorithm/replace_first_copy.html +++ b/doc/html/boost/algorithm/replace_first_copy.html @@ -43,7 +43,7 @@ const Range1T & Search, const Range2T & Format);
-

Description

+

Description

Replace the first match of the search substring in the input with the format string. The result is a modified copy of the input. It is returned as a sequence or copied to the output iterator.

diff --git a/doc/html/boost/algorithm/replace_head.html b/doc/html/boost/algorithm/replace_head.html index ad30a58624..f9d12ce74a 100644 --- a/doc/html/boost/algorithm/replace_head.html +++ b/doc/html/boost/algorithm/replace_head.html @@ -36,7 +36,7 @@ template<typename SequenceT, typename RangeT> void replace_head(SequenceT & Input, int N, const RangeT & Format);

-

Description

+

Description

Replace the head of the input with the given format string. The head is a prefix of a string of given size. If the sequence is shorter then required, the whole string is considered to be the head. The input sequence is modified in-place.

diff --git a/doc/html/boost/algorithm/replace_head_copy.html b/doc/html/boost/algorithm/replace_head_copy.html index cca0e15a07..29ad3b8993 100644 --- a/doc/html/boost/algorithm/replace_head_copy.html +++ b/doc/html/boost/algorithm/replace_head_copy.html @@ -41,7 +41,7 @@ SequenceT replace_head_copy(const SequenceT & Input, int N, const RangeT & Format);
-

Description

+

Description

Replace the head of the input with the given format string. The head is a prefix of a string of given size. If the sequence is shorter then required, whole string if considered to be the head. The result is a modified copy of the input. It is returned as a sequence or copied to the output iterator.

diff --git a/doc/html/boost/algorithm/replace_last.html b/doc/html/boost/algorithm/replace_last.html index aa402bc9c1..f610762454 100644 --- a/doc/html/boost/algorithm/replace_last.html +++ b/doc/html/boost/algorithm/replace_last.html @@ -37,7 +37,7 @@ void replace_last(SequenceT & Input, const Range1T & Search, const Range2T & Format);

-

Description

+

Description

Replace the last match of the search string in the input with the format string. Input sequence is modified in-place.

diff --git a/doc/html/boost/algorithm/replace_last_copy.html b/doc/html/boost/algorithm/replace_last_copy.html index 26195567a3..a24e20f8d7 100644 --- a/doc/html/boost/algorithm/replace_last_copy.html +++ b/doc/html/boost/algorithm/replace_last_copy.html @@ -42,7 +42,7 @@ SequenceT replace_last_copy(const SequenceT & Input, const Range1T & Search, const Range2T & Format);
-

Description

+

Description

Replace the last match of the search string in the input with the format string. The result is a modified copy of the input. It is returned as a sequence or copied to the output iterator.

diff --git a/doc/html/boost/algorithm/replace_nth.html b/doc/html/boost/algorithm/replace_nth.html index 9a3be01962..92ddb4ab7a 100644 --- a/doc/html/boost/algorithm/replace_nth.html +++ b/doc/html/boost/algorithm/replace_nth.html @@ -37,7 +37,7 @@ void replace_nth(SequenceT & Input, const Range1T & Search, int Nth, const Range2T & Format);

-

Description

+

Description

Replace an Nth (zero-indexed) match of the search string in the input with the format string. Input sequence is modified in-place.

diff --git a/doc/html/boost/algorithm/replace_nth_copy.html b/doc/html/boost/algorithm/replace_nth_copy.html index d93c20c059..c9c5c0ac77 100644 --- a/doc/html/boost/algorithm/replace_nth_copy.html +++ b/doc/html/boost/algorithm/replace_nth_copy.html @@ -42,7 +42,7 @@ SequenceT replace_nth_copy(const SequenceT & Input, const Range1T & Search, int Nth, const Range2T & Format);
-

Description

+

Description

Replace an Nth (zero-indexed) match of the search string in the input with the format string. The result is a modified copy of the input. It is returned as a sequence or copied to the output iterator.

diff --git a/doc/html/boost/algorithm/replace_range.html b/doc/html/boost/algorithm/replace_range.html index 522183b9e8..2b40d899f6 100644 --- a/doc/html/boost/algorithm/replace_range.html +++ b/doc/html/boost/algorithm/replace_range.html @@ -38,7 +38,7 @@ const iterator_range< typename range_iterator< SequenceT >::type > & SearchRange, const RangeT & Format);

-

Description

+

Description

Replace the given range in the input string. The input sequence is modified in-place.

diff --git a/doc/html/boost/algorithm/replace_range_copy.html b/doc/html/boost/algorithm/replace_range_copy.html index 843b2edf04..a353e8d40a 100644 --- a/doc/html/boost/algorithm/replace_range_copy.html +++ b/doc/html/boost/algorithm/replace_range_copy.html @@ -43,7 +43,7 @@ const iterator_range< typename range_const_iterator< SequenceT >::type > & SearchRange, const RangeT & Format);
-

Description

+

Description

Replace the given range in the input string. The result is a modified copy of the input. It is returned as a sequence or copied to the output iterator.

diff --git a/doc/html/boost/algorithm/replace_regex.html b/doc/html/boost/algorithm/replace_regex.html index e0732ed3d3..565fd71b07 100644 --- a/doc/html/boost/algorithm/replace_regex.html +++ b/doc/html/boost/algorithm/replace_regex.html @@ -40,7 +40,7 @@ const std::basic_string< CharT, FormatStringTraitsT, FormatStringAllocatorT > & Format, match_flag_type Flags = match_default|format_default);

-

Description

+

Description

Search for a substring matching given regex and format it with the specified format. The input string is modified in-place.

diff --git a/doc/html/boost/algorithm/replace_regex_copy.html b/doc/html/boost/algorithm/replace_regex_copy.html index 85afe7842d..c9e77dae06 100644 --- a/doc/html/boost/algorithm/replace_regex_copy.html +++ b/doc/html/boost/algorithm/replace_regex_copy.html @@ -48,7 +48,7 @@ const std::basic_string< CharT, FormatStringTraitsT, FormatStringAllocatorT > & Format, match_flag_type Flags = match_default|format_default);
-

Description

+

Description

Search for a substring matching given regex and format it with the specified format. The result is a modified copy of the input. It is returned as a sequence or copied to the output iterator.

diff --git a/doc/html/boost/algorithm/replace_tail.html b/doc/html/boost/algorithm/replace_tail.html index 0b95779e69..1dd1bab4c0 100644 --- a/doc/html/boost/algorithm/replace_tail.html +++ b/doc/html/boost/algorithm/replace_tail.html @@ -36,7 +36,7 @@ template<typename SequenceT, typename RangeT> void replace_tail(SequenceT & Input, int N, const RangeT & Format);

-

Description

+

Description

Replace the tail of the input with the given format sequence. The tail is a suffix of a string of given size. If the sequence is shorter then required, the whole string is considered to be the tail. The input sequence is modified in-place.

diff --git a/doc/html/boost/algorithm/replace_tail_copy.html b/doc/html/boost/algorithm/replace_tail_copy.html index a73aa88a9b..8dd1c136d1 100644 --- a/doc/html/boost/algorithm/replace_tail_copy.html +++ b/doc/html/boost/algorithm/replace_tail_copy.html @@ -41,7 +41,7 @@ SequenceT replace_tail_copy(const SequenceT & Input, int N, const RangeT & Format);
-

Description

+

Description

Replace the tail of the input with the given format string. The tail is a suffix of a string of given size. If the sequence is shorter then required, whole string is considered to be the tail. The result is a modified copy of the input. It is returned as a sequence or copied to the output iterator.

diff --git a/doc/html/boost/algorithm/split_idp419821760.html b/doc/html/boost/algorithm/split_idp419821760.html deleted file mode 100644 index 67814b970e..0000000000 --- a/doc/html/boost/algorithm/split_idp419821760.html +++ /dev/null @@ -1,113 +0,0 @@ - - - - -Function template split - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-

-
-PrevUpHomeNext -
-
-
-
-

Function template split

-

boost::algorithm::split — Split algorithm.

-
-

Synopsis

-
// In header: <boost/algorithm/string/split.hpp>
-
-
-template<typename SequenceSequenceT, typename RangeT, typename PredicateT> 
-  SequenceSequenceT & 
-  split(SequenceSequenceT & Result, RangeT & Input, PredicateT Pred, 
-        token_compress_mode_type eCompress = token_compress_off);
-
-

Description

-

Tokenize expression. This function is equivalent to C strtok. Input sequence is split into tokens, separated by separators. Separators are given by means of the predicate.

-

Each part is copied and added as a new element to the output container. Thus the result container must be able to hold copies of the matches (in a compatible structure like std::string) or a reference to it (e.g. using the iterator range class). Examples of such a container are std::vector<std::string> or std::list<boost::iterator_range<std::string::iterator>>

-

- -

-
- - - - - -
[Note]Note
-

Prior content of the result will be overwritten.

-

This function provides the strong exception-safety guarantee

-
-

-

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

Parameters:

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

Input

A container which will be searched.

Pred

A predicate to identify separators. This predicate is supposed to return true if a given element is a separator.

Result

A container that can hold copies of references to the substrings

eCompress

If eCompress argument is set to token_compress_on, adjacent separators are merged together. Otherwise, every two separators delimit a token.

Returns:

A reference the result

-
-
- - - -
Copyright © 2002-2004 Pavol Droba

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/algorithm/split_idp441369712.html b/doc/html/boost/algorithm/split_idp441369712.html new file mode 100644 index 0000000000..1a7a6615ed --- /dev/null +++ b/doc/html/boost/algorithm/split_idp441369712.html @@ -0,0 +1,113 @@ + + + + +Function template split + + + + + + + + + + + + + + + +
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
+
+
+PrevUpHomeNext +
+
+
+
+

Function template split

+

boost::algorithm::split — Split algorithm.

+
+

Synopsis

+
// In header: <boost/algorithm/string/split.hpp>
+
+
+template<typename SequenceSequenceT, typename RangeT, typename PredicateT> 
+  SequenceSequenceT & 
+  split(SequenceSequenceT & Result, RangeT & Input, PredicateT Pred, 
+        token_compress_mode_type eCompress = token_compress_off);
+
+

Description

+

Tokenize expression. This function is equivalent to C strtok. Input sequence is split into tokens, separated by separators. Separators are given by means of the predicate.

+

Each part is copied and added as a new element to the output container. Thus the result container must be able to hold copies of the matches (in a compatible structure like std::string) or a reference to it (e.g. using the iterator range class). Examples of such a container are std::vector<std::string> or std::list<boost::iterator_range<std::string::iterator>>

+

+ +

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

Prior content of the result will be overwritten.

+

This function provides the strong exception-safety guarantee

+
+

+

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

Parameters:

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

Input

A container which will be searched.

Pred

A predicate to identify separators. This predicate is supposed to return true if a given element is a separator.

Result

A container that can hold copies of references to the substrings

eCompress

If eCompress argument is set to token_compress_on, adjacent separators are merged together. Otherwise, every two separators delimit a token.

Returns:

A reference the result

+
+
+ + + +
Copyright © 2002-2004 Pavol Droba

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/algorithm/split_iterator.html b/doc/html/boost/algorithm/split_iterator.html index 71c03d2814..d3d7a3f9a3 100644 --- a/doc/html/boost/algorithm/split_iterator.html +++ b/doc/html/boost/algorithm/split_iterator.html @@ -37,33 +37,33 @@ { public: // construct/copy/destruct - split_iterator(); - split_iterator(const split_iterator &); - template<typename FinderT> split_iterator(IteratorT, IteratorT, FinderT); + split_iterator(); + split_iterator(const split_iterator &); + template<typename FinderT> split_iterator(IteratorT, IteratorT, FinderT); template<typename FinderT, typename RangeT> - split_iterator(RangeT &, FinderT); + split_iterator(RangeT &, FinderT); - // public member functions - bool eof() const; + // public member functions + bool eof() const; - // private member functions - const match_type & dereference() const; - void increment(); - bool equal(const split_iterator &) const; + // private member functions + const match_type & dereference() const; + void increment(); + bool equal(const split_iterator &) const; };
-

Description

+

Description

Split iterator encapsulates a Finder and allows for incremental searching in a string. Unlike the find iterator, split iterator iterates through gaps between matches.

Find iterator is a readable forward traversal iterator.

Dereferencing the iterator yields an iterator_range delimiting the current match.

-

+

split_iterator public construct/copy/destruct

  1. -
    split_iterator();
    Default constructor.

    Construct null iterator. All null iterators are equal.

    +
    split_iterator();
    Default constructor.

    Construct null iterator. All null iterators are equal.

    @@ -78,32 +78,32 @@
  2. -
    split_iterator(const split_iterator & Other);
    Copy constructor.

    Construct a copy of the split_iterator

    +
    split_iterator(const split_iterator & Other);
    Copy constructor.

    Construct a copy of the split_iterator 

  3. template<typename FinderT> 
-  split_iterator(IteratorT Begin, IteratorT End, FinderT Finder);
    Constructor.

    Construct new split_iterator for a given finder and a range.

    + split_iterator(IteratorT Begin, IteratorT End, FinderT Finder);Constructor.

    Construct new split_iterator for a given finder and a range. 

  4. template<typename FinderT, typename RangeT> 
-  split_iterator(RangeT & Col, FinderT Finder);
    Constructor.

    Construct new split_iterator for a given finder and a collection.

    + split_iterator(RangeT & Col, FinderT Finder);Constructor.

    Construct new split_iterator for a given finder and a collection.

-

-split_iterator public member functions

+

+split_iterator public member functions

  1. -
    bool eof() const;
    Eof check.

    Check the eof condition. Eof condition means that there is nothing more to be searched i.e. find_iterator is after the last match.

    +
    bool eof() const;
    Eof check.

    Check the eof condition. Eof condition means that there is nothing more to be searched i.e. find_iterator is after the last match.

-

-split_iterator private member functions

+

+split_iterator private member functions

    -
  1. const match_type & dereference() const;
    2. -
  2. void increment();
    3. -
  3. bool equal(const split_iterator & Other) const;
    4. +
  4. const match_type & dereference() const;
    5. +
  5. void increment();
    6. +
  6. bool equal(const split_iterator & Other) const;
diff --git a/doc/html/boost/algorithm/split_regex.html b/doc/html/boost/algorithm/split_regex.html index 8163fd3fd5..5224c21019 100644 --- a/doc/html/boost/algorithm/split_regex.html +++ b/doc/html/boost/algorithm/split_regex.html @@ -8,7 +8,7 @@ - + @@ -21,7 +21,7 @@
-PrevUpHomeNext +PrevUpHomeNext
@@ -40,7 +40,7 @@ const basic_regex< CharT, RegexTraitsT > & Rx, match_flag_type Flags = match_default);
-

Description

+

Description

Tokenize expression. This function is equivalent to C strtok. Input sequence is split into tokens, separated by separators. Separator is an every match of the given regex. Each part is copied and added as a new element to the output container. Thus the result container must be able to hold copies of the matches (in a compatible structure like std::string) or a reference to it (e.g. using the iterator range class). Examples of such a container are std::vector<std::string> or std::list<boost::iterator_range<std::string::iterator>>

@@ -108,7 +108,7 @@

-PrevUpHomeNext +PrevUpHomeNext
diff --git a/doc/html/boost/algorithm/starts_with.html b/doc/html/boost/algorithm/starts_with.html index bd04417aab..a3d8691f37 100644 --- a/doc/html/boost/algorithm/starts_with.html +++ b/doc/html/boost/algorithm/starts_with.html @@ -7,7 +7,7 @@ - + @@ -21,7 +21,7 @@
-PrevUpHomeNext +PrevUpHomeNext
@@ -39,7 +39,7 @@ template<typename Range1T, typename Range2T> bool starts_with(const Range1T & Input, const Range2T & Test);
-

Description

+

Description

This predicate holds when the test string is a prefix of the Input. In other words, if the input starts with the test. When the optional predicate is specified, it is used for character-wise comparison.

@@ -100,7 +100,7 @@

-PrevUpHomeNext +PrevUpHomeNext
diff --git a/doc/html/boost/algorithm/tail_finder.html b/doc/html/boost/algorithm/tail_finder.html index 957b8d9e75..b9104681cf 100644 --- a/doc/html/boost/algorithm/tail_finder.html +++ b/doc/html/boost/algorithm/tail_finder.html @@ -35,7 +35,7 @@ unspecified tail_finder(int N);
-

Description

+

Description

Construct the tail_finder. The finder returns a tail of a given input. The tail is a suffix of a string up to n elements in size. If an input has less then n elements, whole input is considered a head. The result is given as an iterator_range delimiting the match.

diff --git a/doc/html/boost/algorithm/to_lower.html b/doc/html/boost/algorithm/to_lower.html index 956643977d..683ec2abdc 100644 --- a/doc/html/boost/algorithm/to_lower.html +++ b/doc/html/boost/algorithm/to_lower.html @@ -37,7 +37,7 @@ void to_lower(WritableRangeT & Input, const std::locale & Loc = std::locale());

-

Description

+

Description

Each element of the input sequence is converted to lower case. The input sequence is modified in-place.

diff --git a/doc/html/boost/algorithm/to_lower_copy.html b/doc/html/boost/algorithm/to_lower_copy.html index 4c9428cc48..29c8a29145 100644 --- a/doc/html/boost/algorithm/to_lower_copy.html +++ b/doc/html/boost/algorithm/to_lower_copy.html @@ -41,7 +41,7 @@ SequenceT to_lower_copy(const SequenceT & Input, const std::locale & Loc = std::locale());
-

Description

+

Description

Each element of the input sequence is converted to lower case. The result is a copy of the input converted to lower case. It is returned as a sequence or copied to the output iterator.

diff --git a/doc/html/boost/algorithm/to_upper.html b/doc/html/boost/algorithm/to_upper.html index 4cbc2b0820..8212062e5c 100644 --- a/doc/html/boost/algorithm/to_upper.html +++ b/doc/html/boost/algorithm/to_upper.html @@ -37,7 +37,7 @@ void to_upper(WritableRangeT & Input, const std::locale & Loc = std::locale());

-

Description

+

Description

Each element of the input sequence is converted to upper case. The input sequence is modified in-place.

diff --git a/doc/html/boost/algorithm/to_upper_copy.html b/doc/html/boost/algorithm/to_upper_copy.html index c7b9e023da..39aabe5c82 100644 --- a/doc/html/boost/algorithm/to_upper_copy.html +++ b/doc/html/boost/algorithm/to_upper_copy.html @@ -41,7 +41,7 @@ SequenceT to_upper_copy(const SequenceT & Input, const std::locale & Loc = std::locale());
-

Description

+

Description

Each element of the input sequence is converted to upper case. The result is a copy of the input converted to upper case. It is returned as a sequence or copied to the output iterator

diff --git a/doc/html/boost/algorithm/token_compress_mode_type.html b/doc/html/boost/algorithm/token_compress_mode_type.html index 49002173ab..bac3a42a0c 100644 --- a/doc/html/boost/algorithm/token_compress_mode_type.html +++ b/doc/html/boost/algorithm/token_compress_mode_type.html @@ -35,7 +35,7 @@ enum token_compress_mode_type { token_compress_on, token_compress_off };

-

Description

+

Description

Specifies token compression mode for the token_finder.

token_compress_on
diff --git a/doc/html/boost/algorithm/token_finder.html b/doc/html/boost/algorithm/token_finder.html index c5df2e53d6..3650099870 100644 --- a/doc/html/boost/algorithm/token_finder.html +++ b/doc/html/boost/algorithm/token_finder.html @@ -37,7 +37,7 @@ unspecified token_finder(PredicateT Pred, token_compress_mode_type eCompress = token_compress_off);
-

Description

+

Description

Construct the token_finder. The finder searches for a token specified by a predicate. It is similar to std::find_if algorithm, with an exception that it return a range of instead of a single iterator.

If "compress token mode" is enabled, adjacent matching tokens are concatenated into one match. Thus the finder can be used to search for continuous segments of characters satisfying the given predicate.

The result is given as an iterator_range delimiting the match.

diff --git a/doc/html/boost/algorithm/trim.html b/doc/html/boost/algorithm/trim.html index 3f2845a606..0399bed40b 100644 --- a/doc/html/boost/algorithm/trim.html +++ b/doc/html/boost/algorithm/trim.html @@ -36,7 +36,7 @@ template<typename SequenceT> void trim(SequenceT & Input, const std::locale & Loc = std::locale());
-

Description

+

Description

Remove all leading and trailing spaces from the input. The input sequence is modified in-place.

diff --git a/doc/html/boost/algorithm/trim_all.html b/doc/html/boost/algorithm/trim_all.html index 4fef18621b..9d892e19a4 100644 --- a/doc/html/boost/algorithm/trim_all.html +++ b/doc/html/boost/algorithm/trim_all.html @@ -36,7 +36,7 @@ template<typename SequenceT> void trim_all(SequenceT & Input, const std::locale & Loc = std::locale());
-

Description

+

Description

Remove all leading and trailing spaces from the input and compress all other spaces to a single character. The input sequence is modified in-place.

diff --git a/doc/html/boost/algorithm/trim_all_copy.html b/doc/html/boost/algorithm/trim_all_copy.html index 0527ee2d52..35ca09b108 100644 --- a/doc/html/boost/algorithm/trim_all_copy.html +++ b/doc/html/boost/algorithm/trim_all_copy.html @@ -37,7 +37,7 @@ SequenceT trim_all_copy(const SequenceT & Input, const std::locale & Loc = std::locale());

-

Description

+

Description

Remove all leading and trailing spaces from the input and compress all other spaces to a single character. The result is a trimmed copy of the input

diff --git a/doc/html/boost/algorithm/trim_all_copy_if.html b/doc/html/boost/algorithm/trim_all_copy_if.html index 64dc5d4734..e16bf860f1 100644 --- a/doc/html/boost/algorithm/trim_all_copy_if.html +++ b/doc/html/boost/algorithm/trim_all_copy_if.html @@ -36,7 +36,7 @@ template<typename SequenceT, typename PredicateT> SequenceT trim_all_copy_if(const SequenceT & Input, PredicateT IsSpace);

-

Description

+

Description

Remove all leading and trailing spaces from the input and compress all other spaces to a single character. The result is a trimmed copy of the input

diff --git a/doc/html/boost/algorithm/trim_all_if.html b/doc/html/boost/algorithm/trim_all_if.html index 85f85d4f3c..34f11962ca 100644 --- a/doc/html/boost/algorithm/trim_all_if.html +++ b/doc/html/boost/algorithm/trim_all_if.html @@ -36,7 +36,7 @@ template<typename SequenceT, typename PredicateT> void trim_all_if(SequenceT & Input, PredicateT IsSpace);

-

Description

+

Description

Remove all leading and trailing spaces from the input and compress all other spaces to a single character. The input sequence is modified in-place.

diff --git a/doc/html/boost/algorithm/trim_copy.html b/doc/html/boost/algorithm/trim_copy.html index 8747fc32c9..2ea96ac105 100644 --- a/doc/html/boost/algorithm/trim_copy.html +++ b/doc/html/boost/algorithm/trim_copy.html @@ -37,7 +37,7 @@ SequenceT trim_copy(const SequenceT & Input, const std::locale & Loc = std::locale());
-

Description

+

Description

Remove all leading and trailing spaces from the input. The result is a trimmed copy of the input

diff --git a/doc/html/boost/algorithm/trim_copy_if.html b/doc/html/boost/algorithm/trim_copy_if.html index 22dacc7d73..19aae7fd9f 100644 --- a/doc/html/boost/algorithm/trim_copy_if.html +++ b/doc/html/boost/algorithm/trim_copy_if.html @@ -40,7 +40,7 @@ template<typename SequenceT, typename PredicateT> SequenceT trim_copy_if(const SequenceT & Input, PredicateT IsSpace);

-

Description

+

Description

Remove all trailing and leading spaces from the input. The supplied predicate is used to determine which characters are considered spaces. The result is a trimmed copy of the input. It is returned as a sequence or copied to the output iterator

diff --git a/doc/html/boost/algorithm/trim_fill.html b/doc/html/boost/algorithm/trim_fill.html index 0833a7ec64..b14b607f32 100644 --- a/doc/html/boost/algorithm/trim_fill.html +++ b/doc/html/boost/algorithm/trim_fill.html @@ -37,7 +37,7 @@ void trim_fill(SequenceT & Input, const RangeT & Fill, const std::locale & Loc = std::locale());

-

Description

+

Description

Remove all leading and trailing spaces from the input and replace all every block of consecutive spaces with a fill string defined by user. The input sequence is modified in-place.

diff --git a/doc/html/boost/algorithm/trim_fill_copy.html b/doc/html/boost/algorithm/trim_fill_copy.html index 6a8554ecb5..477d20eaa3 100644 --- a/doc/html/boost/algorithm/trim_fill_copy.html +++ b/doc/html/boost/algorithm/trim_fill_copy.html @@ -37,7 +37,7 @@ SequenceT trim_fill_copy(const SequenceT & Input, const RangeT & Fill, const std::locale & Loc = std::locale());

-

Description

+

Description

Remove all leading and trailing spaces from the input and replace all every block of consecutive spaces with a fill string defined by user. The result is a trimmed copy of the input

diff --git a/doc/html/boost/algorithm/trim_fill_copy_if.html b/doc/html/boost/algorithm/trim_fill_copy_if.html index 2dff969091..7992ae54d9 100644 --- a/doc/html/boost/algorithm/trim_fill_copy_if.html +++ b/doc/html/boost/algorithm/trim_fill_copy_if.html @@ -37,7 +37,7 @@ SequenceT trim_fill_copy_if(const SequenceT & Input, const RangeT & Fill, PredicateT IsSpace);

-

Description

+

Description

Remove all leading and trailing spaces from the input and replace all every block of consecutive spaces with a fill string defined by user. The result is a trimmed copy of the input

diff --git a/doc/html/boost/algorithm/trim_fill_if.html b/doc/html/boost/algorithm/trim_fill_if.html index 4eb5a1ae30..90492da93d 100644 --- a/doc/html/boost/algorithm/trim_fill_if.html +++ b/doc/html/boost/algorithm/trim_fill_if.html @@ -37,7 +37,7 @@ void trim_fill_if(SequenceT & Input, const RangeT & Fill, PredicateT IsSpace);

-

Description

+

Description

Remove all leading and trailing spaces from the input and replace all every block of consecutive spaces with a fill string defined by user. The input sequence is modified in-place.

diff --git a/doc/html/boost/algorithm/trim_if.html b/doc/html/boost/algorithm/trim_if.html index af0eaf581a..1ec8eaa97c 100644 --- a/doc/html/boost/algorithm/trim_if.html +++ b/doc/html/boost/algorithm/trim_if.html @@ -36,7 +36,7 @@ template<typename SequenceT, typename PredicateT> void trim_if(SequenceT & Input, PredicateT IsSpace);
-

Description

+

Description

Remove all leading and trailing spaces from the input. The supplied predicate is used to determine which characters are considered spaces. The input sequence is modified in-place.

diff --git a/doc/html/boost/algorithm/trim_left.html b/doc/html/boost/algorithm/trim_left.html index 08fb6fcdb2..b41805e390 100644 --- a/doc/html/boost/algorithm/trim_left.html +++ b/doc/html/boost/algorithm/trim_left.html @@ -36,7 +36,7 @@ template<typename SequenceT> void trim_left(SequenceT & Input, const std::locale & Loc = std::locale());
-

Description

+

Description

Remove all leading spaces from the input. The Input sequence is modified in-place.

diff --git a/doc/html/boost/algorithm/trim_left_copy.html b/doc/html/boost/algorithm/trim_left_copy.html index 1e38a54cdf..51773d5095 100644 --- a/doc/html/boost/algorithm/trim_left_copy.html +++ b/doc/html/boost/algorithm/trim_left_copy.html @@ -37,7 +37,7 @@ SequenceT trim_left_copy(const SequenceT & Input, const std::locale & Loc = std::locale());
-

Description

+

Description

Remove all leading spaces from the input. The result is a trimmed copy of the input.

diff --git a/doc/html/boost/algorithm/trim_left_copy_if.html b/doc/html/boost/algorithm/trim_left_copy_if.html index 5a72662871..cdac048bbb 100644 --- a/doc/html/boost/algorithm/trim_left_copy_if.html +++ b/doc/html/boost/algorithm/trim_left_copy_if.html @@ -7,7 +7,7 @@ - + @@ -21,7 +21,7 @@

-PrevUpHomeNext +PrevUpHomeNext
@@ -40,7 +40,7 @@ template<typename SequenceT, typename PredicateT> SequenceT trim_left_copy_if(const SequenceT & Input, PredicateT IsSpace);
-

Description

+

Description

Remove all leading spaces from the input. The supplied predicate is used to determine which characters are considered spaces. The result is a trimmed copy of the input. It is returned as a sequence or copied to the output iterator

@@ -101,7 +101,7 @@

-PrevUpHomeNext +PrevUpHomeNext
diff --git a/doc/html/boost/algorithm/trim_left_if.html b/doc/html/boost/algorithm/trim_left_if.html index 31a4978353..64dadb3ca7 100644 --- a/doc/html/boost/algorithm/trim_left_if.html +++ b/doc/html/boost/algorithm/trim_left_if.html @@ -36,7 +36,7 @@ template<typename SequenceT, typename PredicateT> void trim_left_if(SequenceT & Input, PredicateT IsSpace);
-

Description

+

Description

Remove all leading spaces from the input. The supplied predicate is used to determine which characters are considered spaces. The input sequence is modified in-place.

diff --git a/doc/html/boost/algorithm/trim_right.html b/doc/html/boost/algorithm/trim_right.html index 304c1e1602..d5fd3f6c2c 100644 --- a/doc/html/boost/algorithm/trim_right.html +++ b/doc/html/boost/algorithm/trim_right.html @@ -36,7 +36,7 @@ template<typename SequenceT> void trim_right(SequenceT & Input, const std::locale & Loc = std::locale());
-

Description

+

Description

Remove all trailing spaces from the input. The input sequence is modified in-place.

diff --git a/doc/html/boost/algorithm/trim_right_copy.html b/doc/html/boost/algorithm/trim_right_copy.html index 0025be6a02..f8fa484785 100644 --- a/doc/html/boost/algorithm/trim_right_copy.html +++ b/doc/html/boost/algorithm/trim_right_copy.html @@ -37,7 +37,7 @@ SequenceT trim_right_copy(const SequenceT & Input, const std::locale & Loc = std::locale());
-

Description

+

Description

Remove all trailing spaces from the input. The result is a trimmed copy of the input

diff --git a/doc/html/boost/algorithm/trim_right_copy_if.html b/doc/html/boost/algorithm/trim_right_copy_if.html index 0beb90e3ce..390bb1df4e 100644 --- a/doc/html/boost/algorithm/trim_right_copy_if.html +++ b/doc/html/boost/algorithm/trim_right_copy_if.html @@ -40,7 +40,7 @@ template<typename SequenceT, typename PredicateT> SequenceT trim_right_copy_if(const SequenceT & Input, PredicateT IsSpace);

-

Description

+

Description

Remove all trailing spaces from the input. The supplied predicate is used to determine which characters are considered spaces. The result is a trimmed copy of the input. It is returned as a sequence or copied to the output iterator

diff --git a/doc/html/boost/algorithm/trim_right_if.html b/doc/html/boost/algorithm/trim_right_if.html index a9eb52d35c..effad6aa60 100644 --- a/doc/html/boost/algorithm/trim_right_if.html +++ b/doc/html/boost/algorithm/trim_right_if.html @@ -36,7 +36,7 @@ template<typename SequenceT, typename PredicateT> void trim_right_if(SequenceT & Input, PredicateT IsSpace);

-

Description

+

Description

Remove all trailing spaces from the input. The supplied predicate is used to determine which characters are considered spaces. The input sequence is modified in-place.

diff --git a/doc/html/boost/algorithm/unhex_idp423172128.html b/doc/html/boost/algorithm/unhex_idp423172128.html deleted file mode 100644 index 83c1fd5e51..0000000000 --- a/doc/html/boost/algorithm/unhex_idp423172128.html +++ /dev/null @@ -1,103 +0,0 @@ - - - - -Function template unhex - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Function template unhex

-

boost::algorithm::unhex — Converts a sequence of hexadecimal characters into a sequence of integers.

-
-

Synopsis

-
// In header: <boost/algorithm/hex.hpp>
-
-
-template<typename InputIterator, typename OutputIterator> 
-  OutputIterator 
-  unhex(InputIterator first, InputIterator last, OutputIterator out);
-
-

Description

-

- -

-
- - - - - -
[Note]Note

Based on the MySQL function of the same name

-

-

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

Parameters:

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

first

The start of the input sequence

last

One past the end of the input sequence

out

An output iterator to the results into

Returns:

The updated output iterator

-
-
- - - -
Copyright © 2010-2012 Marshall Clow

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

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/algorithm/unhex_idp423178688.html b/doc/html/boost/algorithm/unhex_idp423178688.html deleted file mode 100644 index 4bf9f2b04a..0000000000 --- a/doc/html/boost/algorithm/unhex_idp423178688.html +++ /dev/null @@ -1,98 +0,0 @@ - - - - -Function template unhex - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Function template unhex

-

boost::algorithm::unhex — Converts a sequence of hexadecimal characters into a sequence of integers.

-
-

Synopsis

-
// In header: <boost/algorithm/hex.hpp>
-
-
-template<typename T, typename OutputIterator> 
-  OutputIterator unhex(const T * ptr, OutputIterator out);
-
-

Description

-

- -

-
- - - - - -
[Note]Note

Based on the MySQL function of the same name

-

-

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

Parameters:

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

out

An output iterator to the results into

ptr

A pointer to a null-terminated input sequence.

Returns:

The updated output iterator

-
-
- - - -
Copyright © 2010-2012 Marshall Clow

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

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/algorithm/unhex_idp423184240.html b/doc/html/boost/algorithm/unhex_idp423184240.html deleted file mode 100644 index 380c1e2009..0000000000 --- a/doc/html/boost/algorithm/unhex_idp423184240.html +++ /dev/null @@ -1,98 +0,0 @@ - - - - -Function template unhex - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Function template unhex

-

boost::algorithm::unhex — Converts a sequence of hexadecimal characters into a sequence of integers.

-
-

Synopsis

-
// In header: <boost/algorithm/hex.hpp>
-
-
-template<typename Range, typename OutputIterator> 
-  OutputIterator unhex(const Range & r, OutputIterator out);
-
-

Description

-

- -

-
- - - - - -
[Note]Note

Based on the MySQL function of the same name

-

-

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

Parameters:

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

out

An output iterator to the results into

r

The input range

Returns:

The updated output iterator

-
-
- - - -
Copyright © 2010-2012 Marshall Clow

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

-
-
-
-PrevUpHomeNext -
- - diff --git a/doc/html/boost/algorithm/unhex_idp423196976.html b/doc/html/boost/algorithm/unhex_idp423196976.html deleted file mode 100644 index 1e79897129..0000000000 --- a/doc/html/boost/algorithm/unhex_idp423196976.html +++ /dev/null @@ -1,82 +0,0 @@ - - - - -Function template unhex - - - - - - - - - - - - - - - -
Boost C++ LibrariesHomeLibrariesPeopleFAQMore
-
-
-PrevUpHomeNext -
-
-
-
-

Function template unhex

-

boost::algorithm::unhex — Converts a sequence of hexadecimal characters into a sequence of characters.

-
-

Synopsis

-
// In header: <boost/algorithm/hex.hpp>
-
-
-template<typename String> String unhex(const String & input);
-
-

Description

-

- -

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

Parameters:

---- - - - - -

input

A container to be converted

Returns:

A container with the decoded text

-
-
- - - -
Copyright © 2010-2012 Marshall Clow

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

-
-
-
-PrevUpHomeNext -
- - -- cgit v1.2.3